public class ShortOpenHashSet extends AbstractShortSet implements Serializable, Cloneable, Hash
Instances of this class use a hash table to represent a set. The table is
enlarged as needed by doubling its size when new entries are created, but it is never made
smaller (even on a clear()
). A family of trimming
methods lets you control the size of the table; this is particularly useful
if you reuse instances of this class.
Warning: The implementation of this class has significantly
changed in fastutil
6.1.0. Please read the
comments about this issue in the section “Faster Hash Tables” of the overview.
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(Collection<? extends Short> c)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor
copying a given collection. |
ShortOpenHashSet(Collection<? extends 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(Iterator<?> i)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor using elements provided by an iterator. |
ShortOpenHashSet(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) |
void |
clear() |
ShortOpenHashSet |
clone()
Returns a deep copy of this set.
|
boolean |
contains(short k) |
int |
growthFactor()
Deprecated.
Since
fastutil 6.1.0, hash tables are doubled when they are too full. |
void |
growthFactor(int growthFactor)
Deprecated.
Since
fastutil 6.1.0, hash tables are doubled when they are too full. |
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 |
rehash()
Deprecated.
A no-op.
|
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, remove
add, addAll, addAll, contains, containsAll, containsAll, rem, removeAll, removeAll, retainAll, retainAll, shortIterator, toArray, toArray, toArray, toShortArray, toShortArray, toString
addAll, containsAll, removeAll, retainAll, shortIterator, toArray, toArray, toShortArray, toShortArray
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(Collection<? extends Short> c, float f)
c
- a Collection
to be copied into the new hash set.f
- the load factor.public ShortOpenHashSet(Collection<? extends 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(Iterator<?> i, float f)
i
- an iterator whose elements will fill the set.f
- the load factor.public ShortOpenHashSet(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 add(short k)
add
in interface ShortCollection
add
in class AbstractShortCollection
Collection.add(Object)
public boolean remove(short k)
ShortSet
Note that the corresponding method of the type-specific collection is rem()
.
This unfortunate situation is caused by the clash
with the similarly named index-based method in the List
interface.
remove
in interface ShortSet
remove
in class AbstractShortSet
Collection.remove(Object)
public boolean contains(short k)
contains
in interface ShortCollection
contains
in class AbstractShortCollection
Collection.contains(Object)
public void clear()
clear
in interface Collection<Short>
clear
in interface Set<Short>
clear
in class AbstractCollection<Short>
public int size()
size
in interface Collection<Short>
size
in interface Set<Short>
size
in class AbstractCollection<Short>
public boolean isEmpty()
isEmpty
in interface Collection<Short>
isEmpty
in interface Set<Short>
isEmpty
in class AbstractShortCollection
@Deprecated public void growthFactor(int growthFactor)
fastutil
6.1.0, hash tables are doubled when they are too full.growthFactor
- unused.@Deprecated public int growthFactor()
fastutil
6.1.0, hash tables are doubled when they are too full.growthFactor(int)
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 Iterable<Short>
iterator
in interface Collection<Short>
iterator
in interface Set<Short>
iterator
in class AbstractShortSet
@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(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.
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<Short>
hashCode
in interface Set<Short>
hashCode
in class AbstractShortSet