View by Classes

Findings - Overview

code-style NPathComplexity (PMD)

The NPath complexity of a method is the number of acyclic execution paths through that method. A threshold of 200 is generally considered the point where measures should be taken to reduce complexity.

 
 public class Foo {
  void bar() {
   // lots of complicated code
  }
 }
 
    

Additional info can be found at this http://pmd.sourceforge.net/rules/codesize.html#NPathComplexity site.