Home
last modified time | relevance | path

Searched refs:sortedArray (Results 1 – 9 of 9) 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.cpp42 int sortedArray[std::size(randomArray)]; in DEF_TEST() local
53 memcpy(sortedArray, randomArray, sizeof(randomArray)); in DEF_TEST()
54 qsort(sortedArray, count, sizeof(sortedArray[0]), compare_int); in DEF_TEST()
58 check_sort(reporter, "Heap", workingArray, sortedArray, count); in DEF_TEST()
62 check_sort(reporter, "Quick", workingArray, sortedArray, count); in DEF_TEST()
/external/cldr/tools/cldr-code/src/test/java/org/unicode/cldr/unittest/
DTestPerf.java29 static final String[] sortedArray; field in TestPerf
37 sortedArray = sorted.toArray(new String[sorted.size()]);
131 for (String path : sortedArray) { in TestXPathPartsWithComparators()
156 checkCost(sortedArray, CLDRFile.getComparator(DtdType.ldml), 1, failures); in TestPathComparison()
159 checkCost(sortedArray, CLDRFile.getComparator(DtdType.ldml), iterations, failures); in TestPathComparison()
164 checkCost(sortedArray, comp, 1, failures); in TestPathComparison()
166 double newSeconds = checkCost(sortedArray, comp, iterations, failures); in TestPathComparison()
173 String[] sortedArray, in checkCost() argument
181 for (String currentPath : sortedArray) { in checkCost()
/external/cldr/tools/cldr-code/src/main/java/org/unicode/cldr/util/
DDtdDataCheck.java224 String[] sortedArray = sorted.toArray(new String[sorted.size()]); in main() local
228 for (String currentPath : sortedArray) { in main()
245 checkCost("DtdComparator", sortedArray, comp); in main()
246 checkCost("DtdComparator(null)", sortedArray, dtdData.getDtdComparator(null)); in main()
336 private static void checkCost(String title, String[] sortedArray, Comparator<String> comp) { in checkCost() argument
340 for (String currentPath : sortedArray) { in checkCost()
/external/json-schema-validator/src/main/java/com/networknt/org/apache/commons/validator/routines/
DDomainValidator.java1811 private static boolean arrayContains(final String[] sortedArray, final String key) { in arrayContains() argument
1812 return Arrays.binarySearch(sortedArray, key) >= 0; in arrayContains()
/external/flatbuffers/kotlin/flatbuffers-kotlin/src/commonTest/kotlin/com/google/flatbuffers/kotlin/
DFlexBuffersTest.kt260 …arrayOf("hello", "int", "float", "intarray", "myMap").sortedArray().forEachIndexed { i: Int, it: S… in <lambda>()
280 val sortedKeys = stringKey.sortedArray() in <lambda>()
/external/flatbuffers/kotlin/benchmark/
Dbuild.gradle.kts29 val lastFolder = project.file(baseFolder).list()?.sortedArray()?.lastOrNull() ?: "" in <lambda>()
/external/flatbuffers/tests/swift/Wasm.tests/Tests/FlatBuffers.Test.Swift.WasmTests/
DFlatBuffersMonsterWriterTests.swift161 let sortedArray = Monster.sortVectorOfMonster(offsets: offsets, &fbb) in createMonster() variable
198 Monster.addVectorOf(testarrayoftables: sortedArray, &fbb) in createMonster()
/external/flatbuffers/tests/swift/tests/Tests/FlatBuffers.Test.SwiftTests/
DFlatBuffersMonsterWriterTests.swift244 let sortedArray = Monster.sortVectorOfMonster(offsets: offsets, &fbb) in createMonster() variable
281 Monster.addVectorOf(testarrayoftables: sortedArray, &fbb) in createMonster()