Ada implementation of heaps, an efficient sorting
queue data structure. Inserting and extracting of elements can be done in
O(log(n)).
Features
• Generic to allow all kinds of content.
• Private implementation: can't mess around with this.
• Small memory footprint: data stored in an array.
• Variable size.