Beefy Boxes and Bandwidth Generously Provided by pair Networks
XP is just a number

Re: Specializing Functions with Currying

by stvn (Monsignor)
on Aug 06, 2004 at 16:30 UTC ( #380621=note: print w/replies, xml ) Need Help??

in reply to Specializing Functions with Currying


Nothing like a good meditation on functional programming to clean out the OOP cobwebs in ones head. Thanks :)

You could make your build_para sub even more Haskell-ish if you removed all assignment statements as well.

sub build_para { return $handlers{'para'}->(join "" => map { $handlers{$_->[0]}->($ +_->[1]) } @{$_[0]}); }
But if we are really gonna get functional, then we might as well make a generic build_HTML sub and use more recursive datastructures.
my @test_data_2 = ( 'para', [ ['none', 'The quick brown '], ['bold', 'fox'], ['none', ' jumped '], ['ital', 'over'], ['none', ' the lazy '], ['bold', 'dog'], ['none', '.'] ] ); sub build_HTML { join "" => map { (ref($_->[1]) eq "ARRAY") ? $handlers{$_->[0]}->(build_HTML(@{$_->[1]})) : $handlers{$_->[0]}->($_->[1]) } ref($_[0]) ? @_ : ([ @_ ]); } print build_HTML(@test_data_2);
We could then actually use build_HTML to compose the build_para subroutine.
*build_para = curry(\&build_HTML, 'para'); print build_para(\@test_data);


Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://380621]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others perusing the Monastery: (4)
As of 2017-11-20 03:22 GMT
Find Nodes?
    Voting Booth?
    In order to be able to say "I know Perl", you must have:

    Results (283 votes). Check out past polls.