@libraz/coverwise 1.0.0

package/dist/src/ts/model/constraint-ast.d.ts

@@ -0,0 +1,152 @@
+/** Sentinel value indicating an unassigned parameter. */
+export declare const UNASSIGNED = 4294967295;
+/** Result of evaluating a constraint against a partial assignment. */
+export declare enum ConstraintResult {
+    True = "true",
+    False = "false",
+    Unknown = "unknown"
+}
+/** Base interface for constraint AST nodes. */
+export interface ConstraintNode {
+    /** Evaluate this constraint against a (possibly partial) assignment. */
+    evaluate(assignment: number[]): ConstraintResult;
+}
+/** Equality comparison: param_index == value_index. */
+export declare class EqualsNode implements ConstraintNode {
+    readonly paramIndex: number;
+    readonly valueIndex: number;
+    constructor(paramIndex: number, valueIndex: number);
+    evaluate(assignment: number[]): ConstraintResult;
+}
+/** Inequality comparison: param_index != value_index. */
+export declare class NotEqualsNode implements ConstraintNode {
+    readonly paramIndex: number;
+    readonly valueIndex: number;
+    constructor(paramIndex: number, valueIndex: number);
+    evaluate(assignment: number[]): ConstraintResult;
+}
+/** Logical AND of two sub-expressions. */
+export declare class AndNode implements ConstraintNode {
+    private readonly left;
+    private readonly right;
+    constructor(left: ConstraintNode, right: ConstraintNode);
+    evaluate(assignment: number[]): ConstraintResult;
+}
+/** Logical OR of two sub-expressions. */
+export declare class OrNode implements ConstraintNode {
+    private readonly left;
+    private readonly right;
+    constructor(left: ConstraintNode, right: ConstraintNode);
+    evaluate(assignment: number[]): ConstraintResult;
+}
+/** Logical NOT of a sub-expression. */
+export declare class NotNode implements ConstraintNode {
+    private readonly child;
+    constructor(child: ConstraintNode);
+    evaluate(assignment: number[]): ConstraintResult;
+}
+/** Logical implication: antecedent IMPLIES consequent (= NOT antecedent OR consequent). */
+export declare class ImpliesNode implements ConstraintNode {
+    private readonly antecedent;
+    private readonly consequent;
+    constructor(antecedent: ConstraintNode, consequent: ConstraintNode);
+    evaluate(assignment: number[]): ConstraintResult;
+}
+/**
+ * IF/THEN/ELSE ternary constraint.
+ *
+ * Three-valued evaluation:
+ * - condition=True  -> evaluate then_branch
+ * - condition=False -> evaluate else_branch
+ * - condition=Unknown -> if both branches agree, use that; else Unknown
+ */
+export declare class IfThenElseNode implements ConstraintNode {
+    private readonly condition;
+    private readonly thenBranch;
+    private readonly elseBranch;
+    constructor(condition: ConstraintNode, thenBranch: ConstraintNode, elseBranch: ConstraintNode);
+    evaluate(assignment: number[]): ConstraintResult;
+}
+/** Relational comparison operators. */
+export declare enum RelOp {
+    Less = "<",
+    LessEqual = "<=",
+    Greater = ">",
+    GreaterEqual = ">="
+}
+/**
+ * Relational comparison of a parameter's numeric value against a literal or another parameter.
+ *
+ * Compares parameter values as numbers. If a value cannot be parsed as numeric,
+ * the result is False.
+ */
+export declare class RelationalNode implements ConstraintNode {
+    private readonly leftParam;
+    private readonly op;
+    private readonly isParamComparison;
+    private readonly literal;
+    private readonly rightParam;
+    private readonly leftValues;
+    private readonly rightValues;
+    /** Compare a parameter value against a literal numeric value. */
+    static fromLiteral(paramIndex: number, op: RelOp, literal: number, paramValues: string[]): RelationalNode;
+    /** Compare two parameter values against each other. */
+    static fromParams(leftParam: number, op: RelOp, rightParam: number, leftValues: string[], rightValues: string[]): RelationalNode;
+    private constructor();
+    evaluate(assignment: number[]): ConstraintResult;
+    private compareValues;
+}
+/**
+ * IN-set membership test: param IN {val1, val2, ...}.
+ *
+ * Three-valued: unassigned -> Unknown, value in set -> True, else False.
+ */
+export declare class InNode implements ConstraintNode {
+    private readonly paramIndex;
+    private readonly valueIndices;
+    constructor(paramIndex: number, valueIndices: number[]);
+    evaluate(assignment: number[]): ConstraintResult;
+}
+/**
+ * LIKE pattern matching: param LIKE pattern.
+ *
+ * Supports `*` (any string) and `?` (single character) wildcards.
+ * Matching results are precomputed at construction time for efficiency.
+ */
+export declare class LikeNode implements ConstraintNode {
+    private readonly paramIndex;
+    private readonly matches;
+    constructor(paramIndex: number, pattern: string, paramValues: string[]);
+    evaluate(assignment: number[]): ConstraintResult;
+}
+/** Test whether a string matches a glob pattern (* and ?). */
+export declare function globMatch(pattern: string, text: string): boolean;
+/**
+ * Parameter-to-parameter equality comparison.
+ *
+ * Compares the string values of two parameters. Equal if the string
+ * representations are identical.
+ */
+export declare class ParamEqualsNode implements ConstraintNode {
+    private readonly leftParam;
+    private readonly rightParam;
+    private readonly leftValues;
+    private readonly rightValues;
+    constructor(leftParam: number, rightParam: number, leftValues: string[], rightValues: string[]);
+    evaluate(assignment: number[]): ConstraintResult;
+}
+/**
+ * Parameter-to-parameter inequality comparison.
+ *
+ * Compares the string values of two parameters. Not equal if the string
+ * representations differ.
+ */
+export declare class ParamNotEqualsNode implements ConstraintNode {
+    private readonly leftParam;
+    private readonly rightParam;
+    private readonly leftValues;
+    private readonly rightValues;
+    constructor(leftParam: number, rightParam: number, leftValues: string[], rightValues: string[]);
+    evaluate(assignment: number[]): ConstraintResult;
+}
+//# sourceMappingURL=constraint-ast.d.ts.map

