Lines Matching defs:leftEnd
53 Int leftEnd,
61 assert(leftCorner <= leftEnd);
62 for(i=leftCorner; i<= leftEnd; i++)
66 if(ret_index_pass <= leftEnd)
68 for(i=ret_index_pass; i< leftEnd; i++)
234 Int leftEnd,
249 if(segIndexPass <= leftEnd) //from corner to pass-1 is <u
261 if(segIndexPass <= leftEnd) //segIndexpass and mono exist
268 monoTriangulation2(tempTop, botVertex, leftChain, segIndexMono, leftEnd,
281 Int leftEnd,
291 if(leftEnd< leftCorner){
297 findBotLeftSegment(leftChain, leftEnd, leftCorner, grid->get_u_value(leftU), segIndexMono, segIndexPass);
301 leftEnd,
312 Int leftEnd,
349 if(i> leftEnd) //left chain is doen , go through remaining right chain
369 for(k=i+1; k<= leftEnd; k++)
420 for(k=i+1; k<= leftEnd; k++)
454 Int leftEnd,
508 tempLeftEnd = leftEnd;
530 leftEnd,
547 if(findBotSeparator(leftChain, leftEnd, down_leftCornerIndex,
609 leftChain, segLeftMono, leftEnd,
653 leftChain, segLeftMono, leftEnd,
684 leftChain, down_leftCornerIndex, leftEnd,
693 leftEnd,
712 leftEnd,
731 Int leftEnd,
765 ActualLeftEnd = leftEnd;
770 ActualLeftStart = leftEnd+1; //meaning that there is no actual left section