Sure? AFAIK lookups against a named hash are slower*, since they need a extra lookup against the symbol table or pad to locate its reference.
* the speed penalty is close to zero
In reply to Re^2: Faster Hash Slices
by shmem
in thread Faster Hash Slices
by jht
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |