Go to the documentation of this file.
9 package javolution.util;
13 import java.util.Comparator;
14 import java.util.SortedMap;
125 return super.containsKey(key);
130 public V
get(Object key) {
131 return super.get(key);
136 public V
put(K key, V value) {
137 return super.put(key, value);
143 return super.remove(key);
149 return super.putIfAbsent(key, value);
154 public
boolean remove(Object key, Object value) {
155 return super.remove(key, value);
160 public
boolean replace(K key, V oldValue, V newValue) {
161 return super.replace(key, oldValue, newValue);
167 return super.replace(key, value);
189 return keySet().comparator();
static final Equality< Object > STANDARD
FastSortedMap< K, V > headMap(K toKey)
FastSortedMap< K, V > unmodifiable()
FastSortedMap< K, V > tailMap(K fromKey)
SortedMapService< K, V > service()
FastSortedSet< Entry< K, V > > entrySet()
FastSortedMap(SortedMapService< K, V > service)
FastSortedMap(Equality<? super K > keyComparator)
FastSortedMap< K, V > putAll(FastMap<? extends K, ? extends V > that)
boolean containsKey(Object key)
FastSortedMap< K, V > subMap(K fromKey, K toKey)
V putIfAbsent(K key, V value)
boolean replace(K key, V oldValue, V newValue)
FastSortedMap< K, V > atomic()
static final long serialVersionUID
FastSortedSet< K > keySet()
Comparator<? super K > comparator()
FastSortedMap< K, V > shared()
FastSortedMap(Equality<? super K > keyComparator, Equality<? super V > valueComparator)