Your skill will accomplishwhat the force of many cannot PerlMonks

### Re^2: Transform Sequence Problem

by hdb (Prior)
 on Jun 19, 2013 at 14:45 UTC ( #1039787=note: print w/replies, xml ) Need Help??

in reply to Re: Transform Sequence Problem

A few minor changes I like:

• Using a hash instead an array of code refs allows to give names to the transformations.
• A bit of error checking can be added, unknown transformations can be ignored and warned about.
• Instead of passing the indices into the closure, it is more efficient to pass the code references into it. This will generate no additional overhead from the niceties added to the generator function.
It could look like this:

```use strict;
use warnings;

sub fgenerator {
my %f = (
add_one => sub {map {\$_ + 1} @_},
log     => sub {map {log(\$_)} @_},
times_3 => sub {map {\$_ * 3} @_},
);
my @t = @f{ grep { exists \$f{\$_} } @_ }; # ignore unknown name
+s
warn "Don't know sub(s) ".join ", ",(grep { !exists \$f{\$_} } @
+_) if @t < @_;
return sub { @_ = \$_->(@_) for @t; return @_; };
}

my \$trans1 = fgenerator qw( add_one log times_3 );

my @data = (1, 2, 3);
my @trans = \$trans1->( @data );
print "@trans\n";
@trans = \$trans2->( @data );
print "@trans\n";

Replies are listed 'Best First'.
Re^3: Transform Sequence Problem
by hdb (Prior) on Jun 22, 2013 at 16:55 UTC

Something was missing, now I know:

```think_of_a_number => sub {map {rand \$_} @_},

Create A New User
Node Status?
node history
Node Type: note [id://1039787]
help
Chatterbox?
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others chilling in the Monastery: (4)
As of 2017-08-19 18:09 GMT
Sections?
Information?
Find Nodes?
Leftovers?
Voting Booth?
Who is your favorite scientist and why?

Results (312 votes). Check out past polls.

Notices?