twitter / labella.jsConditional Complexity

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 135 units with 1,413 lines of code in units (77.3% of code).

0 very complex units (0 lines of code)
0 complex units (0 lines of code)
1 medium complex units (52 lines of code)
12 simple units (300 lines of code)
122 very simple units (1,061 lines of code)

Legend:

51+

26-50

11-25

6-10

1-5

Alternative Visuals

3D view of all units

Conditional Complexity per Extension

51+

26-50

11-25

6-10

1-5

Conditional Complexity per Logical Component

primary logical decomposition

51+

26-50

11-25

6-10

1-5

Most Complex Units

Top 50 most complex units

Unit	# lines	McCabe index	# params
overlap: function() in src/core/distributor.js	52	11	1
metrics.overflowSpace = function() in src/core/metrics.js	27	10	3
function removeOverlap() in src/core/removeOverlap.js	51	10	2
Solver.prototype.mostViolated = function() in src/lib/vpsc.js	22	10	0
Solver.prototype.satisfy = function() in src/lib/vpsc.js	59	10	0
distributor.distribute = function() in src/core/distributor.js	21	8	1
SortedList.prototype.key = function() in src/lib/sortedList.js	8	8	2
function _rangeSearch() in src/lib/intervalTree.js	32	7	3
SortedList.prototype.bsearch = function() in src/lib/sortedList.js	15	7	1
SortedList.prototype.keys = function() in src/lib/sortedList.js	16	7	2
function IntervalTree() in src/lib/intervalTree.js	13	6	2
function _pointSearch() in src/lib/intervalTree.js	22	6	3
SortedList.prototype.unique = function() in src/lib/sortedList.js	14	6	1
Renderer.prototype.layout = function() in src/core/renderer.js	44	5	1
Renderer.prototype.generatePath = function() in src/core/renderer.js	25	5	1
metrics.overDensitySpace = function() in src/core/metrics.js	11	5	4
metrics.overlapCount = function() in src/core/metrics.js	15	5	2
metrics.overlapSpace = function() in src/core/metrics.js	14	5	1
compare: function() in src/lib/intervalTree.js	6	5	2
function _insert() in src/lib/intervalTree.js	15	5	2
compare: function() in src/lib/intervalTree.js	6	5	2
compare: function() in src/lib/intervalTree.js	6	5	2
Block.prototype.findMinLMBetween = function() in src/lib/vpsc.js	9	5	2
Block.prototype.isActiveDirectedPathBetween = function() in src/lib/vpsc.js	11	5	2
Renderer.prototype.getWaypoints = function() in src/core/renderer.js	42	4	1
force.options = function() in src/core/force.js	13	4	1
IntervalTree.prototype.add = function() in src/lib/intervalTree.js	17	4	2
IntervalTree.prototype.search = function() in src/lib/intervalTree.js	16	4	2
function Interval() in src/lib/intervalTree.js	12	4	4
Block.prototype.findMinLM = function() in src/lib/vpsc.js	8	4	0
Block.prototype.findPath = function() in src/lib/vpsc.js	11	4	4
SortedList.prototype.insertOne = function() in src/lib/sortedList.js	7	4	1
function layout() in evaluation/v0_vs_v1.js	30	3	4
function run() in evaluation/v0_vs_v1.js	15	3	3
simple: function() in src/core/distributor.js	17	3	1
function toLayers() in src/core/metrics.js	3	3	1
metrics.displacement = function() in src/core/metrics.js	9	3	1
metrics.pathLength = function() in src/core/metrics.js	9	3	1
getPathToRootLength() in src/core/node.js	10	3	0
Interval.prototype.result = function() in src/lib/intervalTree.js	14	3	2
function Variable() in src/lib/vpsc.js	8	3	3
Variable.prototype.visitNeighbours = function() in src/lib/vpsc.js	5	3	2
Block.prototype.traverse = function() in src/lib/vpsc.js	9	3	4
Block.prototype.splitBetween = function() in src/lib/vpsc.js	13	3	2
Blocks.prototype.split = function() in src/lib/vpsc.js	13	3	1
"": function() in src/lib/sortedList.js	4	3	2
"": function() in src/lib/sortedList.js	3	3	2
function iter() in evaluation/v0_vs_v1.js	39	2	2
function applyTreatment() in evaluation/metrics.js	10	2	2
json2csv() in evaluation/metrics.js	6	2	3