JetBrains / ArcticInference 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 281 units with 3,993 lines of code in units (43.2% of code).

0 very complex units (0 lines of code)
3 complex units (332 lines of code)
16 medium complex units (933 lines of code)
27 simple units (675 lines of code)
235 very simple units (2,053 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
def build_extension() in setup.py	67	35	2
def strip_string() in arctic_inference/dynasor/evaluator.py	81	28	2
def __init__() in arctic_inference/vllm/spec_dec/arctic_speculator.py	184	28	4
def extract_answer() in arctic_inference/dynasor/evaluator.py	51	21	3
def capture_model() in arctic_inference/vllm/model_runner.py	61	20	1
def load_weights() in arctic_inference/vllm/swiftkv/llama_swiftkv.py	58	18	3
def _fix_flashinfer_metadata() in arctic_inference/vllm/swiftkv/llama_swiftkv.py	103	17	4
def _init_executor() in arctic_inference/vllm/ulysses.py	50	16	1
void SuffixTree::remove() in csrc/suffix_decoding/suffix_tree.cc	64	14	1
def extract_first_boxed_answer() in arctic_inference/dynasor/evaluator.py	34	14	2
def extract_boxed_answer() in arctic_inference/dynasor/evaluator.py	34	14	2
def process_weights_after_loading() in arctic_inference/vllm/spec_dec/fp8.py	63	13	2
def __init__() in arctic_inference/vllm/spec_dec/arctic_speculator.py	115	13	4
void SuffixTree::append() in csrc/suffix_decoding/suffix_tree.cc	100	12	2
def symbolic_equal() in arctic_inference/dynasor/evaluator.py	42	12	2
def main() in arctic_inference/suffix_decoding/simulator.py	45	12	1
std::string SuffixTree::check_integrity() in csrc/suffix_decoding/suffix_tree.cc	53	11	0
def apply_patch() in arctic_inference/patching.py	22	11	1
def weight_loader() in arctic_inference/vllm/spec_dec/vocab_parallel_embedding.py	38	11	3
bool probe_insert_or_find_() in csrc/suffix_decoding/int32_map.h	29	10	2
def get_data() in arctic_inference/suffix_decoding/simulator.py	28	9	1
def __post_init__() in arctic_inference/vllm/config.py	19	9	1
std::string SuffixTree::_check_node_integrity() in csrc/suffix_decoding/suffix_tree.cc	48	8	1
def main() in arctic_inference/dynasor/vllm_server.py	41	8	0
def _fix_fracs() in arctic_inference/dynasor/evaluator.py	30	8	1
def ensure_tokenized() in arctic_inference/suffix_decoding/simulator.py	14	8	1
def _update_suffix_cache() in arctic_inference/vllm/model_runner.py	19	8	2
def __init__() in arctic_inference/vllm/spec_dec/vocab_parallel_embedding.py	60	8	9
def majority_voting() in arctic_inference/dynasor/entropy.py	23	7	1
def start_request() in arctic_inference/suffix_decoding/cache.py	9	7	3
def _generate_seq_id() in arctic_inference/suffix_decoding/cache.py	15	7	2
def __init__() in arctic_inference/vllm/swiftkv/llama_swiftkv.py	42	7	4
def __init__() in arctic_inference/vllm/spec_dec/fp8.py	13	7	2
def load_weights() in arctic_inference/vllm/spec_dec/arctic_speculator.py	27	7	3
def __init__() in arctic_inference/vllm/ulysses.py	23	7	4
def gen_random_num() in benchmark/embedding/benchmark.py	13	7	3
static void place_new_() in csrc/suffix_decoding/int32_map.h	15	6	4
Candidate SuffixTree::_speculate_path() in csrc/suffix_decoding/suffix_tree.cc	33	6	4
Candidate SuffixTree::_speculate_tree() in csrc/suffix_decoding/suffix_tree.cc	30	6	4
def generate_grpc_code() in arctic_inference/embedding/generate_proto.py	45	6	0
def obtain_answer() in arctic_inference/dynasor/entropy.py	10	6	1
def with_cancellation() in arctic_inference/dynasor/util.py	14	6	1
def try_load_torch_library() in arctic_inference/py_custom_ops.py	25	6	0
def arctic_inference_plugin() in arctic_inference/vllm/plugin.py	19	6	0
def get_quant_method_patch() in arctic_inference/vllm/spec_dec/fp8.py	15	6	3
def resolve_dependencies() in scripts/install_deps.py	16	6	3
bool erase() in csrc/suffix_decoding/int32_map.h	18	5	1
void maybe_rehash_after_erase_() in csrc/suffix_decoding/int32_map.h	17	5	0
void rehash_() in csrc/suffix_decoding/int32_map.h	21	5	1
Candidate SuffixTree::speculate() in csrc/suffix_decoding/suffix_tree.cc	31	5	6