Lines Matching defs:sorted
60 ** be sorted A-Z.
2934 ** to be sorted exceeds the page size times the minimum of the
10193 ** are sorted in the same order in which they were attached (or auto-attached)
13478 ** to be filled with content that is already in sorted order.
13486 #define BTREE_BULKLOAD 0x00000001 /* Used to full index in sorted order */
14492 PgHdr *pDirty; /* Transient list of dirty sorted by pgno */
14573 /* Get a list of all dirty pages in the cache, sorted by page number */
45938 ** Return a list of all dirty pages in the cache, sorted by page number.
47334 ** elements of the RowSet in sorted order. Once this extraction
47436 #define ROWSET_SORTED 0x01 /* True if RowSet.pEntry is sorted */
47548 ** assumed to each already be in sorted order.
47551 struct RowSetEntry *pA, /* First sorted list to be merged */
47552 struct RowSetEntry *pB /* Second sorted list to be merged */
47637 ** Convert a sorted list of elements (connected by pRight) into a binary
47682 ** Convert a sorted list of elements into a binary tree. Make the tree
47721 /* Merge the forest into a single sorted list on first call */
51136 ** The list of pages passed into this routine is always sorted by page number.
57028 ** This function merges two sorted lists into a single sorted list.
57096 ** aList[] are to be sorted so that for all J<K:
57232 ht_slot *aIndex; /* Sorted index for this segment */
59518 ** | cell pointer | | 2 bytes per cell. Sorted order.
59548 ** content area. The cell pointers occur in sorted order. The system strives
60165 ** connected by pNext and pPrev should be in sorted order by
61817 /* pageFindSlot() has already verified that free blocks are sorted
66969 ** sorted order. This invariants arise because multiple overflows can
66971 ** balancing, and the dividers are adjacent and sorted.
66973 assert( j==0 || pPage->aiOvfl[j-1]<(u16)i ); /* Overflows in sorted order */
76829 ** and reals) sorted numerically, followed by text ordered by the collating
84920 ** Jump to P2 if there are no records to be sorted.
85056 ** invoked. This opcode advances the cursor to the next sorted
85057 ** record, or jumps to P2 if there are no more sorted records.
87819 ** algorithm that is efficient even if the number of elements being sorted
87837 ** first sorted element.
87839 ** sqlite3VdbeSorterNext() Advance the read cursor to the next sorted
87874 ** a threshold, when Rewind() is called the set of records is sorted using
87880 ** threshold, then the set of records currently in memory are sorted and
87907 ** final PMA. So at this point the data is stored in some number of sorted
87918 ** merged T bytes of data into a single sorted PMA, the main thread
87964 typedef struct SorterRecord SorterRecord; /* A record being sorted */
87980 ** An in-memory list of objects to be sorted.
87996 ** combined into one big PMA in order to be able to step through the sorted
88144 ** PMA, in sorted order. The next key to be read is cached in nKey/aKey.
88180 ** sorted record data from pMerger.
88239 ** is full, the list is sorted. As part of the sorting process, it is
88713 ** records being sorted. However, if the value passed as argument nField
88718 ** of the records being sorted. So if the sort is stable, there is never
88826 ** Free the list of sorted records starting at pRecord.
89137 ** Merge the two sorted lists p1 and p2 into a single list.
89459 ** is sorted from oldest to newest, so pReadr1 contains older values
90365 ** in sorted order.
113054 ** index will be populated by inserting keys in strictly sorted
113064 ** sorted order. */
119189 int regData, /* First register holding data to be sorted */
119290 ** the same iteration of the inner loop are in sorted order, then
119431 ** This allows the p->pEList field to be omitted from the sorted record,
119898 SelectDest *pDest /* Write the sorted results here */
124175 ** being unused if the data can be extracted in pre-sorted order.
124308 ** but not actually sorted. Either way, record the fact that the
124435 ** in sorted order
129059 u8 sorted; /* True if really sorted (not just grouped) */
132971 ** Return FALSE if the output needs to be sorted.
132982 ** sorted. As long as rows are sorted for just the innermost loop, this
136720 ** whether or not the rows are really being delivered in sorted order, or
136724 ** true if the rows really will be sorted in the specified order, or false
136739 return pWInfo->sorted;
136797 ** Assume that the total number of output rows that will need to be sorted
137156 assert( pWInfo->sorted==0 );
137158 pWInfo->sorted = 1;
147954 ** A doclist (document list) holds a docid-sorted list of hits for a
148034 ** the %_segments table in sorted order. This means that when the end
148137 ** parallel, performing a straightforward sorted merge. Since segment
150929 ** into *pp contains all positions of both *pp1 and *pp2 in sorted
151268 ** sorted in either ascending or descending order.
151275 ** input doclists are sorted in ascending order, parameter bDescDoclist
151276 ** should be false. If they are sorted in ascending order, it should be
151372 ** If the docids in the input doclists are sorted in ascending order,
151373 ** parameter bDescDoclist should be false. If they are sorted in ascending
153137 ** The doclist may be sorted in ascending (parameter bDescIdx==0) or
160761 ** the final (nSegment-nSuspect) members are already in sorted order
160763 ** the array around until all entries are in sorted order.
160788 /* Check that the list really is sorted now. */
164802 ** list is a list of unique integers, sorted from smallest to largest. Each
172155 ** updates are done in sorted key order.
172315 ** tables within the RBU database are always processed in order sorted by
172422 ** table in "rowid" order is roughly the same as reading them sorted by
172424 ** words, rows should be sorted using the destination table PRIMARY KEY
174738 /* Create the SELECT statement to read keys in sorted order */
177653 ** If the paths are sorted using the BINARY collation sequence, then
193737 Fts5HashEntry *pScanNext; /* Next entry in sorted order */
194056 ** each sorted in key order. This function merges the two lists into a
194101 ** in sorted order. The hash table is cleared before returning. It is
206854 ** are already in sorted order. */
