in reply to Re^3: Faster Hash Slices
in thread Faster Hash Slices
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^5: Faster Hash Slices
by BrowserUk (Patriarch) on Nov 28, 2013 at 14:35 UTC | |
The difference appears to be that a pad lookup requires a single opcode where dereferencing a hashref requires three opcodes:
With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.
| [reply] [d/l] |
by BrowserUk (Patriarch) on Nov 28, 2013 at 15:24 UTC | |
I made a mistake (used a global reference); the difference is one extra opcode, not two extra:
With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.
| [reply] [d/l] |