dataStructuresAndAlgorithms/dev.funkymuse.datastructuresandalgorithms.linkedList/LinkedList

LinkedList

class LinkedList<T> : Iterable<T> , Collection<T> , MutableIterable<T> , MutableCollection<T> , Serializable, Cloneable

Constructors

LinkedList

constructor()

Properties

size

open override var size: Int

Functions

add

open override fun add(element: T): Boolean

addAll

open override fun addAll(elements: Collection<T>): Boolean

append

fun append(value: T)

Adds an element to the end of the list a.k.a the tail Time complexity O(1)

clear

open override fun clear()

contains

open operator override fun contains(element: T): Boolean

Checks whether the element is in the list Time complexity O(n)

containsAll

open override fun containsAll(elements: Collection<T>): Boolean

Checks whether the elements are present into the list Time complexity O(n^2)

forEach

open fun forEach(p0: Consumer<in T>)

getMiddle

fun <T> LinkedList<T>.getMiddle(): Node<T>?

insert

fun insert(value: T, afterNode: Node<T>): Node<T>

Insert a value after a node Time complexity O(1)

isEmpty

open override fun isEmpty(): Boolean

isNotEmpty

fun isNotEmpty(): Boolean

Checks whether the list is not empty

iterator

open operator override fun iterator(): MutableIterator<T>

mergeSorted

fun <T : Comparable<T>> LinkedList<T>.mergeSorted(otherList: LinkedList<T>): LinkedList<T>

nodeAt

fun nodeAt(index: Int): Node<T>?

Find a node at specific index Time complexity O(index) where index is the parameter

parallelStream

open fun parallelStream(): Stream<T>

pop

fun pop(): T?

Removes a value at the front of the list

printInReverse

fun <T> LinkedList<T>.printInReverse()

push

fun push(value: T): LinkedList<T>

Adds an element to the first position in the list a.k.a the head Time complexity O(1)

remove

open override fun remove(element: T): Boolean

removeAfter

fun removeAfter(node: Node<T>): T?

Remove element after a node (remove the immediate next node). Time complexity O(1)

removeAll

open override fun removeAll(elements: Collection<T>): Boolean

removeIf

open fun removeIf(p0: Predicate<in T>): Boolean

removeLast

fun removeLast(): T?

Remove the last element of the list Time complexity O(n)

retainAll

open override fun retainAll(elements: Collection<T>): Boolean

reversed

fun <T> LinkedList<T>.reversed(): LinkedList<T>

spliterator

open fun spliterator(): Spliterator<T>

stream

open fun stream(): Stream<T>

toArray

open fun <T : Any> ~~toArray~~(p0: IntFunction<Array<T>>): Array<T>

toString

open override fun toString(): String