Lines Matching defs:group
258 void addChildGroupsToMap (std::map<std::string, TestGroup*>& groupMap, TestGroup* group)
260 for (int ndx = 0; ndx < group->getNumChildren(); ndx++)
262 TestNode* node = group->getChild(ndx);
328 static void addChildren (std::set<const TestNode*>& nodeSet, const TestGroup* group)
330 for (int ndx = 0; ndx < group->getNumChildren(); ndx++)
332 const TestNode* child = group->getChild(ndx);
340 static void removeChildren (std::set<const TestNode*>& nodeSet, const TestGroup* group)
342 for (int ndx = 0; ndx < group->getNumChildren(); ndx++)
344 const TestNode* child = group->getChild(ndx);
352 static bool hasChildrenInSet (const std::set<const TestNode*>& nodeSet, const TestGroup* group)
354 for (int ndx = 0; ndx < group->getNumChildren(); ndx++)
356 if (nodeSet.find(group->getChild(ndx)) != nodeSet.end())
362 static void removeEmptyGroups (std::set<const TestNode*>& nodeSet, const TestGroup* group)
364 if (!hasChildrenInSet(nodeSet, group))
366 nodeSet.erase(group);
367 if (group->getParent() != DE_NULL)
368 removeEmptyGroups(nodeSet, group->getParent());
465 const TestGroup* group = m_iterStack.back().group;
467 int numChildren = group ? group->getNumChildren() : 1;
496 DE_ASSERT(m_iterStack[0].group == DE_NULL && m_iterStack[0].childNdx == 0);
500 return m_iterStack.back().group->getChild(m_iterStack.back().childNdx);
