Lines Matching refs:leftEdge
487 treeNode* leftEdge = TreeNodePredecessor(prevNode);
489 if(leftEdge == NULL || rightEdge == NULL)
495 directedLine* leftEdgeDline = ((monoChain* ) leftEdge->key)->find(keyY);
532 treeNode* leftEdge = TreeNodePredecessor(thisNode);
534 if(leftEdge == NULL || rightEdge == NULL)
539 //printf("leftEdge is %i, rightEdge is %i\n", leftEdge, rightEdge);
540 directedLine* leftEdgeDline = ((monoChain*) leftEdge->key)->find(keyY);
587 directedLine* leftEdge = ranges[i]->left;
590 directedLine* leftVert = leftEdge;
617 directedLine* leftEdge = ranges[i]->left;
619 directedLine* leftVert = leftEdge->getNext();