Uses of Package
org.antlr.misc

Packages that use org.antlr.misc

Package	Description
org.antlr.analysis
org.antlr.codegen
org.antlr.grammar.v3
org.antlr.misc
org.antlr.tool

Classes in org.antlr.misc used by org.antlr.analysis

Class and Description
Barrier A very simple barrier wait.
IntervalSet 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).
IntSet 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.
MultiMap A hash table that maps a key to a list of elements not just a single.
OrderedHashSet A HashMap that remembers the order that the elements were added.

Classes in org.antlr.misc used by org.antlr.codegen

Class and Description
IntSet 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.grammar.v3

Class and Description
IntSet 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.misc

Class and Description
BitSet A BitSet to replace java.util.BitSet.
Graph.Node
Interval An immutable inclusive interval a..b
IntervalSet 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).
IntSet 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.tool

Class and Description
BitSet A BitSet to replace java.util.BitSet.
IntervalSet 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).
IntSet 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.
MultiMap A hash table that maps a key to a list of elements not just a single.