Lines Matching defs:nLeft
1873 int nLeft = nIdx/2;
1874 int nRight = nIdx-nLeft;
1876 int *aRight = &aIdx[nLeft];
1878 SortByDistance(aLeft, nLeft, aDistance, aSpare);
1881 memcpy(aSpare, aLeft, sizeof(int)*nLeft);
1884 while( iLeft<nLeft || iRight<nRight ){
1885 if( iLeft==nLeft ){
1942 int nLeft = nIdx/2;
1943 int nRight = nIdx-nLeft;
1945 int *aRight = &aIdx[nLeft];
1947 SortByDimension(pRtree, aLeft, nLeft, iDim, aCell, aSpare);
1950 memcpy(aSpare, aLeft, sizeof(int)*nLeft);
1952 while( iLeft<nLeft || iRight<nRight ){
1957 if( (iLeft!=nLeft) && ((iRight==nRight)
2029 int nLeft;
2032 nLeft=RTREE_MINCELLS(pRtree);
2033 nLeft<=(nCell-RTREE_MINCELLS(pRtree));
2034 nLeft++
2045 if( kk<nLeft ){
2055 if( (nLeft==RTREE_MINCELLS(pRtree))
2059 iBestLeft = nLeft;