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

Re^8: RFC: beginner level script improvement

by georgecarlin (Acolyte)
on Sep 27, 2013 at 09:10 UTC ( #1055949=note: print w/ replies, xml ) Need Help??


in reply to Re^7: RFC: beginner level script improvement
in thread RFC: beginner level script improvement

I thought about using push and foreach instead of all the indexing, counting and such, but decided against it, because I wasn't sure it would work.

The reason being that I need 100% certainty that the command=match relationship is deducable from the data structure, in all of the following cases:
- command X and NO matches
- command X and match y
- command X and match y + ...match n

if I use push in all cases won't this logic collapse? or maybe I just have to push undef, if that's possible. Again, Thank you for taking the time.


Comment on Re^8: RFC: beginner level script improvement

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (7)
As of 2014-08-22 05:10 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The best computer themed movie is:











    Results (147 votes), past polls