dataStructuresAndAlgorithms/dev.funkymuse.datastructuresandalgorithms.queue.priority.comparator/ComparatorPriorityQueue

ComparatorPriorityQueue

class ComparatorPriorityQueue<T>(comparator: Comparator<T>) : AbstractPriorityQueue<T>

Constructors

ComparatorPriorityQueue

constructor(comparator: Comparator<T>)

Properties

open override val count: Int

open override val heap: Heap<T>

open override val isEmpty: Boolean

open val isNotEmpty: Boolean

Functions

open override fun dequeue(): T?

open override fun enqueue(element: T): Boolean

open override fun peek(): T?

fun <T> Queue<T>.reverse()