2d309371f8
Updates the requirements on [loom](https://github.com/tokio-rs/loom) to permit the latest version. - [Release notes](https://github.com/tokio-rs/loom/releases) - [Changelog](https://github.com/tokio-rs/loom/blob/master/CHANGELOG.md) - [Commits](https://github.com/tokio-rs/loom/compare/v0.6.0...v0.7.0) --- updated-dependencies: - dependency-name: loom dependency-type: direct:production ... Signed-off-by: dependabot[bot] <support@github.com> Co-authored-by: dependabot[bot] <49699333+dependabot[bot]@users.noreply.github.com> |
||
|---|---|---|
| .github | ||
| benches | ||
| src | ||
| tests | ||
| .gitignore | ||
| CHANGELOG.md | ||
| Cargo.toml | ||
| LICENSE-APACHE | ||
| LICENSE-MIT | ||
| README.md | ||
README.md
concurrent-queue
A concurrent multi-producer multi-consumer queue.
There are two kinds of queues:
- Bounded queue with limited capacity.
- Unbounded queue with unlimited capacity.
Queues also have the capability to get closed at any point. When closed, no more items can be pushed into the queue, although the remaining items can still be popped.
These features make it easy to build channels similar to std::sync::mpsc on top of this
crate.
Examples
use concurrent_queue::ConcurrentQueue;
let q = ConcurrentQueue::unbounded();
q.push(1).unwrap();
q.push(2).unwrap();
assert_eq!(q.pop(), Ok(1));
assert_eq!(q.pop(), Ok(2));
License
Licensed under either of
- Apache License, Version 2.0 (LICENSE-APACHE or http://www.apache.org/licenses/LICENSE-2.0)
- MIT license (LICENSE-MIT or http://opensource.org/licenses/MIT)
at your option.
Contribution
Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.