public class ListOrderedMap<K,V> extends AbstractMap<K,V> implements Serializable, Cloneable
AbstractMap.SimpleEntry<K,V>, AbstractMap.SimpleImmutableEntry<K,V>| Constructor and Description |
|---|
ListOrderedMap() |
ListOrderedMap(int initialCapacity) |
ListOrderedMap(int initialCapacity,
float loadFactor) |
ListOrderedMap(Map<? extends K,? extends V> m) |
| Modifier and Type | Method and Description |
|---|---|
void |
clear() |
ListOrderedMap<K,V> |
clone() |
boolean |
containsValue(Object value) |
List<Map.Entry<K,V>> |
entryList() |
Set<Map.Entry<K,V>> |
entrySet() |
V |
get(Object key) |
Map.Entry<K,V> |
getEntry(int index) |
K |
getKey(int index) |
V |
getValue(int index) |
boolean |
isEmpty() |
Iterator<Map.Entry<K,V>> |
iterator() |
List<K> |
keyList() |
Set<K> |
keySet() |
Map.Entry<K,V> |
put(int index,
K key,
V value) |
V |
put(K key,
V value) |
void |
putAll(int index,
Map<? extends K,? extends V> map) |
Map.Entry<K,V> |
remove(int index) |
V |
remove(Object key) |
int |
size() |
Map.Entry<K,V>[] |
toArray() |
List<V> |
valueList() |
Collection<V> |
values() |
containsKey, equals, hashCode, putAll, toStringcompute, computeIfAbsent, computeIfPresent, forEach, getOrDefault, merge, putIfAbsent, remove, replace, replace, replaceAllpublic ListOrderedMap()
public ListOrderedMap(int initialCapacity)
public ListOrderedMap(int initialCapacity,
float loadFactor)
public K getKey(int index)
public V getValue(int index)
public boolean containsValue(Object value)
containsValue in interface Map<K,V>containsValue in class AbstractMap<K,V>public int size()
public boolean isEmpty()
public void clear()
public Collection<V> values()
public ListOrderedMap<K,V> clone()
clone in class AbstractMap<K,V>Copyright © 2016 jetbrick. All rights reserved.