uber / piranha - 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 281 units with 3,167 lines of code in units (24.8% of code).

0 very complex units (0 lines of code)
0 complex units (0 lines of code)
2 medium complex units (81 lines of code)
30 simple units (868 lines of code)
249 very simple units (2,218 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 validate() in src/models/filter.rs	50	19	1
fn get_associated_elements() in src/models/matches.rs	31	11	5
fn _is_comment_safe_to_delete() in src/models/matches.rs	30	10	5
fn handle_template_variable_matching() in src/models/concrete_syntax.rs	66	10	6
fn py_new() in src/models/rule.rs	33	9	9
fn _check() in src/models/filter.rs	34	9	5
fn perform_cleanup() in src/lib.rs	52	9	1
def to_toml() in experimental/piranha_playground/rule_inference/utils/rule_utils.py	19	9	1
fn get_range_for_replace_node() in src/utilities/tree_sitter_utilities.rs	30	8	4
def flatten_dict_list() in experimental/piranha_playground/rule_inference/rule_application.py	11	8	1
def find_lowest_common_ancestor() in experimental/piranha_playground/rule_inference/utils/node_utils.py	16	8	1
def to_toml() in experimental/piranha_playground/rule_inference/utils/rule_utils.py	17	8	1
def write_query() in experimental/piranha_playground/rule_inference/static_inference.py	30	8	5
fn is_comma_safe_to_delete() in src/models/matches.rs	18	7	4
fn match_sequential_siblings() in src/models/concrete_syntax.rs	26	7	3
def find_nodes_to_change() in experimental/piranha_playground/rule_inference/static_inference.py	17	7	3
def _traverse_tree() in experimental/piranha_playground/rule_inference/graph_parser.py	26	7	2
def _get_examples() in experimental/piranha_playground/rule_inference/piranha_chat.py	17	7	1
def validate_rule() in experimental/piranha_playground/rule_inference/piranha_agent.py	42	7	2
def get_rules() in plugins/spark_upgrade/spark_config/__init__.py	59	7	1
fn validate() in src/models/piranha_arguments.rs	22	6	1
fn find_empty_line_range() in src/models/matches.rs	28	6	3
fn accumulate_repeated_tags() in src/utilities/tree_sitter_utilities.rs	22	6	3
def remove_partial_nodes() in experimental/piranha_playground/rule_inference/utils/node_utils.py	11	6	1
def get_nodes_in_range() in experimental/piranha_playground/rule_inference/utils/node_utils.py	9	6	3
def simplify_query() in experimental/piranha_playground/rule_inference/static_inference.py	16	6	2
def infer_rules_statically() in experimental/piranha_playground/rule_inference/piranha_agent.py	20	6	1
def create_chats() in experimental/piranha_playground/rule_inference/piranha_agent.py	34	6	2
def add_filter() in experimental/piranha_playground/rule_inference/piranha_agent.py	30	6	4
def __call__() in plugins/spark_upgrade/scala_session_builder/__init__.py	57	6	1
def __call__() in plugins/spark_upgrade/java_spark_context/__init__.py	49	6	1
def get_piranha_arguments() in plugins/spark_upgrade/execute_piranha.py	27	6	1
fn propagate() in src/models/source_code_unit.rs	48	5	5
def generate_sexpr() in experimental/piranha_playground/rule_inference/utils/node_utils.py	18	5	3
def static_infer() in experimental/piranha_playground/rule_inference/static_inference.py	7	5	1
def create_rule() in experimental/piranha_playground/rule_inference/static_inference.py	42	5	3
def general_improvement() in experimental/piranha_playground/rule_inference/piranha_agent.py	21	5	2
def run_piranha() in experimental/piranha_playground/rule_inference/piranha_agent.py	25	5	2
def improve_rule_graph() in experimental/piranha_playground/rule_inference/piranha_agent.py	20	5	4
def upgrade_to_spark_3_3() in plugins/spark_upgrade/main.py	11	5	1
def rule_graph_for_usage_with_variables() in plugins/zap-transformation/__main__.py	36	5	1
fn get_rule_graph() in src/models/piranha_arguments.rs	19	4	1
fn _apply_rule() in src/models/source_code_unit.rs	41	4	5
fn add_rules_to_stack() in src/models/source_code_unit.rs	19	4	5
fn _match_ancestor() in src/models/filter.rs	21	4	4
fn overlaps() in src/models/matches.rs	6	4	3
fn handle_leaf_node() in src/models/concrete_syntax.rs	26	4	4
fn log_piranha_output_summaries() in src/lib.rs	36	4	1
def get_model_selection() in experimental/piranha_playground/rule_inference/controller.py	19	4	3
def get_smallest_nonoverlapping_set() in experimental/piranha_playground/rule_inference/utils/node_utils.py	12	4	1