/** * Determines if there is any supplementary character or unpaired * surrogate in the specified range. */ private boolean findSupplementary(int start, int end) { for (int i = start; i < end; i++) { if (isSupplementary(temp[i])) return true; } return false; }
/** * Determines if there is any supplementary character or unpaired * surrogate in the specified range. */ private boolean findSupplementary(int start, int end) { for (int i = start; i < end; i++) { if (isSupplementary(temp[i])) return true; } return false; }
/** * Returns a suitably optimized, single character matcher. */ private CharProperty newSingle(final int ch) { if (has(CASE_INSENSITIVE)) { int lower, upper; if (has(UNICODE_CASE)) { upper = Character.toUpperCase(ch); lower = Character.toLowerCase(upper); if (upper != lower) return new SingleU(lower); } else if (ASCII.isAscii(ch)) { lower = ASCII.toLower(ch); upper = ASCII.toUpper(ch); if (lower != upper) return new SingleI(lower, upper); } } if (isSupplementary(ch)) return new SingleS(ch); // Match a given Unicode character return new Single(ch); // Match a given BMP character }
/** * Returns a suitably optimized, single character matcher. */ private CharProperty newSingle(final int ch) { if (has(CASE_INSENSITIVE)) { int lower, upper; if (has(UNICODE_CASE)) { upper = Character.toUpperCase(ch); lower = Character.toLowerCase(upper); if (upper != lower) return new SingleU(lower); } else if (ASCII.isAscii(ch)) { lower = ASCII.toLower(ch); upper = ASCII.toUpper(ch); if (lower != upper) return new SingleI(lower, upper); } } if (isSupplementary(ch)) return new SingleS(ch); // Match a given Unicode character return new Single(ch); // Match a given BMP character }
if (isSupplementary(c)) { hasSupplementary = true;
if (isSupplementary(c)) { hasSupplementary = true;
append(ch, first); first++; if (isSupplementary(ch)) { hasSupplementary = true; append(ch, first); first++; if (isSupplementary(ch)) { hasSupplementary = true;
append(ch, first); first++; if (isSupplementary(ch)) { hasSupplementary = true; append(ch, first); first++; if (isSupplementary(ch)) { hasSupplementary = true;