Package com.graphhopper.coll
Class GHSortedCollection
java.lang.Object
com.graphhopper.coll.GHSortedCollection
A priority queue implemented by a treemap to allow fast key update. Or should we use a standard
b-tree?
- Author:
- Peter Karich
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
GHSortedCollection
public GHSortedCollection()
-
-
Method Details
-
clear
public void clear() -
update
public void update(int key, int oldValue, int value) -
insert
public void insert(int key, int value) -
peekValue
public int peekValue() -
peekKey
public int peekKey() -
pollKey
public int pollKey()- Returns:
- removes the smallest entry (key and value) from this collection
-
getSize
public int getSize() -
isEmpty
public boolean isEmpty() -
getSlidingMeanValue
public int getSlidingMeanValue() -
toString
-