typescript-dsa-stl 1.0.0

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2025
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,108 @@
+# 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.
+
+## Install
+
+```bash
+npm install typescript-dsa-stl
+```
+
+## Quick start
+
+```ts
+import {
+  Vector,
+  Stack,
+  Queue,
+  List,
+  sort,
+  find,
+  binarySearch,
+  min,
+  max,
+  clamp,
+  range,
+} from 'typescript-dsa-stl';
+
+// Collections
+const vec = new Vector<number>([1, 2, 3]);
+vec.push(4);
+console.log(vec.back()); // 4
+
+const stack = new Stack<string>();
+stack.push('a');
+stack.push('b');
+console.log(stack.top()); // 'b'
+
+const queue = new Queue<number>();
+queue.enqueue(1);
+queue.enqueue(2);
+console.log(queue.front()); // 1
+
+const list = new List<number>();
+list.pushBack(10);
+const node = list.pushBack(20);
+list.insertBefore(node, 15);
+console.log(list.toArray()); // [10, 15, 20]
+
+// Algorithms (work on arrays and iterables)
+const arr = [3, 1, 4, 1, 5];
+sort(arr);               // [1, 1, 3, 4, 5]
+find(arr, (n) => n > 3); // 4
+min(arr);                // 1
+max(arr);                // 5
+
+const sorted = [1, 2, 4, 4, 5];
+binarySearch(sorted, 4); // 2
+lowerBound(sorted, 4);   // 2
+upperBound(sorted, 4);   // 4
+
+// Utils
+clamp(42, 0, 10);       // 10
+range(0, 5);            // [0, 1, 2, 3, 4]
+```
+
+## API overview
+
+| Module | Exports |
+|--------|--------|
+| **Collections** | `Vector`, `Stack`, `Queue`, `List`, `ListNode` |
+| **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` |
+
+### Subpath imports (tree-shaking)
+
+```ts
+import { Vector, Stack } from 'typescript-dsa-stl/collections';
+import { sort, binarySearch } from 'typescript-dsa-stl/algorithms';
+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 |
+|-----------|--------|------------|---------------|------------|---------------|
+| **Vector** | O(1) | O(1)* | O(n) | O(1) | O(n) |
+| **Stack** | — | O(1) | — | O(1) | — |
+| **Queue** | — | O(1)* | — | O(1)* | — |
+| **List** | O(n) | O(1) | O(1)** | O(1) | O(1)** |
+
+\* Amortized. \** 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`)
+
+## Scripts
+
+- `npm run build` — compile TypeScript to `dist/` (runs automatically before `npm publish` via `prepublishOnly`)
+
+## License
+
+MIT

package/dist/algorithms/array.d.ts

@@ -0,0 +1,26 @@
+/**
+ * STL-like algorithms. Work on arrays and any IterableLike (Vector, List, etc.).
+ * Uses a single copy to array when source is not already an array.
+ */
+import type { Comparator, Predicate, Reducer, UnaryFn } from '../types/index.js';
+export declare function sort<T>(source: Iterable<T> | T[], compare?: Comparator<T>): T[];
+export declare function find<T>(source: Iterable<T> | T[], predicate: Predicate<T>): T | undefined;
+export declare function findIndex<T>(source: Iterable<T> | T[], predicate: Predicate<T>): number;
+export declare function transform<T, U>(source: Iterable<T> | T[], fn: UnaryFn<T, U>): U[];
+export declare function filter<T>(source: Iterable<T> | T[], predicate: Predicate<T>): T[];
+export declare function reduce<T, U>(source: Iterable<T> | T[], fn: Reducer<T, U>, initial: U): U;
+export declare function reverse<T>(source: Iterable<T> | T[]): T[];
+export declare function unique<T>(source: Iterable<T> | T[]): T[];
+/** Binary search in sorted range. Returns index of first match or -1. O(log n). */
+export declare function binarySearch<T>(source: Iterable<T> | T[], value: T, compare?: Comparator<T>): number;
+/** First index where arr[i] >= value (sorted). O(log n). */
+export declare function lowerBound<T>(source: Iterable<T> | T[], value: T, compare?: Comparator<T>): number;
+/** First index where arr[i] > value (sorted). O(log n). */
+export declare function upperBound<T>(source: Iterable<T> | T[], value: T, compare?: Comparator<T>): number;
+/** Minimum element. O(n). */
+export declare function min<T>(source: Iterable<T> | T[], compare?: Comparator<T>): T | undefined;
+/** Maximum element. O(n). */
+export declare function max<T>(source: Iterable<T> | T[], compare?: Comparator<T>): T | undefined;
+/** Partition range by predicate. Returns index of first element where predicate is false. Mutates array. */
+export declare function partition<T>(arr: T[], predicate: Predicate<T>, start?: number, end?: number): number;
+//# sourceMappingURL=array.d.ts.map

package/dist/algorithms/array.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"array.d.ts","sourceRoot":"","sources":["../../src/algorithms/array.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,KAAK,EAAE,UAAU,EAAE,SAAS,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AAOjF,wBAAgB,IAAI,CAAC,CAAC,EACpB,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EACzB,OAAO,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,GACtB,CAAC,EAAE,CAKL;AAED,wBAAgB,IAAI,CAAC,CAAC,EACpB,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EACzB,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,GACtB,CAAC,GAAG,SAAS,CAKf;AAED,wBAAgB,SAAS,CAAC,CAAC,EACzB,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EACzB,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,GACtB,MAAM,CAGR;AAED,wBAAgB,SAAS,CAAC,CAAC,EAAE,CAAC,EAC5B,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EACzB,EAAE,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,GAChB,CAAC,EAAE,CAGL;AAED,wBAAgB,MAAM,CAAC,CAAC,EACtB,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EACzB,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,GACtB,CAAC,EAAE,CAGL;AAED,wBAAgB,MAAM,CAAC,CAAC,EAAE,CAAC,EACzB,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EACzB,EAAE,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EACjB,OAAO,EAAE,CAAC,GACT,CAAC,CAGH;AAED,wBAAgB,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE,CAGzD;AAED,wBAAgB,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE,CAExD;AAED,mFAAmF;AACnF,wBAAgB,YAAY,CAAC,CAAC,EAC5B,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EACzB,KAAK,EAAE,CAAC,EACR,OAAO,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,GACtB,MAAM,CAaR;AAED,4DAA4D;AAC5D,wBAAgB,UAAU,CAAC,CAAC,EAC1B,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EACzB,KAAK,EAAE,CAAC,EACR,OAAO,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,GACtB,MAAM,CAWR;AAED,2DAA2D;AAC3D,wBAAgB,UAAU,CAAC,CAAC,EAC1B,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EACzB,KAAK,EAAE,CAAC,EACR,OAAO,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,GACtB,MAAM,CAWR;AAED,6BAA6B;AAC7B,wBAAgB,GAAG,CAAC,CAAC,EACnB,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EACzB,OAAO,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,GACtB,CAAC,GAAG,SAAS,CASf;AAED,6BAA6B;AAC7B,wBAAgB,GAAG,CAAC,CAAC,EACnB,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EACzB,OAAO,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,GACtB,CAAC,GAAG,SAAS,CASf;AAED,4GAA4G;AAC5G,wBAAgB,SAAS,CAAC,CAAC,EACzB,GAAG,EAAE,CAAC,EAAE,EACR,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,EACvB,KAAK,SAAI,EACT,GAAG,SAAa,GACf,MAAM,CASR"}

package/dist/algorithms/array.js

@@ -0,0 +1,126 @@
+import { toArray } from '../types/index.js';
+function defaultCompare(a, b) {
+    return a < b ? -1 : a > b ? 1 : 0;
+}
+export function sort(source, compare) {
+    const arr = toArray(source);
+    const out = [...arr];
+    out.sort(compare ?? defaultCompare);
+    return out;
+}
+export function find(source, predicate) {
+    for (const x of toArray(source)) {
+        if (predicate(x))
+            return x;
+    }
+    return undefined;
+}
+export function findIndex(source, predicate) {
+    const arr = toArray(source);
+    return arr.findIndex(predicate);
+}
+export function transform(source, fn) {
+    const arr = toArray(source);
+    return arr.map(fn);
+}
+export function filter(source, predicate) {
+    const arr = toArray(source);
+    return arr.filter(predicate);
+}
+export function reduce(source, fn, initial) {
+    const arr = toArray(source);
+    return arr.reduce(fn, initial);
+}
+export function reverse(source) {
+    const arr = toArray(source);
+    return [...arr].reverse();
+}
+export function unique(source) {
+    return [...new Set(toArray(source))];
+}
+/** Binary search in sorted range. Returns index of first match or -1. O(log n). */
+export function binarySearch(source, value, compare) {
+    const arr = toArray(source);
+    const cmp = compare ?? defaultCompare;
+    let lo = 0;
+    let hi = arr.length;
+    while (lo < hi) {
+        const mid = (lo + hi) >>> 1;
+        const c = cmp(arr[mid], value);
+        if (c < 0)
+            lo = mid + 1;
+        else if (c > 0)
+            hi = mid;
+        else
+            return mid;
+    }
+    return -1;
+}
+/** First index where arr[i] >= value (sorted). O(log n). */
+export function lowerBound(source, value, compare) {
+    const arr = toArray(source);
+    const cmp = compare ?? defaultCompare;
+    let lo = 0;
+    let hi = arr.length;
+    while (lo < hi) {
+        const mid = (lo + hi) >>> 1;
+        if (cmp(arr[mid], value) < 0)
+            lo = mid + 1;
+        else
+            hi = mid;
+    }
+    return lo;
+}
+/** First index where arr[i] > value (sorted). O(log n). */
+export function upperBound(source, value, compare) {
+    const arr = toArray(source);
+    const cmp = compare ?? defaultCompare;
+    let lo = 0;
+    let hi = arr.length;
+    while (lo < hi) {
+        const mid = (lo + hi) >>> 1;
+        if (cmp(arr[mid], value) <= 0)
+            lo = mid + 1;
+        else
+            hi = mid;
+    }
+    return lo;
+}
+/** Minimum element. O(n). */
+export function min(source, compare) {
+    const arr = toArray(source);
+    if (arr.length === 0)
+        return undefined;
+    const cmp = compare ?? defaultCompare;
+    let best = arr[0];
+    for (let i = 1; i < arr.length; i++) {
+        if (cmp(arr[i], best) < 0)
+            best = arr[i];
+    }
+    return best;
+}
+/** Maximum element. O(n). */
+export function max(source, compare) {
+    const arr = toArray(source);
+    if (arr.length === 0)
+        return undefined;
+    const cmp = compare ?? defaultCompare;
+    let best = arr[0];
+    for (let i = 1; i < arr.length; i++) {
+        if (cmp(arr[i], best) > 0)
+            best = arr[i];
+    }
+    return best;
+}
+/** Partition range by predicate. Returns index of first element where predicate is false. Mutates array. */
+export function partition(arr, predicate, start = 0, end = arr.length) {
+    let i = start;
+    for (let j = start; j < end; j++) {
+        if (predicate(arr[j])) {
+            [arr[i], arr[j]] = [arr[j], arr[i]];
+            i++;
+        }
+    }
+    return i;
+}
+//# sourceMappingURL=array.js.map

package/dist/algorithms/array.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"array.js","sourceRoot":"","sources":["../../src/algorithms/array.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AAE5C,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,UAAU,IAAI,CAClB,MAAyB,EACzB,OAAuB;IAEvB,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;IAC5B,MAAM,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;IACrB,GAAG,CAAC,IAAI,CAAC,OAAO,IAAI,cAAc,CAAC,CAAC;IACpC,OAAO,GAAG,CAAC;AACb,CAAC;AAED,MAAM,UAAU,IAAI,CAClB,MAAyB,EACzB,SAAuB;IAEvB,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QAChC,IAAI,SAAS,CAAC,CAAC,CAAC;YAAE,OAAO,CAAC,CAAC;IAC7B,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,MAAM,UAAU,SAAS,CACvB,MAAyB,EACzB,SAAuB;IAEvB,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;IAC5B,OAAO,GAAG,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;AAClC,CAAC;AAED,MAAM,UAAU,SAAS,CACvB,MAAyB,EACzB,EAAiB;IAEjB,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;IAC5B,OAAO,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;AACrB,CAAC;AAED,MAAM,UAAU,MAAM,CACpB,MAAyB,EACzB,SAAuB;IAEvB,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;IAC5B,OAAO,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;AAC/B,CAAC;AAED,MAAM,UAAU,MAAM,CACpB,MAAyB,EACzB,EAAiB,EACjB,OAAU;IAEV,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;IAC5B,OAAO,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;AACjC,CAAC;AAED,MAAM,UAAU,OAAO,CAAI,MAAyB;IAClD,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;IAC5B,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC;AAC5B,CAAC;AAED,MAAM,UAAU,MAAM,CAAI,MAAyB;IACjD,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;AACvC,CAAC;AAED,mFAAmF;AACnF,MAAM,UAAU,YAAY,CAC1B,MAAyB,EACzB,KAAQ,EACR,OAAuB;IAEvB,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;IAC5B,MAAM,GAAG,GAAG,OAAO,IAAI,cAAc,CAAC;IACtC,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,EAAE,GAAG,GAAG,CAAC,MAAM,CAAC;IACpB,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC;QACf,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;QAC5B,MAAM,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC;QAC/B,IAAI,CAAC,GAAG,CAAC;YAAE,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;aACnB,IAAI,CAAC,GAAG,CAAC;YAAE,EAAE,GAAG,GAAG,CAAC;;YACpB,OAAO,GAAG,CAAC;IAClB,CAAC;IACD,OAAO,CAAC,CAAC,CAAC;AACZ,CAAC;AAED,4DAA4D;AAC5D,MAAM,UAAU,UAAU,CACxB,MAAyB,EACzB,KAAQ,EACR,OAAuB;IAEvB,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;IAC5B,MAAM,GAAG,GAAG,OAAO,IAAI,cAAc,CAAC;IACtC,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,EAAE,GAAG,GAAG,CAAC,MAAM,CAAC;IACpB,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC;QACf,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;QAC5B,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC;YAAE,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;;YACtC,EAAE,GAAG,GAAG,CAAC;IAChB,CAAC;IACD,OAAO,EAAE,CAAC;AACZ,CAAC;AAED,2DAA2D;AAC3D,MAAM,UAAU,UAAU,CACxB,MAAyB,EACzB,KAAQ,EACR,OAAuB;IAEvB,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;IAC5B,MAAM,GAAG,GAAG,OAAO,IAAI,cAAc,CAAC;IACtC,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,EAAE,GAAG,GAAG,CAAC,MAAM,CAAC;IACpB,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC;QACf,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;QAC5B,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC;YAAE,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;;YACvC,EAAE,GAAG,GAAG,CAAC;IAChB,CAAC;IACD,OAAO,EAAE,CAAC;AACZ,CAAC;AAED,6BAA6B;AAC7B,MAAM,UAAU,GAAG,CACjB,MAAyB,EACzB,OAAuB;IAEvB,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;IAC5B,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IACvC,MAAM,GAAG,GAAG,OAAO,IAAI,cAAc,CAAC;IACtC,IAAI,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACpC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC;YAAE,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAC3C,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,6BAA6B;AAC7B,MAAM,UAAU,GAAG,CACjB,MAAyB,EACzB,OAAuB;IAEvB,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;IAC5B,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IACvC,MAAM,GAAG,GAAG,OAAO,IAAI,cAAc,CAAC;IACtC,IAAI,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACpC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC;YAAE,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IAC3C,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,4GAA4G;AAC5G,MAAM,UAAU,SAAS,CACvB,GAAQ,EACR,SAAuB,EACvB,KAAK,GAAG,CAAC,EACT,GAAG,GAAG,GAAG,CAAC,MAAM;IAEhB,IAAI,CAAC,GAAG,KAAK,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;QACjC,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YACtB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACpC,CAAC,EAAE,CAAC;QACN,CAAC;IACH,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC"}

package/dist/algorithms/index.d.ts

@@ -0,0 +1,2 @@
+export { sort, find, findIndex, transform, filter, reduce, reverse, unique, binarySearch, lowerBound, upperBound, min, max, partition, } from './array.js';
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/algorithms/index.ts"],"names":[],"mappings":"AAAA,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,YAAY,CAAC"}

package/dist/algorithms/index.js

@@ -0,0 +1,2 @@
+export { sort, find, findIndex, transform, filter, reduce, reverse, unique, binarySearch, lowerBound, upperBound, min, max, partition, } from './array.js';
+//# sourceMappingURL=index.js.map

package/dist/algorithms/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/algorithms/index.ts"],"names":[],"mappings":"AAAA,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,YAAY,CAAC"}

package/dist/collections/List.d.ts

@@ -0,0 +1,38 @@
+/**
+ * Doubly linked list. O(1) insert/erase at a known node; O(n) index access.
+ * Use when you need frequent insertions/deletions in the middle without reallocation.
+ */
+export declare class ListNode<T> {
+    value: T;
+    next: ListNode<T> | null;
+    prev: ListNode<T> | null;
+    constructor(value: T);
+}
+export declare class List<T> {
+    private _head;
+    private _tail;
+    private _length;
+    get size(): number;
+    get empty(): boolean;
+    front(): T;
+    back(): T;
+    pushBack(value: T): ListNode<T>;
+    pushFront(value: T): ListNode<T>;
+    popBack(): T | undefined;
+    popFront(): T | undefined;
+    /** Insert value before the given node. Returns the new node. */
+    insertBefore(node: ListNode<T>, value: T): ListNode<T>;
+    /** Insert value after the given node. Returns the new node. */
+    insertAfter(node: ListNode<T>, value: T): ListNode<T>;
+    /** Remove the node. Returns the removed value. */
+    erase(node: ListNode<T>): T;
+    at(index: number): T;
+    clear(): void;
+    [Symbol.iterator](): Iterator<T>;
+    toArray(): T[];
+    /** Return the first node (for iteration by hand). */
+    get headNode(): ListNode<T> | null;
+    /** Return the last node. */
+    get tailNode(): ListNode<T> | null;
+}
+//# sourceMappingURL=List.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"List.d.ts","sourceRoot":"","sources":["../../src/collections/List.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,qBAAa,QAAQ,CAAC,CAAC;IACrB,KAAK,EAAE,CAAC,CAAC;IACT,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI,CAAQ;IAChC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI,CAAQ;gBAEpB,KAAK,EAAE,CAAC;CAGrB;AAED,qBAAa,IAAI,CAAC,CAAC;IACjB,OAAO,CAAC,KAAK,CAA4B;IACzC,OAAO,CAAC,KAAK,CAA4B;IACzC,OAAO,CAAC,OAAO,CAAa;IAE5B,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,IAAI,KAAK,IAAI,OAAO,CAEnB;IAED,KAAK,IAAI,CAAC;IAKV,IAAI,IAAI,CAAC;IAKT,QAAQ,CAAC,KAAK,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;IAa/B,SAAS,CAAC,KAAK,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;IAahC,OAAO,IAAI,CAAC,GAAG,SAAS;IAUxB,QAAQ,IAAI,CAAC,GAAG,SAAS;IAUzB,gEAAgE;IAChE,YAAY,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;IAWtD,+DAA+D;IAC/D,WAAW,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;IAWrD,kDAAkD;IAClD,KAAK,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC;IAS3B,EAAE,CAAC,KAAK,EAAE,MAAM,GAAG,CAAC;IASpB,KAAK,IAAI,IAAI;IAKb,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC;IAYhC,OAAO,IAAI,CAAC,EAAE;IAId,qDAAqD;IACrD,IAAI,QAAQ,IAAI,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI,CAEjC;IAED,4BAA4B;IAC5B,IAAI,QAAQ,IAAI,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI,CAEjC;CACF"}

package/dist/collections/List.js

@@ -0,0 +1,160 @@
+/**
+ * Doubly linked list. O(1) insert/erase at a known node; O(n) index access.
+ * Use when you need frequent insertions/deletions in the middle without reallocation.
+ */
+export class ListNode {
+    constructor(value) {
+        this.next = null;
+        this.prev = null;
+        this.value = value;
+    }
+}
+export class List {
+    constructor() {
+        this._head = null;
+        this._tail = null;
+        this._length = 0;
+    }
+    get size() {
+        return this._length;
+    }
+    get empty() {
+        return this._length === 0;
+    }
+    front() {
+        if (!this._head)
+            throw new RangeError('List is empty');
+        return this._head.value;
+    }
+    back() {
+        if (!this._tail)
+            throw new RangeError('List is empty');
+        return this._tail.value;
+    }
+    pushBack(value) {
+        const node = new ListNode(value);
+        if (!this._tail) {
+            this._head = this._tail = node;
+        }
+        else {
+            this._tail.next = node;
+            node.prev = this._tail;
+            this._tail = node;
+        }
+        this._length++;
+        return node;
+    }
+    pushFront(value) {
+        const node = new ListNode(value);
+        if (!this._head) {
+            this._head = this._tail = node;
+        }
+        else {
+            this._head.prev = node;
+            node.next = this._head;
+            this._head = node;
+        }
+        this._length++;
+        return node;
+    }
+    popBack() {
+        if (!this._tail)
+            return undefined;
+        const v = this._tail.value;
+        this._tail = this._tail.prev;
+        if (this._tail)
+            this._tail.next = null;
+        else
+            this._head = null;
+        this._length--;
+        return v;
+    }
+    popFront() {
+        if (!this._head)
+            return undefined;
+        const v = this._head.value;
+        this._head = this._head.next;
+        if (this._head)
+            this._head.prev = null;
+        else
+            this._tail = null;
+        this._length--;
+        return v;
+    }
+    /** Insert value before the given node. Returns the new node. */
+    insertBefore(node, value) {
+        const n = new ListNode(value);
+        n.prev = node.prev;
+        n.next = node;
+        if (node.prev)
+            node.prev.next = n;
+        else
+            this._head = n;
+        node.prev = n;
+        this._length++;
+        return n;
+    }
+    /** Insert value after the given node. Returns the new node. */
+    insertAfter(node, value) {
+        const n = new ListNode(value);
+        n.next = node.next;
+        n.prev = node;
+        if (node.next)
+            node.next.prev = n;
+        else
+            this._tail = n;
+        node.next = n;
+        this._length++;
+        return n;
+    }
+    /** Remove the node. Returns the removed value. */
+    erase(node) {
+        if (node.prev)
+            node.prev.next = node.next;
+        else
+            this._head = node.next;
+        if (node.next)
+            node.next.prev = node.prev;
+        else
+            this._tail = node.prev;
+        this._length--;
+        return node.value;
+    }
+    at(index) {
+        if (index < 0 || index >= this._length) {
+            throw new RangeError(`List index ${index} out of range (size ${this._length})`);
+        }
+        let cur = this._head;
+        for (let i = 0; i < index; i++)
+            cur = cur.next;
+        return cur.value;
+    }
+    clear() {
+        this._head = this._tail = null;
+        this._length = 0;
+    }
+    [Symbol.iterator]() {
+        let cur = this._head;
+        return {
+            next() {
+                if (!cur)
+                    return { done: true, value: undefined };
+                const value = cur.value;
+                cur = cur.next;
+                return { done: false, value };
+            },
+        };
+    }
+    toArray() {
+        return [...this];
+    }
+    /** Return the first node (for iteration by hand). */
+    get headNode() {
+        return this._head;
+    }
+    /** Return the last node. */
+    get tailNode() {
+        return this._tail;
+    }
+}
+//# sourceMappingURL=List.js.map

package/dist/collections/List.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"List.js","sourceRoot":"","sources":["../../src/collections/List.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,MAAM,OAAO,QAAQ;IAKnB,YAAY,KAAQ;QAHpB,SAAI,GAAuB,IAAI,CAAC;QAChC,SAAI,GAAuB,IAAI,CAAC;QAG9B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;CACF;AAED,MAAM,OAAO,IAAI;IAAjB;QACU,UAAK,GAAuB,IAAI,CAAC;QACjC,UAAK,GAAuB,IAAI,CAAC;QACjC,YAAO,GAAW,CAAC,CAAC;IA2I9B,CAAC;IAzIC,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IAED,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,OAAO,KAAK,CAAC,CAAC;IAC5B,CAAC;IAED,KAAK;QACH,IAAI,CAAC,IAAI,CAAC,KAAK;YAAE,MAAM,IAAI,UAAU,CAAC,eAAe,CAAC,CAAC;QACvD,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC;IAC1B,CAAC;IAED,IAAI;QACF,IAAI,CAAC,IAAI,CAAC,KAAK;YAAE,MAAM,IAAI,UAAU,CAAC,eAAe,CAAC,CAAC;QACvD,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC;IAC1B,CAAC;IAED,QAAQ,CAAC,KAAQ;QACf,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC;QACjC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;YAChB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QACjC,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC;YACvB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACvB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QACpB,CAAC;QACD,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,OAAO,IAAI,CAAC;IACd,CAAC;IAED,SAAS,CAAC,KAAQ;QAChB,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC;QACjC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;YAChB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QACjC,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC;YACvB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACvB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QACpB,CAAC;QACD,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO;QACL,IAAI,CAAC,IAAI,CAAC,KAAK;YAAE,OAAO,SAAS,CAAC;QAClC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC;QAC3B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;QAC7B,IAAI,IAAI,CAAC,KAAK;YAAE,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC;;YAClC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QACvB,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,OAAO,CAAC,CAAC;IACX,CAAC;IAED,QAAQ;QACN,IAAI,CAAC,IAAI,CAAC,KAAK;YAAE,OAAO,SAAS,CAAC;QAClC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC;QAC3B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;QAC7B,IAAI,IAAI,CAAC,KAAK;YAAE,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC;;YAClC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QACvB,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,OAAO,CAAC,CAAC;IACX,CAAC;IAED,gEAAgE;IAChE,YAAY,CAAC,IAAiB,EAAE,KAAQ;QACtC,MAAM,CAAC,GAAG,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC;QAC9B,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACnB,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC;QACd,IAAI,IAAI,CAAC,IAAI;YAAE,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;;YAC7B,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACpB,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,OAAO,CAAC,CAAC;IACX,CAAC;IAED,+DAA+D;IAC/D,WAAW,CAAC,IAAiB,EAAE,KAAQ;QACrC,MAAM,CAAC,GAAG,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC;QAC9B,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACnB,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC;QACd,IAAI,IAAI,CAAC,IAAI;YAAE,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;;YAC7B,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACpB,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,OAAO,CAAC,CAAC;IACX,CAAC;IAED,kDAAkD;IAClD,KAAK,CAAC,IAAiB;QACrB,IAAI,IAAI,CAAC,IAAI;YAAE,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;;YACrC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC;QAC5B,IAAI,IAAI,CAAC,IAAI;YAAE,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;;YACrC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC;QAC5B,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,EAAE,CAAC,KAAa;QACd,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACvC,MAAM,IAAI,UAAU,CAAC,cAAc,KAAK,uBAAuB,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC;QAClF,CAAC;QACD,IAAI,GAAG,GAAG,IAAI,CAAC,KAAM,CAAC;QACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE;YAAE,GAAG,GAAG,GAAG,CAAC,IAAK,CAAC;QAChD,OAAO,GAAG,CAAC,KAAK,CAAC;IACnB,CAAC;IAED,KAAK;QACH,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAC/B,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC;IACnB,CAAC;IAED,CAAC,MAAM,CAAC,QAAQ,CAAC;QACf,IAAI,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC;QACrB,OAAO;YACL,IAAI;gBACF,IAAI,CAAC,GAAG;oBAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;gBAClD,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC;gBACxB,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC;gBACf,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;YAChC,CAAC;SACF,CAAC;IACJ,CAAC;IAED,OAAO;QACL,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC;IACnB,CAAC;IAED,qDAAqD;IACrD,IAAI,QAAQ;QACV,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,4BAA4B;IAC5B,IAAI,QAAQ;QACV,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;CACF"}

package/dist/collections/Queue.d.ts

@@ -0,0 +1,20 @@
+/**
+ * FIFO queue. Amortized O(1) enqueue/dequeue using a circular buffer.
+ */
+export declare class Queue<T> {
+    private _buf;
+    private _head;
+    private _size;
+    constructor(initialCapacity?: number);
+    get size(): number;
+    get empty(): boolean;
+    private grow;
+    enqueue(value: T): void;
+    dequeue(): T | undefined;
+    front(): T;
+    back(): T;
+    clear(): void;
+    [Symbol.iterator](): Iterator<T>;
+    toArray(): T[];
+}
+//# sourceMappingURL=Queue.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"Queue.d.ts","sourceRoot":"","sources":["../../src/collections/Queue.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,qBAAa,KAAK,CAAC,CAAC;IAClB,OAAO,CAAC,IAAI,CAAoB;IAChC,OAAO,CAAC,KAAK,CAAa;IAC1B,OAAO,CAAC,KAAK,CAAa;gBAEd,eAAe,SAAK;IAIhC,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,IAAI,KAAK,IAAI,OAAO,CAEnB;IAED,OAAO,CAAC,IAAI;IAUZ,OAAO,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI;IAMvB,OAAO,IAAI,CAAC,GAAG,SAAS;IAUxB,KAAK,IAAI,CAAC;IAKV,IAAI,IAAI,CAAC;IAKT,KAAK,IAAI,IAAI;IAMb,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC;IAgBhC,OAAO,IAAI,CAAC,EAAE;CAQf"}

package/dist/collections/Queue.js

@@ -0,0 +1,81 @@
+/**
+ * FIFO queue. Amortized O(1) enqueue/dequeue using a circular buffer.
+ */
+export class Queue {
+    constructor(initialCapacity = 16) {
+        this._head = 0;
+        this._size = 0;
+        this._buf = new Array(Math.max(4, initialCapacity));
+    }
+    get size() {
+        return this._size;
+    }
+    get empty() {
+        return this._size === 0;
+    }
+    grow() {
+        const cap = this._buf.length;
+        const next = new Array(cap * 2);
+        for (let i = 0; i < this._size; i++) {
+            next[i] = this._buf[(this._head + i) % cap];
+        }
+        this._buf = next;
+        this._head = 0;
+    }
+    enqueue(value) {
+        if (this._size === this._buf.length)
+            this.grow();
+        this._buf[(this._head + this._size) % this._buf.length] = value;
+        this._size++;
+    }
+    dequeue() {
+        if (this._size === 0)
+            return undefined;
+        const cap = this._buf.length;
+        const value = this._buf[this._head];
+        this._buf[this._head] = undefined;
+        this._head = (this._head + 1) % cap;
+        this._size--;
+        return value;
+    }
+    front() {
+        if (this._size === 0)
+            throw new RangeError('Queue is empty');
+        return this._buf[this._head];
+    }
+    back() {
+        if (this._size === 0)
+            throw new RangeError('Queue is empty');
+        return this._buf[(this._head + this._size - 1) % this._buf.length];
+    }
+    clear() {
+        this._buf = new Array(this._buf.length);
+        this._head = 0;
+        this._size = 0;
+    }
+    [Symbol.iterator]() {
+        const buf = this._buf;
+        const cap = buf.length;
+        const head = this._head;
+        const size = this._size;
+        let i = 0;
+        return {
+            next() {
+                if (i >= size)
+                    return { done: true, value: undefined };
+                const value = buf[(head + i) % cap];
+                i++;
+                return { done: false, value };
+            },
+        };
+    }
+    toArray() {
+        const out = [];
+        const cap = this._buf.length;
+        for (let i = 0; i < this._size; i++) {
+            out.push(this._buf[(this._head + i) % cap]);
+        }
+        return out;
+    }
+}
+//# sourceMappingURL=Queue.js.map

package/dist/collections/Queue.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Queue.js","sourceRoot":"","sources":["../../src/collections/Queue.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,MAAM,OAAO,KAAK;IAKhB,YAAY,eAAe,GAAG,EAAE;QAHxB,UAAK,GAAW,CAAC,CAAC;QAClB,UAAK,GAAW,CAAC,CAAC;QAGxB,IAAI,CAAC,IAAI,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,eAAe,CAAC,CAAC,CAAC;IACtD,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,KAAK,KAAK,CAAC,CAAC;IAC1B,CAAC;IAEO,IAAI;QACV,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;QAC7B,MAAM,IAAI,GAAG,IAAI,KAAK,CAAgB,GAAG,GAAG,CAAC,CAAC,CAAC;QAC/C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;QAC9C,CAAC;QACD,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IACjB,CAAC;IAED,OAAO,CAAC,KAAQ;QACd,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,IAAI,CAAC,MAAM;YAAE,IAAI,CAAC,IAAI,EAAE,CAAC;QACjD,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC;QAChE,IAAI,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IAED,OAAO;QACL,IAAI,IAAI,CAAC,KAAK,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QACvC,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;QAC7B,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,SAAS,CAAC;QAClC,IAAI,CAAC,KAAK,GAAG,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC;QACpC,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,OAAO,KAAK,CAAC;IACf,CAAC;IAED,KAAK;QACH,IAAI,IAAI,CAAC,KAAK,KAAK,CAAC;YAAE,MAAM,IAAI,UAAU,CAAC,gBAAgB,CAAC,CAAC;QAC7D,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAE,CAAC;IAChC,CAAC;IAED,IAAI;QACF,IAAI,IAAI,CAAC,KAAK,KAAK,CAAC;YAAE,MAAM,IAAI,UAAU,CAAC,gBAAgB,CAAC,CAAC;QAC7D,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAE,CAAC;IACtE,CAAC;IAED,KAAK;QACH,IAAI,CAAC,IAAI,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACxC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IACjB,CAAC;IAED,CAAC,MAAM,CAAC,QAAQ,CAAC;QACf,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC;QACtB,MAAM,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC;QACvB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,OAAO;YACL,IAAI;gBACF,IAAI,CAAC,IAAI,IAAI;oBAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;gBACvD,MAAM,KAAK,GAAG,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,GAAG,CAAE,CAAC;gBACrC,CAAC,EAAE,CAAC;gBACJ,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;YAChC,CAAC;SACF,CAAC;IACJ,CAAC;IAED,OAAO;QACL,MAAM,GAAG,GAAQ,EAAE,CAAC;QACpB,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,GAAG,CAAE,CAAC,CAAC;QAC/C,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;CACF"}

package/dist/collections/Stack.d.ts

@@ -0,0 +1,13 @@
+export declare class Stack<T> {
+    private _vec;
+    constructor(initial?: T[] | number);
+    get size(): number;
+    get empty(): boolean;
+    push(value: T): void;
+    pop(): T | undefined;
+    top(): T;
+    clear(): void;
+    [Symbol.iterator](): Iterator<T>;
+    toArray(): T[];
+}
+//# sourceMappingURL=Stack.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"Stack.d.ts","sourceRoot":"","sources":["../../src/collections/Stack.ts"],"names":[],"mappings":"AAKA,qBAAa,KAAK,CAAC,CAAC;IAClB,OAAO,CAAC,IAAI,CAAY;gBAEZ,OAAO,CAAC,EAAE,CAAC,EAAE,GAAG,MAAM;IAIlC,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,IAAI,KAAK,IAAI,OAAO,CAEnB;IAED,IAAI,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI;IAIpB,GAAG,IAAI,CAAC,GAAG,SAAS;IAIpB,GAAG,IAAI,CAAC;IAIR,KAAK,IAAI,IAAI;IAIb,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC;IAIhC,OAAO,IAAI,CAAC,EAAE;CAGf"}

package/dist/collections/Stack.js

@@ -0,0 +1,34 @@
+/**
+ * LIFO stack. O(1) push/pop. Backed by a Vector.
+ */
+import { Vector } from './Vector.js';
+export class Stack {
+    constructor(initial) {
+        this._vec = new Vector(initial);
+    }
+    get size() {
+        return this._vec.size;
+    }
+    get empty() {
+        return this._vec.empty;
+    }
+    push(value) {
+        this._vec.push(value);
+    }
+    pop() {
+        return this._vec.pop();
+    }
+    top() {
+        return this._vec.back();
+    }
+    clear() {
+        this._vec.clear();
+    }
+    [Symbol.iterator]() {
+        return this._vec[Symbol.iterator]();
+    }
+    toArray() {
+        return this._vec.toArray();
+    }
+}
+//# sourceMappingURL=Stack.js.map

package/dist/collections/Stack.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Stack.js","sourceRoot":"","sources":["../../src/collections/Stack.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAErC,MAAM,OAAO,KAAK;IAGhB,YAAY,OAAsB;QAChC,IAAI,CAAC,IAAI,GAAG,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC;IAClC,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;IACxB,CAAC;IAED,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC;IACzB,CAAC;IAED,IAAI,CAAC,KAAQ;QACX,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACxB,CAAC;IAED,GAAG;QACD,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;IACzB,CAAC;IAED,GAAG;QACD,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IAC1B,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,CAAC,QAAQ,CAAC,EAAE,CAAC;IACtC,CAAC;IAED,OAAO;QACL,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;IAC7B,CAAC;CACF"}

package/dist/collections/Vector.d.ts

@@ -0,0 +1,28 @@
+/**
+ * STL-like dynamic array. Amortized O(1) push/pop, O(1) index access.
+ * Uses a single backing array with optional capacity reserve to reduce reallocations.
+ */
+export declare class Vector<T> {
+    private _data;
+    private _length;
+    constructor(initial?: T[] | number);
+    get size(): number;
+    get empty(): boolean;
+    /** Current backing array length (capacity). */
+    get capacity(): number;
+    /** Ensure capacity at least `n`. Avoids repeated reallocation when pushing. */
+    reserve(n: number): void;
+    /** Shrink backing array to fit current size. */
+    shrinkToFit(): void;
+    private ensureCapacity;
+    at(index: number): T;
+    set(index: number, value: T): void;
+    push(value: T): number;
+    pop(): T | undefined;
+    front(): T;
+    back(): T;
+    clear(): void;
+    [Symbol.iterator](): Iterator<T>;
+    toArray(): T[];
+}
+//# sourceMappingURL=Vector.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"Vector.d.ts","sourceRoot":"","sources":["../../src/collections/Vector.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,qBAAa,MAAM,CAAC,CAAC;IACnB,OAAO,CAAC,KAAK,CAAM;IACnB,OAAO,CAAC,OAAO,CAAS;gBAEZ,OAAO,CAAC,EAAE,CAAC,EAAE,GAAG,MAAM;IAelC,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,IAAI,KAAK,IAAI,OAAO,CAEnB;IAED,+CAA+C;IAC/C,IAAI,QAAQ,IAAI,MAAM,CAErB;IAED,+EAA+E;IAC/E,OAAO,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI;IAOxB,gDAAgD;IAChD,WAAW,IAAI,IAAI;IAOnB,OAAO,CAAC,cAAc;IAQtB,EAAE,CAAC,KAAK,EAAE,MAAM,GAAG,CAAC;IAOpB,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI;IAOlC,IAAI,CAAC,KAAK,EAAE,CAAC,GAAG,MAAM;IAMtB,GAAG,IAAI,CAAC,GAAG,SAAS;IAOpB,KAAK,IAAI,CAAC;IAKV,IAAI,IAAI,CAAC;IAKT,KAAK,IAAI,IAAI;IAIb,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC;IAYhC,OAAO,IAAI,CAAC,EAAE;CAKf"}

package/dist/collections/Vector.js

@@ -0,0 +1,113 @@
+/**
+ * STL-like dynamic array. Amortized O(1) push/pop, O(1) index access.
+ * Uses a single backing array with optional capacity reserve to reduce reallocations.
+ */
+export class Vector {
+    constructor(initial) {
+        if (initial === undefined) {
+            this._data = [];
+            this._length = 0;
+            return;
+        }
+        if (typeof initial === 'number') {
+            this._data = new Array(Math.max(0, initial));
+            this._length = initial;
+            return;
+        }
+        this._data = [...initial];
+        this._length = this._data.length;
+    }
+    get size() {
+        return this._length;
+    }
+    get empty() {
+        return this._length === 0;
+    }
+    /** Current backing array length (capacity). */
+    get capacity() {
+        return this._data.length;
+    }
+    /** Ensure capacity at least `n`. Avoids repeated reallocation when pushing. */
+    reserve(n) {
+        if (n <= this._data.length)
+            return;
+        const next = new Array(n);
+        for (let i = 0; i < this._length; i++)
+            next[i] = this._data[i];
+        this._data = next;
+    }
+    /** Shrink backing array to fit current size. */
+    shrinkToFit() {
+        if (this._length === this._data.length)
+            return;
+        const next = new Array(this._length);
+        for (let i = 0; i < this._length; i++)
+            next[i] = this._data[i];
+        this._data = next;
+    }
+    ensureCapacity() {
+        if (this._length < this._data.length)
+            return;
+        const cap = this._data.length === 0 ? 4 : this._data.length * 2;
+        const next = new Array(cap);
+        for (let i = 0; i < this._length; i++)
+            next[i] = this._data[i];
+        this._data = next;
+    }
+    at(index) {
+        if (index < 0 || index >= this._length) {
+            throw new RangeError(`Vector index ${index} out of range (size ${this._length})`);
+        }
+        return this._data[index];
+    }
+    set(index, value) {
+        if (index < 0 || index >= this._length) {
+            throw new RangeError(`Vector index ${index} out of range (size ${this._length})`);
+        }
+        this._data[index] = value;
+    }
+    push(value) {
+        this.ensureCapacity();
+        this._data[this._length++] = value;
+        return this._length;
+    }
+    pop() {
+        if (this._length === 0)
+            return undefined;
+        const v = this._data[--this._length];
+        this._data[this._length] = undefined;
+        return v;
+    }
+    front() {
+        if (this._length === 0)
+            throw new RangeError('Vector is empty');
+        return this._data[0];
+    }
+    back() {
+        if (this._length === 0)
+            throw new RangeError('Vector is empty');
+        return this._data[this._length - 1];
+    }
+    clear() {
+        this._length = 0;
+    }
+    [Symbol.iterator]() {
+        let i = 0;
+        const data = this._data;
+        const len = this._length;
+        return {
+            next() {
+                if (i >= len)
+                    return { done: true, value: undefined };
+                return { done: false, value: data[i++] };
+            },
+        };
+    }
+    toArray() {
+        const out = [];
+        for (let i = 0; i < this._length; i++)
+            out.push(this._data[i]);
+        return out;
+    }
+}
+//# sourceMappingURL=Vector.js.map

package/dist/collections/Vector.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Vector.js","sourceRoot":"","sources":["../../src/collections/Vector.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,MAAM,OAAO,MAAM;IAIjB,YAAY,OAAsB;QAChC,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YAC1B,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;YAChB,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC;YACjB,OAAO;QACT,CAAC;QACD,IAAI,OAAO,OAAO,KAAK,QAAQ,EAAE,CAAC;YAChC,IAAI,CAAC,KAAK,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;YAC7C,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;YACvB,OAAO;QACT,CAAC;QACD,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC;QAC1B,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IACnC,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IAED,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,OAAO,KAAK,CAAC,CAAC;IAC5B,CAAC;IAED,+CAA+C;IAC/C,IAAI,QAAQ;QACV,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IAC3B,CAAC;IAED,+EAA+E;IAC/E,OAAO,CAAC,CAAS;QACf,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM;YAAE,OAAO;QACnC,MAAM,IAAI,GAAG,IAAI,KAAK,CAAI,CAAC,CAAC,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE;YAAE,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC/D,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACpB,CAAC;IAED,gDAAgD;IAChD,WAAW;QACT,IAAI,IAAI,CAAC,OAAO,KAAK,IAAI,CAAC,KAAK,CAAC,MAAM;YAAE,OAAO;QAC/C,MAAM,IAAI,GAAG,IAAI,KAAK,CAAI,IAAI,CAAC,OAAO,CAAC,CAAC;QACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE;YAAE,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC/D,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACpB,CAAC;IAEO,cAAc;QACpB,IAAI,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM;YAAE,OAAO;QAC7C,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;QAChE,MAAM,IAAI,GAAG,IAAI,KAAK,CAAI,GAAG,CAAC,CAAC;QAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE;YAAE,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC/D,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACpB,CAAC;IAED,EAAE,CAAC,KAAa;QACd,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACvC,MAAM,IAAI,UAAU,CAAC,gBAAgB,KAAK,uBAAuB,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC;QACpF,CAAC;QACD,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAC3B,CAAC;IAED,GAAG,CAAC,KAAa,EAAE,KAAQ;QACzB,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACvC,MAAM,IAAI,UAAU,CAAC,gBAAgB,KAAK,uBAAuB,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC;QACpF,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;IAC5B,CAAC;IAED,IAAI,CAAC,KAAQ;QACX,IAAI,CAAC,cAAc,EAAE,CAAC;QACtB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,GAAG,KAAK,CAAC;QACnC,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IAED,GAAG;QACD,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QACzC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QACrC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,SAAU,CAAC;QACtC,OAAO,CAAC,CAAC;IACX,CAAC;IAED,KAAK;QACH,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC;YAAE,MAAM,IAAI,UAAU,CAAC,iBAAiB,CAAC,CAAC;QAChE,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IAED,IAAI;QACF,IAAI,IAAI,CAAC,OAAO,KAAK,CAAC;YAAE,MAAM,IAAI,UAAU,CAAC,iBAAiB,CAAC,CAAC;QAChE,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC;IACtC,CAAC;IAED,KAAK;QACH,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC;IACnB,CAAC;IAED,CAAC,MAAM,CAAC,QAAQ,CAAC;QACf,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC;QACzB,OAAO;YACL,IAAI;gBACF,IAAI,CAAC,IAAI,GAAG;oBAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;gBACtD,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;YAC3C,CAAC;SACF,CAAC;IACJ,CAAC;IAED,OAAO;QACL,MAAM,GAAG,GAAQ,EAAE,CAAC;QACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE;YAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/D,OAAO,GAAG,CAAC;IACb,CAAC;CACF"}

package/dist/collections/index.d.ts

@@ -0,0 +1,5 @@
+export { Vector } from './Vector.js';
+export { Stack } from './Stack.js';
+export { Queue } from './Queue.js';
+export { List, ListNode } from './List.js';
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +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"}

package/dist/collections/index.js

@@ -0,0 +1,5 @@
+export { Vector } from './Vector.js';
+export { Stack } from './Stack.js';
+export { Queue } from './Queue.js';
+export { List, ListNode } from './List.js';
+//# sourceMappingURL=index.js.map

package/dist/collections/index.js.map

@@ -0,0 +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"}

package/dist/index.d.ts

@@ -0,0 +1,13 @@
+/**
+ * TypeScript SDK — use like C++ STL.
+ * Clone the repo and import from this package.
+ *
+ * @example
+ * import { Vector, Stack, Queue, List, sort, binarySearch, clamp } from 'typescript-dsa-stl';
+ */
+export { Vector, Stack, Queue, List, ListNode } 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';
+export { toArray } from './types/index.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +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"}

package/dist/index.js

@@ -0,0 +1,12 @@
+/**
+ * TypeScript SDK — use like C++ STL.
+ * Clone the repo and import from this package.
+ *
+ * @example
+ * import { Vector, Stack, Queue, List, sort, binarySearch, clamp } from 'typescript-dsa-stl';
+ */
+export { Vector, Stack, Queue, List, ListNode } 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';
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +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"}

package/dist/types/index.d.ts

@@ -0,0 +1,16 @@
+/**
+ * Shared types for the SDK. STL-like comparator and predicate conventions.
+ */
+/** Compare two values: negative if a < b, zero if a === b, positive if a > b. */
+export type Comparator<T> = (a: T, b: T) => number;
+/** Predicate for find, filter, partition, etc. */
+export type Predicate<T> = (x: T) => boolean;
+/** Unary transform (map). */
+export type UnaryFn<T, U> = (x: T) => U;
+/** Reducer (accumulator, value) => new accumulator. */
+export type Reducer<T, U> = (acc: U, x: T) => U;
+/** Any value that can be iterated (array, Vector, Set, Map keys, etc.). */
+export type IterableLike<T> = Iterable<T> | ArrayLike<T>;
+/** Convert IterableLike to array (single copy). Used internally by algorithms. */
+export declare function toArray<T>(source: IterableLike<T>): T[];
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/types/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,iFAAiF;AACjF,MAAM,MAAM,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,MAAM,CAAC;AAEnD,kDAAkD;AAClD,MAAM,MAAM,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC;AAE7C,6BAA6B;AAC7B,MAAM,MAAM,OAAO,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;AAExC,uDAAuD;AACvD,MAAM,MAAM,OAAO,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;AAEhD,2EAA2E;AAC3E,MAAM,MAAM,YAAY,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;AAEzD,kFAAkF;AAClF,wBAAgB,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAMvD"}

package/dist/types/index.js

@@ -0,0 +1,13 @@
+/**
+ * Shared types for the SDK. STL-like comparator and predicate conventions.
+ */
+/** Convert IterableLike to array (single copy). Used internally by algorithms. */
+export function toArray(source) {
+    if (Array.isArray(source))
+        return source;
+    if (typeof source[Symbol.iterator] === 'function') {
+        return [...source];
+    }
+    return Array.from(source);
+}
+//# sourceMappingURL=index.js.map

package/dist/types/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/types/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAiBH,kFAAkF;AAClF,MAAM,UAAU,OAAO,CAAI,MAAuB;IAChD,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;QAAE,OAAO,MAAM,CAAC;IACzC,IAAI,OAAQ,MAAsB,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,UAAU,EAAE,CAAC;QACnE,OAAO,CAAC,GAAI,MAAsB,CAAC,CAAC;IACtC,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,MAAsB,CAAC,CAAC;AAC5C,CAAC"}

package/dist/utils/index.d.ts

@@ -0,0 +1,10 @@
+/**
+ * Common utilities exposed by the SDK.
+ */
+export declare function clamp(value: number, min: number, max: number): number;
+export declare function range(start: number, end: number, step?: number): number[];
+export declare function noop(): void;
+export declare function identity<T>(x: T): T;
+/** Swap two elements in an array. O(1). */
+export declare function swap<T>(arr: T[], i: number, j: number): void;
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/utils/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,wBAAgB,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,CAErE;AAED,wBAAgB,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,SAAI,GAAG,MAAM,EAAE,CAMpE;AAED,wBAAgB,IAAI,IAAI,IAAI,CAAG;AAE/B,wBAAgB,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAEnC;AAED,2CAA2C;AAC3C,wBAAgB,IAAI,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,IAAI,CAK5D"}

package/dist/utils/index.js

@@ -0,0 +1,25 @@
+/**
+ * Common utilities exposed by the SDK.
+ */
+export function clamp(value, min, max) {
+    return Math.min(Math.max(value, min), max);
+}
+export function range(start, end, step = 1) {
+    const out = [];
+    for (let i = start; step > 0 ? i < end : i > end; i += step) {
+        out.push(i);
+    }
+    return out;
+}
+export function noop() { }
+export function identity(x) {
+    return x;
+}
+/** Swap two elements in an array. O(1). */
+export function swap(arr, i, j) {
+    if (i < 0 || i >= arr.length || j < 0 || j >= arr.length) {
+        throw new RangeError('swap: index out of range');
+    }
+    [arr[i], arr[j]] = [arr[j], arr[i]];
+}
+//# sourceMappingURL=index.js.map

package/dist/utils/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/utils/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,MAAM,UAAU,KAAK,CAAC,KAAa,EAAE,GAAW,EAAE,GAAW;IAC3D,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;AAC7C,CAAC;AAED,MAAM,UAAU,KAAK,CAAC,KAAa,EAAE,GAAW,EAAE,IAAI,GAAG,CAAC;IACxD,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC;QAC5D,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACd,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,MAAM,UAAU,IAAI,KAAU,CAAC;AAE/B,MAAM,UAAU,QAAQ,CAAI,CAAI;IAC9B,OAAO,CAAC,CAAC;AACX,CAAC;AAED,2CAA2C;AAC3C,MAAM,UAAU,IAAI,CAAI,GAAQ,EAAE,CAAS,EAAE,CAAS;IACpD,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,MAAM,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC;QACzD,MAAM,IAAI,UAAU,CAAC,0BAA0B,CAAC,CAAC;IACnD,CAAC;IACD,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AACtC,CAAC"}

package/package.json

@@ -0,0 +1,77 @@
+{
+  "name": "typescript-dsa-stl",
+  "version": "1.0.0",
+  "description": "TypeScript_DSA — STL-like data structures and algorithms. Vector, Stack, Queue, List, sort, binarySearch, and more.",
+  "type": "module",
+  "main": "dist/index.js",
+  "module": "dist/index.js",
+  "types": "dist/index.d.ts",
+  "sideEffects": false,
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "import": "./dist/index.js",
+      "default": "./dist/index.js"
+    },
+    "./collections": {
+      "types": "./dist/collections/index.d.ts",
+      "import": "./dist/collections/index.js",
+      "default": "./dist/collections/index.js"
+    },
+    "./algorithms": {
+      "types": "./dist/algorithms/index.d.ts",
+      "import": "./dist/algorithms/index.js",
+      "default": "./dist/algorithms/index.js"
+    },
+    "./utils": {
+      "types": "./dist/utils/index.d.ts",
+      "import": "./dist/utils/index.js",
+      "default": "./dist/utils/index.js"
+    },
+    "./types": {
+      "types": "./dist/types/index.d.ts",
+      "import": "./dist/types/index.js",
+      "default": "./dist/types/index.js"
+    }
+  },
+  "files": [
+    "dist",
+    "README.md",
+    "LICENSE"
+  ],
+  "scripts": {
+    "build": "tsc",
+    "prepublishOnly": "npm run build"
+  },
+  "keywords": [
+    "typescript-dsa-stl",
+    "TypeScript_DSA",
+    "dsa",
+    "data-structures",
+    "algorithms",
+    "typescript",
+    "sdk",
+    "stl",
+    "vector",
+    "stack",
+    "queue",
+    "list",
+    "collections"
+  ],
+  "author": "",
+  "license": "MIT",
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/SajidAbdullah729/TypeScript_DSA.git"
+  },
+  "homepage": "https://github.com/SajidAbdullah729/TypeScript_DSA#readme",
+  "bugs": {
+    "url": "https://github.com/SajidAbdullah729/TypeScript_DSA/issues"
+  },
+  "engines": {
+    "node": ">=18"
+  },
+  "devDependencies": {
+    "typescript": "^5.3.0"
+  }
+}