Beefy Boxes and Bandwidth Generously Provided by pair Networks
Pathologically Eclectic Rubbish Lister
 
PerlMonks  

Re^4: Efficiency of map vs. more verbose basic/fundamental code

by Marshall (Monsignor)
on Oct 10, 2012 at 04:33 UTC ( #998129=note: print w/ replies, xml ) Need Help??


in reply to Re^3: Efficiency of map vs. more verbose basic/fundamental code
in thread Efficiency of map vs. more verbose basic/fundamental code

I like this answer.
In recent Perl, a "for" and a "map" statement will be almost identical in performance.

Disk I/O statements especially can confuse benchmarks. That is because the Disk/File System has caching algorithms. I have one program that takes 7 seconds for the first search. The subsequent searches take like <1 second.

  • Comment on Re^4: Efficiency of map vs. more verbose basic/fundamental code

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://998129]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others making s'mores by the fire in the courtyard of the Monastery: (11)
As of 2016-06-28 20:23 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    My preferred method of making French fries (chips) is in a ...











    Results (361 votes). Check out past polls.