package/dist/src/ts/model/constraint-ast.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"constraint-ast.d.ts","sourceRoot":"","sources":["../../../../src/ts/model/constraint-ast.ts"],"names":[],"mappings":"AAEA,yDAAyD;AACzD,eAAO,MAAM,UAAU,aAAa,CAAC;AAErC,sEAAsE;AACtE,oBAAY,gBAAgB;IAC1B,IAAI,SAAS;IACb,KAAK,UAAU;IACf,OAAO,YAAY;CACpB;AAgBD,+CAA+C;AAC/C,MAAM,WAAW,cAAc;IAC7B,wEAAwE;IACxE,QAAQ,CAAC,UAAU,EAAE,MAAM,EAAE,GAAG,gBAAgB,CAAC;CAClD;AAED,uDAAuD;AACvD,qBAAa,UAAW,YAAW,cAAc;IAE7C,QAAQ,CAAC,UAAU,EAAE,MAAM;IAC3B,QAAQ,CAAC,UAAU,EAAE,MAAM;gBADlB,UAAU,EAAE,MAAM,EAClB,UAAU,EAAE,MAAM;IAG7B,QAAQ,CAAC,UAAU,EAAE,MAAM,EAAE,GAAG,gBAAgB;CAUjD;AAED,yDAAyD;AACzD,qBAAa,aAAc,YAAW,cAAc;IAEhD,QAAQ,CAAC,UAAU,EAAE,MAAM;IAC3B,QAAQ,CAAC,UAAU,EAAE,MAAM;gBADlB,UAAU,EAAE,MAAM,EAClB,UAAU,EAAE,MAAM;IAG7B,QAAQ,CAAC,UAAU,EAAE,MAAM,EAAE,GAAG,gBAAgB;CAUjD;AAED,0CAA0C;AAC1C,qBAAa,OAAQ,YAAW,cAAc;IAE1C,OAAO,CAAC,QAAQ,CAAC,IAAI;IACrB,OAAO,CAAC,QAAQ,CAAC,KAAK;gBADL,IAAI,EAAE,cAAc,EACpB,KAAK,EAAE,cAAc;IAGxC,QAAQ,CAAC,UAAU,EAAE,MAAM,EAAE,GAAG,gBAAgB;CAcjD;AAED,yCAAyC;AACzC,qBAAa,MAAO,YAAW,cAAc;IAEzC,OAAO,CAAC,QAAQ,CAAC,IAAI;IACrB,OAAO,CAAC,QAAQ,CAAC,KAAK;gBADL,IAAI,EAAE,cAAc,EACpB,KAAK,EAAE,cAAc;IAGxC,QAAQ,CAAC,UAAU,EAAE,MAAM,EAAE,GAAG,gBAAgB;CAcjD;AAED,uCAAuC;AACvC,qBAAa,OAAQ,YAAW,cAAc;IAChC,OAAO,CAAC,QAAQ,CAAC,KAAK;gBAAL,KAAK,EAAE,cAAc;IAElD,QAAQ,CAAC,UAAU,EAAE,MAAM,EAAE,GAAG,gBAAgB;CAUjD;AAED,2FAA2F;AAC3F,qBAAa,WAAY,YAAW,cAAc;IAE9C,OAAO,CAAC,QAAQ,CAAC,UAAU;IAC3B,OAAO,CAAC,QAAQ,CAAC,UAAU;gBADV,UAAU,EAAE,cAAc,EAC1B,UAAU,EAAE,cAAc;IAG7C,QAAQ,CAAC,UAAU,EAAE,MAAM,EAAE,GAAG,gBAAgB;CAejD;AAED;;;;;;;GAOG;AACH,qBAAa,cAAe,YAAW,cAAc;IAEjD,OAAO,CAAC,QAAQ,CAAC,SAAS;IAC1B,OAAO,CAAC,QAAQ,CAAC,UAAU;IAC3B,OAAO,CAAC,QAAQ,CAAC,UAAU;gBAFV,SAAS,EAAE,cAAc,EACzB,UAAU,EAAE,cAAc,EAC1B,UAAU,EAAE,cAAc;IAG7C,QAAQ,CAAC,UAAU,EAAE,MAAM,EAAE,GAAG,gBAAgB;CAgBjD;AAED,uCAAuC;AACvC,oBAAY,KAAK;IACf,IAAI,MAAM;IACV,SAAS,OAAO;IAChB,OAAO,MAAM;IACb,YAAY,OAAO;CACpB;AAED;;;;;GAKG;AACH,qBAAa,cAAe,YAAW,cAAc;IACnD,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAS;IACnC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAQ;IAC3B,OAAO,CAAC,QAAQ,CAAC,iBAAiB,CAAU;IAC5C,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAS;IACjC,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAS;IACpC,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAW;IACtC,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAW;IAEvC,iEAAiE;IACjE,MAAM,CAAC,WAAW,CAChB,UAAU,EAAE,MAAM,EAClB,EAAE,EAAE,KAAK,EACT,OAAO,EAAE,MAAM,EACf,WAAW,EAAE,MAAM,EAAE,GACpB,cAAc;IAIjB,uDAAuD;IACvD,MAAM,CAAC,UAAU,CACf,SAAS,EAAE,MAAM,EACjB,EAAE,EAAE,KAAK,EACT,UAAU,EAAE,MAAM,EAClB,UAAU,EAAE,MAAM,EAAE,EACpB,WAAW,EAAE,MAAM,EAAE,GACpB,cAAc;IAIjB,OAAO;IAkBP,QAAQ,CAAC,UAAU,EAAE,MAAM,EAAE,GAAG,gBAAgB;IAkChD,OAAO,CAAC,aAAa;CAYtB;AAED;;;;GAIG;AACH,qBAAa,MAAO,YAAW,cAAc;IAEzC,OAAO,CAAC,QAAQ,CAAC,UAAU;IAC3B,OAAO,CAAC,QAAQ,CAAC,YAAY;gBADZ,UAAU,EAAE,MAAM,EAClB,YAAY,EAAE,MAAM,EAAE;IAGzC,QAAQ,CAAC,UAAU,EAAE,MAAM,EAAE,GAAG,gBAAgB;CAejD;AAED;;;;;GAKG;AACH,qBAAa,QAAS,YAAW,cAAc;IAC7C,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAS;IACpC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAY;gBAExB,UAAU,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE;IAKtE,QAAQ,CAAC,UAAU,EAAE,MAAM,EAAE,GAAG,gBAAgB;CAajD;AAED,8DAA8D;AAC9D,wBAAgB,SAAS,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO,CA2BhE;AAED;;;;;GAKG;AACH,qBAAa,eAAgB,YAAW,cAAc;IAElD,OAAO,CAAC,QAAQ,CAAC,SAAS;IAC1B,OAAO,CAAC,QAAQ,CAAC,UAAU;IAC3B,OAAO,CAAC,QAAQ,CAAC,UAAU;IAC3B,OAAO,CAAC,QAAQ,CAAC,WAAW;gBAHX,SAAS,EAAE,MAAM,EACjB,UAAU,EAAE,MAAM,EAClB,UAAU,EAAE,MAAM,EAAE,EACpB,WAAW,EAAE,MAAM,EAAE;IAGxC,QAAQ,CAAC,UAAU,EAAE,MAAM,EAAE,GAAG,gBAAgB;CAgBjD;AAED;;;;;GAKG;AACH,qBAAa,kBAAmB,YAAW,cAAc;IAErD,OAAO,CAAC,QAAQ,CAAC,SAAS;IAC1B,OAAO,CAAC,QAAQ,CAAC,UAAU;IAC3B,OAAO,CAAC,QAAQ,CAAC,UAAU;IAC3B,OAAO,CAAC,QAAQ,CAAC,WAAW;gBAHX,SAAS,EAAE,MAAM,EACjB,UAAU,EAAE,MAAM,EAClB,UAAU,EAAE,MAAM,EAAE,EACpB,WAAW,EAAE,MAAM,EAAE;IAGxC,QAAQ,CAAC,UAAU,EAAE,MAAM,EAAE,GAAG,gBAAgB;CAgBjD"}

