HomeSort by relevance Sort by last modified time
    Searched defs:qsort (Results 1 - 5 of 5) sorted by null

  /bionic/libc/stdlib/
qsort.c 1 /* $OpenBSD: qsort.c,v 1.10 2005/08/08 08:05:37 espie Exp $ */
40 * Qsort routine from Bentley & McIlroy's "Engineering a Sort Function".
84 qsort(void *aa, size_t n, size_t es, int (*cmp)(const void *, const void *)) function
153 qsort(a, r / es, es, cmp);
160 /* qsort(pn - r, r / es, es, cmp); */
  /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);*/
  /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...]
  /external/qemu/distrib/sdl-1.2.12/src/stdlib/
SDL_qsort.c 0 /* qsort.c
4 * This is a drop-in replacement for the C library's |qsort()| routine.
11 * - A few little wrinkles stolen from the GNU |qsort()|.
58 #define qsort SDL_qsort macro
63 static char _ID[]="<qsort.c gjm 1.12 1998-03-19>";
220 * idea from the GNU implementation of qsort().
413 void qsort(void *base, size_t nmemb, size_t size, function
  /external/valgrind/main/callgrind/
dump.c 987 * qsort -- qsort interface implemented by faster quicksort.
1020 static void qsort(BBCC **a, int n, int (*cmp)(BBCC**,BBCC**)) function
1026 CLG_DEBUG(8, " qsort(%ld,%ld)\n", a-qsort_start + 0L, n + 0L);
1118 if ((s = pb+1-pa) > 1) qsort(a, s, cmp);
1119 if ((s = pd+1-pc) > 1) qsort(a+n-s, s, cmp);
1244 qsort(array, prepare_count, my_cmp);
    [all...]

Completed in 133 milliseconds