ixfx
    Preparing search index...

    Class StackImmutable<V>

    Stack (immutable)

    stack.push(item); // Return a new stack with item(s) added
    stack.pop();      // Return a new stack with top-most item removed (ie. newest)
    stack.peek;       // Return what is at the top of the stack or undefined if empty
    stack.isEmpty;
    stack.isFull;
    stack.length;     // How many items in stack
    stack.data;       // Get the underlying array

    let sanga = new Stack();
    sanga = sanga.push(`bread`, `tomato`, `cheese`);
    sanga.peek;  // `cheese`
    sanga = sanga.pop(); // removes `cheese`
    sanga.peek;  // `tomato`
    const sangaAlt = sanga.push(`lettuce`, `cheese`); // sanga stays [`bread`, `tomato`], while sangaAlt is [`bread`, `tomato`, `lettuce`, `cheese`]

    Stack can also be created from the basis of an existing array. First index of array will be the bottom of the stack. Stack

    Type Parameters

    • V

      Type of stored items

    Implements

    Index

    Accessors

    isEmpty isFull length peek

    Constructors

    constructor

    Methods

    forEach forEachFromTop pop push

    Properties

    data

    Accessors

    • get peek(): undefined | V

      Get the item at the top of the stack without removing it (like pop would do)

      Returns undefined | V

      Item at the top of the stack, or undefined if empty.

    Constructors

    Methods

    Properties

    data: readonly V[]

    Settings

    Member Visibility

    On This Page

    Accessors
    Constructors
    Methods
    Properties