mozilla / perf-triage - 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 16 most complex units

Unit	# lines	McCabe index	# params
def generate_rotation() in rotation.py	35	15	2
def main() in rotation.py	41	15	0
def auth_as_user() in gcal.py	15	8	0
def add_gcal_reminder() in rotation.py	35	7	3
def send_triage_reminder() in gcal.py	19	4	3
def load_rotations() in rotation.py	15	4	0
def add_gcal_reminder_manually() in rotation.py	20	4	1
def _fetch_cached_user_credentials() in gcal.py	13	3	0
def get_addresses_from_rotation() in rotation.py	3	3	1
def get_calendar_service() in gcal.py	6	2	1
def get_cal_nick() in rotation.py	2	2	1
def __repr__() in rotation.py	2	1	1
def __repr__() in rotation.py	2	1	1
def parse_args() in rotation.py	14	1	0
def generate_html() in rotation.py	20	1	1
def get_week() in rotation.py	3	1	1