JetBrains / tree-sitter 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 835 units with 15,636 lines of code in units (66.0% of code).

0 very complex units (0 lines of code)
10 complex units (1,427 lines of code)
45 medium complex units (2,843 lines of code)
86 simple units (2,867 lines of code)
694 very simple units (8,499 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
fn handle_conflict() in cli/src/generate/build_tables/build_parse_table.rs	292	50	6
void ts_subtree_set_children() in lib/src/subtree.c	95	33	4
fn populate_state() in cli/src/generate/properties.rs	120	33	3
function grammar() in cli/src/generate/dsl.js	120	30	2
static bool ts_parser__advance() in lib/src/parser.c	131	29	3
static void ts_parser__recover() in lib/src/parser.c	113	28	3
Subtree ts_subtree_edit() in lib/src/subtree.c	113	28	3
static size_t ts_subtree__write_to_string() in lib/src/subtree.c	87	28	8
bool ts_stack_print_dot_graph() in lib/src/stack.c	110	28	3
fn run() in cli/src/main.rs	246	28	0
unsigned ts_subtree_get_changed_ranges() in lib/src/get_changed_ranges.c	112	24	7
fn compute_conflict_status() in cli/src/generate/build_tables/token_conflicts.rs	116	24	5
static Subtree ts_parser__lex() in lib/src/parser.c	152	21	3
static StackVersion ts_parser__reduce() in lib/src/parser.c	70	21	7
static bool ts_parser__do_all_potential_reductions() in lib/src/parser.c	76	21	3
static unsigned ts_parser__condense_stack() in lib/src/parser.c	78	20	1
fn add_actions() in cli/src/generate/build_tables/build_parse_table.rs	116	20	5
fn intersect_transitions() in cli/src/generate/properties.rs	63	20	3
fn parse_sass_items() in cli/src/generate/properties.rs	177	20	3
fn next() in highlight/src/lib.rs	95	19	1
fn remove_unit_reductions() in cli/src/generate/build_tables/minimize_parse_table.rs	66	19	1
bool ts_subtree_eq() in lib/src/subtree.c	27	17	2
TSNode ts_node_child_by_field_id() in lib/src/node.c	47	16	2
void ts_range_array_get_changed_ranges() in lib/src/get_changed_ranges.c	55	16	5
inline StackSliceArray stack__iter() in lib/src/stack.c	79	16	5
fn main() in cli/benches/benchmark.rs	66	16	0
fn apply() in cli/src/generate/prepare_grammar/flatten_grammar.rs	70	16	3
void ts_node_descendants_of_type_wasm() in lib/binding_web/binding.c	54	15	7
static inline TSNode ts_node__prev_sibling() in lib/src/node.c	51	15	2
static void stack_node_add_link() in lib/src/stack.c	47	15	3
static Subtree ts_parser__reuse_node() in lib/src/parser.c	61	14	6
IteratorComparison iterator_compare() in lib/src/get_changed_ranges.c	30	14	2
fn populate_error_state() in cli/src/generate/build_tables/mod.rs	68	14	6
fn fmt() in cli/src/generate/build_tables/item.rs	51	14	2
static inline TSNode ts_node__next_sibling() in lib/src/node.c	45	13	2
static ErrorComparison ts_parser__compare_versions() in lib/src/parser.c	33	13	3
static void ts_subtree__compress() in lib/src/subtree.c	36	13	4
fn group_transitions() in cli/src/generate/nfa.rs	58	13	1
fn next_state() in lib/binding_rust/lib.rs	42	12	2
void ts_subtree_balance() in lib/src/subtree.c	30	12	3
fn intersect_ranges() in highlight/src/lib.rs	78	12	3
fn enter_node() in highlight/src/lib.rs	38	12	1
fn expand_regex() in cli/src/generate/prepare_grammar/expand_tokens.rs	102	12	3
fn eq() in cli/src/generate/build_tables/item.rs	24	12	2
fn serialize() in cli/src/highlight.rs	50	12	2
static bool stack__subtree_is_equivalent() in lib/src/stack.c	12	11	2
fn get_token_names() in cli/src/generate/mod.rs	28	11	2
fn simulate_nfa() in cli/src/generate/prepare_grammar/expand_tokens.rs	40	11	0
fn inline_production_at_step() in cli/src/generate/prepare_grammar/process_inlines.rs	69	11	3
fn populate_used_symbols() in cli/src/generate/build_tables/mod.rs	41	11	3