| /external/tensorflow/tensorflow/core/grappler/utils/ |
| D | traversal_test.cc | 28 DfsCallbacks MkCallbacks(std::vector<string>* pre_order, in MkCallbacks() argument
31 return {[pre_order](const NodeDef* n) { pre_order->push_back(n->name()); }, in MkCallbacks()
52 std::vector<string> pre_order; in TEST() local
59 MkCallbacks(&pre_order, &post_order, &back_edges)); in TEST()
64 EXPECT_EQ(pre_order, expected_pre); in TEST()
83 std::vector<string> pre_order; in TEST() local
90 MkCallbacks(&pre_order, &post_order, &back_edges)); in TEST()
95 EXPECT_EQ(pre_order, expected_pre); in TEST()
113 std::vector<string> pre_order; in TEST() local
120 MkCallbacks(&pre_order, &post_order, &back_edges)); in TEST()
[all …]
|
| D | traversal.h | 40 : pre_order(std::move(pre)), in DfsCallbacks()
52 std::function<void(const NodeDef*)> pre_order; member
|
| D | traversal.cc | 94 if (callbacks.pre_order) { in DfsTraversal()
95 callbacks.pre_order(graph_view.GetNode(w.node)); in DfsTraversal()
|
| /external/python/cpython3/Lib/lib2to3/ |
| D | refactor.py | 195 self.pre_order, self.post_order = self.get_fixers()
204 for fixer in chain(self.post_order, self.pre_order):
209 elif fixer in self.pre_order:
406 for fixer in chain(self.pre_order, self.post_order):
410 self.traverse_by(self.bmi_pre_order_heads, tree.pre_order())
465 for fixer in chain(self.pre_order, self.post_order):
|
| D | pytree.py | 93 def pre_order(self): member in Base
268 def pre_order(self): member in Node
272 yield from child.pre_order()
379 def pre_order(self): member in Leaf
|
| /external/python/cpython2/Lib/lib2to3/ |
| D | refactor.py | 210 self.pre_order, self.post_order = self.get_fixers()
219 for fixer in chain(self.post_order, self.pre_order):
224 elif fixer in self.pre_order:
421 for fixer in chain(self.pre_order, self.post_order):
425 self.traverse_by(self.bmi_pre_order_heads, tree.pre_order())
480 for fixer in chain(self.pre_order, self.post_order):
|
| D | pytree.py | 104 def pre_order(self): member in Base
301 def pre_order(self): member in Node
305 for node in child.pre_order():
413 def pre_order(self): member in Leaf
|
| /external/toolchain-utils/binary_search_tool/full_bisect_test/ |
| D | main.c | 7 char pre_order[] = { '/', '-', '+', '*', 'a', '^', 'x', '2', '&', 'b', 'y', variable
|
| /external/yapf/yapftests/ |
| D | comment_splicer_test.py | 42 node.pre_order())):
|
| /external/tensorflow/tensorflow/core/grappler/optimizers/ |
| D | auto_mixed_precision.cc | 688 : pre_order(std::move(pre)), in DfsTypeCallbacks()
700 std::function<void(int)> pre_order; member
796 if (callbacks.pre_order) { in DfsTypeTraversal()
797 callbacks.pre_order(w.node); in DfsTypeTraversal()
|
| /external/python/cpython3/Lib/lib2to3/tests/ |
| D | test_pytree.py | 194 self.assertEqual(list(n1.pre_order()), [n1, c1, l1, l2, l3])
|
| D | test_fixers.py | 24 for fixer in chain(self.refactor.pre_order,
|
| /external/python/cpython2/Lib/lib2to3/tests/ |
| D | test_pytree.py | 216 self.assertEqual(list(n1.pre_order()), [n1, c1, l1, l2, l3])
|
| D | test_fixers.py | 25 for fixer in chain(self.refactor.pre_order,
|