Quoting Carl Erhorn <[EMAIL PROTECTED]> from ml.softs.gtk-gnutella.devel: :I have offered to write a shell sort routine that will :increase performance by at least a factor of 2 in :these cases, which accepts the same parameters as the qsort, :and which could be simply plugged in place of the :qsort when appropriate. I'm waiting to hear from :Emile, to see if he wants the help.
Well, the GUI is not the only place where we use qsort(). The flow control code in mq.c (the core part) uses qsort() as well, albeit on a smaller data set (around 400-1000 entries). If you're offering to contribute a shell sort that has the same interface of qsort() but is more efficient in terms of space used and as efficient in terms of speed, then I'll be glad to integrate it in the source and replace all instances of qsort() with it. Like we did for malloc(), which is now almost replaced everywhere with zalloc() or walloc(). Raphael ------------------------------------------------------- The SF.Net email is sponsored by EclipseCon 2004 Premiere Conference on Open Tools Development and Integration See the breadth of Eclipse activity. February 3-5 in Anaheim, CA. http://www.eclipsecon.org/osdn _______________________________________________ Gtk-gnutella-devel mailing list [EMAIL PROTECTED] https://lists.sourceforge.net/lists/listinfo/gtk-gnutella-devel
