openai / openai-java 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...
- To learn more about conditional complexity and techniques for reducing this type of complexity, Sokrates recommends the following resources:
- Simplifying Conditional Expressions, sourcemaking.com
- Cyclomatic Complexity, wikipedia.org
Conditional Complexity Overall
- There are 336 units with 2,385 lines of code in units (31.5% of code).
- 0 very complex units (0 lines of code)
- 0 complex units (0 lines of code)
- 0 medium complex units (0 lines of code)
- 3 simple units (97 lines of code)
- 333 very simple units (2,288 lines of code)
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
Conditional Complexity per Logical Component
primary logical decomposition
Most Complex Units
Top 50 most complex units
