Class FloatOpenHashBigSet
- All Implemented Interfaces:
FloatCollection,FloatIterable,FloatSet,Hash,Size64,Serializable,Cloneable,Iterable<Float>,Collection<Float>,Set<Float>
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.
- See Also:
-
Nested Class Summary
Nested classes/interfaces inherited from interface it.unimi.dsi.fastutil.Hash
Hash.Strategy<K> -
Field Summary
Fields inherited from interface it.unimi.dsi.fastutil.Hash
DEFAULT_GROWTH_FACTOR, DEFAULT_INITIAL_SIZE, DEFAULT_LOAD_FACTOR, FAST_LOAD_FACTOR, FREE, OCCUPIED, PRIMES, REMOVED, VERY_FAST_LOAD_FACTOR -
Constructor Summary
ConstructorsConstructorDescriptionCreates a new hash big set with initial expectedHash.DEFAULT_INITIAL_SIZEelements andHash.DEFAULT_LOAD_FACTORas load factor.FloatOpenHashBigSet(float[] a) Creates a new hash big set withHash.DEFAULT_LOAD_FACTORas 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 withHash.DEFAULT_LOAD_FACTORas 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(long expected) Creates a new hash big set withHash.DEFAULT_LOAD_FACTORas load factor.FloatOpenHashBigSet(long expected, float f) Creates a new hash big set.Creates a new hash big set withHash.DEFAULT_LOAD_FACTORas 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.Creates a new hash big set withHash.DEFAULT_LOAD_FACTORas 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(Collection<? extends Float> c) Creates a new hash big set withHash.DEFAULT_LOAD_FACTORas load factor copying a given collection.FloatOpenHashBigSet(Collection<? extends Float> c, float f) Creates a new hash big set copying a given collection.FloatOpenHashBigSet(Iterator<?> i) Creates a new hash big set withHash.DEFAULT_LOAD_FACTORas 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. -
Method Summary
Modifier and TypeMethodDescriptionbooleanadd(float k) Ensures that this collection contains the specified element (optional operation).booleanAdds all elements of the given type-specific collection to this collection.booleanaddAll(Collection<? extends Float> c) voidclear()clone()Returns a deep copy of this big set.booleancontains(float k) Returnstrueif this collection contains the specified element.voidensureCapacity(long capacity) Ensures that this big set can hold a certain number of elements without rehashing.voidforEach(FloatConsumer action) Performs the given action for each element of this type-specificIterableuntil all elements have been processed or the action throws an exception.inthashCode()Returns a hash code for this set.booleanisEmpty()iterator()Returns a type-specific iterator on the elements of this collection.booleanremove(float k) Removes an element from this set.intsize()Deprecated.longsize64()Returns the size of this data structure as a long.Returns a type-specific spliterator on the elements of this collection.booleantrim()Rehashes this set, making the table as small as possible.booleantrim(long n) Rehashes this set if the table is too large.Methods inherited from class it.unimi.dsi.fastutil.floats.AbstractFloatSet
equals, remMethods inherited from class it.unimi.dsi.fastutil.floats.AbstractFloatCollection
add, contains, containsAll, containsAll, remove, removeAll, removeAll, retainAll, retainAll, toArray, toFloatArray, toFloatArray, toStringMethods inherited from class java.util.AbstractCollection
toArray, toArrayMethods inherited from interface java.util.Collection
toArrayMethods inherited from interface it.unimi.dsi.fastutil.floats.FloatCollection
containsAll, doubleIterator, doubleParallelStream, doubleSpliterator, doubleStream, parallelStream, removeAll, removeIf, removeIf, removeIf, retainAll, stream, toArray, toFloatArray, toFloatArrayMethods inherited from interface it.unimi.dsi.fastutil.floats.FloatIterable
forEach, forEach
-
Constructor Details
-
FloatOpenHashBigSet
public FloatOpenHashBigSet(long expected, float f) Creates a new hash big set.The actual table size will be the least power of two greater than
expected/f.- Parameters:
expected- the expected number of elements in the set.f- the load factor.
-
FloatOpenHashBigSet
public FloatOpenHashBigSet(long expected) Creates a new hash big set withHash.DEFAULT_LOAD_FACTORas load factor.- Parameters:
expected- the expected number of elements in the hash big set.
-
FloatOpenHashBigSet
public FloatOpenHashBigSet()Creates a new hash big set with initial expectedHash.DEFAULT_INITIAL_SIZEelements andHash.DEFAULT_LOAD_FACTORas load factor. -
FloatOpenHashBigSet
Creates a new hash big set copying a given collection.- Parameters:
c- aCollectionto be copied into the new hash big set.f- the load factor.
-
FloatOpenHashBigSet
Creates a new hash big set withHash.DEFAULT_LOAD_FACTORas load factor copying a given collection.- Parameters:
c- aCollectionto be copied into the new hash big set.
-
FloatOpenHashBigSet
Creates a new hash big set copying a given type-specific collection.- Parameters:
c- a type-specific collection to be copied into the new hash big set.f- the load factor.
-
FloatOpenHashBigSet
Creates a new hash big set withHash.DEFAULT_LOAD_FACTORas load factor copying a given type-specific collection.- Parameters:
c- a type-specific collection to be copied into the new hash big set.
-
FloatOpenHashBigSet
Creates a new hash big set using elements provided by a type-specific iterator.- Parameters:
i- a type-specific iterator whose elements will fill the new hash big set.f- the load factor.
-
FloatOpenHashBigSet
Creates a new hash big set withHash.DEFAULT_LOAD_FACTORas load factor using elements provided by a type-specific iterator.- Parameters:
i- a type-specific iterator whose elements will fill the new hash big set.
-
FloatOpenHashBigSet
Creates a new hash big set using elements provided by an iterator.- Parameters:
i- an iterator whose elements will fill the new hash big set.f- the load factor.
-
FloatOpenHashBigSet
Creates a new hash big set withHash.DEFAULT_LOAD_FACTORas load factor using elements provided by an iterator.- Parameters:
i- an iterator whose elements will fill the new hash big set.
-
FloatOpenHashBigSet
public 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.- Parameters:
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.
-
FloatOpenHashBigSet
public FloatOpenHashBigSet(float[] a, int offset, int length) Creates a new hash big set withHash.DEFAULT_LOAD_FACTORas load factor and fills it with the elements of a given array.- Parameters:
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.
-
FloatOpenHashBigSet
public FloatOpenHashBigSet(float[] a, float f) Creates a new hash big set copying the elements of an array.- Parameters:
a- an array to be copied into the new hash big set.f- the load factor.
-
FloatOpenHashBigSet
public FloatOpenHashBigSet(float[] a) Creates a new hash big set withHash.DEFAULT_LOAD_FACTORas load factor copying the elements of an array.- Parameters:
a- an array to be copied into the new hash big set.
-
-
Method Details
-
ensureCapacity
public void ensureCapacity(long capacity) Ensures that this big set can hold a certain number of elements without rehashing.- Parameters:
capacity- a number of elements; there will be no rehashing unless the set size exceeds this number.
-
addAll
Description copied from class:AbstractFloatCollection- Specified by:
addAllin interfaceCollection<Float>- Specified by:
addAllin interfaceSet<Float>- Overrides:
addAllin classAbstractFloatCollection
-
addAll
Description copied from interface:FloatCollectionAdds all elements of the given type-specific collection to this collection.- Specified by:
addAllin interfaceFloatCollection- Overrides:
addAllin classAbstractFloatCollection- Parameters:
c- a type-specific collection.- Returns:
trueif this collection changed as a result of the call.- See Also:
-
add
public boolean add(float k) Description copied from class:AbstractFloatCollectionEnsures that this collection contains the specified element (optional operation).- Specified by:
addin interfaceFloatCollection- Overrides:
addin classAbstractFloatCollection- See Also:
-
remove
public boolean remove(float k) Description copied from class:AbstractFloatSetRemoves an element from this set. Delegates to the type-specificrem()method implemented by type-specific abstractCollectionsuperclass.- Specified by:
removein interfaceFloatSet- Overrides:
removein classAbstractFloatSet- See Also:
-
contains
public boolean contains(float k) Description copied from class:AbstractFloatCollectionReturnstrueif this collection contains the specified element.- Specified by:
containsin interfaceFloatCollection- Overrides:
containsin classAbstractFloatCollection- See Also:
-
clear
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).- Specified by:
clearin interfaceCollection<Float>- Specified by:
clearin interfaceSet<Float>- Overrides:
clearin classAbstractCollection<Float>
-
iterator
Description copied from interface:FloatCollectionReturns a type-specific iterator on the elements of this collection.- Specified by:
iteratorin interfaceCollection<Float>- Specified by:
iteratorin interfaceFloatCollection- Specified by:
iteratorin interfaceFloatIterable- Specified by:
iteratorin interfaceFloatSet- Specified by:
iteratorin interfaceIterable<Float>- Specified by:
iteratorin interfaceSet<Float>- Specified by:
iteratorin classAbstractFloatSet- Returns:
- a type-specific iterator on the elements of this collection.
- See Also:
-
spliterator
Description copied from interface:FloatCollectionReturns a type-specific spliterator on the elements of this collection.See
Collection.spliterator()for more documentation on the requirements of the returned spliterator.- Specified by:
spliteratorin interfaceCollection<Float>- Specified by:
spliteratorin interfaceFloatCollection- Specified by:
spliteratorin interfaceFloatIterable- Specified by:
spliteratorin interfaceFloatSet- Specified by:
spliteratorin interfaceIterable<Float>- Specified by:
spliteratorin interfaceSet<Float>- Returns:
- a type-specific spliterator on the elements of this collection.
-
forEach
Description copied from interface:FloatIterablePerforms the given action for each element of this type-specificIterableuntil all elements have been processed or the action throws an exception.- Specified by:
forEachin interfaceFloatIterable- Parameters:
action- the action to be performed for each element.- See Also:
-
trim
public boolean trim()Rehashes this set, making the table as small as possible.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.
- Returns:
- true if there was enough memory to trim the set.
- See Also:
-
trim
public boolean trim(long n) Rehashes this set if the table is too large.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.
- Parameters:
n- the threshold for the trimming.- Returns:
- true if there was enough memory to trim the set.
- See Also:
-
size
Deprecated.Description copied from interface:Size64Returns the size of this data structure, minimized withInteger.MAX_VALUE.This default implementation follows the definition above, which is compatible with
Collection.size().- Specified by:
sizein interfaceCollection<Float>- Specified by:
sizein interfaceSet<Float>- Specified by:
sizein interfaceSize64- Specified by:
sizein classAbstractCollection<Float>- Returns:
- the size of this data structure, minimized with
Integer.MAX_VALUE. - See Also:
-
size64
-
isEmpty
public boolean isEmpty()- Specified by:
isEmptyin interfaceCollection<Float>- Specified by:
isEmptyin interfaceSet<Float>- Overrides:
isEmptyin classAbstractCollection<Float>
-
clone
Returns a deep copy of this big set.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.
- Returns:
- a deep copy of this big set.
-
hashCode
public int hashCode()Returns a hash code for this set. This method overrides the generic method provided by the superclass. Sinceequals()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.- Specified by:
hashCodein interfaceCollection<Float>- Specified by:
hashCodein interfaceSet<Float>- Overrides:
hashCodein classAbstractFloatSet- Returns:
- a hash code for this set.
-