microsoft / SPTAG
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 652 units with 11,589 lines of code in units (43.1% of code).
    • 2 very complex units (580 lines of code)
    • 10 complex units (1,390 lines of code)
    • 52 medium complex units (3,294 lines of code)
    • 64 simple units (1,890 lines of code)
    • 524 very simple units (4,435 lines of code)
5% | 11% | 28% | 16% | 38%
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
h5% | 8% | 25% | 19% | 41%
cpp7% | 11% | 36% | 14% | 30%
hxx0% | 24% | 25% | 9% | 41%
Conditional Complexity per Logical Component
primary logical decomposition
51+
26-50
11-25
6-10
1-5
AnnService/inc/SSDServing26% | 0% | 36% | 23% | 13%
AnnService/src/BalancedDataPartition29% | 27% | 37% | 4% | 1%
AnnService/inc/Core0% | 17% | 27% | 14% | 39%
AnnService/src/IndexSearcher0% | 76% | 23% | 0% | 0%
AnnService/src/Core0% | 0% | 31% | 20% | 48%
AnnService/src/SSDServing0% | 0% | 91% | 0% | 8%
AnnService/src/Helper0% | 0% | 93% | 0% | 6%
AnnService/src/IndexBuilder0% | 0% | 100% | 0% | 0%
AnnService/inc/Helper0% | 0% | 4% | 19% | 75%
AnnService/src/Client0% | 0% | 0% | 100% | 0%
AnnService/inc/Socket0% | 0% | 0% | 38% | 61%
Wrappers/src0% | 0% | 0% | 30% | 69%
Wrappers/inc0% | 0% | 0% | 0% | 100%
AnnService/src/Server0% | 0% | 0% | 0% | 100%
AnnService/src/Aggregator0% | 0% | 0% | 0% | 100%
Most Complex Units
Top 20 most complex units
Unit# linesMcCabe index# params
void Process()
in AnnService/src/BalancedDataPartition/main.cpp
246 62 1
void Search()
in AnnService/inc/SSDServing/SSDIndex.h
334 56 1
bool BuildIndex()
in AnnService/inc/Core/SPANN/ExtraFullGraphSearcher.h
191 49 3
int Process()
in AnnService/src/IndexSearcher/main.cpp
185 38 2
void OutputSSDIndexFile()
in AnnService/inc/Core/SPANN/ExtraFullGraphSearcher.h
169 33 9
void ProcessWithoutMPI()
in AnnService/src/BalancedDataPartition/main.cpp
134 32 0
hxx
__device__ void check_neighbors_RNG()
in AnnService/inc/Core/Common/cuda/KNN.hxx
69 30 9
hxx
void getTailNeighborsTPT()
in AnnService/inc/Core/Common/cuda/TailNeighbors.hxx
187 30 12
void PartitionByTptreeCore()
in AnnService/inc/Core/Common/NeighborhoodGraph.h
171 28 5
inline float MultipleClustersAssign()
in AnnService/src/BalancedDataPartition/main.cpp
91 28 10
hxx
__global__ void findRNG_strict()
in AnnService/inc/Core/Common/cuda/KNN.hxx
91 27 7
hxx
__global__ void findRNG_leaf_nodes()
in AnnService/inc/Core/Common/cuda/KNN.hxx
102 27 5
int BootProgram()
in AnnService/src/SSDServing/main.cpp
120 25 7
inline float KmeansAssign()
in AnnService/inc/Core/Common/BKTree.h
78 23 7
ErrorCode Bootstrap()
in AnnService/inc/SSDServing/SelectHead.h
113 23 1
ErrorCode Index::AddIndex()
in AnnService/src/Core/BKT/BKTIndex.cpp
60 23 6
ErrorCode Index::AddIndex()
in AnnService/src/Core/KDT/KDTIndex.cpp
60 23 6
ErrorCode Index::BuildIndexInternal()
in AnnService/src/Core/SPANN/SPANNIndex.cpp
82 23 1
virtual void SearchIndex()
in AnnService/inc/Core/SPANN/ExtraFullGraphSearcher.h
119 22 6
void SelectHeadStatically()
in AnnService/inc/SSDServing/SelectHead.h
146 22 4