HomeSort by relevance Sort by last modified time
    Searched defs:reorderCodes (Results 1 - 17 of 17) sorted by null

  /external/icu/icu4c/source/i18n/
collationdatawriter.cpp 161 const int32_t *reorderCodes = settings.reorderCodes;
167 data.makeReorderRanges(reorderCodes, reorderCodesLength, codesAndRanges, errorCode);
170 codesAndRanges.insertElementAt(reorderCodes[i], i, errorCode);
173 reorderCodes = codesAndRanges.getBuffer();
323 copyData(indexes, CollationDataReader::IX_REORDER_CODES_OFFSET, reorderCodes, dest);
collationdatareader.cpp 104 const int32_t *reorderCodes = NULL;
118 reorderCodes = reinterpret_cast<const int32_t *>(inBytes + offset);
121 // The reorderRanges (if any) are the trailing reorderCodes entries.
126 (reorderCodes[reorderCodesLength - reorderRangesLength - 1] & 0xffff0000) != 0) {
132 reorderRanges = reinterpret_cast<const uint32_t *>(reorderCodes + reorderCodesLength);
420 uprv_memcmp(reorderCodes, ts.reorderCodes, reorderCodesLength * 4) == 0 &&
443 settings->aliasReordering(*baseData, reorderCodes, reorderCodesLength,
collationsettings.h 110 reorderCodes(NULL), reorderCodesLength(0), reorderCodesCapacity(0),
247 const int32_t *reorderCodes;
251 * Capacity of reorderCodes.
253 * Otherwise, this object owns the memory via the reorderCodes pointer;
  /external/icu/android_icu4j/src/main/java/android/icu/impl/coll/
CollationDataReader.java 60 /** Byte offset to int reorderCodes[]. */
147 int[] reorderCodes;
159 reorderCodes = ICUBinary.getInts(inBytes, reorderCodesLength, length & 3);
161 // The reorderRanges (if any) are the trailing reorderCodes entries.
167 (reorderCodes[reorderCodesLength - reorderRangesLength - 1] & 0xffff0000) != 0) {
173 reorderCodes = new int[0];
467 Arrays.equals(reorderCodes, ts.reorderCodes) &&
478 Collator.ReorderCodes.FIRST + settings.getMaxVariable());
484 settings.aliasReordering(baseData, reorderCodes, reorderCodesLength, reorderTable)
    [all...]
CollationSettings.java 98 // Note: The reorderTable, reorderRanges, and reorderCodes need not be cloned
111 if(!Arrays.equals(reorderCodes, o.reorderCodes)) { return false; }
119 h ^= reorderCodes.length;
120 for(int i = 0; i < reorderCodes.length; ++i) {
121 h ^= (reorderCodes[i] << i);
132 reorderCodes = EMPTY_INT_ARRAY;
155 reorderCodes = codes;
181 if(codes.length == 0 || (codes.length == 1 && codes[0] == Collator.ReorderCodes.NONE)) {
240 // Very different from C++. See the comments after the reorderCodes declaration
    [all...]
CollationRuleParser.java 592 Collator.ReorderCodes.FIRST + value);
711 ArrayList<Integer> reorderCodes = new ArrayList<Integer>();
722 reorderCodes.add(code);
725 if(reorderCodes.isEmpty()) {
728 int[] codes = new int[reorderCodes.size()];
730 for(Integer code : reorderCodes) { codes[j++] = code; }
747 return Collator.ReorderCodes.FIRST + i;
759 return Collator.ReorderCodes.OTHERS; // same as Zzzz = USCRIPT_UNKNOWN
    [all...]
  /external/icu/icu4c/source/test/intltest/
alphaindextst.cpp 317 int32_t reorderCodes[20];
319 if (index->getCollator().getReorderCodes(reorderCodes, UPRV_LENGTHOF(reorderCodes), status) > 0) {
555 int32_t reorderCodes[] = { USCRIPT_HAN };
556 coll->setReorderCodes(reorderCodes, UPRV_LENGTHOF(reorderCodes), status);
584 int32_t reorderCodes[] = { USCRIPT_HAN };
585 coll->setReorderCodes(reorderCodes, UPRV_LENGTHOF(reorderCodes), status);
  /external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/
CollationDataReader.java 59 /** Byte offset to int reorderCodes[]. */
146 int[] reorderCodes;
158 reorderCodes = ICUBinary.getInts(inBytes, reorderCodesLength, length & 3);
160 // The reorderRanges (if any) are the trailing reorderCodes entries.
166 (reorderCodes[reorderCodesLength - reorderRangesLength - 1] & 0xffff0000) != 0) {
172 reorderCodes = new int[0];
466 Arrays.equals(reorderCodes, ts.reorderCodes) &&
477 Collator.ReorderCodes.FIRST + settings.getMaxVariable());
483 settings.aliasReordering(baseData, reorderCodes, reorderCodesLength, reorderTable)
    [all...]
CollationSettings.java 96 // Note: The reorderTable, reorderRanges, and reorderCodes need not be cloned
109 if(!Arrays.equals(reorderCodes, o.reorderCodes)) { return false; }
117 h ^= reorderCodes.length;
118 for(int i = 0; i < reorderCodes.length; ++i) {
119 h ^= (reorderCodes[i] << i);
130 reorderCodes = EMPTY_INT_ARRAY;
153 reorderCodes = codes;
179 if(codes.length == 0 || (codes.length == 1 && codes[0] == Collator.ReorderCodes.NONE)) {
238 // Very different from C++. See the comments after the reorderCodes declaration
    [all...]
CollationRuleParser.java 588 Collator.ReorderCodes.FIRST + value);
707 ArrayList<Integer> reorderCodes = new ArrayList<Integer>();
718 reorderCodes.add(code);
721 if(reorderCodes.isEmpty()) {
724 int[] codes = new int[reorderCodes.size()];
726 for(Integer code : reorderCodes) { codes[j++] = code; }
743 return Collator.ReorderCodes.FIRST + i;
755 return Collator.ReorderCodes.OTHERS; // same as Zzzz = USCRIPT_UNKNOWN
    [all...]
  /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/collator/
CollationMiscTest.java 29 import android.icu.text.Collator.ReorderCodes;
    [all...]
  /external/icu/icu4j/main/tests/collate/src/com/ibm/icu/dev/test/collator/
CollationMiscTest.java 28 import com.ibm.icu.text.Collator.ReorderCodes;
    [all...]
  /external/icu/icu4c/source/test/cintltst/
cmsccoll.c     [all...]
  /external/libgdx/backends/gdx-backend-moe/libs/
intel-moe-core.jar 
  /prebuilts/misc/common/icu4j/
icu4j.jar 
  /prebuilts/tools/common/m2/repository/com/ibm/icu/icu4j/53.1/
icu4j-53.1.jar 
  /prebuilts/tools/common/m2/repository/com/ibm/icu/icu4j/54.1.1/
icu4j-54.1.1.jar 

Completed in 377 milliseconds