I need a heap where I can supply my own ordering function: ordering : a -> a -> Order
And be able to take the smallest item from the heap: Heap.least : Heap a -> a There is this one: http://package.elm-lang.org/packages/TSFoster/elm-heap/latest Any others? -- You received this message because you are subscribed to the Google Groups "Elm Discuss" group. To unsubscribe from this group and stop receiving emails from it, send an email to elm-discuss+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
