ewildgoose / elixir_priority_queue Goto Github PK

Thanks for building this library! I have a big feature request which you should feel totally free to ignore. :) I maintain some OSS projects, and understand that you're doing this on your own time. But if you'd enjoy implementing it, I'd love to have a max heap priority queue available.

If my priorities were simple integers, I could just multiply them by -1 to get this effect. But they are not. Actually, that's why I found and like your library - the the first one I found requires integer priorities. I need to use either lists or tuples, and I want [1,1] to be higher priority than [1]. I don't see a way around the fact that Elixir/Erlang considers [1,1] to be the larger of the two, so in order to prioritize it, I'd need for my priority queue to return the largest values first.

Again, ignore this if you don't want to implement it. I might possibly someday get around to trying it myself if you don't. But if you think this sounds interesting and fun, woohoo! :)

Thanks again for sharing your work.