public class LongValueBitSet extends Object implements Marshallable
BitSet is intended to be shared between processes. To minimize locking constraints,
it is implemented as a lock-free solution without support for resizing.
Created by Rob Austin
EMPTYDISCARD| Constructor and Description |
|---|
LongValueBitSet(int maxNumberOfBits) |
LongValueBitSet(int maxNumberOfBits,
Wire w) |
| Modifier and Type | Method and Description |
|---|---|
void |
and(LongValueBitSet set)
Performs a logical AND of this target bit set with the
argument bit set.
|
void |
andNot(LongValueBitSet set)
Clears all of the bits in this
BitSet whose corresponding
bit is set in the specified BitSet. |
int |
cardinality()
Returns the number of bits set to
true in this BitSet. |
void |
clear()
Sets all of the bits in this BitSet to
false. |
void |
clear(int bitIndex)
Sets the bit specified by the index to
false. |
void |
clear(int fromIndex,
int toIndex)
Sets the bits from the specified
fromIndex (inclusive) to the
specified toIndex (exclusive) to false. |
boolean |
equals(Object obj)
Compares this object against the specified object.
|
void |
flip(int bitIndex)
Sets the bit at the specified index to the complement of its
current value.
|
void |
flip(int fromIndex,
int toIndex)
Sets each bit from the specified
fromIndex (inclusive) to the
specified toIndex (exclusive) to the complement of its current
value. |
boolean |
get(int bitIndex)
Returns the value of the bit with the specified index.
|
int |
hashCode()
Returns the hash code value for this bit set.
|
boolean |
intersects(LongValueBitSet set)
Returns true if the specified
BitSet has any bits set to
true that are also set to true in this BitSet. |
boolean |
isEmpty()
Returns true if this
BitSet contains no bits that are set
to true. |
int |
length()
Returns the "logical size" of this
BitSet: the index of
the highest set bit in the BitSet plus one. |
int |
nextClearBit(int fromIndex)
Returns the index of the first bit that is set to
false
that occurs on or after the specified starting index. |
int |
nextSetBit(int fromIndex)
Returns the index of the first bit that is set to
true
that occurs on or after the specified starting index. |
int |
nextSetBit(int fromIndex,
int toIndex)
Returns the index of the first bit that is set to
true
that occurs on or after the specified starting index. |
void |
or(LongValueBitSet set)
Performs a logical OR of this bit set with the bit set
argument.
|
int |
previousClearBit(int fromIndex)
Returns the index of the nearest bit that is set to
false
that occurs on or before the specified starting index. |
int |
previousSetBit(int fromIndex)
Returns the index of the nearest bit that is set to
true
that occurs on or before the specified starting index. |
void |
readMarshallable(WireIn wire)
Straight line ordered decoding.
|
void |
set(int bitIndex)
Sets the bit at the specified index to
true. |
void |
set(int bitIndex,
boolean value)
Sets the bit at the specified index to the specified value.
|
void |
set(int fromIndex,
int toIndex)
Sets the bits from the specified
fromIndex (inclusive) to the
specified toIndex (exclusive) to true. |
void |
set(int fromIndex,
int toIndex,
boolean value)
Sets the bits from the specified
fromIndex (inclusive) to the
specified toIndex (exclusive) to the specified value. |
void |
set(net.openhft.chronicle.core.values.LongValue word,
long newValue) |
void |
set(net.openhft.chronicle.core.values.LongValue word,
long param,
net.openhft.chronicle.wire.LongValueBitSet.LongFunction function) |
int |
size()
Returns the number of bits of space actually in use by this
BitSet to represent bit values. |
IntStream |
stream()
Returns a stream of indices for which this
BitSet
contains a bit in the set state. |
byte[] |
toByteArray()
Returns a new byte array containing all the bits in this bit set.
|
String |
toString()
Returns a string representation of this bit set.
|
static BitSet |
valueOf(byte[] bytes)
Returns a new bit set containing all the bits in the given byte array.
|
void |
writeMarshallable(WireOut wire)
Write data to the wire
|
void |
xor(LongValueBitSet set)
Performs a logical XOR of this bit set with the bit set
argument.
|
clone, finalize, getClass, notify, notifyAll, wait, wait, wait$equals, $fieldInfos, $hashCode, $toString, copyFrom, copyTo, deepCopy, fromFile, fromFile, fromFileAsMap, fromFileAsMap, fromHexString, fromString, fromString, fromString, getClassName, getField, mergeToMap, reset, setField, streamFromFile, streamFromFilewriteValueunexpectedFieldpublic LongValueBitSet(int maxNumberOfBits)
public LongValueBitSet(int maxNumberOfBits,
Wire w)
public static BitSet valueOf(byte[] bytes)
More precisely,
BitSet.valueOf(bytes).get(n) == ((bytes[n/8] & (1<<(n%8))) != 0)
for all n < 8 * bytes.length.
This method is equivalent to
BitSet.valueOf(ByteBuffer.wrap(bytes)).
bytes - a byte array containing a little-endian
representation of a sequence of bits to be used as the
initial bits of the new bit setBitSet containing all the bits in the byte arraypublic void set(net.openhft.chronicle.core.values.LongValue word,
long param,
net.openhft.chronicle.wire.LongValueBitSet.LongFunction function)
public void set(net.openhft.chronicle.core.values.LongValue word,
long newValue)
public byte[] toByteArray()
More precisely, if
byte[] bytes = s.toByteArray();
then bytes.length == (s.length()+7)/8 and
s.get(n) == ((bytes[n/8] & (1<<(n%8))) != 0)
for all n < 8 * bytes.length.
public void flip(int bitIndex)
bitIndex - the index of the bit to flipIndexOutOfBoundsException - if the specified index is negativepublic void flip(int fromIndex,
int toIndex)
fromIndex (inclusive) to the
specified toIndex (exclusive) to the complement of its current
value.fromIndex - index of the first bit to fliptoIndex - index after the last bit to flipIndexOutOfBoundsException - if fromIndex is negative,
or toIndex is negative, or fromIndex is
larger than toIndexpublic void set(int bitIndex)
true.bitIndex - a bit indexIndexOutOfBoundsException - if the specified index is negativepublic void set(int bitIndex,
boolean value)
bitIndex - a bit indexvalue - a boolean value to setIndexOutOfBoundsException - if the specified index is negativepublic void set(int fromIndex,
int toIndex)
fromIndex (inclusive) to the
specified toIndex (exclusive) to true.fromIndex - index of the first bit to be settoIndex - index after the last bit to be setIndexOutOfBoundsException - if fromIndex is negative,
or toIndex is negative, or fromIndex is
larger than toIndexpublic void set(int fromIndex,
int toIndex,
boolean value)
fromIndex (inclusive) to the
specified toIndex (exclusive) to the specified value.fromIndex - index of the first bit to be settoIndex - index after the last bit to be setvalue - value to set the selected bits toIndexOutOfBoundsException - if fromIndex is negative,
or toIndex is negative, or fromIndex is
larger than toIndexpublic void clear(int bitIndex)
false.bitIndex - the index of the bit to be clearedIndexOutOfBoundsException - if the specified index is negativepublic void clear(int fromIndex,
int toIndex)
fromIndex (inclusive) to the
specified toIndex (exclusive) to false.fromIndex - index of the first bit to be clearedtoIndex - index after the last bit to be clearedIndexOutOfBoundsException - if fromIndex is negative,
or toIndex is negative, or fromIndex is
larger than toIndexpublic void clear()
false.public boolean get(int bitIndex)
true if the bit with the index bitIndex
is currently set in this BitSet; otherwise, the result
is false.bitIndex - the bit indexIndexOutOfBoundsException - if the specified index is negativepublic int nextSetBit(int fromIndex)
true
that occurs on or after the specified starting index. If no such
bit exists then -1 is returned.
To iterate over the true bits in a BitSet,
use the following loop:
for (int i = bs.nextSetBit(0); i >= 0; i = bs.nextSetBit(i+1)) {
// operate on index i here
if (i == Integer.MAX_VALUE) {
break; // or (i+1) would overflow
}
}fromIndex - the index to start checking from (inclusive)-1 if there
is no such bitIndexOutOfBoundsException - if the specified index is negativepublic int nextSetBit(int fromIndex,
int toIndex)
true
that occurs on or after the specified starting index. If no such
bit exists then -1 is returned.
To iterate over the true bits in a BitSet,
use the following loop:
for (int i = bs.nextSetBit(0); i >= 0; i = bs.nextSetBit(i+1,to)) {
// operate on index i here
if (i == Integer.MAX_VALUE) {
break; // or (i+1) would overflow
}
}fromIndex - the index to start checking from (inclusive)toIndex - (inclusive) returns -1 if a bit is not found before this value-1 if there
is no such bitIndexOutOfBoundsException - if the specified index is negativepublic int nextClearBit(int fromIndex)
false
that occurs on or after the specified starting index.fromIndex - the index to start checking from (inclusive)IndexOutOfBoundsException - if the specified index is negativepublic int previousSetBit(int fromIndex)
true
that occurs on or before the specified starting index.
If no such bit exists, or if -1 is given as the
starting index, then -1 is returned.
To iterate over the true bits in a BitSet,
use the following loop:
for (int i = bs.length(); (i = bs.previousSetBit(i-1)) >= 0; ) {
// operate on index i here
}fromIndex - the index to start checking from (inclusive)-1 if there
is no such bitIndexOutOfBoundsException - if the specified index is less
than -1public int previousClearBit(int fromIndex)
false
that occurs on or before the specified starting index.
If no such bit exists, or if -1 is given as the
starting index, then -1 is returned.fromIndex - the index to start checking from (inclusive)-1 if there
is no such bitIndexOutOfBoundsException - if the specified index is less
than -1public int length()
BitSet: the index of
the highest set bit in the BitSet plus one. Returns zero
if the BitSet contains no set bits.BitSetpublic boolean isEmpty()
BitSet contains no bits that are set
to true.BitSet is emptypublic boolean intersects(LongValueBitSet set)
BitSet has any bits set to
true that are also set to true in this BitSet.set - BitSet to intersect withBitSet intersects
the specified BitSetpublic int cardinality()
true in this BitSet.true in this BitSetpublic void and(LongValueBitSet set)
true if and only if it both initially
had the value true and the corresponding bit in the
bit set argument also had the value true.set - a bit setpublic void or(LongValueBitSet set)
true if and only if it either already had the
value true or the corresponding bit in the bit set
argument has the value true.set - a bit setpublic void xor(LongValueBitSet set)
true if and only if one of the following
statements holds:
true, and the
corresponding bit in the argument has the value false.
false, and the
corresponding bit in the argument has the value true.
set - a bit setpublic void andNot(LongValueBitSet set)
BitSet whose corresponding
bit is set in the specified BitSet.set - the BitSet with which to mask this
BitSetpublic int hashCode()
BitSet.
The hash code is defined to be the result of the following calculation:
public int hashCode() {
long h = 1234;
long[] words = toLongArray();
for (int i = words.length; --i >= 0; )
h ^= words[i] * (i + 1);
return (int)((h >> 32) ^ h);
}
Note that the hash code changes if the set of bits is altered.public int size()
BitSet to represent bit values.
The maximum element in the set is the size - 1st element.public boolean equals(Object obj)
true if and only if the argument is
not null and is a Bitset object that has
exactly the same set of bits set to true as this bit
set. That is, for every nonnegative int index k,
((BitSet)obj).get(k) == this.get(k)must be true. The current sizes of the two bit sets are not compared.
public String toString()
BitSet contains a bit in the set
state, the decimal representation of that index is included in
the result. Such indices are listed in order from lowest to
highest, separated by ", " (a comma and a space) and
surrounded by braces, resulting in the usual mathematical
notation for a set of integers.
Example:
BitSet drPepper = new BitSet();Now
drPepper.toString() returns "{}".
drPepper.set(2);Now
drPepper.toString() returns "{2}".
drPepper.set(4); drPepper.set(10);Now
drPepper.toString() returns "{2, 4, 10}".public IntStream stream()
BitSet
contains a bit in the set state. The indices are returned
in order, from lowest to highest. The size of the stream
is the number of bits in the set state, equal to the value
returned by the cardinality() method.
The bit set must remain constant during the execution of the terminal stream operation. Otherwise, the result of the terminal stream operation is undefined.
public void writeMarshallable(@NotNull
WireOut wire)
WriteMarshallablewriteMarshallable in interface MarshallablewriteMarshallable in interface WriteMarshallablewire - to write to.public void readMarshallable(@NotNull
WireIn wire)
throws net.openhft.chronicle.core.io.IORuntimeException
ReadMarshallablereadMarshallable in interface MarshallablereadMarshallable in interface ReadMarshallablewire - to read from in an ordered manner.net.openhft.chronicle.core.io.IORuntimeException - the stream wasn't ordered or formatted as expected.Copyright © 2019. All rights reserved.