Iterators and Ranges: Comparing C++ to D to Rust

[Ola Fosheim Grøstad]

On Monday, 14 June 2021 at 15:22:29 UTC, Ola Fosheim Grøstad 
wrote:
> How would you quickly search an annotated suffix array with D 
> ranges as cursors?

Let me expand on that:

What if you want to do a binary search, but each node in the 
table has an optimization entry that says how many nodes you 
should move up or down when you hit that node? (For speeding up 
the search or some other reason).