|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectit.unimi.dsi.fastutil.chars.AbstractChar2BooleanFunction
it.unimi.dsi.fastutil.chars.AbstractChar2BooleanMap
it.unimi.dsi.fastutil.chars.Char2BooleanOpenHashMap
public class Char2BooleanOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
Instances of this class use a hash table to represent a map. The table is
enlarged as needed when new entries are created, but it is never made
smaller (even on a clear()). A family of trimming
methods lets you control the size of the table; this is particularly useful
if you reuse instances of this class.
The enlargement speed is controlled by the growth factor, a
positive number. If the growth factor is p, then the table is
enlarged each time roughly by a factor 2p/16. By default, p is
Hash.DEFAULT_GROWTH_FACTOR, which means that the table is doubled at
each enlargement, but one can easily set more or less aggressive policies by
calling growthFactor(int) (note that the growth factor is not serialized:
deserialized tables gets the default growth factor).
Hash,
HashCommon,
Serialized Form| Nested Class Summary |
|---|
| Nested classes/interfaces inherited from class it.unimi.dsi.fastutil.chars.AbstractChar2BooleanMap |
|---|
AbstractChar2BooleanMap.BasicEntry |
| Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.Hash |
|---|
Hash.Strategy<K> |
| Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.chars.Char2BooleanMap |
|---|
Char2BooleanMap.Entry, Char2BooleanMap.FastEntrySet |
| Field Summary | |
|---|---|
static long |
serialVersionUID
|
| Fields inherited from interface it.unimi.dsi.fastutil.Hash |
|---|
DEFAULT_GROWTH_FACTOR, DEFAULT_INITIAL_SIZE, DEFAULT_LOAD_FACTOR, FAST_LOAD_FACTOR, FREE, OCCUPIED, PRIMES, REMOVED, VERY_FAST_LOAD_FACTOR |
| Constructor Summary | |
|---|---|
Char2BooleanOpenHashMap()
Creates a new hash map with Hash.DEFAULT_INITIAL_SIZE entries
and Hash.DEFAULT_LOAD_FACTOR as load factor. |
|
Char2BooleanOpenHashMap(char[] k,
boolean[] v)
Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor using the elements of two parallel arrays. |
|
Char2BooleanOpenHashMap(char[] k,
boolean[] v,
float f)
Creates a new hash map using the elements of two parallel arrays. |
|
Char2BooleanOpenHashMap(Char2BooleanMap m)
Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor copying a given type-specific one. |
|
Char2BooleanOpenHashMap(Char2BooleanMap m,
float f)
Creates a new hash map copying a given type-specific one. |
|
Char2BooleanOpenHashMap(int n)
Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor. |
|
Char2BooleanOpenHashMap(int n,
float f)
Creates a new hash map. |
|
Char2BooleanOpenHashMap(Map<? extends Character,? extends Boolean> m)
Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor copying a given one. |
|
Char2BooleanOpenHashMap(Map<? extends Character,? extends Boolean> m,
float f)
Creates a new hash map copying a given one. |
|
| Method Summary | |
|---|---|
Char2BooleanMap.FastEntrySet |
char2BooleanEntrySet()
Returns a type-specific set view of the mappings contained in this map. |
void |
clear()
Removes all associations from this function (optional operation). |
Object |
clone()
Returns a deep copy of this map. |
boolean |
containsKey(char k)
Checks whether the given value is contained in AbstractChar2BooleanMap.keySet(). |
boolean |
containsValue(boolean v)
Checks whether the given value is contained in AbstractChar2BooleanMap.values(). |
boolean |
get(char k)
Returns the value to which the given key is mapped. |
Boolean |
get(Character ok)
|
int |
growthFactor()
Gets the growth factor. |
void |
growthFactor(int growthFactor)
Sets the growth factor. |
int |
hashCode()
Returns a hash code for this map. |
boolean |
isEmpty()
|
CharSet |
keySet()
Returns a type-specific-set view of the keys of this map. |
Boolean |
put(Character ok,
Boolean ov)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key. |
boolean |
put(char k,
boolean v)
Adds a pair to the map. |
boolean |
rehash()
Rehashes this map without changing the table size. |
boolean |
remove(char k)
Removes the mapping with the given key. |
Boolean |
remove(Object ok)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key. |
int |
size()
Returns the intended number of keys in this function, or -1 if no such number exists. |
boolean |
trim()
Rehashes the map, making the table as small as possible. |
boolean |
trim(int n)
Rehashes this map if the table is too large. |
BooleanCollection |
values()
Returns a type-specific-set view of the values of this map. |
| Methods inherited from class it.unimi.dsi.fastutil.chars.AbstractChar2BooleanMap |
|---|
containsValue, entrySet, equals, putAll, toString |
| Methods inherited from class it.unimi.dsi.fastutil.chars.AbstractChar2BooleanFunction |
|---|
containsKey, defaultReturnValue, defaultReturnValue, get |
| Methods inherited from class java.lang.Object |
|---|
getClass, notify, notifyAll, wait, wait, wait |
| Methods inherited from interface it.unimi.dsi.fastutil.chars.Char2BooleanFunction |
|---|
defaultReturnValue, defaultReturnValue |
| Methods inherited from interface it.unimi.dsi.fastutil.Function |
|---|
containsKey, get |
| Methods inherited from interface java.util.Map |
|---|
containsKey, get |
| Field Detail |
|---|
public static final long serialVersionUID
| Constructor Detail |
|---|
public Char2BooleanOpenHashMap(int n,
float f)
n/f.
n - the expected number of elements in the hash map.f - the load factor.Hash.PRIMESpublic Char2BooleanOpenHashMap(int n)
Hash.DEFAULT_LOAD_FACTOR as load factor.
n - the expected number of elements in the hash map.public Char2BooleanOpenHashMap()
Hash.DEFAULT_INITIAL_SIZE entries
and Hash.DEFAULT_LOAD_FACTOR as load factor.
public Char2BooleanOpenHashMap(Map<? extends Character,? extends Boolean> m,
float f)
m - a Map to be copied into the new hash map.f - the load factor.public Char2BooleanOpenHashMap(Map<? extends Character,? extends Boolean> m)
Hash.DEFAULT_LOAD_FACTOR as load factor copying a given one.
m - a Map to be copied into the new hash map.
public Char2BooleanOpenHashMap(Char2BooleanMap m,
float f)
m - a type-specific map to be copied into the new hash map.f - the load factor.public Char2BooleanOpenHashMap(Char2BooleanMap m)
Hash.DEFAULT_LOAD_FACTOR as load factor copying a given type-specific one.
m - a type-specific map to be copied into the new hash map.
public Char2BooleanOpenHashMap(char[] k,
boolean[] v,
float f)
k - the array of keys of the new hash map.v - the array of corresponding values in the new hash map.f - the load factor.
IllegalArgumentException - if k and v have different lengths.
public Char2BooleanOpenHashMap(char[] k,
boolean[] v)
Hash.DEFAULT_LOAD_FACTOR as load factor using the elements of two parallel arrays.
k - the array of keys of the new hash map.v - the array of corresponding values in the new hash map.
IllegalArgumentException - if k and v have different lengths.| Method Detail |
|---|
public void growthFactor(int growthFactor)
growthFactor - the new growth factor; it must be positive.public int growthFactor()
growthFactor(int)
public boolean put(char k,
boolean v)
Char2BooleanFunction
put in interface Char2BooleanFunctionput in class AbstractChar2BooleanFunctionk - the key.v - the value.
Function.put(Object,Object)
public Boolean put(Character ok,
Boolean ov)
AbstractChar2BooleanFunctionnull on a missing key.
This method must check whether the provided key is in the map using containsKey(). Thus,
it probes the map twice. Implementors of subclasses should override it with a more efficient method.
put in interface Function<Character,Boolean>put in interface Map<Character,Boolean>put in class AbstractChar2BooleanFunctionok - the key.ov - the value.
null if no value was present for the given key.Map.put(Object,Object)public boolean containsValue(boolean v)
AbstractChar2BooleanMapAbstractChar2BooleanMap.values().
containsValue in interface Char2BooleanMapcontainsValue in class AbstractChar2BooleanMapMap.containsValue(Object)public void clear()
Function
clear in interface Function<Character,Boolean>clear in interface Map<Character,Boolean>clear in class AbstractChar2BooleanFunctionMap.clear()public boolean containsKey(char k)
AbstractChar2BooleanMapAbstractChar2BooleanMap.keySet().
containsKey in interface Char2BooleanFunctioncontainsKey in class AbstractChar2BooleanMapFunction.containsKey(Object)public int size()
FunctionMost 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<Character,Boolean>size in interface Map<Character,Boolean>public boolean isEmpty()
isEmpty in interface Map<Character,Boolean>isEmpty in class AbstractChar2BooleanMappublic boolean get(char k)
Char2BooleanFunction
get in interface Char2BooleanFunctionk - the key.
Function.get(Object)public boolean remove(char k)
Char2BooleanFunction
remove in interface Char2BooleanFunctionremove in class AbstractChar2BooleanFunctionFunction.remove(Object)public Boolean get(Character ok)
public Boolean remove(Object ok)
AbstractChar2BooleanFunctionnull on a missing key.
This method must check whether the provided key is in the map using containsKey(). Thus,
it probes the map twice. Implementors of subclasses should override it with a more efficient method.
remove in interface Function<Character,Boolean>remove in interface Map<Character,Boolean>remove in class AbstractChar2BooleanFunctionnull if no value was present for the given key.Map.remove(Object)public Char2BooleanMap.FastEntrySet char2BooleanEntrySet()
Char2BooleanMapThis method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Char2BooleanMap.entrySet()
so that it returns an ObjectSet
of objects of type Char2BooleanMap.Entry (the latter makes it possible to
access keys and values with type-specific methods).
char2BooleanEntrySet in interface Char2BooleanMapChar2BooleanMap.entrySet()public CharSet keySet()
AbstractChar2BooleanMapThe view is backed by the set returned by AbstractChar2BooleanMap.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 Char2BooleanMapkeySet in interface Map<Character,Boolean>keySet in class AbstractChar2BooleanMapMap.keySet()public BooleanCollection values()
AbstractChar2BooleanMapThe view is backed by the set returned by AbstractChar2BooleanMap.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 Char2BooleanMapvalues in interface Map<Character,Boolean>values in class AbstractChar2BooleanMapMap.values()public boolean rehash()
This method should be called when the map underwent numerous deletions and insertions. In this case, free entries become rare, and unsuccessful searches require probing all entries. For reasonable load factors this method is linear in the number of entries. You will need as much additional free memory as that occupied by the table.
If you need to reduce the table siza to fit exactly
this map, you must use trim().
true if there was enough memory to rehash the map, false otherwise.trim()public boolean trim()
This method rehashes to the smallest size satisfying the load factor. It can be used when the map will not be changed anymore, so to optimize access speed (by collecting deleted entries) and size.
If the table size is already the minimum possible, this method
does nothing. If you want to guarantee rehashing, use rehash().
trim(int),
rehash()public boolean trim(int n)
Let N be the smallest table size that can hold
max(n, entries, still satisfying the load factor. If the current
table size is smaller than or equal to N, this method does
nothing. Otherwise, it rehashes this map in a table of size
N.
size())
This method is useful when reusing maps. Clearing a map leaves the table size untouched. If you are reusing a map many times, you can call this method with a typical size to avoid keeping around a very large table just because of a few large transient maps.
n - the threshold for the trimming.
trim(),
rehash()public Object 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 Objectpublic int hashCode()
equals() is not overriden, it is important
that the value returned by this method is the same value as
the one returned by the overriden method.
hashCode in interface Map<Character,Boolean>hashCode in class AbstractChar2BooleanMap
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||