net.sourceforge.pmd.rules.design

Class NpathComplexity

public class NpathComplexity extends StatisticalRule

NPath complexity is a measurement of the acyclic execution paths through a function. See Nejmeh, Communications of the ACM Feb 1988 pp 188-200.

Author: Jason Bennett

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)

Method Detail

makeViolations

protected void makeViolations(RuleContext ctx, Set<DataPoint> p)

sumExpressionComplexity

public static int sumExpressionComplexity(ASTExpression expr)

Calculate the boolean complexity of the given expression. NPath boolean complexity is the sum of && and || tokens. This is calculated by summing the number of children of the &&'s (minus one) and the children of the ||'s (minus one).

Note that this calculation applies to Cyclomatic Complexity as well.

Parameters: expr control structure expression

Returns: complexity of the boolean expression