Lines Matching refs:nLeft
2342 int nLeft = nIdx/2; in SortByDistance() local
2343 int nRight = nIdx-nLeft; in SortByDistance()
2345 int *aRight = &aIdx[nLeft]; in SortByDistance()
2347 SortByDistance(aLeft, nLeft, aDistance, aSpare); in SortByDistance()
2350 memcpy(aSpare, aLeft, sizeof(int)*nLeft); in SortByDistance()
2353 while( iLeft<nLeft || iRight<nRight ){ in SortByDistance()
2354 if( iLeft==nLeft ){ in SortByDistance()
2411 int nLeft = nIdx/2; in SortByDimension() local
2412 int nRight = nIdx-nLeft; in SortByDimension()
2414 int *aRight = &aIdx[nLeft]; in SortByDimension()
2416 SortByDimension(pRtree, aLeft, nLeft, iDim, aCell, aSpare); in SortByDimension()
2419 memcpy(aSpare, aLeft, sizeof(int)*nLeft); in SortByDimension()
2421 while( iLeft<nLeft || iRight<nRight ){ in SortByDimension()
2426 if( (iLeft!=nLeft) && ((iRight==nRight) in SortByDimension()
2497 int nLeft; in splitNodeStartree() local
2500 nLeft=RTREE_MINCELLS(pRtree); in splitNodeStartree()
2501 nLeft<=(nCell-RTREE_MINCELLS(pRtree)); in splitNodeStartree()
2502 nLeft++ in splitNodeStartree()
2513 if( kk<nLeft ){ in splitNodeStartree()
2523 if( (nLeft==RTREE_MINCELLS(pRtree)) in splitNodeStartree()
2527 iBestLeft = nLeft; in splitNodeStartree()