|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectit.unimi.dsi.fastutil.bytes.AbstractByte2ObjectFunction<V>
it.unimi.dsi.fastutil.bytes.AbstractByte2ObjectMap<V>
it.unimi.dsi.fastutil.bytes.AbstractByte2ObjectSortedMap<V>
it.unimi.dsi.fastutil.bytes.Byte2ObjectLinkedOpenHashMap<V>
public class Byte2ObjectLinkedOpenHashMap<V>
A type-specific linked hash map with 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).
This class implements the interface of a sorted map, so to allow easy
access of the iteration order: for instance, you can get the first key
in iteration order with AbstractByte2ObjectSortedMap.firstKey()
without having to create an
iterator; however, this class partially violates the SortedMap
contract because all submap methods throw an exception and comparator()
returns always null
.
The iterators provided by the views of this class using are type-specific
list iterators. However, creation of an
iterator using a starting point is going to be very expensive, as the chosen
starting point must be linearly searched for, unless it is AbstractByte2ObjectSortedMap.lastKey()
,
in which case the iterator is created in constant time.
Note that deletions in a linked table require scanning the list until the element to be removed is found. The only exceptions are the first element, the last element, and deletions performed using an iterator.
Hash
,
HashCommon
,
Serialized FormNested Class Summary |
---|
Nested classes/interfaces inherited from class it.unimi.dsi.fastutil.bytes.AbstractByte2ObjectMap |
---|
AbstractByte2ObjectMap.BasicEntry<V> |
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.Hash |
---|
Hash.Strategy<K> |
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.bytes.Byte2ObjectSortedMap |
---|
Byte2ObjectSortedMap.FastSortedEntrySet<V> |
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.bytes.Byte2ObjectMap |
---|
Byte2ObjectMap.Entry<V>, Byte2ObjectMap.FastEntrySet<V> |
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 | |
---|---|
Byte2ObjectLinkedOpenHashMap()
Creates a new hash map with Hash.DEFAULT_INITIAL_SIZE entries
and Hash.DEFAULT_LOAD_FACTOR as load factor. |
|
Byte2ObjectLinkedOpenHashMap(byte[] k,
V[] v)
Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor using the elements of two parallel arrays. |
|
Byte2ObjectLinkedOpenHashMap(byte[] k,
V[] v,
float f)
Creates a new hash map using the elements of two parallel arrays. |
|
Byte2ObjectLinkedOpenHashMap(Byte2ObjectMap<V> m)
Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor copying a given type-specific one. |
|
Byte2ObjectLinkedOpenHashMap(Byte2ObjectMap<V> m,
float f)
Creates a new hash map copying a given type-specific one. |
|
Byte2ObjectLinkedOpenHashMap(int n)
Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor. |
|
Byte2ObjectLinkedOpenHashMap(int n,
float f)
Creates a new hash map. |
|
Byte2ObjectLinkedOpenHashMap(Map<? extends Byte,? extends V> m)
Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor copying a given one. |
|
Byte2ObjectLinkedOpenHashMap(Map<? extends Byte,? extends V> m,
float f)
Creates a new hash map copying a given one. |
Method Summary | |
---|---|
Byte2ObjectSortedMap.FastSortedEntrySet<V> |
byte2ObjectEntrySet()
Returns a type-specific sorted-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. |
ByteComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering. |
boolean |
containsKey(byte k)
Checks whether the given value is contained in AbstractByte2ObjectMap.keySet() . |
boolean |
containsValue(Object v)
Checks whether the given value is contained in AbstractByte2ObjectMap.values() . |
byte |
firstByteKey()
Returns the first key of this map in iteration order. |
V |
get(byte k)
Returns the value to which the given key is mapped. |
V |
get(Byte ok)
|
int |
growthFactor()
Gets the growth factor. |
void |
growthFactor(int growthFactor)
Sets the growth factor. |
int |
hashCode()
Returns a hash code for this map. |
Byte2ObjectSortedMap<V> |
headMap(byte to)
Returns a view of the portion of this sorted map whose keys are strictly less than toKey . |
boolean |
isEmpty()
|
ByteSortedSet |
keySet()
Returns a type-specific-sorted-set view of the keys of this map. |
byte |
lastByteKey()
Returns the last key of this map in iteration order. |
V |
put(byte k,
V v)
Adds a pair to the map. |
V |
put(Byte ok,
V ov)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key. |
boolean |
rehash()
Rehashes this map without changing the table size. |
V |
remove(byte k)
Removes the mapping with the given key. |
V |
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. |
Byte2ObjectSortedMap<V> |
subMap(byte from,
byte to)
Returns a view of the portion of this sorted map whose keys range from fromKey , inclusive, to toKey , exclusive. |
Byte2ObjectSortedMap<V> |
tailMap(byte from)
Returns a view of the portion of this sorted map whose keys are greater than or equal to fromKey . |
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. |
ObjectCollection<V> |
values()
Returns a type-specific collection view of the values contained in this map. |
Methods inherited from class it.unimi.dsi.fastutil.bytes.AbstractByte2ObjectSortedMap |
---|
entrySet, firstKey, headMap, lastKey, subMap, tailMap |
Methods inherited from class it.unimi.dsi.fastutil.bytes.AbstractByte2ObjectMap |
---|
equals, putAll, toString |
Methods inherited from class it.unimi.dsi.fastutil.bytes.AbstractByte2ObjectFunction |
---|
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.bytes.Byte2ObjectFunction |
---|
defaultReturnValue, defaultReturnValue |
Methods inherited from interface it.unimi.dsi.fastutil.Function |
---|
containsKey, get |
Methods inherited from interface java.util.Map |
---|
containsKey, equals, get, putAll |
Field Detail |
---|
public static final long serialVersionUID
Constructor Detail |
---|
public Byte2ObjectLinkedOpenHashMap(int n, float f)
n
/f
.
n
- the expected number of elements in the hash map.f
- the load factor.Hash.PRIMES
public Byte2ObjectLinkedOpenHashMap(int n)
Hash.DEFAULT_LOAD_FACTOR
as load factor.
n
- the expected number of elements in the hash map.public Byte2ObjectLinkedOpenHashMap()
Hash.DEFAULT_INITIAL_SIZE
entries
and Hash.DEFAULT_LOAD_FACTOR
as load factor.
public Byte2ObjectLinkedOpenHashMap(Map<? extends Byte,? extends V> m, float f)
m
- a Map
to be copied into the new hash map.f
- the load factor.public Byte2ObjectLinkedOpenHashMap(Map<? extends Byte,? extends V> m)
Hash.DEFAULT_LOAD_FACTOR
as load factor copying a given one.
m
- a Map
to be copied into the new hash map.public Byte2ObjectLinkedOpenHashMap(Byte2ObjectMap<V> m, float f)
m
- a type-specific map to be copied into the new hash map.f
- the load factor.public Byte2ObjectLinkedOpenHashMap(Byte2ObjectMap<V> 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 Byte2ObjectLinkedOpenHashMap(byte[] k, V[] 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 Byte2ObjectLinkedOpenHashMap(byte[] k, V[] 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 V put(byte k, V v)
Byte2ObjectFunction
put
in interface Byte2ObjectFunction<V>
put
in class AbstractByte2ObjectFunction<V>
k
- the key.v
- the value.
Function.put(Object,Object)
public V put(Byte ok, V ov)
AbstractByte2ObjectFunction
null
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<Byte,V>
put
in interface Map<Byte,V>
put
in class AbstractByte2ObjectFunction<V>
ok
- the key.ov
- the value.
null
if no value was present for the given key.Map.put(Object,Object)
public boolean containsValue(Object v)
AbstractByte2ObjectMap
AbstractByte2ObjectMap.values()
.
containsValue
in interface Map<Byte,V>
containsValue
in class AbstractByte2ObjectMap<V>
public void clear()
Function
clear
in interface Function<Byte,V>
clear
in interface Map<Byte,V>
clear
in class AbstractByte2ObjectFunction<V>
Map.clear()
public byte firstByteKey()
firstByteKey
in interface Byte2ObjectSortedMap<V>
SortedMap.firstKey()
public byte lastByteKey()
lastByteKey
in interface Byte2ObjectSortedMap<V>
SortedMap.lastKey()
public ByteComparator comparator()
Byte2ObjectSortedMap
Note that this specification strengthens the one given in SortedMap.comparator()
.
comparator
in interface Byte2ObjectSortedMap<V>
comparator
in interface SortedMap<Byte,V>
SortedMap.comparator()
public Byte2ObjectSortedMap<V> tailMap(byte from)
Byte2ObjectSortedMap
fromKey
.
tailMap
in interface Byte2ObjectSortedMap<V>
SortedMap.tailMap(Object)
public Byte2ObjectSortedMap<V> headMap(byte to)
Byte2ObjectSortedMap
toKey
.
headMap
in interface Byte2ObjectSortedMap<V>
SortedMap.headMap(Object)
public Byte2ObjectSortedMap<V> subMap(byte from, byte to)
Byte2ObjectSortedMap
fromKey
, inclusive, to toKey
, exclusive.
subMap
in interface Byte2ObjectSortedMap<V>
SortedMap.subMap(Object,Object)
public boolean containsKey(byte k)
AbstractByte2ObjectMap
AbstractByte2ObjectMap.keySet()
.
containsKey
in interface Byte2ObjectFunction<V>
containsKey
in class AbstractByte2ObjectMap<V>
Function.containsKey(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.
size
in interface Function<Byte,V>
size
in interface Map<Byte,V>
public boolean isEmpty()
isEmpty
in interface Map<Byte,V>
isEmpty
in class AbstractByte2ObjectMap<V>
public V get(byte k)
Byte2ObjectFunction
get
in interface Byte2ObjectFunction<V>
k
- the key.
Function.get(Object)
public V remove(byte k)
Byte2ObjectFunction
remove
in interface Byte2ObjectFunction<V>
remove
in class AbstractByte2ObjectFunction<V>
Function.remove(Object)
public V get(Byte ok)
public V remove(Object ok)
AbstractByte2ObjectFunction
null
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<Byte,V>
remove
in interface Map<Byte,V>
remove
in class AbstractByte2ObjectFunction<V>
null
if no value was present for the given key.Map.remove(Object)
public Byte2ObjectSortedMap.FastSortedEntrySet<V> byte2ObjectEntrySet()
Byte2ObjectSortedMap
byte2ObjectEntrySet
in interface Byte2ObjectMap<V>
byte2ObjectEntrySet
in interface Byte2ObjectSortedMap<V>
Byte2ObjectSortedMap.entrySet()
public ByteSortedSet keySet()
AbstractByte2ObjectSortedMap
The view is backed by the sorted set returned by AbstractByte2ObjectSortedMap.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 Byte2ObjectMap<V>
keySet
in interface Byte2ObjectSortedMap<V>
keySet
in interface Map<Byte,V>
keySet
in interface SortedMap<Byte,V>
keySet
in class AbstractByte2ObjectSortedMap<V>
Map.keySet()
public ObjectCollection<V> values()
AbstractByte2ObjectSortedMap
The view is backed by the sorted set returned by AbstractByte2ObjectSortedMap.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 Byte2ObjectMap<V>
values
in interface Byte2ObjectSortedMap<V>
values
in interface Map<Byte,V>
values
in interface SortedMap<Byte,V>
values
in class AbstractByte2ObjectSortedMap<V>
Map.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 Object
public 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<Byte,V>
hashCode
in class AbstractByte2ObjectMap<V>
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |