public class IntOpenHashBigSet extends AbstractIntSet 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, 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 and 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(Collection<? extends Integer> c)
Creates a new hash big set with
Hash.DEFAULT_LOAD_FACTOR as load
factor copying a given collection. |
IntOpenHashBigSet(Collection<? extends Integer> c,
float f)
Creates a new hash big set copying a given collection.
|
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(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(Iterator<?> i)
Creates a new hash big set with
Hash.DEFAULT_LOAD_FACTOR as load
factor using elements provided by an iterator. |
IntOpenHashBigSet(Iterator<?> i,
float f)
Creates a new hash big set using elements provided by an iterator.
|
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.
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
add(int k) |
boolean |
addAll(Collection<? extends Integer> c)
Adds all elements of the given collection to this collection.
|
boolean |
addAll(IntCollection c)
Adds all elements of the given type-specific collection to this
collection.
|
void |
clear() |
IntOpenHashBigSet |
clone()
Returns a deep copy of this big set.
|
boolean |
contains(int k) |
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 |
rehash()
Deprecated.
A no-op.
|
boolean |
rem(int k)
|
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.
|
equals, removeadd, contains, containsAll, containsAll, intIterator, rem, remove, removeAll, removeAll, retainAll, retainAll, toArray, toArray, toArray, toIntArray, toIntArray, toStringcontainsAll, intIterator, removeAll, retainAll, toArray, toArray, toIntArray, toIntArrayadd, contains, containsAll, remove, removeAll, retainAll, spliterator, toArray, toArrayparallelStream, removeIf, streampublic 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(Collection<? extends Integer> c, float f)
c - a Collection to be copied into the new hash big set.f - the load factor.public IntOpenHashBigSet(Collection<? extends 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(Iterator<?> i, float f)
i - an iterator whose elements will fill the new hash big set.f - the load factor.public IntOpenHashBigSet(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(IntCollection c)
addAll in interface IntCollectionaddAll in class AbstractIntCollectionc - a type-specific collection.true if this collection changed as a result of the
call.Collection.addAll(Collection)public boolean addAll(Collection<? extends Integer> c)
addAll in interface Collection<Integer>addAll in interface Set<Integer>addAll in class AbstractIntCollectionc - a collection.true if this collection changed as a result of the
call.public boolean add(int k)
add in interface IntCollectionadd in class AbstractIntCollectionCollection.add(Object)public boolean rem(int k)
IntCollectionremove(), but the clash with
the similarly named index-based method in the List
interface forces us to use a distinguished name. For simplicity, the set
interfaces reinstates remove().rem in interface IntCollectionrem in class AbstractIntCollectionCollection.remove(Object)public boolean contains(int k)
contains in interface IntCollectioncontains in class AbstractIntCollectionCollection.contains(Object)public void clear()
clear in interface Collection<Integer>clear in interface Set<Integer>clear in class AbstractCollection<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 IntCollectioniterator in interface IntIterableiterator in interface IntSetiterator in interface Iterable<Integer>iterator in interface Collection<Integer>iterator in interface Set<Integer>iterator in class AbstractIntSet@Deprecated public boolean rehash()
If you need to reduce the table size to fit exactly this set, use
trim().
trim()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()
Size64Integer.MAX_VALUE.size in interface Size64size in interface Collection<Integer>size in interface Set<Integer>size in class AbstractCollection<Integer>Integer.MAX_VALUE.Collection.size()public long size64()
Size64public boolean isEmpty()
isEmpty in interface Collection<Integer>isEmpty in interface Set<Integer>isEmpty in class AbstractIntCollectionpublic 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 Collection<Integer>hashCode in interface Set<Integer>hashCode in class AbstractIntSet