in reply to Re: Faster Hash Slices
in thread Faster Hash Slices
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
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^3: Faster Hash Slices
by BrowserUk (Patriarch) on Nov 28, 2013 at 14:02 UTC | |
by shmem (Chancellor) on Nov 28, 2013 at 15:39 UTC | |
by choroba (Cardinal) on Nov 28, 2013 at 14:18 UTC | |
by BrowserUk (Patriarch) on Nov 28, 2013 at 14:35 UTC | |
by BrowserUk (Patriarch) on Nov 28, 2013 at 15:24 UTC | |
|
Re^3: Faster Hash Slices
by tobyink (Canon) on Nov 28, 2013 at 14:23 UTC |