mirror/musl - mirror of git://git.musl-libc.org/musl

	Commit message (Collapse)	Author	Age	Files	Lines
*	Merge remote branch 'nsz/master'	Rich Felker	2012-03-16	1	-5/+9
\|\
\| *	fix copyright notice for the math lib	nsz	2012-03-13	1	-5/+9
\| \|
* \|	revert COPYRIGHT file changes in preparation to merge nsz's math branch	Rich Felker	2012-03-16	1	-4/+5
\| \|
* \|	update copyright status (math library and new year)	Rich Felker	2012-03-16	1	-6/+5
\|/
*	XSI search.h API implementation by Szabolcs Nagy	Rich Felker	2011-06-25	1	-3/+5
\|
*	initial commit of prng implementation by Szabolcs Nagy	Rich Felker	2011-06-23	1	-0/+4
\|
*	replace heap sort with smoothsort implementation by Valentin Ochs	Rich Felker	2011-04-27	1	-0/+4
\| \| \| \| \| \| \| \| \| \| \| \| \| \|	Smoothsort is an adaptive variant of heapsort. This version was written by Valentin Ochs (apo) specifically for inclusion in musl. I worked with him to get it working in O(1) memory usage even with giant array element widths, and to optimize it heavily for size and speed. It's still roughly 4 times as large as the old heap sort implementation, but roughly 20 times faster given an almost-sorted array of 1M elements (20 being the base-2 log of 1M), i.e. it really does reduce O(n log n) to O(n) in the mostly-sorted case. It's still somewhat slower than glibc's Introsort for random input, but now considerably faster than glibc when the input is already sorted, or mostly sorted.
*	some docs fixes for x86_64	Rich Felker	2011-02-15	1	-0/+3
\|
*	explicitly release crt/* to the public domain	Rich Felker	2011-02-13	1	-0/+6
\|
*	initial check-in, version 0.5.0 v0.5.0	Rich Felker	2011-02-12	1	-0/+31