@libraz/coverwise 1.0.0

package/dist/src/ts/algo/greedy.js

@@ -0,0 +1,137 @@
+/// @file greedy.ts
+/// @brief Constructive greedy algorithm for covering array construction.
+///
+/// Builds test cases parameter-by-parameter, choosing the value that
+/// maximizes coverage gain at each step. This is O(n * max_values)
+/// per test case instead of O(product of values).
+import { ConstraintResult } from '../model/constraint-ast.js';
+import { UNASSIGNED } from '../model/parameter.js';
+/// Break ties among bestValues using weights, then RNG for remaining ties.
+///
+/// Uses weighted random selection: each tied value's probability is proportional
+/// to its weight. This biases toward higher-weighted values while maintaining
+/// enough randomness for the greedy algorithm to explore diverse test cases.
+function breakTieWithWeights(bestValues, weights, pi, rng) {
+    if (bestValues.length === 1) {
+        return bestValues[0];
+    }
+    if (weights.length > 0) {
+        // Weighted random selection: probability proportional to weight.
+        let totalWeight = 0.0;
+        for (const vi of bestValues) {
+            totalWeight += weights[pi][vi];
+        }
+        if (totalWeight > 0.0) {
+            // Generate a random value in [0, totalWeight).
+            const r = (rng.nextUint32(1000000) / 1000000.0) * totalWeight;
+            let cumulative = 0.0;
+            for (const vi of bestValues) {
+                cumulative += weights[pi][vi];
+                if (r < cumulative) {
+                    return vi;
+                }
+            }
+            // Fallback to last value (floating point edge case).
+            return bestValues[bestValues.length - 1];
+        }
+    }
+    // No weights or zero total: random tie-break.
+    const idx = rng.nextUint32(bestValues.length);
+    return bestValues[idx];
+}
+/// Build a test case parameter-by-parameter using greedy value selection.
+///
+/// For each parameter (in shuffled order), evaluate all possible values and pick
+/// the one that would cover the most uncovered tuples. Ties broken by weights then RNG.
+///
+/// Constraints are evaluated at each step using three-valued logic:
+/// - true: continue
+/// - false: skip this value (prune)
+/// - unknown: continue (not all params assigned yet)
+///
+/// @param params Parameter definitions (only .size is used).
+/// @param scoreFn Scoring function that returns the coverage gain for assigning
+///   value vi to parameter pi given the current partial test case.
+/// @param constraints Active constraints (empty if none).
+/// @param rng Random number generator for tie-breaking and parameter ordering.
+/// @param allowedValues Optional per-parameter mask of allowed values.
+///   If non-empty, allowedValues[pi][vi] must be true for value vi of param pi
+///   to be considered. If empty, all values are allowed.
+/// @param weights Optional per-parameter per-value weights for tie-breaking.
+///   If non-empty, weights[pi][vi] is the weight for value vi of param pi.
+export function greedyConstruct(params, scoreFn, constraints, rng, allowedValues = [], weights = []) {
+    const numParams = params.length;
+    const values = new Array(numParams);
+    for (let i = 0; i < numParams; i++) {
+        values[i] = UNASSIGNED;
+    }
+    const tc = { values };
+    // Fisher-Yates shuffle for parameter order.
+    const order = new Array(numParams);
+    for (let i = 0; i < numParams; i++) {
+        order[i] = i;
+    }
+    for (let i = numParams; i > 1; --i) {
+        const j = rng.nextUint32(i);
+        const tmp = order[i - 1];
+        order[i - 1] = order[j];
+        order[j] = tmp;
+    }
+    for (const pi of order) {
+        let bestScore = 0;
+        const bestValues = [];
+        for (let vi = 0; vi < params[pi].size; ++vi) {
+            if (allowedValues.length > 0 && !allowedValues[pi][vi]) {
+                continue;
+            }
+            // Temporarily assign value for constraint evaluation.
+            tc.values[pi] = vi;
+            // Evaluate constraints using three-valued logic.
+            let pruned = false;
+            for (const constraint of constraints) {
+                const result = constraint.evaluate(tc.values);
+                if (result === ConstraintResult.False) {
+                    pruned = true;
+                    break;
+                }
+                // True and Unknown: continue.
+            }
+            // Reset before deciding.
+            tc.values[pi] = UNASSIGNED;
+            if (pruned) {
+                continue;
+            }
+            const score = scoreFn(tc, pi, vi);
+            if (bestValues.length === 0 || score > bestScore) {
+                bestScore = score;
+                bestValues.length = 0;
+                bestValues.push(vi);
+            }
+            else if (score === bestScore) {
+                bestValues.push(vi);
+            }
+        }
+        if (bestValues.length === 0) {
+            // Fallback: pick the first allowed value, or 0 if no mask.
+            if (allowedValues.length > 0) {
+                for (let vi = 0; vi < params[pi].size; ++vi) {
+                    if (allowedValues[pi][vi]) {
+                        tc.values[pi] = vi;
+                        break;
+                    }
+                }
+                if (tc.values[pi] === UNASSIGNED) {
+                    tc.values[pi] = 0;
+                }
+            }
+            else {
+                tc.values[pi] = 0;
+            }
+        }
+        else {
+            tc.values[pi] = breakTieWithWeights(bestValues, weights, pi, rng);
+        }
+    }
+    return tc;
+}
+//# sourceMappingURL=greedy.js.map

