|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectit.unimi.dsi.fastutil.doubles.AbstractDouble2ByteFunction
it.unimi.dsi.fastutil.doubles.AbstractDouble2ByteMap
it.unimi.dsi.fastutil.doubles.Double2ByteArrayMap
public class Double2ByteArrayMap
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.AbstractDouble2ByteMap |
---|
AbstractDouble2ByteMap.BasicEntry |
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.doubles.Double2ByteMap |
---|
Double2ByteMap.Entry, Double2ByteMap.FastEntrySet |
Constructor Summary | |
---|---|
Double2ByteArrayMap()
Creates a new empty array map. |
|
Double2ByteArrayMap(double[] key,
byte[] value)
Creates a new empty array map with given key and value backing arrays. |
|
Double2ByteArrayMap(double[] key,
byte[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements. |
|
Double2ByteArrayMap(Double2ByteMap m)
Creates a new empty array map copying the entries of a given map. |
|
Double2ByteArrayMap(int capacity)
Creates a new empty array map of given capacity. |
|
Double2ByteArrayMap(Map<? extends Double,? extends Byte> 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). |
Double2ByteArrayMap |
clone()
Returns a deep copy of this map. |
boolean |
containsKey(double k)
Checks whether the given value is contained in AbstractDouble2ByteMap.keySet() . |
boolean |
containsValue(byte v)
Checks whether the given value is contained in AbstractDouble2ByteMap.values() . |
Double2ByteMap.FastEntrySet |
double2ByteEntrySet()
Returns a type-specific set view of the mappings contained in this map. |
byte |
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. |
byte |
put(double k,
byte v)
Adds a pair to the map. |
byte |
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. |
ByteCollection |
values()
Returns a type-specific-set view of the values of this map. |
Methods inherited from class it.unimi.dsi.fastutil.doubles.AbstractDouble2ByteMap |
---|
containsValue, entrySet, equals, hashCode, putAll, toString |
Methods inherited from class it.unimi.dsi.fastutil.doubles.AbstractDouble2ByteFunction |
---|
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.Double2ByteFunction |
---|
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 Double2ByteArrayMap(double[] key, byte[] 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 Double2ByteArrayMap()
public Double2ByteArrayMap(int capacity)
capacity
- the initial capacity.public Double2ByteArrayMap(Double2ByteMap m)
m
- a map.public Double2ByteArrayMap(Map<? extends Double,? extends Byte> m)
m
- a map.public Double2ByteArrayMap(double[] key, byte[] 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 Double2ByteMap.FastEntrySet double2ByteEntrySet()
Double2ByteMap
This method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Double2ByteMap.entrySet()
so that it returns an ObjectSet
of objects of type Double2ByteMap.Entry
(the latter makes it possible to
access keys and values with type-specific methods).
double2ByteEntrySet
in interface Double2ByteMap
Double2ByteMap.entrySet()
public byte get(double k)
Double2ByteFunction
get
in interface Double2ByteFunction
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,Byte>
size
in interface Map<Double,Byte>
public void clear()
Function
clear
in interface Function<Double,Byte>
clear
in interface Map<Double,Byte>
clear
in class AbstractDouble2ByteFunction
Map.clear()
public boolean containsKey(double k)
AbstractDouble2ByteMap
AbstractDouble2ByteMap.keySet()
.
containsKey
in interface Double2ByteFunction
containsKey
in class AbstractDouble2ByteMap
Function.containsKey(Object)
public boolean containsValue(byte v)
AbstractDouble2ByteMap
AbstractDouble2ByteMap.values()
.
containsValue
in interface Double2ByteMap
containsValue
in class AbstractDouble2ByteMap
Map.containsValue(Object)
public boolean isEmpty()
isEmpty
in interface Map<Double,Byte>
isEmpty
in class AbstractDouble2ByteMap
public byte put(double k, byte v)
Double2ByteFunction
put
in interface Double2ByteFunction
put
in class AbstractDouble2ByteFunction
k
- the key.v
- the value.
Function.put(Object,Object)
public byte remove(double k)
Double2ByteFunction
remove
in interface Double2ByteFunction
remove
in class AbstractDouble2ByteFunction
Function.remove(Object)
public DoubleSet keySet()
AbstractDouble2ByteMap
The view is backed by the set returned by AbstractDouble2ByteMap.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 Double2ByteMap
keySet
in interface Map<Double,Byte>
keySet
in class AbstractDouble2ByteMap
Map.keySet()
public ByteCollection values()
AbstractDouble2ByteMap
The view is backed by the set returned by AbstractDouble2ByteMap.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 Double2ByteMap
values
in interface Map<Double,Byte>
values
in class AbstractDouble2ByteMap
Map.values()
public Double2ByteArrayMap 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 |