|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectit.unimi.dsi.fastutil.objects.AbstractObject2ObjectFunction<K,V>
it.unimi.dsi.fastutil.objects.AbstractObject2ObjectMap<K,V>
it.unimi.dsi.fastutil.objects.Object2ObjectArrayMap<K,V>
public class Object2ObjectArrayMap<K,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.objects.AbstractObject2ObjectMap |
|---|
AbstractObject2ObjectMap.BasicEntry<K,V> |
| Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.objects.Object2ObjectMap |
|---|
Object2ObjectMap.Entry<K,V>, Object2ObjectMap.FastEntrySet<K,V> |
| Constructor Summary | |
|---|---|
Object2ObjectArrayMap()
Creates a new empty array map. |
|
Object2ObjectArrayMap(int capacity)
Creates a new empty array map of given capacity. |
|
Object2ObjectArrayMap(Object[] key,
Object[] value)
Creates a new empty array map with given key and value backing arrays. |
|
Object2ObjectArrayMap(Object[] key,
Object[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements. |
|
Object2ObjectArrayMap(Object2ObjectMap<K,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). |
Object |
clone()
Returns a deep copy of this map. |
boolean |
containsKey(Object k)
Checks whether the given value is contained in AbstractObject2ObjectMap.keySet(). |
boolean |
containsValue(Object v)
Checks whether the given value is contained in AbstractObject2ObjectMap.values(). |
V |
get(Object k)
Returns the value associated by this function to the specified key. |
boolean |
isEmpty()
|
ObjectSet<K> |
keySet()
Returns a type-specific-set view of the keys of this map. |
Object2ObjectMap.FastEntrySet<K,V> |
object2ObjectEntrySet()
Returns a type-specific set view of the mappings contained in this map. |
V |
put(K k,
V v)
Associates the specified value with the specified key in this function (optional operation). |
V |
remove(Object k)
Removes this key and the associated value from this function if it is present (optional operation). |
int |
size()
Returns the intended number of keys in this function, or -1 if no such number exists. |
ObjectCollection<V> |
values()
Returns a type-specific-set view of the values of this map. |
| Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractObject2ObjectMap |
|---|
entrySet, equals, hashCode, putAll, toString |
| Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractObject2ObjectFunction |
|---|
defaultReturnValue, defaultReturnValue |
| Methods inherited from class java.lang.Object |
|---|
getClass, notify, notifyAll, wait, wait, wait |
| Methods inherited from interface it.unimi.dsi.fastutil.objects.Object2ObjectFunction |
|---|
defaultReturnValue, defaultReturnValue |
| Constructor Detail |
|---|
public Object2ObjectArrayMap(Object[] key,
Object[] value)
key - the key array.value - the value array (it must have the same length as key).public Object2ObjectArrayMap()
public Object2ObjectArrayMap(int capacity)
capacity - the initial capacity.public Object2ObjectArrayMap(Object2ObjectMap<K,V> m)
m - a map.
public Object2ObjectArrayMap(Object[] key,
Object[] value,
int size)
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 Object2ObjectMap.FastEntrySet<K,V> object2ObjectEntrySet()
Object2ObjectMapThis method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Object2ObjectMap.entrySet()
so that it returns an ObjectSet
of objects of type Object2ObjectMap.Entry (the latter makes it possible to
access keys and values with type-specific methods).
object2ObjectEntrySet in interface Object2ObjectMap<K,V>Object2ObjectMap.entrySet()public V get(Object k)
Function
get in interface Function<K,V>get in interface Map<K,V>k - the key.
null if no value was present for the given key.Map.get(Object)public int size()
FunctionMost 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<K,V>size in interface Map<K,V>public void clear()
Function
clear in interface Function<K,V>clear in interface Map<K,V>clear in class AbstractObject2ObjectFunction<K,V>Map.clear()public boolean containsKey(Object k)
AbstractObject2ObjectMapAbstractObject2ObjectMap.keySet().
containsKey in interface Function<K,V>containsKey in interface Map<K,V>containsKey in class AbstractObject2ObjectMap<K,V>k - the key.
key.Map.containsKey(Object)public boolean containsValue(Object v)
AbstractObject2ObjectMapAbstractObject2ObjectMap.values().
containsValue in interface Map<K,V>containsValue in class AbstractObject2ObjectMap<K,V>public boolean isEmpty()
isEmpty in interface Map<K,V>isEmpty in class AbstractObject2ObjectMap<K,V>
public V put(K k,
V v)
Function
put in interface Function<K,V>put in interface Map<K,V>put in class AbstractObject2ObjectFunction<K,V>k - the key.v - the value.
null if no value was present for the given key.Map.put(Object,Object)public V remove(Object k)
Function
remove in interface Function<K,V>remove in interface Map<K,V>remove in class AbstractObject2ObjectFunction<K,V>null if no value was present for the given key.Map.remove(Object)public ObjectSet<K> keySet()
AbstractObject2ObjectMapThe view is backed by the set returned by AbstractObject2ObjectMap.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 Object2ObjectMap<K,V>keySet in interface Map<K,V>keySet in class AbstractObject2ObjectMap<K,V>Map.keySet()public ObjectCollection<V> values()
AbstractObject2ObjectMapThe view is backed by the set returned by AbstractObject2ObjectMap.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 Object2ObjectMap<K,V>values in interface Map<K,V>values in class AbstractObject2ObjectMap<K,V>Map.values()public Object 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 | ||||||||