Question

I’d like to wrap java’s PriorityQueue class in clojure for use in another part of my program. What I’m trying to figure out is if there is any way to do this in a lispy manner and make the priority queue immutable. Are there any good ways to do this, or am I just going to be better off using the PriorityQueue as a mutable data structure?

Answer 1

I don’t think there is a simple way to wrap a mutable data structure as an immutable one. Immutable data structures become efficient when the new version can share data with the old version in clever ways, and I can’t really see how this can be done without access to the internals of PriorityQueue.

If you really want a persistent priority queue this thread might be interesting. Those seems to have linear-time inserts though, so if that is an issue maybe you have to look for another implementation.

Edit: On second thought, a simple implementation of a persistent priority queue is just to store the (prio, value)-pairs in a sorted set. Something like this:

(defn make-pqueue []   (sorted-set))  (defn pqueue-add [pq x prio]   (conj pq [prio x]))  (defn pqueue-peek [pq]   (first pq))  (defn pqueue-pop [pq]   (let [top (first pq)]     (disj pq top))) 

Of course, the code above is pretty limited (no multiple entries, for instance) but it illustrates the idea.