A modern programming language that makes developers happier.

kotlinlang

Does Kotlin has a `sorted queue` that I can use for KMP project? Java has `PriorityQueue` but I can’t use that for KMP. <https://kotlinlang.slack.com/archives/C3PQML5NU/p1605468900029500?thread_ts=1605467350.029400&amp;cid=C3PQML5NU|This message> suggests `ArrayQueue`  but it doesn’t have a Comparator that I can override

If you just want something that works today, use a normal list and do a binary search to find insertion index for new items

or write a binary heap, it's not that much code

<https://kotlinlang.slack.com/archives/C0B8MA7FA/p1672352605392049?thread_ts=1672351334.674819&amp;cid=C0B8MA7FA|https://kotlinlang.slack.com/archives/C0B8MA7FA/p1672352605392049?thread_ts=1672351334.674819&amp;cid=C0B8MA7FA>

I’ve got some MinHeap priority queue lying around that came from this thread: <https://codereview.stackexchange.com/questions/175291/minimum-priority-queue-implementation-in-kotlin|https://codereview.stackexchange.com/questions/175291/minimum-priority-queue-implementation-in-kotlin>

Just in case, this is <https://github.com/badoo/Reaktive/blob/version-2.0/reaktive/src/commonMain/kotlin/com/badoo/reaktive/utils/queue/PriorityQueue.kt|PriorityQueue> that I've been using so far.

also, if you have any interest in writing a Fibonacci heap instead of a binary heap, <https://youtu.be/6JxvKfSV9Ns> is a good introduction (but a binary heap is almost always good enough)