facebookresearch / Private-ID
A collection of algorithms that can do join between two parties while preserving the privacy of keys on which the join happens
Summary
 |
|||
| Main Code: 11,340 LOC (92 files) = RS (95%) + PROTO (2%) + TOML (1%) | |||
| Duplication: 41% | |||
| File Size: 0% long (>1000 LOC), 46% short (<= 200 LOC) | |||
| Unit Size: 3% long (>100 LOC), 49% short (<= 10 LOC) | |||
| Conditional Complexity: 0% complex (McCabe index > 50), 91% simple (McCabe index <= 5) | |||
|
|
Logical Component Decomposition: primary (12 components) | ||
|
|
1 year, 6 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
17 files |
|||
Latest commit date: 2022-01-06
|
1
commits
(30 days)
1
contributors
(30 days) |
|