public class IntOpenHashSet extends AbstractIntSet implements java.io.Serializable, java.lang.Cloneable, Hash
Instances of this class use a hash table to represent a set. The table 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.
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 |
---|
IntOpenHashSet()
Creates a new hash set with initial expected
Hash.DEFAULT_INITIAL_SIZE elements
and Hash.DEFAULT_LOAD_FACTOR as load factor. |
IntOpenHashSet(java.util.Collection<? extends java.lang.Integer> c)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor
copying a given collection. |
IntOpenHashSet(java.util.Collection<? extends java.lang.Integer> c,
float f)
Creates a new hash set copying a given collection.
|
IntOpenHashSet(int expected)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor. |
IntOpenHashSet(int[] a)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor
copying the elements of an array. |
IntOpenHashSet(int[] a,
float f)
Creates a new hash set copying the elements of an array.
|
IntOpenHashSet(int[] a,
int offset,
int length)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor and fills it with the elements of a given array. |
IntOpenHashSet(int[] a,
int offset,
int length,
float f)
Creates a new hash set and fills it with the elements of a given array.
|
IntOpenHashSet(IntCollection c)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor
copying a given type-specific collection. |
IntOpenHashSet(IntCollection c,
float f)
Creates a new hash set copying a given type-specific collection.
|
IntOpenHashSet(int expected,
float f)
Creates a new hash set.
|
IntOpenHashSet(IntIterator i)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor using elements provided by a type-specific iterator. |
IntOpenHashSet(IntIterator i,
float f)
Creates a new hash set using elements provided by a type-specific iterator.
|
IntOpenHashSet(java.util.Iterator<?> i)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor using elements provided by an iterator. |
IntOpenHashSet(java.util.Iterator<?> i,
float f)
Creates a new hash set using elements provided by an iterator.
|
Modifier and Type | Method and Description |
---|---|
boolean |
add(int k)
Ensures that this collection contains the specified element (optional operation).
|
boolean |
addAll(java.util.Collection<? extends java.lang.Integer> c) |
boolean |
addAll(IntCollection c)
Adds all elements of the given type-specific collection to this collection.
|
void |
clear() |
IntOpenHashSet |
clone()
Returns a deep copy of this set.
|
boolean |
contains(int k)
Returns
true if this collection contains the specified element. |
void |
forEach(java.util.function.IntConsumer action)
Performs the given action for each element of this type-specific
Iterable
until all elements have been processed or the action throws an
exception. |
int |
hashCode()
Returns a hash code for this set.
|
boolean |
isEmpty() |
IntIterator |
iterator()
Returns a type-specific iterator on the elements of this collection.
|
static IntOpenHashSet |
of()
Creates a new empty hash set.
|
static IntOpenHashSet |
of(int... a)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor
using a list of elements. |
static IntOpenHashSet |
of(int e)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor
using the given element. |
static IntOpenHashSet |
of(int e0,
int e1)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor
using the elements given. |
static IntOpenHashSet |
of(int e0,
int e1,
int e2)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor
using the elements given. |
boolean |
remove(int k)
Removes an element from this set.
|
int |
size() |
IntSpliterator |
spliterator()
Returns a type-specific spliterator on the elements of this set.
|
static IntOpenHashSet |
toSet(java.util.stream.IntStream stream)
Collects the result of a primitive
Stream into a new hash set. |
static IntOpenHashSet |
toSetWithExpectedSize(java.util.stream.IntStream stream,
int expectedSize)
Collects the result of a primitive
Stream into a new hash set, potentially pre-allocated to handle the given size. |
boolean |
trim()
Rehashes this set, making the table as small as possible.
|
boolean |
trim(int n)
Rehashes this set if the table is too large.
|
equals, rem
add, contains, containsAll, containsAll, forEach, remove, removeAll, removeAll, removeIf, retainAll, retainAll, toArray, toIntArray, toIntArray, toString
containsAll, intIterator, intParallelStream, intSpliterator, intStream, parallelStream, removeAll, removeIf, removeIf, removeIf, retainAll, stream, toArray, toIntArray, toIntArray
forEach, forEach
public IntOpenHashSet(int 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 hash set.f
- the load factor.public IntOpenHashSet(int expected)
Hash.DEFAULT_LOAD_FACTOR
as load factor.expected
- the expected number of elements in the hash set.public IntOpenHashSet()
Hash.DEFAULT_INITIAL_SIZE
elements
and Hash.DEFAULT_LOAD_FACTOR
as load factor.public IntOpenHashSet(java.util.Collection<? extends java.lang.Integer> c, float f)
c
- a Collection
to be copied into the new hash set.f
- the load factor.public IntOpenHashSet(java.util.Collection<? extends java.lang.Integer> c)
Hash.DEFAULT_LOAD_FACTOR
as load factor
copying a given collection.c
- a Collection
to be copied into the new hash set.public IntOpenHashSet(IntCollection c, float f)
c
- a type-specific collection to be copied into the new hash set.f
- the load factor.public IntOpenHashSet(IntCollection 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 set.public IntOpenHashSet(IntIterator i, float f)
i
- a type-specific iterator whose elements will fill the set.f
- the load factor.public IntOpenHashSet(IntIterator 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 set.public IntOpenHashSet(java.util.Iterator<?> i, float f)
i
- an iterator whose elements will fill the set.f
- the load factor.public IntOpenHashSet(java.util.Iterator<?> i)
Hash.DEFAULT_LOAD_FACTOR
as load factor using elements provided by an iterator.i
- an iterator whose elements will fill the set.public IntOpenHashSet(int[] a, int offset, int length, float f)
a
- an array whose elements will be used to fill the set.offset
- the first element to use.length
- the number of elements to use.f
- the load factor.public IntOpenHashSet(int[] 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 set.offset
- the first element to use.length
- the number of elements to use.public IntOpenHashSet(int[] a, float f)
a
- an array to be copied into the new hash set.f
- the load factor.public IntOpenHashSet(int[] a)
Hash.DEFAULT_LOAD_FACTOR
as load factor
copying the elements of an array.a
- an array to be copied into the new hash set.public static IntOpenHashSet of()
public static IntOpenHashSet of(int e)
Hash.DEFAULT_LOAD_FACTOR
as load factor
using the given element.of
in interface IntSet
e
- the element that the returned set will contain.Hash.DEFAULT_LOAD_FACTOR
as load factor containing e
.public static IntOpenHashSet of(int e0, int e1)
Hash.DEFAULT_LOAD_FACTOR
as load factor
using the elements given.of
in interface IntSet
e0
- the first element.e1
- the second element.Hash.DEFAULT_LOAD_FACTOR
as load factor containing e0
and e1
.java.lang.IllegalArgumentException
- if there were duplicate entries.public static IntOpenHashSet of(int e0, int e1, int e2)
Hash.DEFAULT_LOAD_FACTOR
as load factor
using the elements given.of
in interface IntSet
e0
- the first element.e1
- the second element.e2
- the third element.Hash.DEFAULT_LOAD_FACTOR
as load factor containing e0
, e1
, and e2
.java.lang.IllegalArgumentException
- if there were duplicate entries.public static IntOpenHashSet of(int... a)
Hash.DEFAULT_LOAD_FACTOR
as load factor
using a list of elements.of
in interface IntSet
a
- a list of elements that will be used to initialize the new hash set.Hash.DEFAULT_LOAD_FACTOR
as load factor containing the elements of a
.java.lang.IllegalArgumentException
- if a duplicate entry was encountered.public static IntOpenHashSet toSet(java.util.stream.IntStream stream)
Stream
into a new hash set.
This method performs a terminal operation on the given Stream
Collector
is necessary because there is no
primitive Collector
equivalent in the Java API.public static IntOpenHashSet toSetWithExpectedSize(java.util.stream.IntStream stream, int expectedSize)
Stream
into a new hash set, potentially pre-allocated to handle the given size.
This method performs a terminal operation on the given Stream
Collector
is necessary because there is no
primitive Collector
equivalent in the Java API.public boolean addAll(IntCollection c)
IntCollection
addAll
in interface IntCollection
addAll
in class AbstractIntCollection
c
- a type-specific collection.true
if this collection changed as a result of the call.Collection.addAll(Collection)
public boolean addAll(java.util.Collection<? extends java.lang.Integer> c)
AbstractIntCollection
addAll
in interface java.util.Collection<java.lang.Integer>
addAll
in interface java.util.Set<java.lang.Integer>
addAll
in class AbstractIntCollection
public boolean add(int k)
AbstractIntCollection
add
in interface IntCollection
add
in class AbstractIntCollection
Collection.add(Object)
public boolean remove(int k)
AbstractIntSet
rem()
method
implemented by type-specific abstract Collection
superclass.remove
in interface IntSet
remove
in class AbstractIntSet
Collection.remove(Object)
public boolean contains(int k)
AbstractIntCollection
true
if this collection contains the specified element.contains
in interface IntCollection
contains
in class AbstractIntCollection
Collection.contains(Object)
public void clear()
clear
in interface java.util.Collection<java.lang.Integer>
clear
in interface java.util.Set<java.lang.Integer>
clear
in class java.util.AbstractCollection<java.lang.Integer>
public int size()
size
in interface java.util.Collection<java.lang.Integer>
size
in interface java.util.Set<java.lang.Integer>
size
in class java.util.AbstractCollection<java.lang.Integer>
public boolean isEmpty()
isEmpty
in interface java.util.Collection<java.lang.Integer>
isEmpty
in interface java.util.Set<java.lang.Integer>
isEmpty
in class java.util.AbstractCollection<java.lang.Integer>
public IntIterator iterator()
IntCollection
iterator
in interface IntCollection
iterator
in interface IntIterable
iterator
in interface IntSet
iterator
in interface java.lang.Iterable<java.lang.Integer>
iterator
in interface java.util.Collection<java.lang.Integer>
iterator
in interface java.util.Set<java.lang.Integer>
iterator
in class AbstractIntSet
Iterable.iterator()
public IntSpliterator spliterator()
IntSet
Set spliterators must report at least Spliterator.DISTINCT
.
See Set.spliterator()
for more documentation on the requirements
of the returned spliterator.
spliterator
in interface IntCollection
spliterator
in interface IntIterable
spliterator
in interface IntSet
spliterator
in interface java.lang.Iterable<java.lang.Integer>
spliterator
in interface java.util.Collection<java.lang.Integer>
spliterator
in interface java.util.Set<java.lang.Integer>
public void forEach(java.util.function.IntConsumer action)
IntIterable
Iterable
until all elements have been processed or the action throws an
exception.forEach
in interface IntIterable
action
- the action to be performed for each element.Iterable.forEach(java.util.function.Consumer)
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(int)
public boolean trim(int 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.
size()
)
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()
public IntOpenHashSet clone()
This method performs a deep copy of this hash set; the data stored in the set, however, is not cloned. Note that this makes a difference only for object keys.
clone
in class java.lang.Object
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 java.util.Collection<java.lang.Integer>
hashCode
in interface java.util.Set<java.lang.Integer>
hashCode
in class AbstractIntSet