Re^3: Something eq hashref key

In a recent thread it was shown that hash slices are not faster than maps, exists on hash slices is not needed.

sub slex { my $h = shift; return map { exists $h->{$_} || 0 } @_ }

my %h = map { $_ => 1 } 'a'..'t';
my @bool = slex \%h, 'a'..'z';
print "@bool\n";
[download]

Comment on Re^3: Something eq hashref key Select or Download Code

Replies are listed 'Best First'.
Re^4: Something eq hashref key by LanX (Saint) on Mar 25, 2019 at 14:59 UTC
You must be joking! (?) The benchmark was about non intuitive performance of constant lists. Slices are 5 times faster than maps in this example, and the overhead of join is still included Cheers Rolf _{(addicted to the Perl Programming Language :) Wikisyntax for the Monastery FootballPerl is like chess, only without the dice}	[reply]


Welcome to the Monastery
	PerlMonks