@ohtaman/washi 0.2.0 → 0.3.0

package/dist/browser/washi.js

@@ -1,32 +1,37 @@
 import { a as e, c as t, i as n, l as r, n as i, o as a, r as o, s, t as c } from "./loader-CVt4CloI.js";
+//#region src/modeler/types.ts
+function l(e) {
+	return e && e.toLowerCase() === "maximize" ? "Maximize" : "Minimize";
+}
+//#endregion
 //#region src/modeler/boolean-expr.ts
-var l = 0, u = class {
+var u = 0, d = class {
 	and(e) {
-		return new f("and", [this, e]);
+		return new p("and", [this, e]);
 	}
 	or(e) {
-		return new f("or", [this, e]);
+		return new p("or", [this, e]);
 	}
 	implies(e) {
-		return new f("implies", [this, e]);
+		return new p("implies", [this, e]);
 	}
 	xor(e) {
-		return new f("xor", [this, e]);
+		return new p("xor", [this, e]);
 	}
 	not() {
-		return new f("not", [this]);
+		return new p("not", [this]);
 	}
-}, d = class extends u {
+}, f = class extends d {
 	id;
 	name;
 	value = null;
 	constructor(e) {
-		super(), this.id = ++l, this.name = e || `p_${this.id}`;
+		super(), this.id = ++u, this.name = e || `p_${this.id}`;
 	}
 	toString() {
 		return this.name;
 	}
-}, f = class extends u {
+}, p = class extends d {
 	op;
 	children;
 	constructor(e, t) {
@@ -36,27 +41,27 @@ var l = 0, u = class {
 		return this.op === "not" ? `not(${this.children[0].toString()})` : `(${this.children.map((e) => e.toString()).join(` ${this.op} `)})`;
 	}
 };
-function p(...e) {
+function m(...e) {
 	if (e.length === 0) throw Error("and() requires at least one expression");
-	return new f("and", e);
+	return new p("and", e);
 }
-function m(...e) {
+function h(...e) {
 	if (e.length === 0) throw Error("or() requires at least one expression");
-	return new f("or", e);
+	return new p("or", e);
 }
-function h(e) {
-	return new f("not", [e]);
+function g(e) {
+	return new p("not", [e]);
 }
-function g(e, t) {
-	return new f("implies", [e, t]);
+function _(e, t) {
+	return new p("implies", [e, t]);
 }
-function _(...e) {
+function v(...e) {
 	if (e.length === 0) throw Error("xor() requires at least one expression");
-	return new f("xor", e);
+	return new p("xor", e);
 }
 //#endregion
 //#region src/modeler/constraint.ts
-var ee = 0, v = class {
+var ee = 0, y = class {
 	id;
 	lhs;
 	sense;
@@ -67,23 +72,20 @@ var ee = 0, v = class {
 	constructor(e, t, n, r) {
 		this.id = ++ee, this.lhs = e, this.sense = t, this.rhs = n, this.name = r || `c_${this.id}`;
 	}
-	get pi() {
-		return this.dual;
-	}
 	and(e) {
-		return new f("and", [this, e]);
+		return new p("and", [this, e]);
 	}
 	or(e) {
-		return new f("or", [this, e]);
+		return new p("or", [this, e]);
 	}
 	implies(e) {
-		return new f("implies", [this, e]);
+		return new p("implies", [this, e]);
 	}
 	xor(e) {
-		return new f("xor", [this, e]);
+		return new p("xor", [this, e]);
 	}
 	not() {
-		return new f("not", [this]);
+		return new p("not", [this]);
 	}
 	toString() {
 		let e = this.sense === "==" ? "=" : this.sense;
@@ -92,11 +94,11 @@ var ee = 0, v = class {
 };
 //#endregion
 //#region src/modeler/quad-expr.ts
-function y(e, t) {
+function b(e, t) {
 	let n = e.id, r = t.id;
 	return n <= r ? `${n}:${r}` : `${r}:${n}`;
 }
-var b = class e {
+var x = class e {
 	linearTerms;
 	quadTerms;
 	constant;
@@ -109,7 +111,7 @@ var b = class e {
 		return new e(this.linearTerms, this.quadTerms, this.constant);
 	}
 	getQuadCoeff(e, t) {
-		let n = y(e, t), r = this.quadTerms.get(n);
+		let n = b(e, t), r = this.quadTerms.get(n);
 		return r ? r.coeff : 0;
 	}
 	add(t) {
@@ -182,14 +184,14 @@ var b = class e {
 		return this.value;
 	}
 	static fromProduct(t, n, r = 1) {
-		let i = new e(), a = y(t, n);
+		let i = new e(), a = b(t, n);
 		return i.quadTerms.set(a, {
 			var1: t.id <= n.id ? t : n,
 			var2: t.id <= n.id ? n : t,
 			coeff: r
 		}), i;
 	}
-}, x = class e {
+}, S = class e {
 	terms;
 	constant;
 	constructor(e = /* @__PURE__ */ new Map(), t = 0) {
@@ -199,7 +201,7 @@ var b = class e {
 		return new e(this.terms, this.constant);
 	}
 	add(e) {
-		if (e instanceof b) return e.add(this);
+		if (e instanceof x) return e.add(this);
 		let t = this.clone();
 		if (typeof e == "number") t.constant += e;
 		else if ("terms" in e) {
@@ -215,7 +217,7 @@ var b = class e {
 		return t;
 	}
 	sub(e) {
-		return e instanceof b ? e.neg().add(this) : typeof e == "number" ? this.add(-e) : ("terms" in e, this.add(e.mul(-1)));
+		return e instanceof x ? e.neg().add(this) : typeof e == "number" ? this.add(-e) : ("terms" in e, this.add(e.mul(-1)));
 	}
 	mul(t) {
 		if (typeof t == "number") {
@@ -226,9 +228,9 @@ var b = class e {
 			}
 			return n;
 		}
-		let n = new b();
+		let n = new x();
 		Math.abs(this.constant) >= 1e-12 && n.linearTerms.set(t, this.constant);
-		for (let [e, r] of this.terms) n = n.add(b.fromProduct(e, t, r));
+		for (let [e, r] of this.terms) n = n.add(x.fromProduct(e, t, r));
 		return n;
 	}
 	div(e) {
@@ -271,7 +273,7 @@ var b = class e {
 		let i = this.clone(), a = 0;
 		typeof n == "number" ? a = n : "terms" in n ? (i = i.sub(new e(n.terms, 0)), a = n.constant) : i = i.sub(n);
 		let o = a - i.constant;
-		return i.constant = 0, new v(i, t, o, r);
+		return i.constant = 0, new y(i, t, o, r);
 	}
 	toString() {
 		let e = [], t = !0;
@@ -286,27 +288,113 @@ var b = class e {
 		return e.join(" ") || "0";
 	}
 };
-function S(e, t) {
-	let n = /* @__PURE__ */ new Map(), r = 0, i = 0;
-	for (let a of e) {
-		let e = t ? t(a, i++) : a;
-		if (typeof e == "number") r += e;
-		else if (e && typeof e == "object" && "terms" in e) {
-			let t = e;
-			for (let [e, r] of t.terms) {
-				let t = n.get(e) || 0;
-				n.set(e, t + r);
+function C(e, t) {
+	let n = /* @__PURE__ */ new Map(), r = 0;
+	function i(e) {
+		if (e != null) {
+			if (typeof e == "number") r += e;
+			else if (typeof e == "object" && "terms" in e) {
+				let t = e;
+				for (let [e, r] of t.terms) {
+					let t = n.get(e) || 0;
+					n.set(e, t + r);
+				}
+				r += t.constant;
+			} else {
+				let t = e, r = n.get(t) || 0;
+				n.set(t, r + 1);
 			}
-			r += t.constant;
-		} else if (e) {
-			let t = e, r = n.get(t) || 0;
-			n.set(t, r + 1);
 		}
 	}
+	if (typeof e == "number") {
+		let n = e, r = t;
+		for (let e = 0; e < n; e++) i(r(e, e));
+	} else {
+		let n = 0;
+		for (let r of e) i(t ? t(r, n++) : r);
+	}
 	for (let [e, t] of n) Math.abs(t) < 1e-12 && n.delete(e);
-	return new x(n, r);
+	return new S(n, r);
 }
-var C = S, w = S, T = 0, E = class e {
+function w(e, t) {
+	let n = /* @__PURE__ */ new Map(), r = 0;
+	function i(e) {
+		return typeof e == "object" && !!e && typeof e.id == "number" && typeof e.name == "string" && typeof e.mul == "function" && typeof e.le == "function";
+	}
+	function a(e) {
+		return i(e) || e instanceof S || e instanceof x;
+	}
+	function o(e, t) {
+		if (typeof t == "number") r += e * t;
+		else if (t instanceof S) {
+			for (let [r, i] of t.terms) {
+				let t = n.get(r) || 0;
+				n.set(r, t + e * i);
+			}
+			r += e * t.constant;
+		} else if (i(t)) {
+			let r = t, i = n.get(r) || 0;
+			n.set(r, i + e);
+		} else throw Error("Cannot multiply number by non-variable/expression operand in dot().");
+	}
+	function s(e) {
+		return typeof e == "object" && !!e && !Array.isArray(e) && !a(e);
+	}
+	function c(e, t, n = "") {
+		if (e === void 0 || t === void 0 || e === null || t === null) throw Error(`Nullish or undefined operand encountered in dot() at '${n || "root"}'.`);
+		if (typeof e == "number") {
+			o(e, t);
+			return;
+		}
+		if (typeof t == "number") {
+			o(t, e);
+			return;
+		}
+		if (Array.isArray(e) || Array.isArray(t)) {
+			if (Array.isArray(e) && Array.isArray(t)) {
+				if (e.length !== t.length) throw Error(`Array length mismatch in dot() at '${n || "root"}': received lengths ${e.length} and ${t.length}.`);
+				for (let r = 0; r < e.length; r++) c(e[r], t[r], n ? `${n}[${r}]` : `[${r}]`);
+				return;
+			}
+			let r = Array.isArray(e) ? e : t, i = Array.isArray(e) ? t : e;
+			if (s(i)) {
+				let a = Object.keys(i);
+				if (a.length > 0 && a.every((e) => /^\d+$/.test(e))) {
+					if (a.length !== r.length) throw Error(`Array length mismatch in dot() at '${n || "root"}': array has length ${r.length}, but object has ${a.length} indices.`);
+					let o = [];
+					for (let e = 0; e < r.length; e++) !(e in i) && !(String(e) in i) && o.push(e);
+					if (o.length > 0) throw Error(`Key mismatch in dot() at '${n || "root"}': missing indices [${o.join(", ")}] in numeric record.`);
+					for (let i = 0; i < r.length; i++) c(e[i], t[i], n ? `${n}[${i}]` : `[${i}]`);
+					return;
+				}
+				throw Error(`Type mismatch in dot() at '${n || "root"}': one operand is an Array while the other is an Object with keys [${a.slice(0, 5).join(", ")}].`);
+			}
+			throw Error(`Type mismatch in dot() at '${n || "root"}': one operand is an Array while the other is not.`);
+		}
+		if (s(e) && s(t)) {
+			let r = Object.keys(e), i = Object.keys(t), a = r.filter((e) => !(e in t)), o = i.filter((t) => !(t in e));
+			if (a.length > 0 || o.length > 0) {
+				let e = [];
+				throw a.length > 0 && e.push(`missing in second operand: [${a.join(", ")}]`), o.length > 0 && e.push(`missing in first operand: [${o.join(", ")}]`), Error(`Key mismatch in dot() at '${n || "root"}': ${e.join("; ")}.`);
+			}
+			for (let i of r) c(e[i], t[i], n ? `${n}.${i}` : i);
+			return;
+		}
+		throw Error(`Unsupported operand types in dot() at '${n || "root"}'.`);
+	}
+	c(e, t);
+	for (let [e, t] of n) Math.abs(t) < 1e-12 && n.delete(e);
+	return new S(n, r);
+}
+//#endregion
+//#region src/modeler/variable.ts
+var te = 0;
+function T(e) {
+	if (!e) return "Continuous";
+	let t = e.toLowerCase();
+	return t === "binary" || t === "bin" ? "Binary" : t === "integer" || t === "int" ? "Integer" : "Continuous";
+}
+var E = class e {
 	id;
 	name;
 	type;
@@ -315,48 +403,42 @@ var C = S, w = S, T = 0, E = class e {
 	value = null;
 	reducedCost = null;
 	constructor(e = {}) {
-		this.id = ++T, this.name = e.name || `x_${this.id}`, this.type = e.type || "Continuous", this.type === "Binary" ? (this.lb = 0, this.ub = 1) : (this.lb = e.lb === void 0 ? 0 : e.lb, this.ub = e.ub === void 0 ? Infinity : e.ub);
-	}
-	get x() {
-		return this.value;
-	}
-	get varValue() {
-		return this.value;
+		this.id = ++te, this.name = e.name || `x_${this.id}`, this.type = T(e.type), this.type === "Binary" ? (this.lb = 0, this.ub = 1) : (this.lb = e.lb === void 0 ? 0 : e.lb, this.ub = e.ub === void 0 ? Infinity : e.ub);
 	}
 	mul(t) {
-		if (typeof t == "number") return new x(/* @__PURE__ */ new Map([[this, t]]), 0);
-		if (t instanceof e) return b.fromProduct(this, t, 1);
-		let n = new b();
+		if (typeof t == "number") return new S(/* @__PURE__ */ new Map([[this, t]]), 0);
+		if (t instanceof e) return x.fromProduct(this, t, 1);
+		let n = new x();
 		Math.abs(t.constant) >= 1e-12 && n.linearTerms.set(this, t.constant);
 		for (let [e, r] of t.terms) {
-			let t = b.fromProduct(this, e, r);
+			let t = x.fromProduct(this, e, r);
 			n = n.add(t);
 		}
 		return n;
 	}
 	add(e) {
-		return e instanceof b ? e.add(this) : new x(/* @__PURE__ */ new Map([[this, 1]]), 0).add(e);
+		return e instanceof x ? e.add(this) : new S(/* @__PURE__ */ new Map([[this, 1]]), 0).add(e);
 	}
 	sub(e) {
-		return e instanceof b ? e.neg().add(this) : new x(/* @__PURE__ */ new Map([[this, 1]]), 0).sub(e);
+		return e instanceof x ? e.neg().add(this) : new S(/* @__PURE__ */ new Map([[this, 1]]), 0).sub(e);
 	}
 	neg() {
 		return this.mul(-1);
 	}
 	le(e, t) {
-		return new x(/* @__PURE__ */ new Map([[this, 1]]), 0).le(e, t);
+		return new S(/* @__PURE__ */ new Map([[this, 1]]), 0).le(e, t);
 	}
 	lessThanOrEqual(e, t) {
 		return this.le(e, t);
 	}
 	ge(e, t) {
-		return new x(/* @__PURE__ */ new Map([[this, 1]]), 0).ge(e, t);
+		return new S(/* @__PURE__ */ new Map([[this, 1]]), 0).ge(e, t);
 	}
 	greaterThanOrEqual(e, t) {
 		return this.ge(e, t);
 	}
 	eq(e, t) {
-		return new x(/* @__PURE__ */ new Map([[this, 1]]), 0).eq(e, t);
+		return new S(/* @__PURE__ */ new Map([[this, 1]]), 0).eq(e, t);
 	}
 	equalTo(e, t) {
 		return this.eq(e, t);
@@ -367,7 +449,7 @@ var C = S, w = S, T = 0, E = class e {
 };
 //#endregion
 //#region src/modeler/parser.ts
-function te(e) {
+function D(e) {
 	let t = [], n = 0, r = e.length;
 	for (; n < r;) {
 		let i = e[n];
@@ -423,7 +505,7 @@ function te(e) {
 	}
 	return t;
 }
-var ne = class {
+var O = class {
 	tokens;
 	pos = 0;
 	resolver;
@@ -485,12 +567,12 @@ var ne = class {
 				let e = this.consume();
 				return this.resolveVariable(e.value).mul(t);
 			}
-			return new x(/* @__PURE__ */ new Map(), t);
+			return new S(/* @__PURE__ */ new Map(), t);
 		}
 		if (e.type === "IDENT") {
 			this.consume();
 			let t = this.resolveVariable(e.value);
-			return new x(/* @__PURE__ */ new Map([[t, 1]]), 0);
+			return new S(/* @__PURE__ */ new Map([[t, 1]]), 0);
 		}
 		if (e.type === "LPAREN") {
 			this.consume("LPAREN");
@@ -505,10 +587,10 @@ var ne = class {
 		return t;
 	}
 };
-function D(e, t) {
-	return new ne(te(e), t).parseExpression();
+function k(e, t) {
+	return new O(D(e), t).parseExpression();
 }
-function O(e, t, n) {
+function A(e, t, n) {
 	let r = e.match(/(<=|>=|==|=<|=>|=)/);
 	if (!r) throw Error(`Constraint must contain a comparison operator (<=, >=, ==, =): "${e}"`);
 	let i = r[0], a = r.index, o = e.substring(0, a).trim(), s = e.substring(a + i.length).trim(), c;
@@ -516,10 +598,10 @@ function O(e, t, n) {
 	else if (i === ">=" || i === "=>") c = ">=";
 	else if (i === "==" || i === "=") c = "==";
 	else throw Error(`Unsupported operator "${i}"`);
-	let l = D(o, t), u = D(s, t);
+	let l = k(o, t), u = k(s, t);
 	return c === "<=" ? l.le(u, n) : c === ">=" ? l.ge(u, n) : l.eq(u, n);
 }
-function k(e, t) {
+function j(e, t) {
 	let n = /* @__PURE__ */ new Map(), r = "";
 	for (let i = 0; i < e.length; i++) if (r += e[i], i < t.length) {
 		let e = t[i];
@@ -527,7 +609,7 @@ function k(e, t) {
 		else if (e instanceof E) {
 			let t = `__v_${i}__`;
 			n.set(t, e), r += t;
-		} else if (e instanceof x) {
+		} else if (e instanceof S) {
 			`${i}`, r += `(${e.toString()})`;
 			for (let [t] of e.terms) n.set(t.name, t);
 		}
@@ -537,42 +619,42 @@ function k(e, t) {
 		resolver: (e) => n.get(e)
 	};
 }
-function re(e, ...t) {
-	let { fullText: n, resolver: r } = k(e, t);
-	return O(n, r);
+function M(e, ...t) {
+	let { fullText: n, resolver: r } = j(e, t);
+	return A(n, r);
 }
-function ie(e, ...t) {
-	let { fullText: n, resolver: r } = k(e, t);
-	return /(<=|>=|==|=<|=>|=)/.test(n) ? O(n, r) : D(n, r);
+function N(e, ...t) {
+	let { fullText: n, resolver: r } = j(e, t);
+	return /(<=|>=|==|=<|=>|=)/.test(n) ? A(n, r) : k(n, r);
 }
 //#endregion
 //#region src/modeler/lp-writer.ts
-function A(e, t, n) {
+function P(e, t, n) {
 	let r = e.replace(/[^a-zA-Z0-9_]/g, "_");
 	return /^[0-9]/.test(r) && (r = `${t}_${r}`), (!r || r.length === 0) && (r = `${t}_${n}`), r;
 }
-function j(e) {
+function F(e) {
 	let { sense: t, objective: n, constraints: r, variables: i } = e, a = /* @__PURE__ */ new Map(), o = /* @__PURE__ */ new Map(), s = /* @__PURE__ */ new Map(), c = /* @__PURE__ */ new Set();
 	for (let e of i) {
-		let t = A(e.name, "x", e.id), n = t, r = 1;
+		let t = P(e.name, "x", e.id), n = t, r = 1;
 		for (; c.has(n);) n = `${t}_${r++}`;
 		c.add(n), o.set(e, n), a.set(n, e);
 	}
 	let l = /* @__PURE__ */ new Set(), u = /* @__PURE__ */ new Map();
 	for (let e of r) {
-		let t = A(e.name, "c", e.id), n = t, r = 1;
+		let t = P(e.name, "c", e.id), n = t, r = 1;
 		for (; l.has(n);) n = `${t}_${r++}`;
 		l.add(n), u.set(e, n), s.set(n, e);
 	}
 	let d = [];
-	d.push(t === "Maximize" ? "Maximize" : "Minimize");
-	let f = [], p = !0, m = n instanceof b ? n.linearTerms : n.terms;
+	d.push(t && t.toLowerCase() === "maximize" ? "Maximize" : "Minimize");
+	let f = [], p = !0, m = n instanceof x ? n.linearTerms : n.terms;
 	if (m) for (let [e, t] of m) {
 		if (Math.abs(t) < 1e-12) continue;
 		let n = o.get(e), r = t >= 0 ? p ? "" : "+ " : "- ", i = Math.abs(t), a = i === 1 ? "" : `${i} `;
 		f.push(`${r}${a}${n}`), p = !1;
 	}
-	if (n instanceof b && n.quadTerms.size > 0) {
+	if (n instanceof x && n.quadTerms.size > 0) {
 		let e = [], t = !0;
 		for (let r of n.quadTerms.values()) {
 			if (Math.abs(r.coeff) < 1e-12) continue;
@@ -624,38 +706,38 @@ function j(e) {
 }
 //#endregion
 //#region src/modeler/solvers/registry.ts
-var M = Symbol.for("washi.solverRegistry"), N = Symbol.for("washi.defaultSolverFactory"), P = globalThis;
-P[M] || (P[M] = /* @__PURE__ */ new Map());
-var F = P[M];
-function I(e, t) {
-	F.set(e.toLowerCase(), t);
+var I = Symbol.for("washi.solverRegistry"), L = Symbol.for("washi.defaultSolverFactory"), R = globalThis;
+R[I] || (R[I] = /* @__PURE__ */ new Map());
+var z = R[I];
+function B(e, t) {
+	z.set(e.toLowerCase(), t);
 }
-function L(e) {
+function V(e) {
 	if (typeof e == "string") {
-		let t = F.get(e.toLowerCase());
+		let t = z.get(e.toLowerCase());
 		if (!t) throw Error(`Solver '${e}' is not registered.`);
-		P[N] = t;
-	} else P[N] = typeof e == "function" ? e : () => e;
+		R[L] = t;
+	} else R[L] = typeof e == "function" ? e : () => e;
 }
-function R(e, t) {
+function H(e, t) {
 	if (!e) {
-		let e = P[N] || F.get("highs");
-		if (!e) throw Error(`No default solver available. Available solvers: ${z().join(", ")}`);
+		let e = R[L] || z.get("highs");
+		if (!e) throw Error(`No default solver available. Available solvers: ${U().join(", ")}`);
 		return e(t);
 	}
 	if (typeof e == "string") {
-		let n = e.toLowerCase(), r = F.get(n);
-		if (!r) throw Error(n === "glpk" ? `Solver 'glpk' not found. Available solvers: ${z().join(", ")}. Please import '@ohtaman/washi/solvers/glpk' before selecting this solver.` : n === "z3" ? `Solver 'z3' not found. Available solvers: ${z().join(", ")}. Please import '@ohtaman/washi/solvers/z3' before selecting this solver.` : `Solver '${e}' not found. Available solvers: ${z().join(", ")}`);
+		let n = e.toLowerCase(), r = z.get(n);
+		if (!r) throw Error(n === "glpk" ? `Solver 'glpk' not found. Available solvers: ${U().join(", ")}. Please import '@ohtaman/washi/solvers/glpk' before selecting this solver.` : n === "z3" ? `Solver 'z3' not found. Available solvers: ${U().join(", ")}. Please import '@ohtaman/washi/solvers/z3' before selecting this solver.` : `Solver '${e}' not found. Available solvers: ${U().join(", ")}`);
 		return r(t);
 	}
 	return e;
 }
-function z() {
-	return Array.from(F.keys());
+function U() {
+	return Array.from(z.keys());
 }
 //#endregion
 //#region \0washi-browser-worker-factory
-function ae() {
+function W() {
 	let e = r("highs-worker.js");
 	if (new URL(e).origin === window.location.origin) return new Worker(e, { type: "module" });
 	let t = URL.createObjectURL(new Blob(["import " + JSON.stringify(e) + ";"], { type: "text/javascript" }));
@@ -668,41 +750,41 @@ function ae() {
 }
 //#endregion
 //#region src/modeler/solvers/highs/worker-client.ts
-var B = null, V = 0, H = /* @__PURE__ */ new Map();
-function U() {
+var G = null, K = 0, q = /* @__PURE__ */ new Map();
+function J() {
 	if (typeof window > "u" || typeof Worker > "u") return null;
-	if (!B) try {
-		B = ae();
-		let e = B;
-		B.onmessage = (e) => {
-			let { type: t, id: n, result: r, runTime: i, error: a } = e.data, o = H.get(n);
-			o && (H.delete(n), t === "SOLVE_SUCCESS" ? o.resolve({
+	if (!G) try {
+		G = W();
+		let e = G;
+		G.onmessage = (e) => {
+			let { type: t, id: n, result: r, runTime: i, error: a } = e.data, o = q.get(n);
+			o && (q.delete(n), t === "SOLVE_SUCCESS" ? o.resolve({
 				result: r,
 				runTime: i
 			}) : o.reject(Error(a || "Worker solve failed")));
 		};
 		let t = (t) => {
-			if (B === e) {
-				B = null, e.terminate();
-				for (let e of H.values()) e.reject(t);
-				H.clear();
+			if (G === e) {
+				G = null, e.terminate();
+				for (let e of q.values()) e.reject(t);
+				q.clear();
 			}
 		};
-		B.onerror = (e) => t(/* @__PURE__ */ Error(`[WaSHI] HiGHS Worker failed to load or execute. Check Worker assets, CORS and CSP. ${e?.message || ""}`)), B.onmessageerror = () => t(/* @__PURE__ */ Error("[WaSHI] Could not deserialize the HiGHS Worker response."));
+		G.onerror = (e) => t(/* @__PURE__ */ Error(`[WaSHI] HiGHS Worker failed to load or execute. Check Worker assets, CORS and CSP. ${e?.message || ""}`)), G.onmessageerror = () => t(/* @__PURE__ */ Error("[WaSHI] Could not deserialize the HiGHS Worker response."));
 	} catch {
-		B = null;
+		G = null;
 	}
-	return B;
+	return G;
 }
-async function W(e, n = {}) {
-	let r = await a(n.wasmUrl), i = n.useWorker ?? typeof window < "u" ? U() : null;
+async function Y(e, n = {}) {
+	let r = await a(n.wasmUrl), i = n.useWorker ?? typeof window < "u" ? J() : null;
 	if (!i) return t(e, n);
 	let o = {
 		...n,
 		wasmUrl: r
-	}, s = `req_${++V}`;
+	}, s = `req_${++K}`;
 	return new Promise((t, n) => {
-		H.set(s, {
+		q.set(s, {
 			resolve: t,
 			reject: n
 		});
@@ -714,13 +796,13 @@ async function W(e, n = {}) {
 				options: o
 			});
 		} catch (e) {
-			H.delete(s), n(e);
+			q.delete(s), n(e);
 		}
 	});
 }
 //#endregion
 //#region src/modeler/solvers/highs/solver.ts
-function G(e) {
+function X(e) {
 	if (typeof e != "string") return "Unknown";
 	let t = e.trim();
 	if (!t) return "Unknown";
@@ -749,7 +831,7 @@ function G(e) {
 	let n = t.toLowerCase();
 	return n.includes("infeasible") && n.includes("unbounded") ? "Unknown" : n.includes("infeasible") ? "Infeasible" : n.includes("unbounded") ? "Unbounded" : n.includes("time limit") || n.includes("timelimit") ? "TimeLimit" : n.includes("iteration limit") || n.includes("iterationlimit") ? "IterationLimit" : n.includes("error") ? "Error" : n === "optimal" ? "Optimal" : "Unknown";
 }
-var K = class e {
+var Z = class e {
 	static capabilities = {
 		supportsMIP: !0,
 		supportsQP: !0
@@ -765,7 +847,18 @@ var K = class e {
 		let r = {
 			...this.options,
 			...n
-		}, { lpString: i, nameToVar: a, nameToConstraint: o } = t, { result: s, runTime: c } = await W(i, r), l = G(s?.Status), u = s.ObjectiveValue, d = typeof u == "number" ? u + e.objective.constant : null, f = {}, p = {}, m = {}, h = {};
+		}, { lpString: i, nameToVar: a, nameToConstraint: o } = t, { result: s, runTime: c } = await Y(i, r), l = X(s?.Status);
+		if (l === "Infeasible" || l === "Unbounded") return {
+			status: l,
+			objectiveValue: null,
+			values: {},
+			reducedCosts: {},
+			duals: {},
+			slacks: {},
+			runTime: c,
+			raw: s
+		};
+		let u = s.ObjectiveValue, d = typeof u == "number" ? u + e.objective.constant : null, f = {}, p = {}, m = {}, h = {};
 		if (s.Columns) for (let [e, t] of Object.entries(s.Columns)) {
 			let n = a.get(e);
 			if (n) {
@@ -794,14 +887,14 @@ var K = class e {
 			raw: s
 		};
 	}
-}, q = K;
-function oe() {
-	I("highs", (e) => new K(e)), L((e) => new K(e));
+}, Q = Z;
+function ne() {
+	B("highs", (e) => new Z(e)), V((e) => new Z(e));
 }
-oe();
+ne();
 //#endregion
 //#region src/modeler/solvers/mock.ts
-var J = class {
+var $ = class {
 	name;
 	capabilities;
 	options;
@@ -828,13 +921,13 @@ var J = class {
 		};
 	}
 };
-function se() {
-	I("mock", (e) => new J(e));
+function re() {
+	B("mock", (e) => new $(e));
 }
-se();
+re();
 //#endregion
 //#region src/modeler/model.ts
-var Y = class {
+var ie = class {
 	name;
 	sense;
 	objective;
@@ -856,7 +949,7 @@ var Y = class {
 		n = typeof e == "string" ? {
 			...t,
 			name: e
-		} : e, this.name = n.name || "OptimizationModel", this.sense = n.sense || "Minimize", this.objective = new x(), n.solver && (this.solver = R(n.solver));
+		} : e, this.name = n.name || "OptimizationModel", this.sense = l(n.sense), this.objective = new S(), n.solver && (this.solver = H(n.solver));
 	}
 	get vars() {
 		return this.variables;
@@ -870,6 +963,60 @@ var Y = class {
 	get numConstrs() {
 		return this.constraints.length;
 	}
+	createDomainVars(e, t, n, r) {
+		if (typeof n == "number" || Array.isArray(n)) {
+			let i = typeof t == "number" ? Array.from({ length: t }, (e, t) => t) : t, a = typeof n == "number" ? Array.from({ length: n }, (e, t) => t) : n, o = r || {}, s = o.prefix || o.name || "x", c = {};
+			for (let t of i) {
+				c[t] = {};
+				for (let n of a) c[t][n] = this.addVar({
+					...o,
+					type: e,
+					name: `${s}_${t}_${n}`
+				});
+			}
+			return c;
+		}
+		if (typeof t == "string") {
+			let r = n || {};
+			return this.addVar({
+				...r,
+				type: e,
+				name: t
+			});
+		}
+		let i = n || {}, a = i.prefix || i.name;
+		if (typeof t == "number") {
+			let n = [], r = a || "x";
+			for (let a = 0; a < t; a++) n.push(this.addVar({
+				...i,
+				type: e,
+				name: `${r}_${a}`
+			}));
+			return n;
+		}
+		if (Array.isArray(t) || t && typeof t[Symbol.iterator] == "function") {
+			let n = {};
+			for (let r of t) {
+				let t = a ? `${a}_${r}` : `${r}`;
+				n[r] = this.addVar({
+					...i,
+					type: e,
+					name: t
+				});
+			}
+			return n;
+		}
+		throw Error(`Invalid arguments provided for ${e.toLowerCase()} variable creation`);
+	}
+	binary(e, t, n) {
+		return this.createDomainVars("Binary", e, t, n);
+	}
+	integer(e, t, n) {
+		return this.createDomainVars("Integer", e, t, n);
+	}
+	continuous(e, t, n) {
+		return this.createDomainVars("Continuous", e, t, n);
+	}
 	addVar(e, t, n, r) {
 		let i;
 		i = typeof e == "string" ? {
@@ -933,7 +1080,8 @@ var Y = class {
 		return this.constrMapByName.get(e);
 	}
 	setObjective(e, t) {
-		t && (this.sense = t), this.objective = typeof e == "string" ? D(e, (e) => this.getVarByName(e)) : typeof e == "number" ? new x(/* @__PURE__ */ new Map(), e) : e instanceof b || "terms" in e ? e.clone() : new x(/* @__PURE__ */ new Map([[e, 1]]), 0);
+		if (e instanceof y) throw Error("Cannot set objective to a constraint comparison (<=, >=, ==). Did you mean to use m.constrain(expr`... <= ...`)? For objectives, supply an unconstrained expression like expr`45 * ${x} + 80 * ${y}`.");
+		t && (this.sense = l(t)), this.objective = typeof e == "string" ? k(e, (e) => this.getVarByName(e)) : typeof e == "number" ? new S(/* @__PURE__ */ new Map(), e) : e instanceof x || "terms" in e ? e.clone() : new S(/* @__PURE__ */ new Map([[e, 1]]), 0);
 	}
 	maximize(e) {
 		this.setObjective(e, "Maximize");
@@ -941,12 +1089,32 @@ var Y = class {
 	minimize(e) {
 		this.setObjective(e, "Minimize");
 	}
+	constrain(e, t) {
+		if (Array.isArray(e)) {
+			for (let t of e) this.constrain(t);
+			return this;
+		}
+		if (e instanceof S) throw Error("Cannot add a linear expression without a comparison operator (<=, >=, ==) as a constraint. Use expr`... <= ...` or .le(), .ge(), .eq().");
+		return this.addConstraint(e, t), this;
+	}
+	getValues(e) {
+		if (e == null) return null;
+		if (e instanceof E) return e.value;
+		if (Array.isArray(e)) return e.map((e) => this.getValues(e));
+		if (typeof e == "object") {
+			let t = {};
+			for (let [n, r] of Object.entries(e)) t[n] = this.getValues(r);
+			return t;
+		}
+		return null;
+	}
 	addBoolVar(e) {
-		let t = new d(e);
+		let t = new f(e);
 		return this.boolVars.push(t), t;
 	}
 	addConstraint(e, t) {
-		if (e instanceof u) {
+		if (e instanceof S) throw Error("Cannot add a linear expression without a comparison operator (<=, >=, ==) as a constraint. Use expr`... <= ...` or .le(), .ge(), .eq().");
+		if (e instanceof d) {
 			let n = t || `lc_${this.logicalConstraints.length + 1}`;
 			return this.logicalConstraints.push({
 				name: n,
@@ -954,7 +1122,7 @@ var Y = class {
 			}), e;
 		}
 		let n;
-		if (typeof e == "string" ? n = O(e, (e) => this.getVarByName(e), t) : (n = e, t && (n.name = t)), this.constrMapByName.has(n.name)) throw Error(`Constraint with name '${n.name}' already exists in model`);
+		if (typeof e == "string" ? n = A(e, (e) => this.getVarByName(e), t) : (n = e, t && (n.name = t)), this.constrMapByName.has(n.name)) throw Error(`Constraint with name '${n.name}' already exists in model`);
 		return this.constraints.push(n), this.constrMapByName.set(n.name, n), n;
 	}
 	addConstr(e, t) {
@@ -970,31 +1138,35 @@ var Y = class {
 		}
 		return e instanceof E ? (this.varMapByName.has(e.name) || (this.variables.push(e), this.varMapByName.set(e.name, e)), this) : (this.addConstraint(e, t), this);
 	}
-	addIndicator(e, t, n = {}) {
-		let r = n.activeValue === void 0 ? 1 : n.activeValue, i = n.M === void 0 ? 1e5 : n.M, a = n.name || `ind_${e.name}_${t.name}`, o = [], { lhs: s, sense: c, rhs: l } = t;
-		if (r === 1) {
-			if (c === "<=" || c === "==") {
-				let t = this.addConstraint(s.add(e.mul(i)).le(l + i), c === "==" ? `${a}_le` : a);
-				o.push(t);
+	indicator(e, t, n = {}) {
+		if (!("sense" in t) || !("lhs" in t)) throw Error("Invalid constraint expression passed to indicator(). Expression must include a comparison operator (<=, >=, ==).");
+		let r = t, i = n.activeValue === void 0 ? 1 : n.activeValue, a = n.M === void 0 ? 1e5 : n.M, o = n.name || `ind_${e.name}_${r.name}`, s = [], { lhs: c, sense: l, rhs: u } = r;
+		if (i === 1) {
+			if (l === "<=" || l === "==") {
+				let t = this.addConstraint(c.add(e.mul(a)).le(u + a), l === "==" ? `${o}_le` : o);
+				s.push(t);
 			}
-			if (c === ">=" || c === "==") {
-				let t = this.addConstraint(s.sub(e.mul(i)).ge(l - i), c === "==" ? `${a}_ge` : a);
-				o.push(t);
+			if (l === ">=" || l === "==") {
+				let t = this.addConstraint(c.sub(e.mul(a)).ge(u - a), l === "==" ? `${o}_ge` : o);
+				s.push(t);
 			}
 		} else {
-			if (c === "<=" || c === "==") {
-				let t = this.addConstraint(s.sub(e.mul(i)).le(l), c === "==" ? `${a}_le` : a);
-				o.push(t);
+			if (l === "<=" || l === "==") {
+				let t = this.addConstraint(c.sub(e.mul(a)).le(u), l === "==" ? `${o}_le` : o);
+				s.push(t);
 			}
-			if (c === ">=" || c === "==") {
-				let t = this.addConstraint(s.add(e.mul(i)).ge(l), c === "==" ? `${a}_ge` : a);
-				o.push(t);
+			if (l === ">=" || l === "==") {
+				let t = this.addConstraint(c.add(e.mul(a)).ge(u), l === "==" ? `${o}_ge` : o);
+				s.push(t);
 			}
 		}
-		return o;
+		return s;
+	}
+	addIndicator(e, t, n = {}) {
+		return this.indicator(e, t, n);
 	}
 	toLpString() {
-		let { lpString: e } = j({
+		let { lpString: e } = F({
 			name: this.name,
 			sense: this.sense,
 			objective: this.objective,
@@ -1005,7 +1177,7 @@ var Y = class {
 	}
 	async optimize(e, t) {
 		let n, r;
-		if (e && typeof e == "object" && "solve" in e && typeof e.solve == "function" ? (n = e, r = t || {}) : typeof e == "function" ? (n = new e(t), r = t || {}) : typeof e == "string" ? (n = R(e, t), r = t || {}) : (r = { ...e }, r.solver ? (n = R(r.solver, r), delete r.solver) : n = this.solver || R()), this.objective instanceof b && this.objective.quadTerms.size > 0 && n.capabilities?.supportsQP === !1) throw Error(`Solver "${n.name}" does not support quadratic objectives (QP). Please use a QP-capable solver such as HiGHS or Clarabel.`);
+		if (e && typeof e == "object" && "solve" in e && typeof e.solve == "function" ? (n = e, r = t || {}) : typeof e == "function" ? (n = new e(t), r = t || {}) : typeof e == "string" ? (n = H(e, t), r = t || {}) : (r = { ...e }, r.solver ? (n = H(r.solver, r), delete r.solver) : n = this.solver || H()), this.objective instanceof x && this.objective.quadTerms.size > 0 && n.capabilities?.supportsQP === !1) throw Error(`Solver "${n.name}" does not support quadratic objectives (QP). Please use a QP-capable solver such as HiGHS or Clarabel.`);
 		let i = {
 			name: this.name,
 			sense: this.sense,
@@ -1014,13 +1186,23 @@ var Y = class {
 			variables: this.variables,
 			logicalConstraints: this.logicalConstraints,
 			boolVars: this.boolVars
-		}, a = j(i), o = await n.solve(i, a, r);
+		}, a = F(i), o = await n.solve(i, a, r);
 		this.runTime = o.runTime ?? 0, this.status = o.status, this.objectiveValue = o.objectiveValue ?? null;
 		let s = {}, c = {}, l = {}, u = {};
-		if (this.values.clear(), o.values) for (let [e, t] of Object.entries(o.values)) {
-			this.values.set(e, t);
-			let n = this.getVarByName(e) || a.nameToVar.get(e);
-			n && (n.value = t, s[n.name] = t);
+		this.values.clear();
+		for (let e of this.variables) e.value = null, e.reducedCost = null;
+		for (let e of this.boolVars) e.value = null;
+		for (let e of this.constraints) e.dual = null, e.slack = null;
+		if (a?.nameToVar) for (let e of a.nameToVar.values()) e.value = null, e.reducedCost = null;
+		if (a?.nameToConstraint) for (let e of a.nameToConstraint.values()) e.dual = null, e.slack = null;
+		if (o.values && o.status !== "Infeasible" && o.status !== "Unbounded") {
+			for (let [e, t] of Object.entries(o.values)) if (typeof t == "number" && !Number.isNaN(t)) {
+				this.values.set(e, t);
+				let n = this.getVarByName(e) || a.nameToVar.get(e);
+				n && (n.value = t, s[n.name] = t);
+				let r = this.boolVars.find((t) => t.name === e);
+				r && (r.value = !!t);
+			}
 		}
 		if (o.reducedCosts) for (let [e, t] of Object.entries(o.reducedCosts)) {
 			let n = this.getVarByName(e) || a.nameToVar.get(e);
@@ -1050,7 +1232,7 @@ var Y = class {
 	}
 	async check(e, t) {
 		let n, r;
-		if (e && typeof e == "object" && "solve" in e && typeof e.solve == "function" ? (n = e, r = t || {}) : typeof e == "function" ? (n = new e(t), r = t || {}) : typeof e == "string" ? (n = R(e, t), r = t || {}) : (r = { ...e }, r.solver ? (n = R(r.solver, r), delete r.solver) : n = this.solver || R()), this.logicalConstraints.length > 0 && n.capabilities?.supportsSMT !== !0) throw Error(`Solver "${n.name}" does not support SMT / logical constraints (or, implies, not, xor). Please use an SMT-capable solver such as Z3.`);
+		if (e && typeof e == "object" && "solve" in e && typeof e.solve == "function" ? (n = e, r = t || {}) : typeof e == "function" ? (n = new e(t), r = t || {}) : typeof e == "string" ? (n = H(e, t), r = t || {}) : (r = { ...e }, r.solver ? (n = H(r.solver, r), delete r.solver) : n = this.solver || H()), this.logicalConstraints.length > 0 && n.capabilities?.supportsSMT !== !0) throw Error(`Solver "${n.name}" does not support SMT / logical constraints (or, implies, not, xor). Please use an SMT-capable solver such as Z3.`);
 		if (typeof n.check == "function") {
 			let e = await n.check({
 				name: this.name,
@@ -1059,21 +1241,26 @@ var Y = class {
 				constraints: this.constraints,
 				logicalConstraints: this.logicalConstraints
 			}, r);
-			if (this.status = e.status, this.runTime = e.runTime ?? 0, this.unsatCore = e.unsatCore || [], e.values) {
-				this.values.clear();
-				for (let [t, n] of Object.entries(e.values)) {
-					this.values.set(t, n);
-					let e = this.getVarByName(t);
-					e && typeof n == "number" && (e.value = n);
-				}
+			this.status = e.status, this.runTime = e.runTime ?? 0, this.unsatCore = e.unsatCore || [], this.values.clear();
+			for (let e of this.variables) e.value = null;
+			for (let e of this.boolVars) e.value = null;
+			if (e.values && e.status === "Sat") for (let [t, n] of Object.entries(e.values)) {
+				this.values.set(t, n);
+				let e = this.getVarByName(t);
+				e && typeof n == "number" && (e.value = n);
+				let r = this.boolVars.find((e) => e.name === t);
+				r && (r.value = !!n);
 			}
 			return e;
 		}
 		let i = this.objective, a = this.sense;
 		try {
-			this.objective = new x(), this.sense = "Minimize";
+			this.objective = new S(), this.sense = "Minimize";
 			let e = await this.optimize(n, r), t = e === "Optimal" || e === "Feasible", i = e === "Infeasible", a = {};
-			for (let e of this.variables) a[e.name] = e.value ?? 0;
+			if (t) {
+				for (let e of this.variables) e.value !== null && (a[e.name] = e.value);
+				for (let e of this.boolVars) e.value !== null && (a[e.name] = e.value);
+			}
 			return {
 				status: t ? "Sat" : i ? "Unsat" : "Unknown",
 				values: a,
@@ -1083,131 +1270,6 @@ var Y = class {
 			this.objective = i, this.sense = a;
 		}
 	}
-}, X = "Minimize", ce = "Maximize", le = "Continuous", ue = "Integer", de = "Binary", Z = {
-	Optimal: "Optimal",
-	Feasible: "Feasible",
-	Infeasible: "Infeasible",
-	Unbounded: "Unbounded",
-	TimeLimit: "Not Solved (Time Limit)",
-	IterationLimit: "Not Solved (Iteration Limit)",
-	Error: "Error",
-	NotSolved: "Not Solved",
-	Sat: "Sat",
-	Unsat: "Unsat",
-	Unknown: "Unknown"
-}, fe = class e extends E {
-	constructor(e, t, n, r = "Continuous") {
-		super({
-			name: e,
-			lb: t === void 0 ? 0 : t,
-			ub: n === void 0 ? Infinity : n,
-			type: r
-		});
-	}
-	static dicts(t, n, r, i, a = "Continuous") {
-		let o = {};
-		for (let s of n) {
-			let n = `${t}_${s}`;
-			o[s] = new e(n, r, i, a);
-		}
-		return o;
-	}
-};
-function pe(e) {
-	return e == null ? null : typeof e == "number" ? e : e.value;
-}
-var me = class {
-	model;
-	constructor(e = "NoName", t = X) {
-		this.model = new Y({
-			name: e,
-			sense: t
-		});
-	}
-	get name() {
-		return this.model.name;
-	}
-	get sense() {
-		return this.model.sense;
-	}
-	set sense(e) {
-		this.model.sense = e;
-	}
-	get objective() {
-		return this.model.objective;
-	}
-	get variables() {
-		return this.model.variables;
-	}
-	get constraints() {
-		return this.model.constraints;
-	}
-	get status() {
-		return this.model.status;
-	}
-	get objectiveValue() {
-		return this.model.objectiveValue;
-	}
-	addVariable(e) {
-		return this.model.getVarByName(e.name) || (this.model.variables.push(e), this.model.varMapByName.set(e.name, e)), e;
-	}
-	setObjective(e) {
-		if (typeof e == "object" && e) {
-			if ("terms" in e) for (let [t] of e.terms) this.addVariable(t);
-			else e instanceof E && this.addVariable(e);
-		}
-		this.model.setObjective(e);
-	}
-	addConstraint(e, t) {
-		if (typeof e == "object" && e && "lhs" in e) for (let [t] of e.lhs.terms) this.addVariable(t);
-		return this.model.addConstraint(e, t);
-	}
-	add(e, t) {
-		typeof e == "string" ? /(<=|>=|==|=<|=>|=)/.test(e) ? this.addConstraint(e, t) : this.setObjective(e) : e instanceof v ? this.addConstraint(e, t) : this.setObjective(e);
-	}
-	async solve(e, t) {
-		return this.model.optimize(e, t);
-	}
-	toLpString() {
-		return this.model.toLpString();
-	}
-}, Q = "Minimize", $ = "Maximize", he = "Binary", ge = "Integer", _e = "Continuous";
-function ve(e) {
-	return {
-		expr: e,
-		sense: $
-	};
-}
-function ye(e) {
-	return {
-		expr: e,
-		sense: Q
-	};
-}
-var be = class extends Y {
-	constructor(e = "MipModel", t = Q) {
-		super({
-			name: e,
-			sense: t
-		});
-	}
-	add_var(e = {}) {
-		return this.addVar({
-			name: e.name,
-			type: e.var_type,
-			lb: e.lb,
-			ub: e.ub
-		});
-	}
-	set objective_spec(e) {
-		this.setObjective(e.expr, e.sense);
-	}
-	get objective_value() {
-		return this.objectiveValue;
-	}
-	add_constr(e, t) {
-		return this.addConstraint(e, t);
-	}
 };
 //#endregion
-export { he as BINARY, u as BoolExpr, f as BoolOp, d as BoolVar, _e as CONTINUOUS, v as Constraint, q as HiGHS, K as HighsSolver, ge as INTEGER, x as LinExpr, de as LpBinary, le as LpContinuous, ue as LpInteger, ce as LpMaximize, X as LpMinimize, me as LpProblem, Z as LpStatus, fe as LpVariable, $ as MAXIMIZE, Q as MINIMIZE, be as MipModel, J as MockSolver, Y as Model, c as OFFICIAL_HIGHS_CDN_WASM_URL, b as QuadExpr, E as Var, p as and, re as c, ie as expr, j as generateLpString, i as getHighs, o as getHighsWasmUrl, R as getSolver, g as implies, n as isValidWasmHeader, z as listAvailableSolvers, w as lpSum, ve as maximize, ye as minimize, h as not, m as or, O as parseConstraint, D as parseExpr, e as probeWasmUrl, I as registerSolver, a as resolveBrowserWasmUrl, L as setDefaultSolver, s as setHighsWasmUrl, t as solveLpWithHighs, S as sum, pe as value, _ as xor, C as xsum };
+export { d as BoolExpr, p as BoolOp, f as BoolVar, y as Constraint, Q as HiGHS, Z as HighsSolver, S as LinExpr, $ as MockSolver, ie as Model, c as OFFICIAL_HIGHS_CDN_WASM_URL, x as QuadExpr, E as Var, m as and, M as c, w as dot, N as expr, F as generateLpString, i as getHighs, o as getHighsWasmUrl, H as getSolver, _ as implies, n as isValidWasmHeader, U as listAvailableSolvers, l as normalizeSense, g as not, h as or, A as parseConstraint, k as parseExpr, e as probeWasmUrl, B as registerSolver, a as resolveBrowserWasmUrl, V as setDefaultSolver, s as setHighsWasmUrl, t as solveLpWithHighs, C as sum, v as xor };