final class LinkedIdentityHashMap<K,V> extends Object implements Map<K,V>
IdentityHashMap
with LinkedHashMap
for the purpose of
ensuring a deterministic execution order during a capturing compilation.Modifier and Type | Class and Description |
---|---|
(package private) class |
LinkedIdentityHashMap.EntrySet |
(package private) static class |
LinkedIdentityHashMap.Id<T>
Wrapper for an object that gives uses the object's identity for the purpose of equality
comparisons and computing a hash code.
|
(package private) class |
LinkedIdentityHashMap.KeySet |
Modifier and Type | Field and Description |
---|---|
private LinkedHashMap<LinkedIdentityHashMap.Id<K>,V> |
map |
Constructor and Description |
---|
LinkedIdentityHashMap() |
LinkedIdentityHashMap(int expectedMaxSize) |
LinkedIdentityHashMap(Map<K,V> m) |
Modifier and Type | Method and Description |
---|---|
void |
clear() |
boolean |
containsKey(Object key) |
boolean |
containsValue(Object value) |
Set<Map.Entry<K,V>> |
entrySet() |
V |
get(Object key) |
private LinkedIdentityHashMap.Id<K> |
id(Object key) |
boolean |
isEmpty() |
Set<K> |
keySet() |
V |
put(K key,
V value) |
void |
putAll(Map<? extends K,? extends V> m) |
V |
remove(Object key) |
int |
size() |
Collection<V> |
values() |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
compute, computeIfAbsent, computeIfPresent, equals, forEach, getOrDefault, hashCode, merge, putIfAbsent, remove, replace, replace, replaceAll
private final LinkedHashMap<LinkedIdentityHashMap.Id<K>,V> map
public LinkedIdentityHashMap()
public LinkedIdentityHashMap(Map<K,V> m)
public LinkedIdentityHashMap(int expectedMaxSize)
public boolean containsKey(Object key)
containsKey
in interface Map<K,V>
private LinkedIdentityHashMap.Id<K> id(Object key)
public boolean containsValue(Object value)
containsValue
in interface Map<K,V>