@libraz/coverwise 1.0.0

package/dist/src/ts/util/bitset.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bitset.d.ts","sourceRoot":"","sources":["../../../../src/ts/util/bitset.ts"],"names":[],"mappings":"AAoBA,qBAAa,aAAa;IACxB,OAAO,CAAC,OAAO,CAAS;IACxB,OAAO,CAAC,MAAM,CAAc;gBAGhB,OAAO,GAAE,MAAU;IAM/B,GAAG,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI;IAKxB,KAAK,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI;IAK1B,IAAI,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;IAK5B,KAAK,IAAI,MAAM;IASf,IAAI,IAAI,MAAM;IAKd,WAAW,CAAC,KAAK,EAAE,aAAa,GAAG,MAAM;IASzC,SAAS,CAAC,KAAK,EAAE,aAAa,GAAG,IAAI;IAOrC,KAAK,IAAI,IAAI;CAGd"}

package/dist/src/ts/util/bitset.js

@@ -0,0 +1,66 @@
+/// @file bitset.ts
+/// @brief Dynamic bitset for coverage tracking using Uint32Array (32-bit blocks).
+const BITS_PER_BLOCK = 32;
+function numBlocks(numBits) {
+    return ((numBits + BITS_PER_BLOCK - 1) / BITS_PER_BLOCK) | 0;
+}
+/// Hamming weight (popcount) for a 32-bit integer.
+function popcount32(x) {
+    x = x - ((x >>> 1) & 0x55555555);
+    x = (x & 0x33333333) + ((x >>> 2) & 0x33333333);
+    x = (x + (x >>> 4)) & 0x0f0f0f0f;
+    return (x * 0x01010101) >>> 24;
+}
+/// A dynamic bitset optimized for coverage tracking.
+///
+/// Uses Uint32Array blocks for efficient bulk operations (AND, OR, popcount).
+export class DynamicBitset {
+    /// Construct a bitset with the given number of bits, all cleared.
+    constructor(numBits = 0) {
+        this.numBits = numBits;
+        this.blocks = new Uint32Array(numBlocks(numBits));
+    }
+    /// Set the bit at the given index.
+    set(index) {
+        this.blocks[index >>> 5] |= (1 << (index & 31)) >>> 0;
+    }
+    /// Clear the bit at the given index.
+    clear(index) {
+        this.blocks[index >>> 5] &= ~((1 << (index & 31)) >>> 0);
+    }
+    /// Test whether the bit at the given index is set.
+    test(index) {
+        return (this.blocks[index >>> 5] & ((1 << (index & 31)) >>> 0)) !== 0;
+    }
+    /// Count the number of set bits.
+    count() {
+        let total = 0;
+        for (let i = 0; i < this.blocks.length; i++) {
+            total += popcount32(this.blocks[i]);
+        }
+        return total;
+    }
+    /// Return the total number of bits.
+    size() {
+        return this.numBits;
+    }
+    /// Count bits set in (this AND NOT other).
+    countAndNot(other) {
+        let total = 0;
+        for (let i = 0; i < this.blocks.length; i++) {
+            total += popcount32((this.blocks[i] & ~other.blocks[i]) >>> 0);
+        }
+        return total;
+    }
+    /// Set all bits from other into this (this |= other).
+    unionWith(other) {
+        for (let i = 0; i < this.blocks.length; i++) {
+            this.blocks[i] |= other.blocks[i];
+        }
+    }
+    /// Clear all bits.
+    reset() {
+        this.blocks.fill(0);
+    }
+}
+//# sourceMappingURL=bitset.js.map

