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

/xsrc/external/mit/glu/dist/src/libnurbs/nurbtess/
H A DpartitionY.cc747 treeNode* thisNode = TreeNodeFind(searchTree, thisEdge, ( Int (*) (void *, void *))compEdges); local in function:sweepY
748 assert(thisNode);
750 treeNode* succ = TreeNodeSuccessor(thisNode);
752 searchTree = TreeNodeDeleteSingleNode(searchTree, thisNode);
780 treeNode* thisNode = TreeNodeMake(thisEdge); local in function:sweepY
782 searchTree = TreeNodeInsert(searchTree, thisNode, ( Int (*) (void *, void *))compEdges);
787 treeNode* leftEdge = TreeNodePredecessor(thisNode);
803 treeNode* thisNode = TreeNodeFind(searchTree, thisEdge, ( Int (*) (void *, void *))compEdges); local in function:sweepY
808 treeNode* rightEdge = TreeNodeSuccessor(thisNode);
817 searchTree = TreeNodeDeleteSingleNode(searchTree, thisNode);
[all...]
H A DmonoChain.cc476 treeNode* thisNode = TreeNodeFind(searchTree, vert, (Int (*) (void *, void *))compChains); local in function:MC_sweepY
488 treeNode* rightEdge = TreeNodeSuccessor(thisNode);
508 searchTree = TreeNodeDeleteSingleNode(searchTree, thisNode);
516 treeNode* thisNode = TreeNodeMake(vert); local in function:MC_sweepY
521 searchTree = TreeNodeInsert(searchTree, thisNode, (Int (*) (void *, void *))compChains);
532 treeNode* leftEdge = TreeNodePredecessor(thisNode);

Completed in 4 milliseconds