Lines Matching refs:sChar
2475 UChar schar,
2504 schar = getNextNormalizedChar(source);
2506 while (schar > (tchar = *UCharOffset)) {
2510 if (schar != tchar) {
2513 buffer.append(schar);
2517 if (u_getCombiningClass(schar) ==
2519 buffer.append(schar);
2755 UChar schar, tchar;
2772 schar = getPrevNormalizedChar(source, status);
2775 while(schar > (tchar = *UCharOffset)) { /* since the contraction codepoints should be ordered, we skip all that are smaller */
2779 if (schar == tchar) {
2819 UChar schar, tchar;
2846 schar = getNextNormalizedChar(source);
2847 while(schar > (tchar = *UCharOffset)) { /* since the contraction codepoints should be ordered, we skip all that are smaller */
2851 if (schar == tchar) {
2868 UChar32 miss = schar;
2872 if(U16_IS_LEAD(schar) && source->iterator->hasNext(source->iterator)) {
2876 miss = U16_GET_SUPPLEMENTARY(schar, surrNextChar);
2881 } else if (U16_IS_LEAD(schar)) {
2882 miss = U16_GET_SUPPLEMENTARY(schar, getNextNormalizedChar(source));
2908 /* find the next character if schar is not a base character
2925 } // else after if(schar == tchar)
3384 UChar schar;
3410 UChar schar, tchar;
3424 schar = getPrevNormalizedChar(source, status);
3427 while(schar > (tchar = *UCharOffset)) { /* since the contraction codepoints should be ordered, we skip all that are smaller */
3431 if (schar == tchar) {
3443 uint32_t isZeroCE = UTRIE_GET32_FROM_LEAD(&coll->mapping, schar);
3447 } else if(U16_IS_SURROGATE(schar)) {
3450 // 1. beginning of the string: schar is a lone surrogate
3451 // 2. schar is a lone surrogate
3452 // 3. schar is a trail surrogate in a valid surrogate sequence
3456 if(!U16_IS_SURROGATE_LEAD(schar) && U16_IS_LEAD(lead = getPrevNormalizedChar(source, status))) {
3459 uint32_t finalCE = UTRIE_GET32_FROM_OFFSET_TRAIL(&coll->mapping, isZeroCE&0xFFFFFF, schar);
3500 schar = peekCodeUnit(source, 0);
3515 while (ucol_unsafeCP(schar, coll)) {
3516 *(UCharOffset) = schar;
3519 schar = getPrevNormalizedChar(source, status);
3555 *(UCharOffset) = schar;
7613 UChar schar = 0, tchar = 0;
7620 schar = s[*index];
7626 schar = s[*index];
7630 while(schar > (tchar = *(UCharOffset+offset))) { /* since the contraction codepoints should be ordered, we skip all that are smaller */
7634 if (schar == tchar) {
7640 if(schar & 0xFF00 /*> UCOL_ENDOFLATIN1RANGE*/) {
7644 uint32_t isZeroCE = UTRIE_GET32_FROM_LEAD(&coll->mapping, schar);
7677 UChar sChar = 0, tChar = 0;
7692 sChar=source[sIndex++];
7693 if(sChar==0) {
7702 sChar=source[sIndex++];
7704 if(sChar&0xFF00) { // if we encounter non-latin-1, we bail out (sChar > 0xFF, but this is faster on win32)
7708 sOrder = elements[sChar];
7750 if(tChar&0xFF00) { // if we encounter non-latin-1, we bail out (sChar > 0xFF, but this is faster on win32)
7814 sChar=source[sIndex++];
7815 sOrder = elements[sChar];
7868 sChar=source[--sIndex];
7869 sOrder = elements[sChar];
7920 sChar=source[sIndex++];
7921 sOrder = elements[sChar];
8018 UChar32 sChar = U_SENTINEL, tChar = U_SENTINEL;
8020 while((sChar = sColl.iterator->next(sColl.iterator)) ==
8022 if(sChar == U_SENTINEL) {
8028 if(sChar == U_SENTINEL) {
8033 sChar = sColl.iterator->previous(sColl.iterator);
8036 sChar = sColl.iterator->previous(sColl.iterator);
8039 if (ucol_unsafeCP((UChar)sChar, coll) || ucol_unsafeCP((UChar)tChar, coll))
8046 sChar = sColl.iterator->previous(sColl.iterator);
8049 while (sChar != U_SENTINEL && ucol_unsafeCP((UChar)sChar, coll));