HomeSort by relevance Sort by last modified time
    Searched full:qsort (Results 101 - 125 of 967) sorted by null

1 2 3 45 6 7 8 91011>>

  /external/icu/icu4c/source/test/intltest/
canittst.cpp 261 // Iterate over the Hashtable, then qsort.
282 qsort(resArray, col->count(), sizeof(UnicodeString *), compareUnicodeStrings);
  /external/icu/icu4c/source/test/perf/collationperf/
CollPerf.pl 80 my @icu = `$p -locale @locale[$n] -loop 1000 -file $filePath@data[$n] -qsort`;
81 my @nix = `$p -locale @locale[$n] -unix -loop 1000 -file $filePath@data[$n] -qsort`;
  /external/mesa3d/src/compiler/nir/
nir_phi_builder.c 276 * XXX: Calling qsort this many times seems expensive.
282 qsort(preds, num_preds, sizeof(*preds), compare_blocks);
  /external/tensorflow/tensorflow/contrib/hvx/hexagon_controller/src_impl/
graph_functions_wrapper.c 304 qsort(info, n_nodes, sizeof(info[0]), CompareCycle);
340 qsort(info, node_count, sizeof(info[0]), CompareCycle);
  /external/zopfli/src/zopfli/
katajainen.c 174 Comparator for sorting the leaves. Has the function signature for qsort.
224 qsort(leaves, numsymbols, sizeof(Node), LeafComparator);
  /frameworks/wilhelm/tools/permute/
permute.c 65 /** Called by qsort as the comparison handler */
283 qsort((void *) s.mSegmentArray, used, sizeof(Segment), qsortCompare);
  /system/extras/librank/
librank.c 388 qsort(libraries, libraries_count, sizeof(libraries[0]), &licmp);
400 qsort(li->mappings, li->mappings_count, sizeof(li->mappings[0]), compfn);
  /system/extras/procmem/
procmem.c 39 /* qsort compare function to compare maps by PSS */
236 qsort(mis, num_maps, sizeof(mis[0]), compfn);
  /toolchain/binutils/binutils-2.27/bfd/
elf-strtab.c 318 /* Compare two elf_strtab_hash_entry structures. Called via qsort. */
388 qsort (array, size, sizeof (struct elf_strtab_hash_entry *), strrevcmp);
  /toolchain/binutils/binutils-2.27/ld/
ldctor.c 149 is called via qsort. */
235 qsort (array, c, sizeof *array, ctor_cmp);
  /bionic/tests/headers/posix/
stdlib_h.c 114 FUNCTION(qsort, void (*f)(void*, size_t, size_t, int (*)(const void*, const void*)));
  /external/e2fsprogs/debugfs/
lsdel.c 194 qsort(delarray, num_delarray, sizeof(struct deleted_info),
  /external/elfutils/tests/
allregs.c 170 qsort (state.info, state.nregs, sizeof state.info[0], &compare);
  /external/harfbuzz_ng/src/
hb-private.hh 473 inline void qsort (void) function in struct:hb_prealloced_array_t
475 ::qsort (array, len, sizeof (Type), Type::cmp);
478 inline void qsort (unsigned int start, unsigned int end) function in struct:hb_prealloced_array_t
480 ::qsort (array + start, end - start, sizeof (Type), Type::cmp);
  /external/libcxx/include/
stdlib.h 65 void qsort(void* base, size_t nmemb, size_t size,
  /external/libcxx/test/std/depr/depr.c.headers/
stdlib_h.pass.cpp 97 static_assert((std::is_same<decltype(qsort(0,0,0,0)), void>::value), "");
  /external/llvm/lib/MC/
StringTableBuilder.cpp 72 // qsort(P, Q, Pos + 1), but with tail call optimization.
  /external/mesa3d/src/mesa/main/
imports.c 17 * - qsort
  /external/selinux/libsemanage/src/
database.h 44 * This function is intenteded to be used as a qsort
policy_components.c 172 qsort(records, nrecords, sizeof(record_t *),
  /external/skia/include/private/
SkTSearch.h 143 // Helper when calling qsort with a compare proc that has typed its arguments
  /external/skia/tools/skdiff/
skdiff_main.cpp 321 /// Comparison routines for qsort, sort by file names.
399 qsort(baseFiles.begin(), baseFiles.count(), sizeof(SkString*),
403 qsort(comparisonFiles.begin(), comparisonFiles.count(),
819 qsort(differences.begin(), differences.count(),
  /external/skqp/include/private/
SkTSearch.h 143 // Helper when calling qsort with a compare proc that has typed its arguments
  /external/skqp/tools/skdiff/
skdiff_main.cpp 321 /// Comparison routines for qsort, sort by file names.
399 qsort(baseFiles.begin(), baseFiles.count(), sizeof(SkString*),
403 qsort(comparisonFiles.begin(), comparisonFiles.count(),
819 qsort(differences.begin(), differences.count(),
  /external/webrtc/webrtc/modules/audio_coding/neteq/test/
RTPjitter.cc 129 qsort(time_vec,dat_len,sizeof(arr_time),compare_arr_time);

Completed in 1438 milliseconds

1 2 3 45 6 7 8 91011>>