Lines Matching defs:aRight
45723 ** aLeft[] and aRight[] are arrays of indices. The sort key is
45724 ** aContent[aLeft[]] and aContent[aRight[]]. Upon entry, the following
45728 ** aContent[aRight[J]] < aContent[aRight[K]]
45730 ** This routine overwrites aRight[] with a new (probably longer) sequence
45731 ** of indices such that the aRight[] contains every index that appears in
45732 ** either aLeft[] or the old aRight[] and such that the second condition
45736 ** aContent[aRight[X]] values will be unique too. But there might be
45739 ** aLeft[X]!=aRight[Y] && aContent[aLeft[X]] == aContent[aRight[Y]]
45741 ** When that happens, omit the aLeft[X] and use the aRight[Y] index.
45752 int iRight = 0; /* Current index in aRight */
45755 ht_slot *aRight = *paRight;
45763 && (iRight>=nRight || aContent[aLeft[iLeft]]<aContent[aRight[iRight]])
45767 logpage = aRight[iRight++];
45775 assert( iRight>=nRight || aContent[aRight[iRight]]>dbpage );
116363 char *aRight, int *pnRight /* IN/OUT: Right/output doclist */
116369 char *pEnd2 = &aRight[*pnRight];
116371 char *p2 = aRight;
116374 char *aOut = aRight;
128905 int *aRight = &aIdx[nLeft];
128908 SortByDistance(aRight, nRight, aDistance, aSpare);
128915 aIdx[iLeft+iRight] = aRight[iRight];
128922 float fRight = aDistance[aRight[iRight]];
128927 aIdx[iLeft+iRight] = aRight[iRight];
128974 int *aRight = &aIdx[nLeft];
128977 SortByDimension(pRtree, aRight, nRight, iDim, aCell, aSpare);
128984 double xright1 = DCOORD(aCell[aRight[iRight]].aCoord[iDim*2]);
128985 double xright2 = DCOORD(aCell[aRight[iRight]].aCoord[iDim*2+1]);
128993 aIdx[iLeft+iRight] = aRight[iRight];