uber / tree-sitter-strings - 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).

Conditional Complexity Overall

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

Conditional Complexity per Logical Component

primary logical decomposition

51+

26-50

11-25

6-10

1-5

Most Complex Units

Top 8 most complex units

Unit	# lines	McCabe index	# params
static inline bool sym_identifier_character_set_2() in src/parser.c	513	560	1
static inline bool sym_identifier_character_set_1() in src/parser.c	513	532	1
static bool ts_lex() in src/parser.c	66	39	2
static bool ts_lex_keywords() in src/parser.c	11	2	2
fn tree_sitter_strings() in bindings/rust/lib.rs	3	1	0
fn can_load_grammar() in bindings/rust/lib.rs	6	1	0
fn main() in bindings/rust/build.rs	13	1	0
void Init() in bindings/node/binding.cc	10	1	2