Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical
 
PerlMonks  

Re^2: Optimizing perl code performance

by QM (Parson)
on Aug 17, 2015 at 09:33 UTC ( [id://1138861]=note: print w/replies, xml ) Need Help??


in reply to Re: Optimizing perl code performance
in thread Optimizing perl code performance

I'm wondering if a regExp would be faster than split.
split takes a regex, so an optimized regex similar to the split could only be marginally better, and potentially much worse, especially for simple cases like this.

Likewise chomp is very simple, and is probably zillions of times faster than IO.

Profile, then fiddle. Lather, rinse, repeat.

-QM
--
Quantum Mechanics: The dreams stuff is made of

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others wandering the Monastery: (4)
As of 2024-04-19 17:27 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found