We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 910b0d2 commit 74a7981Copy full SHA for 74a7981
README.md
@@ -54,6 +54,7 @@ In addition, queue implementations are provided in this crate for the following
54
* `std::collections::BinaryHeap<(N, K)>` implements only `PriorityQueue<N, K>`,
55
* `priority_queue:PriorityQueue<N, K>` implements both `PriorityQueue<N, K>` and `PriorityQueueDecKey<N, K>`
56
* requires `--features impl_priority_queue`
57
+ * or `--features impl_all`
58
59
This allows to use all the queue implementations interchangeably and pick the one fitting best to the use case.
60
0 commit comments