Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw
 
PerlMonks  

Re^2: Difficult code (Resolutions)

by jdporter (Canon)
on Mar 21, 2005 at 17:49 UTC ( #441249=note: print w/replies, xml ) Need Help??


in reply to Re: Agreed!
in thread Difficult code (Resolutions)

I would consider any code that's too complex to be understood without comments to be broken :-)

Exactly right (smileys not withstanding) — at least from the developer's point of view.

Not only do you run the danger of ending up with a big ball of mud, but as a maintainer, you'll become increasingly guilty of voodoo chicken coding.

XP sez: Refactor Mercilessly!

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://441249]
help
Chatterbox?
[1nickt]: choroba Updated the PR, using Config instead of exposing the hackery. Using cpanfile-dump does not work to test, as shown in the earlier PR comment, even when using a binary built for a particular Perlbrew perl, the output seems to be

How do I use this? | Other CB clients
Other Users?
Others chilling in the Monastery: (15)
As of 2017-10-18 16:03 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    My fridge is mostly full of:

















    Results (249 votes). Check out past polls.

    Notices?