Package io.openems.edge.common.type
Class CircularTreeMap<K,V>
- java.lang.Object
-
- java.util.AbstractMap<K,V>
-
- java.util.TreeMap<K,V>
-
- io.openems.edge.common.type.CircularTreeMap<K,V>
-
- Type Parameters:
K
- the type of the KeyV
- the type of the Value
- All Implemented Interfaces:
java.io.Serializable
,java.lang.Cloneable
,java.util.Map<K,V>
,java.util.NavigableMap<K,V>
,java.util.SortedMap<K,V>
public class CircularTreeMap<K,V> extends java.util.TreeMap<K,V>
Implements a circular buffer with a TreeMap.Be aware that not the eldest entry is removed when the buffer is full, but the entry with the lowest key is removed!
- See Also:
- Serialized Form
-
-
Constructor Summary
Constructors Constructor Description CircularTreeMap(int limit)
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description V
put(K key, V value)
-
Methods inherited from class java.util.TreeMap
ceilingEntry, ceilingKey, clear, clone, comparator, containsKey, containsValue, descendingKeySet, descendingMap, entrySet, firstEntry, firstKey, floorEntry, floorKey, forEach, get, headMap, headMap, higherEntry, higherKey, keySet, lastEntry, lastKey, lowerEntry, lowerKey, navigableKeySet, pollFirstEntry, pollLastEntry, putAll, remove, replace, replace, replaceAll, size, subMap, subMap, tailMap, tailMap, values
-
-