I believe array indexing is a bit faster than hash lookup - certainly where scaling matters. For small structures like you have, you'll never notice the difference.
The Benchmark module is handy for testing such questions on real code. Don't worry about it until you know you have a performance problem.
After Compline,
Zaxo
In reply to Re: Which, if any, is faster?
by Zaxo
in thread Which, if any, is faster?
by rvosa
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |