Searched refs:sortKey (Results 1 – 8 of 8) sorted by relevance
| /third_party/vk-gl-cts/scripts/log/ |
| D | bottleneck_report.py | 41 def sortKey (element ) : function
68 self.list.sort(key = sortKey, reverse = True)
103 self.list.sort(key = sortKey, reverse = True)
|
| /third_party/icu/tools/colprobe/ |
| D | line.cpp | 45 sortKey = NULL; in init()
120 sortKey = other.sortKey; in operator =()
690 uint8_t *key = sortKey; in dumpSortkey()
691 if(sortKey) { in dumpSortkey()
|
| D | line.h | 109 uint8_t *sortKey; variable
|
| D | sortedlines.cpp | 787 if(!left->sortKey) { in noteContraction()
793 if(!right->sortKey) { in noteContraction()
1242 if(!toSort[j]->sortKey) { in detectExpansions()
1247 if(!toSort[i]->sortKey) { in detectExpansions()
2051 line.sortKey = sortkeys+sortkeyOffset; in calculateSortKey()
|
| /third_party/icu/icu4j/perf-tests/src/com/ibm/icu/dev/test/perf/ |
| D | CollationPerformanceTest.java | 511 byte[] sortKey = javaCol.getCollationKey(tests[line]).toByteArray(); in doKeyGen()
512 totalKeyLen += sortKey.length; in doKeyGen()
522 byte[] sortKey = icuCol.getCollationKey(tests[line]).toByteArray(); in doKeyGen()
523 totalKeyLen += sortKey.length; in doKeyGen()
|
| /third_party/icu/icu4c/source/test/cintltst/ |
| D | capitst.c | 1808 uint8_t sortKey[256]; in doOverrunTest() local
1815 memset(sortKey, filler, 256); in doOverrunTest()
1816 skLen2 = ucol_getSortKey(coll, uString, strLen, sortKey, i); in doOverrunTest()
1821 if(sortKey[j] != filler) { in doOverrunTest()
|
| /third_party/icu/icu4c/source/test/intltest/ |
| D | apicoll.cpp | 1249 uint8_t sortKey[12]; in TestSortKeyOverflow() local
1250 int32_t length = col->getSortKey(i_and_phi, 2, sortKey, UPRV_LENGTHOF(sortKey)); in TestSortKeyOverflow()
1255 if (length2 != length || 0 != uprv_memcmp(sortKey, sortKey2, capacity)) { in TestSortKeyOverflow()
|
| /third_party/icu/docs/userguide/collation/ |
| D | concepts.md | 43 (CP) is 100 faster than sortKey performance (SP), and that you are doing a
|