@libraz/coverwise 1.0.0

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

@@ -0,0 +1,230 @@
+/// Independent coverage validation (does NOT depend on generator/core).
+/**
+ * Generate all C(n, k) combinations of indices [0, n).
+ * @returns Array of sorted index arrays. Empty if k == 0 or k > n.
+ */
+function generateCombinations(n, k) {
+    if (k === 0 || k > n) {
+        return [];
+    }
+    const result = [];
+    const combo = new Array(k);
+    function recurse(start, depth) {
+        if (depth === k) {
+            result.push(combo.slice());
+            return;
+        }
+        for (let i = start; i < n; ++i) {
+            combo[depth] = i;
+            recurse(i + 1, depth + 1);
+        }
+    }
+    recurse(0, 0);
+    return result;
+}
+/**
+ * Check if a test case covers a specific value tuple for given parameter indices.
+ */
+function testCovers(test, paramIndices, valueIndices) {
+    for (let i = 0; i < paramIndices.length; ++i) {
+        const pi = paramIndices[i];
+        if (pi >= test.values.length || test.values[pi] !== valueIndices[i]) {
+            return false;
+        }
+    }
+    return true;
+}
+/**
+ * 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 function validateCoverage(params, tests, strength) {
+    const report = {
+        totalTuples: 0,
+        coveredTuples: 0,
+        coverageRatio: 0,
+        uncovered: [],
+    };
+    const n = params.length;
+    // Edge case: strength is 0 or exceeds parameter count.
+    // Vacuous coverage: nothing to cover means everything is covered.
+    if (strength === 0 || strength > n) {
+        report.coverageRatio = 1.0;
+        return report;
+    }
+    // Step 1: Generate all C(n, strength) combinations of parameter indices.
+    const combinations = generateCombinations(n, strength);
+    for (const combo of combinations) {
+        // Step 2: Enumerate all value tuples (cartesian product) for this combination.
+        let numTuples = 1;
+        for (const pi of combo) {
+            numTuples *= params[pi].size;
+        }
+        // Iterate over all value tuples using a flat index.
+        for (let flat = 0; flat < numTuples; ++flat) {
+            // Decode flat index into value indices (mixed-radix decomposition).
+            const valueIndices = new Array(strength);
+            let remainder = flat;
+            for (let i = strength - 1; i >= 0; --i) {
+                const radix = params[combo[i]].size;
+                valueIndices[i] = remainder % radix;
+                remainder = Math.trunc(remainder / radix);
+            }
+            ++report.totalTuples;
+            // Step 3: Check if any test case covers this value tuple.
+            let covered = false;
+            for (const test of tests) {
+                if (testCovers(test, combo, valueIndices)) {
+                    covered = true;
+                    break;
+                }
+            }
+            if (covered) {
+                ++report.coveredTuples;
+            }
+            else {
+                // Build the UncoveredTuple with human-readable strings.
+                const tuple = [];
+                const paramNames = [];
+                for (let i = 0; i < strength; ++i) {
+                    const pi = combo[i];
+                    const vi = valueIndices[i];
+                    paramNames.push(params[pi].name);
+                    tuple.push(`${params[pi].name}=${params[pi].values[vi]}`);
+                }
+                report.uncovered.push({
+                    tuple,
+                    params: paramNames,
+                    reason: 'never covered',
+                });
+            }
+        }
+    }
+    // Compute coverage ratio. When there are no tuples, coverage is vacuously 1.0.
+    if (report.totalTuples === 0) {
+        report.coverageRatio = 1.0;
+    }
+    else {
+        report.coverageRatio = report.coveredTuples / report.totalTuples;
+    }
+    return report;
+}
+/**
+ * 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 function computeClassCoverage(params, tests, strength) {
+    const report = {
+        totalClassTuples: 0,
+        coveredClassTuples: 0,
+        coverageRatio: 0,
+    };
+    const n = params.length;
+    if (strength === 0 || strength > n) {
+        return report;
+    }
+    // Identify parameters that have equivalence classes.
+    const classParams = [];
+    for (let i = 0; i < n; ++i) {
+        if (params[i].hasEquivalenceClasses) {
+            classParams.push(i);
+        }
+    }
+    if (classParams.length === 0) {
+        return report;
+    }
+    // For class coverage we consider combinations of parameters that have classes.
+    // If fewer parameters have classes than the strength, use the available count.
+    const classN = classParams.length;
+    const effectiveStrength = Math.min(strength, classN);
+    // Generate all C(classN, effectiveStrength) combinations of class-enabled parameters.
+    const combinations = generateCombinations(classN, effectiveStrength);
+    // For each combination, enumerate all class tuples (cartesian product of unique classes).
+    for (const combo of combinations) {
+        // Get the unique classes for each parameter in this combination.
+        const classesPerParam = [];
+        for (const idx of combo) {
+            classesPerParam.push(params[classParams[idx]].uniqueClasses());
+        }
+        // Compute the number of class tuples for this combination.
+        let numTuples = 1;
+        for (const cls of classesPerParam) {
+            numTuples *= cls.length;
+        }
+        // Enumerate all class tuples and check coverage.
+        for (let flat = 0; flat < numTuples; ++flat) {
+            // Decode flat index into class indices.
+            const classIndices = new Array(effectiveStrength);
+            let remainder = flat;
+            for (let i = effectiveStrength - 1; i >= 0; --i) {
+                const radix = classesPerParam[i].length;
+                classIndices[i] = remainder % radix;
+                remainder = Math.trunc(remainder / radix);
+            }
+            ++report.totalClassTuples;
+            // Check if any test case covers this class tuple.
+            let covered = false;
+            for (const test of tests) {
+                let matches = true;
+                for (let k = 0; k < effectiveStrength; ++k) {
+                    const pi = classParams[combo[k]];
+                    if (pi >= test.values.length) {
+                        matches = false;
+                        break;
+                    }
+                    const vi = test.values[pi];
+                    const testClass = params[pi].equivalenceClass(vi);
+                    if (testClass !== classesPerParam[k][classIndices[k]]) {
+                        matches = false;
+                        break;
+                    }
+                }
+                if (matches) {
+                    covered = true;
+                    break;
+                }
+            }
+            if (covered) {
+                ++report.coveredClassTuples;
+            }
+        }
+    }
+    if (report.totalClassTuples > 0) {
+        report.coverageRatio = report.coveredClassTuples / report.totalClassTuples;
+    }
+    return report;
+}
+/**
+ * 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 function annotateClassCoverage(result, params, strength) {
+    let hasEqClasses = false;
+    for (const p of params) {
+        if (p.hasEquivalenceClasses) {
+            hasEqClasses = true;
+            break;
+        }
+    }
+    if (!hasEqClasses) {
+        return;
+    }
+    const classReport = computeClassCoverage(params, result.tests, strength);
+    result.classCoverage = {
+        totalClassTuples: classReport.totalClassTuples,
+        coveredClassTuples: classReport.coveredClassTuples,
+        classCoverageRatio: classReport.coverageRatio,
+    };
+}
+//# sourceMappingURL=coverage-validator.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"coverage-validator.js","sourceRoot":"","sources":["../../../../src/ts/validator/coverage-validator.ts"],"names":[],"mappings":"AAAA,wEAAwE;AAoBxE;;;GAGG;AACH,SAAS,oBAAoB,CAAC,CAAS,EAAE,CAAS;IAChD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACrB,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,MAAM,KAAK,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC;IAEnC,SAAS,OAAO,CAAC,KAAa,EAAE,KAAa;QAC3C,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;YAChB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;YAC3B,OAAO;QACT,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;YAC/B,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YACjB,OAAO,CAAC,CAAC,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC;IAED,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACd,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,SAAS,UAAU,CAAC,IAAc,EAAE,YAAsB,EAAE,YAAsB;IAChF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE,CAAC;QAC7C,MAAM,EAAE,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAC3B,IAAI,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC;YACpE,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAC9B,MAAmB,EACnB,KAAiB,EACjB,QAAgB;IAEhB,MAAM,MAAM,GAAmB;QAC7B,WAAW,EAAE,CAAC;QACd,aAAa,EAAE,CAAC;QAChB,aAAa,EAAE,CAAC;QAChB,SAAS,EAAE,EAAE;KACd,CAAC;IAEF,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IAExB,uDAAuD;IACvD,kEAAkE;IAClE,IAAI,QAAQ,KAAK,CAAC,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;QACnC,MAAM,CAAC,aAAa,GAAG,GAAG,CAAC;QAC3B,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,yEAAyE;IACzE,MAAM,YAAY,GAAG,oBAAoB,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;IAEvD,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;QACjC,+EAA+E;QAC/E,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;YACvB,SAAS,IAAI,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC;QAC/B,CAAC;QAED,oDAAoD;QACpD,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,SAAS,EAAE,EAAE,IAAI,EAAE,CAAC;YAC5C,oEAAoE;YACpE,MAAM,YAAY,GAAG,IAAI,KAAK,CAAS,QAAQ,CAAC,CAAC;YACjD,IAAI,SAAS,GAAG,IAAI,CAAC;YACrB,KAAK,IAAI,CAAC,GAAG,QAAQ,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;gBACvC,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;gBACpC,YAAY,CAAC,CAAC,CAAC,GAAG,SAAS,GAAG,KAAK,CAAC;gBACpC,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,KAAK,CAAC,CAAC;YAC5C,CAAC;YAED,EAAE,MAAM,CAAC,WAAW,CAAC;YAErB,0DAA0D;YAC1D,IAAI,OAAO,GAAG,KAAK,CAAC;YACpB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,IAAI,UAAU,CAAC,IAAI,EAAE,KAAK,EAAE,YAAY,CAAC,EAAE,CAAC;oBAC1C,OAAO,GAAG,IAAI,CAAC;oBACf,MAAM;gBACR,CAAC;YACH,CAAC;YAED,IAAI,OAAO,EAAE,CAAC;gBACZ,EAAE,MAAM,CAAC,aAAa,CAAC;YACzB,CAAC;iBAAM,CAAC;gBACN,wDAAwD;gBACxD,MAAM,KAAK,GAAa,EAAE,CAAC;gBAC3B,MAAM,UAAU,GAAa,EAAE,CAAC;gBAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,EAAE,CAAC,EAAE,CAAC;oBAClC,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;oBACpB,MAAM,EAAE,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;oBAC3B,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,EAAE,CAAC,EAAE,CAAC,CAAC;gBAC5D,CAAC;gBACD,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC;oBACpB,KAAK;oBACL,MAAM,EAAE,UAAU;oBAClB,MAAM,EAAE,eAAe;iBACxB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED,+EAA+E;IAC/E,IAAI,MAAM,CAAC,WAAW,KAAK,CAAC,EAAE,CAAC;QAC7B,MAAM,CAAC,aAAa,GAAG,GAAG,CAAC;IAC7B,CAAC;SAAM,CAAC;QACN,MAAM,CAAC,aAAa,GAAG,MAAM,CAAC,aAAa,GAAG,MAAM,CAAC,WAAW,CAAC;IACnE,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,oBAAoB,CAClC,MAAmB,EACnB,KAAiB,EACjB,QAAgB;IAEhB,MAAM,MAAM,GAAwB;QAClC,gBAAgB,EAAE,CAAC;QACnB,kBAAkB,EAAE,CAAC;QACrB,aAAa,EAAE,CAAC;KACjB,CAAC;IAEF,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IAExB,IAAI,QAAQ,KAAK,CAAC,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;QACnC,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,qDAAqD;IACrD,MAAM,WAAW,GAAa,EAAE,CAAC;IACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;QAC3B,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,qBAAqB,EAAE,CAAC;YACpC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtB,CAAC;IACH,CAAC;IAED,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC7B,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,+EAA+E;IAC/E,+EAA+E;IAC/E,MAAM,MAAM,GAAG,WAAW,CAAC,MAAM,CAAC;IAClC,MAAM,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;IAErD,sFAAsF;IACtF,MAAM,YAAY,GAAG,oBAAoB,CAAC,MAAM,EAAE,iBAAiB,CAAC,CAAC;IAErE,0FAA0F;IAC1F,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;QACjC,iEAAiE;QACjE,MAAM,eAAe,GAAe,EAAE,CAAC;QACvC,KAAK,MAAM,GAAG,IAAI,KAAK,EAAE,CAAC;YACxB,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC;QACjE,CAAC;QAED,2DAA2D;QAC3D,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,KAAK,MAAM,GAAG,IAAI,eAAe,EAAE,CAAC;YAClC,SAAS,IAAI,GAAG,CAAC,MAAM,CAAC;QAC1B,CAAC;QAED,iDAAiD;QACjD,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,SAAS,EAAE,EAAE,IAAI,EAAE,CAAC;YAC5C,wCAAwC;YACxC,MAAM,YAAY,GAAG,IAAI,KAAK,CAAS,iBAAiB,CAAC,CAAC;YAC1D,IAAI,SAAS,GAAG,IAAI,CAAC;YACrB,KAAK,IAAI,CAAC,GAAG,iBAAiB,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;gBAChD,MAAM,KAAK,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;gBACxC,YAAY,CAAC,CAAC,CAAC,GAAG,SAAS,GAAG,KAAK,CAAC;gBACpC,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,KAAK,CAAC,CAAC;YAC5C,CAAC;YAED,EAAE,MAAM,CAAC,gBAAgB,CAAC;YAE1B,kDAAkD;YAClD,IAAI,OAAO,GAAG,KAAK,CAAC;YACpB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,IAAI,OAAO,GAAG,IAAI,CAAC;gBACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,iBAAiB,EAAE,EAAE,CAAC,EAAE,CAAC;oBAC3C,MAAM,EAAE,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;oBACjC,IAAI,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;wBAC7B,OAAO,GAAG,KAAK,CAAC;wBAChB,MAAM;oBACR,CAAC;oBACD,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;oBAC3B,MAAM,SAAS,GAAG,MAAM,CAAC,EAAE,CAAC,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC;oBAClD,IAAI,SAAS,KAAK,eAAe,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;wBACtD,OAAO,GAAG,KAAK,CAAC;wBAChB,MAAM;oBACR,CAAC;gBACH,CAAC;gBACD,IAAI,OAAO,EAAE,CAAC;oBACZ,OAAO,GAAG,IAAI,CAAC;oBACf,MAAM;gBACR,CAAC;YACH,CAAC;YAED,IAAI,OAAO,EAAE,CAAC;gBACZ,EAAE,MAAM,CAAC,kBAAkB,CAAC;YAC9B,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,MAAM,CAAC,gBAAgB,GAAG,CAAC,EAAE,CAAC;QAChC,MAAM,CAAC,aAAa,GAAG,MAAM,CAAC,kBAAkB,GAAG,MAAM,CAAC,gBAAgB,CAAC;IAC7E,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,qBAAqB,CACnC,MAAsB,EACtB,MAAmB,EACnB,QAAgB;IAEhB,IAAI,YAAY,GAAG,KAAK,CAAC;IACzB,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,IAAI,CAAC,CAAC,qBAAqB,EAAE,CAAC;YAC5B,YAAY,GAAG,IAAI,CAAC;YACpB,MAAM;QACR,CAAC;IACH,CAAC;IACD,IAAI,CAAC,YAAY,EAAE,CAAC;QAClB,OAAO;IACT,CAAC;IAED,MAAM,WAAW,GAAG,oBAAoB,CAAC,MAAM,EAAE,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;IACzE,MAAM,CAAC,aAAa,GAAG;QACrB,gBAAgB,EAAE,WAAW,CAAC,gBAAgB;QAC9C,kBAAkB,EAAE,WAAW,CAAC,kBAAkB;QAClD,kBAAkB,EAAE,WAAW,CAAC,aAAa;KAC9C,CAAC;AACJ,CAAC"}

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

@@ -0,0 +1,3 @@
+export { type ConstraintReport, type ConstraintViolation, validateConstraintReport, validateConstraints, } from './constraint-validator.js';
+export { annotateClassCoverage, type ClassCoverageReport, type CoverageReport, computeClassCoverage, validateCoverage, } from './coverage-validator.js';
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/ts/validator/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,KAAK,gBAAgB,EACrB,KAAK,mBAAmB,EACxB,wBAAwB,EACxB,mBAAmB,GACpB,MAAM,2BAA2B,CAAC;AACnC,OAAO,EACL,qBAAqB,EACrB,KAAK,mBAAmB,EACxB,KAAK,cAAc,EACnB,oBAAoB,EACpB,gBAAgB,GACjB,MAAM,yBAAyB,CAAC"}

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

@@ -0,0 +1,3 @@
+export { validateConstraintReport, validateConstraints, } from './constraint-validator.js';
+export { annotateClassCoverage, computeClassCoverage, validateCoverage, } from './coverage-validator.js';
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/ts/validator/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAGL,wBAAwB,EACxB,mBAAmB,GACpB,MAAM,2BAA2B,CAAC;AACnC,OAAO,EACL,qBAAqB,EAGrB,oBAAoB,EACpB,gBAAgB,GACjB,MAAM,yBAAyB,CAAC"}

package/package.json

@@ -0,0 +1,82 @@
+{
+  "name": "@libraz/coverwise",
+  "version": "1.0.0",
+  "type": "module",
+  "packageManager": "yarn@4.12.0",
+  "description": "Combinatorial test coverage engine — analyze, generate, and extend t-wise test suites via WASM",
+  "main": "dist/js/index.js",
+  "types": "dist/js/index.d.ts",
+  "exports": {
+    ".": {
+      "types": "./dist/js/index.d.ts",
+      "import": "./dist/js/index.js"
+    },
+    "./pure": {
+      "types": "./dist/js/pure/index.d.ts",
+      "import": "./dist/js/pure/index.js"
+    },
+    "./wasm": "./dist/coverwise.wasm",
+    "./package.json": "./package.json"
+  },
+  "files": [
+    "dist"
+  ],
+  "sideEffects": false,
+  "scripts": {
+    "prepare": "test -z \"$npm_config_production\" && simple-git-hooks || true",
+    "build": "yarn build:wasm && yarn build:js",
+    "build:wasm": "emcmake cmake -B build-wasm -DBUILD_WASM=ON -DCMAKE_BUILD_TYPE=Release && cmake --build build-wasm -j",
+    "build:js": "tsc",
+    "clean": "rm -rf dist build-wasm",
+    "lint": "biome check js/ tests/wasm/ src/ts/",
+    "lint:fix": "biome check --write js/ tests/wasm/",
+    "format": "biome format --write js/ tests/wasm/",
+    "test": "vitest run",
+    "test:watch": "vitest",
+    "prepack": "cp README.md /tmp/coverwise-readme-bak && cp README.npm.md README.md",
+    "postpack": "mv /tmp/coverwise-readme-bak README.md",
+    "prepublishOnly": "yarn clean && yarn build && yarn lint && yarn test"
+  },
+  "keywords": [
+    "combinatorial",
+    "pairwise",
+    "testing",
+    "t-wise",
+    "covering-array",
+    "test-generation",
+    "wasm",
+    "webassembly"
+  ],
+  "author": "libraz <libraz@libraz.net>",
+  "license": "Apache-2.0",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/libraz/coverwise.git"
+  },
+  "bugs": {
+    "url": "https://github.com/libraz/coverwise/issues"
+  },
+  "homepage": "https://github.com/libraz/coverwise#readme",
+  "engines": {
+    "node": ">=18.0.0"
+  },
+  "devDependencies": {
+    "@biomejs/biome": "^2.3.10",
+    "lint-staged": "^16.2.7",
+    "simple-git-hooks": "^2.13.1",
+    "typescript": "^5.0.0",
+    "vitest": "^4.0.16"
+  },
+  "volta": {
+    "node": "22.21.1",
+    "yarn": "4.12.0"
+  },
+  "simple-git-hooks": {
+    "pre-commit": "yarn lint-staged"
+  },
+  "lint-staged": {
+    "{js,tests/wasm}/**/*.{ts,js}": [
+      "biome check --write"
+    ]
+  }
+}