@bubblyworld/scip-ts 0.0.1

package/dist/index.node.js

@@ -0,0 +1,459 @@
+import { readFileSync } from 'fs';
+
+/** Loads a fresh SCIP WebAssembly module with the given options. */
+async function loadSCIPModule(options) {
+    const createModule = await loadSCIPFactory();
+    const consoleConfig = options?.console ?? { log: null, error: null };
+    const moduleOptions = {
+        print: consoleConfig.log ?? (() => { }),
+        printErr: consoleConfig.error ?? (() => { }),
+    };
+    return createModule(moduleOptions);
+}
+async function loadSCIPFactory() {
+    const { default: SCIPModuleFactory } = await import(new URL('../build/scip.js', import.meta.url).href);
+    return SCIPModuleFactory;
+}
+
+const SCIP_STATUS_MAP = {
+    0: 'unknown',
+    1: 'optimal',
+    2: 'infeasible',
+    3: 'unbounded',
+    4: 'inforunbd',
+    5: 'timelimit',
+    6: 'nodelimit',
+    7: 'stallnodelimit',
+    8: 'gaplimit',
+    9: 'sollimit',
+    10: 'bestsollimit',
+    11: 'restartlimit',
+};
+/** Low-level wrapper around the SCIP optimization solver. */
+let SCIP$1 = class SCIP {
+    constructor(module, scipPtr) {
+        this.freed = false;
+        this.module = module;
+        this.scipPtr = scipPtr;
+    }
+    /** Creates a new SCIP solver instance. */
+    static async create(options) {
+        const module = await loadSCIPModule(options);
+        const scipPtrPtr = module._malloc(4);
+        try {
+            module.ccall('SCIPcreate', 'number', ['number'], [scipPtrPtr]);
+            const scipPtr = module.getValue(scipPtrPtr, 'i32');
+            if (scipPtr === 0) {
+                throw new Error('SCIPcreate failed to create instance');
+            }
+            module.ccall('SCIPincludeDefaultPlugins', 'number', ['number'], [scipPtr]);
+            return new SCIP(module, scipPtr);
+        }
+        finally {
+            module._free(scipPtrPtr);
+        }
+    }
+    /** Reads a problem from a string in the given format (e.g., 'lp', 'mps'). */
+    async readProblemFromString(content, format) {
+        this.ensureNotFreed();
+        const filename = `/tmp/problem.${format}`;
+        this.module.FS.writeFile(filename, content);
+        try {
+            this.module.ccall('SCIPreadProb', 'number', ['number', 'string', 'string'], [this.scipPtr, filename, format]);
+        }
+        finally {
+            try {
+                this.module.FS.unlink(filename);
+            }
+            catch {
+                // Ignore cleanup errors
+            }
+        }
+    }
+    /** Solves the loaded problem and returns the result. */
+    async solve() {
+        this.ensureNotFreed();
+        this.module.ccall('SCIPsolve', 'number', ['number'], [this.scipPtr]);
+        const statusCode = this.module.ccall('SCIPgetStatus', 'number', ['number'], [this.scipPtr]);
+        const status = SCIP_STATUS_MAP[statusCode] ?? 'unknown';
+        const result = { status };
+        if (status === 'optimal' || status === 'timelimit' || status === 'gaplimit' ||
+            status === 'sollimit' || status === 'bestsollimit') {
+            const solPtr = this.module.ccall('SCIPgetBestSol', 'number', ['number'], [this.scipPtr]);
+            if (solPtr !== 0) {
+                result.objective = this.module.ccall('SCIPgetSolOrigObj', 'number', ['number', 'number'], [this.scipPtr, solPtr]);
+                result.solution = this.extractSolution(solPtr);
+            }
+        }
+        return result;
+    }
+    extractSolution(solPtr) {
+        const solution = new Map();
+        const nVars = this.module.ccall('SCIPgetNOrigVars', 'number', ['number'], [this.scipPtr]);
+        const varsPtr = this.module.ccall('SCIPgetOrigVars', 'number', ['number'], [this.scipPtr]);
+        for (let i = 0; i < nVars; i++) {
+            const varPtr = this.module.getValue(varsPtr + i * 4, 'i32');
+            const namePtr = this.module.ccall('SCIPvarGetName', 'number', ['number'], [varPtr]);
+            const name = this.module.UTF8ToString(namePtr);
+            const value = this.module.ccall('SCIPgetSolVal', 'number', ['number', 'number', 'number'], [this.scipPtr, solPtr, varPtr]);
+            solution.set(name, value);
+        }
+        return solution;
+    }
+    /** Frees the SCIP instance. Safe to call multiple times. */
+    free() {
+        if (this.freed) {
+            return;
+        }
+        const scipPtrPtr = this.module._malloc(4);
+        try {
+            this.module.setValue(scipPtrPtr, this.scipPtr, 'i32');
+            this.module.ccall('SCIPfree', 'number', ['number'], [scipPtrPtr]);
+        }
+        finally {
+            this.module._free(scipPtrPtr);
+        }
+        this.freed = true;
+    }
+    ensureNotFreed() {
+        if (this.freed) {
+            throw new Error('SCIP instance has been freed');
+        }
+    }
+};
+
+/** A linear constraint: expr sense rhs (e.g., x + y <= 10). */
+class Constraint {
+    /** @internal Use leq(), geq(), or eq() methods on expressions instead. */
+    constructor(expr, sense, rhs, name) {
+        this.expr = expr;
+        this.sense = sense;
+        this.rhs = rhs;
+        this.name = name;
+    }
+}
+
+/** A linear expression: sum of terms plus a constant. */
+class LinExpr {
+    /** @internal Use variable arithmetic methods (plus, minus, times) instead. */
+    constructor(terms, constant) {
+        this.terms = terms;
+        this.constant = constant;
+    }
+    /** Returns this + other. */
+    plus(other) {
+        if (typeof other === 'number') {
+            return new LinExpr(this.terms, this.constant + other);
+        }
+        if (other instanceof LinExpr) {
+            return new LinExpr([...this.terms, ...other.terms], this.constant + other.constant);
+        }
+        return new LinExpr([...this.terms, { coeff: 1, var: other }], this.constant);
+    }
+    /** Returns this - other. */
+    minus(other) {
+        if (typeof other === 'number') {
+            return new LinExpr(this.terms, this.constant - other);
+        }
+        if (other instanceof LinExpr) {
+            const negatedTerms = other.terms.map((t) => ({ coeff: -t.coeff, var: t.var }));
+            return new LinExpr([...this.terms, ...negatedTerms], this.constant - other.constant);
+        }
+        return new LinExpr([...this.terms, { coeff: -1, var: other }], this.constant);
+    }
+    /** Returns coeff * this. */
+    times(coeff) {
+        return new LinExpr(this.terms.map((t) => ({ coeff: t.coeff * coeff, var: t.var })), this.constant * coeff);
+    }
+    /** Returns -this. */
+    neg() {
+        return this.times(-1);
+    }
+    /** Returns a constraint: this <= rhs. */
+    leq(rhs) {
+        return new Constraint(this, '<=', rhs);
+    }
+    /** Returns a constraint: this >= rhs. */
+    geq(rhs) {
+        return new Constraint(this, '>=', rhs);
+    }
+    /** Returns a constraint: this == rhs. */
+    eq(rhs) {
+        return new Constraint(this, '=', rhs);
+    }
+}
+
+/** A decision variable in an optimization model. */
+class Var {
+    /** @internal Use Model.numVar(), Model.intVar(), or Model.boolVar() instead. */
+    constructor(name, type, lb, ub) {
+        this.name = name;
+        this.type = type;
+        this.lb = lb;
+        this.ub = ub;
+    }
+    toExpr() {
+        return new LinExpr([{ coeff: 1, var: this }], 0);
+    }
+    /** Returns this + other. */
+    plus(other) {
+        return this.toExpr().plus(other);
+    }
+    /** Returns this - other. */
+    minus(other) {
+        return this.toExpr().minus(other);
+    }
+    /** Returns coeff * this. */
+    times(coeff) {
+        return new LinExpr([{ coeff, var: this }], 0);
+    }
+    /** Returns -this. */
+    neg() {
+        return this.times(-1);
+    }
+    /** Returns a constraint: this <= rhs. */
+    leq(rhs) {
+        return this.toExpr().leq(rhs);
+    }
+    /** Returns a constraint: this >= rhs. */
+    geq(rhs) {
+        return this.toExpr().geq(rhs);
+    }
+    /** Returns a constraint: this == rhs. */
+    eq(rhs) {
+        return this.toExpr().eq(rhs);
+    }
+}
+
+/** The result of solving a Model. */
+class Solution {
+    /** @internal Use Model.solve() to obtain a Solution. */
+    constructor(result) {
+        this.status = result.status;
+        this.objective = result.objective;
+        this.values = result.solution ?? new Map();
+    }
+    /** Returns the value of a variable in the solution, or undefined if not found. */
+    getValue(variable) {
+        return this.values.get(variable.name);
+    }
+}
+
+function toLPFormat(input) {
+    const lines = [];
+    if (input.sense === 'maximize') {
+        lines.push('Maximize');
+    }
+    else {
+        lines.push('Minimize');
+    }
+    if (input.objective) {
+        lines.push(`  obj: ${formatExpr(input.objective)}`);
+    }
+    else {
+        lines.push('  obj: 0');
+    }
+    lines.push('Subject To');
+    let constraintIndex = 0;
+    for (const constraint of input.constraints) {
+        const name = constraint.name ?? `c${constraintIndex++}`;
+        const exprStr = formatExpr(constraint.expr);
+        const senseStr = constraint.sense === '=' ? '=' : constraint.sense;
+        const rhs = constraint.rhs - constraint.expr.constant;
+        lines.push(`  ${name}: ${exprStr} ${senseStr} ${formatNumber(rhs)}`);
+    }
+    const boundsLines = [];
+    const generalVars = [];
+    const binaryVars = [];
+    for (const v of input.variables) {
+        if (v.type === 'binary') {
+            binaryVars.push(v.name);
+        }
+        else {
+            if (v.type === 'integer') {
+                generalVars.push(v.name);
+            }
+            const hasNonDefaultBounds = v.lb !== 0 || v.ub !== Infinity;
+            if (hasNonDefaultBounds) {
+                if (v.ub === Infinity) {
+                    boundsLines.push(`  ${formatNumber(v.lb)} <= ${v.name}`);
+                }
+                else {
+                    boundsLines.push(`  ${formatNumber(v.lb)} <= ${v.name} <= ${formatNumber(v.ub)}`);
+                }
+            }
+        }
+    }
+    if (boundsLines.length > 0) {
+        lines.push('Bounds');
+        lines.push(...boundsLines);
+    }
+    if (generalVars.length > 0) {
+        lines.push('General');
+        lines.push(`  ${generalVars.join(' ')}`);
+    }
+    if (binaryVars.length > 0) {
+        lines.push('Binary');
+        lines.push(`  ${binaryVars.join(' ')}`);
+    }
+    lines.push('End');
+    return lines.join('\n') + '\n';
+}
+function formatExpr(expr) {
+    const consolidated = consolidateTerms(expr);
+    if (consolidated.length === 0) {
+        return '0';
+    }
+    const parts = [];
+    for (let i = 0; i < consolidated.length; i++) {
+        const { coeff, varName } = consolidated[i];
+        if (coeff === 0)
+            continue;
+        if (i === 0) {
+            if (coeff === 1) {
+                parts.push(varName);
+            }
+            else if (coeff === -1) {
+                parts.push(`- ${varName}`);
+            }
+            else if (coeff < 0) {
+                parts.push(`- ${formatNumber(-coeff)} ${varName}`);
+            }
+            else {
+                parts.push(`${formatNumber(coeff)} ${varName}`);
+            }
+        }
+        else {
+            if (coeff === 1) {
+                parts.push(`+ ${varName}`);
+            }
+            else if (coeff === -1) {
+                parts.push(`- ${varName}`);
+            }
+            else if (coeff < 0) {
+                parts.push(`- ${formatNumber(-coeff)} ${varName}`);
+            }
+            else {
+                parts.push(`+ ${formatNumber(coeff)} ${varName}`);
+            }
+        }
+    }
+    return parts.join(' ') || '0';
+}
+function consolidateTerms(expr) {
+    const coeffMap = new Map();
+    for (const term of expr.terms) {
+        const current = coeffMap.get(term.var.name) ?? 0;
+        coeffMap.set(term.var.name, current + term.coeff);
+    }
+    const result = [];
+    for (const [varName, coeff] of coeffMap) {
+        if (coeff !== 0) {
+            result.push({ coeff, varName });
+        }
+    }
+    return result;
+}
+function formatNumber(n) {
+    if (Number.isInteger(n)) {
+        return n.toString();
+    }
+    return n.toString();
+}
+
+/** High-level model builder for optimization problems. */
+class Model {
+    constructor() {
+        this.variables = [];
+        this.constraints = [];
+        this.objective = null;
+        this.sense = 'minimize';
+        this.varCounter = 0;
+    }
+    /** Creates a continuous variable with the given bounds and optional name. */
+    numVar(lb = 0, ub = Infinity, name) {
+        const varName = name ?? `x${this.varCounter++}`;
+        const v = new Var(varName, 'continuous', lb, ub);
+        this.variables.push(v);
+        return v;
+    }
+    /** Creates an integer variable with the given bounds and optional name. */
+    intVar(lb = 0, ub = Infinity, name) {
+        const varName = name ?? `x${this.varCounter++}`;
+        const v = new Var(varName, 'integer', lb, ub);
+        this.variables.push(v);
+        return v;
+    }
+    /** Creates a binary (0-1) variable with an optional name. */
+    boolVar(name) {
+        const varName = name ?? `x${this.varCounter++}`;
+        const v = new Var(varName, 'binary', 0, 1);
+        this.variables.push(v);
+        return v;
+    }
+    /** Adds a constraint to the model with an optional name. */
+    addConstraint(constraint, name) {
+        if (name !== undefined) {
+            constraint.name = name;
+        }
+        this.constraints.push(constraint);
+    }
+    /** Sets the objective to minimize the given expression. */
+    minimize(expr) {
+        this.objective = expr instanceof Var ? expr.times(1) : expr;
+        this.sense = 'minimize';
+    }
+    /** Sets the objective to maximize the given expression. */
+    maximize(expr) {
+        this.objective = expr instanceof Var ? expr.times(1) : expr;
+        this.sense = 'maximize';
+    }
+    /** Converts the model to CPLEX LP format. */
+    toLPFormat() {
+        return toLPFormat({
+            objective: this.objective,
+            sense: this.sense,
+            constraints: this.constraints,
+            variables: this.variables,
+        });
+    }
+    /** Solves the model and returns the solution. */
+    async solve(options) {
+        const lpString = this.toLPFormat();
+        const scip = await SCIP$1.create(options);
+        try {
+            await scip.readProblemFromString(lpString, 'lp');
+            const result = await scip.solve();
+            return new Solution(result);
+        }
+        finally {
+            scip.free();
+        }
+    }
+}
+
+/** Returns the sum of the given variables, expressions, and constants. */
+function sum(...items) {
+    let result = new LinExpr([], 0);
+    for (const item of items) {
+        result = result.plus(item);
+    }
+    return result;
+}
+
+/** SCIP solver with Node.js-specific file reading support. */
+class SCIP extends SCIP$1 {
+    /** Reads a problem from a file path. The format is inferred from the extension. */
+    async readProblem(path) {
+        const content = readFileSync(path, 'utf-8');
+        const ext = path.split('.').pop() || 'lp';
+        await this.readProblemFromString(content, ext);
+    }
+    static async create(options) {
+        const base = await SCIP$1.create(options);
+        return Object.setPrototypeOf(base, SCIP.prototype);
+    }
+}
+
+export { Constraint, LinExpr, Model, SCIP, Solution, Var, sum };
+//# sourceMappingURL=index.node.js.map

