public class ShortOpenHashSet 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 |
---|
ShortOpenHashSet()
Creates a new hash set with initial expected
Hash.DEFAULT_INITIAL_SIZE elements and
Hash.DEFAULT_LOAD_FACTOR as load factor. |
ShortOpenHashSet(java.util.Collection<? extends java.lang.Short> c)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor
copying a given collection. |
ShortOpenHashSet(java.util.Collection<? extends java.lang.Short> c,
float f)
Creates a new hash set copying a given collection.
|
ShortOpenHashSet(int expected)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor. |
ShortOpenHashSet(int expected,
float f)
Creates a new hash set.
|
ShortOpenHashSet(java.util.Iterator<?> i)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor
using elements provided by an iterator. |
ShortOpenHashSet(java.util.Iterator<?> i,
float f)
Creates a new hash set using elements provided by an iterator.
|
ShortOpenHashSet(short[] a)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor
copying the elements of an array. |
ShortOpenHashSet(short[] a,
float f)
Creates a new hash set copying the elements of an array.
|
ShortOpenHashSet(short[] 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. |
ShortOpenHashSet(short[] a,
int offset,
int length,
float f)
Creates a new hash set and fills it with the elements of a given array.
|
ShortOpenHashSet(ShortCollection c)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor
copying a given type-specific collection. |
ShortOpenHashSet(ShortCollection c,
float f)
Creates a new hash set copying a given type-specific collection.
|
ShortOpenHashSet(ShortIterator i)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor
using elements provided by a type-specific iterator. |
ShortOpenHashSet(ShortIterator i,
float f)
Creates a new hash set 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() |
ShortOpenHashSet |
clone()
Returns a deep copy of this set.
|
boolean |
contains(short k)
Returns
true if this collection contains the specified element. |
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() |
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, remove, removeAll, retainAll, toArray, toShortArray, toShortArray, toString
containsAll, removeAll, retainAll, toArray, toArray
containsAll, removeAll, removeIf, removeIf, retainAll, toArray, toShortArray, toShortArray
forEach, forEach
public ShortOpenHashSet(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 ShortOpenHashSet(int expected)
Hash.DEFAULT_LOAD_FACTOR
as load factor.expected
- the expected number of elements in the hash set.public ShortOpenHashSet()
Hash.DEFAULT_INITIAL_SIZE
elements and
Hash.DEFAULT_LOAD_FACTOR
as load factor.public ShortOpenHashSet(java.util.Collection<? extends java.lang.Short> c, float f)
c
- a Collection
to be copied into the new hash set.f
- the load factor.public ShortOpenHashSet(java.util.Collection<? extends java.lang.Short> c)
Hash.DEFAULT_LOAD_FACTOR
as load factor
copying a given collection.c
- a Collection
to be copied into the new hash set.public ShortOpenHashSet(ShortCollection c, float f)
c
- a type-specific collection to be copied into the new hash set.f
- the load factor.public ShortOpenHashSet(ShortCollection 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 ShortOpenHashSet(ShortIterator i, float f)
i
- a type-specific iterator whose elements will fill the set.f
- the load factor.public ShortOpenHashSet(ShortIterator 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 ShortOpenHashSet(java.util.Iterator<?> i, float f)
i
- an iterator whose elements will fill the set.f
- the load factor.public ShortOpenHashSet(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 ShortOpenHashSet(short[] 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 ShortOpenHashSet(short[] 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 ShortOpenHashSet(short[] a, float f)
a
- an array to be copied into the new hash set.f
- the load factor.public ShortOpenHashSet(short[] 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(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)
addAll
in interface java.util.Collection<java.lang.Short>
addAll
in interface java.util.Set<java.lang.Short>
addAll
in class java.util.AbstractCollection<java.lang.Short>
public boolean add(short k)
AbstractShortCollection
This implementation always throws an UnsupportedOperationException
.
add
in interface ShortCollection
add
in class AbstractShortCollection
Collection.add(Object)
public boolean remove(short k)
AbstractShortSet
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 ShortSet
remove
in class AbstractShortSet
Collection.remove(Object)
public boolean contains(short k)
AbstractShortCollection
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 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
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 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 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 ShortOpenHashSet 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