Searched refs:toSort (Results 1 - 3 of 3) sorted by relevance
| /third_party/icu/tools/colprobe/ |
| H A D | sortedlines.cpp | 11 toSort(NULL), in SortedLines()
46 if(toSort) { in ~SortedLines()
47 delete[] toSort; in ~SortedLines()
64 if(toSort[i]->strengthFromEmpty < strength) { in getBounds()
66 //u_strcpy(UB[strength], toSort[i-1]->name); in getBounds()
68 while(excludeBounds.contains(UnicodeString(toSort[i-j]->name, toSort[i-j]->len))) { in getBounds()
71 UB[strength] = toSort[i-j]; in getBounds()
73 strength = toSort[i]->strengthFromEmpty; in getBounds()
75 probe.SE = toSort[ in getBounds()
[all...] |
| H A D | sortedlines.h | 24 Line **toSort; member in SortedLines
|
| /third_party/icu/icu4c/source/test/intltest/ |
| H A D | thcoll.cpp | 367 UChar *toSort[LINES]; in TestInvalidThai() local
385 toSort[i] = strings[i]; in TestInvalidThai()
388 qsort (toSort, LINES, sizeof (UChar *), StrCmp); in TestInvalidThai()
394 if (ucol_strcoll (thaiColl, toSort[i], -1, toSort[j], -1) == UCOL_GREATER) in TestInvalidThai()
400 iteratorText.setTo(toSort[i]); in TestInvalidThai()
|
Completed in 3 milliseconds