@ohtaman/washi 0.2.0 → 0.3.0

package/dist/lib/washi.js

@@ -1,4 +1,4 @@
-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 "./constraint-XWdn0ID9.js";
+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 "./constraint-BRuB3ooC.js";
 import { i as l, n as u, r as d, t as f } from "./registry-DksqCSjI.js";
 import { a as p, c as m, i as h, n as g, o as _, r as v, s as y, t as b } from "./loader-Dti0v9yC.js";
 import { createHighsWorker as ee } from "./highs-worker-factory.js";
@@ -18,12 +18,17 @@ var x = Object.defineProperty, te = Object.getOwnPropertyDescriptor, ne = Object
 	return e;
 }, w = (e, t, n) => (C(e, t, "default"), n && C(n, t, "default"));
 //#endregion
+//#region src/modeler/types.ts
+function T(e) {
+	return e && e.toLowerCase() === "maximize" ? "Maximize" : "Minimize";
+}
+//#endregion
 //#region src/modeler/quad-expr.ts
-function T(e, t) {
+function E(e, t) {
 	let n = e.id, r = t.id;
 	return n <= r ? `${n}:${r}` : `${r}:${n}`;
 }
-var E = class e {
+var D = class e {
 	linearTerms;
 	quadTerms;
 	constant;
@@ -36,7 +41,7 @@ var E = class e {
 		return new e(this.linearTerms, this.quadTerms, this.constant);
 	}
 	getQuadCoeff(e, t) {
-		let n = T(e, t), r = this.quadTerms.get(n);
+		let n = E(e, t), r = this.quadTerms.get(n);
 		return r ? r.coeff : 0;
 	}
 	add(t) {
@@ -109,14 +114,14 @@ var E = class e {
 		return this.value;
 	}
 	static fromProduct(t, n, r = 1) {
-		let i = new e(), a = T(t, n);
+		let i = new e(), a = E(t, n);
 		return i.quadTerms.set(a, {
 			var1: t.id <= n.id ? t : n,
 			var2: t.id <= n.id ? n : t,
 			coeff: r
 		}), i;
 	}
-}, D = class e {
+}, O = class e {
 	terms;
 	constant;
 	constructor(e = /* @__PURE__ */ new Map(), t = 0) {
@@ -126,7 +131,7 @@ var E = class e {
 		return new e(this.terms, this.constant);
 	}
 	add(e) {
-		if (e instanceof E) return e.add(this);
+		if (e instanceof D) return e.add(this);
 		let t = this.clone();
 		if (typeof e == "number") t.constant += e;
 		else if ("terms" in e) {
@@ -142,7 +147,7 @@ var E = class e {
 		return t;
 	}
 	sub(e) {
-		return e instanceof E ? e.neg().add(this) : typeof e == "number" ? this.add(-e) : ("terms" in e, this.add(e.mul(-1)));
+		return e instanceof D ? e.neg().add(this) : typeof e == "number" ? this.add(-e) : ("terms" in e, this.add(e.mul(-1)));
 	}
 	mul(t) {
 		if (typeof t == "number") {
@@ -153,9 +158,9 @@ var E = class e {
 			}
 			return n;
 		}
-		let n = new E();
+		let n = new D();
 		Math.abs(this.constant) >= 1e-12 && n.linearTerms.set(t, this.constant);
-		for (let [e, r] of this.terms) n = n.add(E.fromProduct(e, t, r));
+		for (let [e, r] of this.terms) n = n.add(D.fromProduct(e, t, r));
 		return n;
 	}
 	div(e) {
@@ -213,27 +218,113 @@ var E = class e {
 		return e.join(" ") || "0";
 	}
 };
-function O(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 k(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);
+			}
+		}
+	}
+	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 O(n, r);
+}
+function A(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 O || e instanceof D;
+	}
+	function o(e, t) {
+		if (typeof t == "number") r += e * t;
+		else if (t instanceof O) {
+			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("; ")}.`);
 			}
-			r += t.constant;
-		} else if (e) {
-			let t = e, r = n.get(t) || 0;
-			n.set(t, r + 1);
+			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 D(n, r);
+	return new O(n, r);
 }
-var k = O, A = O, ie = 0, j = class e {
+//#endregion
+//#region src/modeler/variable.ts
+var ie = 0;
+function ae(e) {
+	if (!e) return "Continuous";
+	let t = e.toLowerCase();
+	return t === "binary" || t === "bin" ? "Binary" : t === "integer" || t === "int" ? "Integer" : "Continuous";
+}
+var j = class e {
 	id;
 	name;
 	type;
@@ -242,48 +333,42 @@ var k = O, A = O, ie = 0, j = class e {
 	value = null;
 	reducedCost = null;
 	constructor(e = {}) {
-		this.id = ++ie, 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 = ++ie, this.name = e.name || `x_${this.id}`, this.type = ae(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 D(/* @__PURE__ */ new Map([[this, t]]), 0);
-		if (t instanceof e) return E.fromProduct(this, t, 1);
-		let n = new E();
+		if (typeof t == "number") return new O(/* @__PURE__ */ new Map([[this, t]]), 0);
+		if (t instanceof e) return D.fromProduct(this, t, 1);
+		let n = new D();
 		Math.abs(t.constant) >= 1e-12 && n.linearTerms.set(this, t.constant);
 		for (let [e, r] of t.terms) {
-			let t = E.fromProduct(this, e, r);
+			let t = D.fromProduct(this, e, r);
 			n = n.add(t);
 		}
 		return n;
 	}
 	add(e) {
-		return e instanceof E ? e.add(this) : new D(/* @__PURE__ */ new Map([[this, 1]]), 0).add(e);
+		return e instanceof D ? e.add(this) : new O(/* @__PURE__ */ new Map([[this, 1]]), 0).add(e);
 	}
 	sub(e) {
-		return e instanceof E ? e.neg().add(this) : new D(/* @__PURE__ */ new Map([[this, 1]]), 0).sub(e);
+		return e instanceof D ? e.neg().add(this) : new O(/* @__PURE__ */ new Map([[this, 1]]), 0).sub(e);
 	}
 	neg() {
 		return this.mul(-1);
 	}
 	le(e, t) {
-		return new D(/* @__PURE__ */ new Map([[this, 1]]), 0).le(e, t);
+		return new O(/* @__PURE__ */ new Map([[this, 1]]), 0).le(e, t);
 	}
 	lessThanOrEqual(e, t) {
 		return this.le(e, t);
 	}
 	ge(e, t) {
-		return new D(/* @__PURE__ */ new Map([[this, 1]]), 0).ge(e, t);
+		return new O(/* @__PURE__ */ new Map([[this, 1]]), 0).ge(e, t);
 	}
 	greaterThanOrEqual(e, t) {
 		return this.ge(e, t);
 	}
 	eq(e, t) {
-		return new D(/* @__PURE__ */ new Map([[this, 1]]), 0).eq(e, t);
+		return new O(/* @__PURE__ */ new Map([[this, 1]]), 0).eq(e, t);
 	}
 	equalTo(e, t) {
 		return this.eq(e, t);
@@ -294,7 +379,7 @@ var k = O, A = O, ie = 0, j = class e {
 };
 //#endregion
 //#region src/modeler/parser.ts
-function ae(e) {
+function M(e) {
 	let t = [], n = 0, r = e.length;
 	for (; n < r;) {
 		let i = e[n];
@@ -350,7 +435,7 @@ function ae(e) {
 	}
 	return t;
 }
-var oe = class {
+var N = class {
 	tokens;
 	pos = 0;
 	resolver;
@@ -412,12 +497,12 @@ var oe = class {
 				let e = this.consume();
 				return this.resolveVariable(e.value).mul(t);
 			}
-			return new D(/* @__PURE__ */ new Map(), t);
+			return new O(/* @__PURE__ */ new Map(), t);
 		}
 		if (e.type === "IDENT") {
 			this.consume();
 			let t = this.resolveVariable(e.value);
-			return new D(/* @__PURE__ */ new Map([[t, 1]]), 0);
+			return new O(/* @__PURE__ */ new Map([[t, 1]]), 0);
 		}
 		if (e.type === "LPAREN") {
 			this.consume("LPAREN");
@@ -432,10 +517,10 @@ var oe = class {
 		return t;
 	}
 };
-function M(e, t) {
-	return new oe(ae(e), t).parseExpression();
+function P(e, t) {
+	return new N(M(e), t).parseExpression();
 }
-function N(e, t, n) {
+function F(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;
@@ -443,10 +528,10 @@ function N(e, t, n) {
 	else if (i === ">=" || i === "=>") c = ">=";
 	else if (i === "==" || i === "=") c = "==";
 	else throw Error(`Unsupported operator "${i}"`);
-	let l = M(o, t), u = M(s, t);
+	let l = P(o, t), u = P(s, t);
 	return c === "<=" ? l.le(u, n) : c === ">=" ? l.ge(u, n) : l.eq(u, n);
 }
-function P(e, t) {
+function I(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];
@@ -454,7 +539,7 @@ function P(e, t) {
 		else if (e instanceof j) {
 			let t = `__v_${i}__`;
 			n.set(t, e), r += t;
-		} else if (e instanceof D) {
+		} else if (e instanceof O) {
 			`${i}`, r += `(${e.toString()})`;
 			for (let [t] of e.terms) n.set(t.name, t);
 		}
@@ -464,42 +549,42 @@ function P(e, t) {
 		resolver: (e) => n.get(e)
 	};
 }
-function se(e, ...t) {
-	let { fullText: n, resolver: r } = P(e, t);
-	return N(n, r);
+function L(e, ...t) {
+	let { fullText: n, resolver: r } = I(e, t);
+	return F(n, r);
 }
-function ce(e, ...t) {
-	let { fullText: n, resolver: r } = P(e, t);
-	return /(<=|>=|==|=<|=>|=)/.test(n) ? N(n, r) : M(n, r);
+function R(e, ...t) {
+	let { fullText: n, resolver: r } = I(e, t);
+	return /(<=|>=|==|=<|=>|=)/.test(n) ? F(n, r) : P(n, r);
 }
 //#endregion
 //#region src/modeler/lp-writer.ts
-function le(e, t, n) {
+function z(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 F(e) {
+function B(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 = le(e.name, "x", e.id), n = t, r = 1;
+		let t = z(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 = le(e.name, "c", e.id), n = t, r = 1;
+		let t = z(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 E ? n.linearTerms : n.terms;
+	d.push(t && t.toLowerCase() === "maximize" ? "Maximize" : "Minimize");
+	let f = [], p = !0, m = n instanceof D ? 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 E && n.quadTerms.size > 0) {
+	if (n instanceof D && n.quadTerms.size > 0) {
 		let e = [], t = !0;
 		for (let r of n.quadTerms.values()) {
 			if (Math.abs(r.coeff) < 1e-12) continue;
@@ -551,41 +636,41 @@ function F(e) {
 }
 //#endregion
 //#region src/modeler/solvers/highs/worker-client.ts
-var I = null, ue = 0, L = /* @__PURE__ */ new Map();
-function de() {
+var V = null, oe = 0, H = /* @__PURE__ */ new Map();
+function se() {
 	if (typeof window > "u" || typeof Worker > "u") return null;
-	if (!I) try {
-		I = ee();
-		let e = I;
-		I.onmessage = (e) => {
-			let { type: t, id: n, result: r, runTime: i, error: a } = e.data, o = L.get(n);
-			o && (L.delete(n), t === "SOLVE_SUCCESS" ? o.resolve({
+	if (!V) try {
+		V = ee();
+		let e = V;
+		V.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({
 				result: r,
 				runTime: i
 			}) : o.reject(Error(a || "Worker solve failed")));
 		};
 		let t = (t) => {
-			if (I === e) {
-				I = null, e.terminate();
-				for (let e of L.values()) e.reject(t);
-				L.clear();
+			if (V === e) {
+				V = null, e.terminate();
+				for (let e of H.values()) e.reject(t);
+				H.clear();
 			}
 		};
-		I.onerror = (e) => t(/* @__PURE__ */ Error(`[WaSHI] HiGHS Worker failed to load or execute. Check Worker assets, CORS and CSP. ${e?.message || ""}`)), I.onmessageerror = () => t(/* @__PURE__ */ Error("[WaSHI] Could not deserialize the HiGHS Worker response."));
+		V.onerror = (e) => t(/* @__PURE__ */ Error(`[WaSHI] HiGHS Worker failed to load or execute. Check Worker assets, CORS and CSP. ${e?.message || ""}`)), V.onmessageerror = () => t(/* @__PURE__ */ Error("[WaSHI] Could not deserialize the HiGHS Worker response."));
 	} catch {
-		I = null;
+		V = null;
 	}
-	return I;
+	return V;
 }
-async function R(e, t = {}) {
-	let n = await _(t.wasmUrl), r = t.useWorker ?? typeof window < "u" ? de() : null;
+async function U(e, t = {}) {
+	let n = await _(t.wasmUrl), r = t.useWorker ?? typeof window < "u" ? se() : null;
 	if (!r) return m(e, t);
 	let i = {
 		...t,
 		wasmUrl: n
-	}, a = `req_${++ue}`;
+	}, a = `req_${++oe}`;
 	return new Promise((t, n) => {
-		L.set(a, {
+		H.set(a, {
 			resolve: t,
 			reject: n
 		});
@@ -597,13 +682,13 @@ async function R(e, t = {}) {
 				options: i
 			});
 		} catch (e) {
-			L.delete(a), n(e);
+			H.delete(a), n(e);
 		}
 	});
 }
 //#endregion
 //#region src/modeler/solvers/highs/solver.ts
-function z(e) {
+function W(e) {
 	if (typeof e != "string") return "Unknown";
 	let t = e.trim();
 	if (!t) return "Unknown";
@@ -632,7 +717,7 @@ function z(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 B = class e {
+var G = class e {
 	static capabilities = {
 		supportsMIP: !0,
 		supportsQP: !0
@@ -648,7 +733,18 @@ var B = class e {
 		let r = {
 			...this.options,
 			...n
-		}, { lpString: i, nameToVar: a, nameToConstraint: o } = t, { result: s, runTime: c } = await R(i, r), l = z(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 U(i, r), l = W(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) {
@@ -677,53 +773,53 @@ var B = class e {
 			raw: s
 		};
 	}
-}, V = B;
-function H() {
-	d("highs", (e) => new B(e)), l((e) => new B(e));
+}, K = G;
+function q() {
+	d("highs", (e) => new G(e)), l((e) => new G(e));
 }
-H();
+q();
 //#endregion
 //#region src/modeler/solvers/highs/index.ts
-var U = /* @__PURE__ */ S({
-	HiGHS: () => V,
-	HighsSolver: () => B,
+var J = /* @__PURE__ */ S({
+	HiGHS: () => K,
+	HighsSolver: () => G,
 	OFFICIAL_HIGHS_CDN_WASM_URL: () => b,
 	getHighs: () => g,
 	getHighsWasmUrl: () => v,
 	isValidWasmHeader: () => h,
-	mapHighsStatus: () => z,
+	mapHighsStatus: () => W,
 	probeWasmUrl: () => p,
-	registerHighsSolver: () => H,
+	registerHighsSolver: () => q,
 	resolveBrowserWasmUrl: () => _,
 	setHighsWasmUrl: () => y,
-	solveLp: () => R,
+	solveLp: () => U,
 	solveLpWithHighs: () => m
 });
-import * as fe from "./highs-worker-factory.js";
-w(U, fe);
-import * as pe from "./highs-assets.js";
-w(U, pe);
+import * as ce from "./highs-worker-factory.js";
+w(J, ce);
+import * as le from "./highs-assets.js";
+w(J, le);
 //#endregion
 //#region src/modeler/solvers/highs.ts
-var W = /* @__PURE__ */ S({
-	HiGHS: () => V,
-	HighsSolver: () => B,
+var Y = /* @__PURE__ */ S({
+	HiGHS: () => K,
+	HighsSolver: () => G,
 	OFFICIAL_HIGHS_CDN_WASM_URL: () => b,
 	getHighs: () => g,
 	getHighsWasmUrl: () => v,
 	isValidWasmHeader: () => h,
-	mapHighsStatus: () => z,
+	mapHighsStatus: () => W,
 	probeWasmUrl: () => p,
-	registerHighsSolver: () => H,
+	registerHighsSolver: () => q,
 	resolveBrowserWasmUrl: () => _,
 	setHighsWasmUrl: () => y,
-	solveLp: () => R,
+	solveLp: () => U,
 	solveLpWithHighs: () => m
 });
-w(W, U);
+w(Y, J);
 //#endregion
 //#region src/modeler/solvers/mock.ts
-var G = class {
+var X = class {
 	name;
 	capabilities;
 	options;
@@ -750,37 +846,37 @@ var G = class {
 		};
 	}
 };
-function K() {
-	d("mock", (e) => new G(e));
+function Z() {
+	d("mock", (e) => new X(e));
 }
-K();
+Z();
 //#endregion
 //#region src/modeler/solvers/index.ts
-var q = /* @__PURE__ */ S({
-	HiGHS: () => V,
-	HighsSolver: () => B,
-	MockSolver: () => G,
+var Q = /* @__PURE__ */ S({
+	HiGHS: () => K,
+	HighsSolver: () => G,
+	MockSolver: () => X,
 	OFFICIAL_HIGHS_CDN_WASM_URL: () => b,
 	getHighs: () => g,
 	getHighsWasmUrl: () => v,
 	getSolver: () => f,
 	isValidWasmHeader: () => h,
 	listAvailableSolvers: () => u,
-	mapHighsStatus: () => z,
+	mapHighsStatus: () => W,
 	probeWasmUrl: () => p,
-	registerHighsSolver: () => H,
-	registerMockSolver: () => K,
+	registerHighsSolver: () => q,
+	registerMockSolver: () => Z,
 	registerSolver: () => d,
 	resolveBrowserWasmUrl: () => _,
 	setDefaultSolver: () => l,
 	setHighsWasmUrl: () => y,
-	solveLp: () => R,
+	solveLp: () => U,
 	solveLpWithHighs: () => m
 });
-w(q, W);
+w(Q, Y);
 //#endregion
 //#region src/modeler/model.ts
-var J = class {
+var $ = class {
 	name;
 	sense;
 	objective;
@@ -802,7 +898,7 @@ var J = class {
 		n = typeof e == "string" ? {
 			...t,
 			name: e
-		} : e, this.name = n.name || "OptimizationModel", this.sense = n.sense || "Minimize", this.objective = new D(), n.solver && (this.solver = f(n.solver));
+		} : e, this.name = n.name || "OptimizationModel", this.sense = T(n.sense), this.objective = new O(), n.solver && (this.solver = f(n.solver));
 	}
 	get vars() {
 		return this.variables;
@@ -816,6 +912,60 @@ var J = 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" ? {
@@ -879,7 +1029,8 @@ var J = class {
 		return this.constrMapByName.get(e);
 	}
 	setObjective(e, t) {
-		t && (this.sense = t), this.objective = typeof e == "string" ? M(e, (e) => this.getVarByName(e)) : typeof e == "number" ? new D(/* @__PURE__ */ new Map(), e) : e instanceof E || "terms" in e ? e.clone() : new D(/* @__PURE__ */ new Map([[e, 1]]), 0);
+		if (e instanceof c) 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 = T(t)), this.objective = typeof e == "string" ? P(e, (e) => this.getVarByName(e)) : typeof e == "number" ? new O(/* @__PURE__ */ new Map(), e) : e instanceof D || "terms" in e ? e.clone() : new O(/* @__PURE__ */ new Map([[e, 1]]), 0);
 	}
 	maximize(e) {
 		this.setObjective(e, "Maximize");
@@ -887,11 +1038,31 @@ var J = 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 O) 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 j) 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 n(e);
 		return this.boolVars.push(t), t;
 	}
 	addConstraint(e, t) {
+		if (e instanceof O) throw Error("Cannot add a linear expression without a comparison operator (<=, >=, ==) as a constraint. Use expr`... <= ...` or .le(), .ge(), .eq().");
 		if (e instanceof i) {
 			let n = t || `lc_${this.logicalConstraints.length + 1}`;
 			return this.logicalConstraints.push({
@@ -900,7 +1071,7 @@ var J = class {
 			}), e;
 		}
 		let n;
-		if (typeof e == "string" ? n = N(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 = F(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) {
@@ -916,31 +1087,35 @@ var J = class {
 		}
 		return e instanceof j ? (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 } = F({
+		let { lpString: e } = B({
 			name: this.name,
 			sense: this.sense,
 			objective: this.objective,
@@ -951,7 +1126,7 @@ var J = 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 = f(e, t), r = t || {}) : (r = { ...e }, r.solver ? (n = f(r.solver, r), delete r.solver) : n = this.solver || f()), this.objective instanceof E && 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 = f(e, t), r = t || {}) : (r = { ...e }, r.solver ? (n = f(r.solver, r), delete r.solver) : n = this.solver || f()), this.objective instanceof D && 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,
@@ -960,13 +1135,23 @@ var J = class {
 			variables: this.variables,
 			logicalConstraints: this.logicalConstraints,
 			boolVars: this.boolVars
-		}, a = F(i), o = await n.solve(i, a, r);
+		}, a = B(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);
@@ -1005,21 +1190,26 @@ var J = 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 D(), this.sense = "Minimize";
+			this.objective = new O(), 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,
@@ -1029,190 +1219,47 @@ var J = class {
 			this.objective = i, this.sense = a;
 		}
 	}
-}, Y = "Minimize", me = "Maximize", he = "Continuous", ge = "Integer", _e = "Binary", ve = {
-	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"
-}, ye = class e extends j {
-	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 be(e) {
-	return e == null ? null : typeof e == "number" ? e : e.value;
-}
-var xe = class {
-	model;
-	constructor(e = "NoName", t = Y) {
-		this.model = new J({
-			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 j && 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 c ? this.addConstraint(e, t) : this.setObjective(e);
-	}
-	async solve(e, t) {
-		return this.model.optimize(e, t);
-	}
-	toLpString() {
-		return this.model.toLpString();
-	}
-}, X = "Minimize", Z = "Maximize", Q = "Binary", Se = "Integer", Ce = "Continuous";
-function we(e) {
-	return {
-		expr: e,
-		sense: Z
-	};
-}
-function Te(e) {
-	return {
-		expr: e,
-		sense: X
-	};
-}
-var $ = class extends J {
-	constructor(e = "MipModel", t = X) {
-		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);
-	}
 };
 w(/* @__PURE__ */ S({
-	BINARY: () => Q,
 	BoolExpr: () => i,
 	BoolOp: () => o,
 	BoolVar: () => n,
-	CONTINUOUS: () => Ce,
 	Constraint: () => c,
-	HiGHS: () => V,
-	HighsSolver: () => B,
-	INTEGER: () => Se,
-	LinExpr: () => D,
-	LpBinary: () => _e,
-	LpContinuous: () => he,
-	LpInteger: () => ge,
-	LpMaximize: () => me,
-	LpMinimize: () => Y,
-	LpProblem: () => xe,
-	LpStatus: () => ve,
-	LpVariable: () => ye,
-	MAXIMIZE: () => Z,
-	MINIMIZE: () => X,
-	MipModel: () => $,
-	MockSolver: () => G,
-	Model: () => J,
+	HiGHS: () => K,
+	HighsSolver: () => G,
+	LinExpr: () => O,
+	MockSolver: () => X,
+	Model: () => $,
 	OFFICIAL_HIGHS_CDN_WASM_URL: () => b,
-	QuadExpr: () => E,
+	QuadExpr: () => D,
 	Var: () => j,
 	and: () => e,
-	c: () => se,
-	expr: () => ce,
-	generateLpString: () => F,
+	c: () => L,
+	dot: () => A,
+	expr: () => R,
+	generateLpString: () => B,
 	getHighs: () => g,
 	getHighsWasmUrl: () => v,
 	getSolver: () => f,
 	implies: () => a,
 	isValidWasmHeader: () => h,
 	listAvailableSolvers: () => u,
-	lpSum: () => A,
-	mapHighsStatus: () => z,
-	maximize: () => we,
-	minimize: () => Te,
+	mapHighsStatus: () => W,
 	not: () => s,
 	or: () => t,
-	parseConstraint: () => N,
-	parseExpr: () => M,
+	parseConstraint: () => F,
+	parseExpr: () => P,
 	probeWasmUrl: () => p,
-	registerHighsSolver: () => H,
-	registerMockSolver: () => K,
+	registerHighsSolver: () => q,
+	registerMockSolver: () => Z,
 	registerSolver: () => d,
 	resolveBrowserWasmUrl: () => _,
 	setDefaultSolver: () => l,
 	setHighsWasmUrl: () => y,
-	solveLp: () => R,
+	solveLp: () => U,
 	solveLpWithHighs: () => m,
-	sum: () => O,
-	value: () => be,
-	xor: () => r,
-	xsum: () => k
-}), q);
+	sum: () => k,
+	xor: () => r
+}), Q);
 //#endregion
-export { Q as BINARY, i as BoolExpr, o as BoolOp, n as BoolVar, Ce as CONTINUOUS, c as Constraint, V as HiGHS, B as HighsSolver, Se as INTEGER, D as LinExpr, _e as LpBinary, he as LpContinuous, ge as LpInteger, me as LpMaximize, Y as LpMinimize, xe as LpProblem, ve as LpStatus, ye as LpVariable, Z as MAXIMIZE, X as MINIMIZE, $ as MipModel, G as MockSolver, J as Model, b as OFFICIAL_HIGHS_CDN_WASM_URL, E as QuadExpr, j as Var, e as and, se as c, ce as expr, F as generateLpString, g as getHighs, v as getHighsWasmUrl, f as getSolver, a as implies, h as isValidWasmHeader, u as listAvailableSolvers, A as lpSum, we as maximize, Te as minimize, s as not, t as or, N as parseConstraint, M as parseExpr, p as probeWasmUrl, d as registerSolver, _ as resolveBrowserWasmUrl, l as setDefaultSolver, y as setHighsWasmUrl, m as solveLpWithHighs, O as sum, be as value, r as xor, k as xsum };
+export { i as BoolExpr, o as BoolOp, n as BoolVar, c as Constraint, K as HiGHS, G as HighsSolver, O as LinExpr, X as MockSolver, $ as Model, b as OFFICIAL_HIGHS_CDN_WASM_URL, D as QuadExpr, j as Var, e as and, L as c, A as dot, R as expr, B as generateLpString, g as getHighs, v as getHighsWasmUrl, f as getSolver, a as implies, h as isValidWasmHeader, u as listAvailableSolvers, T as normalizeSense, s as not, t as or, F as parseConstraint, P as parseExpr, p as probeWasmUrl, d as registerSolver, _ as resolveBrowserWasmUrl, l as setDefaultSolver, y as setHighsWasmUrl, m as solveLpWithHighs, k as sum, r as xor };