You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I was curious if something like this was possible, and it indeed is!
I didn't want to duplicate a lot of functionality between splay trees and the existing treemap module, so I extracted out a lot of the iterators and implementations into the iterator module.
If this doesn't belong in libstd, it was mostly a proof-of-concept idea anyway. I remember talk about moving the current std away from this repo and into their own repos, so this may just belong elsewhere.
Benchmark-wise, it performs about as well as expected. It's real bad on random input (when compared to TreeMap), and it's better on sequential input than TreeMap most of the time. Although that's not quite representative because splay trees are meant to be used on inputs with mild patterns anyway.
I'm not sure how many trees we want in std (soon to be extra) though. We'll need to discuss and make a decision. But either way, please feel free to share this in the Rust package repo when it's ready.
In hopes of keeping the queue smaller, I'm going to close this. I'll keep an eye on the new extra library coming up, and when the time comes around I'll see if this should be added in.
The conclusion was that this was just "one more thing" in libextra which just added more maintenance burden, so it wasn't added. I've got a fork at https://github.com/alexcrichton/rs-splay which I'm trying to update as the compiler evolves though.
I hope to revisit this again once the fate of libextra has been finalized
flip1995 pushed a commit
to flip1995/rust
that referenced
this pull request
Dec 6, 2020
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
I was curious if something like this was possible, and it indeed is!
I didn't want to duplicate a lot of functionality between splay trees and the existing
treemapmodule, so I extracted out a lot of the iterators and implementations into theiteratormodule.If this doesn't belong in libstd, it was mostly a proof-of-concept idea anyway. I remember talk about moving the current
stdaway from this repo and into their own repos, so this may just belong elsewhere.Benchmark-wise, it performs about as well as expected. It's real bad on random input (when compared to
TreeMap), and it's better on sequential input thanTreeMapmost of the time. Although that's not quite representative because splay trees are meant to be used on inputs with mild patterns anyway.Method naming would love to have #5898 as well...