@Generated(date="2015-05-07T09:33:04+0200",
value="KTypeScatterSet.java")
public class DoubleScatterSet
extends DoubleHashSet
DoubleHashSet but does not implement per-instance key mixing
strategy and uses a simpler (faster) bit distribution function.
Note: read about important differences between hash and scatter sets.
DoubleHashSet,
HPPC interfaces diagramDoubleHashSet.EntryIteratorassigned, hasEmptyKey, keyMixer, keys, loadFactor, mask, orderMixer, resizeAt| Constructor and Description |
|---|
DoubleScatterSet()
New instance with sane defaults.
|
DoubleScatterSet(int expectedElements)
New instance with sane defaults.
|
DoubleScatterSet(int expectedElements,
double loadFactor)
New instance with sane defaults.
|
| Modifier and Type | Method and Description |
|---|---|
static DoubleScatterSet |
from(double... elements)
Create a set from a variable number of arguments or an array of
double. |
protected int |
hashKey(double key)
Returns a hash code for the given key.
|
int |
removeAll(DoubleLookupContainer c)
Default implementation uses a predicate for removal.
|
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. |
java.lang.String |
toString()
Convert the contents of this container to a human-friendly string.
|
add, addAll, addAll, addAll, allocateBuffers, allocateThenInsertThenRehash, clear, clone, contains, ensureCapacity, equals, forEach, forEach, hashCode, indexExists, indexGet, indexInsert, indexOf, indexReplace, isEmpty, iterator, rehash, release, remove, removeAll, removeAll, shiftConflictingKeys, size, toArray, verifyLoadFactor, visualizeKeyDistributionfinalize, getClass, notify, notifyAll, wait, wait, waitremoveAll, retainAll, retainAllpublic DoubleScatterSet()
public DoubleScatterSet(int expectedElements)
public DoubleScatterSet(int expectedElements,
double loadFactor)
protected int hashKey(double key)
DoubleHashSetDoubleHashSet.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.hashKey in class DoubleHashSetpublic static DoubleScatterSet from(double... elements)
double. The elements are copied from the argument to the
internal buffer.public int removeAll(DoubleLookupContainer c)
removeAll in interface DoubleCollectionpublic int retainAll(DoubleLookupContainer c)
retainAll in interface DoubleCollectionpublic int retainAll(DoublePredicate predicate)
DoubleCollection.removeAll(DoublePredicate) and
negates the predicate.retainAll in interface DoubleCollectionpublic java.lang.String toString()
toString in class java.lang.ObjectCopyright © 2015 Carrot Search s.c.. All Rights Reserved.