Apache KafkaConditional Complexity
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).
Conditional Complexity Overall
- There are 17,006 units with 150,195 lines of code in units (70.7% of code).
- 4 very complex units (474 lines of code)
- 30 complex units (3,452 lines of code)
- 267 medium complex units (14,614 lines of code)
- 890 simple units (25,176 lines of code)
- 15,815 very simple units (106,479 lines of code)
Legend:
51+
26-50
11-25
6-10
1-5
Alternative Visuals
Conditional Complexity per Extension
Legend:
51+
26-50
11-25
6-10
1-5
Conditional Complexity per Logical Component
primary logical decomposition
Legend:
51+
26-50
11-25
6-10
1-5
Most Complex Units
Top 50 most complex units