Skip to content

/ rpds

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

20 Open 19 Closed
20 Open 19 Closed
Author
Filter by author
Label
Filter by label
Use alt + click/return to exclude labels.
Projects
Filter by project
Milestones
Filter by milestone
Assignee
Filter by who’s assigned
Sort
Sort by
Newest Oldest Most commented Least commented Recently updated Least recently updated
Most reactions
👍 👎 😄 🎉 😕 ❤️ 🚀 👀
Debug shows internal data in all data structures and iterators bug
#45 opened Feb 23, 2019 by orium
Implement optimizations in Vector performance
#44 opened Jan 27, 2019 by orium
For all data structures implement `Partial{Ord,Vec}` as long as the elements are `Partial{Ord,Vec}` enhancement
#38 opened Sep 13, 2018 by orium
Allow the container of values to be either `Rc`, `Arc`, or owned. enhancement performance
#36 opened Jul 8, 2018 by orium 0 of 9
@orium
2
RedBlackTreeSet could have a pop_{first, last} methods new-feature
#35 opened Jun 11, 2018 by Eh2406
2
Implement a Binary Heap new-data-structure new-feature
#33 opened Apr 17, 2018 by orium 0 of 3
Implement `MutIndex` for everything that has `Index` new-feature
#30 opened Apr 12, 2018 by orium
Make sure no data structure does heap allocation on `new()` performance
#29 opened Apr 10, 2018 by orium 0 of 2
`Vector` nodes unnecessarily have heap allocated `Vec`s performance
#28 opened Apr 10, 2018 by orium
Implement a Dequeue new-data-structure new-feature
#27 opened Apr 8, 2018 by orium 0 of 3
Implement a B-Tree (both map and set) new-data-structure new-feature
#26 opened Apr 8, 2018 by orium 0 of 8
Complexity section should doc allocations. documentation
#24 opened Apr 3, 2018 by Eh2406
Implement `extend()` for all data structures new-feature
#21 opened Mar 30, 2018 by orium 0 of 6
Implement `*Set::{union(), difference(), intersection()}` new-feature
#20 opened Mar 30, 2018 by orium 0 of 2
Traits for `Set`/`OrderedSet`/`Map`/`OrderedMap` enhancement
#19 opened Mar 30, 2018 by orium
Implement `Vector::{push_front(),drop_first()}` new-feature
#17 opened Mar 30, 2018 by orium
Implement `FusedIterator` for our iterators (when it stabilizes) enhancement
#16 opened Mar 30, 2018 by orium
Document all public methods documentation
#15 opened Mar 30, 2018 by orium 0 of 8
Optimize bulk insertion performance vector
#11 opened Mar 9, 2018 by Marwes
1
cargo could use a persistent hash map in it's resolver
#6 opened Jan 17, 2018 by Eh2406
10
ProTip! no:milestone will show everything without a milestone.
You can’t perform that action at this time.