GNU Trove

Uses of Interface
gnu.trove.TDoubleHashingStrategy

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

Uses of TDoubleHashingStrategy in gnu.trove
 

Classes in gnu.trove that implement TDoubleHashingStrategy
 class TDoubleDoubleHashMap
          An open addressed Map implementation for double keys and double values.
 class TDoubleFloatHashMap
          An open addressed Map implementation for double keys and float values.
 class TDoubleHash
          An open addressed hashing implementation for double primitives.
 class TDoubleHashSet
          An open addressed set implementation for double primitives.
 class TDoubleIntHashMap
          An open addressed Map implementation for double keys and int values.
 class TDoubleLongHashMap
          An open addressed Map implementation for double keys and long values.
 class TDoubleObjectHashMap
          An open addressed Map implementation for double keys and Object values.
 

Fields in gnu.trove declared as TDoubleHashingStrategy
protected  TDoubleHashingStrategy TDoubleHash._hashingStrategy
          strategy used to hash values in this collection
 

Constructors in gnu.trove with parameters of type TDoubleHashingStrategy
TDoubleObjectHashMap(TDoubleHashingStrategy strategy)
          Creates a new TDoubleObjectHashMap instance with the default capacity and load factor.
TDoubleObjectHashMap(int initialCapacity, TDoubleHashingStrategy strategy)
          Creates a new TDoubleObjectHashMap instance whose capacity is the next highest prime above initialCapacity + 1 unless that value is already prime.
TDoubleObjectHashMap(int initialCapacity, float loadFactor, TDoubleHashingStrategy strategy)
          Creates a new TDoubleObjectHashMap instance with a prime value at or near the specified capacity and load factor.
TDoubleLongHashMap(TDoubleHashingStrategy strategy)
          Creates a new TDoubleLongHashMap instance with the default capacity and load factor.
TDoubleLongHashMap(int initialCapacity, TDoubleHashingStrategy strategy)
          Creates a new TDoubleLongHashMap instance whose capacity is the next highest prime above initialCapacity + 1 unless that value is already prime.
TDoubleLongHashMap(int initialCapacity, float loadFactor, TDoubleHashingStrategy strategy)
          Creates a new TDoubleLongHashMap instance with a prime value at or near the specified capacity and load factor.
TDoubleIntHashMap(TDoubleHashingStrategy strategy)
          Creates a new TDoubleIntHashMap instance with the default capacity and load factor.
TDoubleIntHashMap(int initialCapacity, TDoubleHashingStrategy strategy)
          Creates a new TDoubleIntHashMap instance whose capacity is the next highest prime above initialCapacity + 1 unless that value is already prime.
TDoubleIntHashMap(int initialCapacity, float loadFactor, TDoubleHashingStrategy strategy)
          Creates a new TDoubleIntHashMap instance with a prime value at or near the specified capacity and load factor.
TDoubleHashSet(TDoubleHashingStrategy strategy)
          Creates a new TDoubleHash instance with the default capacity and load factor.
TDoubleHashSet(int initialCapacity, TDoubleHashingStrategy strategy)
          Creates a new TDoubleHash instance whose capacity is the next highest prime above initialCapacity + 1 unless that value is already prime.
TDoubleHashSet(int initialCapacity, float loadFactor, TDoubleHashingStrategy strategy)
          Creates a new TDoubleHash instance with a prime value at or near the specified capacity and load factor.
TDoubleHashSet(double[] array, TDoubleHashingStrategy strategy)
          Creates a new TDoubleHashSet instance containing the elements of array.
TDoubleHash(TDoubleHashingStrategy strategy)
          Creates a new TDoubleHash instance with the default capacity and load factor.
TDoubleHash(int initialCapacity, TDoubleHashingStrategy strategy)
          Creates a new TDoubleHash instance whose capacity is the next highest prime above initialCapacity + 1 unless that value is already prime.
TDoubleHash(int initialCapacity, float loadFactor, TDoubleHashingStrategy strategy)
          Creates a new TDoubleHash instance with a prime value at or near the specified capacity and load factor.
TDoubleFloatHashMap(TDoubleHashingStrategy strategy)
          Creates a new TDoubleFloatHashMap instance with the default capacity and load factor.
TDoubleFloatHashMap(int initialCapacity, TDoubleHashingStrategy strategy)
          Creates a new TDoubleFloatHashMap instance whose capacity is the next highest prime above initialCapacity + 1 unless that value is already prime.
TDoubleFloatHashMap(int initialCapacity, float loadFactor, TDoubleHashingStrategy strategy)
          Creates a new TDoubleFloatHashMap instance with a prime value at or near the specified capacity and load factor.
TDoubleDoubleHashMap(TDoubleHashingStrategy strategy)
          Creates a new TDoubleDoubleHashMap instance with the default capacity and load factor.
TDoubleDoubleHashMap(int initialCapacity, TDoubleHashingStrategy strategy)
          Creates a new TDoubleDoubleHashMap instance whose capacity is the next highest prime above initialCapacity + 1 unless that value is already prime.
TDoubleDoubleHashMap(int initialCapacity, float loadFactor, TDoubleHashingStrategy strategy)
          Creates a new TDoubleDoubleHashMap instance with a prime value at or near the specified capacity and load factor.
 


GNU Trove

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