Appends the least-significant bits, from value, in order from most-significant to least-significant. For example, appending 6 bits from 0x000001E will append the bits 0, 1, 1, 1, 1, 0 in that order.
{@code int} containing bits to append
bits from value to append
Clears all bits (sets to false).
Flips bit i.
bit to set
bit to get
true iff bit i is set
underlying array of ints. The first element holds the first 32 bits, and the least significant bit is bit 0.
first bit to check
index of first bit that is set, starting from the given index, or size if none are set at or beyond this given index
index to start looking for unset bit
index of next unset bit, or {@code size} if none are unset until the end
Efficient method to check if a range of bits is set, or not set.
start of range, inclusive.
end of range, exclusive
if true, checks that bits in range are set, otherwise checks that they are not set
true iff all bits are set or not set in range, according to value argument
Reverses all bits in the array.
Sets bit i.
bit to set
Sets a block of 32 bits, starting at bit i.
first bit to set
the new value of the next 32 bits. Note again that the least-significant bit corresponds to bit i, the next-least-significant to i+1, and so on.
Sets a range of bits.
start of range, inclusive.
end of range, exclusive
first bit to start writing
array to write into. Bytes are written most-significant byte first. This is the opposite of the internal representation, which is exposed by {@link #getBitArray()}
position in array to start writing
how many bytes to write
Generated using TypeDoc
A simple, fast array of bits, represented compactly by an array of ints internally.
Sean Owen