typescript-dsa-stl 2.1.0 → 2.2.0

package/dist/algorithms/index.d.ts

@@ -1,5 +1,9 @@
 export { sort, find, findIndex, transform, filter, reduce, reverse, unique, binarySearch, lowerBound, upperBound, min, max, partition, } from './array.js';
 export { DisjointSetUnion } from './disjointSetUnion.js';
+export { KnuthMorrisPratt } from './kmp.js';
+export { StringRollingHash } from './stringHashing.js';
+export { RabinKarp, RABIN_KARP_DEFAULT_MODS } from './rabinKarp.js';
+export type { RabinKarpTripleMods } from './rabinKarp.js';
 export type { WeightedUndirectedEdge } from './graph.js';
 export { connectedComponents, kruskalMST } from './graph.js';
 //# sourceMappingURL=index.d.ts.map

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

@@ -1 +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;AAEpB,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AACzD,YAAY,EAAE,sBAAsB,EAAE,MAAM,YAAY,CAAC;AACzD,OAAO,EAAE,mBAAmB,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC"}
+{"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;AAEpB,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AACzD,OAAO,EAAE,gBAAgB,EAAE,MAAM,UAAU,CAAC;AAC5C,OAAO,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AACvD,OAAO,EAAE,SAAS,EAAE,uBAAuB,EAAE,MAAM,gBAAgB,CAAC;AACpE,YAAY,EAAE,mBAAmB,EAAE,MAAM,gBAAgB,CAAC;AAC1D,YAAY,EAAE,sBAAsB,EAAE,MAAM,YAAY,CAAC;AACzD,OAAO,EAAE,mBAAmB,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC"}

package/dist/algorithms/index.js

@@ -1,4 +1,7 @@
 export { sort, find, findIndex, transform, filter, reduce, reverse, unique, binarySearch, lowerBound, upperBound, min, max, partition, } from './array.js';
 export { DisjointSetUnion } from './disjointSetUnion.js';
+export { KnuthMorrisPratt } from './kmp.js';
+export { StringRollingHash } from './stringHashing.js';
+export { RabinKarp, RABIN_KARP_DEFAULT_MODS } from './rabinKarp.js';
 export { connectedComponents, kruskalMST } from './graph.js';
 //# sourceMappingURL=index.js.map

package/dist/algorithms/index.js.map

@@ -1 +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;AAEpB,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AAEzD,OAAO,EAAE,mBAAmB,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC"}
+{"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;AAEpB,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AACzD,OAAO,EAAE,gBAAgB,EAAE,MAAM,UAAU,CAAC;AAC5C,OAAO,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AACvD,OAAO,EAAE,SAAS,EAAE,uBAAuB,EAAE,MAAM,gBAAgB,CAAC;AAGpE,OAAO,EAAE,mBAAmB,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC"}

package/dist/algorithms/kmp.d.ts

@@ -0,0 +1,20 @@
+/**
+ * Knuth–Morris–Pratt (KMP) string matching.
+ * Precomputes the LPS (longest proper prefix which is also suffix) table for the pattern,
+ * then scans text in O(n + m) time.
+ */
+export declare class KnuthMorrisPratt {
+    private readonly pattern;
+    private readonly lps;
+    constructor(pattern: string);
+    /** LPS array: lps[i] = length of longest proper prefix of pattern[0..i] that is also a suffix. */
+    static buildLps(pattern: string): number[];
+    /**
+     * All start indices in `text` where `this.pattern` occurs.
+     * Empty pattern yields no matches.
+     */
+    search(text: string): number[];
+    /** One-shot: all occurrences of `pattern` in `text`. */
+    static findOccurrences(text: string, pattern: string): number[];
+}
+//# sourceMappingURL=kmp.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"kmp.d.ts","sourceRoot":"","sources":["../../src/algorithms/kmp.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,qBAAa,gBAAgB;IAC3B,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAS;IACjC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAW;gBAEnB,OAAO,EAAE,MAAM;IAK3B,kGAAkG;IAClG,MAAM,CAAC,QAAQ,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE;IAoB1C;;;OAGG;IACH,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE;IA8B9B,wDAAwD;IACxD,MAAM,CAAC,eAAe,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE;CAGhE"}

