Queue

interface Queue<T>(source)

Represents a queue data structure that follows the FIFO (First-In-First-Out) principle.

Properties

abstract val size: Int

Returns the number of elements in the queue.

abstract suspend fun dequeue(): Node<T>

Dequeues the head element from the queue.

abstract suspend fun enqueue(value: T): Node<T>

Enqueues a new element into the queue.

abstract suspend fun headCondition(cond: (T) -> Boolean): Boolean

Checks if the given condition on the head element of the queue is satisfied.

abstract suspend fun remove(node: Node<T>)

Removes a specific node from the queue.