Lines Matching refs:aList
65045 ** Sort the elements in list aList using aContent[] as the sort key.
65047 ** larger aList[] values.
65049 ** The aList[] entries are indices into aContent[]. The values in
65050 ** aList[] are to be sorted so that for all J<K:
65052 ** aContent[aList[J]] < aContent[aList[K]]
65056 ** aContent[aList[X]] == aContent[aList[Y]]
65058 ** Keep the larger of the two values aList[X] and aList[Y] and discard
65064 ht_slot *aList, /* IN/OUT: List to sort */
65065 int *pnList /* IN/OUT: Number of elements in aList[] */
65068 int nList; /* Number of elements in aList */
65069 ht_slot *aList; /* Pointer to sub-list content */
65085 aMerge = &aList[iList];
65090 assert( p->aList && p->nList<=(1<<iSub) );
65091 assert( p->aList==&aList[iList&~((2<<iSub)-1)] );
65092 walMerge(aContent, p->aList, p->nList, &aMerge, &nMerge, aBuffer);
65094 aSub[iSub].aList = aMerge;
65104 assert( p->aList==&aList[nList&~((2<<iSub)-1)] );
65105 walMerge(aContent, p->aList, p->nList, &aMerge, &nMerge, aBuffer);
65108 assert( aMerge==aList );
65115 assert( aContent[aList[i]] > aContent[aList[i-1]] );
182854 ** in buffer aList[], size nList bytes.
182861 static int fts3DoclistCountDocids(char *aList, int nList){
182863 if( aList ){
182864 char *aEnd = &aList[nList]; /* Pointer to one byte after EOF */
182865 char *p = aList; /* Cursor */