editscript.util.pairing

Liking cljdoc? Tell your friends :D

Mostly clj/s.
Exceptions indicated.

HeapNode^cljs
IHeapNode^clj/s≠
insert
merge-nodes
priority-map
PriorityMap^cljs
two-pass

HeapNode^cljs

IHeapNode^clj/s≠protocol

set-right^clj/s

(set-right this right)

Set the right sibling

Set the right sibling

get-left^clj/s

(get-left this)

Get the left child node

Get the left child node

add-child^clj/s

(add-child this node)

Add a child to a node

Add a child to a node

get-right^clj/s

(get-right this)

Get the right sibling node

Get the right sibling node

source

insert^clj/s

(insert node item priority)

source

merge-nodes^clj/s

(merge-nodes a b)

source

priority-map^clj/s

(priority-map)

(priority-map & keyvals)

A priority queue that also functions as a map. Backed by a pairing heap implementation, and a regular map. NB. We do not implement decrease-key for the pairing heap, instead just insert the item again with a new priority.

A priority queue that also functions as a map.
Backed by a pairing heap implementation, and a regular map.
NB. We do not implement `decrease-key` for the pairing heap,
instead just insert the item again with a new priority.

source raw docstring