public final class FixedBitSet extends BitSet implements MutableBits, Accountable
getBits()
)
long[], accessed with an int index, implementing Bits
and
DocIdSet
. If you need to manage more than 2.1B bits, use
LongBitSet
.Bits.MatchAllBits, Bits.MatchNoBits
EMPTY_ARRAY
Constructor and Description |
---|
FixedBitSet(int numBits)
Creates a new LongBitSet.
|
FixedBitSet(long[] storedBits,
int numBits)
Creates a new LongBitSet using the provided long[] array as backing store.
|
Modifier and Type | Method and Description |
---|---|
void |
and(FixedBitSet other)
this = this AND other
|
void |
andNot(FixedBitSet other)
this = this AND NOT other
|
static long |
andNotCount(FixedBitSet a,
FixedBitSet b)
Returns the popcount or cardinality of "a and not b" or
"intersection(a, not(b))".
|
static int |
bits2words(int numBits)
returns the number of 64 bit words it would take to hold numBits
|
int |
cardinality()
Returns number of set bits.
|
void |
clear(int index)
Sets the bit specified by
index to false. |
void |
clear(int startIndex,
int endIndex)
Clears a range of bits.
|
FixedBitSet |
clone() |
static FixedBitSet |
ensureCapacity(FixedBitSet bits,
int numBits)
If the given
FixedBitSet is large enough to hold numBits+1 ,
returns the given bits, otherwise returns a new FixedBitSet which
can hold the requested number of bits. |
boolean |
equals(Object o) |
void |
flip(int index)
Flip the bit at the provided index.
|
void |
flip(int startIndex,
int endIndex)
Flips a range of bits
|
boolean |
get(int index)
Returns the value of the bit with the specified
index . |
boolean |
getAndClear(int index) |
boolean |
getAndSet(int index) |
long[] |
getBits()
Expert.
|
int |
hashCode() |
static long |
intersectionCount(FixedBitSet a,
FixedBitSet b)
Returns the popcount or cardinality of the intersection of the two sets.
|
boolean |
intersects(FixedBitSet other)
returns true if the sets have any elements in common
|
int |
length()
Returns the number of bits in this set
|
int |
nextSetBit(int index)
Returns the index of the first set bit starting at the index specified.
|
void |
or(DocIdSetIterator iter)
Does in-place OR of the bits provided by the iterator.
|
void |
or(FixedBitSet other)
this = this OR other
|
int |
prevSetBit(int index)
Returns the index of the last set bit before or on the index specified.
|
long |
ramBytesUsed()
Return the memory usage of this object in bytes.
|
boolean |
scanIsEmpty()
Scans the backing store to check if all bits are clear.
|
void |
set(int index)
Set the bit at
i . |
void |
set(int startIndex,
int endIndex)
Sets a range of bits
|
static long |
unionCount(FixedBitSet a,
FixedBitSet b)
Returns the popcount or cardinality of the union of the two sets.
|
void |
xor(DocIdSetIterator iter)
Does in-place XOR of the bits provided by the iterator.
|
void |
xor(FixedBitSet other)
this = this XOR other
|
approximateCardinality, assertUnpositioned, of
finalize, getClass, notify, notifyAll, toString, wait, wait, wait
getChildResources
public FixedBitSet(int numBits)
numBits
- the number of bits neededpublic FixedBitSet(long[] storedBits, int numBits)
storedBits
- the array to use as backing storenumBits
- the number of bits actually neededpublic static FixedBitSet ensureCapacity(FixedBitSet bits, int numBits)
FixedBitSet
is large enough to hold numBits+1
,
returns the given bits, otherwise returns a new FixedBitSet
which
can hold the requested number of bits.
NOTE: the returned bitset reuses the underlying long[]
of
the given bits
if possible. Also, calling length()
on the
returned bits may return a value greater than numBits
.
public static int bits2words(int numBits)
public static long intersectionCount(FixedBitSet a, FixedBitSet b)
public static long unionCount(FixedBitSet a, FixedBitSet b)
public static long andNotCount(FixedBitSet a, FixedBitSet b)
public int length()
Bits
public long ramBytesUsed()
Accountable
ramBytesUsed
in interface Accountable
public long[] getBits()
public int cardinality()
cardinality
in class BitSet
public boolean get(int index)
Bits
index
.get
in interface Bits
index
- index, should be non-negative and < Bits.length()
.
The result of passing negative or out of bounds values is undefined
by this interface, just don't do it!true
if the bit is set, false
otherwise.public void set(int index)
BitSet
i
.public boolean getAndSet(int index)
public void clear(int index)
MutableBits
index
to false.clear
in interface MutableBits
index
- index, should be non-negative and < Bits.length()
.
The result of passing negative or out of bounds values is undefined
by this interface, just don't do it!public boolean getAndClear(int index)
public int nextSetBit(int index)
BitSet
DocIdSetIterator.NO_MORE_DOCS
is returned if there are no more set bits.nextSetBit
in class BitSet
public int prevSetBit(int index)
BitSet
prevSetBit
in class BitSet
public void or(DocIdSetIterator iter) throws IOException
BitSet
or
in class BitSet
IOException
public void or(FixedBitSet other)
public void xor(FixedBitSet other)
public void xor(DocIdSetIterator iter) throws IOException
IOException
public boolean intersects(FixedBitSet other)
public void and(FixedBitSet other)
public void andNot(FixedBitSet other)
public boolean scanIsEmpty()
public void flip(int startIndex, int endIndex)
startIndex
- lower indexendIndex
- one-past the last bit to flippublic void flip(int index)
public void set(int startIndex, int endIndex)
startIndex
- lower indexendIndex
- one-past the last bit to setpublic void clear(int startIndex, int endIndex)
BitSet
public FixedBitSet clone()
Copyright © 2000-2016 Apache Software Foundation. All Rights Reserved.