it.unimi.dsi.fastutil.shorts
Class Short2ShortLinkedOpenHashMap

java.lang.Object
  it.unimi.dsi.fastutil.shorts.AbstractShort2ShortMap
      it.unimi.dsi.fastutil.shorts.AbstractShort2ShortSortedMap
          it.unimi.dsi.fastutil.shorts.Short2ShortLinkedOpenHashMap

All Implemented Interfaces:

Cloneable, Hash, Map, Serializable, Short2ShortMap, Short2ShortSortedMap, SortedMap

public class Short2ShortLinkedOpenHashMap

extends AbstractShort2ShortSortedMap

implements Serializable, Cloneable, Hash, Short2ShortSortedMap

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 2^p/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 AbstractShort2ShortSortedMap.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 AbstractShort2ShortSortedMap.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.

See Also:

Hash, HashCommon, Serialized Form

Nested Class Summary

Nested classes inherited from class it.unimi.dsi.fastutil.shorts.AbstractShort2ShortMap

AbstractShort2ShortMap.BasicEntry

Nested classes inherited from class it.unimi.dsi.fastutil.Hash

Hash.Strategy

Nested classes inherited from class it.unimi.dsi.fastutil.shorts.Short2ShortMap

Short2ShortMap.Entry

Field Summary

static long

serialVersionUID

Fields inherited from interface it.unimi.dsi.fastutil.Hash

DEFAULT_GROWTH_FACTOR, DEFAULT_INITIAL_SIZE, DEFAULT_LOAD_FACTOR, FREE, OCCUPIED, PRIMES, REMOVED

Constructor Summary

Short2ShortLinkedOpenHashMap()
Creates a new hash map with Hash.DEFAULT_INITIAL_SIZE entries and Hash.DEFAULT_LOAD_FACTOR as load factor.

Short2ShortLinkedOpenHashMap(int n)
Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor.

Short2ShortLinkedOpenHashMap(int n, float f)
Creates a new hash map.

Short2ShortLinkedOpenHashMap(Map m)
Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor copying a given one.

Short2ShortLinkedOpenHashMap(Map m, float f)
Creates a new hash map copying a given one.

Short2ShortLinkedOpenHashMap(Short2ShortMap m)
Creates a new hash map with Hash.DEFAULT_LOAD_FACTOR as load factor copying a given type-specific one.

Short2ShortLinkedOpenHashMap(Short2ShortMap m, float f)
Creates a new hash map copying a given type-specific one.

Method Summary

void	clear()
Object	clone() Returns a deep copy of this map.
Comparator	comparator()
boolean	containsKey(short k) Checks whether the given value is contained in keySet().
boolean	containsValue(short v) Checks whether the given value is contained in values().
Set	entrySet()
short	firstShortKey() Returns the first key of this map in iteration order.
Object	get(Object ok) Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
short	get(short k) Returns the value to which the given key is mapped.
int	growthFactor() Gets the growth factor.
void	growthFactor(int growthFactor) Sets the growth factor.
int	hashCode() Returns a hash code for this map.
Short2ShortSortedMap	headMap(short to)
boolean	isEmpty()
Set	keySet() Returns a type-specific-sorted-set view of the keys of this map.
short	lastShortKey() Returns the last key of this map in iteration order.
Object	put(Object ok, Object ov) Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
short	put(short k, short v) Adds a pair to the map.
boolean	rehash() Rehashes this map without changing the table size.
Object	remove(Object ok) Delegates to the corresponding type-specific method, taking care of returning null on a missing key.
short	remove(short k) Removes the mapping with the given key.
int	size()
Short2ShortSortedMap	subMap(short from, short to)
Short2ShortSortedMap	tailMap(short from)
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.
Collection	values() Returns a type-specific-set view of the values of this map.

Methods inherited from class it.unimi.dsi.fastutil.shorts.AbstractShort2ShortSortedMap

firstKey, headMap, lastKey, subMap, tailMap

Methods inherited from class it.unimi.dsi.fastutil.shorts.AbstractShort2ShortMap

containsKey, containsValue, defaultReturnValue, defaultReturnValue, equals, getDefRetValue, putAll, setDefRetValue, toString

Methods inherited from class java.lang.Object

getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface it.unimi.dsi.fastutil.shorts.Short2ShortMap

defaultReturnValue, defaultReturnValue, getDefRetValue, setDefRetValue

Methods inherited from interface java.util.Map

containsKey, containsValue, equals, putAll

Methods inherited from interface java.util.SortedMap

firstKey, headMap, lastKey, subMap, tailMap

Field Detail

serialVersionUID

public static final long serialVersionUID

See Also:

Constant Field Values

Constructor Detail

Short2ShortLinkedOpenHashMap

public Short2ShortLinkedOpenHashMap(int n,
                                    float f)

Creates a new hash map. The actual table size is the least available prime greater than n/f.

Parameters:

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

f - the load factor.

See Also:

Hash.PRIMES

Short2ShortLinkedOpenHashMap

public Short2ShortLinkedOpenHashMap(int n)

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

Parameters:

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

Short2ShortLinkedOpenHashMap

public Short2ShortLinkedOpenHashMap()

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

Short2ShortLinkedOpenHashMap

