https://github.com/erizocosmico/ring_queue
Double-ended queue implementation for Rust.
https://github.com/erizocosmico/ring_queue
circular data-structure deque queue ring rust
Last synced: 2 months ago
JSON representation
Double-ended queue implementation for Rust.
- Host: GitHub
- URL: https://github.com/erizocosmico/ring_queue
- Owner: erizocosmico
- License: mit
- Created: 2018-12-09T23:37:58.000Z (over 6 years ago)
- Default Branch: master
- Last Pushed: 2018-12-24T15:38:47.000Z (over 6 years ago)
- Last Synced: 2025-03-11T04:16:15.859Z (3 months ago)
- Topics: circular, data-structure, deque, queue, ring, rust
- Language: Rust
- Homepage: https://docs.rs/ring_queue
- Size: 23.4 KB
- Stars: 3
- Watchers: 2
- Forks: 0
- Open Issues: 1
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# ring_queue [](https://travis-ci.org/erizocosmico/ring_queue) [](https://docs.rs/ring_queue) [](https://crates.io/crates/ring_queue) [](https://opensource.org/licenses/MIT)
A double-ended queue implemented using a `Vec` that reuses space after
elements are removed.
The API is heavily inspired on `collections.deque` from Python.
You can create a ring using any of the available constructors or the `ring!` macro.
```rust
#[macro_use] extern crate ring_queue;
use ring_queue::Ring;
// `new` for an empty ring.
let r: Ring = Ring::new();
// `with_capacity` for allocating the internal vector with the given
// capacity.
let r2: Ring = Ring::with_capacity(5);
// `ring!` macro for easy initializing the ring.
let r3: Ring = ring![1, 2, 3];
// `from_iter` to construct the ring from an iterator.
use std::iter::FromIterator;
let r4: Ring = Ring::from_iter(vec![1, 2, 3]);
```
Instead of `front` and `back` as a nomenclature, this library uses `left`
to refer to the front an nothing to refer to the back, as the Python
`collections.deque` library does.
Items can be pushed to the left and right as well as popped.
```rust
#[macro_use] extern crate ring_queue;
use ring_queue::Ring;
let mut r = ring![1, 2, 3];
r.push(4);
r.push_left(0);
assert_eq!(r.pop(), Some(4));
assert_eq!(r.pop_left(), Some(0));
```
The ring can be rotated either to the left or to the right. Any positive
number will rotate `n` steps to the right and any negative number will
rotate `n` steps to the left.
```rust
#[macro_use] extern crate ring_queue;
use ring_queue::Ring;
let mut r = ring![1, 2, 3, 4, 5];
r.rotate(1);
assert_eq!(r.collect_vec(), vec![5, 1, 2, 3, 4]);
r.rotate(-2);
assert_eq!(r.collect_vec(), vec![2, 3, 4, 5, 1]);
```
Ring implements `collect` to collect the elements in the ring as a vector
if the type of the elements implements the `Copy` trait.
```rust
#[macro_use] extern crate ring_queue;
use ring_queue::Ring;
let mut r = ring![1, 2, 3, 4];
assert_eq!(r.collect_vec(), vec![1, 2, 3, 4]);
```
It also implements `into_iter` to generate an iterator. However,
`into_iter` empties the ring if the elements do not implement the `Copy` trait.
```rust
#[macro_use] extern crate ring_queue;
use ring_queue::Ring;
// Since integers implement Copy, an iterator over this ring will not
// consume the ring itself.
let r = ring![1, 2, 3, 4];
assert_eq!(r.is_empty(), false);
for item in r.into_iter() {
println!("{}", item);
}
assert_eq!(r.is_empty(), false);
// Element is Vec<{integer}>, so it's not copyable. An iterator for this
// ring will empty the ring.
let mut r2 = ring![vec![1, 2], vec![3, 4]];
for item in r2.into_iter() {
println!("{:?}", item);
}
assert_eq!(r2.is_empty(), true);
```
## LICENSE
MIT License, see [LICENSE](/LICENSE)