WIP: Moving vectors to fallible vectors

[deven96]

No description provided.

[github-actions]

Test Results

108 tests   108 ✅  1m 21s ⏱️
  7 suites    0 💤
  2 files      0 ❌

Results for commit 1ed9df6.

♻️ This comment has been updated with latest results.

[github-actions]

Benchmark Results

group                                                        main                                   pr
-----                                                        ----                                   --
store_batch_insertion_without_predicates/size_100            1.05  1662.7±32.18µs        ? ?/sec    1.00  1584.6±38.19µs        ? ?/sec
store_batch_insertion_without_predicates/size_1000           1.05     17.3±0.29ms        ? ?/sec    1.00     16.5±0.39ms        ? ?/sec
store_batch_insertion_without_predicates/size_10000          1.03    174.1±3.82ms        ? ?/sec    1.00    168.4±2.46ms        ? ?/sec
store_batch_insertion_without_predicates/size_100000         1.02  1739.5±25.86ms        ? ?/sec    1.00  1703.2±27.15ms        ? ?/sec
store_retrieval_no_condition/size_100                        1.04      2.6±0.03ms        ? ?/sec    1.00      2.6±0.03ms        ? ?/sec
store_retrieval_no_condition/size_1000                       1.02     19.1±0.26ms        ? ?/sec    1.00     18.6±0.23ms        ? ?/sec
store_retrieval_no_condition/size_10000                      1.02    187.8±2.10ms        ? ?/sec    1.00    184.5±3.43ms        ? ?/sec
store_retrieval_no_condition/size_100000                     1.01  1905.0±27.92ms        ? ?/sec    1.00  1893.0±22.79ms        ? ?/sec
store_retrieval_non_linear_kdtree/size_100                   1.04      2.8±0.03ms        ? ?/sec    1.00      2.7±0.04ms        ? ?/sec
store_retrieval_non_linear_kdtree/size_1000                  1.00     20.6±0.30ms        ? ?/sec    1.00     20.7±0.28ms        ? ?/sec
store_retrieval_non_linear_kdtree/size_10000                 1.01    203.1±1.39ms        ? ?/sec    1.00    200.2±2.12ms        ? ?/sec
store_retrieval_non_linear_kdtree/size_100000                1.01       2.1±0.03s        ? ?/sec    1.00       2.1±0.03s        ? ?/sec
store_sequential_insertion_without_predicates/size_100       1.03  1657.0±29.01µs        ? ?/sec    1.00  1608.9±47.03µs        ? ?/sec
store_sequential_insertion_without_predicates/size_1000      1.05     17.3±0.46ms        ? ?/sec    1.00     16.4±0.30ms        ? ?/sec
store_sequential_insertion_without_predicates/size_10000     1.08    173.3±2.50ms        ? ?/sec    1.00    161.0±4.38ms        ? ?/sec
store_sequential_insertion_without_predicates/size_100000    1.00  1651.1±37.51ms        ? ?/sec    1.02  1677.4±20.40ms        ? ?/sec

[deven96]

Does a bit of #100

What's left is swapping out the places where we did .collect(), and then doing the process for HashMap as well. Doesn't seem like HashSet has any entry in fallible collections