Viitor_cc65/usr/share/doc/cc65/webdoc/funcref-166.html
kueller 223cc6685e Neue Version V963
git-svn-id: svn://svn.compuextreme.de/Viitor/V963/Viitor_cc65@5933 504e572c-2e33-0410-9681-be2bf7408885
2011-01-03 10:48:06 +00:00

53 lines
1.7 KiB
HTML

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2 Final//EN">
<HTML>
<HEAD>
<META NAME="GENERATOR" CONTENT="LinuxDoc-Tools 0.9.20">
<TITLE>cc65 function reference: Alphabetical function reference: qsort</TITLE>
<LINK HREF="funcref-167.html" REL=next>
<LINK HREF="funcref-165.html" REL=previous>
<LINK HREF="funcref.html#toc3" REL=contents>
</HEAD>
<BODY>
<A HREF="funcref-167.html">Next</A>
<A HREF="funcref-165.html">Previous</A>
<A HREF="funcref.html#toc3">Contents</A>
<HR>
<H2><A NAME="qsort"></A> 3.121 <A HREF="funcref.html#toc3.121">qsort</A></H2>
<P>
<BLOCKQUOTE>
<DL>
<DT><B>Function</B><DD><P>Sort an array.</P>
<DT><B>Header</B><DD><P><CODE>
<A HREF="funcref-38.html#stdlib.h">stdlib.h</A></CODE></P>
<DT><B>Declaration</B><DD><P><CODE>void __fastcall__ qsort (void* base, size_t count,
size_t size, int (*compare) (const void*, const void*));</CODE></P>
<DT><B>Description</B><DD><P><CODE>qsort</CODE> sorts an array according to a given compare
function <CODE>compare</CODE>. <CODE>base</CODE> is the address of the array, <CODE>count</CODE>
is the number of elements, <CODE>size</CODE> the size of an element and <CODE>compare</CODE>
the function used to compare the members.</P>
<DT><B>Limits</B><DD><P>
<UL>
<LI>If there are multiple members with the same key, the order after calling
the function is undefined.</LI>
<LI>The function is only available as fastcall function, so it may only
be used in presence of a prototype.</LI>
</UL>
</P>
<DT><B>Availability</B><DD><P>ISO 9899</P>
<DT><B>See also</B><DD><P>
<A HREF="funcref-70.html#bsearch">bsearch</A></P>
<DT><B>Example</B><DD><P>None.</P>
</DL>
</BLOCKQUOTE>
</P>
<HR>
<A HREF="funcref-167.html">Next</A>
<A HREF="funcref-165.html">Previous</A>
<A HREF="funcref.html#toc3">Contents</A>
</BODY>
</HTML>