If you want a handle on the cost of hash inserts, you may as well make the comparison more precise by making script 1 do something like:
(Assuming of course, the compiler doesn't optimize any of this away.)while(my $l=<IN>){ my $id=substr($l,0,33); $hash=1; }
the lowliest monk
In reply to Re^3: How do I measure my bottle ?
by tlm
in thread How do I measure my bottle ?
by cbrain
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |