@Generated(date="2015-05-05T11:00:02+0200", value="KTypeHashSet.java") public class DoubleHashSet extends java.lang.Object implements DoubleLookupContainer, DoubleSet, Preallocable, java.lang.Cloneable
double
s, implemented using using open addressing
with linear probing for collision resolution.
Note: read about important differences between hash and scatter sets.
DoubleScatterSet
,
HPPC interfaces diagramModifier and Type | Class and Description |
---|---|
protected class |
DoubleHashSet.EntryIterator
An iterator implementation for
iterator() . |
Modifier and Type | Field and Description |
---|---|
protected int |
assigned
The number of stored keys (assigned key slots), excluding the special
"empty" key, if any.
|
protected boolean |
hasEmptyKey
Special treatment for the "empty slot" key marker.
|
protected int |
keyMixer
We perturb hash values with a container-unique
seed to avoid problems with nearly-sorted-by-hash
values on iterations.
|
double[] |
keys
The hash array holding keys.
|
protected double |
loadFactor
The load factor for
keys . |
protected int |
mask
Mask for slot scans in
keys . |
protected HashOrderMixingStrategy |
orderMixer
Per-instance hash order mixing strategy.
|
protected int |
resizeAt
|
Constructor and Description |
---|
DoubleHashSet()
New instance with sane defaults.
|
DoubleHashSet(DoubleContainer container)
New instance copying elements from another
DoubleContainer . |
DoubleHashSet(int expectedElements)
New instance with sane defaults.
|
DoubleHashSet(int expectedElements,
double loadFactor)
New instance with sane defaults.
|
DoubleHashSet(int expectedElements,
double loadFactor,
HashOrderMixingStrategy orderMixer)
New instance with the provided defaults.
|
Modifier and Type | Method and Description |
---|---|
boolean |
add(double key)
Adds
k to the set. |
int |
addAll(double... elements)
Adds all elements from the given list (vararg) to this set.
|
int |
addAll(DoubleContainer container)
Adds all elements from the given
DoubleContainer to this set. |
int |
addAll(java.lang.Iterable<? extends DoubleCursor> iterable)
Adds all elements from the given iterable to this set.
|
protected void |
allocateBuffers(int arraySize)
Allocate new internal buffers.
|
protected void |
allocateThenInsertThenRehash(int slot,
double pendingKey)
This method is invoked when there is a new key to be inserted into
the buffer but there is not enough empty slots to do so.
|
void |
clear()
Removes all elements from this collection.
|
DoubleHashSet |
clone() |
boolean |
contains(double key)
Lookup a given element in the container.
|
void |
ensureCapacity(int expectedElements)
Ensure this container can hold at least the
given number of elements without resizing its buffers.
|
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 . |
int |
hashCode() |
protected int |
hashKey(double key)
Returns a hash code for the given key.
|
boolean |
indexExists(int index) |
double |
indexGet(int index)
Returns the exact value of the existing key.
|
void |
indexInsert(int index,
double key)
Inserts a key for an index that is not present in the set.
|
int |
indexOf(double key)
Returns a logical "index" of a given key that can be used to speed up
follow-up logic in certain scenarios (conditional logic).
|
double |
indexReplace(int index,
double equivalentKey)
Replaces the existing equivalent key with the given one and returns any previous value
stored for that key.
|
boolean |
isEmpty()
Shortcut for
size() == 0 . |
java.util.Iterator<DoubleCursor> |
iterator()
Returns an iterator to a cursor traversing the collection.
|
protected void |
rehash(double[] fromKeys)
Rehash from old buffers to new buffers.
|
void |
release()
Removes all elements from the collection and additionally releases any
internal buffers.
|
boolean |
remove(double key)
An alias for the (preferred)
removeAll(double) . |
int |
removeAll(double key)
Removes all occurrences of
e from this collection. |
int |
removeAll(DoubleLookupContainer c)
Default implementation uses a predicate for removal.
|
int |
removeAll(DoublePredicate predicate)
Removes all elements in this collection for which the given predicate
returns
true . |
int |
retainAll(DoubleLookupContainer c)
Default implementation uses a predicate for retaining.
|
int |
retainAll(DoublePredicate predicate)
Default implementation redirects to
DoubleCollection.removeAll(DoublePredicate) and
negates the predicate. |
protected void |
shiftConflictingKeys(int gapSlot)
Shift all the slot-conflicting keys allocated to (and including)
slot . |
int |
size()
Return the current number of elements in this container.
|
double[] |
toArray()
Default implementation of copying to an array.
|
java.lang.String |
toString()
Convert the contents of this container to a human-friendly string.
|
protected double |
verifyLoadFactor(double loadFactor)
Validate load factor range and return it.
|
finalize, getClass, notify, notifyAll, wait, wait, wait
removeAll, retainAll, retainAll
public double[] keys
protected int assigned
size()
,
hasEmptyKey
protected int mask
keys
.protected int keyMixer
hashKey(double)
,
"http://issues.carrot2.org/browse/HPPC-80",
"http://issues.carrot2.org/browse/HPPC-103"protected int resizeAt
protected boolean hasEmptyKey
protected double loadFactor
keys
.protected HashOrderMixingStrategy orderMixer
keyMixer
public DoubleHashSet()
public DoubleHashSet(int expectedElements)
public DoubleHashSet(int expectedElements, double loadFactor)
public DoubleHashSet(int expectedElements, double loadFactor, HashOrderMixingStrategy orderMixer)
expectedElements
- The expected number of elements guaranteed not to cause a rehash (inclusive).loadFactor
- The load factor for internal buffers. Insane load factors (zero, full capacity)
are rejected by verifyLoadFactor(double)
.orderMixer
- Hash key order mixing strategy. See HashOrderMixing
for predefined
implementations. Use constant mixers only if you understand the potential
consequences.public DoubleHashSet(DoubleContainer container)
DoubleContainer
.public boolean add(double key)
k
to the set.public final int addAll(double... elements)
public int addAll(DoubleContainer container)
DoubleContainer
to this set.public int addAll(java.lang.Iterable<? extends DoubleCursor> iterable)
public double[] toArray()
toArray
in interface DoubleContainer
public boolean remove(double key)
removeAll(double)
.public int removeAll(double key)
e
from this collection.removeAll
in interface DoubleCollection
key
- Element to be removed from this collection, if present.public int removeAll(DoublePredicate predicate)
true
.removeAll
in interface DoubleCollection
public boolean contains(double key)
contains
in interface DoubleContainer
contains
in interface DoubleLookupContainer
true
if this container has an element equal to
e
.public void clear()
clear
in interface DoubleCollection
DoubleCollection.release()
public void release()
DoubleCollection.clear()
should be a better alternative since it'll avoid
reallocation.release
in interface DoubleCollection
DoubleCollection.clear()
public boolean isEmpty()
size() == 0
.isEmpty
in interface DoubleContainer
public void ensureCapacity(int expectedElements)
ensureCapacity
in interface Preallocable
expectedElements
- The total number of elements, inclusive.public int size()
O(n)
time, although
implementing classes should try to maintain the current size and return in
constant time.size
in interface DoubleContainer
public int hashCode()
hashCode
in class java.lang.Object
public boolean equals(java.lang.Object obj)
equals
in class java.lang.Object
public DoubleHashSet clone()
clone
in class java.lang.Object
public java.util.Iterator<DoubleCursor> 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 DoubleContainer
iterator
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 DoubleContainer
public <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 DoubleContainer
public static DoubleHashSet from(double... elements)
double
. The elements are copied from the argument to the
internal buffer.protected int hashKey(double key)
keyMixer
to differentiate hash order of keys between hash containers. Helps
alleviate problems resulting from linear conflict resolution in open
addressing.
The output from this function should evenly distribute keys across the
entire integer range.public int indexOf(double key)
key
- The key to locate in the set.indexExists(int)
,
indexGet(int)
,
indexInsert(int, double)
,
indexReplace(int, double)
public boolean indexExists(int index)
index
- The index of a given key, as returned from indexOf(double)
.true
if the index corresponds to an existing key
or false otherwise. This is equivalent to checking whether the index is
a positive value (existing keys) or a negative value (non-existing keys).indexOf(double)
public double indexGet(int index)
index
- The index of an existing key.java.lang.AssertionError
- If assertions are enabled and the index does
not correspond to an existing key.indexOf(double)
public double indexReplace(int index, double equivalentKey)
index
- The index of an existing key.equivalentKey
- The key to put in the set as a replacement. Must be equivalent to
the key currently stored at the provided index.java.lang.AssertionError
- If assertions are enabled and the index does
not correspond to an existing key.indexOf(double)
public void indexInsert(int index, double key)
index
- The index of a previously non-existing key, as returned from
indexOf(double)
.java.lang.AssertionError
- If assertions are enabled and the index does
not correspond to an existing key.indexOf(double)
protected double verifyLoadFactor(double loadFactor)
protected void rehash(double[] fromKeys)
protected void allocateBuffers(int arraySize)
protected void allocateThenInsertThenRehash(int slot, double pendingKey)
protected void shiftConflictingKeys(int gapSlot)
slot
.public int removeAll(DoubleLookupContainer c)
removeAll
in interface DoubleCollection
public int retainAll(DoubleLookupContainer c)
retainAll
in interface DoubleCollection
public int retainAll(DoublePredicate predicate)
DoubleCollection.removeAll(DoublePredicate)
and
negates the predicate.retainAll
in interface DoubleCollection
public java.lang.String toString()
toString
in class java.lang.Object
Copyright © 2015 Carrot Search s.c.. All Rights Reserved.