public Short2ShortLinkedOpenHashMap(Map 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.

Short2ShortLinkedOpenHashMap

public Short2ShortLinkedOpenHashMap(Map 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.

Short2ShortLinkedOpenHashMap

public Short2ShortLinkedOpenHashMap(Short2ShortMap 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.

Short2ShortLinkedOpenHashMap

public Short2ShortLinkedOpenHashMap(Short2ShortMap 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.

Method Detail

growthFactor

public void growthFactor(int growthFactor)

Sets the growth factor. Subsequent enlargements will increase the table size roughly by a multiplicative factor of 2^p/16.

Parameters:

growthFactor - the new growth factor; it must be positive.

growthFactor

public int growthFactor()

Gets the growth factor.

Returns:

the growth factor of this set.

See Also:

growthFactor(int)

put

public short put(short k,
                 short v)

Description copied from interface: Short2ShortMap

Adds a pair to the map.

Specified by:

put in interface Short2ShortMap

Overrides:

put in class AbstractShort2ShortMap

put

public Object put(Object ok,
                  Object ov)

Description copied from class: AbstractShort2ShortMap

Delegates to the corresponding type-specific method, taking care of returning 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.

Specified by:

put in interface Map

Overrides:

put in class AbstractShort2ShortMap

containsValue

public boolean containsValue(short v)

Description copied from class: AbstractShort2ShortMap

Checks whether the given value is contained in AbstractShort2ShortMap.values().

Specified by:

containsValue in interface Short2ShortMap

Overrides:

containsValue in class AbstractShort2ShortMap

clear

public void clear()

Specified by:

clear in interface Map

Overrides:

clear in class AbstractShort2ShortMap

firstShortKey

public final short firstShortKey()

Returns the first key of this map in iteration order.

Specified by:

firstShortKey in interface Short2ShortSortedMap

Returns:

the first key in iteration order.

See Also:

SortedMap.firstKey()

lastShortKey

public final short lastShortKey()

Returns the last key of this map in iteration order.

Specified by:

lastShortKey in interface Short2ShortSortedMap

Returns:

the last key in iteration order.

See Also:

SortedMap.lastKey()

comparator

public final Comparator comparator()

Specified by:

comparator in interface SortedMap

tailMap

public final Short2ShortSortedMap tailMap(short from)

Specified by:

tailMap in interface Short2ShortSortedMap

See Also:

SortedMap.tailMap(Object)

headMap

public final Short2ShortSortedMap headMap(short to)

Specified by:

headMap in interface Short2ShortSortedMap

See Also:

SortedMap.headMap(Object)

subMap

public final Short2ShortSortedMap subMap(short from,
                                         short to)

Specified by:

subMap in interface Short2ShortSortedMap

See Also:

SortedMap.subMap(Object,Object)

containsKey

public boolean containsKey(short k)

Description copied from class: AbstractShort2ShortMap

Checks whether the given value is contained in AbstractShort2ShortMap.keySet().

Specified by:

containsKey in interface Short2ShortMap

Overrides:

containsKey in class AbstractShort2ShortMap

size

public int size()

Specified by:

size in interface Map

isEmpty

public boolean isEmpty()

Specified by:

isEmpty in interface Map

Overrides:

isEmpty in class AbstractShort2ShortMap

get

public short get(short k)

Description copied from interface: Short2ShortMap

Returns the value to which the given key is mapped.

Specified by:

get in interface Short2ShortMap

Parameters:

k - the key.

Returns:

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

See Also:

Map.get(Object)

remove

public short remove(short k)

Description copied from interface: Short2ShortMap

Removes the mapping with the given key.

Specified by:

remove in interface Short2ShortMap

Overrides:

remove in class AbstractShort2ShortMap

get

public Object get(Object ok)

Description copied from class: AbstractShort2ShortMap

Delegates to the corresponding type-specific method, taking care of returning 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.

Specified by:

get in interface Map

Overrides:

get in class AbstractShort2ShortMap

remove

public Object remove(Object ok)

Description copied from class: AbstractShort2ShortMap

Delegates to the corresponding type-specific method, taking care of returning 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.

Specified by:

remove in interface Map

Overrides:

remove in class AbstractShort2ShortMap

entrySet

public Set entrySet()

Specified by:

entrySet in interface Map

keySet

public Set keySet()

Description copied from class: AbstractShort2ShortSortedMap

Returns a type-specific-sorted-set view of the keys of this map.

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 Map

Overrides:

keySet in class AbstractShort2ShortSortedMap

Returns:

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

values

public Collection values()

Description copied from class: AbstractShort2ShortMap

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.

Specified by:

values in interface Map

Overrides:

values in class AbstractShort2ShortMap

Returns:

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

rehash

public boolean rehash()

Rehashes this map without changing the table size.

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

Returns:

true if there was enough memory to rehash the map, false otherwise.

See Also:

trim()

trim

public boolean trim()

Rehashes the map, making the table as small as possible.

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 optimise 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().

Returns:

true if there was enough memory to trim the map.

See Also:

trim(int), rehash()

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 n entries, still satisfying the load factor. If the current table size is smaller than or equal to N, or if the number of elements of this map is larger than 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(), rehash()

clone

public Object 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

Overrides:

hashCode in class AbstractShort2ShortMap

Returns:

a hash code for this map.