Lines Matching full:three
721 ** [sqlite3_busy_timeout()] to name but three) that are methods on an
1670 ** scratch memory. There are three arguments: A pointer an 8-byte
1690 ** There are three arguments to this option: A pointer to 8-byte aligned
1711 ** There are three arguments: An 8-byte aligned pointer to the memory,
1803 ** <dd> ^This option takes three additional arguments that determine the
2152 ** There are two column (M==2) and three rows (N==3). Thus the
2296 ** The SQLite core uses these three routines for all of its own
2636 ** the following three values, optionally combined with the
2921 ** behave differently in three ways:
3692 ** SQL function or aggregate, pass NULL for all three function callbacks.
5242 ** sqlite3_mutex_leave() is a NULL pointer, then all three routines
7106 ** and as many as three operands. The instruction is recorded
7843 ** three will be 0.
8498 ** The following three macros, FUNCTION(), LIKEFUNC() and AGGREGATE() are
8933 ** three columns in the table. In the Index structure describing
14797 ** a pointer to a static preexisting mutex. Three static mutexes are
16527 ** func This is a pointer to a function taking three arguments
25336 ** Previously, the SQLite OS layer used three functions in place of this
29316 ** There are three possible representations of the bitmap.
30713 ** There are three different approaches to obtaining space for a page,
30731 ** 4. If none of the first three conditions apply and the cache is marked
31306 ** three nodes. And so forth.
31581 ** or SQLITE_FULL. Once one of the first three errors occurs, it persists
31599 ** transaction was opened. The contents of all three of these variables is
32320 /* Read the first three 32-bit fields of the journal header: The nRec
33483 ** being rolled back), then the rollback consists of up to three stages,
33618 ** the rollback journal. There are three levels:
34610 ** three file descriptors, the database file name and the journal
36901 ** Each btree pages is divided into three sections: The header, the
54621 ** 3-byte type for each of the maximum of 32768 columns plus three
60778 /* The following three functions, heightOfExpr(), heightOfExprList()
64330 ** parent table. It is passed three arguments:
65736 ** three arguments to the function come directly from an attach statement:
65910 ** three arguments to the function come directly from a detach statement:
70319 ** array of three CollSeq structures. The first is the collation sequence
70322 ** Stored immediately after the three collation sequences is a copy of
71628 ** All three do the same thing. They return the first non-NULL
72150 ** The replace() function. Three arguments are all strings: call
72687 ** the first three statements in the compareInfo structure. The
74167 ** Three memory locations are allocated:
74297 ** If SQLITE_OMIT_AUTOINCREMENT is defined, then the three routines
74339 ** The three remaining templates assume the statement is of the form
80675 ** Example 1: Consider a three-way compound SQL statement.
89445 ** The index has as many as three equality constraints, but in this
89979 ** In the example, there are three indexed terms connected by OR.
90252 ** entire tables. Thus a three-way join is an O(N^3) operation. But if
94189 ** * Set the error count to three.
94192 ** processing will occur until three tokens have been
94251 ** three input tokens have been successfully shifted.
96402 ** If SQLITE_ANY is specified, add three versions of the function
98439 ** are three basic components:
98840 ** SELECT docid FROM ex1 WHERE b MATCH 'one two three';
99140 /* Create a script to drop the underlying three storage tables. */
99411 ** are three possible strategies, in order of preference:
102707 ** Return TRUE if the word ends with three letters which
102712 ** first three letters and the first one cannot be in [wxy].
103344 ** list. For each token in the <input-string>, three elements are
103940 ** Type SegmentNode is used by the following three functions to create
106102 ** delete the contents of all three tables and throw away any
108568 ** Rtree virtual table module xBestIndex method. There are three
