If you have worked with React before - you would know that its actually not straightforward to correctly memoize computation. That is specially true for operations on collection data like filters and sorts.
which is a way to build a "read-optimised" in-memory collection so that re-renders in the ui layer do not run filters and sorts on the data again and again unnecessarily.
And this was sufficient to solve my original problem.
DeltaSort was just something that came to me while I was thinking about taking memotable performance to the next level - make the sorting as fast as possible. Thats when it hit me - if I am able to somehow use the information about the delta since the previous sort - that might help me re-sort much faster. And it turns out, it actually is much faster (at least for the Rust based implementation)
That pushed me to first build this - https://github.com/shudv/memotable
which is a way to build a "read-optimised" in-memory collection so that re-renders in the ui layer do not run filters and sorts on the data again and again unnecessarily.
And this was sufficient to solve my original problem.
DeltaSort was just something that came to me while I was thinking about taking memotable performance to the next level - make the sorting as fast as possible. Thats when it hit me - if I am able to somehow use the information about the delta since the previous sort - that might help me re-sort much faster. And it turns out, it actually is much faster (at least for the Rust based implementation)