$bits
$bits : array|mixed|int[]|null
<p>A simple, fast array of bits, represented compactly by an array of ints internally.</p>
$bits : array|mixed|int[]|null
$size : mixed|null
setBulk(\Zxing\Common\first $i, \Zxing\Common\the $newBits) : void
Sets a block of 32 bits, starting at bit i.
| \Zxing\Common\first | $i | bit to set |
| \Zxing\Common\the | $newBits | 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. |
isRange(\Zxing\Common\start $start, \Zxing\Common\end $end, \Zxing\Common\if $value) : true
Efficient method to check if a range of bits is set, or not set.
| \Zxing\Common\start | $start | of range, inclusive. |
| \Zxing\Common\end | $end | of range, exclusive |
| \Zxing\Common\if | $value | true, checks that bits in range are set, otherwise checks that they are not set |
if end is less than or equal to start
iff all bits are set or not set in range, according to value argument
appendBits( $value, \Zxing\Common\bits $numBits) : mixed
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.
| $value | {@code int} containing bits to append |
|
| \Zxing\Common\bits | $numBits | from value to append |
toBytes(\Zxing\Common\first $bitOffset, array $array, \Zxing\Common\position $offset, \Zxing\Common\how $numBytes) : void
| \Zxing\Common\first | $bitOffset | bit to start writing |
| array | $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()} |
| \Zxing\Common\position | $offset | in array to start writing |
| \Zxing\Common\how | $numBytes | many bytes to write |