package/dist/algorithms/kmp.js

@@ -0,0 +1,70 @@
+/**
+ * Knuth–Morris–Pratt (KMP) string matching.
+ * Precomputes the LPS (longest proper prefix which is also suffix) table for the pattern,
+ * then scans text in O(n + m) time.
+ */
+export class KnuthMorrisPratt {
+    constructor(pattern) {
+        this.pattern = pattern;
+        this.lps = KnuthMorrisPratt.buildLps(pattern);
+    }
+    /** LPS array: lps[i] = length of longest proper prefix of pattern[0..i] that is also a suffix. */
+    static buildLps(pattern) {
+        const m = pattern.length;
+        const lps = new Array(m).fill(0);
+        let len = 0;
+        let i = 1;
+        while (i < m) {
+            if (pattern[i] === pattern[len]) {
+                len++;
+                lps[i] = len;
+                i++;
+            }
+            else if (len !== 0) {
+                len = lps[len - 1];
+            }
+            else {
+                lps[i] = 0;
+                i++;
+            }
+        }
+        return lps;
+    }
+    /**
+     * All start indices in `text` where `this.pattern` occurs.
+     * Empty pattern yields no matches.
+     */
+    search(text) {
+        const m = this.pattern.length;
+        if (m === 0)
+            return [];
+        const n = text.length;
+        const matches = [];
+        let i = 0;
+        let j = 0;
+        while (i < n) {
+            if (text[i] === this.pattern[j]) {
+                i++;
+                j++;
+            }
+            if (j === m) {
+                matches.push(i - j);
+                j = this.lps[j - 1];
+            }
+            else if (i < n && text[i] !== this.pattern[j]) {
+                if (j !== 0) {
+                    j = this.lps[j - 1];
+                }
+                else {
+                    i++;
+                }
+            }
+        }
+        return matches;
+    }
+    /** One-shot: all occurrences of `pattern` in `text`. */
+    static findOccurrences(text, pattern) {
+        return new KnuthMorrisPratt(pattern).search(text);
+    }
+}
+//# sourceMappingURL=kmp.js.map

package/dist/algorithms/kmp.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"kmp.js","sourceRoot":"","sources":["../../src/algorithms/kmp.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,MAAM,OAAO,gBAAgB;IAI3B,YAAY,OAAe;QACzB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,GAAG,GAAG,gBAAgB,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;IAChD,CAAC;IAED,kGAAkG;IAClG,MAAM,CAAC,QAAQ,CAAC,OAAe;QAC7B,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;QACzB,MAAM,GAAG,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzC,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACb,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;gBAChC,GAAG,EAAE,CAAC;gBACN,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;gBACb,CAAC,EAAE,CAAC;YACN,CAAC;iBAAM,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC;gBACrB,GAAG,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAE,CAAC;YACtB,CAAC;iBAAM,CAAC;gBACN,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBACX,CAAC,EAAE,CAAC;YACN,CAAC;QACH,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,IAAY;QACjB,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;QAC9B,IAAI,CAAC,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAEvB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,CAAC,GAAG,CAAC,CAAC;QAEV,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACb,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;gBAChC,CAAC,EAAE,CAAC;gBACJ,CAAC,EAAE,CAAC;YACN,CAAC;YAED,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACZ,OAAO,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACpB,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC;YACvB,CAAC;iBAAM,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;gBAChD,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;oBACZ,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC;gBACvB,CAAC;qBAAM,CAAC;oBACN,CAAC,EAAE,CAAC;gBACN,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,wDAAwD;IACxD,MAAM,CAAC,eAAe,CAAC,IAAY,EAAE,OAAe;QAClD,OAAO,IAAI,gBAAgB,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACpD,CAAC;CACF"}

package/dist/algorithms/rabinKarp.d.ts

