Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked
 
PerlMonks  

binding a slurpy rw hash

by jonadab (Parson)
on Jun 08, 2003 at 20:31 UTC ( #264150=note: print w/ replies, xml ) Need Help??


in reply to Perl 6 feature that scares me the most:

The prospect of binding a slurpy rw hash worries me, because if it scares Larry, I figure there must be something frightening about it. I can imagine folks here on Perlmonks fooling around in the obfuscation section reminiscing about when obfuscated code was mostly a bunch of punctuation and you could just read it carefully and deobfuscate it in your head.

I'm also a little bit on edge about the whole subrule thing. I mean, that's powerful, sure, but it could be another way to make code hard to follow, also, because the subrules can be changed between calls of the main rule. I envision self-modifying code that breeds new generations of itself, tests them for efficiency and terseness, picks the "best", rince, repeat...

"Back in my day, anyone could deobfuscate a good JAPH in twenty minutes... we didn't have these fancy new-fangled recursive genetic JAPHs... those things turn your brain to mush, you know..."

OTOH, I'm thoroughly excited about the Perl6 object model.


{my$c;$ x=sub{++$c}}map{$ \.=$_->()}map{my$a=$_->[1]; sub{$a++ }}sort{_($a->[0 ])<=>_( $b->[0])}map{my@x=(& $x( ),$ _) ;\ @x} split //, "rPcr t lhuJnhea eretk.as o";print;sub _{ord(shift)*($=-++$^H)%(42-ord("\r"))};


Comment on binding a slurpy rw hash
Download Code

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://264150]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others imbibing at the Monastery: (6)
As of 2014-12-18 23:24 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    Is guessing a good strategy for surviving in the IT business?





    Results (68 votes), past polls