Home
last modified time | relevance | path

Searched refs:sortkeys (Results 1 - 3 of 3) sorted by relevance

/third_party/icu/tools/colprobe/
H A Dsortedlines.cpp29 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 in calculateSortKey()
[all...]
H A Dsortedlines.h52 uint8_t *sortkeys; member in SortedLines
/third_party/icu/icu4c/source/test/cintltst/
H A Dcapitst.c1211 log_err("ERR: expected strcmp(\"9f 00\", \"61 00\") to be >=0 (GREATER).. got %d. Calling strcmp() for sortkeys may not work! \n", in TestSortKey()
1274 #if 1 /* verobse log of sortkeys */ in TestSortKey()
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()
2109 log_verbose("testing merging with sortkeys generated for empty strings\n"); in TestMergeSortKeys()
2130 free(sortkeys[i]); in TestMergeSortKeys()
2134 free(sortkeys); in TestMergeSortKeys()
[all...]

Completed in 7 milliseconds