HomeSort by relevance Sort by last modified time
    Searched refs:post_order (Results 1 - 13 of 13) sorted by null

  /external/chromium_org/base/test/
sequenced_task_runner_test_template.cc 237 const std::vector<int> post_order = local
244 if (start_order != post_order) {
247 << ::testing::PrintToString(post_order)
252 if (end_order != post_order) {
255 << ::testing::PrintToString(post_order)
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/
refactor.py 210 self.pre_order, self.post_order = self.get_fixers()
219 for fixer in chain(self.post_order, self.pre_order):
226 elif fixer in self.post_order:
238 (pre_order, post_order), where pre_order is the list of fixers that
239 want a pre-order AST traversal, and post_order is the list that want
421 for fixer in chain(self.pre_order, self.post_order):
426 self.traverse_by(self.bmi_post_order_heads, tree.post_order())
464 for node in new.post_order():
480 for fixer in chain(self.pre_order, self.post_order):
pytree.py 96 def post_order(self): member in class:Base
294 def post_order(self): member in class:Node
297 for node in child.post_order():
409 def post_order(self): member in class:Leaf
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/
refactor.py 210 self.pre_order, self.post_order = self.get_fixers()
219 for fixer in chain(self.post_order, self.pre_order):
226 elif fixer in self.post_order:
238 (pre_order, post_order), where pre_order is the list of fixers that
239 want a pre-order AST traversal, and post_order is the list that want
421 for fixer in chain(self.pre_order, self.post_order):
426 self.traverse_by(self.bmi_post_order_heads, tree.post_order())
464 for node in new.post_order():
480 for fixer in chain(self.pre_order, self.post_order):
pytree.py 96 def post_order(self): member in class:Base
294 def post_order(self): member in class:Node
297 for node in child.post_order():
409 def post_order(self): member in class:Leaf
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/tests/
test_refactor.py 310 self.assertEqual(len(rt.post_order), 0)
313 for fix in rt.post_order:
test_pytree.py 208 self.assertEqual(list(n1.post_order()), [l1, l2, c1, l3, n1])
test_fixers.py 26 self.refactor.post_order):
    [all...]
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/tests/
test_refactor.py 310 self.assertEqual(len(rt.post_order), 0)
313 for fix in rt.post_order:
test_pytree.py 208 self.assertEqual(list(n1.post_order()), [l1, l2, c1, l3, n1])
test_fixers.py 26 self.refactor.post_order):
    [all...]
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/fixes/
fix_tuple_params.py 128 for n in body.post_order():
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/fixes/
fix_tuple_params.py 128 for n in body.post_order():

Completed in 453 milliseconds