|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectit.unimi.dsi.fastutil.objects.AbstractReference2LongFunction<K>
it.unimi.dsi.fastutil.objects.AbstractReference2LongMap<K>
it.unimi.dsi.fastutil.objects.Reference2LongArrayMap<K>
public class Reference2LongArrayMap<K>
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.AbstractReference2LongMap |
---|
AbstractReference2LongMap.BasicEntry<K> |
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.objects.Reference2LongMap |
---|
Reference2LongMap.Entry<K>, Reference2LongMap.FastEntrySet<K> |
Constructor Summary | |
---|---|
Reference2LongArrayMap()
Creates a new empty array map. |
|
Reference2LongArrayMap(int capacity)
Creates a new empty array map of given capacity. |
|
Reference2LongArrayMap(Object[] key,
long[] value)
Creates a new empty array map with given key and value backing arrays. |
|
Reference2LongArrayMap(Object[] key,
long[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements. |
|
Reference2LongArrayMap(Reference2LongMap<K> 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 AbstractReference2LongMap.keySet() . |
boolean |
containsValue(long v)
Checks whether the given value is contained in AbstractReference2LongMap.values() . |
long |
getLong(Object k)
Returns the value to which the given key is mapped. |
boolean |
isEmpty()
|
ReferenceSet<K> |
keySet()
Returns a type-specific-set view of the keys of this map. |
long |
put(K k,
long v)
Adds a pair to the map. |
Reference2LongMap.FastEntrySet<K> |
reference2LongEntrySet()
Returns a type-specific set view of the mappings contained in this map. |
long |
removeLong(Object 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. |
LongCollection |
values()
Returns a type-specific-set view of the values of this map. |
Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractReference2LongMap |
---|
containsValue, entrySet, equals, hashCode, putAll, toString |
Methods inherited from class it.unimi.dsi.fastutil.objects.AbstractReference2LongFunction |
---|
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.objects.Reference2LongFunction |
---|
defaultReturnValue, defaultReturnValue |
Methods inherited from interface it.unimi.dsi.fastutil.Function |
---|
get, put, remove |
Methods inherited from interface java.util.Map |
---|
get, put, remove |
Constructor Detail |
---|
public Reference2LongArrayMap(Object[] key, long[] value)
key
- the key array.value
- the value array (it must have the same length as key
).public Reference2LongArrayMap()
public Reference2LongArrayMap(int capacity)
capacity
- the initial capacity.public Reference2LongArrayMap(Reference2LongMap<K> m)
m
- a map.public Reference2LongArrayMap(Object[] key, long[] 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 Reference2LongMap.FastEntrySet<K> reference2LongEntrySet()
Reference2LongMap
This method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Reference2LongMap.entrySet()
so that it returns an ObjectSet
of objects of type Reference2LongMap.Entry
(the latter makes it possible to
access keys and values with type-specific methods).
reference2LongEntrySet
in interface Reference2LongMap<K>
Reference2LongMap.entrySet()
public long getLong(Object k)
Reference2LongFunction
getLong
in interface Reference2LongFunction<K>
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<K,Long>
size
in interface Map<K,Long>
public void clear()
Function
clear
in interface Function<K,Long>
clear
in interface Map<K,Long>
clear
in class AbstractReference2LongFunction<K>
Map.clear()
public boolean containsKey(Object k)
AbstractReference2LongMap
AbstractReference2LongMap.keySet()
.
containsKey
in interface Function<K,Long>
containsKey
in interface Map<K,Long>
containsKey
in class AbstractReference2LongMap<K>
k
- the key.
key
.Map.containsKey(Object)
public boolean containsValue(long v)
AbstractReference2LongMap
AbstractReference2LongMap.values()
.
containsValue
in interface Reference2LongMap<K>
containsValue
in class AbstractReference2LongMap<K>
Map.containsValue(Object)
public boolean isEmpty()
isEmpty
in interface Map<K,Long>
isEmpty
in class AbstractReference2LongMap<K>
public long put(K k, long v)
Reference2LongFunction
put
in interface Reference2LongFunction<K>
put
in class AbstractReference2LongFunction<K>
k
- the key.v
- the value.
Function.put(Object,Object)
public long removeLong(Object k)
Reference2LongFunction
removeLong
in interface Reference2LongFunction<K>
removeLong
in class AbstractReference2LongFunction<K>
Function.remove(Object)
public ReferenceSet<K> keySet()
AbstractReference2LongMap
The view is backed by the set returned by AbstractReference2LongMap.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 Reference2LongMap<K>
keySet
in interface Map<K,Long>
keySet
in class AbstractReference2LongMap<K>
Map.keySet()
public LongCollection values()
AbstractReference2LongMap
The view is backed by the set returned by AbstractReference2LongMap.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 Reference2LongMap<K>
values
in interface Map<K,Long>
values
in class AbstractReference2LongMap<K>
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 |