public class ShortOpenCustomHashSet extends AbstractShortSet 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 |
---|
ShortOpenCustomHashSet(java.util.Collection<? extends java.lang.Short> c,
float f,
ShortHash.Strategy strategy)
Creates a new hash set copying a given collection.
|
ShortOpenCustomHashSet(java.util.Collection<? extends java.lang.Short> c,
ShortHash.Strategy strategy)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor
copying a given collection. |
ShortOpenCustomHashSet(int expected,
float f,
ShortHash.Strategy strategy)
Creates a new hash set.
|
ShortOpenCustomHashSet(int expected,
ShortHash.Strategy strategy)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor. |
ShortOpenCustomHashSet(java.util.Iterator<?> i,
float f,
ShortHash.Strategy strategy)
Creates a new hash set using elements provided by an iterator.
|
ShortOpenCustomHashSet(java.util.Iterator<?> i,
ShortHash.Strategy strategy)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor using elements provided by an iterator. |
ShortOpenCustomHashSet(short[] a,
float f,
ShortHash.Strategy strategy)
Creates a new hash set copying the elements of an array.
|
ShortOpenCustomHashSet(short[] a,
int offset,
int length,
float f,
ShortHash.Strategy strategy)
Creates a new hash set and fills it with the elements of a given array.
|
ShortOpenCustomHashSet(short[] a,
int offset,
int length,
ShortHash.Strategy strategy)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor and fills it with the elements of a given array. |
ShortOpenCustomHashSet(short[] a,
ShortHash.Strategy strategy)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor
copying the elements of an array. |
ShortOpenCustomHashSet(ShortCollection c,
float f,
ShortHash.Strategy strategy)
Creates a new hash set copying a given type-specific collection.
|
ShortOpenCustomHashSet(ShortCollection c,
ShortHash.Strategy strategy)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor
copying a given type-specific collection. |
ShortOpenCustomHashSet(ShortHash.Strategy strategy)
Creates a new hash set with initial expected
Hash.DEFAULT_INITIAL_SIZE elements
and Hash.DEFAULT_LOAD_FACTOR as load factor. |
ShortOpenCustomHashSet(ShortIterator i,
float f,
ShortHash.Strategy strategy)
Creates a new hash set using elements provided by a type-specific iterator.
|
ShortOpenCustomHashSet(ShortIterator i,
ShortHash.Strategy strategy)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor using elements provided by a type-specific iterator. |
Modifier and Type | Method and Description |
---|---|
boolean |
add(short k)
Ensures that this collection contains the specified element (optional operation).
|
boolean |
addAll(java.util.Collection<? extends java.lang.Short> c) |
boolean |
addAll(ShortCollection c)
Adds all elements of the given type-specific collection to this collection.
|
void |
clear() |
ShortOpenCustomHashSet |
clone()
Returns a deep copy of this set.
|
boolean |
contains(short k)
Returns
true if this collection contains the specified element. |
void |
forEach(ShortConsumer 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() |
ShortIterator |
iterator()
Returns a type-specific iterator on the elements of this collection.
|
boolean |
remove(short k)
Removes an element from this set.
|
int |
size() |
ShortSpliterator |
spliterator()
Returns a type-specific spliterator on the elements of this set.
|
ShortHash.Strategy |
strategy()
Returns the hashing strategy.
|
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, remove, removeAll, removeAll, retainAll, retainAll, toArray, toShortArray, toShortArray, toString
add, contains, of, of, of, of, of, remove
containsAll, intIterator, intParallelStream, intSpliterator, intStream, parallelStream, removeAll, removeIf, removeIf, removeIf, retainAll, stream, toArray, toShortArray, toShortArray
forEach, forEach
public ShortOpenCustomHashSet(int expected, float f, ShortHash.Strategy strategy)
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.strategy
- the strategy.public ShortOpenCustomHashSet(int expected, ShortHash.Strategy strategy)
Hash.DEFAULT_LOAD_FACTOR
as load factor.expected
- the expected number of elements in the hash set.strategy
- the strategy.public ShortOpenCustomHashSet(ShortHash.Strategy strategy)
Hash.DEFAULT_INITIAL_SIZE
elements
and Hash.DEFAULT_LOAD_FACTOR
as load factor.strategy
- the strategy.public ShortOpenCustomHashSet(java.util.Collection<? extends java.lang.Short> c, float f, ShortHash.Strategy strategy)
c
- a Collection
to be copied into the new hash set.f
- the load factor.strategy
- the strategy.public ShortOpenCustomHashSet(java.util.Collection<? extends java.lang.Short> c, ShortHash.Strategy strategy)
Hash.DEFAULT_LOAD_FACTOR
as load factor
copying a given collection.c
- a Collection
to be copied into the new hash set.strategy
- the strategy.public ShortOpenCustomHashSet(ShortCollection c, float f, ShortHash.Strategy strategy)
c
- a type-specific collection to be copied into the new hash set.f
- the load factor.strategy
- the strategy.public ShortOpenCustomHashSet(ShortCollection c, ShortHash.Strategy strategy)
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.strategy
- the strategy.public ShortOpenCustomHashSet(ShortIterator i, float f, ShortHash.Strategy strategy)
i
- a type-specific iterator whose elements will fill the set.f
- the load factor.strategy
- the strategy.public ShortOpenCustomHashSet(ShortIterator i, ShortHash.Strategy strategy)
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.strategy
- the strategy.public ShortOpenCustomHashSet(java.util.Iterator<?> i, float f, ShortHash.Strategy strategy)
i
- an iterator whose elements will fill the set.f
- the load factor.strategy
- the strategy.public ShortOpenCustomHashSet(java.util.Iterator<?> i, ShortHash.Strategy strategy)
Hash.DEFAULT_LOAD_FACTOR
as load factor using elements provided by an iterator.i
- an iterator whose elements will fill the set.strategy
- the strategy.public ShortOpenCustomHashSet(short[] a, int offset, int length, float f, ShortHash.Strategy strategy)
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.strategy
- the strategy.public ShortOpenCustomHashSet(short[] a, int offset, int length, ShortHash.Strategy strategy)
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.strategy
- the strategy.public ShortOpenCustomHashSet(short[] a, float f, ShortHash.Strategy strategy)
a
- an array to be copied into the new hash set.f
- the load factor.strategy
- the strategy.public ShortOpenCustomHashSet(short[] a, ShortHash.Strategy strategy)
Hash.DEFAULT_LOAD_FACTOR
as load factor
copying the elements of an array.a
- an array to be copied into the new hash set.strategy
- the strategy.public ShortHash.Strategy strategy()
public boolean addAll(ShortCollection c)
ShortCollection
addAll
in interface ShortCollection
addAll
in class AbstractShortCollection
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.Short> c)
AbstractShortCollection
addAll
in interface java.util.Collection<java.lang.Short>
addAll
in interface java.util.Set<java.lang.Short>
addAll
in class AbstractShortCollection
public boolean add(short k)
AbstractShortCollection
add
in interface ShortCollection
add
in class AbstractShortCollection
Collection.add(Object)
public boolean remove(short k)
AbstractShortSet
rem()
method
implemented by type-specific abstract Collection
superclass.remove
in interface ShortSet
remove
in class AbstractShortSet
Collection.remove(Object)
public boolean contains(short k)
AbstractShortCollection
true
if this collection contains the specified element.contains
in interface ShortCollection
contains
in class AbstractShortCollection
Collection.contains(Object)
public void clear()
clear
in interface java.util.Collection<java.lang.Short>
clear
in interface java.util.Set<java.lang.Short>
clear
in class java.util.AbstractCollection<java.lang.Short>
public int size()
size
in interface java.util.Collection<java.lang.Short>
size
in interface java.util.Set<java.lang.Short>
size
in class java.util.AbstractCollection<java.lang.Short>
public boolean isEmpty()
isEmpty
in interface java.util.Collection<java.lang.Short>
isEmpty
in interface java.util.Set<java.lang.Short>
isEmpty
in class java.util.AbstractCollection<java.lang.Short>
public ShortIterator iterator()
ShortCollection
iterator
in interface ShortCollection
iterator
in interface ShortIterable
iterator
in interface ShortSet
iterator
in interface java.lang.Iterable<java.lang.Short>
iterator
in interface java.util.Collection<java.lang.Short>
iterator
in interface java.util.Set<java.lang.Short>
iterator
in class AbstractShortSet
Iterable.iterator()
public ShortSpliterator spliterator()
ShortSet
Set spliterators must report at least Spliterator.DISTINCT
.
See Set.spliterator()
for more documentation on the requirements
of the returned spliterator.
spliterator
in interface ShortCollection
spliterator
in interface ShortIterable
spliterator
in interface ShortSet
spliterator
in interface java.lang.Iterable<java.lang.Short>
spliterator
in interface java.util.Collection<java.lang.Short>
spliterator
in interface java.util.Set<java.lang.Short>
public void forEach(ShortConsumer action)
ShortIterable
Iterable
until all elements have been processed or the action throws an
exception.forEach
in interface ShortIterable
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 ShortOpenCustomHashSet 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.Short>
hashCode
in interface java.util.Set<java.lang.Short>
hashCode
in class AbstractShortSet