GNU Trove

## Uses of Interface
gnu.trove.TByteHashingStrategy

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

Uses of TByteHashingStrategy in gnu.trove

Classes in gnu.trove that implement TByteHashingStrategy
`class` `TByteByteHashMap` An open addressed Map implementation for byte keys and byte values.
`class` `TByteDoubleHashMap` An open addressed Map implementation for byte keys and double values.
`class` `TByteFloatHashMap` An open addressed Map implementation for byte keys and float values.
`class` `TByteHash` An open addressed hashing implementation for byte primitives.
`class` `TByteHashSet` An open addressed set implementation for byte primitives.
`class` `TByteIntHashMap` An open addressed Map implementation for byte keys and int values.
`class` `TByteLongHashMap` An open addressed Map implementation for byte keys and long values.
`class` `TByteObjectHashMap<V>` An open addressed Map implementation for byte keys and Object values.
`class` `TByteShortHashMap` An open addressed Map implementation for byte keys and short values.

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

Constructors in gnu.trove with parameters of type TByteHashingStrategy
`TByteByteHashMap(int initialCapacity, float loadFactor, TByteHashingStrategy strategy)` Creates a new `TByteByteHashMap` instance with a prime value at or near the specified capacity and load factor.
`TByteByteHashMap(int initialCapacity, TByteHashingStrategy strategy)` Creates a new `TByteByteHashMap` instance whose capacity is the next highest prime above `initialCapacity + 1` unless that value is already prime.
`TByteByteHashMap(TByteHashingStrategy strategy)` Creates a new `TByteByteHashMap` instance with the default capacity and load factor.
`TByteDoubleHashMap(int initialCapacity, float loadFactor, TByteHashingStrategy strategy)` Creates a new `TByteDoubleHashMap` instance with a prime value at or near the specified capacity and load factor.
`TByteDoubleHashMap(int initialCapacity, TByteHashingStrategy strategy)` Creates a new `TByteDoubleHashMap` instance whose capacity is the next highest prime above `initialCapacity + 1` unless that value is already prime.
`TByteDoubleHashMap(TByteHashingStrategy strategy)` Creates a new `TByteDoubleHashMap` instance with the default capacity and load factor.
`TByteFloatHashMap(int initialCapacity, float loadFactor, TByteHashingStrategy strategy)` Creates a new `TByteFloatHashMap` instance with a prime value at or near the specified capacity and load factor.
`TByteFloatHashMap(int initialCapacity, TByteHashingStrategy strategy)` Creates a new `TByteFloatHashMap` instance whose capacity is the next highest prime above `initialCapacity + 1` unless that value is already prime.
`TByteFloatHashMap(TByteHashingStrategy strategy)` Creates a new `TByteFloatHashMap` instance with the default capacity and load factor.
`TByteHash(int initialCapacity, float loadFactor, TByteHashingStrategy strategy)` Creates a new `TByteHash` instance with a prime value at or near the specified capacity and load factor.
`TByteHash(int initialCapacity, TByteHashingStrategy strategy)` Creates a new `TByteHash` instance whose capacity is the next highest prime above `initialCapacity + 1` unless that value is already prime.
`TByteHash(TByteHashingStrategy strategy)` Creates a new `TByteHash` instance with the default capacity and load factor.
`TByteHashSet(byte[] array, TByteHashingStrategy strategy)` Creates a new `TByteHashSet` instance containing the elements of `array`.
`TByteHashSet(int initialCapacity, float loadFactor, TByteHashingStrategy strategy)` Creates a new `TByteHash` instance with a prime value at or near the specified capacity and load factor.
`TByteHashSet(int initialCapacity, TByteHashingStrategy strategy)` Creates a new `TByteHash` instance whose capacity is the next highest prime above `initialCapacity + 1` unless that value is already prime.
`TByteHashSet(TByteHashingStrategy strategy)` Creates a new `TByteHash` instance with the default capacity and load factor.
`TByteIntHashMap(int initialCapacity, float loadFactor, TByteHashingStrategy strategy)` Creates a new `TByteIntHashMap` instance with a prime value at or near the specified capacity and load factor.
`TByteIntHashMap(int initialCapacity, TByteHashingStrategy strategy)` Creates a new `TByteIntHashMap` instance whose capacity is the next highest prime above `initialCapacity + 1` unless that value is already prime.
`TByteIntHashMap(TByteHashingStrategy strategy)` Creates a new `TByteIntHashMap` instance with the default capacity and load factor.
`TByteLongHashMap(int initialCapacity, float loadFactor, TByteHashingStrategy strategy)` Creates a new `TByteLongHashMap` instance with a prime value at or near the specified capacity and load factor.
`TByteLongHashMap(int initialCapacity, TByteHashingStrategy strategy)` Creates a new `TByteLongHashMap` instance whose capacity is the next highest prime above `initialCapacity + 1` unless that value is already prime.
`TByteLongHashMap(TByteHashingStrategy strategy)` Creates a new `TByteLongHashMap` instance with the default capacity and load factor.
`TByteObjectHashMap(int initialCapacity, float loadFactor, TByteHashingStrategy strategy)` Creates a new `TByteObjectHashMap` instance with a prime value at or near the specified capacity and load factor.
`TByteObjectHashMap(int initialCapacity, TByteHashingStrategy strategy)` Creates a new `TByteObjectHashMap` instance whose capacity is the next highest prime above `initialCapacity + 1` unless that value is already prime.
`TByteObjectHashMap(TByteHashingStrategy strategy)` Creates a new `TByteObjectHashMap` instance with the default capacity and load factor.
`TByteShortHashMap(int initialCapacity, float loadFactor, TByteHashingStrategy strategy)` Creates a new `TByteShortHashMap` instance with a prime value at or near the specified capacity and load factor.
`TByteShortHashMap(int initialCapacity, TByteHashingStrategy strategy)` Creates a new `TByteShortHashMap` instance whose capacity is the next highest prime above `initialCapacity + 1` unless that value is already prime.
`TByteShortHashMap(TByteHashingStrategy strategy)` Creates a new `TByteShortHashMap` instance with the default capacity and load factor.

GNU Trove

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