Lines Matching defs:more
7 ** of 5% or more are commonly seen when SQLite is compiled as a single
37 ** May you share freely, never taking more than you give.
58 ** though perhaps more slowly.
62 ** though perhaps more slowly.
97 ** May you share freely, never taking more than you give.
151 ** May you share freely, never taking more than you give.
322 ** May you share freely, never taking more than you give.
545 ** to use SQLite concurrently from more than one thread.
685 ** ^The sqlite3_exec() interface runs zero or more UTF-8 encoded,
803 ** support for additional result codes that provide more detailed information
1052 ** [sqlite3_file] object (or, more commonly, a subclass of the
1655 ** consist of a single "-" character followed by no more than
2076 ** SQLite will never invoke xInit() more than once without an intervening
2651 ** slower. But the QPSG has the advantage of more predictable behavior. With
2953 ** Things are more complicated if the sqlite3_changes() function is
3205 ** complete query results from one or more queries.
3219 ** A result table might consist of one or more memory allocations.
3249 ** ^The sqlite3_get_table() function evaluates one or more
3305 ** the number of characters written would be a more useful return
3448 ** ^If the previous call to this routine had an N of 1 or more and a
3663 ** to [sqlite3_trace_v2(D,M,X,P)] is an OR-ed combination of one or more of
3723 ** zero or more [SQLITE_TRACE] constants.
4000 ** or more processes write to the same database and any one of those
4103 ** more tolerant of invalid F parameters than newer versions.
4349 ** <li> Run the SQL by calling [sqlite3_step()] one or more times.
4351 ** to step 2. Do this zero or more times.
4429 ** the equivalent tries to allocate space for more than this many opcodes
4603 ** more of the [SQLITE_PREPARE_PERSISTENT|SQLITE_PREPARE_*] flags. ^The
4625 unsigned int prepFlags, /* Zero or more SQLITE_PREPARE_ flags */
4647 unsigned int prepFlags, /* Zero or more SQLITE_PREPARE_ flags */
4903 ** SQL parameter is used more than once, second and subsequent
4995 ** [sqlite3_step()] has been called more recently than [sqlite3_reset()],
5115 ** mean that one or more rows of data will be returned. ^A SELECT statement
5190 ** If two or more threads call one or more
5243 ** must be called one or more times to evaluate the statement.
5278 ** ^With the legacy interface, a more specific error code (for example,
5282 ** the more specific error code is returned directly by sqlite3_step().
5289 ** more threads at the same moment in time.
5314 ** then the more specific [error codes] are returned directly
5610 ** one or more calls to [sqlite3_reset()], or after any call
5680 ** function is to be added. ^If an application uses more than one database
6308 ** These functions are used to associate one or more named pointers
6339 ** Applications and wrapper libraries are discouraged from using more than
6623 ** given the same inputs. If two or more collating functions are registered
6772 ** It is not safe to read or modify this variable in more than one
6829 ** It is not safe to read or modify this variable in more than one
7284 ** which might be more or less than the amount requested.
7353 ** if one or more of following conditions are true:
7575 ** will be called more than once for each database connection that is opened.
8376 ** than an SQLITE_MUTEX_RECURSIVE more than once, the behavior is undefined.
9036 ** pager cache is shared between two or more connections the bytes of heap
9040 ** value as DBSTATUS_CACHE_USED. Or, if one or more or the pager caches are
9087 ** cache overflowing. Transactions are more efficient if they are written
9185 ** or more calls to [sqlite3_step()] followed by a call to [sqlite3_reset()].
9294 ** ^SQLite will never invoke xInit() more than once without an intervening
9363 ** attempt to unpin one or more cache pages by spilling the content of
9477 ** <li><b>sqlite3_backup_step()</b> is called one or more times to transfer
9522 ** are still more pages to be copied, then the function returns [SQLITE_OK].
9689 ** shared-cache table, and more than one other connection currently holds
9719 ** more than one blocked connection that has registered for an unlock-notify
9720 ** callback. ^If two or more such blocked connections have specified the
9898 ** more frames in the [write-ahead log] file. ^Passing zero or
9935 ** occur. But then the newer and more powerful [sqlite3_wal_checkpoint_v2()]
10014 ** an SQLITE_BUSY error is encountered when processing one or more of the
10259 ** by "aOrderBy" are adjacent.)^ ^(Furthermore, when two or more rows
10270 ** two or more rows in the result have the same values for all columns
10427 ** on the RHS of the IN constraint. ^If there are no more values on the
10853 ** <li> One or more transactions must have been written to the current wal
11041 unsigned int mFlags /* Zero or more SQLITE_SERIALIZE_* flags */
11047 ** Zero or more of the following constants can be OR-ed together for
11109 unsigned mFlags /* Zero or more SQLITE_DESERIALIZE_* flags */
11172 ** May you share freely, never taking more than you give.
11332 ** database handle that has one or more session objects attached. Nor is
11443 ** If a single row is affected by more than one operation within a session,
11483 ** in one or more of their PRIMARY KEY columns.
11552 ** A changeset consists of zero or more INSERT, UPDATE and/or DELETE changes,
11563 ** more of their PRIMARY KEY columns. If such a row is inserted or deleted,
11565 ** function. If an existing row with one or more NULL values stored in
11568 ** with non-NULL PRIMARY KEY values is updated so that one or more of its
11599 ** updated or deleted, if one or more of its primary key columns contain a
11620 ** found and one or more of the non-primary key fields have been
11638 ** is written to more than once during a session. For example, if a row
11773 ** more changes have been recorded, return zero.
12183 ** A changegroup is an object used to combine two or more
12192 ** An sqlite3_changegroup object is used to combine two or more changesets
12208 ** <li> Zero or more changesets (or patchsets) are added to the object
12308 ** If one or more of the column values in the row inserted by the
12467 ** If a row with matching primary key values is found, but one or more of
12471 ** database table has more columns than are recorded in the changeset,
12512 ** If a row with matching primary key values is found, but one or more of
12549 ** is only allocated and populated if one or more conflicts were encountered
12647 ** PRIMARY KEY fields is present in the database, but one or more other
12800 ** <li> If there has been one or more REPLACE resolutions on a
12965 ** The xOutput callback is invoked zero or more times to return data to
13121 ** May you share freely, never taking more than you give.
13290 ** more than once for a single FTS query, then all invocations share a
13328 ** xInstCount/xInst APIs. While the xInstCount/xInst APIs are more convenient
13360 ** that contain one or more instances of a specified phrase. For example:
13380 ** significantly more efficient than those alternatives when used with
13643 ** extra entries are added to the FTS index, this method uses more space
13652 ** On the other hand, it may require more CPU cycles to run MATCH queries,
13767 ** May you share freely, never taking more than you give.
13798 ** not have more than a dozen or so columns in any table. And if
13799 ** that is the case, there is no point in having more than a few
13820 ** want to place more severe limits on the complexity of an
13832 ** never has more than 3 or 4 terms. Use a value of 0 to disable
14162 # error "Two or more of the following compile-time configuration options\
14397 ** May you share freely, never taking more than you give.
15214 ** 0x00010000 Show more detail when printing WHERE terms
15431 ** on the sqlite3VListAdd() routine for more information. A VList is really
15451 ** May you share freely, never taking more than you give.
15479 ** May you share freely, never taking more than you give.
15663 ** will support two or more Win95 readers or two or more WinNT readers.
15776 ** May you share freely, never taking more than you give.
15816 ** is devoted to storing a super-journal name - there are no more pages to
16028 ** May you share freely, never taking more than you give.
16319 ** the information into this object helps to keep the interface more
16454 ** May you share freely, never taking more than you give.
17114 ** May you share freely, never taking more than you give.
17309 ** May you share freely, never taking more than you give.
17468 ** DB_UnresetViews means that one or more views have column names that
17522 ** failing over to the full-size pool if that does not work. Thus more
17666 u8 mTrace; /* zero or more SQLITE_TRACE flags */
18226 ** sqlite3StdTypeLen[] and sqlite3StdType[]. Each value is one more
18293 ** used as the P4 operand, they will be more readable.
18447 #define TF_HasHidden 0x00000002 /* Has one or more hidden columns */
18451 #define TF_HasVirtual 0x00000020 /* Has one or more VIRTUAL columns */
18452 #define TF_HasStored 0x00000040 /* Has one or more STORED columns */
18639 ** A record is an object that contains one or more fields of data.
18760 unsigned bHasVCol:1; /* Index references one or more VIRTUAL columns */
18897 ** need more than about 10 or 20 variables. But some extreme users want
18960 ** two or more Expr objects will be stored in a single memory allocation,
19042 #define EP_HasFunc 0x000008 /* Contains one or more functions of any kind */
19043 #define EP_Agg 0x000010 /* Contains one or more aggregate functions */
19251 ** contains more than 63 columns and the 64-th or later column is used.
19317 ** This object represents one or more tables that are the source of
19354 #define WHERE_DUPLICATES_OK 0x0010 /* Ok to return a row more than once */
19398 SrcList *pSrcList; /* One or more tables used to resolve names */
19408 int ncFlags; /* Zero or more NC_* flags defined below */
19427 #define NC_HasAgg 0x000010 /* One or more aggregate functions seen */
19438 #define NC_HasWin 0x008000 /* One or more window functions seen */
20376 ** one or more CTEs (common table expressions).
21786 ** May you share freely, never taking more than you give.
21896 ** May you share freely, never taking more than you give.
22687 ** May you share freely, never taking more than you give.
22789 ** array. tolower() is used more often than toupper() by SQLite.
22893 ** and 93 128-byte slots, which is more lookaside than is available
23092 ** May you share freely, never taking more than you give.
23110 ** May you share freely, never taking more than you give.
23255 ** loading them more than once. For that reason, large TEXT and BLOB values
23357 /* One or more of the following flags are set to indicate the
23871 ** we have to locate the state vector at run-time. In the more common
24228 ** May you share freely, never taking more than you give.
24305 ** Convert zDate into one or more integers according to the conversion
24418 ** fractional seconds FFFF can be one or more digits.
26046 ** May you share freely, never taking more than you give.
26496 ** May you share freely, never taking more than you give.
26529 ** we have to locate the state vector at run-time. In the more common
26586 ** May you share freely, never taking more than you give.
26648 ** May you share freely, never taking more than you give.
26942 ** May you share freely, never taking more than you give.
27050 ** sizes more than NCSIZE*8 bytes.
27273 ** much more likely to break and we are much more liking to find
27473 ** May you share freely, never taking more than you give.
27514 ** more blocks where each block is 8 bytes. The first 8 bytes are
27517 ** A chunk is two or more blocks that is either checked out or
28163 ** May you share freely, never taking more than you give.
28371 ** routine so there is never any chance that two or more
28383 /* No more than 1GiB per allocation */
28751 ** May you share freely, never taking more than you give.
29115 ** May you share freely, never taking more than you give.
29267 ** more than once, the behavior is undefined.
29333 ** May you share freely, never taking more than you give.
29573 ** more than once, the behavior is undefined.
29730 ** May you share freely, never taking more than you give.
29756 ** May you share freely, never taking more than you give.
30095 ** more than once, the behavior is undefined.
30224 ** May you share freely, never taking more than you give.
30349 ** and constrain the soft heap limit to be no more than the hard heap
31191 etByte flags; /* One or more of FLAG_ constants below */
32081 ** able to accept at least N more bytes of text.
32593 ** May you share freely, never taking more than you give.
32963 u8 moreToFollow /* True if more to follow */
32996 SQLITE_PRIVATE void sqlite3TreeViewWindow(TreeView *pView, const Window *pWin, u8 more){
33005 sqlite3TreeViewPush(&pView, more);
33063 SQLITE_PRIVATE void sqlite3TreeViewWinFunc(TreeView *pView, const Window *pWin, u8 more){
33065 sqlite3TreeViewPush(&pView, more);
33912 ** May you share freely, never taking more than you give.
33967 ** we have to locate the state vector at run-time. In the more common
34072 ** May you share freely, never taking more than you give.
34349 ** May you share freely, never taking more than you give.
34509 ** more than n characters from the buffer. z[] is not zero-terminated.
34918 ** May you share freely, never taking more than you give.
35417 ** 2 or more => The input has a decimal point or eNNN clause
36350 /* four or more bytes */
36703 ** Each name/number pair is encoded by subsequent groups of 3 or more
36708 ** The text name overlays one or more following integers. The text name
36811 ** May you share freely, never taking more than you give.
36903 ** May you share freely, never taking more than you give.
37385 ** May you share freely, never taking more than you give.
37713 ** * A sequence of one or more zero-bytes that are not at the
37731 /* A sequence of 1 or more zeros is stored as a little-endian
38367 ** May you share freely, never taking more than you give.
39487 ** But wait: there are yet more problems with POSIX advisory locks.
39516 ** LinuxThreads provided that (1) there is no more than one connection
40120 /* If there is already a lock of this type or more restrictive on the
40579 ** prevent simultaneous access of the same database by two or more
40583 ** time and one or more of those connections are writing.
41338 /* If there is already a lock of this type or more restrictive on the
42820 /* Shared locks never span more than one byte */
44169 int ctrlFlags /* Zero or more UNIXFILE_* values */
44682 ** here such that two or more threads all trying to open databases at
45113 ** unixDlOpen() fails (returns a null pointer). If a more detailed error
46530 ** more than that; it looks at the filesystem type that hosts the
46660 ** May you share freely, never taking more than you give.
49906 /* If there is already a lock of this type or more restrictive on the
50116 ** prevent simultaneous access of the same database by two or more
50120 ** time and one or more of those connections are writing.
52057 rc = SQLITE_ERROR; /* No more retries. */
52085 rc = SQLITE_ERROR; /* No more retries. */
52874 ** May you share freely, never taking more than you give.
52902 ** used by more than one database connection. Mutexes are used by shared
53710 unsigned mFlags /* Zero or more SQLITE_DESERIALIZE_* flags */
53813 ** May you share freely, never taking more than you give.
53833 ** Test operations are about 100 times more common that set operations.
53880 ** This bitmap records the existence of zero or more bits
54227 ** May you share freely, never taking more than you give.
54246 ** such that p was added to the list more recently than p->pDirtyNext.
54361 assert( pPg->pgno>0 || pPg->pPager==0 ); /* Page number is 1 or more */
54994 ** Since there cannot be more than 2^31 distinct pages in a database,
54995 ** there cannot be more than 31 buckets required by the merge sorter.
55134 ** Return true if there are one or more dirty pages in the cache. Else false.
55165 ** May you share freely, never taking more than you give.
55253 ** read a few bytes (no more than 16 bytes) past the end of the page buffer.
55293 ** of one or more PCaches that are able to recycle each other's unpinned
55305 ** Mode 1 uses more memory (since PCache instances are not able to rob
55308 ** threadsafe, but recycles pages more efficiently.
55455 ** true if pCache->pFree ends up containing one or more free pages.
55774 ** If there are currently more than nMaxPage pages allocated, try
56448 ** May you share freely, never taking more than you give.
56628 ** is more efficient to pull a preallocated entry from the pool */
56953 ** May you share freely, never taking more than you give.
56977 ** May you share freely, never taking more than you give.
57146 ** one or more of the following are true about the page:
57441 ** * There are one or more outstanding references to pages (after the
57481 ** at the system level, but it is never set to a more exclusive value.
57510 ** PagerSharedLock() for more detail.
57561 ** some of the more important member variables follows:
57587 ** not updated more often than necessary.
58169 ** or more open savepoints for which:
58436 /* If the checksum doesn't add up, then one or more of the disk sectors
58517 ** the persistent journal and the journal file currently consumes more
58658 ** bytes in size, more than one call to sqlite3OsWrite() may be required
59432 /* Sanity checking on the page. This is more important that I originally
59859 ** (8) Zero or more pages instances, each as follows:
59951 ** This indicates nothing more needs to be rolled back.
59963 ** file consists of pages, there are no more journal headers. Compute
60153 ** For an encrypted database, the situation is more complex: bytes
60204 ** it is discarded. Otherwise, if there are one or more outstanding
60232 ** or more frames have already been written to the log (and therefore
61108 ** if one or more savepoints are open, present in the savepoint
61892 ** the database being opened will be more than pVfs->mxPathname
63307 ** function also deals with the special case where 2 or more pages
63991 ** currently less than nSavepoints open, then open one or more savepoints
64274 ** one or more savepoint bitvecs. This is the reason this function
64891 ** the pager is in WAL mode and the WAL file currently contains one or more
64920 ** May you share freely, never taking more than you give.
64929 ** A WAL file consists of a header followed by zero or more "frames".
64957 ** Immediately following the wal-header are zero or more frames. Each
65065 ** more index blocks.
65106 ** table is never more than half full. The expected number of collisions
65124 ** wrap-around.) Because the hash table is never more than half full,
65483 ** all frames in the WAL in database page order. Where two or more frames
65540 ** signal to be deliver, which will more than likely cause the entire
66226 ** writing one or more dirty pages to the WAL to free up memory).
66494 /* If more than one frame was recovered from the log file, report an
66708 ** one or more combinations of X and Y such that
67867 ** This routine will start taking more aggressive measures to clear the
67925 ** is more of a scheduler yield than an actual delay. But on the 10th
68435 ** loop of the following block is more stringent that would be required
68847 ** one or more frames have been overwritten. It updates the checksums for
69502 ** May you share freely, never taking more than you give.
69521 ** May you share freely, never taking more than you give.
69547 ** In this implementation, a single file can hold one or more separate
69655 ** The cell pointer array contains zero or more 2-byte numbers which are
69686 ** appears first. A variable-length integer may not be more than 9 bytes long.
69726 ** * zero or more pages numbers of leaves
69863 u8 hasIncrblobCur; /* True if there are one or more Incrblob cursors */
69906 ** or more database connections. When two or more connections are
69922 ** table (because there exists one or more read-locks on the table),
70018 ** A single database file can be shared by two more database connections,
70039 u8 curFlags; /* zero or more BTCF_* flags defined below */
70414 ** two or more btrees in common both try to lock all their btrees
70552 ** May you share freely, never taking more than you give.
70752 ** the corresponding table. This makes things a bit more complicated,
70801 /* Two or more indexes share the same root page. There must
71336 ** If there are two or more cursors on the same btree, then all such
72393 /* If there is enough space between gap and top for one more cell pointer,
73061 ** SQLITE_CONSTRAINT error. We cannot allow two or more BtShared
73187 ** gives more opportunity for asserts(sqlite3_mutex_held())
74094 ** transaction. If the second argument is 2 or more and exclusive
75233 /* If there are two or more cursors on the same btree, then all such
75453 ** that SQLite can handle) or more. But returning a smaller value might
75588 ** If the current cursor entry uses one or more overflow pages
75592 ** more efficient.
75980 ** right-most child page then pCur->idx is set to one more than
76278 /* If the requested key is one more than the previous key, then
76281 ** is still obtained without this case, only a little more slowly. */
76605 /* The record flows over onto one or more overflow pages. In
76619 testcase( nCell<0 ); /* True if key size is 2^32 or more */
77176 ": %u more free pages\n",
77206 ** current transaction has already run one or more incremental-vacuum
77361 ** 3.6.0, databases with freelist trunk pages holding more than
77469 ** So if there exists more than one reference to this page, then it
77805 ** as a contingency. In other words, never need more than 3 overflow
77895 ** as a contingency. In other words, never need more than 3 overflow
79045 ** This adjustment is more than an optimization. The packing above might
79084 ** (1) We found one or more cells (cntNew[0])>0), or
79136 ** helps the operating system to deliver pages from the disk more rapidly.
79138 ** An O(N*N) sort algorithm is used, but since N is never more than NB+2
79460 ** overfull (has one or more overflow pages).
79528 ** This can occur if a database is corrupt with two or more SQL tables
79600 ** more than one reference to it. This only happens if the page is one
79870 /* This can only happen if the schema is corrupt such that there is more
80822 ** is the old value less one, less one more if that happens to
81095 ** Return 1 if there are 2 or more references to the page and 0 if
82021 ** May you share freely, never taking more than you give.
82791 ** May you share freely, never taking more than you give.
82827 /* Cannot have more than one of MEM_Int, MEM_Real, or MEM_IntReal */
83534 ** For some versions of GCC on 32-bit machines, if you do the more obvious
84635 ** A single call to this function populates zero or more fields of the
84846 ** May you share freely, never taking more than you give.
85006 ** more frequent reallocs and hence provide more opportunities for
85417 ** that could cause problems if two or more co-routines are using the same
85907 ** having to malloc for more space (except when compiled using
86880 ** this routine is N*N. But as N is rarely more than 1, this should not
87074 ** more opcodes to be displayed.
87447 ** After the VDBE has be prepped, it can be executed by one or more
87726 ** write-transaction spanning more than one database file, this routine
87754 ** including the temp database. (b) is important because if more than
87799 /* The simple case - no more than one database file (not counting the
89153 ** Use that approximation to avoid the more expensive call to
90383 ** May you share freely, never taking more than you give.
91458 ** is requested more than once within the same run of a single prepared
92406 ** are no more.
92925 ** May you share freely, never taking more than you give.
93120 ** May you share freely, never taking more than you give.
93487 ** an integer representation is more space efficient on disk.
95473 ** can be zero or more OP_ReleaseReg opcodes intervening, but no other
95486 ** OP_Gt with zero or more intervening OP_ReleaseReg opcodes */
96128 ** branch jumps to reads past the end of the record, but never more
96149 /* If there is more header available for parsing in the record, try
96284 ** read more. Use the global constant sqlite3CtypeMap[] as the array,
96559 ** as the schema format is 2 or more and none of the omitted columns
96561 ** at least one field. If P5>0 then it will be one more than the
96748 /* EVIDENCE-OF: R-06529-47362 Following the size varint are one or more
97096 ** If P2 is zero, then a read-transaction is started. If P2 is 2 or more
97101 ** file used for temporary tables. Indices of 2 or more are used for
97105 ** true (this flag is set if the Vdbe may modify more than one row and may
97451 ** that opcode will always set the p2 value to 2 or more or else fail.
98097 ** was at the target row to begin with or because one or more
99427 ** table or index. If there are no more key/value pairs then fall through
99476 ** record, or jumps to P2 if there are no more sorted records.
100427 ** disabled. In some cases a single trigger may generate more than one
100428 ** SubProgram (if the trigger may be executed with more than one different
100969 ** If changing into or out of WAL mode the procedure is more complicated.
101070 ** Vacuum the entire database P1. P1 is 0 for "main", and 2 or more
101897 ** more CPU cycles to be used, but it should still yield the correct
102290 ** May you share freely, never taking more than you give.
102590 ** think that the table has one more column than it really
102701 ** slightly more efficient). Since you cannot write to a PK column
102808 ** May you share freely, never taking more than you give.
102882 ** merging two or more level-0 PMAs together creates a level-1 PMA.
102923 ** If there are more than SORTER_MAX_MERGE_COUNT PMAs in total when
102927 ** so on, such that no operation ever merges more than SORTER_MAX_MERGE_COUNT
102930 ** If running in multi-threaded mode and there are more than
102931 ** SORTER_MAX_MERGE_COUNT PMAs on disk when Rewind() is called, then more
102992 ** The MergeEngine object is used to combine two or more smaller PMAs into
102999 ** ("EOF" means "End Of File". When aReadr[] is at EOF there is no more data.)
103069 ** and for multi-threaded operation there are two or more instances.
103129 u8 bUsePMA; /* True if one or more PMAs created */
103134 SortSubtask aTask[1]; /* One or more subtasks */
103173 ** and aFile[1]. Neither file is allowed to grow to more than mxSz bytes in
103209 ** size. But I/O is more efficient if it occurs in page-sized blocks where
103301 /* If there is no more data to be read from the buffer, read the next
104343 ** * One or more records packed end-to-end in order of ascending keys.
104413 int *pbEof /* Set TRUE at EOF. Set false for more content */
104882 ** when there exists one or more separate worker threads.
104937 ** reading from the same temp file this makes for more linear file IO.
105211 ** that has already written two or more level-0 PMAs to one or more temp
105229 /* If the sorter uses more than one task, then create the top-level
105292 ** on a sorter that has written two or more PMAs to temporary files. It sets
105577 ** May you share freely, never taking more than you give.
106026 ** May you share freely, never taking more than you give.
106038 ** more importantly, reducing temporary file creation events. If these
106053 ** The zChunk array is always at least 8 bytes in size - usually much more.
106469 ** May you share freely, never taking more than you give.
106518 ** WRC_Abort Do no more callbacks. Unwind the stack and
106731 ** May you share freely, never taking more than you give.
106786 ** zero but it might be more if the alias is contained within a subquery
107097 /* Two or more tables have the same column name which is
107163 /* Two or more tables have the same column name which is
107218 /* The (much more common) non-SQLITE_ALLOW_ROWID_IN_VIEW case is
107481 ** cnt>1 means there were two or more matches.
109015 ** May you share freely, never taking more than you give.
109493 ** A vector is defined as any expression that results in two or more
109497 ** considered a vector if it has two or more result columns.
109626 ** sub-select returns more than one column, the first in an array
109643 ** or TK_SELECT that returns more than one column. This function returns
111230 ** If the expression list pEList contains more than iLimit elements,
112001 ** to be set to NULL if iCur contains one or more NULL values.
112059 ** If the RHS of the IN operator is a list or a more complex subquery, then
112100 ** the value in that register will be NULL if the b-tree contains one or more
112777 ** right-hand side (RHS) is an array of zero or more scalar values, or a
115319 ** have one or more non-NULL column, then set pWalker->eCode to 1 and abort.
116086 ** greater is in permanent use, then return one more than that last
116146 ** May you share freely, never taking more than you give.
118460 ** May you share freely, never taking more than you give.
120034 if( aLog[0] > 66 /* Index has more than 100 rows */
120480 ** May you share freely, never taking more than you give.
121100 ** May you share freely, never taking more than you give.
121371 ** May you share freely, never taking more than you give.
122569 ** As more of the CREATE TABLE statement is parsed, additional action
122570 ** routines will be called to add more information to this record.
122995 ** more than one of the substrings, entries toward the top of
123205 "table \"%s\" has more than one primary key", pTab->zName);
123804 ** the final rowid column into one or more columns of the PRIMARY KEY.
124464 ** a negative nCol, it means two or more views form a loop, like this:
125547 ** TODO: Issue a warning if two or more columns of the index are identical.
126105 ** SELECT statement, and the query planner cannot deal with more
126660 ** more than one entry (example: deleting one row then inserting another,
126681 ** makes it more difficult to prove that the code is correct (in
127077 ** May you share freely, never taking more than you give.
127620 ** May you share freely, never taking more than you give.
128651 ** May you share freely, never taking more than you give.
128881 ** If both haystack and needle are BLOBs, then the result is one more than
129342 ** '*' Matches any sequence of zero or more characters.
129359 ** '%' Matches any sequence of zero or more characters
129834 ** The char() function takes zero or more arguments, each of which is
131408 ** May you share freely, never taking more than you give.
131604 ** Otherwise, for a composite foreign key (more than one column), allocate
132010 ** uniquely identify the current row, but the parent key is more convenient
132538 ** * the UPDATE modifies one or more parent keys for which the action is
132559 ** operation modifies one or more child or parent key columns. */
132894 ** May you share freely, never taking more than you give.
133551 ** d) One or more of the values in the first row of the VALUES clause
134459 ** constant value -1, in case one or more of the returned expressions
134579 ** the expression uses one or more of columns identified by the second and
134911 if( b2ndPass ) break; /* Never need more than 2 passes */
135185 ** flag is not set, but the table has one or more indexes, call
135194 ** but being more selective here allows statements like:
135211 ** not modify the b-tree. It is more efficient to let the coming
135491 ** checks have run, if and only if one or more replace triggers
136079 ** any foreign key constraints. This is more restrictive than necessary.
136269 ** May you share freely, never taking more than you give.
136413 ** May you share freely, never taking more than you give.
136433 ** May you share freely, never taking more than you give.
137893 ** we have to locate the state vector at run-time. In the more common
138060 ** May you share freely, never taking more than you give.
138220 u8 mPragFlg; /* Zero or more PragFlg_XXX values */
138765 ** optimize on a PI-4 is more like 1 millisecond or less with the 0x10000
139044 ** Create zero or more entries in the output for the SQL functions
140088 /* PRAGMA index_xinfo (newer version with more rows and columns) */
141182 ** (4) One or more of the following is true:
141184 ** (4b) One or more indexes on the table lacks an entry
141187 ** or more indexes of the table at some point during the lifetime
141190 ** (5) One or more of the following is true:
141191 ** (5a) One or more indexes on the table lacks an entry
141275 /* If ANALYZE might be invoked two or more times, hold a write
141803 ** May you share freely, never taking more than you give.
141868 u32 prepFlags, /* Zero or more SQLITE_PREPARE_* flags */
142339 ** If the same database is attached more than once, the first
142350 ** We return -32768 instead of the more usual -1 simply because using
142352 ** more likely to cause a segfault than -1 (of course there are assert()
142486 u32 prepFlags, /* Zero or more SQLITE_PREPARE_* flags */
142640 u32 prepFlags, /* Zero or more SQLITE_PREPARE_* flags */
142757 unsigned int prepFlags, /* Zero or more SQLITE_PREPARE_* flags */
142764 ** which is a bit array consisting of zero or more of the
142785 u32 prepFlags, /* Zero or more SQLITE_PREPARE_* flags */
142867 unsigned int prepFlags, /* Zero or more SQLITE_PREPARE_* flags */
142891 ** May you share freely, never taking more than you give.
142922 ** it may be more efficient to add just the "a" values to the sorter, and
142940 u8 sortFlags; /* Zero or more SORTFLAG_* bits */
143278 ** of the more general WHERE clause. These terms are moved over to the
143457 /* This branch runs if the query contains one or more RIGHT or FULL
143460 ** But if there are two or more tables on the left side
143462 ** such tables. Raise an error if more than one of those references
143465 ** We really ought to raise an error if there are two or more
143686 ** entry before inserting the new one. This way there are never more
143906 ** can be more efficient than storing them directly in the sorter records.
143983 ** zero or more, then data is pulled from srcTab and p->pEList is used only
144036 ** on the right-hand side of an INSERT contains more result columns than
144066 ** iOrderByCol value to one more than the index of the ORDER BY
144084 ** required if there are one or more WITHOUT ROWID tables with
145725 ** two or more separate queries using UNION, UNION ALL, EXCEPT, or
146105 ** Error message for when two or more terms of a compound select have different
147009 ** have incompatible affinities on one or more arms of the compound.
147506 ** query. If the subquery has more than one element in its FROM clause,
147676 ** Make sure the same pColumn is not inserted more than once */
147946 ** The hope is that the terms added to the inner query will make it more
148039 ** Return 0 if no changes are made and non-zero if one or more WHERE clause
148333 ** A correct answer is still obtained (though perhaps more slowly) if
149000 ** If we get here it means the result set contains one or more "*"
150002 ** * The subquery is a UNION ALL of two or more terms
150567 ** more conservative than necessary, but much easier than enforcing
150573 ** inside the subquery. This can help the subquery to run more efficiently.
151013 ** much more complex than aggregates without a GROUP BY.
151511 ** May you share freely, never taking more than you give.
151579 "sqlite3_get_table() called with two or more incompatible queries"
151711 ** May you share freely, never taking more than you give.
153209 ** are more than 32 columns in the table, and at least one of the columns
153273 ** May you share freely, never taking more than you give.
153310 ** literal default values specified: a number, null or a string. (If a more
154015 /* A one-pass strategy that might update more than one row may not
154023 ** strategy that uses an index for which one or more columns are being
154200 ** If there are one or more BEFORE triggers, then do not populate the
154229 ** if there are one or more BEFORE triggers that use this value via
154644 ** May you share freely, never taking more than you give.
154976 ** May you share freely, never taking more than you give.
155182 ** empty. Only the journal header is written. Apparently it takes more
155392 ** May you share freely, never taking more than you give.
156113 ** more v-table. Return SQLITE_NOMEM if a malloc fails, or SQLITE_OK otherwise.
156629 ** module, and more importantly, does not require a CREATE VIRTUAL TABLE
156768 ** May you share freely, never taking more than you give.
156790 ** May you share freely, never taking more than you give.
157019 ** A WhereTerm might also be two or more subterms connected by OR:
157114 ** WHERE clause. Mostly this is a container for one or more WhereTerms.
157377 #define WO_OR 0x0200 /* Two or more OR-connected terms */
157378 #define WO_AND 0x0400 /* Two or more AND-connected terms */
157404 #define WHERE_ONEROW 0x00001000 /* Selects no more than one row */
158175 ** key value of the loop. If one or more IN operators appear, then
159125 ** The WHERE clause may contain zero or more equality
159349 ** 1 or more step operations. The question is, how many steps
159531 /* Case 5: Two or more separately indexed terms connected by OR
159796 ** contained one or more AND term from a notReady table. The
159904 ** more complex one is call the "push-down" optimization in MySQL. Here
160241 ** May you share freely, never taking more than you give.
160785 ** Analyze a term that consists of two or more OR-connected
160798 ** The term being analyzed must have two or more of OR-connected subterms.
160842 ** A subterm is also indexable if it is an AND of two or more
160995 ** IN operator because one or more terms in the OR clause contain
161369 ** more like other systems, and also preserves legacy. */
161495 /* Analyze a term that is composed of two or more subterms connected by
161504 /* The form "x IS NOT NULL" can sometimes be evaluated more efficiently
161980 ** the more complex analysis done by this routine. Hence, the
162117 ** May you share freely, never taking more than you give.
162452 ** Return NULL if there are no more matching WhereTerms.
162750 /* If there is more than one table or sub-select in the FROM clause of
163182 ** if one or more key columns has the ability to hold numeric
163340 ** to zero-filled blob of at least 80K bits, but maybe more if the
163721 ** is simply the aSample[] array. If the samples in aSample[] contain more
163724 ** If pRec contains N fields, where N is more than one, then as well as the
164180 ** sample, then assume they are 4x more selective. This brings
164181 ** the estimated selectivity more in line with what it would be
164596 ** but the cost of running X is not more than the cost of running Y.
164656 ** (2) pTemplate costs more than any other WhereLoops for which pTemplate
164728 ** UNIQUE constraint) with one or more == constraints is better
164741 ** (1) p has no more dependencies than pTemplate, and
164754 ** (1) pTemplate has no more dependencies than p, and
164920 ** Heuristic 2: If there exists one or more WHERE clause terms of the
165083 ** index pIndex. Try to match one more.
165370 ** to be true for half or more of the rows in the table.
165483 ** more expensive. */
165954 ** will be more aggressive about generating automatic indexes for
165967 ** is more than the usual guess of 10 rows, since we have no way
166201 ** uses one or more WO_IN terms, or false otherwise.
166921 ** We say the WhereLoop is "one-row" if it generates no more than one
167054 ** expression for which the SELECT returns more than one column,
167056 ** if it is one of two or more, none of the columns can be
167355 ** For joins of 3 or more tables, track the 10 best paths */
168051 ** (1) The SEARCH happens more than N times where N is the number
168153 ** The index pIdx is used by a query and contains one or more expressions.
168367 /* An ORDER/GROUP BY clause of more than 63 terms cannot be optimized */
168587 /* If one or more WhereTerm.truthProb values were used in estimating
169366 ** May you share freely, never taking more than you give.
169377 ** Any SELECT statement that contains one or more window functions in
169410 ** If there is more than one window function in the SELECT that uses
169412 ** be used to process more than one window function. For example:
169478 ** be implemented using an API, built-in window functions are much more
172135 ** below for a more complete picture.
172474 ** May you share freely, never taking more than you give.
172897 ** YYFALLBACK If defined, this indicates that one or more tokens
178010 ** May you share freely, never taking more than you give.
178159 ** might be implemented more directly using a hand-written hash table.
178231 ** then the i-th keyword has no more hash collisions. Otherwise,
178646 ** For EBCDIC, the rules are more complex but have the same
179161 /* Upon reaching the end of input, call the parser two more times
179387 ** May you share freely, never taking more than you give.
179680 ** May you share freely, never taking more than you give.
179701 ** May you share freely, never taking more than you give.
179734 ** May you share freely, never taking more than you give.
179771 ** May you share freely, never taking more than you give.
179933 /* If the size of "long double" is not more than 8, then
179941 ** double takes up more space. The only way to determine if long double
181467 zErr = "no more rows available";
182219 ** more frames in the log file. Passing zero or a negative value as the
184887 ** May you share freely, never taking more than you give.
185166 ** context pointers the application will receive two or more
185225 ** May you share freely, never taking more than you give.
185291 ** varint position; (2 more than the delta from previous position)
185297 ** varint position; (2 more than the delta from previous position)
185303 ** Here, array { X } means zero or more occurrences of X, adjacent in
185308 ** The positions numbers are not stored literally but rather as two more
185325 ** column. Hence, a position-list consists of one or more column-lists,
185327 ** a doclist consists of one or more document records.
185353 ** Here, array { X } means zero or more occurrences of X, adjacent in
185367 ** assumption is that large doclists represent terms which are more
185370 ** TODO(shess) It may be useful for blocking decisions to be more
185371 ** dynamic. For instance, it may make more sense to have a 2.5k leaf
185399 ** means zero or more occurrences of X, adjacent in memory.
185428 ** node requires more than ROOT_MAX bytes, it is flushed to %_segments
185449 ** more documents.
185469 ** a tiny bit slower (perhaps due to more overhead in merge-time
185517 ** May you share freely, never taking more than you give.
185729 ** May you share freely, never taking more than you give.
185891 ** in the document set and zero or more prefix indexes. All indexes are stored
185892 ** as one or more b+-trees in the %_segments and %_segdir tables.
185900 ** It is considered impossible for an index to use more than 1024 levels. In
186189 ** A "phrase" is a sequence of one or more tokens that must match in
186727 ** Construct one or more SQL statements from the format string given
187176 ** more "prefix" indexes, depending on the value of the "prefix=" parameter
187787 ** so search through the constraints to see if a more efficient
187821 ** If there is more than one MATCH constraint available, use the first
188073 ** either more than 20 bytes of allocated space following the nNode bytes of
188263 ** pEnd once more so that it points to the byte immediately following the
188479 ** each position in *pp2 for which there exists one or more positions in
188481 ** when the *pp1 token appears before the *pp2 token, but not more than nToken
191039 ** Or, if bOptOk is non-zero, then one or more tokens within the expression
191207 ** of struct Fts3TokenAndCost for more details.
191267 ** any phrase doclist for which 1 or more token doclists have been loaded.
191269 ** one or more tokens will not be deferred.
191272 ** loading N or more overflow pages into memory, where N is computed as:
191488 ** Or, if a phrase contains one or more deferred tokens and one or
191489 ** more non-deferred tokens, then the expression is advanced to the
191844 /* If there are one or more deferred tokens, load the current row into
192072 ** order. For this reason, even though it seems more defensive, the
192361 ** May you share freely, never taking more than you give.
192921 ** May you share freely, never taking more than you give.
193457 ** group more tightly). For example, in the C language, the == operator
193458 ** groups more tightly than ||, and would therefore have a higher precedence.
193671 ** as the only argument is more than nMaxDepth.
193690 ** an equivalent but more balanced form. The tree is modified in place.
194217 ** May you share freely, never taking more than you give.
194603 ** May you share freely, never taking more than you give.
194764 ** Let any sequence of one or more vowels be represented by V and let
194765 ** C be sequence of one or more consonants. Then every word can be
194775 ** Return true if the m-value for z is 1 or more. In other words,
194883 ** US-ASCII case folding. If the input word is too long (more
194884 ** than 20 bytes if it contains no digits or more than 6 bytes if
195268 ** May you share freely, never taking more than you give.
195396 case '\0': return 0; /* No more tokens here */
195498 ** function must be called with two or more arguments:
195791 ** May you share freely, never taking more than you give.
196028 ** May you share freely, never taking more than you give.
196490 ** May you share freely, never taking more than you give.
196815 ** if no level in the FTS index contains more than ? segments, the statement
198018 /* If there are no more entries in the doclist, set pOffsetList to
198225 /* If more than one term matches the prefix, sort the Fts3HashElem
199247 ** b-tree leaf nodes contain more than one term.
199320 ** sqlite3Fts3MsrIncrStart(). One or more calls to MsrIncrNext() may also
199563 ** by one or more space (0x20) characters. In the first case, set *piEndBlock
201021 ** One or more segments have just been removed from absolute level iAbsLevel.
201236 ** merge (or partially merge) two or more segments from absolute level
201462 ** iAbsLevel with more than nSeg segments, or if nSeg is -1,
201463 ** no levels with more than nMin segments. Use this to limit the
202327 ** May you share freely, never taking more than you give.
203010 ** or more tokens in zDoc/nDoc.
204085 ** May you share freely, never taking more than you give.
204485 ** May you share freely, never taking more than you give.
204871 ** May you share freely, never taking more than you give.
204906 ** or more bytes.
204933 ** is more than one byte in size and that the payload size is determined
204969 ** Usually this will be an ARRAY or OBJECT element which has many more
205151 ** 3. Zero or more changes are made to aBlob[] (via json_remove() or
205369 /* Enlarge pJson->zBuf so that it can hold at least N more bytes.
205766 ** Return true if z[] begins with 2 (or more) hexadecimal digits
205773 ** Return true if z[] begins with 4 (or more) hexadecimal digits
206168 u32 iEnd, /* One more than the last byte of the element */
208675 ** If JSON_JSON is set or if more that one PATH argument is supplied then
210332 ** May you share freely, never taking more than you give.
212568 ** contains pCell. If two or more cells in pNode completely contain pCell
213507 /* If the aData[] array contains more than one element, elements
213860 ** database page-size is so large that more than RTREE_MAXCELLS entries
214620 ** May you share freely, never taking more than you give.
216285 /* If the aData[] array contains more than one element, elements
216644 ** May you share freely, never taking more than you give.
217235 ** May you share freely, never taking more than you give.
217500 ** May you share freely, never taking more than you give.
217568 ** fields are collected. This means we're probably writing a lot more
217591 ** May you share freely, never taking more than you give.
217608 ** single leaf that is modified more than once as part of the transaction
217628 ** has committed one or more sub-transactions, other database clients continue
217668 ** target table, and one more - "rbu_control". The data_% table should
217687 ** of zero or more numeric characters (0-9). This can be significant because
217794 ** However, RBU is more efficient if reading the rows in from each data_xxx
217812 ** 3) Calls the sqlite3rbu_step() function one or more times on
217824 ** See comments below for more detail on APIs.
218377 ** * each index of the table (zero or more points to visit), and
218386 ** If there are one or more partial indexes on the table, all fields of
219063 ** where <name> is any sequence of 1 or more characters, <name> is returned.
219309 ** }else if( "PRAGMA table_info()" lists one or more "pk" columns ){
219562 ** string containing some SQL clause or list based on one or more of the
220296 ** the target table, plus one (for the rbu_control column), plus one more
221631 ** opened by p->dbMain to one more than the schema cookie of the main
223558 ** May you share freely, never taking more than you give.
224466 ** May you share freely, never taking more than you give.
225089 ** one or more tables. Operations on a single table are grouped together,
225100 ** Followed by one or more changes to the table.
225142 ** Followed by one or more changes to the table.
225185 ** Followed by one or more entries associated with the table.
225422 ** *piHash before returning. If the primary key contains one or more NULL
226393 ** Table pTab has one or more existing change-records with old.* records
228426 ** consider any table-header that purports to have more than 65536
229902 ** a row with the correct PK is present in the db, but one or more other
230105 "expected %d or more",
230804 ** user via one or more calls to xOutput, as with the other streaming
230892 /* Cannot add a schema after one or more calls to sqlite3changegroup_add(),
231096 ** or more remote UPDATE changes. The aRec/nRec buffer contains the current
231171 ** xOutput zero or more times and SQLITE_OK returned. Or, if xOutput is NULL,
231328 ** Call this one or more times to configure a rebaser.
231439 ** May you share freely, never taking more than you give.
231609 ** more than once for a single FTS query, then all invocations share a
231647 ** xInstCount/xInst APIs. While the xInstCount/xInst APIs are more convenient
231679 ** that contain one or more instances of a specified phrase. For example:
231699 ** significantly more efficient than those alternatives when used with
231962 ** extra entries are added to the FTS index, this method uses more space
231971 ** On the other hand, it may require more CPU cycles to run MATCH queries,
232065 ** May you share freely, never taking more than you give.
232532 ** added to or removed from the index, this function is called one or more
232982 ** May you share freely, never taking more than you give.
233056 ** fts5YYFALLBACK If defined, this indicates that one or more tokens
234482 ** May you share freely, never taking more than you give.
234495 ** through them. Or, if they do overlap (share one or more tokens in
235236 ** May you share freely, never taking more than you give.
235648 ** May you share freely, never taking more than you give.
236443 ** + Zero or more SQL literals in a comma separated list
236689 ** May you share freely, never taking more than you give.
236763 ** AND or OR nodes, it contains 2 or more entries. */
236791 ** A phrase. One or more terms that must appear in a contiguous sequence
236802 ** One or more phrases that must appear within a certain token distance of
237395 ** The near-set object passed as the first argument contains more than
237904 ** a new poslist the way we have to for more complicated phrase or NEAR
239668 ** TODO: Make this more efficient!
239947 ** May you share freely, never taking more than you give.
240538 ** May you share freely, never taking more than you give.
240602 ** See below for more on structure record formats.
240666 ** zero-or-more {
240677 ** zero-or-more {
240687 ** zero-or-more {
240696 ** zero-or-more {
240766 ** There are zero or more of these associated with each segment. They
241114 ** Object for iterating through the merged results of one or more segments,
241583 ** to be more easily edited.
241724 ** Extend level iLvl so that there is room for at least nExtra more
242000 ** a) If the segment just written is smaller than one or more segments
242009 ** If one or more segments are promoted, the structure object is updated
243708 ** that it deals with more complicated cases as well.
243969 ** TODO: Make this more efficient!
244231 /* The data is distributed over two or more pages. Copy it into the
244251 ** and there are 100 or more columns. Also called as a fallback from
244252 ** fts5IterSetOutputs_Col100 if the column-list spans more than one page.
244327 /* The data is distributed over two or more pages. Copy it into the
244728 /* If there were FTS5_MIN_DLIDX_SIZE or more empty leaf pages written
245181 ** a single page has been assigned to more than one segment. In
245591 ** rewrites node iPgno, and possibly one or more of its right-hand peers,
246634 /* Merge data from two or more poslists */
247052 ** added to or removed from the index, this function is called one or more
247910 ** (more than half of the slots are occupied), then non-zero is returned
248072 ** 3. The hash table already consists of more than one page, or of
248134 ** table. Free all buffers and then try again with more pages. */
249199 /* Decode any more doclist data that appears on the page before the
249608 ** May you share freely, never taking more than you give.
251140 ** more commands are added to this function.
252717 ** May you share freely, never taking more than you give.
253948 ** May you share freely, never taking more than you give.
255407 ** May you share freely, never taking more than you give.
256186 ** May you share freely, never taking more than you give.
256531 ** May you share freely, never taking more than you give.
257330 ** May you share freely, never taking more than you give.
257594 ** SQLite will invoke this method one or more times while planning a query