contrib/sqlite3/sqlite3.c

66 ** be sorted A-Z.
3049 ** to be sorted exceeds the page size times the minimum of the
3072 ** sorted records. However, if SQLite determines based on the declared type
3075 ** is stored in each sorted record and the required column values loaded
3076 ** from the database as records are returned in sorted order. The default
11330 ** are sorted in the same order in which they were attached (or auto-attached)
15316 ** to be filled with content that is already in sorted order.
15324 #define BTREE_BULKLOAD 0x00000001  /* Used to full index in sorted order */
16191   PgHdr *pDirty;                 /* Transient list of dirty sorted by pgno */
16272 /* Get a list of all dirty pages in the cache, sorted by page number */
50079 ** Return a list of all dirty pages in the cache, sorted by page number.
51504 ** elements of the RowSet in sorted order.  Once this extraction
51606 #define ROWSET_SORTED  0x01   /* True if RowSet.pEntry is sorted */
51722 ** assumed to each already be in sorted order.
51725   struct RowSetEntry *pA,    /* First sorted list to be merged */
51726   struct RowSetEntry *pB     /* Second sorted list to be merged */
51811 ** Convert a sorted list of elements (connected by pRight) into a binary
51856 ** Convert a sorted list of elements into a binary tree. Make the tree
51895   /* Merge the forest into a single sorted list on first call */
55263 ** The list of pages passed into this routine is always sorted by page number.
61376 ** This function merges two sorted lists into a single sorted list.
61444 ** aList[] are to be sorted so that for all J<K:
64075 ** content area.  The cell pointers occur in sorted order.  The system strives
64718   ** connected by pNext and pPrev should be in sorted order by
71748     ** sorted order.  This invariants arise because multiple overflows can
71750     ** balancing, and the dividers are adjacent and sorted.
71752     assert( j==0 || pPage->aiOvfl[j-1]<(u16)i ); /* Overflows in sorted order */
82697 ** and reals) sorted numerically, followed by text ordered by the collating
91576 ** Jump to P2 if there are no records to be sorted.
91704 ** invoked.  This opcode advances the cursor to the next sorted
91705 ** record, or jumps to P2 if there are no more sorted records.
94765 ** algorithm that is efficient even if the number of elements being sorted
94783 **                                  first sorted element.
94785 **    sqlite3VdbeSorterNext()       Advance the read cursor to the next sorted
94820 ** a threshold, when Rewind() is called the set of records is sorted using
94826 ** threshold, then the set of records currently in memory are sorted and
94853 ** final PMA. So at this point the data is stored in some number of sorted
94864 ** merged T bytes of data into a single sorted PMA, the main thread
94910 typedef struct SorterRecord SorterRecord;   /* A record being sorted */
94926 ** An in-memory list of objects to be sorted.
94942 ** combined into one big PMA in order to be able to step through the sorted
95090 ** PMA, in sorted order.  The next key to be read is cached in nKey/aKey.
95126 ** sorted record data from pMerger.
95185 ** is full, the list is sorted. As part of the sorting process, it is
95661 ** records being sorted. However, if the value passed as argument nField
95666 ** of the records being sorted. So if the sort is stable, there is never
95778 ** Free the list of sorted records starting at pRecord.
96089 ** Merge the two sorted lists p1 and p2 into a single list.
96406       ** is sorted from oldest to newest, so pReadr1 contains older values
97324 ** in sorted order.
125171       ** index will be populated by inserting keys in strictly sorted
125181       ** sorted order.  */
131752   int regData,           /* First register holding data to be sorted */
131771   **   (1) The data to be sorted has already been packed into a Record
132101       ** This allows the p->pEList field to be omitted from the sorted record,
132604   SelectDest *pDest /* Write the sorted results here */
137644   ** being unused if the data can be extracted in pre-sorted order.
137806       ** but not actually sorted. Either way, record the fact that the
137974         ** in sorted order
143791   unsigned sorted :1;          /* True if really sorted (not just grouped) */
148366 ** completely sorted.  A return equal to the number of ORDER BY
152357 ** whether or not the rows are really being delivered in sorted order, or
152361 ** true if the rows really will be sorted in the specified order, or false
152376   return pWInfo->sorted;
152442 ** Assume that the total number of output rows that will need to be sorted
152814       assert( pWInfo->sorted==0 );
152816         pWInfo->sorted = 1;
153977 **   (in this case max()) to process rows sorted in order of (c, d), which
155477 **   table, sorted by "a, b" (it actually populates the cache lazily, and
169128 ** A doclist (document list) holds a docid-sorted list of hits for a
169208 ** the %_segments table in sorted order.  This means that when the end
169311 ** parallel, performing a straightforward sorted merge.  Since segment
172223 ** into *pp contains all positions of both *pp1 and *pp2 in sorted
172573 ** sorted in either ascending or descending order.
172581 ** input doclists are sorted in ascending order, parameter bDescDoclist
172582 ** should be false. If they are sorted in ascending order, it should be
172688 ** If the docids in the input doclists are sorted in ascending order,
172689 ** parameter bDescDoclist should be false. If they are sorted in ascending
174462 ** The doclist may be sorted in ascending (parameter bDescIdx==0) or
182104 ** the final (nSegment-nSuspect) members are already in sorted order
182106 ** the array around until all entries are in sorted order.
182131   /* Check that the list really is sorted now. */
186244 ** list is a list of unique integers, sorted from smallest to largest. Each
196441   GeoEvent *pNext;       /* Next event in the sorted list */
196449   GeoSegment *pNext;     /* Next segment in a list sorted by y */
196521 ** Merge two lists of sorted events by X coordinate
196568 ** Merge two lists of sorted segments by Y, and then by C.
198417 **     updates are done in sorted key order.
198577 ** tables within the RBU database are always processed in order sorted by
198684 ** table in "rowid" order is roughly the same as reading them sorted by
198686 ** words, rows should be sorted using the destination table PRIMARY KEY
201354       /* Create the SELECT statement to read keys in sorted order */
204351 **   If the paths are sorted using the BINARY collation sequence, then
219308   Fts5HashEntry *pScanNext;       /* Next entry in sorted order */
219638 ** each sorted in key order. This function merges the two lists into a
219683 ** in sorted order. The hash table is cleared before returning. It is
233452   ** are already in sorted order.  */