GNU Trove

## Uses of Interface
gnu.trove.TShortHashingStrategy

Packages that use TShortHashingStrategy
gnu.trove: GNU Trove: High performance collections for Java.

Uses of TShortHashingStrategy in gnu.trove

Classes in gnu.trove that implement TShortHashingStrategy
`class` `TShortByteHashMap` An open addressed Map implementation for short keys and byte values.
`class` `TShortDoubleHashMap` An open addressed Map implementation for short keys and double values.
`class` `TShortFloatHashMap` An open addressed Map implementation for short keys and float values.
`class` `TShortHash` An open addressed hashing implementation for short primitives.
`class` `TShortHashSet` An open addressed set implementation for short primitives.
`class` `TShortIntHashMap` An open addressed Map implementation for short keys and int values.
`class` `TShortLongHashMap` An open addressed Map implementation for short keys and long values.
`class` `TShortObjectHashMap<V>` An open addressed Map implementation for short keys and Object values.
`class` `TShortShortHashMap` An open addressed Map implementation for short keys and short values.

Fields in gnu.trove declared as TShortHashingStrategy
`protected TShortHashingStrategy` `TShortHash._hashingStrategy` strategy used to hash values in this collection

Constructors in gnu.trove with parameters of type TShortHashingStrategy
`TShortByteHashMap(int initialCapacity, float loadFactor, TShortHashingStrategy strategy)` Creates a new `TShortByteHashMap` instance with a prime value at or near the specified capacity and load factor.
`TShortByteHashMap(int initialCapacity, TShortHashingStrategy strategy)` Creates a new `TShortByteHashMap` instance whose capacity is the next highest prime above `initialCapacity + 1` unless that value is already prime.
`TShortByteHashMap(TShortHashingStrategy strategy)` Creates a new `TShortByteHashMap` instance with the default capacity and load factor.
`TShortDoubleHashMap(int initialCapacity, float loadFactor, TShortHashingStrategy strategy)` Creates a new `TShortDoubleHashMap` instance with a prime value at or near the specified capacity and load factor.
`TShortDoubleHashMap(int initialCapacity, TShortHashingStrategy strategy)` Creates a new `TShortDoubleHashMap` instance whose capacity is the next highest prime above `initialCapacity + 1` unless that value is already prime.
`TShortDoubleHashMap(TShortHashingStrategy strategy)` Creates a new `TShortDoubleHashMap` instance with the default capacity and load factor.
`TShortFloatHashMap(int initialCapacity, float loadFactor, TShortHashingStrategy strategy)` Creates a new `TShortFloatHashMap` instance with a prime value at or near the specified capacity and load factor.
`TShortFloatHashMap(int initialCapacity, TShortHashingStrategy strategy)` Creates a new `TShortFloatHashMap` instance whose capacity is the next highest prime above `initialCapacity + 1` unless that value is already prime.
`TShortFloatHashMap(TShortHashingStrategy strategy)` Creates a new `TShortFloatHashMap` instance with the default capacity and load factor.
`TShortHash(int initialCapacity, float loadFactor, TShortHashingStrategy strategy)` Creates a new `TShortHash` instance with a prime value at or near the specified capacity and load factor.
`TShortHash(int initialCapacity, TShortHashingStrategy strategy)` Creates a new `TShortHash` instance whose capacity is the next highest prime above `initialCapacity + 1` unless that value is already prime.
`TShortHash(TShortHashingStrategy strategy)` Creates a new `TShortHash` instance with the default capacity and load factor.
`TShortHashSet(int initialCapacity, float loadFactor, TShortHashingStrategy strategy)` Creates a new `TShortHash` instance with a prime value at or near the specified capacity and load factor.
`TShortHashSet(int initialCapacity, TShortHashingStrategy strategy)` Creates a new `TShortHash` instance whose capacity is the next highest prime above `initialCapacity + 1` unless that value is already prime.
`TShortHashSet(short[] array, TShortHashingStrategy strategy)` Creates a new `TShortHashSet` instance containing the elements of `array`.
`TShortHashSet(TShortHashingStrategy strategy)` Creates a new `TShortHash` instance with the default capacity and load factor.
`TShortIntHashMap(int initialCapacity, float loadFactor, TShortHashingStrategy strategy)` Creates a new `TShortIntHashMap` instance with a prime value at or near the specified capacity and load factor.
`TShortIntHashMap(int initialCapacity, TShortHashingStrategy strategy)` Creates a new `TShortIntHashMap` instance whose capacity is the next highest prime above `initialCapacity + 1` unless that value is already prime.
`TShortIntHashMap(TShortHashingStrategy strategy)` Creates a new `TShortIntHashMap` instance with the default capacity and load factor.
`TShortLongHashMap(int initialCapacity, float loadFactor, TShortHashingStrategy strategy)` Creates a new `TShortLongHashMap` instance with a prime value at or near the specified capacity and load factor.
`TShortLongHashMap(int initialCapacity, TShortHashingStrategy strategy)` Creates a new `TShortLongHashMap` instance whose capacity is the next highest prime above `initialCapacity + 1` unless that value is already prime.
`TShortLongHashMap(TShortHashingStrategy strategy)` Creates a new `TShortLongHashMap` instance with the default capacity and load factor.
`TShortObjectHashMap(int initialCapacity, float loadFactor, TShortHashingStrategy strategy)` Creates a new `TShortObjectHashMap` instance with a prime value at or near the specified capacity and load factor.
`TShortObjectHashMap(int initialCapacity, TShortHashingStrategy strategy)` Creates a new `TShortObjectHashMap` instance whose capacity is the next highest prime above `initialCapacity + 1` unless that value is already prime.
`TShortObjectHashMap(TShortHashingStrategy strategy)` Creates a new `TShortObjectHashMap` instance with the default capacity and load factor.
`TShortShortHashMap(int initialCapacity, float loadFactor, TShortHashingStrategy strategy)` Creates a new `TShortShortHashMap` instance with a prime value at or near the specified capacity and load factor.
`TShortShortHashMap(int initialCapacity, TShortHashingStrategy strategy)` Creates a new `TShortShortHashMap` instance whose capacity is the next highest prime above `initialCapacity + 1` unless that value is already prime.
`TShortShortHashMap(TShortHashingStrategy strategy)` Creates a new `TShortShortHashMap` instance with the default capacity and load factor.

GNU Trove

GNU Trove is copyright © 2001-2009 Eric D. Friedman. All Rights Reserved.