Re: [Haskell-cafe] Help with package/module naming

I take that second bit back. There do seem to be some interesting things people have tried. But what I'm talking about are plain priority queues. On Mon, May 15, 2023 at 5:15 PM David Feuer wrote:

Sorry I missed your message. Yes, these are priority queues. I don't know of any particularly interesting ways to implement priority search queues in a purely functional way.

On Tue, May 9, 2023 at 3:55 AM Henning Thielemann wrote:

...

On Tue, 9 May 2023, David Feuer wrote:

...

I'm currently putting the finishing touches on the first version of a new priority queue package. It implements amortized-optimal priority queues and is intended to compete with the heaps package with a simpler, more compact, and hopefully faster implementation†. The main types are key-only and key-value priority queues, which I'm naming based on the conventions of the pqueue package: data MinQueue k data MinPQueue k a data MaxQueue k data MaxPQueue k a

These are priority queues, not priority search queues, right?