Next: Quadtrees, Previous: Queues, Up: Data Structures [Contents][Index]
The (chickadee data heap)
module provides a binary heap data
structure. The heap orders data from smallest to largest, according
to a custom comparison predicate, making it a good choice for priority
queues.
Return a new heap that uses the predicate < to determine order.
Return #t
if obj is a heap.
Return #t
if heap is empty.
Return the current size of heap.
Return the minimum item in heap.
Add item to heap.
Remove the minimum item in heap.
Remove all items from heap.