I'm writing a CLI that manages an ordered list of elements. I want a data structure that provides efficient (
log(n)) insertion, deletion, find-next, and find-previous queries. Each CLI operation will only perform a small number of queries, so I want a data structure that can live on disk and be queried (including edited) without loading the whole structure.
Is there an existing crate that does this?