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