Package it.unimi.dsi.fastutil.chars

Class Char2ReferenceLinkedOpenHashMap<V>

java.lang.Object

it.unimi.dsi.fastutil.chars.AbstractChar2ReferenceFunction<V>

it.unimi.dsi.fastutil.chars.AbstractChar2ReferenceMap<V>

it.unimi.dsi.fastutil.chars.AbstractChar2ReferenceSortedMap<V>

it.unimi.dsi.fastutil.chars.Char2ReferenceLinkedOpenHashMap<V>

All Implemented Interfaces:

Char2ReferenceFunction<V>, Char2ReferenceMap<V>, Char2ReferenceSortedMap<V>, Function<Character,V>, Hash, Serializable, Cloneable, Function<Character,V>, IntFunction<V>, Map<Character,V>, SequencedMap<Character,V>, SortedMap<Character,V>

public class Char2ReferenceLinkedOpenHashMap<V>
extends AbstractChar2ReferenceSortedMap<V>
implements Serializable, Cloneable, Hash

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 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 Char2ReferenceMap.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:

• Hash
• HashCommon
• Serialized Form

Nested Class Summary

Nested classes/interfaces inherited from class it.unimi.dsi.fastutil.chars.AbstractChar2ReferenceMap

AbstractChar2ReferenceMap.BasicEntry<V>, AbstractChar2ReferenceMap.BasicEntrySet<V>

Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.chars.Char2ReferenceMap

Char2ReferenceMap.Entry<V>, Char2ReferenceMap.FastEntrySet<V>

Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.chars.Char2ReferenceSortedMap

Char2ReferenceSortedMap.FastSortedEntrySet<V>

Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.Hash

Hash.Strategy<K>

Nested classes/interfaces inherited from interface java.util.Map

Map.Entry<K,V>

Field Summary

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

Constructors

Constructor	Description
Char2ReferenceLinkedOpenHashMap()	Creates a new hash map with initial expected Hash.DEFAULT_INITIAL_SIZE entries and Hash.DEFAULT_LOAD_FACTOR as load factor.
Char2ReferenceLinkedOpenHashMap(char[] k, V[] v)	Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor using the elements of two parallel arrays.
Char2ReferenceLinkedOpenHashMap(char[] k, V[] v, float f)	Creates a new hash map using the elements of two parallel arrays.
Char2ReferenceLinkedOpenHashMap(int expected)	Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor.
Char2ReferenceLinkedOpenHashMap(int expected, float f)	Creates a new hash map.
Char2ReferenceLinkedOpenHashMap(Char2ReferenceMap<V> m)	Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor copying a given type-specific one.
Char2ReferenceLinkedOpenHashMap(Char2ReferenceMap<V> m, float f)	Creates a new hash map copying a given type-specific one.
Char2ReferenceLinkedOpenHashMap(Map<? extends Character,? extends V> m)	Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor copying a given one.
Char2ReferenceLinkedOpenHashMap(Map<? extends Character,? extends V> m, float f)	Creates a new hash map copying a given one.

Method Summary

