HomeSort by relevance Sort by last modified time
    Searched full:qsort (Results 1 - 25 of 730) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/icu4c/test/perf/collperf/
CollPerf.pl 40 "qsort strcoll null", ["$p TestIcu_qsort_strcoll_null", "$p TestPosix_qsort_strcoll_null", "$p TestWin_qsort_CompareStringW_null"],
41 "qsort use key", ["$p TestIcu_qsort_usekey", "$p TestPosix_qsort_usekey", "$p TestWin_qsort_usekey"],
57 #"qsort icu strcoll null", ["$p TestIcu_qsort_strcoll_null"],
58 #"qsort icu strcoll len", ["$p TestIcu_qsort_strcoll_len"],
59 #"qsort icu use key", ["$p TestIcu_qsort_usekey"],
60 #"qsort posix strcoll null", ["$p TestPosix_qsort_strcoll_null"],
61 #"qsort posix use key", ["$p TestPosix_qsort_usekey"],
62 #"qsort win CompareStringW null", ["$p TestWin_qsort_CompareStringW_null"],
63 #"qsort win CompareStringW len", ["$p TestWin_qsort_CompareStringW_len"],
64 #"qsort win use key", ["$p TestWin_qsort_usekey"]
    [all...]
CollPerf_r.pl 51 "qsort icu strcoll null", ["$p1 TestIcu_qsort_strcoll_null", "$p2 TestIcu_qsort_strcoll_null"],
52 "qsort icu strcoll len", ["$p1 TestIcu_qsort_strcoll_len", "$p2 TestIcu_qsort_strcoll_len"],
53 "qsort icu use key", ["$p1 TestIcu_qsort_usekey", "$p2 TestIcu_qsort_usekey"],
  /external/chromium_org/third_party/icu/source/test/perf/collperf/
CollPerf.pl 39 "qsort strcoll null", ["$p TestIcu_qsort_strcoll_null", "$p TestPosix_qsort_strcoll_null", "$p TestWin_qsort_CompareStringW_null"],
40 "qsort use key", ["$p TestIcu_qsort_usekey", "$p TestPosix_qsort_usekey", "$p TestWin_qsort_usekey"],
56 #"qsort icu strcoll null", ["$p TestIcu_qsort_strcoll_null"],
57 #"qsort icu strcoll len", ["$p TestIcu_qsort_strcoll_len"],
58 #"qsort icu use key", ["$p TestIcu_qsort_usekey"],
59 #"qsort posix strcoll null", ["$p TestPosix_qsort_strcoll_null"],
60 #"qsort posix use key", ["$p TestPosix_qsort_usekey"],
61 #"qsort win CompareStringW null", ["$p TestWin_qsort_CompareStringW_null"],
62 #"qsort win CompareStringW len", ["$p TestWin_qsort_CompareStringW_len"],
63 #"qsort win use key", ["$p TestWin_qsort_usekey"]
    [all...]
CollPerf_r.pl 51 "qsort icu strcoll null", ["$p1 TestIcu_qsort_strcoll_null", "$p2 TestIcu_qsort_strcoll_null"],
52 "qsort icu strcoll len", ["$p1 TestIcu_qsort_strcoll_len", "$p2 TestIcu_qsort_strcoll_len"],
53 "qsort icu use key", ["$p1 TestIcu_qsort_usekey", "$p2 TestIcu_qsort_usekey"],
  /external/compiler-rt/lib/asan/lit_tests/TestCases/Linux/
overflow-in-qsort.cc 5 // Test how well we unwind in presence of qsort in the stack
29 printf("Calling qsort\n");
30 qsort(a, size, sizeof(char), QsortCallback);
40 // Fast unwind: can not unwind through qsort.
malloc-in-qsort.cc 5 // Test how well we unwind in presence of qsort in the stack
28 printf("Calling qsort\n");
29 qsort(a, size, sizeof(char), QsortCallback);
40 // Fast unwind: can not unwind through qsort.
  /external/icu4c/samples/legacy/
newcol.cpp 38 // This one can be used for passing to qsort function
81 fprintf(stderr, "Done sortkeys, doing qsort test\n");
84 qsort(data, size, maxlen*sizeof(UChar), compare_current);
oldcol.cpp 39 // This one can be used for passing to qsort function
98 fprintf(stderr, "Done sortkeys, doing qsort test\n");
101 qsort(data, size, maxlen*sizeof(UChar), compare_legacy);
  /packages/inputmethods/PinyinIME/jni/share/
mystdlib.cpp 21 // For debug purpose. You can add a fixed version of qsort and bsearch functions
26 qsort(p,n, es, cmp);
  /external/webrtc/src/system_wrappers/source/
