3 ms·
Seems difficult to verify any of the claims made, are there comparisons to other algorithms? Any analysis? Description of the algorithm? Maybe they're there an
by scaramanga 13y ago
Seems difficult to verify any of the claims made, are there comparisons to other algorithms? Any analysis? Description of the algorithm?
Maybe they're there and I missed them because the website made my eyes bleed.
- deletes 13y agoHN is desperate for any kind of code related submission. Of which there are too few.
- ye 13y agoHe has a ton of benchmarks on that page: Searching for Pattern('an',2bytes) into String(206908949bytes) line-by-line ... strstr_Microsoft_hits/strstr_Microsoft_clocks: 1212509/544 strstr_Microsoft performance: 248KB/clock StrnglenTRAVERSED: 138478024 bytes strstr_GNU_C_Library_hits/strstr_GNU_C_Library_clocks: 1212509/359 strstr_GNU_C_Library performance: 376KB/clock StrnglenTRAVERSED: 138478024 bytes Railgun_Doublet_hits/Railgun_Doublet_clocks: 1212509/321 Railgun_Doublet performance: 421KB/clock StrnglenTRAVERSED: 138478024 bytes Railgun_Quadruplet_8Triplet_hits/Railgun_Quadruplet_8Triplet_clocks: 1212509/335 Railgun_Quadruplet_8Triplet performance: 403KB/clock StrnglenTRAVERSED: 138478024 bytes Railgun_Mischa_8Triplet_hits/Railgun_Mischa_8Triplet_clocks: 1212509/348 Railgun_Mischa_8Triplet performance: 388KB/clock StrnglenTRAVERSED: 138478024 bytes BNDM_32_hits/BNDM_32_clocks: 1212509/505 BNDM_32 performance: 267KB/clock StrnglenTRAVERSED: 138478024 bytes ...
- acqq 13y agoSuch a 'ton' of codes and dumps in that form is the problem in itself. George, if you happen to read this once, I hope you'll get what I mean.