awslabs / amazon-pollexy
Conditional Complexity

The distribution of complexity of units (measured with McCabe index).

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 283 units with 2,925 lines of code in units (76.8% of code).
    • 0 very complex units (0 lines of code)
    • 0 complex units (0 lines of code)
    • 3 medium complex units (169 lines of code)
    • 20 simple units (673 lines of code)
    • 260 very simple units (2,083 lines of code)
0% | 0% | 5% | 23% | 71%
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
py0% | 0% | 5% | 23% | 71%
Conditional Complexity per Logical Component
primary logical decomposition
51+
26-50
11-25
6-10
1-5
cli0% | 0% | 15% | 21% | 63%
lex0% | 0% | 7% | 13% | 79%
messages0% | 0% | 6% | 43% | 50%
locator0% | 0% | 0% | 26% | 73%
lambda_functions0% | 0% | 0% | 49% | 50%
ROOT0% | 0% | 0% | 100% | 0%
scheduler0% | 0% | 0% | 17% | 82%
speaker0% | 0% | 0% | 38% | 61%
person0% | 0% | 0% | 0% | 100%
helpers0% | 0% | 0% | 0% | 100%
face0% | 0% | 0% | 0% | 100%
time_window0% | 0% | 0% | 0% | 100%
location0% | 0% | 0% | 0% | 100%
snippets0% | 0% | 0% | 0% | 100%
input0% | 0% | 0% | 0% | 100%
Most Complex Units
Top 20 most complex units
Unit# linesMcCabe index# params
def get_user_input()
in lex/__init__.py
 46 19 1
def speak()
in cli/pollexy.py
 89 19 9
def next_occurrence()
in messages/message.py
 34 12 1
def queue()
in cli/pollexy.py
 61 10 3
def get_user_input()
in lex/__init__.py
 29 9 1
def publish_message()
in messages/message_manager.py
 71 9 2
def __init__()
in messages/message.py
 50 9 2
def upsert()
in lex/__init__.py
 24 8 2
def upsert()
in lex/__init__.py
 28 8 2
def convert_to_loc_avail()
in locator/locator.py
 28 8 2
def handler()
in queue_messages.py
 51 8 2
def is_message_ready()
in messages/message.py
 13 8 2
def message_schedule()
in cli/pollexy.py
 63 8 16
def get_messages()
in scheduler/scheduler.py
 34 8 4
def verify_person_at_location()
in locator/locator.py
 23 7 2
def get_messages()
in messages/message_manager.py
 46 7 2
def to_ical()
in messages/message.py
 18 7 1
def queue_message()
in lambda_functions/queue_immediate.py
 50 7 2
def is_done()
in lex/__init__.py
 7 6 1
def send_confirm_response()
in locator/locator.py
 12 6 2