GerritCodeReview / gerrit-release-tools
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 4 units with 301 lines of code in units (94.4% of code).
    • 0 very complex units (0 lines of code)
    • 1 complex units (213 lines of code)
    • 0 medium complex units (0 lines of code)
    • 1 simple units (76 lines of code)
    • 2 very simple units (12 lines of code)
0% | 70% | 0% | 25% | 3%
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
py0% | 70% | 0% | 25% | 3%
Conditional Complexity per Logical Component
primary logical decomposition
51+
26-50
11-25
6-10
1-5
ROOT0% | 70% | 0% | 25% | 3%
Most Complex Units
Top 4 most complex units
Unit# linesMcCabe index# params
def _main()
in abandon_stale.py
 213 32 0
def _main()
in release-announcement.py
 76 8 0
def __init__()
in release-announcement.py
 10 2 2
def __str__()
in release-announcement.py
 2 1 1