Lines Matching refs:lead
36 * correspond to the same bit positions in consecutive table words. With code point parts lead=c{10..6}
37 * trail=c{5..0} it is set.contains(c)==(table7FF[trail] bit lead)
45 * correspond to the same bit position in consecutive table words. With code point parts lead=c{15..12}
46 * t1=c{11..6} test bits (lead+16) and lead in bmpBlockBits[t1]. If the upper bit is 0, then the lower bit
106 int lead = c >> 12;
107 int twoBits = (bmpBlockBits[(c >> 6) & 0x3f] >> lead) & 0x10001;
114 return containsSlow(c, list4kStarts[lead], list4kStarts[lead + 1]);
158 int lead = c >> 12;
159 int twoBits = (bmpBlockBits[(c >> 6) & 0x3f] >> lead) & 0x10001;
168 if (!containsSlow(c, list4kStarts[lead], list4kStarts[lead + 1])) {
197 int lead = c >> 12;
198 int twoBits = (bmpBlockBits[(c >> 6) & 0x3f] >> lead) & 0x10001;
207 if (containsSlow(c, list4kStarts[lead], list4kStarts[lead + 1])) {
254 int lead = c >> 12;
255 int twoBits = (bmpBlockBits[(c >> 6) & 0x3f] >> lead) & 0x10001;
264 if (!containsSlow(c, list4kStarts[lead], list4kStarts[lead + 1])) {
294 int lead = c >> 12;
295 int twoBits = (bmpBlockBits[(c >> 6) & 0x3f] >> lead) & 0x10001;
304 if (containsSlow(c, list4kStarts[lead], list4kStarts[lead + 1])) {
329 int lead = start >> 6; // Named for UTF-8 2-byte lead byte with upper 5 bits.
333 int bits = 1 << lead;
342 if (lead == limitLead) {
355 ++lead;
357 if (lead < limitLead) {
358 bits = ~((1 << lead) - 1);
