linear-deque 0.1.3

A double-ended queue that can be sliced at any time without preparation.
Documentation
  • Coverage
  • 100%
    39 out of 39 items documented28 out of 34 items with examples
  • Size
  • Source code size: 82.61 kB This is the summed size of all the files inside the crates.io package for this release.
  • Documentation size: 8.14 MB This is the summed size of all files generated by rustdoc for all configured targets
  • Ø build duration
  • this release: 47s Average build duration of successful builds.
  • all releases: 16s Average build duration of successful builds in releases after 2024-10-23.
  • Links
  • erdavila/linear-deque-rs
    0 1 0
  • crates.io
  • Dependencies
  • Versions
  • Owners
  • erdavila

A double-ended queue that can be sliced at any time without preparation.

LinearDeque vs VecDeque

The standard VecDeque uses a ring buffer. It requires that the make_contiguous method is called to ensure that the deque content can all be referenced in a single slice. make_contiguous is only callable on a mutable instance of the deque.

The LinearDeque provided by this lib uses a linear buffer, keeping all its content contiguous and allowing to have a slice with all the content at any time, even when the deque is not mutable.