typescript-dsa-stl 1.0.0 → 1.1.0

package/README.md

@@ -1,6 +1,10 @@
 # TypeScript_DSA
 
-STL-style **data structures and algorithms** for TypeScript: Vector, Stack, Queue, List, and algorithms (sort, binarySearch, lowerBound, min, max, etc.). Publishable npm package.
+**This is the GitHub repository** for the npm package **[typescript-dsa-stl](https://www.npmjs.com/package/typescript-dsa-stl)**.
+
+STL-style data structures and algorithms for TypeScript: **Vector**, **Stack**, **Queue**, **List**, **PriorityQueue**, **OrderedMap** (Map), **UnorderedMap**, **OrderedSet** (Set), **UnorderedSet**, and algorithms (`sort`, `binarySearch`, `lowerBound`, `min`, `max`, etc.). Install from npm to use in your project; this repo holds the source code.
+
+---
 
 ## Install
 
@@ -8,6 +12,8 @@ STL-style **data structures and algorithms** for TypeScript: Vector, Stack, Queu
 npm install typescript-dsa-stl
 ```
 
+---
+
 ## Quick start
 
 ```ts
@@ -16,6 +22,11 @@ import {
   Stack,
   Queue,
   List,
+  PriorityQueue,
+  OrderedMap,
+  UnorderedMap,
+  OrderedSet,
+  UnorderedSet,
   sort,
   find,
   binarySearch,
@@ -46,6 +57,21 @@ const node = list.pushBack(20);
 list.insertBefore(node, 15);
 console.log(list.toArray()); // [10, 15, 20]
 
+// PriorityQueue (max-heap by default)
+const pq = new PriorityQueue<number>();
+pq.push(3); pq.push(1); pq.push(4);
+console.log(pq.top()); // 4
+pq.pop();
+
+// OrderedMap (keys sorted), UnorderedMap (hash)
+const map = new UnorderedMap<string, number>();
+map.set('a', 1); map.set('b', 2);
+console.log(map.get('a')); // 1
+
+// OrderedSet (sorted unique), UnorderedSet (hash)
+const set = new UnorderedSet<number>([1, 2, 2, 3]);
+console.log(set.size); // 3
+
 // Algorithms (work on arrays and iterables)
 const arr = [3, 1, 4, 1, 5];
 sort(arr);               // [1, 1, 3, 4, 5]
@@ -63,11 +89,13 @@ clamp(42, 0, 10);       // 10
 range(0, 5);            // [0, 1, 2, 3, 4]
 ```
 
+---
+
 ## API overview
 
 | Module | Exports |
 |--------|--------|
-| **Collections** | `Vector`, `Stack`, `Queue`, `List`, `ListNode` |
+| **Collections** | `Vector`, `Stack`, `Queue`, `List`, `ListNode`, `PriorityQueue`, `OrderedMap`, `UnorderedMap`, `OrderedSet`, `UnorderedSet` |
 | **Algorithms** | `sort`, `find`, `findIndex`, `transform`, `filter`, `reduce`, `reverse`, `unique`, `binarySearch`, `lowerBound`, `upperBound`, `min`, `max`, `partition` |
 | **Utils** | `clamp`, `range`, `noop`, `identity`, `swap` |
 | **Types** | `Comparator`, `Predicate`, `UnaryFn`, `Reducer`, `IterableLike`, `toArray` |
@@ -81,6 +109,8 @@ import { clamp, range } from 'typescript-dsa-stl/utils';
 import type { Comparator } from 'typescript-dsa-stl/types';
 ```
 
+---
+
 ## Data structures
 
 | Structure | Access | Insert end | Insert middle | Remove end | Remove middle |
@@ -89,19 +119,23 @@ import type { Comparator } from 'typescript-dsa-stl/types';
 | **Stack** | — | O(1) | — | O(1) | — |
 | **Queue** | — | O(1)* | — | O(1)* | — |
 | **List** | O(n) | O(1) | O(1)** | O(1) | O(1)** |
+| **PriorityQueue** | — | O(log n) | — | O(log n) | — |
+| **OrderedMap** (Map) | O(log n) get | O(n) set | — | O(n) delete | — |
+| **UnorderedMap** | O(1)* get/set | O(1)* | — | O(1)* delete | — |
+| **OrderedSet** (Set) | O(log n) has | O(n) add | — | O(n) delete | — |
+| **UnorderedSet** | O(1)* has/add | O(1)* | — | O(1)* delete | — |
 
-\* Amortized. \** At a known node.
+\* Amortized (hash).  
+\** At a known node.
 
-## Publish this package to npm
+---
 
-1. **Set repo URLs** in `package.json`: replace `your-username` in `repository`, `homepage`, and `bugs` with your GitHub username (and repo name if different).
-2. **Build**: `npm run build`
-3. **Login**: `npm login`
-4. **Publish**: `npm publish` (use `npm publish --access public` if you use a scoped name like `@yourusername/typescript-dsa-stl`)
+## For maintainers
 
-## Scripts
+- **Build:** `npm run build` (also runs before `npm publish` via `prepublishOnly`)
+- **Publish:** `npm publish` (use `npm publish --access public` for a scoped package name)
 
-- `npm run build` — compile TypeScript to `dist/` (runs automatically before `npm publish` via `prepublishOnly`)
+---
 
 ## License
 

package/dist/collections/OrderedMap.d.ts

@@ -0,0 +1,23 @@
+/**
+ * Ordered map (STL-style map). Keys sorted by comparator. O(log n) get/has, O(n) set/delete.
+ * Implemented with a sorted array and binary search.
+ */
+import type { Comparator } from '../types/index.js';
+export declare class OrderedMap<K, V> {
+    private _entries;
+    private _compare;
+    constructor(compare?: Comparator<K>);
+    get size(): number;
+    get empty(): boolean;
+    private _lowerBound;
+    get(key: K): V | undefined;
+    set(key: K, value: V): void;
+    has(key: K): boolean;
+    delete(key: K): boolean;
+    clear(): void;
+    keys(): Iterable<K>;
+    values(): Iterable<V>;
+    entries(): Iterable<[K, V]>;
+    [Symbol.iterator](): Iterator<[K, V]>;
+}
+//# sourceMappingURL=OrderedMap.d.ts.map

package/dist/collections/OrderedMap.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"OrderedMap.d.ts","sourceRoot":"","sources":["../../src/collections/OrderedMap.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAMpD,qBAAa,UAAU,CAAC,CAAC,EAAE,CAAC;IAC1B,OAAO,CAAC,QAAQ,CAAgB;IAChC,OAAO,CAAC,QAAQ,CAAgB;gBAEpB,OAAO,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC;IAInC,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,IAAI,KAAK,IAAI,OAAO,CAEnB;IAED,OAAO,CAAC,WAAW;IAYnB,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS;IAQ1B,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI;IAS3B,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO;IAIpB,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO;IASvB,KAAK,IAAI,IAAI;IAIb,IAAI,IAAI,QAAQ,CAAC,CAAC,CAAC;IAInB,MAAM,IAAI,QAAQ,CAAC,CAAC,CAAC;IAIrB,OAAO,IAAI,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAI3B,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;CAGtC"}

package/dist/collections/OrderedMap.js

@@ -0,0 +1,71 @@
+function defaultCompare(a, b) {
+    return a < b ? -1 : a > b ? 1 : 0;
+}
+export class OrderedMap {
+    constructor(compare) {
+        this._entries = [];
+        this._compare = compare ?? defaultCompare;
+    }
+    get size() {
+        return this._entries.length;
+    }
+    get empty() {
+        return this._entries.length === 0;
+    }
+    _lowerBound(key) {
+        const cmp = this._compare;
+        let lo = 0;
+        let hi = this._entries.length;
+        while (lo < hi) {
+            const mid = (lo + hi) >>> 1;
+            if (cmp(this._entries[mid][0], key) < 0)
+                lo = mid + 1;
+            else
+                hi = mid;
+        }
+        return lo;
+    }
+    get(key) {
+        const i = this._lowerBound(key);
+        if (i < this._entries.length && this._compare(this._entries[i][0], key) === 0) {
+            return this._entries[i][1];
+        }
+        return undefined;
+    }
+    set(key, value) {
+        const i = this._lowerBound(key);
+        if (i < this._entries.length && this._compare(this._entries[i][0], key) === 0) {
+            this._entries[i][1] = value;
+        }
+        else {
+            this._entries.splice(i, 0, [key, value]);
+        }
+    }
+    has(key) {
+        return this.get(key) !== undefined;
+    }
+    delete(key) {
+        const i = this._lowerBound(key);
+        if (i < this._entries.length && this._compare(this._entries[i][0], key) === 0) {
+            this._entries.splice(i, 1);
+            return true;
+        }
+        return false;
+    }
+    clear() {
+        this._entries.length = 0;
+    }
+    keys() {
+        return this._entries.map((e) => e[0]);
+    }
+    values() {
+        return this._entries.map((e) => e[1]);
+    }
+    entries() {
+        return this._entries;
+    }
+    [Symbol.iterator]() {
+        return this._entries[Symbol.iterator]();
+    }
+}
+//# sourceMappingURL=OrderedMap.js.map

package/dist/collections/OrderedMap.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"OrderedMap.js","sourceRoot":"","sources":["../../src/collections/OrderedMap.ts"],"names":[],"mappings":"AAMA,SAAS,cAAc,CAAI,CAAI,EAAE,CAAI;IACnC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACpC,CAAC;AAED,MAAM,OAAO,UAAU;IAIrB,YAAY,OAAuB;QAH3B,aAAQ,GAAa,EAAE,CAAC;QAI9B,IAAI,CAAC,QAAQ,GAAG,OAAO,IAAI,cAAc,CAAC;IAC5C,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;IAC9B,CAAC;IAED,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,CAAC;IACpC,CAAC;IAEO,WAAW,CAAC,GAAM;QACxB,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC1B,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;QAC9B,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC;YACf,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;YAC5B,IAAI,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC;gBAAE,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;;gBACjD,EAAE,GAAG,GAAG,CAAC;QAChB,CAAC;QACD,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,GAAG,CAAC,GAAM;QACR,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YAC9E,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7B,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,GAAG,CAAC,GAAM,EAAE,KAAQ;QAClB,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YAC9E,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;QAC9B,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;QAC3C,CAAC;IACH,CAAC;IAED,GAAG,CAAC,GAAM;QACR,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,SAAS,CAAC;IACrC,CAAC;IAED,MAAM,CAAC,GAAM;QACX,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YAC9E,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC3B,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,KAAK;QACH,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;IAC3B,CAAC;IAED,IAAI;QACF,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC;IAED,MAAM;QACJ,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC;IAED,OAAO;QACL,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IAED,CAAC,MAAM,CAAC,QAAQ,CAAC;QACf,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;IAC1C,CAAC;CACF"}

package/dist/collections/OrderedSet.d.ts

@@ -0,0 +1,20 @@
+/**
+ * Ordered set (STL-style set). Unique elements sorted by comparator. O(log n) has, O(n) add/delete.
+ * Implemented with a sorted array and binary search.
+ */
+import type { Comparator } from '../types/index.js';
+export declare class OrderedSet<T> {
+    private _data;
+    private _compare;
+    constructor(compare?: Comparator<T>);
+    get size(): number;
+    get empty(): boolean;
+    private _lowerBound;
+    has(value: T): boolean;
+    add(value: T): void;
+    delete(value: T): boolean;
+    clear(): void;
+    [Symbol.iterator](): Iterator<T>;
+    toArray(): T[];
+}
+//# sourceMappingURL=OrderedSet.d.ts.map

package/dist/collections/OrderedSet.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"OrderedSet.d.ts","sourceRoot":"","sources":["../../src/collections/OrderedSet.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAMpD,qBAAa,UAAU,CAAC,CAAC;IACvB,OAAO,CAAC,KAAK,CAAW;IACxB,OAAO,CAAC,QAAQ,CAAgB;gBAEpB,OAAO,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC;IAInC,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,IAAI,KAAK,IAAI,OAAO,CAEnB;IAED,OAAO,CAAC,WAAW;IAYnB,GAAG,CAAC,KAAK,EAAE,CAAC,GAAG,OAAO;IAKtB,GAAG,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI;IAOnB,MAAM,CAAC,KAAK,EAAE,CAAC,GAAG,OAAO;IASzB,KAAK,IAAI,IAAI;IAIb,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC;IAIhC,OAAO,IAAI,CAAC,EAAE;CAGf"}

package/dist/collections/OrderedSet.js

@@ -0,0 +1,56 @@
+function defaultCompare(a, b) {
+    return a < b ? -1 : a > b ? 1 : 0;
+}
+export class OrderedSet {
+    constructor(compare) {
+        this._data = [];
+        this._compare = compare ?? defaultCompare;
+    }
+    get size() {
+        return this._data.length;
+    }
+    get empty() {
+        return this._data.length === 0;
+    }
+    _lowerBound(value) {
+        const cmp = this._compare;
+        let lo = 0;
+        let hi = this._data.length;
+        while (lo < hi) {
+            const mid = (lo + hi) >>> 1;
+            if (cmp(this._data[mid], value) < 0)
+                lo = mid + 1;
+            else
+                hi = mid;
+        }
+        return lo;
+    }
+    has(value) {
+        const i = this._lowerBound(value);
+        return i < this._data.length && this._compare(this._data[i], value) === 0;
+    }
+    add(value) {
+        const i = this._lowerBound(value);
+        if (i >= this._data.length || this._compare(this._data[i], value) !== 0) {
+            this._data.splice(i, 0, value);
+        }
+    }
+    delete(value) {
+        const i = this._lowerBound(value);
+        if (i < this._data.length && this._compare(this._data[i], value) === 0) {
+            this._data.splice(i, 1);
+            return true;
+        }
+        return false;
+    }
+    clear() {
+        this._data.length = 0;
+    }
+    [Symbol.iterator]() {
+        return this._data[Symbol.iterator]();
+    }
+    toArray() {
+        return [...this._data];
+    }
+}
+//# sourceMappingURL=OrderedSet.js.map

package/dist/collections/OrderedSet.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"OrderedSet.js","sourceRoot":"","sources":["../../src/collections/OrderedSet.ts"],"names":[],"mappings":"AAMA,SAAS,cAAc,CAAI,CAAI,EAAE,CAAI;IACnC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACpC,CAAC;AAED,MAAM,OAAO,UAAU;IAIrB,YAAY,OAAuB;QAH3B,UAAK,GAAQ,EAAE,CAAC;QAItB,IAAI,CAAC,QAAQ,GAAG,OAAO,IAAI,cAAc,CAAC;IAC5C,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IAC3B,CAAC;IAED,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC;IACjC,CAAC;IAEO,WAAW,CAAC,KAAQ;QAC1B,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC1B,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;QAC3B,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC;YACf,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;YAC5B,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC;gBAAE,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;;gBAC7C,EAAE,GAAG,GAAG,CAAC;QAChB,CAAC;QACD,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,GAAG,CAAC,KAAQ;QACV,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QAClC,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;IAC5E,CAAC;IAED,GAAG,CAAC,KAAQ;QACV,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QAClC,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;YACxE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;QACjC,CAAC;IACH,CAAC;IAED,MAAM,CAAC,KAAQ;QACb,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QAClC,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;YACvE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACxB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,KAAK;QACH,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACxB,CAAC;IAED,CAAC,MAAM,CAAC,QAAQ,CAAC;QACf,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;IACvC,CAAC;IAED,OAAO;QACL,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;IACzB,CAAC;CACF"}

