Uber / piranhaConditional 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 482 units with 5,603 lines of code in units (34.9% of code).

0 very complex units (0 lines of code)
2 complex units (151 lines of code)
14 medium complex units (714 lines of code)
55 simple units (1,343 lines of code)
411 very simple units (3,395 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
static Value evalExpr() in legacy/objc/src/XPFlagRefactoring/XPFlagRefactoring.cpp	90	30	4
private Value evalExpr() in legacy/java/piranha/src/main/java/com/uber/piranha/XPFlagCleaner.java	61	28	2
public Description matchIf() in legacy/java/piranha/src/main/java/com/uber/piranha/XPFlagCleaner.java	100	23	2
public static Config fromJSONFile() in legacy/java/piranha/src/main/java/com/uber/piranha/config/Config.java	104	20	2
virtual void run() in legacy/objc/src/XPFlagRefactoring/XPFlagRefactoring.cpp	59	19	1
fn validate() in src/models/filter.rs	50	19	1
public Description matchMethod() in legacy/java/piranha/src/main/java/com/uber/piranha/XPFlagCleaner.java	52	16	2
public Description matchVariable() in legacy/java/piranha/src/main/java/com/uber/piranha/XPFlagCleaner.java	39	15	2
private void recursiveScanTestMethodStats() in legacy/java/piranha/src/main/java/com/uber/piranha/XPFlagCleaner.java	37	15	4
enter: function() in legacy/javascript/src/refactor.js	25	15	2
private Optional attemptResolveSpec() in legacy/java/piranha/src/main/java/com/uber/piranha/testannotations/TestAnnotationResolver.java	78	14	4
public Description matchImport() in legacy/java/piranha/src/main/java/com/uber/piranha/XPFlagCleaner.java	42	13	2
void init() in legacy/java/piranha/src/main/java/com/uber/piranha/XPFlagCleaner.java	33	12	1
public Description matchBinary() in legacy/java/piranha/src/main/java/com/uber/piranha/XPFlagCleaner.java	46	12	2
enter: function() in legacy/javascript/src/refactor.js	18	11	1
fn get_associated_elements() in src/models/matches.rs	31	11	5
private EnumEnding getEndingOfLastEnumConstantIfRemoved() in legacy/java/piranha/src/main/java/com/uber/piranha/XPFlagCleaner.java	31	10	2
private static ImmutableMultimap parseAnnotationArguments() in legacy/java/piranha/src/main/java/com/uber/piranha/testannotations/TestAnnotationResolver.java	43	10	1
enter: function() in legacy/javascript/src/refactor.js	29	10	1
enter: function() in legacy/javascript/src/refactor.js	24	10	2
fn _is_comment_safe_to_delete() in src/models/matches.rs	30	10	5
def to_toml() in experimental/piranha_playground/rule_inference/utils/rule_utils.py	19	9	1
moveAllCommentsToSiblings() in legacy/javascript/src/refactor.js	29	9	2
leave: function() in legacy/javascript/src/refactor.js	26	9	1
enter: function() in legacy/javascript/src/refactor.js	20	9	2
refactorPipeline() in legacy/javascript/src/refactor.js	38	9	0
fn perform_cleanup() in src/lib.rs	52	9	1
fn _check() in src/models/filter.rs	34	9	5
fn py_new() in src/models/rule.rs	33	9	9
def to_toml() in experimental/piranha_playground/rule_inference/utils/rule_utils.py	17	8	1
def find_lowest_common_ancestor() in experimental/piranha_playground/rule_inference/utils/node_utils.py	16	8	1
def write_query() in experimental/piranha_playground/rule_inference/static_inference.py	30	8	5
def flatten_dict_list() in experimental/piranha_playground/rule_inference/rule_application.py	11	8	1
public Description matchReturn() in legacy/java/piranha/src/main/java/com/uber/piranha/XPFlagCleaner.java	30	8	2
public ImmutableCollection getMethodRecordsForName() in legacy/java/piranha/src/main/java/com/uber/piranha/config/Config.java	20	8	2
checkAndAddRedundantFunction() in legacy/javascript/src/refactor.js	20	8	3
enter: function() in legacy/javascript/src/refactor.js	22	8	2
fn get_range_for_replace_node() in src/utilities/tree_sitter_utilities.rs	30	8	4
def _traverse_tree() in experimental/piranha_playground/rule_inference/graph_parser.py	26	7	2
def find_nodes_to_change() in experimental/piranha_playground/rule_inference/static_inference.py	17	7	3
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
private boolean methodRecordMatcher() in legacy/java/piranha/src/main/java/com/uber/piranha/XPFlagCleaner.java	26	7	3
public Description matchExpressionStatement() in legacy/java/piranha/src/main/java/com/uber/piranha/XPFlagCleaner.java	22	7	2
private int getLower() in legacy/java/piranha/src/main/java/com/uber/piranha/XPFlagCleaner.java	9	7	4
static PiranhaMethodRecord parseFromJSONPropertyEntryMap() in legacy/java/piranha/src/main/java/com/uber/piranha/config/PiranhaMethodRecord.java	33	7	2
private static String requireASFieldRefOfBoolEquivalentValue() in legacy/java/piranha/src/main/java/com/uber/piranha/testannotations/TestAnnotationSpecRecord.java	20	7	2
reduceLogicalExpression() in legacy/javascript/src/refactor.js	17	7	3
moveLeadingCommentsToSibling() in legacy/javascript/src/refactor.js	14	7	2
leave: function() in legacy/javascript/src/refactor.js	21	7	1