backtracking / ocaml-bazaar Goto Github PK

Hi there.

This is a cool collection of data structures. I published a modified version of a Piece Tree structure (which is is similar to a Rope; both edit text) to opam and was asked about comparing the performance between your library and mine.

They are pretty competitive so far (you can see my benchmark comparison on real world editing traces here), but I think yours has the opportunity to become faster than it already is.

This is the code I had to use when I wanted to delete a length of characters from your library, and that's obviously less efficient than it could be because you have to index to the specified place in the Rope every time. I think your library can outright become faster than mine if that were reimplemented.

It's likely not a huge issue though because users most likely won't notice a difference that small, but I'm letting you know in case you think it's worth it.

All the best,
Humza