Lines Matching refs:characters
1141 ** 11 alphanumeric and/or "-" characters.
2328 ** characters actually written into the buffer.)^ We admit that
2329 ** the number of characters written would be a more useful return
2337 ** written will be n-1 characters.
2942 ** necessary - space characters can be used literally
2967 ** characters must be converted to UTF-8 prior to passing them into
3475 ** number of <u>bytes</u> in the value, not the number of characters.)^
3484 ** terminated. If any NUL characters occur at byte offsets less than
3923 ** bytes in the string, not the number of characters.
4112 ** length limit is in UTF-8 bytes, not characters nor UTF-16 bytes.
4498 ** bytes (not characters) from the 2nd parameter as the error message.
4535 ** is non-negative, then as many bytes (not characters) of the text
4539 ** appear if the string where NUL terminated. If any NUL characters occur
5290 ** characters in the filename from the last "/" to the first following
7202 ** a few hundred characters, it will be truncated to the length of the
10067 ** alphanumeric characters, and no file extension. They are stored in the
11223 unsigned int n; /* Number of characters in this token */
12345 ** sqlite versions only work for ASCII characters, regardless of locale.
13201 /* An array to map all upper-case characters into their corresponding
13204 ** SQLite only considers US-ASCII (or EBCDIC) characters. We do not
14032 int n; /* Number of characters in string value, excluding '\0' */
20554 #define etSIZE 5 /* Return number of characters processed so far. %n */
21205 /* The precision in %q and %Q means how many input characters to
21240 ** "length" characters long. The field width is "width". Do
21301 ** Append N space characters to the given string buffer.
21853 ** byte of a character are interpreted as single-byte characters
21855 ** invalid characters.
22083 ** return the number of unicode characters in pZ up to (but not including)
22085 ** number of unicode characters in the first nByte of pZ (or up to
22113 ** UTF-8. Miscoded characters are removed.
22159 ** zIn is a UTF-16 encoded unicode string at least nChar characters long.
22160 ** Return the number of bytes in the first nChar unicode characters
22186 ** characters in each encoding are inverses of each other.
22357 ** format characters are allowed:
22389 ** The following formatting characters are allowed:
22423 ** the quote characters. The conversion is done in-place. If the
22499 ** The string z[] is length bytes in length (bytes, not characters) and
22688 ** Note that zNum must contain exactly 19 characters.
22730 ** length is the number of bytes in the string (bytes, not characters).
22843 ** Any non-numeric characters that following zNum are ignored.
23500 ** three characters, then shorten the suffix on z[] to be the last three
23501 ** characters of the original suffix.
25109 ** characters in the simplified name.
31337 ** is a string buffer at least MAXPATHLEN+1 characters in size.
32101 ** characters, so we allocate 4 bytes per character assuming worst-case of
36433 ** two trailing NUL characters. The final directory separator character
37809 ** Let V[] be an array of unsigned characters sufficient to hold
50837 ** the string itself should be 15 characters long. If you change
65170 /* Input "x" is a sequence of unsigned characters that represent a
70567 ** P4 is a string that is P2 characters long. The nth character of the
70595 ** P4 may be a string that is P2 characters long. The nth character of the
77448 int nId; /* Number of characters in function name */
82984 int nTabName; /* Number of UTF-8 characters in zTabName */
83079 /* figure out how many UTF-8 characters are in zName */
87527 ** Measure the number of characters needed to output the given
87551 ** characters, does not begin with a digit and is not an SQL keyword,
88890 int nName; /* Number of characters in zName */
90701 int nName, /* Number of characters in the name */
91842 ** in haystack and returns the number of previous characters plus 1,
91917 ** substr(x,p1,p2) returns p2 characters of x[] beginning with p1.
91919 ** of x. If x is text, then we actually count UTF-8 characters.
91924 ** If p2 is negative, return the p2 characters preceding p1.
92234 ** character is exactly one byte in size. Also, all characters are
92236 ** whereas only characters less than 0x80 do in ASCII.
92260 ** '*' Matches any sequence of zero or more characters.
92265 ** characters.
92271 ** range of characters can be specified using '-'. Example:
92864 const unsigned char *zCharSet; /* Set of characters to trim */
92869 unsigned char **azChar = 0; /* Individual characters in zCharSet */
92870 int nChar; /* Number of characters in zCharSet */
92993 ** is NULL or contains no ASCII alphabetic characters. */
93278 ** then set aWc[0] through aWc[2] to the wildcard characters and
93298 /* The memcpy() statement assumes that the wildcard characters are
97922 ** and eliding the first three characters if they are "lib".
101402 ** characters between zSql8 and zTail8, and then returning a pointer
101403 ** the same number of characters into the UTF-16 string.
101621 u8 nChar; /* Length of the keyword in characters */
111541 int cnt; /* Number of non-wildcard prefix characters */
111542 char wc[3]; /* Wildcard characters */
121010 ** The charMap() macro maps alphabetic characters into their
121013 ** to adjust the encoding. Only alphabetic characters and underscores
121339 ** allowed in an identifier. For 7-bit characters,
122875 ** extends only to the 26 characters used in the English language.
127235 ** the quote characters. The conversion is done in-place. If the
127603 ** with all double quote characters escaped. For example:
135089 ** the first two characters of z[].
135177 ** Any upper-case characters in the US-ASCII character set ([A-Z])
135178 ** are converted to lower case. Upper-case UTF characters are
135187 ** If the input word contains not digits but does characters not
135462 /* Scan past delimiter characters */
135467 /* Count non-delimiter characters. */
136095 /* Mark non-alphanumeric ASCII characters as delimiters */
136179 /* Scan past delimiter characters */
136184 /* Count non-delimiter characters. */
139707 ** by one or more space (0x20) characters. In the first case, set *piEndBlock
143999 ** all characters in string zIn/nIn to be separators (if bAlnum==0) or
144000 ** token characters (if bAlnum==1).
144017 const char *zIn, /* Array of characters to make exceptions */
144211 /* Scan past any delimiter characters before the start of the next token.
148213 /* Skip any MATCH_ALL or MATCH_ONE characters that follow a