package/dist/collections/PriorityQueue.d.ts

@@ -0,0 +1,22 @@
+/**
+ * Priority queue (binary heap). O(log n) push and pop, O(1) top.
+ * Default: max-heap (highest priority at top). Pass a custom comparator to change order.
+ */
+import type { Comparator } from '../types/index.js';
+export declare class PriorityQueue<T> {
+    private _heap;
+    private _compare;
+    /** compare(a,b) < 0 means a has lower priority than b. Default: max-heap. */
+    constructor(compare?: Comparator<T>);
+    get size(): number;
+    get empty(): boolean;
+    /** Highest-priority element. */
+    top(): T;
+    push(value: T): void;
+    pop(): T | undefined;
+    clear(): void;
+    private _siftUp;
+    private _siftDown;
+    toArray(): T[];
+}
+//# sourceMappingURL=PriorityQueue.d.ts.map

package/dist/collections/PriorityQueue.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"PriorityQueue.d.ts","sourceRoot":"","sources":["../../src/collections/PriorityQueue.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAMpD,qBAAa,aAAa,CAAC,CAAC;IAC1B,OAAO,CAAC,KAAK,CAAW;IACxB,OAAO,CAAC,QAAQ,CAAgB;IAEhC,6EAA6E;gBACjE,OAAO,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC;IAInC,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,IAAI,KAAK,IAAI,OAAO,CAEnB;IAED,gCAAgC;IAChC,GAAG,IAAI,CAAC;IAKR,IAAI,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI;IAKpB,GAAG,IAAI,CAAC,GAAG,SAAS;IAWpB,KAAK,IAAI,IAAI;IAIb,OAAO,CAAC,OAAO;IAWf,OAAO,CAAC,SAAS;IAgBjB,OAAO,IAAI,CAAC,EAAE;CAGf"}

