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 is
backed by a big array and is
enlarged as needed by doubling its size when new entries are created, but it is never made
smaller (even on a clear()). A family of trimming
method 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>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) |
void |
clear() |
FloatOpenHashBigSet |
clone()
Returns a deep copy of this big set.
|
boolean |
contains(float k) |
int |
hashCode()
Returns a hash code for this set.
|
boolean |
isEmpty() |
FloatIterator |
iterator()
Returns a type-specific iterator on the elements of this collection.
|
boolean |
rehash()
Deprecated.
A no-op.
|
boolean |
remove(float k)
Removes an element from this set.
|
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, rem, removeadd, addAll, addAll, contains, containsAll, containsAll, floatIterator, rem, removeAll, removeAll, retainAll, retainAll, toArray, toArray, toArray, toFloatArray, toFloatArray, toStringaddAll, containsAll, floatIterator, removeAll, retainAll, toArray, toArray, toFloatArray, toFloatArraypublic 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 add(float k)
add in interface FloatCollectionadd in class AbstractFloatCollectionCollection.add(Object)public boolean remove(float k)
FloatSetNote that the corresponding method of the type-specific collection is rem().
This unfortunate situation is caused by the clash
with the similarly named index-based method in the List interface.
remove in interface FloatSetremove in class AbstractFloatSetCollection.remove(Object)public boolean contains(float k)
contains in interface FloatCollectioncontains in class AbstractFloatCollectionCollection.contains(Object)public void clear()
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 AbstractFloatSet@Deprecated public boolean rehash()
If you need to reduce the table size to fit exactly
this set, use trim().
trim()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()@Deprecated public int size()
Size64Integer.MAX_VALUE.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 AbstractFloatCollectionpublic 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 AbstractFloatSet