Class Float2ByteLinkedOpenHashMap
- All Implemented Interfaces:
it.unimi.dsi.fastutil.floats.Float2ByteFunction,Float2ByteMap,Float2ByteSortedMap,it.unimi.dsi.fastutil.Function<Float,,Byte> it.unimi.dsi.fastutil.Hash,Serializable,Cloneable,DoubleToIntFunction,Function<Float,,Byte> Map<Float,,Byte> SequencedMap<Float,,Byte> SortedMap<Float,Byte>
Instances of this class use a hash table to represent a map. The table is filled up to a specified load factor, and then doubled in size to accommodate new entries. If the table is emptied below one fourth of the load factor, it is halved in size; however, the table is never reduced to a size smaller than that at creation time: this approach makes it possible to create maps with a large capacity in which insertions and deletions do not cause immediately rehashing. Moreover, halving is not performed when deleting entries from an iterator, as it would interfere with the iteration process.
Note that clear() does not modify the hash table size.
Rather, a family of trimming
methods lets you control the size of the table; this is particularly useful
if you reuse instances of this class.
Entries returned by the type-specific Float2ByteMap.entrySet() method implement
the suitable type-specific Pair interface;
only values are mutable.
Iterators generated by this map will enumerate pairs in the same order in which they have been added to the map (addition of pairs whose key is already present in the map does not change the iteration order). Note that this order has nothing in common with the natural order of the keys. The order is kept by means of a doubly linked list, represented via an array of longs parallel to the table.
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 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.
Additional methods, such as getAndMoveToFirst(), make it easy
to use instances of this class as a cache (e.g., with LRU policy).
The iterators provided by the views of this class using are type-specific
list iterators, and can be started at any
element which is a key of the map, or
a NoSuchElementException exception will be thrown.
If, however, the provided element is not the first or last key in the
map, the first access to the list index will require linear time, as in the worst case
the entire key set must be scanned in iteration order to retrieve the positional
index of the starting key. If you use just the methods of a type-specific BidirectionalIterator,
however, all operations will be performed in constant time.
- See Also:
-
Nested Class Summary
Nested classes/interfaces inherited from class it.unimi.dsi.fastutil.floats.AbstractFloat2ByteSortedMap
AbstractFloat2ByteSortedMap.KeySetIterator, AbstractFloat2ByteSortedMap.ValuesCollection, AbstractFloat2ByteSortedMap.ValuesIteratorNested classes/interfaces inherited from class it.unimi.dsi.fastutil.floats.AbstractFloat2ByteMap
AbstractFloat2ByteMap.BasicEntry, AbstractFloat2ByteMap.BasicEntrySetNested classes/interfaces inherited from interface it.unimi.dsi.fastutil.floats.Float2ByteMap
Float2ByteMap.Entry, Float2ByteMap.FastEntrySetNested classes/interfaces inherited from interface it.unimi.dsi.fastutil.floats.Float2ByteSortedMap
Float2ByteSortedMap.FastSortedEntrySetNested classes/interfaces inherited from interface it.unimi.dsi.fastutil.Hash
it.unimi.dsi.fastutil.Hash.Strategy<K> -
Field Summary
FieldsModifier and TypeFieldDescriptionprotected booleanWhether this map contains the key zero.protected Float2ByteSortedMap.FastSortedEntrySetCached set of entries.protected final floatThe acceptable load factor.protected intThe index of the first entry in iteration order.protected float[]The array of keys.protected it.unimi.dsi.fastutil.floats.FloatSortedSetCached set of keys.protected intThe index of the last entry in iteration order.protected long[]For each entry, the next and the previous entry in iteration order, stored as((prev & 0xFFFFFFFFL) << 32) | (next & 0xFFFFFFFFL).protected intThe mask for wrapping a position counter.protected intThreshold after which we rehash.protected final intWe never resize below this threshold, which is the construction-time {#n}.protected intThe current table size.protected intNumber of entries in the set (including the key zero, if present).protected byte[]The array of values.protected it.unimi.dsi.fastutil.bytes.ByteCollectionCached collection of values.Fields inherited from class it.unimi.dsi.fastutil.floats.AbstractFloat2ByteFunction
defRetValueFields 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
ConstructorsConstructorDescriptionCreates a new hash map with initial expectedHash.DEFAULT_INITIAL_SIZEentries andHash.DEFAULT_LOAD_FACTORas load factor.Float2ByteLinkedOpenHashMap(float[] k, byte[] v) Creates a new hash map withHash.DEFAULT_LOAD_FACTORas load factor using the elements of two parallel arrays.Float2ByteLinkedOpenHashMap(float[] k, byte[] v, float f) Creates a new hash map using the elements of two parallel arrays.Float2ByteLinkedOpenHashMap(int expected) Creates a new hash map withHash.DEFAULT_LOAD_FACTORas load factor.Float2ByteLinkedOpenHashMap(int expected, float f) Creates a new hash map.Creates a new hash map withHash.DEFAULT_LOAD_FACTORas load factor copying a given type-specific one.Float2ByteLinkedOpenHashMap(Float2ByteMap m, float f) Creates a new hash map copying a given type-specific one.Float2ByteLinkedOpenHashMap(Map<? extends Float, ? extends Byte> m) Creates a new hash map withHash.DEFAULT_LOAD_FACTORas load factor copying a given one.Float2ByteLinkedOpenHashMap(Map<? extends Float, ? extends Byte> m, float f) Creates a new hash map copying a given one. -
Method Summary
Modifier and TypeMethodDescriptionbyteaddTo(float k, byte incr) Adds an increment to value currently associated with a key.voidclear()Removes all of the mappings from this map (optional operation).clone()Returns a deep copy of this map.it.unimi.dsi.fastutil.floats.FloatComparatorReturns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.bytecompute(float k, BiFunction<? super Float, ? super Byte, ? extends Byte> remappingFunction) Attempts to compute a mapping for the specified key and its current mapped value (ornullif there is no current mapping).bytecomputeIfAbsent(float key, it.unimi.dsi.fastutil.floats.Float2ByteFunction mappingFunction) If the specified key is not already associated with a value, attempts to compute its value using the given mapping function and enters it into this map, unless the key is not present in the given mapping function.bytecomputeIfAbsent(float k, DoubleToIntFunction mappingFunction) If the specified key is not already associated with a value, attempts to compute its value using the given mapping function and enters it into this map.bytecomputeIfAbsentNullable(float k, DoubleFunction<? extends Byte> mappingFunction) If the specified key is not already associated with a value, attempts to compute its value using the given mapping function and enters it into this map unless it isnull.bytecomputeIfPresent(float k, BiFunction<? super Float, ? super Byte, ? extends Byte> remappingFunction) If the value for the specified key is present, attempts to compute a new mapping given the key and its current mapped value.booleancontainsKey(float k) Returns true if this function contains a mapping for the specified key.booleancontainsValue(byte v) Returnstrueif this map maps one or more keys to the specified value.voidensureCapacity(int capacity) Ensures that this map can hold a certain number of keys without rehashing.floatReturns the first key of this map in iteration order.protected voidfixPointers(int i) Modifies thelinkvector so that the given entry is removed.protected voidfixPointers(int s, int d) Modifies thelinkvector for a shift from s to d.Returns a type-specific sorted-set view of the mappings contained in this map.byteget(float k) bytegetAndMoveToFirst(float k) Returns the value to which the given key is mapped; if the key is present, it is moved to the first position of the iteration order.bytegetAndMoveToLast(float k) Returns the value to which the given key is mapped; if the key is present, it is moved to the last position of the iteration order.bytegetOrDefault(float k, byte defaultValue) Returns the value to which the specified key is mapped, or thedefaultValueif this map contains no mapping for the key.inthashCode()Returns a hash code for this map.headMap(float to) Returns a view of the portion of this sorted map whose keys are strictly less thantoKey.booleanisEmpty()it.unimi.dsi.fastutil.floats.FloatSortedSetkeySet()Returns a type-specific-set view of the keys of this map.floatReturns the last key of this map in iteration order.bytemerge(float k, byte v, BiFunction<? super Byte, ? super Byte, ? extends Byte> remappingFunction) If the specified key is not already associated with a value, associates it with the givenvalue.bytemergeByte(float k, byte v, it.unimi.dsi.fastutil.bytes.ByteBinaryOperator remappingFunction) If the specified key is not already associated with a value, associates it with the givenvalue.byteput(float k, byte v) voidbyteputAndMoveToFirst(float k, byte v) Adds a pair to the map; if the key is already present, it is moved to the first position of the iteration order.byteputAndMoveToLast(float k, byte v) Adds a pair to the map; if the key is already present, it is moved to the last position of the iteration order.byteputIfAbsent(float k, byte v) If the specified key is not already associated with a value, associates it with the given value and returns the default return value, else returns the current value.protected voidrehash(int newN) Rehashes the map.byteremove(float k) booleanremove(float k, byte v) Removes the entry for the specified key only if it is currently mapped to the specified value.byteRemoves the mapping associated with the first key in iteration order.byteRemoves the mapping associated with the last key in iteration order.bytereplace(float k, byte v) Replaces the entry for the specified key only if it is currently mapped to some value.booleanreplace(float k, byte oldValue, byte v) Replaces the entry for the specified key only if currently mapped to the specified value.protected final voidshiftKeys(int pos) Shifts left entries with the specified hash code, starting at the specified position, and empties the resulting free entry.intsize()Returns the number of key/value mappings in this map.subMap(float from, float to) Returns a view of the portion of this sorted map whose keys range fromfromKey, inclusive, totoKey, exclusive.tailMap(float from) Returns a view of the portion of this sorted map whose keys are greater than or equal tofromKey.booleantrim()Rehashes the map, making the table as small as possible.booleantrim(int n) Rehashes this map if the table is too large.it.unimi.dsi.fastutil.bytes.ByteCollectionvalues()Returns a type-specific-set view of the values of this map.Methods inherited from class it.unimi.dsi.fastutil.floats.AbstractFloat2ByteMap
equals, toStringMethods inherited from class it.unimi.dsi.fastutil.floats.AbstractFloat2ByteFunction
defaultReturnValue, defaultReturnValueMethods inherited from class java.lang.Object
finalize, getClass, notify, notifyAll, wait, wait, waitMethods inherited from interface it.unimi.dsi.fastutil.floats.Float2ByteFunction
andThen, andThenByte, andThenChar, andThenDouble, andThenFloat, andThenInt, andThenLong, andThenObject, andThenReference, andThenShort, applyAsInt, compose, composeByte, composeChar, composeDouble, composeFloat, composeInt, composeLong, composeObject, composeReference, composeShortMethods inherited from interface it.unimi.dsi.fastutil.floats.Float2ByteMap
compute, computeIfAbsent, computeIfAbsentPartial, computeIfPresent, containsKey, containsValue, defaultReturnValue, defaultReturnValue, forEach, forEach, get, getOrDefault, merge, mergeByte, put, putIfAbsent, remove, remove, replace, replaceMethods inherited from interface it.unimi.dsi.fastutil.floats.Float2ByteSortedMap
entrySet, firstKey, headMap, lastKey, subMap, tailMapMethods inherited from interface it.unimi.dsi.fastutil.Function
applyMethods inherited from interface java.util.Map
containsKey, equals, get, getOrDefault, put, remove, replaceAllMethods inherited from interface java.util.SequencedMap
firstEntry, lastEntry, pollFirstEntry, pollLastEntry, sequencedEntrySet, sequencedKeySet, sequencedValues
-
Field Details
-
key
protected transient float[] keyThe array of keys. -
value
protected transient byte[] valueThe array of values. -
mask
protected transient int maskThe mask for wrapping a position counter. -
containsNullKey
protected transient boolean containsNullKeyWhether this map contains the key zero. -
first
protected transient int firstThe index of the first entry in iteration order. It is valid iffsizeis nonzero; otherwise, it contains -1. -
last
protected transient int lastThe index of the last entry in iteration order. It is valid iffsizeis nonzero; otherwise, it contains -1. -
link
protected transient long[] linkFor each entry, the next and the previous entry in iteration order, stored as((prev & 0xFFFFFFFFL) << 32) | (next & 0xFFFFFFFFL). The first entry contains predecessor -1, and the last entry contains successor -1. -
n
protected transient int nThe current table size. -
maxFill
protected transient int maxFillThreshold after which we rehash. It must be the table size timesf. -
minN
protected final transient int minNWe never resize below this threshold, which is the construction-time {#n}. -
size
protected int sizeNumber of entries in the set (including the key zero, if present). -
f
protected final float fThe acceptable load factor. -
entries
Cached set of entries. -
keys
protected transient it.unimi.dsi.fastutil.floats.FloatSortedSet keysCached set of keys. -
values
protected transient it.unimi.dsi.fastutil.bytes.ByteCollection valuesCached collection of values.
-
-
Constructor Details
-
Float2ByteLinkedOpenHashMap
public Float2ByteLinkedOpenHashMap(int expected, float f) Creates a new hash map.The actual table size will be the least power of two greater than
expected/f.- Parameters:
expected- the expected number of elements in the hash map.f- the load factor.
-
Float2ByteLinkedOpenHashMap
public Float2ByteLinkedOpenHashMap(int expected) Creates a new hash map withHash.DEFAULT_LOAD_FACTORas load factor.- Parameters:
expected- the expected number of elements in the hash map.
-
Float2ByteLinkedOpenHashMap
public Float2ByteLinkedOpenHashMap()Creates a new hash map with initial expectedHash.DEFAULT_INITIAL_SIZEentries andHash.DEFAULT_LOAD_FACTORas load factor. -
Float2ByteLinkedOpenHashMap
Creates a new hash map copying a given one.- Parameters:
m- aMapto be copied into the new hash map.f- the load factor.
-
Float2ByteLinkedOpenHashMap
Creates a new hash map withHash.DEFAULT_LOAD_FACTORas load factor copying a given one.- Parameters:
m- aMapto be copied into the new hash map.
-
Float2ByteLinkedOpenHashMap
Creates a new hash map copying a given type-specific one.- Parameters:
m- a type-specific map to be copied into the new hash map.f- the load factor.
-
Float2ByteLinkedOpenHashMap
Creates a new hash map withHash.DEFAULT_LOAD_FACTORas load factor copying a given type-specific one.- Parameters:
m- a type-specific map to be copied into the new hash map.
-
Float2ByteLinkedOpenHashMap
public Float2ByteLinkedOpenHashMap(float[] k, byte[] v, float f) Creates a new hash map using the elements of two parallel arrays.- Parameters:
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.- Throws:
IllegalArgumentException- ifkandvhave different lengths.
-
Float2ByteLinkedOpenHashMap
public Float2ByteLinkedOpenHashMap(float[] k, byte[] v) Creates a new hash map withHash.DEFAULT_LOAD_FACTORas load factor using the elements of two parallel arrays.- Parameters:
k- the array of keys of the new hash map.v- the array of corresponding values in the new hash map.- Throws:
IllegalArgumentException- ifkandvhave different lengths.
-
-
Method Details
-
ensureCapacity
public void ensureCapacity(int capacity) Ensures that this map can hold a certain number of keys without rehashing.- Parameters:
capacity- a number of keys; there will be no rehashing unless the map size exceeds this number.
-
putAll
Description copied from class:AbstractFloat2ByteMap -
put
public byte put(float k, byte v) - Specified by:
putin interfaceit.unimi.dsi.fastutil.floats.Float2ByteFunction
-
addTo
public byte addTo(float k, byte incr) Adds an increment to value currently associated with a key.Note that this method respects the default return value semantics: when called with a key that does not currently appears in the map, the key will be associated with the default return value plus the given increment.
- Parameters:
k- the key.incr- the increment.- Returns:
- the old value, or the default return value if no value was present for the given key.
-
shiftKeys
protected final void shiftKeys(int pos) Shifts left entries with the specified hash code, starting at the specified position, and empties the resulting free entry.- Parameters:
pos- a starting position.
-
remove
public byte remove(float k) - Specified by:
removein interfaceit.unimi.dsi.fastutil.floats.Float2ByteFunction
-
removeFirstByte
public byte removeFirstByte()Removes the mapping associated with the first key in iteration order.- Returns:
- the value previously associated with the first key in iteration order.
- Throws:
NoSuchElementException- is this map is empty.
-
removeLastByte
public byte removeLastByte()Removes the mapping associated with the last key in iteration order.- Returns:
- the value previously associated with the last key in iteration order.
- Throws:
NoSuchElementException- is this map is empty.
-
getAndMoveToFirst
public byte getAndMoveToFirst(float k) Returns the value to which the given key is mapped; if the key is present, it is moved to the first position of the iteration order.- Parameters:
k- the key.- Returns:
- the corresponding value, or the default return value if no value was present for the given key.
-
getAndMoveToLast
public byte getAndMoveToLast(float k) Returns the value to which the given key is mapped; if the key is present, it is moved to the last position of the iteration order.- Parameters:
k- the key.- Returns:
- the corresponding value, or the default return value if no value was present for the given key.
-
putAndMoveToFirst
public byte putAndMoveToFirst(float k, byte v) Adds a pair to the map; if the key is already present, it is moved to the first position of the iteration order.- Parameters:
k- the key.v- the value.- Returns:
- the old value, or the default return value if no value was present for the given key.
-
putAndMoveToLast
public byte putAndMoveToLast(float k, byte v) Adds a pair to the map; if the key is already present, it is moved to the last position of the iteration order.- Parameters:
k- the key.v- the value.- Returns:
- the old value, or the default return value if no value was present for the given key.
-
get
public byte get(float k) - Specified by:
getin interfaceit.unimi.dsi.fastutil.floats.Float2ByteFunction
-
containsKey
public boolean containsKey(float k) Description copied from class:AbstractFloat2ByteMapReturns true if this function contains a mapping for the specified key.- Specified by:
containsKeyin interfaceit.unimi.dsi.fastutil.floats.Float2ByteFunction- Specified by:
containsKeyin interfaceFloat2ByteMap- Overrides:
containsKeyin classAbstractFloat2ByteMap- Parameters:
k- the key.- Returns:
- true if this function associates a value to
key. - See Also:
-
containsValue
public boolean containsValue(byte v) Description copied from class:AbstractFloat2ByteMapReturnstrueif this map maps one or more keys to the specified value.- Specified by:
containsValuein interfaceFloat2ByteMap- Overrides:
containsValuein classAbstractFloat2ByteMap- See Also:
-
getOrDefault
public byte getOrDefault(float k, byte defaultValue) Returns the value to which the specified key is mapped, or thedefaultValueif this map contains no mapping for the key.- Specified by:
getOrDefaultin interfaceit.unimi.dsi.fastutil.floats.Float2ByteFunction- Specified by:
getOrDefaultin interfaceFloat2ByteMap- Parameters:
k- the key.defaultValue- the default mapping of the key.- Returns:
- the value to which the specified key is mapped, or the
defaultValueif this map contains no mapping for the key. - See Also:
-
putIfAbsent
public byte putIfAbsent(float k, byte v) If the specified key is not already associated with a value, associates it with the given value and returns the default return value, else returns the current value.- Specified by:
putIfAbsentin interfaceFloat2ByteMap- Parameters:
k- key with which the specified value is to be associated.v- value to be associated with the specified key.- Returns:
- the previous value associated with the specified key, or the default return value if there was no mapping for the key.
- See Also:
-
remove
public boolean remove(float k, byte v) Removes the entry for the specified key only if it is currently mapped to the specified value.- Specified by:
removein interfaceFloat2ByteMap- Parameters:
k- key with which the specified value is associated.v- value expected to be associated with the specified key.- Returns:
trueif the value was removed.- See Also:
-
replace
public boolean replace(float k, byte oldValue, byte v) Replaces the entry for the specified key only if currently mapped to the specified value.- Specified by:
replacein interfaceFloat2ByteMap- Parameters:
k- key with which the specified value is associated.oldValue- value expected to be associated with the specified key.v- value to be associated with the specified key.- Returns:
trueif the value was replaced.- See Also:
-
replace
public byte replace(float k, byte v) Replaces the entry for the specified key only if it is currently mapped to some value.- Specified by:
replacein interfaceFloat2ByteMap- Parameters:
k- key with which the specified value is associated.v- value to be associated with the specified key.- Returns:
- the previous value associated with the specified key, or the default return value if there was no mapping for the key.
- See Also:
-
computeIfAbsent
If the specified key is not already associated with a value, attempts to compute its value using the given mapping function and enters it into this map.Note that contrarily to the default computeIfAbsent(), it is not possible to not add a value for a given key, since the
mappingFunctioncannot returnnull. If such a behavior is needed, please use the corresponding nullable version.- Specified by:
computeIfAbsentin interfaceFloat2ByteMap- Parameters:
k- key with which the specified value is to be associated.mappingFunction- the function to compute a value.- Returns:
- the current (existing or computed) value associated with the specified key.
- See Also:
-
computeIfAbsent
public byte computeIfAbsent(float key, it.unimi.dsi.fastutil.floats.Float2ByteFunction mappingFunction) If the specified key is not already associated with a value, attempts to compute its value using the given mapping function and enters it into this map, unless the key is not present in the given mapping function.This version of computeIfAbsent() uses a type-specific version of
fastutil'sFunction. SinceFunctionhas acontainsKey()method, it is possible to avoid adding a key by havingcontainsKey()returnfalsefor that key.- Specified by:
computeIfAbsentin interfaceFloat2ByteMap- Parameters:
key- key with which the specified value is to be associated.mappingFunction- the function to compute a value.- Returns:
- the current (existing or computed) value associated with the specified key.
- See Also:
-
computeIfAbsentNullable
If the specified key is not already associated with a value, attempts to compute its value using the given mapping function and enters it into this map unless it isnull.Note that this version of computeIfAbsent() should be used only if you plan to return
nullin the mapping function.- Specified by:
computeIfAbsentNullablein interfaceFloat2ByteMap- Parameters:
k- key with which the specified value is to be associated.mappingFunction- the function to compute a value.- Returns:
- the current (existing or computed) value associated with the specified key,
or the default return value if the computed value is
null. - See Also:
-
computeIfPresent
public byte computeIfPresent(float k, BiFunction<? super Float, ? super Byte, ? extends Byte> remappingFunction) If the value for the specified key is present, attempts to compute a new mapping given the key and its current mapped value.- Specified by:
computeIfPresentin interfaceFloat2ByteMap- Parameters:
k- key with which the specified value is to be associated.remappingFunction- the function to compute a value.- Returns:
- the new value associated with the specified key, or the default return value if none.
- See Also:
-
compute
public byte compute(float k, BiFunction<? super Float, ? super Byte, ? extends Byte> remappingFunction) Attempts to compute a mapping for the specified key and its current mapped value (ornullif there is no current mapping).If the function returns
null, the mapping is removed (or remains absent if initially absent). If the function itself throws an (unchecked) exception, the exception is rethrown, and the current mapping is left unchanged.- Specified by:
computein interfaceFloat2ByteMap- Parameters:
k- key with which the specified value is to be associated.remappingFunction- the function to compute a value.- Returns:
- the new value associated with the specified key, or the default return value if none.
- See Also:
-
mergeByte
public byte mergeByte(float k, byte v, it.unimi.dsi.fastutil.bytes.ByteBinaryOperator remappingFunction) If the specified key is not already associated with a value, associates it with the givenvalue. Otherwise, replaces the associated value with the results of the given remapping function.- Specified by:
mergeBytein interfaceFloat2ByteMap- Parameters:
k- key with which the resulting value is to be associated.v- the value to be merged with the existing value associated with the key or, if no existing value is associated with the key, to be associated with the key.remappingFunction- the function to recompute a value if present.- Returns:
- the new value associated with the specified key.
- See Also:
-
merge
public byte merge(float k, byte v, BiFunction<? super Byte, ? super Byte, ? extends Byte> remappingFunction) If the specified key is not already associated with a value, associates it with the givenvalue. Otherwise, replaces the associated value with the results of the given remapping function, or removes if the result isnull.- Specified by:
mergein interfaceFloat2ByteMap- Parameters:
k- key with which the resulting value is to be associated.v- the value to be merged with the existing value associated with the key or, if no existing value is associated with the key, to be associated with the key.remappingFunction- the function to recompute a value if present.- Returns:
- the new value associated with the specified key, or the default return value if no value is associated with the key.
- See Also:
-
clear
public void clear()Description copied from interface:Float2ByteMapRemoves all of the mappings from this map (optional operation). The map will be empty after this call returns. -
size
public int size()Description copied from interface:Float2ByteMapReturns the number of key/value mappings in this map. If the map contains more thanInteger.MAX_VALUEelements, returnsInteger.MAX_VALUE. -
isEmpty
public boolean isEmpty() -
fixPointers
protected void fixPointers(int i) Modifies thelinkvector so that the given entry is removed. This method will complete in constant time.- Parameters:
i- the index of an entry.
-
fixPointers
protected void fixPointers(int s, int d) Modifies thelinkvector for a shift from s to d.This method will complete in constant time.
- Parameters:
s- the source position.d- the destination position.
-
firstFloatKey
public float firstFloatKey()Returns the first key of this map in iteration order.- Specified by:
firstFloatKeyin interfaceFloat2ByteSortedMap- Returns:
- the first key in iteration order.
- See Also:
-
lastFloatKey
public float lastFloatKey()Returns the last key of this map in iteration order.- Specified by:
lastFloatKeyin interfaceFloat2ByteSortedMap- Returns:
- the last key in iteration order.
- See Also:
-
tailMap
Returns a view of the portion of this sorted map whose keys are greater than or equal tofromKey.- Specified by:
tailMapin interfaceFloat2ByteSortedMap- See Also:
-
headMap
Returns a view of the portion of this sorted map whose keys are strictly less thantoKey.- Specified by:
headMapin interfaceFloat2ByteSortedMap- See Also:
-
subMap
Returns a view of the portion of this sorted map whose keys range fromfromKey, inclusive, totoKey, exclusive.- Specified by:
subMapin interfaceFloat2ByteSortedMap- See Also:
-
comparator
public it.unimi.dsi.fastutil.floats.FloatComparator comparator()Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.- Specified by:
comparatorin interfaceFloat2ByteSortedMap- Specified by:
comparatorin interfaceSortedMap<Float,Byte> - See Also:
-
float2ByteEntrySet
Description copied from interface:Float2ByteSortedMapReturns a type-specific sorted-set view of the mappings contained in this map.- Specified by:
float2ByteEntrySetin interfaceFloat2ByteMap- Specified by:
float2ByteEntrySetin interfaceFloat2ByteSortedMap- Returns:
- a type-specific sorted-set view of the mappings contained in this map.
- See Also:
-
keySet
public it.unimi.dsi.fastutil.floats.FloatSortedSet keySet()Description copied from class:AbstractFloat2ByteSortedMapReturns a type-specific-set view of the keys of this map.The view is backed by the set returned by
Map.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.The view is backed by the sorted set returned by
Map.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.- Specified by:
keySetin interfaceFloat2ByteMap- Specified by:
keySetin interfaceFloat2ByteSortedMap- Specified by:
keySetin interfaceMap<Float,Byte> - Specified by:
keySetin interfaceSortedMap<Float,Byte> - Overrides:
keySetin classAbstractFloat2ByteSortedMap- Returns:
- a sorted set view of the keys of this map; it may be safely cast to a type-specific interface.
- See Also:
-
values
public it.unimi.dsi.fastutil.bytes.ByteCollection values()Description copied from class:AbstractFloat2ByteSortedMapReturns a type-specific-set view of the values of this map.The view is backed by the set returned by
Map.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.The view is backed by the sorted set returned by
Map.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.- Specified by:
valuesin interfaceFloat2ByteMap- Specified by:
valuesin interfaceFloat2ByteSortedMap- Specified by:
valuesin interfaceMap<Float,Byte> - Specified by:
valuesin interfaceSortedMap<Float,Byte> - Overrides:
valuesin classAbstractFloat2ByteSortedMap- Returns:
- a type-specific collection view of the values contained in this map.
- See Also:
-
trim
public boolean trim()Rehashes the map, making the table as small as possible.This method rehashes the table to the smallest size satisfying the load factor. It can be used when the set will not be changed anymore, so to optimize access speed and size.
If the table size is already the minimum possible, this method does nothing.
- Returns:
- true if there was enough memory to trim the map.
- See Also:
-
trim
public boolean trim(int n) Rehashes this map if the table is too large.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.
- Parameters:
n- the threshold for the trimming.- Returns:
- true if there was enough memory to trim the map.
- See Also:
-
rehash
protected void rehash(int newN) Rehashes the map.This method implements the basic rehashing strategy, and may be overridden by subclasses implementing different rehashing strategies (e.g., disk-based rehashing). However, you should not override this method unless you understand the internal workings of this class.
- Parameters:
newN- the new size
-
clone
Returns a deep copy of this map.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.
-
hashCode
public int hashCode()Returns a hash code for this map. This method overrides the generic method provided by the superclass. Sinceequals()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.
-