Lines Matching defs:aContent
64985 ** aContent[aLeft[]] and aContent[aRight[]]. Upon entry, the following
64988 ** aContent[aLeft[J]] < aContent[aLeft[K]]
64989 ** aContent[aRight[J]] < aContent[aRight[K]]
64996 ** The aContent[aLeft[X]] values will be unique for all X. And the
64997 ** aContent[aRight[X]] values will be unique too. But there might be
65000 ** aLeft[X]!=aRight[Y] && aContent[aLeft[X]] == aContent[aRight[Y]]
65005 const u32 *aContent, /* Pages in wal - keys for the sort */
65024 && (iRight>=nRight || aContent[aLeft[iLeft]]<aContent[aRight[iRight]])
65030 dbpage = aContent[logpage];
65033 if( iLeft<nLeft && aContent[aLeft[iLeft]]==dbpage ) iLeft++;
65035 assert( iLeft>=nLeft || aContent[aLeft[iLeft]]>dbpage );
65036 assert( iRight>=nRight || aContent[aRight[iRight]]>dbpage );
65045 ** Sort the elements in list aList using aContent[] as the sort key.
65049 ** The aList[] entries are indices into aContent[]. The values in
65052 ** aContent[aList[J]] < aContent[aList[K]]
65056 ** aContent[aList[X]] == aContent[aList[Y]]
65062 const u32 *aContent, /* Pages in wal */
65092 walMerge(aContent, p->aList, p->nList, &aMerge, &nMerge, aBuffer);
65105 walMerge(aContent, p->aList, p->nList, &aMerge, &nMerge, aBuffer);
65115 assert( aContent[aList[i]] > aContent[aList[i-1]] );