Paul Masurel bef41ffa48 Faster lookups in sparse optional index blocks ...

- Branchless binary search in SparseBlock, using
  std::hint::select_unpredictable. Indices are usize: with u16, LLVM
  emits a branch on x86_64, even with the hint.
- SparseBlock::rank_if_exists_batch checks the next value first, then
  uses an exponential search. The search is bounded by the doc id gap:
  values are distinct and sorted, so vals[c + k] >= vals[c] + k.
- OptionalIndex::rank_if_exists_batch reserves its output vectors.
- MSRV 1.88, for select_unpredictable.
- Add a rank_if_exists_batch group to bench_optional_index, unit tests
  and proptests.

2026-10-07 14:18:13 +02:00

..

bench_access.rs

Revert "remove unused columnar api (#2742)" (#2748)

2025-11-26 17:44:02 +01:00

bench_column_values_get.rs

upgrade some dependancies (#2802)

2026-01-14 10:19:09 +01:00

bench_create_column_values.rs

upgrade some dependancies (#2802)

2026-01-14 10:19:09 +01:00

bench_first_vals.rs

feat: Restore index sorting (#2959)

2026-06-22 11:22:25 -07:00

bench_merge.rs

update edition to 2024 (#2620)

2025-04-18 04:56:31 +02:00

bench_multivalue_docids.rs

Map multivalued doc ranks to doc ids with a select cursor (#3133)

2026-09-29 09:31:00 +02:00

bench_optional_index.rs

Faster lookups in sparse optional index blocks

2026-10-07 14:18:13 +02:00

bench_values_u64.rs

upgrade some dependancies (#2802)

2026-01-14 10:19:09 +01:00

bench_values_u128.rs

upgrade some dependancies (#2802)

2026-01-14 10:19:09 +01:00

common.rs

clippy

2026-07-10 12:33:33 +02:00