Searched refs:prevNode (Results 1 - 2 of 2) sorted by relevance

/xsrc/external/mit/glu/dist/src/libnurbs/nurbtess/
H A DpartitionY.cc769 treeNode* prevNode = TreeNodeFind(searchTree, prevEdge, ( Int (*) (void *, void *))compEdges); local in function:sweepY
770 assert(prevNode);
771 treeNode* pred = TreeNodePredecessor(prevNode);
772 searchTree = TreeNodeDeleteSingleNode(searchTree, prevNode);
781 treeNode* prevNode = TreeNodeMake(prevEdge); local in function:sweepY
783 searchTree = TreeNodeInsert(searchTree, prevNode, ( Int (*) (void *, void *))compEdges);
788 treeNode* rightEdge = TreeNodeSuccessor(prevNode);
804 treeNode* prevNode = TreeNodeFind(searchTree, prevEdge, ( Int (*) (void *, void *))compEdges); local in function:sweepY
807 treeNode* leftEdge = TreeNodePredecessor(prevNode);
818 searchTree = TreeNodeDeleteSingleNode(searchTree, prevNode);
[all...]
H A DmonoChain.cc481 treeNode* prevNode = TreeNodeFind(searchTree, vert->getPrev(), (Int (*) (void *, void *))compChains); local in function:MC_sweepY
487 treeNode* leftEdge = TreeNodePredecessor(prevNode);
509 searchTree = TreeNodeDeleteSingleNode(searchTree, prevNode);
517 treeNode* prevNode = TreeNodeMake(vert->getPrev()); local in function:MC_sweepY
526 searchTree = TreeNodeInsert(searchTree, prevNode, (Int (*) (void *, void *))compChains);
533 treeNode* rightEdge = TreeNodeSuccessor(prevNode);

Completed in 3 milliseconds