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