Template Heap
a max heap index
template Heap(alias KeyFromValue, alias Compare)
;
Contained Variables
| Name | Type | Description |
|---|---|---|
| _heap | MultiIndexContainer |
Contained Functions
| Name | Description |
|---|---|
| _Check | |
| _ClearIndex | |
| _FixPosition | |
| _Insert | |
| _invariant | |
| _NodePosition | |
| _NotifyChange | |
| _PositionFixable | |
| _Remove | |
| back | |
| capacity | Returns the capacity of the index, which is the length of the underlying store |
| clear | ?? |
| empty | Property returning true if and only if the container has no
elements.
|
| fromNode | |
| front | |
| insert | Inserts value into this heap, unless another index refuses it. |
| insert | |
| isLe | |
| l | |
| length | Returns the number of elements in the container. |
| modify | Perform mod on elements of r and performs any necessary fixups to container's indeces. If the result of mod violates any index' invariant, r.front is removed from the container. |
| opSlice | Fetch a range that spans all the elements in the container. |
| p | |
| printHeap | |
| printHeap1 | |
| r | |
| remove | Removes the given range from the container. |
| removeBack | removes the back of this index from the container. Why would you do this? No idea. |
| removeFront | Removes the max element of this index from the container. |
| replace | Replaces value at r with value |
| reserve | Ensures sufficient capacity to accommodate n elements.
|
| sift | |
| swapAt | |
| toString0 |
Contained Structs
| Name | Description |
|---|---|
| HeapRangeT | The primary range of the index, which embodies a bidirectional range. Ends up performing a breadth first traversal (I think..) removeFront and removeBack are not possible. |
Contained Aliases
| Name | Description |
|---|---|
| ConstHeapRange | _ |
| HeapRange | _ |
| IndexTuple | |
| key | |
| KeyType | |
| less | |
| NodeTuple | |
| removeAny | Forwards to removeFront |