Lines Matching defs:node
97 throw Error(std::string("Duplicate node '") + name + "' in '" + parent->getFullPath());
150 // Don't need to consider current node.
155 // Check if first component matches this node.
222 return matchingNode; // Last element in path, return matching node.
262 TestNode* node = group->getChild(ndx);
263 if (node->getNodeType() == TESTNODETYPE_GROUP)
265 TestGroup* childGroup = static_cast<TestGroup*>(node);
319 static void addNodeAndParents (std::set<const TestNode*>& nodeSet, const TestNode* node)
321 while (node != DE_NULL)
323 nodeSet.insert(node);
324 node = node->getParent();
374 void TestSet::add (const TestNode* node)
376 if (node->getNodeType() == TESTNODETYPE_TEST_CASE)
377 addCase(static_cast<const TestCase*>(node));
380 XE_CHECK(node->getNodeType() == TESTNODETYPE_GROUP ||
381 node->getNodeType() == TESTNODETYPE_ROOT);
382 addGroup(static_cast<const TestGroup*>(node));
397 void TestSet::remove (const TestNode* node)
399 if (node->getNodeType() == TESTNODETYPE_TEST_CASE)
400 removeCase(static_cast<const TestCase*>(node));
403 XE_CHECK(node->getNodeType() == TESTNODETYPE_GROUP ||
404 node->getNodeType() == TESTNODETYPE_ROOT);
405 removeGroup(static_cast<const TestGroup*>(node));
