| /external/sdv/vsomeip/third_party/boost/iterator/example/ |
| D | node_iterator2.hpp | 16 class node_iter class
18 node_iter<Value>
27 node_iter() in node_iter() function in node_iter
30 explicit node_iter(Value* p) in node_iter() function in node_iter
34 node_iter( in node_iter() function in node_iter
35 node_iter<OtherValue> const& other in node_iter()
52 bool equal(node_iter<OtherValue> const& other) const in equal()
65 template <class> friend class node_iter;
70 typedef node_iter<node_base> node_iterator;
71 typedef node_iter<node_base const> node_const_iterator;
|
| D | node_iterator3.hpp | 16 class node_iter class
18 node_iter<Value> // Derived
28 node_iter<Value>, Value*, boost::use_default, boost::forward_traversal_tag
32 node_iter() in node_iter() function in node_iter
35 explicit node_iter(Value* p) in node_iter() function in node_iter
39 node_iter( in node_iter() function in node_iter
40 node_iter<OtherValue> const& other in node_iter()
57 typedef node_iter<node_base> node_iterator;
58 typedef node_iter<node_base const> node_const_iterator;
|
| /external/sdv/vsomeip/third_party/boost/iterator/doc/ |
| D | iterator_adaptor_tutorial.rst | 5 In this section we'll further refine the ``node_iter`` class
50 ``node_iter`` is thus reduced to::
53 class node_iter
55 node_iter<Value> // Derived
65 node_iter()
66 : node_iter::iterator_adaptor_(0) {}
68 explicit node_iter(Value* p)
69 : node_iter::iterator_adaptor_(p) {}
72 node_iter(
73 node_iter<OtherValue> const& other
[all …]
|
| D | iterator_facade_tutorial.rst | 344 class node_iter
346 node_iter<Value>
352 node_iter()
355 explicit node_iter(Value* p)
361 bool equal(node_iter<Value> const& other) const
374 typedef node_iter<node_base> node_iterator;
375 typedef node_iter<node_base const> node_const_iterator;
396 class node_iter
398 node_iter<Value>
404 node_iter()
[all …]
|
| /external/sdv/vsomeip/third_party/boost/iterator/doc/quickbook/ |
| D | adaptor.qbk | 200 In this section we'll further refine the `node_iter` class
245 `node_iter` is thus reduced to:
248 class node_iter
250 node_iter<Value> // Derived
260 node_iter()
261 : node_iter::iterator_adaptor_(0) {}
263 explicit node_iter(Value* p)
264 : node_iter::iterator_adaptor_(p) {}
267 node_iter(
268 node_iter<OtherValue> const& other
[all …]
|
| D | facade_tutorial.qbk | 329 class node_iter
331 node_iter<Value>
337 node_iter()
340 explicit node_iter(Value* p)
346 bool equal(node_iter<Value> const& other) const
359 typedef node_iter<node_base> node_iterator;
360 typedef node_iter<node_base const> node_const_iterator;
380 class node_iter
382 node_iter<Value>
388 node_iter()
[all …]
|
| /external/angle/third_party/spirv-tools/src/source/opt/ |
| D | dominator_tree.h | 256 DominatorTreeNodeMap::iterator node_iter = nodes_.find(id); in GetTreeNode() local
257 if (node_iter == nodes_.end()) { in GetTreeNode()
260 return &node_iter->second; in GetTreeNode()
265 DominatorTreeNodeMap::const_iterator node_iter = nodes_.find(id); in GetTreeNode() local
266 if (node_iter == nodes_.end()) { in GetTreeNode()
269 return &node_iter->second; in GetTreeNode()
|
| D | dominator_tree.cpp | 267 std::map<uint32_t, DominatorTreeNode>::iterator node_iter = in GetOrInsertNode() local
269 if (node_iter == nodes_.end()) { in GetOrInsertNode()
273 dtn = &node_iter->second; in GetOrInsertNode()
|
| /external/swiftshader/third_party/SPIRV-Tools/source/opt/ |
| D | dominator_tree.h | 256 DominatorTreeNodeMap::iterator node_iter = nodes_.find(id); in GetTreeNode() local
257 if (node_iter == nodes_.end()) { in GetTreeNode()
260 return &node_iter->second; in GetTreeNode()
265 DominatorTreeNodeMap::const_iterator node_iter = nodes_.find(id); in GetTreeNode() local
266 if (node_iter == nodes_.end()) { in GetTreeNode()
269 return &node_iter->second; in GetTreeNode()
|
| D | dominator_tree.cpp | 267 std::map<uint32_t, DominatorTreeNode>::iterator node_iter = in GetOrInsertNode() local
269 if (node_iter == nodes_.end()) { in GetOrInsertNode()
273 dtn = &node_iter->second; in GetOrInsertNode()
|
| /external/deqp-deps/SPIRV-Tools/source/opt/ |
| D | dominator_tree.h | 256 DominatorTreeNodeMap::iterator node_iter = nodes_.find(id); in GetTreeNode() local
257 if (node_iter == nodes_.end()) { in GetTreeNode()
260 return &node_iter->second; in GetTreeNode()
265 DominatorTreeNodeMap::const_iterator node_iter = nodes_.find(id); in GetTreeNode() local
266 if (node_iter == nodes_.end()) { in GetTreeNode()
269 return &node_iter->second; in GetTreeNode()
|
| D | dominator_tree.cpp | 267 std::map<uint32_t, DominatorTreeNode>::iterator node_iter = in GetOrInsertNode() local
269 if (node_iter == nodes_.end()) { in GetOrInsertNode()
273 dtn = &node_iter->second; in GetOrInsertNode()
|
| /external/rust/android-crates-io/crates/uefi/src/proto/device_path/ |
| D | mod.rs | 301 pub const fn node_iter(&self) -> DevicePathNodeIterator { in node_iter() method
458 pub const fn node_iter(&self) -> DevicePathNodeIterator { in node_iter() method
553 let node_iter = DevicePathNodeIterator { in next() localVariable
557 for node in node_iter { in next()
804 let nodes: Vec<_> = dp.node_iter().collect(); in test_device_path_nodes()
830 let nodes: Vec<_> = instance.node_iter().collect(); in test_device_path_instances()
840 let nodes: Vec<_> = instance.node_iter().collect(); in test_device_path_instances()
904 let nodes: Vec<_> = dp.node_iter().collect(); in test_device_path_nodes_from_bytes()
|
| D | build.rs | 267 path.node_iter().next().unwrap().try_into().unwrap(); in test_acpi_adr()
302 path.node_iter().next().unwrap().try_into().unwrap(); in test_acpi_expanded()
359 let mut iter = path.node_iter(); in test_messaging_rest_service()
415 for node in path1.node_iter() { in test_build_with_packed_node()
|
| /external/tensorflow/tensorflow/core/kernels/data/ |
| D | parallel_interleave_dataset_op_test.cc | 671 auto node_iter = std::find_if( in TEST_F() local
677 ASSERT_NE(node_iter, graph_def.node().end()); in TEST_F()
679 node_iter->attr().at("value").tensor().int64_val(0)); in TEST_F()
712 auto node_iter = std::find_if( in TEST_F() local
718 ASSERT_NE(node_iter, graph_def.node().end()); in TEST_F()
720 node_iter->attr().at("value").tensor().int64_val(0)); in TEST_F()
|
| /external/pytorch/test/cpp/jit/ |
| D | test_alias_analysis.cpp | 661 auto node_iter = graph->block()->nodes().begin(); in TEST() local
662 auto relu = *node_iter; in TEST()
676 auto node_iter = graph->block()->nodes().begin(); in TEST() local
677 auto mul = *node_iter; in TEST()
788 auto node_iter = graph->block()->nodes().begin(); in TEST() local
789 node_iter++; // string in TEST()
790 Node* int_node = *node_iter++; in TEST()
836 auto node_iter = graph->block()->nodes().begin(); in TEST() local
837 auto tuple_node = *node_iter; in TEST()
919 auto node_iter = graph->block()->nodes().begin(); in TEST() local
[all …]
|
| /external/tensorflow/tensorflow/core/tpu/ |
| D | tpu_compile.cc | 152 const auto& node_iter = index.find(node_name); in ConvertGraphShapeInfoToShapeMap() local
153 if (node_iter != index.end()) { in ConvertGraphShapeInfoToShapeMap()
|
| /external/tensorflow/tensorflow/compiler/tf2xla/ |
| D | xla_compiler.cc | 655 const auto& node_iter = node_name_index.find(node_name); in GetGraph() local
656 if (node_iter != node_name_index.end()) { in GetGraph()
678 const auto& node_iter = node_name_index.find(node_name); in GetGraph() local
679 if (node_iter != node_name_index.end()) { in GetGraph()
|
| /external/tensorflow/tensorflow/compiler/jit/ |
| D | extract_outside_compilation_pass.cc | 1273 auto node_iter = node_map.find(e->src()); in RewriteShapeInferenceGraph() local
1274 if (node_iter == node_map.end()) { in RewriteShapeInferenceGraph()
1278 g->AddEdge(node_iter->second, e->src_output(), copy, in RewriteShapeInferenceGraph()
|