Re: Benchmark: Constant List in Hash Slice

in reply to Benchmark: Constant List in Hash Slice

Your test, retrieving the full hash as a slice, looks strange to me. I think it is more meaningful to retrieve a few elements from a large hash, say 1% or 0.1% of the keys.

Comment on Re: Benchmark: Constant List in Hash Slice

Replies are listed 'Best First'.
Re^2: Benchmark: Constant List in Hash Slice by LanX (Saint) on Mar 13, 2019 at 13:13 UTC
The requirement in this case is to sort according to an array not cutting out a subset. Update And yes I know that using an array combined with enum constant indices are faster, but my concern here is about the strange side effect from inlining a constant list. Cheers Rolf _{(addicted to the Perl Programming Language :) Wikisyntax for the Monastery FootballPerl is like chess, only without the dice}	[reply]

Replies are listed 'Best First'.

Re^2: Benchmark: Constant List in Hash Slice
by LanX (Saint) on Mar 13, 2019 at 13:13 UTC

Update

And yes I know that using an array combined with enum constant indices are faster, but my concern here is about the strange side effect from inlining a constant list.

Cheers Rolf
_{(addicted to the Perl Programming Language :)

Wikisyntax for the Monastery
FootballPerl is like chess, only without the dice}

[reply]

In Section Seekers of Perl Wisdom