microsoft / UVAtlas
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 644 units with 25,968 lines of code in units (70.8% of code).
    • 6 very complex units (2,540 lines of code)
    • 16 complex units (2,133 lines of code)
    • 113 medium complex units (10,056 lines of code)
    • 119 simple units (5,240 lines of code)
    • 390 very simple units (5,999 lines of code)
9% | 8% | 38% | 20% | 23%
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
cpp10% | 8% | 40% | 21% | 18%
hpp0% | 0% | 14% | 4% | 80%
inl0% | 0% | 14% | 10% | 75%
h0% | 0% | 0% | 7% | 92%
Conditional Complexity per Logical Component
primary logical decomposition
51+
26-50
11-25
6-10
1-5
UVAtlasTool54% | 13% | 16% | 7% | 6%
UVAtlas/geodesics46% | 16% | 9% | 3% | 23%
UVAtlas/isochart<1% | 6% | 44% | 23% | 24%
UVAtlas0% | 0% | 0% | 0% | 100%
Most Complex Units
Top 20 most complex units
Unit# linesMcCabe index# params
int __cdecl wmain()
in UVAtlasTool/UVAtlas.cpp
 923 207 2
HRESULT Mesh::ExportToSDKMESH()
in UVAtlasTool/Mesh.cpp
 554 98 8
void CExactOneToAll::InternalRun()
in UVAtlas/geodesics/ExactOneToAll.cpp
 387 73 0
HRESULT Mesh::ExportToCMO()
in UVAtlasTool/Mesh.cpp
 291 69 3
void CApproximateOneToAll::CutHeapTopData()
in UVAtlas/geodesics/ApproximateOneToAll.cpp
 279 58 1
void CUVAtlasRepacker::UpdateSpaceInfo()
in UVAtlas/isochart/UVAtlasRepacker.cpp
 106 53 1
void CExactOneToAll::IntersectWindow()
in UVAtlas/geodesics/ExactOneToAll.cpp
 234 37 6
HRESULT CIsochartMesh::ProcessPlaneLikeShape()
in UVAtlas/isochart/meshpartitionchart.cpp
 207 35 3
HRESULT Mesh::Clean()
in UVAtlasTool/Mesh.cpp
 131 34 1
120 33 14
HRESULT Mesh::VertexRemap()
in UVAtlasTool/Mesh.cpp
 106 32 2
111 30 12
static HRESULT GenerateAccumulationLines()
in UVAtlas/isochart/imtcomputation.cpp
 132 30 3
HRESULT UVAtlasPartitionInt()
in UVAtlas/isochart/UVAtlas.cpp
 170 29 1
HRESULT Mesh::SetVertexData()
in UVAtlasTool/Mesh.cpp
 120 28 2
HRESULT Mesh::GetVertexBuffer()
in UVAtlasTool/Mesh.cpp
 92 28 1
97 27 10
bool CIsochartMesh::OptimizeVertexStretchAroundCenter()
in UVAtlas/isochart/meshoptimizestretch.cpp
 182 27 2
static bool IsB1OnClockwiseDirOfB2AtEnd()
in UVAtlas/isochart/packingcharts.cpp
 116 27 4
bool CProgressiveMesh::IsProgressiveMeshToplogicValid()
in UVAtlas/isochart/progressivemesh.cpp
 77 27 3