| java.lang.Object org.antlr.runtime.BitSet
BitSet | public class BitSet implements Cloneable(Code) | | A stripped-down version of org.antlr.misc.BitSet that is just
good enough to handle runtime requirements such as FOLLOW sets
for automatic error recovery.
|
Field Summary | |
final protected static int | BITS | final protected static int | LOG_BITS | final protected static int | MOD_MASK | protected long | bits |
BITS | final protected static int BITS(Code) | | |
LOG_BITS | final protected static int LOG_BITS(Code) | | |
MOD_MASK | final protected static int MOD_MASK(Code) | | |
bits | protected long bits(Code) | | The actual data bits
|
BitSet | public BitSet()(Code) | | Construct a bitset of size one word (64 bits)
|
BitSet | public BitSet(long[] bits_)(Code) | | Construction from a static array of longs
|
BitSet | public BitSet(List items)(Code) | | Construction from a list of integers
|
BitSet | public BitSet(int nbits)(Code) | | Construct a bitset given the size
Parameters: nbits - The size of the bitset in bits |
add | public void add(int el)(Code) | | or this element into this set (grow as necessary to accommodate)
|
growToInclude | public void growToInclude(int bit)(Code) | | Grows the set to a larger number of bits.
Parameters: bit - element that must fit in set |
isNil | public boolean isNil()(Code) | | |
lengthInLongWords | public int lengthInLongWords()(Code) | | return how much space is being used by the bits array not
how many actually have member bits on.
|
member | public boolean member(int el)(Code) | | |
numBits | public int numBits()(Code) | | |
remove | public void remove(int el)(Code) | | |
toArray | public int[] toArray()(Code) | | Is this contained within a?
|
toPackedArray | public long[] toPackedArray()(Code) | | |
|
|