opensearch-project / k-NN
???? Find the k-nearest neighbors (k-NN) for your vector data
Summary
     |
|||
| Main Code: 10,576 LOC (155 files) = JAVA (82%) + CPP (9%) + PY (5%) + H (1%) + YML (1%) + IN (<1%) + POLICY (<1%) Secondary code: Test: 12,820 LOC (91); Generated: 0 LOC (0); Build & Deploy: 593 LOC (6); Other: 1,364 LOC (33); |
|||
| Duplication: 7% | |||
| File Size: 0% long (>1000 LOC), 78% short (<= 200 LOC) | |||
| Unit Size: 0% long (>100 LOC), 71% short (<= 10 LOC) | |||
| Conditional Complexity: 0% complex (McCabe index > 50), 78% simple (McCabe index <= 5) | |||
|
|
Logical Component Decomposition: primary (11 components) | ||
|
|
2 years, 4 months old
|
||
|
|
0% 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
7 files |
|||
Latest commit date: 2022-01-28
|
15
commits
(30 days)
4
contributors
(30 days) |
|