package/dist/src/ts/util/bitset.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bitset.js","sourceRoot":"","sources":["../../../../src/ts/util/bitset.ts"],"names":[],"mappings":"AAAA,mBAAmB;AACnB,kFAAkF;AAElF,MAAM,cAAc,GAAG,EAAE,CAAC;AAE1B,SAAS,SAAS,CAAC,OAAe;IAChC,OAAO,CAAC,CAAC,OAAO,GAAG,cAAc,GAAG,CAAC,CAAC,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC;AAC/D,CAAC;AAED,mDAAmD;AACnD,SAAS,UAAU,CAAC,CAAS;IAC3B,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC;IACjC,CAAC,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC;IAChD,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC;IACjC,OAAO,CAAC,CAAC,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC;AACjC,CAAC;AAED,qDAAqD;AACrD,GAAG;AACH,8EAA8E;AAC9E,MAAM,OAAO,aAAa;IAIxB,kEAAkE;IAClE,YAAY,UAAkB,CAAC;QAC7B,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,MAAM,GAAG,IAAI,WAAW,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC;IACpD,CAAC;IAED,mCAAmC;IACnC,GAAG,CAAC,KAAa;QACf,IAAI,CAAC,MAAM,CAAC,KAAK,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;IACxD,CAAC;IAED,qCAAqC;IACrC,KAAK,CAAC,KAAa;QACjB,IAAI,CAAC,MAAM,CAAC,KAAK,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IAC3D,CAAC;IAED,mDAAmD;IACnD,IAAI,CAAC,KAAa;QAChB,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IACxE,CAAC;IAED,iCAAiC;IACjC,KAAK;QACH,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,KAAK,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QACtC,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,oCAAoC;IACpC,IAAI;QACF,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IAED,2CAA2C;IAC3C,WAAW,CAAC,KAAoB;QAC9B,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,KAAK,IAAI,UAAU,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QACjE,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,sDAAsD;IACtD,SAAS,CAAC,KAAoB;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACpC,CAAC;IACH,CAAC;IAED,mBAAmB;IACnB,KAAK;QACH,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACtB,CAAC;CACF"}

package/dist/src/ts/util/combinatorics.d.ts

@@ -0,0 +1,4 @@
+export declare function generateCombinations(n: number, k: number): number[][];
+export declare function decodeMixedRadix(flatIndex: number, radixes: readonly number[]): number[];
+export declare function encodeMixedRadix(indices: readonly number[], radixes: readonly number[]): number;
+//# sourceMappingURL=combinatorics.d.ts.map

package/dist/src/ts/util/combinatorics.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"combinatorics.d.ts","sourceRoot":"","sources":["../../../../src/ts/util/combinatorics.ts"],"names":[],"mappings":"AAQA,wBAAgB,oBAAoB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,EAAE,CA8BrE;AAOD,wBAAgB,gBAAgB,CAAC,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,MAAM,EAAE,GAAG,MAAM,EAAE,CAQxF;AAOD,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,EAAE,OAAO,EAAE,SAAS,MAAM,EAAE,GAAG,MAAM,CAM/F"}

package/dist/src/ts/util/combinatorics.js

@@ -0,0 +1,60 @@
+/// @file combinatorics.ts
+/// @brief Combinatorial utility functions.
+/// Generate all C(n, k) combinations of indices [0, n).
+///
+/// @param n The total number of elements.
+/// @param k The size of each combination.
+/// @returns Array of sorted index arrays. Empty if k === 0 or k > n.
+export function generateCombinations(n, k) {
+    const result = [];
+    if (k === 0 || k > n) {
+        return result;
+    }
+    const indices = new Array(k);
+    for (let i = 0; i < k; i++) {
+        indices[i] = i;
+    }
+    while (true) {
+        result.push(indices.slice());
+        // Find rightmost index that can be incremented.
+        let pos = k - 1;
+        while (pos >= 0 && indices[pos] === n - k + pos) {
+            pos--;
+        }
+        if (pos < 0) {
+            break;
+        }
+        indices[pos]++;
+        for (let j = pos + 1; j < k; j++) {
+            indices[j] = indices[j - 1] + 1;
+        }
+    }
+    return result;
+}
+/// Decode a flat (mixed-radix) index into per-position value indices.
+///
+/// @param flatIndex The flat index to decode.
+/// @param radixes The radix (number of values) for each position, in order.
+/// @returns Array of decoded indices (same length as radixes).
+export function decodeMixedRadix(flatIndex, radixes) {
+    const out = new Array(radixes.length);
+    let remainder = flatIndex;
+    for (let i = radixes.length - 1; i >= 0; i--) {
+        out[i] = remainder % radixes[i];
+        remainder = (remainder / radixes[i]) | 0;
+    }
+    return out;
+}
+/// Encode per-position value indices into a flat (mixed-radix) index.
+///
+/// @param indices The per-position value indices.
+/// @param radixes The radix (number of values) for each position, in order.
+/// @returns The flat index.
+export function encodeMixedRadix(indices, radixes) {
+    let result = 0;
+    for (let i = 0; i < indices.length; i++) {
+        result = result * radixes[i] + indices[i];
+    }
+    return result;
+}
+//# sourceMappingURL=combinatorics.js.map

