Lines Matching +full:method +full:- +full:complexity
1 <?xml version="1.0" encoding="UTF-8" ?>
2 <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-st…
5 <meta http-equiv="Content-Type" content="text/html; charset=UTF-8" />
6 <link rel="stylesheet" href="resources/doc.css" charset="UTF-8" type="text/css" />
8 <title>JaCoCo - Coverage Counter</title>
25 optionally embedded in class files. This approach allows efficient on-the-fly
51 branches in a method and determines the number of executed or missed branches.
69 <h2>Cyclomatic Complexity</h2>
72 JaCoCo also calculates cyclomatic complexity for each non-abstract method and
73 summarizes complexity for classes, packages and groups. According to its
76 cyclomatic complexity is the minimum number of paths that can, in (linear)
77 combination, generate all possible paths through a method. Thus the
78 complexity value can serve as an indication for the number of unit test cases
79 to fully cover a certain piece of software. Complexity figures can always be
84 The formal definition of the cyclomatic complexity v(G) is based on the
85 representation of a method's control flow graph as a directed graph:
90 v(G) = E - N + 2
96 cyclomatic complexity of a method with the following equivalent equation based
102 v(G) = B - D + 1
108 missed complexity for each method. Missed complexity again is an indication
111 also not increase complexity.
150 Each non-abstract method contains at least one instruction. A method is