| Provides the base HSQLDB interface for Heap ADT implementations.
In this context, a Heap is simply a collection-like ADT that allows addition
of elements and provides a way to remove the least element, given some
implementation-dependent strategy for imposing an order over its
elements.
Typically, an HsqlHeap will be implemented as a tree-like structure that
recursively guarantees a Heap Invariant, such that all nodes below
the root are greater than the root, given some comparison stragegy.
This in turn provides the basis for an efficient implementation of ADTs such
PriorityQueue, since Heap operations using the typical implementation are,
in theory, guaranteed to be O(log n).
author:
boucherb@users
version:
1.7.2
since:
1.7.2 |