Tag Archives: benchmarking

Faster ordered hashes for Perl

With some prompting and suggestions from Mario Roy, author of MCE, I've been optimizing Hash::Ordered. With the exception of setting existing/new elements, which got a bit slower due to ensuring keys are strings, not references, most functions got faster. Some, like large hash deletion, are now MUCH faster. Here are changes in benchmarks from version […]

Posted in perl programming | Also tagged , , | Comments closed

Adventures in Benchmarking, Part 1

I created Path::Tiny because I wanted a faster file path utility. But believing it would be faster isn't the same thing as demonstrating it, so I decided to create some benchmarks. That got complicated, but now I have a pretty nice benchmarking toolkit. This article describes my setup and process and shows results for object […]

Posted in perl programming | Also tagged , | Comments closed

© 2009-2015 David Golden All Rights Reserved