| /external/sdv/vsomeip/third_party/boost/iterator/example/ |
| D | node_iterator2.hpp | 28 : m_node(0) {} in node_iter()
31 : m_node(p) {} in node_iter()
43 : m_node(other.m_node) {} in node_iter()
54 return this->m_node == other.m_node; in equal()
57 void increment() { m_node = m_node->next(); } in increment()
59 Value& dereference() const { return *m_node; } in dereference()
67 Value* m_node; member in node_iter
|
| D | node_iterator1.hpp | 19 : m_node(0) in node_iterator()
23 : m_node(p) in node_iterator()
30 { m_node = m_node->next(); } in increment()
33 { return this->m_node == other.m_node; } in equal()
36 { return *m_node; } in dereference()
38 node_base* m_node; member in node_iterator
|
| /external/sdv/vsomeip/third_party/boost/iterator/doc/quickbook/ |
| D | facade_tutorial.qbk | 188 : m_node(0)
192 : m_node(p)
197 node_base* m_node;
203 default constructor to leave `m_node` uninitialized.
235 : m_node(0) {}
238 : m_node(p) {}
243 void increment() { m_node = m_node->next(); }
247 return this->m_node == other.m_node;
250 node_base& dereference() const { return *m_node; }
252 node_base* m_node;
[all …]
|
| /external/sdv/vsomeip/third_party/boost/iterator/doc/ |
| D | iterator_facade_tutorial.rst | 198 : m_node(0)
202 : m_node(p)
207 node_base* m_node;
213 default constructor to leave ``m_node`` uninitialized.
246 : m_node(0) {}
249 : m_node(p) {}
254 void increment() { m_node = m_node->next(); }
258 return this->m_node == other.m_node;
261 node_base& dereference() const { return *m_node; }
263 node_base* m_node;
[all …]
|
| /external/sdv/vsomeip/third_party/boost/container/include/boost/container/ |
| D | deque.hpp | 141 index_pointer m_node; member in boost::container::dtl::deque_iterator
148 …RIBUTE_NODISCARD BOOST_CONTAINER_FORCEINLINE index_pointer get_node() const { return m_node; } in get_node()
151 : m_cur(x), m_first(*y), m_last(*y + block_size), m_node(y) in deque_iterator()
155 …: m_cur(), m_first(), m_last(), m_node() //Value initialization to achieve "null iterators" (N364… in deque_iterator()
159 : m_cur(x.get_cur()), m_first(x.get_first()), m_last(x.get_last()), m_node(x.get_node()) in deque_iterator()
163 : m_cur(x.get_cur()), m_first(x.get_first()), m_last(x.get_last()), m_node(x.get_node()) in deque_iterator()
167 : m_cur(cur), m_first(first), m_last(last), m_node(node) in deque_iterator()
171 …{ m_cur = x.get_cur(); m_first = x.get_first(); m_last = x.get_last(); m_node = x.get_node(); ret… in operator =()
191 return block_size * (this->m_node - x.m_node - 1) + in operator -()
202 this->priv_set_node(this->m_node + 1, block_size); in operator ++()
[all …]
|
| /external/apache-xml/src/main/java/org/apache/xalan/transformer/ |
| D | NodeSorter.java | 104 v.setItem(((NodeCompareElem) nodes.elementAt(i)).m_node, i); in sort()
159 XObject r1 = k.m_selectPat.execute(m_execContext, n1.m_node, in compare()
161 XObject r2 = k.m_selectPat.execute(m_execContext, n2.m_node, in compare()
222 XObject r1 = k.m_selectPat.execute(m_execContext, n1.m_node, in compare()
224 XObject r2 = k.m_selectPat.execute(m_execContext, n2.m_node, in compare()
271 DTM dtm = support.getDTM(n1.m_node); // %OPT% in compare()
272 result = dtm.isNodeAfter(n1.m_node, n2.m_node) ? -1 : 1; in compare()
465 int m_node; field in NodeSorter.NodeCompareElem
493 m_node = node; in NodeCompareElem()
|
| D | XalanTransformState.java | 40 Node m_node = null; field in XalanTransformState
55 m_node = n; in setCurrentNode()
|
| /external/antlr/runtime/Cpp/include/ |
| D | antlr3exception.hpp | 108 TokenType* m_node; member in ANTLR_ExceptionBase
|
| D | antlr3exception.inl | 12 m_node = NULL;
59 return m_node;
134 m_node = node;
|
| /external/tensorflow/tensorflow/core/grappler/optimizers/ |
| D | generic_layout_optimizer_transposer_test.cc | 1639 auto* m_node = context.graph_view->GetNode("merge"); in TEST_F() local
1640 ASSERT_NE(m_node, nullptr); in TEST_F()
1641 ASSERT_EQ(m_node->NumRegularFanins(), 2); in TEST_F()
1642 VerifyRegularFaninMatch(m_node, 0, input_transpose_node1->GetName(), 0); in TEST_F()
1643 VerifyRegularFaninMatch(m_node, 1, input_transpose_node2->GetName(), 0); in TEST_F()
1649 VerifyRegularFaninMatch(output_transpose_node, 0, m_node->GetName(), 0); in TEST_F()
1695 auto* m_node = context.graph_view->GetNode("merge"); in TEST_F() local
1696 ASSERT_NE(m_node, nullptr); in TEST_F()
1697 ASSERT_EQ(m_node->NumRegularFanins(), 2); in TEST_F()
1698 VerifyRegularFaninMatch(m_node, 0, in TEST_F()
[all …]
|
| /external/pytorch/test/onnx/ |
| D | test_utility_funs.py | 1084 m_node = [n for n in onnx_model.graph.node if n.op_type == "M"]
1086 m_node[0].attribute[0],
|