Lines Matching refs:least
1500 ** mode database and there exists at least one client in another process that
1667 ** or [sqlite3_open16()] is used, then flags includes at least
1716 ** ^At least szOsFile bytes of memory are allocated by SQLite
1730 ** to test whether a file is at least readable. The SQLITE_ACCESS_READ
1739 ** ^SQLite will always allocate at least mxPathname+1 bytes for the
1753 ** least the number of microseconds given. ^The xCurrentTime()
2046 ** is always at least as big as the requested size but may be larger.
2050 ** allocators round up memory allocations at least to the next multiple
2227 ** aligned block of memory of at least sz*N bytes, otherwise
3160 ** will sleep multiple times until at least "ms" milliseconds of sleeping
3161 ** have accumulated. ^After at least "ms" milliseconds of sleeping,
3314 ** of memory at least N bytes in length, where N is the parameter.
3336 ** prior memory allocation X to be at least N bytes.
3344 ** of at least N bytes in size or NULL if insufficient memory is available.
3367 ** is always aligned to at least an 8 byte boundary, or to a
3627 ** is only capable of millisecond resolution so the six least significant
4781 ** [prepared statement] S has been stepped at least once using
5691 ** will pick the one that involves the least amount of data conversion.
6592 ** function requires the least amount of data transformation.
6714 ** for at least a number of milliseconds specified in its parameter.
7680 ** required by SQLite. If the table has at least 64 columns and any column
8473 ** versions of these routines, it should at least provide stubs that always
8768 ** S must contain at least N non-zero bytes of content. To append a
10117 ** instruct the query planner to begin at least a read transaction on
10810 ** file immediately after it is first opened. At least one transaction
12197 ** <li> at least as many columns as recorded in the changeset, and
12340 ** callback". If it is not NULL, then for each table affected by at least one
12355 ** <li> The table has at least as many columns as recorded in the
13298 ** // Column iCol contains at least one instance of phrase iPhrase
14184 ** is significant and used at least once. On switch statements
15632 ** using the same locking range we are at least open to the possibility.
19623 ** At least one instance of the following structure is created for each
21719 ** At least two bugs have slipped in because we changed the MEMORY_DEBUG
23364 ** A Memory cell is initialized if at least one of the
27533 ** Return a block of memory of at least nBytes in size.
27950 ** mem5.szAtom is always at least 8 and 32-bit integers are used,
28086 ** Return a block of memory of at least nBytes in size.
28119 /* Make sure mem5.aiFreelist[iLogsize] contains at least one free
30734 ** at least one non-space character */
31776 ** able to accept at least N more bytes of text.
34548 ** zIn is a UTF-16 encoded unicode string at least nChar characters long.
35302 ** The caller must ensure that zOut[] is at least 21 bytes in size.
37213 ** zKeyOut[]. The zKeyOut[] buffer is assumed to hold at least
37362 ** The output text is stored in aOut[], which must be at least
37431 ** written into pOut, which must be at least nOut bytes in length.
37935 ** of at least (INST_MAX_PATHNAME+1) bytes.
42095 ** to mmap(). Restrict its value to 2GB if (size_t) is not at least a
42533 ** to use 64KB pages - in this case each mapping must cover at least two
43444 ** iOff. The mapping must be valid for at least nAmt bytes.
43462 /* Ensure that there is always at least a 256 byte buffer of addressable
43497 ** then there must be at least one outstanding. */
44037 ** by the calling process and must be big enough to hold at least
44432 ** process lacks root privileges, be we should at least try. Without
44718 ** zOut points to a buffer of at least sqlite3_vfs.mxPathname bytes
45822 ** is a string buffer at least MAXPATHLEN+1 characters in size.
46360 ** Make sure at least one set of Win32 APIs is available.
46363 # error "At least one of SQLITE_WIN32_HAS_ANSI and SQLITE_WIN32_HAS_WIDE\
47675 ** The following routine suspends the current thread for at least ms
49921 ** least a 64-bit type. */
50803 ** iOff. The mapping must be valid for at least nAmt bytes.
50824 /* Ensure that there is always at least a 256 byte buffer of addressable
50866 ** then there must be at least one outstanding. */
51894 ** pathname into zOut[]. zOut[] will be at least pVfs->mxPathname
52786 ** Try to enlarge the memory allocation to hold at least sz bytes
53169 ** of at least (INST_MAX_PATHNAME+1) bytes.
53526 ** bitmap. The least significant bit is bit 1.
53682 ** pBuf must be a pointer to at least BITVEC_SZ bytes of temporary storage
56115 ** extracts the least value from the RowSet.
56842 ** (9) Whenever the database file is modified, at least one bit in the range
57307 ** to have at least one page. (i.e. a 1KB file with 2K page-size leads
57716 /* There must be at least one outstanding reference to the pager if
58031 ** zSuper must point to a buffer of at least nSuper bytes allocated by
58787 ** or at least a RESERVED lock. This function may be called when there
60501 ** there is at least one outstanding page reference, this function
61126 ** The pager must hold at least a RESERVED lock when this function
61909 ** at least one non-zero bytes at the start of the journal file.
62630 ** If the exFlag argument is false, then acquire at least a RESERVED
62631 ** lock on the database file. If exFlag is true, then acquire at least
63225 /* Must have at least one page for the WAL commit flag.
63631 ** Check that there are at least nSavepoint savepoints open. If there are
64834 ** of available reader locks and should be at least 3. The default
65034 /* WAL magic value. Either this value, or the same value with the least
66414 ht_slot *aBuffer, /* Buffer of at least *pnList items to use */
67035 u8 *zBuf /* Buffer of at least nBuf bytes */
69246 ** is to limit the maximum cell size so that at least 4 cells will fit
69306 ** freeblocks. Each freeblock is at least 4 bytes in size. The byte offset
69308 ** increasing order. Because a freeblock must be at least 4 bytes in size,
72259 ** always be at least one cell before the first freeblock.
73549 ** a cell. Make sure it is small enough so that at least minFanout
74728 ** the transaction was started. Otherwise, it must be at least 1. */
74739 ** the caller already has at least a read-only transaction open
75330 ** 6) at least 4 bytes have already been read into the output buffer
78015 ** least 13 bytes in size.
82577 ** Make sure pMem->z points to a writable allocation of at least n bytes.
82635 ** Change the pMem->zMalloc allocation to be at least szNew bytes.
84525 ** Resize the Vdbe.aOp array so that it is at least nOp elements larger
85430 ** Verify that at least N opcode slots are available in p without
86776 ** to trigger subprograms. The VDBE is guaranteed to have at least 9
86940 /* There should be at least one opcode.
87691 ** no rollback is necessary. Otherwise, at least a savepoint
88346 ** application using -DSQLITE_DEBUG=1 at least once. With DEBUG
88911 /* At least one of the two values is a number
89445 ** also assumes that it is safe to overread a buffer by at least the
89447 ** guaranteed to be at least 74 (but not 136) bytes of padding following each
93299 ** though, at least, those hashes are different from each other and
94884 /* SQLITE_NULLEQ is clear and at least one operand is NULL,
95316 ** valid through at least column P3. In other words, there should have been
95325 ** P5 is a bitmask of data types. SQLITE_INTEGER is the least significant
95596 /* pC->aRow does not have to hold the entire row, but it does at least
95640 /* Make sure at least the first p2+1 entries of the header have been
96056 ** at least one field. If P5>0 then it will be one more than the
96534 assert( db->nVdbeActive>0 ); /* At least this one VM is active */
97716 ** there is known to be at least one match. If the seekHit value is smaller
99618 ** at least one SQL statement. Any less than that indicates that
100275 ** been called at least once prior to any xInverse call. */
103968 /* Set the flag to indicate that at least one PMA has been written.
104057 ** flush the contents of memory to a new PMA if (a) at least one value is
105515 ** The zChunk array is always at least 8 bytes in size - usually much more.
112590 assert( nFarg>0 ); /* All in-line functions have at least one argument */
114710 ** Return true (non-zero) if expression p can only be true if at least
115840 /* Make sure the schema version is at least 3. But do not upgrade
118274 ** remove the least desirable sample from p->a[] to make room.
123382 sqlite3ErrorMsg(pParse, "must have at least one non-generated column");
125720 ** the left operand of at least one RIGHT JOIN.
135143 ** least a possibility, though it might only work if the destination
146541 int bHasAffBlob; /* At least one column in apExpr[] as affinity BLOB */
146806 ** pSubq, which contains at least one window function. Return 1
149590 ** written the query must use a temp-table for at least one of the ORDER
149761 int iUseFlag; /* Mem address holding flag indicating that at least
150233 ** least once even if the FILTER clause means the min() or max()
151322 ** Return a list of all triggers on table pTab if there exists at least
151325 ** least one of the columns in pChanges is being modified.
151998 ** are more than 32 columns in the table, and at least one of the columns
154883 ** Grow the db->aVTrans[] array so that there is room for at least one
155650 ** term of a join. Every term of the FROM clause will have at least
157880 ** least one.
158756 ** been matched at least once.
158767 ** least once. This is accomplished by storing the PK for the row in
158797 ** at least one row of the right table has matched the left table.
159177 ** consists of at least one character after all escapes have been
159347 ** functions where xFindFunction returns a value of at least
159558 ** subsubterms at least one of which is indexable. Indexable AND
160350 ** This is only required if at least one side of the comparison operation
160844 ** visible to the xBestIndex function, at least not directly. The
162000 ** to zero-filled blob of at least 80K bits, but maybe more if the
162439 ** Specifically, the shortest prefix of at least (1 + iTest%nField)
162621 int *pbDone /* Set to true if at least one expr. value extracted */
163187 ** Increase the memory allocation for pLoop->aLTerm[] to be at least n.
163274 ** (2d) X skips at least as many columns as Y
163584 ** out at least 3 out of 4 rows. If EXPR is -1 or 0 or 1, then maybe the
164123 ** number of repeats in the left-most terms is at least 18.
164503 ** "do the least harm" if the estimates are inaccurate. For example, a
165134 ** separated from it by at least one LEFT or CROSS JOIN. Similarly, the
165136 ** virtual table and are separated from it by at least one LEFT or
165898 ** The constant K is at least 2.0 but will be larger if there are a
181021 # error SQLITE_MAX_LENGTH must be at least 100
181024 # error SQLITE_MAX_SQL_LENGTH must be at least 100
181030 # error SQLITE_MAX_COMPOUND_SELECT must be at least 2
181033 # error SQLITE_MAX_VDBE_OP must be at least 40
181042 # error SQLITE_MAX_LIKE_PATTERN_LENGTH must be at least 1
181048 # error SQLITE_MAX_TRIGGER_DEPTH must be at least 1
184275 ** theory though this may happen, but only after at least
184616 ** aMI[iCol*3 + 2] = Number of rows containing at least one instance
188066 ** is only attempted if it will write at least 64 leaf blocks. Hence
188253 /* There must be at least one argument passed to this function (otherwise
189263 ** * features at least one token that uses an incremental doclist, and
189287 /* This is only called if it is guaranteed that the phrase has at least
190341 ** aMI[iCol*3 + 2] = Number of rows containing at least one instance
190468 ** column contains at least one instance of the phrase.
190474 ** aiOut[iCol*3 + 2] = Number of rows containing at least one instance
193148 ** return true if z contains at least one vowel that is followed
193286 ** zOut is at least big enough to hold nIn bytes. Write the actual
195136 ** at least as many entries as the requested statement has bound
195186 ** of the oldest level in the db that contains at least ? segments. Or,
197989 ** at least one such segment, and it is possible to determine that all
198603 ** Otherwise, if the allocation at pBlob->a is not already at least nMin
199746 ** not contain at least two valid varints, return SQLITE_CORRUPT_VTAB.
199775 ** at least nMin segments. Multiple merges might occur in an attempt to
199804 ** relative level number that contains at least nMin segments, if any.
199806 ** nSeg to nMin. If no level with at least nMin segments can be found,
199849 /* If nSeg is less that zero, then there is no level with at least
201625 ** at least one instance of phrase iPhrase.
202141 ** size that contains at least one instance of all phrases in the query
202201 /* If all query phrases seen by fts3BestSnippet() are present in at least
202879 ** codepoint in the range. The least significant 10 bits are used to store
202880 ** the size of the range (always at least 1). In other words, the value
203096 ** If the least significant bit in flags is clear, then the rule applies
203605 ** the least recently used entry. Return SQLITE_OK on success or a
203736 /* Enlarge pJson->zBuf so that it can hold at least N more bytes.
204300 ** Expand pParse->aBlob so that it holds at least N bytes.
208784 ** Therefore all non-root nodes must contain at least 3 entries. Since
210493 ** least desirable):
210770 ** cell of pNode that grows by the least amount when pCell is added.
213007 ** If the input is a well-formed JSON array of coordinates with at least
214278 ** least desirable):
215754 ** The problem is that in order to update a b-tree, the leaf page (at least)
217361 ** there is room for at least nCol elements. If an OOM occurs, store an
221073 ** pretend that it has at least one page. Otherwise, SQLite will not
221498 ** of at least (DEVSYM_MAX_PATHNAME+1) bytes.
225708 /* If at least one field has been modified, this is not a no-op. */
226382 ** Ensure that there are at least nByte bytes available in the buffer. Or,
226723 /* Make sure the buffer contains at least 10 bytes of input data, or all
229772 ** // Column iCol contains at least one instance of phrase iPhrase
230621 ** If the operation is a delete, it must be called (at least) once for each
233181 ** is the number that contain at least one instance of the phrase
235074 ** Assuming that buffer z is at least nByte bytes in size and contains a
236088 ** the child node is guaranteed to have advanced at least as far as
238661 ** varint has to be at least 16256 to begin with "0xFF". And the default
238810 ** positive delta if the termless page contains at least one rowid,
239167 ** false if it contains at least one term.
239263 ** The only argument points to a buffer at least 8 bytes in size. This
239279 ** The only argument points to a buffer at least 4 bytes in size. This
239317 ** Allocate and return a buffer at least nByte bytes in size.
239786 ** Extend level iLvl so that there is room for at least nExtra more
241678 ** always advanced at least once.
241683 i64 iMatch /* Advance iterator at least this far */
241911 i64 iFrom /* Advance at least as far as this */
242758 ** Grow the pWriter->aDlidx[] array to at least nLvl elements in size.
242833 ** at least one term. Argument (nTerm/pTerm) is the split-key - a term that
245118 ** If the operation is a delete, it must be called (at least) once for each
245966 ** least one free slot on the page.
246623 /* Check that the leaf contains at least one term, and that it is equal
253578 ** If the least significant bit in flags is clear, then the rule applies
254601 ** the number of fts5 rows that contain at least one instance of term
254609 ** the number of fts5 rows that contain at least one instance of term
255588 ** to the first row of output. This method is always called at least