package/dist/src/ts/util/combinatorics.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"combinatorics.js","sourceRoot":"","sources":["../../../../src/ts/util/combinatorics.ts"],"names":[],"mappings":"AAAA,0BAA0B;AAC1B,2CAA2C;AAE3C,wDAAwD;AACxD,GAAG;AACH,0CAA0C;AAC1C,0CAA0C;AAC1C,qEAAqE;AACrE,MAAM,UAAU,oBAAoB,CAAC,CAAS,EAAE,CAAS;IACvD,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACrB,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC;IACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACjB,CAAC;IAED,OAAO,IAAI,EAAE,CAAC;QACZ,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC;QAE7B,gDAAgD;QAChD,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;QAChB,OAAO,GAAG,IAAI,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,EAAE,CAAC;YAChD,GAAG,EAAE,CAAC;QACR,CAAC;QACD,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;YACZ,MAAM;QACR,CAAC;QAED,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;QACf,KAAK,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAClC,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,sEAAsE;AACtE,GAAG;AACH,8CAA8C;AAC9C,4EAA4E;AAC5E,+DAA+D;AAC/D,MAAM,UAAU,gBAAgB,CAAC,SAAiB,EAAE,OAA0B;IAC5E,MAAM,GAAG,GAAG,IAAI,KAAK,CAAS,OAAO,CAAC,MAAM,CAAC,CAAC;IAC9C,IAAI,SAAS,GAAG,SAAS,CAAC;IAC1B,KAAK,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7C,GAAG,CAAC,CAAC,CAAC,GAAG,SAAS,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QAChC,SAAS,GAAG,CAAC,SAAS,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC3C,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,sEAAsE;AACtE,GAAG;AACH,kDAAkD;AAClD,4EAA4E;AAC5E,4BAA4B;AAC5B,MAAM,UAAU,gBAAgB,CAAC,OAA0B,EAAE,OAA0B;IACrF,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,MAAM,GAAG,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IAC5C,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/src/ts/util/index.d.ts

@@ -0,0 +1,5 @@
+export { DynamicBitset } from './bitset.js';
+export { decodeMixedRadix, encodeMixedRadix, generateCombinations, } from './combinatorics.js';
+export { Rng } from './rng.js';
+export { isNumeric, toDouble } from './string_util.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/src/ts/util/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/ts/util/index.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAC5C,OAAO,EACL,gBAAgB,EAChB,gBAAgB,EAChB,oBAAoB,GACrB,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EAAE,GAAG,EAAE,MAAM,UAAU,CAAC;AAC/B,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC"}

package/dist/src/ts/util/index.js

@@ -0,0 +1,7 @@
+/// @file index.ts
+/// @brief Re-exports for util module.
+export { DynamicBitset } from './bitset.js';
+export { decodeMixedRadix, encodeMixedRadix, generateCombinations, } from './combinatorics.js';
+export { Rng } from './rng.js';
+export { isNumeric, toDouble } from './string_util.js';
+//# sourceMappingURL=index.js.map

package/dist/src/ts/util/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/ts/util/index.ts"],"names":[],"mappings":"AAAA,kBAAkB;AAClB,sCAAsC;AAEtC,OAAO,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAC5C,OAAO,EACL,gBAAgB,EAChB,gBAAgB,EAChB,oBAAoB,GACrB,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EAAE,GAAG,EAAE,MAAM,UAAU,CAAC;AAC/B,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC"}

package/dist/src/ts/util/rng.d.ts

@@ -0,0 +1,13 @@
+export declare class Rng {
+    private s0;
+    private s1;
+    private s2;
+    private s3;
+    constructor(seed?: number);
+    private next;
+    uniformInt(min: number, max: number): number;
+    nextUint32(max: number): number;
+    weightedRandomIndex(weights: readonly number[]): number;
+    seed(seed: number): void;
+}
+//# sourceMappingURL=rng.d.ts.map

