| /external/deqp/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 | tcuCommandLine.cpp | 271 bool hasChildren (void) const { return !m_children.empty(); } in hasChildren()
277 void addChild (CaseTreeNode* child) { m_children.push_back(child); } in addChild()
289 std::vector<CaseTreeNode*> m_children; member in tcu::CaseTreeNode
294 for (vector<CaseTreeNode*>::const_iterator i = m_children.begin(); i != m_children.end(); ++i) in ~CaseTreeNode()
300 for (int ndx = 0; ndx < (int)m_children.size(); ++ndx) in findChildNdx()
302 if (m_children[ndx]->getName() == name) in findChildNdx()
316 return ndx == NOT_FOUND ? DE_NULL : m_children[ndx]; in getChild()
322 return ndx == NOT_FOUND ? DE_NULL : m_children[ndx]; in getChild()
|
| D | tcuTestCase.hpp | 129 std::vector<TestNode*> m_children; member in tcu::TestNode
|
| /external/emma/core/java12/com/vladium/emma/report/ |
| D | Item.java | 31 return m_children.size (); in getChildCount()
41 return m_children.iterator (); in getChildren()
52 final IItem [] items = new IItem [m_children.size ()]; in getChildren()
53 m_children.toArray (items); in getChildren()
82 for (Iterator children = m_children.iterator (); children.hasNext (); ) in getAggregate()
137 m_children.add (item); in addChild()
150 m_children = new ArrayList (); in Item()
159 private final List m_children; field in Item
|
| /external/antlr/runtime/Cpp/include/ |
| D | antlr3commontree.inl | 16 :m_children( ctree.m_children)
57 return m_children;
63 return m_children;
69 return &m_children;
164 if( m_children.empty() )
167 return m_children.erase( m_children.begin() + i);
181 if ( m_children.empty() )
299 if ( !m_children.empty() )
301 s = m_children.size();
308 t = m_children[i];
[all …]
|
| D | antlr3commontree.hpp | 56 ChildrenType m_children; member in CommonTree
|
| /external/catch2/include/internal/ |
| D | catch_test_case_tracker.cpp | 91 return !m_children.empty(); in hasChildren()
96 m_children.push_back( child ); in addChild()
100 auto it = std::find_if( m_children.begin(), m_children.end(), in findChild()
106 return( it != m_children.end() ) in findChild()
147 if( m_children.empty() || m_children.back()->isComplete() ) in close()
|
| D | catch_test_case_tracker.h | 102 Children m_children; variable
|
| D | catch_run_context.cpp | 54 m_children.clear(); in close()
|
| /external/deqp/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
|
| /external/deqp/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()
|
| /external/bcc/tests/cc/ |
| D | catch.hpp | 5557 Children m_children; member in Catch::TestCaseTracking::TrackerBase
5581 return !m_children.empty(); in hasChildren()
5585 m_children.push_back( child ); in addChild()
5589 …Children::const_iterator it = std::find_if( m_children.begin(), m_children.end(), TrackerHasName( … in findChild()
5590 return( it != m_children.end() ) in findChild()
5632 if( m_children.empty() || m_children.back()->isComplete() ) in close()
5726 m_children.clear(); in moveNext()
|
| /external/catch2/single_include/catch2/ |
| D | catch.hpp | 5854 Children m_children; member in Catch::TestCaseTracking::TrackerBase
10284 m_children.clear(); in close()
11937 return !m_children.empty(); in hasChildren()
11941 m_children.push_back( child ); in addChild()
11945 auto it = std::find_if( m_children.begin(), m_children.end(), in findChild()
11951 return( it != m_children.end() ) in findChild()
11992 if( m_children.empty() || m_children.back()->isComplete() ) in close()
|