facebookresearch / body2hands
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 396 units with 14,549 lines of code in units (6.9% of code).
    • 7 very complex units (2,208 lines of code)
    • 12 complex units (1,851 lines of code)
    • 41 medium complex units (3,730 lines of code)
    • 53 simple units (1,790 lines of code)
    • 283 very simple units (4,970 lines of code)
15% | 12% | 25% | 12% | 34%
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
cpp13% | 11% | 30% | 11% | 32%
h31% | 19% | 24% | 3% | 21%
py11% | 11% | 15% | 19% | 43%
inl0% | 0% | 0% | 0% | 100%
Conditional Complexity per Logical Component
primary logical decomposition
51+
26-50
11-25
6-10
1-5
visualization/FitAdam/src13% | 12% | 29% | 11% | 33%
visualization/FitAdam/include31% | 19% | 24% | 3% | 21%
visualization/POF/data25% | 19% | 22% | 8% | 24%
visualization/POF/utils0% | 7% | 10% | 25% | 57%
visualization/FitAdam0% | 0% | 65% | 13% | 20%
utils0% | 0% | 14% | 6% | 78%
ROOT0% | 0% | 0% | 41% | 58%
visualization/POF/nets0% | 0% | 0% | 84% | 15%
smplx_plugin0% | 0% | 0% | 33% | 66%
Most Complex Units
Top 20 most complex units
Unit# linesMcCabe index# params
virtual bool Evaluate()
in visualization/FitAdam/include/FitCost.h
640 154 3
bool AdamFullCost::Evaluate()
in visualization/FitAdam/src/AdamFastCost.cpp
537 104 3
def __init__()
in visualization/POF/data/DomeReader.py
248 94 8
bool HandFastCost::Evaluate()
in visualization/FitAdam/src/HandFastCost.cpp
391 92 3
def __init__()
in visualization/POF/data/DomeReaderTempConst.py
177 66 8
bool PoseToTransform_AdamFull_withDiff::Evaluate()
in visualization/FitAdam/src/pose_to_transforms.cpp
139 55 3
bool PoseToTransformsNoLR_Eulers_adamModel_withDiff::Evaluate()
in visualization/FitAdam/src/pose_to_transforms.cpp
76 53 3
void toggle_activate()
in visualization/FitAdam/include/AdamFastCost.h
80 37 3
def get()
in visualization/POF/data/BaseReader.py
191 33 7
void Renderer::MeshRender()
in visualization/FitAdam/src/Renderer_old.cpp
259 33 0
void Renderer::MeshRender()
in visualization/FitAdam/src/Renderer.cpp
258 33 0
def detect_keypoints2d_PAF()
in visualization/POF/utils/PAF.py
95 32 6
bool AdamFastCost::Evaluate()
in visualization/FitAdam/src/AdamFastCost.cpp
159 32 3
def get()
in visualization/POF/data/Base2DReader.py
131 31 5
void Renderer::SimpleRenderer()
in visualization/FitAdam/src/Renderer_old.cpp
176 28 0
void Renderer::SimpleRenderer()
in visualization/FitAdam/src/Renderer.cpp
176 28 0
void UpdateTarget()
in visualization/FitAdam/include/AdamFastCost.h
120 27 0
void SetupCost()
in visualization/FitAdam/include/FitCost.h
139 27 0
bool operator()
in visualization/FitAdam/include/pose_to_transforms.h
67 27 0
def get()
in visualization/POF/data/TempConstReader.py
180 25 5