@Generated(date="2016-02-06T03:13:45+0000", value="HPPC generated from: IntOpenHashSet.java") public class IntOpenHashSet extends java.lang.Object implements IntLookupContainer, IntSet, java.lang.Cloneable
int
s, implemented using using open
addressing with linear probing for collision resolution.
The internal buffers of this implementation (keys
), allocated
)
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.
See ObjectOpenHashSet
class for API similarities and differences against Java
Collections.
Important node. The implementation uses power-of-two tables and linear
probing, which may cause poor performance (many collisions) if hash values are
not properly distributed.
This implementation uses MurmurHash3
for rehashing keys.
Modifier and Type | Field and Description |
---|---|
boolean[] |
allocated
Information if an entry (slot) in the
keys table is allocated
or empty. |
int |
assigned
Cached number of assigned slots in
allocated . |
static int |
DEFAULT_CAPACITY
Default capacity.
|
static float |
DEFAULT_LOAD_FACTOR
Default load factor.
|
int[] |
keys
Hash-indexed array holding all set entries.
|
protected int |
lastSlot
The most recent slot accessed in
contains(int) . |
float |
loadFactor
The load factor for this map (fraction of allocated slots
before the buffers must be rehashed or reallocated).
|
static int |
MIN_CAPACITY
Minimum capacity for the map.
|
protected int |
perturbation
We perturb hashed values with the array size to avoid problems with
nearly-sorted-by-hash values on iterations.
|
protected int |
resizeAt
Resize buffers when
allocated hits this value. |
Constructor and Description |
---|
IntOpenHashSet()
|
IntOpenHashSet(int initialCapacity)
Creates a hash set with the given capacity,
load factor of 0.75f.
|
IntOpenHashSet(IntContainer container)
Creates a hash set from elements of another container.
|
IntOpenHashSet(int initialCapacity,
float loadFactor)
Creates a hash set with the given capacity and load factor.
|
Modifier and Type | Method and Description |
---|---|
int |
add(int... elements)
Vararg-signature method for adding elements to this set.
|
boolean |
add(int e)
Adds
k to the set. |
int |
add(int e1,
int e2)
Adds two elements to the set.
|
int |
addAll(IntContainer container)
Adds all elements from a given container to this set.
|
int |
addAll(java.lang.Iterable<? extends IntCursor> iterable)
Adds all elements from a given iterable to this set.
|
void |
clear()
Removes all elements from this collection.
|
IntOpenHashSet |
clone() |
protected int |
computePerturbationValue(int capacity)
Compute the key perturbation value applied before hashing.
|
boolean |
contains(int key)
Lookup a given element in the container.
|
boolean |
equals(java.lang.Object obj)
Compares the specified object with this set for equality.
|
<T extends IntPredicate> |
forEach(T predicate)
Applies a
predicate to container elements as long, as the predicate
returns true . |
<T extends IntProcedure> |
forEach(T procedure)
Applies a
procedure to all container elements. |
static IntOpenHashSet |
from(int... elements)
Create a set from a variable number of arguments or an array of
int . |
static IntOpenHashSet |
from(IntContainer container)
Create a set from elements of another container.
|
int |
hashCode() |
boolean |
isEmpty()
Shortcut for
size() == 0 . |
java.util.Iterator<IntCursor> |
iterator()
Returns an iterator to a cursor traversing the collection.
|
int |
lslot() |
static IntOpenHashSet |
newInstance()
Returns a new object of this class with no need to declare generic type (shortcut
instead of using a constructor).
|
static IntOpenHashSet |
newInstanceWithCapacity(int initialCapacity,
float loadFactor)
Returns a new object of this class with no need to declare generic type (shortcut
instead of using a constructor).
|
static IntOpenHashSet |
newInstanceWithExpectedSize(int expectedSize)
Returns a new object of this class with no need to declare generic type (shortcut
instead of using a constructor).
|
static IntOpenHashSet |
newInstanceWithExpectedSize(int expectedSize,
float loadFactor)
Returns a new object of this class with no need to declare generic type (shortcut
instead of using a constructor).
|
static IntOpenHashSet |
newInstanceWithoutPerturbations()
Returns a new object with no key perturbations (see
computePerturbationValue(int) ). |
boolean |
remove(int key)
An alias for the (preferred)
removeAllOccurrences(int) . |
int |
removeAll(IntLookupContainer c)
Default implementation uses a predicate for removal.
|
int |
removeAll(IntPredicate predicate)
Removes all elements in this collection for which the
given predicate returns
true . |
int |
removeAllOccurrences(int key)
Removes all occurrences of
e from this collection. |
int |
retainAll(IntLookupContainer c)
Default implementation uses a predicate for retaining.
|
int |
retainAll(IntPredicate predicate)
Default implementation redirects to
IntCollection.removeAll(IntPredicate)
and negates the predicate. |
protected void |
shiftConflictingKeys(int slotCurr)
Shift all the slot-conflicting keys allocated to (and including)
slot . |
int |
size()
Return the current number of elements in this container.
|
int[] |
toArray()
Default implementation of copying to an array.
|
java.lang.String |
toString()
Convert the contents of this container to a human-friendly string.
|
finalize, getClass, notify, notifyAll, wait, wait, wait
removeAll, retainAll, retainAll
public static final int MIN_CAPACITY
public static final int DEFAULT_CAPACITY
public static final float DEFAULT_LOAD_FACTOR
public int[] keys
allocated
public boolean[] allocated
keys
table is allocated
or empty.assigned
public int assigned
allocated
.public final float loadFactor
protected int resizeAt
allocated
hits this value.protected int lastSlot
contains(int)
.contains(int)
protected int perturbation
public IntOpenHashSet()
public IntOpenHashSet(int initialCapacity)
public IntOpenHashSet(int initialCapacity, float loadFactor)
public IntOpenHashSet(IntContainer container)
public boolean add(int e)
k
to the set.public int add(int e1, int e2)
public int add(int... elements)
This method is handy, but costly if used in tight loops (anonymous array passing)
public int addAll(IntContainer container)
public int addAll(java.lang.Iterable<? extends IntCursor> iterable)
protected int computePerturbationValue(int capacity)
Compute the key perturbation value applied before hashing. The returned value should be non-zero and ideally different for each capacity. This matters because keys are nearly-ordered by their hashed values so when adding one container's values to the other, the number of collisions can skyrocket into the worst case possible.
If it is known that hash containers will not be added to each other (will be used for counting only, for example) then some speed can be gained by not perturbing keys before hashing and returning a value of zero for all possible capacities. The speed gain is a result of faster rehash operation (keys are mostly in order).
public int removeAllOccurrences(int key)
e
from this collection.removeAllOccurrences
in interface IntCollection
key
- Element to be removed from this collection, if present.public boolean remove(int key)
removeAllOccurrences(int)
.protected void shiftConflictingKeys(int slotCurr)
slot
.public int lslot()
contains(int)
if
it returned true
.contains(int)
public boolean contains(int key)
contains
in interface IntContainer
contains
in interface IntLookupContainer
true
if this container has an element
equal to e
.public void clear()
Does not release internal buffers.
clear
in interface IntCollection
public int size()
O(n)
time, although implementing classes
should try to maintain the current size and return in constant time.size
in interface IntContainer
public boolean isEmpty()
size() == 0
.isEmpty
in interface IntContainer
public int hashCode()
hashCode
in interface IntSet
hashCode
in class java.lang.Object
Set.hashCode()
(sum of hash codes of elements
within the set). Because sum is commutative, this ensures that different order
of elements in a set does not affect the hash code.public boolean equals(java.lang.Object obj)
ObjectSet
and both objects contains exactly the same objects.public java.util.Iterator<IntCursor> 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 (IntCursor<int> c : container) { System.out.println("index=" + c.index + " value=" + c.value); }
iterator
in interface IntContainer
iterator
in interface java.lang.Iterable<IntCursor>
public <T extends IntProcedure> T forEach(T procedure)
procedure
to all container elements. Returns the argument (any
subclass of IntProcedure
. 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 IntContainer
public int[] toArray()
toArray
in interface IntContainer
public IntOpenHashSet clone()
clone
in class java.lang.Object
public <T extends IntPredicate> T forEach(T predicate)
predicate
to container elements as long, as the predicate
returns true
. The iteration is interrupted otherwise.forEach
in interface IntContainer
public int removeAll(IntPredicate predicate)
true
.removeAll
in interface IntCollection
public static IntOpenHashSet from(int... elements)
int
.
The elements are copied from the argument to the internal buffer.public static IntOpenHashSet from(IntContainer container)
public static IntOpenHashSet newInstance()
public static IntOpenHashSet newInstanceWithoutPerturbations()
computePerturbationValue(int)
). Only use when sure the container will not
be used for direct copying of keys to another hash container.public static IntOpenHashSet newInstanceWithCapacity(int initialCapacity, float loadFactor)
public static IntOpenHashSet newInstanceWithExpectedSize(int expectedSize)
expectedSize
elements without having to resize.public static IntOpenHashSet newInstanceWithExpectedSize(int expectedSize, float loadFactor)
expectedSize
elements without having to resize.public int removeAll(IntLookupContainer c)
removeAll
in interface IntCollection
public int retainAll(IntLookupContainer c)
retainAll
in interface IntCollection
public int retainAll(IntPredicate predicate)
IntCollection.removeAll(IntPredicate)
and negates the predicate.retainAll
in interface IntCollection
public java.lang.String toString()
toString
in class java.lang.Object
Copyright © 2016 Carrot Search s.c.. All rights reserved.