Package | Description |
---|---|
com.carrotsearch.hppc |
Modifier and Type | Method and Description |
---|---|
static BitSet |
BitSet.newInstance()
Static constructor-like method similar to other (generic) collections.
|
Modifier and Type | Method and Description |
---|---|
void |
BitSet.and(BitSet other) |
void |
BitSet.andNot(BitSet other) |
static long |
BitSet.andNotCount(BitSet a,
BitSet b)
Returns the popcount or cardinality of "a and not b" or "intersection(a, not(b))".
|
void |
BitSet.intersect(BitSet other)
this = this AND other
|
static long |
BitSet.intersectionCount(BitSet a,
BitSet b)
Returns the popcount or cardinality of the intersection of the two sets.
|
boolean |
BitSet.intersects(BitSet other)
returns true if the sets have any elements in common
|
void |
BitSet.or(BitSet other) |
void |
BitSet.remove(BitSet other)
Remove all elements set in other.
|
void |
BitSet.union(BitSet other)
this = this OR other
|
static long |
BitSet.unionCount(BitSet a,
BitSet b)
Returns the popcount or cardinality of the union of the two sets.
|
void |
BitSet.xor(BitSet other)
this = this XOR other
|
static long |
BitSet.xorCount(BitSet a,
BitSet b)
Returns the popcount or cardinality of the exclusive-or of the two sets.
|
Constructor and Description |
---|
BitSetIterator(BitSet obs) |
Copyright © 2018 Carrot Search s.c.. All rights reserved.