Lines Matching defs:characters
104 // In a 3-character pattern you can maximally step forwards 3 characters
124 // characters as it has different characters.
522 // but the characters are always the same).
1606 // Returns the number of characters in the equivalence class, omitting those
1613 // Unibrow returns 0 or 1 for characters where case independence is
1713 // If the characters differ by 2^n but don't differ by one bit then
1942 // case characters on some Unicode pages).
2014 // It is faster to test for individual characters, so we look for those
2311 // If we know we are not at the start and we are asked "how many characters
2314 // that won't prevent us from preloading a lot of characters for the other
2459 if (details->characters() == 0) return false;
2464 DCHECK(details->characters() == 1 ||
2471 if (trace->characters_preloaded() != details->characters()) {
2473 // We are attempting to preload the minimum number of characters
2480 details->characters());
2486 if (details->characters() == 1) {
2487 // If number of characters preloaded is 1 then we used a byte or 16 bit
2502 if (details->characters() == 2 && compiler->one_byte()) {
2504 } else if (details->characters() == 1 && !compiler->one_byte()) {
2544 DCHECK(characters_filled_in < details->characters());
2545 int characters = details->characters();
2556 for (int i = 0; i < characters && i < quarks.length(); i++) {
2611 DCHECK(characters_filled_in <= details->characters());
2612 if (characters_filled_in == details->characters()) {
2677 DCHECK(characters_filled_in <= details->characters());
2678 if (characters_filled_in == details->characters()) {
2683 DCHECK(characters_filled_in != details->characters());
2786 // We need to check for the following characters: 0x39c 0x3bc 0x178.
2817 // Here, we need to check for characters whose upper and lower cases
2984 QuickCheckDetails new_details(details->characters());
3195 if (offset >= quick_check->characters()) return false;
3232 // loading characters, which means we do not need to recheck the bounds
3420 // we preloaded any characters into it.
3424 // characters by means of mask and compare.
3548 // We can't preload 3 characters because there is no machine instruction
3687 // characters that can occur at a given position. Since we are optimizing two
3691 // If more than 32 characters out of 128 can occur it is unlikely that we can
3709 // probability-of-finding-one-of-the-characters, where the probability is
3731 // characters have a frequency of zero. This means the frequency
3759 // Take all the characters that will not prevent a successful match if they
3762 // character at max_lookahead offset is not one of these characters, then we
3763 // can safely skip forwards by the number of characters in the range.
4111 // loop. That also implies that there are no preloaded characters, which is
4113 // overwriting those characters with new load instructions.
4121 // a pattern of the form ...abc... where we can look 6 characters ahead
4209 // insist that they preload characters since the slow check we are about
4900 // Lone surrogates are valid code points, even though no actual characters.
5124 // Full case mapping map single characters to multiple characters.
5221 // start with different characters.
5859 // This is the set of characters matched by the $ and ^ symbols
5905 // If this is a range we expand the characters block by block, expanding
5910 // property that all characters uncanonicalize in the same way, except
5920 // characters that is not in a block as a "singleton block").
6382 // Working out the set of characters that a backreference can match is too
6628 // Sample some characters from the middle of the string.