package/dist/src/ts/model/constraint-ast.js

@@ -0,0 +1,384 @@
+/// AST-based constraint representation for combinatorial test generation.
+/** Sentinel value indicating an unassigned parameter. */
+export const UNASSIGNED = 0xffffffff;
+/** Result of evaluating a constraint against a partial assignment. */
+export var ConstraintResult;
+(function (ConstraintResult) {
+    ConstraintResult["True"] = "true";
+    ConstraintResult["False"] = "false";
+    ConstraintResult["Unknown"] = "unknown";
+})(ConstraintResult || (ConstraintResult = {}));
+/** Check if a string can be parsed as a finite number. */
+function isNumeric(s) {
+    if (s.length === 0) {
+        return false;
+    }
+    const n = Number(s);
+    return !Number.isNaN(n) && Number.isFinite(n);
+}
+/** Parse a string as a number. */
+function toDouble(s) {
+    return Number(s);
+}
+/** Equality comparison: param_index == value_index. */
+export class EqualsNode {
+    constructor(paramIndex, valueIndex) {
+        this.paramIndex = paramIndex;
+        this.valueIndex = valueIndex;
+    }
+    evaluate(assignment) {
+        if (this.paramIndex >= assignment.length) {
+            return ConstraintResult.Unknown;
+        }
+        const val = assignment[this.paramIndex];
+        if (val === UNASSIGNED) {
+            return ConstraintResult.Unknown;
+        }
+        return val === this.valueIndex ? ConstraintResult.True : ConstraintResult.False;
+    }
+}
+/** Inequality comparison: param_index != value_index. */
+export class NotEqualsNode {
+    constructor(paramIndex, valueIndex) {
+        this.paramIndex = paramIndex;
+        this.valueIndex = valueIndex;
+    }
+    evaluate(assignment) {
+        if (this.paramIndex >= assignment.length) {
+            return ConstraintResult.Unknown;
+        }
+        const val = assignment[this.paramIndex];
+        if (val === UNASSIGNED) {
+            return ConstraintResult.Unknown;
+        }
+        return val !== this.valueIndex ? ConstraintResult.True : ConstraintResult.False;
+    }
+}
+/** Logical AND of two sub-expressions. */
+export class AndNode {
+    constructor(left, right) {
+        this.left = left;
+        this.right = right;
+    }
+    evaluate(assignment) {
+        const l = this.left.evaluate(assignment);
+        if (l === ConstraintResult.False) {
+            return ConstraintResult.False;
+        }
+        const r = this.right.evaluate(assignment);
+        if (r === ConstraintResult.False) {
+            return ConstraintResult.False;
+        }
+        if (l === ConstraintResult.True && r === ConstraintResult.True) {
+            return ConstraintResult.True;
+        }
+        return ConstraintResult.Unknown;
+    }
+}
+/** Logical OR of two sub-expressions. */
+export class OrNode {
+    constructor(left, right) {
+        this.left = left;
+        this.right = right;
+    }
+    evaluate(assignment) {
+        const l = this.left.evaluate(assignment);
+        if (l === ConstraintResult.True) {
+            return ConstraintResult.True;
+        }
+        const r = this.right.evaluate(assignment);
+        if (r === ConstraintResult.True) {
+            return ConstraintResult.True;
+        }
+        if (l === ConstraintResult.False && r === ConstraintResult.False) {
+            return ConstraintResult.False;
+        }
+        return ConstraintResult.Unknown;
+    }
+}
+/** Logical NOT of a sub-expression. */
+export class NotNode {
+    constructor(child) {
+        this.child = child;
+    }
+    evaluate(assignment) {
+        const c = this.child.evaluate(assignment);
+        if (c === ConstraintResult.True) {
+            return ConstraintResult.False;
+        }
+        if (c === ConstraintResult.False) {
+            return ConstraintResult.True;
+        }
+        return ConstraintResult.Unknown;
+    }
+}
+/** Logical implication: antecedent IMPLIES consequent (= NOT antecedent OR consequent). */
+export class ImpliesNode {
+    constructor(antecedent, consequent) {
+        this.antecedent = antecedent;
+        this.consequent = consequent;
+    }
+    evaluate(assignment) {
+        const ante = this.antecedent.evaluate(assignment);
+        if (ante === ConstraintResult.False) {
+            return ConstraintResult.True;
+        }
+        const cons = this.consequent.evaluate(assignment);
+        if (ante === ConstraintResult.True) {
+            return cons;
+        }
+        // ante is Unknown
+        if (cons === ConstraintResult.True) {
+            return ConstraintResult.True;
+        }
+        return ConstraintResult.Unknown;
+    }
+}
+/**
+ * IF/THEN/ELSE ternary constraint.
+ *
+ * Three-valued evaluation:
+ * - condition=True  -> evaluate then_branch
+ * - condition=False -> evaluate else_branch
+ * - condition=Unknown -> if both branches agree, use that; else Unknown
+ */
+export class IfThenElseNode {
+    constructor(condition, thenBranch, elseBranch) {
+        this.condition = condition;
+        this.thenBranch = thenBranch;
+        this.elseBranch = elseBranch;
+    }
+    evaluate(assignment) {
+        const cond = this.condition.evaluate(assignment);
+        if (cond === ConstraintResult.True) {
+            return this.thenBranch.evaluate(assignment);
+        }
+        if (cond === ConstraintResult.False) {
+            return this.elseBranch.evaluate(assignment);
+        }
+        // condition is Unknown: evaluate both branches
+        const thenResult = this.thenBranch.evaluate(assignment);
+        const elseResult = this.elseBranch.evaluate(assignment);
+        if (thenResult === elseResult) {
+            return thenResult;
+        }
+        return ConstraintResult.Unknown;
+    }
+}
+/** Relational comparison operators. */
+export var RelOp;
+(function (RelOp) {
+    RelOp["Less"] = "<";
+    RelOp["LessEqual"] = "<=";
+    RelOp["Greater"] = ">";
+    RelOp["GreaterEqual"] = ">=";
+})(RelOp || (RelOp = {}));
+/**
+ * Relational comparison of a parameter's numeric value against a literal or another parameter.
+ *
+ * Compares parameter values as numbers. If a value cannot be parsed as numeric,
+ * the result is False.
+ */
+export class RelationalNode {
+    /** Compare a parameter value against a literal numeric value. */
+    static fromLiteral(paramIndex, op, literal, paramValues) {
+        return new RelationalNode(paramIndex, op, false, literal, 0, paramValues, []);
+    }
+    /** Compare two parameter values against each other. */
+    static fromParams(leftParam, op, rightParam, leftValues, rightValues) {
+        return new RelationalNode(leftParam, op, true, 0, rightParam, leftValues, rightValues);
+    }
+    constructor(leftParam, op, isParamComparison, literal, rightParam, leftValues, rightValues) {
+        this.leftParam = leftParam;
+        this.op = op;
+        this.isParamComparison = isParamComparison;
+        this.literal = literal;
+        this.rightParam = rightParam;
+        this.leftValues = leftValues;
+        this.rightValues = rightValues;
+    }
+    evaluate(assignment) {
+        if (this.leftParam >= assignment.length) {
+            return ConstraintResult.Unknown;
+        }
+        const leftVal = assignment[this.leftParam];
+        if (leftVal === UNASSIGNED) {
+            return ConstraintResult.Unknown;
+        }
+        if (leftVal >= this.leftValues.length || !isNumeric(this.leftValues[leftVal])) {
+            return ConstraintResult.False;
+        }
+        const leftNum = toDouble(this.leftValues[leftVal]);
+        if (this.isParamComparison) {
+            if (this.rightParam >= assignment.length) {
+                return ConstraintResult.Unknown;
+            }
+            const rightVal = assignment[this.rightParam];
+            if (rightVal === UNASSIGNED) {
+                return ConstraintResult.Unknown;
+            }
+            if (rightVal >= this.rightValues.length || !isNumeric(this.rightValues[rightVal])) {
+                return ConstraintResult.False;
+            }
+            const rightNum = toDouble(this.rightValues[rightVal]);
+            return this.compareValues(leftNum, rightNum) ? ConstraintResult.True : ConstraintResult.False;
+        }
+        return this.compareValues(leftNum, this.literal)
+            ? ConstraintResult.True
+            : ConstraintResult.False;
+    }
+    compareValues(left, right) {
+        switch (this.op) {
+            case RelOp.Less:
+                return left < right;
+            case RelOp.LessEqual:
+                return left <= right;
+            case RelOp.Greater:
+                return left > right;
+            case RelOp.GreaterEqual:
+                return left >= right;
+        }
+    }
+}
+/**
+ * IN-set membership test: param IN {val1, val2, ...}.
+ *
+ * Three-valued: unassigned -> Unknown, value in set -> True, else False.
+ */
+export class InNode {
+    constructor(paramIndex, valueIndices) {
+        this.paramIndex = paramIndex;
+        this.valueIndices = valueIndices;
+    }
+    evaluate(assignment) {
+        if (this.paramIndex >= assignment.length) {
+            return ConstraintResult.Unknown;
+        }
+        const val = assignment[this.paramIndex];
+        if (val === UNASSIGNED) {
+            return ConstraintResult.Unknown;
+        }
+        for (const vi of this.valueIndices) {
+            if (val === vi) {
+                return ConstraintResult.True;
+            }
+        }
+        return ConstraintResult.False;
+    }
+}
+/**
+ * LIKE pattern matching: param LIKE pattern.
+ *
+ * Supports `*` (any string) and `?` (single character) wildcards.
+ * Matching results are precomputed at construction time for efficiency.
+ */
+export class LikeNode {
+    constructor(paramIndex, pattern, paramValues) {
+        this.paramIndex = paramIndex;
+        this.matches = paramValues.map((v) => globMatch(pattern, v));
+    }
+    evaluate(assignment) {
+        if (this.paramIndex >= assignment.length) {
+            return ConstraintResult.Unknown;
+        }
+        const val = assignment[this.paramIndex];
+        if (val === UNASSIGNED) {
+            return ConstraintResult.Unknown;
+        }
+        if (val >= this.matches.length) {
+            return ConstraintResult.False;
+        }
+        return this.matches[val] ? ConstraintResult.True : ConstraintResult.False;
+    }
+}
+/** Test whether a string matches a glob pattern (* and ?). */
+export function globMatch(pattern, text) {
+    let pi = 0;
+    let ti = 0;
+    let starPi = -1;
+    let starTi = 0;
+    while (ti < text.length) {
+        if (pi < pattern.length && (pattern[pi] === '?' || pattern[pi] === text[ti])) {
+            pi++;
+            ti++;
+        }
+        else if (pi < pattern.length && pattern[pi] === '*') {
+            starPi = pi;
+            starTi = ti;
+            pi++;
+        }
+        else if (starPi !== -1) {
+            pi = starPi + 1;
+            starTi++;
+            ti = starTi;
+        }
+        else {
+            return false;
+        }
+    }
+    while (pi < pattern.length && pattern[pi] === '*') {
+        pi++;
+    }
+    return pi === pattern.length;
+}
+/**
+ * Parameter-to-parameter equality comparison.
+ *
+ * Compares the string values of two parameters. Equal if the string
+ * representations are identical.
+ */
+export class ParamEqualsNode {
+    constructor(leftParam, rightParam, leftValues, rightValues) {
+        this.leftParam = leftParam;
+        this.rightParam = rightParam;
+        this.leftValues = leftValues;
+        this.rightValues = rightValues;
+    }
+    evaluate(assignment) {
+        if (this.leftParam >= assignment.length || this.rightParam >= assignment.length) {
+            return ConstraintResult.Unknown;
+        }
+        const lv = assignment[this.leftParam];
+        const rv = assignment[this.rightParam];
+        if (lv === UNASSIGNED || rv === UNASSIGNED) {
+            return ConstraintResult.Unknown;
+        }
+        if (lv >= this.leftValues.length || rv >= this.rightValues.length) {
+            return ConstraintResult.False;
+        }
+        return this.leftValues[lv] === this.rightValues[rv]
+            ? ConstraintResult.True
+            : ConstraintResult.False;
+    }
+}
+/**
+ * Parameter-to-parameter inequality comparison.
+ *
+ * Compares the string values of two parameters. Not equal if the string
+ * representations differ.
+ */
+export class ParamNotEqualsNode {
+    constructor(leftParam, rightParam, leftValues, rightValues) {
+        this.leftParam = leftParam;
+        this.rightParam = rightParam;
+        this.leftValues = leftValues;
+        this.rightValues = rightValues;
+    }
+    evaluate(assignment) {
+        if (this.leftParam >= assignment.length || this.rightParam >= assignment.length) {
+            return ConstraintResult.Unknown;
+        }
+        const lv = assignment[this.leftParam];
+        const rv = assignment[this.rightParam];
+        if (lv === UNASSIGNED || rv === UNASSIGNED) {
+            return ConstraintResult.Unknown;
+        }
+        if (lv >= this.leftValues.length || rv >= this.rightValues.length) {
+            return ConstraintResult.False;
+        }
+        return this.leftValues[lv] !== this.rightValues[rv]
+            ? ConstraintResult.True
+            : ConstraintResult.False;
+    }
+}
+//# sourceMappingURL=constraint-ast.js.map

