Class LongOpenHashBigSet
- All Implemented Interfaces:
Hash
,LongCollection
,LongIterable
,LongSet
,Size64
,Serializable
,Cloneable
,Iterable<Long>
,Collection<Long>
,Set<Long>
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
ConstructorDescriptionCreates a new hash big set with initial expectedHash.DEFAULT_INITIAL_SIZE
elements andHash.DEFAULT_LOAD_FACTOR
as load factor.LongOpenHashBigSet
(long expected) Creates a new hash big set withHash.DEFAULT_LOAD_FACTOR
as load factor.LongOpenHashBigSet
(long[] a) Creates a new hash big set withHash.DEFAULT_LOAD_FACTOR
as load factor copying the elements of an array.LongOpenHashBigSet
(long[] a, float f) Creates a new hash big set copying the elements of an array.LongOpenHashBigSet
(long[] 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.LongOpenHashBigSet
(long[] a, int offset, int length, float f) Creates a new hash big set and fills it with the elements of a given array.LongOpenHashBigSet
(long expected, float f) Creates a new hash big set.Creates a new hash big set withHash.DEFAULT_LOAD_FACTOR
as load factor copying a given type-specific collection.LongOpenHashBigSet
(LongCollection c, float f) Creates a new hash big set copying a given type-specific collection.Creates a new hash big set withHash.DEFAULT_LOAD_FACTOR
as load factor using elements provided by a type-specific iterator.LongOpenHashBigSet
(LongIterator i, float f) Creates a new hash big set using elements provided by a type-specific iterator.LongOpenHashBigSet
(Collection<? extends Long> c) Creates a new hash big set withHash.DEFAULT_LOAD_FACTOR
as load factor copying a given collection.LongOpenHashBigSet
(Collection<? extends Long> c, float f) Creates a new hash big set copying a given collection.LongOpenHashBigSet
(Iterator<?> i) Creates a new hash big set withHash.DEFAULT_LOAD_FACTOR
as load factor using elements provided by an iterator.LongOpenHashBigSet
(Iterator<?> i, float f) Creates a new hash big set using elements provided by an iterator. -
Method Summary
Modifier and TypeMethodDescriptionboolean
add
(long k) Ensures that this collection contains the specified element (optional operation).boolean
Adds all elements of the given type-specific collection to this collection.boolean
addAll
(Collection<? extends Long> c) void
clear()
clone()
Returns a deep copy of this big set.boolean
contains
(long k) Returnstrue
if this collection contains the specified element.void
ensureCapacity
(long capacity) Ensures that this big set can hold a certain number of elements without rehashing.void
forEach
(LongConsumer action) Performs the given action for each element of this type-specificIterable
until all elements have been processed or the action throws an exception.int
hashCode()
Returns a hash code for this set.boolean
isEmpty()
iterator()
Returns a type-specific iterator on the elements of this collection.boolean
remove
(long k) Removes an element from this set.int
size()
Deprecated.long
size64()
Returns the size of this data structure as a long.Returns a type-specific spliterator on the elements of this set.static LongOpenHashBigSet
toBigSet
(LongStream stream) Collects the result of a primitiveStream
into a new big hash set.static LongOpenHashBigSet
toBigSetWithExpectedSize
(LongStream stream, long expectedSize) Collects the result of a primitiveStream
into a new big hash set.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.longs.AbstractLongSet
equals, rem
Methods inherited from class it.unimi.dsi.fastutil.longs.AbstractLongCollection
add, contains, containsAll, containsAll, forEach, remove, removeAll, removeAll, removeIf, retainAll, retainAll, toArray, toLongArray, toLongArray, toString
Methods inherited from class java.util.AbstractCollection
toArray, toArray
Methods inherited from interface java.util.Collection
toArray
Methods inherited from interface it.unimi.dsi.fastutil.longs.LongCollection
containsAll, longIterator, longParallelStream, longSpliterator, longStream, parallelStream, removeAll, removeIf, removeIf, removeIf, retainAll, stream, toArray, toLongArray, toLongArray
Methods inherited from interface it.unimi.dsi.fastutil.longs.LongIterable
forEach, forEach
-
Constructor Details
-
LongOpenHashBigSet
public LongOpenHashBigSet(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.
-
LongOpenHashBigSet
public LongOpenHashBigSet(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.
-
LongOpenHashBigSet
public LongOpenHashBigSet()Creates a new hash big set with initial expectedHash.DEFAULT_INITIAL_SIZE
elements andHash.DEFAULT_LOAD_FACTOR
as load factor. -
LongOpenHashBigSet
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.
-
LongOpenHashBigSet
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.
-
LongOpenHashBigSet
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.
-
LongOpenHashBigSet
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.
-
LongOpenHashBigSet
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.
-
LongOpenHashBigSet
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.
-
LongOpenHashBigSet
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.
-
LongOpenHashBigSet
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.
-
LongOpenHashBigSet
public LongOpenHashBigSet(long[] 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.
-
LongOpenHashBigSet
public LongOpenHashBigSet(long[] 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.
-
LongOpenHashBigSet
public LongOpenHashBigSet(long[] 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.
-
LongOpenHashBigSet
public LongOpenHashBigSet(long[] 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
-
toBigSet
Collects the result of a primitiveStream
into a new big hash set.This method performs a terminal operation on the given
Stream
- API Notes:
- Taking a primitive stream instead of returning something like a
Collector
is necessary because there is no primitiveCollector
equivalent in the Java API.
-
toBigSetWithExpectedSize
Collects the result of a primitiveStream
into a new big hash set.This method performs a terminal operation on the given
Stream
- API Notes:
- Taking a primitive stream instead returning something like a
Collector
is necessary because there is no primitiveCollector
equivalent in the Java API.
-
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:AbstractLongCollection
- Specified by:
addAll
in interfaceCollection<Long>
- Specified by:
addAll
in interfaceSet<Long>
- Overrides:
addAll
in classAbstractLongCollection
-
addAll
Description copied from interface:LongCollection
Adds all elements of the given type-specific collection to this collection.- Specified by:
addAll
in interfaceLongCollection
- Overrides:
addAll
in classAbstractLongCollection
- Parameters:
c
- a type-specific collection.- Returns:
true
if this collection changed as a result of the call.- See Also:
-
add
public boolean add(long k) Description copied from class:AbstractLongCollection
Ensures that this collection contains the specified element (optional operation).- Specified by:
add
in interfaceLongCollection
- Overrides:
add
in classAbstractLongCollection
- See Also:
-
remove
public boolean remove(long k) Description copied from class:AbstractLongSet
Removes an element from this set. Delegates to the type-specificrem()
method implemented by type-specific abstractCollection
superclass.- Specified by:
remove
in interfaceLongSet
- Overrides:
remove
in classAbstractLongSet
- See Also:
-
contains
public boolean contains(long k) Description copied from class:AbstractLongCollection
Returnstrue
if this collection contains the specified element.- Specified by:
contains
in interfaceLongCollection
- Overrides:
contains
in classAbstractLongCollection
- 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:
clear
in interfaceCollection<Long>
- Specified by:
clear
in interfaceSet<Long>
- Overrides:
clear
in classAbstractCollection<Long>
-
iterator
Description copied from interface:LongCollection
Returns a type-specific iterator on the elements of this collection.- Specified by:
iterator
in interfaceCollection<Long>
- Specified by:
iterator
in interfaceIterable<Long>
- Specified by:
iterator
in interfaceLongCollection
- Specified by:
iterator
in interfaceLongIterable
- Specified by:
iterator
in interfaceLongSet
- Specified by:
iterator
in interfaceSet<Long>
- Specified by:
iterator
in classAbstractLongSet
- Returns:
- a type-specific iterator on the elements of this collection.
- See Also:
-
spliterator
Description copied from interface:LongSet
Returns 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:
spliterator
in interfaceCollection<Long>
- Specified by:
spliterator
in interfaceIterable<Long>
- Specified by:
spliterator
in interfaceLongCollection
- Specified by:
spliterator
in interfaceLongIterable
- Specified by:
spliterator
in interfaceLongSet
- Specified by:
spliterator
in interfaceSet<Long>
- Returns:
- a type-specific spliterator on the elements of this collection.
-
forEach
Description copied from interface:LongIterable
Performs the given action for each element of this type-specificIterable
until all elements have been processed or the action throws an exception.- Specified by:
forEach
in interfaceLongIterable
- 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: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<Long>
- Specified by:
size
in interfaceSet<Long>
- Specified by:
size
in interfaceSize64
- Specified by:
size
in classAbstractCollection<Long>
- Returns:
- the size of this data structure, minimized with
Integer.MAX_VALUE
. - See Also:
-
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<Long>
- Specified by:
isEmpty
in interfaceSet<Long>
- Overrides:
isEmpty
in classAbstractCollection<Long>
-
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<Long>
- Specified by:
hashCode
in interfaceSet<Long>
- Overrides:
hashCode
in classAbstractLongSet
- Returns:
- a hash code for this set.
-