Searched refs:removeNode (Results 1 – 12 of 12) sorted by relevance
66 d.removeNode(*it); in RunBasicTest()177 d.removeNode(lt); in RunRemoveNodeTest()193 d.removeNode(l2); in RunRemoveNodeTest()194 d.removeNode(l3); in RunRemoveNodeTest()226 d.removeNode(lt); in RunRemoveNodeTest()477 d.removeNode(node[i]); in RunRemoveEdgesTest()
75 void removeNode(AlignedBlockNode* tmp) in AlignedBlockListImpl()252 removeNode(tmp); in AlignedBlockListImpl()259 removeNode(tmp); in AlignedBlockListImpl()
182 dd.removeNode(m->id); in MutexDestroy()
188 void removeNode(uptr node) { in removeNode() function
183 dd.removeNode(m->id); in MutexDestroy()
192 void removeNode(uptr node) { in removeNode() function
181 dd.removeNode(m->id); in MutexDestroy()
190 void removeNode(uptr node) { in removeNode() function
242 bool removeNode(NodeType &N) { in removeNode() function
296 Graph.removeNode(B); in mergeNodes()
585 void removeNode(NodeId NId) { in removeNode() function
211240 static int removeNode(Rtree *pRtree, RtreeNode *pNode, int iHeight){211339 rc = removeNode(pRtree, pNode, iHeight);211479 rc = removeNode(pRtree, pChild, pRtree->iDepth-1);