facebookincubator / memory-analyzer
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 41 units with 374 lines of code in units (60.0% 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)
    • 7 simple units (128 lines of code)
    • 34 very simple units (246 lines of code)
0% | 0% | 0% | 34% | 65%
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% | 0% | 0% | 34% | 65%
Conditional Complexity per Logical Component
primary logical decomposition
51+
26-50
11-25
6-10
1-5
memory_analyzer0% | 0% | 0% | 31% | 68%
memory_analyzer/frontend0% | 0% | 0% | 37% | 62%
Most Complex Units
Top 41 most complex units
Unit# linesMcCabe index# params
13 8 2
18 8 1
13 7 2
15 7 1
25 7 2
18 6 2
26 6 2
12 5 3
9 4 1
21 4 1
9 3 2
13 3 2
10 3 2
9 3 1
32 3 2
7 3 1
8 2 1
4 2 2
4 2 2
5 2 2
4 2 0
6 2 3
7 2 1
6 2 5
5 2 2
11 1 4
2 1 1
6 1 2
10 1 1
3 1 1
3 1 1
2 1 1
2 1 3
2 1 3
2 1 1
7 1 3
2 1 0
2 1 0
10 1 0
3 1 2
8 1 0