data-structure-typed 1.48.7 → 1.48.9

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

@@ -66,10 +66,6 @@ export class BinaryTreeNode {
  * 3. Depth and Height: Depth is the number of edges from the root to a node; height is the maximum depth in the tree.
  * 4. Subtrees: Each child of a node forms the root of a subtree.
  * 5. Leaf Nodes: Nodes without children are leaves.
- * 6. Internal Nodes: Nodes with at least one child are internal.
- * 7. Balanced Trees: The heights of the left and right subtrees of any node differ by no more than one.
- * 8. Full Trees: Every node has either 0 or 2 children.
- * 9. Complete Trees: All levels are fully filled except possibly the last, filled from left to right.
  */
 export class BinaryTree extends IterableEntryBase {
     iterationType = IterationType.ITERATIVE;
@@ -198,44 +194,50 @@ export class BinaryTree extends IterableEntryBase {
      * @returns The function `add` returns either a node (`N`), `null`, or `undefined`.
      */
     add(keyOrNodeOrEntry, value) {
-        let inserted;
         const newNode = this.exemplarToNode(keyOrNodeOrEntry, value);
         if (newNode === undefined)
             return;
-        // TODO There are still some problems with the way duplicate nodes are handled
-        if (newNode !== null && this.has(newNode.key))
-            return undefined;
-        const _bfs = (root, newNode) => {
-            const queue = new Queue([root]);
-            while (queue.size > 0) {
-                const cur = queue.shift();
-                if (newNode && cur.key === newNode.key) {
-                    this._replaceNode(cur, newNode);
-                    return newNode;
-                }
-                const inserted = this._addTo(newNode, cur);
-                if (inserted !== undefined)
-                    return inserted;
-                if (cur.left)
-                    queue.push(cur.left);
-                if (cur.right)
-                    queue.push(cur.right);
+        // If the tree is empty, directly set the new node as the root node
+        if (!this.root) {
+            this._root = newNode;
+            this._size = 1;
+            return newNode;
+        }
+        const queue = new Queue([this.root]);
+        let potentialParent; // Record the parent node of the potential insertion location
+        while (queue.size > 0) {
+            const cur = queue.shift();
+            if (!cur)
+                continue;
+            // Check for duplicate keys when newNode is not null
+            if (newNode !== null && cur.key === newNode.key) {
+                this._replaceNode(cur, newNode);
+                return newNode; // If duplicate keys are found, no insertion is performed
+            }
+            // Record the first possible insertion location found
+            if (potentialParent === undefined && (cur.left === undefined || cur.right === undefined)) {
+                potentialParent = cur;
+            }
+            // Continue traversing the left and right subtrees
+            if (cur.left !== null) {
+                cur.left && queue.push(cur.left);
+            }
+            if (cur.right !== null) {
+                cur.right && queue.push(cur.right);
             }
-        };
-        if (this.root) {
-            inserted = _bfs(this.root, newNode);
         }
-        else {
-            this._setRoot(newNode);
-            if (newNode) {
-                this._size = 1;
+        // At the end of the traversal, if the insertion position is found, insert
+        if (potentialParent) {
+            if (potentialParent.left === undefined) {
+                potentialParent.left = newNode;
             }
-            else {
-                this._size = 0;
+            else if (potentialParent.right === undefined) {
+                potentialParent.right = newNode;
             }
-            inserted = this.root;
+            this._size++;
+            return newNode;
         }
-        return inserted;
+        return undefined; // If the insertion position cannot be found, return undefined
     }
     /**
      * Time Complexity: O(k log n) - O(k * n)

package/dist/mjs/data-structures/queue/deque.d.ts

@@ -439,113 +439,3 @@ export declare class Deque<E> extends IterableElementBase<E> {
         indexInBucket: number;
     };
 }
-export declare class ObjectDeque<E = number> {
-    constructor(capacity?: number);
-    protected _nodes: {
-        [key: number]: E;
-    };
-    get nodes(): {
-        [p: number]: E;
-    };
-    protected _capacity: number;
-    get capacity(): number;
-    protected _first: number;
-    get first(): number;
-    protected _last: number;
-    get last(): number;
-    protected _size: number;
-    get size(): number;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The "addFirst" function adds an element to the beginning of an array-like data structure.
-     * @param {E} element - The `element` parameter represents the element that you want to add to the beginning of the data
-     * structure.
-     */
-    addFirst(element: E): void;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The addLast function adds an element to the end of an array-like data structure.
-     * @param {E} element - The `element` parameter represents the element that you want to add to the end of the data structure.
-     */
-    addLast(element: E): void;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The function `pollFirst()` removes and returns the first element in a data structure.
-     * @returns The element of the first element in the data structure.
-     */
-    pollFirst(): E | undefined;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The `getFirst` function returns the first element in an array-like data structure if it exists.
-     * @returns The element at the first position of the `_nodes` array.
-     */
-    getFirst(): E | undefined;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The `pollLast()` function removes and returns the last element in a data structure.
-     * @returns The element that was removed from the data structure.
-     */
-    pollLast(): E | undefined;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The `getLast()` function returns the last element in an array-like data structure.
-     * @returns The last element in the array "_nodes" is being returned.
-     */
-    getLast(): E | undefined;
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The get function returns the element at the specified index in an array-like data structure.
-     * @param {number} index - The index parameter is a number that represents the position of the element you want to
-     * retrieve from the array.
-     * @returns The element at the specified index in the `_nodes` array is being returned. If there is no element at that
-     * index, `undefined` is returned.
-     */
-    get(index: number): NonNullable<E> | undefined;
-    /**
-     * The function checks if the size of a data structure is less than or equal to zero.
-     * @returns The method is returning a boolean element indicating whether the size of the object is less than or equal to 0.
-     */
-    isEmpty(): boolean;
-}

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

@@ -789,173 +789,3 @@ export class Deque extends IterableElementBase {
         return { bucketIndex, indexInBucket };
     }
 }
-// O(1) time complexity of obtaining the element
-// O(n) time complexity of adding at the beginning and the end
-// todo tested slowest one
-export class ObjectDeque {
-    constructor(capacity) {
-        if (capacity !== undefined)
-            this._capacity = capacity;
-    }
-    _nodes = {};
-    get nodes() {
-        return this._nodes;
-    }
-    _capacity = Number.MAX_SAFE_INTEGER;
-    get capacity() {
-        return this._capacity;
-    }
-    _first = -1;
-    get first() {
-        return this._first;
-    }
-    _last = -1;
-    get last() {
-        return this._last;
-    }
-    _size = 0;
-    get size() {
-        return this._size;
-    }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The "addFirst" function adds an element to the beginning of an array-like data structure.
-     * @param {E} element - The `element` parameter represents the element that you want to add to the beginning of the data
-     * structure.
-     */
-    addFirst(element) {
-        if (this.size === 0) {
-            const mid = Math.floor(this.capacity / 2);
-            this._first = mid;
-            this._last = mid;
-        }
-        else {
-            this._first--;
-        }
-        this.nodes[this.first] = element;
-        this._size++;
-    }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The addLast function adds an element to the end of an array-like data structure.
-     * @param {E} element - The `element` parameter represents the element that you want to add to the end of the data structure.
-     */
-    addLast(element) {
-        if (this.size === 0) {
-            const mid = Math.floor(this.capacity / 2);
-            this._first = mid;
-            this._last = mid;
-        }
-        else {
-            this._last++;
-        }
-        this.nodes[this.last] = element;
-        this._size++;
-    }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The function `pollFirst()` removes and returns the first element in a data structure.
-     * @returns The element of the first element in the data structure.
-     */
-    pollFirst() {
-        if (!this.size)
-            return;
-        const element = this.getFirst();
-        delete this.nodes[this.first];
-        this._first++;
-        this._size--;
-        return element;
-    }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The `getFirst` function returns the first element in an array-like data structure if it exists.
-     * @returns The element at the first position of the `_nodes` array.
-     */
-    getFirst() {
-        if (this.size)
-            return this.nodes[this.first];
-    }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The `pollLast()` function removes and returns the last element in a data structure.
-     * @returns The element that was removed from the data structure.
-     */
-    pollLast() {
-        if (!this.size)
-            return;
-        const element = this.getLast();
-        delete this.nodes[this.last];
-        this._last--;
-        this._size--;
-        return element;
-    }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The `getLast()` function returns the last element in an array-like data structure.
-     * @returns The last element in the array "_nodes" is being returned.
-     */
-    getLast() {
-        if (this.size)
-            return this.nodes[this.last];
-    }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The get function returns the element at the specified index in an array-like data structure.
-     * @param {number} index - The index parameter is a number that represents the position of the element you want to
-     * retrieve from the array.
-     * @returns The element at the specified index in the `_nodes` array is being returned. If there is no element at that
-     * index, `undefined` is returned.
-     */
-    get(index) {
-        return this.nodes[this.first + index] || undefined;
-    }
-    /**
-     * The function checks if the size of a data structure is less than or equal to zero.
-     * @returns The method is returning a boolean element indicating whether the size of the object is less than or equal to 0.
-     */
-    isEmpty() {
-        return this.size <= 0;
-    }
-}

package/dist/umd/data-structure-typed.js

@@ -142,7 +142,6 @@ var dataStructureTyped = (() => {
     MinHeap: () => MinHeap,
     MinPriorityQueue: () => MinPriorityQueue,
     Navigator: () => Navigator,
-    ObjectDeque: () => ObjectDeque,
     PriorityQueue: () => PriorityQueue,
     Queue: () => Queue,
     RBTNColor: () => RBTNColor,
@@ -4374,171 +4373,6 @@ var dataStructureTyped = (() => {
       return { bucketIndex, indexInBucket };
     }
   };
-  var ObjectDeque = class {
-    constructor(capacity) {
-      __publicField(this, "_nodes", {});
-      __publicField(this, "_capacity", Number.MAX_SAFE_INTEGER);
-      __publicField(this, "_first", -1);
-      __publicField(this, "_last", -1);
-      __publicField(this, "_size", 0);
-      if (capacity !== void 0)
-        this._capacity = capacity;
-    }
-    get nodes() {
-      return this._nodes;
-    }
-    get capacity() {
-      return this._capacity;
-    }
-    get first() {
-      return this._first;
-    }
-    get last() {
-      return this._last;
-    }
-    get size() {
-      return this._size;
-    }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The "addFirst" function adds an element to the beginning of an array-like data structure.
-     * @param {E} element - The `element` parameter represents the element that you want to add to the beginning of the data
-     * structure.
-     */
-    addFirst(element) {
-      if (this.size === 0) {
-        const mid = Math.floor(this.capacity / 2);
-        this._first = mid;
-        this._last = mid;
-      } else {
-        this._first--;
-      }
-      this.nodes[this.first] = element;
-      this._size++;
-    }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The addLast function adds an element to the end of an array-like data structure.
-     * @param {E} element - The `element` parameter represents the element that you want to add to the end of the data structure.
-     */
-    addLast(element) {
-      if (this.size === 0) {
-        const mid = Math.floor(this.capacity / 2);
-        this._first = mid;
-        this._last = mid;
-      } else {
-        this._last++;
-      }
-      this.nodes[this.last] = element;
-      this._size++;
-    }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The function `pollFirst()` removes and returns the first element in a data structure.
-     * @returns The element of the first element in the data structure.
-     */
-    pollFirst() {
-      if (!this.size)
-        return;
-      const element = this.getFirst();
-      delete this.nodes[this.first];
-      this._first++;
-      this._size--;
-      return element;
-    }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The `getFirst` function returns the first element in an array-like data structure if it exists.
-     * @returns The element at the first position of the `_nodes` array.
-     */
-    getFirst() {
-      if (this.size)
-        return this.nodes[this.first];
-    }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The `pollLast()` function removes and returns the last element in a data structure.
-     * @returns The element that was removed from the data structure.
-     */
-    pollLast() {
-      if (!this.size)
-        return;
-      const element = this.getLast();
-      delete this.nodes[this.last];
-      this._last--;
-      this._size--;
-      return element;
-    }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The `getLast()` function returns the last element in an array-like data structure.
-     * @returns The last element in the array "_nodes" is being returned.
-     */
-    getLast() {
-      if (this.size)
-        return this.nodes[this.last];
-    }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     */
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The get function returns the element at the specified index in an array-like data structure.
-     * @param {number} index - The index parameter is a number that represents the position of the element you want to
-     * retrieve from the array.
-     * @returns The element at the specified index in the `_nodes` array is being returned. If there is no element at that
-     * index, `undefined` is returned.
-     */
-    get(index) {
-      return this.nodes[this.first + index] || void 0;
-    }
-    /**
-     * The function checks if the size of a data structure is less than or equal to zero.
-     * @returns The method is returning a boolean element indicating whether the size of the object is less than or equal to 0.
-     */
-    isEmpty() {
-      return this.size <= 0;
-    }
-  };
 
   // src/data-structures/heap/heap.ts
   var Heap = class _Heap extends IterableElementBase {
@@ -7656,41 +7490,44 @@ var dataStructureTyped = (() => {
      * @returns The function `add` returns either a node (`N`), `null`, or `undefined`.
      */
     add(keyOrNodeOrEntry, value) {
-      let inserted;
       const newNode = this.exemplarToNode(keyOrNodeOrEntry, value);
       if (newNode === void 0)
         return;
-      if (newNode !== null && this.has(newNode.key))
-        return void 0;
-      const _bfs = (root, newNode2) => {
-        const queue = new Queue([root]);
-        while (queue.size > 0) {
-          const cur = queue.shift();
-          if (newNode2 && cur.key === newNode2.key) {
-            this._replaceNode(cur, newNode2);
-            return newNode2;
-          }
-          const inserted2 = this._addTo(newNode2, cur);
-          if (inserted2 !== void 0)
-            return inserted2;
-          if (cur.left)
-            queue.push(cur.left);
-          if (cur.right)
-            queue.push(cur.right);
+      if (!this.root) {
+        this._root = newNode;
+        this._size = 1;
+        return newNode;
+      }
+      const queue = new Queue([this.root]);
+      let potentialParent;
+      while (queue.size > 0) {
+        const cur = queue.shift();
+        if (!cur)
+          continue;
+        if (newNode !== null && cur.key === newNode.key) {
+          this._replaceNode(cur, newNode);
+          return newNode;
         }
-      };
-      if (this.root) {
-        inserted = _bfs(this.root, newNode);
-      } else {
-        this._setRoot(newNode);
-        if (newNode) {
-          this._size = 1;
-        } else {
-          this._size = 0;
+        if (potentialParent === void 0 && (cur.left === void 0 || cur.right === void 0)) {
+          potentialParent = cur;
+        }
+        if (cur.left !== null) {
+          cur.left && queue.push(cur.left);
+        }
+        if (cur.right !== null) {
+          cur.right && queue.push(cur.right);
         }
-        inserted = this.root;
       }
-      return inserted;
+      if (potentialParent) {
+        if (potentialParent.left === void 0) {
+          potentialParent.left = newNode;
+        } else if (potentialParent.right === void 0) {
+          potentialParent.right = newNode;
+        }
+        this._size++;
+        return newNode;
+      }
+      return void 0;
     }
     /**
      * Time Complexity: O(k log n) - O(k * n)