Searched refs:m_children (Results 1 – 8 of 8) sorted by relevance
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()
124 bool empty () const { return m_children.empty(); } in empty()138 std::vector<TestNode*> m_children; member in tcu::TestNode
332 bool hasChildren (void) const { return !m_children.empty(); } in hasChildren()338 void addChild (CaseTreeNode* child) { m_children.push_back(child); } in addChild()350 std::vector<CaseTreeNode*> m_children; member in tcu::CaseTreeNode355 for (vector<CaseTreeNode*>::const_iterator i = m_children.begin(); i != m_children.end(); ++i) in ~CaseTreeNode()361 for (int ndx = 0; ndx < (int)m_children.size(); ++ndx) in findChildNdx()363 if (m_children[ndx]->getName() == name) in findChildNdx()377 return ndx == NOT_FOUND ? DE_NULL : m_children[ndx]; in getChild()383 return ndx == NOT_FOUND ? DE_NULL : m_children[ndx]; in getChild()
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()
109 std::vector<Statement*> m_children; member in rsg::BlockStatement
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
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()
7571 Children m_children; member in Catch::TestCaseTracking::TrackerBase12649 if ( m_children.empty() ) { in close()12654 m_children.begin(), in close()12655 m_children.end(), in close()12658 } ) != m_children.end() ) { in close()12682 for ( auto const& child : m_children ) { in close()12702 m_children.clear(); in close()14421 return !m_children.empty(); in hasChildren()14425 m_children.push_back( child ); in addChild()14429 auto it = std::find_if( m_children.begin(), m_children.end(), in findChild()[all …]