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.
Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
Read Where should I post X? if you're not absolutely sure you're posting in the right place.
Please read these before you post! —
Posts may use any of the Perl Monks Approved HTML tags:
Outside of code tags, you may need to use entities for some characters:
- a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
Link using PerlMonks shortcuts! What shortcuts can I use for linking?
See Writeup Formatting Tips and other pages linked from there for more info.
| & || & |
| < || < |
| > || > |
| [ || [ |
| ] || ] ||