openai / prm800k - 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 28 units with 353 lines of code in units (90.1% of code).

0 very complex units (0 lines of code)
0 complex units (0 lines of code)
4 medium complex units (157 lines of code)
3 simple units (54 lines of code)
21 very simple units (142 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 28 most complex units

Unit	# lines	McCabe index	# params
def grade_answer() in prm800k/grading/grader.py	35	17	2
def _normalize() in prm800k/grading/grader.py	54	14	1
def _strip_string() in prm800k/grading/math_normalize.py	30	14	1
def main() in prm800k/eval/eval.py	38	12	0
def split_tuple() in prm800k/grading/grader.py	14	8	1
def should_allow_eval() in prm800k/grading/grader.py	10	7	1
def _fix_fracs() in prm800k/grading/math_normalize.py	30	7	1
def _fix_sqrt() in prm800k/grading/math_normalize.py	13	4	1
def _strip_properly_formatted_commas() in prm800k/grading/grader.py	8	3	1
def count_unknown_letters_in_expr() in prm800k/grading/grader.py	5	3	1
def are_equal_under_sympy() in prm800k/grading/grader.py	12	3	2
def normalize_answer() in prm800k/grading/math_normalize.py	11	3	1
def _read_jsonl() in prm800k/eval/eval.py	4	3	1
def _is_float() in prm800k/grading/grader.py	6	2	1
def _fix_a_slash_b() in prm800k/grading/math_normalize.py	13	2	1
def _remove_right_units() in prm800k/grading/math_normalize.py	7	2	1
def json_loads() in prm800k/eval/eval.py	5	2	1
def open_jsonl() in prm800k/eval/eval.py	4	2	1
def _key_by_problem() in prm800k/eval/eval.py	5	2	1
def _choose_sample_by_score() in prm800k/eval/eval.py	4	2	2
def _sympy_parse() in prm800k/grading/grader.py	9	1	1
def _parse_latex() in prm800k/grading/grader.py	12	1	1
def _is_int() in prm800k/grading/grader.py	5	1	1
def _is_frac() in prm800k/grading/grader.py	2	1	1
def _str_is_int() in prm800k/grading/grader.py	7	1	1
def _str_to_int() in prm800k/grading/grader.py	4	1	1
def _inject_implicit_mixed_number() in prm800k/grading/grader.py	4	1	1
def _get_answer() in prm800k/eval/eval.py	2	1	1