-
Notifications
You must be signed in to change notification settings - Fork 99
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Possible improvements for RBTree
#492
Comments
Improve `RBTree.mo`: * Documentation * Unit tests Possible improvements for `RBTree` (#492): * Reduce garbage creation, especially during reading functions, such as `get()` and iteration. * More efficient `size()` function.
Improve `RBTree.mo`: * Documentation * Unit tests Possible improvements for `RBTree` (#492): * Reduce garbage creation, especially during reading functions, such as `get()` and iteration. * More efficient `size()` function.
Another long-standing issue with RBTree is that it does not fully support Separately but also related, RBTree is purely functional. So maybe some users would consider an additional imperative version to be another dimension of improvement? |
We should probably round out the functional one before adding an imperative one. Ie implement purely functional delete. Is it hard? Genuine question. |
Fixes issue #492 and adds some basic tests. - [x] test binomial consumes input - [x] test the static functions. Co-authored-by: Ryan Vandersmith <ryan.vandersmith@dfinity.org>
General question: How can |
I wonder what kind of improvement we can expect from an imperative one. Wouldn't it end up looking very similar and have the same representation? What would get improved? |
Possible improvements for
RBTree
:get()
and iteration.size()
function.The text was updated successfully, but these errors were encountered: