data-structure-typed 1.17.4 → 1.18.0

package/dist/data-structures/hash/tree-map.d.ts

@@ -1 +1,2 @@
-export {};
+export declare class TreeMap {
+}

package/dist/data-structures/hash/tree-map.js

@@ -1,2 +1,9 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
+exports.TreeMap = void 0;
+var TreeMap = /** @class */ (function () {
+    function TreeMap() {
+    }
+    return TreeMap;
+}());
+exports.TreeMap = TreeMap;

package/dist/data-structures/hash/tree-set.d.ts

@@ -1 +1,2 @@
-export {};
+export declare class TreeSet {
+}

package/dist/data-structures/hash/tree-set.js

@@ -1,2 +1,9 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
+exports.TreeSet = void 0;
+var TreeSet = /** @class */ (function () {
+    function TreeSet() {
+    }
+    return TreeSet;
+}());
+exports.TreeSet = TreeSet;

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

@@ -25,27 +25,13 @@ export declare abstract class Heap<T = number> {
     protected constructor(options?: HeapOptions<T>);
     protected abstract _pq: PriorityQueue<HeapItem<T>>;
     get pq(): PriorityQueue<HeapItem<T>>;
-    protected set pq(v: PriorityQueue<HeapItem<T>>);
     protected _priorityCb: (val: T) => number;
     get priorityCb(): (val: T) => number;
-    protected set priorityCb(v: (val: T) => number);
     /**
      * The function returns the size of a priority queue.
      * @returns The size of the priority queue.
      */
     get size(): number;
-    /**
-     * 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.
-     */
-    getPq(): PriorityQueue<HeapItem<T>>;
-    /**
-     * 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.
-     */
-    getPriorityCb(): (val: T) => number;
-    /**
-     * 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;
     /**
      * The function checks if a priority queue is empty.
      * @returns {boolean} A boolean value indicating whether the size of the priority queue is less than 1.

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

@@ -53,9 +53,6 @@ var Heap = /** @class */ (function () {
         get: function () {
             return this._pq;
         },
-        set: function (v) {
-            this._pq = v;
-        },
         enumerable: false,
         configurable: true
     });
@@ -63,9 +60,6 @@ var Heap = /** @class */ (function () {
         get: function () {
             return this._priorityCb;
         },
-        set: function (v) {
-            this._priorityCb = v;
-        },
         enumerable: false,
         configurable: true
     });
@@ -80,24 +74,6 @@ var Heap = /** @class */ (function () {
         enumerable: false,
         configurable: true
     });
-    /**
-     * 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.
-     */
-    Heap.prototype.getPq = function () {
-        return this._pq;
-    };
-    /**
-     * 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.
-     */
-    Heap.prototype.getPriorityCb = function () {
-        return this._priorityCb;
-    };
-    /**
-     * 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.
-     */
-    Heap.prototype.getSize = function () {
-        return this._pq.size;
-    };
     /**
      * The function checks if a priority queue is empty.
      * @returns {boolean} A boolean value indicating whether the size of the priority queue is less than 1.
@@ -166,11 +142,11 @@ var Heap = /** @class */ (function () {
      * @returns a boolean value.
      */
     Heap.prototype.has = function (node) {
-        if (node instanceof (HeapItem)) {
-            return this.getPq().getNodes().includes(node);
+        if (node instanceof HeapItem) {
+            return this.pq.getNodes().includes(node);
         }
         else {
-            return this.getPq().getNodes().findIndex(function (item) {
+            return this.pq.getNodes().findIndex(function (item) {
                 return item.val === node;
             }) !== -1;
         }

package/dist/data-structures/linked-list/doubly-linked-list.d.ts

@@ -35,7 +35,6 @@ export declare class DoublyLinkedList<T> {
     set tail(value: DoublyLinkedListNode<T> | null);
     private _length;
     get length(): number;
-    protected set length(value: number);
     /**
      * The `fromArray` function creates a new instance of a DoublyLinkedList and populates it with the elements from the
      * given array.
@@ -43,7 +42,6 @@ export declare class DoublyLinkedList<T> {
      * @returns The `fromArray` function returns a DoublyLinkedList object.
      */
     static fromArray<T>(data: T[]): DoublyLinkedList<T>;
-    getLength(): number;
     /**
      * The push function adds a new node with the given value to the end of the doubly linked list.
      * @param {T} val - The value to be added to the linked list.

package/dist/data-structures/linked-list/doubly-linked-list.js

@@ -112,9 +112,6 @@ var DoublyLinkedList = /** @class */ (function () {
         get: function () {
             return this._length;
         },
-        set: function (value) {
-            this._length = value;
-        },
         enumerable: false,
         configurable: true
     });
@@ -142,9 +139,6 @@ var DoublyLinkedList = /** @class */ (function () {
         }
         return doublyLinkedList;
     };
-    DoublyLinkedList.prototype.getLength = function () {
-        return this._length;
-    };
     /**
      * The push function adds a new node with the given value to the end of the doubly linked list.
      * @param {T} val - The value to be added to the linked list.
@@ -160,7 +154,7 @@ var DoublyLinkedList = /** @class */ (function () {
             this.tail.next = newNode;
             this.tail = newNode;
         }
-        this.length++;
+        this._length++;
     };
     /**
      * The `pop()` function removes and returns the value of the last node in a doubly linked list.
@@ -179,7 +173,7 @@ var DoublyLinkedList = /** @class */ (function () {
             this.tail = removedNode.prev;
             this.tail.next = null;
         }
-        this.length--;
+        this._length--;
         return removedNode.val;
     };
     /**
@@ -199,7 +193,7 @@ var DoublyLinkedList = /** @class */ (function () {
             this.head = removedNode.next;
             this.head.prev = null;
         }
-        this.length--;
+        this._length--;
         return removedNode.val;
     };
     /**
@@ -218,7 +212,7 @@ var DoublyLinkedList = /** @class */ (function () {
             this.head.prev = newNode;
             this.head = newNode;
         }
-        this.length++;
+        this._length++;
     };
     /**
      * The `getAt` function returns the value at a specified index in a linked list, or null if the index is out of bounds.
@@ -297,7 +291,7 @@ var DoublyLinkedList = /** @class */ (function () {
         newNode.next = nextNode;
         prevNode.next = newNode;
         nextNode.prev = newNode;
-        this.length++;
+        this._length++;
         return true;
     };
     /**
@@ -319,7 +313,7 @@ var DoublyLinkedList = /** @class */ (function () {
         var nextNode = removedNode.next;
         prevNode.next = nextNode;
         nextNode.prev = prevNode;
-        this.length--;
+        this._length--;
         return removedNode.val;
     };
     /**
@@ -331,7 +325,7 @@ var DoublyLinkedList = /** @class */ (function () {
      */
     DoublyLinkedList.prototype.delete = function (valOrNode) {
         var node;
-        if (valOrNode instanceof (DoublyLinkedListNode)) {
+        if (valOrNode instanceof DoublyLinkedListNode) {
             node = valOrNode;
         }
         else {
@@ -349,7 +343,7 @@ var DoublyLinkedList = /** @class */ (function () {
                 var nextNode = node.next;
                 prevNode.next = nextNode;
                 nextNode.prev = prevNode;
-                this.length--;
+                this._length--;
             }
             return true;
         }
@@ -536,7 +530,7 @@ var DoublyLinkedList = /** @class */ (function () {
      */
     DoublyLinkedList.prototype.insertAfter = function (existingValueOrNode, newValue) {
         var existingNode;
-        if (existingValueOrNode instanceof (DoublyLinkedListNode)) {
+        if (existingValueOrNode instanceof DoublyLinkedListNode) {
             existingNode = existingValueOrNode;
         }
         else {
@@ -553,7 +547,7 @@ var DoublyLinkedList = /** @class */ (function () {
             if (existingNode === this.tail) {
                 this.tail = newNode;
             }
-            this.length++;
+            this._length++;
             return true;
         }
         return false;
@@ -570,7 +564,7 @@ var DoublyLinkedList = /** @class */ (function () {
      */
     DoublyLinkedList.prototype.insertBefore = function (existingValueOrNode, newValue) {
         var existingNode;
-        if (existingValueOrNode instanceof (DoublyLinkedListNode)) {
+        if (existingValueOrNode instanceof DoublyLinkedListNode) {
             existingNode = existingValueOrNode;
         }
         else {
@@ -587,7 +581,7 @@ var DoublyLinkedList = /** @class */ (function () {
             if (existingNode === this.head) {
                 this.head = newNode;
             }
-            this.length++;
+            this._length++;
             return true;
         }
         return false;

package/dist/data-structures/linked-list/singly-linked-list.d.ts

@@ -32,7 +32,6 @@ export declare class SinglyLinkedList<T> {
     set tail(value: SinglyLinkedListNode<T> | null);
     private _length;
     get length(): number;
-    protected set length(value: number);
     /**
      * The `fromArray` function creates a new SinglyLinkedList instance and populates it with the elements from the given
      * array.

package/dist/data-structures/linked-list/singly-linked-list.js

@@ -101,9 +101,6 @@ var SinglyLinkedList = /** @class */ (function () {
         get: function () {
             return this._length;
         },
-        set: function (value) {
-            this._length = value;
-        },
         enumerable: false,
         configurable: true
     });
@@ -149,7 +146,7 @@ var SinglyLinkedList = /** @class */ (function () {
             this.tail.next = newNode;
             this.tail = newNode;
         }
-        this.length++;
+        this._length++;
     };
     /**
      * The `pop()` function removes and returns the value of the last element in a linked list, updating the head and tail
@@ -164,7 +161,7 @@ var SinglyLinkedList = /** @class */ (function () {
             var val_1 = this.head.val;
             this.head = null;
             this.tail = null;
-            this.length--;
+            this._length--;
             return val_1;
         }
         var current = this.head;
@@ -174,7 +171,7 @@ var SinglyLinkedList = /** @class */ (function () {
         var val = this.tail.val;
         current.next = null;
         this.tail = current;
-        this.length--;
+        this._length--;
         return val;
     };
     /**
@@ -186,7 +183,7 @@ var SinglyLinkedList = /** @class */ (function () {
             return null;
         var removedNode = this.head;
         this.head = this.head.next;
-        this.length--;
+        this._length--;
         return removedNode.val;
     };
     /**
@@ -204,7 +201,7 @@ var SinglyLinkedList = /** @class */ (function () {
             newNode.next = this.head;
             this.head = newNode;
         }
-        this.length++;
+        this._length++;
     };
     /**
      * The function `getAt` returns the value at a specified index in a linked list, or null if the index is out of range.
@@ -253,7 +250,7 @@ var SinglyLinkedList = /** @class */ (function () {
         var prevNode = this.getNodeAt(index - 1);
         var removedNode = prevNode.next;
         prevNode.next = removedNode.next;
-        this.length--;
+        this._length--;
         return removedNode.val;
     };
     /**
@@ -265,7 +262,7 @@ var SinglyLinkedList = /** @class */ (function () {
      */
     SinglyLinkedList.prototype.delete = function (valueOrNode) {
         var value;
-        if (valueOrNode instanceof (SinglyLinkedListNode)) {
+        if (valueOrNode instanceof SinglyLinkedListNode) {
             value = valueOrNode.val;
         }
         else {
@@ -286,7 +283,7 @@ var SinglyLinkedList = /** @class */ (function () {
                         this.tail = prev;
                     }
                 }
-                this.length--;
+                this._length--;
                 return true;
             }
             prev = current;
@@ -318,7 +315,7 @@ var SinglyLinkedList = /** @class */ (function () {
         var prevNode = this.getNodeAt(index - 1);
         newNode.next = prevNode.next;
         prevNode.next = newNode;
-        this.length++;
+        this._length++;
         return true;
     };
     /**
@@ -433,7 +430,7 @@ var SinglyLinkedList = /** @class */ (function () {
         if (!this.head)
             return false;
         var existingValue;
-        if (existingValueOrNode instanceof (SinglyLinkedListNode)) {
+        if (existingValueOrNode instanceof SinglyLinkedListNode) {
             existingValue = existingValueOrNode.val;
         }
         else {
@@ -449,7 +446,7 @@ var SinglyLinkedList = /** @class */ (function () {
                 var newNode = new SinglyLinkedListNode(newValue);
                 newNode.next = current.next;
                 current.next = newNode;
-                this.length++;
+                this._length++;
                 return true;
             }
             current = current.next;
@@ -479,7 +476,7 @@ var SinglyLinkedList = /** @class */ (function () {
             if (existingNode === this.tail) {
                 this.tail = newNode;
             }
-            this.length++;
+            this._length++;
             return true;
         }
         return false;

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

@@ -1,9 +1,17 @@
 export declare class TreeNode<T = number> {
-    id: string;
-    name?: string | undefined;
-    value?: T | undefined;
-    children?: TreeNode<T>[] | undefined;
     constructor(id: string, name?: string, value?: T, children?: TreeNode<T>[]);
+    private _id;
+    get id(): string;
+    set id(value: string);
+    private _name?;
+    get name(): string | undefined;
+    set name(value: string | undefined);
+    private _value?;
+    get value(): T | undefined;
+    set value(value: T | undefined);
+    private _children?;
+    get children(): TreeNode<T>[] | undefined;
+    set children(value: TreeNode<T>[] | undefined);
     addChildren(children: TreeNode<T> | TreeNode<T>[]): void;
     getHeight(): number;
 }

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

@@ -3,19 +3,51 @@ Object.defineProperty(exports, "__esModule", { value: true });
 exports.TreeNode = void 0;
 var TreeNode = /** @class */ (function () {
     function TreeNode(id, name, value, children) {
-        this.id = id;
-        this.name = name || '';
-        this.value = value || undefined;
-        this.children = children || [];
+        this._id = id;
+        this._name = name || '';
+        this._value = value || undefined;
+        this._children = children || [];
     }
-    // TODO get set
-    // get name (): string | undefined {
-    //     return this.name;
-    // }
-    //
-    // set name (name: string | undefined) {
-    //     this.name = name;
-    // }
+    Object.defineProperty(TreeNode.prototype, "id", {
+        get: function () {
+            return this._id;
+        },
+        set: function (value) {
+            this._id = value;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(TreeNode.prototype, "name", {
+        get: function () {
+            return this._name;
+        },
+        set: function (value) {
+            this._name = value;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(TreeNode.prototype, "value", {
+        get: function () {
+            return this._value;
+        },
+        set: function (value) {
+            this._value = value;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(TreeNode.prototype, "children", {
+        get: function () {
+            return this._children;
+        },
+        set: function (value) {
+            this._children = value;
+        },
+        enumerable: false,
+        configurable: true
+    });
     TreeNode.prototype.addChildren = function (children) {
         if (!this.children) {
             this.children = [];

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

@@ -6,16 +6,16 @@
  * @license MIT License
  */
 export declare class TrieNode {
-    protected _value: string;
     constructor(v: string);
+    private _val;
+    get val(): string;
+    set val(v: string);
     protected _children: Map<string, TrieNode>;
     get children(): Map<string, TrieNode>;
     set children(v: Map<string, TrieNode>);
     protected _isEnd: boolean;
     get isEnd(): boolean;
     set isEnd(v: boolean);
-    get val(): string;
-    set val(v: string);
 }
 export declare class Trie {
     constructor(words?: string[]);

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

@@ -21,36 +21,36 @@ exports.Trie = exports.TrieNode = void 0;
  */
 var TrieNode = /** @class */ (function () {
     function TrieNode(v) {
-        this._value = v;
+        this._val = v;
         this._isEnd = false;
         this._children = new Map();
     }
-    Object.defineProperty(TrieNode.prototype, "children", {
+    Object.defineProperty(TrieNode.prototype, "val", {
         get: function () {
-            return this._children;
+            return this._val;
         },
         set: function (v) {
-            this._children = v;
+            this._val = v;
         },
         enumerable: false,
         configurable: true
     });
-    Object.defineProperty(TrieNode.prototype, "isEnd", {
+    Object.defineProperty(TrieNode.prototype, "children", {
         get: function () {
-            return this._isEnd;
+            return this._children;
         },
         set: function (v) {
-            this._isEnd = v;
+            this._children = v;
         },
         enumerable: false,
         configurable: true
     });
-    Object.defineProperty(TrieNode.prototype, "val", {
+    Object.defineProperty(TrieNode.prototype, "isEnd", {
         get: function () {
-            return this._value;
+            return this._isEnd;
         },
         set: function (v) {
-            this._value = v;
+            this._isEnd = v;
         },
         enumerable: false,
         configurable: true

package/dist/data-structures/types/doubly-linked-list.d.ts

@@ -1 +1 @@
-export type DoublyLinkedListGetBy = 'node' | 'val';
+export {};