@@ -0,0 +1,35 @@
+/**
+ * Rabin–Karp string matching with **triple hashing**: three independent polynomial hashes
+ * (same base, distinct prime moduli). A window is a candidate only when all three hashes
+ * match the pattern’s triple—collision probability is negligible; we still verify with a
+ * direct character comparison so results are always correct.
+ */
+/** Default moduli: distinct large primes (common CP / hashing choices). */
+export declare const RABIN_KARP_DEFAULT_MODS: readonly [1000000007n, 1000000009n, 998244353n];
+export type RabinKarpTripleMods = readonly [bigint, bigint, bigint];
+export declare class RabinKarp {
+    private readonly pattern;
+    private readonly base;
+    private readonly mods;
+    /**
+     * @param pattern Pattern to search for (UTF-16 code units, same as `charCodeAt`).
+     * @param base Shared radix (default 131), same idea as `StringRollingHash`.
+     * @param mods Three distinct prime moduli for independent rolling hashes.
+     */
+    constructor(pattern: string, base?: bigint, mods?: RabinKarpTripleMods);
+    private static substringsEqual;
+    /** Iterative hash of `s[0..length)` for each modulus. */
+    private hashPrefix;
+    /** `base^(m-1) mod mods[j]` for sliding the left character out of the window. */
+    private powHighForWindow;
+    private slideWindow;
+    private triplesEqual;
+    /**
+     * All start indices in `text` where `this.pattern` occurs.
+     * Empty pattern yields no matches.
+     */
+    search(text: string): number[];
+    /** One-shot: all occurrences of `pattern` in `text`. */
+    static findOccurrences(text: string, pattern: string, base?: bigint, mods?: RabinKarpTripleMods): number[];
+}
+//# sourceMappingURL=rabinKarp.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"rabinKarp.d.ts","sourceRoot":"","sources":["../../src/algorithms/rabinKarp.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAQH,2EAA2E;AAC3E,eAAO,MAAM,uBAAuB,iDAI1B,CAAC;AAEX,MAAM,MAAM,mBAAmB,GAAG,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;AAEpE,qBAAa,SAAS;IACpB,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAS;IACjC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAS;IAC9B,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAsB;IAE3C;;;;OAIG;gBAED,OAAO,EAAE,MAAM,EACf,IAAI,SAAO,EACX,IAAI,GAAE,mBAA6C;IAerD,OAAO,CAAC,MAAM,CAAC,eAAe;IAY9B,yDAAyD;IACzD,OAAO,CAAC,UAAU;IAYlB,iFAAiF;IACjF,OAAO,CAAC,gBAAgB;IAcxB,OAAO,CAAC,WAAW;IAoBnB,OAAO,CAAC,YAAY;IAIpB;;;OAGG;IACH,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE;IA4B9B,wDAAwD;IACxD,MAAM,CAAC,eAAe,CACpB,IAAI,EAAE,MAAM,EACZ,OAAO,EAAE,MAAM,EACf,IAAI,SAAO,EACX,IAAI,GAAE,mBAA6C,GAClD,MAAM,EAAE;CAGZ"}

package/dist/algorithms/rabinKarp.js

