Lines Matching refs:node
140 * The NFA position of the special EOC (end of content) node. This
155 * non-epsilon leaf node.) This is only used during the building of
161 * This is the head node of our intermediate representation. It is
273 * A value of -1 in the children array indicates a PCDATA node. All other
444 // we create a top level binary node of which the special EOC value
445 // is set as the right side node. The the left side is set to the
452 // node's DFA state position and count the number of such leafs, which
455 // The nodeTmp object is passed in just as a temp node to use during
456 // the recursion. Otherwise, we'd have to create a new node on every
483 // And handle specially the EOC node, which also must be numbered
484 // and counted as a non-epsilon leaf node. It could not be handled
495 // to calculate the first and last position sets of each node. This
498 // Along the way we also set the leaf count in each node as the
513 // one for each leaf node (i.e. each DFA position.)
548 // See if the current leaf node's element index is in the list
557 // If it was not in the list, then add it, if not the EOC node
612 // head node (which is the seq node that holds the content model
613 // and the EOC node.)
795 * Calculates the follow list of the current node.
797 * @param nodeCur The curent node.
898 * Dumps the tree of the current node to standard output.
900 * @param nodeCur The current node.
988 // Set the maximum states on this node
1016 // Put this node in the leaf list at the current index if its
1019 final QName node = ((CMLeaf)nodeCur).getElement();
1020 if (node.localpart != fEpsilonString) {