package/dist/collections/PriorityQueue.js

@@ -0,0 +1,73 @@
+function defaultCompare(a, b) {
+    return a < b ? -1 : a > b ? 1 : 0;
+}
+export class PriorityQueue {
+    /** compare(a,b) < 0 means a has lower priority than b. Default: max-heap. */
+    constructor(compare) {
+        this._heap = [];
+        this._compare = compare ?? defaultCompare;
+    }
+    get size() {
+        return this._heap.length;
+    }
+    get empty() {
+        return this._heap.length === 0;
+    }
+    /** Highest-priority element. */
+    top() {
+        if (this._heap.length === 0)
+            throw new RangeError('PriorityQueue is empty');
+        return this._heap[0];
+    }
+    push(value) {
+        this._heap.push(value);
+        this._siftUp(this._heap.length - 1);
+    }
+    pop() {
+        if (this._heap.length === 0)
+            return undefined;
+        const top = this._heap[0];
+        const last = this._heap.pop();
+        if (this._heap.length > 0) {
+            this._heap[0] = last;
+            this._siftDown(0);
+        }
+        return top;
+    }
+    clear() {
+        this._heap.length = 0;
+    }
+    _siftUp(i) {
+        const cmp = this._compare;
+        const arr = this._heap;
+        while (i > 0) {
+            const parent = (i - 1) >>> 1;
+            if (cmp(arr[i], arr[parent]) <= 0)
+                break;
+            [arr[i], arr[parent]] = [arr[parent], arr[i]];
+            i = parent;
+        }
+    }
+    _siftDown(i) {
+        const cmp = this._compare;
+        const arr = this._heap;
+        const n = arr.length;
+        while (true) {
+            let best = i;
+            const left = 2 * i + 1;
+            const right = 2 * i + 2;
+            if (left < n && cmp(arr[left], arr[best]) > 0)
+                best = left;
+            if (right < n && cmp(arr[right], arr[best]) > 0)
+                best = right;
+            if (best === i)
+                break;
+            [arr[i], arr[best]] = [arr[best], arr[i]];
+            i = best;
+        }
+    }
+    toArray() {
+        return [...this._heap];
+    }
+}
+//# sourceMappingURL=PriorityQueue.js.map