package/dist/index.node.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.node.js","sources":["module.js","solver.js","model/constraint.js","model/expr.js","model/var.js","model/solution.js","model/lp-format.js","model/model.js","model/helpers.js","index.node.js"],"sourcesContent":["/** Loads a fresh SCIP WebAssembly module with the given options. */\nexport async function loadSCIPModule(options) {\n    const createModule = await loadSCIPFactory();\n    const consoleConfig = options?.console ?? { log: null, error: null };\n    const moduleOptions = {\n        print: consoleConfig.log ?? (() => { }),\n        printErr: consoleConfig.error ?? (() => { }),\n    };\n    return createModule(moduleOptions);\n}\nasync function loadSCIPFactory() {\n    const { default: SCIPModuleFactory } = await import(new URL('../build/scip.js', import.meta.url).href);\n    return SCIPModuleFactory;\n}\n//# sourceMappingURL=module.js.map","import { loadSCIPModule } from './module.js';\nconst SCIP_STATUS_MAP = {\n    0: 'unknown',\n    1: 'optimal',\n    2: 'infeasible',\n    3: 'unbounded',\n    4: 'inforunbd',\n    5: 'timelimit',\n    6: 'nodelimit',\n    7: 'stallnodelimit',\n    8: 'gaplimit',\n    9: 'sollimit',\n    10: 'bestsollimit',\n    11: 'restartlimit',\n};\n/** Low-level wrapper around the SCIP optimization solver. */\nexport class SCIP {\n    constructor(module, scipPtr) {\n        this.freed = false;\n        this.module = module;\n        this.scipPtr = scipPtr;\n    }\n    /** Creates a new SCIP solver instance. */\n    static async create(options) {\n        const module = await loadSCIPModule(options);\n        const scipPtrPtr = module._malloc(4);\n        try {\n            module.ccall('SCIPcreate', 'number', ['number'], [scipPtrPtr]);\n            const scipPtr = module.getValue(scipPtrPtr, 'i32');\n            if (scipPtr === 0) {\n                throw new Error('SCIPcreate failed to create instance');\n            }\n            module.ccall('SCIPincludeDefaultPlugins', 'number', ['number'], [scipPtr]);\n            return new SCIP(module, scipPtr);\n        }\n        finally {\n            module._free(scipPtrPtr);\n        }\n    }\n    /** Reads a problem from a string in the given format (e.g., 'lp', 'mps'). */\n    async readProblemFromString(content, format) {\n        this.ensureNotFreed();\n        const filename = `/tmp/problem.${format}`;\n        this.module.FS.writeFile(filename, content);\n        try {\n            this.module.ccall('SCIPreadProb', 'number', ['number', 'string', 'string'], [this.scipPtr, filename, format]);\n        }\n        finally {\n            try {\n                this.module.FS.unlink(filename);\n            }\n            catch {\n                // Ignore cleanup errors\n            }\n        }\n    }\n    /** Solves the loaded problem and returns the result. */\n    async solve() {\n        this.ensureNotFreed();\n        this.module.ccall('SCIPsolve', 'number', ['number'], [this.scipPtr]);\n        const statusCode = this.module.ccall('SCIPgetStatus', 'number', ['number'], [this.scipPtr]);\n        const status = SCIP_STATUS_MAP[statusCode] ?? 'unknown';\n        const result = { status };\n        if (status === 'optimal' || status === 'timelimit' || status === 'gaplimit' ||\n            status === 'sollimit' || status === 'bestsollimit') {\n            const solPtr = this.module.ccall('SCIPgetBestSol', 'number', ['number'], [this.scipPtr]);\n            if (solPtr !== 0) {\n                result.objective = this.module.ccall('SCIPgetSolOrigObj', 'number', ['number', 'number'], [this.scipPtr, solPtr]);\n                result.solution = this.extractSolution(solPtr);\n            }\n        }\n        return result;\n    }\n    extractSolution(solPtr) {\n        const solution = new Map();\n        const nVars = this.module.ccall('SCIPgetNOrigVars', 'number', ['number'], [this.scipPtr]);\n        const varsPtr = this.module.ccall('SCIPgetOrigVars', 'number', ['number'], [this.scipPtr]);\n        for (let i = 0; i < nVars; i++) {\n            const varPtr = this.module.getValue(varsPtr + i * 4, 'i32');\n            const namePtr = this.module.ccall('SCIPvarGetName', 'number', ['number'], [varPtr]);\n            const name = this.module.UTF8ToString(namePtr);\n            const value = this.module.ccall('SCIPgetSolVal', 'number', ['number', 'number', 'number'], [this.scipPtr, solPtr, varPtr]);\n            solution.set(name, value);\n        }\n        return solution;\n    }\n    /** Frees the SCIP instance. Safe to call multiple times. */\n    free() {\n        if (this.freed) {\n            return;\n        }\n        const scipPtrPtr = this.module._malloc(4);\n        try {\n            this.module.setValue(scipPtrPtr, this.scipPtr, 'i32');\n            this.module.ccall('SCIPfree', 'number', ['number'], [scipPtrPtr]);\n        }\n        finally {\n            this.module._free(scipPtrPtr);\n        }\n        this.freed = true;\n    }\n    ensureNotFreed() {\n        if (this.freed) {\n            throw new Error('SCIP instance has been freed');\n        }\n    }\n}\n//# sourceMappingURL=solver.js.map","/** A linear constraint: expr sense rhs (e.g., x + y <= 10). */\nexport class Constraint {\n    /** @internal Use leq(), geq(), or eq() methods on expressions instead. */\n    constructor(expr, sense, rhs, name) {\n        this.expr = expr;\n        this.sense = sense;\n        this.rhs = rhs;\n        this.name = name;\n    }\n}\n//# sourceMappingURL=constraint.js.map","import { Constraint } from './constraint.js';\n/** A linear expression: sum of terms plus a constant. */\nexport class LinExpr {\n    /** @internal Use variable arithmetic methods (plus, minus, times) instead. */\n    constructor(terms, constant) {\n        this.terms = terms;\n        this.constant = constant;\n    }\n    /** Returns this + other. */\n    plus(other) {\n        if (typeof other === 'number') {\n            return new LinExpr(this.terms, this.constant + other);\n        }\n        if (other instanceof LinExpr) {\n            return new LinExpr([...this.terms, ...other.terms], this.constant + other.constant);\n        }\n        return new LinExpr([...this.terms, { coeff: 1, var: other }], this.constant);\n    }\n    /** Returns this - other. */\n    minus(other) {\n        if (typeof other === 'number') {\n            return new LinExpr(this.terms, this.constant - other);\n        }\n        if (other instanceof LinExpr) {\n            const negatedTerms = other.terms.map((t) => ({ coeff: -t.coeff, var: t.var }));\n            return new LinExpr([...this.terms, ...negatedTerms], this.constant - other.constant);\n        }\n        return new LinExpr([...this.terms, { coeff: -1, var: other }], this.constant);\n    }\n    /** Returns coeff * this. */\n    times(coeff) {\n        return new LinExpr(this.terms.map((t) => ({ coeff: t.coeff * coeff, var: t.var })), this.constant * coeff);\n    }\n    /** Returns -this. */\n    neg() {\n        return this.times(-1);\n    }\n    /** Returns a constraint: this <= rhs. */\n    leq(rhs) {\n        return new Constraint(this, '<=', rhs);\n    }\n    /** Returns a constraint: this >= rhs. */\n    geq(rhs) {\n        return new Constraint(this, '>=', rhs);\n    }\n    /** Returns a constraint: this == rhs. */\n    eq(rhs) {\n        return new Constraint(this, '=', rhs);\n    }\n}\n//# sourceMappingURL=expr.js.map","import { LinExpr } from './expr.js';\n/** A decision variable in an optimization model. */\nexport class Var {\n    /** @internal Use Model.numVar(), Model.intVar(), or Model.boolVar() instead. */\n    constructor(name, type, lb, ub) {\n        this.name = name;\n        this.type = type;\n        this.lb = lb;\n        this.ub = ub;\n    }\n    toExpr() {\n        return new LinExpr([{ coeff: 1, var: this }], 0);\n    }\n    /** Returns this + other. */\n    plus(other) {\n        return this.toExpr().plus(other);\n    }\n    /** Returns this - other. */\n    minus(other) {\n        return this.toExpr().minus(other);\n    }\n    /** Returns coeff * this. */\n    times(coeff) {\n        return new LinExpr([{ coeff, var: this }], 0);\n    }\n    /** Returns -this. */\n    neg() {\n        return this.times(-1);\n    }\n    /** Returns a constraint: this <= rhs. */\n    leq(rhs) {\n        return this.toExpr().leq(rhs);\n    }\n    /** Returns a constraint: this >= rhs. */\n    geq(rhs) {\n        return this.toExpr().geq(rhs);\n    }\n    /** Returns a constraint: this == rhs. */\n    eq(rhs) {\n        return this.toExpr().eq(rhs);\n    }\n}\n//# sourceMappingURL=var.js.map","/** The result of solving a Model. */\nexport class Solution {\n    /** @internal Use Model.solve() to obtain a Solution. */\n    constructor(result) {\n        this.status = result.status;\n        this.objective = result.objective;\n        this.values = result.solution ?? new Map();\n    }\n    /** Returns the value of a variable in the solution, or undefined if not found. */\n    getValue(variable) {\n        return this.values.get(variable.name);\n    }\n}\n//# sourceMappingURL=solution.js.map","export function toLPFormat(input) {\n    const lines = [];\n    if (input.sense === 'maximize') {\n        lines.push('Maximize');\n    }\n    else {\n        lines.push('Minimize');\n    }\n    if (input.objective) {\n        lines.push(`  obj: ${formatExpr(input.objective)}`);\n    }\n    else {\n        lines.push('  obj: 0');\n    }\n    lines.push('Subject To');\n    let constraintIndex = 0;\n    for (const constraint of input.constraints) {\n        const name = constraint.name ?? `c${constraintIndex++}`;\n        const exprStr = formatExpr(constraint.expr);\n        const senseStr = constraint.sense === '=' ? '=' : constraint.sense;\n        const rhs = constraint.rhs - constraint.expr.constant;\n        lines.push(`  ${name}: ${exprStr} ${senseStr} ${formatNumber(rhs)}`);\n    }\n    const boundsLines = [];\n    const generalVars = [];\n    const binaryVars = [];\n    for (const v of input.variables) {\n        if (v.type === 'binary') {\n            binaryVars.push(v.name);\n        }\n        else {\n            if (v.type === 'integer') {\n                generalVars.push(v.name);\n            }\n            const hasNonDefaultBounds = v.lb !== 0 || v.ub !== Infinity;\n            if (hasNonDefaultBounds) {\n                if (v.ub === Infinity) {\n                    boundsLines.push(`  ${formatNumber(v.lb)} <= ${v.name}`);\n                }\n                else {\n                    boundsLines.push(`  ${formatNumber(v.lb)} <= ${v.name} <= ${formatNumber(v.ub)}`);\n                }\n            }\n        }\n    }\n    if (boundsLines.length > 0) {\n        lines.push('Bounds');\n        lines.push(...boundsLines);\n    }\n    if (generalVars.length > 0) {\n        lines.push('General');\n        lines.push(`  ${generalVars.join(' ')}`);\n    }\n    if (binaryVars.length > 0) {\n        lines.push('Binary');\n        lines.push(`  ${binaryVars.join(' ')}`);\n    }\n    lines.push('End');\n    return lines.join('\\n') + '\\n';\n}\nfunction formatExpr(expr) {\n    const consolidated = consolidateTerms(expr);\n    if (consolidated.length === 0) {\n        return '0';\n    }\n    const parts = [];\n    for (let i = 0; i < consolidated.length; i++) {\n        const { coeff, varName } = consolidated[i];\n        if (coeff === 0)\n            continue;\n        if (i === 0) {\n            if (coeff === 1) {\n                parts.push(varName);\n            }\n            else if (coeff === -1) {\n                parts.push(`- ${varName}`);\n            }\n            else if (coeff < 0) {\n                parts.push(`- ${formatNumber(-coeff)} ${varName}`);\n            }\n            else {\n                parts.push(`${formatNumber(coeff)} ${varName}`);\n            }\n        }\n        else {\n            if (coeff === 1) {\n                parts.push(`+ ${varName}`);\n            }\n            else if (coeff === -1) {\n                parts.push(`- ${varName}`);\n            }\n            else if (coeff < 0) {\n                parts.push(`- ${formatNumber(-coeff)} ${varName}`);\n            }\n            else {\n                parts.push(`+ ${formatNumber(coeff)} ${varName}`);\n            }\n        }\n    }\n    return parts.join(' ') || '0';\n}\nfunction consolidateTerms(expr) {\n    const coeffMap = new Map();\n    for (const term of expr.terms) {\n        const current = coeffMap.get(term.var.name) ?? 0;\n        coeffMap.set(term.var.name, current + term.coeff);\n    }\n    const result = [];\n    for (const [varName, coeff] of coeffMap) {\n        if (coeff !== 0) {\n            result.push({ coeff, varName });\n        }\n    }\n    return result;\n}\nfunction formatNumber(n) {\n    if (Number.isInteger(n)) {\n        return n.toString();\n    }\n    return n.toString();\n}\n//# sourceMappingURL=lp-format.js.map","import { SCIP as BaseSCIP } from '../solver.js';\nimport { Var } from './var.js';\nimport { Solution } from './solution.js';\nimport { toLPFormat } from './lp-format.js';\n/** High-level model builder for optimization problems. */\nexport class Model {\n    constructor() {\n        this.variables = [];\n        this.constraints = [];\n        this.objective = null;\n        this.sense = 'minimize';\n        this.varCounter = 0;\n    }\n    /** Creates a continuous variable with the given bounds and optional name. */\n    numVar(lb = 0, ub = Infinity, name) {\n        const varName = name ?? `x${this.varCounter++}`;\n        const v = new Var(varName, 'continuous', lb, ub);\n        this.variables.push(v);\n        return v;\n    }\n    /** Creates an integer variable with the given bounds and optional name. */\n    intVar(lb = 0, ub = Infinity, name) {\n        const varName = name ?? `x${this.varCounter++}`;\n        const v = new Var(varName, 'integer', lb, ub);\n        this.variables.push(v);\n        return v;\n    }\n    /** Creates a binary (0-1) variable with an optional name. */\n    boolVar(name) {\n        const varName = name ?? `x${this.varCounter++}`;\n        const v = new Var(varName, 'binary', 0, 1);\n        this.variables.push(v);\n        return v;\n    }\n    /** Adds a constraint to the model with an optional name. */\n    addConstraint(constraint, name) {\n        if (name !== undefined) {\n            constraint.name = name;\n        }\n        this.constraints.push(constraint);\n    }\n    /** Sets the objective to minimize the given expression. */\n    minimize(expr) {\n        this.objective = expr instanceof Var ? expr.times(1) : expr;\n        this.sense = 'minimize';\n    }\n    /** Sets the objective to maximize the given expression. */\n    maximize(expr) {\n        this.objective = expr instanceof Var ? expr.times(1) : expr;\n        this.sense = 'maximize';\n    }\n    /** Converts the model to CPLEX LP format. */\n    toLPFormat() {\n        return toLPFormat({\n            objective: this.objective,\n            sense: this.sense,\n            constraints: this.constraints,\n            variables: this.variables,\n        });\n    }\n    /** Solves the model and returns the solution. */\n    async solve(options) {\n        const lpString = this.toLPFormat();\n        const scip = await BaseSCIP.create(options);\n        try {\n            await scip.readProblemFromString(lpString, 'lp');\n            const result = await scip.solve();\n            return new Solution(result);\n        }\n        finally {\n            scip.free();\n        }\n    }\n}\n//# sourceMappingURL=model.js.map","import { LinExpr } from './expr.js';\n/** Returns the sum of the given variables, expressions, and constants. */\nexport function sum(...items) {\n    let result = new LinExpr([], 0);\n    for (const item of items) {\n        result = result.plus(item);\n    }\n    return result;\n}\n//# sourceMappingURL=helpers.js.map","import { readFileSync } from 'fs';\nimport { SCIP as BaseSCIP } from './solver.js';\nexport { Model, Var, LinExpr, Constraint, Solution, sum, } from './model/index.js';\n/** SCIP solver with Node.js-specific file reading support. */\nexport class SCIP extends BaseSCIP {\n    /** Reads a problem from a file path. The format is inferred from the extension. */\n    async readProblem(path) {\n        const content = readFileSync(path, 'utf-8');\n        const ext = path.split('.').pop() || 'lp';\n        await this.readProblemFromString(content, ext);\n    }\n    static async create(options) {\n        const base = await BaseSCIP.create(options);\n        return Object.setPrototypeOf(base, SCIP.prototype);\n    }\n}\n//# sourceMappingURL=index.node.js.map"],"names":["BaseSCIP"],"mappings":";;AAAA;AACO,eAAe,cAAc,CAAC,OAAO,EAAE;AAC9C,IAAI,MAAM,YAAY,GAAG,MAAM,eAAe,EAAE;AAChD,IAAI,MAAM,aAAa,GAAG,OAAO,EAAE,OAAO,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE;AACxE,IAAI,MAAM,aAAa,GAAG;AAC1B,QAAQ,KAAK,EAAE,aAAa,CAAC,GAAG,KAAK,MAAM,EAAE,CAAC,CAAC;AAC/C,QAAQ,QAAQ,EAAE,aAAa,CAAC,KAAK,KAAK,MAAM,EAAE,CAAC,CAAC;AACpD,KAAK;AACL,IAAI,OAAO,YAAY,CAAC,aAAa,CAAC;AACtC;AACA,eAAe,eAAe,GAAG;AACjC,IAAI,MAAM,EAAE,OAAO,EAAE,iBAAiB,EAAE,GAAG,MAAM,OAAO,IAAI,GAAG,CAAC,kBAAkB,EAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC;AAC1G,IAAI,OAAO,iBAAiB;AAC5B;;ACZA,MAAM,eAAe,GAAG;AACxB,IAAI,CAAC,EAAE,SAAS;AAChB,IAAI,CAAC,EAAE,SAAS;AAChB,IAAI,CAAC,EAAE,YAAY;AACnB,IAAI,CAAC,EAAE,WAAW;AAClB,IAAI,CAAC,EAAE,WAAW;AAClB,IAAI,CAAC,EAAE,WAAW;AAClB,IAAI,CAAC,EAAE,WAAW;AAClB,IAAI,CAAC,EAAE,gBAAgB;AACvB,IAAI,CAAC,EAAE,UAAU;AACjB,IAAI,CAAC,EAAE,UAAU;AACjB,IAAI,EAAE,EAAE,cAAc;AACtB,IAAI,EAAE,EAAE,cAAc;AACtB,CAAC;AACD;aACO,MAAM,IAAI,CAAC;AAClB,IAAI,WAAW,CAAC,MAAM,EAAE,OAAO,EAAE;AACjC,QAAQ,IAAI,CAAC,KAAK,GAAG,KAAK;AAC1B,QAAQ,IAAI,CAAC,MAAM,GAAG,MAAM;AAC5B,QAAQ,IAAI,CAAC,OAAO,GAAG,OAAO;AAC9B,IAAI;AACJ;AACA,IAAI,aAAa,MAAM,CAAC,OAAO,EAAE;AACjC,QAAQ,MAAM,MAAM,GAAG,MAAM,cAAc,CAAC,OAAO,CAAC;AACpD,QAAQ,MAAM,UAAU,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;AAC5C,QAAQ,IAAI;AACZ,YAAY,MAAM,CAAC,KAAK,CAAC,YAAY,EAAE,QAAQ,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC;AAC1E,YAAY,MAAM,OAAO,GAAG,MAAM,CAAC,QAAQ,CAAC,UAAU,EAAE,KAAK,CAAC;AAC9D,YAAY,IAAI,OAAO,KAAK,CAAC,EAAE;AAC/B,gBAAgB,MAAM,IAAI,KAAK,CAAC,sCAAsC,CAAC;AACvE,YAAY;AACZ,YAAY,MAAM,CAAC,KAAK,CAAC,2BAA2B,EAAE,QAAQ,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC;AACtF,YAAY,OAAO,IAAI,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC;AAC5C,QAAQ;AACR,gBAAgB;AAChB,YAAY,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC;AACpC,QAAQ;AACR,IAAI;AACJ;AACA,IAAI,MAAM,qBAAqB,CAAC,OAAO,EAAE,MAAM,EAAE;AACjD,QAAQ,IAAI,CAAC,cAAc,EAAE;AAC7B,QAAQ,MAAM,QAAQ,GAAG,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;AACjD,QAAQ,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,SAAS,CAAC,QAAQ,EAAE,OAAO,CAAC;AACnD,QAAQ,IAAI;AACZ,YAAY,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,cAAc,EAAE,QAAQ,EAAE,CAAC,QAAQ,EAAE,QAAQ,EAAE,QAAQ,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;AACzH,QAAQ;AACR,gBAAgB;AAChB,YAAY,IAAI;AAChB,gBAAgB,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC;AAC/C,YAAY;AACZ,YAAY,MAAM;AAClB;AACA,YAAY;AACZ,QAAQ;AACR,IAAI;AACJ;AACA,IAAI,MAAM,KAAK,GAAG;AAClB,QAAQ,IAAI,CAAC,cAAc,EAAE;AAC7B,QAAQ,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,WAAW,EAAE,QAAQ,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;AAC5E,QAAQ,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,eAAe,EAAE,QAAQ,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;AACnG,QAAQ,MAAM,MAAM,GAAG,eAAe,CAAC,UAAU,CAAC,IAAI,SAAS;AAC/D,QAAQ,MAAM,MAAM,GAAG,EAAE,MAAM,EAAE;AACjC,QAAQ,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,WAAW,IAAI,MAAM,KAAK,UAAU;AACnF,YAAY,MAAM,KAAK,UAAU,IAAI,MAAM,KAAK,cAAc,EAAE;AAChE,YAAY,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,gBAAgB,EAAE,QAAQ,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;AACpG,YAAY,IAAI,MAAM,KAAK,CAAC,EAAE;AAC9B,gBAAgB,MAAM,CAAC,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,mBAAmB,EAAE,QAAQ,EAAE,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;AACjI,gBAAgB,MAAM,CAAC,QAAQ,GAAG,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC;AAC9D,YAAY;AACZ,QAAQ;AACR,QAAQ,OAAO,MAAM;AACrB,IAAI;AACJ,IAAI,eAAe,CAAC,MAAM,EAAE;AAC5B,QAAQ,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAE;AAClC,QAAQ,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,kBAAkB,EAAE,QAAQ,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;AACjG,QAAQ,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,iBAAiB,EAAE,QAAQ,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;AAClG,QAAQ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE;AACxC,YAAY,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,GAAG,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC;AACvE,YAAY,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,gBAAgB,EAAE,QAAQ,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;AAC/F,YAAY,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,OAAO,CAAC;AAC1D,YAAY,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,eAAe,EAAE,QAAQ,EAAE,CAAC,QAAQ,EAAE,QAAQ,EAAE,QAAQ,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;AACtI,YAAY,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC;AACrC,QAAQ;AACR,QAAQ,OAAO,QAAQ;AACvB,IAAI;AACJ;AACA,IAAI,IAAI,GAAG;AACX,QAAQ,IAAI,IAAI,CAAC,KAAK,EAAE;AACxB,YAAY;AACZ,QAAQ;AACR,QAAQ,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;AACjD,QAAQ,IAAI;AACZ,YAAY,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,EAAE,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC;AACjE,YAAY,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,UAAU,EAAE,QAAQ,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC;AAC7E,QAAQ;AACR,gBAAgB;AAChB,YAAY,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC;AACzC,QAAQ;AACR,QAAQ,IAAI,CAAC,KAAK,GAAG,IAAI;AACzB,IAAI;AACJ,IAAI,cAAc,GAAG;AACrB,QAAQ,IAAI,IAAI,CAAC,KAAK,EAAE;AACxB,YAAY,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC;AAC3D,QAAQ;AACR,IAAI;AACJ;;AC1GA;AACO,MAAM,UAAU,CAAC;AACxB;AACA,IAAI,WAAW,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE;AACxC,QAAQ,IAAI,CAAC,IAAI,GAAG,IAAI;AACxB,QAAQ,IAAI,CAAC,KAAK,GAAG,KAAK;AAC1B,QAAQ,IAAI,CAAC,GAAG,GAAG,GAAG;AACtB,QAAQ,IAAI,CAAC,IAAI,GAAG,IAAI;AACxB,IAAI;AACJ;;ACRA;AACO,MAAM,OAAO,CAAC;AACrB;AACA,IAAI,WAAW,CAAC,KAAK,EAAE,QAAQ,EAAE;AACjC,QAAQ,IAAI,CAAC,KAAK,GAAG,KAAK;AAC1B,QAAQ,IAAI,CAAC,QAAQ,GAAG,QAAQ;AAChC,IAAI;AACJ;AACA,IAAI,IAAI,CAAC,KAAK,EAAE;AAChB,QAAQ,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE;AACvC,YAAY,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;AACjE,QAAQ;AACR,QAAQ,IAAI,KAAK,YAAY,OAAO,EAAE;AACtC,YAAY,OAAO,IAAI,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC;AAC/F,QAAQ;AACR,QAAQ,OAAO,IAAI,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC;AACpF,IAAI;AACJ;AACA,IAAI,KAAK,CAAC,KAAK,EAAE;AACjB,QAAQ,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE;AACvC,YAAY,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;AACjE,QAAQ;AACR,QAAQ,IAAI,KAAK,YAAY,OAAO,EAAE;AACtC,YAAY,MAAM,YAAY,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;AAC1F,YAAY,OAAO,IAAI,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,GAAG,YAAY,CAAC,EAAE,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC;AAChG,QAAQ;AACR,QAAQ,OAAO,IAAI,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC;AACrF,IAAI;AACJ;AACA,IAAI,KAAK,CAAC,KAAK,EAAE;AACjB,QAAQ,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,GAAG,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;AAClH,IAAI;AACJ;AACA,IAAI,GAAG,GAAG;AACV,QAAQ,OAAO,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;AAC7B,IAAI;AACJ;AACA,IAAI,GAAG,CAAC,GAAG,EAAE;AACb,QAAQ,OAAO,IAAI,UAAU,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC;AAC9C,IAAI;AACJ;AACA,IAAI,GAAG,CAAC,GAAG,EAAE;AACb,QAAQ,OAAO,IAAI,UAAU,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC;AAC9C,IAAI;AACJ;AACA,IAAI,EAAE,CAAC,GAAG,EAAE;AACZ,QAAQ,OAAO,IAAI,UAAU,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC;AAC7C,IAAI;AACJ;;AChDA;AACO,MAAM,GAAG,CAAC;AACjB;AACA,IAAI,WAAW,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE;AACpC,QAAQ,IAAI,CAAC,IAAI,GAAG,IAAI;AACxB,QAAQ,IAAI,CAAC,IAAI,GAAG,IAAI;AACxB,QAAQ,IAAI,CAAC,EAAE,GAAG,EAAE;AACpB,QAAQ,IAAI,CAAC,EAAE,GAAG,EAAE;AACpB,IAAI;AACJ,IAAI,MAAM,GAAG;AACb,QAAQ,OAAO,IAAI,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;AACxD,IAAI;AACJ;AACA,IAAI,IAAI,CAAC,KAAK,EAAE;AAChB,QAAQ,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;AACxC,IAAI;AACJ;AACA,IAAI,KAAK,CAAC,KAAK,EAAE;AACjB,QAAQ,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC;AACzC,IAAI;AACJ;AACA,IAAI,KAAK,CAAC,KAAK,EAAE;AACjB,QAAQ,OAAO,IAAI,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;AACrD,IAAI;AACJ;AACA,IAAI,GAAG,GAAG;AACV,QAAQ,OAAO,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;AAC7B,IAAI;AACJ;AACA,IAAI,GAAG,CAAC,GAAG,EAAE;AACb,QAAQ,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC;AACrC,IAAI;AACJ;AACA,IAAI,GAAG,CAAC,GAAG,EAAE;AACb,QAAQ,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC;AACrC,IAAI;AACJ;AACA,IAAI,EAAE,CAAC,GAAG,EAAE;AACZ,QAAQ,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC;AACpC,IAAI;AACJ;;ACzCA;AACO,MAAM,QAAQ,CAAC;AACtB;AACA,IAAI,WAAW,CAAC,MAAM,EAAE;AACxB,QAAQ,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM;AACnC,QAAQ,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,SAAS;AACzC,QAAQ,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,QAAQ,IAAI,IAAI,GAAG,EAAE;AAClD,IAAI;AACJ;AACA,IAAI,QAAQ,CAAC,QAAQ,EAAE;AACvB,QAAQ,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC;AAC7C,IAAI;AACJ;;ACZO,SAAS,UAAU,CAAC,KAAK,EAAE;AAClC,IAAI,MAAM,KAAK,GAAG,EAAE;AACpB,IAAI,IAAI,KAAK,CAAC,KAAK,KAAK,UAAU,EAAE;AACpC,QAAQ,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC;AAC9B,IAAI;AACJ,SAAS;AACT,QAAQ,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC;AAC9B,IAAI;AACJ,IAAI,IAAI,KAAK,CAAC,SAAS,EAAE;AACzB,QAAQ,KAAK,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,UAAU,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;AAC3D,IAAI;AACJ,SAAS;AACT,QAAQ,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC;AAC9B,IAAI;AACJ,IAAI,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC;AAC5B,IAAI,IAAI,eAAe,GAAG,CAAC;AAC3B,IAAI,KAAK,MAAM,UAAU,IAAI,KAAK,CAAC,WAAW,EAAE;AAChD,QAAQ,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,IAAI,CAAC,CAAC,EAAE,eAAe,EAAE,CAAC,CAAC;AAC/D,QAAQ,MAAM,OAAO,GAAG,UAAU,CAAC,UAAU,CAAC,IAAI,CAAC;AACnD,QAAQ,MAAM,QAAQ,GAAG,UAAU,CAAC,KAAK,KAAK,GAAG,GAAG,GAAG,GAAG,UAAU,CAAC,KAAK;AAC1E,QAAQ,MAAM,GAAG,GAAG,UAAU,CAAC,GAAG,GAAG,UAAU,CAAC,IAAI,CAAC,QAAQ;AAC7D,QAAQ,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,EAAE,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AAC5E,IAAI;AACJ,IAAI,MAAM,WAAW,GAAG,EAAE;AAC1B,IAAI,MAAM,WAAW,GAAG,EAAE;AAC1B,IAAI,MAAM,UAAU,GAAG,EAAE;AACzB,IAAI,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,SAAS,EAAE;AACrC,QAAQ,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ,EAAE;AACjC,YAAY,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;AACnC,QAAQ;AACR,aAAa;AACb,YAAY,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,EAAE;AACtC,gBAAgB,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;AACxC,YAAY;AACZ,YAAY,MAAM,mBAAmB,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,QAAQ;AACvE,YAAY,IAAI,mBAAmB,EAAE;AACrC,gBAAgB,IAAI,CAAC,CAAC,EAAE,KAAK,QAAQ,EAAE;AACvC,oBAAoB,WAAW,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;AAC5E,gBAAgB;AAChB,qBAAqB;AACrB,oBAAoB,WAAW,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AACrG,gBAAgB;AAChB,YAAY;AACZ,QAAQ;AACR,IAAI;AACJ,IAAI,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE;AAChC,QAAQ,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC;AAC5B,QAAQ,KAAK,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC;AAClC,IAAI;AACJ,IAAI,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE;AAChC,QAAQ,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC;AAC7B,QAAQ,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AAChD,IAAI;AACJ,IAAI,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE;AAC/B,QAAQ,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC;AAC5B,QAAQ,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AAC/C,IAAI;AACJ,IAAI,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;AACrB,IAAI,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI;AAClC;AACA,SAAS,UAAU,CAAC,IAAI,EAAE;AAC1B,IAAI,MAAM,YAAY,GAAG,gBAAgB,CAAC,IAAI,CAAC;AAC/C,IAAI,IAAI,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE;AACnC,QAAQ,OAAO,GAAG;AAClB,IAAI;AACJ,IAAI,MAAM,KAAK,GAAG,EAAE;AACpB,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AAClD,QAAQ,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,YAAY,CAAC,CAAC,CAAC;AAClD,QAAQ,IAAI,KAAK,KAAK,CAAC;AACvB,YAAY;AACZ,QAAQ,IAAI,CAAC,KAAK,CAAC,EAAE;AACrB,YAAY,IAAI,KAAK,KAAK,CAAC,EAAE;AAC7B,gBAAgB,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC;AACnC,YAAY;AACZ,iBAAiB,IAAI,KAAK,KAAK,EAAE,EAAE;AACnC,gBAAgB,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,CAAC;AAC1C,YAAY;AACZ,iBAAiB,IAAI,KAAK,GAAG,CAAC,EAAE;AAChC,gBAAgB,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,YAAY,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;AAClE,YAAY;AACZ,iBAAiB;AACjB,gBAAgB,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;AAC/D,YAAY;AACZ,QAAQ;AACR,aAAa;AACb,YAAY,IAAI,KAAK,KAAK,CAAC,EAAE;AAC7B,gBAAgB,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,CAAC;AAC1C,YAAY;AACZ,iBAAiB,IAAI,KAAK,KAAK,EAAE,EAAE;AACnC,gBAAgB,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC,CAAC;AAC1C,YAAY;AACZ,iBAAiB,IAAI,KAAK,GAAG,CAAC,EAAE;AAChC,gBAAgB,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,YAAY,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;AAClE,YAAY;AACZ,iBAAiB;AACjB,gBAAgB,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;AACjE,YAAY;AACZ,QAAQ;AACR,IAAI;AACJ,IAAI,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG;AACjC;AACA,SAAS,gBAAgB,CAAC,IAAI,EAAE;AAChC,IAAI,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAE;AAC9B,IAAI,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE;AACnC,QAAQ,MAAM,OAAO,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;AACxD,QAAQ,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC;AACzD,IAAI;AACJ,IAAI,MAAM,MAAM,GAAG,EAAE;AACrB,IAAI,KAAK,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,IAAI,QAAQ,EAAE;AAC7C,QAAQ,IAAI,KAAK,KAAK,CAAC,EAAE;AACzB,YAAY,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC;AAC3C,QAAQ;AACR,IAAI;AACJ,IAAI,OAAO,MAAM;AACjB;AACA,SAAS,YAAY,CAAC,CAAC,EAAE;AACzB,IAAI,IAAI,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE;AAC7B,QAAQ,OAAO,CAAC,CAAC,QAAQ,EAAE;AAC3B,IAAI;AACJ,IAAI,OAAO,CAAC,CAAC,QAAQ,EAAE;AACvB;;ACpHA;AACO,MAAM,KAAK,CAAC;AACnB,IAAI,WAAW,GAAG;AAClB,QAAQ,IAAI,CAAC,SAAS,GAAG,EAAE;AAC3B,QAAQ,IAAI,CAAC,WAAW,GAAG,EAAE;AAC7B,QAAQ,IAAI,CAAC,SAAS,GAAG,IAAI;AAC7B,QAAQ,IAAI,CAAC,KAAK,GAAG,UAAU;AAC/B,QAAQ,IAAI,CAAC,UAAU,GAAG,CAAC;AAC3B,IAAI;AACJ;AACA,IAAI,MAAM,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,QAAQ,EAAE,IAAI,EAAE;AACxC,QAAQ,MAAM,OAAO,GAAG,IAAI,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC;AACvD,QAAQ,MAAM,CAAC,GAAG,IAAI,GAAG,CAAC,OAAO,EAAE,YAAY,EAAE,EAAE,EAAE,EAAE,CAAC;AACxD,QAAQ,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC;AAC9B,QAAQ,OAAO,CAAC;AAChB,IAAI;AACJ;AACA,IAAI,MAAM,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,QAAQ,EAAE,IAAI,EAAE;AACxC,QAAQ,MAAM,OAAO,GAAG,IAAI,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC;AACvD,QAAQ,MAAM,CAAC,GAAG,IAAI,GAAG,CAAC,OAAO,EAAE,SAAS,EAAE,EAAE,EAAE,EAAE,CAAC;AACrD,QAAQ,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC;AAC9B,QAAQ,OAAO,CAAC;AAChB,IAAI;AACJ;AACA,IAAI,OAAO,CAAC,IAAI,EAAE;AAClB,QAAQ,MAAM,OAAO,GAAG,IAAI,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC;AACvD,QAAQ,MAAM,CAAC,GAAG,IAAI,GAAG,CAAC,OAAO,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC;AAClD,QAAQ,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC;AAC9B,QAAQ,OAAO,CAAC;AAChB,IAAI;AACJ;AACA,IAAI,aAAa,CAAC,UAAU,EAAE,IAAI,EAAE;AACpC,QAAQ,IAAI,IAAI,KAAK,SAAS,EAAE;AAChC,YAAY,UAAU,CAAC,IAAI,GAAG,IAAI;AAClC,QAAQ;AACR,QAAQ,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC;AACzC,IAAI;AACJ;AACA,IAAI,QAAQ,CAAC,IAAI,EAAE;AACnB,QAAQ,IAAI,CAAC,SAAS,GAAG,IAAI,YAAY,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI;AACnE,QAAQ,IAAI,CAAC,KAAK,GAAG,UAAU;AAC/B,IAAI;AACJ;AACA,IAAI,QAAQ,CAAC,IAAI,EAAE;AACnB,QAAQ,IAAI,CAAC,SAAS,GAAG,IAAI,YAAY,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI;AACnE,QAAQ,IAAI,CAAC,KAAK,GAAG,UAAU;AAC/B,IAAI;AACJ;AACA,IAAI,UAAU,GAAG;AACjB,QAAQ,OAAO,UAAU,CAAC;AAC1B,YAAY,SAAS,EAAE,IAAI,CAAC,SAAS;AACrC,YAAY,KAAK,EAAE,IAAI,CAAC,KAAK;AAC7B,YAAY,WAAW,EAAE,IAAI,CAAC,WAAW;AACzC,YAAY,SAAS,EAAE,IAAI,CAAC,SAAS;AACrC,SAAS,CAAC;AACV,IAAI;AACJ;AACA,IAAI,MAAM,KAAK,CAAC,OAAO,EAAE;AACzB,QAAQ,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,EAAE;AAC1C,QAAQ,MAAM,IAAI,GAAG,MAAMA,MAAQ,CAAC,MAAM,CAAC,OAAO,CAAC;AACnD,QAAQ,IAAI;AACZ,YAAY,MAAM,IAAI,CAAC,qBAAqB,CAAC,QAAQ,EAAE,IAAI,CAAC;AAC5D,YAAY,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,KAAK,EAAE;AAC7C,YAAY,OAAO,IAAI,QAAQ,CAAC,MAAM,CAAC;AACvC,QAAQ;AACR,gBAAgB;AAChB,YAAY,IAAI,CAAC,IAAI,EAAE;AACvB,QAAQ;AACR,IAAI;AACJ;;ACxEA;AACO,SAAS,GAAG,CAAC,GAAG,KAAK,EAAE;AAC9B,IAAI,IAAI,MAAM,GAAG,IAAI,OAAO,CAAC,EAAE,EAAE,CAAC,CAAC;AACnC,IAAI,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;AAC9B,QAAQ,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;AAClC,IAAI;AACJ,IAAI,OAAO,MAAM;AACjB;;ACLA;AACO,MAAM,IAAI,SAASA,MAAQ,CAAC;AACnC;AACA,IAAI,MAAM,WAAW,CAAC,IAAI,EAAE;AAC5B,QAAQ,MAAM,OAAO,GAAG,YAAY,CAAC,IAAI,EAAE,OAAO,CAAC;AACnD,QAAQ,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,IAAI,IAAI;AACjD,QAAQ,MAAM,IAAI,CAAC,qBAAqB,CAAC,OAAO,EAAE,GAAG,CAAC;AACtD,IAAI;AACJ,IAAI,aAAa,MAAM,CAAC,OAAO,EAAE;AACjC,QAAQ,MAAM,IAAI,GAAG,MAAMA,MAAQ,CAAC,MAAM,CAAC,OAAO,CAAC;AACnD,QAAQ,OAAO,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC;AAC1D,IAAI;AACJ;;;;"}

