issues
search
orium
/
rpds
Rust persistent data structures
Mozilla Public License 2.0
1.28k
stars
58
forks
source link
issues
Newest
Newest
Most commented
Recently updated
Oldest
Least commented
Least recently updated
Avoiding stackoverflow when dropping large List
#46
lulitao1997
closed
5 years ago
3
Debug shows internal data in all data structures and iterators
#45
orium
opened
5 years ago
0
Implement optimizations in Vector
#44
orium
opened
5 years ago
0
Remove best case from the complexity tables
#43
orium
closed
6 years ago
0
The `RedBlackTreeMap` range iterator should have lazy initialization
#42
orium
closed
5 years ago
0
Stack overflow with large lists
#41
tkriik
closed
6 years ago
1
Creating an iterator should take constant time (for all iterators)
#40
orium
closed
6 years ago
1
Add RedBlackTree::range
#39
jneem
closed
6 years ago
5
For all data structures implement `Partial{Ord,Vec}` as long as the elements are `Partial{Ord,Vec}`
#38
orium
opened
6 years ago
0
Provide IndexMut for Vector<T: Clone> (Issue #30)
#37
SilensAngelusNex
closed
6 years ago
2
Allow the container of values to be either `Rc`, `Arc`, or owned.
#36
orium
opened
6 years ago
2
RedBlackTreeSet could have a pop_{first, last} methods
#35
Eh2406
opened
6 years ago
2
Add must use so some methods
#34
orium
closed
6 years ago
1
Implement a Binary Heap
#33
orium
opened
6 years ago
0
Port benchmarks to criterion
#32
orium
closed
6 years ago
0
Implement missing "std" benchmarks once there is per iteration initialization
#31
orium
closed
6 years ago
0
Implement `MutIndex` for everything that has `Index`
#30
orium
opened
6 years ago
0
Make sure no data structure does heap allocation on `new()`
#29
orium
opened
6 years ago
0
`Vector` nodes unnecessarily have heap allocated `Vec`s
#28
orium
opened
6 years ago
1
Implement a Dequeue
#27
orium
opened
6 years ago
0
Implement a B-Tree (both map and set)
#26
orium
opened
6 years ago
0
Implement `.range()` for `Vector`
#25
orium
closed
6 years ago
1
Complexity section should doc allocations.
#24
Eh2406
opened
6 years ago
0
Implement `.range()` for `RedBlackTreeMap`/`RedBlackTreeSet`
#23
FallingSnow
closed
6 years ago
7
[POC] Remove Arc wrapping of keys and values in Vector and RedBlackTree
#22
Marwes
closed
5 years ago
4
Implement `extend()` for all data structures
#21
orium
opened
6 years ago
0
Implement `*Set::{union(), difference(), intersection()}`
#20
orium
opened
6 years ago
0
Traits for `Set`/`OrderedSet`/`Map`/`OrderedMap`
#19
orium
opened
6 years ago
0
Benchmark `Queue`
#18
orium
closed
6 years ago
0
Implement `Vector::{push_front(),drop_first()}`
#17
orium
opened
6 years ago
0
Implement `FusedIterator` for our iterators (when it stabilizes)
#16
orium
opened
6 years ago
0
Document all public methods
#15
orium
opened
6 years ago
0
Mutable methods for all data structures
#14
orium
closed
6 years ago
2
question about red black tree coloring
#13
dotnwat
closed
6 years ago
2
thanks
#12
dotnwat
closed
6 years ago
2
Optimize bulk insertion
#11
Marwes
opened
6 years ago
1
Iterating over the values in a HashTrieMap
#10
Qqwy
closed
6 years ago
1
Reuse Arc allocation if the ref count is one
#9
Marwes
closed
6 years ago
11
invalid memory reference for HashTrieMap
#8
candronikos
closed
6 years ago
3
Support for other underlying smart pointers for the data structures links
#7
brendanzab
closed
5 years ago
17
cargo could use a persistent hash map in it's resolver
#6
Eh2406
closed
3 years ago
11
Bench comparison with mutable data structures?
#5
ErichDonGubler
closed
6 years ago
2
Implement serde for rpds types, pull request #4
#4
idupree
closed
6 years ago
1
Implement serde for rpds types, submission 2
#3
idupree
closed
6 years ago
2
Implement serde for rpds types (optional dependency)
#2
idupree
closed
6 years ago
8
Add optional Serde support
#1
dtolnay
closed
6 years ago
8
Previous