Class DoubleOpenHashBigSet
- All Implemented Interfaces:
DoubleCollection
,DoubleIterable
,DoubleSet
,Hash
,Size64
,Serializable
,Cloneable
,Iterable<Double>
,Collection<Double>
,Set<Double>
public class DoubleOpenHashBigSet extends AbstractDoubleSet 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.
- See Also:
Hash
,HashCommon
, Serialized Form
-
Nested Class Summary
-
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
Constructors Constructor Description DoubleOpenHashBigSet()
Creates a new hash big set with initial expectedHash.DEFAULT_INITIAL_SIZE
elements andHash.DEFAULT_LOAD_FACTOR
as load factor.DoubleOpenHashBigSet(double[] a)
Creates a new hash big set withHash.DEFAULT_LOAD_FACTOR
as 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_FACTOR
as 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_FACTOR
as load factor.DoubleOpenHashBigSet(long expected, float f)
Creates a new hash big set.DoubleOpenHashBigSet(DoubleCollection c)
Creates a new hash big set withHash.DEFAULT_LOAD_FACTOR
as load factor copying a given type-specific collection.DoubleOpenHashBigSet(DoubleCollection c, float f)
Creates a new hash big set copying a given type-specific collection.DoubleOpenHashBigSet(DoubleIterator i)
Creates a new hash big set withHash.DEFAULT_LOAD_FACTOR
as load factor using elements provided by a type-specific iterator.DoubleOpenHashBigSet(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_FACTOR
as 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_FACTOR
as 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 Type Method Description boolean
add(double k)
Ensures that this collection contains the specified element (optional operation).boolean
addAll(DoubleCollection c)
Adds all elements of the given type-specific collection to this collection.boolean
addAll(Collection<? extends Double> c)
void
clear()
DoubleOpenHashBigSet
clone()
Returns a deep copy of this big set.boolean
contains(double k)
Returnstrue
if this collection contains the specified element.int
hashCode()
Returns a hash code for this set.boolean
isEmpty()
DoubleIterator
iterator()
Returns a type-specific iterator on the elements of this collection.boolean
remove(double 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.Methods inherited from class it.unimi.dsi.fastutil.doubles.AbstractDoubleCollection
add, contains, containsAll, remove, removeAll, retainAll, toArray, toDoubleArray, toDoubleArray, toString
Methods inherited from class java.util.AbstractCollection
containsAll, removeAll, retainAll, toArray, toArray
Methods inherited from interface it.unimi.dsi.fastutil.doubles.DoubleCollection
containsAll, removeAll, removeIf, removeIf, retainAll, toArray, toDoubleArray, toDoubleArray
Methods inherited from interface java.util.Set
containsAll, removeAll, retainAll, spliterator, toArray, toArray
-
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_FACTOR
as 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_SIZE
elements andHash.DEFAULT_LOAD_FACTOR
as load factor. -
DoubleOpenHashBigSet
Creates a new hash big set copying a given collection.- Parameters:
c
- aCollection
to be copied into the new hash big set.f
- the load factor.
-
DoubleOpenHashBigSet
Creates a new hash big set withHash.DEFAULT_LOAD_FACTOR
as load factor copying a given collection.- Parameters:
c
- aCollection
to be copied into the new hash big set.
-
DoubleOpenHashBigSet
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
Creates a new hash big set withHash.DEFAULT_LOAD_FACTOR
as load factor copying a given type-specific collection.- Parameters:
c
- a type-specific collection to be copied into the new hash big set.
-
DoubleOpenHashBigSet
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
Creates a new hash big set withHash.DEFAULT_LOAD_FACTOR
as 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_FACTOR
as 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_FACTOR
as 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_FACTOR
as load factor copying the elements of an array.- Parameters:
a
- an array to be copied into the new hash big set.
-
-
Method Details
-
addAll
- Specified by:
addAll
in interfaceCollection<Double>
- Specified by:
addAll
in interfaceSet<Double>
- Overrides:
addAll
in classAbstractCollection<Double>
-
addAll
Description copied from interface:DoubleCollection
Adds all elements of the given type-specific collection to this collection.- Specified by:
addAll
in interfaceDoubleCollection
- Overrides:
addAll
in classAbstractDoubleCollection
- Parameters:
c
- a type-specific collection.- Returns:
true
if this collection changed as a result of the call.- See Also:
Collection.addAll(Collection)
-
add
public boolean add(double k)Description copied from class:AbstractDoubleCollection
Ensures that this collection contains the specified element (optional operation).This implementation always throws an
UnsupportedOperationException
.- Specified by:
add
in interfaceDoubleCollection
- Overrides:
add
in classAbstractDoubleCollection
- See Also:
Collection.add(Object)
-
remove
public boolean remove(double k)Description copied from class:AbstractDoubleSet
Removes an element from this set.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 theList
interface. Delegates to the type-specificrem()
method implemented by type-specific abstractCollection
superclass.- Specified by:
remove
in interfaceDoubleSet
- Overrides:
remove
in classAbstractDoubleSet
- See Also:
Collection.remove(Object)
-
contains
public boolean contains(double k)Description copied from class:AbstractDoubleCollection
Returnstrue
if this collection contains the specified element.This implementation iterates over the elements in the collection, looking for the specified element.
- Specified by:
contains
in interfaceDoubleCollection
- Overrides:
contains
in classAbstractDoubleCollection
- See Also:
Collection.contains(Object)
-
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:
clear
in interfaceCollection<Double>
- Specified by:
clear
in interfaceSet<Double>
- Overrides:
clear
in classAbstractCollection<Double>
-
iterator
Description copied from interface:DoubleCollection
Returns a type-specific iterator on the elements of this collection.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 extendsCollection
.- Specified by:
iterator
in interfaceCollection<Double>
- Specified by:
iterator
in interfaceDoubleCollection
- Specified by:
iterator
in interfaceDoubleIterable
- Specified by:
iterator
in interfaceDoubleSet
- Specified by:
iterator
in interfaceIterable<Double>
- Specified by:
iterator
in interfaceSet<Double>
- Specified by:
iterator
in classAbstractDoubleSet
- Returns:
- a type-specific iterator on the elements of this collection.
- See Also:
Iterable.iterator()
-
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(long)
-
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:
trim()
-
size
Deprecated.Description copied from interface:Size64
Returns 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:
size
in interfaceCollection<Double>
- Specified by:
size
in interfaceSet<Double>
- Specified by:
size
in interfaceSize64
- Specified by:
size
in classAbstractCollection<Double>
- Returns:
- the size of this data structure, minimized with
Integer.MAX_VALUE
. - See Also:
Collection.size()
-
size64
public long size64()Description copied from interface:Size64
Returns the size of this data structure as a long. -
isEmpty
public boolean isEmpty()- Specified by:
isEmpty
in interfaceCollection<Double>
- Specified by:
isEmpty
in interfaceSet<Double>
- Overrides:
isEmpty
in 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.
- 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:
hashCode
in interfaceCollection<Double>
- Specified by:
hashCode
in interfaceSet<Double>
- Overrides:
hashCode
in classAbstractDoubleSet
- Returns:
- a hash code for this set.
-