Apache PigConditional 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 11,738 units with 118,869 lines of code in units (75.9% of code).
- 11 very complex units (3,050 lines of code)
- 60 complex units (6,457 lines of code)
- 411 medium complex units (22,367 lines of code)
- 857 simple units (23,245 lines of code)
- 10,399 very simple units (63,750 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
backend logical decomposition
Legend:
51+
26-50
11-25
6-10
1-5
Most Complex Units
Top 50 most complex units