orium/rpds

Issues

• Copy trait for HashTrieMap ?

  #93 opened a month ago by gl-yziquel
  3

• How can a data structure be persisted to a file efficiently?

  #92 opened a month ago by tqwewe
  1

• faster slicing for vectors?

  #62 opened 3 years ago by tiye
  3

• `Vector` nodes unnecessarily have heap allocated `Vec`s

  #28 opened 6 years ago by orium
  1

• FYI: Python bindings / Minor README question

  #83 opened 9 months ago by Julian
  2

• sparse_array_usize test failures on i686

  #81 opened 10 months ago by mattiaverga
  2

• Non-empty containers

  #78 opened a year ago by purefunctor
  1

• Opening doc.

  #75 opened a year ago by Billv50
  1

• Add a "feature" to remove _mut methods

  #73 opened a year ago by will-lx
  4

• Support custom allocator

  #67 opened 2 years ago by stevefan1999-personal
  1

• extract variants of remove on HashTrieMap and RedBlackTreeMap

  #72 opened a year ago by maboesanman
  0

• Serializing multiple instances efficiently

  #71 opened a year ago by jgarvin
  1

• Consider providing a .pop_with_value() helper on Stack and List

  #65 opened 2 years ago by Wilfred
  0

• Consider re-exporting archery items

  #64 opened 2 years ago by teoxoy
  0

• `RedBlackTreeSet`'s docs mention non-existent `get` operation

  #63 opened 3 years ago by phrohdoh
  2

• Finger Trees

  #61 opened 3 years ago by SamuelMarks
  1

• Is this stable for handling large scale data (> 10^8)

  #58 opened 3 years ago by M4tsuri
  1

• Memory Usage for Debugging

  #57 opened 3 years ago by fredfortier
  4

• Implement .range_index() for RedBlackTreeMap/RedBlackTreeSet

  #56 opened 3 years ago by liangyongrui
  1

• HAMP vs CHAMP

  #55 opened 3 years ago by FrankC01
  0

• Add feature to provide Trace and Finalize impls for https://github.com/Manishearth/rust-gc

  #54 opened 3 years ago by lalaithion
  0

• Make sure no data structure does heap allocation on `new()`

  #29 opened 6 years ago by orium
  0

• Allow the container of values to be either `Rc`, `Arc`, or owned.

  #36 opened 6 years ago by orium
  2

• Avoiding stackoverflow when dropping large List

  #46 opened 5 years ago by lulitao1997
  3

• Implement optimizations in Vector

  #44 opened 5 years ago by orium
  0

• Debug shows internal data in all data structures and iterators

  #45 opened 5 years ago by orium
  0

• The `RedBlackTreeMap` range iterator should have lazy initialization

  #42 opened 5 years ago by orium
  0

• Implement `.range()` for `RedBlackTreeMap`/`RedBlackTreeSet`

  #23 opened 6 years ago by FallingSnow
  7

• Remove best case from the complexity tables

  #43 opened 6 years ago by orium
  0

• Creating an iterator should take constant time (for all iterators)

  #40 opened 6 years ago by orium
  1

• Stack overflow with large lists

  #41 opened 6 years ago by tkriik
  1

• Implement `.range()` for `Vector`

  #25 opened 6 years ago by orium
  1

• RedBlackTreeSet could have a pop_{first, last} methods

  #35 opened 6 years ago by Eh2406
  2

• For all data structures implement `Partial{Ord,Vec}` as long as the elements are `Partial{Ord,Vec}`

  #38 opened 6 years ago by orium
  0

• Add must use so some methods

  #34 opened 6 years ago by orium
  1

• Implement a Binary Heap

  #33 opened 6 years ago by orium
  0

• Implement a Dequeue

  #27 opened 6 years ago by orium
  0

• Implement a B-Tree (both map and set)

  #26 opened 6 years ago by orium
  0

• Implement missing "std" benchmarks once there is per iteration initialization

  #31 opened 6 years ago by orium
  0

• Port benchmarks to criterion

  #32 opened 6 years ago by orium
  0

• Benchmark `Queue`

  #18 opened 6 years ago by orium
  0

• Mutable methods for all data structures

  #14 opened 6 years ago by orium
  2

• Implement `MutIndex` for everything that has `Index`

  #30 opened 6 years ago by orium
  0

• Document all public methods

  #15 opened 6 years ago by orium
  0

• Complexity section should doc allocations.

  #24 opened 6 years ago by Eh2406
  0

• Implement `FusedIterator` for our iterators (when it stabilizes)

  #16 opened 6 years ago by orium
  0

• Implement `extend()` for all data structures

  #21 opened 6 years ago by orium
  0

• Implement `*Set::{union(), difference(), intersection()}`

  #20 opened 6 years ago by orium
  0

• Traits for `Set`/`OrderedSet`/`Map`/`OrderedMap`

  #19 opened 6 years ago by orium
  0

• Implement `Vector::{push_front(),drop_first()}`

  #17 opened 6 years ago by orium
  0