data-structure-typed 2.2.5 → 2.2.6

package/dist/cjs-legacy/index.cjs

@@ -159,6 +159,14 @@ var _IterableEntryBase = class _IterableEntryBase {
     }
     return accumulator;
   }
+  /**
+   * Converts data structure to `[key, value]` pairs.
+   * @returns Array of entries.
+   * @remarks Time O(n), Space O(n)
+   */
+  toArray() {
+    return [...this];
+  }
   /**
    * Visualize the iterable as an array of `[key, value]` pairs (or a custom string).
    * @returns Array of entries (default) or a string.
@@ -172,7 +180,6 @@ var _IterableEntryBase = class _IterableEntryBase {
    * @remarks Time O(n), Space O(n)
    */
   print() {
-    console.log(this.toVisual());
   }
 };
 __name(_IterableEntryBase, "IterableEntryBase");
@@ -394,7 +401,6 @@ var _IterableElementBase = class _IterableElementBase {
    * Time O(n) due to materialization, Space O(n) for the intermediate representation.
    */
   print() {
-    console.log(this.toVisual());
   }
 };
 __name(_IterableElementBase, "IterableElementBase");
@@ -6814,8 +6820,6 @@ var _Range = class _Range {
     this.high = high;
     this.includeLow = includeLow;
     this.includeHigh = includeHigh;
-    if (!(isComparable(low) && isComparable(high))) throw new RangeError("low or high is not comparable");
-    if (low > high) throw new RangeError("low must be less than or equal to high");
   }
   // Determine whether a key is within the range
   isInRange(key, comparator) {
@@ -8063,7 +8067,6 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
    * @param [startNode=this._root] - The node to start printing from.
    */
   print(options, startNode = this._root) {
-    console.log(this.toVisual(startNode, options));
   }
   /**
    * (Protected) Core DFS implementation.
@@ -8959,77 +8962,63 @@ var _BST = class _BST extends BinaryTree {
     else _iterate();
     return inserted;
   }
-  /**
-   * Returns the first node with a key greater than or equal to the given key.
-   * This is equivalent to C++ std::lower_bound on a BST.
-   * Supports RECURSIVE and ITERATIVE implementations.
-   * Time Complexity: O(log n) on average, O(h) where h is tree height.
-   * Space Complexity: O(h) for recursion, O(1) for iteration.
-   * @param keyNodeEntryOrPredicate - The key, node, entry, or predicate function to search for.
-   * @param iterationType The iteration type (RECURSIVE or ITERATIVE). Defaults to this.iterationType.
-   * @returns The first node with key >= given key, or undefined if no such node exists.
-   */
-  lowerBound(keyNodeEntryOrPredicate, iterationType = this.iterationType) {
-    return this._bound(keyNodeEntryOrPredicate, true, iterationType);
-  }
-  /**
-   * Returns the first node with a key strictly greater than the given key.
-   * This is equivalent to C++ std::upper_bound on a BST.
-   * Supports RECURSIVE and ITERATIVE implementations.
-   * Time Complexity: O(log n) on average, O(h) where h is tree height.
-   * Space Complexity: O(h) for recursion, O(1) for iteration.
-   * @param keyNodeEntryOrPredicate - The key, node, entry, or predicate function to search for.
-   * @param iterationType The iteration type (RECURSIVE or ITERATIVE). Defaults to this.iterationType.
-   * @returns The first node with key > given key, or undefined if no such node exists.
-   */
-  upperBound(keyNodeEntryOrPredicate, iterationType = this.iterationType) {
-    return this._bound(keyNodeEntryOrPredicate, false, iterationType);
-  }
-  /**
-   * Returns the first node with a key greater than or equal to the given key.
-   * This is equivalent to Java TreeMap.ceilingEntry().
-   * Supports RECURSIVE and ITERATIVE implementations.
-   * @remarks Time Complexity: O(log n) on average, O(h) where h is tree height.
-   * Space Complexity: O(h) for recursion, O(1) for iteration.
-   *
-   * @param keyNodeEntryOrPredicate - The key, node, entry, or predicate function to search for.
-   * @param [iterationType=this.iterationType] - The iteration type (RECURSIVE or ITERATIVE).
-   * @returns The first node with key >= given key, or undefined if no such node exists.
-   */
-  ceilingEntry(keyNodeEntryOrPredicate, iterationType = this.iterationType) {
-    return this.lowerBound(keyNodeEntryOrPredicate, iterationType);
+  ceiling(keyNodeEntryOrPredicate, callback = this._DEFAULT_NODE_CALLBACK, iterationType) {
+    let actualCallback = void 0;
+    let actualIterationType = this.iterationType;
+    if (typeof callback === "string") {
+      actualIterationType = callback;
+    } else if (callback) {
+      actualCallback = callback;
+      if (iterationType) {
+        actualIterationType = iterationType;
+      }
+    }
+    const node = this._bound(keyNodeEntryOrPredicate, true, actualIterationType);
+    if (!actualCallback) {
+      return node == null ? void 0 : node.key;
+    }
+    return node ? actualCallback(node) : void 0;
   }
-  /**
-   * Returns the first node with a key strictly greater than the given key.
-   * This is equivalent to Java TreeMap.higherEntry().
-   * Supports RECURSIVE and ITERATIVE implementations.
-   * @remarks Time Complexity: O(log n) on average, O(h) where h is tree height.
-   * Space Complexity: O(h) for recursion, O(1) for iteration.
-   *
-   * @param keyNodeEntryOrPredicate - The key, node, entry, or predicate function to search for.
-   * @param [iterationType=this.iterationType] - The iteration type (RECURSIVE or ITERATIVE).
-   * @returns The first node with key > given key, or undefined if no such node exists.
-   */
-  higherEntry(keyNodeEntryOrPredicate, iterationType = this.iterationType) {
-    return this.upperBound(keyNodeEntryOrPredicate, iterationType);
+  higher(keyNodeEntryOrPredicate, callback = this._DEFAULT_NODE_CALLBACK, iterationType) {
+    let actualCallback = void 0;
+    let actualIterationType = this.iterationType;
+    if (typeof callback === "string") {
+      actualIterationType = callback;
+    } else if (callback) {
+      actualCallback = callback;
+      if (iterationType) {
+        actualIterationType = iterationType;
+      }
+    }
+    const node = this._bound(keyNodeEntryOrPredicate, false, actualIterationType);
+    if (!actualCallback) {
+      return node == null ? void 0 : node.key;
+    }
+    return node ? actualCallback(node) : void 0;
   }
-  /**
-   * Returns the first node with a key less than or equal to the given key.
-   * This is equivalent to Java TreeMap.floorEntry().
-   * Supports RECURSIVE and ITERATIVE implementations.
-   * @remarks Time Complexity: O(log n) on average, O(h) where h is tree height.
-   * Space Complexity: O(h) for recursion, O(1) for iteration.
-   *
-   * @param keyNodeEntryOrPredicate - The key, node, entry, or predicate function to search for.
-   * @param [iterationType=this.iterationType] - The iteration type (RECURSIVE or ITERATIVE).
-   * @returns The first node with key <= given key, or undefined if no such node exists.
-   */
-  floorEntry(keyNodeEntryOrPredicate, iterationType = this.iterationType) {
+  floor(keyNodeEntryOrPredicate, callback = this._DEFAULT_NODE_CALLBACK, iterationType) {
     if (keyNodeEntryOrPredicate === null || keyNodeEntryOrPredicate === void 0) {
+      if (typeof callback === "string" || !callback) {
+        return void 0;
+      }
       return void 0;
     }
+    let actualCallback = void 0;
+    let actualIterationType = this.iterationType;
+    if (typeof callback === "string") {
+      actualIterationType = callback;
+    } else if (callback) {
+      actualCallback = callback;
+      if (iterationType) {
+        actualIterationType = iterationType;
+      }
+    }
     if (this._isPredicate(keyNodeEntryOrPredicate)) {
-      return this._floorByPredicate(keyNodeEntryOrPredicate, iterationType);
+      const node = this._floorByPredicate(keyNodeEntryOrPredicate, actualIterationType);
+      if (!actualCallback) {
+        return node == null ? void 0 : node.key;
+      }
+      return node ? actualCallback(node) : void 0;
     }
     let targetKey;
     if (this.isNode(keyNodeEntryOrPredicate)) {
@@ -9037,6 +9026,9 @@ var _BST = class _BST extends BinaryTree {
     } else if (this.isEntry(keyNodeEntryOrPredicate)) {
       const key = keyNodeEntryOrPredicate[0];
       if (key === null || key === void 0) {
+        if (typeof callback === "string" || !callback) {
+          return void 0;
+        }
         return void 0;
       }
       targetKey = key;
@@ -9044,27 +9036,40 @@ var _BST = class _BST extends BinaryTree {
       targetKey = keyNodeEntryOrPredicate;
     }
     if (targetKey !== void 0) {
-      return this._floorByKey(targetKey, iterationType);
+      const node = this._floorByKey(targetKey, actualIterationType);
+      if (!actualCallback) {
+        return node == null ? void 0 : node.key;
+      }
+      return node ? actualCallback(node) : void 0;
+    }
+    if (typeof callback === "string" || !callback) {
+      return void 0;
     }
     return void 0;
   }
-  /**
-   * Returns the first node with a key strictly less than the given key.
-   * This is equivalent to Java TreeMap.lowerEntry().
-   * Supports RECURSIVE and ITERATIVE implementations.
-   * @remarks Time Complexity: O(log n) on average, O(h) where h is tree height.
-   * Space Complexity: O(h) for recursion, O(1) for iteration.
-   *
-   * @param keyNodeEntryOrPredicate - The key, node, entry, or predicate function to search for.
-   * @param [iterationType=this.iterationType] - The iteration type (RECURSIVE or ITERATIVE).
-   * @returns The first node with key < given key, or undefined if no such node exists.
-   */
-  lowerEntry(keyNodeEntryOrPredicate, iterationType = this.iterationType) {
+  lower(keyNodeEntryOrPredicate, callback, iterationType) {
     if (keyNodeEntryOrPredicate === null || keyNodeEntryOrPredicate === void 0) {
+      if (typeof callback === "string" || !callback) {
+        return void 0;
+      }
       return void 0;
     }
+    let actualCallback = void 0;
+    let actualIterationType = this.iterationType;
+    if (typeof callback === "string") {
+      actualIterationType = callback;
+    } else if (callback) {
+      actualCallback = callback;
+      if (iterationType) {
+        actualIterationType = iterationType;
+      }
+    }
     if (this._isPredicate(keyNodeEntryOrPredicate)) {
-      return this._lowerByPredicate(keyNodeEntryOrPredicate, iterationType);
+      const node = this._lowerByPredicate(keyNodeEntryOrPredicate, actualIterationType);
+      if (!actualCallback) {
+        return node == null ? void 0 : node.key;
+      }
+      return node ? actualCallback(node) : void 0;
     }
     let targetKey;
     if (this.isNode(keyNodeEntryOrPredicate)) {
@@ -9072,6 +9077,9 @@ var _BST = class _BST extends BinaryTree {
     } else if (this.isEntry(keyNodeEntryOrPredicate)) {
       const key = keyNodeEntryOrPredicate[0];
       if (key === null || key === void 0) {
+        if (typeof callback === "string" || !callback) {
+          return void 0;
+        }
         return void 0;
       }
       targetKey = key;
@@ -9079,7 +9087,14 @@ var _BST = class _BST extends BinaryTree {
       targetKey = keyNodeEntryOrPredicate;
     }
     if (targetKey !== void 0) {
-      return this._lowerByKey(targetKey, iterationType);
+      const node = this._lowerByKey(targetKey, actualIterationType);
+      if (!actualCallback) {
+        return node == null ? void 0 : node.key;
+      }
+      return node ? actualCallback(node) : void 0;
+    }
+    if (typeof callback === "string" || !callback) {
+      return void 0;
     }
     return void 0;
   }
@@ -9268,7 +9283,6 @@ var _BST = class _BST extends BinaryTree {
    */
   _createDefaultComparator() {
     return (a, b) => {
-      debugger;
       if (isComparable(a) && isComparable(b)) {
         if (a > b) return 1;
         if (a < b) return -1;