The time to sort 3,000,000 items via Quicksort+Insertionsort was 23,953 clocks. Trying to allocate memory for the file itself in MB: 371. Longest line (including CR if present): 129Īllocated memory for pointers-to-lines in MB: 22 Sandokan_QuickSortExternal_4+GB r.3-++, written by Kaze, using Bill Durango's Quicksort source. Timer 9.01 : Igor Pavlov : Public domain : This test takes some 9 minutes to complete.Į:\Sandokan_r3-++\Sandokan_vs_Windows-sort_vs_GNU-sort_vs_DOS-RPSORT>Knight-tour_r8dump_Microsoft_V16_32bit_Ox.exe a8 3000000 1>KT3million.txtĮ:\Sandokan_r3-++\Sandokan_vs_Windows-sort_vs_GNU-sort_vs_DOS-RPSORT>dir kt*Į:\Sandokan_r3-++\Sandokan_vs_Windows-sort_vs_GNU-sort_vs_DOS-RPSORT>timer Sandokan_QuickSortExternal_4+GB_Microsoft_V16_32bit_Ox.exe KT3million.txt /fast /descend Sha1sum_Microsoft_V16_32bit_Ox.exe "KT3MIL~1.RP"Į:\Sandokan_r3-++\Sandokan_vs_Windows-sort_vs_GNU-sort_vs_DOS-RPSORT>Sandokan_vs_Windows-sort_vs_GNU-sort_vs_DOS-RPSORT.bat Sha1sum_Microsoft_V16_32bit_Ox.exe "QuickSortExternal_4+GB.txt" Timer sort_GNU_530 -Tc: -r -S1024M KT3million.txt
Timer sort_GNU_530 -Tc: -r KT3million.txt Timer sort /M 1048576 /R /T c: KT3million.txt /O Timer Sandokan_QuickSortExternal_4+GB_Microsoft_V16_32bit_Ox.exe KT3million.txt /fast /descend 04:20 AM 62,464 sha1sum_Microsoft_V16_32bit_Ox.exeĮ:\Sandokan_r3-++\Sandokan_vs_Windows-sort_vs_GNU-sort_vs_DOS-RPSORT>type This test takes some 9 minutes to a8 3000000>KT3million.txt 04:29 AM 769 Sandokan_vs_Windows-sort_vs_GNU-sort_vs_DOS-RPSORT.bat Resultant log on my laptop T7500 2200MHz 4MB L2 4GB DDR2, Windows XP 32bit:Į:\Sandokan_r3-++\Sandokan_vs_Windows-sort_vs_GNU-sort_vs_DOS-RPSORT>dir/og/onĭirectory of E:\Sandokan_r3-++\Sandokan_vs_Windows-sort_vs_GNU-sort_vs_DOS-RPSORT Hats down I guess.Ĭan anyone share with us a similar High-Performance free, open-source (for Windows to be more specific) console sorter?
To sort (on my laptop T7500 2200MHz 4MB L2 4GB DDR2, Windows XP 32bit) first 3 million (129 bytes long strings) Knight-Tours took 33s/39s/94s/21s respectively for Sandokan/Windows-sort/GNU-sort/RPSORT. Just run the batch file: Sandokan_vs_Windows-sort_vs_GNU-sort_vs_DOS-RPSORT.bat Note 5: Sandokan executables 32bit/64bit are included, Intel 12.1 and Microsoft VS2010 compilers were used, yes 4 EXEs in total. Note 4: Sources of all (except Windows' one) participants are given. Note 3: You may use/start the shortcut 'KAZE prompt.lnk' - it offers easy-to-the-eyes prompt i.e. Note 1: The package can be downloaded freely at: Note 2: This console-sort-test needs Windows 32bit because many 64bit Windowses do not support 16bit code. Last night I made a sort-showdown package Sandokan_vs_Windows-sort_vs_GNU-sort_vs_DOS-RPSORT.zip 4.75 MB (4,981,422 bytes), these are notes which I wanted to share with all C programmers:īack in 1992 RPSORT was a phenom, just wanted to see how my experimental console sorter Sandokan (written in C) behaves among Windows sort, ported GNU sort and the 16bit Bob Pirko's excellent tool (written in assembler).
#NAMEBENCH WINDOWS XP CODE#
DotNetPeek decompiled it 100% successfully and the side-by-side comparison to the original source code was bang on the money.Īnd, no, I don't work for JetBrains. Having spent only a little time with JetBrain's DotNetPeek I think it's very good so far and it passed muster with an assembly that Redgate's version of DotNet Reflector had serious problems decompiling and which ILSpy was maybe 95% successful. I liked ILSpy but I sort of got the impression that once created it dried up a little as the developers rightly have other jobs to do. I'm pretty sure that many of you know about the issue concerning Lutz Roeder's DotNet Reflector and the response to it that created the open source ILSpy.
#NAMEBENCH WINDOWS XP DOWNLOAD#
Duplicate post I put on the lounge forum:Īs a long-time ReSharper user I got an email from them this morning letting me know there's a free download of their decompiler on their website.
0 kommentar(er)
