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