Ordered list backed by btree like structure?

[jessegrosjean]

@ehsanmok

Efficient BST-like (B-tree) is perhaps the most efficient but you still want something like Vec and don't want to deal with keys ... then nothing comes to my mind now

Ok, thanks for taking a look. I've built this myself a few times (Copying CodeMirror example first time, and then with minor changes) but I always thought I was probably reinventing the wheel. Good to have at least a little feedback that it's not obviously a feature set that's satisfiable with an existing crate.

@ZiCog

Is this "array like" thing you want supposed to be fully populated, from index 0 to something. or is it only sparsely populated?

Yes, fully populated just like a Vec. That's maybe the defining factor... because when items are removed any trailing items will slide back by that number of indexes. So I want remove to remove item at that index, not set it to null.

@krdln

Anyway, I recently tried to search for such a crate (basically indexable btree), but failed to find one. I think there's one in a private module of some other crate. I'll try to post a link if I could find a topic.

Thanks again for your help... if you come across that crate please let me know. I'll just start on my own implementation now.