When using a heap, the priority is often not the same as the natural Ord of a type.
Would it make sense to implement a BinaryHeap replacement similar to IdOrdMap?
I think it would make sense to use another trait than IdOrdItem for the priority, so that they can differ.
When using a heap, the priority is often not the same as the natural
Ordof a type.Would it make sense to implement a
BinaryHeapreplacement similar toIdOrdMap?I think it would make sense to use another trait than
IdOrdItemfor the priority, so that they can differ.