Class Reference2ReferenceArrayMap<K,V>
- All Implemented Interfaces:
Function<K,
,V> Reference2ReferenceFunction<K,
,V> Reference2ReferenceMap<K,
,V> Serializable
,Cloneable
,Function<K,
,V> Map<K,
V>
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.
- See Also:
-
Nested Class Summary
Nested classes/interfaces inherited from class it.unimi.dsi.fastutil.objects.AbstractReference2ReferenceMap
AbstractReference2ReferenceMap.BasicEntry<K,
V>, AbstractReference2ReferenceMap.BasicEntrySet<K, V> Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.objects.Reference2ReferenceMap
Reference2ReferenceMap.Entry<K,
V>, Reference2ReferenceMap.FastEntrySet<K, V> -
Constructor Summary
ConstructorDescriptionCreates a new empty array map.Reference2ReferenceArrayMap
(int capacity) Creates a new empty array map of given capacity.Creates a new empty array map copying the entries of a given map.Reference2ReferenceArrayMap
(Object[] key, Object[] value) Creates a new empty array map with given key and value backing arrays.Reference2ReferenceArrayMap
(Object[] key, Object[] value, int size) Creates a new array map with given key and value backing arrays, using the given number of elements.Reference2ReferenceArrayMap
(Map<? extends K, ? extends V> m) Creates a new empty array map copying the entries of a given map. -
Method Summary
Modifier and TypeMethodDescriptionvoid
clear()
Removes all of the mappings from this map (optional operation).clone()
Returns a deep copy of this map.boolean
Returns true if this function contains a mapping for the specified key.boolean
Returns the value to which the given key is mapped.boolean
isEmpty()
keySet()
Returns a type-specific-set view of the keys of this map.Adds a pair to the map (optional operation).Returns a type-specific set view of the mappings contained in this map.Removes the mapping with the given key (optional operation).int
size()
Returns the number of key/value mappings in this map.values()
Returns a type-specific-set view of the values of this map.Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractReference2ReferenceMap
equals, hashCode, putAll, toString
Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractReference2ReferenceFunction
defaultReturnValue, defaultReturnValue
Methods inherited from interface java.util.Map
computeIfAbsent, replaceAll
Methods inherited from interface it.unimi.dsi.fastutil.objects.Reference2ReferenceFunction
andThenByte, andThenChar, andThenDouble, andThenFloat, andThenInt, andThenLong, andThenObject, andThenReference, andThenShort, composeByte, composeChar, composeDouble, composeFloat, composeInt, composeLong, composeObject, composeReference, composeShort
Methods inherited from interface it.unimi.dsi.fastutil.objects.Reference2ReferenceMap
compute, computeIfAbsent, computeIfPresent, computeReferenceIfAbsentPartial, defaultReturnValue, defaultReturnValue, entrySet, forEach, getOrDefault, merge, putIfAbsent, remove, replace, replace
-
Constructor Details
-
Reference2ReferenceArrayMap
Creates a new empty array map with given key and value backing arrays. The resulting map will have as many entries as the given arrays.It is responsibility of the caller that the elements of
key
are distinct.- Parameters:
key
- the key array.value
- the value array (it must have the same length askey
).
-
Reference2ReferenceArrayMap
public Reference2ReferenceArrayMap()Creates a new empty array map. -
Reference2ReferenceArrayMap
public Reference2ReferenceArrayMap(int capacity) Creates a new empty array map of given capacity.- Parameters:
capacity
- the initial capacity.
-
Reference2ReferenceArrayMap
Creates a new empty array map copying the entries of a given map.- Parameters:
m
- a map.
-
Reference2ReferenceArrayMap
Creates a new empty array map copying the entries of a given map.- Parameters:
m
- a map.
-
Reference2ReferenceArrayMap
Creates a new array map with given key and value backing arrays, using the given number of elements.It is responsibility of the caller that the first
size
elements ofkey
are distinct.- Parameters:
key
- the key array.value
- the value array (it must have the same length askey
).size
- the number of valid elements inkey
andvalue
.
-
-
Method Details
-
reference2ReferenceEntrySet
Description copied from interface:Reference2ReferenceMap
Returns a type-specific set view of the mappings contained in this map.This method is necessary because there is no inheritance along type parameters: it is thus impossible to strengthen
Map.entrySet()
so that it returns anObjectSet
of type-specific entries (the latter makes it possible to access keys and values with type-specific methods).- Specified by:
reference2ReferenceEntrySet
in interfaceReference2ReferenceMap<K,
V> - Returns:
- a type-specific set view of the mappings contained in this map.
- See Also:
-
get
Description copied from interface:Reference2ReferenceFunction
Returns the value to which the given key is mapped. -
size
public int size()Description copied from interface:Reference2ReferenceMap
Returns the number of key/value mappings in this map. If the map contains more thanInteger.MAX_VALUE
elements, returnsInteger.MAX_VALUE
. -
clear
public void clear()Description copied from interface:Reference2ReferenceMap
Removes all of the mappings from this map (optional operation). The map will be empty after this call returns. -
containsKey
Description copied from class:AbstractReference2ReferenceMap
Returns true if this function contains a mapping for the specified key.- Specified by:
containsKey
in interfaceFunction<K,
V> - Specified by:
containsKey
in interfaceMap<K,
V> - Specified by:
containsKey
in interfaceReference2ReferenceMap<K,
V> - Overrides:
containsKey
in classAbstractReference2ReferenceMap<K,
V> - Parameters:
k
- the key.- Returns:
- true if this function associates a value to
key
. - See Also:
-
containsValue
Description copied from class:AbstractReference2ReferenceMap
- Specified by:
containsValue
in interfaceMap<K,
V> - Overrides:
containsValue
in classAbstractReference2ReferenceMap<K,
V>
-
isEmpty
public boolean isEmpty() -
put
Description copied from interface:Reference2ReferenceMap
Adds a pair to the map (optional operation).This default implementation just delegates to the corresponding function method.
- Specified by:
put
in interfaceFunction<K,
V> - Specified by:
put
in interfaceMap<K,
V> - Specified by:
put
in interfaceReference2ReferenceFunction<K,
V> - Specified by:
put
in interfaceReference2ReferenceMap<K,
V> - Parameters:
k
- the key.v
- the value.- Returns:
- the old value, or the default return value if no value was present for the given key.
- See Also:
-
remove
Description copied from interface:Reference2ReferenceMap
Removes the mapping with the given key (optional operation).This default implementation just delegates to the corresponding type-specific–function method.
- Specified by:
remove
in interfaceFunction<K,
V> - Specified by:
remove
in interfaceMap<K,
V> - Specified by:
remove
in interfaceReference2ReferenceFunction<K,
V> - Specified by:
remove
in interfaceReference2ReferenceMap<K,
V> - Parameters:
k
- the key.- Returns:
- the old value, or the default return value if no value was present for the given key.
- See Also:
-
keySet
Description copied from class:AbstractReference2ReferenceMap
Returns a type-specific-set view of the keys of this map.The 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
Description copied from class:AbstractReference2ReferenceMap
Returns a type-specific-set view of the values of this map.The 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. -
clone
Returns a deep copy of this map.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.
- Returns:
- a deep copy of this map.
-