package/dist/model/constraint.d.ts

@@ -0,0 +1,12 @@
+import type { Sense } from './types.js';
+import type { LinExpr } from './expr.js';
+/** A linear constraint: expr sense rhs (e.g., x + y <= 10). */
+export declare class Constraint {
+    readonly expr: LinExpr;
+    readonly sense: Sense;
+    readonly rhs: number;
+    name?: string;
+    /** @internal Use leq(), geq(), or eq() methods on expressions instead. */
+    constructor(expr: LinExpr, sense: Sense, rhs: number, name?: string);
+}
+//# sourceMappingURL=constraint.d.ts.map

package/dist/model/constraint.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"constraint.d.ts","sourceRoot":"","sources":["../../src/model/constraint.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACxC,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAEzC,+DAA+D;AAC/D,qBAAa,UAAU;IACrB,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC;IACvB,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC;IACtB,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,IAAI,CAAC,EAAE,MAAM,CAAC;IAEd,0EAA0E;gBAC9D,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,MAAM;CAMpE"}

package/dist/model/constraint.js

@@ -0,0 +1,11 @@
+/** A linear constraint: expr sense rhs (e.g., x + y <= 10). */
+export class Constraint {
+    /** @internal Use leq(), geq(), or eq() methods on expressions instead. */
+    constructor(expr, sense, rhs, name) {
+        this.expr = expr;
+        this.sense = sense;
+        this.rhs = rhs;
+        this.name = name;
+    }
+}
+//# sourceMappingURL=constraint.js.map

