| /external/autotest/frontend/client/src/autotest/common/table/ |
| ArrayDataSource.java | 49 * @param sortKeys keys that will be used to keep items sorted internally. We
52 public ArrayDataSource(String[] sortKeys) {
53 SortSpec[] sortSpecs = new SortSpec[sortKeys.length];
54 for (int i = 0; i < sortKeys.length; i++) {
55 sortSpecs[i] = new SortSpec(sortKeys[i]);
|
| /external/icu/icu4c/source/samples/legacy/ |
| newcol.cpp | 74 fprintf(stderr, "Entered current, version: [%d.%d.%d.%d]\nMoving to sortkeys\n", uvi[0], uvi[1], uvi[2], uvi[3]);
81 fprintf(stderr, "Done sortkeys, doing qsort test\n");
|
| oldcol.cpp | 91 fprintf(stderr, "Entered legacy, version: [%d.%d.%d.%d]\nMoving to sortkeys\n", uvi[0], uvi[1], uvi[2], uvi[3]);
98 fprintf(stderr, "Done sortkeys, doing qsort test\n");
|
| README | 6 What is it all about: Let's say you have a 10 Tb database indexed using ICU 1.8.1. sortkeys. New ICU comes out, with neat new features you would like to use, but also with new sortkeys and you don't care to reindex your 10 Tb database. What to do then??? You can use ICU 1.8.1. in one of your compilation units and current version in all the others. So, you can use old collation until you decide to reindex.
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ |
| winldap.h | [all...] |
| /external/icu/icu4c/source/test/perf/collationperf/ |
| readme.html | 44 -usekeys Run tests using sortkeys rather than strcoll
|
| collperf.cpp | 35 "-usekeys Run tests using sortkeys rather than strcoll\n"
[all...] |
| /external/icu/icu4c/source/test/cintltst/ |
| capitst.c | 1912 uint8_t **sortkeys = (uint8_t **)malloc(casesSize*sizeof(uint8_t *)); local
[all...] |
| callcoll.c | 362 /* testing the partial sortkeys */
[all...] |
| cmsccoll.c | [all...] |
| /prebuilts/go/darwin-x86/src/text/template/ |
| exec.go | 286 for _, key := range sortKeys(val.MapKeys()) {
863 // sortKeys sorts (if it can) the slice of reflect.Values, which is a slice of map keys.
864 func sortKeys(v []reflect.Value) []reflect.Value {
|
| /prebuilts/go/linux-x86/src/text/template/ |
| exec.go | 286 for _, key := range sortKeys(val.MapKeys()) {
863 // sortKeys sorts (if it can) the slice of reflect.Values, which is a slice of map keys.
864 func sortKeys(v []reflect.Value) []reflect.Value {
|
| /external/icu/icu4c/source/test/intltest/ |
| tscoll.cpp | 198 /* testing the partial sortkeys */
|
| /external/icu/icu4j/perf-tests/src/com/ibm/icu/dev/test/perf/ |
| CollationPerformanceTest.java | 27 + "-usekeys Run tests using sortkeys rather than strcoll\n"
[all...] |
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/collator/ |
| CollationMiscTest.java | [all...] |
| /external/icu/icu4j/main/tests/collate/src/com/ibm/icu/dev/test/collator/ |
| CollationMiscTest.java | [all...] |
| /prebuilts/go/darwin-x86/pkg/darwin_amd64/text/ |
| template.a | [all...] |
| /prebuilts/go/darwin-x86/pkg/darwin_amd64_race/text/ |
| template.a | [all...] |
| /prebuilts/go/linux-x86/pkg/linux_amd64/text/ |
| template.a | [all...] |
| /prebuilts/go/linux-x86/pkg/linux_amd64_race/text/ |
| template.a | [all...] |
| /external/chromium-trace/catapult/tracing/third_party/d3/ |
| d3.min.js | [all...] |
