|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectit.unimi.dsi.fastutil.doubles.AbstractDouble2ReferenceFunction<V>
it.unimi.dsi.fastutil.doubles.AbstractDouble2ReferenceMap<V>
it.unimi.dsi.fastutil.doubles.Double2ReferenceArrayMap<V>
public class Double2ReferenceArrayMap<V>
A simple, brute-force implementation of a map based on two parallel backing arrays.
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.
Nested Class Summary |
---|
Nested classes/interfaces inherited from class it.unimi.dsi.fastutil.doubles.AbstractDouble2ReferenceMap |
---|
AbstractDouble2ReferenceMap.BasicEntry<V> |
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.doubles.Double2ReferenceMap |
---|
Double2ReferenceMap.Entry<V>, Double2ReferenceMap.FastEntrySet<V> |
Constructor Summary | |
---|---|
Double2ReferenceArrayMap()
Creates a new empty array map. |
|
Double2ReferenceArrayMap(double[] key,
Object[] value)
Creates a new empty array map with given key and value backing arrays. |
|
Double2ReferenceArrayMap(double[] key,
Object[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements. |
|
Double2ReferenceArrayMap(Double2ReferenceMap<V> m)
Creates a new empty array map copying the entries of a given map. |
|
Double2ReferenceArrayMap(int capacity)
Creates a new empty array map of given capacity. |
|
Double2ReferenceArrayMap(Map<? extends Double,? extends V> m)
Creates a new empty array map copying the entries of a given map. |
Method Summary | |
---|---|
void |
clear()
Removes all associations from this function (optional operation). |
Double2ReferenceArrayMap<V> |
clone()
Returns a deep copy of this map. |
boolean |
containsKey(double k)
Checks whether the given value is contained in AbstractDouble2ReferenceMap.keySet() . |
boolean |
containsValue(Object v)
Checks whether the given value is contained in AbstractDouble2ReferenceMap.values() . |
Double2ReferenceMap.FastEntrySet<V> |
double2ReferenceEntrySet()
Returns a type-specific set view of the mappings contained in this map. |
V |
get(double k)
Returns the value to which the given key is mapped. |
boolean |
isEmpty()
|
DoubleSet |
keySet()
Returns a type-specific-set view of the keys of this map. |
V |
put(double k,
V v)
Adds a pair to the map. |
V |
remove(double k)
Removes the mapping with the given key. |
int |
size()
Returns the intended number of keys in this function, or -1 if no such number exists. |
ReferenceCollection<V> |
values()
Returns a type-specific-set view of the values of this map. |
Methods inherited from class it.unimi.dsi.fastutil.doubles.AbstractDouble2ReferenceMap |
---|
entrySet, equals, hashCode, putAll, toString |
Methods inherited from class it.unimi.dsi.fastutil.doubles.AbstractDouble2ReferenceFunction |
---|
containsKey, defaultReturnValue, defaultReturnValue, get, put, remove |
Methods inherited from class java.lang.Object |
---|
getClass, notify, notifyAll, wait, wait, wait |
Methods inherited from interface it.unimi.dsi.fastutil.doubles.Double2ReferenceFunction |
---|
defaultReturnValue, defaultReturnValue |
Methods inherited from interface it.unimi.dsi.fastutil.Function |
---|
containsKey, get, put, remove |
Methods inherited from interface java.util.Map |
---|
containsKey, get, put, remove |
Constructor Detail |
---|
public Double2ReferenceArrayMap(double[] key, 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 Double2ReferenceArrayMap()
public Double2ReferenceArrayMap(int capacity)
capacity
- the initial capacity.public Double2ReferenceArrayMap(Double2ReferenceMap<V> m)
m
- a map.public Double2ReferenceArrayMap(Map<? extends Double,? extends V> m)
m
- a map.public Double2ReferenceArrayMap(double[] key, 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
.Method Detail |
---|
public Double2ReferenceMap.FastEntrySet<V> double2ReferenceEntrySet()
Double2ReferenceMap
This method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Double2ReferenceMap.entrySet()
so that it returns an ObjectSet
of objects of type Double2ReferenceMap.Entry
(the latter makes it possible to
access keys and values with type-specific methods).
double2ReferenceEntrySet
in interface Double2ReferenceMap<V>
Double2ReferenceMap.entrySet()
public V get(double k)
Double2ReferenceFunction
get
in interface Double2ReferenceFunction<V>
k
- the key.
Function.get(Object)
public int size()
Function
Most function implementations will have some knowledge of the intended number of keys in their domain. In some cases, however, this might not be possible.
size
in interface Function<Double,V>
size
in interface Map<Double,V>
public void clear()
Function
clear
in interface Function<Double,V>
clear
in interface Map<Double,V>
clear
in class AbstractDouble2ReferenceFunction<V>
Map.clear()
public boolean containsKey(double k)
AbstractDouble2ReferenceMap
AbstractDouble2ReferenceMap.keySet()
.
containsKey
in interface Double2ReferenceFunction<V>
containsKey
in class AbstractDouble2ReferenceMap<V>
Function.containsKey(Object)
public boolean containsValue(Object v)
AbstractDouble2ReferenceMap
AbstractDouble2ReferenceMap.values()
.
containsValue
in interface Map<Double,V>
containsValue
in class AbstractDouble2ReferenceMap<V>
public boolean isEmpty()
isEmpty
in interface Map<Double,V>
isEmpty
in class AbstractDouble2ReferenceMap<V>
public V put(double k, V v)
Double2ReferenceFunction
put
in interface Double2ReferenceFunction<V>
put
in class AbstractDouble2ReferenceFunction<V>
k
- the key.v
- the value.
Function.put(Object,Object)
public V remove(double k)
Double2ReferenceFunction
remove
in interface Double2ReferenceFunction<V>
remove
in class AbstractDouble2ReferenceFunction<V>
Function.remove(Object)
public DoubleSet keySet()
AbstractDouble2ReferenceMap
The view is backed by the set returned by AbstractDouble2ReferenceMap.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 Double2ReferenceMap<V>
keySet
in interface Map<Double,V>
keySet
in class AbstractDouble2ReferenceMap<V>
Map.keySet()
public ReferenceCollection<V> values()
AbstractDouble2ReferenceMap
The view is backed by the set returned by AbstractDouble2ReferenceMap.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 Double2ReferenceMap<V>
values
in interface Map<Double,V>
values
in class AbstractDouble2ReferenceMap<V>
Map.values()
public Double2ReferenceArrayMap<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 Object
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |