data-structure-typed 2.5.1 → 2.5.3

package/dist/esm/hash.mjs

@@ -183,18 +183,11 @@ var IterableEntryBase = class {
   }
 };
 
-// src/utils/utils.ts
-var rangeCheck = /* @__PURE__ */ __name((index, min, max, message) => {
-  if (index < min || index > max) {
-    throw new RangeError(message ?? `Index ${index} is out of range [${min}, ${max}].`);
-  }
-}, "rangeCheck");
-var isWeakKey = /* @__PURE__ */ __name((input) => {
-  const inputType = typeof input;
-  return inputType === "object" && input !== null || inputType === "function";
-}, "isWeakKey");
-
 // src/common/error.ts
+function raise(ErrorClass, message) {
+  throw new ErrorClass(message);
+}
+__name(raise, "raise");
 var ERR = {
   // Range / index
   indexOutOfRange: /* @__PURE__ */ __name((index, min, max, ctx) => `${ctx ? ctx + ": " : ""}Index ${index} is out of range [${min}, ${max}].`, "indexOutOfRange"),
@@ -216,9 +209,22 @@ var ERR = {
   matrixSingular: /* @__PURE__ */ __name(() => "Matrix: Singular matrix, inverse does not exist.", "matrixSingular"),
   matrixNotSquare: /* @__PURE__ */ __name(() => "Matrix: Must be square for inversion.", "matrixNotSquare"),
   matrixNotRectangular: /* @__PURE__ */ __name(() => "Matrix: Must be rectangular for transposition.", "matrixNotRectangular"),
-  matrixRowMismatch: /* @__PURE__ */ __name((expected, got) => `Matrix: Expected row length ${expected}, but got ${got}.`, "matrixRowMismatch")
+  matrixRowMismatch: /* @__PURE__ */ __name((expected, got) => `Matrix: Expected row length ${expected}, but got ${got}.`, "matrixRowMismatch"),
+  // Order statistic
+  orderStatisticNotEnabled: /* @__PURE__ */ __name((method, ctx) => `${ctx ? ctx + ": " : ""}${method}() requires enableOrderStatistic: true.`, "orderStatisticNotEnabled")
 };
 
+// src/utils/utils.ts
+var rangeCheck = /* @__PURE__ */ __name((index, min, max, message) => {
+  if (index < min || index > max) {
+    throw new RangeError(message ?? `Index ${index} is out of range [${min}, ${max}].`);
+  }
+}, "rangeCheck");
+var isWeakKey = /* @__PURE__ */ __name((input) => {
+  const inputType = typeof input;
+  return inputType === "object" && input !== null || inputType === "function";
+}, "isWeakKey");
+
 // src/data-structures/hash/hash-map.ts
 var HashMap = class extends IterableEntryBase {
   static {
@@ -309,6 +315,14 @@ var HashMap = class extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -350,6 +364,14 @@ var HashMap = class extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -429,6 +451,22 @@ var HashMap = class extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -474,7 +512,7 @@ var HashMap = class extends IterableEntryBase {
       if (this.store[strKey] === void 0) this._size++;
       this._store[strKey] = { key, value };
     }
-    return true;
+    return this;
   }
   /**
     * Insert many entries from an iterable.
@@ -501,6 +539,14 @@ var HashMap = class extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -522,7 +568,11 @@ var HashMap = class extends IterableEntryBase {
       let key, value;
       if (this.isEntry(rawEle)) [key, value] = rawEle;
       else if (this._toEntryFn) [key, value] = this._toEntryFn(rawEle);
-      if (key !== void 0 && value !== void 0) results.push(this.set(key, value));
+      if (key !== void 0 && value !== void 0) {
+        const sizeBefore = this._size;
+        this.set(key, value);
+        results.push(sizeBefore < this._size);
+      }
     }
     return results;
   }
@@ -553,6 +603,14 @@ var HashMap = class extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -616,6 +674,14 @@ var HashMap = class extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -664,6 +730,14 @@ var HashMap = class extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -730,6 +804,14 @@ var HashMap = class extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -779,6 +861,14 @@ var HashMap = class extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -830,6 +920,14 @@ var HashMap = class extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -988,9 +1086,7 @@ var LinkedHashMap = class extends IterableEntryBase {
     if (this.isEntry(rawElement)) {
       return rawElement;
     }
-    throw new TypeError(
-      ERR.invalidArgument("If elements do not adhere to [key, value], provide options.toEntryFn to transform raw records.", "HashMap")
-    );
+    raise(TypeError, ERR.invalidArgument("If elements do not adhere to [key, value], provide options.toEntryFn to transform raw records.", "HashMap"));
   }, "_toEntryFn");
   get toEntryFn() {
     return this._toEntryFn;
@@ -1046,7 +1142,7 @@ var LinkedHashMap = class extends IterableEntryBase {
    * @remarks Time O(1), Space O(1)
    * @param key - Key.
    * @param [value] - Value.
-   * @returns True when the operation succeeds.
+   * @returns This map (for chaining).
    */
   set(key, value) {
     let node;
@@ -1081,7 +1177,7 @@ var LinkedHashMap = class extends IterableEntryBase {
       this._sentinel.prev = node;
       this._size++;
     }
-    return true;
+    return this;
   }
   setMany(entryOrRawElements) {
     const results = [];
@@ -1089,7 +1185,11 @@ var LinkedHashMap = class extends IterableEntryBase {
       let key, value;
       if (this.isEntry(rawEle)) [key, value] = rawEle;
       else if (this._toEntryFn) [key, value] = this._toEntryFn(rawEle);
-      if (key !== void 0 && value !== void 0) results.push(this.set(key, value));
+      if (key !== void 0 && value !== void 0) {
+        const sizeBefore = this._size;
+        this.set(key, value);
+        results.push(sizeBefore < this._size);
+      }
     }
     return results;
   }
@@ -1167,13 +1267,16 @@ var LinkedHashMap = class extends IterableEntryBase {
    * Delete the entry at a given index.
    * @remarks Time O(N), Space O(1)
    * @param index - Zero-based index.
-   * @returns True if removed.
+   * @returns The removed entry [key, value].
+   * @throws {RangeError} If index is out of bounds.
    */
   deleteAt(index) {
     rangeCheck(index, 0, this._size - 1);
     let node = this.head;
     while (index--) node = node.next;
-    return this._deleteNode(node);
+    const entry = [node.key, node.value];
+    this._deleteNode(node);
+    return entry;
   }
   isEmpty() {
     return this._size === 0;