package/dist/collections/PriorityQueue.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"PriorityQueue.js","sourceRoot":"","sources":["../../src/collections/PriorityQueue.ts"],"names":[],"mappings":"AAMA,SAAS,cAAc,CAAI,CAAI,EAAE,CAAI;IACnC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACpC,CAAC;AAED,MAAM,OAAO,aAAa;IAIxB,6EAA6E;IAC7E,YAAY,OAAuB;QAJ3B,UAAK,GAAQ,EAAE,CAAC;QAKtB,IAAI,CAAC,QAAQ,GAAG,OAAO,IAAI,cAAc,CAAC;IAC5C,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IAC3B,CAAC;IAED,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC;IACjC,CAAC;IAED,gCAAgC;IAChC,GAAG;QACD,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,MAAM,IAAI,UAAU,CAAC,wBAAwB,CAAC,CAAC;QAC5E,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IAED,IAAI,CAAC,KAAQ;QACX,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACtC,CAAC;IAED,GAAG;QACD,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC9C,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,EAAG,CAAC;QAC/B,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1B,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;YACrB,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QACpB,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,KAAK;QACH,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACxB,CAAC;IAEO,OAAO,CAAC,CAAS;QACvB,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC1B,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC;QACvB,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACb,MAAM,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;YAC7B,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC;gBAAE,MAAM;YACzC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9C,CAAC,GAAG,MAAM,CAAC;QACb,CAAC;IACH,CAAC;IAEO,SAAS,CAAC,CAAS;QACzB,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC1B,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC;QACvB,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC;QACrB,OAAO,IAAI,EAAE,CAAC;YACZ,IAAI,IAAI,GAAG,CAAC,CAAC;YACb,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACvB,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACxB,IAAI,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC;gBAAE,IAAI,GAAG,IAAI,CAAC;YAC3D,IAAI,KAAK,GAAG,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC;gBAAE,IAAI,GAAG,KAAK,CAAC;YAC9D,IAAI,IAAI,KAAK,CAAC;gBAAE,MAAM;YACtB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1C,CAAC,GAAG,IAAI,CAAC;QACX,CAAC;IACH,CAAC;IAED,OAAO;QACL,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;IACzB,CAAC;CACF"}

