Options
All
  • Public
  • Public/Protected
  • All
Menu

Class LinkedStack

A custom structure to handle the Linked stack. It's a stack where each item is a Node and each Node linked with the previous.

It's required to receive the previous node and insert the calculated node into some index (where the pair was) and update links between other nodes

Hierarchy

  • LinkedStack

Index

Properties

Methods

Properties

data

data: Node[] = []

Methods

addNode

  • addNode(value: string | number): void

addNodeToIndex

  • addNodeToIndex(value: number, index: number): void

  • Adds a node to the specific index in stack

    Parameters

    • value: number

      node value

    • index: number

      index in the stack where node should be placed

    Returns void

drainDreviousNode

  • drainDreviousNode(node: Node): null | Node

  • Returns the previous node of the passed node. The previous node will be removed from stack.

    Parameters

    Returns null | Node

Private drainNode

  • Removes the passed node from stack and returns it Yeah, why should we return it if we already received it. Answer: To keep things consistent

    Parameters

    Returns Node

findAndDrainNodeByCondition

  • findAndDrainNodeByCondition(callback: (node: Node) => boolean): null | Node

  • Finds a node by passed callback via [].find method. This node will be removed from stack.

    Parameters

    • callback: (node: Node) => boolean

      a callback for JS [].'find' method

        • (node: Node): boolean

        • Parameters

          Returns boolean

    Returns null | Node

getLastNode

  • getLastNode(): Node

isExausted

  • isExausted(): boolean

reset

  • reset(): void

updateNodes

  • updateNodes(): void

  • Updates links in all nodes. Required after some node was inserted between stack items

    Returns void

Generated using TypeDoc