| /third_party/vk-gl-cts/framework/common/ |
| D | tcuTestCase.cpp | 74 for (int i = 0; i < (int)m_children.size(); i++) in getChildren()
75 res.push_back(m_children[i]); in getChildren()
83 for (int i = 0; i < (int)m_children.size(); i++) in addChild()
85 if (deStringEqual(node->getName(), m_children[i]->getName())) in addChild()
94 if (!m_children.empty()) in addChild()
95 …DE_ASSERT(getTestNodeTypeClass(m_children.front()->getNodeType()) == getTestNodeTypeClass(node->ge… in addChild()
97 m_children.push_back(node); in addChild()
106 for (int i = 0; i < (int)m_children.size(); i++) in deinit()
107 delete m_children[i]; in deinit()
108 m_children.clear(); in deinit()
|
| D | tcuTestCase.hpp | 124 bool empty () const { return m_children.empty(); } in empty()
138 std::vector<TestNode*> m_children; member in tcu::TestNode
|
| D | tcuCommandLine.cpp | 297 bool hasChildren (void) const { return !m_children.empty(); } in hasChildren()
303 void addChild (CaseTreeNode* child) { m_children.push_back(child); } in addChild()
315 std::vector<CaseTreeNode*> m_children; member in tcu::CaseTreeNode
320 for (vector<CaseTreeNode*>::const_iterator i = m_children.begin(); i != m_children.end(); ++i) in ~CaseTreeNode()
326 for (int ndx = 0; ndx < (int)m_children.size(); ++ndx) in findChildNdx()
328 if (m_children[ndx]->getName() == name) in findChildNdx()
342 return ndx == NOT_FOUND ? DE_NULL : m_children[ndx]; in getChild()
348 return ndx == NOT_FOUND ? DE_NULL : m_children[ndx]; in getChild()
|
| /third_party/boost/boost/graph/ |
| D | subgraph.hpp | 163 m_children.push_back(new subgraph< Graph >(*i)); in subgraph()
164 m_children.back()->m_parent = this; in subgraph()
170 for (typename ChildrenList::iterator i = m_children.begin(); in ~subgraph()
171 i != m_children.end(); ++i) in ~subgraph()
183 m_children.push_back(new subgraph< Graph >()); in create_subgraph()
184 m_children.back()->m_parent = this; in create_subgraph()
185 return *m_children.back(); in create_subgraph()
193 m_children.push_back(new subgraph< Graph >()); in create_subgraph()
194 m_children.back()->m_parent = this; in create_subgraph()
197 add_vertex(*first, *m_children.back()); in create_subgraph()
[all …]
|
| /third_party/vk-gl-cts/framework/randomshaders/ |
| D | rsgStatement.cpp | 155 for (vector<Statement*>::iterator i = m_children.begin(); i != m_children.end(); i++) in ~BlockStatement()
157 m_children.clear(); in ~BlockStatement()
164 m_children.push_back(statement); in addChild()
175 if ((int)m_children.size() < m_numChildrenToCreate) in createNextChild()
207 …for (vector<Statement*>::const_reverse_iterator i = m_children.rbegin(); i != m_children.rend(); i… in tokenize()
215 …for (vector<Statement*>::const_reverse_iterator i = m_children.rbegin(); i != m_children.rend(); i… in execute()
|
| D | rsgStatement.hpp | 109 std::vector<Statement*> m_children; member in rsg::BlockStatement
|
| /third_party/boost/boost/test/impl/ |
| D | test_tree.ipp | 244 m_children.push_back( tu->p_id );
323 for( test_unit_id_list::const_iterator it(m_children.begin()), ite(m_children.end());
344 test_unit_id_list::iterator it = std::find( m_children.begin(), m_children.end(), id );
346 if( it != m_children.end() )
347 m_children.erase( it );
355 BOOST_TEST_FOREACH( test_unit_id, id, m_children ) {
402 std::size_t total_children = suite.m_children.size();
405 traverse_test_tree( suite.m_children[i], V, ignore_status );
406 if( total_children > suite.m_children.size() )
407 total_children = suite.m_children.size();
|
| D | framework.ipp | 534 BOOST_TEST_FOREACH( test_unit_id, chld_id, ts.m_children )
538 BOOST_TEST_FOREACH( test_unit_id, chld_id, ts.m_children ) {
559 … BOOST_TEST_FOREACH( test_unit_id, chld_id, static_cast<test_suite const&>(tu).m_children )
577 … BOOST_TEST_FOREACH( test_unit_id, chld_id, static_cast<test_suite const&>(tu).m_children)
|
| /third_party/vk-gl-cts/executor/ |
| D | xeTestCase.hpp | 93 int getNumChildren (void) const { return (int)m_children.size(); } in getNumChildren()
94 TestNode* getChild (int ndx) { return m_children[ndx]; } in getChild()
95 const TestNode* getChild (int ndx) const { return m_children[ndx]; } in getChild()
107 std::vector<TestNode*> m_children; member in xe::TestGroup
|
| D | xeTestCase.cpp | 99 m_parent->m_children.push_back(this); in TestNode()
189 for (std::vector<TestNode*>::iterator i = m_children.begin(); i != m_children.end(); i++) in ~TestGroup()
210 for (vector<TestNode*>::const_iterator iter = m_children.begin(); iter != m_children.end(); iter++) in findChildNode()
|
| /third_party/boost/boost/test/tree/ |
| D | test_unit.hpp | 195 std::size_t size() const { return m_children.size(); } in size()
209 test_unit_id_list m_children; member in boost::unit_test::test_suite
|
| /third_party/boost/boost/property_tree/detail/ |
| D | ptree_implementation.hpp | 62 return *static_cast<base_container*>(s->m_children); in ch()
65 return *static_cast<const base_container*>(s->m_children); in ch()
180 : m_children(new typename subs::base_container) in basic_ptree()
186 : m_data(d), m_children(new typename subs::base_container) in basic_ptree()
193 m_children(new typename subs::base_container(subs::ch(&rhs))) in basic_ptree()
216 std::swap(m_children, rhs.m_children); in swap()
|
| /third_party/boost/boost/property_tree/ |
| D | ptree.hpp | 494 void* m_children; member in boost::property_tree::basic_ptree
|