package/dist/collections/UnorderedMap.d.ts

@@ -0,0 +1,20 @@
+/**
+ * Unordered map (STL-style unordered_map). Hash-based. O(1) average get/set/has/delete.
+ * Wraps the native Map with an STL-like API.
+ */
+export declare class UnorderedMap<K, V> {
+    private _map;
+    constructor(entries?: Iterable<[K, V]>);
+    get size(): number;
+    get empty(): boolean;
+    get(key: K): V | undefined;
+    set(key: K, value: V): void;
+    has(key: K): boolean;
+    delete(key: K): boolean;
+    clear(): void;
+    keys(): Iterable<K>;
+    values(): Iterable<V>;
+    entries(): Iterable<[K, V]>;
+    [Symbol.iterator](): Iterator<[K, V]>;
+}
+//# sourceMappingURL=UnorderedMap.d.ts.map

package/dist/collections/UnorderedMap.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"UnorderedMap.d.ts","sourceRoot":"","sources":["../../src/collections/UnorderedMap.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,qBAAa,YAAY,CAAC,CAAC,EAAE,CAAC;IAC5B,OAAO,CAAC,IAAI,CAAmC;gBAEnC,OAAO,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAMtC,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,IAAI,KAAK,IAAI,OAAO,CAEnB;IAED,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS;IAI1B,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI;IAI3B,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO;IAIpB,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO;IAIvB,KAAK,IAAI,IAAI;IAIb,IAAI,IAAI,QAAQ,CAAC,CAAC,CAAC;IAInB,MAAM,IAAI,QAAQ,CAAC,CAAC,CAAC;IAIrB,OAAO,IAAI,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAI3B,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;CAGtC"}

