data-structure-typed 2.4.2 → 2.4.4

package/.github/workflows/release.yml

@@ -0,0 +1,27 @@
+name: Release
+
+on:
+  push:
+    tags:
+      - 'v*'
+
+permissions:
+  contents: write
+
+jobs:
+  release:
+    runs-on: ubuntu-latest
+    steps:
+      - name: Checkout
+        uses: actions/checkout@v4
+        with:
+          fetch-depth: 0
+
+      - name: Create GitHub Release
+        uses: softprops/action-gh-release@v1
+        with:
+          generate_release_notes: true
+          draft: false
+          prerelease: ${{ contains(github.ref, '-alpha') || contains(github.ref, '-beta') || contains(github.ref, '-rc') }}
+        env:
+          GITHUB_TOKEN: ${{ secrets.GITHUB_TOKEN }}

package/CHANGELOG.md

@@ -8,7 +8,9 @@ All notable changes to this project will be documented in this file.
 - [Semantic Versioning](https://semver.org/spec/v2.0.0.html)
 - [`auto-changelog`](https://github.com/CookPete/auto-changelog)
 
-## [v2.4.2](https://github.com/zrwusa/data-structure-typed/compare/v2.2.3...main) (upcoming)
+## [v2.4.4](https://github.com/zrwusa/data-structure-typed/compare/v2.4.3...main) (upcoming)
+
+## [v2.4.3](https://github.com/zrwusa/data-structure-typed/compare/v2.2.3...v2.4.3) (3 March 2026)
 
 ## [v2.2.3](https://github.com/zrwusa/data-structure-typed/compare/v2.2.2...v2.2.3) (6 January 2026)
 

package/README.md

@@ -4,6 +4,8 @@ English | [简体中文](./README_CN.md)
 
 A comprehensive TypeScript data structures library with production-ready implementations.
 
+**We TypeScript/JavaScript devs want something like C++'s `STL`, Java's `java.util` Collections, or Python's `collections` — but with an API that feels as intuitive and ergonomic as JavaScript's native `Array`.** If that's what you're looking for, you're in the right place. This is a zero-dependency library, and you can also install individual data structure packages separately if you prefer a more modular setup.
+
 ![npm](https://img.shields.io/npm/dm/data-structure-typed)
 ![GitHub contributors](https://img.shields.io/github/contributors/zrwusa/data-structure-typed)
 ![GITHUB Star](https://img.shields.io/github/stars/zrwusa/data-structure-typed)
@@ -12,19 +14,55 @@ A comprehensive TypeScript data structures library with production-ready impleme
 ![NPM](https://img.shields.io/npm/l/data-structure-typed)
 ![npm](https://img.shields.io/npm/v/data-structure-typed)
 
-**📚 [Installation](#-installation) • [Quick Start](#-quick-start-30-seconds) • [Full Docs](#-documentation) • [API Reference](./docs/REFERENCE.md) • [Playground](#playground) • [Examples](./docs/GUIDES.md)**
+**📦 [Installation](#-installation) • 🎮 [Playground](#-playground) • ⚡ [Quick Start](#-quick-start-30-seconds) • 📖 [Docs](#-documentation) • 📋 [API](./docs/REFERENCE.md) • 💡 [Examples](./docs/GUIDES.md)**
 
 ---
 
 ## Table of Contents
 
-1. [Who Should Use This?](#-who-should-use-this)
-2. [Why Not Just Array or Map?](#-why-not-just-array-or-map)
-3. [Key Features](#-key-features)
-4. [Installation](#-installation)
-5. [Quick Start](#-quick-start-30-seconds)
-6. [Data Structures](#-data-structures-available)
-7. [Documentation](#-documentation)
+1. [Installation](#-installation)
+2. [Playground](#-playground)
+3. [Quick Start](#-quick-start-30-seconds)
+4. [Who Should Use This?](#-who-should-use-this)
+5. [Why Not Just Array or Map?](#-why-not-just-array-or-map)
+6. [Key Features](#-key-features)
+7. [Data Structures](#-data-structures-available)
+8. [Documentation](#-documentation)
+
+---
+
+## 📦 Installation
+
+```bash
+npm i data-structure-typed
+```
+
+```bash
+yarn add data-structure-typed
+```
+
+```bash
+pnpm add data-structure-typed
+```
+
+### Individual Packages
+
+Use only what you need:
+
+```bash
+npm i heap-typed deque-typed red-black-tree-typed
+```
+
+---
+
+## 🎮 Playground
+
+Try it instantly:
+
+- [Node.js TypeScript](https://stackblitz.com/edit/stackblitz-starters-e1vdy3zw?file=src%2Findex.ts)
+- [Node.js JavaScript](https://stackblitz.com/edit/stackblitz-starters-oczhrfzn?file=src%2Findex.js)
+- [React TypeScript](https://stackblitz.com/edit/vitejs-vite-7bva1zhd?file=src%2FApp.tsx)
+- [NestJS](https://stackblitz.com/edit/nestjs-typescript-starter-q9n7okgc?file=src%2Fproduct%2Fservices%2Fproduct-price-index.service.ts)
 
 ---
 
@@ -144,30 +182,6 @@ const set = new Set(tree);             // Set constructor
 
 ---
 
-## 📥 Installation
-
-```bash
-pnpm add data-structure-typed
-```
-
-```bash
-npm i data-structure-typed --save
-```
-
-```bash
-yarn add data-structure-typed
-```
-
-### Individual Packages
-
-Use only what you need:
-
-```bash
-pnpm add heap-typed deque-typed red-black-tree-typed
-```
-
----
-
 ## 💡 When Should I Consider This Library?
 
 ✅ **When you need:**
@@ -494,24 +508,6 @@ const tree = new RedBlackTree([5, 2, 8]);
 console.log([...tree]);  // [2, 5, 8] - Automatically sorted!
 ```
 
-## Playground
-
-🏃🏻‍♀️ Try it instantly:
-
-- [Node.js TypeScript](https://stackblitz.com/edit/stackblitz-starters-e1vdy3zw?file=src%2Findex.ts)
-- [Node.js JavaScript](https://stackblitz.com/edit/stackblitz-starters-oczhrfzn?file=src%2Findex.js)
-- [React TypeScript](https://stackblitz.com/edit/vitejs-vite-7bva1zhd?file=src%2FApp.tsx)
-- [NestJS](https://stackblitz.com/edit/nestjs-typescript-starter-q9n7okgc?file=src%2Fproduct%2Fservices%2Fproduct-price-index.service.ts)
-
-
-### Step 4: Learn More
-
-👉 Check [CONCEPTS.md](./docs/CONCEPTS.md) for core concepts  
-👉 See [GUIDES.md](./docs/GUIDES.md) for production examples  
-👉 Read [REFERENCE.md](./docs/REFERENCE.md) for complete API
-
----
-
 ## 📊 Comparison Chart
 
 ```

package/dist/cjs/index.cjs

@@ -1021,8 +1021,9 @@ var LinkedHashMap = class extends IterableEntryBase {
       const cur = node;
       node = node.next;
       if (predicate(cur.key, cur.value, i++, this)) {
-        if (isWeakKey(cur.key)) {
-          this._objMap.delete(cur.key);
+        const keyToCheck = cur.key;
+        if (isWeakKey(keyToCheck)) {
+          this._objMap.delete(keyToCheck);
         } else {
           const hash = this._hashFn(cur.key);
           delete this._noObjMap[hash];
@@ -1536,7 +1537,7 @@ var SinglyLinkedList = class extends LinearLinkedBase {
   static {
     __name(this, "SinglyLinkedList");
   }
-  _equals = Object.is;
+  _equals = /* @__PURE__ */ __name((a, b) => Object.is(a, b), "_equals");
   /**
    * Create a SinglyLinkedList and optionally bulk-insert elements.
    * @remarks Time O(N), Space O(N)
@@ -1640,8 +1641,8 @@ var SinglyLinkedList = class extends LinearLinkedBase {
       return value2;
     }
     let current = this.head;
-    while (current.next !== this.tail) current = current.next;
-    const value = this.tail.value;
+    while (current.next && current.next !== this.tail) current = current.next;
+    const value = this.tail?.value;
     current.next = void 0;
     this._tail = current;
     this._length--;
@@ -1729,8 +1730,8 @@ var SinglyLinkedList = class extends LinearLinkedBase {
   at(index) {
     if (index < 0 || index >= this._length) return void 0;
     let current = this.head;
-    for (let i = 0; i < index; i++) current = current.next;
-    return current.value;
+    for (let i = 0; i < index && current; i++) current = current.next;
+    return current?.value;
   }
   /**
    * Type guard: check whether the input is a SinglyLinkedListNode.
@@ -1750,7 +1751,7 @@ var SinglyLinkedList = class extends LinearLinkedBase {
   getNodeAt(index) {
     if (index < 0 || index >= this._length) return void 0;
     let current = this.head;
-    for (let i = 0; i < index; i++) current = current.next;
+    for (let i = 0; i < index && current; i++) current = current.next;
     return current;
   }
   /**
@@ -2259,7 +2260,7 @@ var DoublyLinkedList = class extends LinearLinkedBase {
   static {
     __name(this, "DoublyLinkedList");
   }
-  _equals = Object.is;
+  _equals = /* @__PURE__ */ __name((a, b) => Object.is(a, b), "_equals");
   /**
    * Create a DoublyLinkedList and optionally bulk-insert elements.
    * @remarks Time O(N), Space O(N)
@@ -2454,8 +2455,8 @@ var DoublyLinkedList = class extends LinearLinkedBase {
   at(index) {
     if (index < 0 || index >= this._length) return void 0;
     let current = this.head;
-    for (let i = 0; i < index; i++) current = current.next;
-    return current.value;
+    for (let i = 0; i < index && current; i++) current = current.next;
+    return current?.value;
   }
   /**
    * Get the node reference at a given index.
@@ -2466,7 +2467,7 @@ var DoublyLinkedList = class extends LinearLinkedBase {
   getNodeAt(index) {
     if (index < 0 || index >= this._length) return void 0;
     let current = this.head;
-    for (let i = 0; i < index; i++) current = current.next;
+    for (let i = 0; i < index && current; i++) current = current.next;
     return current;
   }
   /**
@@ -2972,7 +2973,7 @@ var Stack = class extends IterableElementBase {
   static {
     __name(this, "Stack");
   }
-  _equals = Object.is;
+  _equals = /* @__PURE__ */ __name((a, b) => Object.is(a, b), "_equals");
   /**
    * Create a Stack and optionally bulk-push elements.
    * @remarks Time O(N), Space O(N)
@@ -3608,7 +3609,7 @@ var Deque = class extends LinearBase {
   static {
     __name(this, "Deque");
   }
-  _equals = Object.is;
+  _equals = /* @__PURE__ */ __name((a, b) => Object.is(a, b), "_equals");
   /**
    * Create a Deque and optionally bulk-insert elements.
    * @remarks Time O(N), Space O(N)
@@ -4689,11 +4690,6 @@ var Heap = class _Heap extends IterableElementBase {
     return 0;
   }, "_DEFAULT_COMPARATOR");
   _comparator = this._DEFAULT_COMPARATOR;
-  /**
-  * Get the comparator used to order elements.
-  * @remarks Time O(1), Space O(1)
-  * @returns Comparator function.
-  */
   /**
    * Get the comparator used to order elements.
    * @remarks Time O(1), Space O(1)
@@ -4742,8 +4738,7 @@ var Heap = class _Heap extends IterableElementBase {
    */
   _createInstance(options) {
     const Ctor = this.constructor;
-    const next = new Ctor([], { comparator: this.comparator, toElementFn: this.toElementFn, ...options ?? {} });
-    return next;
+    return new Ctor([], { comparator: this.comparator, toElementFn: this.toElementFn, ...options ?? {} });
   }
   /**
    * (Protected) Create a like-kind instance seeded by elements.
@@ -5792,8 +5787,8 @@ var AbstractGraph = class extends IterableEntryBase {
     const Ctor = this.constructor;
     const instance = new Ctor();
     const graph = _options?.graph;
-    if (graph) instance._options = { ...instance._options, ...graph };
-    else instance._options = { ...instance._options, ...this._options };
+    if (graph) instance["_options"] = { ...instance["_options"], ...graph };
+    else instance["_options"] = { ...instance["_options"], ...this._options };
     return instance;
   }
   /**
@@ -5826,12 +5821,10 @@ var AbstractGraph = class extends IterableEntryBase {
       const [va, vb] = ends;
       const ka = va.key;
       const kb = vb.key;
-      const hasA = g.hasVertex ? g.hasVertex(ka) : false;
-      const hasB = g.hasVertex ? g.hasVertex(kb) : false;
+      const hasA = typeof g.hasVertex === "function" ? g.hasVertex(ka) : false;
+      const hasB = typeof g.hasVertex === "function" ? g.hasVertex(kb) : false;
       if (hasA && hasB) {
-        const w = e.weight;
-        const val = e.value;
-        const newEdge = g.createEdge(ka, kb, w, val);
+        const newEdge = g.createEdge(ka, kb, e.weight, e.value);
         g._addEdge(newEdge);
       }
     }
@@ -8258,7 +8251,7 @@ var BinaryTree = class extends IterableEntryBase {
    * @param node - The node.
    * @returns The node's key or undefined.
    */
-  _DEFAULT_NODE_CALLBACK = /* @__PURE__ */ __name((node) => node ? node.key : void 0, "_DEFAULT_NODE_CALLBACK");
+  _DEFAULT_NODE_CALLBACK = /* @__PURE__ */ __name((node) => node?.key, "_DEFAULT_NODE_CALLBACK");
   /**
    * (Protected) Snapshots the current tree's configuration options.
    * @remarks Time O(1)
@@ -12175,6 +12168,21 @@ var TreeSet = class _TreeSet {
     }
     return out;
   }
+  /**
+   * Creates a shallow clone of this set.
+   * @remarks Time O(n log n), Space O(n)
+   * @example
+   * const original = new TreeSet([1, 2, 3]);
+   * const copy = original.clone();
+   * copy.add(4);
+   * original.has(4); // false (original unchanged)
+   */
+  clone() {
+    return new _TreeSet(this, {
+      comparator: this.#isDefaultComparator ? void 0 : this.#userComparator,
+      isMapMode: this.#core.isMapMode
+    });
+  }
 };
 
 // src/data-structures/binary-tree/tree-multi-map.ts
@@ -12989,6 +12997,21 @@ var TreeMap = class _TreeMap {
     }
     return out;
   }
+  /**
+   * Creates a shallow clone of this map.
+   * @remarks Time O(n log n), Space O(n)
+   * @example
+   * const original = new TreeMap([['a', 1], ['b', 2]]);
+   * const copy = original.clone();
+   * copy.set('c', 3);
+   * original.has('c'); // false (original unchanged)
+   */
+  clone() {
+    return new _TreeMap(this, {
+      comparator: this.#isDefaultComparator ? void 0 : this.#userComparator,
+      isMapMode: this.#core.isMapMode
+    });
+  }
 };
 
 // src/data-structures/binary-tree/tree-multi-set.ts
@@ -13199,7 +13222,7 @@ var TreeMultiSet = class _TreeMultiSet {
    * @remarks Time O(1), Space O(1)
    */
   get comparator() {
-    return this.#core._comparator;
+    return this.#core.comparator;
   }
   // ━━━ clear ━━━
   /**
@@ -13336,7 +13359,7 @@ var TreeMultiSet = class _TreeMultiSet {
   filter(predicate) {
     const result = new _TreeMultiSet([], {
       comparator: this.#isDefaultComparator ? void 0 : this.comparator,
-      isMapMode: this.#core._isMapMode
+      isMapMode: this.#core.isMapMode
     });
     for (const [k, c] of this.entries()) {
       if (predicate(k, c)) {
@@ -13376,7 +13399,7 @@ var TreeMultiSet = class _TreeMultiSet {
   map(mapper, options) {
     const result = new _TreeMultiSet([], {
       comparator: options?.comparator,
-      isMapMode: this.#core._isMapMode
+      isMapMode: this.#core.isMapMode
     });
     for (const [k, c] of this.entries()) {
       const [newKey, newCount] = mapper(k, c);
@@ -13396,7 +13419,7 @@ var TreeMultiSet = class _TreeMultiSet {
   clone() {
     const result = new _TreeMultiSet([], {
       comparator: this.#isDefaultComparator ? void 0 : this.comparator,
-      isMapMode: this.#core._isMapMode
+      isMapMode: this.#core.isMapMode
     });
     for (const [k, c] of this.entries()) {
       result.add(k, c);
@@ -14448,12 +14471,11 @@ var Trie = class extends IterableElementBase {
    */
   _createInstance(options) {
     const Ctor = this.constructor;
-    const next = new Ctor([], {
+    return new Ctor([], {
       toElementFn: this.toElementFn,
       caseSensitive: this.caseSensitive,
       ...options ?? {}
     });
-    return next;
   }
   /**
    * (Protected) Create a like-kind trie and seed it from an iterable.

package/dist/cjs-legacy/index.cjs

@@ -1025,8 +1025,9 @@ var _LinkedHashMap = class _LinkedHashMap extends IterableEntryBase {
       const cur = node;
       node = node.next;
       if (predicate(cur.key, cur.value, i++, this)) {
-        if (isWeakKey(cur.key)) {
-          this._objMap.delete(cur.key);
+        const keyToCheck = cur.key;
+        if (isWeakKey(keyToCheck)) {
+          this._objMap.delete(keyToCheck);
         } else {
           const hash = this._hashFn(cur.key);
           delete this._noObjMap[hash];
@@ -1544,7 +1545,7 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
    */
   constructor(elements = [], options) {
     super(options);
-    __publicField(this, "_equals", Object.is);
+    __publicField(this, "_equals", /* @__PURE__ */ __name((a, b) => Object.is(a, b), "_equals"));
     __publicField(this, "_head");
     __publicField(this, "_tail");
     __publicField(this, "_length", 0);
@@ -1632,6 +1633,7 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
    * @returns Removed element or undefined.
    */
   pop() {
+    var _a;
     if (!this.head) return void 0;
     if (this.head === this.tail) {
       const value2 = this.head.value;
@@ -1641,8 +1643,8 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
       return value2;
     }
     let current = this.head;
-    while (current.next !== this.tail) current = current.next;
-    const value = this.tail.value;
+    while (current.next && current.next !== this.tail) current = current.next;
+    const value = (_a = this.tail) == null ? void 0 : _a.value;
     current.next = void 0;
     this._tail = current;
     this._length--;
@@ -1730,8 +1732,8 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
   at(index) {
     if (index < 0 || index >= this._length) return void 0;
     let current = this.head;
-    for (let i = 0; i < index; i++) current = current.next;
-    return current.value;
+    for (let i = 0; i < index && current; i++) current = current.next;
+    return current == null ? void 0 : current.value;
   }
   /**
    * Type guard: check whether the input is a SinglyLinkedListNode.
@@ -1751,7 +1753,7 @@ var _SinglyLinkedList = class _SinglyLinkedList extends LinearLinkedBase {
   getNodeAt(index) {
     if (index < 0 || index >= this._length) return void 0;
     let current = this.head;
-    for (let i = 0; i < index; i++) current = current.next;
+    for (let i = 0; i < index && current; i++) current = current.next;
     return current;
   }
   /**
@@ -2267,7 +2269,7 @@ var _DoublyLinkedList = class _DoublyLinkedList extends LinearLinkedBase {
    */
   constructor(elements = [], options) {
     super(options);
-    __publicField(this, "_equals", Object.is);
+    __publicField(this, "_equals", /* @__PURE__ */ __name((a, b) => Object.is(a, b), "_equals"));
     __publicField(this, "_head");
     __publicField(this, "_tail");
     __publicField(this, "_length", 0);
@@ -2455,8 +2457,8 @@ var _DoublyLinkedList = class _DoublyLinkedList extends LinearLinkedBase {
   at(index) {
     if (index < 0 || index >= this._length) return void 0;
     let current = this.head;
-    for (let i = 0; i < index; i++) current = current.next;
-    return current.value;
+    for (let i = 0; i < index && current; i++) current = current.next;
+    return current == null ? void 0 : current.value;
   }
   /**
    * Get the node reference at a given index.
@@ -2467,7 +2469,7 @@ var _DoublyLinkedList = class _DoublyLinkedList extends LinearLinkedBase {
   getNodeAt(index) {
     if (index < 0 || index >= this._length) return void 0;
     let current = this.head;
-    for (let i = 0; i < index; i++) current = current.next;
+    for (let i = 0; i < index && current; i++) current = current.next;
     return current;
   }
   /**
@@ -2979,7 +2981,7 @@ var _Stack = class _Stack extends IterableElementBase {
    */
   constructor(elements = [], options) {
     super(options);
-    __publicField(this, "_equals", Object.is);
+    __publicField(this, "_equals", /* @__PURE__ */ __name((a, b) => Object.is(a, b), "_equals"));
     __publicField(this, "_elements", []);
     this.pushMany(elements);
   }
@@ -3614,7 +3616,7 @@ var _Deque = class _Deque extends LinearBase {
    */
   constructor(elements = [], options) {
     super(options);
-    __publicField(this, "_equals", Object.is);
+    __publicField(this, "_equals", /* @__PURE__ */ __name((a, b) => Object.is(a, b), "_equals"));
     __publicField(this, "_bucketSize", 1 << 12);
     __publicField(this, "_bucketFirst", 0);
     __publicField(this, "_firstInBucket", 0);
@@ -4686,11 +4688,6 @@ var _Heap = class _Heap extends IterableElementBase {
     }
     return out;
   }
-  /**
-  * Get the comparator used to order elements.
-  * @remarks Time O(1), Space O(1)
-  * @returns Comparator function.
-  */
   /**
    * Get the comparator used to order elements.
    * @remarks Time O(1), Space O(1)
@@ -4739,8 +4736,7 @@ var _Heap = class _Heap extends IterableElementBase {
    */
   _createInstance(options) {
     const Ctor = this.constructor;
-    const next = new Ctor([], { comparator: this.comparator, toElementFn: this.toElementFn, ...options != null ? options : {} });
-    return next;
+    return new Ctor([], { comparator: this.comparator, toElementFn: this.toElementFn, ...options != null ? options : {} });
   }
   /**
    * (Protected) Create a like-kind instance seeded by elements.
@@ -5786,8 +5782,8 @@ var _AbstractGraph = class _AbstractGraph extends IterableEntryBase {
     const Ctor = this.constructor;
     const instance = new Ctor();
     const graph = _options == null ? void 0 : _options.graph;
-    if (graph) instance._options = { ...instance._options, ...graph };
-    else instance._options = { ...instance._options, ...this._options };
+    if (graph) instance["_options"] = { ...instance["_options"], ...graph };
+    else instance["_options"] = { ...instance["_options"], ...this._options };
     return instance;
   }
   /**
@@ -5820,12 +5816,10 @@ var _AbstractGraph = class _AbstractGraph extends IterableEntryBase {
       const [va, vb] = ends;
       const ka = va.key;
       const kb = vb.key;
-      const hasA = g.hasVertex ? g.hasVertex(ka) : false;
-      const hasB = g.hasVertex ? g.hasVertex(kb) : false;
+      const hasA = typeof g.hasVertex === "function" ? g.hasVertex(ka) : false;
+      const hasB = typeof g.hasVertex === "function" ? g.hasVertex(kb) : false;
       if (hasA && hasB) {
-        const w = e.weight;
-        const val = e.value;
-        const newEdge = g.createEdge(ka, kb, w, val);
+        const newEdge = g.createEdge(ka, kb, e.weight, e.value);
         g._addEdge(newEdge);
       }
     }
@@ -7017,7 +7011,7 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
      * @param node - The node.
      * @returns The node's key or undefined.
      */
-    __publicField(this, "_DEFAULT_NODE_CALLBACK", /* @__PURE__ */ __name((node) => node ? node.key : void 0, "_DEFAULT_NODE_CALLBACK"));
+    __publicField(this, "_DEFAULT_NODE_CALLBACK", /* @__PURE__ */ __name((node) => node == null ? void 0 : node.key, "_DEFAULT_NODE_CALLBACK"));
     if (options) {
       const { iterationType, toEntryFn, isMapMode, isDuplicate } = options;
       if (iterationType) this.iterationType = iterationType;
@@ -12167,6 +12161,21 @@ var _TreeSet = class _TreeSet {
     }
     return out;
   }
+  /**
+   * Creates a shallow clone of this set.
+   * @remarks Time O(n log n), Space O(n)
+   * @example
+   * const original = new TreeSet([1, 2, 3]);
+   * const copy = original.clone();
+   * copy.add(4);
+   * original.has(4); // false (original unchanged)
+   */
+  clone() {
+    return new _TreeSet(this, {
+      comparator: __privateGet(this, _isDefaultComparator) ? void 0 : __privateGet(this, _userComparator),
+      isMapMode: __privateGet(this, _core).isMapMode
+    });
+  }
 };
 _core = new WeakMap();
 _isDefaultComparator = new WeakMap();
@@ -12988,6 +12997,21 @@ var _TreeMap = class _TreeMap {
     }
     return out;
   }
+  /**
+   * Creates a shallow clone of this map.
+   * @remarks Time O(n log n), Space O(n)
+   * @example
+   * const original = new TreeMap([['a', 1], ['b', 2]]);
+   * const copy = original.clone();
+   * copy.set('c', 3);
+   * original.has('c'); // false (original unchanged)
+   */
+  clone() {
+    return new _TreeMap(this, {
+      comparator: __privateGet(this, _isDefaultComparator3) ? void 0 : __privateGet(this, _userComparator2),
+      isMapMode: __privateGet(this, _core3).isMapMode
+    });
+  }
 };
 _core3 = new WeakMap();
 _isDefaultComparator3 = new WeakMap();
@@ -13207,7 +13231,7 @@ var _TreeMultiSet = class _TreeMultiSet {
    * @remarks Time O(1), Space O(1)
    */
   get comparator() {
-    return __privateGet(this, _core4)._comparator;
+    return __privateGet(this, _core4).comparator;
   }
   // ━━━ clear ━━━
   /**
@@ -13344,7 +13368,7 @@ var _TreeMultiSet = class _TreeMultiSet {
   filter(predicate) {
     const result = new _TreeMultiSet([], {
       comparator: __privateGet(this, _isDefaultComparator4) ? void 0 : this.comparator,
-      isMapMode: __privateGet(this, _core4)._isMapMode
+      isMapMode: __privateGet(this, _core4).isMapMode
     });
     for (const [k, c] of this.entries()) {
       if (predicate(k, c)) {
@@ -13384,7 +13408,7 @@ var _TreeMultiSet = class _TreeMultiSet {
   map(mapper, options) {
     const result = new _TreeMultiSet([], {
       comparator: options == null ? void 0 : options.comparator,
-      isMapMode: __privateGet(this, _core4)._isMapMode
+      isMapMode: __privateGet(this, _core4).isMapMode
     });
     for (const [k, c] of this.entries()) {
       const [newKey, newCount] = mapper(k, c);
@@ -13404,7 +13428,7 @@ var _TreeMultiSet = class _TreeMultiSet {
   clone() {
     const result = new _TreeMultiSet([], {
       comparator: __privateGet(this, _isDefaultComparator4) ? void 0 : this.comparator,
-      isMapMode: __privateGet(this, _core4)._isMapMode
+      isMapMode: __privateGet(this, _core4).isMapMode
     });
     for (const [k, c] of this.entries()) {
       result.add(k, c);
@@ -14452,12 +14476,11 @@ var _Trie = class _Trie extends IterableElementBase {
    */
   _createInstance(options) {
     const Ctor = this.constructor;
-    const next = new Ctor([], {
+    return new Ctor([], {
       toElementFn: this.toElementFn,
       caseSensitive: this.caseSensitive,
       ...options != null ? options : {}
     });
-    return next;
   }
   /**
    * (Protected) Create a like-kind trie and seed it from an iterable.