package/dist/src/ts/model/constraint-ast.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"constraint-ast.js","sourceRoot":"","sources":["../../../../src/ts/model/constraint-ast.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAE1E,yDAAyD;AACzD,MAAM,CAAC,MAAM,UAAU,GAAG,UAAU,CAAC;AAErC,sEAAsE;AACtE,MAAM,CAAN,IAAY,gBAIX;AAJD,WAAY,gBAAgB;IAC1B,iCAAa,CAAA;IACb,mCAAe,CAAA;IACf,uCAAmB,CAAA;AACrB,CAAC,EAJW,gBAAgB,KAAhB,gBAAgB,QAI3B;AAED,0DAA0D;AAC1D,SAAS,SAAS,CAAC,CAAS;IAC1B,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACnB,OAAO,KAAK,CAAC;IACf,CAAC;IACD,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACpB,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;AAChD,CAAC;AAED,kCAAkC;AAClC,SAAS,QAAQ,CAAC,CAAS;IACzB,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC;AACnB,CAAC;AAQD,uDAAuD;AACvD,MAAM,OAAO,UAAU;IACrB,YACW,UAAkB,EAClB,UAAkB;QADlB,eAAU,GAAV,UAAU,CAAQ;QAClB,eAAU,GAAV,UAAU,CAAQ;IAC1B,CAAC;IAEJ,QAAQ,CAAC,UAAoB;QAC3B,IAAI,IAAI,CAAC,UAAU,IAAI,UAAU,CAAC,MAAM,EAAE,CAAC;YACzC,OAAO,gBAAgB,CAAC,OAAO,CAAC;QAClC,CAAC;QACD,MAAM,GAAG,GAAG,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACxC,IAAI,GAAG,KAAK,UAAU,EAAE,CAAC;YACvB,OAAO,gBAAgB,CAAC,OAAO,CAAC;QAClC,CAAC;QACD,OAAO,GAAG,KAAK,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,gBAAgB,CAAC,KAAK,CAAC;IAClF,CAAC;CACF;AAED,yDAAyD;AACzD,MAAM,OAAO,aAAa;IACxB,YACW,UAAkB,EAClB,UAAkB;QADlB,eAAU,GAAV,UAAU,CAAQ;QAClB,eAAU,GAAV,UAAU,CAAQ;IAC1B,CAAC;IAEJ,QAAQ,CAAC,UAAoB;QAC3B,IAAI,IAAI,CAAC,UAAU,IAAI,UAAU,CAAC,MAAM,EAAE,CAAC;YACzC,OAAO,gBAAgB,CAAC,OAAO,CAAC;QAClC,CAAC;QACD,MAAM,GAAG,GAAG,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACxC,IAAI,GAAG,KAAK,UAAU,EAAE,CAAC;YACvB,OAAO,gBAAgB,CAAC,OAAO,CAAC;QAClC,CAAC;QACD,OAAO,GAAG,KAAK,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,gBAAgB,CAAC,KAAK,CAAC;IAClF,CAAC;CACF;AAED,0CAA0C;AAC1C,MAAM,OAAO,OAAO;IAClB,YACmB,IAAoB,EACpB,KAAqB;QADrB,SAAI,GAAJ,IAAI,CAAgB;QACpB,UAAK,GAAL,KAAK,CAAgB;IACrC,CAAC;IAEJ,QAAQ,CAAC,UAAoB;QAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;QACzC,IAAI,CAAC,KAAK,gBAAgB,CAAC,KAAK,EAAE,CAAC;YACjC,OAAO,gBAAgB,CAAC,KAAK,CAAC;QAChC,CAAC;QACD,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;QAC1C,IAAI,CAAC,KAAK,gBAAgB,CAAC,KAAK,EAAE,CAAC;YACjC,OAAO,gBAAgB,CAAC,KAAK,CAAC;QAChC,CAAC;QACD,IAAI,CAAC,KAAK,gBAAgB,CAAC,IAAI,IAAI,CAAC,KAAK,gBAAgB,CAAC,IAAI,EAAE,CAAC;YAC/D,OAAO,gBAAgB,CAAC,IAAI,CAAC;QAC/B,CAAC;QACD,OAAO,gBAAgB,CAAC,OAAO,CAAC;IAClC,CAAC;CACF;AAED,yCAAyC;AACzC,MAAM,OAAO,MAAM;IACjB,YACmB,IAAoB,EACpB,KAAqB;QADrB,SAAI,GAAJ,IAAI,CAAgB;QACpB,UAAK,GAAL,KAAK,CAAgB;IACrC,CAAC;IAEJ,QAAQ,CAAC,UAAoB;QAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;QACzC,IAAI,CAAC,KAAK,gBAAgB,CAAC,IAAI,EAAE,CAAC;YAChC,OAAO,gBAAgB,CAAC,IAAI,CAAC;QAC/B,CAAC;QACD,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;QAC1C,IAAI,CAAC,KAAK,gBAAgB,CAAC,IAAI,EAAE,CAAC;YAChC,OAAO,gBAAgB,CAAC,IAAI,CAAC;QAC/B,CAAC;QACD,IAAI,CAAC,KAAK,gBAAgB,CAAC,KAAK,IAAI,CAAC,KAAK,gBAAgB,CAAC,KAAK,EAAE,CAAC;YACjE,OAAO,gBAAgB,CAAC,KAAK,CAAC;QAChC,CAAC;QACD,OAAO,gBAAgB,CAAC,OAAO,CAAC;IAClC,CAAC;CACF;AAED,uCAAuC;AACvC,MAAM,OAAO,OAAO;IAClB,YAA6B,KAAqB;QAArB,UAAK,GAAL,KAAK,CAAgB;IAAG,CAAC;IAEtD,QAAQ,CAAC,UAAoB;QAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;QAC1C,IAAI,CAAC,KAAK,gBAAgB,CAAC,IAAI,EAAE,CAAC;YAChC,OAAO,gBAAgB,CAAC,KAAK,CAAC;QAChC,CAAC;QACD,IAAI,CAAC,KAAK,gBAAgB,CAAC,KAAK,EAAE,CAAC;YACjC,OAAO,gBAAgB,CAAC,IAAI,CAAC;QAC/B,CAAC;QACD,OAAO,gBAAgB,CAAC,OAAO,CAAC;IAClC,CAAC;CACF;AAED,2FAA2F;AAC3F,MAAM,OAAO,WAAW;IACtB,YACmB,UAA0B,EAC1B,UAA0B;QAD1B,eAAU,GAAV,UAAU,CAAgB;QAC1B,eAAU,GAAV,UAAU,CAAgB;IAC1C,CAAC;IAEJ,QAAQ,CAAC,UAAoB;QAC3B,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;QAClD,IAAI,IAAI,KAAK,gBAAgB,CAAC,KAAK,EAAE,CAAC;YACpC,OAAO,gBAAgB,CAAC,IAAI,CAAC;QAC/B,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;QAClD,IAAI,IAAI,KAAK,gBAAgB,CAAC,IAAI,EAAE,CAAC;YACnC,OAAO,IAAI,CAAC;QACd,CAAC;QACD,kBAAkB;QAClB,IAAI,IAAI,KAAK,gBAAgB,CAAC,IAAI,EAAE,CAAC;YACnC,OAAO,gBAAgB,CAAC,IAAI,CAAC;QAC/B,CAAC;QACD,OAAO,gBAAgB,CAAC,OAAO,CAAC;IAClC,CAAC;CACF;AAED;;;;;;;GAOG;AACH,MAAM,OAAO,cAAc;IACzB,YACmB,SAAyB,EACzB,UAA0B,EAC1B,UAA0B;QAF1B,cAAS,GAAT,SAAS,CAAgB;QACzB,eAAU,GAAV,UAAU,CAAgB;QAC1B,eAAU,GAAV,UAAU,CAAgB;IAC1C,CAAC;IAEJ,QAAQ,CAAC,UAAoB;QAC3B,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;QACjD,IAAI,IAAI,KAAK,gBAAgB,CAAC,IAAI,EAAE,CAAC;YACnC,OAAO,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;QAC9C,CAAC;QACD,IAAI,IAAI,KAAK,gBAAgB,CAAC,KAAK,EAAE,CAAC;YACpC,OAAO,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;QAC9C,CAAC;QACD,+CAA+C;QAC/C,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;QACxD,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;QACxD,IAAI,UAAU,KAAK,UAAU,EAAE,CAAC;YAC9B,OAAO,UAAU,CAAC;QACpB,CAAC;QACD,OAAO,gBAAgB,CAAC,OAAO,CAAC;IAClC,CAAC;CACF;AAED,uCAAuC;AACvC,MAAM,CAAN,IAAY,KAKX;AALD,WAAY,KAAK;IACf,mBAAU,CAAA;IACV,yBAAgB,CAAA;IAChB,sBAAa,CAAA;IACb,4BAAmB,CAAA;AACrB,CAAC,EALW,KAAK,KAAL,KAAK,QAKhB;AAED;;;;;GAKG;AACH,MAAM,OAAO,cAAc;IASzB,iEAAiE;IACjE,MAAM,CAAC,WAAW,CAChB,UAAkB,EAClB,EAAS,EACT,OAAe,EACf,WAAqB;QAErB,OAAO,IAAI,cAAc,CAAC,UAAU,EAAE,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,EAAE,WAAW,EAAE,EAAE,CAAC,CAAC;IAChF,CAAC;IAED,uDAAuD;IACvD,MAAM,CAAC,UAAU,CACf,SAAiB,EACjB,EAAS,EACT,UAAkB,EAClB,UAAoB,EACpB,WAAqB;QAErB,OAAO,IAAI,cAAc,CAAC,SAAS,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,UAAU,EAAE,UAAU,EAAE,WAAW,CAAC,CAAC;IACzF,CAAC;IAED,YACE,SAAiB,EACjB,EAAS,EACT,iBAA0B,EAC1B,OAAe,EACf,UAAkB,EAClB,UAAoB,EACpB,WAAqB;QAErB,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;QACb,IAAI,CAAC,iBAAiB,GAAG,iBAAiB,CAAC;QAC3C,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;IACjC,CAAC;IAED,QAAQ,CAAC,UAAoB;QAC3B,IAAI,IAAI,CAAC,SAAS,IAAI,UAAU,CAAC,MAAM,EAAE,CAAC;YACxC,OAAO,gBAAgB,CAAC,OAAO,CAAC;QAClC,CAAC;QACD,MAAM,OAAO,GAAG,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC3C,IAAI,OAAO,KAAK,UAAU,EAAE,CAAC;YAC3B,OAAO,gBAAgB,CAAC,OAAO,CAAC;QAClC,CAAC;QAED,IAAI,OAAO,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC;YAC9E,OAAO,gBAAgB,CAAC,KAAK,CAAC;QAChC,CAAC;QACD,MAAM,OAAO,GAAG,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC;QAEnD,IAAI,IAAI,CAAC,iBAAiB,EAAE,CAAC;YAC3B,IAAI,IAAI,CAAC,UAAU,IAAI,UAAU,CAAC,MAAM,EAAE,CAAC;gBACzC,OAAO,gBAAgB,CAAC,OAAO,CAAC;YAClC,CAAC;YACD,MAAM,QAAQ,GAAG,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAC7C,IAAI,QAAQ,KAAK,UAAU,EAAE,CAAC;gBAC5B,OAAO,gBAAgB,CAAC,OAAO,CAAC;YAClC,CAAC;YACD,IAAI,QAAQ,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC;gBAClF,OAAO,gBAAgB,CAAC,KAAK,CAAC;YAChC,CAAC;YACD,MAAM,QAAQ,GAAG,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC;YACtD,OAAO,IAAI,CAAC,aAAa,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,gBAAgB,CAAC,KAAK,CAAC;QAChG,CAAC;QAED,OAAO,IAAI,CAAC,aAAa,CAAC,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC;YAC9C,CAAC,CAAC,gBAAgB,CAAC,IAAI;YACvB,CAAC,CAAC,gBAAgB,CAAC,KAAK,CAAC;IAC7B,CAAC;IAEO,aAAa,CAAC,IAAY,EAAE,KAAa;QAC/C,QAAQ,IAAI,CAAC,EAAE,EAAE,CAAC;YAChB,KAAK,KAAK,CAAC,IAAI;gBACb,OAAO,IAAI,GAAG,KAAK,CAAC;YACtB,KAAK,KAAK,CAAC,SAAS;gBAClB,OAAO,IAAI,IAAI,KAAK,CAAC;YACvB,KAAK,KAAK,CAAC,OAAO;gBAChB,OAAO,IAAI,GAAG,KAAK,CAAC;YACtB,KAAK,KAAK,CAAC,YAAY;gBACrB,OAAO,IAAI,IAAI,KAAK,CAAC;QACzB,CAAC;IACH,CAAC;CACF;AAED;;;;GAIG;AACH,MAAM,OAAO,MAAM;IACjB,YACmB,UAAkB,EAClB,YAAsB;QADtB,eAAU,GAAV,UAAU,CAAQ;QAClB,iBAAY,GAAZ,YAAY,CAAU;IACtC,CAAC;IAEJ,QAAQ,CAAC,UAAoB;QAC3B,IAAI,IAAI,CAAC,UAAU,IAAI,UAAU,CAAC,MAAM,EAAE,CAAC;YACzC,OAAO,gBAAgB,CAAC,OAAO,CAAC;QAClC,CAAC;QACD,MAAM,GAAG,GAAG,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACxC,IAAI,GAAG,KAAK,UAAU,EAAE,CAAC;YACvB,OAAO,gBAAgB,CAAC,OAAO,CAAC;QAClC,CAAC;QACD,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACnC,IAAI,GAAG,KAAK,EAAE,EAAE,CAAC;gBACf,OAAO,gBAAgB,CAAC,IAAI,CAAC;YAC/B,CAAC;QACH,CAAC;QACD,OAAO,gBAAgB,CAAC,KAAK,CAAC;IAChC,CAAC;CACF;AAED;;;;;GAKG;AACH,MAAM,OAAO,QAAQ;IAInB,YAAY,UAAkB,EAAE,OAAe,EAAE,WAAqB;QACpE,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC;IAC/D,CAAC;IAED,QAAQ,CAAC,UAAoB;QAC3B,IAAI,IAAI,CAAC,UAAU,IAAI,UAAU,CAAC,MAAM,EAAE,CAAC;YACzC,OAAO,gBAAgB,CAAC,OAAO,CAAC;QAClC,CAAC;QACD,MAAM,GAAG,GAAG,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACxC,IAAI,GAAG,KAAK,UAAU,EAAE,CAAC;YACvB,OAAO,gBAAgB,CAAC,OAAO,CAAC;QAClC,CAAC;QACD,IAAI,GAAG,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;YAC/B,OAAO,gBAAgB,CAAC,KAAK,CAAC;QAChC,CAAC;QACD,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,gBAAgB,CAAC,KAAK,CAAC;IAC5E,CAAC;CACF;AAED,8DAA8D;AAC9D,MAAM,UAAU,SAAS,CAAC,OAAe,EAAE,IAAY;IACrD,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,MAAM,GAAG,CAAC,CAAC,CAAC;IAChB,IAAI,MAAM,GAAG,CAAC,CAAC;IAEf,OAAO,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QACxB,IAAI,EAAE,GAAG,OAAO,CAAC,MAAM,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,KAAK,GAAG,IAAI,OAAO,CAAC,EAAE,CAAC,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;YAC7E,EAAE,EAAE,CAAC;YACL,EAAE,EAAE,CAAC;QACP,CAAC;aAAM,IAAI,EAAE,GAAG,OAAO,CAAC,MAAM,IAAI,OAAO,CAAC,EAAE,CAAC,KAAK,GAAG,EAAE,CAAC;YACtD,MAAM,GAAG,EAAE,CAAC;YACZ,MAAM,GAAG,EAAE,CAAC;YACZ,EAAE,EAAE,CAAC;QACP,CAAC;aAAM,IAAI,MAAM,KAAK,CAAC,CAAC,EAAE,CAAC;YACzB,EAAE,GAAG,MAAM,GAAG,CAAC,CAAC;YAChB,MAAM,EAAE,CAAC;YACT,EAAE,GAAG,MAAM,CAAC;QACd,CAAC;aAAM,CAAC;YACN,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IAED,OAAO,EAAE,GAAG,OAAO,CAAC,MAAM,IAAI,OAAO,CAAC,EAAE,CAAC,KAAK,GAAG,EAAE,CAAC;QAClD,EAAE,EAAE,CAAC;IACP,CAAC;IACD,OAAO,EAAE,KAAK,OAAO,CAAC,MAAM,CAAC;AAC/B,CAAC;AAED;;;;;GAKG;AACH,MAAM,OAAO,eAAe;IAC1B,YACmB,SAAiB,EACjB,UAAkB,EAClB,UAAoB,EACpB,WAAqB;QAHrB,cAAS,GAAT,SAAS,CAAQ;QACjB,eAAU,GAAV,UAAU,CAAQ;QAClB,eAAU,GAAV,UAAU,CAAU;QACpB,gBAAW,GAAX,WAAW,CAAU;IACrC,CAAC;IAEJ,QAAQ,CAAC,UAAoB;QAC3B,IAAI,IAAI,CAAC,SAAS,IAAI,UAAU,CAAC,MAAM,IAAI,IAAI,CAAC,UAAU,IAAI,UAAU,CAAC,MAAM,EAAE,CAAC;YAChF,OAAO,gBAAgB,CAAC,OAAO,CAAC;QAClC,CAAC;QACD,MAAM,EAAE,GAAG,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACtC,MAAM,EAAE,GAAG,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACvC,IAAI,EAAE,KAAK,UAAU,IAAI,EAAE,KAAK,UAAU,EAAE,CAAC;YAC3C,OAAO,gBAAgB,CAAC,OAAO,CAAC;QAClC,CAAC;QACD,IAAI,EAAE,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,IAAI,EAAE,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC;YAClE,OAAO,gBAAgB,CAAC,KAAK,CAAC;QAChC,CAAC;QACD,OAAO,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,KAAK,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC;YACjD,CAAC,CAAC,gBAAgB,CAAC,IAAI;YACvB,CAAC,CAAC,gBAAgB,CAAC,KAAK,CAAC;IAC7B,CAAC;CACF;AAED;;;;;GAKG;AACH,MAAM,OAAO,kBAAkB;IAC7B,YACmB,SAAiB,EACjB,UAAkB,EAClB,UAAoB,EACpB,WAAqB;QAHrB,cAAS,GAAT,SAAS,CAAQ;QACjB,eAAU,GAAV,UAAU,CAAQ;QAClB,eAAU,GAAV,UAAU,CAAU;QACpB,gBAAW,GAAX,WAAW,CAAU;IACrC,CAAC;IAEJ,QAAQ,CAAC,UAAoB;QAC3B,IAAI,IAAI,CAAC,SAAS,IAAI,UAAU,CAAC,MAAM,IAAI,IAAI,CAAC,UAAU,IAAI,UAAU,CAAC,MAAM,EAAE,CAAC;YAChF,OAAO,gBAAgB,CAAC,OAAO,CAAC;QAClC,CAAC;QACD,MAAM,EAAE,GAAG,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACtC,MAAM,EAAE,GAAG,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACvC,IAAI,EAAE,KAAK,UAAU,IAAI,EAAE,KAAK,UAAU,EAAE,CAAC;YAC3C,OAAO,gBAAgB,CAAC,OAAO,CAAC;QAClC,CAAC;QACD,IAAI,EAAE,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,IAAI,EAAE,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC;YAClE,OAAO,gBAAgB,CAAC,KAAK,CAAC;QAChC,CAAC;QACD,OAAO,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,KAAK,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC;YACjD,CAAC,CAAC,gBAAgB,CAAC,IAAI;YACvB,CAAC,CAAC,gBAAgB,CAAC,KAAK,CAAC;IAC7B,CAAC;CACF"}

