/**
 * data-structure-typed
 *
 * @author Pablo Zeng
 * @copyright Copyright (c) 2022 Pablo Zeng <zrwusa@gmail.com>
 * @license MIT License
 */
export class SegmentTreeNode {
    /**
     * The constructor initializes the properties of a SegmentTreeNode object.
     * @param {number} start - The `start` parameter represents the starting index of the segment covered
     * by this node in a segment tree.
     * @param {number} end - The `end` parameter represents the end index of the segment covered by this
     * node in a segment tree.
     * @param {number} sum - The `sum` parameter represents the sum of the values in the range covered by
     * the segment tree node.
     * @param {SegmentTreeNodeVal | undefined} [value] - The `value` parameter is an optional parameter
     * of type `SegmentTreeNodeVal`. It represents the value associated with the segment tree node.
     */
    constructor(start, end, sum, value) {
        this._start = start;
        this._end = end;
        this._sum = sum;
        this._value = value || undefined;
    }
    _start = 0;
    /**
     * The function returns the value of the protected variable _start.
     * @returns The start value, which is of type number.
     */
    get start() {
        return this._start;
    }
    /**
     * The above function sets the value of the "start" property.
     * @param {number} value - The value parameter is of type number.
     */
    set start(value) {
        this._start = value;
    }
    _end = 0;
    /**
     * The function returns the value of the protected variable `_end`.
     * @returns The value of the protected property `_end`.
     */
    get end() {
        return this._end;
    }
    /**
     * The above function sets the value of the "end" property.
     * @param {number} value - The value parameter is a number that represents the new value for the end
     * property.
     */
    set end(value) {
        this._end = value;
    }
    _value = undefined;
    /**
     * The function returns the value of a segment tree node.
     * @returns The value being returned is either a `SegmentTreeNodeVal` object or `undefined`.
     */
    get value() {
        return this._value;
    }
    /**
     * The function sets the value of a segment tree node.
     * @param {SegmentTreeNodeVal | undefined} value - The `value` parameter is of type
     * `SegmentTreeNodeVal` or `undefined`.
     */
    set value(value) {
        this._value = value;
    }
    _sum = 0;
    /**
     * The function returns the value of the sum property.
     * @returns The method is returning the value of the variable `_sum`.
     */
    get sum() {
        return this._sum;
    }
    /**
     * The above function sets the value of the sum property.
     * @param {number} value - The parameter "value" is of type "number".
     */
    set sum(value) {
        this._sum = value;
    }
    _left = undefined;
    /**
     * The function returns the left child of a segment tree node.
     * @returns The `left` property of the `SegmentTreeNode` object is being returned. It is of type
     * `SegmentTreeNode` or `undefined`.
     */
    get left() {
        return this._left;
    }
    /**
     * The function sets the value of the left property of a SegmentTreeNode object.
     * @param {SegmentTreeNode | undefined} value - The value parameter is of type SegmentTreeNode or
     * undefined.
     */
    set left(value) {
        this._left = value;
    }
    _right = undefined;
    /**
     * The function returns the right child of a segment tree node.
     * @returns The `getRight()` method is returning a value of type `SegmentTreeNode` or `undefined`.
     */
    get right() {
        return this._right;
    }
    /**
     * The function sets the right child of a segment tree node.
     * @param {SegmentTreeNode | undefined} value - The `value` parameter is of type `SegmentTreeNode |
     * undefined`. This means that it can accept either a `SegmentTreeNode` object or `undefined` as its
     * value.
     */
    set right(value) {
        this._right = value;
    }
}
export class SegmentTree {
    /**
     * The constructor initializes the values, start, end, and root properties of an object.
     * @param {number[]} values - An array of numbers that will be used to build a binary search tree.
     * @param {number} [start] - The `start` parameter is the index of the first element in the `values` array that should
     * be included in the range. If no value is provided for `start`, it defaults to 0, which means the range starts from
     * the beginning of the array.
     * @param {number} [end] - The "end" parameter is the index of the last element in the "values" array that should be
     * included in the range. If not provided, it defaults to the index of the last element in the "values" array.
     */
    constructor(values, start, end) {
        start = start || 0;
        end = end || values.length - 1;
        this._values = values;
        this._start = start;
        this._end = end;
        if (values.length > 0) {
            this._root = this.build(start, end);
        }
        else {
            this._root = undefined;
            this._values = [];
        }
    }
    _values = [];
    /**
     * The function returns an array of numbers.
     * @returns An array of numbers is being returned.
     */
    get values() {
        return this._values;
    }
    _start = 0;
    /**
     * The function returns the value of the protected variable _start.
     * @returns The start value, which is of type number.
     */
    get start() {
        return this._start;
    }
    _end;
    /**
     * The function returns the value of the protected variable `_end`.
     * @returns The value of the protected property `_end`.
     */
    get end() {
        return this._end;
    }
    _root;
    /**
     * The function returns the root node of a segment tree.
     * @returns The `root` property of the class `SegmentTreeNode` or `undefined` if it is not defined.
     */
    get root() {
        return this._root;
    }
    /**
     * The build function creates a segment tree by recursively dividing the given range into smaller segments and assigning
     * the sum of values to each segment.
     * @param {number} start - The `start` parameter represents the starting index of the segment or range for which we are
     * building the segment tree.
     * @param {number} end - The "end" parameter represents the ending index of the segment or range for which we want to
     * build a segment tree.
     * @returns a SegmentTreeNode object.
     */
    build(start, end) {
        if (start > end) {
            return new SegmentTreeNode(start, end, 0);
        }
        if (start === end)
            return new SegmentTreeNode(start, end, this._values[start]);
        const mid = start + Math.floor((end - start) / 2);
        const left = this.build(start, mid);
        const right = this.build(mid + 1, end);
        const cur = new SegmentTreeNode(start, end, left.sum + right.sum);
        cur.left = left;
        cur.right = right;
        return cur;
    }
    /**
     * The function updates the value of a node in a segment tree and recalculates the sum of its children if they exist.
     * @param {number} index - The index parameter represents the index of the node in the segment tree that needs to be
     * updated.
     * @param {number} sum - The `sum` parameter represents the new value that should be assigned to the `sum` property of
     * the `SegmentTreeNode` at the specified `index`.
     * @param {SegmentTreeNodeVal} [value] - The `value` parameter is an optional value that can be assigned to the `value`
     * property of the `SegmentTreeNode` object. It is not currently used in the code, but you can uncomment the line `//
     * cur.value = value;` and pass a value for `value` in the
     * @returns The function does not return anything.
     */
    updateNode(index, sum, value) {
        const root = this.root || undefined;
        if (!root) {
            return;
        }
        const dfs = (cur, index, sum, value) => {
            if (cur.start === cur.end && cur.start === index) {
                cur.sum = sum;
                if (value !== undefined)
                    cur.value = value;
                return;
            }
            const mid = cur.start + Math.floor((cur.end - cur.start) / 2);
            if (index <= mid) {
                if (cur.left) {
                    dfs(cur.left, index, sum, value);
                }
            }
            else {
                if (cur.right) {
                    dfs(cur.right, index, sum, value);
                }
            }
            if (cur.left && cur.right) {
                cur.sum = cur.left.sum + cur.right.sum;
            }
        };
        dfs(root, index, sum, value);
    }
    /**
     * The function `querySumByRange` calculates the sum of values within a given range in a segment tree.
     * @param {number} indexA - The starting index of the range for which you want to calculate the sum.
     * @param {number} indexB - The parameter `indexB` represents the ending index of the range for which you want to
     * calculate the sum.
     * @returns The function `querySumByRange` returns a number.
     */
    querySumByRange(indexA, indexB) {
        const root = this.root || undefined;
        if (!root) {
            return 0;
        }
        if (indexA < 0 || indexB >= this.values.length || indexA > indexB) {
            return NaN;
        }
        const dfs = (cur, i, j) => {
            if (i <= cur.start && j >= cur.end) {
                // The range [i, j] completely covers the current node's range [cur.start, cur.end]
                return cur.sum;
            }
            const mid = cur.start + Math.floor((cur.end - cur.start) / 2);
            if (j <= mid) {
                if (cur.left) {
                    return dfs(cur.left, i, j);
                }
                else {
                    return NaN;
                }
            }
            else if (i > mid) {
                if (cur.right) {
                    return dfs(cur.right, i, j);
                }
                else {
                    return NaN;
                }
            }
            else {
                // Query both left and right subtrees
                let leftSum = 0;
                let rightSum = 0;
                if (cur.left) {
                    leftSum = dfs(cur.left, i, mid);
                }
                if (cur.right) {
                    rightSum = dfs(cur.right, mid + 1, j);
                }
                return leftSum + rightSum;
            }
        };
        return dfs(root, indexA, indexB);
    }
}
//# sourceMappingURL=segment-tree.js.map