package/dist/src/ts/util/rng.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"rng.d.ts","sourceRoot":"","sources":["../../../../src/ts/util/rng.ts"],"names":[],"mappings":"AAmBA,qBAAa,GAAG;IACd,OAAO,CAAC,EAAE,CAAS;IACnB,OAAO,CAAC,EAAE,CAAS;IACnB,OAAO,CAAC,EAAE,CAAS;IACnB,OAAO,CAAC,EAAE,CAAS;gBAGP,IAAI,GAAE,MAAU;IAa5B,OAAO,CAAC,IAAI;IAsBZ,UAAU,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM;IAiB5C,UAAU,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM;IAW/B,mBAAmB,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,GAAG,MAAM;IAuBvD,IAAI,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI;CAUzB"}

package/dist/src/ts/util/rng.js

@@ -0,0 +1,112 @@
+/// @file rng.ts
+/// @brief Seeded PRNG for deterministic generation using xoshiro128**.
+/// SplitMix32: used to initialize xoshiro128** state from a single seed.
+function splitmix32(seed) {
+    let state = seed >>> 0;
+    return () => {
+        state = (state + 0x9e3779b9) >>> 0;
+        let z = state;
+        z = Math.imul(z ^ (z >>> 16), 0x85ebca6b) >>> 0;
+        z = Math.imul(z ^ (z >>> 13), 0xc2b2ae35) >>> 0;
+        return (z ^ (z >>> 16)) >>> 0;
+    };
+}
+/// Seeded PRNG using xoshiro128** algorithm.
+///
+/// Provides deterministic random number generation: same seed always produces
+/// the same sequence of outputs.
+export class Rng {
+    /// Construct a PRNG with the given seed.
+    constructor(seed = 0) {
+        const init = splitmix32(seed);
+        this.s0 = init();
+        this.s1 = init();
+        this.s2 = init();
+        this.s3 = init();
+        // Ensure state is never all-zero.
+        if ((this.s0 | this.s1 | this.s2 | this.s3) === 0) {
+            this.s0 = 1;
+        }
+    }
+    /// Generate the next raw 32-bit value using xoshiro128**.
+    next() {
+        const result = Math.imul(rotl(Math.imul(this.s1, 5) >>> 0, 7), 9) >>> 0;
+        const t = (this.s1 << 9) >>> 0;
+        this.s2 ^= this.s0;
+        this.s3 ^= this.s1;
+        this.s1 ^= this.s2;
+        this.s0 ^= this.s3;
+        this.s2 ^= t;
+        this.s3 = rotl(this.s3, 11);
+        // Keep all state as unsigned 32-bit.
+        this.s0 >>>= 0;
+        this.s1 >>>= 0;
+        this.s2 >>>= 0;
+        this.s3 >>>= 0;
+        return result;
+    }
+    /// Generate a random integer in [min, max] (inclusive).
+    uniformInt(min, max) {
+        if (min >= max) {
+            return min;
+        }
+        const range = (max - min + 1) >>> 0;
+        // Use rejection sampling to avoid modulo bias.
+        // Standard debiasing: threshold = (2^32 - range) % range = (-range) % range.
+        // Values below threshold map unevenly; reject them.
+        const threshold = ((-range >>> 0) % range) >>> 0;
+        let r;
+        do {
+            r = this.next();
+        } while (r < threshold);
+        return min + (r % range);
+    }
+    /// Generate a random uint32 in [0, max) (exclusive upper bound).
+    nextUint32(max) {
+        if (max <= 0) {
+            return 0;
+        }
+        return this.uniformInt(0, max - 1);
+    }
+    /// Select a random index weighted by the given weights array.
+    ///
+    /// @param weights Array of non-negative weights. At least one must be positive.
+    /// @returns The selected index.
+    weightedRandomIndex(weights) {
+        let totalWeight = 0;
+        for (let i = 0; i < weights.length; i++) {
+            totalWeight += weights[i];
+        }
+        if (totalWeight <= 0) {
+            return this.nextUint32(weights.length);
+        }
+        // Generate a random value in [0, totalWeight).
+        // Use floating-point multiplication for uniform distribution across the range.
+        const threshold = ((this.next() >>> 0) / 0x100000000) * totalWeight;
+        let cumulative = 0;
+        for (let i = 0; i < weights.length; i++) {
+            cumulative += weights[i];
+            if (threshold < cumulative) {
+                return i;
+            }
+        }
+        // Fallback for floating-point edge cases.
+        return weights.length - 1;
+    }
+    /// Reseed the generator.
+    seed(seed) {
+        const init = splitmix32(seed);
+        this.s0 = init();
+        this.s1 = init();
+        this.s2 = init();
+        this.s3 = init();
+        if ((this.s0 | this.s1 | this.s2 | this.s3) === 0) {
+            this.s0 = 1;
+        }
+    }
+}
+/// 32-bit left rotation.
+function rotl(x, k) {
+    return ((x << k) | (x >>> (32 - k))) >>> 0;
+}
+//# sourceMappingURL=rng.js.map

