(set-right this right)Set the right sibling
Set the right sibling
(get-left this)Get the left child node
Get the left child node
(add-child this node)Add a child to a node
Add a child to a node
(get-right this)Get the right sibling node
Get the right sibling node
(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.
cljdoc builds & hosts documentation for Clojure/Script libraries
| Ctrl+k | Jump to recent docs |
| ← | Move to previous article |
| → | Move to next article |
| Ctrl+/ | Jump to the search field |