Lines Matching defs:schar
2499 UChar schar,
2528 schar = getNextNormalizedChar(source);
2530 while (schar > (tchar = *UCharOffset)) {
2534 if (schar != tchar) {
2537 buffer.append(schar);
2541 if (u_getCombiningClass(schar) ==
2543 buffer.append(schar);
2779 UChar schar, tchar;
2796 schar = getPrevNormalizedChar(source, status);
2799 while(schar > (tchar = *UCharOffset)) { /* since the contraction codepoints should be ordered, we skip all that are smaller */
2803 if (schar == tchar) {
2843 UChar schar, tchar;
2870 schar = getNextNormalizedChar(source);
2871 while(schar > (tchar = *UCharOffset)) { /* since the contraction codepoints should be ordered, we skip all that are smaller */
2875 if (schar == tchar) {
2892 UChar32 miss = schar;
2896 if(U16_IS_LEAD(schar) && source->iterator->hasNext(source->iterator)) {
2900 miss = U16_GET_SUPPLEMENTARY(schar, surrNextChar);
2905 } else if (U16_IS_LEAD(schar)) {
2906 miss = U16_GET_SUPPLEMENTARY(schar, getNextNormalizedChar(source));
2932 /* find the next character if schar is not a base character
2949 } // else after if(schar == tchar)
3408 UChar schar;
3434 UChar schar, tchar;
3448 schar = getPrevNormalizedChar(source, status);
3451 while(schar > (tchar = *UCharOffset)) { /* since the contraction codepoints should be ordered, we skip all that are smaller */
3455 if (schar == tchar) {
3467 uint32_t isZeroCE = UTRIE_GET32_FROM_LEAD(&coll->mapping, schar);
3471 } else if(U16_IS_SURROGATE(schar)) {
3474 // 1. beginning of the string: schar is a lone surrogate
3475 // 2. schar is a lone surrogate
3476 // 3. schar is a trail surrogate in a valid surrogate sequence
3480 if(!U16_IS_SURROGATE_LEAD(schar) && U16_IS_LEAD(lead = getPrevNormalizedChar(source, status))) {
3483 uint32_t finalCE = UTRIE_GET32_FROM_OFFSET_TRAIL(&coll->mapping, isZeroCE&0xFFFFFF, schar);
3524 schar = peekCodeUnit(source, 0);
3539 while (ucol_unsafeCP(schar, coll)) {
3540 *(UCharOffset) = schar;
3543 schar = getPrevNormalizedChar(source, status);
3579 *(UCharOffset) = schar;
7717 UChar schar = 0, tchar = 0;
7724 schar
7730 schar = s[*index];
7734 while(schar > (tchar = *(UCharOffset+offset))) { /* since the contraction codepoints should be ordered, we skip all that are smaller */
7738 if (schar == tchar) {
7744 if(schar & 0xFF00 /*> UCOL_ENDOFLATIN1RANGE*/) {
7748 uint32_t isZeroCE = UTRIE_GET32_FROM_LEAD(&coll->mapping, schar);
7781 UChar sChar = 0, tChar = 0;
7796 sChar=source[sIndex++];
7797 if(sChar==0) {
7806 sChar=source[sIndex++];
7808 if(sChar&0xFF00) { // if we encounter non-latin-1, we bail out (sChar > 0xFF, but this is faster on win32)
7812 sOrder = elements[sChar];
7854 if(tChar&0xFF00) { // if we encounter non-latin-1, we bail out (sChar > 0xFF, but this is faster on win32)
7918 sChar=source[sIndex++];
7919 sOrder = elements[sChar];
7972 sChar=source[--sIndex];
7973 sOrder = elements[sChar];
8024 sChar=source[sIndex++];
8025 sOrder = elements[sChar];
8279 UChar32 schar = 0, tchar = 0;
8283 U8_GET_NULLTERM((const uint8_t*)s, 0, *index, schar);
8284 if (schar == 0) {
8291 U8_GET((const uint8_t*)s, 0, *index, len, schar);
8293 if (schar == -1) {
8294 schar = 0xfffd;
8297 while(schar > (tchar = *(UCharOffset+offset))) { /* since the contraction codepoints should be ordered, we skip all that are smaller */
8301 if (schar == tchar) {
8307 if(schar & 0xFF00 /*> UCOL_ENDOFLATIN1RANGE*/) {
8311 uint32_t isZeroCE = UTRIE_GET32_FROM_LEAD(&coll->mapping, schar);
8335 UChar32 sChar = 0, tChar = 0;
8350 U8_NEXT_NULLTERM(source, sIndex, sChar);
8351 if (sChar == 0) {
8361 U8_NEXT(source, sIndex, sLen ,sChar);
8363 if (sChar == -1) {
8364 sChar = 0xfffd; // fallback for the bad code
8366 if(sChar&0xFFFFFF00) { // if we encounter non-latin-1, we bail out (sChar > 0xFF, but this is faster on win32)
8370 sOrder = elements[sChar];
8412 if(tChar&0xFFFFFF00) { // if we encounter non-latin-1, we bail out (sChar > 0xFF, but this is faster on win32)
8477 U8_NEXT(source, sIndex, sLen, sChar);
8478 U_ASSERT(sChar >= 0 && sChar <= 0xFF);
8479 sOrder = elements[sChar];
8534 U8_PREV(source, 0, sIndex, sChar);
8535 U_ASSERT(sChar >= 0 && sChar <= 0xFF);
8536 sOrder = elements[sChar];
8589 U8_NEXT(source, sIndex, sLen, sChar);
8590 U_ASSERT(sChar >= 0 && sChar <= 0xFF);
8591 sOrder = elements[sChar];
8689 UChar32 sChar = U_SENTINEL, tChar = U_SENTINEL;
8691 while((sChar = sColl.iterator->next(sColl.iterator)) ==
8693 if(sChar == U_SENTINEL) {
8699 if(sChar == U_SENTINEL) {
8704 sChar = sColl.iterator->previous(sColl.iterator);
8707 sChar = sColl.iterator->previous(sColl.iterator);
8710 if (ucol_unsafeCP((UChar)sChar, coll) || ucol_unsafeCP((UChar)tChar, coll))
8717 sChar = sColl.iterator->previous(sColl.iterator);
8720 while (sChar != U_SENTINEL && ucol_unsafeCP((UChar)sChar, coll));
