AbstractMap.SimpleEntry<K,V>, AbstractMap.SimpleImmutableEntry<K,V>| Constructor and Description |
|---|
LinkedHashMap() |
LinkedHashMap(int s) |
LinkedHashMap(int s,
float lf) |
LinkedHashMap(int s,
float lf,
boolean order) |
LinkedHashMap(Map<? extends K,? extends V> m) |
| Modifier and Type | Method and Description |
|---|---|
void |
clear() |
boolean |
containsValue(Object value) |
Set<Map.Entry<K,V>> |
entrySet() |
V |
get(Object key) |
Set<K> |
keySet() |
V |
put(K key,
V value) |
V |
remove(Object key) |
protected boolean |
removeEldestEntry(Map.Entry<K,V> eldest) |
Collection<V> |
values() |
containsKey, isEmpty, putAll, sizeequals, hashCode, toStringcompute, computeIfAbsent, computeIfPresent, containsKey, equals, forEach, getOrDefault, hashCode, isEmpty, merge, putAll, putIfAbsent, remove, replace, replace, replaceAll, sizepublic LinkedHashMap()
public LinkedHashMap(int s)
public LinkedHashMap(int s,
float lf)
public LinkedHashMap(int s,
float lf,
boolean order)
public boolean containsValue(Object value)
containsValue in interface Map<K,V>containsValue in class HashMap<K,V>public Collection<V> values()
Copyright © 2026. All rights reserved.