public class Object2ReferenceArrayMap<K,V> extends AbstractObject2ReferenceMap<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.
AbstractObject2ReferenceMap.BasicEntry<K,V>, AbstractObject2ReferenceMap.BasicEntrySet<K,V>Object2ReferenceMap.Entry<K,V>, Object2ReferenceMap.FastEntrySet<K,V>| Modifier and Type | Field and Description |
|---|---|
protected Object2ReferenceMap.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.ObjectSet<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.ReferenceCollection<V> |
values
Cached collection of values.
|
defRetValue| Constructor and Description |
|---|
Object2ReferenceArrayMap()
Creates a new empty array map.
|
Object2ReferenceArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Object2ReferenceArrayMap(java.util.Map<? extends K,? extends V> m)
Creates a new empty array map copying the entries of a given map.
|
Object2ReferenceArrayMap(java.lang.Object[] key,
java.lang.Object[] value)
Creates a new empty array map with given key and value backing arrays.
|
Object2ReferenceArrayMap(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.
|
Object2ReferenceArrayMap(Object2ReferenceMap<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).
|
Object2ReferenceArrayMap<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.ObjectSet<K> |
keySet()
Returns a type-specific-set view of the keys of this map.
|
Object2ReferenceMap.FastEntrySet<K,V> |
object2ReferenceEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
V |
put(K k,
V v) |
V |
remove(java.lang.Object k) |
int |
size()
Returns the number of key/value mappings in this map.
|
it.unimi.dsi.fastutil.objects.ReferenceCollection<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, computeReferenceIfAbsentPartial, 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 Object2ReferenceMap.FastEntrySet<K,V> entries
protected transient it.unimi.dsi.fastutil.objects.ObjectSet<K> keys
protected transient it.unimi.dsi.fastutil.objects.ReferenceCollection<V> values
public Object2ReferenceArrayMap(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 Object2ReferenceArrayMap()
public Object2ReferenceArrayMap(int capacity)
capacity - the initial capacity.public Object2ReferenceArrayMap(Object2ReferenceMap<K,V> m)
m - a map.public Object2ReferenceArrayMap(java.util.Map<? extends K,? extends V> m)
m - a map.public Object2ReferenceArrayMap(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 Object2ReferenceMap.FastEntrySet<K,V> object2ReferenceEntrySet()
Object2ReferenceMapThis 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).
object2ReferenceEntrySet in interface Object2ReferenceMap<K,V>Map.entrySet()public V get(java.lang.Object k)
public int size()
Object2ReferenceMapInteger.MAX_VALUE elements, returns Integer.MAX_VALUE.public void clear()
Object2ReferenceMappublic boolean containsKey(java.lang.Object k)
AbstractObject2ReferenceMapcontainsKey in interface Object2ReferenceMap<K,V>containsKey in interface java.util.Map<K,V>containsKey in class AbstractObject2ReferenceMap<K,V>k - the key.key.Map.containsKey(Object)public boolean containsValue(java.lang.Object v)
AbstractObject2ReferenceMapcontainsValue in interface java.util.Map<K,V>containsValue in class AbstractObject2ReferenceMap<K,V>public boolean isEmpty()
public V put(K k, V v)
Object2ReferenceMapThis default implementation just delegates to the corresponding function method.
public V remove(java.lang.Object k)
Object2ReferenceMapThis default implementation just delegates to the corresponding type-specific–function method.
public it.unimi.dsi.fastutil.objects.ObjectSet<K> keySet()
AbstractObject2ReferenceMapThe 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 Object2ReferenceMap<K,V>keySet in interface java.util.Map<K,V>keySet in class AbstractObject2ReferenceMap<K,V>Map.keySet()public it.unimi.dsi.fastutil.objects.ReferenceCollection<V> values()
AbstractObject2ReferenceMapThe 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 Object2ReferenceMap<K,V>values in interface java.util.Map<K,V>values in class AbstractObject2ReferenceMap<K,V>Map.values()public Object2ReferenceArrayMap<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