PriorityQueue

[iamkisly]

Investigating DotNetty I found a class whose meaning I cannot understand. This is a PriorityQueue, and it implements the basic methods of a regular queue .. but unlike System.Collections.Generic.Queue, the Enqueue and Dequeue methods do not work like a FIFO, but shuffle the data entering the queue. Tell me why this is done like this?

[sven-n]

It's because it's an implementation of a min-max heap.