And if you had 10 arrays you'd want to keep that hash up to date? 20? 30?
(Of course not, you'd use a HoA and not screw with this in the first place. :)
That being said, in this specific case of just a and b I'd personally have probably used something like BrowserUK's @{ $1 eq 'a' ? \@a : \@b} below; but the eval's more flexible if you have a large number of destinations (then again with a large number of destinations you'd probably want an HoA). Of course at the moment I'd be more likely to just use Enumerable#partition and be done with it, but that's another language all together.
In reply to Re^3: Can this code be optimized further?
by Fletch
in thread Can this code be optimized further?
by samy_kumar
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |