Searched refs:findNode (Results 1 – 4 of 4) sorted by relevance
200 const_iterator findNode(const NodeType &N) const { in findNode() function204 iterator findNode(const NodeType &N) { in findNode() function206 static_cast<const DGraphType &>(*this).findNode(N)); in findNode()211 if (findNode(N) != Nodes.end()) in addNode()237 iterator IT = findNode(N); in removeNode()259 assert(findNode(Src) != Nodes.end() && "Src node should be present."); in connect()260 assert(findNode(Dst) != Nodes.end() && "Dst node should be present."); in connect()
52 EXPECT_FALSE (cTestList.findNode (pPointer)); in TEST()55 EXPECT_TRUE (cTestList.findNode (pPointer)); in TEST()266 EXPECT_TRUE (cNonDuplicatedIntList.findNode (pObject2)); in TEST()268 EXPECT_TRUE (cNonDuplicatedIntList.findNode (pObject3)); in TEST()321 EXPECT_TRUE (cThreadList.findNode (pTaskThread2)); in TEST()323 EXPECT_TRUE (cThreadList.findNode (pTaskThread3)); in TEST()
175 bool findNode (TNodeType* pNodeTarget) { in findNode() function270 if ((NULL != pNode) && (this->findNode (pNode))) { //not checking NULL for easier testing in push_back()
358 static const CaseTreeNode* findNode (const CaseTreeNode* root, const char* path) in findNode() function995 const CaseTreeNode* node = findNode(root, groupPath); in checkTestGroupName()1001 const CaseTreeNode* node = findNode(root, casePath); in checkTestCaseName()