public class Int2BooleanArrayMap extends AbstractInt2BooleanMap implements Serializable, Cloneable
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.
AbstractInt2BooleanMap.BasicEntry
Int2BooleanMap.Entry, Int2BooleanMap.FastEntrySet
Constructor and Description |
---|
Int2BooleanArrayMap()
Creates a new empty array map.
|
Int2BooleanArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Int2BooleanArrayMap(int[] key,
boolean[] value)
Creates a new empty array map with given key and value backing arrays.
|
Int2BooleanArrayMap(int[] key,
boolean[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements.
|
Int2BooleanArrayMap(Int2BooleanMap m)
Creates a new empty array map copying the entries of a given map.
|
Int2BooleanArrayMap(Map<? extends Integer,? extends Boolean> m)
Creates a new empty array map copying the entries of a given map.
|
Modifier and Type | Method and Description |
---|---|
void |
clear()
Removes all associations from this function (optional operation).
|
Int2BooleanArrayMap |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(int k)
Checks whether the given value is contained in
AbstractInt2BooleanMap.keySet() . |
boolean |
containsValue(boolean v)
Checks whether the given value is contained in
AbstractInt2BooleanMap.values() . |
boolean |
get(int k)
Returns the value to which the given key is mapped.
|
Int2BooleanMap.FastEntrySet |
int2BooleanEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
boolean |
isEmpty() |
IntSet |
keySet()
Returns a type-specific-set view of the keys of this map.
|
boolean |
put(int k,
boolean v)
Adds a pair to the map.
|
boolean |
remove(int 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.
|
BooleanCollection |
values()
Returns a type-specific-set view of the values of this map.
|
containsValue, entrySet, equals, hashCode, putAll, toString
containsKey, defaultReturnValue, defaultReturnValue, get, put, remove
defaultReturnValue, defaultReturnValue
containsKey, get, put, remove
containsKey, get, put, remove
public Int2BooleanArrayMap(int[] key, boolean[] 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 Int2BooleanArrayMap()
public Int2BooleanArrayMap(int capacity)
capacity
- the initial capacity.public Int2BooleanArrayMap(Int2BooleanMap m)
m
- a map.public Int2BooleanArrayMap(Map<? extends Integer,? extends Boolean> m)
m
- a map.public Int2BooleanArrayMap(int[] key, boolean[] 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
.public Int2BooleanMap.FastEntrySet int2BooleanEntrySet()
Int2BooleanMap
This method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Int2BooleanMap.entrySet()
so that it returns an ObjectSet
of objects of type Map.Entry
(the latter makes it possible to
access keys and values with type-specific methods).
int2BooleanEntrySet
in interface Int2BooleanMap
Int2BooleanMap.entrySet()
public boolean get(int k)
Int2BooleanFunction
get
in interface Int2BooleanFunction
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.
public void clear()
Function
public boolean containsKey(int k)
AbstractInt2BooleanMap
AbstractInt2BooleanMap.keySet()
.containsKey
in interface Int2BooleanFunction
containsKey
in class AbstractInt2BooleanMap
Function.containsKey(Object)
public boolean containsValue(boolean v)
AbstractInt2BooleanMap
AbstractInt2BooleanMap.values()
.containsValue
in interface Int2BooleanMap
containsValue
in class AbstractInt2BooleanMap
Map.containsValue(Object)
public boolean isEmpty()
public boolean put(int k, boolean v)
Int2BooleanFunction
put
in interface Int2BooleanFunction
put
in class AbstractInt2BooleanFunction
k
- the key.v
- the value.Function.put(Object,Object)
public boolean remove(int k)
Int2BooleanFunction
remove
in interface Int2BooleanFunction
remove
in class AbstractInt2BooleanFunction
Function.remove(Object)
public IntSet keySet()
AbstractInt2BooleanMap
The view is backed by the set returned by AbstractInt2BooleanMap.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 Int2BooleanMap
keySet
in interface Map<Integer,Boolean>
keySet
in class AbstractInt2BooleanMap
Map.keySet()
public BooleanCollection values()
AbstractInt2BooleanMap
The view is backed by the set returned by AbstractInt2BooleanMap.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 Int2BooleanMap
values
in interface Map<Integer,Boolean>
values
in class AbstractInt2BooleanMap
Map.values()
public Int2BooleanArrayMap 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.