Beefy Boxes and Bandwidth Generously Provided by pair Networks
Come for the quick hacks, stay for the epiphanies.
 
PerlMonks  

Re: Re: Simplifying code (Not obfuscation)

by 2mths (Beadle)
on Mar 04, 2003 at 11:08 UTC ( [id://240288]=note: print w/replies, xml ) Need Help??


in reply to Re: Simplifying code (Not obfuscation)
in thread Simplifying code (Not obfuscation)

Thanks & WTF?! :-)

Me thinks some time studying this is required. If this isn't an example of obfuscation I don't think I'd want to see one.
  • Comment on Re: Re: Simplifying code (Not obfuscation)

Replies are listed 'Best First'.
Re: Re: Re: Simplifying code (Not obfuscation)
by Molt (Chaplain) on Mar 04, 2003 at 11:38 UTC

    Just in case you don't realise what was meant.. Golf is where Perl programmers try and get a reasonably simple task completed in the least number of (key)strokes. As such it's not quite obfuscation, but it's a very close relative.

    Golfing in everyday code is generally a very bad thing as it results in Perl that consists of streams of delicate logic which are very unreadable, and even less maintainable.

      I have met Golf before, though I don't play (for obvious reasons :-). Actually it was a private message explaining Golf in response to a post on beginners@perl or similar that directed me towards PMs

      Very interesting to read your post, probably even more interesting to finally understand it at some point.

      Forgive me if I don't emulate your solution in my code though :-)

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others avoiding work at the Monastery: (6)
As of 2024-04-19 07:51 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found