6 Commits

Author	SHA1	Message	Date
Vicent Marti	c2db984b1c	tsort: Remove unused CLZ methods	2011-07-09 13:27:08 +02:00
nulltoken	ae2e4c6a06	win32: replace usage of _MSV_VER with _MSC_VER	2011-07-09 08:41:02 +02:00
schu	d4cb0ee85c	tsort: remove unused but set variable ... Signed-off-by: schu <schu-github@schulog.org>	2011-07-07 18:14:53 +02:00
nulltoken	417a581d92	tsort: fix wrong header inclusion	2011-07-07 15:36:58 +02:00
nulltoken	bdcc46111c	Fix MSVC compilation warnings	2011-07-07 12:12:34 +02:00
Vicent Marti	de18f27668	vector: Timsort all of the things ... Drop the GLibc implementation of Merge Sort and replace it with Timsort. The algorithm has been tuned to work on arrays of pointers (void **), so there's no longer a need to abstract the byte-width of each element in the array. All the comparison callbacks now take pointers-to-elements, not pointers-to-pointers, so there's now one less level of dereferencing. E.g. int index_cmp(const void *a, const void *b) { - const git_index_entry *entry_a = *(const git_index_entry **)(a); + const git_index_entry *entry_a = (const git_index_entry *)(a); The result is up to a 40% speed-up when sorting vectors. Memory usage remains lineal. A new `bsearch` implementation has been added, whose callback also supplies pointer-to-elements, to uniform the Vector API again.	2011-07-07 02:54:07 +02:00