Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery

Re: First Attempt

by perldeveloper (Scribe)
on Jul 28, 2004 at 15:07 UTC ( [id://378064]=note: print w/replies, xml ) Need Help??

in reply to First Attempt

The flow is easy to read, the idea behind it is rather obvious (although i'm not saying it's not interesting, I think it is neat), and there are too many redundancies. I don't mean to seem like a jacka$$ or anything, but this does not seem like obfuscation -- in my honest opinion.

Well, to really make my point, I've spent some time myself rewriting exactly your idea with my own concepts of obfuscation, meaning this is a bit closer to what I believe obfuscation is about:
print join ' ', ( map{$,=~s &$\&&& while s;[$,,];;;[$,=$_]->[/i/]}@{[qw] ice justice tan,south,jer, nor,the,pearl, her,packer ]]}) [1..4];

Replies are listed 'Best First'.
Re^2: First Attempt
by maetrics (Sexton) on Jul 28, 2004 at 23:05 UTC
    thank you,
    your example is great. I'll keep working on the techniques.
    thanks for the comment.
      Don't mention it, glad you didn't take it the wrong way.

Log In?

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

How do I use this?Last hourOther CB clients
Other Users?
Others chanting in the Monastery: (3)
As of 2024-04-25 05:21 GMT
Find Nodes?
    Voting Booth?

    No recent polls found