@figliolia/data-structures/dist/cjs/MaxStack.js

Efficient data structures for every day programming

"use strict";
Object.defineProperty(exports, "__esModule", { value: true });
exports.MaxStack = void 0;
const MinMaxStack_1 = require("./MinMaxStack");
/**
 * Max Stack
 *
 * A stack maintaining a reference to it's highest weighted item
 *
 * ```typescript
 * import { MaxStack } from "@figliolia/data-structures";
 *
 * const stack = new MaxStack<number>(value => value);
 * stack.push(1); // max = 1
 * stack.push(2); // max = 2
 * stack.push(3); // max = 3
 * stack.max // 3
 * stack.pop() // max = 2
 * ```
 */
class MaxStack extends MinMaxStack_1.MinMaxStack {
    constructor() {
        super(...arguments);
        this.max = null;
    }
    get maximium() {
        return this.max === null ? null : this.extract(this.max);
    }
    setMinMax(val) {
        const value = this.extract(val);
        const max = this.maximium;
        if (max === value) {
            this.occurances++;
            return;
        }
        if (max === null || value > max) {
            this.max = val;
            this.occurances = 1;
        }
    }
    findMinMax(val) {
        const value = this.extract(val);
        if (value === this.maximium) {
            this.occurances--;
            if (this.occurances === 0) {
                this.findMax();
            }
        }
    }
    findMax() {
        let occurances = 0;
        let minValue = null;
        let min = null;
        for (const value of this.storage) {
            const currentValue = this.extract(value);
            if (minValue === null || currentValue > minValue) {
                min = value;
                occurances = 1;
                minValue = currentValue;
            }
            else if (minValue === currentValue) {
                occurances++;
            }
        }
        this.max = min;
        this.occurances = occurances;
    }
}
exports.MaxStack = MaxStack;