package/dist/collections/UnorderedMap.js

@@ -0,0 +1,47 @@
+/**
+ * Unordered map (STL-style unordered_map). Hash-based. O(1) average get/set/has/delete.
+ * Wraps the native Map with an STL-like API.
+ */
+export class UnorderedMap {
+    constructor(entries) {
+        this._map = new Map();
+        if (entries) {
+            for (const [k, v] of entries)
+                this._map.set(k, v);
+        }
+    }
+    get size() {
+        return this._map.size;
+    }
+    get empty() {
+        return this._map.size === 0;
+    }
+    get(key) {
+        return this._map.get(key);
+    }
+    set(key, value) {
+        this._map.set(key, value);
+    }
+    has(key) {
+        return this._map.has(key);
+    }
+    delete(key) {
+        return this._map.delete(key);
+    }
+    clear() {
+        this._map.clear();
+    }
+    keys() {
+        return this._map.keys();
+    }
+    values() {
+        return this._map.values();
+    }
+    entries() {
+        return this._map.entries();
+    }
+    [Symbol.iterator]() {
+        return this._map.entries();
+    }
+}
+//# sourceMappingURL=UnorderedMap.js.map

package/dist/collections/UnorderedMap.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"UnorderedMap.js","sourceRoot":"","sources":["../../src/collections/UnorderedMap.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,MAAM,OAAO,YAAY;IAGvB,YAAY,OAA0B;QAF9B,SAAI,GAAyB,IAAI,GAAG,EAAE,CAAC;QAG7C,IAAI,OAAO,EAAE,CAAC;YACZ,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,OAAO;gBAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACpD,CAAC;IACH,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;IACxB,CAAC;IAED,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC;IAC9B,CAAC;IAED,GAAG,CAAC,GAAM;QACR,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC5B,CAAC;IAED,GAAG,CAAC,GAAM,EAAE,KAAQ;QAClB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IAC5B,CAAC;IAED,GAAG,CAAC,GAAM;QACR,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC5B,CAAC;IAED,MAAM,CAAC,GAAM;QACX,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAC/B,CAAC;IAED,KAAK;QACH,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;IACpB,CAAC;IAED,IAAI;QACF,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IAC1B,CAAC;IAED,MAAM;QACJ,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;IAC5B,CAAC;IAED,OAAO;QACL,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;IAC7B,CAAC;IAED,CAAC,MAAM,CAAC,QAAQ,CAAC;QACf,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;IAC7B,CAAC;CACF"}

package/dist/collections/UnorderedSet.d.ts

@@ -0,0 +1,17 @@
+/**
+ * Unordered set (STL-style unordered_set). Hash-based. O(1) average add/has/delete.
+ * Wraps the native Set with an STL-like API.
+ */
+export declare class UnorderedSet<T> {
+    private _set;
+    constructor(values?: Iterable<T>);
+    get size(): number;
+    get empty(): boolean;
+    has(value: T): boolean;
+    add(value: T): void;
+    delete(value: T): boolean;
+    clear(): void;
+    [Symbol.iterator](): Iterator<T>;
+    toArray(): T[];
+}
+//# sourceMappingURL=UnorderedSet.d.ts.map