package/dist/src/ts/algo/greedy.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"greedy.js","sourceRoot":"","sources":["../../../../src/ts/algo/greedy.ts"],"names":[],"mappings":"AAAA,mBAAmB;AACnB,yEAAyE;AACzE,GAAG;AACH,qEAAqE;AACrE,mEAAmE;AACnE,kDAAkD;AAElD,OAAO,EAAuB,gBAAgB,EAAE,MAAM,4BAA4B,CAAC;AACnF,OAAO,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AAYnD,2EAA2E;AAC3E,GAAG;AACH,iFAAiF;AACjF,8EAA8E;AAC9E,6EAA6E;AAC7E,SAAS,mBAAmB,CAC1B,UAAoB,EACpB,OAAmB,EACnB,EAAU,EACV,GAAQ;IAER,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5B,OAAO,UAAU,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IACD,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACvB,iEAAiE;QACjE,IAAI,WAAW,GAAG,GAAG,CAAC;QACtB,KAAK,MAAM,EAAE,IAAI,UAAU,EAAE,CAAC;YAC5B,WAAW,IAAI,OAAO,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;QACjC,CAAC;QACD,IAAI,WAAW,GAAG,GAAG,EAAE,CAAC;YACtB,+CAA+C;YAC/C,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,UAAU,CAAC,OAAO,CAAC,GAAG,SAAS,CAAC,GAAG,WAAW,CAAC;YAC9D,IAAI,UAAU,GAAG,GAAG,CAAC;YACrB,KAAK,MAAM,EAAE,IAAI,UAAU,EAAE,CAAC;gBAC5B,UAAU,IAAI,OAAO,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;gBAC9B,IAAI,CAAC,GAAG,UAAU,EAAE,CAAC;oBACnB,OAAO,EAAE,CAAC;gBACZ,CAAC;YACH,CAAC;YACD,qDAAqD;YACrD,OAAO,UAAU,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC3C,CAAC;IACH,CAAC;IACD,8CAA8C;IAC9C,MAAM,GAAG,GAAG,GAAG,CAAC,UAAU,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IAC9C,OAAO,UAAU,CAAC,GAAG,CAAC,CAAC;AACzB,CAAC;AAED,0EAA0E;AAC1E,GAAG;AACH,iFAAiF;AACjF,wFAAwF;AACxF,GAAG;AACH,oEAAoE;AACpE,oBAAoB;AACpB,oCAAoC;AACpC,qDAAqD;AACrD,GAAG;AACH,6DAA6D;AAC7D,gFAAgF;AAChF,mEAAmE;AACnE,0DAA0D;AAC1D,+EAA+E;AAC/E,uEAAuE;AACvE,+EAA+E;AAC/E,yDAAyD;AACzD,6EAA6E;AAC7E,2EAA2E;AAC3E,MAAM,UAAU,eAAe,CAC7B,MAA8B,EAC9B,OAAgB,EAChB,WAAsC,EACtC,GAAQ,EACR,gBAA6B,EAAE,EAC/B,UAAsB,EAAE;IAExB,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC;IAEhC,MAAM,MAAM,GAAG,IAAI,KAAK,CAAS,SAAS,CAAC,CAAC;IAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,MAAM,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC;IACzB,CAAC;IACD,MAAM,EAAE,GAAa,EAAE,MAAM,EAAE,CAAC;IAEhC,4CAA4C;IAC5C,MAAM,KAAK,GAAG,IAAI,KAAK,CAAS,SAAS,CAAC,CAAC;IAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACf,CAAC;IACD,KAAK,IAAI,CAAC,GAAG,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;QACnC,MAAM,CAAC,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACzB,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACxB,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;IACjB,CAAC;IAED,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;QACvB,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,MAAM,UAAU,GAAa,EAAE,CAAC;QAEhC,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,CAAC;YAC5C,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;gBACvD,SAAS;YACX,CAAC;YAED,sDAAsD;YACtD,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;YAEnB,iDAAiD;YACjD,IAAI,MAAM,GAAG,KAAK,CAAC;YACnB,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;gBACrC,MAAM,MAAM,GAAG,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;gBAC9C,IAAI,MAAM,KAAK,gBAAgB,CAAC,KAAK,EAAE,CAAC;oBACtC,MAAM,GAAG,IAAI,CAAC;oBACd,MAAM;gBACR,CAAC;gBACD,8BAA8B;YAChC,CAAC;YAED,yBAAyB;YACzB,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC;YAE3B,IAAI,MAAM,EAAE,CAAC;gBACX,SAAS;YACX,CAAC;YAED,MAAM,KAAK,GAAG,OAAO,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;YAClC,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;gBACjD,SAAS,GAAG,KAAK,CAAC;gBAClB,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC;gBACtB,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACtB,CAAC;iBAAM,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBAC/B,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;QAED,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5B,2DAA2D;YAC3D,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC7B,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,CAAC;oBAC5C,IAAI,aAAa,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;wBAC1B,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;wBACnB,MAAM;oBACR,CAAC;gBACH,CAAC;gBACD,IAAI,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,KAAK,UAAU,EAAE,CAAC;oBACjC,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;gBACpB,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;aAAM,CAAC;YACN,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,mBAAmB,CAAC,UAAU,EAAE,OAAO,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC;QACpE,CAAC;IACH,CAAC;IAED,OAAO,EAAE,CAAC;AACZ,CAAC"}

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

@@ -0,0 +1,2 @@
+export { type GreedyParam, greedyConstruct, type ScoreFn } from './greedy.js';
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/ts/algo/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,WAAW,EAAE,eAAe,EAAE,KAAK,OAAO,EAAE,MAAM,aAAa,CAAC"}

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

@@ -0,0 +1,2 @@
+export { greedyConstruct } from './greedy.js';
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/ts/algo/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAoB,eAAe,EAAgB,MAAM,aAAa,CAAC"}

package/dist/src/ts/core/coverage-engine.d.ts

@@ -0,0 +1,40 @@
+import { type ConstraintNode } from '../model/constraint-ast.js';
+import { type ErrorInfo } from '../model/error.js';
+import { type Parameter } from '../model/parameter.js';
+import type { TestCase, UncoveredTuple } from '../model/test-case.js';
+export interface CreateResult {
+    engine: CoverageEngine;
+    error: ErrorInfo;
+}
+export declare class CoverageEngine {
+    static readonly MAX_TUPLES = 16000000;
+    private params_;
+    private strength_;
+    private totalTuples_;
+    private invalidTuples_;
+    private covered_;
+    private paramSubset_;
+    private paramCombinations_;
+    private combinationOffsets_;
+    private paramToCombos_;
+    private paramPositionInCombo_;
+    private comboMultipliers_;
+    private constructor();
+    static create(params: Parameter[], strength: number): CreateResult;
+    static createFromSubset(allParams: Parameter[], paramSubset: number[], strength: number): CreateResult;
+    addTestCase(testCase: TestCase): void;
+    scoreValue(partial: TestCase, paramIndex: number, valueIndex: number): number;
+    scoreCandidate(candidate: TestCase): number;
+    excludeInvalidTuples(constraints: readonly ConstraintNode[]): void;
+    excludeInvalidValues(): void;
+    get totalTuples(): number;
+    get coveredCount(): number;
+    get coverageRatio(): number;
+    get isComplete(): boolean;
+    getUncoveredTuples(params: Parameter[]): UncoveredTuple[];
+    private initCombinations;
+    private initCombinationsFromSubset;
+    private buildLookupTables;
+    private computeTotalTuples;
+}
+//# sourceMappingURL=coverage-engine.d.ts.map