package/dist/model/constraint.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"constraint.js","sourceRoot":"","sources":["../../src/model/constraint.ts"],"names":[],"mappings":"AAGA,+DAA+D;AAC/D,MAAM,OAAO,UAAU;IAMrB,0EAA0E;IAC1E,YAAY,IAAa,EAAE,KAAY,EAAE,GAAW,EAAE,IAAa;QACjE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;CACF"}

package/dist/model/expr.d.ts

@@ -0,0 +1,25 @@
+import type { Term } from './types.js';
+import type { Var } from './var.js';
+import { Constraint } from './constraint.js';
+/** A linear expression: sum of terms plus a constant. */
+export declare class LinExpr {
+    readonly terms: Term[];
+    readonly constant: number;
+    /** @internal Use variable arithmetic methods (plus, minus, times) instead. */
+    constructor(terms: Term[], constant: number);
+    /** Returns this + other. */
+    plus(other: Var | LinExpr | number): LinExpr;
+    /** Returns this - other. */
+    minus(other: Var | LinExpr | number): LinExpr;
+    /** Returns coeff * this. */
+    times(coeff: number): LinExpr;
+    /** Returns -this. */
+    neg(): LinExpr;
+    /** Returns a constraint: this <= rhs. */
+    leq(rhs: number): Constraint;
+    /** Returns a constraint: this >= rhs. */
+    geq(rhs: number): Constraint;
+    /** Returns a constraint: this == rhs. */
+    eq(rhs: number): Constraint;
+}
+//# sourceMappingURL=expr.d.ts.map

