Searched refs:qsort (Results 1 - 25 of 364) sorted by relevance

1234567891011>>

/macosx-10.9.5/ruby-104/ruby/test/-ext-/string/
H A Dtest_qsort.rb7 s.qsort!
13 s.qsort!(nil, nil, 3)
16 s.qsort!(nil, nil, 3)
/macosx-10.9.5/tcl-102/tcl_ext/ffidl/ffidl/demos/
H A Dqsort.tcl2 # qsort for callback testing
4 # void qsort(void *base, size_t nmemb, size_t size,
27 ::ffidl::callout qsort {pointer-var size_t size_t pointer-proc} void [::ffidl::symbol [::ffidl::find-lib c] qsort]
H A DpkgIndex.tcl12 package ifneeded Qsort 0.1 [list source [file join $dir qsort.tcl]]
/macosx-10.9.5/bash-92/bash-3.2/include/
H A Dansi_stdlib.h52 extern void qsort ();
/macosx-10.9.5/bash-92/bash-3.2/lib/readline/
H A Dansi_stdlib.h52 extern void qsort ();
/macosx-10.9.5/CPANInternal-140/YAML-Syck/
H A Dppport_sort.h14 qsort((char *) AvARRAY(av), len, sizeof(SV *), sortcmp); \
20 qsort((char *) AvARRAY(av), len, sizeof(SV *), sortcmp);
/macosx-10.9.5/tcl-102/tcl_ext/ffidl/ffidl/tests/
H A Dqsort.test2 # test qsort binding and callback implementation
17 test ffidl-qsort {ffidl qsort tests} {callback} {
64 # qsort them
66 qsort ints $n [::ffidl::sizeof int] cmp.int
/macosx-10.9.5/llvmCore-3425.0.33/lib/CodeGen/
H A DMachineModuleInfoImpls.cpp42 qsort(&List[0], List.size(), sizeof(List[0]), SortSymbolPair);
/macosx-10.9.5/ruby-104/ruby/test/fiddle/
H A Dtest_func.rb79 qsort = Function.new(@libc['qsort'],
83 qsort.call(buff, buff.size, 1, cb)
88 EnvUtil.under_gc_stress {qsort.call(buff, buff.size, 1, cb)}
/macosx-10.9.5/tcl-102/tcl/tcl/compat/
H A Dstdlib.h35 extern void qsort _ANSI_ARGS_((VOID *base, int n, int size,
/macosx-10.9.5/tcl-102/tcl84/tcl/compat/
H A Dstdlib.h35 extern void qsort _ANSI_ARGS_((VOID *base, int n, int size,
/macosx-10.9.5/tcl-102/tcl_ext/trf/trf/compat/
H A Dstdlib.h35 extern void qsort _ANSI_ARGS_((VOID *base, int n, int size,
/macosx-10.9.5/tcl-102/tk/tk/compat/
H A Dstdlib.h35 extern void qsort _ANSI_ARGS_((VOID *base, int n, int size,
/macosx-10.9.5/tcl-102/tk84/tk/compat/
H A Dstdlib.h35 extern void qsort _ANSI_ARGS_((VOID *base, int n, int size,
/macosx-10.9.5/ruby-104/ruby/test/dl/
H A Dtest_func.rb14 cb = Function.new(CFunc.new(0, TYPE_INT, '<callback>qsort'),
16 assert_equal('<callback>qsort', cb.name)
157 cb = Function.new(CFunc.new(0, TYPE_INT, '<callback>qsort'),
159 qsort = Function.new(CFunc.new(@libc['qsort'], TYPE_VOID, 'qsort'),
162 qsort.call(buff, buff.size, 1, cb)
167 EnvUtil.under_gc_stress {qsort.call(buff, buff.size, 1, cb)}
175 cb = TempFunction.new(CFunc.new(0, TYPE_INT, '<callback>qsort'),
177 qsort
[all...]
H A Dtest_import.rb17 extern "int qsort(void*, unsigned long, unsigned long, void*)"
158 LIBC.qsort(buff, buff.size, 1, LIBC::QsortCallback){|ptr1,ptr2| ptr1[0] <=> ptr2[0]}
161 LIBC.qsort(buff, buff.size, 1, LIBC::BoundQsortCallback)
/macosx-10.9.5/BerkeleyDB-21/db/common/
H A Ddb_idspace.c68 qsort(inuse, (size_t)n, sizeof(u_int32_t), __db_idcmp);
/macosx-10.9.5/BerkeleyDB-21/db/dbinc_auto/
H A Dclib_ext.h52 void qsort __P((void *, size_t, size_t, int(*)(const void *, const void *)));
/macosx-10.9.5/ICU-511.35/icuSources/samples/legacy/
H A Dnewcol.cpp38 // 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);
/macosx-10.9.5/ntp-88/util/
H A Dhist.c82 qsort(
/macosx-10.9.5/shell_cmds-175/users/
H A Dusers.c108 qsort(names, ncnt, _UTX_USERSIZE, scmp);
/macosx-10.9.5/JavaScriptCore-7537.78.1/bytecode/
H A DOpcode.cpp108 qsort(sortedIndices.data(), numOpcodeIDs, sizeof(int), compareOpcodeIndices);
115 qsort(sortedPairIndices, numOpcodeIDs * numOpcodeIDs, sizeof(pair<int, int>), compareOpcodePairIndices);
/macosx-10.9.5/OpenLDAP-491.1/OpenLDAP/libraries/libldap/
H A Dsort.c151 qsort( et, count, sizeof(struct entrything), et_cmp );
180 qsort( vals, nel, sizeof(char *), cmp );
/macosx-10.9.5/CommonCrypto-60049/lib/
H A DccMemory.h62 #define CC_XQSORT(base, nelement, width, comparfunc) qsort((base), (nelement), (width), (comparfunc))
/macosx-10.9.5/CommonCrypto-60049/libcn/
H A DccMemory.h63 #define CC_XQSORT(base, nelement, width, comparfunc) qsort((base), (nelement), (width), (comparfunc))

Completed in 247 milliseconds

1234567891011>>