public class Long2BooleanArrayMap extends AbstractLong2BooleanMap 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.
AbstractLong2BooleanMap.BasicEntry
Long2BooleanMap.Entry, Long2BooleanMap.FastEntrySet
Constructor and Description |
---|
Long2BooleanArrayMap()
Creates a new empty array map.
|
Long2BooleanArrayMap(int capacity)
Creates a new empty array map of given capacity.
|
Long2BooleanArrayMap(long[] key,
boolean[] value)
Creates a new empty array map with given key and value backing arrays.
|
Long2BooleanArrayMap(long[] key,
boolean[] value,
int size)
Creates a new array map with given key and value backing arrays, using the given number of elements.
|
Long2BooleanArrayMap(Long2BooleanMap m)
Creates a new empty array map copying the entries of a given map.
|
Long2BooleanArrayMap(Map<? extends Long,? 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).
|
Long2BooleanArrayMap |
clone()
Returns a deep copy of this map.
|
boolean |
containsKey(long k)
Checks whether the given value is contained in
AbstractLong2BooleanMap.keySet() . |
boolean |
containsValue(boolean v)
Checks whether the given value is contained in
AbstractLong2BooleanMap.values() . |
boolean |
get(long k)
Returns the value to which the given key is mapped.
|
boolean |
isEmpty() |
LongSet |
keySet()
Returns a type-specific-set view of the keys of this map.
|
Long2BooleanMap.FastEntrySet |
long2BooleanEntrySet()
Returns a type-specific set view of the mappings contained in this map.
|
boolean |
put(long k,
boolean v)
Adds a pair to the map.
|
boolean |
remove(long 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 Long2BooleanArrayMap(long[] 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 Long2BooleanArrayMap()
public Long2BooleanArrayMap(int capacity)
capacity
- the initial capacity.public Long2BooleanArrayMap(Long2BooleanMap m)
m
- a map.public Long2BooleanArrayMap(Map<? extends Long,? extends Boolean> m)
m
- a map.public Long2BooleanArrayMap(long[] 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 Long2BooleanMap.FastEntrySet long2BooleanEntrySet()
Long2BooleanMap
This method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Long2BooleanMap.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).
long2BooleanEntrySet
in interface Long2BooleanMap
Long2BooleanMap.entrySet()
public boolean get(long k)
Long2BooleanFunction
get
in interface Long2BooleanFunction
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(long k)
AbstractLong2BooleanMap
AbstractLong2BooleanMap.keySet()
.containsKey
in interface Long2BooleanFunction
containsKey
in class AbstractLong2BooleanMap
Function.containsKey(Object)
public boolean containsValue(boolean v)
AbstractLong2BooleanMap
AbstractLong2BooleanMap.values()
.containsValue
in interface Long2BooleanMap
containsValue
in class AbstractLong2BooleanMap
Map.containsValue(Object)
public boolean isEmpty()
public boolean put(long k, boolean v)
Long2BooleanFunction
put
in interface Long2BooleanFunction
put
in class AbstractLong2BooleanFunction
k
- the key.v
- the value.Function.put(Object,Object)
public boolean remove(long k)
Long2BooleanFunction
remove
in interface Long2BooleanFunction
remove
in class AbstractLong2BooleanFunction
k
- the key.Function.remove(Object)
public LongSet keySet()
AbstractLong2BooleanMap
The view is backed by the set returned by AbstractLong2BooleanMap.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 Long2BooleanMap
keySet
in interface Map<Long,Boolean>
keySet
in class AbstractLong2BooleanMap
Map.keySet()
public BooleanCollection values()
AbstractLong2BooleanMap
The view is backed by the set returned by AbstractLong2BooleanMap.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 Long2BooleanMap
values
in interface Map<Long,Boolean>
values
in class AbstractLong2BooleanMap
Map.values()
public Long2BooleanArrayMap 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.