Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical
 
PerlMonks  

Re^8: Cyclomatic Complexity of Perl code

by EdwardG (Vicar)
on Jan 14, 2005 at 12:56 UTC ( [id://422223]=note: print w/replies, xml ) Need Help??


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

Yes of course there are examples that defy consistent evaluation by any given metric, and I thought we were in agreement that their misuse was dreadful, but you seem deaf to the idea that metrics are just clues, the answers lie in the code itself, and that without metrics there is nothing short of domain knowledge and production feedback that can help to distinguish one blob of code from from millions of others.

And just how much effort do you think it takes to run some code through a metric-gathering program?

 

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others contemplating the Monastery: (3)
As of 2024-03-29 06:08 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found