Lloyd Bryant wrote: > No sort: 21.3 sec (0 ms sorting) > g_slist_sort: 21.2 sec (475ms sorting) > sort_slist_with_qsort: 21.1 sec (128ms sorting) > SVN r12351: (393ms sorting)
It's fairly impossible that sort_slist_with_qsort() is faster than sorting table because it's the same as sorting the table plus mapping the list to the table and back to the list. The two assertion checks I added to the sorting function almost double the sorting time for me. That's not suprising and it could be much worth depending on the CPU and the compiler flags. If this overhead is of any concern, we can simplify the checks. -- Christian ------------------------------------------------------------------------- Take Surveys. Earn Cash. Influence the Future of IT Join SourceForge.net's Techsay panel and you'll get the chance to share your opinions on IT & business topics through brief surveys - and earn cash http://www.techsay.com/default.php?page=join.php&p=sourceforge&CID=DEVDEV _______________________________________________ Gtk-gnutella-devel mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/gtk-gnutella-devel
