data-structure-typed 1.12.11 → 1.15.0

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.11",
+  "version": "1.15.0",
   "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": {
@@ -54,7 +54,7 @@
     "jest": "^29.6.2",
     "ts-jest": "^29.1.1",
     "typedoc": "^0.24.8",
-    "typescript": "^4.6.2"
+    "typescript": "^4.9.5"
   },
   "dependencies": {
     "lodash": "^4.17.21"

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

@@ -1,3 +1,3 @@
 export class AaTree {
 
-}
+}

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

@@ -30,38 +30,50 @@ export enum LoopType { iterative = 1, recursive = 2}
 
 export class BinaryTreeNode<T> {
 
-    constructor(id: BinaryTreeNodeId, val: T, count?: number) {
-        this._id = id;
-        this._val = val;
-        this._count = count ?? 1;
-    }
-
     protected _id: BinaryTreeNodeId;
-
     get id(): BinaryTreeNodeId {
         return this._id;
     }
 
+    /**
+     * Starting from TypeScript version 5.0 and onwards, the use of distinct access modifiers for Getters and Setters is not permitted. As an alternative, to ensure compatibility, it is necessary to adopt a Java-style approach for Setters (using the same name as the property) while utilizing separate method names for Getters.
+     */
+    getId(): BinaryTreeNodeId {
+        return this._id;
+    }
+
     set id(v: BinaryTreeNodeId) {
         this._id = v;
     }
 
     protected _val: T;
-
     get val(): T {
         return this._val;
     }
 
+    /**
+     * Starting from TypeScript version 5.0 and onwards, the use of distinct access modifiers for Getters and Setters is not permitted. As an alternative, to ensure compatibility, it is necessary to adopt a Java-style approach for Setters (using the same name as the property) while utilizing separate method names for Getters.
+     */
+    getVal(): T {
+        return this._val;
+    }
+
     set val(v: T) {
         this._val = v;
     }
 
     protected _left?: BinaryTreeNode<T> | null;
-
     get left(): BinaryTreeNode<T> | null | undefined {
         return this._left;
     }
 
+    /**
+     * Starting from TypeScript version 5.0 and onwards, the use of distinct access modifiers for Getters and Setters is not permitted. As an alternative, to ensure compatibility, it is necessary to adopt a Java-style approach for Setters (using the same name as the property) while utilizing separate method names for Getters.
+     */
+    getLeft(): BinaryTreeNode<T> | null | undefined {
+        return this._left;
+    }
+
     set left(v: BinaryTreeNode<T> | null | undefined) {
         if (v) {
             v.parent = this;
@@ -71,11 +83,17 @@ export class BinaryTreeNode<T> {
     }
 
     protected _right?: BinaryTreeNode<T> | null;
-
     get right(): BinaryTreeNode<T> | null | undefined {
         return this._right;
     }
 
+    /**
+     * Starting from TypeScript version 5.0 and onwards, the use of distinct access modifiers for Getters and Setters is not permitted. As an alternative, to ensure compatibility, it is necessary to adopt a Java-style approach for Setters (using the same name as the property) while utilizing separate method names for Getters.
+     */
+    getRight(): BinaryTreeNode<T> | null | undefined {
+        return this._right;
+    }
+
     set right(v: BinaryTreeNode<T> | null | undefined) {
         if (v) {
             v.parent = this;
@@ -85,45 +103,75 @@ export class BinaryTreeNode<T> {
     }
 
     protected _parent: BinaryTreeNode<T> | null | undefined;
-
     get parent(): BinaryTreeNode<T> | null | undefined {
         return this._parent;
     }
 
+    /**
+     * Starting from TypeScript version 5.0 and onwards, the use of distinct access modifiers for Getters and Setters is not permitted. As an alternative, to ensure compatibility, it is necessary to adopt a Java-style approach for Setters (using the same name as the property) while utilizing separate method names for Getters.
+     */
+    getParent(): BinaryTreeNode<T> | null | undefined {
+        return this._parent;
+    }
+
     set parent(v: BinaryTreeNode<T> | null | undefined) {
         this._parent = v;
     }
 
     protected _familyPosition: FamilyPosition = FamilyPosition.root;
-
     get familyPosition(): FamilyPosition {
         return this._familyPosition;
     }
 
+    /**
+     * Starting from TypeScript version 5.0 and onwards, the use of distinct access modifiers for Getters and Setters is not permitted. As an alternative, to ensure compatibility, it is necessary to adopt a Java-style approach for Setters (using the same name as the property) while utilizing separate method names for Getters.
+     */
+    getFamilyPosition(): FamilyPosition {
+        return this._familyPosition;
+    }
+
     set familyPosition(v: FamilyPosition) {
         this._familyPosition = v;
     }
 
     protected _count = 1;
-
     get count(): number {
         return this._count;
     }
 
+    /**
+     * Starting from TypeScript version 5.0 and onwards, the use of distinct access modifiers for Getters and Setters is not permitted. As an alternative, to ensure compatibility, it is necessary to adopt a Java-style approach for Setters (using the same name as the property) while utilizing separate method names for Getters.
+     */
+    getCount(): number {
+        return this._count;
+    }
+
     set count(v: number) {
         this._count = v;
     }
 
     protected _height = 0;
-
     get height(): number {
         return this._height;
     }
 
+    /**
+     * Starting from TypeScript version 5.0 and onwards, the use of distinct access modifiers for Getters and Setters is not permitted. As an alternative, to ensure compatibility, it is necessary to adopt a Java-style approach for Setters (using the same name as the property) while utilizing separate method names for Getters.
+     */
+    getHeight(): number {
+        return this._height;
+    }
+
     set height(v: number) {
         this._height = v;
     }
 
+    constructor(id: BinaryTreeNodeId, val: T, count?: number) {
+        this._id = id;
+        this._val = val;
+        this._count = count ?? 1;
+    }
+
     swapLocation(swapNode: BinaryTreeNode<T>): BinaryTreeNode<T> {
         const {val, count, height} = swapNode;
         const tempNode = new BinaryTreeNode<T>(swapNode.id, val);
@@ -187,6 +235,14 @@ export class BinaryTree<T> {
         return this._root;
     }
 
+    /**
+     * Starting from TypeScript version 5.0 and onwards, the use of distinct access modifiers for Getters and Setters is not permitted. As an alternative, to ensure compatibility, it is necessary to adopt a Java-style approach for Getters (using the same name as the property) while utilizing separate method names for Setters.
+     * @returns The method is returning either a BinaryTreeNode object of type T or null.
+     */
+    getRoot(): BinaryTreeNode<T> | null {
+        return this._root;
+    }
+
     protected set root(v: BinaryTreeNode<T> | null) {
         if (v) {
             v.parent = null;
@@ -201,6 +257,13 @@ export class BinaryTree<T> {
         return this._size;
     }
 
+    /**
+     * Starting from TypeScript version 5.0 and onwards, the use of distinct access modifiers for Getters and Setters is not permitted. As an alternative, to ensure compatibility, it is necessary to adopt a Java-style approach for Setters (using the same name as the property) while utilizing separate method names for Getters.
+     */
+    getSize(): number {
+        return this._size;
+    }
+
     protected set size(v: number) {
         this._size = v;
     }
@@ -211,6 +274,13 @@ export class BinaryTree<T> {
         return this._count;
     }
 
+    /**
+     * Starting from TypeScript version 5.0 and onwards, the use of distinct access modifiers for Getters and Setters is not permitted. As an alternative, to ensure compatibility, it is necessary to adopt a Java-style approach for Setters (using the same name as the property) while utilizing separate method names for Getters.
+     */
+    getCount(): number {
+        return this._count;
+    }
+
     protected set count(v: number) {
         this._count = v;
     }

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

@@ -17,61 +17,85 @@ export class SegmentTreeNode {
     }
 
     protected _start = 0;
-
     get start(): number {
         return this._start;
     }
-
+    /**
+     * Starting from TypeScript version 5.0 and onwards, the use of distinct access modifiers for Getters and Setters is not permitted. As an alternative, to ensure compatibility, it is necessary to adopt a Java-style approach for Setters (using the same name as the property) while utilizing separate method names for Getters.
+     */
+    getStart(): number {
+        return this._start;
+    }
     set start(v: number) {
         this._start = v;
     }
 
     protected _end = 0;
-
     get end(): number {
         return this._end;
     }
-
+    /**
+     * Starting from TypeScript version 5.0 and onwards, the use of distinct access modifiers for Getters and Setters is not permitted. As an alternative, to ensure compatibility, it is necessary to adopt a Java-style approach for Setters (using the same name as the property) while utilizing separate method names for Getters.
+     */
+    getEnd(): number {
+        return this._end;
+    }
     set end(v: number) {
         this._end = v;
     }
 
     protected _val: SegmentTreeNodeVal | null = null;
-
     get val(): SegmentTreeNodeVal | null {
         return this._val;
     }
-
+    /**
+     * Starting from TypeScript version 5.0 and onwards, the use of distinct access modifiers for Getters and Setters is not permitted. As an alternative, to ensure compatibility, it is necessary to adopt a Java-style approach for Setters (using the same name as the property) while utilizing separate method names for Getters.
+     */
+    getVal(): SegmentTreeNodeVal | null {
+        return this._val;
+    }
     set val(v: SegmentTreeNodeVal | null) {
         this._val = v;
     }
 
     protected _sum = 0;
-
     get sum(): number {
         return this._sum;
     }
-
+    /**
+     * Starting from TypeScript version 5.0 and onwards, the use of distinct access modifiers for Getters and Setters is not permitted. As an alternative, to ensure compatibility, it is necessary to adopt a Java-style approach for Setters (using the same name as the property) while utilizing separate method names for Getters.
+     */
+    getSum(): number {
+        return this._sum;
+    }
     set sum(v: number) {
         this._sum = v;
     }
 
     protected _left: SegmentTreeNode | null = null;
-
     get left(): SegmentTreeNode | null {
         return this._left;
     }
-
+    /**
+     * Starting from TypeScript version 5.0 and onwards, the use of distinct access modifiers for Getters and Setters is not permitted. As an alternative, to ensure compatibility, it is necessary to adopt a Java-style approach for Setters (using the same name as the property) while utilizing separate method names for Getters.
+     */
+    getLeft(): SegmentTreeNode | null {
+        return this._left;
+    }
     set left(v: SegmentTreeNode | null) {
         this._left = v;
     }
 
     protected _right: SegmentTreeNode | null = null;
-
     get right(): SegmentTreeNode | null {
         return this._right;
     }
-
+    /**
+     * Starting from TypeScript version 5.0 and onwards, the use of distinct access modifiers for Getters and Setters is not permitted. As an alternative, to ensure compatibility, it is necessary to adopt a Java-style approach for Setters (using the same name as the property) while utilizing separate method names for Getters.
+     */
+    getRight(): SegmentTreeNode | null {
+        return this._right;
+    }
     set right(v: SegmentTreeNode | null) {
         this._right = v;
     }
@@ -101,10 +125,18 @@ export class SegmentTree {
     }
 
     protected _root: SegmentTreeNode | null;
-
     get root(): SegmentTreeNode | null {
         return this._root;
     }
+    /**
+     * Starting from TypeScript version 5.0 and onwards, the use of distinct access modifiers for Getters and Setters is not permitted. As an alternative, to ensure compatibility, it is necessary to adopt a Java-style approach for Setters (using the same name as the property) while utilizing separate method names for Getters.
+     */
+    getRoot(): SegmentTreeNode | null {
+        return this._root;
+    }
+    set root(v: SegmentTreeNode | null) {
+        this._root = v;
+    }
 
     /**
      * The function builds a segment tree by recursively dividing the given range into smaller segments and creating nodes