Uses of Package
org.antlr.misc
Packages that use org.antlr.misc
Package
Description
-
Classes in org.antlr.misc used by org.antlr.analysisClassDescriptionA very simple barrier wait.A set of integers that relies on ranges being common to do "run-length-encoded" like compression (if you view an IntSet like a BitSet with runs of 0s and 1s).A generic set of ints that has an efficient implementation, BitSet, which is a compressed bitset and is useful for ints that are small, for example less than 500 or so, and w/o many ranges.A hash table that maps a key to a list of elements not just a single.A HashMap that remembers the order that the elements were added.
-
Classes in org.antlr.misc used by org.antlr.codegenClassDescriptionA generic set of ints that has an efficient implementation, BitSet, which is a compressed bitset and is useful for ints that are small, for example less than 500 or so, and w/o many ranges.
-
Classes in org.antlr.misc used by org.antlr.grammar.v2ClassDescriptionA generic set of ints that has an efficient implementation, BitSet, which is a compressed bitset and is useful for ints that are small, for example less than 500 or so, and w/o many ranges.
-
Classes in org.antlr.misc used by org.antlr.miscClassDescriptionA BitSet to replace java.util.BitSet.An immutable inclusive interval a..bA set of integers that relies on ranges being common to do "run-length-encoded" like compression (if you view an IntSet like a BitSet with runs of 0s and 1s).A generic set of ints that has an efficient implementation, BitSet, which is a compressed bitset and is useful for ints that are small, for example less than 500 or so, and w/o many ranges.
-
Classes in org.antlr.misc used by org.antlr.toolClassDescriptionA BitSet to replace java.util.BitSet.A set of integers that relies on ranges being common to do "run-length-encoded" like compression (if you view an IntSet like a BitSet with runs of 0s and 1s).A generic set of ints that has an efficient implementation, BitSet, which is a compressed bitset and is useful for ints that are small, for example less than 500 or so, and w/o many ranges.A hash table that maps a key to a list of elements not just a single.