package/dist/src/ts/util/rng.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rng.js","sourceRoot":"","sources":["../../../../src/ts/util/rng.ts"],"names":[],"mappings":"AAAA,gBAAgB;AAChB,uEAAuE;AAEvE,yEAAyE;AACzE,SAAS,UAAU,CAAC,IAAY;IAC9B,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC,CAAC;IACvB,OAAO,GAAW,EAAE;QAClB,KAAK,GAAG,CAAC,KAAK,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,CAAC,GAAG,KAAK,CAAC;QACd,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,UAAU,CAAC,KAAK,CAAC,CAAC;QAChD,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,UAAU,CAAC,KAAK,CAAC,CAAC;QAChD,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;IAChC,CAAC,CAAC;AACJ,CAAC;AAED,6CAA6C;AAC7C,GAAG;AACH,8EAA8E;AAC9E,iCAAiC;AACjC,MAAM,OAAO,GAAG;IAMd,yCAAyC;IACzC,YAAY,OAAe,CAAC;QAC1B,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;QAC9B,IAAI,CAAC,EAAE,GAAG,IAAI,EAAE,CAAC;QACjB,IAAI,CAAC,EAAE,GAAG,IAAI,EAAE,CAAC;QACjB,IAAI,CAAC,EAAE,GAAG,IAAI,EAAE,CAAC;QACjB,IAAI,CAAC,EAAE,GAAG,IAAI,EAAE,CAAC;QACjB,kCAAkC;QAClC,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;YAClD,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;QACd,CAAC;IACH,CAAC;IAED,0DAA0D;IAClD,IAAI;QACV,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;QACxE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC;QAE/B,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;QACnB,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;QACnB,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;QACnB,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;QAEnB,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;QACb,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAE5B,qCAAqC;QACrC,IAAI,CAAC,EAAE,MAAM,CAAC,CAAC;QACf,IAAI,CAAC,EAAE,MAAM,CAAC,CAAC;QACf,IAAI,CAAC,EAAE,MAAM,CAAC,CAAC;QACf,IAAI,CAAC,EAAE,MAAM,CAAC,CAAC;QAEf,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,wDAAwD;IACxD,UAAU,CAAC,GAAW,EAAE,GAAW;QACjC,IAAI,GAAG,IAAI,GAAG,EAAE,CAAC;YACf,OAAO,GAAG,CAAC;QACb,CAAC;QACD,MAAM,KAAK,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QACpC,+CAA+C;QAC/C,6EAA6E;QAC7E,oDAAoD;QACpD,MAAM,SAAS,GAAG,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;QACjD,IAAI,CAAS,CAAC;QACd,GAAG,CAAC;YACF,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,CAAC,QAAQ,CAAC,GAAG,SAAS,EAAE;QACxB,OAAO,GAAG,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;IAC3B,CAAC;IAED,iEAAiE;IACjE,UAAU,CAAC,GAAW;QACpB,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC;YACb,OAAO,CAAC,CAAC;QACX,CAAC;QACD,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;IACrC,CAAC;IAED,8DAA8D;IAC9D,GAAG;IACH,gFAAgF;IAChF,gCAAgC;IAChC,mBAAmB,CAAC,OAA0B;QAC5C,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,WAAW,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC;QAC5B,CAAC;QACD,IAAI,WAAW,IAAI,CAAC,EAAE,CAAC;YACrB,OAAO,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QACzC,CAAC;QACD,+CAA+C;QAC/C,+EAA+E;QAC/E,MAAM,SAAS,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,GAAG,WAAW,CAAC,GAAG,WAAW,CAAC;QACpE,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,UAAU,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,SAAS,GAAG,UAAU,EAAE,CAAC;gBAC3B,OAAO,CAAC,CAAC;YACX,CAAC;QACH,CAAC;QACD,0CAA0C;QAC1C,OAAO,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;IAC5B,CAAC;IAED,yBAAyB;IACzB,IAAI,CAAC,IAAY;QACf,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;QAC9B,IAAI,CAAC,EAAE,GAAG,IAAI,EAAE,CAAC;QACjB,IAAI,CAAC,EAAE,GAAG,IAAI,EAAE,CAAC;QACjB,IAAI,CAAC,EAAE,GAAG,IAAI,EAAE,CAAC;QACjB,IAAI,CAAC,EAAE,GAAG,IAAI,EAAE,CAAC;QACjB,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;YAClD,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;QACd,CAAC;IACH,CAAC;CACF;AAED,yBAAyB;AACzB,SAAS,IAAI,CAAC,CAAS,EAAE,CAAS;IAChC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;AAC7C,CAAC"}