@@ -0,0 +1,119 @@
+/**
+ * Rabin–Karp string matching with **triple hashing**: three independent polynomial hashes
+ * (same base, distinct prime moduli). A window is a candidate only when all three hashes
+ * match the pattern’s triple—collision probability is negligible; we still verify with a
+ * direct character comparison so results are always correct.
+ */
+function modNormalize(value, mod) {
+    let x = value % mod;
+    if (x < 0n)
+        x += mod;
+    return x;
+}
+/** Default moduli: distinct large primes (common CP / hashing choices). */
+export const RABIN_KARP_DEFAULT_MODS = [
+    1000000007n,
+    1000000009n,
+    998244353n,
+];
+export class RabinKarp {
+    /**
+     * @param pattern Pattern to search for (UTF-16 code units, same as `charCodeAt`).
+     * @param base Shared radix (default 131), same idea as `StringRollingHash`.
+     * @param mods Three distinct prime moduli for independent rolling hashes.
+     */
+    constructor(pattern, base = 131n, mods = RABIN_KARP_DEFAULT_MODS) {
+        if (base <= 0n) {
+            throw new RangeError('base must be positive');
+        }
+        for (let j = 0; j < 3; j++) {
+            if (mods[j] <= 0n) {
+                throw new RangeError('each mod must be positive');
+            }
+        }
+        this.pattern = pattern;
+        this.base = base;
+        this.mods = mods;
+    }
+    static substringsEqual(text, start, pattern, length) {
+        for (let k = 0; k < length; k++) {
+            if (text[start + k] !== pattern[k])
+                return false;
+        }
+        return true;
+    }
+    /** Iterative hash of `s[0..length)` for each modulus. */
+    hashPrefix(s, length) {
+        const h = [0n, 0n, 0n];
+        const { base, mods } = this;
+        for (let i = 0; i < length; i++) {
+            const c = BigInt(s.charCodeAt(i));
+            for (let j = 0; j < 3; j++) {
+                h[j] = modNormalize(h[j] * base + c, mods[j]);
+            }
+        }
+        return h;
+    }
+    /** `base^(m-1) mod mods[j]` for sliding the left character out of the window. */
+    powHighForWindow(m) {
+        const out = [1n, 1n, 1n];
+        const { base, mods } = this;
+        for (let j = 0; j < 3; j++) {
+            let p = 1n;
+            const mod = mods[j];
+            for (let i = 0; i < m - 1; i++) {
+                p = modNormalize(p * base, mod);
+            }
+            out[j] = p;
+        }
+        return out;
+    }
+    slideWindow(window, left, right, powHigh) {
+        const next = [0n, 0n, 0n];
+        const { base, mods } = this;
+        for (let j = 0; j < 3; j++) {
+            const mod = mods[j];
+            const w = window[j];
+            const ph = powHigh[j];
+            next[j] = modNormalize(modNormalize(w - modNormalize(left * ph, mod), mod) * base + right, mod);
+        }
+        return next;
+    }
+    triplesEqual(a, b) {
+        return a[0] === b[0] && a[1] === b[1] && a[2] === b[2];
+    }
+    /**
+     * All start indices in `text` where `this.pattern` occurs.
+     * Empty pattern yields no matches.
+     */
+    search(text) {
+        const pat = this.pattern;
+        const m = pat.length;
+        const n = text.length;
+        if (m === 0)
+            return [];
+        if (m > n)
+            return [];
+        const patHash = this.hashPrefix(pat, m);
+        let windowHash = this.hashPrefix(text, m);
+        const powHigh = this.powHighForWindow(m);
+        const matches = [];
+        for (let i = 0; i <= n - m; i++) {
+            if (this.triplesEqual(windowHash, patHash) &&
+                RabinKarp.substringsEqual(text, i, pat, m)) {
+                matches.push(i);
+            }
+            if (i + m >= n)
+                break;
+            const left = BigInt(text.charCodeAt(i));
+            const right = BigInt(text.charCodeAt(i + m));
+            windowHash = this.slideWindow(windowHash, left, right, powHigh);
+        }
+        return matches;
+    }
+    /** One-shot: all occurrences of `pattern` in `text`. */
+    static findOccurrences(text, pattern, base = 131n, mods = RABIN_KARP_DEFAULT_MODS) {
+        return new RabinKarp(pattern, base, mods).search(text);
+    }
+}
+//# sourceMappingURL=rabinKarp.js.map

