in reply to How A Function Becomes Higher Order
Since closures are just another way of implementing encapsulation and re-use, I think it would behoove the programmer to choose the most appropriate elements of the program to refactor using this technique. In the case of your example, I think a better choice would be to "higher-order"ify the file accessing bits, since that's the most general-purpose part, and is likely to have the greater pay-off in terms of re-use. That's not to say that a max() function couldn't as well, but it seems to me to be the more application-specific algorithmic part.
Btw - I don't get the argument that named parameters aid extensibility. I frankly don't see any extensibility in this mechanism. Can you show how it would be done?sub with_file_do { my( $filename, $each_line_cb ) = @_; my $fh = new IO::File "< $filename" or die "read $filename - $!"; chomp, $each_line_cb->($_) while <$fh>; } my $max; with_file_do( $scores_file, sub { my( $score ) = @_; !defined $max || $max < $score and $max = $score; } ); print "max=$max\n";
|
---|
Replies are listed 'Best First'. | |
---|---|
Re^2: How A Function Becomes Higher Order
by Limbic~Region (Chancellor) on Sep 16, 2005 at 18:22 UTC | |
by jdporter (Paladin) on Sep 16, 2005 at 18:51 UTC | |
by adrianh (Chancellor) on Sep 22, 2005 at 08:56 UTC | |
by blazar (Canon) on Sep 19, 2005 at 14:08 UTC | |
Re^2: How A Function Becomes Higher Order
by Anonymous Monk on Sep 16, 2005 at 19:56 UTC |
In Section
Tutorials