|0.1.1||Oct 21, 2021|
|0.1.0||Oct 17, 2021|
#644 in Concurrency
This crate provides garbage collection using hyaline algorithm for building concurrent data structures.
When a thread removes an object from a concurrent data structure, other threads may be still using pointers to it at the same time, so it cannot be destroyed immediately. Hyaline based garbage collection is an alternative to epoch based garabge collection to defer the destruction of these shared objects until no pointers to them can exist.
see Snapshot-Free, Transparent, and Robust Memory Reclamation for Lock-Free Data Structures for further details.
This crate requires nightly.
Add this to your
[dependencies] hyaline_smr = "0.1"
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.
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.