Class CircularLinkedList

Class implements circular bidirectional linked list LinkedListElement - object of any type that has properties next and prev.

Hierarchy (view full)

LinkedList
- CircularLinkedList
  - Face

Index

Constructors

Properties

Accessors

Methods

[iterator] append insert isEmpty remove reverse setCircularLinks toArray testInfiniteLoop

Constructors

constructor

new CircularLinkedList(first?, last?): CircularLinkedList
Parameters
- first: undefined | LinkedListElement = undefined
- last: undefined | LinkedListElement = undefined
Returns CircularLinkedList
Overrides LinkedList.constructor
- Defined in src/algorithms/structures/circularLinkedList.ts:8

Properties

first

first: undefined | LinkedListElement

last

last: undefined | LinkedListElement

Accessors

size

get size(): number
Return the number of elements in the list

Returns number
number of elements in the list
Inherited from LinkedList.size
- Defined in src/algorithms/structures/linkedList.ts:41

Methods

[iterator]

[iterator](): Iterator<LinkedListElement, any, undefined>
Returns Iterator<LinkedListElement, any, undefined>
Overrides LinkedList.[iterator]
- Defined in src/algorithms/structures/circularLinkedList.ts:22

append

append(element): CircularLinkedList
Append new element to the end of the list
Parameters
- element: LinkedListElement
  new element to be appended
Returns CircularLinkedList
Overrides LinkedList.append
- Defined in src/algorithms/structures/circularLinkedList.ts:46

insert

insert(newElement, elementBefore?): CircularLinkedList
Insert new element to the list after elementBefore
Parameters
- newElement: LinkedListElement
  new element to be inserted
- OptionalelementBefore: LinkedListElement
  element in the list to insert after it
Returns CircularLinkedList
Overrides LinkedList.insert
- Defined in src/algorithms/structures/circularLinkedList.ts:58

isEmpty

isEmpty(): boolean
Return true if the list is empty

Returns boolean
Inherited from LinkedList.isEmpty
- Defined in src/algorithms/structures/linkedList.ts:165

remove

remove(element): CircularLinkedList
Remove element from the list
Parameters
- element: LinkedListElement
  element to be removed from the list
Returns CircularLinkedList
Overrides LinkedList.remove
- Defined in src/algorithms/structures/circularLinkedList.ts:72

reverse

reverse(): LinkedList
Reverse the linked list

Returns LinkedList
Inherited from LinkedList.reverse
- Defined in src/algorithms/structures/linkedList.ts:190

setCircularLinks

setCircularLinks(): void
Returns void
- Defined in src/algorithms/structures/circularLinkedList.ts:16

toArray

toArray(start?, end?): LinkedListElement[]
Return an array of elements from start to end If start or end is not defined, take the first as the start, the last as the end
Parameters
- Optionalstart: LinkedListElement
  Starting position (optional)
- Optionalend: LinkedListElement
  Ending position (optional)
Returns LinkedListElement[]
Array containing elements
Inherited from LinkedList.toArray
- Defined in src/algorithms/structures/linkedList.ts:56

`Static`testInfiniteLoop

testInfiniteLoop(first): void
Throw an error if a circular loop is detected in the linked list
Parameters
- first: LinkedListElement
  Element to start iteration
Returns void
Throws
Inherited from LinkedList.testInfiniteLoop
- Defined in src/algorithms/structures/linkedList.ts:174