typescript-dsa-stl 2.4.0 → 2.6.0

package/README.md

@@ -2,7 +2,7 @@
 
 **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**, **OrderedMultiMap**, **OrderedMultiSet**, and algorithms (`sort`, `binarySearch`, `lowerBound`, `min`, `max`, **KnuthMorrisPratt**, **RabinKarp**, **StringRollingHash**, etc.). Install from npm to use in your project; this repo holds the source code.
+STL-style data structures and algorithms for TypeScript: **Vector**, **Stack**, **Queue**, **Deque**, **List**, **PriorityQueue**, **OrderedMap** (Map), **UnorderedMap**, **OrderedSet** (Set), **UnorderedSet**, **OrderedMultiMap**, **OrderedMultiSet**, **segment trees** (`SegmentTreeSum`, `SegmentTreeMin`, `SegmentTreeMax`, `SegmentTree`, `GeneralSegmentTree`, `LazySegmentTreeSum`), and algorithms (`sort`, `binarySearch`, `lowerBound`, `min`, `max`, **KnuthMorrisPratt**, **RabinKarp**, **StringRollingHash**, etc.). Install from npm to use in your project; this repo holds the source code.
 
 ---
 
@@ -21,6 +21,7 @@ import {
   Vector,
   Stack,
   Queue,
+  Deque,
   List,
   PriorityQueue,
   OrderedMap,
@@ -53,6 +54,15 @@ queue.enqueue(1);
 queue.enqueue(2);
 console.log(queue.front()); // 1
 
+// Deque — double-ended queue (like C++ std::deque): O(1) both ends + O(1) index access
+const deque = new Deque<number>();
+deque.pushBack(2);
+deque.pushFront(1);
+deque.pushBack(3);
+console.log(deque.front()); // 1
+console.log(deque.back()); // 3
+console.log(deque.at(1)); // 2
+
 const list = new List<number>();
 list.pushBack(10);
 const node = list.pushBack(20);
@@ -102,6 +112,30 @@ clamp(42, 0, 10);       // 10
 range(0, 5);            // [0, 1, 2, 3, 4]
 ```
 
+### Deque (like C++ `std::deque`)
+
+A **double-ended queue**: amortized **O(1)** `pushFront` / `pushBack` / `popFront` / `popBack`, and **O(1)** random access via `at` / `set`. Implemented as a growable circular buffer (same asymptotics as a typical `std::deque` for these operations).
+
+| C++ | TypeScript |
+|-----|------------|
+| `push_front` | `pushFront` |
+| `push_back` | `pushBack` |
+| `pop_front` | `popFront` |
+| `pop_back` | `popBack` |
+| `front` / `back` | `front()` / `back()` |
+| `operator[]` / `at` | `at(i)` / `set(i, value)` |
+| `size` / `empty` | `size` / `empty` |
+| — | `capacity`, `reserve`, `shrinkToFit`, `toArray()`, iterator |
+
+```ts
+import { Deque } from 'typescript-dsa-stl';
+
+const d = new Deque<number>([1, 2, 3]); // copy initial elements, or `new Deque()` / `new Deque(64)` for capacity hint
+d.pushFront(0);
+d.popBack();
+console.log(d.toArray()); // [0, 1, 2]
+```
+
 ### 2D and 3D vectors (like C++ `vector<vector<int>>`)
 
 `Vector<T>` is generic, so you can nest it for 2D/3D grids:
@@ -521,19 +555,177 @@ console.log(a.substringHash(2, 2) === b.fullHash()); // true — both are "na"
 
 ---
 
+## Segment trees
+
+Segment trees support **range queries** and **point updates** in **O(log n)**. Range endpoints are **inclusive**: `query(l, r)` covers indices `l` through `r`.
+
+### Ready-made variants (`SegmentTreeSum`, `SegmentTreeMin`, `SegmentTreeMax`)
+
+```ts
+import {
+  SegmentTreeSum,
+  SegmentTreeMin,
+  SegmentTreeMax,
+} from 'typescript-dsa-stl';
+
+const sum = new SegmentTreeSum([1, 2, 3, 4]);
+console.log(sum.query(0, 3)); // 10
+sum.update(1, 10);
+console.log(sum.query(0, 3)); // 1 + 10 + 3 + 4 = 18
+
+const mn = new SegmentTreeMin([5, 2, 8, 1]);
+console.log(mn.query(0, 3)); // 1
+
+const mx = new SegmentTreeMax([5, 2, 8, 1]);
+console.log(mx.query(0, 3)); // 8
+```
+
+### Generic `SegmentTree<T>` (custom combine + neutral)
+
+Use the same type for array elements and aggregates. Pass an **associative** `combine` and a **neutral** value for query ranges that miss a segment (e.g. `0` for sum, `Infinity` for min).
+
+```ts
+import { SegmentTree } from 'typescript-dsa-stl';
+
+const gcdTree = new SegmentTree<number>(
+  [12, 18, 24],
+  (a, b) => {
+    let x = a;
+    let y = b;
+    while (y !== 0) {
+      const t = y;
+      y = x % y;
+      x = t;
+    }
+    return x;
+  },
+  0
+);
+console.log(gcdTree.query(0, 2)); // gcd(12, 18, 24) === 6
+
+// Non-numeric example: concatenate strings
+const strTree = new SegmentTree<string>(
+  ['a', 'b', 'c'],
+  (a, b) => a + b,
+  ''
+);
+console.log(strTree.query(0, 2)); // 'abc'
+```
+
+### `GeneralSegmentTree<T, V>` (custom merge + buildLeaf)
+
+Use when **raw** values `V` differ from the **aggregate** type `T`:
+
+- **`merge(left, right)`** — combine two child aggregates (internal nodes).
+- **`neutral`** — identity for `merge` when a query does not overlap a segment.
+- **`buildLeaf(value, index)`** — build the leaf from the raw array on initial construction and on every `update`.
+
+```ts
+import { GeneralSegmentTree } from 'typescript-dsa-stl';
+
+// Store sum of squares; raw array is plain numbers
+const st = new GeneralSegmentTree<number, number>([1, 2, 3], {
+  merge: (a, b) => a + b,
+  neutral: 0,
+  buildLeaf: (v, i) => v * v + i,
+});
+console.log(st.query(0, 2)); // (1+0) + (4+1) + (9+2) = 17
+st.update(1, 4);
+console.log(st.rawAt(1)); // 4 — current raw value at index 1
+```
+
+### `LazySegmentTreeSum` (range add + range sum)
+
+**`rangeAdd(l, r, delta)`** adds `delta` to every element in the inclusive range. **`rangeSum(l, r)`** returns the sum. **`set(i, value)`** assigns one position (lazy tags are applied along the path). All are **O(log n)**.
+
+```ts
+import { LazySegmentTreeSum } from 'typescript-dsa-stl';
+
+const lazy = new LazySegmentTreeSum([0, 0, 0, 0]);
+lazy.rangeAdd(1, 2, 5); // indices 1 and 2 get +5
+console.log(lazy.rangeSum(0, 3)); // 10
+lazy.set(0, 100);
+console.log(lazy.rangeSum(0, 3)); // 100 + 5 + 5 + 0
+```
+
+### Real-world use cases
+
+These patterns show up in backends and internal tools when you need **many** range queries and updates on a fixed sequence (length known up front), without scanning the whole array each time.
+
+#### 1. Analytics or reporting: totals over a time window (with corrections)
+
+Each index is a **fixed bucket** (hour of day, day of month, version slot, etc.). You repeatedly ask “what is the **sum** from bucket `a` through `b`?” and sometimes **fix one bucket** after late data or a reconciliation.
+
+```ts
+import { SegmentTreeSum } from 'typescript-dsa-stl';
+
+/** Revenue (or events, page views, API calls) per calendar day; index 0 = first day of period. */
+class PeriodMetrics {
+  private readonly tree: SegmentTreeSum;
+
+  constructor(dailyValues: readonly number[]) {
+    this.tree = new SegmentTreeSum(dailyValues);
+  }
+
+  /** Total for an inclusive day range — e.g. chart drill-down or export row. */
+  totalBetweenDay(firstDayIndex: number, lastDayIndex: number): number {
+    return this.tree.query(firstDayIndex, lastDayIndex);
+  }
+
+  /** Backfill or correct one day without rebuilding the whole series. */
+  setDay(dayIndex: number, amount: number): void {
+    this.tree.update(dayIndex, amount);
+  }
+}
+
+const january = new PeriodMetrics([1200, 980, 1100, 1050, 1300]);
+console.log(january.totalBetweenDay(0, 4)); // full period
+january.setDay(2, 1150); // corrected day 2
+console.log(january.totalBetweenDay(1, 3)); // sum over days 1..3
+```
+
+In production you would usually **persist** the underlying series in a database and **rebuild** the tree when the period reloads; the tree stays useful in memory for dashboards, simulations, or request handlers that see heavy read/update traffic on the same window.
+
+#### 2. Operations or finance: bulk adjustment on a slice, then aggregate
+
+You apply the **same delta** to **every** element in an index range (tiered bonuses, prorated credits, simulation shocks), then need **range sums** for reporting. A lazy sum tree avoids touching each cell one by one.
+
+```ts
+import { LazySegmentTreeSum } from 'typescript-dsa-stl';
+
+/** Example: per-seat or per-row amounts; apply a flat bonus to ranks 10–50 (0-based 9..49), then sum a sub-range for a sub-team. */
+function simulateBulkBonusAndSubtotal(seatCount: number): void {
+  // Initial per-seat values (e.g. base commission), built once
+  const base = Array.from({ length: seatCount }, (_, i) => 100 + i);
+  const amounts = new LazySegmentTreeSum(base);
+
+  // HR: +250 to everyone in seats 10–50 inclusive (indices 9..49)
+  amounts.rangeAdd(9, 49, 250);
+
+  // Finance: subtotal for seats 20–30 only
+  console.log(amounts.rangeSum(19, 29));
+}
+
+simulateBulkBonusAndSubtotal(100);
+```
+
+The same idea applies to **inventory deltas** across bin ranges, **loyalty points** batch credits by user-ID band (when IDs map to contiguous indices), or **game/simulation** state where many cells gain the same buff and you query partial totals.
+
+---
+
 ## API overview
 
 | Module | Exports |
 |--------|--------|
-| **Collections** | `Vector`, `Stack`, `Queue`, `List`, `ListNode`, `PriorityQueue`, `OrderedMap`, `UnorderedMap`, `OrderedSet`, `UnorderedSet`, `OrderedMultiMap`, `OrderedMultiSet`, `WeightedEdge`, `AdjacencyList`, `WeightedAdjacencyList`, `createAdjacencyList`, `createWeightedAdjacencyList`, `addEdge`, `deleteEdge` |
+| **Collections** | `Vector`, `Stack`, `Queue`, `Deque`, `List`, `ListNode`, `PriorityQueue`, `OrderedMap`, `UnorderedMap`, `OrderedSet`, `UnorderedSet`, `OrderedMultiMap`, `OrderedMultiSet`, `GeneralSegmentTree`, `SegmentTree`, `SegmentTreeSum`, `SegmentTreeMin`, `SegmentTreeMax`, `LazySegmentTreeSum`, `WeightedEdge`, `AdjacencyList`, `WeightedAdjacencyList`, `createAdjacencyList`, `createWeightedAdjacencyList`, `addEdge`, `deleteEdge` |
 | **Algorithms** | `sort`, `find`, `findIndex`, `transform`, `filter`, `reduce`, `reverse`, `unique`, `binarySearch`, `lowerBound`, `upperBound`, `min`, `max`, `partition`, `DisjointSetUnion`, `KnuthMorrisPratt`, `RabinKarp`, `RABIN_KARP_DEFAULT_MODS`, `StringRollingHash`, `breadthFirstSearch`, `depthFirstSearch`, `connectedComponents`, `kruskalMST` |
 | **Utils** | `clamp`, `range`, `noop`, `identity`, `swap` |
-| **Types** | `Comparator`, `Predicate`, `UnaryFn`, `Reducer`, `IterableLike`, `toArray`, `RabinKarpTripleMods` |
+| **Types** | `Comparator`, `Predicate`, `UnaryFn`, `Reducer`, `IterableLike`, `toArray`, `RabinKarpTripleMods`, `GeneralSegmentTreeConfig`, `SegmentCombine`, `SegmentMerge`, `SegmentLeafBuild` |
 
 ### Subpath imports (tree-shaking)
 
 ```ts
-import { Vector, Stack } from 'typescript-dsa-stl/collections';
+import { Vector, Stack, Queue, Deque } from 'typescript-dsa-stl/collections';
 import { sort, binarySearch, breadthFirstSearch, depthFirstSearch, KnuthMorrisPratt, RabinKarp, StringRollingHash } from 'typescript-dsa-stl/algorithms';
 import { clamp, range } from 'typescript-dsa-stl/utils';
 import type { Comparator } from 'typescript-dsa-stl/types';
@@ -548,6 +740,7 @@ import type { Comparator } from 'typescript-dsa-stl/types';
 | **Vector** | O(1) | O(1)* | O(n) | O(1) | O(n) |
 | **Stack** | — | O(1) | — | O(1) | — |
 | **Queue** | — | O(1)* | — | O(1)* | — |
+| **Deque** | O(1) | O(1)* (front/back) | — | O(1)* (front/back) | — |
 | **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(log n) set | — | O(log n) delete | — |
@@ -560,6 +753,13 @@ import type { Comparator } from 'typescript-dsa-stl/types';
 \* Amortized (hash).  
 \** At a known node.
 
+### Segment trees (range queries)
+
+| Structure | Build | Point update | Range query | Extra |
+|-----------|-------|--------------|-------------|--------|
+| **GeneralSegmentTree**, **SegmentTree**, **SegmentTreeSum** / **Min** / **Max** | O(n) | O(log n) | O(log n) | Inclusive `[l, r]`; **GeneralSegmentTree** keeps raw `V` and uses `merge` + `buildLeaf` |
+| **LazySegmentTreeSum** | O(n) | `set`: O(log n) | `rangeSum`: O(log n) | `rangeAdd` on a range: O(log n) |
+
 ---
 
 ## OrderedMultiMap and OrderedMultiSet — use cases

package/dist/collections/Deque.d.ts

@@ -0,0 +1,44 @@
+/**
+ * Double-ended queue (STL `std::deque`-style API in camelCase).
+ *
+ * Backed by a growable circular buffer: amortized **O(1)** `pushFront` / `pushBack` /
+ * `popFront` / `popBack`, and **O(1)** indexed `at` / `set` (unlike a linked list).
+ */
+export declare class Deque<T> {
+    private _buf;
+    private _head;
+    private _size;
+    /**
+     * @param initial — initial capacity (number), or copy elements in order from an array.
+     */
+    constructor(initial?: readonly T[] | number);
+    get size(): number;
+    get empty(): boolean;
+    /** Current backing slot count (≥ size). */
+    get capacity(): number;
+    private grow;
+    private ensureSpace;
+    /** Ensure buffer has room for at least `n` elements total (may shrink logical size only via pop/clear). */
+    reserve(minCapacity: number): void;
+    /** Drop unused buffer capacity (keeps current elements). */
+    shrinkToFit(): void;
+    private indexPhysical;
+    at(index: number): T;
+    set(index: number, value: T): void;
+    /** Same as C++ `push_front`. */
+    pushFront(value: T): void;
+    /** Same as C++ `push_back`. */
+    pushBack(value: T): void;
+    /** Same as C++ `pop_front`. */
+    popFront(): T | undefined;
+    /** Same as C++ `pop_back`. */
+    popBack(): T | undefined;
+    /** Same as C++ `front`. */
+    front(): T;
+    /** Same as C++ `back`. */
+    back(): T;
+    clear(): void;
+    [Symbol.iterator](): Iterator<T>;
+    toArray(): T[];
+}
+//# sourceMappingURL=Deque.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"Deque.d.ts","sourceRoot":"","sources":["../../src/collections/Deque.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,qBAAa,KAAK,CAAC,CAAC;IAClB,OAAO,CAAC,IAAI,CAAoB;IAChC,OAAO,CAAC,KAAK,CAAK;IAClB,OAAO,CAAC,KAAK,CAAK;IAElB;;OAEG;gBACS,OAAO,CAAC,EAAE,SAAS,CAAC,EAAE,GAAG,MAAM;IAkB3C,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,IAAI,KAAK,IAAI,OAAO,CAEnB;IAED,2CAA2C;IAC3C,IAAI,QAAQ,IAAI,MAAM,CAErB;IAED,OAAO,CAAC,IAAI;IAUZ,OAAO,CAAC,WAAW;IAKnB,2GAA2G;IAC3G,OAAO,CAAC,WAAW,EAAE,MAAM,GAAG,IAAI;IAWlC,4DAA4D;IAC5D,WAAW,IAAI,IAAI;IAgBnB,OAAO,CAAC,aAAa;IAIrB,EAAE,CAAC,KAAK,EAAE,MAAM,GAAG,CAAC;IAOpB,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI;IAOlC,gCAAgC;IAChC,SAAS,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI;IAQzB,+BAA+B;IAC/B,QAAQ,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI;IAOxB,+BAA+B;IAC/B,QAAQ,IAAI,CAAC,GAAG,SAAS;IAUzB,8BAA8B;IAC9B,OAAO,IAAI,CAAC,GAAG,SAAS;IAUxB,2BAA2B;IAC3B,KAAK,IAAI,CAAC;IAKV,0BAA0B;IAC1B,IAAI,IAAI,CAAC;IAMT,KAAK,IAAI,IAAI;IAMb,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC;IAgBhC,OAAO,IAAI,CAAC,EAAE;CAQf"}

package/dist/collections/Deque.js

@@ -0,0 +1,178 @@
+/**
+ * Double-ended queue (STL `std::deque`-style API in camelCase).
+ *
+ * Backed by a growable circular buffer: amortized **O(1)** `pushFront` / `pushBack` /
+ * `popFront` / `popBack`, and **O(1)** indexed `at` / `set` (unlike a linked list).
+ */
+export class Deque {
+    /**
+     * @param initial — initial capacity (number), or copy elements in order from an array.
+     */
+    constructor(initial) {
+        this._head = 0;
+        this._size = 0;
+        if (initial === undefined) {
+            this._buf = new Array(16);
+            return;
+        }
+        if (typeof initial === 'number') {
+            this._buf = new Array(Math.max(4, initial));
+            return;
+        }
+        const n = initial.length;
+        const cap = Math.max(16, n <= 4 ? 4 : 2 ** Math.ceil(Math.log2(n)));
+        this._buf = new Array(cap);
+        for (let i = 0; i < n; i++) {
+            this._buf[i] = initial[i];
+        }
+        this._size = n;
+    }
+    get size() {
+        return this._size;
+    }
+    get empty() {
+        return this._size === 0;
+    }
+    /** Current backing slot count (≥ size). */
+    get capacity() {
+        return this._buf.length;
+    }
+    grow() {
+        const cap = this._buf.length;
+        const next = new Array(Math.max(4, cap * 2));
+        for (let i = 0; i < this._size; i++) {
+            next[i] = this._buf[(this._head + i) % cap];
+        }
+        this._buf = next;
+        this._head = 0;
+    }
+    ensureSpace() {
+        if (this._size < this._buf.length)
+            return;
+        this.grow();
+    }
+    /** Ensure buffer has room for at least `n` elements total (may shrink logical size only via pop/clear). */
+    reserve(minCapacity) {
+        if (minCapacity <= this._buf.length)
+            return;
+        const next = new Array(minCapacity);
+        const cap = this._buf.length;
+        for (let i = 0; i < this._size; i++) {
+            next[i] = this._buf[(this._head + i) % cap];
+        }
+        this._buf = next;
+        this._head = 0;
+    }
+    /** Drop unused buffer capacity (keeps current elements). */
+    shrinkToFit() {
+        if (this._size === this._buf.length)
+            return;
+        if (this._size === 0) {
+            this._buf = new Array(4);
+            this._head = 0;
+            return;
+        }
+        const next = new Array(this._size);
+        const cap = this._buf.length;
+        for (let i = 0; i < this._size; i++) {
+            next[i] = this._buf[(this._head + i) % cap];
+        }
+        this._buf = next;
+        this._head = 0;
+    }
+    indexPhysical(i) {
+        return (this._head + i) % this._buf.length;
+    }
+    at(index) {
+        if (index < 0 || index >= this._size) {
+            throw new RangeError(`Deque index ${index} out of range (size ${this._size})`);
+        }
+        return this._buf[this.indexPhysical(index)];
+    }
+    set(index, value) {
+        if (index < 0 || index >= this._size) {
+            throw new RangeError(`Deque index ${index} out of range (size ${this._size})`);
+        }
+        this._buf[this.indexPhysical(index)] = value;
+    }
+    /** Same as C++ `push_front`. */
+    pushFront(value) {
+        this.ensureSpace();
+        const cap = this._buf.length;
+        this._head = (this._head - 1 + cap) % cap;
+        this._buf[this._head] = value;
+        this._size++;
+    }
+    /** Same as C++ `push_back`. */
+    pushBack(value) {
+        this.ensureSpace();
+        const cap = this._buf.length;
+        this._buf[(this._head + this._size) % cap] = value;
+        this._size++;
+    }
+    /** Same as C++ `pop_front`. */
+    popFront() {
+        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;
+    }
+    /** Same as C++ `pop_back`. */
+    popBack() {
+        if (this._size === 0)
+            return undefined;
+        const cap = this._buf.length;
+        const idx = (this._head + this._size - 1 + cap) % cap;
+        const value = this._buf[idx];
+        this._buf[idx] = undefined;
+        this._size--;
+        return value;
+    }
+    /** Same as C++ `front`. */
+    front() {
+        if (this._size === 0)
+            throw new RangeError('Deque is empty');
+        return this._buf[this._head];
+    }
+    /** Same as C++ `back`. */
+    back() {
+        if (this._size === 0)
+            throw new RangeError('Deque is empty');
+        const cap = this._buf.length;
+        return this._buf[(this._head + this._size - 1 + cap) % cap];
+    }
+    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=Deque.js.map

package/dist/collections/Deque.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Deque.js","sourceRoot":"","sources":["../../src/collections/Deque.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,MAAM,OAAO,KAAK;IAKhB;;OAEG;IACH,YAAY,OAA+B;QANnC,UAAK,GAAG,CAAC,CAAC;QACV,UAAK,GAAG,CAAC,CAAC;QAMhB,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YAC1B,IAAI,CAAC,IAAI,GAAG,IAAI,KAAK,CAAC,EAAE,CAAC,CAAC;YAC1B,OAAO;QACT,CAAC;QACD,IAAI,OAAO,OAAO,KAAK,QAAQ,EAAE,CAAC;YAChC,IAAI,CAAC,IAAI,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;YAC5C,OAAO;QACT,CAAC;QACD,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;QACzB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACpE,IAAI,CAAC,IAAI,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QAC5B,CAAC;QACD,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IACjB,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;IAED,2CAA2C;IAC3C,IAAI,QAAQ;QACV,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;IAC1B,CAAC;IAEO,IAAI;QACV,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;QAC7B,MAAM,IAAI,GAAG,IAAI,KAAK,CAAgB,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QAC5D,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;IAEO,WAAW;QACjB,IAAI,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM;YAAE,OAAO;QAC1C,IAAI,CAAC,IAAI,EAAE,CAAC;IACd,CAAC;IAED,2GAA2G;IAC3G,OAAO,CAAC,WAAmB;QACzB,IAAI,WAAW,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM;YAAE,OAAO;QAC5C,MAAM,IAAI,GAAG,IAAI,KAAK,CAAgB,WAAW,CAAC,CAAC;QACnD,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,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,4DAA4D;IAC5D,WAAW;QACT,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,IAAI,CAAC,MAAM;YAAE,OAAO;QAC5C,IAAI,IAAI,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC;YACrB,IAAI,CAAC,IAAI,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;YACf,OAAO;QACT,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,KAAK,CAAgB,IAAI,CAAC,KAAK,CAAC,CAAC;QAClD,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,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;IAEO,aAAa,CAAC,CAAS;QAC7B,OAAO,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;IAC7C,CAAC;IAED,EAAE,CAAC,KAAa;QACd,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACrC,MAAM,IAAI,UAAU,CAAC,eAAe,KAAK,uBAAuB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACjF,CAAC;QACD,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAE,CAAC;IAC/C,CAAC;IAED,GAAG,CAAC,KAAa,EAAE,KAAQ;QACzB,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACrC,MAAM,IAAI,UAAU,CAAC,eAAe,KAAK,uBAAuB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACjF,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC;IAC/C,CAAC;IAED,gCAAgC;IAChC,SAAS,CAAC,KAAQ;QAChB,IAAI,CAAC,WAAW,EAAE,CAAC;QACnB,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;QAC7B,IAAI,CAAC,KAAK,GAAG,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC;QAC1C,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;QAC9B,IAAI,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IAED,+BAA+B;IAC/B,QAAQ,CAAC,KAAQ;QACf,IAAI,CAAC,WAAW,EAAE,CAAC;QACnB,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;QAC7B,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,GAAG,KAAK,CAAC;QACnD,IAAI,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IAED,+BAA+B;IAC/B,QAAQ;QACN,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,8BAA8B;IAC9B,OAAO;QACL,IAAI,IAAI,CAAC,KAAK,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QACvC,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;QAC7B,MAAM,GAAG,GAAG,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC;QACtD,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC7B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,OAAO,KAAK,CAAC;IACf,CAAC;IAED,2BAA2B;IAC3B,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,0BAA0B;IAC1B,IAAI;QACF,IAAI,IAAI,CAAC,KAAK,KAAK,CAAC;YAAE,MAAM,IAAI,UAAU,CAAC,gBAAgB,CAAC,CAAC;QAC7D,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;QAC7B,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,CAAE,CAAC;IAC/D,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/SegmentTree.d.ts

@@ -0,0 +1,108 @@
+/**
+ * Segment trees: range queries and point updates in O(log n).
+ *
+ * - {@link GeneralSegmentTree} — full control: custom **merge** (internal nodes) and **buildLeaf** (initial + point updates).
+ * - {@link SegmentTree} — same stored type as array; custom combine + neutral only.
+ * - {@link SegmentTreeSum} — range sum, point assign.
+ * - {@link SegmentTreeMin} — range minimum, point assign.
+ * - {@link SegmentTreeMax} — range maximum, point assign.
+ * - {@link LazySegmentTreeSum} — range add + range sum (lazy propagation).
+ *
+ * All range endpoints are **inclusive**: `query(l, r)` uses indices `l` through `r`.
+ */
+export type SegmentCombine<T> = (a: T, b: T) => T;
+/** Combine two child segment aggregates into the parent (internal nodes). */
+export type SegmentMerge<T> = (left: T, right: T) => T;
+/**
+ * Turn each raw array element into the leaf value stored in the tree.
+ * Used on initial build and on every `update`.
+ */
+export type SegmentLeafBuild<T, V> = (value: V, index: number) => T;
+export interface GeneralSegmentTreeConfig<T, V> {
+    /** Combine left and right child aggregates (must be associative with `neutral`). */
+    merge: SegmentMerge<T>;
+    /** Result of `merge` when a query misses the segment (identity for `merge`). */
+    neutral: T;
+    /** Build the leaf at `index` from the current raw value `value`. */
+    buildLeaf: SegmentLeafBuild<T, V>;
+}
+/**
+ * General-purpose segment tree: raw array type `V`, stored aggregate type `T`.
+ * You supply **merge** for internal nodes and **buildLeaf** for leaves (build + point updates).
+ */
+export declare class GeneralSegmentTree<T, V> {
+    private readonly _n;
+    private readonly _tree;
+    private readonly _raw;
+    private readonly _merge;
+    private readonly _neutral;
+    private readonly _buildLeaf;
+    constructor(values: readonly V[], config: GeneralSegmentTreeConfig<T, V>);
+    get size(): number;
+    /** Current raw value at `index` (the same `V` you pass to `update`). */
+    rawAt(index: number): V;
+    /**
+     * Set raw value at `index`, rebuild leaf with `buildLeaf`, refresh ancestors. O(log n).
+     */
+    update(index: number, rawValue: V): void;
+    /** Aggregate over inclusive range `[left, right]`. O(log n). */
+    query(left: number, right: number): T;
+    private _bounds;
+    private _build;
+    private _update;
+    private _query;
+}
+/**
+ * Generic segment tree: stored type equals array element type; leaves are the raw values.
+ * Equivalent to {@link GeneralSegmentTree} with `buildLeaf: (v) => v`.
+ */
+export declare class SegmentTree<T> {
+    private readonly _inner;
+    /**
+     * @param values Initial leaf values (copied).
+     * @param combine Associative operation (e.g. addition, min, max).
+     * @param neutral Identity for `combine` (e.g. 0 for sum, Infinity for min).
+     */
+    constructor(values: readonly T[], combine: SegmentCombine<T>, neutral: T);
+    get size(): number;
+    /** Set index `index` to `value` and refresh ancestors. O(log n). */
+    update(index: number, value: T): void;
+    /** Aggregate over inclusive range `[left, right]`. O(log n). */
+    query(left: number, right: number): T;
+}
+/** Range sum and point assign. Neutral element is `0`. */
+export declare class SegmentTreeSum extends SegmentTree<number> {
+    constructor(values: readonly number[]);
+}
+/** Range minimum and point assign. Neutral for out-of-range is `Infinity`. */
+export declare class SegmentTreeMin extends SegmentTree<number> {
+    constructor(values: readonly number[]);
+}
+/** Range maximum and point assign. Neutral for out-of-range is `-Infinity`. */
+export declare class SegmentTreeMax extends SegmentTree<number> {
+    constructor(values: readonly number[]);
+}
+/**
+ * Lazy segment tree: add a constant to every element in `[left, right]` and query range sums.
+ * Both operations are O(log n).
+ */
+export declare class LazySegmentTreeSum {
+    private readonly _n;
+    private readonly _tree;
+    private readonly _lazy;
+    constructor(values: readonly number[]);
+    get size(): number;
+    /** Add `delta` to each element in inclusive `[left, right]`. O(log n). */
+    rangeAdd(left: number, right: number, delta: number): void;
+    /** Sum of elements in inclusive `[left, right]`. O(log n). */
+    rangeSum(left: number, right: number): number;
+    /** Point assign (sets one index; clears lazy along the path). O(log n). */
+    set(index: number, value: number): void;
+    private _bounds;
+    private _build;
+    private _push;
+    private _rangeAdd;
+    private _rangeSum;
+    private _set;
+}
+//# sourceMappingURL=SegmentTree.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"SegmentTree.d.ts","sourceRoot":"","sources":["../../src/collections/SegmentTree.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AACH,MAAM,MAAM,cAAc,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;AAElD,6EAA6E;AAC7E,MAAM,MAAM,YAAY,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,CAAC;AAEvD;;;GAGG;AACH,MAAM,MAAM,gBAAgB,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,CAAC,CAAC;AAEpE,MAAM,WAAW,wBAAwB,CAAC,CAAC,EAAE,CAAC;IAC5C,oFAAoF;IACpF,KAAK,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC;IACvB,gFAAgF;IAChF,OAAO,EAAE,CAAC,CAAC;IACX,oEAAoE;IACpE,SAAS,EAAE,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;CACnC;AAED;;;GAGG;AACH,qBAAa,kBAAkB,CAAC,CAAC,EAAE,CAAC;IAClC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAS;IAC5B,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAM;IAC5B,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAM;IAC3B,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAkB;IACzC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAI;IAC7B,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAyB;gBAExC,MAAM,EAAE,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,wBAAwB,CAAC,CAAC,EAAE,CAAC,CAAC;IAYxE,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,wEAAwE;IACxE,KAAK,CAAC,KAAK,EAAE,MAAM,GAAG,CAAC;IAKvB;;OAEG;IACH,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,GAAG,IAAI;IAMxC,gEAAgE;IAChE,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,CAAC;IAOrC,OAAO,CAAC,OAAO;IAOf,OAAO,CAAC,MAAM;IAWd,OAAO,CAAC,OAAO;IAWf,OAAO,CAAC,MAAM;CAQf;AAED;;;GAGG;AACH,qBAAa,WAAW,CAAC,CAAC;IACxB,OAAO,CAAC,QAAQ,CAAC,MAAM,CAA2B;IAElD;;;;OAIG;gBACS,MAAM,EAAE,SAAS,CAAC,EAAE,EAAE,OAAO,EAAE,cAAc,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC;IAQxE,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,oEAAoE;IACpE,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI;IAIrC,gEAAgE;IAChE,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,CAAC;CAGtC;AAED,0DAA0D;AAC1D,qBAAa,cAAe,SAAQ,WAAW,CAAC,MAAM,CAAC;gBACzC,MAAM,EAAE,SAAS,MAAM,EAAE;CAGtC;AAED,8EAA8E;AAC9E,qBAAa,cAAe,SAAQ,WAAW,CAAC,MAAM,CAAC;gBACzC,MAAM,EAAE,SAAS,MAAM,EAAE;CAGtC;AAED,+EAA+E;AAC/E,qBAAa,cAAe,SAAQ,WAAW,CAAC,MAAM,CAAC;gBACzC,MAAM,EAAE,SAAS,MAAM,EAAE;CAGtC;AAED;;;GAGG;AACH,qBAAa,kBAAkB;IAC7B,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAS;IAC5B,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAW;IACjC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAW;gBAErB,MAAM,EAAE,SAAS,MAAM,EAAE;IAUrC,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,0EAA0E;IAC1E,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI;IAO1D,8DAA8D;IAC9D,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM;IAO7C,2EAA2E;IAC3E,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI;IAKvC,OAAO,CAAC,OAAO;IAOf,OAAO,CAAC,MAAM;IAWd,OAAO,CAAC,KAAK;IAab,OAAO,CAAC,SAAS;IAcjB,OAAO,CAAC,SAAS;IAUjB,OAAO,CAAC,IAAI;CAYb"}

package/dist/collections/SegmentTree.js

@@ -0,0 +1,234 @@
+/**
+ * General-purpose segment tree: raw array type `V`, stored aggregate type `T`.
+ * You supply **merge** for internal nodes and **buildLeaf** for leaves (build + point updates).
+ */
+export class GeneralSegmentTree {
+    constructor(values, config) {
+        this._n = values.length;
+        this._merge = config.merge;
+        this._neutral = config.neutral;
+        this._buildLeaf = config.buildLeaf;
+        this._raw = this._n > 0 ? Array.from(values) : [];
+        this._tree = new Array(Math.max(1, 4 * this._n));
+        if (this._n > 0) {
+            this._build(1, 0, this._n - 1);
+        }
+    }
+    get size() {
+        return this._n;
+    }
+    /** Current raw value at `index` (the same `V` you pass to `update`). */
+    rawAt(index) {
+        this._bounds(index);
+        return this._raw[index];
+    }
+    /**
+     * Set raw value at `index`, rebuild leaf with `buildLeaf`, refresh ancestors. O(log n).
+     */
+    update(index, rawValue) {
+        this._bounds(index);
+        this._raw[index] = rawValue;
+        this._update(1, 0, this._n - 1, index);
+    }
+    /** Aggregate over inclusive range `[left, right]`. O(log n). */
+    query(left, right) {
+        this._bounds(left);
+        this._bounds(right);
+        if (left > right)
+            throw new RangeError('left must be <= right');
+        return this._query(1, 0, this._n - 1, left, right);
+    }
+    _bounds(i) {
+        if (this._n === 0)
+            throw new RangeError('GeneralSegmentTree is empty');
+        if (i < 0 || i >= this._n) {
+            throw new RangeError(`Index ${i} out of range [0, ${this._n - 1}]`);
+        }
+    }
+    _build(node, l, r) {
+        if (l === r) {
+            this._tree[node] = this._buildLeaf(this._raw[l], l);
+            return;
+        }
+        const mid = (l + r) >>> 1;
+        this._build(node * 2, l, mid);
+        this._build(node * 2 + 1, mid + 1, r);
+        this._tree[node] = this._merge(this._tree[node * 2], this._tree[node * 2 + 1]);
+    }
+    _update(node, l, r, idx) {
+        if (l === r) {
+            this._tree[node] = this._buildLeaf(this._raw[idx], idx);
+            return;
+        }
+        const mid = (l + r) >>> 1;
+        if (idx <= mid)
+            this._update(node * 2, l, mid, idx);
+        else
+            this._update(node * 2 + 1, mid + 1, r, idx);
+        this._tree[node] = this._merge(this._tree[node * 2], this._tree[node * 2 + 1]);
+    }
+    _query(node, l, r, ql, qr) {
+        if (qr < l || r < ql)
+            return this._neutral;
+        if (ql <= l && r <= qr)
+            return this._tree[node];
+        const mid = (l + r) >>> 1;
+        const leftQ = this._query(node * 2, l, mid, ql, qr);
+        const rightQ = this._query(node * 2 + 1, mid + 1, r, ql, qr);
+        return this._merge(leftQ, rightQ);
+    }
+}
+/**
+ * Generic segment tree: stored type equals array element type; leaves are the raw values.
+ * Equivalent to {@link GeneralSegmentTree} with `buildLeaf: (v) => v`.
+ */
+export class SegmentTree {
+    /**
+     * @param values Initial leaf values (copied).
+     * @param combine Associative operation (e.g. addition, min, max).
+     * @param neutral Identity for `combine` (e.g. 0 for sum, Infinity for min).
+     */
+    constructor(values, combine, neutral) {
+        this._inner = new GeneralSegmentTree(values, {
+            merge: combine,
+            neutral,
+            buildLeaf: (v) => v,
+        });
+    }
+    get size() {
+        return this._inner.size;
+    }
+    /** Set index `index` to `value` and refresh ancestors. O(log n). */
+    update(index, value) {
+        this._inner.update(index, value);
+    }
+    /** Aggregate over inclusive range `[left, right]`. O(log n). */
+    query(left, right) {
+        return this._inner.query(left, right);
+    }
+}
+/** Range sum and point assign. Neutral element is `0`. */
+export class SegmentTreeSum extends SegmentTree {
+    constructor(values) {
+        super(values, (a, b) => a + b, 0);
+    }
+}
+/** Range minimum and point assign. Neutral for out-of-range is `Infinity`. */
+export class SegmentTreeMin extends SegmentTree {
+    constructor(values) {
+        super(values, (a, b) => Math.min(a, b), Infinity);
+    }
+}
+/** Range maximum and point assign. Neutral for out-of-range is `-Infinity`. */
+export class SegmentTreeMax extends SegmentTree {
+    constructor(values) {
+        super(values, (a, b) => Math.max(a, b), -Infinity);
+    }
+}
+/**
+ * Lazy segment tree: add a constant to every element in `[left, right]` and query range sums.
+ * Both operations are O(log n).
+ */
+export class LazySegmentTreeSum {
+    constructor(values) {
+        this._n = values.length;
+        const cap = Math.max(1, 4 * this._n);
+        this._tree = new Array(cap).fill(0);
+        this._lazy = new Array(cap).fill(0);
+        if (this._n > 0) {
+            this._build(1, 0, this._n - 1, values);
+        }
+    }
+    get size() {
+        return this._n;
+    }
+    /** Add `delta` to each element in inclusive `[left, right]`. O(log n). */
+    rangeAdd(left, right, delta) {
+        this._bounds(left);
+        this._bounds(right);
+        if (left > right)
+            throw new RangeError('left must be <= right');
+        this._rangeAdd(1, 0, this._n - 1, left, right, delta);
+    }
+    /** Sum of elements in inclusive `[left, right]`. O(log n). */
+    rangeSum(left, right) {
+        this._bounds(left);
+        this._bounds(right);
+        if (left > right)
+            throw new RangeError('left must be <= right');
+        return this._rangeSum(1, 0, this._n - 1, left, right);
+    }
+    /** Point assign (sets one index; clears lazy along the path). O(log n). */
+    set(index, value) {
+        this._bounds(index);
+        this._set(1, 0, this._n - 1, index, value);
+    }
+    _bounds(i) {
+        if (this._n === 0)
+            throw new RangeError('LazySegmentTreeSum is empty');
+        if (i < 0 || i >= this._n) {
+            throw new RangeError(`Index ${i} out of range [0, ${this._n - 1}]`);
+        }
+    }
+    _build(node, l, r, arr) {
+        if (l === r) {
+            this._tree[node] = arr[l];
+            return;
+        }
+        const mid = (l + r) >>> 1;
+        this._build(node * 2, l, mid, arr);
+        this._build(node * 2 + 1, mid + 1, r, arr);
+        this._tree[node] = this._tree[node * 2] + this._tree[node * 2 + 1];
+    }
+    _push(node, l, r) {
+        const lz = this._lazy[node];
+        if (lz === 0 || l === r)
+            return;
+        const mid = (l + r) >>> 1;
+        const leftLen = mid - l + 1;
+        const rightLen = r - mid;
+        this._lazy[node * 2] += lz;
+        this._lazy[node * 2 + 1] += lz;
+        this._tree[node * 2] += lz * leftLen;
+        this._tree[node * 2 + 1] += lz * rightLen;
+        this._lazy[node] = 0;
+    }
+    _rangeAdd(node, l, r, ql, qr, delta) {
+        if (qr < l || r < ql)
+            return;
+        if (ql <= l && r <= qr) {
+            this._tree[node] += delta * (r - l + 1);
+            this._lazy[node] += delta;
+            return;
+        }
+        this._push(node, l, r);
+        const mid = (l + r) >>> 1;
+        this._rangeAdd(node * 2, l, mid, ql, qr, delta);
+        this._rangeAdd(node * 2 + 1, mid + 1, r, ql, qr, delta);
+        this._tree[node] = this._tree[node * 2] + this._tree[node * 2 + 1];
+    }
+    _rangeSum(node, l, r, ql, qr) {
+        if (qr < l || r < ql)
+            return 0;
+        if (ql <= l && r <= qr)
+            return this._tree[node];
+        this._push(node, l, r);
+        const mid = (l + r) >>> 1;
+        return (this._rangeSum(node * 2, l, mid, ql, qr) + this._rangeSum(node * 2 + 1, mid + 1, r, ql, qr));
+    }
+    _set(node, l, r, idx, value) {
+        if (l === r) {
+            this._tree[node] = value;
+            this._lazy[node] = 0;
+            return;
+        }
+        this._push(node, l, r);
+        const mid = (l + r) >>> 1;
+        if (idx <= mid)
+            this._set(node * 2, l, mid, idx, value);
+        else
+            this._set(node * 2 + 1, mid + 1, r, idx, value);
+        this._tree[node] = this._tree[node * 2] + this._tree[node * 2 + 1];
+    }
+}
+//# sourceMappingURL=SegmentTree.js.map

package/dist/collections/SegmentTree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"SegmentTree.js","sourceRoot":"","sources":["../../src/collections/SegmentTree.ts"],"names":[],"mappings":"AAgCA;;;GAGG;AACH,MAAM,OAAO,kBAAkB;IAQ7B,YAAY,MAAoB,EAAE,MAAsC;QACtE,IAAI,CAAC,EAAE,GAAG,MAAM,CAAC,MAAM,CAAC;QACxB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC;QAC3B,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,OAAO,CAAC;QAC/B,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC,SAAS,CAAC;QACnC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAClD,IAAI,CAAC,KAAK,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;QACjD,IAAI,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC;YAChB,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;QACjC,CAAC;IACH,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,EAAE,CAAC;IACjB,CAAC;IAED,wEAAwE;IACxE,KAAK,CAAC,KAAa;QACjB,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACpB,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC1B,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,KAAa,EAAE,QAAW;QAC/B,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACpB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,QAAQ,CAAC;QAC5B,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC;IACzC,CAAC;IAED,gEAAgE;IAChE,KAAK,CAAC,IAAY,EAAE,KAAa;QAC/B,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACnB,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACpB,IAAI,IAAI,GAAG,KAAK;YAAE,MAAM,IAAI,UAAU,CAAC,uBAAuB,CAAC,CAAC;QAChE,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;IACrD,CAAC;IAEO,OAAO,CAAC,CAAS;QACvB,IAAI,IAAI,CAAC,EAAE,KAAK,CAAC;YAAE,MAAM,IAAI,UAAU,CAAC,6BAA6B,CAAC,CAAC;QACvE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC;YAC1B,MAAM,IAAI,UAAU,CAAC,SAAS,CAAC,qBAAqB,IAAI,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;QACtE,CAAC;IACH,CAAC;IAEO,MAAM,CAAC,IAAY,EAAE,CAAS,EAAE,CAAS;QAC/C,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACZ,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACpD,OAAO;QACT,CAAC;QACD,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAC1B,IAAI,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;QAC9B,IAAI,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QACtC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACjF,CAAC;IAEO,OAAO,CAAC,IAAY,EAAE,CAAS,EAAE,CAAS,EAAE,GAAW;QAC7D,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACZ,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;YACxD,OAAO;QACT,CAAC;QACD,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAC1B,IAAI,GAAG,IAAI,GAAG;YAAE,IAAI,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;;YAC/C,IAAI,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;QACjD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACjF,CAAC;IAEO,MAAM,CAAC,IAAY,EAAE,CAAS,EAAE,CAAS,EAAE,EAAU,EAAE,EAAU;QACvE,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE;YAAE,OAAO,IAAI,CAAC,QAAQ,CAAC;QAC3C,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;YAAE,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAChD,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAC1B,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACpD,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QAC7D,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IACpC,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,OAAO,WAAW;IAGtB;;;;OAIG;IACH,YAAY,MAAoB,EAAE,OAA0B,EAAE,OAAU;QACtE,IAAI,CAAC,MAAM,GAAG,IAAI,kBAAkB,CAAC,MAAM,EAAE;YAC3C,KAAK,EAAE,OAAO;YACd,OAAO;YACP,SAAS,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;SACpB,CAAC,CAAC;IACL,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;IAC1B,CAAC;IAED,oEAAoE;IACpE,MAAM,CAAC,KAAa,EAAE,KAAQ;QAC5B,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IACnC,CAAC;IAED,gEAAgE;IAChE,KAAK,CAAC,IAAY,EAAE,KAAa;QAC/B,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IACxC,CAAC;CACF;AAED,0DAA0D;AAC1D,MAAM,OAAO,cAAe,SAAQ,WAAmB;IACrD,YAAY,MAAyB;QACnC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACpC,CAAC;CACF;AAED,8EAA8E;AAC9E,MAAM,OAAO,cAAe,SAAQ,WAAmB;IACrD,YAAY,MAAyB;QACnC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;IACpD,CAAC;CACF;AAED,+EAA+E;AAC/E,MAAM,OAAO,cAAe,SAAQ,WAAmB;IACrD,YAAY,MAAyB;QACnC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC;IACrD,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,OAAO,kBAAkB;IAK7B,YAAY,MAAyB;QACnC,IAAI,CAAC,EAAE,GAAG,MAAM,CAAC,MAAM,CAAC;QACxB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;QACrC,IAAI,CAAC,KAAK,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACpC,IAAI,CAAC,KAAK,GAAG,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACpC,IAAI,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC;YAChB,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;QACzC,CAAC;IACH,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,EAAE,CAAC;IACjB,CAAC;IAED,0EAA0E;IAC1E,QAAQ,CAAC,IAAY,EAAE,KAAa,EAAE,KAAa;QACjD,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACnB,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACpB,IAAI,IAAI,GAAG,KAAK;YAAE,MAAM,IAAI,UAAU,CAAC,uBAAuB,CAAC,CAAC;QAChE,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IACxD,CAAC;IAED,8DAA8D;IAC9D,QAAQ,CAAC,IAAY,EAAE,KAAa;QAClC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACnB,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACpB,IAAI,IAAI,GAAG,KAAK;YAAE,MAAM,IAAI,UAAU,CAAC,uBAAuB,CAAC,CAAC;QAChE,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;IACxD,CAAC;IAED,2EAA2E;IAC3E,GAAG,CAAC,KAAa,EAAE,KAAa;QAC9B,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACpB,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IAC7C,CAAC;IAEO,OAAO,CAAC,CAAS;QACvB,IAAI,IAAI,CAAC,EAAE,KAAK,CAAC;YAAE,MAAM,IAAI,UAAU,CAAC,6BAA6B,CAAC,CAAC;QACvE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC;YAC1B,MAAM,IAAI,UAAU,CAAC,SAAS,CAAC,qBAAqB,IAAI,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;QACtE,CAAC;IACH,CAAC;IAEO,MAAM,CAAC,IAAY,EAAE,CAAS,EAAE,CAAS,EAAE,GAAsB;QACvE,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACZ,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;YAC1B,OAAO;QACT,CAAC;QACD,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAC1B,IAAI,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;QACnC,IAAI,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;QAC3C,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IACrE,CAAC;IAEO,KAAK,CAAC,IAAY,EAAE,CAAS,EAAE,CAAS;QAC9C,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC5B,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;YAAE,OAAO;QAChC,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAC1B,MAAM,OAAO,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;QAC5B,MAAM,QAAQ,GAAG,CAAC,GAAG,GAAG,CAAC;QACzB,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;QAC3B,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;QAC/B,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,EAAE,GAAG,OAAO,CAAC;QACrC,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,GAAG,QAAQ,CAAC;QAC1C,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACvB,CAAC;IAEO,SAAS,CAAC,IAAY,EAAE,CAAS,EAAE,CAAS,EAAE,EAAU,EAAE,EAAU,EAAE,KAAa;QACzF,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE;YAAE,OAAO;QAC7B,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YACvB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YACxC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC;YAC1B,OAAO;QACT,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACvB,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAC1B,IAAI,CAAC,SAAS,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC;QAChD,IAAI,CAAC,SAAS,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC;QACxD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IACrE,CAAC;IAEO,SAAS,CAAC,IAAY,EAAE,CAAS,EAAE,CAAS,EAAE,EAAU,EAAE,EAAU;QAC1E,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE;YAAE,OAAO,CAAC,CAAC;QAC/B,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;YAAE,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAChD,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACvB,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAC1B,OAAO,CACL,IAAI,CAAC,SAAS,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAC5F,CAAC;IACJ,CAAC;IAEO,IAAI,CAAC,IAAY,EAAE,CAAS,EAAE,CAAS,EAAE,GAAW,EAAE,KAAa;QACzE,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACZ,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC;YACzB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACrB,OAAO;QACT,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACvB,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAC1B,IAAI,GAAG,IAAI,GAAG;YAAE,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;;YACnD,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;QACrD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IACrE,CAAC;CACF"}

package/dist/collections/index.d.ts

@@ -1,6 +1,7 @@
 export { Vector } from './Vector.js';
 export { Stack } from './Stack.js';
 export { Queue } from './Queue.js';
+export { Deque } from './Deque.js';
 export { List, ListNode } from './List.js';
 export { PriorityQueue } from './PriorityQueue.js';
 export { OrderedMap } from './OrderedMap.js';
@@ -10,6 +11,8 @@ export { UnorderedSet } from './UnorderedSet.js';
 export { OrderedMultiSet } from './OrderedMultiSet.js';
 export { OrderedMultiMap } from './OrderedMultiMap.js';
 export { RedBlackTree, RBNode } from './RedBlackTree.js';
+export { GeneralSegmentTree, SegmentTree, SegmentTreeSum, SegmentTreeMin, SegmentTreeMax, LazySegmentTreeSum, } from './SegmentTree.js';
+export type { GeneralSegmentTreeConfig, SegmentCombine, SegmentLeafBuild, SegmentMerge, } from './SegmentTree.js';
 export type { WeightedEdge, AdjacencyList, WeightedAdjacencyList } from './Graph.js';
 export { createAdjacencyList, createWeightedAdjacencyList, addEdge, deleteEdge } from './Graph.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;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;AACjD,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AACvD,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AACvD,OAAO,EAAE,YAAY,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AACzD,YAAY,EAAE,YAAY,EAAE,aAAa,EAAE,qBAAqB,EAAE,MAAM,YAAY,CAAC;AACrF,OAAO,EAAE,mBAAmB,EAAE,2BAA2B,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM,YAAY,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,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;AACjD,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AACvD,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AACvD,OAAO,EAAE,YAAY,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AACzD,OAAO,EACL,kBAAkB,EAClB,WAAW,EACX,cAAc,EACd,cAAc,EACd,cAAc,EACd,kBAAkB,GACnB,MAAM,kBAAkB,CAAC;AAC1B,YAAY,EACV,wBAAwB,EACxB,cAAc,EACd,gBAAgB,EAChB,YAAY,GACb,MAAM,kBAAkB,CAAC;AAC1B,YAAY,EAAE,YAAY,EAAE,aAAa,EAAE,qBAAqB,EAAE,MAAM,YAAY,CAAC;AACrF,OAAO,EAAE,mBAAmB,EAAE,2BAA2B,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC"}

package/dist/collections/index.js

@@ -1,6 +1,7 @@
 export { Vector } from './Vector.js';
 export { Stack } from './Stack.js';
 export { Queue } from './Queue.js';
+export { Deque } from './Deque.js';
 export { List, ListNode } from './List.js';
 export { PriorityQueue } from './PriorityQueue.js';
 export { OrderedMap } from './OrderedMap.js';
@@ -10,5 +11,6 @@ export { UnorderedSet } from './UnorderedSet.js';
 export { OrderedMultiSet } from './OrderedMultiSet.js';
 export { OrderedMultiMap } from './OrderedMultiMap.js';
 export { RedBlackTree, RBNode } from './RedBlackTree.js';
+export { GeneralSegmentTree, SegmentTree, SegmentTreeSum, SegmentTreeMin, SegmentTreeMax, LazySegmentTreeSum, } from './SegmentTree.js';
 export { createAdjacencyList, createWeightedAdjacencyList, addEdge, deleteEdge } from './Graph.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;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;AACjD,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AACvD,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AACvD,OAAO,EAAE,YAAY,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAEzD,OAAO,EAAE,mBAAmB,EAAE,2BAA2B,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM,YAAY,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,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;AACjD,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AACvD,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AACvD,OAAO,EAAE,YAAY,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AACzD,OAAO,EACL,kBAAkB,EAClB,WAAW,EACX,cAAc,EACd,cAAc,EACd,cAAc,EACd,kBAAkB,GACnB,MAAM,kBAAkB,CAAC;AAQ1B,OAAO,EAAE,mBAAmB,EAAE,2BAA2B,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC"}

package/dist/index.d.ts

@@ -5,8 +5,8 @@
  * @example
  * import { Vector, Stack, Queue, List, sort, binarySearch, clamp } from 'typescript-dsa-stl';
  */
-export { Vector, Stack, Queue, List, ListNode, PriorityQueue, OrderedMap, UnorderedMap, OrderedSet, UnorderedSet, OrderedMultiSet, OrderedMultiMap, addEdge, deleteEdge, createAdjacencyList, createWeightedAdjacencyList, } from './collections/index.js';
-export type { WeightedEdge, AdjacencyList, WeightedAdjacencyList } from './collections/index.js';
+export { Vector, Stack, Queue, Deque, List, ListNode, PriorityQueue, OrderedMap, UnorderedMap, OrderedSet, UnorderedSet, OrderedMultiSet, OrderedMultiMap, addEdge, deleteEdge, createAdjacencyList, createWeightedAdjacencyList, GeneralSegmentTree, SegmentTree, SegmentTreeSum, SegmentTreeMin, SegmentTreeMax, LazySegmentTreeSum, } from './collections/index.js';
+export type { WeightedEdge, AdjacencyList, WeightedAdjacencyList, GeneralSegmentTreeConfig, SegmentCombine, SegmentLeafBuild, SegmentMerge, } from './collections/index.js';
 export { sort, find, findIndex, transform, filter, reduce, reverse, unique, binarySearch, lowerBound, upperBound, min, max, partition, DisjointSetUnion, KnuthMorrisPratt, StringRollingHash, RabinKarp, RABIN_KARP_DEFAULT_MODS, breadthFirstSearch, depthFirstSearch, connectedComponents, dijkstra, reconstructPath, kruskalMST, } from './algorithms/index.js';
 export type { WeightedUndirectedEdge, RabinKarpTripleMods } from './algorithms/index.js';
 export { clamp, range, noop, identity, swap } from './utils/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,EACL,MAAM,EACN,KAAK,EACL,KAAK,EACL,IAAI,EACJ,QAAQ,EACR,aAAa,EACb,UAAU,EACV,YAAY,EACZ,UAAU,EACV,YAAY,EACZ,eAAe,EACf,eAAe,EACf,OAAO,EACP,UAAU,EACV,mBAAmB,EACnB,2BAA2B,GAC5B,MAAM,wBAAwB,CAAC;AAChC,YAAY,EAAE,YAAY,EAAE,aAAa,EAAE,qBAAqB,EAAE,MAAM,wBAAwB,CAAC;AACjG,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,EACT,gBAAgB,EAChB,gBAAgB,EAChB,iBAAiB,EACjB,SAAS,EACT,uBAAuB,EACvB,kBAAkB,EAClB,gBAAgB,EAChB,mBAAmB,EACnB,QAAQ,EACR,eAAe,EACf,UAAU,GACX,MAAM,uBAAuB,CAAC;AAC/B,YAAY,EAAE,sBAAsB,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AACzF,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,KAAK,EACL,IAAI,EACJ,QAAQ,EACR,aAAa,EACb,UAAU,EACV,YAAY,EACZ,UAAU,EACV,YAAY,EACZ,eAAe,EACf,eAAe,EACf,OAAO,EACP,UAAU,EACV,mBAAmB,EACnB,2BAA2B,EAC3B,kBAAkB,EAClB,WAAW,EACX,cAAc,EACd,cAAc,EACd,cAAc,EACd,kBAAkB,GACnB,MAAM,wBAAwB,CAAC;AAChC,YAAY,EACV,YAAY,EACZ,aAAa,EACb,qBAAqB,EACrB,wBAAwB,EACxB,cAAc,EACd,gBAAgB,EAChB,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,EACT,gBAAgB,EAChB,gBAAgB,EAChB,iBAAiB,EACjB,SAAS,EACT,uBAAuB,EACvB,kBAAkB,EAClB,gBAAgB,EAChB,mBAAmB,EACnB,QAAQ,EACR,eAAe,EACf,UAAU,GACX,MAAM,uBAAuB,CAAC;AAC/B,YAAY,EAAE,sBAAsB,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AACzF,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, PriorityQueue, OrderedMap, UnorderedMap, OrderedSet, UnorderedSet, OrderedMultiSet, OrderedMultiMap, addEdge, deleteEdge, createAdjacencyList, createWeightedAdjacencyList, } from './collections/index.js';
+export { Vector, Stack, Queue, Deque, List, ListNode, PriorityQueue, OrderedMap, UnorderedMap, OrderedSet, UnorderedSet, OrderedMultiSet, OrderedMultiMap, addEdge, deleteEdge, createAdjacencyList, createWeightedAdjacencyList, GeneralSegmentTree, SegmentTree, SegmentTreeSum, SegmentTreeMin, SegmentTreeMax, LazySegmentTreeSum, } from './collections/index.js';
 export { sort, find, findIndex, transform, filter, reduce, reverse, unique, binarySearch, lowerBound, upperBound, min, max, partition, DisjointSetUnion, KnuthMorrisPratt, StringRollingHash, RabinKarp, RABIN_KARP_DEFAULT_MODS, breadthFirstSearch, depthFirstSearch, connectedComponents, dijkstra, reconstructPath, kruskalMST, } 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,EACL,MAAM,EACN,KAAK,EACL,KAAK,EACL,IAAI,EACJ,QAAQ,EACR,aAAa,EACb,UAAU,EACV,YAAY,EACZ,UAAU,EACV,YAAY,EACZ,eAAe,EACf,eAAe,EACf,OAAO,EACP,UAAU,EACV,mBAAmB,EACnB,2BAA2B,GAC5B,MAAM,wBAAwB,CAAC;AAEhC,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,EACT,gBAAgB,EAChB,gBAAgB,EAChB,iBAAiB,EACjB,SAAS,EACT,uBAAuB,EACvB,kBAAkB,EAClB,gBAAgB,EAChB,mBAAmB,EACnB,QAAQ,EACR,eAAe,EACf,UAAU,GACX,MAAM,uBAAuB,CAAC;AAE/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,KAAK,EACL,IAAI,EACJ,QAAQ,EACR,aAAa,EACb,UAAU,EACV,YAAY,EACZ,UAAU,EACV,YAAY,EACZ,eAAe,EACf,eAAe,EACf,OAAO,EACP,UAAU,EACV,mBAAmB,EACnB,2BAA2B,EAC3B,kBAAkB,EAClB,WAAW,EACX,cAAc,EACd,cAAc,EACd,cAAc,EACd,kBAAkB,GACnB,MAAM,wBAAwB,CAAC;AAUhC,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,EACT,gBAAgB,EAChB,gBAAgB,EAChB,iBAAiB,EACjB,SAAS,EACT,uBAAuB,EACvB,kBAAkB,EAClB,gBAAgB,EAChB,mBAAmB,EACnB,QAAQ,EACR,eAAe,EACf,UAAU,GACX,MAAM,uBAAuB,CAAC;AAE/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,7 +1,7 @@
 {
   "name": "typescript-dsa-stl",
-  "version": "2.4.0",
-  "description": "STL-style data structures and algorithms for TypeScript: Vector, Stack, Queue, List, PriorityQueue, Map, Set, sort, binarySearch, graph utilities. Use like C++ STL.",
+  "version": "2.6.0",
+  "description": "STL-style data structures and algorithms for TypeScript: Vector, Stack, Queue, Deque (double-ended queue), List, PriorityQueue, Map, Set, sort, binarySearch, graph utilities. Use like C++ STL.",
   "type": "module",
   "main": "dist/index.js",
   "module": "dist/index.js",
@@ -52,6 +52,8 @@
     "vector",
     "stack",
     "queue",
+    "deque",
+    "double-ended-queue",
     "list",
     "priority-queue",
     "map",