Lines Matching defs:aContent
45724 ** aContent[aLeft[]] and aContent[aRight[]]. Upon entry, the following
45727 ** aContent[aLeft[J]] < aContent[aLeft[K]]
45728 ** aContent[aRight[J]] < aContent[aRight[K]]
45735 ** The aContent[aLeft[X]] values will be unique for all X. And the
45736 ** aContent[aRight[X]] values will be unique too. But there might be
45739 ** aLeft[X]!=aRight[Y] && aContent[aLeft[X]] == aContent[aRight[Y]]
45744 const u32 *aContent, /* Pages in wal - keys for the sort */
45763 && (iRight>=nRight || aContent[aLeft[iLeft]]<aContent[aRight[iRight]])
45769 dbpage = aContent[logpage];
45772 if( iLeft<nLeft && aContent[aLeft[iLeft]]==dbpage ) iLeft++;
45774 assert( iLeft>=nLeft || aContent[aLeft[iLeft]]>dbpage );
45775 assert( iRight>=nRight || aContent[aRight[iRight]]>dbpage );
45784 ** Sort the elements in list aList using aContent[] as the sort key.
45788 ** The aList[] entries are indices into aContent[]. The values in
45791 ** aContent[aList[J]] < aContent[aList[K]]
45795 ** aContent[aList[X]] == aContent[aList[Y]]
45801 const u32 *aContent, /* Pages in wal */
45829 walMerge(aContent, p->aList, p->nList, &aMerge, &nMerge, aBuffer);
45840 walMerge(aContent, p->aList, p->nList, &aMerge, &nMerge, aBuffer);
45850 assert( aContent[aList[i]] > aContent[aList[i-1]] );