public class CharOpenCustomHashSet extends AbstractCharSet 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 |
|---|
CharOpenCustomHashSet(char[] a,
CharHash.Strategy strategy)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load
factor copying the elements of an array. |
CharOpenCustomHashSet(char[] a,
float f,
CharHash.Strategy strategy)
Creates a new hash set copying the elements of an array.
|
CharOpenCustomHashSet(char[] a,
int offset,
int length,
CharHash.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. |
CharOpenCustomHashSet(char[] a,
int offset,
int length,
float f,
CharHash.Strategy strategy)
Creates a new hash set and fills it with the elements of a given array.
|
CharOpenCustomHashSet(CharCollection c,
CharHash.Strategy strategy)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load
factor copying a given type-specific collection. |
CharOpenCustomHashSet(CharCollection c,
float f,
CharHash.Strategy strategy)
Creates a new hash set copying a given type-specific collection.
|
CharOpenCustomHashSet(CharHash.Strategy strategy)
Creates a new hash set with initial expected
Hash.DEFAULT_INITIAL_SIZE elements and
Hash.DEFAULT_LOAD_FACTOR as load factor. |
CharOpenCustomHashSet(CharIterator i,
CharHash.Strategy strategy)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load
factor using elements provided by a type-specific iterator. |
CharOpenCustomHashSet(CharIterator i,
float f,
CharHash.Strategy strategy)
Creates a new hash set using elements provided by a type-specific
iterator.
|
CharOpenCustomHashSet(Collection<? extends Character> c,
CharHash.Strategy strategy)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load
factor copying a given collection. |
CharOpenCustomHashSet(Collection<? extends Character> c,
float f,
CharHash.Strategy strategy)
Creates a new hash set copying a given collection.
|
CharOpenCustomHashSet(int expected,
CharHash.Strategy strategy)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load
factor. |
CharOpenCustomHashSet(int expected,
float f,
CharHash.Strategy strategy)
Creates a new hash set.
|
CharOpenCustomHashSet(Iterator<?> i,
CharHash.Strategy strategy)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load
factor using elements provided by an iterator. |
CharOpenCustomHashSet(Iterator<?> i,
float f,
CharHash.Strategy strategy)
Creates a new hash set using elements provided by an iterator.
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
add(char k)
Ensures that this collection contains the specified element (optional
operation).
|
boolean |
addAll(CharCollection c)
Adds all elements of the given type-specific collection to this
collection.
|
boolean |
addAll(Collection<? extends Character> c)
Adds all of the elements in the specified collection to this collection
(optional operation).
|
void |
clear()
Removes all of the elements from this collection (optional operation).
|
CharOpenCustomHashSet |
clone()
Returns a deep copy of this set.
|
boolean |
contains(char k)
Returns
true if this collection contains the specified element. |
int |
hashCode()
Returns a hash code for this set.
|
boolean |
isEmpty()
Returns true if this collection contains no elements.
|
CharIterator |
iterator()
Returns an iterator over the elements contained in this collection.
|
boolean |
remove(char k)
Removes an element from this set.
|
int |
size()
Returns the number of elements in this collection.
|
CharHash.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, remadd, contains, containsAll, remove, removeAll, retainAll, toArray, toCharArray, toCharArray, toStringcontainsAll, removeAll, retainAll, toArray, toArraycontainsAll, removeAll, retainAll, toArray, toCharArray, toCharArrayforEach, forEachcontainsAll, removeAll, retainAll, spliterator, toArray, toArrayparallelStream, removeIf, streampublic CharOpenCustomHashSet(int expected,
float f,
CharHash.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 CharOpenCustomHashSet(int expected,
CharHash.Strategy strategy)
Hash.DEFAULT_LOAD_FACTOR as load
factor.expected - the expected number of elements in the hash set.strategy - the strategy.public CharOpenCustomHashSet(CharHash.Strategy strategy)
Hash.DEFAULT_INITIAL_SIZE elements and
Hash.DEFAULT_LOAD_FACTOR as load factor.strategy - the strategy.public CharOpenCustomHashSet(Collection<? extends Character> c, float f, CharHash.Strategy strategy)
c - a Collection to be copied into the new hash set.f - the load factor.strategy - the strategy.public CharOpenCustomHashSet(Collection<? extends Character> c, CharHash.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 CharOpenCustomHashSet(CharCollection c, float f, CharHash.Strategy strategy)
c - a type-specific collection to be copied into the new hash set.f - the load factor.strategy - the strategy.public CharOpenCustomHashSet(CharCollection c, CharHash.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 CharOpenCustomHashSet(CharIterator i, float f, CharHash.Strategy strategy)
i - a type-specific iterator whose elements will fill the set.f - the load factor.strategy - the strategy.public CharOpenCustomHashSet(CharIterator i, CharHash.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 CharOpenCustomHashSet(Iterator<?> i, float f, CharHash.Strategy strategy)
i - an iterator whose elements will fill the set.f - the load factor.strategy - the strategy.public CharOpenCustomHashSet(Iterator<?> i, CharHash.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 CharOpenCustomHashSet(char[] a,
int offset,
int length,
float f,
CharHash.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 CharOpenCustomHashSet(char[] a,
int offset,
int length,
CharHash.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 CharOpenCustomHashSet(char[] a,
float f,
CharHash.Strategy strategy)
a - an array to be copied into the new hash set.f - the load factor.strategy - the strategy.public CharOpenCustomHashSet(char[] a,
CharHash.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 CharHash.Strategy strategy()
public boolean addAll(CharCollection c)
CharCollectionaddAll in interface CharCollectionaddAll in class AbstractCharCollectionc - a type-specific collection.true if this collection changed as a result of the call.Collection.addAll(Collection)public boolean addAll(Collection<? extends Character> c)
java.util.AbstractCollectionThis implementation iterates over the specified collection, and adds each object returned by the iterator to this collection, in turn.
Note that this implementation will throw an UnsupportedOperationException unless add is overridden (assuming the specified collection is non-empty).
addAll in interface Collection<Character>addAll in interface Set<Character>addAll in class AbstractCollection<Character>c - collection containing elements to be added to this collectionAbstractCollection.add(Object)public boolean add(char k)
AbstractCharCollection
This implementation always throws an
UnsupportedOperationException.
add in interface CharCollectionadd in class AbstractCharCollectionCollection.add(Object)public boolean remove(char k)
AbstractCharSet
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 CharSetremove in class AbstractCharSetCollection.remove(Object)public boolean contains(char k)
AbstractCharCollectiontrue if this collection contains the specified element.
This implementation iterates over the elements in the collection, looking for the specified element.
contains in interface CharCollectioncontains in class AbstractCharCollectionCollection.contains(Object)public void clear()
java.util.AbstractCollectionThis implementation iterates over this collection, removing each element using the Iterator.remove operation. Most implementations will probably choose to override this method for efficiency.
Note that this implementation will throw an UnsupportedOperationException if the iterator returned by this collection's iterator method does not implement the remove method and this collection is non-empty.
clear in interface Collection<Character>clear in interface Set<Character>clear in class AbstractCollection<Character>public int size()
java.util.Collectionsize in interface Collection<Character>size in interface Set<Character>size in class AbstractCollection<Character>public boolean isEmpty()
java.util.AbstractCollectionThis implementation returns size() == 0.
isEmpty in interface Collection<Character>isEmpty in interface Set<Character>isEmpty in class AbstractCollection<Character>public CharIterator iterator()
java.util.AbstractCollectioniterator in interface CharCollectioniterator in interface CharIterableiterator in interface CharSetiterator in interface Iterable<Character>iterator in interface Collection<Character>iterator in interface Set<Character>iterator in class AbstractCharSetIterable.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 CharOpenCustomHashSet 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<Character>hashCode in interface Set<Character>hashCode in class AbstractCharSetObject.equals(java.lang.Object),
System.identityHashCode(java.lang.Object)