package/dist/collections/UnorderedSet.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"UnorderedSet.d.ts","sourceRoot":"","sources":["../../src/collections/UnorderedSet.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,qBAAa,YAAY,CAAC,CAAC;IACzB,OAAO,CAAC,IAAI,CAAgC;gBAEhC,MAAM,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC;IAMhC,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,IAAI,KAAK,IAAI,OAAO,CAEnB;IAED,GAAG,CAAC,KAAK,EAAE,CAAC,GAAG,OAAO;IAItB,GAAG,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI;IAInB,MAAM,CAAC,KAAK,EAAE,CAAC,GAAG,OAAO;IAIzB,KAAK,IAAI,IAAI;IAIb,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC;IAIhC,OAAO,IAAI,CAAC,EAAE;CAGf"}

package/dist/collections/UnorderedSet.js

@@ -0,0 +1,38 @@
+/**
+ * Unordered set (STL-style unordered_set). Hash-based. O(1) average add/has/delete.
+ * Wraps the native Set with an STL-like API.
+ */
+export class UnorderedSet {
+    constructor(values) {
+        this._set = new Set();
+        if (values) {
+            for (const v of values)
+                this._set.add(v);
+        }
+    }
+    get size() {
+        return this._set.size;
+    }
+    get empty() {
+        return this._set.size === 0;
+    }
+    has(value) {
+        return this._set.has(value);
+    }
+    add(value) {
+        this._set.add(value);
+    }
+    delete(value) {
+        return this._set.delete(value);
+    }
+    clear() {
+        this._set.clear();
+    }
+    [Symbol.iterator]() {
+        return this._set.values();
+    }
+    toArray() {
+        return [...this._set];
+    }
+}
+//# sourceMappingURL=UnorderedSet.js.map

package/dist/collections/UnorderedSet.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"UnorderedSet.js","sourceRoot":"","sources":["../../src/collections/UnorderedSet.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,MAAM,OAAO,YAAY;IAGvB,YAAY,MAAoB;QAFxB,SAAI,GAAsB,IAAI,GAAG,EAAE,CAAC;QAG1C,IAAI,MAAM,EAAE,CAAC;YACX,KAAK,MAAM,CAAC,IAAI,MAAM;gBAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC3C,CAAC;IACH,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;IACxB,CAAC;IAED,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC;IAC9B,CAAC;IAED,GAAG,CAAC,KAAQ;QACV,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAC9B,CAAC;IAED,GAAG,CAAC,KAAQ;QACV,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACvB,CAAC;IAED,MAAM,CAAC,KAAQ;QACb,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IACjC,CAAC;IAED,KAAK;QACH,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;IACpB,CAAC;IAED,CAAC,MAAM,CAAC,QAAQ,CAAC;QACf,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;IAC5B,CAAC;IAED,OAAO;QACL,OAAO,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;IACxB,CAAC;CACF"}

package/dist/collections/index.d.ts

@@ -2,4 +2,9 @@ export { Vector } from './Vector.js';
 export { Stack } from './Stack.js';
 export { Queue } from './Queue.js';
 export { List, ListNode } from './List.js';
+export { PriorityQueue } from './PriorityQueue.js';
+export { OrderedMap } from './OrderedMap.js';
+export { UnorderedMap } from './UnorderedMap.js';
+export { OrderedSet } from './OrderedSet.js';
+export { UnorderedSet } from './UnorderedSet.js';
 //# sourceMappingURL=index.d.ts.map

package/dist/collections/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/collections/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AACrC,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACnC,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACnC,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/collections/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AACrC,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACnC,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACnC,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAC3C,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AACnD,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAC7C,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAC7C,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC"}

package/dist/collections/index.js

@@ -2,4 +2,9 @@ export { Vector } from './Vector.js';
 export { Stack } from './Stack.js';
 export { Queue } from './Queue.js';
 export { List, ListNode } from './List.js';
+export { PriorityQueue } from './PriorityQueue.js';
+export { OrderedMap } from './OrderedMap.js';
+export { UnorderedMap } from './UnorderedMap.js';
+export { OrderedSet } from './OrderedSet.js';
+export { UnorderedSet } from './UnorderedSet.js';
 //# sourceMappingURL=index.js.map

package/dist/collections/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/collections/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AACrC,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACnC,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACnC,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/collections/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AACrC,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACnC,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACnC,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAC3C,OAAO,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AACnD,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAC7C,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAC7C,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC"}

package/dist/index.d.ts