package/dist/src/ts/util/string_util.d.ts

@@ -0,0 +1,3 @@
+export declare function isNumeric(s: string): boolean;
+export declare function toDouble(s: string): number;
+//# sourceMappingURL=string_util.d.ts.map

package/dist/src/ts/util/string_util.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"string_util.d.ts","sourceRoot":"","sources":["../../../../src/ts/util/string_util.ts"],"names":[],"mappings":"AAQA,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO,CAU5C;AAKD,wBAAgB,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAE1C"}

package/dist/src/ts/util/string_util.js

@@ -0,0 +1,25 @@
+/// @file string_util.ts
+/// @brief General-purpose string conversion utilities.
+/// Check if a string can be parsed as a finite number.
+///
+/// Matches the behavior of the C++ version: the entire string must be a valid
+/// numeric representation (no leading/trailing whitespace beyond what Number()
+/// accepts, no empty strings, no non-finite values).
+export function isNumeric(s) {
+    if (s.length === 0) {
+        return false;
+    }
+    // Reject strings that are only whitespace or contain non-numeric content.
+    if (s.trim().length === 0) {
+        return false;
+    }
+    const n = Number(s);
+    return Number.isFinite(n);
+}
+/// Parse a string as a number (double-precision float).
+///
+/// Assumes the caller has verified the string is numeric via isNumeric().
+export function toDouble(s) {
+    return Number(s);
+}
+//# sourceMappingURL=string_util.js.map

package/dist/src/ts/util/string_util.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"string_util.js","sourceRoot":"","sources":["../../../../src/ts/util/string_util.ts"],"names":[],"mappings":"AAAA,wBAAwB;AACxB,uDAAuD;AAEvD,uDAAuD;AACvD,GAAG;AACH,8EAA8E;AAC9E,+EAA+E;AAC/E,qDAAqD;AACrD,MAAM,UAAU,SAAS,CAAC,CAAS;IACjC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACnB,OAAO,KAAK,CAAC;IACf,CAAC;IACD,0EAA0E;IAC1E,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1B,OAAO,KAAK,CAAC;IACf,CAAC;IACD,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACpB,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;AAC5B,CAAC;AAED,wDAAwD;AACxD,GAAG;AACH,0EAA0E;AAC1E,MAAM,UAAU,QAAQ,CAAC,CAAS;IAChC,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC;AACnB,CAAC"}

package/dist/src/ts/validator/constraint-validator.d.ts

@@ -0,0 +1,34 @@
+import type { ConstraintNode } from '../model/constraint-ast.js';
+import type { TestCase } from '../model/test-case.js';
+/** A single constraint violation record. */
+export interface ConstraintViolation {
+    /** Index of the violating test case. */
+    testIndex: number;
+    /** Index of the violated constraint. */
+    constraintIndex: number;
+    /** Human-readable description. */
+    description: string;
+}
+/** Constraint validation report. */
+export interface ConstraintReport {
+    totalTests: number;
+    violations: number;
+    violatingIndices: number[];
+}
+/**
+ * Validate that all test cases satisfy all constraints.
+ *
+ * Evaluates each constraint against each test case. A test case violates
+ * a constraint if the constraint evaluates to False (fully assigned).
+ * @returns Array of constraint violations (empty if all tests pass).
+ */
+export declare function validateConstraints(tests: TestCase[], constraints: ConstraintNode[]): ConstraintViolation[];
+/**
+ * Validate constraints and return a summary report.
+ *
+ * Unlike validateConstraints which returns per-violation details, this function
+ * returns an aggregate report matching the C++ ConstraintReport structure.
+ * A test case is counted as violating at most once (on first violated constraint).
+ */
+export declare function validateConstraintReport(tests: TestCase[], constraints: ConstraintNode[]): ConstraintReport;
+//# sourceMappingURL=constraint-validator.d.ts.map

