github / gh-gei
Conditional Complexity

The distribution of complexity of units (measured with McCabe index).

Intro
  • Conditional complexity (also called cyclomatic complexity) is a term used to measure the complexity of software. The term refers to the number of possible paths through a program function. A higher value ofter means higher maintenance and testing costs (infosecinstitute.com).
  • Conditional complexity is calculated by counting all conditions in the program that can affect the execution path (e.g. if statement, loops, switches, and/or operators, try and catch blocks...).
  • Conditional complexity is measured at the unit level (methods, functions...).
  • Units are classified in four categories based on the measured McCabe index: 1-5 (simple units), 6-10 (medium complex units), 11-25 (complex units), 26+ (very complex units).
Learn more...
Conditional Complexity Overall
  • There are 186 units with 3,146 lines of code in units (77.5% of code).
    • 0 very complex units (0 lines of code)
    • 0 complex units (0 lines of code)
    • 2 medium complex units (165 lines of code)
    • 5 simple units (218 lines of code)
    • 179 very simple units (2,763 lines of code)
0% | 0% | 5% | 6% | 87%
Legend:
51+
26-50
11-25
6-10
1-5
Alternative Visuals
Conditional Complexity per Extension
51+
26-50
11-25
6-10
1-5
cs0% | 0% | 5% | 6% | 87%
Conditional Complexity per Logical Component
primary logical decomposition
51+
26-50
11-25
6-10
1-5
src0% | 0% | 5% | 6% | 87%
Most Complex Units
Top 50 most complex units
Unit# linesMcCabe index# params
94 19 11
71 14 6
30 8 6
49 7 7
64 7 8
37 6 4
38 6 2
24 5 7
18 5 3
21 4 3
24 4 4
19 4 3
18 4 2
10 4 0
34 4 3
10 4 0
14 4 1
16 4 3
38 4 2
27 3 4
30 3 4
40 3 5
29 3 4
14 3 1
31 3 4
29 3 4
14 3 1
15 3 1
15 3 1
11 3 1
12 3 1
7 3 1
41 3 9
13 3 1
13 2 1
6 2 3
6 2 3
6 2 3
6 2 4
11 2 3
6 2 6
6 2 4
17 2 1
6 2 1
6 2 1
15 2 0
17 2 1
8 2 3
6 2 3
16 2 1