@Generated(date="2017-07-11T19:16:33+0200",
value="KTypeHashSet.java")
public class DoubleHashSet
extends AbstractDoubleCollection
implements DoubleLookupContainer, DoubleSet, java.lang.Cloneable
doubles, 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 |
DoubleHashSet.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<DoubleCursor,DoubleHashSet.EntryIterator> |
entryIteratorPool
internal pool of EntryIterator
|
double[] |
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 |
|---|
DoubleHashSet()
Default constructor: Creates a hash set with the default capacity of
Containers.DEFAULT_EXPECTED_ELEMENTS,
load factor of HashContainers.DEFAULT_LOAD_FACTOR. |
DoubleHashSet(DoubleContainer container)
Creates a hash set from elements of another container.
|
DoubleHashSet(int initialCapacity)
Creates a hash set with the given capacity,
load factor of
HashContainers.DEFAULT_LOAD_FACTOR. |
DoubleHashSet(int initialCapacity,
double loadFactor)
Creates a hash set with the given capacity and load factor.
|
| Modifier and Type | Method and Description |
|---|---|
int |
add(double... elements)
Vararg-signature method for adding elements to this set.
|
boolean |
add(double key)
Adds
k to the set. |
int |
add(double e1,
double e2)
Adds two elements to the set.
|
int |
addAll(DoubleContainer container)
Adds all elements from a given container to this set.
|
int |
addAll(java.lang.Iterable<? extends DoubleCursor> 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.
|
DoubleHashSet |
clone() |
boolean |
contains(double key)
Lookup a given element in the container.
|
boolean |
equals(java.lang.Object obj) |
<T extends DoublePredicate> |
forEach(T predicate)
Applies a
predicate to container elements, as long as the predicate
returns true. |
<T extends DoubleProcedure> |
forEach(T procedure)
Applies a
procedure to all container elements. |
static DoubleHashSet |
from(double... elements)
Create a set from a variable number of arguments or an array of
double. |
static DoubleHashSet |
from(DoubleContainer container)
Create a set from elements of another container.
|
int |
hashCode() |
DoubleHashSet.EntryIterator |
iterator()
Returns an iterator to a cursor traversing the collection.
|
static DoubleHashSet |
newInstance()
Create a new hash set with default parameters (shortcut
instead of using a constructor).
|
static DoubleHashSet |
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(double key)
Remove all elements of the set matching key.
|
int |
removeAll(double key)
Removes all occurrences of
e from this collection. |
int |
removeAll(DoublePredicate 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.
|
double[] |
toArray(double[] 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 double[] 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<DoubleCursor,DoubleHashSet.EntryIterator> entryIteratorPool
public DoubleHashSet()
Containers.DEFAULT_EXPECTED_ELEMENTS,
load factor of HashContainers.DEFAULT_LOAD_FACTOR.public DoubleHashSet(int initialCapacity)
HashContainers.DEFAULT_LOAD_FACTOR.public DoubleHashSet(int initialCapacity,
double loadFactor)
public DoubleHashSet(DoubleContainer container)
public boolean add(double key)
k to the set.public int add(double e1,
double e2)
public int add(double... elements)
This method is handy, but costly if used in tight loops (anonymous array passing)
public int addAll(DoubleContainer container)
public int addAll(java.lang.Iterable<? extends DoubleCursor> iterable)
public int removeAll(double key)
e from this collection.removeAll in interface DoubleCollectionkey - Element to be removed from this collection, if present.public boolean remove(double key)
DoubleCollection.removeAll(key) > 0remove in interface DoubleSetDoubleCollection.removeAll(double)public boolean contains(double key)
contains in interface DoubleContainercontains in interface DoubleLookupContainertrue if this container has an element
equal to e.public void clear()
Does not release internal buffers.
clear in interface DoubleCollectionpublic int size()
O(n) time, although implementing classes
should try to maintain the current size and return in constant time.size in interface DoubleContainerpublic int capacity()
O(n) time.capacity in interface DoubleContainerpublic int hashCode()
hashCode in class java.lang.Objectpublic boolean equals(java.lang.Object obj)
equals in class java.lang.Objectpublic DoubleHashSet.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 (DoubleCursor<double> c : container) {
System.out.println("index=" + c.index + " value=" + c.value);
}
iterator in interface DoubleContaineriterator in interface java.lang.Iterable<DoubleCursor>public <T extends DoubleProcedure> T forEach(T procedure)
procedure to all container elements. Returns the argument (any
subclass of DoubleProcedure. 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 DoubleContainerpublic double[] toArray(double[] target)
toArray in interface DoubleContainertoArray in class AbstractDoubleCollectiontarget - The target array must be large enough to hold all elements, i.e >= DoubleContainer.size().public DoubleHashSet clone()
clone in class java.lang.Objectpublic <T extends DoublePredicate> T forEach(T predicate)
predicate to container elements, as long as the predicate
returns true. The iteration is interrupted otherwise.forEach in interface DoubleContainerpublic int removeAll(DoublePredicate predicate)
true.removeAll in interface DoubleCollectionpublic static DoubleHashSet from(double... elements)
double.public static DoubleHashSet from(DoubleContainer container)
public static DoubleHashSet newInstance()
public static DoubleHashSet newInstance(int initialCapacity, double loadFactor)
Copyright © 2017. All rights reserved.