Lines Matching refs:aList
51751 ** Sort the elements in list aList using aContent[] as the sort key.
51753 ** larger aList[] values.
51755 ** The aList[] entries are indices into aContent[]. The values in
51756 ** aList[] are to be sorted so that for all J<K:
51758 ** aContent[aList[J]] < aContent[aList[K]]
51762 ** aContent[aList[X]] == aContent[aList[Y]]
51764 ** Keep the larger of the two values aList[X] and aList[Y] and discard
51770 ht_slot *aList, /* IN/OUT: List to sort */
51771 int *pnList /* IN/OUT: Number of elements in aList[] */
51774 int nList; /* Number of elements in aList */
51775 ht_slot *aList; /* Pointer to sub-list content */
51791 aMerge = &aList[iList];
51796 assert( p->aList && p->nList<=(1<<iSub) );
51797 assert( p->aList==&aList[iList&~((2<<iSub)-1)] );
51798 walMerge(aContent, p->aList, p->nList, &aMerge, &nMerge, aBuffer);
51800 aSub[iSub].aList = aMerge;
51810 assert( p->aList==&aList[nList&~((2<<iSub)-1)] );
51811 walMerge(aContent, p->aList, p->nList, &aMerge, &nMerge, aBuffer);
51814 assert( aMerge==aList );
51821 assert( aContent[aList[i]] > aContent[aList[i-1]] );
138935 ** in buffer aList[], size nList bytes.
138942 static int fts3DoclistCountDocids(char *aList, int nList){
138944 if( aList ){
138945 char *aEnd = &aList[nList]; /* Pointer to one byte after EOF */
138946 char *p = aList; /* Cursor */
