Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris
 
PerlMonks  

Re^2: Perl and common subexpressions

by Stevie-O (Friar)
on Dec 23, 2004 at 15:13 UTC ( #417115=note: print w/ replies, xml ) Need Help??


in reply to Re: Perl and common subexpressions
in thread Perl and common subexpressions

This is very true.

That is, by the way, why I qualified my statement with 'CPU-bound'. When the bulk of your program involves I/O, the overhead from array, hash, and stash lookups becomes negligible -- even for pipes, because they involve context switches to the process on the other end of the pipe.

--Stevie-O
$"=$,,$_=q>|\p4<6 8p<M/_|<('=> .q>.<4-KI<l|2$<6%s!<qn#F<>;$, .=pack'N*',"@{[unpack'C*',$_] }"for split/</;$_=$,,y[A-Z a-z] {}cd;print lc


Comment on Re^2: Perl and common subexpressions
Download Code

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others romping around the Monastery: (8)
As of 2014-08-23 12:34 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The best computer themed movie is:











    Results (173 votes), past polls