package/dist/src/ts/core/coverage-engine.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"coverage-engine.d.ts","sourceRoot":"","sources":["../../../../src/ts/core/coverage-engine.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,KAAK,cAAc,EAAoB,MAAM,4BAA4B,CAAC;AACnF,OAAO,EAAa,KAAK,SAAS,EAAW,MAAM,mBAAmB,CAAC;AACvE,OAAO,EAAoB,KAAK,SAAS,EAAc,MAAM,uBAAuB,CAAC;AACrF,OAAO,KAAK,EAAE,QAAQ,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AAKtE,MAAM,WAAW,YAAY;IAC3B,MAAM,EAAE,cAAc,CAAC;IACvB,KAAK,EAAE,SAAS,CAAC;CAClB;AAKD,qBAAa,cAAc;IAGzB,MAAM,CAAC,QAAQ,CAAC,UAAU,YAAc;IAExC,OAAO,CAAC,OAAO,CAAmB;IAClC,OAAO,CAAC,SAAS,CAAK;IACtB,OAAO,CAAC,YAAY,CAAK;IACzB,OAAO,CAAC,cAAc,CAAK;IAC3B,OAAO,CAAC,QAAQ,CAAuC;IAIvD,OAAO,CAAC,YAAY,CAAgB;IAIpC,OAAO,CAAC,kBAAkB,CAAkB;IAC5C,OAAO,CAAC,mBAAmB,CAAgB;IAG3C,OAAO,CAAC,cAAc,CAAkB;IAIxC,OAAO,CAAC,qBAAqB,CAAkB;IAG/C,OAAO,CAAC,iBAAiB,CAAkB;IAE3C,OAAO;IAMP,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,EAAE,EAAE,QAAQ,EAAE,MAAM,GAAG,YAAY;IA2BlE,MAAM,CAAC,gBAAgB,CACrB,SAAS,EAAE,SAAS,EAAE,EACtB,WAAW,EAAE,MAAM,EAAE,EACrB,QAAQ,EAAE,MAAM,GACf,YAAY;IAqBf,WAAW,CAAC,QAAQ,EAAE,QAAQ,GAAG,IAAI;IAkBrC,UAAU,CAAC,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GAAG,MAAM;IAuC7E,cAAc,CAAC,SAAS,EAAE,QAAQ,GAAG,MAAM;IAyB3C,oBAAoB,CAAC,WAAW,EAAE,SAAS,cAAc,EAAE,GAAG,IAAI;IA6DlE,oBAAoB,IAAI,IAAI;IA8C5B,IAAI,WAAW,IAAI,MAAM,CAExB;IAGD,IAAI,YAAY,IAAI,MAAM,CAEzB;IAGD,IAAI,aAAa,IAAI,MAAM,CAK1B;IAGD,IAAI,UAAU,IAAI,OAAO,CAExB;IAID,kBAAkB,CAAC,MAAM,EAAE,SAAS,EAAE,GAAG,cAAc,EAAE;IA2CzD,OAAO,CAAC,gBAAgB;IAKxB,OAAO,CAAC,0BAA0B;IAelC,OAAO,CAAC,iBAAiB;IAmCzB,OAAO,CAAC,kBAAkB;CAc3B"}

package/dist/src/ts/core/coverage-engine.js