package/dist/src/ts/validator/constraint-validator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"constraint-validator.d.ts","sourceRoot":"","sources":["../../../../src/ts/validator/constraint-validator.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,4BAA4B,CAAC;AAEjE,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AAEtD,4CAA4C;AAC5C,MAAM,WAAW,mBAAmB;IAClC,wCAAwC;IACxC,SAAS,EAAE,MAAM,CAAC;IAClB,wCAAwC;IACxC,eAAe,EAAE,MAAM,CAAC;IACxB,kCAAkC;IAClC,WAAW,EAAE,MAAM,CAAC;CACrB;AAED,oCAAoC;AACpC,MAAM,WAAW,gBAAgB;IAC/B,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,gBAAgB,EAAE,MAAM,EAAE,CAAC;CAC5B;AAED;;;;;;GAMG;AACH,wBAAgB,mBAAmB,CACjC,KAAK,EAAE,QAAQ,EAAE,EACjB,WAAW,EAAE,cAAc,EAAE,GAC5B,mBAAmB,EAAE,CAiBvB;AAED;;;;;;GAMG;AACH,wBAAgB,wBAAwB,CACtC,KAAK,EAAE,QAAQ,EAAE,EACjB,WAAW,EAAE,cAAc,EAAE,GAC5B,gBAAgB,CAmBlB"}

package/dist/src/ts/validator/constraint-validator.js

@@ -0,0 +1,51 @@
+/// Validate that generated test cases satisfy all constraints.
+import { ConstraintResult as CR } from '../model/constraint-ast.js';
+/**
+ * Validate that all test cases satisfy all constraints.
+ *
+ * Evaluates each constraint against each test case. A test case violates
+ * a constraint if the constraint evaluates to False (fully assigned).
+ * @returns Array of constraint violations (empty if all tests pass).
+ */
+export function validateConstraints(tests, constraints) {
+    const violations = [];
+    for (let i = 0; i < tests.length; ++i) {
+        for (let j = 0; j < constraints.length; ++j) {
+            const result = constraints[j].evaluate(tests[i].values);
+            if (result === CR.False) {
+                violations.push({
+                    testIndex: i,
+                    constraintIndex: j,
+                    description: `Test case ${i} violates constraint ${j}`,
+                });
+            }
+        }
+    }
+    return violations;
+}
+/**
+ * Validate constraints and return a summary report.
+ *
+ * Unlike validateConstraints which returns per-violation details, this function
+ * returns an aggregate report matching the C++ ConstraintReport structure.
+ * A test case is counted as violating at most once (on first violated constraint).
+ */
+export function validateConstraintReport(tests, constraints) {
+    const report = {
+        totalTests: tests.length,
+        violations: 0,
+        violatingIndices: [],
+    };
+    for (let i = 0; i < tests.length; ++i) {
+        for (const constraint of constraints) {
+            const result = constraint.evaluate(tests[i].values);
+            if (result === CR.False) {
+                report.violations++;
+                report.violatingIndices.push(i);
+                break;
+            }
+        }
+    }
+    return report;
+}
+//# sourceMappingURL=constraint-validator.js.map

package/dist/src/ts/validator/constraint-validator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"constraint-validator.js","sourceRoot":"","sources":["../../../../src/ts/validator/constraint-validator.ts"],"names":[],"mappings":"AAAA,+DAA+D;AAG/D,OAAO,EAAE,gBAAgB,IAAI,EAAE,EAAE,MAAM,4BAA4B,CAAC;AAoBpE;;;;;;GAMG;AACH,MAAM,UAAU,mBAAmB,CACjC,KAAiB,EACjB,WAA6B;IAE7B,MAAM,UAAU,GAA0B,EAAE,CAAC;IAE7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC;QACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC;YAC5C,MAAM,MAAM,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YACxD,IAAI,MAAM,KAAK,EAAE,CAAC,KAAK,EAAE,CAAC;gBACxB,UAAU,CAAC,IAAI,CAAC;oBACd,SAAS,EAAE,CAAC;oBACZ,eAAe,EAAE,CAAC;oBAClB,WAAW,EAAE,aAAa,CAAC,wBAAwB,CAAC,EAAE;iBACvD,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,UAAU,CAAC;AACpB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,wBAAwB,CACtC,KAAiB,EACjB,WAA6B;IAE7B,MAAM,MAAM,GAAqB;QAC/B,UAAU,EAAE,KAAK,CAAC,MAAM;QACxB,UAAU,EAAE,CAAC;QACb,gBAAgB,EAAE,EAAE;KACrB,CAAC;IAEF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC;QACtC,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;YACrC,MAAM,MAAM,GAAG,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YACpD,IAAI,MAAM,KAAK,EAAE,CAAC,KAAK,EAAE,CAAC;gBACxB,MAAM,CAAC,UAAU,EAAE,CAAC;gBACpB,MAAM,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAChC,MAAM;YACR,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/src/ts/validator/coverage-validator.d.ts

