Programming Tutorials Browser Tutorials Articles Struts Tutorials Hibernate Tutorials

  Tutorial: Code Improvement Through Cyclomatic Complexity

Code Improvement Through Cyclomatic Complexity Software metrics often receive negative criticism, as they are viewed as an exact science, uniformly applicable to all scenarios. True, software metrics are an unbiased, objective measurement of a particul

Tutorial Details:

Determining Cyclomatic Complexity
There are various commercial and open source software metrics tools on the market that can examine source code and report on the gamut of software metrics. One such tool, which happens to be open source, is PMD.

Running PMD against a code base is quite easy (see this article by Tom Copeland). Upon examining the code, PMD will produce a report in various forms, such as XML and HTML, that describes the various customizable infractions found.


 

Read Tutorial at: Click here to view the tutorial

Rate Tutorial:
Code Improvement Through Cyclomatic Complexity

View Tutorial:
Code Improvement Through Cyclomatic Complexity

Related Tutorials:

Build your own caching mechanisms with volatile collections - JavaWorld June 1999
Build your own caching mechanisms with volatile collections - JavaWorld June 1999
 
XML JavaBeans, Part 3 - JavaWorld July 1999
XML JavaBeans, Part 3 - JavaWorld July 1999
 
Create forward-compatible beans in EJB, Part 1 - JavaWorld December 1999
Create forward-compatible beans in EJB, Part 1 - JavaWorld December 1999
 
One, two, three, or n tiers? - JavaWorld January 2000
One, two, three, or n tiers? - JavaWorld January 2000
 
Process XML with JavaBeans, Part 3 - JavaWorld January 2000
Process XML with JavaBeans, Part 3 - JavaWorld January 2000
 
Alternative deployment methods, Part 1: Beyond applets - JavaWorld May 2000
Alternative deployment methods, Part 1: Beyond applets - JavaWorld May 2000
 
Code generation using Javadoc - JavaWorld August 2000
Code generation using Javadoc - JavaWorld August 2000
 
Solve your servlet-based presentation problems - JavaWorld November 2000
Solve your servlet-based presentation problems - JavaWorld November 2000
 
Explore the Dynamic Proxy API
Explore the Dynamic Proxy API
 
Reflection vs. code generation
Reflection vs. code generation
 
I want my AOP!, Part 1
I want my AOP!, Part 1
 
Put Java in the fast lane
Put Java in the fast lane
 
My kingdom for a good timer!
My kingdom for a good timer!
 
roots of constants classes
roots of constants classes
 
Practical Reflection: an excerpt from Hardcore Java
Practical Reflection: an excerpt from Hardcore Java In this chapter from Hardcore Java, "Practical Reflection," Robert Simmons Jr. writes: "Reflection is one of the least understood aspects of Java, but also one of the most powerful. Reflection is used i
 
JAligner
JAligner JAligner is an open source Java implementation of the Smith-Waterman algorithm with Gotoh's improvement for biological local pairwise sequence alignment using the affine gap penalty model.
 
Simple classes for JDBC
Simple classes for JDBC
 
Code Improvement Through Cyclomatic Complexity
Code Improvement Through Cyclomatic Complexity Software metrics often receive negative criticism, as they are viewed as an exact science, uniformly applicable to all scenarios. True, software metrics are an unbiased, objective measurement of a particul
 
Build scripts with Groovy and Ant
Build scripts with Groovy and Ant Summary In nearly all developers' toolboxes, Ant is the standard build tool for Java applications, thanks to its open, standard, and multiplatform structure. Though it represents a great improvement in automating produc
 
This tutorial shows how to Combine the power of XPath and JSP tag libraries
In this article, we'll examine the XPath custom tag library for JSPs and see a tag collection that provides simple control constructs and a uniform attribute value substitution facility, all of which combine to reduce complexity and improve functionality.
 
Site navigation
 

 

Send your comments, Suggestions or Queries regarding this site at roseindia_net@yahoo.com.

Copyright © 2006. All rights reserved.