public class LongOpenHashSet extends AbstractLongSet implements Serializable, 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 |
|---|
LongOpenHashSet()
Creates a new hash set with initial expected
Hash.DEFAULT_INITIAL_SIZE elements
and Hash.DEFAULT_LOAD_FACTOR as load factor. |
LongOpenHashSet(Collection<? extends Long> c)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor
copying a given collection. |
LongOpenHashSet(Collection<? extends Long> c,
float f)
Creates a new hash set copying a given collection.
|
LongOpenHashSet(int expected)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor. |
LongOpenHashSet(int expected,
float f)
Creates a new hash set.
|
LongOpenHashSet(Iterator<?> i)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor using elements provided by an iterator. |
LongOpenHashSet(Iterator<?> i,
float f)
Creates a new hash set using elements provided by an iterator.
|
LongOpenHashSet(long[] a)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor
copying the elements of an array. |
LongOpenHashSet(long[] a,
float f)
Creates a new hash set copying the elements of an array.
|
LongOpenHashSet(long[] 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. |
LongOpenHashSet(long[] a,
int offset,
int length,
float f)
Creates a new hash set and fills it with the elements of a given array.
|
LongOpenHashSet(LongCollection c)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor
copying a given type-specific collection. |
LongOpenHashSet(LongCollection c,
float f)
Creates a new hash set copying a given type-specific collection.
|
LongOpenHashSet(LongIterator i)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor using elements provided by a type-specific iterator. |
LongOpenHashSet(LongIterator i,
float f)
Creates a new hash set using elements provided by a type-specific iterator.
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
add(long k)
Ensures that this collection contains the specified element (optional operation).
|
boolean |
addAll(Collection<? extends Long> c) |
boolean |
addAll(LongCollection c)
Adds all elements of the given type-specific collection to this collection.
|
void |
clear() |
LongOpenHashSet |
clone()
Returns a deep copy of this set.
|
boolean |
contains(long k)
Returns
true if this collection contains the specified element. |
int |
hashCode()
Returns a hash code for this set.
|
boolean |
isEmpty() |
LongIterator |
iterator()
Returns a type-specific iterator on the elements of this collection.
|
boolean |
remove(long k)
Removes an element from this set.
|
int |
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, remadd, contains, containsAll, remove, removeAll, retainAll, toArray, toLongArray, toLongArray, toStringcontainsAll, removeAll, retainAll, toArray, toArraycontainsAll, removeAll, removeIf, removeIf, retainAll, toArray, toLongArray, toLongArrayforEach, forEachcontainsAll, removeAll, retainAll, spliterator, toArray, toArrayparallelStream, streampublic LongOpenHashSet(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 LongOpenHashSet(int expected)
Hash.DEFAULT_LOAD_FACTOR as load factor.expected - the expected number of elements in the hash set.public LongOpenHashSet()
Hash.DEFAULT_INITIAL_SIZE elements
and Hash.DEFAULT_LOAD_FACTOR as load factor.public LongOpenHashSet(Collection<? extends Long> c, float f)
c - a Collection to be copied into the new hash set.f - the load factor.public LongOpenHashSet(Collection<? extends Long> c)
Hash.DEFAULT_LOAD_FACTOR as load factor
copying a given collection.c - a Collection to be copied into the new hash set.public LongOpenHashSet(LongCollection c, float f)
c - a type-specific collection to be copied into the new hash set.f - the load factor.public LongOpenHashSet(LongCollection 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 LongOpenHashSet(LongIterator i, float f)
i - a type-specific iterator whose elements will fill the set.f - the load factor.public LongOpenHashSet(LongIterator 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 LongOpenHashSet(Iterator<?> i, float f)
i - an iterator whose elements will fill the set.f - the load factor.public LongOpenHashSet(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 LongOpenHashSet(long[] 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 LongOpenHashSet(long[] 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 LongOpenHashSet(long[] a,
float f)
a - an array to be copied into the new hash set.f - the load factor.public LongOpenHashSet(long[] 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 boolean addAll(LongCollection c)
LongCollectionaddAll in interface LongCollectionaddAll in class AbstractLongCollectionc - a type-specific collection.true if this collection changed as a result of the call.Collection.addAll(Collection)public boolean addAll(Collection<? extends Long> c)
addAll in interface Collection<Long>addAll in interface Set<Long>addAll in class AbstractCollection<Long>public boolean add(long k)
AbstractLongCollectionThis implementation always throws an UnsupportedOperationException.
add in interface LongCollectionadd in class AbstractLongCollectionCollection.add(Object)public boolean remove(long k)
AbstractLongSetNote 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 LongSetremove in class AbstractLongSetCollection.remove(Object)public boolean contains(long k)
AbstractLongCollectiontrue if this collection contains the specified element.
This implementation iterates over the elements in the collection, looking for the specified element.
contains in interface LongCollectioncontains in class AbstractLongCollectionCollection.contains(Object)public void clear()
clear in interface Collection<Long>clear in interface Set<Long>clear in class AbstractCollection<Long>public int size()
size in interface Collection<Long>size in interface Set<Long>size in class AbstractCollection<Long>public boolean isEmpty()
isEmpty in interface Collection<Long>isEmpty in interface Set<Long>isEmpty in class AbstractCollection<Long>public LongIterator iterator()
LongCollectionNote 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 LongCollectioniterator in interface LongIterableiterator in interface LongSetiterator in interface Iterable<Long>iterator in interface Collection<Long>iterator in interface Set<Long>iterator in class AbstractLongSetIterable.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(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 LongOpenHashSet 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.
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<Long>hashCode in interface Set<Long>hashCode in class AbstractLongSet