@Generated(date="2017-07-11T19:16:33+0200",
value="KTypeHashSet.java")
public class CharHashSet
extends AbstractCharCollection
implements CharLookupContainer, CharSet, java.lang.Cloneable
chars, implemented using using open
addressing with linear probing for collision resolution.
The internal buffers of this implementation (keys, etc...)
are always allocated to the nearest size that is a power of two. When
the capacity exceeds the given load factor, the buffer size is doubled.
| Modifier and Type | Class and Description |
|---|---|
class |
CharHashSet.EntryIterator
An iterator implementation for
iterator(). |
| Modifier and Type | Field and Description |
|---|---|
boolean |
allocatedDefaultKey
True if key = 0/null is in the map.
|
protected int |
assigned
Cached number of assigned slots in
keys. |
protected IteratorPool<CharCursor,CharHashSet.EntryIterator> |
entryIteratorPool
internal pool of EntryIterator
|
char[] |
keys
Hash-indexed array holding all set entries.
|
protected double |
loadFactor
The load factor for this map (fraction of allocated slots
before the buffers must be rehashed or reallocated).
|
containsNegateTestPredicate, containsTestPredicate, negatePredicate, testContainer, testPredicate| Constructor and Description |
|---|
CharHashSet()
Default constructor: Creates a hash set with the default capacity of
Containers.DEFAULT_EXPECTED_ELEMENTS,
load factor of HashContainers.DEFAULT_LOAD_FACTOR. |
CharHashSet(CharContainer container)
Creates a hash set from elements of another container.
|
CharHashSet(int initialCapacity)
Creates a hash set with the given capacity,
load factor of
HashContainers.DEFAULT_LOAD_FACTOR. |
CharHashSet(int initialCapacity,
double loadFactor)
Creates a hash set with the given capacity and load factor.
|
| Modifier and Type | Method and Description |
|---|---|
int |
add(char... elements)
Vararg-signature method for adding elements to this set.
|
boolean |
add(char key)
Adds
k to the set. |
int |
add(char e1,
char e2)
Adds two elements to the set.
|
int |
addAll(CharContainer container)
Adds all elements from a given container to this set.
|
int |
addAll(java.lang.Iterable<? extends CharCursor> iterable)
Adds all elements from a given iterable to this set.
|
int |
capacity()
Return the maximum number of elements this container is guaranteed to hold without reallocating.
|
void |
clear()
Removes all elements from this collection.
|
CharHashSet |
clone() |
boolean |
contains(char key)
Lookup a given element in the container.
|
boolean |
equals(java.lang.Object obj) |
<T extends CharPredicate> |
forEach(T predicate)
Applies a
predicate to container elements, as long as the predicate
returns true. |
<T extends CharProcedure> |
forEach(T procedure)
Applies a
procedure to all container elements. |
static CharHashSet |
from(char... elements)
Create a set from a variable number of arguments or an array of
char. |
static CharHashSet |
from(CharContainer container)
Create a set from elements of another container.
|
int |
hashCode() |
CharHashSet.EntryIterator |
iterator()
Returns an iterator to a cursor traversing the collection.
|
static CharHashSet |
newInstance()
Create a new hash set with default parameters (shortcut
instead of using a constructor).
|
static CharHashSet |
newInstance(int initialCapacity,
double loadFactor)
Returns a new object of this class with no need to declare generic type (shortcut
instead of using a constructor).
|
boolean |
remove(char key)
Remove all elements of the set matching key.
|
int |
removeAll(char key)
Removes all occurrences of
e from this collection. |
int |
removeAll(CharPredicate predicate)
Removes all elements in this collection for which the
given predicate returns
true. |
int |
size()
Return the current number of elements in this container.
|
char[] |
toArray(char[] target)
Default implementation for:
Copies all elements of this container to an existing array of the same type.
|
isEmpty, removeAll, retainAll, retainAll, toArray, toStringfinalize, getClass, notify, notifyAll, wait, wait, waitremoveAll, retainAll, retainAllisEmpty, toArraypublic char[] keys
Direct set iteration: iterate {keys[i]} for i in [0; keys.length[ where keys[i] != 0/null, then also
{0/null} is in the set if allocatedDefaultKey = true.
public boolean allocatedDefaultKey
protected int assigned
keys.protected final double loadFactor
protected final IteratorPool<CharCursor,CharHashSet.EntryIterator> entryIteratorPool
public CharHashSet()
Containers.DEFAULT_EXPECTED_ELEMENTS,
load factor of HashContainers.DEFAULT_LOAD_FACTOR.public CharHashSet(int initialCapacity)
HashContainers.DEFAULT_LOAD_FACTOR.public CharHashSet(int initialCapacity,
double loadFactor)
public CharHashSet(CharContainer container)
public boolean add(char key)
k to the set.public int add(char e1,
char e2)
public int add(char... elements)
This method is handy, but costly if used in tight loops (anonymous array passing)
public int addAll(CharContainer container)
public int addAll(java.lang.Iterable<? extends CharCursor> iterable)
public int removeAll(char key)
e from this collection.removeAll in interface CharCollectionkey - Element to be removed from this collection, if present.public boolean remove(char key)
CharCollection.removeAll(key) > 0remove in interface CharSetCharCollection.removeAll(char)public boolean contains(char key)
contains in interface CharContainercontains in interface CharLookupContainertrue if this container has an element
equal to e.public void clear()
Does not release internal buffers.
clear in interface CharCollectionpublic int size()
O(n) time, although implementing classes
should try to maintain the current size and return in constant time.size in interface CharContainerpublic int capacity()
O(n) time.capacity in interface CharContainerpublic int hashCode()
hashCode in class java.lang.Objectpublic boolean equals(java.lang.Object obj)
equals in class java.lang.Objectpublic CharHashSet.EntryIterator iterator()
The iterator is implemented as a
cursor and it returns the same cursor instance on every call to
Iterator.next() (to avoid boxing of primitive types). To read the current
list's value (or index in the list) use the cursor's public fields. An example is
shown below.
for (CharCursor<char> c : container) {
System.out.println("index=" + c.index + " value=" + c.value);
}
iterator in interface CharContaineriterator in interface java.lang.Iterable<CharCursor>public <T extends CharProcedure> T forEach(T procedure)
procedure to all container elements. Returns the argument (any
subclass of CharProcedure. This lets the caller to call methods of the argument
by chaining the call (even if the argument is an anonymous type) to retrieve computed values,
for example (IntContainer):
int count = container.forEach(new IntProcedure() {
int count; // this is a field declaration in an anonymous class.
public void apply(int value) { count++; }}).count;
forEach in interface CharContainerpublic char[] toArray(char[] target)
toArray in interface CharContainertoArray in class AbstractCharCollectiontarget - The target array must be large enough to hold all elements, i.e >= CharContainer.size().public CharHashSet clone()
clone in class java.lang.Objectpublic <T extends CharPredicate> T forEach(T predicate)
predicate to container elements, as long as the predicate
returns true. The iteration is interrupted otherwise.forEach in interface CharContainerpublic int removeAll(CharPredicate predicate)
true.removeAll in interface CharCollectionpublic static CharHashSet from(char... elements)
char.public static CharHashSet from(CharContainer container)
public static CharHashSet newInstance()
public static CharHashSet newInstance(int initialCapacity, double loadFactor)
Copyright © 2017. All rights reserved.