Hash
, IntCollection
, IntIterable
, IntSet
, Size64
, java.io.Serializable
, java.lang.Cloneable
, java.lang.Iterable<java.lang.Integer>
, java.util.Collection<java.lang.Integer>
, java.util.Set<java.lang.Integer>
public class IntOpenHashBigSet extends AbstractIntSet implements java.io.Serializable, java.lang.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.
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 | Description |
---|---|
IntOpenHashBigSet() |
Creates a new hash big set with initial expected
Hash.DEFAULT_INITIAL_SIZE elements and
Hash.DEFAULT_LOAD_FACTOR as load factor. |
IntOpenHashBigSet(int[] a) |
Creates a new hash big set with
Hash.DEFAULT_LOAD_FACTOR as load
factor copying the elements of an array. |
IntOpenHashBigSet(int[] a,
float f) |
Creates a new hash big set copying the elements of an array.
|
IntOpenHashBigSet(int[] a,
int offset,
int length) |
Creates a new hash big set with
Hash.DEFAULT_LOAD_FACTOR as load
factor and fills it with the elements of a given array. |
IntOpenHashBigSet(int[] a,
int offset,
int length,
float f) |
Creates a new hash big set and fills it with the elements of a given array.
|
IntOpenHashBigSet(long expected) |
Creates a new hash big set with
Hash.DEFAULT_LOAD_FACTOR as load
factor. |
IntOpenHashBigSet(long expected,
float f) |
Creates a new hash big set.
|
IntOpenHashBigSet(IntCollection c) |
Creates a new hash big set with
Hash.DEFAULT_LOAD_FACTOR as load
factor copying a given type-specific collection. |
IntOpenHashBigSet(IntCollection c,
float f) |
Creates a new hash big set copying a given type-specific collection.
|
IntOpenHashBigSet(IntIterator i) |
Creates a new hash big set with
Hash.DEFAULT_LOAD_FACTOR as load
factor using elements provided by a type-specific iterator. |
IntOpenHashBigSet(IntIterator i,
float f) |
Creates a new hash big set using elements provided by a type-specific
iterator.
|
IntOpenHashBigSet(java.util.Collection<? extends java.lang.Integer> c) |
Creates a new hash big set with
Hash.DEFAULT_LOAD_FACTOR as load
factor copying a given collection. |
IntOpenHashBigSet(java.util.Collection<? extends java.lang.Integer> c,
float f) |
Creates a new hash big set copying a given collection.
|
IntOpenHashBigSet(java.util.Iterator<?> i) |
Creates a new hash big set with
Hash.DEFAULT_LOAD_FACTOR as load
factor using elements provided by an iterator. |
IntOpenHashBigSet(java.util.Iterator<?> i,
float f) |
Creates a new hash big set using elements provided by an iterator.
|
Modifier and Type | Method | Description |
---|---|---|
boolean |
add(int k) |
Ensures that this collection contains the specified element (optional
operation).
|
boolean |
addAll(IntCollection c) |
Adds all elements of the given type-specific collection to this collection.
|
boolean |
addAll(java.util.Collection<? extends java.lang.Integer> c) |
|
void |
clear() |
|
IntOpenHashBigSet |
clone() |
Returns a deep copy of this big set.
|
boolean |
contains(int k) |
Returns
true if this collection contains the specified element. |
int |
hashCode() |
Returns a hash code for this set.
|
boolean |
isEmpty() |
|
IntIterator |
iterator() |
Returns a type-specific iterator on the elements of this collection.
|
boolean |
remove(int 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.
|
containsAll, removeAll, retainAll, toArray, toArray
add, contains, containsAll, remove, removeAll, retainAll, toArray, toIntArray, toIntArray, toString
equals, rem
containsAll, removeAll, removeIf, removeIf, retainAll, toArray, toIntArray, toIntArray
forEach, forEach
public IntOpenHashBigSet(long 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 set.f
- the load factor.public IntOpenHashBigSet(long expected)
Hash.DEFAULT_LOAD_FACTOR
as load
factor.expected
- the expected number of elements in the hash big set.public IntOpenHashBigSet()
Hash.DEFAULT_INITIAL_SIZE
elements and
Hash.DEFAULT_LOAD_FACTOR
as load factor.public IntOpenHashBigSet(java.util.Collection<? extends java.lang.Integer> c, float f)
c
- a Collection
to be copied into the new hash big set.f
- the load factor.public IntOpenHashBigSet(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 big set.public IntOpenHashBigSet(IntCollection c, float f)
c
- a type-specific collection to be copied into the new hash big set.f
- the load factor.public IntOpenHashBigSet(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 big set.public IntOpenHashBigSet(IntIterator i, float f)
i
- a type-specific iterator whose elements will fill the new hash big
set.f
- the load factor.public IntOpenHashBigSet(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 new hash big
set.public IntOpenHashBigSet(java.util.Iterator<?> i, float f)
i
- an iterator whose elements will fill the new hash big set.f
- the load factor.public IntOpenHashBigSet(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 new hash big set.public IntOpenHashBigSet(int[] a, int offset, int length, float f)
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.public IntOpenHashBigSet(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 new hash big set.offset
- the first element to use.length
- the number of elements to use.public IntOpenHashBigSet(int[] a, float f)
a
- an array to be copied into the new hash big set.f
- the load factor.public IntOpenHashBigSet(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 big set.public boolean addAll(java.util.Collection<? extends java.lang.Integer> c)
addAll
in interface java.util.Collection<java.lang.Integer>
addAll
in interface java.util.Set<java.lang.Integer>
addAll
in class java.util.AbstractCollection<java.lang.Integer>
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 add(int k)
AbstractIntCollection
This implementation always throws an UnsupportedOperationException
.
add
in interface IntCollection
add
in class AbstractIntCollection
Collection.add(Object)
public boolean remove(int k)
AbstractIntSet
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 the List
interface. Delegates to the type-specific 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.
This implementation iterates over the elements in the collection, looking for the specified element.
contains
in interface IntCollection
contains
in class AbstractIntCollection
Collection.contains(Object)
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)
.
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 IntIterator iterator()
IntCollection
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 extends Collection
.
iterator
in interface java.util.Collection<java.lang.Integer>
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.Set<java.lang.Integer>
iterator
in class AbstractIntSet
Iterable.iterator()
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(long)
public boolean trim(long 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.
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.
n
- the threshold for the trimming.trim()
@Deprecated public int size()
Size64
Integer.MAX_VALUE
.
This default implementation follows the definition above, which is compatible
with Collection.size()
.
size
in interface java.util.Collection<java.lang.Integer>
size
in interface java.util.Set<java.lang.Integer>
size
in interface Size64
size
in class java.util.AbstractCollection<java.lang.Integer>
Integer.MAX_VALUE
.Collection.size()
public long size64()
Size64
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 IntOpenHashBigSet clone()
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.
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