public class OrderedMap<K,V> extends HashMap<K,V>
AbstractMap.SimpleEntry<K,V>, AbstractMap.SimpleImmutableEntry<K,V>| Constructor and Description |
|---|
OrderedMap() |
OrderedMap(int inInitialCapacity) |
OrderedMap(int inInitialCapacity,
float loadFactor) |
OrderedMap(Map<? extends K,? extends V> m) |
| Modifier and Type | Method and Description |
|---|---|
void |
clear() |
V |
compute(K inKey,
BiFunction<? super K,? super V,? extends V> inRemappingFunction) |
V |
computeIfAbsent(K inKey,
Function<? super K,? extends V> inRemappingFunction) |
V |
computeIfPresent(K inKey,
BiFunction<? super K,? super V,? extends V> inRemappingFunction) |
Set<Map.Entry<K,V>> |
entrySet() |
void |
forEach(BiConsumer<? super K,? super V> inAction) |
OrderedSet<K> |
keySet() |
V |
merge(K inKey,
V inValue,
BiFunction<? super V,? super V,? extends V> inRemappingFunction) |
V |
put(K inKey,
V inValue) |
void |
putAll(Map<? extends K,? extends V> m) |
V |
putIfAbsent(K inKey,
V inValue) |
V |
remove(Object inKey) |
Collection<V> |
values() |
clone, containsKey, containsValue, get, getOrDefault, isEmpty, remove, replace, replace, replaceAll, sizeequals, hashCode, toStringpublic OrderedMap()
public OrderedMap(int inInitialCapacity)
public OrderedMap(int inInitialCapacity, float loadFactor)
public OrderedMap(Map<? extends K,? extends V> m)
public void clear()
public V putIfAbsent(K inKey, V inValue)
putIfAbsent in interface Map<K,V>putIfAbsent in class HashMap<K,V>public V computeIfPresent(K inKey, BiFunction<? super K,? super V,? extends V> inRemappingFunction)
computeIfPresent in interface Map<K,V>computeIfPresent in class HashMap<K,V>public V computeIfAbsent(K inKey, Function<? super K,? extends V> inRemappingFunction)
computeIfAbsent in interface Map<K,V>computeIfAbsent in class HashMap<K,V>public V merge(K inKey, V inValue, BiFunction<? super V,? super V,? extends V> inRemappingFunction)
public Collection<V> values()
public OrderedSet<K> keySet()
jataylor@hairyfatguy.com