naga.queue — naga 0.1.0

Defines a Queue structure that can be added to the tail, and removed from the head. Anything already in the queue (compared by ID) will not be added again, but a function can be provided that will update the element when it is already present. Includes a 'salience' which allows elements to be promoted through the queue ahead of less salient elements.

drain clj

(drain queue)

Pulls everything off a queue into a seq.

insert-by clj

(insert-by s salience e)

Inputs: [s :- [s/Any] salience :- (=> s/Num s/Any) e :- s/Any] Returns: [s/Any]

new-queue clj

(new-queue)

(new-queue salience-fn id-fn)

Inputs: ([] [salience-fn :- (=> s/Num s/Any) id-fn :- (=> s/Any s/Any)])

Create an empty queue. When called without arguments, salience is ignored, and update and ID are just identity.

PQueue clj protocol

add clj

(add queue element)

(add queue update-fn element)

Adds an element to the queue if it isn't already present, returning the new queue. Uses update-fn on the element if it is already in the queue

head clj

(head queue)

Returns the head of the queue

pop clj

(pop queue)

Removes the head from the queue

q-count clj

(q-count queue)

Returns the number of items in the queue