Lines Matching defs:prefix
505 ** compile time. ^The SQLITE_ prefix may be omitted from the
512 ** prefix is omitted from any strings returned by
3001 ** complete if it ends with a semicolon token and is not a prefix of a
3822 ** a ":" character you should prefix the filename with a pathname such as
4644 ** if the EXPLAIN or EXPLAIN QUERY PLAN prefix were omitted.
13053 ** returned by the tokenizer will be treated as a token prefix.
13162 ** does not support prefix queries very well. If, as suggested above, the
13169 ** will probably not map "1s" to any prefix of "first").
13171 ** For full prefix support, method (3) may be preferred. In this case,
13172 ** because the index contains entries for both "first" and "1st", prefix
13180 ** provide synonyms for prefixes). However, a non-prefix query like '1st'
14994 ** Temporary files are named starting with this prefix followed by 16 random
14998 ** prefix to reflect your program's name, so that if your program exits
15002 ** 2006-10-31: The default prefix used to be "sqlite_". But then
15008 ** For this reason, the default name prefix is changed to be "sqlite"
18000 ** just a prefix of the key. The number of fields is given by
18847 ** Allowed values for Select.selFlags. The "SF" prefix stands for
18890 ** by one of the following macros. The "SRT" prefix means "SELECT Result
29995 etByte prefix; /* Offset into aPrefix[] of the prefix string */
30164 etByte flag_prefix; /* '+' or ' ' or 0 for prefix */
30173 char prefix; /* Prefix character. "+" or "-" or " " or '\0'. */
30379 prefix = '-';
30382 prefix = flag_prefix;
30396 prefix = 0;
30399 if( flag_zeropad && precision<width-(prefix!=0) ){
30400 precision = width-(prefix!=0);
30450 if( prefix ) *(--bufpt) = prefix; /* Add sign */
30451 if( flag_alternateform && infop->prefix ){ /* Add "0" or "0x" */
30454 pre = &aPrefix[infop->prefix];
30478 prefix = '-';
30480 prefix = flag_prefix;
30513 buf[0] = prefix;
30514 memcpy(buf+(prefix!=0),"Inf",4);
30515 length = 3+(prefix!=0);
30556 if( prefix ){
30557 *(bufpt++) = prefix;
30624 i = prefix!=0;
31385 ** Generate a single line of output for the tree, with a prefix that contains
34020 ** -1 => Not a valid number, but has a valid prefix which
34032 ** If some prefix of the input string is a valid number, this routine
34033 ** returns FALSE but it still converts the prefix and writes the result
34294 ** -1 Not even a prefix of the input text looks like an integer
35969 /* Expand the key name with an appropriate prefix and put the result
50593 ** prefix.
58258 ** (1) 8 byte prefix. A copy of aJournalMagic[].
60348 ** \0\0\0\0 database prefix (4 bytes)
60388 4 + /* Database prefix */
60411 pPtr += 4; /* Skip zero prefix */
68268 const char *zPfx; /* Error message prefix */
71404 ** MX_CELL_SIZE(pBt) bytes with a 4-byte prefix for a left-child
86841 ** If one blob is a prefix of the other, then the shorter is the lessor.
90154 int n; /* Length of a token prefix */
95179 ** This opcode is a prefix opcode to OP_SeekGE. In other words, this
95416 ** is a prefix of any entry in P1 then a jump is made to P2 and
95433 ** is not the prefix of any entry in P1 then a jump is made to P2. If P1
95434 ** does contain an entry whose prefix matches the P3/P4 record then control
95485 ** P1 index btree has a matching key prefix. If there are no matches, jump
96158 ** P1 is a sorter cursor. This instruction compares a prefix of the
96159 ** record blob in register P3 against a prefix of the entry that
105626 ** form Z (with no X and Y prefix) where the Z matches the right-hand
112662 zTab = &pNew->zName[16]; /* Skip the "sqlite_altertab_" prefix on the name */
112842 ** the name by adding an "sqlite_altertab_" prefix. By adding this
112843 ** prefix, we insure that the name will not collide with an existing
112845 ** prefix on their name.
115180 /* This sample is being added because the prefix that ends in column
115182 ** added a sample that shares this prefix, there is no need to add
115184 ** existing sample that shares this prefix. */
122290 ** database name prefix. Like this: "database.table". The pDatabase
124652 int prefixOnly, /* Compute only a unique prefix of the key */
140319 ** prefix, ex: TABLE.COLUMN. Otherwise use zSpan.
154872 Expr **ppPrefix, /* Pointer to TK_STRING expression with pattern prefix */
154880 int cnt; /* Number of non-wildcard prefix characters */
154914 /* Count the number of prefix characters prior to the first wildcard */
154922 ** with a wildcard and if (2) the non-wildcard prefix does not end with
154925 ** that we can increment the prefix key to find an upper bound for the
154935 /* Get the pattern prefix. Remove all escapes from the prefix. */
154951 ** pattern prefix boundaries (both the start and end boundaries) must
156004 ** The last character of the prefix "abc" is incremented to form the
158061 /* The proposed effective sample is a prefix of sample aSample[iSamp].
158062 ** Specifically, the shortest prefix of at least (1 + iTest%nField)
158103 ** (iCol+1) field prefix of sample i. */
158112 ** be greater than or equal to the (iCol) field prefix of sample i.
158134 /* At this point, the (iCol+1) field prefix of aSample[i] is the first
158378 ** key-prefix formed by the nEq values matched against the nEq left-most
160175 /* If a non-unique index is used, or if a prefix of the key for
162578 /* If we know that only a prefix of the record will be used,
166373 ** object describing the query for which the WITH clause is a prefix.
167707 ** <li> A prefix string written at the beginning of every
178319 ** The name can optionally begin with "SQLITE_" but the "SQLITE_" prefix
178832 ** varint nPrefix; (length of prefix shared with previous term)
178878 ** varint nPrefix; (length of shared prefix with previous term)
179377 ** in the document set and zero or more prefix indexes. All indexes are stored
180634 ** This function is used when parsing the "prefix=" FTS4 parameter.
180656 ** more "prefix" indexes, depending on the value of the "prefix=" parameter
180659 ** Argument zParam is passed the value of the "prefix=" option if one was
180670 const char *zParam, /* ABC in prefix=ABC parameter to parse */
180905 { "prefix", 6 }, /* 1 -> PREFIX */
181046 sqlite3Fts3ErrMsg(pzErr, "error parsing prefix parameter: %s", zPrefix);
181515 ** a b-tree for a term or term prefix. The node data is passed to this
181524 ** a prefix.
181567 int nPrefix = 0; /* Size of term prefix */
181638 ** or terms for which the specified term is a prefix.
181644 ** term is a prefix.
181647 ** the specified term or any terms for which it is a prefix. However, if the
182125 ** large number of) doclists for each term that matches a prefix query.
182501 ** a queried prefix. It merges all these doclists into one, the doclist
182502 ** for the specified prefix. Since there can be a very large number of
182614 int isPrefix, /* True for a prefix search */
182688 int isPrefix, /* True for a prefix search */
182728 ** zTerm/nTerm is a prefix. If successful, return SQLITE_OK and write
182742 int isPrefix, /* True for a prefix search */
182802 ** prefix) from the database.
183799 ** segment b-tree (if the term is not a prefix or it is a prefix for which
183800 ** there exists prefix b-tree of the right length) then it may be traversed
184072 ** tokens or prefix tokens that cannot use a prefix-index. */
190432 ** document terms, and each configured prefix size (configured the FTS
190433 ** "prefix=" option). And each index consists of multiple levels ("relative
190444 ** for language-id 0 is allocate values 0-1023. The first prefix index
190448 ** So, for a system with nPrefix prefix indexes configured, the block of
190732 /* Add the term to each of the prefix indexes that it is not too
191206 int nPrefix; /* Number of bytes in term prefix */
191595 int bPrefix, /* True for a prefix iterator */
191631 /* If more than one term matches the prefix, sort the Fts3HashElem
191682 ** term is a prefix of another, the longer term is considered the
191887 ** Return the size of the common prefix (if any) shared by zPrev and
191927 int nPrefix; /* Number of bytes of prefix compression */
191933 /* If nSuffix is zero or less, then zTerm/nTerm must be a prefix of
191946 ** the database contain two terms that share a prefix of almost 2KB,
191957 /* There is no prefix-length field for first term in a node */
192130 int nPrefix; /* Size of term prefix in bytes */
192166 /* If nSuffix is zero or less, then zTerm/nTerm must be a prefix of
192172 nReq = sqlite3Fts3VarintLen(nPrefix) + /* varint containing prefix size */
192196 ** In other words, it must be the prefix of zTerm 1 byte longer than
192197 ** the common prefix (if any) of zTerm and pWriter->zTerm.
192208 nReq = 1 + /* varint containing prefix size */
192229 /* Append the prefix-compressed term and doclist to the buffer. */
192240 /* Save the current term so that it can be used to prefix-compress the next.
192647 /* If the Fts3SegFilter defines a specific term (or term prefix) to search
192815 /* If this is a prefix-search, and if the term that apSegment[0] points
193665 int nSuffix = 0; /* Bytes to append to the prefix */
193761 ** the current node of layer iLayer. Due to the prefix compression,
193856 int nPrefix; /* Size of term prefix in bytes */
193908 int nPrefix; /* Size of prefix shared with previous term */
193937 ** In other words, it must be the prefix of zTerm 1 byte longer than
193938 ** the common prefix (if any) of zTerm and pWriter->zTerm.
194067 ** zRhs (size in bytes nRhs) using memcmp. If one term is a prefix of
195263 ** prefix in the document set, a 64-bit checksum is calculated (by code
195266 ** + The index number (0 for the main index, 1 for the first prefix
195268 ** + The token (or token prefix) text itself,
208514 ** with the prefix "rbu_"
210314 const char *zWrite /* Target table name prefix */
221714 ** returned by the tokenizer will be treated as a token prefix.
221823 ** does not support prefix queries very well. If, as suggested above, the
221830 ** will probably not map "1s" to any prefix of "first").
221832 ** For full prefix support, method (3) may be preferred. In this case,
221833 ** because the index contains entries for both "first" and "1st", prefix
221841 ** provide synonyms for prefixes). However, a non-prefix query like '1st'
221999 ** Maximum number of prefix indexes on single FTS5 table. This must be
222104 ** This is only used for debugging. If set to false, any prefix indexes
222107 ** INSERT INTO tbl(tbl, rank) VALUES('prefix-index', $bPrefixIndex);
222117 int nPrefix; /* Number of prefix indexes */
222118 int *aPrefix; /* Sizes in bytes of nPrefix prefix indexes */
222144 int bPrefixIndex; /* True to use prefix-indexes */
222307 #define FTS5INDEX_QUERY_TEST_NOIDX 0x0004 /* Do not use prefix index */
222336 ** size. Return the number of bytes in the nChar character prefix of the
222347 ** specified token or token prefix.
222351 const char *pToken, int nToken, /* Token (or prefix) to query for */
222358 ** The various operations on open token or token prefix iterators opened
222551 const char *pTerm, int nTerm /* Query prefix */
222821 ** at each "%%" line. Also, any "P-a-r-s-e" identifer prefix (without the
223176 ** <li> A prefix string written at the beginning of every
225649 if( sqlite3_strnicmp("prefix", zCmd, nCmd)==0 ){
225670 *pzErr = sqlite3_mprintf("malformed prefix=... directive");
225677 "too many prefix indexes (max %d)", FTS5_MAX_PREFIX_INDEXES
225689 *pzErr = sqlite3_mprintf("prefix length out of range (max 999)");
226460 ** or term prefix.
226463 u8 bPrefix; /* True for a prefix term */
229886 const char *pTerm, int nTerm, /* Query prefix, if any */
229971 const char *pTerm, int nTerm /* Query prefix */
230031 ** As well as the main term index, there may be up to 31 prefix indexes.
230079 ** there are one or more prefix indexes), it is guaranteed that all share
230600 ** is a prefix of the other, it is considered the lesser.
233718 ** Return the size of the prefix, in bytes, that buffer
233994 int nPrefix; /* Bytes of prefix compression for term */
234029 ** this term. In other words, a prefix of (pTerm/nTerm) that is one
234030 ** byte longer than the longest prefix (pTerm/nTerm) shares with the
234554 ** in a 32-bit integer. Return the size of the largest prefix of this
235209 u8 *pToken, /* Buffer containing prefix to match */
235470 ** size. Return the number of bytes in the nChar character prefix of the
235556 ** specified token or token prefix.
235560 const char *pToken, int nToken, /* Token (or prefix) to query for */
235574 int iPrefixIdx = 0; /* +1 prefix index */
235578 ** is a prefix query for which there is no prefix index, set iIdx to
235583 ** prefix-query. Instead of using a prefix-index (if one exists),
235584 ** evaluate the prefix query using the main FTS index. This is used
235947 const char *zTerm = (const char*)&pPrev->p[1]; /* term sans prefix-byte */
235963 /* If this is a prefix query, check that the results returned if the
235973 ** a non-utf-8 sequence that happens to be a prefix of a valid utf-8
236262 ** based on all expected entries in the FTS index (including prefix index
238382 }else if( 0==sqlite3_stricmp("prefix-index", zCmd) ){