OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:m_children
(Results
1 - 19
of
19
) 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
254
bool hasChildren (void) const { return !
m_children
.empty(); }
260
void addChild (CaseTreeNode* child) {
m_children
.push_back(child); }
272
std::vector<CaseTreeNode*>
m_children
;
member in class:tcu::CaseTreeNode
277
for (vector<CaseTreeNode*>::const_iterator i =
m_children
.begin(); i !=
m_children
.end(); ++i)
283
for (int ndx = 0; ndx < (int)
m_children
.size(); ++ndx)
285
if (
m_children
[ndx]->getName() == name)
299
return ndx == NOT_FOUND ? DE_NULL :
m_children
[ndx];
305
return ndx == NOT_FOUND ? DE_NULL :
m_children
[ndx];
tcuTestCase.hpp
129
std::vector<TestNode*>
m_children
;
member in class:tcu::TestNode
/external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/CollisionShapes/
btCompoundShape.cpp
38
m_children
.reserve(initialChildCapacity);
82
size_t index =
m_children
.size();
86
m_children
.push_back(child);
92
m_children
[childIndex].m_transform = newChildTransform;
98
m_children
[childIndex].m_childShape->getAabb(newChildTransform,localAabbMin,localAabbMax);
100
//int index =
m_children
.size()-1;
101
m_dynamicAabbTree->update(
m_children
[childIndex].m_node,bounds);
113
btAssert(childShapeIndex >=0 && childShapeIndex <
m_children
.size());
116
m_dynamicAabbTree->remove(
m_children
[childShapeIndex].m_node);
118
m_children
.swap(childShapeIndex,m_children.size()-1)
[
all
...]
btCompoundShape.h
57
btAlignedObjectArray<btCompoundShapeChild>
m_children
;
variable
87
return int (
m_children
.size());
92
return
m_children
[index].m_childShape;
96
return
m_children
[index].m_childShape;
101
return
m_children
[index].m_transform;
105
return
m_children
[index].m_transform;
114
return &
m_children
[0];
/external/skia/src/utils/
SkLayer.cpp
88
return
m_children
.count();
92
if ((unsigned)index < (unsigned)
m_children
.count()) {
93
SkASSERT(
m_children
[index]->fParent == this);
94
return
m_children
[index];
106
*
m_children
.append() = child;
112
int index = fParent->
m_children
.find(this);
114
fParent->
m_children
.remove(index);
121
int count =
m_children
.count();
123
SkLayer* child =
m_children
[i];
128
m_children
.reset()
[
all
...]
/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/skia/include/utils/
SkLayer.h
125
SkTDArray<SkLayer*>
m_children
;
member in class:SkLayer
/external/eclipse-windowbuilder/propertysheet/src/org/eclipse/wb/internal/core/model/property/table/
PropertyTable.java
1359
private List<PropertyInfo>
m_children
;
field in class:PropertyTable.PropertyInfo
[
all
...]
/prebuilts/tools/common/m2/repository/com/android/tools/external/propertysheet/1.0/
propertysheet-1.0.jar
/external/emma/lib/
emma.jar
/external/guice/lib/build/
felix-2.0.5.jar
/external/owasp/sanitizer/tools/emma/lib/
emma.jar
/prebuilts/devtools/tools/lib/
emma.jar
emma_device.jar
Completed in 4299 milliseconds