deque-typed 2.1.2 → 2.2.0

package/dist/cjs/index.cjs

@@ -1,9 +1,7 @@
 'use strict';
 
 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/utils/utils.ts
 var rangeCheck = /* @__PURE__ */ __name((index, min, max, message = "Index out of bounds.") => {
@@ -44,7 +42,10 @@ function isComparable(value, isForceObjectComparable = false) {
 __name(isComparable, "isComparable");
 
 // src/data-structures/base/iterable-element-base.ts
-var _IterableElementBase = class _IterableElementBase {
+var IterableElementBase = class {
+  static {
+    __name(this, "IterableElementBase");
+  }
   /**
    * Create a new iterable base.
    *
@@ -55,19 +56,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.
    *
@@ -262,11 +263,12 @@ var _IterableElementBase = class _IterableElementBase {
     console.log(this.toVisual());
   }
 };
-__name(_IterableElementBase, "IterableElementBase");
-var IterableElementBase = _IterableElementBase;
 
 // src/data-structures/base/linear-base.ts
-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.
@@ -274,12 +276,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.
@@ -412,7 +414,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);
     }
@@ -454,11 +456,13 @@ var _LinearBase = class _LinearBase extends IterableElementBase {
     return this;
   }
 };
-__name(_LinearBase, "LinearBase");
-var LinearBase = _LinearBase;
 
 // 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)
@@ -468,15 +472,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;
@@ -496,6 +491,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)
@@ -504,6 +500,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)
@@ -512,6 +509,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)
@@ -520,6 +518,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)
@@ -528,6 +527,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)
@@ -536,6 +536,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)
@@ -544,6 +545,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)
@@ -552,6 +554,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)
@@ -1067,7 +1070,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
     });
@@ -1181,8 +1184,6 @@ var _Deque = class _Deque extends LinearBase {
     }
   }
 };
-__name(_Deque, "Deque");
-var Deque = _Deque;
 
 // src/common/index.ts
 var DFSOperation = /* @__PURE__ */ ((DFSOperation2) => {
@@ -1190,7 +1191,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;
@@ -1199,6 +1200,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;
@@ -1206,8 +1210,6 @@ var _Range = class _Range {
     return lowCheck && highCheck;
   }
 };
-__name(_Range, "Range");
-var Range = _Range;
 /**
  * data-structure-typed
  *