|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use BitSet | |
---|---|
com.carrotsearch.hppc | High Performance Primitive Collections (HPPC) library provides
typical data structures (lists, stacks, maps)
template-generated for all Java primitive types
(byte , int , etc.) to conserve
memory and boost performance. |
Uses of BitSet in com.carrotsearch.hppc |
---|
Methods in com.carrotsearch.hppc with parameters of type BitSet | |
---|---|
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. |
Constructors in com.carrotsearch.hppc with parameters of type BitSet | |
---|---|
BitSetIterator(BitSet obs)
|
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |