long version construction and short analog in Perl
|
Merge Hash slow (merge %score into %league)
%league = (%league, %score);
|
|
Merge Hash faster
%league{keys %score} = values %score;
|
|
Write array to file. use File::Slurp qw( :std );
my @vip_array_out = map { "$_\n" } @vip_array;
|
|
the same
my $vip_string_out = join "\n", @vip_array;
|
|
slow
write_file( 'file', @vip_array_out );#
|
|
faster
write_file( 'file', \@vip_array_out );#
|
|
faster then $vip_string_out
write_file( 'file', \$vip_string_out );
|
|
Split by WORD
my @words = split /\W+/, @input_lines;
|
|
Get unique words
my %seen; map { $seen{$_}++ } @words;
|
|
Sort the words in ascending ASCII order in the output
for my $word ( sort keys %seen ) { say "for $word $seen{$word}"; }
|
|
Save hash in insert order
use Tie::IxHash;
|
|
tie %sort_seen, "Tie::IxHash";
use Data::Dumper;
|
|
$Data::Dumper::Terse = 1;
map { $sort_seen{$_} = $seen{$_} } sort keys %seen;
|
|
print Dumper \%sort_seen;
|
|
array slice
($him, $her) = @folks[0,-1];
|
|
@them = @folks[0 .. 3];
|
|
hash slice
($who, $home) = @ENV{"USER", "HOME"};
|
|
list slice
($uid, $dir) = (getpwnam("daemon"))[2,7];
|
|
@days[3..5] = qw/Wed Thu Fri/;
@colors{'red','blue','green'} = (0xff0000, 0x0000ff, 0x00ff00);
|
|
@folks[0, -1] = @folks[-1, 0];
|
No comments yet.
Cheatography n. The art of mapping complex subjects into clear, instantly navigable reference guides.