queue-typed 2.1.2 → 2.2.0

package/dist/esm/index.mjs

@@ -1,10 +1,11 @@
 var __defProp = Object.defineProperty;
-var __defNormalProp = (obj, key, value) => key in obj ? __defProp(obj, key, { enumerable: true, configurable: true, writable: true, value }) : obj[key] = value;
 var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
-var __publicField = (obj, key, value) => __defNormalProp(obj, typeof key !== "symbol" ? key + "" : key, value);
 
 // src/data-structures/base/iterable-element-base.ts
-var _IterableElementBase = class _IterableElementBase {
+var IterableElementBase = class {
+  static {
+    __name(this, "IterableElementBase");
+  }
   /**
    * Create a new iterable base.
    *
@@ -15,19 +16,19 @@ var _IterableElementBase = class _IterableElementBase {
    * Time O(1), Space O(1).
    */
   constructor(options) {
-    /**
-     * The converter used to transform a raw element (`R`) into a public element (`E`).
-     *
-     * @remarks
-     * Time O(1), Space O(1).
-     */
-    __publicField(this, "_toElementFn");
     if (options) {
       const { toElementFn } = options;
       if (typeof toElementFn === "function") this._toElementFn = toElementFn;
       else if (toElementFn) throw new TypeError("toElementFn must be a function type");
     }
   }
+  /**
+   * The converter used to transform a raw element (`R`) into a public element (`E`).
+   *
+   * @remarks
+   * Time O(1), Space O(1).
+   */
+  _toElementFn;
   /**
    * Exposes the current `toElementFn`, if configured.
    *
@@ -222,22 +223,22 @@ var _IterableElementBase = class _IterableElementBase {
     console.log(this.toVisual());
   }
 };
-__name(_IterableElementBase, "IterableElementBase");
-var IterableElementBase = _IterableElementBase;
 
 // src/data-structures/base/linear-base.ts
-var _LinkedListNode = class _LinkedListNode {
+var LinkedListNode = class {
+  static {
+    __name(this, "LinkedListNode");
+  }
   /**
    * Initialize a node.
    * @param value - Element value.
    * @remarks Time O(1), Space O(1)
    */
   constructor(value) {
-    __publicField(this, "_value");
-    __publicField(this, "_next");
     this._value = value;
     this._next = void 0;
   }
+  _value;
   /**
    * Element payload getter.
    * @returns Element value.
@@ -254,6 +255,7 @@ var _LinkedListNode = class _LinkedListNode {
   set value(value) {
     this._value = value;
   }
+  _next;
   /**
    * Next node getter.
    * @returns Next node or `undefined`.
@@ -271,9 +273,10 @@ var _LinkedListNode = class _LinkedListNode {
     this._next = value;
   }
 };
-__name(_LinkedListNode, "LinkedListNode");
-var LinkedListNode = _LinkedListNode;
-var _LinearBase = class _LinearBase extends IterableElementBase {
+var LinearBase = class _LinearBase extends IterableElementBase {
+  static {
+    __name(this, "LinearBase");
+  }
   /**
    * Construct a linear container with runtime options.
    * @param options - `{ maxLen?, ... }` bounds/behavior options.
@@ -281,12 +284,12 @@ var _LinearBase = class _LinearBase extends IterableElementBase {
    */
   constructor(options) {
     super(options);
-    __publicField(this, "_maxLen", -1);
     if (options) {
       const { maxLen } = options;
       if (typeof maxLen === "number" && maxLen > 0 && maxLen % 1 === 0) this._maxLen = maxLen;
     }
   }
+  _maxLen = -1;
   /**
    * Upper bound for length (if positive), or `-1` when unbounded.
    * @returns Maximum allowed length.
@@ -419,7 +422,7 @@ var _LinearBase = class _LinearBase extends IterableElementBase {
     return array;
   }
   reduceRight(callbackfn, initialValue) {
-    let accumulator = initialValue != null ? initialValue : 0;
+    let accumulator = initialValue ?? 0;
     for (let i = this.length - 1; i >= 0; i--) {
       accumulator = callbackfn(accumulator, this.at(i), i, this);
     }
@@ -461,9 +464,10 @@ var _LinearBase = class _LinearBase extends IterableElementBase {
     return this;
   }
 };
-__name(_LinearBase, "LinearBase");
-var LinearBase = _LinearBase;
-var _LinearLinkedBase = class _LinearLinkedBase extends LinearBase {
+var LinearLinkedBase = class extends LinearBase {
+  static {
+    __name(this, "LinearLinkedBase");
+  }
   constructor(options) {
     super(options);
     if (options) {
@@ -593,7 +597,7 @@ var _LinearLinkedBase = class _LinearLinkedBase extends LinearBase {
     return removedList;
   }
   reduceRight(callbackfn, initialValue) {
-    let accumulator = initialValue != null ? initialValue : 0;
+    let accumulator = initialValue ?? 0;
     let index = this.length - 1;
     for (const item of this._getReverseIterator()) {
       accumulator = callbackfn(accumulator, item, index--, this);
@@ -601,11 +605,12 @@ var _LinearLinkedBase = class _LinearLinkedBase extends LinearBase {
     return accumulator;
   }
 };
-__name(_LinearLinkedBase, "LinearLinkedBase");
-var LinearLinkedBase = _LinearLinkedBase;
 
 // src/data-structures/linked-list/singly-linked-list.ts
-var _SinglyLinkedListNode = class _SinglyLinkedListNode extends LinkedListNode {
+var SinglyLinkedListNode = class extends LinkedListNode {
+  static {
+    __name(this, "SinglyLinkedListNode");
+  }
   /**
    * Create a list node.
    * @remarks Time O(1), Space O(1)
@@ -614,10 +619,10 @@ var _SinglyLinkedListNode = class _SinglyLinkedListNode extends LinkedListNode {
    */
   constructor(value) {
     super(value);
-    __publicField(this, "_next");
     this._value = value;
     this._next = void 0;
   }
+  _next;
   /**
    * Get the next node.
    * @remarks Time O(1), Space O(1)
@@ -636,9 +641,11 @@ var _SinglyLinkedListNode = class _SinglyLinkedListNode extends LinkedListNode {
     this._next = value;
   }
 };
-__name(_SinglyLinkedListNode, "SinglyLinkedListNode");
-var SinglyLinkedListNode = _SinglyLinkedListNode;
-var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
+var SinglyLinkedList = class extends LinearLinkedBase {
+  static {
+    __name(this, "SinglyLinkedList");
+  }
+  _equals = Object.is;
   /**
    * Create a SinglyLinkedList and optionally bulk-insert elements.
    * @remarks Time O(N), Space O(N)
@@ -648,12 +655,9 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
    */
   constructor(elements = [], options) {
     super(options);
-    __publicField(this, "_equals", Object.is);
-    __publicField(this, "_head");
-    __publicField(this, "_tail");
-    __publicField(this, "_length", 0);
     this.pushMany(elements);
   }
+  _head;
   /**
    * Get the head node.
    * @remarks Time O(1), Space O(1)
@@ -662,6 +666,7 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
   get head() {
     return this._head;
   }
+  _tail;
   /**
    * Get the tail node.
    * @remarks Time O(1), Space O(1)
@@ -670,6 +675,7 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
   get tail() {
     return this._tail;
   }
+  _length = 0;
   /**
    * Get the number of elements.
    * @remarks Time O(1), Space O(1)
@@ -684,8 +690,7 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
    * @returns First element or undefined.
    */
   get first() {
-    var _a;
-    return (_a = this.head) == null ? void 0 : _a.value;
+    return this.head?.value;
   }
   /**
    * Get the last element value.
@@ -693,8 +698,7 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
    * @returns Last element or undefined.
    */
   get last() {
-    var _a;
-    return (_a = this.tail) == null ? void 0 : _a.value;
+    return this.tail?.value;
   }
   /**
    * Create a new list from an iterable of elements.
@@ -1173,7 +1177,7 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
    * @returns A new SinglyLinkedList with mapped values.
    */
   map(callback, options, thisArg) {
-    const out = this._createLike([], { ...options != null ? options : {}, maxLen: this._maxLen });
+    const out = this._createLike([], { ...options ?? {}, maxLen: this._maxLen });
     let index = 0;
     for (const value of this) out.push(callback.call(thisArg, value, index++, this));
     return out;
@@ -1298,8 +1302,6 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     return this._createLike([], options);
   }
 };
-__name(_SinglyLinkedList, "SinglyLinkedList");
-var SinglyLinkedList = _SinglyLinkedList;
 function elementOrPredicate(input, equals) {
   if (input instanceof SinglyLinkedListNode) return (node) => node === input;
   if (typeof input === "function") return input;
@@ -1309,7 +1311,10 @@ function elementOrPredicate(input, equals) {
 __name(elementOrPredicate, "elementOrPredicate");
 
 // src/data-structures/queue/queue.ts
-var _Queue = class _Queue extends LinearBase {
+var Queue = class _Queue extends LinearBase {
+  static {
+    __name(this, "Queue");
+  }
   /**
    * Create a Queue and optionally bulk-insert elements.
    * @remarks Time O(N), Space O(N)
@@ -1319,15 +1324,13 @@ var _Queue = class _Queue extends LinearBase {
    */
   constructor(elements = [], options) {
     super(options);
-    __publicField(this, "_elements", []);
-    __publicField(this, "_offset", 0);
-    __publicField(this, "_autoCompactRatio", 0.5);
     if (options) {
       const { autoCompactRatio = 0.5 } = options;
       this._autoCompactRatio = autoCompactRatio;
     }
     this.pushMany(elements);
   }
+  _elements = [];
   /**
    * Get the underlying array buffer.
    * @remarks Time O(1), Space O(1)
@@ -1336,6 +1339,7 @@ var _Queue = class _Queue extends LinearBase {
   get elements() {
     return this._elements;
   }
+  _offset = 0;
   /**
    * Get the current start offset into the array.
    * @remarks Time O(1), Space O(1)
@@ -1344,6 +1348,7 @@ var _Queue = class _Queue extends LinearBase {
   get offset() {
     return this._offset;
   }
+  _autoCompactRatio = 0.5;
   /**
    * Get the compaction threshold (offset/size).
    * @remarks Time O(1), Space O(1)
@@ -1588,11 +1593,10 @@ var _Queue = class _Queue extends LinearBase {
    * @returns A new Queue with mapped elements.
    */
   map(callback, options, thisArg) {
-    var _a, _b;
     const out = new this.constructor([], {
-      toElementFn: options == null ? void 0 : options.toElementFn,
-      maxLen: (_a = options == null ? void 0 : options.maxLen) != null ? _a : this._maxLen,
-      autoCompactRatio: (_b = options == null ? void 0 : options.autoCompactRatio) != null ? _b : this._autoCompactRatio
+      toElementFn: options?.toElementFn,
+      maxLen: options?.maxLen ?? this._maxLen,
+      autoCompactRatio: options?.autoCompactRatio ?? this._autoCompactRatio
     });
     let index = 0;
     for (const v of this)
@@ -1607,14 +1611,13 @@ var _Queue = class _Queue extends LinearBase {
    * @returns A new queue with mapped elements (same element type).
    */
   mapSame(callback, thisArg) {
-    var _a;
     const Ctor = this.constructor;
     const out = new Ctor([], {
       toElementFn: this.toElementFn,
       maxLen: this._maxLen,
       autoCompactRatio: this._autoCompactRatio
     });
-    (_a = out._setAutoCompactRatio) == null ? void 0 : _a.call(out, this._autoCompactRatio);
+    out._setAutoCompactRatio?.(this._autoCompactRatio);
     let index = 0;
     for (const v of this) {
       const mv = thisArg === void 0 ? callback(v, index++, this) : callback.call(thisArg, v, index++, this);
@@ -1674,9 +1677,10 @@ var _Queue = class _Queue extends LinearBase {
     return new Ctor(elements, options);
   }
 };
-__name(_Queue, "Queue");
-var Queue = _Queue;
-var _LinkedListQueue = class _LinkedListQueue extends SinglyLinkedList {
+var LinkedListQueue = class extends SinglyLinkedList {
+  static {
+    __name(this, "LinkedListQueue");
+  }
   /**
    * Deep clone this linked-list-based queue.
    * @remarks Time O(N), Space O(N)
@@ -1688,8 +1692,6 @@ var _LinkedListQueue = class _LinkedListQueue extends SinglyLinkedList {
     return out;
   }
 };
-__name(_LinkedListQueue, "LinkedListQueue");
-var LinkedListQueue = _LinkedListQueue;
 
 // src/utils/utils.ts
 var rangeCheck = /* @__PURE__ */ __name((index, min, max, message = "Index out of bounds.") => {
@@ -1730,7 +1732,11 @@ function isComparable(value, isForceObjectComparable = false) {
 __name(isComparable, "isComparable");
 
 // src/data-structures/queue/deque.ts
-var _Deque = class _Deque extends LinearBase {
+var Deque = class extends LinearBase {
+  static {
+    __name(this, "Deque");
+  }
+  _equals = Object.is;
   /**
    * Create a Deque and optionally bulk-insert elements.
    * @remarks Time O(N), Space O(N)
@@ -1740,15 +1746,6 @@ var _Deque = class _Deque extends LinearBase {
    */
   constructor(elements = [], options) {
     super(options);
-    __publicField(this, "_equals", Object.is);
-    __publicField(this, "_bucketSize", 1 << 12);
-    __publicField(this, "_bucketFirst", 0);
-    __publicField(this, "_firstInBucket", 0);
-    __publicField(this, "_bucketLast", 0);
-    __publicField(this, "_lastInBucket", 0);
-    __publicField(this, "_bucketCount", 0);
-    __publicField(this, "_buckets", []);
-    __publicField(this, "_length", 0);
     if (options) {
       const { bucketSize } = options;
       if (typeof bucketSize === "number") this._bucketSize = bucketSize;
@@ -1768,6 +1765,7 @@ var _Deque = class _Deque extends LinearBase {
     this._firstInBucket = this._lastInBucket = this._bucketSize - _size % this._bucketSize >> 1;
     this.pushMany(elements);
   }
+  _bucketSize = 1 << 12;
   /**
    * Get the current bucket size.
    * @remarks Time O(1), Space O(1)
@@ -1776,6 +1774,7 @@ var _Deque = class _Deque extends LinearBase {
   get bucketSize() {
     return this._bucketSize;
   }
+  _bucketFirst = 0;
   /**
    * Get the index of the first bucket in use.
    * @remarks Time O(1), Space O(1)
@@ -1784,6 +1783,7 @@ var _Deque = class _Deque extends LinearBase {
   get bucketFirst() {
     return this._bucketFirst;
   }
+  _firstInBucket = 0;
   /**
    * Get the index inside the first bucket.
    * @remarks Time O(1), Space O(1)
@@ -1792,6 +1792,7 @@ var _Deque = class _Deque extends LinearBase {
   get firstInBucket() {
     return this._firstInBucket;
   }
+  _bucketLast = 0;
   /**
    * Get the index of the last bucket in use.
    * @remarks Time O(1), Space O(1)
@@ -1800,6 +1801,7 @@ var _Deque = class _Deque extends LinearBase {
   get bucketLast() {
     return this._bucketLast;
   }
+  _lastInBucket = 0;
   /**
    * Get the index inside the last bucket.
    * @remarks Time O(1), Space O(1)
@@ -1808,6 +1810,7 @@ var _Deque = class _Deque extends LinearBase {
   get lastInBucket() {
     return this._lastInBucket;
   }
+  _bucketCount = 0;
   /**
    * Get the number of buckets allocated.
    * @remarks Time O(1), Space O(1)
@@ -1816,6 +1819,7 @@ var _Deque = class _Deque extends LinearBase {
   get bucketCount() {
     return this._bucketCount;
   }
+  _buckets = [];
   /**
    * Get the internal buckets array.
    * @remarks Time O(1), Space O(1)
@@ -1824,6 +1828,7 @@ var _Deque = class _Deque extends LinearBase {
   get buckets() {
     return this._buckets;
   }
+  _length = 0;
   /**
    * Get the number of elements in the deque.
    * @remarks Time O(1), Space O(1)
@@ -2339,7 +2344,7 @@ var _Deque = class _Deque extends LinearBase {
    */
   map(callback, options, thisArg) {
     const out = this._createLike([], {
-      ...options != null ? options : {},
+      ...options ?? {},
       bucketSize: this._bucketSize,
       maxLen: this._maxLen
     });
@@ -2453,8 +2458,6 @@ var _Deque = class _Deque extends LinearBase {
     }
   }
 };
-__name(_Deque, "Deque");
-var Deque = _Deque;
 
 // src/common/index.ts
 var DFSOperation = /* @__PURE__ */ ((DFSOperation2) => {
@@ -2462,7 +2465,7 @@ var DFSOperation = /* @__PURE__ */ ((DFSOperation2) => {
   DFSOperation2[DFSOperation2["PROCESS"] = 1] = "PROCESS";
   return DFSOperation2;
 })(DFSOperation || {});
-var _Range = class _Range {
+var Range = class {
   constructor(low, high, includeLow = true, includeHigh = true) {
     this.low = low;
     this.high = high;
@@ -2471,6 +2474,9 @@ var _Range = class _Range {
     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");
   }
+  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;
@@ -2478,8 +2484,6 @@ var _Range = class _Range {
     return lowCheck && highCheck;
   }
 };
-__name(_Range, "Range");
-var Range = _Range;
 /**
  * data-structure-typed
  *