Lines Matching defs:more
7 ** of 5% or more are commonly seen when SQLite is compiled as a single
38 ** May you share freely, never taking more than you give.
59 ** though perhaps more slowly.
63 ** though perhaps more slowly.
98 ** May you share freely, never taking more than you give.
148 ** May you share freely, never taking more than you give.
319 ** May you share freely, never taking more than you give.
542 ** to use SQLite concurrently from more than one thread.
682 ** ^The sqlite3_exec() interface runs zero or more UTF-8 encoded,
798 ** support for additional result codes that provide more detailed information
1045 ** [sqlite3_file] object (or, more commonly, a subclass of the
1649 ** consist of a single "-" character followed by no more than
2067 ** SQLite will never invoke xInit() more than once without an intervening
2608 ** slower. But the QPSG has the advantage of more predictable behavior. With
2875 ** Things are more complicated if the sqlite3_changes() function is
3122 ** complete query results from one or more queries.
3136 ** A result table might consist of one or more memory allocations.
3166 ** ^The sqlite3_get_table() function evaluates one or more
3222 ** the number of characters written would be a more useful return
3365 ** ^If the previous call to this routine had an N of 1 or more and a
3580 ** to [sqlite3_trace_v2(D,M,X,P)] is an OR-ed combination of one or more of
3640 ** zero or more [SQLITE_TRACE] constants.
3903 ** or more processes write to the same database and any one of those
4006 ** more tolerant of invalid F parameters than newer versions.
4249 ** <li> Run the SQL by calling [sqlite3_step()] one or more times.
4251 ** to step 2. Do this zero or more times.
4329 ** the equivalent tries to allocate space for more than this many opcodes
4503 ** more of the [SQLITE_PREPARE_PERSISTENT|SQLITE_PREPARE_*] flags. ^The
4525 unsigned int prepFlags, /* Zero or more SQLITE_PREPARE_ flags */
4547 unsigned int prepFlags, /* Zero or more SQLITE_PREPARE_ flags */
4768 ** SQL parameter is used more than once, second and subsequent
4860 ** [sqlite3_step()] has been called more recently than [sqlite3_reset()],
4980 ** mean that one or more rows of data will be returned. ^A SELECT statement
5055 ** If two or more threads call one or more
5108 ** must be called one or more times to evaluate the statement.
5143 ** ^With the legacy interface, a more specific error code (for example,
5147 ** the more specific error code is returned directly by sqlite3_step().
5154 ** more threads at the same moment in time.
5179 ** then the more specific [error codes] are returned directly
5478 ** one or more calls to [sqlite3_reset()], or after any call
5535 ** function is to be added. ^If an application uses more than one database
6356 ** given the same inputs. If two or more collating functions are registered
6536 ** It is not safe to read or modify this variable in more than one
6593 ** It is not safe to read or modify this variable in more than one
7042 ** which might be more or less than the amount requested.
7111 ** if one or more of following conditions are true:
7333 ** will be called more than once for each database connection that is opened.
8149 ** than an SQLITE_MUTEX_RECURSIVE more than once, the behavior is undefined.
8804 ** pager cache is shared between two or more connections the bytes of heap
8808 ** value as DBSTATUS_CACHE_USED. Or, if one or more or the pager caches are
8855 ** cache overflowing. Transactions are more efficient if they are written
8953 ** or more calls to [sqlite3_step()] followed by a call to [sqlite3_reset()].
9062 ** ^SQLite will never invoke xInit() more than once without an intervening
9131 ** attempt to unpin one or more cache pages by spilling the content of
9245 ** <li><b>sqlite3_backup_step()</b> is called one or more times to transfer
9290 ** are still more pages to be copied, then the function returns [SQLITE_OK].
9457 ** shared-cache table, and more than one other connection currently holds
9487 ** more than one blocked connection that has registered for an unlock-notify
9488 ** callback. ^If two or more such blocked connections have specified the
9666 ** more frames in the [write-ahead log] file. ^Passing zero or
9703 ** occur. But then the newer and more powerful [sqlite3_wal_checkpoint_v2()]
9782 ** an SQLITE_BUSY error is encountered when processing one or more of the
10040 ** needs to be returned.)^ ^It is always ok for two or more rows with the same
10186 ** on the RHS of the IN constraint. ^If there are no more values on the
10571 ** <li> One or more transactions must have been written to the current wal
10752 unsigned int mFlags /* Zero or more SQLITE_SERIALIZE_* flags */
10758 ** Zero or more of the following constants can be OR-ed together for
10810 unsigned mFlags /* Zero or more SQLITE_DESERIALIZE_* flags */
10860 ** May you share freely, never taking more than you give.
11020 ** database handle that has one or more session objects attached. Nor is
11118 ** If a single row is affected by more than one operation within a session,
11158 ** in one or more of their PRIMARY KEY columns.
11227 ** A changeset consists of zero or more INSERT, UPDATE and/or DELETE changes,
11238 ** more of their PRIMARY KEY columns. If such a row is inserted or deleted,
11240 ** function. If an existing row with one or more NULL values stored in
11243 ** with non-NULL PRIMARY KEY values is updated so that one or more of its
11274 ** updated or deleted, if one or more of its primary key columns contain a
11295 ** found and one or more of the non-primary key fields have been
11313 ** is written to more than once during a session. For example, if a row
11448 ** more changes have been recorded, return zero.
11846 ** A changegroup is an object used to combine two or more
11855 ** An sqlite3_changegroup object is used to combine two or more changesets
11871 ** <li> Zero or more changesets (or patchsets) are added to the object
11939 ** If one or more of the column values in the row inserted by the
12069 ** If a row with matching primary key values is found, but one or more of
12073 ** database table has more columns than are recorded in the changeset,
12114 ** If a row with matching primary key values is found, but one or more of
12151 ** is only allocated and populated if one or more conflicts were encountered
12228 ** PRIMARY KEY fields is present in the database, but one or more other
12381 ** <li> If there has been one or more REPLACE resolutions on a
12546 ** The xOutput callback is invoked zero or more times to return data to
12702 ** May you share freely, never taking more than you give.
12861 ** more than once for a single FTS query, then all invocations share a
12899 ** xInstCount/xInst APIs. While the xInstCount/xInst APIs are more convenient
12931 ** that contain one or more instances of a specified phrase. For example:
12951 ** significantly more efficient than those alternatives when used with
13174 ** extra entries are added to the FTS index, this method uses more space
13183 ** On the other hand, it may require more CPU cycles to run MATCH queries,
13298 ** May you share freely, never taking more than you give.
13329 ** not have more than a dozen or so columns in any table. And if
13330 ** that is the case, there is no point in having more than a few
13351 ** want to place more severe limits on the complexity of an
13363 ** never has more than 3 or 4 terms. Use a value of 0 to disable
13663 # error "Two or more of the following compile-time configuration options\
13896 ** May you share freely, never taking more than you give.
14838 ** on the sqlite3VListAdd() routine for more information. A VList is really
14858 ** May you share freely, never taking more than you give.
14886 ** May you share freely, never taking more than you give.
15063 ** will support two or more Win95 readers or two or more WinNT readers.
15176 ** May you share freely, never taking more than you give.
15216 ** is devoted to storing a super-journal name - there are no more pages to
15431 ** May you share freely, never taking more than you give.
15722 ** the information into this object helps to keep the interface more
15850 ** May you share freely, never taking more than you give.
16488 ** May you share freely, never taking more than you give.
16683 ** May you share freely, never taking more than you give.
16842 ** DB_UnresetViews means that one or more views have column names that
16896 ** failing over to the full-size pool if that does not work. Thus more
17038 u8 mTrace; /* zero or more SQLITE_TRACE flags */
17588 ** sqlite3StdTypeLen[] and sqlite3StdType[]. Each value is one more
17655 ** used as the P4 operand, they will be more readable.
17807 #define TF_HasHidden 0x00000002 /* Has one or more hidden columns */
17811 #define TF_HasVirtual 0x00000020 /* Has one or more VIRTUAL columns */
17812 #define TF_HasStored 0x00000040 /* Has one or more STORED columns */
17991 ** A record is an object that contains one or more fields of data.
18111 unsigned bHasVCol:1; /* Index references one or more VIRTUAL columns */
18231 ** need more than about 10 or 20 variables. But some extreme users want
18294 ** two or more Expr objects will be stored in a single memory allocation,
18376 #define EP_HasFunc 0x000008 /* Contains one or more functions of any kind */
18377 #define EP_Agg 0x000010 /* Contains one or more aggregate functions */
18581 ** contains more than 63 columns and the 64-th or later column is used.
18643 ** This object represents one or more tables that are the source of
18680 #define WHERE_DUPLICATES_OK 0x0010 /* Ok to return a row more than once */
18724 SrcList *pSrcList; /* One or more tables used to resolve names */
18734 int ncFlags; /* Zero or more NC_* flags defined below */
18752 #define NC_HasAgg 0x000010 /* One or more aggregate functions seen */
18763 #define NC_HasWin 0x008000 /* One or more window functions seen */
19652 ** one or more CTEs (common table expressions).
20997 ** May you share freely, never taking more than you give.
21040 ** May you share freely, never taking more than you give.
21206 ** May you share freely, never taking more than you give.
21994 ** May you share freely, never taking more than you give.
22096 ** array. tolower() is used more often than toupper() by SQLite.
22207 ** and 93 128-byte slots, which is more lookaside than is available
22399 ** May you share freely, never taking more than you give.
22417 ** May you share freely, never taking more than you give.
22647 /* One or more of the following flags are set to indicate the
23155 ** we have to locate the state vector at run-time. In the more common
23512 ** May you share freely, never taking more than you give.
23587 ** Convert zDate into one or more integers according to the conversion
23699 ** fractional seconds FFFF can be one or more digits.
24872 ** May you share freely, never taking more than you give.
25322 ** May you share freely, never taking more than you give.
25355 ** we have to locate the state vector at run-time. In the more common
25412 ** May you share freely, never taking more than you give.
25474 ** May you share freely, never taking more than you give.
25768 ** May you share freely, never taking more than you give.
25876 ** sizes more than NCSIZE*8 bytes.
26099 ** much more likely to break and we are much more liking to find
26299 ** May you share freely, never taking more than you give.
26340 ** more blocks where each block is 8 bytes. The first 8 bytes are
26343 ** A chunk is two or more blocks that is either checked out or
26989 ** May you share freely, never taking more than you give.
27197 ** routine so there is never any chance that two or more
27209 /* No more than 1GiB per allocation */
27577 ** May you share freely, never taking more than you give.
27941 ** May you share freely, never taking more than you give.
28093 ** more than once, the behavior is undefined.
28159 ** May you share freely, never taking more than you give.
28399 ** more than once, the behavior is undefined.
28556 ** May you share freely, never taking more than you give.
28582 ** May you share freely, never taking more than you give.
28921 ** more than once, the behavior is undefined.
29050 ** May you share freely, never taking more than you give.
29175 ** and constrain the soft heap limit to be no more than the hard heap
29992 etByte flags; /* One or more of FLAG_ constants below */
30907 ** able to accept at least N more bytes of text.
31340 ** May you share freely, never taking more than you give.
31699 u8 moreToFollow /* True if more to follow */
31732 SQLITE_PRIVATE void sqlite3TreeViewWindow(TreeView *pView, const Window *pWin, u8 more){
31740 sqlite3TreeViewPush(&pView, more);
31798 SQLITE_PRIVATE void sqlite3TreeViewWinFunc(TreeView *pView, const Window *pWin, u8 more){
31800 sqlite3TreeViewPush(&pView, more);
32633 ** May you share freely, never taking more than you give.
32688 ** we have to locate the state vector at run-time. In the more common
32793 ** May you share freely, never taking more than you give.
33070 ** May you share freely, never taking more than you give.
33608 ** May you share freely, never taking more than you give.
34018 ** 2 or more => The input has a decimal point or eNNN clause
35224 ** Each name/number pair is encoded by subsequent groups of 3 or more
35229 ** The text name overlays one or more following integers. The text name
35326 ** May you share freely, never taking more than you give.
35804 ** May you share freely, never taking more than you give.
36130 ** * A sequence of one or more zero-bytes that are not at the
36148 /* A sequence of 1 or more zeros is stored as a little-endian
36779 ** May you share freely, never taking more than you give.
37900 ** But wait: there are yet more problems with POSIX advisory locks.
37929 ** LinuxThreads provided that (1) there is no more than one connection
38537 /* If there is already a lock of this type or more restrictive on the
38997 ** prevent simultaneous access of the same database by two or more
39001 ** time and one or more of those connections are writing.
39759 /* If there is already a lock of this type or more restrictive on the
41272 /* Shared locks never span more than one byte */
42540 int ctrlFlags /* Zero or more UNIXFILE_* values */
43053 ** here such that two or more threads all trying to open databases at
43527 ** unixDlOpen() fails (returns a null pointer). If a more detailed error
44952 ** more than that; it looks at the filesystem type that hosts the
45082 ** May you share freely, never taking more than you give.
48328 /* If there is already a lock of this type or more restrictive on the
48538 ** prevent simultaneous access of the same database by two or more
48542 ** time and one or more of those connections are writing.
50470 rc = SQLITE_ERROR; /* No more retries. */
50498 rc = SQLITE_ERROR; /* No more retries. */
51280 ** May you share freely, never taking more than you give.
51308 ** used by more than one database connection. Mutexes are used by shared
52108 unsigned mFlags /* Zero or more SQLITE_DESERIALIZE_* flags */
52204 ** May you share freely, never taking more than you give.
52224 ** Test operations are about 100 times more common that set operations.
52271 ** This bitmap records the existence of zero or more bits
52618 ** May you share freely, never taking more than you give.
52637 ** such that p was added to the list more recently than p->pDirtyNext.
52739 assert( pPg->pgno>0 || pPg->pPager==0 ); /* Page number is 1 or more */
53372 ** Since there cannot be more than 2^31 distinct pages in a database,
53373 ** there cannot be more than 31 buckets required by the merge sorter.
53512 ** Return true if there are one or more dirty pages in the cache. Else false.
53543 ** May you share freely, never taking more than you give.
53631 ** read a few bytes (no more than 16 bytes) past the end of the page buffer.
53671 ** of one or more PCaches that are able to recycle each other's unpinned
53683 ** Mode 1 uses more memory (since PCache instances are not able to rob
53686 ** threadsafe, but recycles pages more efficiently.
53833 ** true if pCache->pFree ends up containing one or more free pages.
54152 ** If there are currently more than nMaxPage pages allocated, try
54826 ** May you share freely, never taking more than you give.
55006 ** is more efficient to pull a preallocated entry from the pool */
55331 ** May you share freely, never taking more than you give.
55355 ** May you share freely, never taking more than you give.
55519 ** one or more of the following are true about the page:
55814 ** * There are one or more outstanding references to pages (after the
55854 ** at the system level, but it is never set to a more exclusive value.
55883 ** PagerSharedLock() for more detail.
55948 ** some of the more important member variables follows:
55974 ** not updated more often than necessary.
56570 ** or more open savepoints for which:
56837 /* If the checksum doesn't add up, then one or more of the disk sectors
56918 ** the persistent journal and the journal file currently consumes more
57036 ** bytes in size, more than one call to sqlite3OsWrite() may be required
57826 /* Sanity checking on the page. This is more important that I originally
58270 ** (8) Zero or more pages instances, each as follows:
58362 ** This indicates nothing more needs to be rolled back.
58374 ** file consists of pages, there are no more journal headers. Compute
58564 ** For an encrypted database, the situation is more complex: bytes
58617 ** it is discarded. Otherwise, if there are one or more outstanding
58645 ** or more frames have already been written to the log (and therefore
59523 ** if one or more savepoints are open, present in the savepoint
60325 ** the database being opened will be more than pVfs->mxPathname
61734 ** function also deals with the special case where 2 or more pages
62411 ** currently less than nSavepoints open, then open one or more savepoints
62732 ** one or more savepoint bitvecs. This is the reason this function
63347 ** the pager is in WAL mode and the WAL file currently contains one or more
63370 ** May you share freely, never taking more than you give.
63379 ** A WAL file consists of a header followed by zero or more "frames".
63407 ** Immediately following the wal-header are zero or more frames. Each
63515 ** more index blocks.
63556 ** table is never more than half full. The expected number of collisions
63574 ** wrap-around.) Because the hash table is never more than half full,
63925 ** all frames in the WAL in database page order. Where two or more frames
64522 ** writing one or more dirty pages to the WAL to free up memory).
64784 /* If more than one frame was recovered from the log file, report an
64998 ** one or more combinations of X and Y such that
66045 ** This routine will start taking more aggressive measures to clear the
66101 ** is more of a scheduler yield than an actual delay. But on the 10th
66543 ** loop of the following block is more stringent that would be required
66926 ** one or more frames have been overwritten. It updates the checksums for
67556 ** May you share freely, never taking more than you give.
67575 ** May you share freely, never taking more than you give.
67601 ** In this implementation, a single file can hold one or more separate
67709 ** The cell pointer array contains zero or more 2-byte numbers which are
67740 ** appears first. A variable-length integer may not be more than 9 bytes long.
67780 ** * zero or more pages numbers of leaves
67917 u8 hasIncrblobCur; /* True if there are one or more Incrblob cursors */
67960 ** or more database connections. When two or more connections are
67976 ** table (because there exists one or more read-locks on the table),
68072 ** A single database file can be shared by two more database connections,
68093 u8 curFlags; /* zero or more BTCF_* flags defined below */
68465 ** two or more btrees in common both try to lock all their btrees
68603 ** May you share freely, never taking more than you give.
68788 ** the corresponding table. This makes things a bit more complicated,
68837 /* Two or more indexes share the same root page. There must
69363 ** If there are two or more cursors on the same btree, then all such
70354 /* If there is enough space between gap and top for one more cell pointer,
71066 ** SQLITE_CONSTRAINT error. We cannot allow two or more BtShared
71192 ** gives more opportunity for asserts(sqlite3_mutex_held())
72095 ** transaction. If the second argument is 2 or more and exclusive
73208 /* If there are two or more cursors on the same btree, then all such
73430 ** that SQLite can handle) or more. But returning a smaller value might
73565 ** If the current cursor entry uses one or more overflow pages
73569 ** more efficient.
73938 ** right-most child page then pCur->idx is set to one more than
74229 /* If the requested key is one more than the previous key, then
74232 ** is still obtained without this case, only a little more slowely */
74556 /* The record flows over onto one or more overflow pages. In
74570 testcase( nCell<0 ); /* True if key size is 2^32 or more */
75097 ": %d more free pages\n",
75127 ** current transaction has already run one or more incremental-vacuum
75282 ** 3.6.0, databases with freelist trunk pages holding more than
75390 ** So if there exists more than one reference to this page, then it
75720 ** as a contingency. In other words, never need more than 3 overflow
76863 ** This adjustment is more than an optimization. The packing above might
76900 ** (1) We found one or more cells (cntNew[0])>0), or
76952 ** helps the operating system to deliver pages from the disk more rapidly.
76954 ** An O(N*N) sort algorithm is used, but since N is never more than NB+2
77274 ** overfull (has one or more overflow pages).
77342 ** This can occur if a database is corrupt with two or more SQL tables
77414 ** more than one reference to it. This only happens if the page is one
77662 /* This can only happen if the schema is corrupt such that there is more
78606 ** is the old value less one, less one more if that happens to
78840 ** Return 1 if there are 2 or more references to the page and 0 if
79755 ** May you share freely, never taking more than you give.
80557 ** May you share freely, never taking more than you give.
80593 /* Cannot have more than one of MEM_Int, MEM_Real, or MEM_IntReal */
81289 ** For some versions of GCC on 32-bit machines, if you do the more obvious
82332 ** A single call to this function populates zero or more fields of the
82543 ** May you share freely, never taking more than you give.
82703 ** more frequent reallocs and hence provide more opportunities for
83054 ** that could cause problems if two or more co-routines are using the same
83525 ** having to malloc for more space (except when compiled using
84432 ** this routine is N*N. But as N is rarely more than 1, this should not
84626 ** more opcodes to be displayed.
85000 ** After the VDBE has be prepped, it can be executed by one or more
85292 ** write-transaction spanning more than one database file, this routine
85320 ** including the temp database. (b) is important because if more than
85365 /* The simple case - no more than one database file (not counting the
86697 ** Use that approximation to avoid the more expensive call to
87871 ** May you share freely, never taking more than you give.
88848 ** is requested more than once within the same run of a single prepared
89704 ** are no more.
90084 ** May you share freely, never taking more than you give.
90279 ** May you share freely, never taking more than you give.
90642 ** an integer representation is more space efficient on disk.
92621 ** can be zero or more OP_ReleaseReg opcodes intervening, but no other
92634 ** OP_Gt with zero or more intervening OP_ReleaseReg opcodes */
93278 ** branch jumps to reads past the end of the record, but never more
93299 /* If there is more header available for parsing in the record, try
93429 ** read more. Use the global constant sqlite3CtypeMap[] as the array,
93702 ** as the schema format is 2 or more and none of the omitted columns
93704 ** at least one field. If P5>0 then it will be one more than the
93891 /* EVIDENCE-OF: R-06529-47362 Following the size varint are one or more
94230 ** If P2 is zero, then a read-transaction is started. If P2 is 2 or more
94235 ** file used for temporary tables. Indices of 2 or more are used for
94239 ** true (this flag is set if the Vdbe may modify more than one row and may
94585 ** that opcode will always set the p2 value to 2 or more or else fail.
95230 ** was at the target row to begin with or because one or more
96532 ** table or index. If there are no more key/value pairs then fall through
96581 ** record, or jumps to P2 if there are no more sorted records.
97486 ** disabled. In some cases a single trigger may generate more than one
97487 ** SubProgram (if the trigger may be executed with more than one different
98047 ** If changing into or out of WAL mode the procedure is more complicated.
98148 ** Vacuum the entire database P1. P1 is 0 for "main", and 2 or more
98889 ** more CPU cycles to be used, but it should still yield the correct
99266 ** May you share freely, never taking more than you give.
99567 ** think that the table has one more column than it really
99678 ** slightly more efficient). Since you cannot write to a PK column
99785 ** May you share freely, never taking more than you give.
99859 ** merging two or more level-0 PMAs together creates a level-1 PMA.
99900 ** If there are more than SORTER_MAX_MERGE_COUNT PMAs in total when
99904 ** so on, such that no operation ever merges more than SORTER_MAX_MERGE_COUNT
99907 ** If running in multi-threaded mode and there are more than
99908 ** SORTER_MAX_MERGE_COUNT PMAs on disk when Rewind() is called, then more
99969 ** The MergeEngine object is used to combine two or more smaller PMAs into
99976 ** ("EOF" means "End Of File". When aReadr[] is at EOF there is no more data.)
100046 ** and for multi-threaded operation there are two or more instances.
100106 u8 bUsePMA; /* True if one or more PMAs created */
100111 SortSubtask aTask[1]; /* One or more subtasks */
100150 ** and aFile[1]. Neither file is allowed to grow to more than mxSz bytes in
100186 ** size. But I/O is more efficient if it occurs in page-sized blocks where
100278 /* If there is no more data to be read from the buffer, read the next
101320 ** * One or more records packed end-to-end in order of ascending keys.
101390 int *pbEof /* Set TRUE at EOF. Set false for more content */
101859 ** when there exists one or more separate worker threads.
101914 ** reading from the same temp file this makes for more linear file IO.
102188 ** that has already written two or more level-0 PMAs to one or more temp
102206 /* If the sorter uses more than one task, then create the top-level
102269 ** on a sorter that has written two or more PMAs to temporary files. It sets
102554 ** May you share freely, never taking more than you give.
102981 ** May you share freely, never taking more than you give.
102993 ** more importantly, reducing temporary file creation events. If these
103008 ** The zChunk array is always at least 8 bytes in size - usually much more.
103424 ** May you share freely, never taking more than you give.
103473 ** WRC_Abort Do no more callbacks. Unwind the stack and
103684 ** May you share freely, never taking more than you give.
103739 ** zero but it might be more if the alias is contained within a subquery
104001 /* Two or more tables have the same column name which is
104057 /* Two or more tables have the same column name which is
104338 ** cnt>1 means there were two or more matches.
105822 ** May you share freely, never taking more than you give.
106224 ** A vector is defined as any expression that results in two or more
106228 ** considered a vector if it has two or more result columns.
106356 ** sub-select returns more than one column, the first in an array
106373 ** or TK_SELECT that returns more than one column. This function returns
107828 ** If the expression list pEList contains more than iLimit elements,
108438 ** to be set to NULL if iCur contains one or more NULL values.
108496 ** If the RHS of the IN operator is a list or a more complex subquery, then
108537 ** the value in that register will be NULL if the b-tree contains one or more
109210 ** right-hand side (RHS) is an array of zero or more scalar values, or a
111656 ** have one or more non-NULL column, then set pWalker->eCode to 1 and abort.
112335 ** May you share freely, never taking more than you give.
114615 ** May you share freely, never taking more than you give.
116555 ** May you share freely, never taking more than you give.
117195 ** May you share freely, never taking more than you give.
117466 ** May you share freely, never taking more than you give.
118679 ** As more of the CREATE TABLE statement is parsed, additional action
118680 ** routines will be called to add more information to this record.
119109 ** more than one of the substrings, entries toward the top of
119318 "table \"%s\" has more than one primary key", pTab->zName);
119906 ** the final rowid column into one or more columns of the PRIMARY KEY.
120554 ** a negative nCol, it means two or more views form a loop, like this:
121638 ** TODO: Issue a warning if two or more columns of the index are identical.
122196 ** SELECT statement, and the query planner cannot deal with more
122751 ** more than one entry (example: deleting one row then inserting another,
122772 ** makes it more difficult to prove that the code is correct (in
123164 ** May you share freely, never taking more than you give.
123706 ** May you share freely, never taking more than you give.
124725 ** May you share freely, never taking more than you give.
124919 ** If both haystack and needle are BLOBs, then the result is one more than
125380 ** '*' Matches any sequence of zero or more characters.
125397 ** '%' Matches any sequence of zero or more characters
125872 ** The char() function takes zero or more arguments, each of which is
127132 ** May you share freely, never taking more than you give.
127328 ** Otherwise, for a composite foreign key (more than one column), allocate
127734 ** uniquely identify the current row, but the parent key is more convenient
128259 ** * the UPDATE modifies one or more parent keys for which the action is
128280 ** operation modifies one or more child or parent key columns. */
128611 ** May you share freely, never taking more than you give.
129968 ** constant value -1, in case one or more of the returned expressions
130088 ** the expression uses one or more of columns identified by the second and
130419 if( b2ndPass ) break; /* Never need more than 2 passes */
130693 ** flag is not set, but the table has one or more indexes, call
130702 ** but being more selective here allows statements like:
130719 ** not modify the b-tree. It is more efficient to let the coming
130999 ** checks have run, if and only if one or more replace triggers
131582 ** any foreign key constraints. This is more restrictive than necessary.
131772 ** May you share freely, never taking more than you give.
131916 ** May you share freely, never taking more than you give.
131936 ** May you share freely, never taking more than you give.
133379 ** we have to locate the state vector at run-time. In the more common
133540 ** May you share freely, never taking more than you give.
133703 u8 mPragFlg; /* Zero or more PragFlg_XXX values */
134539 ** Create zero or more entries in the output for the SQL functions
135594 /* PRAGMA index_xinfo (newer version with more rows and columns) */
136570 ** more indexes of the table at some point during the lifetime of
136573 ** (3) One or more indexes of the table are currently unanalyzed OR
136574 ** the number of rows in the table has increased by 25 times or more
137152 ** May you share freely, never taking more than you give.
137217 u32 prepFlags, /* Zero or more SQLITE_PREPARE_* flags */
137681 ** If the same database is attached more than once, the first
137692 ** We return -32768 instead of the more usual -1 simply because using
137694 ** more likely to cause a segfault than -1 (of course there are assert()
137824 u32 prepFlags, /* Zero or more SQLITE_PREPARE_* flags */
137969 u32 prepFlags, /* Zero or more SQLITE_PREPARE_* flags */
138085 unsigned int prepFlags, /* Zero or more SQLITE_PREPARE_* flags */
138092 ** which is a bit array consisting of zero or more of the
138113 u32 prepFlags, /* Zero or more SQLITE_PREPARE_* flags */
138195 unsigned int prepFlags, /* Zero or more SQLITE_PREPARE_* flags */
138219 ** May you share freely, never taking more than you give.
138250 ** it may be more efficient to add just the "a" values to the sorter, and
138268 u8 sortFlags; /* Zero or more SORTFLAG_* bits */
138599 ** of the more general WHERE clause. These terms are moved over to the
138777 /* This branch runs if the query contains one or more RIGHT or FULL
138780 ** But if there are two or more tables on the left side
138782 ** such tables. Raise an error if more than one of those references
138785 ** We really ought to raise an error if there are two or more
139002 ** entry before inserting the new one. This way there are never more
139219 ** can be more efficient than storing them directly in the sorter records.
139296 ** zero or more, then data is pulled from srcTab and p->pEList is used only
139367 ** on the right-hand side of an INSERT contains more result columns than
139397 ** iOrderByCol value to one more than the index of the ORDER BY
139415 ** required if there are one or more WITHOUT ROWID tables with
141023 ** two or more separate queries using UNION, UNION ALL, EXCEPT, or
141405 ** Error message for when two or more terms of a compound select have different
142787 ** query. If the subquery has more than one element in its FROM clause,
142958 ** Make sure the same pColumn is not inserted more than once */
143228 ** The hope is that the terms added to the inner query will make it more
143289 ** Return 0 if no changes are made and non-zero if one or more WHERE clause
143454 ** A correct answer is still obtained (though perhaps more slowly) if
144123 ** If we get here it means the result set contains one or more "*"
144782 ** * The subquery is a UNION ALL of two or more terms
145240 ** more conservative than necessary, but much easier than enforcing
145246 ** inside the subquery. This can help the subquery to run more efficiently.
145274 ** it does not need to be computed more than once), and
145708 ** much more complex than aggregates without a GROUP BY.
146170 ** May you share freely, never taking more than you give.
146238 "sqlite3_get_table() called with two or more incompatible queries"
146370 ** May you share freely, never taking more than you give.
147788 ** are more than 32 columns in the table, and at least one of the columns
147849 ** May you share freely, never taking more than you give.
147886 ** literal default values specified: a number, null or a string. (If a more
148580 /* A one-pass strategy that might update more than one row may not
148588 ** strategy that uses an index for which one or more columns are being
148760 ** If there are one or more BEFORE triggers, then do not populate the
148789 ** if there are one or more BEFORE triggers that use this value via
149200 ** May you share freely, never taking more than you give.
149519 ** May you share freely, never taking more than you give.
149725 ** empty. Only the journal header is written. Apparently it takes more
149945 ** May you share freely, never taking more than you give.
150663 ** more v-table. Return SQLITE_NOMEM if a malloc fails, or SQLITE_OK otherwise.
151158 ** module, and more importantly, does not require a CREATE VIRTUAL TABLE
151293 ** May you share freely, never taking more than you give.
151315 ** May you share freely, never taking more than you give.
151544 ** A WhereTerm might also be two or more subterms connected by OR:
151639 ** WHERE clause. Mostly this is a container for one or more WhereTerms.
151902 #define WO_OR 0x0200 /* Two or more OR-connected terms */
151903 #define WO_AND 0x0400 /* Two or more AND-connected terms */
151929 #define WHERE_ONEROW 0x00001000 /* Selects no more than one row */
152669 ** key value of the loop. If one or more IN operators appear, then
153598 ** The WHERE clause may contain zero or more equality
153822 ** 1 or more step operations. The question is, how many steps
154011 /* Case 5: Two or more separately indexed terms connected by OR
154276 ** contained one or more AND term from a notReady table. The
154706 ** May you share freely, never taking more than you give.
155250 ** Analyze a term that consists of two or more OR-connected
155263 ** The term being analyzed must have two or more of OR-connected subterms.
155307 ** A subterm is also indexable if it is an AND of two or more
155460 ** IN operator because one or more terms in the OR clause contain
155722 if( (mPrereq&(mPrereq-1))!=0 ) return 0; /* Refs more than one table */
155824 ** more like other systems, and also preserves legacy. */
155950 /* Analyze a term that is composed of two or more subterms connected by
155959 /* The form "x IS NOT NULL" can sometimes be evaluated more efficiently
156425 ** the more complex analysis done by this routine. Hence, the
156559 ** May you share freely, never taking more than you give.
156858 ** Return NULL if there are no more matching WhereTerms.
157148 /* If there is more than one table or sub-select in the FROM clause of
157635 ** to zero-filled blob of at least 80K bits, but maybe more if the
158009 ** is simply the aSample[] array. If the samples in aSample[] contain more
158012 ** If pRec contains N fields, where N is more than one, then as well as the
158463 ** sample, then assume they are 4x more selective. This brings
158464 ** the estimated selectivity more in line with what it would be
158898 ** (2) pTemplate costs more than any other WhereLoops for which pTemplate
158970 ** UNIQUE constraint) with one or more == constraints is better
158983 ** (1) p has no more dependencies than pTemplate, and
158996 ** (1) pTemplate has no more dependences than p, and
159162 ** Heuristic 2: If there exists one or more WHERE clause terms of the
159324 ** index pIndex. Try to match one more.
159603 ** to be true for half or more of the rows in the table.
159694 ** more expensive. */
160014 ** will be more aggressive about generating automatic indexes for
160026 ** is more than the usual guess of 10 rows, since we have no way
160219 ** uses one or more WO_IN terms, or false otherwise.
160939 ** We say the WhereLoop is "one-row" if it generates no more than one
161072 ** expression for which the SELECT returns more than one column,
161074 ** if it is one of two or more, none of the columns can be
161354 ** For joins of 3 or more tables, track the 10 best paths */
161962 ** (1) The SEARCH happens more than N times where N is the number
162027 ** The index pIdx is used by a query and contains one or more expressions.
162209 /* An ORDER/GROUP BY clause of more than 63 terms cannot be optimized */
162396 /* If one or more WhereTerm.truthProb values were used in estimating
163135 ** May you share freely, never taking more than you give.
163146 ** Any SELECT statement that contains one or more window functions in
163179 ** If there is more than one window function in the SELECT that uses
163181 ** be used to process more than one window function. For example:
163247 ** be implemented using an API, built-in window functions are much more
165901 ** below for a more complete picture.
166243 ** May you share freely, never taking more than you give.
166657 ** YYFALLBACK If defined, this indicates that one or more tokens
171687 ** May you share freely, never taking more than you give.
171836 ** might be implemented more directly using a hand-written hash table.
171908 ** then the i-th keyword has no more hash collisions. Otherwise,
172323 ** For EBCDIC, the rules are more complex but have the same
172803 /* Upon reaching the end of input, call the parser two more times
173029 ** May you share freely, never taking more than you give.
173322 ** May you share freely, never taking more than you give.
173343 ** May you share freely, never taking more than you give.
173376 ** May you share freely, never taking more than you give.
173413 ** May you share freely, never taking more than you give.
175064 zErr = "no more rows available";
175793 ** more frames in the log file. Passing zero or a negative value as the
178376 ** May you share freely, never taking more than you give.
178652 ** context pointers the application will receive two or more
178711 ** May you share freely, never taking more than you give.
178777 ** varint position; (2 more than the delta from previous position)
178783 ** varint position; (2 more than the delta from previous position)
178789 ** Here, array { X } means zero or more occurrences of X, adjacent in
178794 ** The positions numbers are not stored literally but rather as two more
178811 ** column. Hence, a position-list consists of one or more column-lists,
178813 ** a doclist consists of one or more document records.
178839 ** Here, array { X } means zero or more occurrences of X, adjacent in
178853 ** assumption is that large doclists represent terms which are more
178856 ** TODO(shess) It may be useful for blocking decisions to be more
178857 ** dynamic. For instance, it may make more sense to have a 2.5k leaf
178885 ** means zero or more occurrences of X, adjacent in memory.
178914 ** node requires more than ROOT_MAX bytes, it is flushed to %_segments
178935 ** more documents.
178955 ** a tiny bit slower (perhaps due to more overhead in merge-time
179003 ** May you share freely, never taking more than you give.
179215 ** May you share freely, never taking more than you give.
179377 ** in the document set and zero or more prefix indexes. All indexes are stored
179378 ** as one or more b+-trees in the %_segments and %_segdir tables.
179386 ** It is considered impossible for an index to use more than 1024 levels. In
179674 ** A "phrase" is a sequence of one or more tokens that must match in
180208 ** Construct one or more SQL statements from the format string given
180656 ** more "prefix" indexes, depending on the value of the "prefix=" parameter
181267 ** so search through the constraints to see if a more efficient
181301 ** If there is more than one MATCH constraint available, use the first
181553 ** either more than 20 bytes of allocated space following the nNode bytes of
181743 ** pEnd once more so that it points to the byte immediately following the
181959 ** each position in *pp2 for which there exists one or more positions in
181961 ** when the *pp1 token appears before the *pp2 token, but not more than nToken
184463 ** Or, if bOptOk is non-zero, then one or more tokens within the expression
184631 ** of struct Fts3TokenAndCost for more details.
184691 ** any phrase doclist for which 1 or more token doclists have been loaded.
184693 ** one or more tokens will not be deferred.
184696 ** loading N or more overflow pages into memory, where N is computed as:
184912 ** Or, if a phrase contains one or more deferred tokens and one or
184913 ** more non-deferred tokens, then the expression is advanced to the
185269 /* If there are one or more deferred tokens, load the current row into
185486 ** order. For this reason, even though it seems more defensive, the
185769 ** May you share freely, never taking more than you give.
186328 ** May you share freely, never taking more than you give.
186864 ** group more tightly). For example, in the C language, the == operator
186865 ** groups more tightly than ||, and would therefore have a higher precedence.
187078 ** as the only argument is more than nMaxDepth.
187097 ** an equivalent but more balanced form. The tree is modified in place.
187624 ** May you share freely, never taking more than you give.
188010 ** May you share freely, never taking more than you give.
188171 ** Let any sequence of one or more vowels be represented by V and let
188172 ** C be sequence of one or more consonants. Then every word can be
188182 ** Return true if the m-value for z is 1 or more. In other words,
188290 ** US-ASCII case folding. If the input word is too long (more
188291 ** than 20 bytes if it contains no digits or more than 6 bytes if
188675 ** May you share freely, never taking more than you give.
188803 case '\0': return 0; /* No more tokens here */
188905 ** function must be called with two or more arguments:
189198 ** May you share freely, never taking more than you give.
189435 ** May you share freely, never taking more than you give.
189896 ** May you share freely, never taking more than you give.
190221 ** if no level in the FTS index contains more than ? segments, the statement
191424 /* If there are no more entries in the doclist, set pOffsetList to
191631 /* If more than one term matches the prefix, sort the Fts3HashElem
192651 ** b-tree leaf nodes contain more than one term.
192724 ** sqlite3Fts3MsrIncrStart(). One or more calls to MsrIncrNext() may also
192967 ** by one or more space (0x20) characters. In the first case, set *piEndBlock
194415 ** One or more segments have just been removed from absolute level iAbsLevel.
194630 ** merge (or partially merge) two or more segments from absolute level
194856 ** iAbsLevel with more than nSeg segments, or if nSeg is -1,
194857 ** no levels with more than nMin segments. Use this to limit the
195713 ** May you share freely, never taking more than you give.
196394 ** or more tokens in zDoc/nDoc.
197467 ** May you share freely, never taking more than you give.
197867 ** May you share freely, never taking more than you give.
198253 ** May you share freely, never taking more than you give.
198432 /* Enlarge pJson->zBuf so that it can hold at least N more bytes.
198993 ** Return true if z[] begins with 4 (or more) hexadecimal digits
199767 ** If JSON_JSON is set or if more that one PATH argument is supplied then
199835 /* Two or more PATH arguments results in a JSON array with each
200955 ** May you share freely, never taking more than you give.
204266 /* If the aData[] array contains more than one element, elements
204613 ** database page-size is so large that more than RTREE_MAXCELLS entries
205359 ** May you share freely, never taking more than you give.
207001 /* If the aData[] array contains more than one element, elements
207358 ** May you share freely, never taking more than you give.
207916 ** May you share freely, never taking more than you give.
208181 ** May you share freely, never taking more than you give.
208249 ** fields are collected. This means we're probably writing a lot more
208272 ** May you share freely, never taking more than you give.
208289 ** single leaf that is modified more than once as part of the transaction
208309 ** has committed one or more sub-transactions, other database clients continue
208349 ** target table, and one more - "rbu_control". The data_% table should
208368 ** of zero or more numeric characters (0-9). This can be significant because
208475 ** However, RBU is more efficient if reading the rows in from each data_xxx
208493 ** 3) Calls the sqlite3rbu_step() function one or more times on
208505 ** See comments below for more detail on APIs.
209057 ** * each index of the table (zero or more points to visit), and
209066 ** If there are one or more partial indexes on the table, all fields of
209742 ** where <name> is any sequence of 1 or more characters, <name> is returned.
209988 ** }else if( "PRAGMA table_info()" lists one or more "pk" columns ){
210241 ** string containing some SQL clause or list based on one or more of the
210975 ** the target table, plus one (for the rbu_control column), plus one more
212294 ** opened by p->dbMain to one more than the schema cookie of the main
214193 ** May you share freely, never taking more than you give.
215096 ** May you share freely, never taking more than you give.
215691 ** one or more tables. Operations on a single table are grouped together,
215702 ** Followed by one or more changes to the table.
215744 ** Followed by one or more changes to the table.
215787 ** Followed by one or more entries associated with the table.
216023 ** *piHash before returning. If the primary key contains one or more NULL
218611 ** consider any table-header that purports to have more than 65536
220065 ** a row with the correct PK is present in the db, but one or more other
220266 "expected %d or more",
220772 ** user via one or more calls to xOutput, as with the other streaming
221020 ** or more remote UPDATE changes. The aRec/nRec buffer contains the current
221095 ** xOutput zero or more times and SQLITE_OK returned. Or, if xOutput is NULL,
221252 ** Call this one or more times to configure a rebaser.
221362 ** May you share freely, never taking more than you give.
221522 ** more than once for a single FTS query, then all invocations share a
221560 ** xInstCount/xInst APIs. While the xInstCount/xInst APIs are more convenient
221592 ** that contain one or more instances of a specified phrase. For example:
221612 ** significantly more efficient than those alternatives when used with
221835 ** extra entries are added to the FTS index, this method uses more space
221844 ** On the other hand, it may require more CPU cycles to run MATCH queries,
221938 ** May you share freely, never taking more than you give.
222386 ** added to or removed from the index, this function is called one or more
222814 ** May you share freely, never taking more than you give.
222888 ** fts5YYFALLBACK If defined, this indicates that one or more tokens
224291 ** May you share freely, never taking more than you give.
224304 ** through them. Or, if they do overlap (share one or more tokens in
225006 ** May you share freely, never taking more than you give.
225415 ** May you share freely, never taking more than you give.
226165 ** + Zero or more SQL literals in a comma separated list
226381 ** May you share freely, never taking more than you give.
226445 ** AND or OR nodes, it contains 2 or more entries. */
226471 ** A phrase. One or more terms that must appear in a contiguous sequence
226482 ** One or more phrases that must appear within a certain token distance of
227034 ** The near-set object passed as the first argument contains more than
227543 ** a new poslist the way we have to for more complicated phrase or NEAR
229273 ** TODO: Make this more efficient!
229453 ** May you share freely, never taking more than you give.
230014 ** May you share freely, never taking more than you give.
230078 ** SQLite varints. If the FTS table features more than one index (because
230079 ** there are one or more prefix indexes), it is guaranteed that all share
230116 ** zero-or-more {
230127 ** zero-or-more {
230137 ** zero-or-more {
230146 ** zero-or-more {
230489 ** Object for iterating through the merged results of one or more segments,
230891 ** to be more easily edited.
231011 ** Extend level iLvl so that there is room for at least nExtra more
231275 ** a) If the segment just written is smaller than one or more segments
231284 ** If one or more segments are promoted, the structure object is updated
231473 ** set. So the last 0x00 is only a varint 0 if there are 8 more 0x80
232861 ** that it deals with more complicated cases as well.
233039 ** TODO: Make this more efficient!
233301 /* The data is distributed over two or more pages. Copy it into the
233321 ** and there are 100 or more columns. Also called as a fallback from
233322 ** fts5IterSetOutputs_Col100 if the column-list spans more than one page.
233397 /* The data is distributed over two or more pages. Copy it into the
233787 /* If there were FTS5_MIN_DLIDX_SIZE or more empty leaf pages written
234240 ** a single page has been assigned to more than one segment. In
235111 /* Merge data from two or more poslists */
235514 ** added to or removed from the index, this function is called one or more
236686 /* Decode any more doclist data that appears on the page before the
236837 ** May you share freely, never taking more than you give.
238343 ** more commands are added to this function.
239764 ** May you share freely, never taking more than you give.
240933 ** May you share freely, never taking more than you give.
242349 ** May you share freely, never taking more than you give.
243128 ** May you share freely, never taking more than you give.
243473 ** May you share freely, never taking more than you give.
244271 ** May you share freely, never taking more than you give.
244527 ** SQLite will invoke this method one or more times while planning a query