package/dist/algorithms/rabinKarp.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rabinKarp.js","sourceRoot":"","sources":["../../src/algorithms/rabinKarp.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,SAAS,YAAY,CAAC,KAAa,EAAE,GAAW;IAC9C,IAAI,CAAC,GAAG,KAAK,GAAG,GAAG,CAAC;IACpB,IAAI,CAAC,GAAG,EAAE;QAAE,CAAC,IAAI,GAAG,CAAC;IACrB,OAAO,CAAC,CAAC;AACX,CAAC;AAED,2EAA2E;AAC3E,MAAM,CAAC,MAAM,uBAAuB,GAAG;IACrC,WAAc;IACd,WAAc;IACd,UAAY;CACJ,CAAC;AAIX,MAAM,OAAO,SAAS;IAKpB;;;;OAIG;IACH,YACE,OAAe,EACf,IAAI,GAAG,IAAI,EACX,OAA4B,uBAAuB;QAEnD,IAAI,IAAI,IAAI,EAAE,EAAE,CAAC;YACf,MAAM,IAAI,UAAU,CAAC,uBAAuB,CAAC,CAAC;QAChD,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,IAAI,CAAC,CAAC,CAAE,IAAI,EAAE,EAAE,CAAC;gBACnB,MAAM,IAAI,UAAU,CAAC,2BAA2B,CAAC,CAAC;YACpD,CAAC;QACH,CAAC;QACD,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;IAEO,MAAM,CAAC,eAAe,CAC5B,IAAY,EACZ,KAAa,EACb,OAAe,EACf,MAAc;QAEd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;QACnD,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,yDAAyD;IACjD,UAAU,CAAC,CAAS,EAAE,MAAc;QAC1C,MAAM,CAAC,GAA6B,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACjD,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;YAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,CAAC,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,CAAE,GAAG,IAAI,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC;YAClD,CAAC;QACH,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAED,iFAAiF;IACzE,gBAAgB,CAAC,CAAS;QAChC,MAAM,GAAG,GAA6B,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACnD,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,GAAG,EAAE,CAAC;YACX,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAE,CAAC;YACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC/B,CAAC,GAAG,YAAY,CAAC,CAAC,GAAG,IAAI,EAAE,GAAG,CAAC,CAAC;YAClC,CAAC;YACD,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACb,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAEO,WAAW,CACjB,MAA2B,EAC3B,IAAY,EACZ,KAAa,EACb,OAA4B;QAE5B,MAAM,IAAI,GAA6B,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;QACpD,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAE,CAAC;YACrB,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC;YACrB,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,CAAE,CAAC;YACvB,IAAI,CAAC,CAAC,CAAC,GAAG,YAAY,CACpB,YAAY,CAAC,CAAC,GAAG,YAAY,CAAC,IAAI,GAAG,EAAE,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,GAAG,IAAI,GAAG,KAAK,EAClE,GAAG,CACJ,CAAC;QACJ,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,YAAY,CAAC,CAAsB,EAAE,CAAsB;QACjE,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,IAAY;QACjB,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC;QACzB,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC;QACrB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,IAAI,CAAC,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QACvB,IAAI,CAAC,GAAG,CAAC;YAAE,OAAO,EAAE,CAAC;QAErB,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACxC,IAAI,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC1C,MAAM,OAAO,GAAG,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC;QACzC,MAAM,OAAO,GAAa,EAAE,CAAC;QAE7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,IACE,IAAI,CAAC,YAAY,CAAC,UAAU,EAAE,OAAO,CAAC;gBACtC,SAAS,CAAC,eAAe,CAAC,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,EAC1C,CAAC;gBACD,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAClB,CAAC;YACD,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,MAAM;YACtB,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;YACxC,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC7C,UAAU,GAAG,IAAI,CAAC,WAAW,CAAC,UAAU,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;QAClE,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,wDAAwD;IACxD,MAAM,CAAC,eAAe,CACpB,IAAY,EACZ,OAAe,EACf,IAAI,GAAG,IAAI,EACX,OAA4B,uBAAuB;QAEnD,OAAO,IAAI,SAAS,CAAC,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACzD,CAAC;CACF"}

package/dist/algorithms/stringHashing.d.ts

@@ -0,0 +1,27 @@
+/**
+ * Polynomial rolling hash on a string: prefix hashes and powers of base
+ * support O(1) substring hash queries after O(n) preprocessing.
+ */
+export declare class StringRollingHash {
+    private readonly n;
+    private readonly base;
+    private readonly mod;
+    private readonly prefix;
+    private readonly pow;
+    /**
+     * @param s Source string (UTF-16 code units, same as `charCodeAt`).
+     * @param base Must be positive and coprime to `mod` for typical use.
+     * @param mod Prime modulus (e.g. 1_000_000_007n).
+     */
+    constructor(s: string, base?: bigint, mod?: bigint);
+    /** Full string hash (same as substringHash(0, length)). */
+    fullHash(): bigint;
+    /**
+     * Hash of `s.substring(start, start + length)` using the configured base and mod.
+     * Indices are in [0, n); `length` must be non-negative and `start + length <= n`.
+     */
+    substringHash(start: number, length: number): bigint;
+    /** Underlying string length. */
+    length(): number;
+}
+//# sourceMappingURL=stringHashing.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"stringHashing.d.ts","sourceRoot":"","sources":["../../src/algorithms/stringHashing.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAQH,qBAAa,iBAAiB;IAC5B,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAS;IAC3B,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAS;IAC9B,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAS;IAC7B,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAW;IAClC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAW;IAE/B;;;;OAIG;gBACS,CAAC,EAAE,MAAM,EAAE,IAAI,SAAO,EAAE,GAAG,SAAiB;IAqBxD,2DAA2D;IAC3D,QAAQ,IAAI,MAAM;IAIlB;;;OAGG;IACH,aAAa,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM;IAapD,gCAAgC;IAChC,MAAM,IAAI,MAAM;CAGjB"}