sort.cc 14 // qsort() will be used.
23 #include <cstdlib> // qsort
77 qsort((SORT_KEY), (NUM_OF_ELEMENTS), sizeof(SortKey), (COMPARE_FUNC));\
348 qsort(data, numOfElements, sizeof(WebRtc_Word8), CompareWord8);
351 qsort(data, numOfElements, sizeof(WebRtc_UWord8), CompareUWord8);
354 qsort(data, numOfElements, sizeof(WebRtc_Word16), CompareWord16);
357 qsort(data, numOfElements, sizeof(WebRtc_UWord16), CompareUWord16);
360 qsort(data, numOfElements, sizeof(WebRtc_Word32), CompareWord32);
363 qsort(data, numOfElements, sizeof(WebRtc_UWord32), CompareUWord32);
366 qsort(data, numOfElements, sizeof(WebRtc_Word64), CompareWord64)
    [all...]
  /external/skia/tests/
SortTest.cpp 49 // Use qsort as the reference sort.
51 qsort(sortedArray, count, sizeof(sortedArray[0]), compare_int);
  /external/jmonkeyengine/engine/src/core/com/jme3/util/
SortUtil.java 133 qsort(sorted, ic); method
136 System.out.println("QSort " + (dt/1000000.0) + " ms");
175 public static void qsort(Object[] a, Comparator comp) { method in class:SortUtil
176 qsort(a, 0, a.length - 1, comp); method
186 public static void qsort(Object[] a, int lo0, int hi0, Comparator comp) { method in class:SortUtil
233 qsort(a, lo0, lo - 1, comp); method
239 qsort(a, hi + 1, hi0, comp); method
243 public static void qsort(int[] a, int lo0, int hi0, Comparator comp) { method in class:SortUtil
290 qsort(a, lo0, lo - 1, comp); method
296 qsort(a, hi + 1, hi0, comp) method
    [all...]
  /bionic/libc/upstream-freebsd/lib/libc/stdlib/
qsort.c 31 static char sccsid[] = "@(#)qsort.c 8.1 (Berkeley) 6/4/93";
49 * Qsort routine from Bentley & McIlroy's "Engineering a Sort Function".
110 qsort(void *a, size_t n, size_t es, cmp_t *cmp)
186 qsort(a, r / es, es, cmp);
194 /* qsort(pn - r, r / es, es, cmp);*/
  /bionic/tests/
stdlib_test.cpp 113 TEST(stdlib, qsort) {
125 qsort(entries, 3, sizeof(s), s::comparator);
130 qsort(entries, 3, sizeof(s), s::comparator);
  /sdk/emulator/qtools/
coverage.cpp 37 // This comparison function is called from qsort() to sort symbols
58 // This comparison function is called from qsort() to sort symbols
125 qsort(syms, nsyms, sizeof(symbol_type), cmp_sym_names);
  /external/srtp/crypto/replay/
ut_sim.c 64 qsort(utc->buffer, UT_BUF, sizeof(uint32_t), ut_compar);
77 qsort(utc->buffer, UT_BUF, sizeof(uint32_t), ut_compar);
  /cts/suite/pts/deviceTests/simplecpu/src/com/android/pts/simplecpu/
CpuNative.java 24 * run qsort for given number of repetition
SimpleCpuTest.java 31 * qsort
93 * qsort test
  /external/strace/linux/
ioctlsort.c 43 qsort(ioctls, nioctls, sizeof(ioctls[0]), compare);
  /external/yaffs2/yaffs2/
yaffs_qsort.c 34 * Qsort routine from Bentley & McIlroy's "Engineering a Sort Function".
79 qsort(void *aa, size_t n, size_t es, int (*cmp)(const void *, const void *)) function
148 qsort(a, r / es, es, cmp);
155 /* qsort(pn - r, r / es, es, cmp);*/
yaffs_qsort.h 36 extern void qsort (void *const pbase,
  /frameworks/base/tools/aapt/
qsort_r_compat.h 19 * reentrant variant of qsort that passes a user data pointer to its comparator.
  /external/chromium_org/third_party/icu/source/test/perf/collationperf/
readme.html 21 <LI>Quick Sort. Report the time required to sort the file in memory, using the C library qsort function. The file
56 -qsort Quicksort timing test</TT></PRE>
  /external/icu4c/test/perf/collationperf/
readme.html 21 <LI>Quick Sort. Report the time required to sort the file in memory, using the C library qsort function. The file
56 -qsort Quicksort timing test</TT></PRE>
  /external/skia/bench/
SortBench.cpp 82 qsort(array, count, sizeof(int), int_compare);
95 { "qsort", qsort_sort },

Completed in 5381 milliseconds

1 2 3 4 5 6 7 8 91011>>