queue-typed 2.5.1 → 2.5.3

package/dist/cjs/index.cjs

@@ -3,6 +3,61 @@
 var __defProp = Object.defineProperty;
 var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
 
+// 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"),
+  invalidIndex: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}Index must be an integer.`, "invalidIndex"),
+  // Type / argument
+  invalidArgument: /* @__PURE__ */ __name((reason, ctx) => `${ctx ? ctx + ": " : ""}${reason}`, "invalidArgument"),
+  comparatorRequired: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}Comparator is required for non-number/non-string/non-Date keys.`, "comparatorRequired"),
+  invalidKey: /* @__PURE__ */ __name((reason, ctx) => `${ctx ? ctx + ": " : ""}${reason}`, "invalidKey"),
+  notAFunction: /* @__PURE__ */ __name((name, ctx) => `${ctx ? ctx + ": " : ""}${name} must be a function.`, "notAFunction"),
+  invalidEntry: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}Each entry must be a [key, value] tuple.`, "invalidEntry"),
+  invalidNaN: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}NaN is not a valid key.`, "invalidNaN"),
+  invalidDate: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}Invalid Date key.`, "invalidDate"),
+  reduceEmpty: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}Reduce of empty structure with no initial value.`, "reduceEmpty"),
+  callbackReturnType: /* @__PURE__ */ __name((expected, got, ctx) => `${ctx ? ctx + ": " : ""}Callback must return ${expected}; got ${got}.`, "callbackReturnType"),
+  // State / operation
+  invalidOperation: /* @__PURE__ */ __name((reason, ctx) => `${ctx ? ctx + ": " : ""}${reason}`, "invalidOperation"),
+  // Matrix
+  matrixDimensionMismatch: /* @__PURE__ */ __name((op) => `Matrix: Dimensions must be compatible for ${op}.`, "matrixDimensionMismatch"),
+  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"),
+  // Order statistic
+  orderStatisticNotEnabled: /* @__PURE__ */ __name((method, ctx) => `${ctx ? ctx + ": " : ""}${method}() requires enableOrderStatistic: true.`, "orderStatisticNotEnabled")
+};
+
+// src/common/index.ts
+var DFSOperation = /* @__PURE__ */ ((DFSOperation2) => {
+  DFSOperation2[DFSOperation2["VISIT"] = 0] = "VISIT";
+  DFSOperation2[DFSOperation2["PROCESS"] = 1] = "PROCESS";
+  return DFSOperation2;
+})(DFSOperation || {});
+var Range = class {
+  constructor(low, high, includeLow = true, includeHigh = true) {
+    this.low = low;
+    this.high = high;
+    this.includeLow = includeLow;
+    this.includeHigh = includeHigh;
+  }
+  static {
+    __name(this, "Range");
+  }
+  // Determine whether a key is within the range
+  isInRange(key, comparator) {
+    const lowCheck = this.includeLow ? comparator(key, this.low) >= 0 : comparator(key, this.low) > 0;
+    const highCheck = this.includeHigh ? comparator(key, this.high) <= 0 : comparator(key, this.high) < 0;
+    return lowCheck && highCheck;
+  }
+};
+
 // src/data-structures/base/iterable-element-base.ts
 var IterableElementBase = class {
   static {
@@ -21,7 +76,7 @@ var IterableElementBase = class {
     if (options) {
       const { toElementFn } = options;
       if (typeof toElementFn === "function") this._toElementFn = toElementFn;
-      else if (toElementFn) throw new TypeError("toElementFn must be a function type");
+      else if (toElementFn) raise(TypeError, "toElementFn must be a function type");
     }
   }
   /**
@@ -184,7 +239,7 @@ var IterableElementBase = class {
       acc = initialValue;
     } else {
       const first = iter.next();
-      if (first.done) throw new TypeError("Reduce of empty structure with no initial value");
+      if (first.done) raise(TypeError, "Reduce of empty structure with no initial value");
       acc = first.value;
       index = 1;
     }
@@ -753,6 +808,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -817,6 +879,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -886,6 +955,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -937,6 +1013,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1049,6 +1132,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1105,6 +1195,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1150,6 +1247,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1201,6 +1305,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1257,6 +1368,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1321,6 +1439,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1362,6 +1487,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1409,6 +1541,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1622,6 +1761,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1673,6 +1819,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1752,6 +1905,13 @@ var SinglyLinkedList = class extends LinearLinkedBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -1900,55 +2060,6 @@ function elementOrPredicate(input, equals) {
 }
 __name(elementOrPredicate, "elementOrPredicate");
 
-// src/common/error.ts
-var ERR = {
-  // Range / index
-  indexOutOfRange: /* @__PURE__ */ __name((index, min, max, ctx) => `${ctx ? ctx + ": " : ""}Index ${index} is out of range [${min}, ${max}].`, "indexOutOfRange"),
-  invalidIndex: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}Index must be an integer.`, "invalidIndex"),
-  // Type / argument
-  invalidArgument: /* @__PURE__ */ __name((reason, ctx) => `${ctx ? ctx + ": " : ""}${reason}`, "invalidArgument"),
-  comparatorRequired: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}Comparator is required for non-number/non-string/non-Date keys.`, "comparatorRequired"),
-  invalidKey: /* @__PURE__ */ __name((reason, ctx) => `${ctx ? ctx + ": " : ""}${reason}`, "invalidKey"),
-  notAFunction: /* @__PURE__ */ __name((name, ctx) => `${ctx ? ctx + ": " : ""}${name} must be a function.`, "notAFunction"),
-  invalidEntry: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}Each entry must be a [key, value] tuple.`, "invalidEntry"),
-  invalidNaN: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}NaN is not a valid key.`, "invalidNaN"),
-  invalidDate: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}Invalid Date key.`, "invalidDate"),
-  reduceEmpty: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}Reduce of empty structure with no initial value.`, "reduceEmpty"),
-  callbackReturnType: /* @__PURE__ */ __name((expected, got, ctx) => `${ctx ? ctx + ": " : ""}Callback must return ${expected}; got ${got}.`, "callbackReturnType"),
-  // State / operation
-  invalidOperation: /* @__PURE__ */ __name((reason, ctx) => `${ctx ? ctx + ": " : ""}${reason}`, "invalidOperation"),
-  // Matrix
-  matrixDimensionMismatch: /* @__PURE__ */ __name((op) => `Matrix: Dimensions must be compatible for ${op}.`, "matrixDimensionMismatch"),
-  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")
-};
-
-// src/common/index.ts
-var DFSOperation = /* @__PURE__ */ ((DFSOperation2) => {
-  DFSOperation2[DFSOperation2["VISIT"] = 0] = "VISIT";
-  DFSOperation2[DFSOperation2["PROCESS"] = 1] = "PROCESS";
-  return DFSOperation2;
-})(DFSOperation || {});
-var Range = class {
-  constructor(low, high, includeLow = true, includeHigh = true) {
-    this.low = low;
-    this.high = high;
-    this.includeLow = includeLow;
-    this.includeHigh = includeHigh;
-  }
-  static {
-    __name(this, "Range");
-  }
-  // Determine whether a key is within the range
-  isInRange(key, comparator) {
-    const lowCheck = this.includeLow ? comparator(key, this.low) >= 0 : comparator(key, this.low) > 0;
-    const highCheck = this.includeHigh ? comparator(key, this.high) <= 0 : comparator(key, this.high) < 0;
-    return lowCheck && highCheck;
-  }
-};
-
 // src/data-structures/queue/queue.ts
 var Queue = class _Queue extends LinearBase {
   static {
@@ -2033,6 +2144,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2080,6 +2198,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2097,6 +2222,14 @@ var Queue = class _Queue extends LinearBase {
   get first() {
     return this.length > 0 ? this.elements[this._offset] : void 0;
   }
+  /**
+   * Peek at the front element without removing it (alias for `first`).
+   * @remarks Time O(1), Space O(1)
+   * @returns Front element or undefined.
+   */
+  peek() {
+    return this.first;
+  }
   /**
    * Get the last element (back) without removing it.
    * @remarks Time O(1), Space O(1)
@@ -2143,6 +2276,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2202,6 +2342,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2268,6 +2415,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2324,6 +2478,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2373,6 +2534,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2427,6 +2595,21 @@ var Queue = class _Queue extends LinearBase {
     this._elements[this._offset + index] = newElement;
     return true;
   }
+  /**
+   * Delete the first element that satisfies a predicate.
+   * @remarks Time O(N), Space O(N)
+   * @param predicate - Function (value, index, queue) → boolean to decide deletion.
+   * @returns True if a match was removed.
+   */
+  deleteWhere(predicate) {
+    for (let i = 0; i < this.length; i++) {
+      if (predicate(this._elements[this._offset + i], i, this)) {
+        this.deleteAt(i);
+        return true;
+      }
+    }
+    return false;
+  }
   /**
    * Reverse the queue in-place by compacting then reversing.
    * @remarks Time O(N), Space O(N)
@@ -2463,6 +2646,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2506,6 +2696,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2572,6 +2769,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2622,6 +2826,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2676,6 +2887,13 @@ var Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2952,6 +3170,12 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
     
     
     
@@ -2972,6 +3196,31 @@ var Deque = class extends LinearBase {
   *     console.log(last); // 50;
   *
   *     // Length unchanged
+  *     console.log(deque.length); // 5;
+    */
+  /**
+   * Peek at the front element without removing it (alias for `first`).
+   * @remarks Time O(1), Space O(1)
+   * @returns Front element or undefined.
+   */
+  peek() {
+    return this.first;
+  }
+  /**
+    * Deque peek at both ends
+    * @example
+  * // Deque peek at both ends
+  *  const deque = new Deque<number>([10, 20, 30, 40, 50]);
+  *
+  *     // Get first element without removing
+  *     const first = deque.at(0);
+  *     console.log(first); // 10;
+  *
+  *     // Get last element without removing
+  *     const last = deque.at(deque.length - 1);
+  *     console.log(last); // 50;
+  *
+  *     // Length unchanged
   *     console.log(deque.length); // 5;
     */
   get first() {
@@ -3006,6 +3255,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -3066,6 +3322,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -3139,6 +3402,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -3199,6 +3469,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -3260,6 +3537,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -3362,6 +3646,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -3404,6 +3695,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -3450,6 +3748,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -3647,6 +3952,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -3731,6 +4043,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -3840,6 +4159,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -3908,6 +4234,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -3959,6 +4292,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -4030,6 +4370,13 @@ var Deque = class extends LinearBase {
     
     
     
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -4180,5 +4527,6 @@ exports.ERR = ERR;
 exports.LinkedListQueue = LinkedListQueue;
 exports.Queue = Queue;
 exports.Range = Range;
+exports.raise = raise;
 //# sourceMappingURL=index.cjs.map
 //# sourceMappingURL=index.cjs.map