OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:m_children
(Results
1 - 17
of
17
) sorted by null
/external/emma/core/java12/com/vladium/emma/report/
Item.java
31
return
m_children
.size ();
41
return
m_children
.iterator ();
52
final IItem [] items = new IItem [
m_children
.size ()];
53
m_children
.toArray (items);
82
for (Iterator children =
m_children
.iterator (); children.hasNext (); )
137
m_children
.add (item);
150
m_children
= new ArrayList ();
159
private final List
m_children
;
field in class:Item
/external/deqp/framework/common/
tcuTestCase.cpp
74
for (int i = 0; i < (int)
m_children
.size(); i++)
75
res.push_back(
m_children
[i]);
83
for (int i = 0; i < (int)
m_children
.size(); i++)
85
if (deStringEqual(node->getName(),
m_children
[i]->getName()))
94
if (!
m_children
.empty())
95
DE_ASSERT(getTestNodeTypeClass(
m_children
.front()->getNodeType()) == getTestNodeTypeClass(node->getNodeType()));
97
m_children
.push_back(node);
106
for (int i = 0; i < (int)
m_children
.size(); i++)
107
delete
m_children
[i];
108
m_children
.clear()
[
all
...]
tcuCommandLine.cpp
271
bool hasChildren (void) const { return !
m_children
.empty(); }
277
void addChild (CaseTreeNode* child) {
m_children
.push_back(child); }
289
std::vector<CaseTreeNode*>
m_children
;
member in class:tcu::CaseTreeNode
294
for (vector<CaseTreeNode*>::const_iterator i =
m_children
.begin(); i !=
m_children
.end(); ++i)
300
for (int ndx = 0; ndx < (int)
m_children
.size(); ++ndx)
302
if (
m_children
[ndx]->getName() == name)
316
return ndx == NOT_FOUND ? DE_NULL :
m_children
[ndx];
322
return ndx == NOT_FOUND ? DE_NULL :
m_children
[ndx];
tcuTestCase.hpp
129
std::vector<TestNode*>
m_children
;
member in class:tcu::TestNode
/external/catch2/include/internal/
catch_test_case_tracker.cpp
91
return !
m_children
.empty();
96
m_children
.push_back( child );
100
auto it = std::find_if(
m_children
.begin(),
m_children
.end(),
106
return( it !=
m_children
.end() )
147
if(
m_children
.empty() ||
m_children
.back()->isComplete() )
catch_test_case_tracker.h
102
Children
m_children
;
member in class:Catch::TestCaseTracking::TrackerBase
catch_run_context.cpp
54
m_children
.clear();
/external/deqp/executor/
xeTestCase.hpp
93
int getNumChildren (void) const { return (int)
m_children
.size(); }
94
TestNode* getChild (int ndx) { return
m_children
[ndx]; }
95
const TestNode* getChild (int ndx) const { return
m_children
[ndx]; }
107
std::vector<TestNode*>
m_children
;
member in class:xe::TestGroup
110
// For adding TestCase to
m_children
. \todo [2012-06-15 pyry] Is the API broken perhaps?
xeTestCase.cpp
99
m_parent->
m_children
.push_back(this);
189
for (std::vector<TestNode*>::iterator i =
m_children
.begin(); i !=
m_children
.end(); i++)
210
for (vector<TestNode*>::const_iterator iter =
m_children
.begin(); iter !=
m_children
.end(); iter++)
/external/deqp/framework/randomshaders/
rsgStatement.cpp
155
for (vector<Statement*>::iterator i =
m_children
.begin(); i !=
m_children
.end(); i++)
157
m_children
.clear();
164
m_children
.push_back(statement);
175
if ((int)
m_children
.size() < m_numChildrenToCreate)
207
for (vector<Statement*>::const_reverse_iterator i =
m_children
.rbegin(); i !=
m_children
.rend(); i++)
215
for (vector<Statement*>::const_reverse_iterator i =
m_children
.rbegin(); i !=
m_children
.rend(); i++)
rsgStatement.hpp
109
std::vector<Statement*>
m_children
;
member in class:rsg::BlockStatement
/external/antlr/runtime/Cpp/include/
antlr3commontree.hpp
56
ChildrenType
m_children
;
member in class:CommonTree
/external/bcc/tests/cc/
catch.hpp
[
all
...]
/external/catch2/single_include/catch2/
catch.hpp
[
all
...]
/external/emma/lib/
emma.jar
/external/guice/lib/build/
felix-2.0.5.jar
/external/owasp/sanitizer/tools/emma/lib/
emma.jar
Completed in 506 milliseconds