public class ObjectOpenCustomHashSet<K> extends AbstractObjectSet<K> 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 |
---|
ObjectOpenCustomHashSet(java.util.Collection<? extends K> c,
float f,
Hash.Strategy<? super K> strategy)
Creates a new hash set copying a given collection.
|
ObjectOpenCustomHashSet(java.util.Collection<? extends K> c,
Hash.Strategy<? super K> strategy)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor
copying a given collection. |
ObjectOpenCustomHashSet(Hash.Strategy<? super K> strategy)
Creates a new hash set with initial expected
Hash.DEFAULT_INITIAL_SIZE elements
and Hash.DEFAULT_LOAD_FACTOR as load factor. |
ObjectOpenCustomHashSet(int expected,
float f,
Hash.Strategy<? super K> strategy)
Creates a new hash set.
|
ObjectOpenCustomHashSet(int expected,
Hash.Strategy<? super K> strategy)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor. |
ObjectOpenCustomHashSet(java.util.Iterator<? extends K> i,
float f,
Hash.Strategy<? super K> strategy)
Creates a new hash set using elements provided by a type-specific iterator.
|
ObjectOpenCustomHashSet(java.util.Iterator<? extends K> i,
Hash.Strategy<? super K> strategy)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor using elements provided by a type-specific iterator. |
ObjectOpenCustomHashSet(K[] a,
float f,
Hash.Strategy<? super K> strategy)
Creates a new hash set copying the elements of an array.
|
ObjectOpenCustomHashSet(K[] a,
Hash.Strategy<? super K> strategy)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor
copying the elements of an array. |
ObjectOpenCustomHashSet(K[] a,
int offset,
int length,
float f,
Hash.Strategy<? super K> strategy)
Creates a new hash set and fills it with the elements of a given array.
|
ObjectOpenCustomHashSet(K[] a,
int offset,
int length,
Hash.Strategy<? super K> strategy)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor and fills it with the elements of a given array. |
ObjectOpenCustomHashSet(ObjectCollection<? extends K> c,
float f,
Hash.Strategy<? super K> strategy)
Creates a new hash set copying a given type-specific collection.
|
ObjectOpenCustomHashSet(ObjectCollection<? extends K> c,
Hash.Strategy<? super K> strategy)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor
copying a given type-specific collection. |
Modifier and Type | Method and Description |
---|---|
boolean |
add(K k) |
boolean |
addAll(java.util.Collection<? extends K> c) |
K |
addOrGet(K k)
Add a random element if not present, get the existing value if already present.
|
void |
clear() |
ObjectOpenCustomHashSet<K> |
clone()
Returns a deep copy of this set.
|
boolean |
contains(java.lang.Object k) |
void |
forEach(java.util.function.Consumer<? super K> action) |
K |
get(java.lang.Object k)
Returns the element of this set that is equal to the given key, or
null . |
int |
hashCode()
Returns a hash code for this set.
|
boolean |
isEmpty() |
ObjectIterator<K> |
iterator()
Returns a type-specific iterator on the elements of this collection.
|
boolean |
remove(java.lang.Object k) |
int |
size() |
ObjectSpliterator<K> |
spliterator()
Returns a type-specific spliterator on the elements of this set.
|
Hash.Strategy<? super K> |
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
toString
public ObjectOpenCustomHashSet(int expected, float f, Hash.Strategy<? super K> 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 ObjectOpenCustomHashSet(int expected, Hash.Strategy<? super K> strategy)
Hash.DEFAULT_LOAD_FACTOR
as load factor.expected
- the expected number of elements in the hash set.strategy
- the strategy.public ObjectOpenCustomHashSet(Hash.Strategy<? super K> strategy)
Hash.DEFAULT_INITIAL_SIZE
elements
and Hash.DEFAULT_LOAD_FACTOR
as load factor.strategy
- the strategy.public ObjectOpenCustomHashSet(java.util.Collection<? extends K> c, float f, Hash.Strategy<? super K> strategy)
c
- a Collection
to be copied into the new hash set.f
- the load factor.strategy
- the strategy.public ObjectOpenCustomHashSet(java.util.Collection<? extends K> c, Hash.Strategy<? super K> 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 ObjectOpenCustomHashSet(ObjectCollection<? extends K> c, float f, Hash.Strategy<? super K> strategy)
c
- a type-specific collection to be copied into the new hash set.f
- the load factor.strategy
- the strategy.public ObjectOpenCustomHashSet(ObjectCollection<? extends K> c, Hash.Strategy<? super K> 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 ObjectOpenCustomHashSet(java.util.Iterator<? extends K> i, float f, Hash.Strategy<? super K> strategy)
i
- a type-specific iterator whose elements will fill the set.f
- the load factor.strategy
- the strategy.public ObjectOpenCustomHashSet(java.util.Iterator<? extends K> i, Hash.Strategy<? super K> 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 ObjectOpenCustomHashSet(K[] a, int offset, int length, float f, Hash.Strategy<? super K> 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 ObjectOpenCustomHashSet(K[] a, int offset, int length, Hash.Strategy<? super K> 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 ObjectOpenCustomHashSet(K[] a, float f, Hash.Strategy<? super K> strategy)
a
- an array to be copied into the new hash set.f
- the load factor.strategy
- the strategy.public ObjectOpenCustomHashSet(K[] a, Hash.Strategy<? super K> 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 Hash.Strategy<? super K> strategy()
public boolean addAll(java.util.Collection<? extends K> c)
public boolean add(K k)
public K addOrGet(K k)
K exist = set.get(k); if (exist == null) { set.add(k); exist = k; }
public boolean remove(java.lang.Object k)
public boolean contains(java.lang.Object k)
public K get(java.lang.Object k)
null
.null
.public void clear()
public int size()
public boolean isEmpty()
public ObjectIterator<K> iterator()
ObjectCollection
iterator
in interface ObjectCollection<K>
iterator
in interface ObjectIterable<K>
iterator
in interface ObjectSet<K>
iterator
in interface java.lang.Iterable<K>
iterator
in interface java.util.Collection<K>
iterator
in interface java.util.Set<K>
iterator
in class AbstractObjectSet<K>
Iterable.iterator()
public ObjectSpliterator<K> spliterator()
ObjectSet
Set spliterators must report at least Spliterator.DISTINCT
.
See Set.spliterator()
for more documentation on the requirements
of the returned spliterator.
spliterator
in interface ObjectCollection<K>
spliterator
in interface ObjectIterable<K>
spliterator
in interface ObjectSet<K>
spliterator
in interface java.lang.Iterable<K>
spliterator
in interface java.util.Collection<K>
spliterator
in interface java.util.Set<K>
public void forEach(java.util.function.Consumer<? super K> action)
forEach
in interface java.lang.Iterable<K>
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 ObjectOpenCustomHashSet<K> 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<K>
hashCode
in interface java.util.Set<K>
hashCode
in class AbstractObjectSet<K>