GNU Trove

gnu.trove
Class TDoubleHash

java.lang.Object
  |
  +--gnu.trove.THash
        |
        +--gnu.trove.TPrimitiveHash
              |
              +--gnu.trove.TDoubleHash
All Implemented Interfaces:
java.lang.Cloneable, java.io.Serializable, TDoubleHashingStrategy
Direct Known Subclasses:
TDoubleDoubleHashMap, TDoubleFloatHashMap, TDoubleHashSet, TDoubleIntHashMap, TDoubleLongHashMap, TDoubleObjectHashMap

public abstract class TDoubleHash
extends TPrimitiveHash
implements java.io.Serializable, TDoubleHashingStrategy

An open addressed hashing implementation for double primitives. Created: Sun Nov 4 08:56:06 2001

Version:
$Id: TDoubleHash.java,v 1.14 2004/02/25 14:05:29 ericdf Exp $
Author:
Eric D. Friedman
See Also:
Serialized Form

Field Summary
protected  TDoubleHashingStrategy _hashingStrategy
          strategy used to hash values in this collection
protected  double[] _set
          the set of doubles
 
Fields inherited from class gnu.trove.TPrimitiveHash
_states, FREE, FULL, REMOVED
 
Fields inherited from class gnu.trove.THash
_free, _loadFactor, _maxSize, _size, DEFAULT_INITIAL_CAPACITY, DEFAULT_LOAD_FACTOR
 
Constructor Summary
TDoubleHash()
          Creates a new TDoubleHash instance with the default capacity and load factor.
TDoubleHash(int initialCapacity)
          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)
          Creates a new TDoubleHash instance with a prime value at or near the specified capacity and load factor.
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.
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(TDoubleHashingStrategy strategy)
          Creates a new TDoubleHash instance with the default capacity and load factor.
 
Method Summary
 java.lang.Object clone()
           
 int computeHashCode(double val)
          Default implementation of TDoubleHashingStrategy: delegates hashing to HashFunctions.hash(double).
 boolean contains(double val)
          Searches the set for val
 boolean forEach(TDoubleProcedure procedure)
          Executes procedure for each element in the set.
protected  int index(double val)
          Locates the index of val.
protected  int insertionIndex(double val)
          Locates the index at which val can be inserted.
protected  void removeAt(int index)
          Releases the element currently stored at index.
protected  int setUp(int initialCapacity)
          initializes the hashtable to a prime capacity which is at least initialCapacity + 1.
 
Methods inherited from class gnu.trove.TPrimitiveHash
capacity
 
Methods inherited from class gnu.trove.THash
clear, compact, ensureCapacity, isEmpty, postInsertHook, rehash, size, trimToSize
 
Methods inherited from class java.lang.Object
equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Field Detail

_set

protected transient double[] _set
the set of doubles


_hashingStrategy

protected TDoubleHashingStrategy _hashingStrategy
strategy used to hash values in this collection

Constructor Detail

TDoubleHash

public TDoubleHash()
Creates a new TDoubleHash instance with the default capacity and load factor.


TDoubleHash

public TDoubleHash(int initialCapacity)
Creates a new TDoubleHash instance whose capacity is the next highest prime above initialCapacity + 1 unless that value is already prime.

Parameters:
initialCapacity - an int value

TDoubleHash

public TDoubleHash(int initialCapacity,
                   float loadFactor)
Creates a new TDoubleHash instance with a prime value at or near the specified capacity and load factor.

Parameters:
initialCapacity - used to find a prime capacity for the table.
loadFactor - used to calculate the threshold over which rehashing takes place.

TDoubleHash

public TDoubleHash(TDoubleHashingStrategy strategy)
Creates a new TDoubleHash instance with the default capacity and load factor.

Parameters:
strategy - used to compute hash codes and to compare keys.

TDoubleHash

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

Parameters:
initialCapacity - an int value
strategy - used to compute hash codes and to compare keys.

TDoubleHash

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

Parameters:
initialCapacity - used to find a prime capacity for the table.
loadFactor - used to calculate the threshold over which rehashing takes place.
strategy - used to compute hash codes and to compare keys.
Method Detail

clone

public java.lang.Object clone()
Overrides:
clone in class TPrimitiveHash
Returns:
a deep clone of this collection

setUp

protected int setUp(int initialCapacity)
initializes the hashtable to a prime capacity which is at least initialCapacity + 1.

Overrides:
setUp in class TPrimitiveHash
Parameters:
initialCapacity - an int value
Returns:
the actual capacity chosen

contains

public boolean contains(double val)
Searches the set for val

Parameters:
val - an double value
Returns:
a boolean value

forEach

public boolean forEach(TDoubleProcedure procedure)
Executes procedure for each element in the set.

Parameters:
procedure - a TObjectProcedure value
Returns:
false if the loop over the set terminated because the procedure returned false for some value.

removeAt

protected void removeAt(int index)
Releases the element currently stored at index.

Overrides:
removeAt in class TPrimitiveHash
Parameters:
index - an int value

index

protected int index(double val)
Locates the index of val.

Parameters:
val - an double value
Returns:
the index of val or -1 if it isn't in the set.

insertionIndex

protected int insertionIndex(double val)
Locates the index at which val can be inserted. if there is already a value equal()ing val in the set, returns that value as a negative integer.

Parameters:
val - an double value
Returns:
an int value

computeHashCode

public final int computeHashCode(double val)
Default implementation of TDoubleHashingStrategy: delegates hashing to HashFunctions.hash(double).

Specified by:
computeHashCode in interface TDoubleHashingStrategy
Returns:
the hashcode.

GNU Trove

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