@@ -0,0 +1,366 @@
+/// @file coverage-engine.ts
+/// @brief Coverage tracking engine for t-wise tuple coverage.
+import { ConstraintResult } from '../model/constraint-ast.js';
+import { ErrorCode, okError } from '../model/error.js';
+import { hasInvalidValues, UNASSIGNED } from '../model/parameter.js';
+import { DynamicBitset } from '../util/bitset.js';
+import { decodeMixedRadix, generateCombinations } from '../util/combinatorics.js';
+/// Tracks which t-wise tuples are covered by the current test suite.
+///
+/// Hard limit on total tuple count to prevent t-wise explosion.
+export class CoverageEngine {
+    constructor() {
+        this.params_ = [];
+        this.strength_ = 0;
+        this.totalTuples_ = 0;
+        this.invalidTuples_ = 0;
+        this.covered_ = new DynamicBitset(0);
+        /// Mapping from local param index to global param index.
+        /// Empty means identity mapping (all params, no subset).
+        this.paramSubset_ = [];
+        /// Pre-computed C(n, t) parameter index combinations.
+        /// When paramSubset_ is set, these contain GLOBAL param indices.
+        this.paramCombinations_ = [];
+        this.combinationOffsets_ = [];
+        /// paramToCombos_[p] = list of combination indices that include param p.
+        this.paramToCombos_ = [];
+        /// paramPositionInCombo_[p][k] = position of p within
+        /// paramCombinations_[paramToCombos_[p][k]].
+        this.paramPositionInCombo_ = [];
+        /// comboMultipliers_[ci][j] = product of value counts for positions j+1..t-1.
+        this.comboMultipliers_ = [];
+    }
+    /// Initialize coverage tracking for the given parameters and strength.
+    /// @param params The parameter definitions.
+    /// @param strength The interaction strength (t). 2 = pairwise.
+    /// @returns Object with engine and error. Check error.code before using engine.
+    static create(params, strength) {
+        const engine = new CoverageEngine();
+        engine.params_ = params.slice();
+        engine.strength_ = strength;
+        engine.initCombinations();
+        engine.totalTuples_ = engine.computeTotalTuples();
+        engine.buildLookupTables();
+        if (engine.totalTuples_ > CoverageEngine.MAX_TUPLES) {
+            return {
+                engine: new CoverageEngine(),
+                error: makeTupleExplosionError(engine.totalTuples_, CoverageEngine.MAX_TUPLES),
+            };
+        }
+        engine.covered_ = new DynamicBitset(engine.totalTuples_);
+        return { engine, error: okError() };
+    }
+    /// Initialize coverage tracking for a subset of parameters.
+    ///
+    /// Only the parameters at the given indices are considered for tuple
+    /// generation. Test cases still use global parameter indices.
+    /// @param allParams All parameter definitions.
+    /// @param paramSubset Indices of parameters to cover (must be sorted).
+    /// @param strength The interaction strength (t).
+    /// @returns Object with engine and error. Check error.code before using engine.
+    static createFromSubset(allParams, paramSubset, strength) {
+        const engine = new CoverageEngine();
+        engine.params_ = allParams.slice();
+        engine.strength_ = strength;
+        engine.paramSubset_ = paramSubset.slice();
+        engine.initCombinationsFromSubset();
+        engine.totalTuples_ = engine.computeTotalTuples();
+        engine.buildLookupTables();
+        if (engine.totalTuples_ > CoverageEngine.MAX_TUPLES) {
+            return {
+                engine: new CoverageEngine(),
+                error: makeTupleExplosionError(engine.totalTuples_, CoverageEngine.MAX_TUPLES),
+            };
+        }
+        engine.covered_ = new DynamicBitset(engine.totalTuples_);
+        return { engine, error: okError() };
+    }
+    /// Mark all tuples covered by the given test case.
+    addTestCase(testCase) {
+        for (let ci = 0; ci < this.paramCombinations_.length; ++ci) {
+            const combo = this.paramCombinations_[ci];
+            const mults = this.comboMultipliers_[ci];
+            let localIndex = 0;
+            for (let j = 0; j < this.strength_; ++j) {
+                localIndex += testCase.values[combo[j]] * mults[j];
+            }
+            this.covered_.set(this.combinationOffsets_[ci] + localIndex);
+        }
+    }
+    /// Score a candidate value for a single parameter position.
+    ///
+    /// Used by constructive greedy: given a partial assignment, how many new
+    /// tuples would be covered by setting paramIndex to valueIndex?
+    scoreValue(partial, paramIndex, valueIndex) {
+        let score = 0;
+        const relevantCombos = this.paramToCombos_[paramIndex];
+        const positions = this.paramPositionInCombo_[paramIndex];
+        const numRelevant = relevantCombos.length;
+        for (let k = 0; k < numRelevant; ++k) {
+            const ci = relevantCombos[k];
+            const pos = positions[k];
+            const combo = this.paramCombinations_[ci];
+            const mults = this.comboMultipliers_[ci];
+            // Check all other params are assigned and compute mixed-radix index.
+            let allAssigned = true;
+            let localIndex = valueIndex * mults[pos];
+            for (let j = 0; j < this.strength_; ++j) {
+                if (j === pos) {
+                    continue;
+                }
+                const v = partial.values[combo[j]];
+                if (v === UNASSIGNED) {
+                    allAssigned = false;
+                    break;
+                }
+                localIndex += v * mults[j];
+            }
+            if (!allAssigned) {
+                continue;
+            }
+            if (!this.covered_.test(this.combinationOffsets_[ci] + localIndex)) {
+                ++score;
+            }
+        }
+        return score;
+    }
+    /// Score a complete candidate test case.
+    scoreCandidate(candidate) {
+        let score = 0;
+        for (let ci = 0; ci < this.paramCombinations_.length; ++ci) {
+            const combo = this.paramCombinations_[ci];
+            const mults = this.comboMultipliers_[ci];
+            let localIndex = 0;
+            for (let j = 0; j < this.strength_; ++j) {
+                localIndex += candidate.values[combo[j]] * mults[j];
+            }
+            if (!this.covered_.test(this.combinationOffsets_[ci] + localIndex)) {
+                ++score;
+            }
+        }
+        return score;
+    }
+    /// Exclude tuples that are invalid due to constraints.
+    ///
+    /// For each t-tuple, builds a partial assignment and evaluates all
+    /// constraints. If any constraint returns False, the tuple is marked
+    /// as covered (excluded) and does not count toward coverage goals.
+    excludeInvalidTuples(constraints) {
+        if (constraints.length === 0) {
+            return;
+        }
+        const numParams = this.params_.length;
+        for (let ci = 0; ci < this.paramCombinations_.length; ++ci) {
+            const combo = this.paramCombinations_[ci];
+            // Compute product for this combination.
+            let product = 1;
+            for (const pi of combo) {
+                product *= this.params_[pi].size;
+            }
+            // Enumerate all value tuples.
+            for (let vi = 0; vi < product; ++vi) {
+                const globalIndex = this.combinationOffsets_[ci] + vi;
+                if (this.covered_.test(globalIndex)) {
+                    continue; // Already marked.
+                }
+                // Decode mixed-radix index into value indices.
+                const radixes = new Array(combo.length);
+                for (let j = 0; j < combo.length; ++j) {
+                    radixes[j] = this.params_[combo[j]].size;
+                }
+                const valueIndices = decodeMixedRadix(vi, radixes);
+                // Build partial assignment with only this tuple's parameters set.
+                const assignment = new Array(numParams);
+                for (let i = 0; i < numParams; i++) {
+                    assignment[i] = UNASSIGNED;
+                }
+                for (let j = 0; j < combo.length; ++j) {
+                    assignment[combo[j]] = valueIndices[j];
+                }
+                // Evaluate all constraints against this partial assignment.
+                let invalid = false;
+                for (const constraint of constraints) {
+                    const result = constraint.evaluate(assignment);
+                    if (result === ConstraintResult.False) {
+                        invalid = true;
+                        break;
+                    }
+                }
+                if (invalid) {
+                    this.covered_.set(globalIndex);
+                    ++this.invalidTuples_;
+                }
+            }
+        }
+    }
+    /// Exclude tuples that contain values marked as invalid in parameters.
+    ///
+    /// Any tuple containing at least one value where Parameter.isInvalid()
+    /// returns true is marked as excluded. Used for positive-only generation.
+    excludeInvalidValues() {
+        if (!hasInvalidValues(this.params_)) {
+            return;
+        }
+        for (let ci = 0; ci < this.paramCombinations_.length; ++ci) {
+            const combo = this.paramCombinations_[ci];
+            // Compute product for this combination.
+            let product = 1;
+            for (const pi of combo) {
+                product *= this.params_[pi].size;
+            }
+            // Enumerate all value tuples.
+            for (let vi = 0; vi < product; ++vi) {
+                const globalIndex = this.combinationOffsets_[ci] + vi;
+                if (this.covered_.test(globalIndex)) {
+                    continue;
+                }
+                // Decode mixed-radix index into value indices.
+                const radixes = new Array(combo.length);
+                for (let j = 0; j < combo.length; ++j) {
+                    radixes[j] = this.params_[combo[j]].size;
+                }
+                const valueIndices = decodeMixedRadix(vi, radixes);
+                // Check if any decoded value is invalid.
+                let containsInvalid = false;
+                for (let j = 0; j < combo.length; ++j) {
+                    if (this.params_[combo[j]].isInvalid(valueIndices[j])) {
+                        containsInvalid = true;
+                        break;
+                    }
+                }
+                if (containsInvalid) {
+                    this.covered_.set(globalIndex);
+                    ++this.invalidTuples_;
+                }
+            }
+        }
+    }
+    /// Return the total number of valid t-wise tuples.
+    get totalTuples() {
+        return this.totalTuples_ - this.invalidTuples_;
+    }
+    /// Return the number of covered valid tuples.
+    get coveredCount() {
+        return this.covered_.count() - this.invalidTuples_;
+    }
+    /// Return coverage ratio [0.0, 1.0].
+    get coverageRatio() {
+        if (this.totalTuples === 0) {
+            return 1.0;
+        }
+        return this.coveredCount / this.totalTuples;
+    }
+    /// Check if all valid tuples are covered.
+    get isComplete() {
+        return this.coveredCount === this.totalTuples;
+    }
+    /// Collect all uncovered tuples as human-readable objects.
+    /// @param params Parameter definitions (for resolving names and values).
+    getUncoveredTuples(params) {
+        const result = [];
+        for (let ci = 0; ci < this.paramCombinations_.length; ++ci) {
+            const combo = this.paramCombinations_[ci];
+            // Compute the number of value tuples for this combination.
+            let product = 1;
+            for (const pi of combo) {
+                product *= params[pi].size;
+            }
+            // Enumerate all value tuples using mixed-radix decoding.
+            for (let vi = 0; vi < product; ++vi) {
+                const globalIndex = this.combinationOffsets_[ci] + vi;
+                if (this.covered_.test(globalIndex)) {
+                    continue;
+                }
+                // Decode the mixed-radix index into value indices.
+                const radixes = new Array(combo.length);
+                for (let j = 0; j < combo.length; ++j) {
+                    radixes[j] = params[combo[j]].size;
+                }
+                const valueIndices = decodeMixedRadix(vi, radixes);
+                const tuple = [];
+                const paramNames = [];
+                for (let j = 0; j < combo.length; ++j) {
+                    const pi = combo[j];
+                    paramNames.push(params[pi].name);
+                    tuple.push(`${params[pi].name}=${params[pi].values[valueIndices[j]]}`);
+                }
+                result.push({ tuple, params: paramNames, reason: 'never covered' });
+            }
+        }
+        return result;
+    }
+    // --- Private methods ---
+    initCombinations() {
+        const n = this.params_.length;
+        this.paramCombinations_ = generateCombinations(n, this.strength_);
+    }
+    initCombinationsFromSubset() {
+        const n = this.paramSubset_.length;
+        const localCombos = generateCombinations(n, this.strength_);
+        // Map local indices to global param indices.
+        this.paramCombinations_ = [];
+        for (const local of localCombos) {
+            const globalCombo = new Array(this.strength_);
+            for (let i = 0; i < this.strength_; ++i) {
+                globalCombo[i] = this.paramSubset_[local[i]];
+            }
+            this.paramCombinations_.push(globalCombo);
+        }
+    }
+    buildLookupTables() {
+        const numParams = this.params_.length;
+        const numCombos = this.paramCombinations_.length;
+        // Build param-to-combinations index and position-in-combo lookup.
+        this.paramToCombos_ = new Array(numParams);
+        this.paramPositionInCombo_ = new Array(numParams);
+        for (let i = 0; i < numParams; i++) {
+            this.paramToCombos_[i] = [];
+            this.paramPositionInCombo_[i] = [];
+        }
+        for (let ci = 0; ci < numCombos; ++ci) {
+            const combo = this.paramCombinations_[ci];
+            for (let j = 0; j < this.strength_; ++j) {
+                const pi = combo[j];
+                this.paramToCombos_[pi].push(ci);
+                this.paramPositionInCombo_[pi].push(j);
+            }
+        }
+        // Build mixed-radix multipliers for each combination.
+        // comboMultipliers_[ci][j] = product of value counts for positions j+1..t-1.
+        this.comboMultipliers_ = new Array(numCombos);
+        for (let ci = 0; ci < numCombos; ++ci) {
+            const combo = this.paramCombinations_[ci];
+            const mults = new Array(this.strength_);
+            mults[this.strength_ - 1] = 1;
+            for (let j = this.strength_ - 2; j >= 0; --j) {
+                mults[j] = mults[j + 1] * this.params_[combo[j + 1]].size;
+            }
+            this.comboMultipliers_[ci] = mults;
+        }
+    }
+    computeTotalTuples() {
+        let total = 0;
+        this.combinationOffsets_ = [];
+        for (const combo of this.paramCombinations_) {
+            this.combinationOffsets_.push(total);
+            let product = 1;
+            for (const pi of combo) {
+                product *= this.params_[pi].size;
+            }
+            total += product;
+        }
+        return total;
+    }
+}
+/// Maximum number of tuples before refusing to proceed.
+/// ~16M tuples. Beyond this, performance degrades.
+CoverageEngine.MAX_TUPLES = 16000000;
+/// Build an error for when tuple count exceeds the safety limit.
+function makeTupleExplosionError(totalTuples, maxTuples) {
+    return {
+        code: ErrorCode.TupleExplosion,
+        message: 't-wise tuple count exceeds safety limit',
+        detail: `Total tuples: ${totalTuples}, limit: ${maxTuples}. Reduce strength or parameter count.`,
+    };
+}
+//# sourceMappingURL=coverage-engine.js.map

