apache / datasketches-go - Conditional 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 791 units with 9,936 lines of code in units (55.7% of code).

0 very complex units (0 lines of code)
3 complex units (468 lines of code)
29 medium complex units (1,834 lines of code)
77 simple units (2,303 lines of code)
682 very simple units (5,331 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
func CpcSketchToString() in cpc/utils.go	279	41	2
func() in cpc/merging_validation.go	117	31	1
func resolve[C comparable]() in internal/generic_inequality_search.go	72	27	6
func() in cpc/cpc_union.go	72	24	1
func() in hll/union.go	86	20	1
func NewLongsSketchFromString() in frequencies/longs_sketch.go	70	19	1
func internalHll4Update() in hll/hll_4update.go	71	19	3
func() in cpc/cpc_compressed_state.go	45	18	1
func() in cpc/compression_characterization.go	154	18	1
func shiftToBiggerCurMin() in hll/hll_4update.go	84	18	1
func NewLongsSketchFromSlice() in frequencies/longs_sketch.go	64	17	1
func importFromMemory() in cpc/cpc_compressed_state.go	85	17	1
func NewFrequencyItemsSketchFromSlice[C comparable]() in frequencies/items_sketch.go	64	16	3
func() in kll/items_sketch.go	90	15	1
func() in cpc/cpc_union.go	75	15	1
func generalItemsCompress[C comparable]() in kll/items_sketch.go	77	14	10
func() in cpc/cpc_sketch.go	55	14	1
func mergeHlltoHLLmode() in hll/union.go	88	14	4
func checkPreamble() in hll/utils.go	31	14	1
func putPinnedSlidingHip() in cpc/utils.go	56	13	12
func() in frequencies/items_sketch.go	47	12	1
func() in frequencies/longs_sketch.go	47	12	1
func NewKllItemsSketchFromSlice[C comparable]() in kll/items_sketch.go	75	12	3
func() in kll/items_sketch.go	64	12	1
func() in cpc/cpc_compressed_state.go	37	12	1
func() in cpc/cpc_sketch.go	48	12	1
func checkRebuildCurMinNumKxQ() in hll/union.go	51	12	1
func NewHllSketchFromSlice() in hll/hll_sketch.go	42	12	2
func populateItemWorkArrays[C comparable]() in kll/items_sketch.go	30	11	10
func() in cpc/merging_validation.go	32	11	1
func() in cpc/cpc_compressed_state.go	48	11	1
func putPinnedSlidingMerged() in cpc/utils.go	46	11	10
func deserializeReversePurgeLongHashMapFromString() in frequencies/reverse_purge_long_hash_map.go	35	10	1
func() in kll/items_sketch_validate.go	47	10	1
func() in kll/items_sketch.go	58	10	1
func() in cpc/pair_table.go	27	10	1
func() in cpc/cpc_compressed_state.go	37	10	1
func lowLevelCompressPairs() in cpc/cpc_compressed_state.go	69	10	4
func determinePseudoPhase() in cpc/cpc_compressed_state.go	31	10	2
func deserializeCouponHashSet() in hll/coupon_hash_set.go	39	10	1
func() in frequencies/items_sketch.go	28	9	1
func() in cpc/cpc_union.go	43	9	1
func rtAssertEqualsBytes() in cpc/runtime_asserts.go	20	9	2
func() in cpc/pair_table.go	40	9	1
func() in cpc/cpc_compressed_state.go	42	9	1
func() in cpc/cpc_sketch.go	35	9	1
func() in cpc/utils.go	22	9	1
func putSparseHybridHip() in cpc/utils.go	40	9	8
func putPinnedSlidingHipNoSv() in cpc/utils.go	39	9	9
func deserializeAuxHashMap() in hll/aux_hash_map.go	42	9	5