Skip to content
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.

Sign up for GitHub

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

Jump to bottom

implement a persistent self-balancing binary search tree #649

Closed
steveklabnik opened this issue Jan 21, 2015 · 1 comment
Closed

implement a persistent self-balancing binary search tree #649

steveklabnik opened this issue Jan 21, 2015 · 1 comment
Labels
T-libs-api Relevant to the library API team, which will review and decide on the RFC.

Comments

@steveklabnik
Copy link
Member

Issue by thestinger
Sunday Feb 17, 2013 at 01:12 GMT

For earlier discussion, see rust-lang/rust#4987

This issue was labelled with: A-an-interesting-project, A-libs in the Rust repository

This will need to be a different implementation than TreeMap - an efficient persistent tree is a different beast.
@steveklabnik steveklabnik mentioned this issue Jan 21, 2015
Closed
@petrochenkov petrochenkov added the T-libs-api Relevant to the library API team, which will review and decide on the RFC. label Jan 20, 2018
@Centril
Copy link
Contributor

Centril commented Oct 7, 2018

I believe this is at least satisfied by the https://github.com/orium/rpds crate.

@Centril Centril closed this as completed Oct 7, 2018
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
T-libs-api Relevant to the library API team, which will review and decide on the RFC.
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
3 participants
@steveklabnik @Centril @petrochenkov