11 Commits

Author	SHA1	Message	Date
Rich Felker	df82f8f2dc	update COPYRIGHT status of TRE regex code	2012-03-24 17:46:42 -04:00
Rich Felker	93a50a26cd	Merge remote branch 'nsz/master'	2012-03-16 21:01:34 -04:00
Rich Felker	a43c3a337f	revert COPYRIGHT file changes in preparation to merge nsz's math branch	2012-03-16 20:52:00 -04:00
Rich Felker	6f21da618f	update copyright status (math library and new year)	2012-03-16 19:18:00 -04:00
nsz	3a6c828652	fix copyright notice for the math lib	2012-03-13 16:06:43 +01:00
Rich Felker	febbd12d00	XSI search.h API implementation by Szabolcs Nagy	2011-06-25 18:18:57 -04:00
Rich Felker	c7ce1b20d2	initial commit of prng implementation by Szabolcs Nagy	2011-06-23 18:02:23 -04:00
Rich Felker	22263709ed	replace heap sort with smoothsort implementation by Valentin Ochs ... 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.	2011-04-27 13:27:04 -04:00
Rich Felker	0b9a1ed00c	some docs fixes for x86_64	2011-02-15 14:52:11 -05:00
Rich Felker	05ea04558f	explicitly release crt/* to the public domain	2011-02-13 23:32:01 -05:00
Rich Felker	0b44a0315b	initial check-in, version 0.5.0	2011-02-12 00:22:29 -05:00