Nice work Peter, please commit. We should probably convert ecore_file_ls to use these functions too.
Do you have a sense of how many nodes it takes for the heapsort to have a significant advantage? We could have a sort wrapper to choose the appropriate sort based on the number of nodes, but expose both api's for apps that want to be certain which algorithm is chosen. Nathan On 1/27/07, Peter Wehrfritz <[EMAIL PROTECTED]> wrote: > Oops, sorry the patch wasn't against current cvs. > > Peter > > Peter Wehrfritz schrieb: > > Hi all, > > > > I've written two functions to sort a Ecore_List. The first one uses > > the merge sort algorithm, the second one uses Ecore_Sheap to sort the > > content. It works similar to ecore_file_ls() except that it doesn't > > remove the list nodes after they are add to the heap. This gives a > > speed up of about 20%. > > > > Please find the attached patch. > > > > Can I commit it? > > > > Peter aka pfritz > > > > ------------------------------------------------------------------------- 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 _______________________________________________ enlightenment-devel mailing list enlightenment-devel@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/enlightenment-devel
