data-structure-typed 1.12.10 → 1.12.21

package/dist/data-structures/queue/queue.js

@@ -3,7 +3,7 @@ Object.defineProperty(exports, "__esModule", { value: true });
 exports.Queue = void 0;
 /**
  * @license MIT
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
+ * @copyright Tyler Zeng <zrwusa@gmail.com>
  * @class
  */
 var Queue = /** @class */ (function () {
@@ -29,11 +29,11 @@ var Queue = /** @class */ (function () {
         return new Queue(elements);
     };
     /**
-     * The offer function adds an element to the end of the queue and returns the updated queue.Adds an element at the back of the queue.
+     * The add function adds an element to the end of the queue and returns the updated queue.Adds an element at the back of the queue.
      * @param {T} element - The `element` parameter represents the element that you want to add to the queue.
-     * @returns The `offer` method is returning a `Queue<T>` object.
+     * @returns The `add` method is returning a `Queue<T>` object.
      */
-    Queue.prototype.offer = function (element) {
+    Queue.prototype.add = function (element) {
         this._nodes.push(element);
         return this;
     };

package/dist/data-structures/stack/stack.d.ts

@@ -1,6 +1,6 @@
 /**
  * @license MIT
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
+ * @copyright Tyler Zeng <zrwusa@gmail.com>
  * @class
  */
 export declare class Stack<T> {

package/dist/data-structures/stack/stack.js

@@ -3,7 +3,7 @@ Object.defineProperty(exports, "__esModule", { value: true });
 exports.Stack = void 0;
 /**
  * @license MIT
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
+ * @copyright Tyler Zeng <zrwusa@gmail.com>
  * @class
  */
 var Stack = /** @class */ (function () {

package/dist/data-structures/trie/trie.d.ts

@@ -1,6 +1,9 @@
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 export declare class TrieNode {
     protected _value: string;
@@ -19,7 +22,7 @@ export declare class Trie {
     protected _root: TrieNode;
     get root(): TrieNode;
     set root(v: TrieNode);
-    put(word: string): boolean;
+    add(word: string): boolean;
     has(input: string): boolean;
     remove(word: string): boolean;
     /**

package/dist/data-structures/trie/trie.js

@@ -13,8 +13,11 @@ var __values = (this && this.__values) || function(o) {
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.Trie = exports.TrieNode = void 0;
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 var TrieNode = /** @class */ (function () {
     function TrieNode(v) {
@@ -63,7 +66,7 @@ var Trie = /** @class */ (function () {
             try {
                 for (var words_1 = __values(words), words_1_1 = words_1.next(); !words_1_1.done; words_1_1 = words_1.next()) {
                     var i = words_1_1.value;
-                    this.put(i);
+                    this.add(i);
                 }
             }
             catch (e_1_1) { e_1 = { error: e_1_1 }; }
@@ -85,7 +88,7 @@ var Trie = /** @class */ (function () {
         enumerable: false,
         configurable: true
     });
-    Trie.prototype.put = function (word) {
+    Trie.prototype.add = function (word) {
         var e_2, _a;
         var cur = this._root;
         try {

package/dist/utils/index.d.ts

@@ -1 +1,2 @@
 export * from './utils';
+export * from './types';

package/dist/utils/index.js

@@ -15,3 +15,4 @@ var __exportStar = (this && this.__exportStar) || function(m, exports) {
 };
 Object.defineProperty(exports, "__esModule", { value: true });
 __exportStar(require("./utils"), exports);
+__exportStar(require("./types"), exports);

package/dist/utils/types/utils.d.ts

@@ -1,3 +1,10 @@
+export type JSONSerializable = {
+    [key: string]: any;
+};
+export type JSONValue = string | number | boolean | undefined | JSONObject;
+export interface JSONObject {
+    [key: string]: JSONValue;
+}
 export type AnyFunction<A extends any[] = any[], R = any> = (...args: A) => R;
 export type Primitive = number | string | boolean | symbol | undefined | null | void | AnyFunction | Date;
 export type Cast<T, TComplex> = {
@@ -6,13 +13,6 @@ export type Cast<T, TComplex> = {
 export type DeepLeavesWrap<T, TComplex> = T extends string ? Cast<string, TComplex> : T extends number ? Cast<number, TComplex> : T extends boolean ? Cast<boolean, TComplex> : T extends undefined ? Cast<undefined, TComplex> : T extends null ? Cast<null, TComplex> : T extends void ? Cast<void, TComplex> : T extends symbol ? Cast<symbol, TComplex> : T extends AnyFunction ? Cast<AnyFunction, TComplex> : T extends Date ? Cast<Date, TComplex> : {
     [K in keyof T]: T[K] extends (infer U)[] ? DeepLeavesWrap<U, TComplex>[] : DeepLeavesWrap<T[K], TComplex>;
 };
-export type JSONSerializable = {
-    [key: string]: any;
-};
-export type JSONValue = string | number | boolean | undefined | JSONObject;
-export interface JSONObject {
-    [key: string]: JSONValue;
-}
 export type TypeName<T> = T extends string ? 'string' : T extends number ? 'number' : T extends boolean ? 'boolean' : T extends undefined ? 'undefined' : T extends AnyFunction ? 'function' : 'object';
 export type JsonKeys<T> = keyof {
     [P in keyof T]: number;
@@ -51,10 +51,8 @@ export type DeepProxyOnChange = (target: any, property: string | symbol, value:
 export type DeepProxyOnGet = (target: any, property: string | symbol, value: any, receiver: any, descriptor: any, result: any) => void;
 export type CurryFunc<T> = T extends (...args: infer Args) => infer R ? Args extends [infer Arg, ...infer RestArgs] ? (arg: Arg) => CurryFunc<(...args: RestArgs) => R> : R : T;
 export type ToThunkFn = () => ReturnType<TrlFn>;
-declare const THUNK_SYMBOL: unique symbol;
 export type Thunk = () => ReturnType<ToThunkFn> & {
-    __THUNK__: typeof THUNK_SYMBOL;
+    __THUNK__: Symbol;
 };
 export type TrlFn = (...args: any[]) => any;
 export type TrlAsyncFn = (...args: any[]) => any;
-export {};

package/dist/utils/types/utils.js

@@ -52,4 +52,3 @@ var TreeNode = /** @class */ (function () {
     return TreeNode;
 }());
 exports.TreeNode = TreeNode;
-var THUNK_SYMBOL = Symbol('thunk');

package/dist/utils/utils.d.ts

@@ -1,11 +1,4 @@
-import { AnyFunction } from './types';
-export type JSONSerializable = {
-    [key: string]: any;
-};
-export type JSONValue = string | number | boolean | undefined | JSONObject;
-export interface JSONObject {
-    [key: string]: JSONValue;
-}
+import type { AnyFunction, JSONObject, JSONSerializable } from './types';
 export declare function randomText(length: number): string;
 export declare const uuidV4: () => string;
 export declare class IncrementId {
@@ -103,3 +96,20 @@ export declare function zip<T = number, T1 = number>(array1: T[], array2: T1[],
     x: T;
     y: T1;
 }[];
+/**
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
+ */
+import { Thunk, ToThunkFn, TrlAsyncFn, TrlFn } from './types';
+export declare const THUNK_SYMBOL: unique symbol;
+export declare const isThunk: (fnOrValue: any) => boolean;
+export declare const toThunk: (fn: ToThunkFn) => Thunk;
+export declare const trampoline: (fn: TrlFn) => ((...args: [...Parameters<TrlFn>]) => any) & {
+    cont: (...args: [...Parameters<TrlFn>]) => Thunk;
+};
+export declare const trampolineAsync: (fn: TrlAsyncFn) => ((...args: [...Parameters<TrlAsyncFn>]) => Promise<any>) & {
+    cont: (...args: [...Parameters<TrlAsyncFn>]) => Thunk;
+};

package/dist/utils/utils.js

@@ -10,29 +10,6 @@ var __assign = (this && this.__assign) || function () {
     };
     return __assign.apply(this, arguments);
 };
-var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    var desc = Object.getOwnPropertyDescriptor(m, k);
-    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
-      desc = { enumerable: true, get: function() { return m[k]; } };
-    }
-    Object.defineProperty(o, k2, desc);
-}) : (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    o[k2] = m[k];
-}));
-var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
-    Object.defineProperty(o, "default", { enumerable: true, value: v });
-}) : function(o, v) {
-    o["default"] = v;
-});
-var __importStar = (this && this.__importStar) || function (mod) {
-    if (mod && mod.__esModule) return mod;
-    var result = {};
-    if (mod != null) for (var k in mod) if (k !== "default" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);
-    __setModuleDefault(result, mod);
-    return result;
-};
 var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {
     function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
     return new (P || (P = Promise))(function (resolve, reject) {
@@ -105,9 +82,12 @@ var __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {
     }
     return to.concat(ar || Array.prototype.slice.call(from));
 };
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.zip = exports.memo = exports.arrayRemove = exports.timeEnd = exports.timeStart = exports.bunnyConsole = exports.deepAdd = exports.deepReplaceValues = exports.deepRenameKeys = exports.deepRemoveByKey = exports.deepKeysConvert = exports.StringUtil = exports.diffAB = exports.onlyInB = exports.onlyInA = exports.comparerArray = exports.capitalizeFirstLetter = exports.capitalizeWords = exports.randomDate = exports.minuted = exports.keyValueToArray = exports.extractValue = exports.wait = exports.WaitManager = exports.addDays = exports.isLeafParent = exports.isSameStructure = exports.reverseColor = exports.deepObjectStrictEqual = exports.strictObjectIsEqual = exports.strictEqual = exports.looseEqual = exports.isObject = exports.getValue = exports.incrementId = exports.IncrementId = exports.uuidV4 = exports.randomText = void 0;
-var _ = __importStar(require("lodash"));
+exports.trampolineAsync = exports.trampoline = exports.toThunk = exports.isThunk = exports.THUNK_SYMBOL = exports.zip = exports.memo = exports.arrayRemove = exports.timeEnd = exports.timeStart = exports.bunnyConsole = exports.deepAdd = exports.deepReplaceValues = exports.deepRenameKeys = exports.deepRemoveByKey = exports.deepKeysConvert = exports.StringUtil = exports.diffAB = exports.onlyInB = exports.onlyInA = exports.comparerArray = exports.capitalizeFirstLetter = exports.capitalizeWords = exports.randomDate = exports.minuted = exports.keyValueToArray = exports.extractValue = exports.wait = exports.WaitManager = exports.addDays = exports.isLeafParent = exports.isSameStructure = exports.reverseColor = exports.deepObjectStrictEqual = exports.strictObjectIsEqual = exports.strictEqual = exports.looseEqual = exports.isObject = exports.getValue = exports.incrementId = exports.IncrementId = exports.uuidV4 = exports.randomText = void 0;
+var lodash_1 = __importDefault(require("lodash"));
 function randomText(length) {
     var result = '';
     var characters = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789';
@@ -396,7 +376,7 @@ var comparerArray = function (otherArray, limitKeys) {
     return function (current) {
         return otherArray.filter(function (other) {
             if (!limitKeys) {
-                return _.isEqual(current, other);
+                return lodash_1.default.isEqual(current, other);
             }
             else {
                 // TODO
@@ -416,43 +396,43 @@ var StringUtil = /** @class */ (function () {
     }
     // camelCase
     StringUtil.toCamelCase = function (str) {
-        return _.camelCase(str);
+        return lodash_1.default.camelCase(str);
     };
     // snake_case
     StringUtil.toSnakeCase = function (str) {
-        return _.snakeCase(str);
+        return lodash_1.default.snakeCase(str);
     };
     // PascalCase
     StringUtil.toPascalCase = function (str) {
-        return _.startCase(_.camelCase(str)).replace(/ /g, '');
+        return lodash_1.default.startCase(lodash_1.default.camelCase(str)).replace(/ /g, '');
     };
     // CONSTANT_CASE
     StringUtil.toConstantCase = function (str) {
-        return _.upperCase(str).replace(/ /g, '_');
+        return lodash_1.default.upperCase(str).replace(/ /g, '_');
     };
     // kebab-case
     StringUtil.toKebabCase = function (str) {
-        return _.kebabCase(str);
+        return lodash_1.default.kebabCase(str);
     };
     // lowercase
     StringUtil.toLowerCase = function (str) {
-        return _.lowerCase(str).replace(/ /g, '');
+        return lodash_1.default.lowerCase(str).replace(/ /g, '');
     };
     // Title Case
     StringUtil.toTitleCase = function (str) {
-        return _.startCase(_.camelCase(str));
+        return lodash_1.default.startCase(lodash_1.default.camelCase(str));
     };
     // Sentence case
     StringUtil.toSentenceCase = function (str) {
-        return _.upperFirst(_.lowerCase(str));
+        return lodash_1.default.upperFirst(lodash_1.default.lowerCase(str));
     };
     // path/case
     StringUtil.toPathCase = function (str) {
-        return _.lowerCase(str).replace(/ /g, '/');
+        return lodash_1.default.lowerCase(str).replace(/ /g, '/');
     };
     // dot.case
     StringUtil.toDotCase = function (str) {
-        return _.lowerCase(str).replace(/ /g, '.');
+        return lodash_1.default.lowerCase(str).replace(/ /g, '.');
     };
     return StringUtil;
 }());
@@ -508,27 +488,27 @@ var deepKeysConvert = function (obj, toType) {
 };
 exports.deepKeysConvert = deepKeysConvert;
 var deepRemoveByKey = function (obj, keysToBeRemoved) {
-    var result = _.transform(obj, function (result, value, key) {
-        if (_.isObject(value)) {
+    var result = lodash_1.default.transform(obj, function (result, value, key) {
+        if (lodash_1.default.isObject(value)) {
             value = (0, exports.deepRemoveByKey)(value, keysToBeRemoved);
         }
         if (!keysToBeRemoved.includes(key)) {
-            _.isArray(obj) ? result.push(value) : result[key] = value;
+            lodash_1.default.isArray(obj) ? result.push(value) : result[key] = value;
         }
     });
     return result;
 };
 exports.deepRemoveByKey = deepRemoveByKey;
 var deepRenameKeys = function (obj, keysMap) {
-    return _.transform(obj, function (result, value, key) {
+    return lodash_1.default.transform(obj, function (result, value, key) {
         var currentKey = keysMap[key] || key;
-        result[currentKey] = _.isObject(value) ? (0, exports.deepRenameKeys)(value, keysMap) : value;
+        result[currentKey] = lodash_1.default.isObject(value) ? (0, exports.deepRenameKeys)(value, keysMap) : value;
     });
 };
 exports.deepRenameKeys = deepRenameKeys;
 var deepReplaceValues = function (obj, keyReducerMap) {
-    var newObject = _.clone(obj);
-    _.each(obj, function (val, key) {
+    var newObject = lodash_1.default.clone(obj);
+    lodash_1.default.each(obj, function (val, key) {
         for (var item in keyReducerMap) {
             if (key === item) {
                 newObject[key] = keyReducerMap[item](newObject);
@@ -543,14 +523,14 @@ var deepReplaceValues = function (obj, keyReducerMap) {
 exports.deepReplaceValues = deepReplaceValues;
 // TODO determine depth and pass root node as a param through callback
 var deepAdd = function (obj, keyReducerMap, isItemRootParent) {
-    var newObject = _.clone(obj);
-    if (_.isObject(newObject) && !_.isArray(newObject)) {
+    var newObject = lodash_1.default.clone(obj);
+    if (lodash_1.default.isObject(newObject) && !lodash_1.default.isArray(newObject)) {
         for (var item in keyReducerMap) {
             newObject[item] = keyReducerMap[item](newObject);
         }
     }
-    _.each(obj, function (val, key) {
-        if (_.isObject(val)) {
+    lodash_1.default.each(obj, function (val, key) {
+        if (lodash_1.default.isObject(val)) {
             for (var item in keyReducerMap) {
                 // @ts-ignore
                 newObject[key] = (0, exports.deepAdd)(val, keyReducerMap, isItemRootParent);
@@ -649,3 +629,69 @@ function zip(array1, array2, options) {
     return isToObj ? zippedObjCoords : zipped;
 }
 exports.zip = zip;
+exports.THUNK_SYMBOL = Symbol('thunk');
+var isThunk = function (fnOrValue) {
+    return typeof fnOrValue === 'function' && fnOrValue.__THUNK__ === exports.THUNK_SYMBOL;
+};
+exports.isThunk = isThunk;
+var toThunk = function (fn) {
+    var thunk = function () { return fn(); };
+    thunk.__THUNK__ = exports.THUNK_SYMBOL;
+    return thunk;
+};
+exports.toThunk = toThunk;
+var trampoline = function (fn) {
+    var cont = function () {
+        var args = [];
+        for (var _i = 0; _i < arguments.length; _i++) {
+            args[_i] = arguments[_i];
+        }
+        return (0, exports.toThunk)(function () { return fn.apply(void 0, __spreadArray([], __read(args), false)); });
+    };
+    return Object.assign(function () {
+        var args = [];
+        for (var _i = 0; _i < arguments.length; _i++) {
+            args[_i] = arguments[_i];
+        }
+        var result = fn.apply(void 0, __spreadArray([], __read(args), false));
+        while ((0, exports.isThunk)(result) && typeof result === 'function') {
+            result = result();
+        }
+        return result;
+    }, { cont: cont });
+};
+exports.trampoline = trampoline;
+var trampolineAsync = function (fn) {
+    var cont = function () {
+        var args = [];
+        for (var _i = 0; _i < arguments.length; _i++) {
+            args[_i] = arguments[_i];
+        }
+        return (0, exports.toThunk)(function () { return fn.apply(void 0, __spreadArray([], __read(args), false)); });
+    };
+    return Object.assign(function () {
+        var args = [];
+        for (var _i = 0; _i < arguments.length; _i++) {
+            args[_i] = arguments[_i];
+        }
+        return __awaiter(void 0, void 0, void 0, function () {
+            var result;
+            return __generator(this, function (_a) {
+                switch (_a.label) {
+                    case 0: return [4 /*yield*/, fn.apply(void 0, __spreadArray([], __read(args), false))];
+                    case 1:
+                        result = _a.sent();
+                        _a.label = 2;
+                    case 2:
+                        if (!((0, exports.isThunk)(result) && typeof result === 'function')) return [3 /*break*/, 4];
+                        return [4 /*yield*/, result()];
+                    case 3:
+                        result = _a.sent();
+                        return [3 /*break*/, 2];
+                    case 4: return [2 /*return*/, result];
+                }
+            });
+        });
+    }, { cont: cont });
+};
+exports.trampolineAsync = trampolineAsync;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "data-structure-typed",
-  "version": "1.12.10",
+  "version": "1.12.21",
   "description": "Explore our comprehensive Javascript Data Structure / TypeScript Data Structure Library, meticulously crafted to empower developers with a versatile set of essential data structures. Our library includes a wide range of data structures, such as Binary Tree, AVL Tree, Binary Search Tree (BST), Tree Multiset, Segment Tree, Binary Indexed Tree, Graph, Directed Graph, Undirected Graph, Singly Linked List, Hash, CoordinateSet, CoordinateMap, Heap, Doubly Linked List, Priority Queue, Max Priority Queue, Min Priority Queue, Queue, ObjectDeque, ArrayDeque, Stack, and Trie. Each data structure is thoughtfully designed and implemented using TypeScript to provide efficient, reliable, and easy-to-use solutions for your programming needs. Whether you're optimizing algorithms, managing data, or enhancing performance, our TypeScript Data Structure Library is your go-to resource. Elevate your coding experience with these fundamental building blocks for software development.",
   "main": "dist/index.js",
   "scripts": {
@@ -39,8 +39,8 @@
     "Min Priority Queue",
     "Trie"
   ],
-  "author": "Tyler Zeng",
-  "license": "ISC",
+  "author": "Tyler Zeng zrwusa@gmail.com",
+  "license": "MIT",
   "bugs": {
     "url": "https://github.com/zrwusa/data-structure-typed/issues"
   },

package/src/data-structures/binary-tree/avl-tree.ts

@@ -1,11 +1,20 @@
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 import {BST, BSTNode} from './bst';
 import type {AVLTreeDeleted, BinaryTreeNodeId} from '../types';
 
 export class AVLTreeNode<T> extends BSTNode<T> {
+    /**
+     * The function overrides the clone method of the AVLTreeNode class to create a new AVLTreeNode object with the same
+     * id, value, and count.
+     * @returns The method is returning a new instance of the AVLTreeNode class with the same id, val, and count values as
+     * the current instance.
+     */
     override clone(): AVLTreeNode<T> {
         return new AVLTreeNode<T>(this.id, this.val, this.count);
     }
@@ -18,9 +27,9 @@ export class AVLTree<T> extends BST<T> {
     }
 
     /**
-     * The function overrides the put method of a Binary Search Tree to insert a node with a given id and value, and then
+     * The function overrides the add method of a Binary Search Tree to insert a node with a given id and value, and then
      * balances the tree.
-     * @param {BinaryTreeNodeId} id - The `id` parameter is the identifier of the binary tree node that we want to put or
+     * @param {BinaryTreeNodeId} id - The `id` parameter is the identifier of the binary tree node that we want to add or
      * update in the AVL tree.
      * @param {T | null} val - The `val` parameter represents the value that you want to assign to the node with the given
      * `id`. It can be of type `T` (the generic type) or `null`.
@@ -29,8 +38,8 @@ export class AVLTree<T> extends BST<T> {
      * to `1`, indicating that the value should be inserted once.
      * @returns The method is returning either an AVLTreeNode<T> object or null.
      */
-    override put(id: BinaryTreeNodeId, val: T | null, count?: number): AVLTreeNode<T> | null {
-        const inserted = super.put(id, val, count);
+    override add(id: BinaryTreeNodeId, val: T | null, count?: number): AVLTreeNode<T> | null {
+        const inserted = super.add(id, val, count);
         if (inserted) this.balancePath(inserted);
         return inserted;
     }

package/src/data-structures/binary-tree/binary-indexed-tree.ts

@@ -1,10 +1,19 @@
 /**
- * @copyright 2030 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
  */
 export class BinaryIndexedTree {
     private readonly _sumTree: number[];
 
+    /**
+     * The constructor initializes an array with a specified length and fills it with zeros.
+     * @param {number} n - The parameter `n` represents the size of the array that will be used to store the sum tree. The
+     * sum tree is a binary tree data structure used to efficiently calculate the sum of a range of elements in an array.
+     * The size of the sum tree array is `n + 1` because
+     */
     constructor(n: number) {
         this._sumTree = new Array<number>(n + 1).fill(0);
     }