@@ -0,0 +1,42 @@
+import type { Parameter } from '../model/parameter.js';
+import type { GenerateResult, TestCase, UncoveredTuple } from '../model/test-case.js';
+/** Coverage validation report with human-readable uncovered tuples. */
+export interface CoverageReport {
+    totalTuples: number;
+    coveredTuples: number;
+    coverageRatio: number;
+    uncovered: UncoveredTuple[];
+}
+/** Equivalence class coverage report. */
+export interface ClassCoverageReport {
+    totalClassTuples: number;
+    coveredClassTuples: number;
+    coverageRatio: number;
+}
+/**
+ * Independently validate t-wise coverage of a test suite.
+ *
+ * This validator enumerates all t-tuples from scratch (not using any
+ * generator internals) and checks each against the test suite.
+ */
+export declare function validateCoverage(params: Parameter[], tests: TestCase[], strength: number): CoverageReport;
+/**
+ * Compute equivalence class coverage for a test suite.
+ *
+ * Maps each value to its equivalence class and enumerates all t-wise class
+ * tuples, counting how many are covered by the test suite.
+ * Only considers parameters that have equivalence classes defined.
+ * @returns Class coverage report. If no parameters have classes, returns all zeros.
+ */
+export declare function computeClassCoverage(params: Parameter[], tests: TestCase[], strength: number): ClassCoverageReport;
+/**
+ * Annotate a GenerateResult with equivalence class coverage if applicable.
+ *
+ * Checks whether any parameter has equivalence classes defined. If so,
+ * computes class coverage and sets the classCoverage field on the result.
+ * @param result The generate result to annotate (modified in place).
+ * @param params The parameter definitions (with equivalence classes).
+ * @param strength The coverage strength used for generation.
+ */
+export declare function annotateClassCoverage(result: GenerateResult, params: Parameter[], strength: number): void;
+//# sourceMappingURL=coverage-validator.d.ts.map

package/dist/src/ts/validator/coverage-validator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"coverage-validator.d.ts","sourceRoot":"","sources":["../../../../src/ts/validator/coverage-validator.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AACvD,OAAO,KAAK,EAAE,cAAc,EAAE,QAAQ,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AAEtF,uEAAuE;AACvE,MAAM,WAAW,cAAc;IAC7B,WAAW,EAAE,MAAM,CAAC;IACpB,aAAa,EAAE,MAAM,CAAC;IACtB,aAAa,EAAE,MAAM,CAAC;IACtB,SAAS,EAAE,cAAc,EAAE,CAAC;CAC7B;AAED,yCAAyC;AACzC,MAAM,WAAW,mBAAmB;IAClC,gBAAgB,EAAE,MAAM,CAAC;IACzB,kBAAkB,EAAE,MAAM,CAAC;IAC3B,aAAa,EAAE,MAAM,CAAC;CACvB;AA0CD;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAC9B,MAAM,EAAE,SAAS,EAAE,EACnB,KAAK,EAAE,QAAQ,EAAE,EACjB,QAAQ,EAAE,MAAM,GACf,cAAc,CA8EhB;AAED;;;;;;;GAOG;AACH,wBAAgB,oBAAoB,CAClC,MAAM,EAAE,SAAS,EAAE,EACnB,KAAK,EAAE,QAAQ,EAAE,EACjB,QAAQ,EAAE,MAAM,GACf,mBAAmB,CA8FrB;AAED;;;;;;;;GAQG;AACH,wBAAgB,qBAAqB,CACnC,MAAM,EAAE,cAAc,EACtB,MAAM,EAAE,SAAS,EAAE,EACnB,QAAQ,EAAE,MAAM,GACf,IAAI,CAkBN"}