public class CharOpenHashSet extends AbstractCharSet implements java.io.Serializable, java.lang.Cloneable, it.unimi.dsi.fastutil.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 Form| Modifier and Type | Field and Description |
|---|---|
protected boolean |
containsNull
Whether this set contains the null key.
|
protected float |
f
The acceptable load factor.
|
protected char[] |
key
The array of keys.
|
protected int |
mask
The mask for wrapping a position counter.
|
protected int |
maxFill
Threshold after which we rehash.
|
protected int |
minN
We never resize below this threshold, which is the construction-time {#n}.
|
protected int |
n
The current table size.
|
protected int |
size
Number of entries in the set (including the null key, if present).
|
| 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(it.unimi.dsi.fastutil.chars.CharCollection c)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor
copying a given type-specific collection. |
CharOpenHashSet(it.unimi.dsi.fastutil.chars.CharCollection c,
float f)
Creates a new hash set copying a given type-specific collection.
|
CharOpenHashSet(it.unimi.dsi.fastutil.chars.CharIterator i)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor using elements provided by a type-specific iterator. |
CharOpenHashSet(it.unimi.dsi.fastutil.chars.CharIterator i,
float f)
Creates a new hash set using elements provided by a type-specific iterator.
|
CharOpenHashSet(java.util.Collection<? extends java.lang.Character> c)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor
copying a given collection. |
CharOpenHashSet(java.util.Collection<? extends java.lang.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(java.util.Iterator<?> i)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor using elements provided by an iterator. |
CharOpenHashSet(java.util.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(it.unimi.dsi.fastutil.chars.CharCollection c) |
boolean |
addAll(java.util.Collection<? extends java.lang.Character> c) |
void |
clear() |
CharOpenHashSet |
clone()
Returns a deep copy of this set.
|
boolean |
contains(char k) |
void |
ensureCapacity(int capacity)
Ensures that this set can hold a certain number of elements without rehashing.
|
void |
forEach(it.unimi.dsi.fastutil.chars.CharConsumer action) |
int |
hashCode()
Returns a hash code for this set.
|
boolean |
isEmpty() |
it.unimi.dsi.fastutil.chars.CharIterator |
iterator()
Returns a type-specific iterator on the elements of this set.
|
static CharOpenHashSet |
of()
Creates a new empty hash set.
|
static CharOpenHashSet |
of(char... a)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor
using a list of elements. |
static CharOpenHashSet |
of(char e)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor
using the given element. |
static CharOpenHashSet |
of(char e0,
char e1)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor
using the elements given. |
static CharOpenHashSet |
of(char e0,
char e1,
char e2)
Creates a new hash set with
Hash.DEFAULT_LOAD_FACTOR as load factor
using the elements given. |
protected void |
rehash(int newN)
Rehashes the set.
|
boolean |
remove(char k)
Removes an element from this set.
|
protected void |
shiftKeys(int pos)
Shifts left entries with the specified hash code, starting at the specified position,
and empties the resulting free entry.
|
int |
size() |
it.unimi.dsi.fastutil.chars.CharSpliterator |
spliterator()
Returns a type-specific spliterator on the elements of this set.
|
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, containsAll, remove, removeAll, removeAll, retainAll, retainAll, toArray, toCharArray, toCharArray, toStringfinalize, getClass, notify, notifyAll, wait, wait, waitprotected transient char[] key
protected transient int mask
protected transient boolean containsNull
protected transient int n
protected transient int maxFill
f.protected final transient int minN
protected int size
protected final float f
public 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(java.util.Collection<? extends java.lang.Character> c,
float f)
c - a Collection to be copied into the new hash set.f - the load factor.public CharOpenHashSet(java.util.Collection<? extends java.lang.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(it.unimi.dsi.fastutil.chars.CharCollection c,
float f)
c - a type-specific collection to be copied into the new hash set.f - the load factor.public CharOpenHashSet(it.unimi.dsi.fastutil.chars.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(it.unimi.dsi.fastutil.chars.CharIterator i,
float f)
i - a type-specific iterator whose elements will fill the set.f - the load factor.public CharOpenHashSet(it.unimi.dsi.fastutil.chars.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(java.util.Iterator<?> i,
float f)
i - an iterator whose elements will fill the set.f - the load factor.public CharOpenHashSet(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 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 static CharOpenHashSet of()
public static CharOpenHashSet of(char e)
Hash.DEFAULT_LOAD_FACTOR as load factor
using the given element.public static CharOpenHashSet of(char e0, char e1)
Hash.DEFAULT_LOAD_FACTOR as load factor
using the elements given.public static CharOpenHashSet of(char e0, char e1, char e2)
Hash.DEFAULT_LOAD_FACTOR as load factor
using the elements given.public static CharOpenHashSet of(char... a)
Hash.DEFAULT_LOAD_FACTOR as load factor
using a list of elements.of in interface CharSeta - a list of elements that will be used to initialize the new hash set.Hash.DEFAULT_LOAD_FACTOR as load factor containing the elements of a.java.lang.IllegalArgumentException - if a duplicate entry was encountered.public void ensureCapacity(int capacity)
capacity - a number of elements; there will be no rehashing unless
the set size exceeds this number.public boolean addAll(it.unimi.dsi.fastutil.chars.CharCollection c)
addAll in interface it.unimi.dsi.fastutil.chars.CharCollectionaddAll in class it.unimi.dsi.fastutil.chars.AbstractCharCollectionpublic boolean addAll(java.util.Collection<? extends java.lang.Character> c)
addAll in interface java.util.Collection<java.lang.Character>addAll in interface java.util.Set<java.lang.Character>addAll in class it.unimi.dsi.fastutil.chars.AbstractCharCollectionpublic boolean add(char k)
add in interface it.unimi.dsi.fastutil.chars.CharCollectionadd in class it.unimi.dsi.fastutil.chars.AbstractCharCollectionprotected final void shiftKeys(int pos)
pos - a starting position.public boolean remove(char k)
AbstractCharSetrem() method
implemented by type-specific abstract Collection superclass.remove in interface CharSetremove in class AbstractCharSetCollection.remove(Object)public boolean contains(char k)
contains in interface it.unimi.dsi.fastutil.chars.CharCollectioncontains in class it.unimi.dsi.fastutil.chars.AbstractCharCollectionpublic void clear()
clear in interface java.util.Collection<java.lang.Character>clear in interface java.util.Set<java.lang.Character>clear in class java.util.AbstractCollection<java.lang.Character>public int size()
size in interface java.util.Collection<java.lang.Character>size in interface java.util.Set<java.lang.Character>size in class java.util.AbstractCollection<java.lang.Character>public boolean isEmpty()
isEmpty in interface java.util.Collection<java.lang.Character>isEmpty in interface java.util.Set<java.lang.Character>isEmpty in class java.util.AbstractCollection<java.lang.Character>public it.unimi.dsi.fastutil.chars.CharIterator iterator()
CharSetiterator in interface it.unimi.dsi.fastutil.chars.CharCollectioniterator in interface it.unimi.dsi.fastutil.chars.CharIterableiterator in interface CharSetiterator in interface java.lang.Iterable<java.lang.Character>iterator in interface java.util.Collection<java.lang.Character>iterator in interface java.util.Set<java.lang.Character>iterator in class AbstractCharSetpublic it.unimi.dsi.fastutil.chars.CharSpliterator spliterator()
CharSetSet spliterators must report at least Spliterator.DISTINCT.
See Set.spliterator() for more documentation on the requirements
of the returned spliterator.
spliterator in interface it.unimi.dsi.fastutil.chars.CharCollectionspliterator in interface it.unimi.dsi.fastutil.chars.CharIterablespliterator in interface CharSetspliterator in interface java.lang.Iterable<java.lang.Character>spliterator in interface java.util.Collection<java.lang.Character>spliterator in interface java.util.Set<java.lang.Character>public void forEach(it.unimi.dsi.fastutil.chars.CharConsumer action)
forEach in interface it.unimi.dsi.fastutil.chars.CharIterablepublic 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()protected void rehash(int newN)
This method implements the basic rehashing strategy, and may be overriden by subclasses implementing different rehashing strategies (e.g., disk-based rehashing). However, you should not override this method unless you understand the internal workings of this class.
newN - the new sizepublic 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.
clone in class java.lang.Objectpublic 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.Character>hashCode in interface java.util.Set<java.lang.Character>hashCode in class AbstractCharSet