/external/icu/android_icu4j/src/main/java/android/icu/impl/ |
Punycode.java | 134 char c, c2; local 153 } else if(UTF16.isLeadSurrogate(c) && (j+1)<srcLength && UTF16.isTrailSurrogate(c2=src.charAt(j+1))) { 156 n|=UCharacter.getCodePoint(c, c2);
|
/external/icu/android_icu4j/src/main/java/android/icu/text/ |
ScientificNumberFormatter.java | 287 char c2 = iterator.next(); local 289 // If c2 is DONE, it will fail the low surrogate test and we 291 if (UCharacter.isLowSurrogate(c2)) { 293 return UCharacter.toCodePoint(c1, c2);
|
/external/icu/android_icu4j/src/main/tests/android/icu/dev/test/stringprep/ |
IDNAReference.java | 71 char c1,c2; local 80 c2 = s2.charAt(i); 83 if(c1!=c2) { 84 rc=toASCIILower(c1)-toASCIILower(c2);
|
/external/icu/icu4c/source/common/ |
punycode.cpp | 189 UChar c, c2; local 230 } else if(U16_IS_LEAD(c) && U16_IS_TRAIL(c2=src[j+1])) { 232 n|=(int32_t)U16_GET_SUPPLEMENTARY(c, c2); 263 } else if(U16_IS_LEAD(c) && (j+1)<srcLength && U16_IS_TRAIL(c2=src[j+1])) { 265 n|=(int32_t)U16_GET_SUPPLEMENTARY(c, c2);
|
uidna.cpp | 95 UChar c1,c2; local 106 c2 = s2[i]; 109 if(c1!=c2) { 110 rc=(int32_t)toASCIILower(c1)-(int32_t)toASCIILower(c2);
|
ustrcase.cpp | 133 UChar32 c, c2 = 0; local 147 if((destIndex<destCapacity) && (c<0 ? (c2=~c)<=0xffff : UCASE_MAX_STRING_LENGTH<c && (c2=c)<=0xffff)) { 149 dest[destIndex++]=(UChar)c2; 337 UChar32 c, c2 = 0; local 344 if((destIndex<destCapacity) && (c<0 ? (c2=~c)<=0xffff : UCASE_MAX_STRING_LENGTH<c && (c2=c)<=0xffff)) { 346 dest[destIndex++]=(UChar)c2; 514 UChar32 c1, c2, cp1, cp2; local 549 c1=c2=-1 [all...] |
/external/icu/icu4c/source/i18n/ |
collationfastlatin.cpp | 871 int32_t c2; local [all...] |
/external/icu/icu4c/source/test/cintltst/ |
trietest.c | 152 UChar c2; local 170 c=c2=0x33; 172 UTRIE_NEXT32(trie, p, limit, c, c2, value); 174 UTRIE_NEXT16(trie, p, limit, c, c2, value); 178 testName, c, c2, value, values[i]); 181 c2==0 ? 183 !U16_IS_LEAD(c) || !U16_IS_TRAIL(c2) || c!=*(p-2) || c2!=*(p-1) 185 log_err("error: wrong (c, c2) from UTRIE_NEXT(%s): (U+%04lx, U+%04lx)\n", 186 testName, c, c2); [all...] |
utf16tst.c | 350 UChar32 c, c2; local 382 U16_GET(input, 0, j, -1, c2); 383 if(c2!=c) { 384 log_err("U16_NEXT(from %d)=U+%04x != U+%04x=U16_GET(at %d)\n", i0, c, c2, j);
|
/external/icu/icu4c/source/test/intltest/ |
idnaref.cpp | 76 UChar c1,c2; local 86 c2 = s2[i]; 89 if(c1!=c2) { 90 rc=(int32_t)toASCIILower(c1)-(int32_t)toASCIILower(c2);
|
itercoll.cpp | 113 RuleBasedCollator *c2 = NULL; local 114 c2 = new RuleBasedCollator((UnicodeString)"&a < b < c/abd < d", status); 116 if (c2 == NULL || U_FAILURE(status)) 119 delete c2; 124 iter = c2->createCollationElementIterator(source); 127 delete c2; 656 int32_t c1, c2, count = 0; local 662 c2 = i2.next(status); 664 if (c1 != c2) 666 errln(" %d: strength(0x%X) != strength(0x%X)", count, c1, c2); [all...] |
/external/icu/icu4c/source/test/perf/unisetperf/ |
unisetperf.cpp | 210 UChar32 c, c2; local 220 for(c2=0xdc00; c2<=0xdfff; ++c2) { 221 utf16[1]=(UChar)c2; 223 set.add(U16_GET_SUPPLEMENTARY(c, c2)); 261 UChar32 c, c2; local 271 for(c2=0xdc00; c2<=0xdfff; ++c2) { [all...] |
/external/icu/icu4j/eclipse-build/plugins.template/com.ibm.icu.base.tests/src/com/ibm/icu/tests/ |
CollatorTest.java | 29 Collator c2 = Collator.getInstance(); local 30 c2.setStrength(Collator.SECONDARY); 33 testEHCS(c, c2, cn);
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
IDNA2003.java | 65 char c1,c2; local 74 c2 = s2.charAt(i); 77 if(c1!=c2) { 78 rc=toASCIILower(c1)-toASCIILower(c2);
|
Punycode.java | 132 char c, c2; local 151 } else if(UTF16.isLeadSurrogate(c) && (j+1)<srcLength && UTF16.isTrailSurrogate(c2=src.charAt(j+1))) { 154 n|=UCharacter.getCodePoint(c, c2);
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
ScientificNumberFormatter.java | 291 char c2 = iterator.next(); local 293 // If c2 is DONE, it will fail the low surrogate test and we 295 if (UCharacter.isLowSurrogate(c2)) { 297 return UCharacter.toCodePoint(c1, c2);
|
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/stringprep/ |
IDNAReference.java | 70 char c1,c2; local 79 c2 = s2.charAt(i); 82 if(c1!=c2) { 83 rc=toASCIILower(c1)-toASCIILower(c2);
|
/external/javassist/src/main/javassist/compiler/ |
Lex.java | 245 int c2 = getc(); local 247 if (c2 == 'X' || c2 == 'x') 266 else if ('0' <= c2 && c2 <= '7') { 267 value = c2 - '0'; 285 while ('0' <= c2 && c2 <= '9') { 286 value = value * 10 + c2 - '0'; 287 c2 = getc() 361 int c2, c3; local [all...] |
/external/jetty/src/java/org/eclipse/jetty/util/ |
StringUtil.java | 94 char c2=lowercases[c1]; local 95 if (c1!=c2) 98 c[i]=c2; 126 char c2=w.charAt(i); local 127 if (c1!=c2) 131 if (c2<=127) 132 c2=lowercases[c2]; 133 if (c1!=c2) 158 char c2=w.charAt(i) local [all...] |
/external/libchrome/base/ |
callback_list_unittest.cc | 127 CallbackList<void(int, int)> c2; local 129 c2.Add(Bind(&Summer::AddTwoParam, Unretained(&s))); 131 c2.Notify(1, 2);
|
/external/libjpeg-turbo/ |
rdjpgcom.c | 86 int c1, c2; local 91 c2 = NEXTBYTE(); 92 if (c2 == EOF) 94 return (((unsigned int) c1) << 8) + ((unsigned int) c2); 173 int c1, c2; local 176 c2 = NEXTBYTE(); 177 if (c1 != 0xFF || c2 != M_SOI) 179 return c2;
|
wrjpgcom.c | 100 int c1, c2; local 105 c2 = NEXTBYTE(); 106 if (c2 == EOF) 108 return (((unsigned int) c1) << 8) + ((unsigned int) c2); 217 int c1, c2; local 220 c2 = NEXTBYTE(); 221 if (c1 != 0xFF || c2 != M_SOI) 223 return c2;
|
/external/libvpx/libvpx/third_party/libyuv/source/ |
compare.cc | 299 const int64 c2 = (cc2 * count * count) >> 12; local 304 (2 * count * sum_axb - 2 * sum_a_x_sum_b + c2); 311 count * sum_sq_b - sum_b_sq + c2);
|
/external/libvpx/libvpx/vp9/encoder/ |
vp9_avg.c | 47 int16_t c2 = b0 - b2; local 56 coeff[3] = c2 + c6; 60 coeff[1] = c2 - c6;
|
/external/libvpx/libvpx/vpx_dsp/ |
ssim.c | 74 int64_t c1, c2; local 78 c2 = (cc2 * count * count) >> 12; 81 (int64_t) 2 * sum_s * sum_r + c2); 85 (int64_t)count * sum_sq_r - (int64_t) sum_r * sum_r + c2); 214 // ssim(x,y) = (2*mean(x)*mean(y) + c1)*(2*cov(x,y)+c2) / 215 // ((mean(x)^2+mean(y)^2+c1)*(var(x)+var(y)+c2)) 224 // (2*sum(x)*sum(y)/(n*n) + c1)*(2*(n*sum(xi*yi)-sum(x)*sum(y))/(n*n)+c2) / 227 // (n*sum(yi*yi) - sum(yi)*sum(yi))/(n*n)+c2))) 232 // (2*sum(x)*sum(y) + n*n*c1)*(2*(n*sum(xi*yi)-sum(x)*sum(y))+n*n*c2) / 234 // (n*sum(xi*xi)-sum(xi)*sum(xi)+n*sum(yi*yi)-sum(yi)*sum(yi)+n*n*c2)) 242 const int64_t c2 = (cc2 * n * n) >> 12; local 273 const int64_t c2 = (cc2 * n * n) >> 12; local 393 static const double c1 = 1, c2 = 1, c3 = 1; local [all...] |