Lines Matching defs:endLeftIndex
1986 Int endLeftIndex,
2002 endLeftIndex,
2013 Int endLeftIndex,
2019 if(checkMiddle(leftChain, beginLeftIndex, endLeftIndex,
2025 sampleLeftOneGridStepNoMiddle(leftChain, beginLeftIndex, endLeftIndex, leftGridChain, leftGridChainStartIndex, pStream);
2070 for(i=beginLeftIndex; i<endLeftIndex; i++)
2080 sline = new sampledLine(leftChain->getVertex(endLeftIndex), vert2);
2118 * of endLeftIndex, endLeftIndex-1, ...,
2120 i=endLeftIndex;
2122 for(i=endLeftIndex-1; i>=beginLeftIndex; i--){
2130 /*from endLeftIndex to i+1 is strictly U- monotone */
2131 /*if i+1==endLeftIndex and the vertex and leftchain is on the second gridline, then
2132 *we should use 2 vertices on the leftchain. If we only use one (endLeftIndex), then we
2135 if(i+1 == endLeftIndex && leftChain->getVertex(endLeftIndex)[1] == leftGridChain->get_v_value(1+leftGridChainStartIndex))
2138 Int j = beginLeftIndex/*endLeftIndex*/+1;
2143 j = findIncreaseChainFromBegin(leftChain, beginLeftIndex, i+1/*endLeftIndex*/);
2181 stripOfFanLeft(leftChain, endLeftIndex, i+1, leftGridChain->getGrid(),
2214 for(i=beginLeftIndex+1; i<=endLeftIndex; i++){
2248 endLeftIndex,