HomeSort by relevance Sort by last modified time
    Searched refs:U8_NEXT_OR_FFFD (Results 1 - 9 of 9) sorted by null

  /external/icu/icu4c/source/i18n/
utf8collationiterator.cpp 48 // Optimized combination of U8_NEXT_OR_FFFD() and UTRIE2_U8_NEXT32().
103 U8_NEXT_OR_FFFD(u8, pos, length, c);
229 U8_NEXT_OR_FFFD(u8, i, length, c);
276 U8_NEXT_OR_FFFD(u8, pos, length, c);
290 U8_NEXT_OR_FFFD(u8, pos, length, c);
397 U8_NEXT_OR_FFFD(u8, pos, length, c);
410 U8_NEXT_OR_FFFD(u8, pos, length, c);
rulebasedcollator.cpp 886 U8_NEXT_OR_FFFD(s, pos, length, c);
    [all...]
  /external/icu/icu4c/source/common/
uiter.cpp 603 U8_NEXT_OR_FFFD(s, i, limit, c);
635 U8_NEXT_OR_FFFD(s, i, limit, c);
653 U8_NEXT_OR_FFFD(s, i, limit, c);
778 U8_NEXT_OR_FFFD(s, i, limit, c);
858 U8_NEXT_OR_FFFD(s, i, iter->limit, c);
884 U8_NEXT_OR_FFFD(s, iter->start, iter->limit, c);
unisetspan.cpp 506 // Take advantage of non-ASCII fastpaths in U8_NEXT_OR_FFFD().
508 U8_NEXT_OR_FFFD(s, i, length, c);
    [all...]
uniset.cpp     [all...]
utext.cpp     [all...]
  /external/icu/icu4c/source/common/unicode/
utf8.h 267 * Iteration through a string is more efficient with U8_NEXT_UNSAFE or U8_NEXT_OR_FFFD.
284 U8_NEXT_OR_FFFD(s, _u8_get_index, length, c); \
393 #define U8_NEXT_OR_FFFD(s, i, length, c) { \
  /external/icu/icu4c/source/test/cintltst/
utf8tst.c 311 U8_NEXT_OR_FFFD(input, setOffset, sizeof(input), c);
313 log_err("ERROR: U8_NEXT_OR_FFFD failed to move the offset correctly at %d\n ExpectedOffset:%d Got %d\n",
318 log_err("ERROR: U8_NEXT_OR_FFFD failed for input=%ld. Expected:%lx Got:%lx\n", offset, expected, c);
424 U8_NEXT_OR_FFFD(input, j, -1, c);
427 log_err("U8_NEXT_OR_FFFD(from %d)=U+%04x != U+%04x\n", i0, c, expected);
430 log_err("U8_NEXT_OR_FFFD() moved to index %d but U8_NEXT() moved to %d\n", j, i);
462 log_err("U8_NEXT_OR_FFFD(from %d)=U+%04x != U+%04x=U8_GET_OR_FFFD(at %d)\n", i0, expected, c2, j);
    [all...]
  /external/icu/icu4c/source/test/intltest/
usettest.cpp     [all...]

Completed in 242 milliseconds