package/dist/src/ts/model/constraint-parser.d.ts

@@ -0,0 +1,49 @@
+import { type ConstraintNode } from './constraint-ast.js';
+import { type ErrorInfo } from './error.js';
+/** Minimal parameter interface required by the constraint parser. */
+export interface Parameter {
+    name: string;
+    values: string[];
+    /** Find a value index by name, checking both primary values and aliases. */
+    findValueIndex(name: string, caseSensitive: boolean): number;
+}
+/** Result of parsing a constraint expression. */
+export interface ParseResult {
+    constraint: ConstraintNode | null;
+    error: ErrorInfo;
+}
+/** Options controlling constraint parsing behavior. */
+export interface ParseOptions {
+    /**
+     * When false (default), parameter and value name resolution
+     * is case-insensitive. When true, exact match is required.
+     */
+    caseSensitive: boolean;
+}
+/**
+ * Parse a human-readable constraint expression into an AST.
+ *
+ * Supported syntax examples:
+ *   "IF os=mac THEN browser!=ie"
+ *   "IF os=mac THEN browser!=ie ELSE arch!=arm"
+ *   "NOT (os=win AND browser=safari)"
+ *   "os=linux IMPLIES arch!=arm"
+ *   "os=win OR browser=chrome"
+ *   "NOT os=linux"
+ *   "version > 3"
+ *   "env IN {staging, prod}"
+ *   "browser LIKE chrome*"
+ *   "start_date < end_date"   (parameter-to-parameter comparison)
+ *
+ * Keywords (case-insensitive): IF, THEN, ELSE, IMPLIES, AND, OR, NOT, IN, LIKE
+ * Operators: = != > >= < <=
+ * Parentheses: ( )
+ * Set literals: { value1, value2, ... }
+ *
+ * @param expression The constraint string to parse.
+ * @param params The parameter definitions (used to resolve names to indices).
+ * @param options Parsing options (e.g., case sensitivity). Defaults to case-insensitive.
+ * @returns ParseResult with the AST on success, or an error on failure.
+ */
+export declare function parseConstraint(expression: string, params: Parameter[], options?: ParseOptions): ParseResult;
+//# sourceMappingURL=constraint-parser.d.ts.map

