public class FloatOpenHashBigSet extends AbstractFloatSet implements Serializable, Cloneable, Hash, Size64
Instances of this class use a hash table to represent a big set: the number of elements in the set is limited only by the amount of core memory. The table (backed by a big array) 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.
The methods of this class are about 30% slower than those of the corresponding non-big set.
Hash,
HashCommon,
Serialized FormHash.Strategy<K>| Modifier and Type | Field and Description |
|---|---|
protected int |
baseMask
The mask for wrapping a base counter.
|
protected boolean |
containsNull
Whether this set contains the null key.
|
protected float |
f
The acceptable load factor.
|
protected float[][] |
key
The big array of keys.
|
protected long |
mask
The mask for wrapping a position counter.
|
protected long |
maxFill
Threshold after which we rehash.
|
protected long |
minN
We never resize below this threshold, which is the construction-time {#n}.
|
protected long |
n
The current table size (always a power of 2).
|
protected int |
segmentMask
The mask for wrapping a segment counter.
|
protected long |
size
Number of entries in the set.
|
DEFAULT_GROWTH_FACTOR, DEFAULT_INITIAL_SIZE, DEFAULT_LOAD_FACTOR, FAST_LOAD_FACTOR, FREE, OCCUPIED, PRIMES, REMOVED, VERY_FAST_LOAD_FACTOR| Constructor and Description |
|---|
FloatOpenHashBigSet()
Creates a new hash big set with initial expected
Hash.DEFAULT_INITIAL_SIZE elements
and Hash.DEFAULT_LOAD_FACTOR as load factor. |
FloatOpenHashBigSet(Collection<? extends Float> c)
Creates a new hash big set with
Hash.DEFAULT_LOAD_FACTOR as load factor
copying a given collection. |
FloatOpenHashBigSet(Collection<? extends Float> c,
float f)
Creates a new hash big set copying a given collection.
|
FloatOpenHashBigSet(float[] a)
Creates a new hash big set with
Hash.DEFAULT_LOAD_FACTOR as load factor
copying the elements of an array. |
FloatOpenHashBigSet(float[] a,
float f)
Creates a new hash big set copying the elements of an array.
|
FloatOpenHashBigSet(float[] a,
int offset,
int length)
Creates a new hash big set with
Hash.DEFAULT_LOAD_FACTOR as load factor and fills it with the elements of a given array. |
FloatOpenHashBigSet(float[] a,
int offset,
int length,
float f)
Creates a new hash big set and fills it with the elements of a given array.
|
FloatOpenHashBigSet(FloatCollection c)
Creates a new hash big set with
Hash.DEFAULT_LOAD_FACTOR as load factor
copying a given type-specific collection. |
FloatOpenHashBigSet(FloatCollection c,
float f)
Creates a new hash big set copying a given type-specific collection.
|
FloatOpenHashBigSet(FloatIterator i)
Creates a new hash big set with
Hash.DEFAULT_LOAD_FACTOR as load factor using elements provided by a type-specific iterator. |
FloatOpenHashBigSet(FloatIterator i,
float f)
Creates a new hash big set using elements provided by a type-specific iterator.
|
FloatOpenHashBigSet(Iterator<?> i)
Creates a new hash big set with
Hash.DEFAULT_LOAD_FACTOR as load factor using elements provided by an iterator. |
FloatOpenHashBigSet(Iterator<?> i,
float f)
Creates a new hash big set using elements provided by an iterator.
|
FloatOpenHashBigSet(long expected)
Creates a new hash big set with
Hash.DEFAULT_LOAD_FACTOR as load factor. |
FloatOpenHashBigSet(long expected,
float f)
Creates a new hash big set.
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
add(float k)
Ensures that this collection contains the specified element (optional operation).
|
boolean |
addAll(Collection<? extends Float> c) |
boolean |
addAll(FloatCollection c)
Adds all elements of the given type-specific collection to this collection.
|
void |
clear() |
FloatOpenHashBigSet |
clone()
Returns a deep copy of this big set.
|
boolean |
contains(float k)
Returns
true if this collection contains the specified element. |
int |
hashCode()
Returns a hash code for this set.
|
boolean |
isEmpty() |
FloatIterator |
iterator()
Returns a type-specific iterator on the elements of this collection.
|
protected void |
rehash(long newN)
Resizes the set.
|
boolean |
remove(float k)
Removes an element from this set.
|
protected void |
shiftKeys(long pos)
Shifts left entries with the specified hash code, starting at the specified position,
and empties the resulting free entry.
|
int |
size()
Deprecated.
|
long |
size64()
Returns the size of this data structure as a long.
|
boolean |
trim()
Rehashes this set, making the table as small as possible.
|
boolean |
trim(long n)
Rehashes this set if the table is too large.
|
equals, remadd, contains, containsAll, remove, removeAll, retainAll, toArray, toFloatArray, toFloatArray, toStringcontainsAll, removeAll, retainAll, toArray, toArrayfinalize, getClass, notify, notifyAll, wait, wait, waitcontainsAll, removeAll, removeIf, removeIf, retainAll, toArray, toFloatArray, toFloatArrayforEach, forEachcontainsAll, removeAll, retainAll, spliterator, toArray, toArrayparallelStream, streamprotected transient float[][] key
protected transient long mask
protected transient int segmentMask
protected transient int baseMask
protected transient boolean containsNull
protected transient long n
protected transient long maxFill
f.protected final transient long minN
protected final float f
protected long size
public FloatOpenHashBigSet(long expected,
float f)
The actual table size will be the least power of two greater than expected/f.
expected - the expected number of elements in the set.f - the load factor.public FloatOpenHashBigSet(long expected)
Hash.DEFAULT_LOAD_FACTOR as load factor.expected - the expected number of elements in the hash big set.public FloatOpenHashBigSet()
Hash.DEFAULT_INITIAL_SIZE elements
and Hash.DEFAULT_LOAD_FACTOR as load factor.public FloatOpenHashBigSet(Collection<? extends Float> c, float f)
c - a Collection to be copied into the new hash big set.f - the load factor.public FloatOpenHashBigSet(Collection<? extends Float> c)
Hash.DEFAULT_LOAD_FACTOR as load factor
copying a given collection.c - a Collection to be copied into the new hash big set.public FloatOpenHashBigSet(FloatCollection c, float f)
c - a type-specific collection to be copied into the new hash big set.f - the load factor.public FloatOpenHashBigSet(FloatCollection c)
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 big set.public FloatOpenHashBigSet(FloatIterator i, float f)
i - a type-specific iterator whose elements will fill the new hash big set.f - the load factor.public FloatOpenHashBigSet(FloatIterator i)
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 new hash big set.public FloatOpenHashBigSet(Iterator<?> i, float f)
i - an iterator whose elements will fill the new hash big set.f - the load factor.public FloatOpenHashBigSet(Iterator<?> i)
Hash.DEFAULT_LOAD_FACTOR as load factor using elements provided by an iterator.i - an iterator whose elements will fill the new hash big set.public FloatOpenHashBigSet(float[] a,
int offset,
int length,
float f)
a - an array whose elements will be used to fill the new hash big set.offset - the first element to use.length - the number of elements to use.f - the load factor.public FloatOpenHashBigSet(float[] a,
int offset,
int length)
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 new hash big set.offset - the first element to use.length - the number of elements to use.public FloatOpenHashBigSet(float[] a,
float f)
a - an array to be copied into the new hash big set.f - the load factor.public FloatOpenHashBigSet(float[] a)
Hash.DEFAULT_LOAD_FACTOR as load factor
copying the elements of an array.a - an array to be copied into the new hash big set.public boolean addAll(Collection<? extends Float> c)
addAll in interface Collection<Float>addAll in interface Set<Float>addAll in class AbstractCollection<Float>public boolean addAll(FloatCollection c)
FloatCollectionaddAll in interface FloatCollectionaddAll in class AbstractFloatCollectionc - a type-specific collection.true if this collection changed as a result of the call.Collection.addAll(Collection)public boolean add(float k)
AbstractFloatCollectionThis implementation always throws an UnsupportedOperationException.
add in interface FloatCollectionadd in class AbstractFloatCollectionCollection.add(Object)protected final void shiftKeys(long pos)
pos - a starting position.public boolean remove(float k)
AbstractFloatSetNote 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 FloatSetremove in class AbstractFloatSetCollection.remove(Object)public boolean contains(float k)
AbstractFloatCollectiontrue if this collection contains the specified element.
This implementation iterates over the elements in the collection, looking for the specified element.
contains in interface FloatCollectioncontains in class AbstractFloatCollectionCollection.contains(Object)public void clear()
To increase object reuse, this method does not change the table size.
If you want to reduce the table size, you must use trim(long).
clear in interface Collection<Float>clear in interface Set<Float>clear in class AbstractCollection<Float>public FloatIterator iterator()
FloatCollectionNote 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 FloatCollectioniterator in interface FloatIterableiterator in interface FloatSetiterator in interface Iterable<Float>iterator in interface Collection<Float>iterator in interface Set<Float>iterator in class AbstractFloatSetIterable.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(long)public boolean trim(long 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.
size64())
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()protected void rehash(long newN)
This method implements the basic rehashing strategy, and may be overriden by subclasses implementing different rehashing strategies (e.g., disk-based rehashing). However, you should not override this method unless you understand the internal workings of this class.
newN - the new size@Deprecated public int size()
Size64Integer.MAX_VALUE.
This default implementation follows the definition above, which is compatible
with Collection.size().
size in interface Size64size in interface Collection<Float>size in interface Set<Float>size in class AbstractCollection<Float>Integer.MAX_VALUE.Collection.size()public long size64()
Size64public boolean isEmpty()
isEmpty in interface Collection<Float>isEmpty in interface Set<Float>isEmpty in class AbstractCollection<Float>public FloatOpenHashBigSet clone()
This method performs a deep copy of this big hash set; the data stored in the set, however, is not cloned. Note that this makes a difference only for object keys.
public 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 Collection<Float>hashCode in interface Set<Float>hashCode in class AbstractFloatSetCopyright © 2020. All rights reserved.