spotify / annoyConditional 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 212 units with 1,486 lines of code in units (52.6% of code).

0 very complex units (0 lines of code)
0 complex units (0 lines of code)
4 medium complex units (204 lines of code)
8 simple units (206 lines of code)
200 very simple units (1,076 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
S _make_tree() in src/annoylib.h	71	21	4
void _get_all_nns() in src/annoylib.h	50	14	5
static inline void create_split() in src/annoylib.h	32	12	5
bool load() in src/annoylib.h	51	12	3
void thread_build() in src/annoylib.h	31	8	3
inline void two_means() in src/annoylib.h	31	7	6
static inline void preprocess() in src/annoylib.h	24	7	4
bool build() in src/annoylib.h	30	7	3
inline int ftruncate() in src/mman.h	26	6	2
static inline T distance() in src/annoylib.h	11	6	3
bool save() in src/annoylib.h	30	6	3
void unload() in src/annoylib.h	23	6	0
static int lua_an_make() in src/annoyluamodule.cc	19	5	1
static DWORD __map_mmap_prot_page() in src/mman.h	17	5	1
static DWORD __map_mmap_prot_file() in src/mman.h	13	5	1
void _reallocate_nodes() in src/annoylib.h	17	5	1
static void build() in src/annoylib.h	20	5	3
void _pack() in src/annoymodule.cc	8	4	2
bool check_constraints() in src/annoymodule.cc	11	4	3
inline float dot() in src/annoylib.h	18	4	3
inline float manhattan_distance() in src/annoylib.h	22	4	3
inline float euclidean_distance() in src/annoylib.h	20	4	3
inline float dot() in src/annoylib.h	18	4	3
inline float manhattan_distance() in src/annoylib.h	20	4	3
inline float euclidean_distance() in src/annoylib.h	20	4	3
static inline T distance() in src/annoylib.h	8	4	3
bool add_item_impl() in src/annoylib.h	18	4	3
static int load() in src/annoyluamodule.cc	14	3	1
int pushResults() in src/annoyluamodule.cc	7	3	1
void fill_from_vector() in src/annoygomodule.h	10	3	1
void fill_from_vector() in src/annoygomodule.h	10	3	1
static inline void normalize() in src/annoylib.h	7	3	2
static inline void normalize() in src/annoylib.h	8	3	2
static inline void create_split() in src/annoylib.h	11	3	5
static inline void create_split() in src/annoylib.h	11	3	5
bool on_disk_build() in src/annoylib.h	24	3	2
static void toVector() in src/annoyluamodule.cc	6	2	4
static void pushVector() in src/annoyluamodule.cc	7	2	2
static int getItemIndex() in src/annoyluamodule.cc	8	2	3
static int save() in src/annoyluamodule.cc	12	2	1
static int get_nns_by_item() in src/annoyluamodule.cc	7	2	1
static int get_nns_by_vector() in src/annoyluamodule.cc	9	2	1
static void createNew() in src/annoyluamodule.cc	11	2	2
void _unpack() in src/annoymodule.cc	5	2	2
void get_nns_by_item() in src/annoymodule.cc	9	2	5
void get_nns_by_vector() in src/annoymodule.cc	11	2	5
float Get() in src/annoygomodule.h	6	2	1
int32_t Get() in src/annoygomodule.h	6	2	1
static int __map_mman_error() in src/mman.h	6	2	2
inline int munmap() in src/mman.h	7	2	2