Lines Matching defs:aLeft
64984 ** aLeft[] and aRight[] are arrays of indices. The sort key is
64985 ** aContent[aLeft[]] and aContent[aRight[]]. Upon entry, the following
64988 ** aContent[aLeft[J]] < aContent[aLeft[K]]
64993 ** either aLeft[] or the old aRight[] and such that the second condition
64996 ** The aContent[aLeft[X]] values will be unique for all X. And the
65000 ** aLeft[X]!=aRight[Y] && aContent[aLeft[X]] == aContent[aRight[Y]]
65002 ** When that happens, omit the aLeft[X] and use the aRight[Y] index.
65006 ht_slot *aLeft, /* IN: Left hand input list */
65012 int iLeft = 0; /* Current index in aLeft */
65024 && (iRight>=nRight || aContent[aLeft[iLeft]]<aContent[aRight[iRight]])
65026 logpage = aLeft[iLeft++];
65033 if( iLeft<nLeft && aContent[aLeft[iLeft]]==dbpage ) iLeft++;
65035 assert( iLeft>=nLeft || aContent[aLeft[iLeft]]>dbpage );
65039 *paRight = aLeft;
65041 memcpy(aLeft, aTmp, sizeof(aTmp[0])*iOut);
182335 char *aLeft, int nLeft, /* Left doclist */
182342 char *pEnd1 = &aLeft[nLeft];
182344 char *p1 = aLeft;
203290 int *aLeft = aIdx;
203293 SortByDistance(aLeft, nLeft, aDistance, aSpare);
203296 memcpy(aSpare, aLeft, sizeof(int)*nLeft);
203297 aLeft = aSpare;
203304 aIdx[iLeft+iRight] = aLeft[iLeft];
203307 RtreeDValue fLeft = aDistance[aLeft[iLeft]];
203310 aIdx[iLeft+iRight] = aLeft[iLeft];
203359 int *aLeft = aIdx;
203362 SortByDimension(pRtree, aLeft, nLeft, iDim, aCell, aSpare);
203365 memcpy(aSpare, aLeft, sizeof(int)*nLeft);
203366 aLeft = aSpare;
203368 RtreeDValue xleft1 = DCOORD(aCell[aLeft[iLeft]].aCoord[iDim*2]);
203369 RtreeDValue xleft2 = DCOORD(aCell[aLeft[iLeft]].aCoord[iDim*2+1]);
203376 aIdx[iLeft+iRight] = aLeft[iLeft];
216157 ** Arguments aLeft and aRight are pointers to change records for table pTab.
216164 int bLeftPkOnly, /* True if aLeft[] contains PK fields only */
216165 u8 *aLeft, /* Change record */
216169 u8 *a1 = aLeft; /* Cursor to iterate through aLeft */
216193 ** Arguments aLeft and aRight both point to buffers containing change
216201 ** their. Otherwise, if aLeft contains a value, copy it. If neither
216208 u8 *aLeft,
216211 u8 *a1 = aLeft; /* Cursor used to iterate through aLeft */