Home
last modified time | relevance | path

Searched refs:sortedArray (Results 1 – 7 of 7) sorted by relevance

/external/slf4j/slf4j-ext/src/test/java/org/slf4j/profiler/
DSortAndPruneComposites.java50 int[] sortedArray = sort(); in sortAndPruneComposites() local
53 int result[] = pruneComposites(sortedArray); in sortAndPruneComposites()
59 int[] sortedArray = new int[originalArrrayLength]; in sort() local
60 System.arraycopy(originalArray, 0, sortedArray, 0, originalArrrayLength); in sort()
61 Arrays.sort(sortedArray); in sort()
62 return sortedArray; in sort()
65 int[] pruneComposites(int[] sortedArray) { in pruneComposites() argument
68 int n = sortedArray[i]; in pruneComposites()
/external/skia/tests/
DSortTest.cpp40 int sortedArray[SK_ARRAY_COUNT(randomArray)]; in DEF_TEST() local
51 memcpy(sortedArray, randomArray, sizeof(randomArray)); in DEF_TEST()
52 qsort(sortedArray, count, sizeof(sortedArray[0]), compare_int); in DEF_TEST()
56 check_sort(reporter, "Heap", workingArray, sortedArray, count); in DEF_TEST()
60 check_sort(reporter, "Quick", workingArray, sortedArray, count); in DEF_TEST()
/external/skqp/tests/
DSortTest.cpp40 int sortedArray[SK_ARRAY_COUNT(randomArray)]; in DEF_TEST() local
51 memcpy(sortedArray, randomArray, sizeof(randomArray)); in DEF_TEST()
52 qsort(sortedArray, count, sizeof(sortedArray[0]), compare_int); in DEF_TEST()
56 check_sort(reporter, "Heap", workingArray, sortedArray, count); in DEF_TEST()
60 check_sort(reporter, "Quick", workingArray, sortedArray, count); in DEF_TEST()
/external/cldr/tools/cldr-unittest/src/org/unicode/cldr/unittest/
DTestPerf.java31 static final String[] sortedArray; field in TestPerf
41 sortedArray = sorted.toArray(new String[sorted.size()]);
136 for (String path : sortedArray) { in TestXPathPartsWithComparators()
160 checkCost(sortedArray, CLDRFile.getComparator(DtdType.ldml), 1, in TestPathComparison()
164 double seconds = checkCost(sortedArray, in TestPathComparison()
170 checkCost(sortedArray, comp, 1, failures); in TestPathComparison()
172 double newSeconds = checkCost(sortedArray, comp, iterations, failures); in TestPathComparison()
178 private double checkCost(String[] sortedArray, Comparator<String> comp, in checkCost() argument
184 for (String currentPath : sortedArray) { in checkCost()
/external/cldr/tools/java/org/unicode/cldr/util/
DDtdDataCheck.java205 String[] sortedArray = sorted.toArray(new String[sorted.size()]); in main() local
209 for (String currentPath : sortedArray) { in main()
226 checkCost("DtdComparator", sortedArray, comp); in main()
227 checkCost("DtdComparator(null)", sortedArray, dtdData.getDtdComparator(null)); in main()
305 private static void checkCost(String title, String[] sortedArray, Comparator<String> comp) { in checkCost() argument
309 for (String currentPath : sortedArray) { in checkCost()
/external/flatbuffers/tests/FlatBuffers.Test.Swift/Tests/FlatBuffers.Test.SwiftTests/
DFlatBuffersMonsterWriterTests.swift61 let sortedArray = Monster1.sortVectorOfMonster(offsets: offsets, fbb) in createMonster() variable
90 Monster1.addVectorOf(testarrayoftables: sortedArray, fbb) in createMonster()
/external/kotlinc/lib/
Dkotlin-stdlib.jarMETA-INF/ META-INF/MANIFEST.MF kotlin/ kotlin/collections/ kotlin/ ...