Lines Matching defs:aList
46761 ** Sort the elements in list aList using aContent[] as the sort key.
46763 ** larger aList[] values.
46765 ** The aList[] entries are indices into aContent[]. The values in
46766 ** aList[] are to be sorted so that for all J<K:
46768 ** aContent[aList[J]] < aContent[aList[K]]
46772 ** aContent[aList[X]] == aContent[aList[Y]]
46774 ** Keep the larger of the two values aList[X] and aList[Y] and discard
46780 ht_slot *aList, /* IN/OUT: List to sort */
46781 int *pnList /* IN/OUT: Number of elements in aList[] */
46784 int nList; /* Number of elements in aList */
46785 ht_slot *aList; /* Pointer to sub-list content */
46801 aMerge = &aList[iList];
46804 assert( p->aList && p->nList<=(1<<iSub) );
46805 assert( p->aList==&aList[iList&~((2<<iSub)-1)] );
46806 walMerge(aContent, p->aList, p->nList, &aMerge, &nMerge, aBuffer);
46808 aSub[iSub].aList = aMerge;
46816 assert( p->aList==&aList[nList&~((2<<iSub)-1)] );
46817 walMerge(aContent, p->aList, p->nList, &aMerge, &nMerge, aBuffer);
46820 assert( aMerge==aList );
46827 assert( aContent[aList[i]] > aContent[aList[i-1]] );
119485 ** in buffer aList[], size nList bytes.
119492 static int fts3DoclistCountDocids(char *aList, int nList){
119494 if( aList ){
119495 char *aEnd = &aList[nList]; /* Pointer to one byte after EOF */
119496 char *p = aList; /* Cursor */