Lines Matching refs:characters
1227 // Returns the number of characters in the equivalence class, omitting those
1233 // Unibrow returns 0 or 1 for characters where case independependence is
1242 // The standard requires that non-ASCII characters cannot have ASCII
1326 // If the characters differ by 2^n but don't differ by one bit then
1689 if (details->characters() == 0) return false;
1693 ASSERT(details->characters() == 1 ||
1700 if (trace->characters_preloaded() != details->characters()) {
1704 details->characters());
1710 if (details->characters() == 1) {
1711 // If number of characters preloaded is 1 then we used a byte or 16 bit
1724 if (details->characters() == 2 && compiler->ascii()) {
1760 ASSERT(characters_filled_in < details->characters());
1761 int characters = details->characters();
1775 for (int i = 0; i < characters && i < quarks.length(); i++) {
1827 ASSERT(characters_filled_in <= details->characters());
1828 if (characters_filled_in == details->characters()) {
1893 ASSERT(characters_filled_in <= details->characters());
1894 if (characters_filled_in == details->characters()) {
1899 ASSERT(characters_filled_in != details->characters());
2006 QuickCheckDetails new_details(details->characters());
2243 if (offset >= quick_check->characters()) return false;
2280 // loading characters, which means we do not need to recheck the bounds
2444 // we preloaded any characters into it.
2448 // characters by means of mask and compare.
2555 // We can't preload 3 characters because there is no machine instruction
2814 // insist that they preload characters since the slow check we are about
3899 // This is the set of characters matched by the $ and ^ symbols
3987 // If this is a range we expand the characters block by block,
3992 // that all characters uncanonicalize in the same way as the first
4050 // Unibrow ranges don't work for high characters due to the "2^11 bug".
4213 // Step through the range finding equivalent characters.
4214 ZoneList<unibrow::uchar> *characters = new ZoneList<unibrow::uchar>(100);
4220 characters->Add(chr);
4225 // Step through the equivalent characters finding simple ranges and
4227 if (characters->length() > 0) {
4228 int new_from = characters->at(0);
4230 for (int i = 1; i < characters->length(); i++) {
4231 int chr = characters->at(i);
4869 // set the value to the set of every character, i.e., all characters
4946 // default implementation that fails and returns all characters as possible.
