net.sourceforge.pmd.rules.design
public class NpathComplexity extends StatisticalRule
Method Summary | |
---|---|
protected void | makeViolations(RuleContext ctx, Set<DataPoint> p) |
static int | sumExpressionComplexity(ASTExpression expr)
Calculate the boolean complexity of the given expression. |
Object | visit(ASTMethodDeclaration node, Object data) |
Object | visit(SimpleJavaNode node, Object data) |
Object | visit(ASTIfStatement node, Object data) |
Object | visit(ASTWhileStatement node, Object data) |
Object | visit(ASTDoStatement node, Object data) |
Object | visit(ASTForStatement node, Object data) |
Object | visit(ASTReturnStatement node, Object data) |
Object | visit(ASTSwitchStatement node, Object data) |
Object | visit(ASTTryStatement node, Object data) |
Object | visit(ASTConditionalExpression node, Object data) |
Note that this calculation applies to Cyclomatic Complexity as well.
Parameters: expr control structure expression
Returns: complexity of the boolean expression