kresil-lib/kresil.core.utils/CircularDoublyLinkedList

CircularDoublyLinkedList

internal class CircularDoublyLinkedList<T> : Queue<T> (source)

Provides a basic implementation of an intrusive circular doubly linked non-thread safe list. Allows for efficient insertion or removal of elements from any position in the list, as the nodes are not stored contiguously in memory (unlike an array).

Constructors

constructor()

Types

NodeImpl

private class NodeImpl<T>(val maybeValue: T?) : Node<T>

Properties

empty

val empty: Boolean

Checks if the list is empty.

head

private val head: CircularDoublyLinkedList.NodeImpl<T>

headNode

val headNode: Node<T>?

If the list is not empty, returns the head node otherwise returns null.

headValue

val headValue: T?

If the list is not empty, returns the value of the head node otherwise returns null.

notEmpty

val notEmpty: Boolean

Checks if the list is not empty.

size

open override var size: Int

Returns the number of elements in the queue.

Functions

dequeue

open suspend override fun dequeue(): Node<T>

Dequeues the head element from the queue.

enqueue

open suspend override fun enqueue(value: T): Node<T>

Enqueues a new element into the queue.

headCondition

open suspend override fun headCondition(cond: (T) -> Boolean): Boolean

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

isHeadNode

fun isHeadNode(node: Node<T>): Boolean

Checks if the given node is the head node.

remove

open suspend override fun remove(node: Node<T>)

Removes a specific node from the queue.