Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask
 
PerlMonks  

Re^2: Cyclomatic Complexity of Perl code

by QM (Parson)
on Dec 08, 2004 at 18:47 UTC ( #413295=note: print w/replies, xml ) Need Help??


in reply to Re: Cyclomatic Complexity of Perl code
in thread Cyclomatic Complexity of Perl code

Reminds me of a quote I ran across earlier today:
If you torture data sufficiently, it will confess to almost anything. -Fred Menger, chemistry professor (1937- )

-QM
--
Quantum Mechanics: The dreams stuff is made of

  • Comment on Re^2: Cyclomatic Complexity of Perl code

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://413295]
help
Chatterbox?
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others exploiting the Monastery: (8)
As of 2017-06-23 06:18 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    How many monitors do you use while coding?















    Results (536 votes). Check out past polls.