package/dist/model/expr.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"expr.d.ts","sourceRoot":"","sources":["../../src/model/expr.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,YAAY,CAAC;AACvC,OAAO,KAAK,EAAE,GAAG,EAAE,MAAM,UAAU,CAAC;AACpC,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAE7C,yDAAyD;AACzD,qBAAa,OAAO;IAClB,QAAQ,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC;IACvB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAE1B,8EAA8E;gBAClE,KAAK,EAAE,IAAI,EAAE,EAAE,QAAQ,EAAE,MAAM;IAK3C,4BAA4B;IAC5B,IAAI,CAAC,KAAK,EAAE,GAAG,GAAG,OAAO,GAAG,MAAM,GAAG,OAAO;IAgB5C,4BAA4B;IAC5B,KAAK,CAAC,KAAK,EAAE,GAAG,GAAG,OAAO,GAAG,MAAM,GAAG,OAAO;IAiB7C,4BAA4B;IAC5B,KAAK,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;IAO7B,qBAAqB;IACrB,GAAG,IAAI,OAAO;IAId,yCAAyC;IACzC,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,UAAU;IAI5B,yCAAyC;IACzC,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,UAAU;IAI5B,yCAAyC;IACzC,EAAE,CAAC,GAAG,EAAE,MAAM,GAAG,UAAU;CAG5B"}

