Heap

Classes

Heap(...)

A data structure that stores value-priority pairs and is optimized to access entries at the minimum and maximum priorities. Comparable to DS Priority Queues.

Note: This implementation does not place any guarantees on ordering for values of equal priority.

Ported Methods

• add(...): See ds_priority_add(id, val, priority).
• changePriority(...): See ds_priority_change_priority(id, val, priority).
• clear(): See ds_priority_clear(id).
• copy(sourceHeap): See ds_priority_copy(id, source).
• deleteMax(): See ds_priority_delete_max(id).
• deleteMin(): See ds_priority_delete_min(id).
• deleteValue(): See ds_priority_delete_value(id).
• empty(): See ds_priority_empty(id).
• findMax(): See ds_priority_find_max(id).
• findMin(): See ds_priority_find_min(id).
• findPriority(priority): See ds_priority_find_priority(id, priority).
• read(datastr): See ds_priority_read(id, str).
• size(): See ds_priority_size(id).
• write(): See ds_priority_write(id).

Aliases

• getMin(): Same as findMin().
• getMax(): Same as findMax().

New Methods

• clone(): Return a shallow clone of the heap.
• cloneDeep(): Same as clone(), but also making deep copies of everything in the heap.
• copyDeep(sourceHeap): Same as copy(sourceHeap), but with deep copies of everything in the source.