Searched refs:sortkeys (Results 1 – 9 of 9) sorted by relevance
| /third_party/icu/tools/colprobe/ |
| D | sortedlines.cpp | 29 sortkeys(NULL), in SortedLines()
43 if(sortkeys) { in ~SortedLines()
44 delete[] sortkeys; in ~SortedLines()
1376 if(printSortKeys && !sortkeys) { in arrayToString()
1442 sortkeys(NULL), in SortedLines()
2047 if(!sortkeys) { in calculateSortKey()
2048 sortkeys = new uint8_t[size*1024]; in calculateSortKey()
2049 memset(sortkeys, 0, size*1024); in calculateSortKey()
2051 line.sortKey = sortkeys+sortkeyOffset; in calculateSortKey()
2052 sortkeyOffset += probe.getSortKey(line, sortkeys+sortkeyOffset, size*256-sortkeyOffset); in calculateSortKey()
[all …]
|
| D | sortedlines.h | 52 uint8_t *sortkeys; variable
|
| /third_party/icu/icu4c/source/samples/legacy/ |
| D | README | 9 … indexed using ICU 1.8.1. sortkeys. New ICU comes out, with neat new features you would like to us…
|
| /third_party/skia/third_party/externals/icu/source/samples/legacy/ |
| D | README | 9 … indexed using ICU 1.8.1. sortkeys. New ICU comes out, with neat new features you would like to us…
|
| /third_party/icu/icu4c/source/test/cintltst/ |
| D | capitst.c | 2036 uint8_t **sortkeys = (uint8_t **)malloc(casesSize*sizeof(uint8_t *)); in TestMergeSortKeys() local
2051 sortkeys[i] = (uint8_t *)malloc(256*sizeof(uint8_t)); in TestMergeSortKeys()
2069 sortKeysLen[i] = ucol_getSortKey(coll, buffer, unescapedLen, sortkeys[i], 256); in TestMergeSortKeys()
2070 …ucol_mergeSortkeys(prefixKey, prefixKeyLen, sortkeys[i], sortKeysLen[i], mergedPrefixkeys[i], 256); in TestMergeSortKeys()
2071 …ucol_mergeSortkeys(sortkeys[i], sortKeysLen[i], suffixKey, suffixKeyLen, mergedSuffixkeys[i], 256); in TestMergeSortKeys()
2130 free(sortkeys[i]); in TestMergeSortKeys()
2134 free(sortkeys); in TestMergeSortKeys()
|
| /third_party/icu/docs/userguide/collation/ |
| D | index.md | 135 [Sortkeys vs Comparison](concepts#sortkeys-vs-comparison).
|
| D | examples.md | 285 you just need to allocate a field of maximum size and copy your sortkeys from
|
| D | api.md | 275 Comparison](concepts#sortkeys-vs-comparison).
|
| D | architecture.md | 224 for this problem would be to manually manage a large buffer for storing sortkeys
|