HNSW Impl

[Iamdavidonuh]

Part of #184. Introduces the HNSW implementation with little to no improvements(Correctness over optimization)

[github-actions]

Test Results

206 tests   206 ✅  8m 37s ⏱️
 31 suites    0 💤
  3 files      0 ❌

Results for commit ec8bf85.

♻️ This comment has been updated with latest results.

[github-actions]

Benchmark Results

group                                                        main                                   pr
-----                                                        ----                                   --
store_batch_insertion_without_predicates/size_100            1.01    797.0±6.80µs        ? ?/sec    1.00   790.6±15.28µs        ? ?/sec
store_batch_insertion_without_predicates/size_1000           1.02      6.2±0.04ms        ? ?/sec    1.00      6.1±0.01ms        ? ?/sec
store_batch_insertion_without_predicates/size_10000          1.02     86.3±0.27ms        ? ?/sec    1.00     85.0±0.28ms        ? ?/sec
store_batch_insertion_without_predicates/size_100000         1.02    872.8±4.96ms        ? ?/sec    1.00    857.5±6.96ms        ? ?/sec
store_retrieval_no_condition/size_100                        1.00      2.2±0.00ms        ? ?/sec    1.00      2.1±0.01ms        ? ?/sec
store_retrieval_no_condition/size_1000                       1.00     14.5±0.06ms        ? ?/sec    1.00     14.5±0.04ms        ? ?/sec
store_retrieval_no_condition/size_10000                      1.03    147.7±1.86ms        ? ?/sec    1.00    143.4±0.93ms        ? ?/sec
store_retrieval_no_condition/size_100000                     1.03  1479.1±13.74ms        ? ?/sec    1.00  1442.6±14.02ms        ? ?/sec
store_retrieval_non_linear_kdtree/size_100                   1.00      2.2±0.03ms        ? ?/sec    1.00      2.2±0.04ms        ? ?/sec
store_retrieval_non_linear_kdtree/size_1000                  1.03     16.2±0.27ms        ? ?/sec    1.00     15.7±0.31ms        ? ?/sec
store_retrieval_non_linear_kdtree/size_10000                 1.03    161.0±2.90ms        ? ?/sec    1.00    157.0±2.20ms        ? ?/sec
store_retrieval_non_linear_kdtree/size_100000                1.05  1634.4±30.39ms        ? ?/sec    1.00   1561.0±9.41ms        ? ?/sec
store_sequential_insertion_without_predicates/size_100       1.03   1534.9±7.42µs        ? ?/sec    1.00   1493.5±0.25µs        ? ?/sec
store_sequential_insertion_without_predicates/size_1000      1.04     15.3±0.02ms        ? ?/sec    1.00     14.7±0.28ms        ? ?/sec
store_sequential_insertion_without_predicates/size_10000     1.02    152.5±0.74ms        ? ?/sec    1.00    149.8±1.51ms        ? ?/sec
store_sequential_insertion_without_predicates/size_100000    1.03   1528.7±1.75ms        ? ?/sec    1.00  1490.4±28.24ms        ? ?/sec

[deven96]

I think you can derive PartialEq and Eq since it's a simple new type

[deven96]

Maybe PartialOrd too

[deven96]

Implicit trait derives as well