Lines Matching defs:sorted
2390 ** to be sorted exceeds the page size times the minimum of the
2413 ** sorted records. However, if SQLite determines based on the declared type
2416 ** is stored in each sorted record and the required column values loaded
2417 ** from the database as records are returned in sorted order. The default
10025 ** virtual table outputs all rows in sorted order, then it is always safe for
10030 ** that the query planner does not need the rows to be returned in sorted order
10049 ** rows to be sorted.)^ ^The virtual table implementation is free to omit
11256 ** are sorted in the same order in which they were attached (or auto-attached)
15619 ** to be filled with content that is already in sorted order.
15627 #define BTREE_BULKLOAD 0x00000001 /* Used to full index in sorted order */
16509 PgHdr *pDirty; /* Transient list of dirty sorted by pgno */
16590 /* Get a list of all dirty pages in the cache, sorted by page number */
21238 ** be sorted A-Z.
53411 ** Return a list of all dirty pages in the cache, sorted by page number.
54838 ** elements of the RowSet in sorted order. Once this extraction
54940 #define ROWSET_SORTED 0x01 /* True if RowSet.pEntry is sorted */
55056 ** assumed to each already be in sorted order.
55059 struct RowSetEntry *pA, /* First sorted list to be merged */
55060 struct RowSetEntry *pB /* Second sorted list to be merged */
55145 ** Convert a sorted list of elements (connected by pRight) into a binary
55190 ** Convert a sorted list of elements into a binary tree. Make the tree
55229 /* Merge the forest into a single sorted list on first call */
58686 ** The list of pages passed into this routine is always sorted by page number.
64982 ** This function merges two sorted lists into a single sorted list.
65050 ** aList[] are to be sorted so that for all J<K:
67711 ** content area. The cell pointers occur in sorted order. The system strives
68355 ** connected by pNext and pPrev should be in sorted order by
75727 ** sorted order. This invariants arise because multiple overflows can
75729 ** balancing, and the dividers are adjacent and sorted.
75731 assert( j==0 || pPage->aiOvfl[j-1]<(u16)i ); /* Overflows in sorted order */
86904 ** and reals) sorted numerically, followed by text ordered by the collating
96458 ** Jump to P2 if there are no records to be sorted.
96580 ** invoked. This opcode advances the cursor to the next sorted
96581 ** record, or jumps to P2 if there are no more sorted records.
99794 ** algorithm that is efficient even if the number of elements being sorted
99812 ** first sorted element.
99814 ** sqlite3VdbeSorterNext() Advance the read cursor to the next sorted
99849 ** a threshold, when Rewind() is called the set of records is sorted using
99855 ** threshold, then the set of records currently in memory are sorted and
99882 ** final PMA. So at this point the data is stored in some number of sorted
99893 ** merged T bytes of data into a single sorted PMA, the main thread
99939 typedef struct SorterRecord SorterRecord; /* A record being sorted */
99955 ** An in-memory list of objects to be sorted.
99971 ** combined into one big PMA in order to be able to step through the sorted
100119 ** PMA, in sorted order. The next key to be read is cached in nKey/aKey.
100155 ** sorted record data from pMerger.
100214 ** is full, the list is sorted. As part of the sorting process, it is
100690 ** records being sorted. However, if the value passed as argument nField
100695 ** of the records being sorted. So if the sort is stable, there is never
100808 ** Free the list of sorted records starting at pRecord.
101120 ** Merge the two sorted lists p1 and p2 into a single list.
101437 ** is sorted from oldest to newest, so pReadr1 contains older values
102356 ** in sorted order.
131708 ** index will be populated by inserting keys in strictly sorted
131718 ** sorted order. */
138901 int regData, /* First register holding data to be sorted */
138920 ** (1) The data to be sorted has already been packed into a Record
139071 ** In this case rows are being delivered sorted order. The ephermal
139399 ** This allows the p->pEList field to be omitted from the sorted record,
139868 SelectDest *pDest /* Write the sorted results here */
145423 ** being unused if the data can be extracted in pre-sorted order.
145597 ** but not actually sorted. Either way, record the fact that the
145792 ** in sorted order
151790 unsigned sorted :1; /* True if really sorted (not just grouped) */
156614 ** completely sorted. A return equal to the number of ORDER BY
161237 ** whether or not the rows are really being delivered in sorted order, or
161241 ** true if the rows really will be sorted in the specified order, or false
161256 return pWInfo->sorted;
161322 ** Assume that the total number of output rows that will need to be sorted
161701 assert( pWInfo->sorted==0 );
161703 pWInfo->sorted = 1;
163166 ** (in this case max()) to process rows sorted in order of (c, d), which
164702 ** table, sorted by "a, b" (it actually populates the cache lazily, and
178763 ** A doclist (document list) holds a docid-sorted list of hits for a
178843 ** the %_segments table in sorted order. This means that when the end
178946 ** parallel, performing a straightforward sorted merge. Since segment
181861 ** into *pp contains all positions of both *pp1 and *pp2 in sorted
182211 ** sorted in either ascending or descending order.
182219 ** input doclists are sorted in ascending order, parameter bDescDoclist
182220 ** should be false. If they are sorted in ascending order, it should be
182326 ** If the docids in the input doclists are sorted in ascending order,
182327 ** parameter bDescDoclist should be false. If they are sorted in ascending
184116 ** The doclist may be sorted in ascending (parameter bDescIdx==0) or
191774 ** the final (nSegment-nSuspect) members are already in sorted order
191776 ** the array around until all entries are in sorted order.
191801 /* Check that the list really is sorted now. */
195926 ** list is a list of unique integers, sorted from smallest to largest. Each
206227 GeoEvent *pNext; /* Next event in the sorted list */
206235 GeoSegment *pNext; /* Next segment in a list sorted by y */
206307 ** Merge two lists of sorted events by X coordinate
206354 ** Merge two lists of sorted segments by Y, and then by C.
208209 ** updates are done in sorted key order.
208369 ** tables within the RBU database are always processed in order sorted by
208476 ** table in "rowid" order is roughly the same as reading them sorted by
208478 ** words, rows should be sorted using the destination table PRIMARY KEY
211187 /* Create the SELECT statement to read keys in sorted order */
214246 ** If the paths are sorted using the BINARY collation sequence, then
229505 Fts5HashEntry *pScanNext; /* Next entry in sorted order */
229835 ** each sorted in key order. This function merges the two lists into a
229880 ** in sorted order. The hash table is cleared before returning. It is
243775 ** are already in sorted order. */