HomeSort by relevance Sort by last modified time
    Searched full:reorderstart (Results 1 - 4 of 4) sorted by null

  /external/chromium_org/third_party/icu/source/common/
normalizer2impl.cpp 47 reorderStart=start;
53 // Set reorderStart after the last code point with cc<=1 if there is one.
57 reorderStart=codePointLimit;
79 reorderStart=limit;
100 reorderStart=limit+length;
102 reorderStart=limit+1; // Ok if not a code point boundary.
140 reorderStart=limit;
156 reorderStart=limit;
161 reorderStart=limit=start;
175 reorderStart=limit
    [all...]
normalizer2impl.h 98 start(NULL), reorderStart(NULL), limit(NULL),
137 reorderStart=limit;
151 reorderStart=limit=newLimit;
156 * TODO: Revisit whether it makes sense to track reorderStart.
160 * In other words, reorderStart speeds up the insertion of a combining mark
182 UChar *start, *reorderStart, *limit;
  /external/icu4c/common/
normalizer2impl.cpp 48 reorderStart=start;
54 // Set reorderStart after the last code point with cc<=1 if there is one.
58 reorderStart=codePointLimit;
80 reorderStart=limit;
101 reorderStart=limit+length;
103 reorderStart=limit+1; // Ok if not a code point boundary.
141 reorderStart=limit;
157 reorderStart=limit;
162 reorderStart=limit=start;
176 reorderStart=limit
    [all...]
normalizer2impl.h 117 start(NULL), reorderStart(NULL), limit(NULL),
156 reorderStart=limit;
170 reorderStart=limit=newLimit;
174 s.setTo(reorderStart, (int32_t)(limit-reorderStart));
178 * TODO: Revisit whether it makes sense to track reorderStart.
182 * In other words, reorderStart speeds up the insertion of a combining mark
204 UChar *start, *reorderStart, *limit;

Completed in 194 milliseconds