amity
| Crates.io | amity |
| lib.rs | amity |
| version | 0.2.1 |
| source | src |
| created_at | 2023-01-22 15:05:03.406073 |
| updated_at | 2024-06-21 10:34:07.432922 |
| description | Concurrency algorithms |
| homepage | https://github.com/zakarumych/amity |
| repository | https://github.com/zakarumych/amity |
| max_upload_size | |
| id | 765184 |
| size | 109,229 |
development (github:dabbotorg:development)
documentation
README
Amity
Collection of concurrency algorithms. Includes blocking, lock-free and wait-free algorithms for different scenarios and purposes.
The collection is not fixed and more algorithms will be added. Algorithm may be removed from crate only if its implementation is unsound and cannot be fixed. In this case it will be deprecated first and removed in later version.
Most algorithms require its own feature flag to be enabled.
no-std support
If algorithm requires std its feature name will have -std suffix and enable std feature.
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.
Contributions
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.