Public Member Functions | |
ComponentInfoTopologicalSort (int capacity) throws IllegalArgumentException | |
ComponentInfoTopologicalSort (HandleDataStore dataStore) | |
void | insert (ComponentInfoVertex element) |
ComponentInfoVertex | extract () |
ComponentInfoVertex | peek () |
int | size () |
void | clear () |
Static Public Member Functions | |
List | sort (HandleDataStore handleDataStore) |
Protected Member Functions | |
final int | parent (int k) |
final int | left (int k) |
final int | right (int k) |
void | downheap (ComponentInfoVertex element, int k) |
ComponentInfoVertex | heapExtract () |
Protected Attributes | |
ComponentInfoVertex[] | nodes |
int | count = 0 |
IntHashMap | handleToHashIndexMap |
HandleDataStore | handleDataStore |
Private Member Functions | |
HashSet | generateImmortalChainMap (HandleDataStore dataStore) |
void | markImmortalChain (HashSet immortalChainMap, HandleDataStore dataStore, int marker) |
ComponentInfo
handle data store.
|
Create a Heap with the given initial capacity and comparator.
|
|
Constructor.
|
|
Remove all elements. |
|
|
|
Return and remove least element, or null if empty.
|
|
Generate immortal chain.
|
|
Return and remove least element, or null if empty.
|
|
Insert an element, resize if necessary.
|
|
Return left child node.
|
|
DSF algrithm to generate immortal chain.
|
|
Return parent node of the child.
|
|
Return least element without removing it, or null if empty
|
|
Return right child node.
|
|
Return number of elements.
|
|
Topological sort on
|
|
Number of used slots. |
|
Handle data store. |
|
Handle to hash index lookups. |
|
The tree nodes, packed into an array. |