package/dist/model/expr.js

@@ -0,0 +1,51 @@
+import { Constraint } from './constraint.js';
+/** A linear expression: sum of terms plus a constant. */
+export class LinExpr {
+    /** @internal Use variable arithmetic methods (plus, minus, times) instead. */
+    constructor(terms, constant) {
+        this.terms = terms;
+        this.constant = constant;
+    }
+    /** Returns this + other. */
+    plus(other) {
+        if (typeof other === 'number') {
+            return new LinExpr(this.terms, this.constant + other);
+        }
+        if (other instanceof LinExpr) {
+            return new LinExpr([...this.terms, ...other.terms], this.constant + other.constant);
+        }
+        return new LinExpr([...this.terms, { coeff: 1, var: other }], this.constant);
+    }
+    /** Returns this - other. */
+    minus(other) {
+        if (typeof other === 'number') {
+            return new LinExpr(this.terms, this.constant - other);
+        }
+        if (other instanceof LinExpr) {
+            const negatedTerms = other.terms.map((t) => ({ coeff: -t.coeff, var: t.var }));
+            return new LinExpr([...this.terms, ...negatedTerms], this.constant - other.constant);
+        }
+        return new LinExpr([...this.terms, { coeff: -1, var: other }], this.constant);
+    }
+    /** Returns coeff * this. */
+    times(coeff) {
+        return new LinExpr(this.terms.map((t) => ({ coeff: t.coeff * coeff, var: t.var })), this.constant * coeff);
+    }
+    /** Returns -this. */
+    neg() {
+        return this.times(-1);
+    }
+    /** Returns a constraint: this <= rhs. */
+    leq(rhs) {
+        return new Constraint(this, '<=', rhs);
+    }
+    /** Returns a constraint: this >= rhs. */
+    geq(rhs) {
+        return new Constraint(this, '>=', rhs);
+    }
+    /** Returns a constraint: this == rhs. */
+    eq(rhs) {
+        return new Constraint(this, '=', rhs);
+    }
+}
+//# sourceMappingURL=expr.js.map

