Stuff with the Perl Foundation. A couple of patches in the Perl core. A few CPAN modules. That about sums it up.
I've spent a bit of time translating a small Ruby program to Perl. If you've not actually programmed in Ruby before, it's an interesting language and not all idioms translate well to Perl. There are no strictures, so variables pop into existence upon first use. Hope you don't misspell them!
Curiously, though, that seems to eliminate one (minor) nit I've always had: the declaration of recursive anonymous functions. Consider this Perl:
my $fact = sub {
my $num = shift;
return $num < 2 ? 1 : $num * $fact->($num - 1);
};
That doesn't actually work because $fact doesn't exist at the time you call it. So you need to do this:
my $fact;
$fact = sub {
my $num = shift;
return $num < 2 ? 1 : $num * $fact->($num - 1);
};
Now, depending on whether or not you like the ternary operator, this is straightforward, idiomatic Perl. It's also just a tad ugly, having to declare that variable before you can use it. Here's the Ruby equivalent:
fact = proc { |num|
return num < 2 ? 1 : num * fact[num - 1]
}
Also, I liked this really nifty local redefining of the << operator (typically this is the Ruby equivalent of 'push'):
def <<(rhs)
case rhs
when Array
fact(*rhs)
else
fact(rhs)
end
end
While without context it doesn't mean much, it does simplify some of the code interacting with the object this is redefined for.
Now I'm tangling with the 'yield' keyword. I know what it does, but translating it idiomatically to Perl is interesting.
Any Ruby equivalent of perldoc -f?
See? (Score:1)
So you simply use the Y combinator [perl.org]. :-)
Re: (Score:2)
I had thought of that when I was writing this, but I confess that I never really understood why people were so hot and bothered about the Y combinator. There's a point when complexity overrides functionality. That being said, it may simply be a case of my being dense, but an awful lot of smart people seem to struggle with this :)
Re: (Score:1)
Complexity of what? The Y combinator is easy to use: you return the recursive closure from another closure; the first argument of the outer closure can be used in the inner closure to return. That’s it.
The difficulty is in deriving the exact form of the combinator (which, of course, is a bit of brain-melt, which is why it’s become a sort of sport), not in using it.
Re: (Score:1)
Err, the first argument of the outer closure can be used in the inner closure to recurse.
You saw rubyisms? (Score:2)
Re: (Score:2)
I'm working with the 'yield' function from that now. And thanks for the tip about 'ri'. Very useful!
Re: (Score:2)
Actually, I can't seem to use your 'yield' as a direct translation. I'm missing something fundamental. I put together this in Ruby (very similar to my actual problem):
Sub::Current for the Win! (Score:1)
See, this is exactly why I love Perl, cause there is always a something on CPAN that will make your life easier.
- Stevan
Re: (Score:2)
That's great, but solve my 'yield' problem and I'll really love you :)
Re: (Score:1)
Well, all the "yield" and "block" stuff is just sugar around your basic continuation passing. So here is the translation of what the ruby is actually doing.
Re: (Score:1)
I took the dog for a walk and thought about this a bit and realized where my scoping issue was. Here is a sugared version, probably could be a little cleaner still, maybe even with some subroutine attributes (sub foo : continuation { ... } or something).
Re: (Score:2)
Damn. I am doing the bit with passing around the sub, but it really does read like what you've done is much cleaner and actually makes it read like Ruby.
Re: (Score:1)
Actually took a look into rubyisms, I think that is just another case of Cozens "egoware" (only one version ever released and not meant to actually be used, only for people to look at and go "wow"). All the DB:: fiddling means it is bound to be very fragile with things like eval, etc.
RE: reading like Ruby
I actually find the desugared perl one to be the most readable since it doesn't obscure what is actually being done.
- Stevan
yieldness (Score:1)
use strict;
use Coro::Generator;
{
package Foo;
sub new { bless { val => $_[1] } => $_[0] }
sub inc { $_[0]->{val} += $_[1] }
sub val { shift->{val} }
}
my $inner_testy = generator {
my $foo = pop;
foreach my $item (@_) {