gnu.trove
Class TByteHashSet
- Externalizable
public class TByteHashSet
extends TByteHash
implements Externalizable
An open addressed set implementation for byte primitives.
TByteHashSet()- Creates a new
TByteHashSet instance with the default
capacity and load factor.
|
TByteHashSet(TByteHashingStrategy strategy)- Creates a new
TByteHash instance with the default
capacity and load factor.
|
TByteHashSet(byte[] array)- Creates a new
TByteHashSet instance containing the
elements of array.
|
TByteHashSet(byte[] array, TByteHashingStrategy strategy)- Creates a new
TByteHashSet instance containing the
elements of array.
|
TByteHashSet(int initialCapacity)- Creates a new
TByteHashSet instance with a prime
capacity equal to or greater than initialCapacity and
with the default 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(int initialCapacity, float loadFactor)- Creates a new
TByteHashSet instance with a prime
capacity equal to or greater than initialCapacity and
with the specified load factor.
|
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.
|
boolean | add(byte val)- Inserts a value into the set.
|
boolean | addAll(byte[] array)- Adds all of the elements in array to the set.
|
void | clear()- Empties the set.
|
boolean | containsAll(byte[] array)- Tests the set to determine if all of the elements in
array are present.
|
boolean | equals(Object other)- Compares this set with another set for equality of their stored
entries.
|
int | hashCode()
|
TByteIterator | iterator()
|
void | readExternal(ObjectInput in)
|
protected void | rehash(int newCapacity)- Expands the set to accommodate new values.
|
boolean | remove(byte val)- Removes val from the set.
|
boolean | removeAll(byte[] array)- Removes all of the elements in array from the set.
|
boolean | retainAll(byte[] array)- Removes any values in the set which are not contained in
array.
|
byte[] | toArray()- Returns a new array containing the values in the set.
|
void | writeExternal(ObjectOutput out)
|
TByteHashSet
public TByteHashSet()
Creates a new TByteHashSet instance with the default
capacity and load factor.
TByteHashSet
public TByteHashSet(TByteHashingStrategy strategy)
Creates a new TByteHash instance with the default
capacity and load factor.
strategy - used to compute hash codes and to compare keys.
TByteHashSet
public TByteHashSet(byte[] array)
Creates a new TByteHashSet instance containing the
elements of array.
array - an array of byte primitives
TByteHashSet
public TByteHashSet(byte[] array,
TByteHashingStrategy strategy) Creates a new TByteHashSet instance containing the
elements of array.
array - an array of byte primitivesstrategy - used to compute hash codes and to compare keys.
TByteHashSet
public TByteHashSet(int initialCapacity)
Creates a new TByteHashSet instance with a prime
capacity equal to or greater than initialCapacity and
with the default load factor.
initialCapacity - an int value
TByteHashSet
public 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.
initialCapacity - an int valuestrategy - used to compute hash codes and to compare keys.
TByteHashSet
public TByteHashSet(int initialCapacity,
float loadFactor) Creates a new TByteHashSet instance with a prime
capacity equal to or greater than initialCapacity and
with the specified load factor.
initialCapacity - an int valueloadFactor - a float value
TByteHashSet
public 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.
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.
add
public boolean add(byte val)
Inserts a value into the set.
- true if the set was modified by the add operation
addAll
public boolean addAll(byte[] array)
Adds all of the elements in array to the set.
array - an array of byte primitives.
- true if the set was modified by the add all operation.
clear
public void clear()
Empties the set.
containsAll
public boolean containsAll(byte[] array)
Tests the set to determine if all of the elements in
array are present.
array - an array of byte primitives.
- true if all elements were present in the set.
equals
public boolean equals(Object other)
Compares this set with another set for equality of their stored
entries.
hashCode
public int hashCode()
iterator
public TByteIterator iterator()
- a TByteIterator with access to the values in this set
readExternal
public void readExternal(ObjectInput in)
throws IOException,
ClassNotFoundException
rehash
protected void rehash(int newCapacity)
Expands the set to accommodate new values.
newCapacity - an int value
remove
public boolean remove(byte val)
Removes val from the set.
- true if the set was modified by the remove operation.
removeAll
public boolean removeAll(byte[] array)
Removes all of the elements in array from the set.
array - an array of byte primitives.
- true if the set was modified by the remove all operation.
retainAll
public boolean retainAll(byte[] array)
Removes any values in the set which are not contained in
array.
array - an array of byte primitives.
- true if the set was modified by the retain all operation
toArray
public byte[] toArray()
Returns a new array containing the values in the set.
writeExternal
public void writeExternal(ObjectOutput out)
throws IOException
GNU Trove is copyright B) 2001-2008 Eric D. Friedman. All Rights Reserved.