Options
All
  • Public
  • Public/Protected
  • All
Menu

Doubly Linked List

Type parameters

  • T

Hierarchy

  • Linked

Implements

  • Iterable<T>

Index

Methods

Static from

  • from<T>(iter: Iterable<T>): Linked<T>
  • Create linked list from iterator

    Type parameters

    • T

    Parameters

    • iter: Iterable<T>

    Returns Linked<T>

Static of

  • of<T>(...items: T[]): Linked<T>
  • Create linked list from params

    Type parameters

    • T

    Parameters

    • Rest ...items: T[]

    Returns Linked<T>

[iterator]

  • [iterator](): Iterator<T, any, undefined>
  • Get an iterator to traverse the list items

    Returns Iterator<T, any, undefined>

items

  • items(): IterableIterator<T>
  • Get an iterator to traverse the list items

    Returns IterableIterator<T>

backItems

  • backItems(): IterableIterator<T>
  • Get an iterator that traverses the list items in reverse

    Returns IterableIterator<T>

nodes

backNodes

  • Get an iterator that traverses the list nodes in reverse

    Returns IterableIterator<LinkedNode<T>>

clear

  • clear(): void

push

  • push(val: T): LinkedNode<T>
  • push(...vals: T[]): void
  • Add an item to the end of the linked list

    Parameters

    • val: T

    Returns LinkedNode<T>

  • Add many items to the end of the linked list

    Parameters

    • Rest ...vals: T[]

    Returns void

pushNode

  • Add many nodes to the end of the linked list unsafe method, will not verify the node

    Parameters

    Returns void

unshift

  • unshift(val: T): void
  • unshift(...vals: T[]): void
  • Add an item to the head of the linked list

    Parameters

    • val: T

    Returns void

  • Add many items to the head of the linked list

    Parameters

    • Rest ...vals: T[]

    Returns void

unshiftNode

  • Add many nodes to the head of the linked list unsafe method, will not verify the node

    Parameters

    Returns void

pop

  • pop(): undefined | T
  • Remove an item from the end of the list

    Returns undefined | T

popNode

shift

  • shift(): undefined | T
  • Remove an item from the head of the list

    Returns undefined | T

shiftNode

addAfter

  • After adding an item to a node unsafe method, will not verify the node

    Parameters

    Returns void

addAfterNode

addBefore

  • Before adding an item to a node unsafe method, will not verify the node

    Parameters

    Returns void

addBeforeNode

remove

Constructors

constructor

  • Type parameters

    • T

    Returns Linked<T>

Properties

Optional head

head?: LinkedNode<T>

The first node of the linked list unsafe field

Optional last

last?: LinkedNode<T>

The last node of the linked list unsafe field

Accessors

isEmpty

  • get isEmpty(): boolean
  • Check if the linked list is empty

    Returns boolean

onlyOne

  • get onlyOne(): boolean
  • Check if there is only one item in the linked list

    Returns boolean

size

  • get size(): number
  • Get the length of the linked list

    Returns number

length

  • get length(): number
  • Get the length of the linked list

    Returns number

Generated using TypeDoc