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]

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}