Christian Biere wrote: > > Please try to map the list onto an array, use qsort and convert it back to a > > list. Maybe we don't need that list anyway.
> I tried this and was almost embarrassed to ever suggest this because it's > significantly slower as it takes about a second to sort. Well, I just realized that you can't use the same comparision function in this case due to a missing pointer indirection. That also explains why it was so horribly slow. -- 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
