Brian Raven coded:
while ((!performance_acceptable()) && worth_the_effort()) {
profile();
my $x = locate_worst_bottleneck();
attempt_to_improve($x);
}
TOO COOL. I'm going to print that out and stick it up on my cube wall.
(And follow it, too!)
Thanks!
Deane Rothenmaier
Programmer/An
Subject: Re: Hash performance v. hash size setting
> Because the actual process is rather slow--and I'm not sure there's
much to be done to speed things up, I try to pick up what snippets of
> performance I can in the setup code, hence my query.
Unfortunately, programmers are no
> Because the actual process is rather slow--and I'm not sure there's
> much to be done to speed things up, I try to pick up what snippets of
> performance I can in the setup code, hence my query.
I'd look for other things first:
* execution model: persistent Perl process, or started anew?
* ne
>I think my philosophy is that within reasonable boundaries first
>write maintainable, well tested code that does what it needs to do
>and only then check if there is any performance issue.
Agreed, Gabor. The code does "[do] what it needs to do..." which is
maintaining an HTML Web page that report
On Fri, Sep 3, 2010 at 1:30 PM, Jenda Krynicky wrote:
> "Premature optimization is the root of all evil!"
>
> Are you sure you do need to fiddle with these things? Does it make a
> measurable difference?
I am glad you wrote this.
I wanted to ask back if there is any real performance issue in the
"Premature optimization is the root of all evil!"
Are you sure you do need to fiddle with these things? Does it make a
measurable difference?
From: deane.rothenma...@walgreens.com
> This may be merely a philosophical debate, but I have a
> performance-related question regarding pre-allocation
Gurus,
This may be merely a philosophical debate, but I have a
performance-related question regarding pre-allocation to hashes. Consider:
# Sample code #
use strict;
use warnings;
use Devel::Peek;
use constant HKEYS => 128; # Experimentally optimized, qu
