doubly-linked-list-typed 2.1.2 → 2.2.1

package/dist/cjs/index.cjs

@@ -1,12 +1,13 @@
 '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/data-structures/base/iterable-element-base.ts
-var _IterableElementBase = class _IterableElementBase {
+var IterableElementBase = class {
+  static {
+    __name(this, "IterableElementBase");
+  }
   /**
    * Create a new iterable base.
    *
@@ -17,19 +18,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.
    *
@@ -224,22 +225,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.
@@ -256,6 +257,7 @@ var _LinkedListNode = class _LinkedListNode {
   set value(value) {
     this._value = value;
   }
+  _next;
   /**
    * Next node getter.
    * @returns Next node or `undefined`.
@@ -273,9 +275,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.
@@ -283,12 +286,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.
@@ -421,7 +424,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);
     }
@@ -463,9 +466,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) {
@@ -595,7 +599,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);
@@ -603,11 +607,12 @@ var _LinearLinkedBase = class _LinearLinkedBase extends LinearBase {
     return accumulator;
   }
 };
-__name(_LinearLinkedBase, "LinearLinkedBase");
-var LinearLinkedBase = _LinearLinkedBase;
 
 // src/data-structures/linked-list/doubly-linked-list.ts
-var _DoublyLinkedListNode = class _DoublyLinkedListNode extends LinkedListNode {
+var DoublyLinkedListNode = class extends LinkedListNode {
+  static {
+    __name(this, "DoublyLinkedListNode");
+  }
   /**
    * Create a node.
    * @remarks Time O(1), Space O(1)
@@ -616,12 +621,11 @@ var _DoublyLinkedListNode = class _DoublyLinkedListNode extends LinkedListNode {
    */
   constructor(value) {
     super(value);
-    __publicField(this, "_next");
-    __publicField(this, "_prev");
     this._value = value;
     this._next = void 0;
     this._prev = void 0;
   }
+  _next;
   /**
    * Get the next node link.
    * @remarks Time O(1), Space O(1)
@@ -639,6 +643,7 @@ var _DoublyLinkedListNode = class _DoublyLinkedListNode extends LinkedListNode {
   set next(value) {
     this._next = value;
   }
+  _prev;
   /**
    * Get the previous node link.
    * @remarks Time O(1), Space O(1)
@@ -657,9 +662,11 @@ var _DoublyLinkedListNode = class _DoublyLinkedListNode extends LinkedListNode {
     this._prev = value;
   }
 };
-__name(_DoublyLinkedListNode, "DoublyLinkedListNode");
-var DoublyLinkedListNode = _DoublyLinkedListNode;
-var _DoublyLinkedList = class _DoublyLinkedList extends LinearLinkedBase {
+var DoublyLinkedList = class extends LinearLinkedBase {
+  static {
+    __name(this, "DoublyLinkedList");
+  }
+  _equals = Object.is;
   /**
    * Create a DoublyLinkedList and optionally bulk-insert elements.
    * @remarks Time O(N), Space O(N)
@@ -669,18 +676,15 @@ var _DoublyLinkedList = class _DoublyLinkedList extends LinearLinkedBase {
    */
   constructor(elements = [], options) {
     super(options);
-    __publicField(this, "_equals", Object.is);
-    __publicField(this, "_head");
-    __publicField(this, "_tail");
-    __publicField(this, "_length", 0);
     this._head = void 0;
     this._tail = void 0;
     this._length = 0;
-    if ((options == null ? void 0 : options.maxLen) && Number.isInteger(options.maxLen) && options.maxLen > 0) {
+    if (options?.maxLen && Number.isInteger(options.maxLen) && options.maxLen > 0) {
       this._maxLen = options.maxLen;
     }
     this.pushMany(elements);
   }
+  _head;
   /**
    * Get the head node.
    * @remarks Time O(1), Space O(1)
@@ -689,6 +693,7 @@ var _DoublyLinkedList = class _DoublyLinkedList extends LinearLinkedBase {
   get head() {
     return this._head;
   }
+  _tail;
   /**
    * Get the tail node.
    * @remarks Time O(1), Space O(1)
@@ -697,6 +702,7 @@ var _DoublyLinkedList = class _DoublyLinkedList extends LinearLinkedBase {
   get tail() {
     return this._tail;
   }
+  _length = 0;
   /**
    * Get the number of elements.
    * @remarks Time O(1), Space O(1)
@@ -711,8 +717,7 @@ var _DoublyLinkedList = class _DoublyLinkedList 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.
@@ -720,8 +725,7 @@ var _DoublyLinkedList = class _DoublyLinkedList 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 array of elements.
@@ -1136,7 +1140,7 @@ var _DoublyLinkedList = class _DoublyLinkedList extends LinearLinkedBase {
    * @returns A new DoublyLinkedList 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 v of this) out.push(callback.call(thisArg, v, index++, this));
     return out;
@@ -1222,8 +1226,6 @@ var _DoublyLinkedList = class _DoublyLinkedList extends LinearLinkedBase {
     }
   }
 };
-__name(_DoublyLinkedList, "DoublyLinkedList");
-var DoublyLinkedList = _DoublyLinkedList;
 
 // src/utils/utils.ts
 function isPrimitiveComparable(value) {
@@ -1265,7 +1267,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;
@@ -1274,6 +1276,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;
@@ -1281,8 +1286,6 @@ var _Range = class _Range {
     return lowCheck && highCheck;
   }
 };
-__name(_Range, "Range");
-var Range = _Range;
 /**
  * data-structure-typed
  *