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.