in reply to Re^2: Fastest way to lookup a point in a set
in thread Fastest way to lookup a point in a set
Interesting, I think that's because you address the points separately in multi (2 lookups) while join can optimize over an array (one list returned)
Maybe try to see how it compares with join over 2 elements.
I wouldn't be surprised if the result is equally fast. Multi dimensional hashes are an old (Perl 4) but somehow obscure feature. They probably never optimized it over the equivalence to join.
Cheers Rolf
(addicted to the Perl Programming Language and ☆☆☆☆ :)
Je suis Charlie!
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^4: Fastest way to lookup a point in a set
by swl (Prior) on Aug 07, 2017 at 09:19 UTC | |
by LanX (Saint) on Aug 07, 2017 at 10:17 UTC | |
by swl (Prior) on Aug 07, 2017 at 23:53 UTC |