package/dist/src/ts/core/coverage-engine.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"coverage-engine.js","sourceRoot":"","sources":["../../../../src/ts/core/coverage-engine.ts"],"names":[],"mappings":"AAAA,4BAA4B;AAC5B,8DAA8D;AAE9D,OAAO,EAAuB,gBAAgB,EAAE,MAAM,4BAA4B,CAAC;AACnF,OAAO,EAAE,SAAS,EAAkB,OAAO,EAAE,MAAM,mBAAmB,CAAC;AACvE,OAAO,EAAE,gBAAgB,EAAkB,UAAU,EAAE,MAAM,uBAAuB,CAAC;AAErF,OAAO,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAClD,OAAO,EAAE,gBAAgB,EAAE,oBAAoB,EAAE,MAAM,0BAA0B,CAAC;AAQlF,qEAAqE;AACrE,GAAG;AACH,gEAAgE;AAChE,MAAM,OAAO,cAAc;IA8BzB;QAzBQ,YAAO,GAAgB,EAAE,CAAC;QAC1B,cAAS,GAAG,CAAC,CAAC;QACd,iBAAY,GAAG,CAAC,CAAC;QACjB,mBAAc,GAAG,CAAC,CAAC;QACnB,aAAQ,GAAkB,IAAI,aAAa,CAAC,CAAC,CAAC,CAAC;QAEvD,yDAAyD;QACzD,yDAAyD;QACjD,iBAAY,GAAa,EAAE,CAAC;QAEpC,sDAAsD;QACtD,iEAAiE;QACzD,uBAAkB,GAAe,EAAE,CAAC;QACpC,wBAAmB,GAAa,EAAE,CAAC;QAE3C,yEAAyE;QACjE,mBAAc,GAAe,EAAE,CAAC;QAExC,sDAAsD;QACtD,6CAA6C;QACrC,0BAAqB,GAAe,EAAE,CAAC;QAE/C,8EAA8E;QACtE,sBAAiB,GAAe,EAAE,CAAC;IAEpB,CAAC;IAExB,uEAAuE;IACvE,4CAA4C;IAC5C,+DAA+D;IAC/D,gFAAgF;IAChF,MAAM,CAAC,MAAM,CAAC,MAAmB,EAAE,QAAgB;QACjD,MAAM,MAAM,GAAG,IAAI,cAAc,EAAE,CAAC;QACpC,MAAM,CAAC,OAAO,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC;QAChC,MAAM,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC5B,MAAM,CAAC,gBAAgB,EAAE,CAAC;QAC1B,MAAM,CAAC,YAAY,GAAG,MAAM,CAAC,kBAAkB,EAAE,CAAC;QAClD,MAAM,CAAC,iBAAiB,EAAE,CAAC;QAE3B,IAAI,MAAM,CAAC,YAAY,GAAG,cAAc,CAAC,UAAU,EAAE,CAAC;YACpD,OAAO;gBACL,MAAM,EAAE,IAAI,cAAc,EAAE;gBAC5B,KAAK,EAAE,uBAAuB,CAAC,MAAM,CAAC,YAAY,EAAE,cAAc,CAAC,UAAU,CAAC;aAC/E,CAAC;QACJ,CAAC;QAED,MAAM,CAAC,QAAQ,GAAG,IAAI,aAAa,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;QACzD,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,CAAC;IACtC,CAAC;IAED,4DAA4D;IAC5D,GAAG;IACH,qEAAqE;IACrE,8DAA8D;IAC9D,+CAA+C;IAC/C,uEAAuE;IACvE,iDAAiD;IACjD,gFAAgF;IAChF,MAAM,CAAC,gBAAgB,CACrB,SAAsB,EACtB,WAAqB,EACrB,QAAgB;QAEhB,MAAM,MAAM,GAAG,IAAI,cAAc,EAAE,CAAC;QACpC,MAAM,CAAC,OAAO,GAAG,SAAS,CAAC,KAAK,EAAE,CAAC;QACnC,MAAM,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC5B,MAAM,CAAC,YAAY,GAAG,WAAW,CAAC,KAAK,EAAE,CAAC;QAC1C,MAAM,CAAC,0BAA0B,EAAE,CAAC;QACpC,MAAM,CAAC,YAAY,GAAG,MAAM,CAAC,kBAAkB,EAAE,CAAC;QAClD,MAAM,CAAC,iBAAiB,EAAE,CAAC;QAE3B,IAAI,MAAM,CAAC,YAAY,GAAG,cAAc,CAAC,UAAU,EAAE,CAAC;YACpD,OAAO;gBACL,MAAM,EAAE,IAAI,cAAc,EAAE;gBAC5B,KAAK,EAAE,uBAAuB,CAAC,MAAM,CAAC,YAAY,EAAE,cAAc,CAAC,UAAU,CAAC;aAC/E,CAAC;QACJ,CAAC;QAED,MAAM,CAAC,QAAQ,GAAG,IAAI,aAAa,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;QACzD,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,CAAC;IACtC,CAAC;IAED,mDAAmD;IACnD,WAAW,CAAC,QAAkB;QAC5B,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC;YAC3D,MAAM,KAAK,GAAG,IAAI,CAAC,kBAAkB,CAAC,EAAE,CAAC,CAAC;YAC1C,MAAM,KAAK,GAAG,IAAI,CAAC,iBAAiB,CAAC,EAAE,CAAC,CAAC;YAEzC,IAAI,UAAU,GAAG,CAAC,CAAC;YACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,CAAC;gBACxC,UAAU,IAAI,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACrD,CAAC;YAED,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,mBAAmB,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,CAAC;QAC/D,CAAC;IACH,CAAC;IAED,4DAA4D;IAC5D,GAAG;IACH,yEAAyE;IACzE,gEAAgE;IAChE,UAAU,CAAC,OAAiB,EAAE,UAAkB,EAAE,UAAkB;QAClE,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,MAAM,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC;QACvD,MAAM,SAAS,GAAG,IAAI,CAAC,qBAAqB,CAAC,UAAU,CAAC,CAAC;QACzD,MAAM,WAAW,GAAG,cAAc,CAAC,MAAM,CAAC;QAE1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,EAAE,CAAC,EAAE,CAAC;YACrC,MAAM,EAAE,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;YAC7B,MAAM,GAAG,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;YACzB,MAAM,KAAK,GAAG,IAAI,CAAC,kBAAkB,CAAC,EAAE,CAAC,CAAC;YAC1C,MAAM,KAAK,GAAG,IAAI,CAAC,iBAAiB,CAAC,EAAE,CAAC,CAAC;YAEzC,qEAAqE;YACrE,IAAI,WAAW,GAAG,IAAI,CAAC;YACvB,IAAI,UAAU,GAAG,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;YACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,CAAC;gBACxC,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;oBACd,SAAS;gBACX,CAAC;gBACD,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;gBACnC,IAAI,CAAC,KAAK,UAAU,EAAE,CAAC;oBACrB,WAAW,GAAG,KAAK,CAAC;oBACpB,MAAM;gBACR,CAAC;gBACD,UAAU,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YAC7B,CAAC;YACD,IAAI,CAAC,WAAW,EAAE,CAAC;gBACjB,SAAS;YACX,CAAC;YAED,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,mBAAmB,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,EAAE,CAAC;gBACnE,EAAE,KAAK,CAAC;YACV,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED,yCAAyC;IACzC,cAAc,CAAC,SAAmB;QAChC,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC;YAC3D,MAAM,KAAK,GAAG,IAAI,CAAC,kBAAkB,CAAC,EAAE,CAAC,CAAC;YAC1C,MAAM,KAAK,GAAG,IAAI,CAAC,iBAAiB,CAAC,EAAE,CAAC,CAAC;YAEzC,IAAI,UAAU,GAAG,CAAC,CAAC;YACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,CAAC;gBACxC,UAAU,IAAI,SAAS,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACtD,CAAC;YAED,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,mBAAmB,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,EAAE,CAAC;gBACnE,EAAE,KAAK,CAAC;YACV,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED,uDAAuD;IACvD,GAAG;IACH,mEAAmE;IACnE,qEAAqE;IACrE,mEAAmE;IACnE,oBAAoB,CAAC,WAAsC;QACzD,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC7B,OAAO;QACT,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;QAEtC,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC;YAC3D,MAAM,KAAK,GAAG,IAAI,CAAC,kBAAkB,CAAC,EAAE,CAAC,CAAC;YAE1C,wCAAwC;YACxC,IAAI,OAAO,GAAG,CAAC,CAAC;YAChB,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;gBACvB,OAAO,IAAI,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC;YACnC,CAAC;YAED,8BAA8B;YAC9B,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,OAAO,EAAE,EAAE,EAAE,EAAE,CAAC;gBACpC,MAAM,WAAW,GAAG,IAAI,CAAC,mBAAmB,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;gBACtD,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC;oBACpC,SAAS,CAAC,kBAAkB;gBAC9B,CAAC;gBAED,+CAA+C;gBAC/C,MAAM,OAAO,GAAa,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;gBAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC;oBACtC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;gBAC3C,CAAC;gBACD,MAAM,YAAY,GAAG,gBAAgB,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;gBAEnD,kEAAkE;gBAClE,MAAM,UAAU,GAAG,IAAI,KAAK,CAAS,SAAS,CAAC,CAAC;gBAChD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;oBACnC,UAAU,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC;gBAC7B,CAAC;gBACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC;oBACtC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;gBACzC,CAAC;gBAED,4DAA4D;gBAC5D,IAAI,OAAO,GAAG,KAAK,CAAC;gBACpB,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;oBACrC,MAAM,MAAM,GAAG,UAAU,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;oBAC/C,IAAI,MAAM,KAAK,gBAAgB,CAAC,KAAK,EAAE,CAAC;wBACtC,OAAO,GAAG,IAAI,CAAC;wBACf,MAAM;oBACR,CAAC;gBACH,CAAC;gBAED,IAAI,OAAO,EAAE,CAAC;oBACZ,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;oBAC/B,EAAE,IAAI,CAAC,cAAc,CAAC;gBACxB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,uEAAuE;IACvE,GAAG;IACH,uEAAuE;IACvE,0EAA0E;IAC1E,oBAAoB;QAClB,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;YACpC,OAAO;QACT,CAAC;QAED,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC;YAC3D,MAAM,KAAK,GAAG,IAAI,CAAC,kBAAkB,CAAC,EAAE,CAAC,CAAC;YAE1C,wCAAwC;YACxC,IAAI,OAAO,GAAG,CAAC,CAAC;YAChB,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;gBACvB,OAAO,IAAI,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC;YACnC,CAAC;YAED,8BAA8B;YAC9B,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,OAAO,EAAE,EAAE,EAAE,EAAE,CAAC;gBACpC,MAAM,WAAW,GAAG,IAAI,CAAC,mBAAmB,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;gBACtD,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC;oBACpC,SAAS;gBACX,CAAC;gBAED,+CAA+C;gBAC/C,MAAM,OAAO,GAAa,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;gBAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC;oBACtC,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;gBAC3C,CAAC;gBACD,MAAM,YAAY,GAAG,gBAAgB,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;gBAEnD,yCAAyC;gBACzC,IAAI,eAAe,GAAG,KAAK,CAAC;gBAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC;oBACtC,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;wBACtD,eAAe,GAAG,IAAI,CAAC;wBACvB,MAAM;oBACR,CAAC;gBACH,CAAC;gBAED,IAAI,eAAe,EAAE,CAAC;oBACpB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;oBAC/B,EAAE,IAAI,CAAC,cAAc,CAAC;gBACxB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,mDAAmD;IACnD,IAAI,WAAW;QACb,OAAO,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,cAAc,CAAC;IACjD,CAAC;IAED,8CAA8C;IAC9C,IAAI,YAAY;QACd,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,GAAG,IAAI,CAAC,cAAc,CAAC;IACrD,CAAC;IAED,qCAAqC;IACrC,IAAI,aAAa;QACf,IAAI,IAAI,CAAC,WAAW,KAAK,CAAC,EAAE,CAAC;YAC3B,OAAO,GAAG,CAAC;QACb,CAAC;QACD,OAAO,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,WAAW,CAAC;IAC9C,CAAC;IAED,0CAA0C;IAC1C,IAAI,UAAU;QACZ,OAAO,IAAI,CAAC,YAAY,KAAK,IAAI,CAAC,WAAW,CAAC;IAChD,CAAC;IAED,2DAA2D;IAC3D,yEAAyE;IACzE,kBAAkB,CAAC,MAAmB;QACpC,MAAM,MAAM,GAAqB,EAAE,CAAC;QAEpC,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC;YAC3D,MAAM,KAAK,GAAG,IAAI,CAAC,kBAAkB,CAAC,EAAE,CAAC,CAAC;YAE1C,2DAA2D;YAC3D,IAAI,OAAO,GAAG,CAAC,CAAC;YAChB,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;gBACvB,OAAO,IAAI,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC;YAC7B,CAAC;YAED,yDAAyD;YACzD,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,OAAO,EAAE,EAAE,EAAE,EAAE,CAAC;gBACpC,MAAM,WAAW,GAAG,IAAI,CAAC,mBAAmB,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC;gBACtD,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC;oBACpC,SAAS;gBACX,CAAC;gBAED,mDAAmD;gBACnD,MAAM,OAAO,GAAa,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;gBAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC;oBACtC,OAAO,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;gBACrC,CAAC;gBACD,MAAM,YAAY,GAAG,gBAAgB,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;gBAEnD,MAAM,KAAK,GAAa,EAAE,CAAC;gBAC3B,MAAM,UAAU,GAAa,EAAE,CAAC;gBAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC;oBACtC,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;oBACpB,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;oBACjC,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,IAAI,MAAM,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBACzE,CAAC;gBAED,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,eAAe,EAAE,CAAC,CAAC;YACtE,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,0BAA0B;IAElB,gBAAgB;QACtB,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;QAC9B,IAAI,CAAC,kBAAkB,GAAG,oBAAoB,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;IACpE,CAAC;IAEO,0BAA0B;QAChC,MAAM,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;QACnC,MAAM,WAAW,GAAG,oBAAoB,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;QAE5D,6CAA6C;QAC7C,IAAI,CAAC,kBAAkB,GAAG,EAAE,CAAC;QAC7B,KAAK,MAAM,KAAK,IAAI,WAAW,EAAE,CAAC;YAChC,MAAM,WAAW,GAAG,IAAI,KAAK,CAAS,IAAI,CAAC,SAAS,CAAC,CAAC;YACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,CAAC;gBACxC,WAAW,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/C,CAAC;YACD,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAC5C,CAAC;IACH,CAAC;IAEO,iBAAiB;QACvB,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;QACtC,MAAM,SAAS,GAAG,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC;QAEjD,kEAAkE;QAClE,IAAI,CAAC,cAAc,GAAG,IAAI,KAAK,CAAC,SAAS,CAAC,CAAC;QAC3C,IAAI,CAAC,qBAAqB,GAAG,IAAI,KAAK,CAAC,SAAS,CAAC,CAAC;QAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;YAC5B,IAAI,CAAC,qBAAqB,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;QACrC,CAAC;QAED,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,SAAS,EAAE,EAAE,EAAE,EAAE,CAAC;YACtC,MAAM,KAAK,GAAG,IAAI,CAAC,kBAAkB,CAAC,EAAE,CAAC,CAAC;YAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC,EAAE,CAAC;gBACxC,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gBACpB,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACjC,IAAI,CAAC,qBAAqB,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACzC,CAAC;QACH,CAAC;QAED,sDAAsD;QACtD,6EAA6E;QAC7E,IAAI,CAAC,iBAAiB,GAAG,IAAI,KAAK,CAAC,SAAS,CAAC,CAAC;QAC9C,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,SAAS,EAAE,EAAE,EAAE,EAAE,CAAC;YACtC,MAAM,KAAK,GAAG,IAAI,CAAC,kBAAkB,CAAC,EAAE,CAAC,CAAC;YAC1C,MAAM,KAAK,GAAG,IAAI,KAAK,CAAS,IAAI,CAAC,SAAS,CAAC,CAAC;YAChD,KAAK,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YAC9B,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,SAAS,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;gBAC7C,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;YAC5D,CAAC;YACD,IAAI,CAAC,iBAAiB,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC;QACrC,CAAC;IACH,CAAC;IAEO,kBAAkB;QACxB,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,mBAAmB,GAAG,EAAE,CAAC;QAE9B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,kBAAkB,EAAE,CAAC;YAC5C,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACrC,IAAI,OAAO,GAAG,CAAC,CAAC;YAChB,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;gBACvB,OAAO,IAAI,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC;YACnC,CAAC;YACD,KAAK,IAAI,OAAO,CAAC;QACnB,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;;AA3ZD,wDAAwD;AACxD,mDAAmD;AACnC,yBAAU,GAAG,QAAU,AAAb,CAAc;AA4Z1C,iEAAiE;AACjE,SAAS,uBAAuB,CAAC,WAAmB,EAAE,SAAiB;IACrE,OAAO;QACL,IAAI,EAAE,SAAS,CAAC,cAAc;QAC9B,OAAO,EAAE,yCAAyC;QAClD,MAAM,EAAE,iBAAiB,WAAW,YAAY,SAAS,uCAAuC;KACjG,CAAC;AACJ,CAAC"}

