Uses of Class
com.inxar.syntacs.automaton.finite.TreeDFA.Edge

Packages that use TreeDFA.Edge
com.inxar.syntacs.automaton.finite Defines classes which implement determinitic finite automata and their construction. 
 

Uses of TreeDFA.Edge in com.inxar.syntacs.automaton.finite
 

Fields in com.inxar.syntacs.automaton.finite declared as TreeDFA.Edge
 TreeDFA.Edge TreeDFA.State.tree
           
 TreeDFA.Edge TreeDFA.Edge.left
          The left binary tree child (less than).
 TreeDFA.Edge TreeDFA.Edge.right
          The right binary tree child (greater than).
 

Methods in com.inxar.syntacs.automaton.finite that return TreeDFA.Edge
static TreeDFA.Edge TreeDFA.balance(TreeDFA.Edge tree)
          Given a (possibly unbalanced) binary edge tree, balance the tree such that a Red-Black tree would be pleased with the output.
static TreeDFA.Edge TreeDFA.balance(TreeDFA.Edge[] edges, int off, int len)
          Recursively balance the section of the Edge array specified.
 

Methods in com.inxar.syntacs.automaton.finite with parameters of type TreeDFA.Edge
static TreeDFA.Edge TreeDFA.balance(TreeDFA.Edge tree)
          Given a (possibly unbalanced) binary edge tree, balance the tree such that a Red-Black tree would be pleased with the output.
static void TreeDFA.inOrderDump(TreeDFA.Edge tree, Vector v)
          Recursively flatten the given Edge tree into the given Vector.
static void TreeDFA.toStringInOrder(TreeDFA.Edge tree, StringBuffer b, int level)
          Recursively print the tree in-order.
static TreeDFA.Edge TreeDFA.balance(TreeDFA.Edge[] edges, int off, int len)
          Recursively balance the section of the Edge array specified.
 void TreeDFA.State.toBuffer(StringBuffer b, TreeDFA.Edge edge)
           
 void TreeDFA.State.vizualize(GraphViz dot, TreeDFA.Edge edge)
           
 

Constructors in com.inxar.syntacs.automaton.finite with parameters of type TreeDFA.Edge
TreeDFA.State(TreeDFA.Edge tree, int output)
          Constructs the State on the given Edge tree and int output.
TreeDFA.Edge(int lo, int hi, int prev, int next, TreeDFA.Edge left, TreeDFA.Edge right)
          Constructs the Edge with the given hi and lo rangepoints, the next and "previous" state, and the left and right binary tree children.