A little over a month ago the Zed (editor) team put up a blog post on their text representation
https://zed.dev/blog/zed-decoded-rope-optimizations-part-1
(A B-tree of 128 byte payloads...interesting) and an optimization related to that which is "find n^th bit set" for precomputed return positions in payload side-line info.
https://zed.dev/blog/zed-decoded-rope-optimizations-part-1
(A B-tree of 128 byte payloads...interesting) and an optimization related to that which is "find n^th bit set" for precomputed return positions in payload side-line info.
Comments
1) Interesting solution but n^th bit operations on hardware supporting bit-scatter can be performed in a couple of cycles.
https://gcc.godbolt.org/z/njde5bob6
2) If we can do (1) then is the sideline information worth the data size increase?
I need to digest their no bit-scatter solution.