public class ByteOpenCustomHashSet extends AbstractByteSet implements java.io.Serializable, java.lang.Cloneable, Hash
Instances of this class use a hash table to represent a set. The table is filled up to a specified load factor, and then doubled in size to accommodate new entries. If the table is emptied below one fourth of the load factor, it is halved in size; however, the table is never reduced to a size smaller than that at creation time: this approach makes it possible to create sets with a large capacity in which insertions and deletions do not cause immediately rehashing. Moreover, halving is not performed when deleting entries from an iterator, as it would interfere with the iteration process.
Note that clear() does not modify the hash table size. Rather, a
family of trimming methods lets you control the size of
the table; this is particularly useful if you reuse instances of this class.
Hash,
HashCommon,
Serialized FormHash.Strategy<K>DEFAULT_GROWTH_FACTOR, DEFAULT_INITIAL_SIZE, DEFAULT_LOAD_FACTOR, FAST_LOAD_FACTOR, FREE, OCCUPIED, PRIMES, REMOVED, VERY_FAST_LOAD_FACTOR| Constructor and Description |
|---|
ByteOpenCustomHashSet(byte[] a,
ByteHash.Strategy strategy)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor
copying the elements of an array. |
ByteOpenCustomHashSet(byte[] a,
float f,
ByteHash.Strategy strategy)
Creates a new hash set copying the elements of an array.
|
ByteOpenCustomHashSet(byte[] a,
int offset,
int length,
ByteHash.Strategy strategy)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor
and fills it with the elements of a given array. |
ByteOpenCustomHashSet(byte[] a,
int offset,
int length,
float f,
ByteHash.Strategy strategy)
Creates a new hash set and fills it with the elements of a given array.
|
ByteOpenCustomHashSet(ByteCollection c,
ByteHash.Strategy strategy)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor
copying a given type-specific collection. |
ByteOpenCustomHashSet(ByteCollection c,
float f,
ByteHash.Strategy strategy)
Creates a new hash set copying a given type-specific collection.
|
ByteOpenCustomHashSet(ByteHash.Strategy strategy)
Creates a new hash set with initial expected
Hash.DEFAULT_INITIAL_SIZE elements and
Hash.DEFAULT_LOAD_FACTOR as load factor. |
ByteOpenCustomHashSet(ByteIterator i,
ByteHash.Strategy strategy)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor
using elements provided by a type-specific iterator. |
ByteOpenCustomHashSet(ByteIterator i,
float f,
ByteHash.Strategy strategy)
Creates a new hash set using elements provided by a type-specific iterator.
|
ByteOpenCustomHashSet(java.util.Collection<? extends java.lang.Byte> c,
ByteHash.Strategy strategy)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor
copying a given collection. |
ByteOpenCustomHashSet(java.util.Collection<? extends java.lang.Byte> c,
float f,
ByteHash.Strategy strategy)
Creates a new hash set copying a given collection.
|
ByteOpenCustomHashSet(int expected,
ByteHash.Strategy strategy)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor. |
ByteOpenCustomHashSet(int expected,
float f,
ByteHash.Strategy strategy)
Creates a new hash set.
|
ByteOpenCustomHashSet(java.util.Iterator<?> i,
ByteHash.Strategy strategy)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor
using elements provided by an iterator. |
ByteOpenCustomHashSet(java.util.Iterator<?> i,
float f,
ByteHash.Strategy strategy)
Creates a new hash set using elements provided by an iterator.
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
add(byte k)
Ensures that this collection contains the specified element (optional
operation).
|
boolean |
addAll(ByteCollection c)
Adds all elements of the given type-specific collection to this collection.
|
boolean |
addAll(java.util.Collection<? extends java.lang.Byte> c) |
void |
clear() |
ByteOpenCustomHashSet |
clone()
Returns a deep copy of this set.
|
boolean |
contains(byte k)
Returns
true if this collection contains the specified element. |
int |
hashCode()
Returns a hash code for this set.
|
boolean |
isEmpty() |
ByteIterator |
iterator()
Returns a type-specific iterator on the elements of this collection.
|
boolean |
remove(byte k)
Removes an element from this set.
|
int |
size() |
ByteHash.Strategy |
strategy()
Returns the hashing strategy.
|
boolean |
trim()
Rehashes this set, making the table as small as possible.
|
boolean |
trim(int n)
Rehashes this set if the table is too large.
|
equals, remadd, contains, containsAll, remove, removeAll, retainAll, toArray, toByteArray, toByteArray, toStringcontainsAll, removeAll, retainAll, toArray, toArraycontainsAll, removeAll, removeIf, removeIf, retainAll, toArray, toByteArray, toByteArrayforEach, forEachpublic ByteOpenCustomHashSet(int expected,
float f,
ByteHash.Strategy strategy)
The actual table size will be the least power of two greater than
expected/f.
expected - the expected number of elements in the hash set.f - the load factor.strategy - the strategy.public ByteOpenCustomHashSet(int expected,
ByteHash.Strategy strategy)
Hash.DEFAULT_LOAD_FACTOR as load factor.expected - the expected number of elements in the hash set.strategy - the strategy.public ByteOpenCustomHashSet(ByteHash.Strategy strategy)
Hash.DEFAULT_INITIAL_SIZE elements and
Hash.DEFAULT_LOAD_FACTOR as load factor.strategy - the strategy.public ByteOpenCustomHashSet(java.util.Collection<? extends java.lang.Byte> c,
float f,
ByteHash.Strategy strategy)
c - a Collection to be copied into the new hash set.f - the load factor.strategy - the strategy.public ByteOpenCustomHashSet(java.util.Collection<? extends java.lang.Byte> c,
ByteHash.Strategy strategy)
Hash.DEFAULT_LOAD_FACTOR as load factor
copying a given collection.c - a Collection to be copied into the new hash set.strategy - the strategy.public ByteOpenCustomHashSet(ByteCollection c, float f, ByteHash.Strategy strategy)
c - a type-specific collection to be copied into the new hash set.f - the load factor.strategy - the strategy.public ByteOpenCustomHashSet(ByteCollection c, ByteHash.Strategy strategy)
Hash.DEFAULT_LOAD_FACTOR as load factor
copying a given type-specific collection.c - a type-specific collection to be copied into the new hash set.strategy - the strategy.public ByteOpenCustomHashSet(ByteIterator i, float f, ByteHash.Strategy strategy)
i - a type-specific iterator whose elements will fill the set.f - the load factor.strategy - the strategy.public ByteOpenCustomHashSet(ByteIterator i, ByteHash.Strategy strategy)
Hash.DEFAULT_LOAD_FACTOR as load factor
using elements provided by a type-specific iterator.i - a type-specific iterator whose elements will fill the set.strategy - the strategy.public ByteOpenCustomHashSet(java.util.Iterator<?> i,
float f,
ByteHash.Strategy strategy)
i - an iterator whose elements will fill the set.f - the load factor.strategy - the strategy.public ByteOpenCustomHashSet(java.util.Iterator<?> i,
ByteHash.Strategy strategy)
Hash.DEFAULT_LOAD_FACTOR as load factor
using elements provided by an iterator.i - an iterator whose elements will fill the set.strategy - the strategy.public ByteOpenCustomHashSet(byte[] a,
int offset,
int length,
float f,
ByteHash.Strategy strategy)
a - an array whose elements will be used to fill the set.offset - the first element to use.length - the number of elements to use.f - the load factor.strategy - the strategy.public ByteOpenCustomHashSet(byte[] a,
int offset,
int length,
ByteHash.Strategy strategy)
Hash.DEFAULT_LOAD_FACTOR as load factor
and fills it with the elements of a given array.a - an array whose elements will be used to fill the set.offset - the first element to use.length - the number of elements to use.strategy - the strategy.public ByteOpenCustomHashSet(byte[] a,
float f,
ByteHash.Strategy strategy)
a - an array to be copied into the new hash set.f - the load factor.strategy - the strategy.public ByteOpenCustomHashSet(byte[] a,
ByteHash.Strategy strategy)
Hash.DEFAULT_LOAD_FACTOR as load factor
copying the elements of an array.a - an array to be copied into the new hash set.strategy - the strategy.public ByteHash.Strategy strategy()
public boolean addAll(ByteCollection c)
ByteCollectionaddAll in interface ByteCollectionaddAll in class AbstractByteCollectionc - a type-specific collection.true if this collection changed as a result of the call.Collection.addAll(Collection)public boolean addAll(java.util.Collection<? extends java.lang.Byte> c)
addAll in interface java.util.Collection<java.lang.Byte>addAll in interface java.util.Set<java.lang.Byte>addAll in class java.util.AbstractCollection<java.lang.Byte>public boolean add(byte k)
AbstractByteCollection
This implementation always throws an UnsupportedOperationException.
add in interface ByteCollectionadd in class AbstractByteCollectionCollection.add(Object)public boolean remove(byte k)
AbstractByteSet
Note that the corresponding method of a type-specific collection is
rem(). This unfortunate situation is caused by the clash with the
similarly named index-based method in the List interface. Delegates to the type-specific rem() method implemented
by type-specific abstract Collection superclass.
remove in interface ByteSetremove in class AbstractByteSetCollection.remove(Object)public boolean contains(byte k)
AbstractByteCollectiontrue if this collection contains the specified element.
This implementation iterates over the elements in the collection, looking for the specified element.
contains in interface ByteCollectioncontains in class AbstractByteCollectionCollection.contains(Object)public void clear()
clear in interface java.util.Collection<java.lang.Byte>clear in interface java.util.Set<java.lang.Byte>clear in class java.util.AbstractCollection<java.lang.Byte>public int size()
size in interface java.util.Collection<java.lang.Byte>size in interface java.util.Set<java.lang.Byte>size in class java.util.AbstractCollection<java.lang.Byte>public boolean isEmpty()
isEmpty in interface java.util.Collection<java.lang.Byte>isEmpty in interface java.util.Set<java.lang.Byte>isEmpty in class java.util.AbstractCollection<java.lang.Byte>public ByteIterator iterator()
ByteCollection
Note that this specification strengthens the one given in
Iterable.iterator(), which was already strengthened in the
corresponding type-specific class, but was weakened by the fact that this
interface extends Collection.
iterator in interface ByteCollectioniterator in interface ByteIterableiterator in interface ByteSetiterator in interface java.lang.Iterable<java.lang.Byte>iterator in interface java.util.Collection<java.lang.Byte>iterator in interface java.util.Set<java.lang.Byte>iterator in class AbstractByteSetIterable.iterator()public boolean trim()
This method rehashes the table to the smallest size satisfying the load factor. It can be used when the set will not be changed anymore, so to optimize access speed and size.
If the table size is already the minimum possible, this method does nothing.
trim(int)public boolean trim(int n)
Let N be the smallest table size that can hold
max(n, entries, still satisfying the load
factor. If the current table size is smaller than or equal to N,
this method does nothing. Otherwise, it rehashes this set in a table of size
N.
size())
This method is useful when reusing sets. Clearing a set leaves the table size untouched. If you are reusing a set many times, you can call this method with a typical size to avoid keeping around a very large table just because of a few large transient sets.
n - the threshold for the trimming.trim()public ByteOpenCustomHashSet clone()
This method performs a deep copy of this hash set; the data stored in the set, however, is not cloned. Note that this makes a difference only for object keys.
clone in class java.lang.Objectpublic int hashCode()
equals() is not overriden, it is important that the value returned by
this method is the same value as the one returned by the overriden method.hashCode in interface java.util.Collection<java.lang.Byte>hashCode in interface java.util.Set<java.lang.Byte>hashCode in class AbstractByteSet