Lines Matching +full:update +full:- +full:alternatives

87         Return a post-order iterator for the tree.
95         Return a pre-order iterator for the tree.
182                 return self.parent.children[i-1]
263         """Return a post-order iterator for the tree."""
269         """Return a pre-order iterator for the tree."""
376         """Return a post-order iterator for the tree."""
380         """Return a pre-order iterator for the tree."""
401     strictly bottom-up.
425     - LeafPattern matches a single leaf node;
426     - NodePattern matches a single node (usually non-leaf);
427     - WildcardPattern matches a sequence of nodes of variable length.
442         while args and args[-1] is None:
443             del args[-1]
463         Default implementation for non-wildcard patterns.
474                 results.update(r)
483         Default implementation for non-wildcard patterns.
493         Default implementation for non-wildcard patterns.
555         non-leaf nodes that also match the content pattern.
594                         results.update(r)
616     except it always uses non-greedy matching.
640             list of alternatives, e.g. (a b c | d e | f g h)*
645             # Check sanity of alternatives
646             assert len(content), repr(content)  # Can't have zero alternatives
648                 assert len(alt), repr(alt) # Can have empty alternatives
682                     results.update(r)
756                                 r.update(r0)
757                                 r.update(r1)
788                         r.update(r0)
789                         r.update(r1)
851                     r.update(r0)
852                     r.update(r1)