|Perl: the Markov chain saw|
Re^5: Best method to diff very large array efficientlyby BrowserUk (Pope)
|on Nov 26, 2013 at 20:34 UTC||Need Help??|
This just gets funnier and funnier.
These are the results from kenosis benchmark:
And these from your benchmark:
Forget the order of the results, note that all your results are something like 2000 times faster despite that you're using pretty much the same sized arrays as kenosis. Do you have some magic touch that makes computers work so much harder for you?
Oh look and what your complicated way of building a coderefhash produces:
Like I said. Broken is just broken.
With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.