public class CharOpenHashSet extends AbstractCharSet 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.
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 |
|---|
CharOpenHashSet()
Creates a new hash set with initial expected
Hash.DEFAULT_INITIAL_SIZE elements and
Hash.DEFAULT_LOAD_FACTOR as load factor. |
CharOpenHashSet(char[] a)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load
factor copying the elements of an array. |
CharOpenHashSet(char[] a,
float f)
Creates a new hash set copying the elements of an array.
|
CharOpenHashSet(char[] 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. |
CharOpenHashSet(char[] a,
int offset,
int length,
float f)
Creates a new hash set and fills it with the elements of a given array.
|
CharOpenHashSet(CharCollection c)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load
factor copying a given type-specific collection. |
CharOpenHashSet(CharCollection c,
float f)
Creates a new hash set copying a given type-specific collection.
|
CharOpenHashSet(CharIterator i)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load
factor using elements provided by a type-specific iterator. |
CharOpenHashSet(CharIterator i,
float f)
Creates a new hash set using elements provided by a type-specific
iterator.
|
CharOpenHashSet(Collection<? extends Character> c)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load
factor copying a given collection. |
CharOpenHashSet(Collection<? extends Character> c,
float f)
Creates a new hash set copying a given collection.
|
CharOpenHashSet(int expected)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load
factor. |
CharOpenHashSet(int expected,
float f)
Creates a new hash set.
|
CharOpenHashSet(Iterator<?> i)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load
factor using elements provided by an iterator. |
CharOpenHashSet(Iterator<?> i,
float f)
Creates a new hash set using elements provided by an iterator.
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
add(char k) |
boolean |
addAll(CharCollection c)
Adds all elements of the given type-specific collection to this
collection.
|
boolean |
addAll(Collection<? extends Character> c)
Adds all elements of the given collection to this collection.
|
void |
clear() |
CharOpenHashSet |
clone()
Returns a deep copy of this set.
|
boolean |
contains(char 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() |
CharIterator |
iterator()
Returns a type-specific iterator on the elements of this collection.
|
boolean |
rehash()
Deprecated.
A no-op.
|
boolean |
rem(char k)
|
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, removeadd, charIterator, contains, containsAll, containsAll, rem, remove, removeAll, removeAll, retainAll, retainAll, toArray, toArray, toArray, toCharArray, toCharArray, toStringcharIterator, containsAll, removeAll, retainAll, toArray, toArray, toCharArray, toCharArrayadd, contains, containsAll, remove, removeAll, retainAll, spliterator, toArray, toArrayparallelStream, removeIf, streampublic CharOpenHashSet(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 CharOpenHashSet(int expected)
Hash.DEFAULT_LOAD_FACTOR as load
factor.expected - the expected number of elements in the hash set.public CharOpenHashSet()
Hash.DEFAULT_INITIAL_SIZE elements and
Hash.DEFAULT_LOAD_FACTOR as load factor.public CharOpenHashSet(Collection<? extends Character> c, float f)
c - a Collection to be copied into the new hash set.f - the load factor.public CharOpenHashSet(Collection<? extends Character> c)
Hash.DEFAULT_LOAD_FACTOR as load
factor copying a given collection.c - a Collection to be copied into the new hash set.public CharOpenHashSet(CharCollection c, float f)
c - a type-specific collection to be copied into the new hash set.f - the load factor.public CharOpenHashSet(CharCollection 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 CharOpenHashSet(CharIterator i, float f)
i - a type-specific iterator whose elements will fill the set.f - the load factor.public CharOpenHashSet(CharIterator 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 CharOpenHashSet(Iterator<?> i, float f)
i - an iterator whose elements will fill the set.f - the load factor.public CharOpenHashSet(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 CharOpenHashSet(char[] 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 CharOpenHashSet(char[] 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 CharOpenHashSet(char[] a,
float f)
a - an array to be copied into the new hash set.f - the load factor.public CharOpenHashSet(char[] 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(CharCollection c)
addAll 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)
addAll in interface Collection<Character>addAll in interface Set<Character>addAll in class AbstractCharCollectionc - a collection.true if this collection changed as a result of the
call.public boolean add(char k)
add in interface CharCollectionadd in class AbstractCharCollectionCollection.add(Object)public boolean rem(char k)
CharCollectionremove(), but the clash with
the similarly named index-based method in the List
interface forces us to use a distinguished name. For simplicity, the set
interfaces reinstates remove().rem in interface CharCollectionrem in class AbstractCharCollectionCollection.remove(Object)public boolean contains(char k)
contains in interface CharCollectioncontains in class AbstractCharCollectionCollection.contains(Object)public void clear()
clear in interface Collection<Character>clear in interface Set<Character>clear in class AbstractCollection<Character>public int size()
size in interface Collection<Character>size in interface Set<Character>size in class AbstractCollection<Character>public boolean isEmpty()
isEmpty in interface Collection<Character>isEmpty in interface Set<Character>isEmpty in class AbstractCharCollection@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 CharIterator iterator()
CharCollection
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 CharCollectioniterator in interface CharIterableiterator in interface CharSetiterator in interface Iterable<Character>iterator in interface Collection<Character>iterator in interface Set<Character>iterator in class AbstractCharSet@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 CharOpenHashSet 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 AbstractCharSet