package/dist/algorithms/stringHashing.js

@@ -0,0 +1,62 @@
+/**
+ * Polynomial rolling hash on a string: prefix hashes and powers of base
+ * support O(1) substring hash queries after O(n) preprocessing.
+ */
+function modNormalize(value, mod) {
+    let x = value % mod;
+    if (x < 0n)
+        x += mod;
+    return x;
+}
+export class StringRollingHash {
+    /**
+     * @param s Source string (UTF-16 code units, same as `charCodeAt`).
+     * @param base Must be positive and coprime to `mod` for typical use.
+     * @param mod Prime modulus (e.g. 1_000_000_007n).
+     */
+    constructor(s, base = 131n, mod = 1000000007n) {
+        if (mod <= 0n) {
+            throw new RangeError('mod must be positive');
+        }
+        if (base <= 0n) {
+            throw new RangeError('base must be positive');
+        }
+        this.n = s.length;
+        this.base = base;
+        this.mod = mod;
+        this.prefix = new Array(this.n + 1);
+        this.pow = new Array(this.n + 1);
+        this.prefix[0] = 0n;
+        this.pow[0] = 1n;
+        for (let i = 0; i < this.n; i++) {
+            this.pow[i + 1] = modNormalize(this.pow[i] * base, mod);
+            const c = BigInt(s.charCodeAt(i));
+            this.prefix[i + 1] = modNormalize(this.prefix[i] * base + c, mod);
+        }
+    }
+    /** Full string hash (same as substringHash(0, length)). */
+    fullHash() {
+        return this.prefix[this.n];
+    }
+    /**
+     * Hash of `s.substring(start, start + length)` using the configured base and mod.
+     * Indices are in [0, n); `length` must be non-negative and `start + length <= n`.
+     */
+    substringHash(start, length) {
+        if (length < 0) {
+            throw new RangeError('length must be non-negative');
+        }
+        if (start < 0 || start + length > this.n) {
+            throw new RangeError('substring range out of bounds');
+        }
+        const end = start + length;
+        const high = this.prefix[end];
+        const low = modNormalize(this.prefix[start] * this.pow[length], this.mod);
+        return modNormalize(high - low, this.mod);
+    }
+    /** Underlying string length. */
+    length() {
+        return this.n;
+    }
+}
+//# sourceMappingURL=stringHashing.js.map

