Lines Matching full:nodes
190 * nodes such as function definition nodes (you'll want to seek
192 * dynamic searches; i.e., go find me all PLUS nodes.
312 /** Walk the entire tree and make a node name to nodes mapping.
347 /** Return a List of tree nodes with token type ttype */
351 final List nodes = new ArrayList();
354 [nodes addObject t];
358 AMutableArray *nodes = [AMutableArray arrayWithCapacity:100];
359 ANTLRVisitor *contextVisitor = [ANTLRVisitor newANTLRVisitor:3 Actor:self Object:(id)nodes Object:nil];
361 return nodes;
474 * on the various nodes and '.' (dot) as the node/subtree wildcard,
476 * the labels pointing at the appropriate nodes. Return false if
519 * text arguments on nodes. Fill labels map with pointers to nodes
520 * in tree matched against nodes in pattern with labels.
641 * This data structure allows you to find all nodes with type INT in order.