package/dist/src/ts/model/constraint-parser.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"constraint-parser.d.ts","sourceRoot":"","sources":["../../../../src/ts/model/constraint-parser.ts"],"names":[],"mappings":"AAEA,OAAO,EAEL,KAAK,cAAc,EAapB,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAAa,KAAK,SAAS,EAAW,MAAM,YAAY,CAAC;AAEhE,qEAAqE;AACrE,MAAM,WAAW,SAAS;IACxB,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,4EAA4E;IAC5E,cAAc,CAAC,IAAI,EAAE,MAAM,EAAE,aAAa,EAAE,OAAO,GAAG,MAAM,CAAC;CAC9D;AAED,iDAAiD;AACjD,MAAM,WAAW,WAAW;IAC1B,UAAU,EAAE,cAAc,GAAG,IAAI,CAAC;IAClC,KAAK,EAAE,SAAS,CAAC;CAClB;AAED,uDAAuD;AACvD,MAAM,WAAW,YAAY;IAC3B;;;OAGG;IACH,aAAa,EAAE,OAAO,CAAC;CACxB;AAs8BD;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,wBAAgB,eAAe,CAC7B,UAAU,EAAE,MAAM,EAClB,MAAM,EAAE,SAAS,EAAE,EACnB,OAAO,GAAE,YAAuC,GAC/C,WAAW,CAmBb"}