public class Reference2ObjectArrayMap<K,V> extends AbstractReference2ObjectMap<K,V> implements java.io.Serializable, java.lang.Cloneable
The main purpose of this implementation is that of wrapping cleanly the brute-force approach to the storage of a very small number of pairs: just put them into two parallel arrays and scan linearly to find an item.
AbstractReference2ObjectMap.BasicEntry<K,V>, AbstractReference2ObjectMap.BasicEntrySet<K,V>Reference2ObjectMap.Entry<K,V>, Reference2ObjectMap.FastEntrySet<K,V>| Modifier and Type | Field and Description |
|---|---|
protected Reference2ObjectMap.FastEntrySet<K,V> |
entries
Cached set of entries.
|
protected java.lang.Object[] |
key
The keys (valid up to
size, excluded). |
protected it.unimi.dsi.fastutil.objects.ReferenceSet<K> |
keys
Cached set of keys.
|
protected int |
size
|
protected java.lang.Object[] |
value
The values (parallel to
key). |
protected it.unimi.dsi.fastutil.objects.ObjectCollection<V> |
values
Cached collection of values.
|
defRetValue| Constructor and Description |
|---|
Reference2ObjectArrayMap()
Creates a new empty array map.
|
Reference2ObjectArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Reference2ObjectArrayMap(java.util.Map<? extends K,? extends V> m)
Creates a new empty array map copying the entries of a given map.
|
Reference2ObjectArrayMap(java.lang.Object[] key,
java.lang.Object[] value)
Creates a new empty array map with given key and value backing arrays.
|
Reference2ObjectArrayMap(java.lang.Object[] key,
java.lang.Object[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements.
|
Reference2ObjectArrayMap(Reference2ObjectMap<K,V> m)
Creates a new empty array map copying the entries of a given map.
|
| Modifier and Type | Method and Description |
|---|---|
void |
clear()
Removes all of the mappings from this map (optional operation).
|
Reference2ObjectArrayMap<K,V> |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(java.lang.Object k)
Returns true if this function contains a mapping for the specified key.
|
boolean |
containsValue(java.lang.Object v) |
V |
get(java.lang.Object k) |
boolean |
isEmpty() |
it.unimi.dsi.fastutil.objects.ReferenceSet<K> |
keySet()
Returns a type-specific-set view of the keys of this map.
|
V |
put(K k,
V v) |
Reference2ObjectMap.FastEntrySet<K,V> |
reference2ObjectEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
V |
remove(java.lang.Object k) |
int |
size()
Returns the number of key/value mappings in this map.
|
it.unimi.dsi.fastutil.objects.ObjectCollection<V> |
values()
Returns a type-specific-set view of the values of this map.
|
equals, hashCode, putAll, toStringdefaultReturnValue, defaultReturnValuefinalize, getClass, notify, notifyAll, wait, wait, waitcompute, computeIfAbsent, computeIfPresent, computeObjectIfAbsentPartial, defaultReturnValue, defaultReturnValue, entrySet, forEach, getOrDefault, merge, putIfAbsent, remove, replace, replaceandThenByte, andThenChar, andThenDouble, andThenFloat, andThenInt, andThenLong, andThenObject, andThenReference, andThenShort, composeByte, composeChar, composeDouble, composeFloat, composeInt, composeLong, composeObject, composeReference, composeShortprotected transient java.lang.Object[] key
size, excluded).protected transient java.lang.Object[] value
key).protected int size
protected transient Reference2ObjectMap.FastEntrySet<K,V> entries
protected transient it.unimi.dsi.fastutil.objects.ReferenceSet<K> keys
protected transient it.unimi.dsi.fastutil.objects.ObjectCollection<V> values
public Reference2ObjectArrayMap(java.lang.Object[] key,
java.lang.Object[] value)
It is responsibility of the caller that the elements of key are distinct.
key - the key array.value - the value array (it must have the same length as key).public Reference2ObjectArrayMap()
public Reference2ObjectArrayMap(int capacity)
capacity - the initial capacity.public Reference2ObjectArrayMap(Reference2ObjectMap<K,V> m)
m - a map.public Reference2ObjectArrayMap(java.util.Map<? extends K,? extends V> m)
m - a map.public Reference2ObjectArrayMap(java.lang.Object[] key,
java.lang.Object[] value,
int size)
It is responsibility of the caller that the first size elements of key are distinct.
key - the key array.value - the value array (it must have the same length as key).size - the number of valid elements in key and value.public Reference2ObjectMap.FastEntrySet<K,V> reference2ObjectEntrySet()
Reference2ObjectMapThis method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Map.entrySet()
so that it returns an ObjectSet
of type-specific entries (the latter makes it possible to
access keys and values with type-specific methods).
reference2ObjectEntrySet in interface Reference2ObjectMap<K,V>Map.entrySet()public V get(java.lang.Object k)
public int size()
Reference2ObjectMapInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.public void clear()
Reference2ObjectMappublic boolean containsKey(java.lang.Object k)
AbstractReference2ObjectMapcontainsKey in interface Reference2ObjectMap<K,V>containsKey in interface java.util.Map<K,V>containsKey in class AbstractReference2ObjectMap<K,V>k - the key.key.Map.containsKey(Object)public boolean containsValue(java.lang.Object v)
AbstractReference2ObjectMapcontainsValue in interface java.util.Map<K,V>containsValue in class AbstractReference2ObjectMap<K,V>public boolean isEmpty()
public V put(K k, V v)
Reference2ObjectMapThis default implementation just delegates to the corresponding function method.
public V remove(java.lang.Object k)
Reference2ObjectMapThis default implementation just delegates to the corresponding type-specific–function method.
public it.unimi.dsi.fastutil.objects.ReferenceSet<K> keySet()
AbstractReference2ObjectMapThe view is backed by the set returned by Map.entrySet(). Note that
no attempt is made at caching the result of this method, as this would
require adding some attributes that lightweight implementations would
not need. Subclasses may easily override this policy by calling
this method and caching the result, but implementors are encouraged to
write more efficient ad-hoc implementations.
keySet in interface Reference2ObjectMap<K,V>keySet in interface java.util.Map<K,V>keySet in class AbstractReference2ObjectMap<K,V>Map.keySet()public it.unimi.dsi.fastutil.objects.ObjectCollection<V> values()
AbstractReference2ObjectMapThe view is backed by the set returned by Map.entrySet(). Note that
no attempt is made at caching the result of this method, as this would
require adding some attributes that lightweight implementations would
not need. Subclasses may easily override this policy by calling
this method and caching the result, but implementors are encouraged to
write more efficient ad-hoc implementations.
values in interface Reference2ObjectMap<K,V>values in interface java.util.Map<K,V>values in class AbstractReference2ObjectMap<K,V>Map.values()public Reference2ObjectArrayMap<K,V> clone()
This method performs a deep copy of this hash map; the data stored in the map, however, is not cloned. Note that this makes a difference only for object keys.
clone in class java.lang.Object