Our great sponsors
-
datastructu-rs
A small implementation of a binary heap, based on an array (or more specifically a Vec) in Rust.
Like u/svetlin_zarev said, you could use the newtype pattern. Your "priority value" obviously has to implement Ord, because you somehow need to be able to order it. I recently implemented a binary heap myself, if you look of one of my examples I provide I exactly do that. I have struct, that's essentially a touple of priority and your non Ord type. I then proceed to implement Ord (and the neccessary other traits) for this struct by using the Ord implementation of the priority value
-
InfluxDB
Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
Related posts
- Embeddings are a good starting point for the AI curious app developer
- Reverie – A user space system-call interception framework for Linux
- Show HN: Iceoryx2 v0.3.0 released – zero-copy IPC middleware in Rust
- ATAC: A simple API client (postman like) in your terminal
- Hermit is a hermetic and reproducible sandbox for running programs