Lines Matching defs:aContent
46701 ** aContent[aLeft[]] and aContent[aRight[]]. Upon entry, the following
46704 ** aContent[aLeft[J]] < aContent[aLeft[K]]
46705 ** aContent[aRight[J]] < aContent[aRight[K]]
46712 ** The aContent[aLeft[X]] values will be unique for all X. And the
46713 ** aContent[aRight[X]] values will be unique too. But there might be
46716 ** aLeft[X]!=aRight[Y] && aContent[aLeft[X]] == aContent[aRight[Y]]
46721 const u32 *aContent, /* Pages in wal - keys for the sort */
46740 && (iRight>=nRight || aContent[aLeft[iLeft]]<aContent[aRight[iRight]])
46746 dbpage = aContent[logpage];
46749 if( iLeft<nLeft && aContent[aLeft[iLeft]]==dbpage ) iLeft++;
46751 assert( iLeft>=nLeft || aContent[aLeft[iLeft]]>dbpage );
46752 assert( iRight>=nRight || aContent[aRight[iRight]]>dbpage );
46761 ** Sort the elements in list aList using aContent[] as the sort key.
46765 ** The aList[] entries are indices into aContent[]. The values in
46768 ** aContent[aList[J]] < aContent[aList[K]]
46772 ** aContent[aList[X]] == aContent[aList[Y]]
46778 const u32 *aContent, /* Pages in wal */
46806 walMerge(aContent, p->aList, p->nList, &aMerge, &nMerge, aBuffer);
46817 walMerge(aContent, p->aList, p->nList, &aMerge, &nMerge, aBuffer);
46827 assert( aContent[aList[i]] > aContent[aList[i-1]] );