Lines Matching defs:group
257 void addChildGroupsToMap (std::map<std::string, TestGroup*>& groupMap, TestGroup* group)
259 for (int ndx = 0; ndx < group->getNumChildren(); ndx++)
261 TestNode* node = group->getChild(ndx);
327 static void addChildren (std::set<const TestNode*>& nodeSet, const TestGroup* group)
329 for (int ndx = 0; ndx < group->getNumChildren(); ndx++)
331 const TestNode* child = group->getChild(ndx);
339 static void removeChildren (std::set<const TestNode*>& nodeSet, const TestGroup* group)
341 for (int ndx = 0; ndx < group->getNumChildren(); ndx++)
343 const TestNode* child = group->getChild(ndx);
351 static bool hasChildrenInSet (const std::set<const TestNode*>& nodeSet, const TestGroup* group)
353 for (int ndx = 0; ndx < group->getNumChildren(); ndx++)
355 if (nodeSet.find(group->getChild(ndx)) != nodeSet.end())
361 static void removeEmptyGroups (std::set<const TestNode*>& nodeSet, const TestGroup* group)
363 if (!hasChildrenInSet(nodeSet, group))
365 nodeSet.erase(group);
366 if (group->getParent() != DE_NULL)
367 removeEmptyGroups(nodeSet, group->getParent());
464 const TestGroup* group = m_iterStack.back().group;
466 int numChildren = group ? group->getNumChildren() : 1;
495 DE_ASSERT(m_iterStack[0].group == DE_NULL && m_iterStack[0].childNdx == 0);
499 return m_iterStack.back().group->getChild(m_iterStack.back().childNdx);