package/dist/src/ts/core/generator.d.ts

@@ -0,0 +1,6 @@
+import { ExtendMode, type GenerateOptions, type ModelStats } from '../model/generate-options.js';
+import { type GenerateResult, type TestCase } from '../model/test-case.js';
+export declare function generate(options: GenerateOptions): GenerateResult;
+export declare function extend(existing: TestCase[], options: GenerateOptions, _mode?: ExtendMode): GenerateResult;
+export declare function estimateModel(options: GenerateOptions): ModelStats;
+//# sourceMappingURL=generator.d.ts.map

package/dist/src/ts/core/generator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"generator.d.ts","sourceRoot":"","sources":["../../../../src/ts/core/generator.ts"],"names":[],"mappings":"AAQA,OAAO,EAEL,UAAU,EACV,KAAK,eAAe,EAGpB,KAAK,UAAU,EAEhB,MAAM,8BAA8B,CAAC;AAEtC,OAAO,EAEL,KAAK,cAAc,EAEnB,KAAK,QAAQ,EAEd,MAAM,uBAAuB,CAAC;AAkM/B,wBAAgB,QAAQ,CAAC,OAAO,EAAE,eAAe,GAAG,cAAc,CAuKjE;AAGD,wBAAgB,MAAM,CACpB,QAAQ,EAAE,QAAQ,EAAE,EACpB,OAAO,EAAE,eAAe,EACxB,KAAK,GAAE,UAA8B,GACpC,cAAc,CAMhB;AAKD,wBAAgB,aAAa,CAAC,OAAO,EAAE,eAAe,GAAG,UAAU,CA4DlE"}