Lines Matching full:sorter
2930 ** sorter to that integer. The default minimum PMA Size is set by the
15246 int nMaxSorterMmap; /* Maximum size of regions mapped by sorter */
17174 u32 szPma; /* Maximum Sorter PMA size */
18703 ** * A sorter
18743 VdbeSorter *pSorter; /* CURTYPE_SORTER. Sorter object */
45900 ** there cannot be more than 31 buckets required by the merge sorter.
83599 ** If argument P3 is non-zero, then it indicates that the sorter may
83621 ** P1 is a sorter cursor. If the sequence counter is currently zero, jump
83645 ** row output from the sorter so that the row can be decomposed into
84631 ** P1 is a sorter cursor. This instruction compares a prefix of the
84633 ** the sorter cursor currently points to. Only the first P4 fields
84634 ** of r[P3] and the sorter record are compared.
84636 ** If either P3 or the sorter contains a NULL in one of their significant
84664 ** Write into register P2 the current sorter data for sorter cursor P1.
84667 ** This opcode is normally use to move a record out of the sorter and into
84918 ** After all records have been inserted into the Sorter object
84923 ** for Sorter objects.
85055 ** sorter object for which the OP_SorterSort opcode has been
85143 ** into the sorter P1. Data for the entry is nil.
85489 ** Delete all contents from the ephemeral table or sorter
87872 ** Records passed to the sorter via calls to Write() are initially held
87892 ** If the sorter is running in single-threaded mode, then all PMAs generated
87893 ** are appended to a single temporary file. Or, if the sorter is running in
87901 ** The sorter is running in multi-threaded mode if (a) the library was built
87911 ** sorter is running in single-threaded mode, then these PMAs are merged
87912 ** incrementally as keys are retreived from the sorter by the VDBE. The
87945 ** characteristics of the sorter in multi-threaded mode.
87959 ** Private objects used by the sorter
88053 ** In other words, each time we advance to the next sorter element, log2(N)
88099 VdbeSorter *pSorter; /* Sorter that owns this sub-task */
88110 ** Main sorter structure. A single instance of this is allocated for each
88111 ** sorter cursor created by the VDBE.
88114 ** As records are added to the sorter by calls to sqlite3VdbeSorterWrite(),
88116 ** largest record in the sorter.
88238 ** has finished passing records to the sorter, or when the in-memory buffer
88434 SorterFile *pFile, /* Sorter file to read from */
88527 SorterFile *pFile, /* Sorter file to read from */
88709 ** Initialize the temporary index cursor just opened as a sorter cursor.
88711 ** Usually, the sorter module uses the value of (pCsr->pKeyInfo->nKeyField)
88714 ** is non-zero and the sorter is able to guarantee a stable sort, nField
88716 ** statement. In this case, keys are always delivered to the sorter in
88722 ** The sorter can guarantee a stable sort when running in single-threaded
88730 VdbeCursor *pCsr /* Cursor that holds the new sorter */
88734 VdbeSorter *pSorter; /* The new sorter */
89179 ** sorter object passed as the only argument.
89510 ** records to disk. If the sorter is running in multi-threaded mode,
89560 ** Add a record to the sorter.
89563 const VdbeCursor *pCsr, /* Sorter cursor */
90094 SortSubtask *pTask, /* Sorter task to read from */
90196 ** This function is called as part of a SorterRewind() operation on a sorter
90215 /* If the sorter uses more than one task, then create the top-level
90278 ** on a sorter that has written two or more PMAs to temporary files. It sets
90281 ** all records stored in the sorter.
90363 ** Once the sorter has been populated by calls to sqlite3VdbeSorterWrite,
90413 ** Advance to the next element in the sorter. Return value:
90454 ** Return a pointer to a buffer owned by the sorter that contains the
90458 const VdbeSorter *pSorter, /* Sorter object */
90482 ** Copy the current sorter key into the memory cell pOut.
90486 void *pKey; int nKey; /* Sorter key to copy into pOut */
90502 ** Compare the key in memory cell pVal with the key that the sorter cursor
90506 ** If the sorter cursor key contains any NULL values, consider it to be
90511 ** key in pVal is smaller than, equal to or larger than the current sorter
90518 const VdbeCursor *pCsr, /* Sorter cursor */
90519 Mem *pVal, /* Value to compare to current sorter key */
90527 void *pKey; int nKey; /* Sorter key to compare pVal with */
104424 /* Open the sorter cursor if we are to use one. */
104430 ** records into the sorter. */
118739 int iECursor; /* Cursor number for the sorter */
119183 ** through regData+nData-1 onto the sorter.
119197 int nBase = nExpr + bSeq + nData; /* Fields in sorter record */
119198 int regBase; /* Regs for sorter record */
119199 int regRecord = ++pParse->nMem; /* Assembled sorter record */
119201 int op; /* Opcode to add sorter record to sorter */
119229 VdbeOp *pOp; /* Opcode that opens the sorter */
119231 KeyInfo *pKI; /* Original KeyInfo on the sorter table */
119276 /* Fill the sorter until it contains LIMIT+OFFSET entries. (The iLimit
119277 ** register is initialized with value of LIMIT+OFFSET.) After the sorter
119278 ** fills up, delete the least entry in the sorter after each insert.
119293 ** LIMIT+OFFSET entries of the sorter. */
119374 ** same value. However, if the results are being sent to the sorter, the
119703 ** there is a sorter, in which case the sorter has already limited
119889 ** then the results were placed in a sorter. After the loop is terminated
119890 ** we need to run the sorter and output the results. The following
119913 int iSortTab; /* Sorter cursor to read from */
119914 int nSortData; /* Trailing values to read from sorter */
119916 int bSeq; /* True if sorter record includes seq. no. */
124280 int sortOut = 0; /* Output register from the sorter */
200887 Fts5Sorter *pSorter; /* Sorter for "ORDER BY rank" queries */
