facebookresearch / libri-light
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 284 units with 3,507 lines of code in units (73.4% of code).
    • 0 very complex units (0 lines of code)
    • 0 complex units (0 lines of code)
    • 10 medium complex units (384 lines of code)
    • 40 simple units (1,052 lines of code)
    • 234 very simple units (2,071 lines of code)
0% | 0% | 10% | 29% | 59%
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% | 11% | 29% | 59%
pyx0% | 0% | 0% | 84% | 15%
Conditional Complexity per Logical Component
primary logical decomposition
51+
26-50
11-25
6-10
1-5
data_preparation/split_librilight0% | 0% | 31% | 7% | 61%
eval0% | 0% | 10% | 26% | 63%
data_preparation0% | 0% | 12% | 44% | 43%
data_preparation/metadata_completion0% | 0% | 10% | 35% | 54%
eval/PER_src0% | 0% | 14% | 17% | 68%
eval/ABX_src0% | 0% | 6% | 38% | 54%
data_preparation/text_retrieval0% | 0% | 0% | 42% | 57%
data_preparation/rebuild_limited_train0% | 0% | 0% | 32% | 67%
eval/WER_src0% | 0% | 0% | 6% | 93%
Most Complex Units
Top 20 most complex units
Unit# linesMcCabe index# params
def split_vad()
in data_preparation/split_librilight/prepare_vads.py
 29 15 3
def handle_starttag()
in data_preparation/download_librivox.py
 31 15 3
def beam_search()
in eval/PER_src/seq_alignment.py
 40 15 3
def subselect()
in data_preparation/split_librilight/split.py
 33 14 3
def findAllSeqs()
in data_preparation/make_vad_inputs.py
 37 13 3
def loadData()
in data_preparation/metadata_completion/text_cleaner.py
 32 13 1
def getBaseTitle()
in data_preparation/metadata_completion/DuplicateSearch.py
 28 13 1
def get_features_group()
in eval/ABX_src/abx_iterators.py
 28 13 2
def process_dir()
in data_preparation/split_librilight/puts_json.py
 56 12 8
def train()
in eval/eval_PER.py
 70 12 1
def updateDataWithNames()
in data_preparation/metadata_completion/ReaderScapper.py
 23 10 2
def get_speaker_data()
in data_preparation/metadata_completion/utilities.py
 33 10 3
def getPossibleMatches()
in data_preparation/metadata_completion/DuplicateSearch.py
 28 10 1
def handle_starttag()
in data_preparation/text_retrieval/hathitrust.py
 11 10 3
def load_hathitrust_book()
in data_preparation/text_retrieval/hathitrust.py
 32 10 1
def main()
in eval/eval_WER.py
 82 10 1
def __init__()
in eval/ABX_src/abx_iterators.py
 25 10 3
def handle_comment()
in data_preparation/text_retrieval/bartleby.py
 15 9 2
def get_bartheleby_data()
in data_preparation/text_retrieval/bartleby.py
 38 9 1
def collapse()
in eval/WER_src/wl_decoder.py
 11 9 2