Are there wait-free priority queue crates?

Дата публикации: 05-10-2026 21:56:07

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
Read full topic

Схожие новости

#	Наименование новости	Тональность	Информативность	Дата публикации
1	Does my lockfree stack impl look correct?	0	6.06	05-10-2026
2	Any thin wrapper around the Web Worker API?	0	6.59	07-10-2026
3	Crate async_trait - error future created by async block is not Send	0	5.4	05-10-2026
4	Type erasure and dyn lifetime in a NonNull/Box struct field	0	8.55	04-10-2026
5	Arena's and alignment	0	7.3	04-10-2026
6	What's everyone working on this week (41/2026)?	0	20.34	06-10-2026
7	Why no Dependent Matrix Type?	0	5.16	08-10-2026
8	Why is f32/f64::sqrt not const?	0	22.72	06-10-2026
9	Toasty, an async ORM for Rust, is now on crates.io	0	10	03-04-2026
10	Architecture review of a Hyper/Tower-based web framework (Toxi)	0	15.46	06-10-2026

Классификация: . Схожих патентов: 0. Схожих новостей: 10. Тональность: 0. Информативность: 16.09. Источник: users.rust-lang.org.