uber / h3-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 345 units with 4,755 lines of code in units (64.9% of code).

0 very complex units (0 lines of code)
5 complex units (635 lines of code)
18 medium complex units (929 lines of code)
32 simple units (886 lines of code)
290 very simple units (2,305 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
void iterStepPolygonCompact() in h3_polyfill.c	131	39	1
H3Error localIjkToCell() in h3_localij.c	135	35	3
H3Error H3_EXPORT() in h3_h3Index.c	163	32	1
H3Error cellToLocalIjk() in h3_localij.c	107	31	3
H3Error h3NeighborRotations() in h3_algos.c	99	26	4
H3Error H3_EXPORT() in h3_algos.c	104	20	1
H3Error H3_EXPORT() in h3_vertex.c	56	19	1
H3Error H3_EXPORT() in h3_directedEdge.c	62	17	1
void _geoAzDistanceRads() in h3_latLng.c	51	15	4
void _hex2dToCoordIJK() in h3_coordijk.c	75	15	2
H3Index _faceIjkToH3() in h3_h3Index.c	54	15	2
H3Error H3_EXPORT() in h3_h3Index.c	50	15	1
H3Error H3_EXPORT() in h3_algos.c	54	14	1
H3Error H3_EXPORT() in h3_algos.c	47	14	1
bool cellBoundaryCrossesGeoLoop() in h3_polygon.c	47	14	4
static H3Error vertexRotations() in h3_vertex.c	43	13	2
void _faceIjkToCellBoundary() in h3_faceijk.c	65	13	5
Overage _adjustOverageClassII() in h3_faceijk.c	42	12	4
void GENERIC_LOOP_ALGO() in h3_polygonAlgos.h	36	12	1
H3Error _h3ToFaceIjk() in h3_h3Index.c	31	12	2
H3Error H3_EXPORT() in h3_h3Index.c	48	12	1
H3Error _upAp7Checked() in h3_coordijk.c	32	11	1
H3Error _upAp7rChecked() in h3_coordijk.c	32	11	1
void _faceIjkPentToCellBoundary() in h3_faceijk.c	67	10	5
bool GENERIC_LOOP_ALGO() in h3_polygonAlgos.h	39	10	1
H3Error _gridDiskDistancesInternal() in h3_algos.c	28	10	6
H3Error _getEdgeHexagons() in h3_algos.c	45	10	6
H3Error cellToBBox() in h3_polyfill.c	33	9	3
H3Error _gridRingInternal() in h3_algos.c	36	9	3
H3Error H3_EXPORT() in h3_h3Index.c	46	9	1
func CellsToMultiPolygon() in h3.go	54	9	1
H3Error normalizeMultiPolygon() in h3_linkedGeo.c	49	8	1
H3Error H3_EXPORT() in h3_h3Index.c	31	8	1
int _h3ToFaceIjkWithInitializedFijk() in h3_h3Index.c	18	8	2
int vertexNumForDirection() in h3_vertex.c	20	7	2
void _hex2dToGeo() in h3_faceijk.c	19	7	5
void _ijkNormalize() in h3_coordijk.c	25	7	1
Direction _rotate60ccw() in h3_coordijk.c	18	7	1
Direction _rotate60cw() in h3_coordijk.c	18	7	1
int removeVertexNode() in h3_vertexGraph.c	24	7	2
H3Error H3_EXPORT() in h3_localij.c	35	7	1
H3Error h3SetToVertexGraph() in h3_algos.c	33	7	3
bool cellBoundaryInsidePolygon() in h3_polygon.c	23	7	4
void scaleBBox() in h3_bbox.c	16	7	2
void bboxNormalization() in h3_bbox.c	15	7	4
void iterStepChild() in h3_iterators.c	23	7	1
func cellsFromC() in h3.go	18	7	3
Direction directionForVertexNum() in h3_vertex.c	15	6	2
bool _ijkNormalizeCouldOverflow() in h3_coordijk.c	22	6	1
int _baseCellToCCWrot60() in h3_baseCells.c	13	6	2