package/dist/model/expr.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"expr.js","sourceRoot":"","sources":["../../src/model/expr.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAE7C,yDAAyD;AACzD,MAAM,OAAO,OAAO;IAIlB,8EAA8E;IAC9E,YAAY,KAAa,EAAE,QAAgB;QACzC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;IAC3B,CAAC;IAED,4BAA4B;IAC5B,IAAI,CAAC,KAA6B;QAChC,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;YAC9B,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,CAAC;QACxD,CAAC;QACD,IAAI,KAAK,YAAY,OAAO,EAAE,CAAC;YAC7B,OAAO,IAAI,OAAO,CAChB,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC,EAC/B,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAC/B,CAAC;QACJ,CAAC;QACD,OAAO,IAAI,OAAO,CAChB,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,EACzC,IAAI,CAAC,QAAQ,CACd,CAAC;IACJ,CAAC;IAED,4BAA4B;IAC5B,KAAK,CAAC,KAA6B;QACjC,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;YAC9B,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,CAAC;QACxD,CAAC;QACD,IAAI,KAAK,YAAY,OAAO,EAAE,CAAC;YAC7B,MAAM,YAAY,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YAC/E,OAAO,IAAI,OAAO,CAChB,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,GAAG,YAAY,CAAC,EAChC,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAC/B,CAAC;QACJ,CAAC;QACD,OAAO,IAAI,OAAO,CAChB,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,EAC1C,IAAI,CAAC,QAAQ,CACd,CAAC;IACJ,CAAC;IAED,4BAA4B;IAC5B,KAAK,CAAC,KAAa;QACjB,OAAO,IAAI,OAAO,CAChB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,GAAG,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,EAC/D,IAAI,CAAC,QAAQ,GAAG,KAAK,CACtB,CAAC;IACJ,CAAC;IAED,qBAAqB;IACrB,GAAG;QACD,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACxB,CAAC;IAED,yCAAyC;IACzC,GAAG,CAAC,GAAW;QACb,OAAO,IAAI,UAAU,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;IACzC,CAAC;IAED,yCAAyC;IACzC,GAAG,CAAC,GAAW;QACb,OAAO,IAAI,UAAU,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;IACzC,CAAC;IAED,yCAAyC;IACzC,EAAE,CAAC,GAAW;QACZ,OAAO,IAAI,UAAU,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;IACxC,CAAC;CACF"}

package/dist/model/helpers.d.ts

@@ -0,0 +1,5 @@
+import type { Var } from './var.js';
+import { LinExpr } from './expr.js';
+/** Returns the sum of the given variables, expressions, and constants. */
+export declare function sum(...items: (Var | LinExpr | number)[]): LinExpr;
+//# sourceMappingURL=helpers.d.ts.map

package/dist/model/helpers.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"helpers.d.ts","sourceRoot":"","sources":["../../src/model/helpers.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,GAAG,EAAE,MAAM,UAAU,CAAC;AACpC,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAEpC,0EAA0E;AAC1E,wBAAgB,GAAG,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,OAAO,GAAG,MAAM,CAAC,EAAE,GAAG,OAAO,CAMjE"}