data-structure-typed 2.6.1 → 2.6.2

package/dist/esm-legacy/queue.mjs

@@ -699,10 +699,10 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
    */
   constructor(elements = [], options) {
     super(options);
-    __publicField(this, "_equals", /* @__PURE__ */ __name((a, b) => Object.is(a, b), "_equals"));
     __publicField(this, "_head");
     __publicField(this, "_tail");
     __publicField(this, "_length", 0);
+    __publicField(this, "_equals", /* @__PURE__ */ __name((a, b) => Object.is(a, b), "_equals"));
     this.pushMany(elements);
   }
   /**
@@ -764,68 +764,26 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     return list;
   }
   /**
-    * Append an element/node to the tail.
-    * @remarks Time O(1), Space O(1)
-    * @param elementOrNode - Element or node to append.
-    * @returns True when appended.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // basic SinglyLinkedList creation and push operation
-  *  // Create a simple SinglyLinkedList with initial values
-  *     const list = new SinglyLinkedList([1, 2, 3, 4, 5]);
-  *
-  *     // Verify the list maintains insertion order
-  *     console.log([...list]); // [1, 2, 3, 4, 5];
-  *
-  *     // Check length
-  *     console.log(list.length); // 5;
-  *
-  *     // Push a new element to the end
-  *     list.push(6);
-  *     console.log(list.length); // 6;
-  *     console.log([...list]); // [1, 2, 3, 4, 5, 6];
-    */
+   * Append an element/node to the tail.
+   * @remarks Time O(1), Space O(1)
+   * @param elementOrNode - Element or node to append.
+   * @returns True when appended.
+   * @example
+   * // basic SinglyLinkedList creation and push operation
+   *  // Create a simple SinglyLinkedList with initial values
+   *     const list = new SinglyLinkedList([1, 2, 3, 4, 5]);
+   *
+   *     // Verify the list maintains insertion order
+   *     console.log([...list]); // [1, 2, 3, 4, 5];
+   *
+   *     // Check length
+   *     console.log(list.length); // 5;
+   *
+   *     // Push a new element to the end
+   *     list.push(6);
+   *     console.log(list.length); // 6;
+   *     console.log([...list]); // [1, 2, 3, 4, 5, 6];
+   */
   push(elementOrNode) {
     const newNode = this._ensureNode(elementOrNode);
     if (!this.head) {
@@ -839,67 +797,25 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     return true;
   }
   /**
-    * Remove and return the tail element.
-    * @remarks Time O(N), Space O(1)
-    * @returns Removed element or undefined.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // SinglyLinkedList pop and shift operations
-  *  const list = new SinglyLinkedList<number>([10, 20, 30, 40, 50]);
-  *
-  *     // Pop removes from the end
-  *     const last = list.pop();
-  *     console.log(last); // 50;
-  *
-  *     // Shift removes from the beginning
-  *     const first = list.shift();
-  *     console.log(first); // 10;
-  *
-  *     // Verify remaining elements
-  *     console.log([...list]); // [20, 30, 40];
-  *     console.log(list.length); // 3;
-    */
+   * Remove and return the tail element.
+   * @remarks Time O(N), Space O(1)
+   * @returns Removed element or undefined.
+   * @example
+   * // SinglyLinkedList pop and shift operations
+   *  const list = new SinglyLinkedList<number>([10, 20, 30, 40, 50]);
+   *
+   *     // Pop removes from the end
+   *     const last = list.pop();
+   *     console.log(last); // 50;
+   *
+   *     // Shift removes from the beginning
+   *     const first = list.shift();
+   *     console.log(first); // 10;
+   *
+   *     // Verify remaining elements
+   *     console.log([...list]); // [20, 30, 40];
+   *     console.log(list.length); // 3;
+   */
   pop() {
     var _a;
     if (!this.head) return void 0;
@@ -919,57 +835,15 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     return value;
   }
   /**
-    * Remove and return the head element.
-    * @remarks Time O(1), Space O(1)
-    * @returns Removed element or undefined.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Remove from the front
-  *  const list = new SinglyLinkedList<number>([10, 20, 30]);
-  *     console.log(list.shift()); // 10;
-  *     console.log(list.length); // 2;
-    */
+   * Remove and return the head element.
+   * @remarks Time O(1), Space O(1)
+   * @returns Removed element or undefined.
+   * @example
+   * // Remove from the front
+   *  const list = new SinglyLinkedList<number>([10, 20, 30]);
+   *     console.log(list.shift()); // 10;
+   *     console.log(list.length); // 2;
+   */
   shift() {
     if (!this.head) return void 0;
     const removed = this.head;
@@ -979,73 +853,31 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     return removed.value;
   }
   /**
-    * Prepend an element/node to the head.
-    * @remarks Time O(1), Space O(1)
-    * @param elementOrNode - Element or node to prepend.
-    * @returns True when prepended.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // SinglyLinkedList unshift and forward traversal
-  *  const list = new SinglyLinkedList<number>([20, 30, 40]);
-  *
-  *     // Unshift adds to the beginning
-  *     list.unshift(10);
-  *     console.log([...list]); // [10, 20, 30, 40];
-  *
-  *     // Access elements (forward traversal only for singly linked)
-  *     const second = list.at(1);
-  *     console.log(second); // 20;
-  *
-  *     // SinglyLinkedList allows forward iteration only
-  *     const elements: number[] = [];
-  *     for (const item of list) {
-  *       elements.push(item);
-  *     }
-  *     console.log(elements); // [10, 20, 30, 40];
-  *
-  *     console.log(list.length); // 4;
-    */
+   * Prepend an element/node to the head.
+   * @remarks Time O(1), Space O(1)
+   * @param elementOrNode - Element or node to prepend.
+   * @returns True when prepended.
+   * @example
+   * // SinglyLinkedList unshift and forward traversal
+   *  const list = new SinglyLinkedList<number>([20, 30, 40]);
+   *
+   *     // Unshift adds to the beginning
+   *     list.unshift(10);
+   *     console.log([...list]); // [10, 20, 30, 40];
+   *
+   *     // Access elements (forward traversal only for singly linked)
+   *     const second = list.at(1);
+   *     console.log(second); // 20;
+   *
+   *     // SinglyLinkedList allows forward iteration only
+   *     const elements: number[] = [];
+   *     for (const item of list) {
+   *       elements.push(item);
+   *     }
+   *     console.log(elements); // [10, 20, 30, 40];
+   *
+   *     console.log(list.length); // 4;
+   */
   unshift(elementOrNode) {
     const newNode = this._ensureNode(elementOrNode);
     if (!this.head) {
@@ -1101,59 +933,17 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     return void 0;
   }
   /**
-    * Get the element at a given index.
-    * @remarks Time O(N), Space O(1)
-    * @param index - Zero-based index.
-    * @returns Element or undefined.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Access element by index
-  *  const list = new SinglyLinkedList<string>(['a', 'b', 'c', 'd']);
-  *     console.log(list.at(0)); // 'a';
-  *     console.log(list.at(2)); // 'c';
-  *     console.log(list.at(3)); // 'd';
-    */
+   * Get the element at a given index.
+   * @remarks Time O(N), Space O(1)
+   * @param index - Zero-based index.
+   * @returns Element or undefined.
+   * @example
+   * // Access element by index
+   *  const list = new SinglyLinkedList<string>(['a', 'b', 'c', 'd']);
+   *     console.log(list.at(0)); // 'a';
+   *     console.log(list.at(2)); // 'c';
+   *     console.log(list.at(3)); // 'd';
+   */
   at(index) {
     if (index < 0 || index >= this._length) return void 0;
     let current = this.head;
@@ -1170,54 +960,15 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     return elementNodeOrPredicate instanceof SinglyLinkedListNode;
   }
   /**
-    * Get the node reference at a given index.
-    * @remarks Time O(N), Space O(1)
-    * @param index - Zero-based index.
-    * @returns Node or undefined.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Get node at index
-  *  const list = new SinglyLinkedList<string>(['a', 'b', 'c']);
-  *     console.log(list.getNodeAt(1)?.value); // 'b';
-    */
+   * Get the node reference at a given index.
+   * @remarks Time O(N), Space O(1)
+   * @param index - Zero-based index.
+   * @returns Node or undefined.
+   * @example
+   * // Get node at index
+   *  const list = new SinglyLinkedList<string>(['a', 'b', 'c']);
+   *     console.log(list.getNodeAt(1)?.value); // 'b';
+   */
   getNodeAt(index) {
     if (index < 0 || index >= this._length) return void 0;
     let current = this.head;
@@ -1225,55 +976,16 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     return current;
   }
   /**
-    * Delete the element at an index.
-    * @remarks Time O(N), Space O(1)
-    * @param index - Zero-based index.
-    * @returns Removed element or undefined.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Remove by index
-  *  const list = new SinglyLinkedList<string>(['a', 'b', 'c']);
-  *     list.deleteAt(1);
-  *     console.log(list.toArray()); // ['a', 'c'];
-    */
+   * Delete the element at an index.
+   * @remarks Time O(N), Space O(1)
+   * @param index - Zero-based index.
+   * @returns Removed element or undefined.
+   * @example
+   * // Remove by index
+   *  const list = new SinglyLinkedList<string>(['a', 'b', 'c']);
+   *     list.deleteAt(1);
+   *     console.log(list.toArray()); // ['a', 'c'];
+   */
   deleteAt(index) {
     if (index < 0 || index >= this._length) return void 0;
     if (index === 0) return this.shift();
@@ -1286,55 +998,16 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     return value;
   }
   /**
-    * Delete the first match by value/node.
-    * @remarks Time O(N), Space O(1)
-    * @param [elementOrNode] - Element or node to remove; if omitted/undefined, nothing happens.
-    * @returns True if removed.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Remove first occurrence
-  *  const list = new SinglyLinkedList<number>([1, 2, 3, 2]);
-  *     list.delete(2);
-  *     console.log(list.toArray()); // [1, 3, 2];
-    */
+   * Delete the first match by value/node.
+   * @remarks Time O(N), Space O(1)
+   * @param [elementOrNode] - Element or node to remove; if omitted/undefined, nothing happens.
+   * @returns True if removed.
+   * @example
+   * // Remove first occurrence
+   *  const list = new SinglyLinkedList<number>([1, 2, 3, 2]);
+   *     list.delete(2);
+   *     console.log(list.toArray()); // [1, 3, 2];
+   */
   delete(elementOrNode) {
     if (elementOrNode === void 0 || !this.head) return false;
     const node = this.isNode(elementOrNode) ? elementOrNode : this.getNode(elementOrNode);
@@ -1351,56 +1024,17 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     return true;
   }
   /**
-    * Insert a new element/node at an index, shifting following nodes.
-    * @remarks Time O(N), Space O(1)
-    * @param index - Zero-based index.
-    * @param newElementOrNode - Element or node to insert.
-    * @returns True if inserted.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Insert at index
-  *  const list = new SinglyLinkedList<number>([1, 3]);
-  *     list.addAt(1, 2);
-  *     console.log(list.toArray()); // [1, 2, 3];
-    */
+   * Insert a new element/node at an index, shifting following nodes.
+   * @remarks Time O(N), Space O(1)
+   * @param index - Zero-based index.
+   * @param newElementOrNode - Element or node to insert.
+   * @returns True if inserted.
+   * @example
+   * // Insert at index
+   *  const list = new SinglyLinkedList<number>([1, 3]);
+   *     list.addAt(1, 2);
+   *     console.log(list.toArray()); // [1, 2, 3];
+   */
   addAt(index, newElementOrNode) {
     if (index < 0 || index > this._length) return false;
     if (index === 0) return this.unshift(newElementOrNode);
@@ -1426,163 +1060,41 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     return true;
   }
   /**
-    * Check whether the list is empty.
-    * @remarks Time O(1), Space O(1)
-    * @returns True if length is 0.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Check empty
-  *  console.log(new SinglyLinkedList().isEmpty()); // true;
-    */
+   * Check whether the list is empty.
+   * @remarks Time O(1), Space O(1)
+   * @returns True if length is 0.
+   * @example
+   * // Check empty
+   *  console.log(new SinglyLinkedList().isEmpty()); // true;
+   */
   isEmpty() {
     return this._length === 0;
   }
   /**
-    * Remove all nodes and reset length.
-    * @remarks Time O(N), Space O(1)
-    * @returns void
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Remove all
-  *  const list = new SinglyLinkedList<number>([1, 2, 3]);
-  *     list.clear();
-  *     console.log(list.isEmpty()); // true;
-    */
+   * Remove all nodes and reset length.
+   * @remarks Time O(N), Space O(1)
+   * @returns void
+   * @example
+   * // Remove all
+   *  const list = new SinglyLinkedList<number>([1, 2, 3]);
+   *     list.clear();
+   *     console.log(list.isEmpty()); // true;
+   */
   clear() {
     this._head = void 0;
     this._tail = void 0;
     this._length = 0;
   }
   /**
-    * Reverse the list in place.
-    * @remarks Time O(N), Space O(1)
-    * @returns This list.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Reverse the list in-place
-  *  const list = new SinglyLinkedList<number>([1, 2, 3, 4]);
-  *     list.reverse();
-  *     console.log([...list]); // [4, 3, 2, 1];
-    */
+   * Reverse the list in place.
+   * @remarks Time O(N), Space O(1)
+   * @returns This list.
+   * @example
+   * // Reverse the list in-place
+   *  const list = new SinglyLinkedList<number>([1, 2, 3, 4]);
+   *     list.reverse();
+   *     console.log([...list]); // [4, 3, 2, 1];
+   */
   reverse() {
     if (!this.head || this.head === this.tail) return this;
     let prev;
@@ -1757,126 +1269,44 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     return false;
   }
   /**
-    * Deep clone this list (values are copied by reference).
-    * @remarks Time O(N), Space O(N)
-    * @returns A new list with the same element sequence.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Deep copy
-  *  const list = new SinglyLinkedList<number>([1, 2, 3]);
-  *     const copy = list.clone();
-  *     copy.pop();
-  *     console.log(list.length); // 3;
-  *     console.log(copy.length); // 2;
-    */
+   * Deep clone this list (values are copied by reference).
+   * @remarks Time O(N), Space O(N)
+   * @returns A new list with the same element sequence.
+   * @example
+   * // Deep copy
+   *  const list = new SinglyLinkedList<number>([1, 2, 3]);
+   *     const copy = list.clone();
+   *     copy.pop();
+   *     console.log(list.length); // 3;
+   *     console.log(copy.length); // 2;
+   */
   clone() {
     const out = this._createInstance();
     for (const v of this) out.push(v);
     return out;
   }
   /**
-    * Filter values into a new list of the same class.
-    * @remarks Time O(N), Space O(N)
-    * @param callback - Predicate (value, index, list) → boolean to keep value.
-    * @param [thisArg] - Value for `this` inside the callback.
-    * @returns A new list with kept values.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // SinglyLinkedList filter and map operations
-  *  const list = new SinglyLinkedList<number>([1, 2, 3, 4, 5]);
-  *
-  *     // Filter even numbers
-  *     const filtered = list.filter(value => value % 2 === 0);
-  *     console.log(filtered.length); // 2;
-  *
-  *     // Map to double values
-  *     const doubled = list.map(value => value * 2);
-  *     console.log(doubled.length); // 5;
-  *
-  *     // Use reduce to sum
-  *     const sum = list.reduce((acc, value) => acc + value, 0);
-  *     console.log(sum); // 15;
-    */
+   * Filter values into a new list of the same class.
+   * @remarks Time O(N), Space O(N)
+   * @param callback - Predicate (value, index, list) → boolean to keep value.
+   * @param [thisArg] - Value for `this` inside the callback.
+   * @returns A new list with kept values.
+   * @example
+   * // SinglyLinkedList filter and map operations
+   *  const list = new SinglyLinkedList<number>([1, 2, 3, 4, 5]);
+   *
+   *     // Filter even numbers
+   *     const filtered = list.filter(value => value % 2 === 0);
+   *     console.log(filtered.length); // 2;
+   *
+   *     // Map to double values
+   *     const doubled = list.map(value => value * 2);
+   *     console.log(doubled.length); // 5;
+   *
+   *     // Use reduce to sum
+   *     const sum = list.reduce((acc, value) => acc + value, 0);
+   *     console.log(sum); // 15;
+   */
   filter(callback, thisArg) {
     const out = this._createInstance();
     let index = 0;
@@ -1900,62 +1330,20 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
     return out;
   }
   /**
-    * Map values into a new list (possibly different element type).
-    * @remarks Time O(N), Space O(N)
-    * @template EM
-    * @template RM
-    * @param callback - Mapping function (value, index, list) → newElement.
-    * @param [options] - Options for the output list (e.g., maxLen, toElementFn).
-    * @param [thisArg] - Value for `this` inside the callback.
-    * @returns A new SinglyLinkedList with mapped values.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Transform elements
-  *  const list = new SinglyLinkedList<number>([1, 2, 3]);
-  *     const doubled = list.map(n => n * 2);
-  *     console.log([...doubled]); // [2, 4, 6];
-    */
+   * Map values into a new list (possibly different element type).
+   * @remarks Time O(N), Space O(N)
+   * @template EM
+   * @template RM
+   * @param callback - Mapping function (value, index, list) → newElement.
+   * @param [options] - Options for the output list (e.g., maxLen, toElementFn).
+   * @param [thisArg] - Value for `this` inside the callback.
+   * @returns A new SinglyLinkedList with mapped values.
+   * @example
+   * // Transform elements
+   *  const list = new SinglyLinkedList<number>([1, 2, 3]);
+   *     const doubled = list.map(n => n * 2);
+   *     console.log([...doubled]); // [2, 4, 6];
+   */
   map(callback, options, thisArg) {
     const out = this._createLike([], { ...options != null ? options : {}, maxLen: this._maxLen });
     let index = 0;
@@ -2146,124 +1534,32 @@ var _Queue = class _Queue extends LinearBase {
     this._autoCompactRatio = value;
   }
   /**
-    * Get the number of elements currently in the queue.
-    * @remarks Time O(1), Space O(1)
-    * @returns Current length.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Track queue length
-  *  const q = new Queue<number>();
-  *     console.log(q.length); // 0;
-  *     q.push(1);
-  *     q.push(2);
-  *     console.log(q.length); // 2;
-    */
+   * Get the number of elements currently in the queue.
+   * @remarks Time O(1), Space O(1)
+   * @returns Current length.
+   * @example
+   * // Track queue length
+   *  const q = new Queue<number>();
+   *     console.log(q.length); // 0;
+   *     q.push(1);
+   *     q.push(2);
+   *     console.log(q.length); // 2;
+   */
   get length() {
     return this.elements.length - this._offset;
   }
   /**
-    * Get the first element (front) without removing it.
-    * @remarks Time O(1), Space O(1)
-    * @returns Front element or undefined.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // View the front element
-  *  const q = new Queue<string>(['first', 'second', 'third']);
-  *     console.log(q.first); // 'first';
-  *     console.log(q.length); // 3;
-    */
-  get first() {
-    return this.length > 0 ? this.elements[this._offset] : void 0;
-  }
-  /**
-   * Peek at the front element without removing it (alias for `first`).
+   * Get the first element (front) without removing it.
    * @remarks Time O(1), Space O(1)
    * @returns Front element or undefined.
+   * @example
+   * // View the front element
+   *  const q = new Queue<string>(['first', 'second', 'third']);
+   *     console.log(q.first); // 'first';
+   *     console.log(q.length); // 3;
    */
-  peek() {
-    return this.first;
+  get first() {
+    return this.length > 0 ? this.elements[this._offset] : void 0;
   }
   /**
    * Get the last element (back) without removing it.
@@ -2284,131 +1580,55 @@ var _Queue = class _Queue extends LinearBase {
     return new _Queue(elements);
   }
   /**
-    * Check whether the queue is empty.
-    * @remarks Time O(1), Space O(1)
-    * @returns True if length is 0.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Queue for...of iteration and isEmpty check
-  *  const queue = new Queue<string>(['A', 'B', 'C', 'D']);
-  *
-  *     const elements: string[] = [];
-  *     for (const item of queue) {
-  *       elements.push(item);
-  *     }
-  *
-  *     // Verify all elements are iterated in order
-  *     console.log(elements); // ['A', 'B', 'C', 'D'];
-  *
-  *     // Process all elements
-  *     while (queue.length > 0) {
-  *       queue.shift();
-  *     }
-  *
-  *     console.log(queue.length); // 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;
+  }
+  /**
+   * Check whether the queue is empty.
+   * @remarks Time O(1), Space O(1)
+   * @returns True if length is 0.
+   * @example
+   * // Queue for...of iteration and isEmpty check
+   *  const queue = new Queue<string>(['A', 'B', 'C', 'D']);
+   *
+   *     const elements: string[] = [];
+   *     for (const item of queue) {
+   *       elements.push(item);
+   *     }
+   *
+   *     // Verify all elements are iterated in order
+   *     console.log(elements); // ['A', 'B', 'C', 'D'];
+   *
+   *     // Process all elements
+   *     while (queue.length > 0) {
+   *       queue.shift();
+   *     }
+   *
+   *     console.log(queue.length); // 0;
+   */
   isEmpty() {
     return this.length === 0;
   }
   /**
-    * Enqueue one element at the back.
-    * @remarks Time O(1), Space O(1)
-    * @param element - Element to enqueue.
-    * @returns True on success.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // basic Queue creation and push operation
-  *  // Create a simple Queue with initial values
-  *     const queue = new Queue([1, 2, 3, 4, 5]);
-  *
-  *     // Verify the queue maintains insertion order
-  *     console.log([...queue]); // [1, 2, 3, 4, 5];
-  *
-  *     // Check length
-  *     console.log(queue.length); // 5;
-    */
+   * Enqueue one element at the back.
+   * @remarks Time O(1), Space O(1)
+   * @param element - Element to enqueue.
+   * @returns True on success.
+   * @example
+   * // basic Queue creation and push operation
+   *  // Create a simple Queue with initial values
+   *     const queue = new Queue([1, 2, 3, 4, 5]);
+   *
+   *     // Verify the queue maintains insertion order
+   *     console.log([...queue]); // [1, 2, 3, 4, 5];
+   *
+   *     // Check length
+   *     console.log(queue.length); // 5;
+   */
   push(element) {
     this.elements.push(element);
     if (this._maxLen > 0 && this.length > this._maxLen) this.shift();
@@ -2429,66 +1649,24 @@ var _Queue = class _Queue extends LinearBase {
     return ans;
   }
   /**
-    * Dequeue one element from the front (amortized via offset).
-    * @remarks Time O(1) amortized, Space O(1)
-    * @returns Removed element or undefined.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Queue shift and peek operations
-  *  const queue = new Queue<number>([10, 20, 30, 40]);
-  *
-  *     // Peek at the front element without removing it
-  *     console.log(queue.first); // 10;
-  *
-  *     // Remove and get the first element (FIFO)
-  *     const first = queue.shift();
-  *     console.log(first); // 10;
-  *
-  *     // Verify remaining elements and length decreased
-  *     console.log([...queue]); // [20, 30, 40];
-  *     console.log(queue.length); // 3;
-    */
+   * Dequeue one element from the front (amortized via offset).
+   * @remarks Time O(1) amortized, Space O(1)
+   * @returns Removed element or undefined.
+   * @example
+   * // Queue shift and peek operations
+   *  const queue = new Queue<number>([10, 20, 30, 40]);
+   *
+   *     // Peek at the front element without removing it
+   *     console.log(queue.first); // 10;
+   *
+   *     // Remove and get the first element (FIFO)
+   *     const first = queue.shift();
+   *     console.log(first); // 10;
+   *
+   *     // Verify remaining elements and length decreased
+   *     console.log([...queue]); // [20, 30, 40];
+   *     console.log(queue.length); // 3;
+   */
   shift() {
     if (this.length === 0) return void 0;
     const first = this.first;
@@ -2497,55 +1675,16 @@ var _Queue = class _Queue extends LinearBase {
     return first;
   }
   /**
-    * Delete the first occurrence of a specific element.
-    * @remarks Time O(N), Space O(1)
-    * @param element - Element to remove (strict equality via Object.is).
-    * @returns True if an element was removed.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Remove specific element
-  *  const q = new Queue<number>([1, 2, 3, 2]);
-  *     q.delete(2);
-  *     console.log(q.length); // 3;
-    */
+   * Delete the first occurrence of a specific element.
+   * @remarks Time O(N), Space O(1)
+   * @param element - Element to remove (strict equality via Object.is).
+   * @returns True if an element was removed.
+   * @example
+   * // Remove specific element
+   *  const q = new Queue<number>([1, 2, 3, 2]);
+   *     q.delete(2);
+   *     console.log(q.length); // 3;
+   */
   delete(element) {
     for (let i = this._offset; i < this.elements.length; i++) {
       if (Object.is(this.elements[i], element)) {
@@ -2556,55 +1695,16 @@ var _Queue = class _Queue extends LinearBase {
     return false;
   }
   /**
-    * Get the element at a given logical index.
-    * @remarks Time O(1), Space O(1)
-    * @param index - Zero-based index from the front.
-    * @returns Element or undefined.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Access element by index
-  *  const q = new Queue<string>(['a', 'b', 'c']);
-  *     console.log(q.at(0)); // 'a';
-  *     console.log(q.at(2)); // 'c';
-    */
+   * Get the element at a given logical index.
+   * @remarks Time O(1), Space O(1)
+   * @param index - Zero-based index from the front.
+   * @returns Element or undefined.
+   * @example
+   * // Access element by index
+   *  const q = new Queue<string>(['a', 'b', 'c']);
+   *     console.log(q.at(0)); // 'a';
+   *     console.log(q.at(2)); // 'c';
+   */
   at(index) {
     if (index < 0 || index >= this.length) return void 0;
     return this._elements[this._offset + index];
@@ -2671,110 +1771,31 @@ var _Queue = class _Queue extends LinearBase {
     return this;
   }
   /**
-    * Remove all elements and reset offset.
-    * @remarks Time O(1), Space O(1)
-    * @returns void
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Remove all elements
-  *  const q = new Queue<number>([1, 2, 3]);
-  *     q.clear();
-  *     console.log(q.length); // 0;
-    */
+   * Remove all elements and reset offset.
+   * @remarks Time O(1), Space O(1)
+   * @returns void
+   * @example
+   * // Remove all elements
+   *  const q = new Queue<number>([1, 2, 3]);
+   *     q.clear();
+   *     console.log(q.length); // 0;
+   */
   clear() {
     this._elements = [];
     this._offset = 0;
   }
   /**
-    * Compact storage by discarding consumed head elements.
-    * @remarks Time O(N), Space O(N)
-    * @returns True when compaction performed.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Reclaim unused memory
-  *  const q = new Queue<number>([1, 2, 3, 4, 5]);
-  *     q.shift();
-  *     q.shift();
-  *     q.compact();
-  *     console.log(q.length); // 3;
-    */
+   * Compact storage by discarding consumed head elements.
+   * @remarks Time O(N), Space O(N)
+   * @returns True when compaction performed.
+   * @example
+   * // Reclaim unused memory
+   *  const q = new Queue<number>([1, 2, 3, 4, 5]);
+   *     q.shift();
+   *     q.shift();
+   *     q.compact();
+   *     console.log(q.length); // 3;
+   */
   compact() {
     this._elements = this.elements.slice(this._offset);
     this._offset = 0;
@@ -2800,57 +1821,17 @@ var _Queue = class _Queue extends LinearBase {
     return removed;
   }
   /**
-    * Deep clone this queue and its parameters.
-    * @remarks Time O(N), Space O(N)
-    * @returns A new queue with the same content and options.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Create independent copy
-  *  const q = new Queue<number>([1, 2, 3]);
-  *     const copy = q.clone();
-  *     copy.shift();
-  *     console.log(q.length); // 3;
-  *     console.log(copy.length); // 2;
-    */
+   * Deep clone this queue and its parameters.
+   * @remarks Time O(N), Space O(N)
+   * @returns A new queue with the same content and options.
+   * @example
+   * // Create independent copy
+   *  const q = new Queue<number>([1, 2, 3]);
+   *     const copy = q.clone();
+   *     copy.shift();
+   *     console.log(q.length); // 3;
+   *     console.log(copy.length); // 2;
+   */
   clone() {
     const out = this._createInstance({ toElementFn: this.toElementFn, maxLen: this._maxLen });
     out._setAutoCompactRatio(this._autoCompactRatio);
@@ -2858,57 +1839,17 @@ var _Queue = class _Queue extends LinearBase {
     return out;
   }
   /**
-    * Filter elements into a new queue of the same class.
-    * @remarks Time O(N), Space O(N)
-    * @param predicate - Predicate (element, index, queue) → boolean to keep element.
-    * @param [thisArg] - Value for `this` inside the predicate.
-    * @returns A new queue with kept elements.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Filter elements
-  *  const q = new Queue<number>([1, 2, 3, 4, 5]);
-  *     const evens = q.filter(x => x % 2 === 0);
-  *     console.log(evens.length); // 2;
-    */
+   * Filter elements into a new queue of the same class.
+   * @remarks Time O(N), Space O(N)
+   * @param predicate - Predicate (element, index, queue) → boolean to keep element.
+   * @param [thisArg] - Value for `this` inside the predicate.
+   * @returns A new queue with kept elements.
+   * @example
+   * // Filter elements
+   *  const q = new Queue<number>([1, 2, 3, 4, 5]);
+   *     const evens = q.filter(x => x % 2 === 0);
+   *     console.log(evens.length); // 2;
+   */
   filter(predicate, thisArg) {
     const out = this._createInstance({ toElementFn: this.toElementFn, maxLen: this._maxLen });
     out._setAutoCompactRatio(this._autoCompactRatio);
@@ -2920,59 +1861,20 @@ var _Queue = class _Queue extends LinearBase {
     return out;
   }
   /**
-    * Map each element to a new element in a possibly different-typed queue.
-    * @remarks Time O(N), Space O(N)
-    * @template EM
-    * @template RM
-    * @param callback - Mapping function (element, index, queue) → newElement.
-    * @param [options] - Options for the output queue (e.g., toElementFn, maxLen, autoCompactRatio).
-    * @param [thisArg] - Value for `this` inside the callback.
-    * @returns A new Queue with mapped elements.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Transform elements
-  *  const q = new Queue<number>([1, 2, 3]);
-  *     const doubled = q.map(x => x * 2);
-  *     console.log(doubled.toArray()); // [2, 4, 6];
-    */
+   * Map each element to a new element in a possibly different-typed queue.
+   * @remarks Time O(N), Space O(N)
+   * @template EM
+   * @template RM
+   * @param callback - Mapping function (element, index, queue) → newElement.
+   * @param [options] - Options for the output queue (e.g., toElementFn, maxLen, autoCompactRatio).
+   * @param [thisArg] - Value for `this` inside the callback.
+   * @returns A new Queue with mapped elements.
+   * @example
+   * // Transform elements
+   *  const q = new Queue<number>([1, 2, 3]);
+   *     const doubled = q.map(x => x * 2);
+   *     console.log(doubled.toArray()); // [2, 4, 6];
+   */
   map(callback, options, thisArg) {
     var _a, _b;
     const out = new this.constructor([], {
@@ -3089,14 +1991,13 @@ var calcMinUnitsRequired = /* @__PURE__ */ __name((totalQuantity, unitSize) => M
 var _Deque = class _Deque extends LinearBase {
   constructor(elements = [], options) {
     super(options);
-    __publicField(this, "_equals", /* @__PURE__ */ __name((a, b) => Object.is(a, b), "_equals"));
-    __publicField(this, "_bucketSize", 1 << 12);
-    __publicField(this, "_autoCompactRatio", 0.5);
     /**
      * Counter for shift/pop operations since last compaction check.
      * Only checks ratio every `_bucketSize` operations to minimize overhead.
      */
     __publicField(this, "_compactCounter", 0);
+    __publicField(this, "_bucketSize", 1 << 12);
+    __publicField(this, "_autoCompactRatio", 0.5);
     __publicField(this, "_bucketFirst", 0);
     __publicField(this, "_firstInBucket", 0);
     __publicField(this, "_bucketLast", 0);
@@ -3104,6 +2005,7 @@ var _Deque = class _Deque extends LinearBase {
     __publicField(this, "_bucketCount", 0);
     __publicField(this, "_buckets", []);
     __publicField(this, "_length", 0);
+    __publicField(this, "_equals", /* @__PURE__ */ __name((a, b) => Object.is(a, b), "_equals"));
     if (options) {
       const { bucketSize, autoCompactRatio } = options;
       if (typeof bucketSize === "number") this._bucketSize = bucketSize;
@@ -3207,146 +2109,36 @@ var _Deque = class _Deque extends LinearBase {
     return this._length;
   }
   /**
-    * Get the first element without removing it.
-    * @remarks Time O(1), Space O(1)
-    * @returns First element or undefined.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @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;
-    */
-  /**
-   * Peek at the front element without removing it (alias for `first`).
-   * @remarks Time O(1), Space O(1)
-   * @returns Front element or undefined.
+   * 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;
    */
-  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() {
     if (this._length === 0) return;
     return this._buckets[this._bucketFirst][this._firstInBucket];
   }
   /**
-    * Get the last element without removing it.
-    * @remarks Time O(1), Space O(1)
-    * @returns Last element or undefined.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Peek at the back element
-  *  const dq = new Deque<string>(['a', 'b', 'c']);
-  *     console.log(dq.last); // 'c';
-  *     console.log(dq.first); // 'a';
-    */
+   * Get the last element without removing it.
+   * @remarks Time O(1), Space O(1)
+   * @returns Last element or undefined.
+   * @example
+   * // Peek at the back element
+   *  const dq = new Deque<string>(['a', 'b', 'c']);
+   *     console.log(dq.last); // 'c';
+   *     console.log(dq.first); // 'a';
+   */
   get last() {
     if (this._length === 0) return;
     return this._buckets[this._bucketLast][this._lastInBucket];
@@ -3365,71 +2157,56 @@ var _Deque = class _Deque extends LinearBase {
     return new this(data, options);
   }
   /**
-    * Append one element at the back.
-    * @remarks Time O(1) amortized, Space O(1)
-    * @param element - Element to append.
-    * @returns True when appended.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // basic Deque creation and push/pop operations
-  *  // Create a simple Deque with initial values
-  *     const deque = new Deque([1, 2, 3, 4, 5]);
-  *
-  *     // Verify the deque maintains insertion order
-  *     console.log([...deque]); // [1, 2, 3, 4, 5];
-  *
-  *     // Check length
-  *     console.log(deque.length); // 5;
-  *
-  *     // Push to the end
-  *     deque.push(6);
-  *     console.log(deque.length); // 6;
-  *
-  *     // Pop from the end
-  *     const last = deque.pop();
-  *     console.log(last); // 6;
-    */
+   * Get the first element without removing it.
+   * @remarks Time O(1), Space O(1)
+   * @returns First element or undefined.
+   * @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;
+   */
+  /**
+   * 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;
+  }
+  /**
+   * Append one element at the back.
+   * @remarks Time O(1) amortized, Space O(1)
+   * @param element - Element to append.
+   * @returns True when appended.
+   * @example
+   * // basic Deque creation and push/pop operations
+   *  // Create a simple Deque with initial values
+   *     const deque = new Deque([1, 2, 3, 4, 5]);
+   *
+   *     // Verify the deque maintains insertion order
+   *     console.log([...deque]); // [1, 2, 3, 4, 5];
+   *
+   *     // Check length
+   *     console.log(deque.length); // 5;
+   *
+   *     // Push to the end
+   *     deque.push(6);
+   *     console.log(deque.length); // 6;
+   *
+   *     // Pop from the end
+   *     const last = deque.pop();
+   *     console.log(last); // 6;
+   */
   push(element) {
     if (this._length) {
       if (this._lastInBucket < this._bucketSize - 1) {
@@ -3449,57 +2226,15 @@ var _Deque = class _Deque extends LinearBase {
     return true;
   }
   /**
-    * Remove and return the last element.
-    * @remarks Time O(1), Space O(1)
-    * @returns Removed element or undefined.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Remove from the back
-  *  const dq = new Deque<number>([1, 2, 3]);
-  *     console.log(dq.pop()); // 3;
-  *     console.log(dq.length); // 2;
-    */
+   * Remove and return the last element.
+   * @remarks Time O(1), Space O(1)
+   * @returns Removed element or undefined.
+   * @example
+   * // Remove from the back
+   *  const dq = new Deque<number>([1, 2, 3]);
+   *     console.log(dq.pop()); // 3;
+   *     console.log(dq.length); // 2;
+   */
   pop() {
     if (this._length === 0) return;
     const element = this._buckets[this._bucketLast][this._lastInBucket];
@@ -3519,57 +2254,15 @@ var _Deque = class _Deque extends LinearBase {
     return element;
   }
   /**
-    * Remove and return the first element.
-    * @remarks Time O(1) amortized, Space O(1)
-    * @returns Removed element or undefined.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Remove from the front
-  *  const dq = new Deque<number>([1, 2, 3]);
-  *     console.log(dq.shift()); // 1;
-  *     console.log(dq.length); // 2;
-    */
+   * Remove and return the first element.
+   * @remarks Time O(1) amortized, Space O(1)
+   * @returns Removed element or undefined.
+   * @example
+   * // Remove from the front
+   *  const dq = new Deque<number>([1, 2, 3]);
+   *     console.log(dq.shift()); // 1;
+   *     console.log(dq.length); // 2;
+   */
   shift() {
     if (this._length === 0) return;
     const element = this._buckets[this._bucketFirst][this._firstInBucket];
@@ -3589,68 +2282,26 @@ var _Deque = class _Deque extends LinearBase {
     return element;
   }
   /**
-    * Prepend one element at the front.
-    * @remarks Time O(1) amortized, Space O(1)
-    * @param element - Element to prepend.
-    * @returns True when prepended.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Deque shift and unshift operations
-  *  const deque = new Deque<number>([20, 30, 40]);
-  *
-  *     // Unshift adds to the front
-  *     deque.unshift(10);
-  *     console.log([...deque]); // [10, 20, 30, 40];
-  *
-  *     // Shift removes from the front (O(1) complexity!)
-  *     const first = deque.shift();
-  *     console.log(first); // 10;
-  *
-  *     // Verify remaining elements
-  *     console.log([...deque]); // [20, 30, 40];
-  *     console.log(deque.length); // 3;
-    */
+   * Prepend one element at the front.
+   * @remarks Time O(1) amortized, Space O(1)
+   * @param element - Element to prepend.
+   * @returns True when prepended.
+   * @example
+   * // Deque shift and unshift operations
+   *  const deque = new Deque<number>([20, 30, 40]);
+   *
+   *     // Unshift adds to the front
+   *     deque.unshift(10);
+   *     console.log([...deque]); // [10, 20, 30, 40];
+   *
+   *     // Shift removes from the front (O(1) complexity!)
+   *     const first = deque.shift();
+   *     console.log(first); // 10;
+   *
+   *     // Verify remaining elements
+   *     console.log([...deque]); // [20, 30, 40];
+   *     console.log(deque.length); // 3;
+   */
   unshift(element) {
     if (this._length) {
       if (this._firstInBucket > 0) {
@@ -3704,107 +2355,27 @@ var _Deque = class _Deque extends LinearBase {
     return ans;
   }
   /**
-    * Check whether the deque is empty.
-    * @remarks Time O(1), Space O(1)
-    * @returns True if length is 0.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Check if empty
-  *  const dq = new Deque();
-  *     console.log(dq.isEmpty()); // true;
-    */
+   * Check whether the deque is empty.
+   * @remarks Time O(1), Space O(1)
+   * @returns True if length is 0.
+   * @example
+   * // Check if empty
+   *  const dq = new Deque();
+   *     console.log(dq.isEmpty()); // true;
+   */
   isEmpty() {
     return this._length === 0;
   }
   /**
-    * Remove all elements and reset structure.
-    * @remarks Time O(1), Space O(1)
-    * @returns void
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Remove all elements
-  *  const dq = new Deque<number>([1, 2, 3]);
-  *     dq.clear();
-  *     console.log(dq.length); // 0;
-    */
+   * Remove all elements and reset structure.
+   * @remarks Time O(1), Space O(1)
+   * @returns void
+   * @example
+   * // Remove all elements
+   *  const dq = new Deque<number>([1, 2, 3]);
+   *     dq.clear();
+   *     console.log(dq.length); // 0;
+   */
   clear() {
     this._buckets = [new Array(this._bucketSize)];
     this._bucketCount = 1;
@@ -3812,55 +2383,16 @@ var _Deque = class _Deque extends LinearBase {
     this._firstInBucket = this._lastInBucket = this._bucketSize >> 1;
   }
   /**
-    * Get the element at a given position.
-    * @remarks Time O(1), Space O(1)
-    * @param pos - Zero-based position from the front.
-    * @returns Element or undefined.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Access by index
-  *  const dq = new Deque<string>(['a', 'b', 'c']);
-  *     console.log(dq.at(0)); // 'a';
-  *     console.log(dq.at(2)); // 'c';
-    */
+   * Get the element at a given position.
+   * @remarks Time O(1), Space O(1)
+   * @param pos - Zero-based position from the front.
+   * @returns Element or undefined.
+   * @example
+   * // Access by index
+   *  const dq = new Deque<string>(['a', 'b', 'c']);
+   *     console.log(dq.at(0)); // 'a';
+   *     console.log(dq.at(2)); // 'c';
+   */
   at(pos) {
     if (pos < 0 || pos >= this._length) return void 0;
     const { bucketIndex, indexInBucket } = this._getBucketAndPosition(pos);
@@ -4019,55 +2551,16 @@ var _Deque = class _Deque extends LinearBase {
     }
   }
   /**
-    * Delete the first occurrence of a value.
-    * @remarks Time O(N), Space O(1)
-    * @param element - Element to remove (using the configured equality).
-    * @returns True if an element was removed.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Remove element
-  *  const dq = new Deque<number>([1, 2, 3]);
-  *     dq.delete(2);
-  *     console.log(dq.length); // 2;
-    */
+   * Delete the first occurrence of a value.
+   * @remarks Time O(N), Space O(1)
+   * @param element - Element to remove (using the configured equality).
+   * @returns True if an element was removed.
+   * @example
+   * // Remove element
+   *  const dq = new Deque<number>([1, 2, 3]);
+   *     dq.delete(2);
+   *     console.log(dq.length); // 2;
+   */
   delete(element) {
     const size = this._length;
     if (size === 0) return false;
@@ -4111,78 +2604,39 @@ var _Deque = class _Deque extends LinearBase {
     return this;
   }
   /**
-    * Reverse the deque by reversing buckets and pointers.
-    * @remarks Time O(N), Space O(N)
-    * @returns This deque.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Deque for...of iteration and reverse
-  *  const deque = new Deque<string>(['A', 'B', 'C', 'D']);
-  *
-  *     // Iterate forward
-  *     const forward: string[] = [];
-  *     for (const item of deque) {
-  *       forward.push(item);
-  *     }
-  *     console.log(forward); // ['A', 'B', 'C', 'D'];
-  *
-  *     // Reverse the deque
-  *     deque.reverse();
-  *     const backward: string[] = [];
-  *     for (const item of deque) {
-  *       backward.push(item);
-  *     }
-  *     console.log(backward); // ['D', 'C', 'B', 'A'];
-    */
-  /**
-    * Find the last value matching a predicate (scans back-to-front).
-    * @remarks Provided for familiarity when migrating from Array. Time O(n), Space O(1).
-    * @param predicate - Function called with (value, index, deque).
-    * @returns Matching value or undefined.
-     * @example
-  * // Find last matching value
-  *  const d = new Deque([1, 2, 3, 4, 5]);
-  *     console.log(d.findLast(v => v > 2)); // 5;
-  *     console.log(d.findLast(v => v % 2 === 0)); // 4;
-    */
+   * Reverse the deque by reversing buckets and pointers.
+   * @remarks Time O(N), Space O(N)
+   * @returns This deque.
+   * @example
+   * // Deque for...of iteration and reverse
+   *  const deque = new Deque<string>(['A', 'B', 'C', 'D']);
+   *
+   *     // Iterate forward
+   *     const forward: string[] = [];
+   *     for (const item of deque) {
+   *       forward.push(item);
+   *     }
+   *     console.log(forward); // ['A', 'B', 'C', 'D'];
+   *
+   *     // Reverse the deque
+   *     deque.reverse();
+   *     const backward: string[] = [];
+   *     for (const item of deque) {
+   *       backward.push(item);
+   *     }
+   *     console.log(backward); // ['D', 'C', 'B', 'A'];
+   */
+  /**
+   * Find the last value matching a predicate (scans back-to-front).
+   * @remarks Provided for familiarity when migrating from Array. Time O(n), Space O(1).
+   * @param predicate - Function called with (value, index, deque).
+   * @returns Matching value or undefined.
+   * @example
+   * // Find last matching value
+   *  const d = new Deque([1, 2, 3, 4, 5]);
+   *     console.log(d.findLast(v => v > 2)); // 5;
+   *     console.log(d.findLast(v => v % 2 === 0)); // 4;
+   */
   findLast(predicate) {
     for (let i = this.length - 1; i >= 0; i--) {
       const val = this.at(i);
@@ -4191,16 +2645,16 @@ var _Deque = class _Deque extends LinearBase {
     return void 0;
   }
   /**
-    * Find the index of the last value matching a predicate (scans back-to-front).
-    * @remarks Provided for familiarity when migrating from Array. Time O(n), Space O(1).
-    * @param predicate - Function called with (value, index, deque).
-    * @returns Matching index, or -1 if not found.
-     * @example
-  * // Find last matching index
-  *  const d = new Deque([10, 20, 30, 20, 10]);
-  *     console.log(d.findLastIndex(v => v === 20)); // 3;
-  *     console.log(d.findLastIndex(v => v === 10)); // 4;
-    */
+   * Find the index of the last value matching a predicate (scans back-to-front).
+   * @remarks Provided for familiarity when migrating from Array. Time O(n), Space O(1).
+   * @param predicate - Function called with (value, index, deque).
+   * @returns Matching index, or -1 if not found.
+   * @example
+   * // Find last matching index
+   *  const d = new Deque([10, 20, 30, 20, 10]);
+   *     console.log(d.findLastIndex(v => v === 20)); // 3;
+   *     console.log(d.findLastIndex(v => v === 10)); // 4;
+   */
   findLastIndex(predicate) {
     for (let i = this.length - 1; i >= 0; i--) {
       if (predicate(this.at(i), i, this)) return i;
@@ -4208,28 +2662,26 @@ var _Deque = class _Deque extends LinearBase {
     return -1;
   }
   /**
-    * Deque for...of iteration and reverse
-   
-    
-     * @example
-  * // Deque for...of iteration and reverse
-  *  const deque = new Deque<string>(['A', 'B', 'C', 'D']);
-  *
-  *     // Iterate forward
-  *     const forward: string[] = [];
-  *     for (const item of deque) {
-  *       forward.push(item);
-  *     }
-  *     console.log(forward); // ['A', 'B', 'C', 'D'];
-  *
-  *     // Reverse the deque
-  *     deque.reverse();
-  *     const backward: string[] = [];
-  *     for (const item of deque) {
-  *       backward.push(item);
-  *     }
-  *     console.log(backward); // ['D', 'C', 'B', 'A'];
-    */
+   * Deque for...of iteration and reverse
+   * @example
+   * // Deque for...of iteration and reverse
+   *  const deque = new Deque<string>(['A', 'B', 'C', 'D']);
+   *
+   *     // Iterate forward
+   *     const forward: string[] = [];
+   *     for (const item of deque) {
+   *       forward.push(item);
+   *     }
+   *     console.log(forward); // ['A', 'B', 'C', 'D'];
+   *
+   *     // Reverse the deque
+   *     deque.reverse();
+   *     const backward: string[] = [];
+   *     for (const item of deque) {
+   *       backward.push(item);
+   *     }
+   *     console.log(backward); // ['D', 'C', 'B', 'A'];
+   */
   reverse() {
     this._buckets.reverse().forEach(function(bucket) {
       bucket.reverse();
@@ -4263,81 +2715,22 @@ var _Deque = class _Deque extends LinearBase {
     return this;
   }
   /**
-   * Trim unused buckets to fit exactly the active range.
+   * Compact the deque by removing unused buckets.
    * @remarks Time O(N), Space O(1)
-   * @returns void
-   */
-  /**
-   * (Protected) Trigger auto-compaction if space utilization drops below threshold.
-   * Only checks every `_bucketSize` operations to minimize hot-path overhead.
-   * Uses element-based ratio: `elements / (bucketCount * bucketSize)`.
+   * @returns True if compaction was performed (bucket count reduced).
    */
-  _autoCompact() {
-    if (this._autoCompactRatio <= 0 || this._bucketCount <= 1) return;
-    this._compactCounter++;
-    if (this._compactCounter < this._bucketSize) return;
-    this._compactCounter = 0;
-    const utilization = this._length / (this._bucketCount * this._bucketSize);
-    if (utilization < this._autoCompactRatio) {
-      this.shrinkToFit();
-    }
-  }
   /**
    * Compact the deque by removing unused buckets.
    * @remarks Time O(N), Space O(1)
    * @returns True if compaction was performed (bucket count reduced).
+   * @example
+   * // Reclaim memory
+   *  const dq = new Deque<number>([1, 2, 3, 4, 5]);
+   *     dq.shift();
+   *     dq.shift();
+   *     dq.compact();
+   *     console.log(dq.length); // 3;
    */
-  /**
-    * Compact the deque by removing unused buckets.
-    * @remarks Time O(N), Space O(1)
-    * @returns True if compaction was performed (bucket count reduced).
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Reclaim memory
-  *  const dq = new Deque<number>([1, 2, 3, 4, 5]);
-  *     dq.shift();
-  *     dq.shift();
-  *     dq.compact();
-  *     console.log(dq.length); // 3;
-    */
   compact() {
     const before = this._bucketCount;
     this.shrinkToFit();
@@ -4365,57 +2758,17 @@ var _Deque = class _Deque extends LinearBase {
     this._compactCounter = 0;
   }
   /**
-    * Deep clone this deque, preserving options.
-    * @remarks Time O(N), Space O(N)
-    * @returns A new deque with the same content and options.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Create independent copy
-  *  const dq = new Deque<number>([1, 2, 3]);
-  *     const copy = dq.clone();
-  *     copy.pop();
-  *     console.log(dq.length); // 3;
-  *     console.log(copy.length); // 2;
-    */
+   * Deep clone this deque, preserving options.
+   * @remarks Time O(N), Space O(N)
+   * @returns A new deque with the same content and options.
+   * @example
+   * // Create independent copy
+   *  const dq = new Deque<number>([1, 2, 3]);
+   *     const copy = dq.clone();
+   *     copy.pop();
+   *     console.log(dq.length); // 3;
+   *     console.log(copy.length); // 2;
+   */
   clone() {
     return this._createLike(this, {
       bucketSize: this.bucketSize,
@@ -4424,57 +2777,17 @@ var _Deque = class _Deque extends LinearBase {
     });
   }
   /**
-    * Filter elements into a new deque of the same class.
-    * @remarks Time O(N), Space O(N)
-    * @param predicate - Predicate (value, index, deque) → boolean to keep element.
-    * @param [thisArg] - Value for `this` inside the predicate.
-    * @returns A new deque with kept elements.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Filter elements
-  *  const dq = new Deque<number>([1, 2, 3, 4]);
-  *     const result = dq.filter(x => x > 2);
-  *     console.log(result.length); // 2;
-    */
+   * Filter elements into a new deque of the same class.
+   * @remarks Time O(N), Space O(N)
+   * @param predicate - Predicate (value, index, deque) → boolean to keep element.
+   * @param [thisArg] - Value for `this` inside the predicate.
+   * @returns A new deque with kept elements.
+   * @example
+   * // Filter elements
+   *  const dq = new Deque<number>([1, 2, 3, 4]);
+   *     const result = dq.filter(x => x > 2);
+   *     console.log(result.length); // 2;
+   */
   filter(predicate, thisArg) {
     const out = this._createInstance({ toElementFn: this.toElementFn, maxLen: this._maxLen });
     out._setBucketSize(this._bucketSize);
@@ -4503,59 +2816,20 @@ var _Deque = class _Deque extends LinearBase {
     return out;
   }
   /**
-    * Map elements into a new deque (possibly different element type).
-    * @remarks Time O(N), Space O(N)
-    * @template EM
-    * @template RM
-    * @param callback - Mapping function (value, index, deque) → newElement.
-    * @param [options] - Options for the output deque (e.g., bucketSize, toElementFn, maxLen).
-    * @param [thisArg] - Value for `this` inside the callback.
-    * @returns A new Deque with mapped elements.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Transform elements
-  *  const dq = new Deque<number>([1, 2, 3]);
-  *     const result = dq.map(x => x * 10);
-  *     console.log(result.toArray()); // [10, 20, 30];
-    */
+   * Map elements into a new deque (possibly different element type).
+   * @remarks Time O(N), Space O(N)
+   * @template EM
+   * @template RM
+   * @param callback - Mapping function (value, index, deque) → newElement.
+   * @param [options] - Options for the output deque (e.g., bucketSize, toElementFn, maxLen).
+   * @param [thisArg] - Value for `this` inside the callback.
+   * @returns A new Deque with mapped elements.
+   * @example
+   * // Transform elements
+   *  const dq = new Deque<number>([1, 2, 3]);
+   *     const result = dq.map(x => x * 10);
+   *     console.log(result.toArray()); // [10, 20, 30];
+   */
   map(callback, options, thisArg) {
     const out = this._createLike([], {
       ...options != null ? options : {},
@@ -4570,6 +2844,26 @@ var _Deque = class _Deque extends LinearBase {
     }
     return out;
   }
+  /**
+   * Trim unused buckets to fit exactly the active range.
+   * @remarks Time O(N), Space O(1)
+   * @returns void
+   */
+  /**
+   * (Protected) Trigger auto-compaction if space utilization drops below threshold.
+   * Only checks every `_bucketSize` operations to minimize hot-path overhead.
+   * Uses element-based ratio: `elements / (bucketCount * bucketSize)`.
+   */
+  _autoCompact() {
+    if (this._autoCompactRatio <= 0 || this._bucketCount <= 1) return;
+    this._compactCounter++;
+    if (this._compactCounter < this._bucketSize) return;
+    this._compactCounter = 0;
+    const utilization = this._length / (this._bucketCount * this._bucketSize);
+    if (utilization < this._autoCompactRatio) {
+      this.shrinkToFit();
+    }
+  }
   /**
    * (Protected) Set the internal bucket size.
    * @remarks Time O(1), Space O(1)