Modifier and Type	Method	Description
Char2ReferenceSortedMap.FastSortedEntrySet<V>	char2ReferenceEntrySet()	Returns a type-specific sorted-set view of the mappings contained in this map.
void	clear()	Removes all of the mappings from this map (optional operation).
Char2ReferenceLinkedOpenHashMap<V>	clone()	Returns a deep copy of this map.
CharComparator	comparator()	Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.
V	compute(char k, BiFunction<? super Character,? super V,? extends V> remappingFunction)	Attempts to compute a mapping for the specified key and its current mapped value (or null if there is no current mapping).
V	computeIfAbsent(char key, Char2ReferenceFunction<? extends V> 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.
V	computeIfAbsent(char k, IntFunction<? extends V> 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.
V	computeIfPresent(char k, BiFunction<? super Character,? super V,? extends V> remappingFunction)	If the value for the specified key is present, attempts to compute a new mapping given the key and its current mapped value.
boolean	containsKey(char k)	Returns true if this function contains a mapping for the specified key.
boolean	containsValue(Object v)
void	ensureCapacity(int capacity)	Ensures that this map can hold a certain number of keys without rehashing.
char	firstCharKey()	Returns the first key of this map in iteration order.
V	get(char k)	Returns the value to which the given key is mapped.
V	getAndMoveToFirst(char 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.
V	getAndMoveToLast(char 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.
V	getOrDefault(char k, V defaultValue)	Returns the value to which the specified key is mapped, or the defaultValue if this map contains no mapping for the key.
int	hashCode()	Returns a hash code for this map.
Char2ReferenceSortedMap<V>	headMap(char to)	Returns a view of the portion of this sorted map whose keys are strictly less than toKey.
boolean	isEmpty()
CharSortedSet	keySet()	Returns a type-specific-set view of the keys of this map.
char	lastCharKey()	Returns the last key of this map in iteration order.
V	merge(char k, V v, BiFunction<? super V,? super V,? extends V> remappingFunction)	If the specified key is not already associated with a value, associates it with the given value.
V	put(char k, V v)	Adds a pair to the map (optional operation).
void	putAll(Map<? extends Character,? extends V> m)
V	putAndMoveToFirst(char k, V v)	Adds a pair to the map; if the key is already present, it is moved to the first position of the iteration order.
V	putAndMoveToLast(char k, V v)	Adds a pair to the map; if the key is already present, it is moved to the last position of the iteration order.
V	putIfAbsent(char k, V 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.
V	remove(char k)	Removes the mapping with the given key (optional operation).
boolean	remove(char k, Object v)	Removes the entry for the specified key only if it is currently mapped to the specified value.
V	removeFirst()	Removes the mapping associated with the first key in iteration order.
V	removeLast()	Removes the mapping associated with the last key in iteration order.
V	replace(char k, V v)	Replaces the entry for the specified key only if it is currently mapped to some value.
boolean	replace(char k, V oldValue, V v)	Replaces the entry for the specified key only if currently mapped to the specified value.
int	size()	Returns the number of key/value mappings in this map.
Char2ReferenceSortedMap<V>	subMap(char from, char to)	Returns a view of the portion of this sorted map whose keys range from fromKey, inclusive, to toKey, exclusive.
Char2ReferenceSortedMap<V>	tailMap(char 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.
ReferenceCollection<V>	values()	Returns a type-specific-set view of the values of this map.

Methods inherited from class it.unimi.dsi.fastutil.chars.AbstractChar2ReferenceMap

equals, toString

Methods inherited from class it.unimi.dsi.fastutil.chars.AbstractChar2ReferenceFunction

defaultReturnValue, defaultReturnValue

Methods inherited from class java.lang.Object

getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface it.unimi.dsi.fastutil.chars.Char2ReferenceFunction

andThenByte, andThenChar, andThenDouble, andThenFloat, andThenInt, andThenLong, andThenObject, andThenReference, andThenShort, apply, compose, composeByte, composeChar, composeDouble, composeFloat, composeInt, composeLong, composeObject, composeReference, composeShort

Methods inherited from interface it.unimi.dsi.fastutil.chars.Char2ReferenceMap

computeIfAbsentPartial, containsKey, defaultReturnValue, defaultReturnValue, forEach, get, getOrDefault, put, remove

Methods inherited from interface it.unimi.dsi.fastutil.chars.Char2ReferenceSortedMap

entrySet, firstKey, headMap, lastKey, subMap, tailMap

Methods inherited from interface it.unimi.dsi.fastutil.Function

apply

Methods inherited from interface java.util.function.Function

andThen

Methods inherited from interface java.util.Map

compute, computeIfAbsent, computeIfPresent, containsKey, equals, get, getOrDefault, merge, put, putIfAbsent, remove, remove, replace, replace, replaceAll

Methods inherited from interface java.util.SequencedMap

firstEntry, lastEntry, pollFirstEntry, pollLastEntry, sequencedEntrySet, sequencedKeySet, sequencedValues

Methods inherited from interface java.util.SortedMap

putFirst, putLast, reversed

Constructor Details

Char2ReferenceLinkedOpenHashMap

public Char2ReferenceLinkedOpenHashMap(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.

Char2ReferenceLinkedOpenHashMap

public Char2ReferenceLinkedOpenHashMap(int expected)

Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor.

Parameters:

expected - the expected number of elements in the hash map.

Char2ReferenceLinkedOpenHashMap

public Char2ReferenceLinkedOpenHashMap()

Creates a new hash map with initial expected Hash.DEFAULT_INITIAL_SIZE entries and Hash.DEFAULT_LOAD_FACTOR as load factor.

Char2ReferenceLinkedOpenHashMap

public Char2ReferenceLinkedOpenHashMap(Map<? extends Character,? extends V> m,
 float f)

Creates a new hash map copying a given one.

Parameters:

m - a Map to be copied into the new hash map.

f - the load factor.

Char2ReferenceLinkedOpenHashMap

public Char2ReferenceLinkedOpenHashMap(Map<? extends Character,? extends V> m)

Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor copying a given one.

Parameters:

m - a Map to be copied into the new hash map.

Char2ReferenceLinkedOpenHashMap

public Char2ReferenceLinkedOpenHashMap(Char2ReferenceMap<V> m,
 float f)

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.

Char2ReferenceLinkedOpenHashMap

public Char2ReferenceLinkedOpenHashMap(Char2ReferenceMap<V> m)

Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor copying a given type-specific one.

Parameters:

m - a type-specific map to be copied into the new hash map.

Char2ReferenceLinkedOpenHashMap

public Char2ReferenceLinkedOpenHashMap(char[] k,
 V[] 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 - if k and v have different lengths.

Char2ReferenceLinkedOpenHashMap

public Char2ReferenceLinkedOpenHashMap(char[] k,
 V[] v)

Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as 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 - if k and v have 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

public void putAll(Map<? extends Character,? extends V> m)

Description copied from class: AbstractChar2ReferenceMap

Specified by:

putAll in interface Map<Character,V>

Overrides:

putAll in class AbstractChar2ReferenceMap<V>

put

public V put(char k,
 V v)

Description copied from interface: Char2ReferenceFunction

Adds a pair to the map (optional operation).

Specified by:

put in interface Char2ReferenceFunction<V>

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.

See Also:

• Function.put(Object,Object)

remove

public V remove(char k)

Description copied from interface: Char2ReferenceFunction

Removes the mapping with the given key (optional operation).

Specified by:

remove in interface Char2ReferenceFunction<V>

Parameters:

k - the key.

Returns:

the old value, or the default return value if no value was present for the given key.

See Also:

• Function.remove(Object)

removeFirst

public V removeFirst()

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.

removeLast

public V removeLast()

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 V getAndMoveToFirst(char 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 V getAndMoveToLast(char 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 V putAndMoveToFirst(char k,
 V 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 V putAndMoveToLast(char k,
 V 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 V get(char k)

Description copied from interface: Char2ReferenceFunction

Returns the value to which the given key is mapped.

Specified by:

get in interface Char2ReferenceFunction<V>

Parameters:

k - the key.

Returns:

the corresponding value, or the default return value if no value was present for the given key.

See Also:

• Function.get(Object)

containsKey

public boolean containsKey(char k)

Description copied from class: AbstractChar2ReferenceMap

Returns true if this function contains a mapping for the specified key.

Specified by:

containsKey in interface Char2ReferenceFunction<V>

Specified by:

containsKey in interface Char2ReferenceMap<V>

Overrides:

containsKey in class AbstractChar2ReferenceMap<V>

Parameters:

k - the key.

Returns:

true if this function associates a value to key.

See Also:

• Map.containsKey(Object)

containsValue

public boolean containsValue(Object v)

Description copied from class: AbstractChar2ReferenceMap

Specified by:

containsValue in interface Map<Character,V>

Overrides:

containsValue in class AbstractChar2ReferenceMap<V>

getOrDefault

public V getOrDefault(char k,
 V defaultValue)

Returns the value to which the specified key is mapped, or the defaultValue if this map contains no mapping for the key.

Specified by:

getOrDefault in interface Char2ReferenceFunction<V>

Specified by:

getOrDefault in interface Char2ReferenceMap<V>

Parameters:

k - the key.

defaultValue - the default mapping of the key.

Returns:

the value to which the specified key is mapped, or the defaultValue if this map contains no mapping for the key.

See Also:

• Map.getOrDefault(Object, Object)

putIfAbsent

public V putIfAbsent(char k,
 V 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:

putIfAbsent in interface Char2ReferenceMap<V>

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:

• Map.putIfAbsent(Object, Object)

remove

public boolean remove(char k,
 Object v)

Removes the entry for the specified key only if it is currently mapped to the specified value.

Specified by:

remove in interface Char2ReferenceMap<V>

Parameters:

k - key with which the specified value is associated.

v - value expected to be associated with the specified key.

Returns:

true if the value was removed.

See Also:

• Map.remove(Object, Object)

replace

public boolean replace(char k,
 V oldValue,
 V v)

Replaces the entry for the specified key only if currently mapped to the specified value.

Specified by:

replace in interface Char2ReferenceMap<V>

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:

true if the value was replaced.

See Also:

• Map.replace(Object, Object, Object)

replace

public V replace(char k,
 V v)

Replaces the entry for the specified key only if it is currently mapped to some value.

Specified by:

replace in interface Char2ReferenceMap<V>

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:

• Map.replace(Object, Object)

computeIfAbsent

public V computeIfAbsent(char k,
 IntFunction<? extends V> 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.

Note that contrarily to the default computeIfAbsent(), it is not possible to not add a value for a given key, since the mappingFunction cannot return null. If such a behavior is needed, please use the corresponding nullable version.

Specified by:

computeIfAbsent in interface Char2ReferenceMap<V>

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:

• Map.computeIfAbsent(Object, java.util.function.Function)

computeIfAbsent

public V computeIfAbsent(char key,
 Char2ReferenceFunction<? extends V> 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's Function. Since Function has a containsKey() method, it is possible to avoid adding a key by having containsKey() return false for that key.

Specified by:

computeIfAbsent in interface Char2ReferenceMap<V>

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:

• Map.computeIfAbsent(Object, java.util.function.Function)

computeIfPresent

public V computeIfPresent(char k,
 BiFunction<? super Character,? super V,? extends V> 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:

computeIfPresent in interface Char2ReferenceMap<V>

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:

• Map.computeIfPresent(Object, java.util.function.BiFunction)

compute

public V compute(char k,
 BiFunction<? super Character,? super V,? extends V> remappingFunction)

Attempts to compute a mapping for the specified key and its current mapped value (or null if 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:

compute in interface Char2ReferenceMap<V>

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:

• Map.compute(Object, java.util.function.BiFunction)

merge

public V merge(char k,
 V v,
 BiFunction<? super V,? super V,? extends V> remappingFunction)

If the specified key is not already associated with a value, associates it with the given value. Otherwise, replaces the associated value with the results of the given remapping function, or removes if the result is null.

Specified by:

merge in interface Char2ReferenceMap<V>

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:

• Map.merge(Object, Object, java.util.function.BiFunction)

clear

public void clear()

Description copied from interface: Char2ReferenceMap

Removes all of the mappings from this map (optional operation). The map will be empty after this call returns.

Specified by:

clear in interface Char2ReferenceMap<V>

Specified by:

clear in interface Function<Character,V>

Specified by:

clear in interface Map<Character,V>

See Also:

• Map.clear()

size

public int size()

Description copied from interface: Char2ReferenceMap

Returns the number of key/value mappings in this map. If the map contains more than Integer.MAX_VALUE elements, returns Integer.MAX_VALUE.

Specified by:

size in interface Char2ReferenceMap<V>

Specified by:

size in interface Function<Character,V>

Specified by:

size in interface Map<Character,V>

Returns:

the number of key-value mappings in this map.

See Also:

• Size64

isEmpty

public boolean isEmpty()

Specified by:

isEmpty in interface Map<Character,V>

Overrides:

isEmpty in class AbstractChar2ReferenceMap<V>

firstCharKey

public char firstCharKey()

Returns the first key of this map in iteration order.

Specified by:

firstCharKey in interface Char2ReferenceSortedMap<V>

Returns:

the first key in iteration order.

See Also:

• SortedMap.firstKey()

lastCharKey

public char lastCharKey()

Returns the last key of this map in iteration order.

Specified by:

lastCharKey in interface Char2ReferenceSortedMap<V>

Returns:

the last key in iteration order.

See Also:

• SortedMap.lastKey()

tailMap

public Char2ReferenceSortedMap<V> tailMap(char from)

Returns a view of the portion of this sorted map whose keys are greater than or equal to fromKey.

Specified by:

tailMap in interface Char2ReferenceSortedMap<V>

See Also:

• SortedMap.tailMap(Object)

Implementation Specification:

This implementation just throws an UnsupportedOperationException.

headMap

public Char2ReferenceSortedMap<V> headMap(char to)

Returns a view of the portion of this sorted map whose keys are strictly less than toKey.

Specified by:

headMap in interface Char2ReferenceSortedMap<V>

See Also:

• SortedMap.headMap(Object)

Implementation Specification:

This implementation just throws an UnsupportedOperationException.

subMap

public Char2ReferenceSortedMap<V> subMap(char from,
 char to)

Returns a view of the portion of this sorted map whose keys range from fromKey, inclusive, to toKey, exclusive.

Specified by:

subMap in interface Char2ReferenceSortedMap<V>

See Also:

• SortedMap.subMap(Object,Object)

Implementation Specification:

This implementation just throws an UnsupportedOperationException.

comparator

public CharComparator comparator()

Returns the comparator associated with this sorted set, or null if it uses its keys' natural ordering.

Specified by:

comparator in interface Char2ReferenceSortedMap<V>

Specified by:

comparator in interface SortedMap<Character,V>

See Also:

• SortedMap.comparator()

Implementation Specification:

This implementation just returns null.

char2ReferenceEntrySet

public Char2ReferenceSortedMap.FastSortedEntrySet<V> char2ReferenceEntrySet()

Description copied from interface: Char2ReferenceSortedMap

Returns a type-specific sorted-set view of the mappings contained in this map.

Specified by:

char2ReferenceEntrySet in interface Char2ReferenceMap<V>

Specified by:

char2ReferenceEntrySet in interface Char2ReferenceSortedMap<V>

Returns:

a type-specific sorted-set view of the mappings contained in this map.

See Also:

• Char2ReferenceSortedMap.entrySet()

keySet

public CharSortedSet keySet()

Description copied from class: AbstractChar2ReferenceSortedMap

Returns 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:

keySet in interface Char2ReferenceMap<V>

Specified by:

keySet in interface Char2ReferenceSortedMap<V>

Specified by:

keySet in interface Map<Character,V>

Specified by:

keySet in interface SortedMap<Character,V>

Overrides:

keySet in class AbstractChar2ReferenceSortedMap<V>

Returns:

a sorted set view of the keys of this map; it may be safely cast to a type-specific interface.

See Also:

• Map.keySet()

values

public ReferenceCollection<V> values()

Description copied from class: AbstractChar2ReferenceSortedMap

Returns 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:

values in interface Char2ReferenceMap<V>

Specified by:

values in interface Char2ReferenceSortedMap<V>

Specified by:

values in interface Map<Character,V>

Specified by:

values in interface SortedMap<Character,V>

Overrides:

values in class AbstractChar2ReferenceSortedMap<V>

Returns:

a type-specific collection view of the values contained in this map.

See Also:

• Map.values()

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(int)

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,size()) 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.

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:

• trim()

clone

public Char2ReferenceLinkedOpenHashMap<V> 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.

Returns:

a deep copy of this map.

hashCode

public int hashCode()

Returns a hash code for this map. This method overrides the generic method provided by the superclass. Since 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.

Specified by:

hashCode in interface Map<Character,V>

Overrides:

hashCode in class AbstractChar2ReferenceMap<V>

Returns:

a hash code for this map.