Class DoubleOpenHashBigSet
- All Implemented Interfaces:
it.unimi.dsi.fastutil.doubles.DoubleCollection,it.unimi.dsi.fastutil.doubles.DoubleIterable,DoubleSet,it.unimi.dsi.fastutil.Hash,it.unimi.dsi.fastutil.Size64,Serializable,Cloneable,Iterable<Double>,Collection<Double>,Set<Double>
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
it.unimi.dsi.fastutil.Hash.Strategy<K> -
Field Summary
FieldsModifier and TypeFieldDescriptionprotected intThe mask for wrapping a base counter.protected booleanWhether this set contains the null key.protected final floatThe acceptable load factor.protected double[][]The big array of keys.protected longThe mask for wrapping a position counter.protected longThreshold after which we rehash.protected final longWe never resize below this threshold, which is the construction-time {#n}.protected longThe current table size (always a power of 2).protected intThe mask for wrapping a segment counter.protected longNumber of entries in the set.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.DoubleOpenHashBigSet(double[] a) Creates a new hash big set withHash.DEFAULT_LOAD_FACTORas load factor copying the elements of an array.DoubleOpenHashBigSet(double[] a, float f) Creates a new hash big set copying the elements of an array.DoubleOpenHashBigSet(double[] 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.DoubleOpenHashBigSet(double[] a, int offset, int length, float f) Creates a new hash big set and fills it with the elements of a given array.DoubleOpenHashBigSet(long expected) Creates a new hash big set withHash.DEFAULT_LOAD_FACTORas load factor.DoubleOpenHashBigSet(long expected, float f) Creates a new hash big set.DoubleOpenHashBigSet(it.unimi.dsi.fastutil.doubles.DoubleCollection c) Creates a new hash big set withHash.DEFAULT_LOAD_FACTORas load factor copying a given type-specific collection.DoubleOpenHashBigSet(it.unimi.dsi.fastutil.doubles.DoubleCollection c, float f) Creates a new hash big set copying a given type-specific collection.DoubleOpenHashBigSet(it.unimi.dsi.fastutil.doubles.DoubleIterator i) Creates a new hash big set withHash.DEFAULT_LOAD_FACTORas load factor using elements provided by a type-specific iterator.DoubleOpenHashBigSet(it.unimi.dsi.fastutil.doubles.DoubleIterator i, float f) Creates a new hash big set using elements provided by a type-specific iterator.DoubleOpenHashBigSet(Collection<? extends Double> c) Creates a new hash big set withHash.DEFAULT_LOAD_FACTORas load factor copying a given collection.DoubleOpenHashBigSet(Collection<? extends Double> c, float f) Creates a new hash big set copying a given collection.DoubleOpenHashBigSet(Iterator<?> i) Creates a new hash big set withHash.DEFAULT_LOAD_FACTORas load factor using elements provided by an iterator.DoubleOpenHashBigSet(Iterator<?> i, float f) Creates a new hash big set using elements provided by an iterator. -
Method Summary
Modifier and TypeMethodDescriptionbooleanadd(double k) booleanaddAll(it.unimi.dsi.fastutil.doubles.DoubleCollection c) booleanaddAll(Collection<? extends Double> c) voidclear()clone()Returns a deep copy of this big set.booleancontains(double k) voidensureCapacity(long capacity) Ensures that this big set can hold a certain number of elements without rehashing.voidforEach(DoubleConsumer action) inthashCode()Returns a hash code for this set.booleanisEmpty()it.unimi.dsi.fastutil.doubles.DoubleIteratoriterator()Returns a type-specific iterator on the elements of this set.protected voidrehash(long newN) Resizes the set.booleanremove(double k) Removes an element from this set.protected final voidshiftKeys(long pos) Shifts left entries with the specified hash code, starting at the specified position, and empties the resulting free entry.intsize()Deprecated.longsize64()it.unimi.dsi.fastutil.doubles.DoubleSpliteratorReturns a type-specific spliterator on the elements of this set.static DoubleOpenHashBigSettoBigSet(DoubleStream stream) Collects the result of a primitiveStreaminto a new big hash set.static DoubleOpenHashBigSettoBigSetWithExpectedSize(DoubleStream stream, long expectedSize) Collects the result of a primitiveStreaminto a new big hash set.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.doubles.AbstractDoubleSet
equals, remMethods inherited from class it.unimi.dsi.fastutil.doubles.AbstractDoubleCollection
add, contains, containsAll, containsAll, forEach, remove, removeAll, removeAll, removeIf, retainAll, retainAll, toArray, toDoubleArray, toDoubleArray, toStringMethods inherited from class java.util.AbstractCollection
toArray, toArrayMethods inherited from class java.lang.Object
finalize, getClass, notify, notifyAll, wait, wait, waitMethods inherited from interface java.util.Collection
toArrayMethods inherited from interface it.unimi.dsi.fastutil.doubles.DoubleCollection
containsAll, doubleIterator, doubleParallelStream, doubleSpliterator, doubleStream, parallelStream, removeAll, removeIf, removeIf, removeIf, retainAll, stream, toArray, toDoubleArray, toDoubleArrayMethods inherited from interface it.unimi.dsi.fastutil.doubles.DoubleIterable
forEach, forEach
-
Field Details
-
key
protected transient double[][] keyThe big array of keys. -
mask
protected transient long maskThe mask for wrapping a position counter. -
segmentMask
protected transient int segmentMaskThe mask for wrapping a segment counter. -
baseMask
protected transient int baseMaskThe mask for wrapping a base counter. -
containsNull
protected transient boolean containsNullWhether this set contains the null key. -
n
protected transient long nThe current table size (always a power of 2). -
maxFill
protected transient long maxFillThreshold after which we rehash. It must be the table size timesf. -
minN
protected final transient long minNWe never resize below this threshold, which is the construction-time {#n}. -
f
protected final float fThe acceptable load factor. -
size
protected long sizeNumber of entries in the set.
-
-
Constructor Details
-
DoubleOpenHashBigSet
public DoubleOpenHashBigSet(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.
-
DoubleOpenHashBigSet
public DoubleOpenHashBigSet(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.
-
DoubleOpenHashBigSet
public DoubleOpenHashBigSet()Creates a new hash big set with initial expectedHash.DEFAULT_INITIAL_SIZEelements andHash.DEFAULT_LOAD_FACTORas load factor. -
DoubleOpenHashBigSet
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.
-
DoubleOpenHashBigSet
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.
-
DoubleOpenHashBigSet
public DoubleOpenHashBigSet(it.unimi.dsi.fastutil.doubles.DoubleCollection c, float f) 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.
-
DoubleOpenHashBigSet
public DoubleOpenHashBigSet(it.unimi.dsi.fastutil.doubles.DoubleCollection c) 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.
-
DoubleOpenHashBigSet
public DoubleOpenHashBigSet(it.unimi.dsi.fastutil.doubles.DoubleIterator i, float f) 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.
-
DoubleOpenHashBigSet
public DoubleOpenHashBigSet(it.unimi.dsi.fastutil.doubles.DoubleIterator i) 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.
-
DoubleOpenHashBigSet
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.
-
DoubleOpenHashBigSet
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.
-
DoubleOpenHashBigSet
public DoubleOpenHashBigSet(double[] 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.
-
DoubleOpenHashBigSet
public DoubleOpenHashBigSet(double[] 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.
-
DoubleOpenHashBigSet
public DoubleOpenHashBigSet(double[] 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.
-
DoubleOpenHashBigSet
public DoubleOpenHashBigSet(double[] 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
-
toBigSet
Collects the result of a primitiveStreaminto a new big hash set.This method performs a terminal operation on the given
Stream -
toBigSetWithExpectedSize
Collects the result of a primitiveStreaminto a new big hash set.This method performs a terminal operation on the given
Stream -
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
-
addAll
public boolean addAll(it.unimi.dsi.fastutil.doubles.DoubleCollection c) - Specified by:
addAllin interfaceit.unimi.dsi.fastutil.doubles.DoubleCollection- Overrides:
addAllin classit.unimi.dsi.fastutil.doubles.AbstractDoubleCollection
-
add
public boolean add(double k) - Specified by:
addin interfaceit.unimi.dsi.fastutil.doubles.DoubleCollection- Overrides:
addin classit.unimi.dsi.fastutil.doubles.AbstractDoubleCollection
-
shiftKeys
protected final void shiftKeys(long pos) Shifts left entries with the specified hash code, starting at the specified position, and empties the resulting free entry.- Parameters:
pos- a starting position.
-
remove
public boolean remove(double k) Description copied from class:AbstractDoubleSetRemoves an element from this set. Delegates to the type-specificrem()method implemented by type-specific abstractCollectionsuperclass.- Specified by:
removein interfaceDoubleSet- Overrides:
removein classAbstractDoubleSet- See Also:
-
contains
public boolean contains(double k) - Specified by:
containsin interfaceit.unimi.dsi.fastutil.doubles.DoubleCollection- Overrides:
containsin classit.unimi.dsi.fastutil.doubles.AbstractDoubleCollection
-
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<Double>- Specified by:
clearin interfaceSet<Double>- Overrides:
clearin classAbstractCollection<Double>
-
iterator
public it.unimi.dsi.fastutil.doubles.DoubleIterator iterator()Description copied from interface:DoubleSetReturns a type-specific iterator on the elements of this set.- Specified by:
iteratorin interfaceCollection<Double>- Specified by:
iteratorin interfaceit.unimi.dsi.fastutil.doubles.DoubleCollection- Specified by:
iteratorin interfaceit.unimi.dsi.fastutil.doubles.DoubleIterable- Specified by:
iteratorin interfaceDoubleSet- Specified by:
iteratorin interfaceIterable<Double>- Specified by:
iteratorin interfaceSet<Double>- Specified by:
iteratorin classAbstractDoubleSet- Returns:
- a type-specific iterator on the elements of this set.
-
spliterator
public it.unimi.dsi.fastutil.doubles.DoubleSpliterator spliterator()Description copied from interface:DoubleSetReturns a type-specific spliterator on the elements of this set.Set spliterators must report at least
Spliterator.DISTINCT.See
Set.spliterator()for more documentation on the requirements of the returned spliterator.- Specified by:
spliteratorin interfaceCollection<Double>- Specified by:
spliteratorin interfaceit.unimi.dsi.fastutil.doubles.DoubleCollection- Specified by:
spliteratorin interfaceit.unimi.dsi.fastutil.doubles.DoubleIterable- Specified by:
spliteratorin interfaceDoubleSet- Specified by:
spliteratorin interfaceIterable<Double>- Specified by:
spliteratorin interfaceSet<Double>- Returns:
-
forEach
- Specified by:
forEachin interfaceit.unimi.dsi.fastutil.doubles.DoubleIterable
-
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:
-
rehash
protected void rehash(long newN) Resizes the set.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.
- Parameters:
newN- the new size
-
size
Deprecated.- Specified by:
sizein interfaceCollection<Double>- Specified by:
sizein interfaceSet<Double>- Specified by:
sizein interfaceit.unimi.dsi.fastutil.Size64- Specified by:
sizein classAbstractCollection<Double>
-
size64
public long size64()- Specified by:
size64in interfaceit.unimi.dsi.fastutil.Size64
-
isEmpty
public boolean isEmpty()- Specified by:
isEmptyin interfaceCollection<Double>- Specified by:
isEmptyin interfaceSet<Double>- Overrides:
isEmptyin classAbstractCollection<Double>
-
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.
-
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<Double>- Specified by:
hashCodein interfaceSet<Double>- Overrides:
hashCodein classAbstractDoubleSet- Returns:
- a hash code for this set.
-