@@ -5,7 +5,7 @@
  * @example
  * import { Vector, Stack, Queue, List, sort, binarySearch, clamp } from 'typescript-dsa-stl';
  */
-export { Vector, Stack, Queue, List, ListNode } from './collections/index.js';
+export { Vector, Stack, Queue, List, ListNode, PriorityQueue, OrderedMap, UnorderedMap, OrderedSet, UnorderedSet, } from './collections/index.js';
 export { sort, find, findIndex, transform, filter, reduce, reverse, unique, binarySearch, lowerBound, upperBound, min, max, partition, } from './algorithms/index.js';
 export { clamp, range, noop, identity, swap } from './utils/index.js';
 export type { Comparator, Predicate, UnaryFn, Reducer, IterableLike } from './types/index.js';

package/dist/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAC9E,OAAO,EACL,IAAI,EACJ,IAAI,EACJ,SAAS,EACT,SAAS,EACT,MAAM,EACN,MAAM,EACN,OAAO,EACP,MAAM,EACN,YAAY,EACZ,UAAU,EACV,UAAU,EACV,GAAG,EACH,GAAG,EACH,SAAS,GACV,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AACtE,YAAY,EAAE,UAAU,EAAE,SAAS,EAAE,OAAO,EAAE,OAAO,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAC9F,OAAO,EAAE,OAAO,EAAE,MAAM,kBAAkB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EACL,MAAM,EACN,KAAK,EACL,KAAK,EACL,IAAI,EACJ,QAAQ,EACR,aAAa,EACb,UAAU,EACV,YAAY,EACZ,UAAU,EACV,YAAY,GACb,MAAM,wBAAwB,CAAC;AAChC,OAAO,EACL,IAAI,EACJ,IAAI,EACJ,SAAS,EACT,SAAS,EACT,MAAM,EACN,MAAM,EACN,OAAO,EACP,MAAM,EACN,YAAY,EACZ,UAAU,EACV,UAAU,EACV,GAAG,EACH,GAAG,EACH,SAAS,GACV,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AACtE,YAAY,EAAE,UAAU,EAAE,SAAS,EAAE,OAAO,EAAE,OAAO,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAC9F,OAAO,EAAE,OAAO,EAAE,MAAM,kBAAkB,CAAC"}

package/dist/index.js

@@ -5,7 +5,7 @@
  * @example
  * import { Vector, Stack, Queue, List, sort, binarySearch, clamp } from 'typescript-dsa-stl';
  */
-export { Vector, Stack, Queue, List, ListNode } from './collections/index.js';
+export { Vector, Stack, Queue, List, ListNode, PriorityQueue, OrderedMap, UnorderedMap, OrderedSet, UnorderedSet, } from './collections/index.js';
 export { sort, find, findIndex, transform, filter, reduce, reverse, unique, binarySearch, lowerBound, upperBound, min, max, partition, } from './algorithms/index.js';
 export { clamp, range, noop, identity, swap } from './utils/index.js';
 export { toArray } from './types/index.js';

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAC9E,OAAO,EACL,IAAI,EACJ,IAAI,EACJ,SAAS,EACT,SAAS,EACT,MAAM,EACN,MAAM,EACN,OAAO,EACP,MAAM,EACN,YAAY,EACZ,UAAU,EACV,UAAU,EACV,GAAG,EACH,GAAG,EACH,SAAS,GACV,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AAEtE,OAAO,EAAE,OAAO,EAAE,MAAM,kBAAkB,CAAC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EACL,MAAM,EACN,KAAK,EACL,KAAK,EACL,IAAI,EACJ,QAAQ,EACR,aAAa,EACb,UAAU,EACV,YAAY,EACZ,UAAU,EACV,YAAY,GACb,MAAM,wBAAwB,CAAC;AAChC,OAAO,EACL,IAAI,EACJ,IAAI,EACJ,SAAS,EACT,SAAS,EACT,MAAM,EACN,MAAM,EACN,OAAO,EACP,MAAM,EACN,YAAY,EACZ,UAAU,EACV,UAAU,EACV,GAAG,EACH,GAAG,EACH,SAAS,GACV,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AAEtE,OAAO,EAAE,OAAO,EAAE,MAAM,kBAAkB,CAAC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "typescript-dsa-stl",
-  "version": "1.0.0",
+  "version": "1.1.0",
   "description": "TypeScript_DSA — STL-like data structures and algorithms. Vector, Stack, Queue, List, sort, binarySearch, and more.",
   "type": "module",
   "main": "dist/index.js",