dart-lang / http_retry
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 6 units with 57 lines of code in units (28.8% 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)
    • 0 simple units (0 lines of code)
    • 6 very simple units (57 lines of code)
0% | 0% | 0% | 0% | 100%
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
dart0% | 0% | 0% | 0% | 100%
Conditional Complexity per Logical Component
primary logical decomposition
51+
26-50
11-25
6-10
1-5
lib0% | 0% | 0% | 0% | 100%
example0% | 0% | 0% | 0% | 100%
Most Complex Units
Top 6 most complex units
Unit# linesMcCabe index# params
bool Function()
in lib/http_retry.dart
9 1 1
bool Function()
in lib/http_retry.dart
13 1 1
required bool Function()
in lib/http_retry.dart
13 1 1
StreamedRequest _copyRequest()
in lib/http_retry.dart
13 1 2
void _unawaited()
in lib/http_retry.dart
1 1 1
Future main()
in example/example.dart
8 1 0