A fast, distributed, high performance gradient boosting (GBT, GBDT, GBRT, GBM or MART) framework based on decision tree algorithms, used for ranking, classification and many other machine learning tasks.
Main Code: 47,114 LOC (166 files) = CPP (35%) + HPP (18%) + H (14%) + PY (12%) + R (7%) + CL (4%) + CU (2%) + I (1%) + CMAKE (<1%) + VCXPROJ (<1%) + FILTERS (<1%) + IN (<1%) + YML (<1%) Secondary code: Test: 12,172 LOC (36); Generated: 0 LOC (0); Build & Deploy: 165 LOC (2); Other: 4,368 LOC (81); |
|||
Duplication: 17% | |||
File Size: 22% long (>1000 LOC), 19% short (<= 200 LOC) | |||
Unit Size: 14% long (>100 LOC), 35% short (<= 10 LOC) | |||
Conditional Complexity: 11% complex (McCabe index > 50), 44% simple (McCabe index <= 5) | |||
|
Logical Component Decomposition: primary (21 components) | ||
|
5 years, 6 months old
|
|
|
|
48% of code updated more than 50 times Also see temporal dependencies for files frequently changed in same commits. |
|
|
|
Goals: Keep the system simple and easy to change (4) |
|
|
Features of interest:
TODOs
4 files |
|
Latest commit date: 2022-01-23
15
commits
(30 days)
6
contributors
(30 days) |
|
generated by sokrates.dev (configuration) on 2022-01-30