@ohtaman/washi 0.1.2 → 0.2.0

package/dist/browser/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 "./highs-loader-T47YOyos.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 "./loader-CVt4CloI.js";
 //#region src/modeler/boolean-expr.ts
 var l = 0, u = class {
 	and(e) {
@@ -56,7 +56,7 @@ function _(...e) {
 }
 //#endregion
 //#region src/modeler/constraint.ts
-var v = 0, y = class {
+var ee = 0, v = class {
 	id;
 	lhs;
 	sense;
@@ -65,7 +65,7 @@ var v = 0, y = class {
 	slack = null;
 	dual = null;
 	constructor(e, t, n, r) {
-		this.id = ++v, this.lhs = e, this.sense = t, this.rhs = n, this.name = r || `c_${this.id}`;
+		this.id = ++ee, this.lhs = e, this.sense = t, this.rhs = n, this.name = r || `c_${this.id}`;
 	}
 	get pi() {
 		return this.dual;
@@ -92,11 +92,11 @@ var v = 0, y = class {
 };
 //#endregion
 //#region src/modeler/quad-expr.ts
-function b(e, t) {
+function y(e, t) {
 	let n = e.id, r = t.id;
 	return n <= r ? `${n}:${r}` : `${r}:${n}`;
 }
-var x = class e {
+var b = class e {
 	linearTerms;
 	quadTerms;
 	constant;
@@ -109,7 +109,7 @@ var x = class e {
 		return new e(this.linearTerms, this.quadTerms, this.constant);
 	}
 	getQuadCoeff(e, t) {
-		let n = b(e, t), r = this.quadTerms.get(n);
+		let n = y(e, t), r = this.quadTerms.get(n);
 		return r ? r.coeff : 0;
 	}
 	add(t) {
@@ -182,14 +182,14 @@ var x = class e {
 		return this.value;
 	}
 	static fromProduct(t, n, r = 1) {
-		let i = new e(), a = b(t, n);
+		let i = new e(), a = y(t, n);
 		return i.quadTerms.set(a, {
 			var1: t.id <= n.id ? t : n,
 			var2: t.id <= n.id ? n : t,
 			coeff: r
 		}), i;
 	}
-}, S = class e {
+}, x = class e {
 	terms;
 	constant;
 	constructor(e = /* @__PURE__ */ new Map(), t = 0) {
@@ -199,7 +199,7 @@ var x = class e {
 		return new e(this.terms, this.constant);
 	}
 	add(e) {
-		if (e instanceof x) return e.add(this);
+		if (e instanceof b) return e.add(this);
 		let t = this.clone();
 		if (typeof e == "number") t.constant += e;
 		else if ("terms" in e) {
@@ -215,7 +215,7 @@ var x = class e {
 		return t;
 	}
 	sub(e) {
-		return e instanceof x ? e.neg().add(this) : typeof e == "number" ? this.add(-e) : ("terms" in e, this.add(e.mul(-1)));
+		return e instanceof b ? 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 +226,9 @@ var x = class e {
 			}
 			return n;
 		}
-		let n = new x();
+		let n = new b();
 		Math.abs(this.constant) >= 1e-12 && n.linearTerms.set(t, this.constant);
-		for (let [e, r] of this.terms) n = n.add(x.fromProduct(e, t, r));
+		for (let [e, r] of this.terms) n = n.add(b.fromProduct(e, t, r));
 		return n;
 	}
 	div(e) {
@@ -271,7 +271,7 @@ var x = 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 y(i, t, o, r);
+		return i.constant = 0, new v(i, t, o, r);
 	}
 	toString() {
 		let e = [], t = !0;
@@ -286,7 +286,7 @@ var x = class e {
 		return e.join(" ") || "0";
 	}
 };
-function C(e, t) {
+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;
@@ -304,9 +304,9 @@ function C(e, t) {
 		}
 	}
 	for (let [e, t] of n) Math.abs(t) < 1e-12 && n.delete(e);
-	return new S(n, r);
+	return new x(n, r);
 }
-var w = C, T = C, E = 0, D = class e {
+var C = S, w = S, T = 0, E = class e {
 	id;
 	name;
 	type;
@@ -315,7 +315,7 @@ var w = C, T = C, E = 0, D = class e {
 	value = null;
 	reducedCost = null;
 	constructor(e = {}) {
-		this.id = ++E, 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);
+		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;
@@ -324,39 +324,39 @@ var w = C, T = C, E = 0, D = class e {
 		return this.value;
 	}
 	mul(t) {
-		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();
+		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();
 		Math.abs(t.constant) >= 1e-12 && n.linearTerms.set(this, t.constant);
 		for (let [e, r] of t.terms) {
-			let t = x.fromProduct(this, e, r);
+			let t = b.fromProduct(this, e, r);
 			n = n.add(t);
 		}
 		return n;
 	}
 	add(e) {
-		return e instanceof x ? e.add(this) : new S(/* @__PURE__ */ new Map([[this, 1]]), 0).add(e);
+		return e instanceof b ? e.add(this) : new x(/* @__PURE__ */ new Map([[this, 1]]), 0).add(e);
 	}
 	sub(e) {
-		return e instanceof x ? e.neg().add(this) : new S(/* @__PURE__ */ new Map([[this, 1]]), 0).sub(e);
+		return e instanceof b ? e.neg().add(this) : new x(/* @__PURE__ */ new Map([[this, 1]]), 0).sub(e);
 	}
 	neg() {
 		return this.mul(-1);
 	}
 	le(e, t) {
-		return new S(/* @__PURE__ */ new Map([[this, 1]]), 0).le(e, t);
+		return new x(/* @__PURE__ */ new Map([[this, 1]]), 0).le(e, t);
 	}
 	lessThanOrEqual(e, t) {
 		return this.le(e, t);
 	}
 	ge(e, t) {
-		return new S(/* @__PURE__ */ new Map([[this, 1]]), 0).ge(e, t);
+		return new x(/* @__PURE__ */ new Map([[this, 1]]), 0).ge(e, t);
 	}
 	greaterThanOrEqual(e, t) {
 		return this.ge(e, t);
 	}
 	eq(e, t) {
-		return new S(/* @__PURE__ */ new Map([[this, 1]]), 0).eq(e, t);
+		return new x(/* @__PURE__ */ new Map([[this, 1]]), 0).eq(e, t);
 	}
 	equalTo(e, t) {
 		return this.eq(e, t);
@@ -367,7 +367,7 @@ var w = C, T = C, E = 0, D = class e {
 };
 //#endregion
 //#region src/modeler/parser.ts
-function ee(e) {
+function te(e) {
 	let t = [], n = 0, r = e.length;
 	for (; n < r;) {
 		let i = e[n];
@@ -423,7 +423,7 @@ function ee(e) {
 	}
 	return t;
 }
-var te = class {
+var ne = class {
 	tokens;
 	pos = 0;
 	resolver;
@@ -485,12 +485,12 @@ var te = class {
 				let e = this.consume();
 				return this.resolveVariable(e.value).mul(t);
 			}
-			return new S(/* @__PURE__ */ new Map(), t);
+			return new x(/* @__PURE__ */ new Map(), t);
 		}
 		if (e.type === "IDENT") {
 			this.consume();
 			let t = this.resolveVariable(e.value);
-			return new S(/* @__PURE__ */ new Map([[t, 1]]), 0);
+			return new x(/* @__PURE__ */ new Map([[t, 1]]), 0);
 		}
 		if (e.type === "LPAREN") {
 			this.consume("LPAREN");
@@ -505,10 +505,10 @@ var te = class {
 		return t;
 	}
 };
-function O(e, t) {
-	return new te(ee(e), t).parseExpression();
+function D(e, t) {
+	return new ne(te(e), t).parseExpression();
 }
-function k(e, t, n) {
+function O(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,18 +516,18 @@ function k(e, t, n) {
 	else if (i === ">=" || i === "=>") c = ">=";
 	else if (i === "==" || i === "=") c = "==";
 	else throw Error(`Unsupported operator "${i}"`);
-	let l = O(o, t), u = O(s, t);
+	let l = D(o, t), u = D(s, t);
 	return c === "<=" ? l.le(u, n) : c === ">=" ? l.ge(u, n) : l.eq(u, n);
 }
-function A(e, t) {
+function k(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];
 		if (typeof e == "number") r += `(${e})`;
-		else if (e instanceof D) {
+		else if (e instanceof E) {
 			let t = `__v_${i}__`;
 			n.set(t, e), r += t;
-		} else if (e instanceof S) {
+		} else if (e instanceof x) {
 			`${i}`, r += `(${e.toString()})`;
 			for (let [t] of e.terms) n.set(t.name, t);
 		}
@@ -537,42 +537,42 @@ function A(e, t) {
 		resolver: (e) => n.get(e)
 	};
 }
-function ne(e, ...t) {
-	let { fullText: n, resolver: r } = A(e, t);
-	return k(n, r);
-}
 function re(e, ...t) {
-	let { fullText: n, resolver: r } = A(e, t);
-	return /(<=|>=|==|=<|=>|=)/.test(n) ? k(n, r) : O(n, r);
+	let { fullText: n, resolver: r } = k(e, t);
+	return O(n, r);
+}
+function ie(e, ...t) {
+	let { fullText: n, resolver: r } = k(e, t);
+	return /(<=|>=|==|=<|=>|=)/.test(n) ? O(n, r) : D(n, r);
 }
 //#endregion
 //#region src/modeler/lp-writer.ts
-function j(e, t, n) {
+function A(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 M(e) {
+function j(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 = j(e.name, "x", e.id), n = t, r = 1;
+		let t = A(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 = j(e.name, "c", e.id), n = t, r = 1;
+		let t = A(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 x ? n.linearTerms : n.terms;
+	let f = [], p = !0, m = n instanceof b ? 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 x && n.quadTerms.size > 0) {
+	if (n instanceof b && n.quadTerms.size > 0) {
 		let e = [], t = !0;
 		for (let r of n.quadTerms.values()) {
 			if (Math.abs(r.coeff) < 1e-12) continue;
@@ -623,8 +623,39 @@ function M(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);
+}
+function L(e) {
+	if (typeof e == "string") {
+		let t = F.get(e.toLowerCase());
+		if (!t) throw Error(`Solver '${e}' is not registered.`);
+		P[N] = t;
+	} else P[N] = typeof e == "function" ? e : () => e;
+}
+function R(e, t) {
+	if (!e) {
+		let e = P[N] || F.get("highs");
+		if (!e) throw Error(`No default solver available. Available solvers: ${z().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(", ")}`);
+		return r(t);
+	}
+	return e;
+}
+function z() {
+	return Array.from(F.keys());
+}
+//#endregion
 //#region \0washi-browser-worker-factory
-function ie() {
+function ae() {
 	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" }));
@@ -636,42 +667,42 @@ function ie() {
 	}
 }
 //#endregion
-//#region src/highs-worker-client.ts
-var N = null, ae = 0, P = /* @__PURE__ */ new Map();
-function oe() {
+//#region src/modeler/solvers/highs/worker-client.ts
+var B = null, V = 0, H = /* @__PURE__ */ new Map();
+function U() {
 	if (typeof window > "u" || typeof Worker > "u") return null;
-	if (!N) try {
-		N = ie();
-		let e = N;
-		N.onmessage = (e) => {
-			let { type: t, id: n, result: r, runTime: i, error: a } = e.data, o = P.get(n);
-			o && (P.delete(n), t === "SOLVE_SUCCESS" ? o.resolve({
+	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({
 				result: r,
 				runTime: i
 			}) : o.reject(Error(a || "Worker solve failed")));
 		};
 		let t = (t) => {
-			if (N === e) {
-				N = null, e.terminate();
-				for (let e of P.values()) e.reject(t);
-				P.clear();
+			if (B === e) {
+				B = null, e.terminate();
+				for (let e of H.values()) e.reject(t);
+				H.clear();
 			}
 		};
-		N.onerror = (e) => t(/* @__PURE__ */ Error(`[WaSHI] HiGHS Worker failed to load or execute. Check Worker assets, CORS and CSP. ${e.message || ""}`)), N.onmessageerror = () => t(/* @__PURE__ */ Error("[WaSHI] Could not deserialize the HiGHS Worker response."));
-	} catch (e) {
-		console.warn("Could not instantiate Web Worker, falling back to main thread:", e), N = null;
+		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."));
+	} catch {
+		B = null;
 	}
-	return N;
+	return B;
 }
-async function se(e, n = {}) {
-	let r = await a(n.wasmUrl), i = n.useWorker ?? typeof window < "u" ? oe() : null;
+async function W(e, n = {}) {
+	let r = await a(n.wasmUrl), i = n.useWorker ?? typeof window < "u" ? U() : null;
 	if (!i) return t(e, n);
 	let o = {
 		...n,
 		wasmUrl: r
-	}, s = `req_${++ae}`;
+	}, s = `req_${++V}`;
 	return new Promise((t, n) => {
-		P.set(s, {
+		H.set(s, {
 			resolve: t,
 			reject: n
 		});
@@ -683,13 +714,13 @@ async function se(e, n = {}) {
 				options: o
 			});
 		} catch (e) {
-			P.delete(s), n(e);
+			H.delete(s), n(e);
 		}
 	});
 }
 //#endregion
-//#region src/modeler/solvers/highs.ts
-function ce(e) {
+//#region src/modeler/solvers/highs/solver.ts
+function G(e) {
 	if (typeof e != "string") return "Unknown";
 	let t = e.trim();
 	if (!t) return "Unknown";
@@ -718,7 +749,7 @@ function ce(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 F = class e {
+var K = class e {
 	static capabilities = {
 		supportsMIP: !0,
 		supportsQP: !0
@@ -734,7 +765,7 @@ var F = class e {
 		let r = {
 			...this.options,
 			...n
-		}, { lpString: i, nameToVar: a, nameToConstraint: o } = t, { result: s, runTime: c } = await se(i, r), l = ce(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 W(i, r), l = G(s?.Status), 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) {
@@ -763,129 +794,14 @@ var F = class e {
 			raw: s
 		};
 	}
-}, le = F, I = null;
-async function L() {
-	return I || (I = (async () => {
-		try {
-			let e = await import("./_washi-optional-engine-282Ug7Gw.js");
-			return await (e.default || e)();
-		} catch (e) {
-			throw Error("[WaSHI] Could not load GLPK. Install the optional glpk.js dependency before selecting this solver.", { cause: e });
-		}
-	})(), I);
+}, q = K;
+function oe() {
+	I("highs", (e) => new K(e)), L((e) => new K(e));
 }
+oe();
 //#endregion
-//#region src/modeler/solvers/glpk.ts
-var R = class e {
-	static capabilities = {
-		supportsMIP: !0,
-		supportsQP: !1
-	};
-	name = "GLPK";
-	version = "5.0.0";
-	capabilities = e.capabilities;
-	options;
-	constructor(e = {}) {
-		this.options = e;
-	}
-	async solve(e, t, n = {}) {
-		let r = {
-			...this.options,
-			...n
-		}, i = await L(), { nameToVar: a, nameToConstraint: o } = t, s = /* @__PURE__ */ new Map();
-		for (let [e, t] of a.entries()) s.set(t, e);
-		let c = /* @__PURE__ */ new Map();
-		for (let [e, t] of o.entries()) c.set(t, e);
-		let l = [], u = "linearTerms" in e.objective ? e.objective.linearTerms : e.objective.terms;
-		if (u) for (let [e, t] of u) {
-			if (Math.abs(t) < 1e-12) continue;
-			let n = s.get(e) || e.name;
-			l.push({
-				name: n,
-				coef: Number(t)
-			});
-		}
-		let d = [];
-		for (let t of e.constraints) {
-			let e = c.get(t) || t.name || `c_${d.length + 1}`, n = [];
-			for (let [e, r] of t.lhs.terms) {
-				if (Math.abs(r) < 1e-12) continue;
-				let t = s.get(e) || e.name;
-				n.push({
-					name: t,
-					coef: Number(r)
-				});
-			}
-			let r;
-			r = t.sense === "==" ? {
-				type: i.GLP_FX,
-				lb: t.rhs,
-				ub: t.rhs
-			} : t.sense === "<=" ? {
-				type: i.GLP_UP,
-				lb: -Infinity,
-				ub: t.rhs
-			} : {
-				type: i.GLP_LO,
-				lb: t.rhs,
-				ub: Infinity
-			}, d.push({
-				name: e,
-				vars: n,
-				bnds: r
-			});
-		}
-		let f = [], p = [], m = [];
-		for (let t of e.variables) {
-			let e = s.get(t) || t.name;
-			t.type === "Binary" ? f.push(e) : t.type === "Integer" && p.push(e);
-			let n = t.lb, r = t.ub, a;
-			a = n === -Infinity && r === Infinity ? i.GLP_FR : n !== -Infinity && r === Infinity ? i.GLP_LO : n === -Infinity && r !== Infinity ? i.GLP_UP : n === r ? i.GLP_FX : i.GLP_DB, m.push({
-				name: e,
-				type: a,
-				lb: n === -Infinity ? 0 : n,
-				ub: r === Infinity ? 0 : r
-			});
-		}
-		let h = {
-			name: e.name || "GLPK_Model",
-			objective: {
-				direction: e.sense === "Maximize" ? i.GLP_MAX : i.GLP_MIN,
-				name: "obj",
-				vars: l
-			},
-			subjectTo: d
-		};
-		m.length > 0 && (h.bounds = m), f.length > 0 && (h.binaries = f), p.length > 0 && (h.generals = p);
-		let g = {
-			msglev: r.verbose ? i.GLP_MSG_ALL : i.GLP_MSG_OFF,
-			presol: r.presolve !== "off"
-		};
-		typeof r.timeLimit == "number" && (g.tmlim = r.timeLimit), typeof r.mipGap == "number" && (g.mipgap = r.mipGap);
-		let _ = performance.now(), v = await i.solve(h, g), y = (performance.now() - _) / 1e3, b = v?.result?.status, x;
-		x = b === i.GLP_OPT ? "Optimal" : b === i.GLP_FEAS ? "Feasible" : b === i.GLP_INFEAS || b === i.GLP_NOFEAS ? "Infeasible" : b === i.GLP_UNBND ? "Unbounded" : "Optimal";
-		let S = v?.result?.z, C = typeof S == "number" ? S + e.objective.constant : null, w = {}, T = v?.result?.vars || {};
-		for (let [e, t] of Object.entries(T)) {
-			let n = a.get(e), r = n ? n.name : e;
-			w[r] = typeof t == "number" ? Math.abs(t) < 1e-9 ? 0 : t : 0;
-		}
-		for (let t of e.variables) w[t.name] === void 0 && (w[t.name] = 0);
-		let E = {};
-		if (v?.result?.dual) for (let [e, t] of Object.entries(v.result.dual)) {
-			let n = o.get(e), r = n ? n.name : e;
-			E[r] = Number(t);
-		}
-		return {
-			status: x,
-			objectiveValue: C,
-			values: w,
-			duals: E,
-			runTime: v?.time || y,
-			logs: [`GLPK solved in ${(v?.time || y) * 1e3} ms.`],
-			raw: v
-		};
-	}
-}, z = class {
+//#region src/modeler/solvers/mock.ts
+var J = class {
 	name;
 	capabilities;
 	options;
@@ -911,265 +827,11 @@ var R = class e {
 			raw: { mock: !0 }
 		};
 	}
-}, B = /* @__PURE__ */ new Map();
-B.set("highs", (e) => new F(e)), B.set("glpk", (e) => new R(e)), B.set("mock", (e) => new z(e));
-var V = (e) => new F(e);
-function H(e, t) {
-	B.set(e.toLowerCase(), t);
-}
-function ue(e) {
-	if (typeof e == "string") {
-		let t = B.get(e.toLowerCase());
-		if (!t) throw Error(`Solver '${e}' is not registered.`);
-		V = t;
-	} else V = typeof e == "function" ? e : () => e;
-}
-function U(e, t) {
-	if (!e) return V(t);
-	if (typeof e == "string") {
-		let n = B.get(e.toLowerCase());
-		if (!n) throw Error(`Solver '${e}' not found. Available solvers: ${W().join(", ")}`);
-		return n(t);
-	}
-	return e;
-}
-function W() {
-	return Array.from(B.keys());
-}
-//#endregion
-//#region src/modeler/solvers/z3.ts
-var G = null;
-async function K() {
-	if (!G) {
-		let e = (async () => {
-			try {
-				return await (await import("./_washi-optional-engine-282Ug7Gw.js")).init();
-			} catch (e) {
-				throw Error(`[WaSHI] Failed to load z3-solver. Ensure the optional dependency is installed (npm install z3-solver) and supported in this environment. Error: ${e instanceof Error ? e.message : String(e)}`, { cause: e });
-			}
-		})();
-		e.catch(() => {
-			G === e && (G = null);
-		}), G = e;
-	}
-	return G;
-}
-var q = class {
-	name = "z3";
-	capabilities = {
-		supportsMIP: !0,
-		supportsQP: !1,
-		supportsSMT: !0,
-		supportsUnsatCore: !0
-	};
-	createContextTranslator(e) {
-		let t = /* @__PURE__ */ new Map(), n = /* @__PURE__ */ new Map();
-		function r(n) {
-			if (!t.has(n.name)) {
-				let r = n.type === "Continuous" || n.type === "CONTINUOUS" ? e.Real.const(n.name) : e.Int.const(n.name);
-				t.set(n.name, r);
-			}
-			return t.get(n.name);
-		}
-		function i(t) {
-			if (!n.has(t.name)) {
-				let r = e.Bool.const(t.name);
-				n.set(t.name, r);
-			}
-			return n.get(t.name);
-		}
-		function a(t) {
-			return typeof e.isInt == "function" && e.isInt(t) ? e.ToReal(t) : t;
-		}
-		function o(t, n) {
-			let r = typeof e.isInt == "function" && e.isInt(t), i = typeof e.isInt == "function" && e.isInt(n);
-			return r && i ? t.add(n) : a(t).add(a(n));
-		}
-		function s(t, n) {
-			return typeof e.isInt == "function" && e.isInt(t) && Number.isInteger(n) ? t.mul(e.Int.val(n)) : a(t).mul(e.Real.val(n));
-		}
-		function c(t, n) {
-			let r = typeof e.isInt == "function" && e.isInt(t), i = typeof e.isInt == "function" && e.isInt(n);
-			return r && i ? t.mul(n) : a(t).mul(a(n));
-		}
-		function l(t, n) {
-			return n && Number.isInteger(t) ? e.Int.val(t) : e.Real.val(t);
-		}
-		function u(t, n, r) {
-			let i = typeof e.isInt == "function" && e.isInt(t) && Number.isInteger(r), o = i ? t : a(t), s = i ? e.Int.val(r) : e.Real.val(r);
-			return n === "<=" ? o.le(s) : n === ">=" ? o.ge(s) : o.eq(s);
-		}
-		function p(t) {
-			let n = null;
-			if (t && t.terms) for (let [e, i] of t.terms.entries()) {
-				let t = s(r(e), i);
-				n = n === null ? t : o(n, t);
-			}
-			let i = t && typeof t.constant == "number" ? t.constant : 0;
-			if (i !== 0 || n === null) {
-				let t = l(i, n === null || typeof e.isInt == "function" && e.isInt(n));
-				n = n === null ? t : o(n, t);
-			}
-			return n;
-		}
-		function m(t) {
-			let n = null;
-			if (t.linearTerms) for (let [e, i] of t.linearTerms.entries()) {
-				let t = s(r(e), i);
-				n = n === null ? t : o(n, t);
-			}
-			if (t.quadTerms) for (let e of t.quadTerms.values()) {
-				let t = s(c(r(e.var1), r(e.var2)), e.coeff);
-				n = n === null ? t : o(n, t);
-			}
-			let i = t && typeof t.constant == "number" ? t.constant : 0;
-			if (i !== 0 || n === null) {
-				let t = l(i, n === null || typeof e.isInt == "function" && e.isInt(n));
-				n = n === null ? t : o(n, t);
-			}
-			return n;
-		}
-		function h(e) {
-			let t = e.lhs instanceof Object && "quadTerms" in e.lhs ? m(e.lhs) : p(e.lhs), n = typeof e.rhs == "number" ? e.rhs : 0;
-			return u(t, e.sense, n);
-		}
-		function g(t) {
-			if (t instanceof d) return i(t);
-			if (t instanceof y) return h(t);
-			if (t instanceof f) switch (t.op) {
-				case "and": return e.And(...t.children.map(g));
-				case "or": return e.Or(...t.children.map(g));
-				case "not": return e.Not(g(t.children[0]));
-				case "implies": return e.Implies(g(t.children[0]), g(t.children[1]));
-				case "xor": return e.Xor(g(t.children[0]), g(t.children[1]));
-				default: throw Error(`Unsupported boolean operation: ${t.op}`);
-			}
-			throw Error(`Unknown logic element: ${String(t)}`);
-		}
-		function _(e) {
-			if (!e) return 0;
-			if (typeof e.asNumber == "function") return e.asNumber();
-			let t = e.toString();
-			if (t.startsWith("(/ ")) {
-				let e = t.slice(3, -1).trim().split(/\s+/);
-				if (e.length === 2) return Number(e[0]) / Number(e[1]);
-			}
-			return Number(t);
-		}
-		return {
-			getVarAst: r,
-			getBoolVarAst: i,
-			compareAstWithNumber: u,
-			translateLinExpr: p,
-			translateQuadExpr: m,
-			translateConstraint: h,
-			translateBoolExpr: g,
-			parseAstValue: _,
-			varAstMap: t,
-			boolVarAstMap: n
-		};
-	}
-	async check(e, t = {}) {
-		let { Context: n } = await K(), r = new n(`check_${Date.now()}_${Math.random().toString(36).substring(2, 7)}`), i = new r.Solver(), a = this.createContextTranslator(r), o = e.variables || e.vars || [], s = e.boolVars || [], c = e.constraints || [], l = e.logicalConstraints || [];
-		for (let e of o) {
-			let t = a.getVarAst(e);
-			e.lb !== -Infinity && i.add(a.compareAstWithNumber(t, ">=", e.lb)), e.ub !== Infinity && i.add(a.compareAstWithNumber(t, "<=", e.ub)), (e.type === "Binary" || e.type === "BINARY") && (i.add(a.compareAstWithNumber(t, ">=", 0)), i.add(a.compareAstWithNumber(t, "<=", 1)));
-		}
-		for (let e of c) {
-			let t = a.translateConstraint(e), n = r.Bool.const(e.name);
-			i.addAndTrack(t, n);
-		}
-		for (let e = 0; e < l.length; e++) {
-			let t = l[e], n = t && t.name || `lc_${e + 1}`, o = t && t.expr || t, s = a.translateBoolExpr(o), c = r.Bool.const(n);
-			i.addAndTrack(s, c);
-		}
-		let u = (await i.check()).toString();
-		if (u === "sat") {
-			let e = i.model(), t = {};
-			for (let n of o) {
-				let r = a.getVarAst(n), i = e.eval(r);
-				t[n.name] = a.parseAstValue(i);
-			}
-			for (let n of s) {
-				let r = a.getBoolVarAst(n), i = e.eval(r);
-				t[n.name] = i.toString() === "true";
-			}
-			return {
-				status: "Sat",
-				values: t
-			};
-		}
-		if (u === "unsat") {
-			let e = i.unsatCore(), t = [], n = typeof e.length == "function" ? e.length() : e.length;
-			for (let r = 0; r < n; r++) t.push(e.get(r).toString());
-			return {
-				status: "Unsat",
-				values: {},
-				unsatCore: t
-			};
-		}
-		return {
-			status: "Unknown",
-			values: {}
-		};
-	}
-	async solve(e, t, n = {}) {
-		if (!(e.objective !== null && e.objective !== void 0 && ("terms" in e.objective && e.objective.terms.size > 0 || "quadTerms" in e.objective && e.objective.quadTerms.length > 0 || e.objective.offset && e.objective.offset !== 0))) {
-			let t = await this.check(e, n), r = {};
-			for (let [e, n] of Object.entries(t.values)) r[e] = typeof n == "boolean" ? +!!n : n;
-			return {
-				status: t.status === "Sat" ? "Optimal" : t.status === "Unsat" ? "Infeasible" : "Error",
-				objectiveValue: 0,
-				values: r
-			};
-		}
-		let { Context: r } = await K(), i = new r(`opt_${Date.now()}_${Math.random().toString(36).substring(2, 7)}`), a = new i.Optimize(), o = this.createContextTranslator(i), s = e.variables || e.vars || [], c = e.boolVars || [], l = e.constraints || [], u = e.logicalConstraints || [];
-		for (let e of s) {
-			let t = o.getVarAst(e);
-			e.lb !== -Infinity && a.add(o.compareAstWithNumber(t, ">=", e.lb)), e.ub !== Infinity && a.add(o.compareAstWithNumber(t, "<=", e.ub)), (e.type === "Binary" || e.type === "BINARY") && (a.add(o.compareAstWithNumber(t, ">=", 0)), a.add(o.compareAstWithNumber(t, "<=", 1)));
-		}
-		for (let e of l) {
-			let t = o.translateConstraint(e);
-			a.add(t);
-		}
-		for (let e of u) {
-			let t = e && e.expr || e, n = o.translateBoolExpr(t);
-			a.add(n);
-		}
-		let d = e.objective instanceof Object && "quadTerms" in e.objective ? o.translateQuadExpr(e.objective) : o.translateLinExpr(e.objective);
-		(e.sense || "MINIMIZE").toUpperCase() === "MAXIMIZE" ? a.maximize(d) : a.minimize(d);
-		let f = (await a.check()).toString();
-		if (f === "sat") {
-			let e = a.model(), t = {};
-			for (let n of s) {
-				let r = o.getVarAst(n), i = e.eval(r);
-				t[n.name] = o.parseAstValue(i);
-			}
-			for (let n of c) {
-				let r = o.getBoolVarAst(n), i = e.eval(r);
-				t[n.name] = +(i.toString() === "true");
-			}
-			return {
-				status: "Optimal",
-				objectiveValue: o.parseAstValue(e.eval(d)),
-				values: t
-			};
-		}
-		return f === "unsat" ? {
-			status: "Infeasible",
-			objectiveValue: null,
-			values: {}
-		} : {
-			status: "Error",
-			objectiveValue: null,
-			values: {}
-		};
-	}
 };
-function J() {
-	H("z3", () => new q());
+function se() {
+	I("mock", (e) => new J(e));
 }
-J();
+se();
 //#endregion
 //#region src/modeler/model.ts
 var Y = class {
@@ -1189,8 +851,12 @@ var Y = class {
 	runTime = 0;
 	solution = null;
 	solver = null;
-	constructor(e = {}) {
-		this.name = e.name || "OptimizationModel", this.sense = e.sense || "Minimize", this.objective = new S(), e.solver && (this.solver = U(e.solver));
+	constructor(e = {}, t) {
+		let n;
+		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));
 	}
 	get vars() {
 		return this.variables;
@@ -1212,7 +878,7 @@ var Y = class {
 			lb: n,
 			ub: r
 		} : e || {};
-		let a = new D(i);
+		let a = new E(i);
 		if (this.varMapByName.has(a.name)) throw Error(`Variable with name '${a.name}' already exists in model`);
 		return this.variables.push(a), this.varMapByName.set(a.name, a), a;
 	}
@@ -1267,7 +933,7 @@ var Y = class {
 		return this.constrMapByName.get(e);
 	}
 	setObjective(e, t) {
-		t && (this.sense = t), this.objective = typeof e == "string" ? O(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);
+		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);
 	}
 	maximize(e) {
 		this.setObjective(e, "Maximize");
@@ -1288,7 +954,7 @@ var Y = class {
 			}), e;
 		}
 		let n;
-		if (typeof e == "string" ? n = k(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 = 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`);
 		return this.constraints.push(n), this.constrMapByName.set(n.name, n), n;
 	}
 	addConstr(e, t) {
@@ -1302,7 +968,7 @@ var Y = class {
 			for (let t of e) this.add(t);
 			return this;
 		}
-		return e instanceof D ? (this.varMapByName.has(e.name) || (this.variables.push(e), this.varMapByName.set(e.name, e)), this) : (this.addConstraint(e, t), this);
+		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;
@@ -1328,7 +994,7 @@ var Y = class {
 		return o;
 	}
 	toLpString() {
-		let { lpString: e } = M({
+		let { lpString: e } = j({
 			name: this.name,
 			sense: this.sense,
 			objective: this.objective,
@@ -1339,7 +1005,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 = U(e, t), r = t || {}) : (r = { ...e }, r.solver ? (n = U(r.solver, r), delete r.solver) : n = this.solver || U()), 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.`);
+		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.`);
 		let i = {
 			name: this.name,
 			sense: this.sense,
@@ -1348,7 +1014,7 @@ var Y = class {
 			variables: this.variables,
 			logicalConstraints: this.logicalConstraints,
 			boolVars: this.boolVars
-		}, a = M(i), o = await n.solve(i, a, r);
+		}, a = j(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)) {
@@ -1384,7 +1050,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 = U(e, t), r = t || {}) : (r = { ...e }, r.solver ? (n = U(r.solver, r), delete r.solver) : n = this.solver || U()), 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 = 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 (typeof n.check == "function") {
 			let e = await n.check({
 				name: this.name,
@@ -1405,7 +1071,7 @@ var Y = class {
 		}
 		let i = this.objective, a = this.sense;
 		try {
-			this.objective = new S(), this.sense = "Minimize";
+			this.objective = new x(), 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;
 			return {
@@ -1417,7 +1083,7 @@ var Y = class {
 			this.objective = i, this.sense = a;
 		}
 	}
-}, X = "Minimize", de = "Maximize", fe = "Continuous", pe = "Integer", me = "Binary", he = {
+}, X = "Minimize", ce = "Maximize", le = "Continuous", ue = "Integer", de = "Binary", Z = {
 	Optimal: "Optimal",
 	Feasible: "Feasible",
 	Infeasible: "Infeasible",
@@ -1429,7 +1095,7 @@ var Y = class {
 	Sat: "Sat",
 	Unsat: "Unsat",
 	Unknown: "Unknown"
-}, ge = class e extends D {
+}, fe = class e extends E {
 	constructor(e, t, n, r = "Continuous") {
 		super({
 			name: e,
@@ -1447,10 +1113,10 @@ var Y = class {
 		return o;
 	}
 };
-function _e(e) {
+function pe(e) {
 	return e == null ? null : typeof e == "number" ? e : e.value;
 }
-var Z = class {
+var me = class {
 	model;
 	constructor(e = "NoName", t = X) {
 		this.model = new Y({
@@ -1488,7 +1154,7 @@ var Z = class {
 	setObjective(e) {
 		if (typeof e == "object" && e) {
 			if ("terms" in e) for (let [t] of e.terms) this.addVariable(t);
-			else e instanceof D && this.addVariable(e);
+			else e instanceof E && this.addVariable(e);
 		}
 		this.model.setObjective(e);
 	}
@@ -1497,7 +1163,7 @@ var Z = class {
 		return this.model.addConstraint(e, t);
 	}
 	add(e, t) {
-		typeof e == "string" ? /(<=|>=|==|=<|=>|=)/.test(e) ? this.addConstraint(e, t) : this.setObjective(e) : e instanceof y ? this.addConstraint(e, t) : this.setObjective(e);
+		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);
@@ -1505,20 +1171,20 @@ var Z = class {
 	toLpString() {
 		return this.model.toLpString();
 	}
-}, Q = "Minimize", $ = "Maximize", ve = "Binary", ye = "Integer", be = "Continuous";
-function xe(e) {
+}, Q = "Minimize", $ = "Maximize", he = "Binary", ge = "Integer", _e = "Continuous";
+function ve(e) {
 	return {
 		expr: e,
 		sense: $
 	};
 }
-function Se(e) {
+function ye(e) {
 	return {
 		expr: e,
 		sense: Q
 	};
 }
-var Ce = class extends Y {
+var be = class extends Y {
 	constructor(e = "MipModel", t = Q) {
 		super({
 			name: e,
@@ -1544,4 +1210,4 @@ var Ce = class extends Y {
 	}
 };
 //#endregion
-export { ve as BINARY, u as BoolExpr, f as BoolOp, d as BoolVar, be as CONTINUOUS, y as Constraint, R as GLPKSolver, le as HiGHS, F as HighsSolver, ye as INTEGER, S as LinExpr, me as LpBinary, fe as LpContinuous, pe as LpInteger, de as LpMaximize, X as LpMinimize, Z as LpProblem, he as LpStatus, ge as LpVariable, $ as MAXIMIZE, Q as MINIMIZE, Ce as MipModel, z as MockSolver, Y as Model, c as OFFICIAL_HIGHS_CDN_WASM_URL, x as QuadExpr, D as Var, q as Z3Solver, p as and, ne as c, re as expr, M as generateLpString, L as getGlpk, i as getHighs, o as getHighsWasmUrl, U as getSolver, g as implies, n as isValidWasmHeader, W as listAvailableSolvers, T as lpSum, xe as maximize, Se as minimize, h as not, m as or, k as parseConstraint, O as parseExpr, e as probeWasmUrl, H as registerSolver, J as registerZ3Solver, a as resolveBrowserWasmUrl, ue as setDefaultSolver, s as setHighsWasmUrl, t as solveLpWithHighs, C as sum, _e as value, _ as xor, w as xsum };
+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 };