package/dist/algorithms/stringHashing.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"stringHashing.js","sourceRoot":"","sources":["../../src/algorithms/stringHashing.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,SAAS,YAAY,CAAC,KAAa,EAAE,GAAW;IAC9C,IAAI,CAAC,GAAG,KAAK,GAAG,GAAG,CAAC;IACpB,IAAI,CAAC,GAAG,EAAE;QAAE,CAAC,IAAI,GAAG,CAAC;IACrB,OAAO,CAAC,CAAC;AACX,CAAC;AAED,MAAM,OAAO,iBAAiB;IAO5B;;;;OAIG;IACH,YAAY,CAAS,EAAE,IAAI,GAAG,IAAI,EAAE,GAAG,GAAG,WAAc;QACtD,IAAI,GAAG,IAAI,EAAE,EAAE,CAAC;YACd,MAAM,IAAI,UAAU,CAAC,sBAAsB,CAAC,CAAC;QAC/C,CAAC;QACD,IAAI,IAAI,IAAI,EAAE,EAAE,CAAC;YACf,MAAM,IAAI,UAAU,CAAC,uBAAuB,CAAC,CAAC;QAChD,CAAC;QACD,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;QAClB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,IAAI,CAAC,MAAM,GAAG,IAAI,KAAK,CAAS,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC5C,IAAI,CAAC,GAAG,GAAG,IAAI,KAAK,CAAS,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACzC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;QACpB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;QACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAE,GAAG,IAAI,EAAE,GAAG,CAAC,CAAC;YACzD,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;YAClC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,GAAG,IAAI,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;QACrE,CAAC;IACH,CAAC;IAED,2DAA2D;IAC3D,QAAQ;QACN,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;IAC9B,CAAC;IAED;;;OAGG;IACH,aAAa,CAAC,KAAa,EAAE,MAAc;QACzC,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;YACf,MAAM,IAAI,UAAU,CAAC,6BAA6B,CAAC,CAAC;QACtD,CAAC;QACD,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,MAAM,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC;YACzC,MAAM,IAAI,UAAU,CAAC,+BAA+B,CAAC,CAAC;QACxD,CAAC;QACD,MAAM,GAAG,GAAG,KAAK,GAAG,MAAM,CAAC;QAC3B,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAE,CAAC;QAC/B,MAAM,GAAG,GAAG,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAE,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;QAC5E,OAAO,YAAY,CAAC,IAAI,GAAG,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;IAC5C,CAAC;IAED,gCAAgC;IAChC,MAAM;QACJ,OAAO,IAAI,CAAC,CAAC,CAAC;IAChB,CAAC;CACF"}

package/dist/index.d.ts

@@ -7,8 +7,8 @@
  */
 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 { sort, find, findIndex, transform, filter, reduce, reverse, unique, binarySearch, lowerBound, upperBound, min, max, partition, DisjointSetUnion, connectedComponents, kruskalMST, } from './algorithms/index.js';
-export type { WeightedUndirectedEdge } from './algorithms/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, connectedComponents, kruskalMST, } from './algorithms/index.js';
+export type { WeightedUndirectedEdge, RabinKarpTripleMods } 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';

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,mBAAmB,EACnB,UAAU,GACX,MAAM,uBAAuB,CAAC;AAC/B,YAAY,EAAE,sBAAsB,EAAE,MAAM,uBAAuB,CAAC;AACpE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,kBAAkB,CAAC;AACtE,YAAY,EAAE,UAAU,EAAE,SAAS,EAAE,OAAO,EAAE,OAAO,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAC9F,OAAO,EAAE,OAAO,EAAE,MAAM,kBAAkB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EACL,MAAM,EACN,KAAK,EACL,KAAK,EACL,IAAI,EACJ,QAAQ,EACR,aAAa,EACb,UAAU,EACV,YAAY,EACZ,UAAU,EACV,YAAY,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,mBAAmB,EACnB,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

@@ -6,7 +6,7 @@
  * 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 { sort, find, findIndex, transform, filter, reduce, reverse, unique, binarySearch, lowerBound, upperBound, min, max, partition, DisjointSetUnion, connectedComponents, kruskalMST, } from './algorithms/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, connectedComponents, kruskalMST, } 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

@@ -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,mBAAmB,EACnB,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,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,mBAAmB,EACnB,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,85 +1,85 @@
-{
-  "name": "typescript-dsa-stl",
-  "version": "2.1.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.",
-  "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",
-    "data-structures",
-    "algorithms",
-    "stl",
-    "dsa",
-    "vector",
-    "stack",
-    "queue",
-    "list",
-    "priority-queue",
-    "map",
-    "set",
-    "ordered-map",
-    "unordered-map",
-    "ordered-multimap",
-    "ordered-multiset",
-    "multimap",
-    "multiset",
-    "binary-search",
-    "collections",
-    "sdk"
-  ],
-  "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"
-  }
-}
+{
+  "name": "typescript-dsa-stl",
+  "version": "2.2.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.",
+  "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",
+    "data-structures",
+    "algorithms",
+    "stl",
+    "dsa",
+    "vector",
+    "stack",
+    "queue",
+    "list",
+    "priority-queue",
+    "map",
+    "set",
+    "ordered-map",
+    "unordered-map",
+    "ordered-multimap",
+    "ordered-multiset",
+    "multimap",
+    "multiset",
+    "binary-search",
+    "collections",
+    "sdk"
+  ],
+  "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"
+  }
+}