google / ihmehimmeli
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 133 units with 2,598 lines of code in units (70.3% of code).
    • 0 very complex units (0 lines of code)
    • 0 complex units (0 lines of code)
    • 11 medium complex units (880 lines of code)
    • 25 simple units (790 lines of code)
    • 97 very simple units (928 lines of code)
0% | 0% | 33% | 30% | 35%
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
cc0% | 0% | 36% | 31% | 31%
h0% | 0% | 0% | 13% | 86%
Conditional Complexity per Logical Component
primary logical decomposition
51+
26-50
11-25
6-10
1-5
tempcoding0% | 0% | 33% | 30% | 35%
Most Complex Units
Top 20 most complex units
Unit# linesMcCabe index# params
101 24 4
void Main()
in tempcoding/tempcoding_main.cc
309 22 2
int SpikingProblem::InitialiseNInputs()
in tempcoding/spiking_problem.cc
58 14 1
VectorXd Tempcoder::AdjustInput()
in tempcoding/tempcoder.cc
77 14 5
double LambertW0InitialGuess()
in tempcoding/lambertw.cc
26 13 1
void PrintGradientLandscape()
in tempcoding/gradient_landscape_helper.cc
123 12 9
int SpikingProblem::InitialiseNOutputs()
in tempcoding/spiking_problem.cc
24 12 1
64 12 1
std::tuple RandomParametersLike()
in tempcoding/gradient_landscape_helper.cc
33 11 3
void SpikingProblem::LoadExamplesIfRequired()
in tempcoding/spiking_problem.cc
37 11 1
void Tempcoder::AddJittering()
in tempcoding/tempcoder.cc
28 11 2
void Tempcoder::ComputeGradients()
in tempcoding/tempcoder.cc
55 10 9
std::tuple LinearCombinationWeights()
in tempcoding/gradient_landscape_helper.cc
32 9 6
absl::string_view ProblemTypeToString()
in tempcoding/spiking_problem.cc
20 9 1
ProblemType ParseProblemType()
in tempcoding/spiking_problem.cc
24 9 1
42 9 3
void SpikingProblem::GenerateExamples()
in tempcoding/spiking_problem.cc
36 9 4
void AppendConvLikeInputs()
in tempcoding/spiking_problem.cc
43 9 3
44 9 10
void Tempcoder::DrawNetwork()
in tempcoding/tempcoder.cc
24 9 0