|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectit.unimi.dsi.fastutil.ints.AbstractInt2LongFunction
it.unimi.dsi.fastutil.ints.AbstractInt2LongMap
it.unimi.dsi.fastutil.ints.AbstractInt2LongSortedMap
it.unimi.dsi.fastutil.ints.Int2LongLinkedOpenHashMap
public class Int2LongLinkedOpenHashMap
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 AbstractInt2LongSortedMap.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 AbstractInt2LongSortedMap.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.ints.AbstractInt2LongMap |
---|
AbstractInt2LongMap.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.ints.Int2LongSortedMap |
---|
Int2LongSortedMap.FastSortedEntrySet |
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.ints.Int2LongMap |
---|
Int2LongMap.Entry, Int2LongMap.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 | |
---|---|
Int2LongLinkedOpenHashMap()
Creates a new hash map with Hash.DEFAULT_INITIAL_SIZE entries
and Hash.DEFAULT_LOAD_FACTOR as load factor. |
|
Int2LongLinkedOpenHashMap(int n)
Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor. |
|
Int2LongLinkedOpenHashMap(int[] k,
long[] v)
Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor using the elements of two parallel arrays. |
|
Int2LongLinkedOpenHashMap(int[] k,
long[] v,
float f)
Creates a new hash map using the elements of two parallel arrays. |
|
Int2LongLinkedOpenHashMap(Int2LongMap m)
Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor copying a given type-specific one. |
|
Int2LongLinkedOpenHashMap(Int2LongMap m,
float f)
Creates a new hash map copying a given type-specific one. |
|
Int2LongLinkedOpenHashMap(int n,
float f)
Creates a new hash map. |
|
Int2LongLinkedOpenHashMap(Map<? extends Integer,? extends Long> m)
Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor copying a given one. |
|
Int2LongLinkedOpenHashMap(Map<? extends Integer,? extends Long> m,
float f)
Creates a new hash map copying a given one. |
Method Summary | |
---|---|
void |
clear()
Removes all associations from this function (optional operation). |
Object |
clone()
Returns a deep copy of this map. |
IntComparator |
comparator()
Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering. |
boolean |
containsKey(int k)
Checks whether the given value is contained in AbstractInt2LongMap.keySet() . |
boolean |
containsValue(long v)
Checks whether the given value is contained in AbstractInt2LongMap.values() . |
int |
firstIntKey()
Returns the first key of this map in iteration order. |
long |
get(int k)
Returns the value to which the given key is mapped. |
Long |
get(Integer ok)
|
int |
growthFactor()
Gets the growth factor. |
void |
growthFactor(int growthFactor)
Sets the growth factor. |
int |
hashCode()
Returns a hash code for this map. |
Int2LongSortedMap |
headMap(int to)
Returns a view of the portion of this sorted map whose keys are strictly less than toKey . |
Int2LongSortedMap.FastSortedEntrySet |
int2LongEntrySet()
Returns a type-specific set view of the mappings contained in this map. |
boolean |
isEmpty()
|
IntSortedSet |
keySet()
Returns a type-specific-sorted-set view of the keys of this map. |
int |
lastIntKey()
Returns the last key of this map in iteration order. |
Long |
put(Integer ok,
Long ov)
Delegates to the corresponding type-specific method, taking care of returning null on a missing key. |
long |
put(int k,
long v)
Adds a pair to the map. |
boolean |
rehash()
Rehashes this map without changing the table size. |
long |
remove(int k)
Removes the mapping with the given key. |
Long |
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. |
Int2LongSortedMap |
subMap(int from,
int to)
Returns a view of the portion of this sorted map whose keys range from fromKey , inclusive, to toKey , exclusive. |
Int2LongSortedMap |
tailMap(int 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. |
LongCollection |
values()
Returns a type-specific collection view of the values contained in this map. |
Methods inherited from class it.unimi.dsi.fastutil.ints.AbstractInt2LongSortedMap |
---|
entrySet, firstKey, headMap, lastKey, subMap, tailMap |
Methods inherited from class it.unimi.dsi.fastutil.ints.AbstractInt2LongMap |
---|
containsValue, equals, putAll, toString |
Methods inherited from class it.unimi.dsi.fastutil.ints.AbstractInt2LongFunction |
---|
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.ints.Int2LongFunction |
---|
defaultReturnValue, defaultReturnValue |
Methods inherited from interface it.unimi.dsi.fastutil.Function |
---|
containsKey, get |
Methods inherited from interface java.util.Map |
---|
containsKey, containsValue, equals, get, putAll |
Methods inherited from interface java.util.Map |
---|
containsKey, containsValue, equals, get, putAll |
Field Detail |
---|
public static final long serialVersionUID
Constructor Detail |
---|
public Int2LongLinkedOpenHashMap(int n, float f)
n
/f
.
n
- the expected number of elements in the hash map.f
- the load factor.Hash.PRIMES
public Int2LongLinkedOpenHashMap(int n)
Hash.DEFAULT_LOAD_FACTOR
as load factor.
n
- the expected number of elements in the hash map.public Int2LongLinkedOpenHashMap()
Hash.DEFAULT_INITIAL_SIZE
entries
and Hash.DEFAULT_LOAD_FACTOR
as load factor.
public Int2LongLinkedOpenHashMap(Map<? extends Integer,? extends Long> m, float f)
m
- a Map
to be copied into the new hash map.f
- the load factor.public Int2LongLinkedOpenHashMap(Map<? extends Integer,? extends Long> m)
Hash.DEFAULT_LOAD_FACTOR
as load factor copying a given one.
m
- a Map
to be copied into the new hash map.public Int2LongLinkedOpenHashMap(Int2LongMap m, float f)
m
- a type-specific map to be copied into the new hash map.f
- the load factor.public Int2LongLinkedOpenHashMap(Int2LongMap 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 Int2LongLinkedOpenHashMap(int[] k, long[] 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 Int2LongLinkedOpenHashMap(int[] k, long[] 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 long put(int k, long v)
Int2LongFunction
put
in interface Int2LongFunction
put
in class AbstractInt2LongFunction
k
- the key.v
- the value.
Function.put(Object,Object)
public Long put(Integer ok, Long ov)
AbstractInt2LongFunction
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<Integer,Long>
put
in interface Map<Integer,Long>
put
in class AbstractInt2LongFunction
ok
- the key.ov
- the value.
null
if no value was present for the given key.Map.put(Object,Object)
public boolean containsValue(long v)
AbstractInt2LongMap
AbstractInt2LongMap.values()
.
containsValue
in interface Int2LongMap
containsValue
in class AbstractInt2LongMap
Map.containsValue(Object)
public void clear()
Function
clear
in interface Function<Integer,Long>
clear
in interface Map<Integer,Long>
clear
in class AbstractInt2LongFunction
Map.clear()
public int firstIntKey()
firstIntKey
in interface Int2LongSortedMap
SortedMap.firstKey()
public int lastIntKey()
lastIntKey
in interface Int2LongSortedMap
SortedMap.lastKey()
public IntComparator comparator()
Int2LongSortedMap
Note that this specification strengthens the one given in SortedMap.comparator()
.
comparator
in interface Int2LongSortedMap
comparator
in interface SortedMap<Integer,Long>
SortedMap.comparator()
public Int2LongSortedMap tailMap(int from)
Int2LongSortedMap
fromKey
.
tailMap
in interface Int2LongSortedMap
SortedMap.tailMap(Object)
public Int2LongSortedMap headMap(int to)
Int2LongSortedMap
toKey
.
headMap
in interface Int2LongSortedMap
SortedMap.headMap(Object)
public Int2LongSortedMap subMap(int from, int to)
Int2LongSortedMap
fromKey
, inclusive, to toKey
, exclusive.
subMap
in interface Int2LongSortedMap
SortedMap.subMap(Object,Object)
public boolean containsKey(int k)
AbstractInt2LongMap
AbstractInt2LongMap.keySet()
.
containsKey
in interface Int2LongFunction
containsKey
in class AbstractInt2LongMap
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<Integer,Long>
size
in interface Map<Integer,Long>
public boolean isEmpty()
isEmpty
in interface Map<Integer,Long>
isEmpty
in class AbstractInt2LongMap
public long get(int k)
Int2LongFunction
get
in interface Int2LongFunction
k
- the key.
Function.get(Object)
public long remove(int k)
Int2LongFunction
remove
in interface Int2LongFunction
remove
in class AbstractInt2LongFunction
Function.remove(Object)
public Long get(Integer ok)
public Long remove(Object ok)
AbstractInt2LongFunction
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<Integer,Long>
remove
in interface Map<Integer,Long>
remove
in class AbstractInt2LongFunction
null
if no value was present for the given key.Map.remove(Object)
public Int2LongSortedMap.FastSortedEntrySet int2LongEntrySet()
Int2LongMap
This method is necessary because there is no inheritance along
type parameters: it is thus impossible to strengthen Int2LongMap.entrySet()
so that it returns an ObjectSet
of objects of type Int2LongMap.Entry
(the latter makes it possible to
access keys and values with type-specific methods).
int2LongEntrySet
in interface Int2LongMap
int2LongEntrySet
in interface Int2LongSortedMap
Int2LongMap.entrySet()
public IntSortedSet keySet()
AbstractInt2LongSortedMap
The view is backed by the sorted set returned by AbstractInt2LongSortedMap.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 Int2LongMap
keySet
in interface Int2LongSortedMap
keySet
in interface Map<Integer,Long>
keySet
in class AbstractInt2LongSortedMap
Map.keySet()
public LongCollection values()
AbstractInt2LongSortedMap
The view is backed by the sorted set returned by AbstractInt2LongSortedMap.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 Int2LongMap
values
in interface Int2LongSortedMap
values
in interface Map<Integer,Long>
values
in class AbstractInt2LongSortedMap
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<Integer,Long>
hashCode
in class AbstractInt2LongMap
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |