public static class BTreeMapJava.SubMap<K,V> implements BTreeMapJava.ConcurrentNavigableMap2<K,V>
| Modifier and Type | Field and Description |
|---|---|
K |
hi |
boolean |
hiInclusive |
K |
lo |
boolean |
loInclusive |
ConcurrentNavigableMapExtra<K,V> |
m |
| Constructor and Description |
|---|
SubMap() |
| Modifier and Type | Method and Description |
|---|---|
java.util.Map.Entry<K,V> |
ceilingEntry() |
K |
ceilingKey() |
void |
clear() |
java.util.Comparator<? super K> |
comparator() |
boolean |
containsKey() |
boolean |
containsValue() |
java.util.NavigableSet<K> |
descendingKeySet() |
java.util.concurrent.ConcurrentNavigableMap<K,V> |
descendingMap() |
java.util.Set<java.util.Map.Entry> |
entrySet() |
java.util.Map.Entry<K,V> |
firstEntry() |
K |
firstKey() |
K |
firstKey2() |
java.util.Map.Entry<K,V> |
floorEntry() |
K |
floorKey() |
V |
get() |
BTreeMapJava.SubMap<K,V> |
headMap() |
BTreeMapJava.SubMap<K,V> |
headMap() |
java.util.Map.Entry<K,V> |
higherEntry() |
K |
higherKey() |
boolean |
isEmpty() |
java.util.NavigableSet<K> |
keySet() |
java.util.Map.Entry<K,V> |
lastEntry() |
K |
lastKey() |
K |
lastKey2() |
java.util.Map.Entry<K,V> |
lowerEntry() |
K |
lowerKey() |
java.util.NavigableSet<K> |
navigableKeySet() |
java.util.Map.Entry<K,V> |
pollFirstEntry() |
java.util.Map.Entry<K,V> |
pollLastEntry() |
V |
put() |
V |
putIfAbsent() |
V |
remove() |
boolean |
remove() |
boolean |
replace() |
V |
replace() |
int |
size() |
long |
sizeLong() |
BTreeMapJava.SubMap<K,V> |
subMap() |
BTreeMapJava.SubMap<K,V> |
subMap() |
BTreeMapJava.SubMap<K,V> |
tailMap() |
BTreeMapJava.SubMap<K,V> |
tailMap() |
firstKey2, lastKey2public ConcurrentNavigableMapExtra<K,V> m
public K lo
public boolean loInclusive
public K hi
public boolean hiInclusive
public boolean containsKey()
public V get()
public V put()
public V remove()
public int size()
public long sizeLong()
public boolean isEmpty()
public boolean containsValue()
public void clear()
public V putIfAbsent()
public boolean remove()
public boolean replace()
public V replace()
public java.util.Comparator<? super K> comparator()
public java.util.Map.Entry<K,V> lowerEntry()
public K lowerKey()
public java.util.Map.Entry<K,V> floorEntry()
public K floorKey()
public java.util.Map.Entry<K,V> ceilingEntry()
public K ceilingKey()
public java.util.Map.Entry<K,V> higherEntry()
public K higherKey()
public K firstKey2()
public K lastKey2()
public K firstKey()
public K lastKey()
public java.util.Map.Entry<K,V> firstEntry()
public java.util.Map.Entry<K,V> lastEntry()
public java.util.Map.Entry<K,V> pollFirstEntry()
public java.util.Map.Entry<K,V> pollLastEntry()
public BTreeMapJava.SubMap<K,V> subMap()
public BTreeMapJava.SubMap<K,V> headMap()
public BTreeMapJava.SubMap<K,V> tailMap()
public BTreeMapJava.SubMap<K,V> subMap()
public BTreeMapJava.SubMap<K,V> headMap()
public BTreeMapJava.SubMap<K,V> tailMap()
public java.util.concurrent.ConcurrentNavigableMap<K,V> descendingMap()
public java.util.NavigableSet<K> navigableKeySet()
public java.util.NavigableSet<K> keySet()
public java.util.NavigableSet<K> descendingKeySet()
public java.util.Set<java.util.Map.Entry> entrySet()