Lines Matching refs:most
69 ** only a handful of compile-time options, so most times this array is usually
1532 ** the most recent error can be obtained using
1937 ** of the xSync method. In most cases, the pointer argument passed with
2021 ** upper-most shim only.
2619 ** the application. The default configuration is recommended for most
3439 ** ^Each entry in most SQLite tables (except for [WITHOUT ROWID] tables)
3448 ** the most recent successful [INSERT] into a rowid table or [virtual table]
3512 ** deleted by the most recently completed INSERT, UPDATE or DELETE
3847 ** These routines understand most of the common formatting options from
4143 ** is the name of the inner-most trigger or view that is responsible for
4795 ** ^If the most recent sqlite3_* API call associated with
4833 ** interfaces always report the most recent result. To avoid
5001 ** be used just once or at most a few times and then destroyed using
5635 ** ^The left-most column is column 0 for these routines.
5869 ** These routines may only be called when the most recent call to
6056 ** ^If the most recent evaluation of the statement encountered no errors
6058 ** SQLITE_OK. ^If the most recent evaluation of statement S failed, then
6092 ** ^If the most recent call to [sqlite3_step(S)] for the
6097 ** ^If the most recent call to [sqlite3_step(S)] for the
6214 ** the implementation that most closely matches the way in which the
6640 ** value to the application-defined function. ^N is zero for the left-most
6647 ** calls to sqlite3_get_auxdata(C,N) return P from the most recent
7009 ** or [SQLITE_UTF16LE], indicating the most desirable form of the collation
7953 ** assumes that the strategy may visit at most one row.
8017 #define SQLITE_INDEX_SCAN_UNIQUE 1 /* Scan visits at most 1 row */
8799 ** Unlike most of the SQLite API, this function is not guaranteed to
9420 ** In many applications, most of the heap memory allocated by
9430 ** extreme measure that is only needed by the most demanding applications.
9431 ** The built-in page cache is recommended for most uses.
9767 ** to be backed up at the conclusion of the most recent sqlite3_backup_step().
9769 ** in the source database at the conclusion of the most recent
9860 ** ^(There may be at most one unlock-notify callback registered by a
10043 ** A single database handle may have at most a single write-ahead log callback
10130 ** database writer and all readers are reading from the most recent database
10526 ** ^At most one preupdate hook may be registered at a time on a single
10624 ** number that caused the most recent I/O error or failure to open a file.
10650 ** the most recent version.
10712 ** historical [snapshot] P, rather than the most recent change to the
10741 ** after the most recent I/O on the database connection.)^
11624 ** created by [sqlite3changeset_start()]. In the latter case, the most recent
11696 ** created by [sqlite3changeset_start()]. In the latter case, the most recent
11727 ** created by [sqlite3changeset_start()]. In the latter case, the most recent
12093 ** via the sqlite3_log() mechanism with the error code SQLITE_SCHEMA. At most
12443 ** the local changeset is rebased according to the most recent
13415 ** if the number of terms is too large. In practice, most SQL
13716 are defined but at most one is allowed:\
13737 ** recursive mutexes on most Unix systems and fchmod() on OpenBSD.
15181 #define BTREE_SINGLE 4 /* The file contains at most 1 b-tree */
16852 ** a lot of space, as most lookaside allocations are less than 128 bytes.
16976 i64 lastRowid; /* ROWID of most recent insert (see above) */
17441 ** sqlite3.pSavepoint. The first element in the list is the most recently
17982 IndexSample *aSample; /* Samples of the left-most key */
18522 ** NameContexts can be nested. When resolving names, the inner-most
19296 ** For most test cases, CORRUPT_DB is set to false using a special
19434 ** This object is used in various ways, most (but not all) related to window
20591 ** Perhaps the most important point is the difference between MEMTYPE_HEAP
21089 ** on this cursor" and "the most recent seek was an exact match".
22477 ** localtime_r() available under most POSIX platforms, except that the
23939 ** for MSVC and malloc_usable_size() for most other systems (e.g. Linux).
25034 ** successful most of the time (about 9 times out of 10).
26581 ** incorrect results. On most platforms, pthread_equal() is a
27810 ** or since the most recent reset.
28502 ** most frequently used conversion types first.
31625 ** Set the most recent error code and error string for the sqlite
31641 ** To clear the most recent error for sqlite handle "db", sqlite3Error
32627 /* The 1-byte case. Overwhelmingly the most common. Handled inline
34752 ** On most versions of unix, we can get a unique ID for a file by concatenating
38109 ** every open file that does not use shared memory (in other words, most
39779 ** In most cases, this routine sets *pMode to 0, which will become
42151 ** Are most of the Win32 ANSI APIs available (i.e. with certain exceptions
42159 ** Are most of the Win32 Unicode APIs available (i.e. with certain exceptions
48667 ** utf-8 string describing the most recent error encountered associated
48895 ** is no way to reach it under most builds. */
48922 ** But sometimes (for example when during a DROP of a large table) most
50299 ** but causes a 2-byte gap in the structure for most architectures (since
50427 ** reading because (1) most platforms read a 32-bit integer atomically and
51521 ** allocated in chunks so most INSERTs do no allocation. There is an
53599 ** since the most recent journal header was written, update the
54331 ** If journal corruption occurs due to a power failure, the most likely
54862 ** valid page entries in the journal. In most cases, you can compute the
55099 ** the WAL if that is where the most recent copy if found) into
56329 ** then the nRec field of the most recently written journal header
59029 ** The savepoint to release or rollback need not be the most recently
59040 ** on the most recently created savepoint. If iSavepoint is greater than
60357 ** frame most recently written to the WAL (in other words, the frame with
60850 ** At most only the hash table containing pWal->hdr.mxFrame needs to be
64014 ** All of the integer values are big-endian (most significant byte first).
64103 ** the first byte with bit 8 clear. The most significant byte of the integer
64298 ** of the Btree structure. At most one of these may open a write transaction,
64753 /* In most cases, we should be able to acquire the lock we
65803 ** at most one effective restoreCursorPosition() call after each
70137 ** right-most child page then pCur->idx is set to one more than
70262 ** Move the cursor down to the left-most leaf entry beneath the
70265 ** The left-most leaf is the one with the smallest key - the first
70284 ** Move the cursor down to the right-most leaf entry beneath the
70287 ** finds the left-most entry beneath the *entry* whereas moveToRightmost()
70288 ** finds the right-most entry beneath the *page*.
70290 ** The right-most entry is the one with the largest key - the last
71657 int hdr; /* Beginning of the header. 0 most pages. 100 page 1 */
72264 ** Instead of trying to balance the 3 right-most leaf pages, just add
72271 ** pPage is the leaf page which is the right-most page in the tree.
72273 ** which is also the right-most entry on the page.
72278 ** words, at most 13 bytes. Hence the pSpace buffer must be at
72346 ** To find the largest key value on pPage, first find the right-most
72348 ** record-length (a variable length integer at most 32-bits in size)
72561 /* At this point pParent may have at most one overflow cell. And if
72881 ** always nearly full, while the right-most sibling might be nearly empty.
72886 ** be so out of balance as to be illegal. For example, the right-most
72892 int r; /* Index of right-most cell in left sibling */
73032 ** of the right-most new sibling page is set to the value that was
73033 ** originally in the same field of the right-most old sibling page. */
73115 ** cell consists of the integer key for the right-most cell of
76321 ** Return the number of pages still to be backed up as of the most recent
76335 ** Return the total number of pages in the source database as of the most
76491 ** In other words, return true if X has at most one bit set.
79654 ** If addr<0 then change P4 on the most recently inserted instruction.
79710 ** Change the P4 operand of the most recently coded instruction
79735 ** Set the P4 on the most recently added opcode to the KeyInfo for the
79749 ** Change the comment on the most recently coded instruction. Or
79794 ** return the most recently inserted opcode.
81595 ** Each VDBE holds the result of the most recent sqlite3_step() call
82115 ** For most architectures, this is a no-op.
82227 ** routine so that in most cases the overhead of moving the stack pointer
84373 ** sqlite3Step() to do most of the work. If a schema error occurs,
84528 ** The left-most argument is 0.
84556 ** The left-most argument is 0.
88191 ** determined by the most recent OP_Permutation operator. If the
88266 ** in the most recent OP_Compare instruction the P1 vector was less than
88789 ** Although sqlite3VdbeSerialGet() may read at most 8 bytes from the
88886 ** of the right-most table that can be null-trimmed.
88964 ** index of the right-most column with a non-NULL default value */
90603 ** left-most element, and if there are no matches on the most recent
91008 ** seeks on the cursor or if the most recent seek used a key equal to P3.
91777 ** seeks on the cursor or if the most recent seek used a key equivalent
92416 ** At most reg(P3) errors will be reported.
94120 ** by 6 spaces. But the left-most 6 spaces have been removed to improve the
98921 /* Start at the inner-most context and move outward until a match is found */
99863 ** Attempt to match pE against result set columns in the left-most
99866 ** The left-most column is 1. In other words, the value returned is the
99939 ** beginning with the left-most SELECT and working toward the right.
100212 Select *pLeftmost; /* Left-most of SELECT of a compound */
100372 ** than the right-most term, then that is a syntax error. But the error
100376 if( isCompound<=nCompound /* Defer right-most ORDER BY of a compound */
102464 ** Set the ExprList.a[].zEName element of the most recently added item
102499 ** Set the ExprList.a[].zSpan element of the most recently added item
103091 ** Generate code that checks the left-most column of index table iCur to see if
103172 ** index can be found with the specified <columns> as its left-most.
103698 ** return value is the register of the left-most result column.
107452 ** The second is most effective when debugging under valgrind or
108117 ** The iCol-th column (left-most is 0) of table zTable is renamed from zCol
108805 ** For most applications, sqlite_stat1 provides all the statistics required
108845 ** inclusive are samples of the left-most key value in the index taken at
108879 ** of entries in the index whose left-most column exactly matches
108880 ** the left-most column of the sample. The second integer in nEq
108886 ** left-most column is less than the left-most column of the sample.
108902 ** looks at the left-most column of the index. The sqlite_stat3.sample
108903 ** column contains the actual value of the left-most column instead
109455 ** C Index of left-most column to differ from previous row
109722 /* Add a comment to the most recent VDBE opcode that is the name
110108 ** Generate code that will cause the most recent index analysis to
113121 ** The expression is the default value for the most recently added column
113215 ** most recently added column of the table is the primary key.
113217 ** A table can have at most one primary key. If the table already has
113336 ** Set the collation function of the most recently parsed table column
113371 /* Change the most recently parsed column to be a GENERATED ALWAYS AS
114986 ** The behavior of the most recently created foreign key is adjusted
115081 ** very small (since most of the pages written do not contain content that
115174 ** is a primary key or unique-constraint on the most recent column added
115734 ** point at most a single index (the newly added index) will be out of
115735 ** order. So we have to reorder at most one index. */
115995 ** is sufficient for most uses. Smaller values, like say 10, are
116256 ** Add an INDEXED BY or NOT INDEXED clause to the most recently added
117916 ** ONEPASS_SINGLE: One-pass approach - at most one row deleted.
120546 ** For peak efficiency, put the most frequently used function last.
120871 ** constraint to the parent table column stored in the left-most column
120873 ** child table column that corresponds to the second left-most column of
120906 char *zKey = pFKey->aCol[0].zCol; /* Name of left-most parent key column */
122494 ** There is at most one AutoincInfo structure per table even if the
129074 ** integrity_check designed to detect most database corruption
130729 ** for common cleanups that happen on most calls. But for less
130823 ** Note that setting READ_UNCOMMITTED overrides most lock detection,
131342 ** Return a pointer to the right-most SELECT statement in a compound.
131592 ** The left most table is the first entry in Select.pSrc. The right-most
133055 /* Column names are determined by the left-most term of a compound select */
133405 ** left-most term of the select that has a collating sequence.
133508 Select *pFirstRec; /* Left-most recursive term */
133588 ** iDistinct table. pFirstRec is left pointing to the left-most
133656 Select *p, /* The right-most of SELECTs to be coded */
133674 ** Since the limit is exactly 1, we only need to evalutes the left-most VALUES.
133678 Select *p, /* The right-most of SELECTs to be coded */
133723 ** "p" points to the right-most of the two queries. the query on the
133751 Select *p, /* The right-most of SELECTs to be coded */
133762 ** the last (right-most) SELECT in the series may have an ORDER BY or LIMIT.
134038 ** This section is run by the right-most SELECT statement only.
134039 ** SELECT statements to the left always skip this part. The right-most
134334 Select *p, /* The right-most of SELECTs to be coded */
136078 ** with the inner-most WITH clause being at the top of the stack.
136139 Select *pLeft; /* Left-most SELECT statement */
136140 Select *pRecTerm; /* Left-most recursive term */
137464 ** may contain expression trees of at most
139796 ** reg+1 OLD.* value of left-most column of pTab
139798 ** reg+N OLD.* value of right-most column of pTab
139800 ** reg+N+2 NEW.* value of left-most column of pTab
139802 ** reg+N+N+1 NEW.* value of right-most column of pTab
139870 ** Bit 0 of the returned mask is set if the left-most column of the
139957 ** The most recently coded instruction was an OP_Column to retrieve the
141068 ** implementation indicates that pWhere may match at most one row.
143790 unsigned bOrderedInnerLoop:1;/* True if only the inner-most loop is ordered */
144589 u16 nSkip; /* Number of left-most columns to skip */
144685 ** If the most recently coded instruction is a constant range constraint
145511 ** left-most columns of the index. It may also contain
145514 ** the right-most column can be an inequality - the rest must
148376 ** In the ORDER BY LIMIT optimization, if the inner-most loop is known
148378 ** inner-most loop did not fit within the sorter, then we can skip all
148381 ** loop - the loop immediately outside the inner-most.
148388 ** be the continuation for the second-inner-most loop. If the ORDER BY
148390 ** be the continuation for the inner-most loop.
148393 ** inner-most loop, in the sense that a correct answer will result.
148402 ** continuation of the inner-most loop. */
148687 ** but is enough to handle most commonly occurring SQL statements.
149786 ** left-most column of the index). Or, if the query is:
149830 ** key-prefix formed by the nEq values matched against the nEq left-most
149970 ** the histogram data. This only works when x is the left-most
150885 ** the left-most index column, M==N.
151091 ** available for the left-most terms of the index, and if the average
151092 ** number of repeats in the left-most terms is at least 18.
151646 ** that the scan will visit at most one row. Clear it otherwise. */
151935 ** most expensive sub-scan. Add the smallest possible penalty
152337 } /* End the loop over all WhereLoops from outer-most down to inner-most */
153022 ** most loop)
153109 sqlite3ErrorMsg(pParse, "at most %d tables in a join", BMS);
153339 ** at most a single row.
153422 ** and either (a) the scan visits at most one row or (b) each
156466 ** For the most part, the patterns above are adapted to support UNBOUNDED by
164250 ** * Calls to this routine from Y must block until the outer-most
165112 ** Return the ROWID of the most recent insert
165140 ** Return the number of changes in the most recent call to sqlite3_exec().
166574 ** Return UTF-8 encoded English language explanation of the most recent
166602 ** Return UTF-16 encoded English language explanation of the most recent
166644 ** Return the most recent error code generated by an SQLite routine. If NULL is
168284 ** This test-control causes the most recent sqlite3_result_int64() value
169922 ** tables are flushed to disk. Variable iPrevDocid is the docid of the most
169932 sqlite_int64 iPrevDocid; /* Docid of most recently inserted document */
170039 ** sequence. A single token is the base case and the most common case.
171884 ** If piLast is not NULL, then *piLast is set to the right-most child node
172003 ** left-most leaf node in the tree that may contain the specified term.
172005 ** right-most leaf node that may contain a term for which the specified
177234 ** expression tree being parsed. pPrev is the expression node most recently
177242 Fts3Expr *pPrev, /* Node most recently inserted into the tree */
177470 /* Set $p to point to the left-most leaf in the tree of eType nodes. */
180445 SegmentNode *pLeftmost; /* Pointer to left-most node of this depth */
181173 ** apVal[2] Left-most user-defined column
181175 ** apVal[p->nColumn+1] Right-most user-defined column
181970 /* The query is a simple term lookup that matches at most one term in
185084 ** Read the last entry (most recently pushed) from the hint blob *pHint
188211 ** The most significant 22 bits in each 32-bit value contain the first
188434 ** The 7 most significant bits in flags are an index into the aiOff[]
193130 ** table scan strategies to choose from (in order from most to
196337 ** The left-most coordinate min(x1,x2) is not considered to be part of
197025 ** table scan strategies to choose from (in order from most to
198904 ** was last saved. In other words, from the most recent successful call to
204123 ** utf-8 string describing the most recent error encountered associated
204333 ** The value of the path for the left-most child page of the root of
204336 ** The next to left-most child of the root page is
204338 ** value. The children of the 451st left-most sibling have paths such
204344 ** the left-most cell of the 450th child of the root page are identified
204355 ** '/1c2/000/' // Left-most child of 451st child of root
204518 /* Force DBSTAT table should always be the right-most table in a join */
224176 int iBestLvl = 0; /* Level offering the most input segments */
224326 /* fts5WriteInit() should have initialized the buffers to (most likely)
224826 ** it to the output. This can happen at most once for each input
224862 ** at most nMerge*10 bytes of unexpected space. */
225959 Fts5Buffer term = {0,0,0}; /* Buffer used to hold most recent term */
227038 ** This function ensures that there is at most one "r" or "=". And that if
232145 ** The 7 most significant bits in flags are an index into the aiOff[]
232824 /* The 1-byte case. Overwhelmingly the most common. */