The crate search on lib.rs really likes to offer 'lock-free' instead of 'wait-free', and I need the latter.
The API I need is: .insert(), .first(), .pop_first() (on integers), which is any of BinaryHeap<u64>, BTreeSet<u64>.
2 posts - 2 participants
