@ohtaman/washi 0.1.0 → 0.1.2

package/dist/lib/highs-loader-Blb99785.js

@@ -0,0 +1,50 @@
+import { getBundledWasmUrl as e } from "./highs-assets.js";
+import { loadNodeHighs as t } from "./highs-node-runtime.js";
+//#region src/highs-loader.ts
+var n = "https://cdn.jsdelivr.net/npm/highs@1.15.3/build/highs.wasm", r = null, i = null, a = null;
+function o(e) {
+	a = e, r = null, i = null;
+}
+function s() {
+	return a;
+}
+function c(e) {
+	return e.length >= 4 && e[0] === 0 && e[1] === 97 && e[2] === 115 && e[3] === 109;
+}
+async function l(e) {
+	try {
+		let t = await fetch(e, { headers: { Range: "bytes=0-3" } });
+		if (!t.ok || (t.headers.get("content-type") || "").includes("text/html")) return !1;
+		if (!t.body) return !0;
+		let n = t.body.getReader(), { value: r, done: i } = await n.read();
+		return await n.cancel(), i || !r || r.length < 4 ? !1 : c(r);
+	} catch {
+		return !1;
+	}
+}
+async function u(t) {
+	return t || a || e();
+}
+async function d(e = {}) {
+	let n = typeof process < "u" && process.versions?.node && process.type !== "renderer", a = n ? null : await u(e.wasmUrl), o = a ?? "node";
+	if (r && i === o) return r;
+	i = o;
+	let s = (async () => {
+		let e = n ? await t() : (await import("./highs-browser-runtime.js")).default;
+		return n ? await e() : await e({ locateFile: (e) => e.endsWith(".wasm") ? a : e });
+	})().catch((e) => {
+		r === s && (r = null, i = null);
+		let t = e instanceof Error ? e.message : String(e);
+		throw Error(`[WaSHI] Failed to initialize HiGHS${a ? ` from "${a}"` : ""}. Deploy the package's WASM asset or explicitly set wasmUrl; no CDN fallback is attempted. ${t}`, { cause: e });
+	});
+	return r = s, s;
+}
+async function f(e, t = {}) {
+	let n = await d(t), r = performance.now(), i = { output_flag: t.outputFlag ?? !1 };
+	return t.timeLimit !== void 0 && (i.time_limit = t.timeLimit), t.presolve !== void 0 && (i.presolve = t.presolve), t.solver !== void 0 && (i.solver = t.solver), t.relGap !== void 0 && (i.mip_rel_gap = t.relGap), t.absGap !== void 0 && (i.mip_abs_gap = t.absGap), {
+		result: n.solve(e, i),
+		runTime: (performance.now() - r) / 1e3
+	};
+}
+//#endregion
+export { l as a, f as c, c as i, d as n, u as o, s as r, o as s, n as t };

package/dist/lib/highs-node-runtime.js

@@ -0,0 +1 @@
+export async function loadNodeHighs() { return (await import(/* webpackIgnore: true */ /* @vite-ignore */ "highs")).default; }

package/dist/lib/highs-worker-factory.js

@@ -0,0 +1 @@
+export function createHighsWorker() { return new Worker(new URL("./highs-worker.js", import.meta.url), { type: "module" }); }

package/dist/lib/highs-worker.js

@@ -0,0 +1,21 @@
+import { c as e } from "./highs-loader-Blb99785.js";
+//#region src/highs-worker.ts
+self.onmessage = async (t) => {
+	let { type: n, id: r, lpString: i, options: a } = t.data;
+	if (n === "SOLVE") try {
+		let { result: t, runTime: n } = await e(i, a);
+		self.postMessage({
+			type: "SOLVE_SUCCESS",
+			id: r,
+			result: t,
+			runTime: n
+		});
+	} catch (e) {
+		self.postMessage({
+			type: "SOLVE_ERROR",
+			id: r,
+			error: e?.message || String(e)
+		});
+	}
+};
+//#endregion

package/dist/lib/solvers/glpk.js

@@ -1,2 +1,2 @@
-import { t as e } from "../glpk-BC32ZaPG.js";
+import { t as e } from "../glpk-5cUpjyb9.js";
 export { e as GLPKSolver };

package/dist/lib/solvers/z3.js

@@ -1,2 +1,2 @@
-import { n as e, t } from "../z3-C5DfllfD.js";
-export { t as Z3Solver, e as registerZ3Solver };
+import { n as e, r as t, t as n } from "../z3-C6GeIicJ.js";
+export { n as Z3Solver, e as registerZ3Solver, t as resetZ3LoaderCache };

package/dist/lib/washi.js

@@ -1,11 +1,12 @@
-import { S as e, _ as t, a as n, b as r, c as i, d as a, f as o, g as s, h as c, i as l, l as u, m as d, n as f, o as p, p as m, r as h, s as g, t as _, u as v, v as y, x as b, y as x } from "./z3-C5DfllfD.js";
-import { n as S, t as C } from "./glpk-BC32ZaPG.js";
+import { _ as e, a as t, c as n, d as r, f as i, g as a, h as o, i as s, l as c, m as l, n as u, o as d, p as f, s as p, t as m, u as h, v as g, y as _ } from "./z3-C6GeIicJ.js";
+import { a as v, c as y, i as b, n as x, o as S, r as C, s as w, t as T } from "./highs-loader-Blb99785.js";
+import { n as E, t as ee } from "./glpk-5cUpjyb9.js";
 //#region src/modeler/quad-expr.ts
-function w(e, t) {
+function D(e, t) {
 	let n = e.id, r = t.id;
 	return n <= r ? `${n}:${r}` : `${r}:${n}`;
 }
-var T = class e {
+var O = class e {
 	linearTerms;
 	quadTerms;
 	constant;
@@ -18,7 +19,7 @@ var T = class e {
 		return new e(this.linearTerms, this.quadTerms, this.constant);
 	}
 	getQuadCoeff(e, t) {
-		let n = w(e, t), r = this.quadTerms.get(n);
+		let n = D(e, t), r = this.quadTerms.get(n);
 		return r ? r.coeff : 0;
 	}
 	add(t) {
@@ -91,14 +92,14 @@ var T = class e {
 		return this.value;
 	}
 	static fromProduct(t, n, r = 1) {
-		let i = new e(), a = w(t, n);
+		let i = new e(), a = D(t, n);
 		return i.quadTerms.set(a, {
 			var1: t.id <= n.id ? t : n,
 			var2: t.id <= n.id ? n : t,
 			coeff: r
 		}), i;
 	}
-}, E = class e {
+}, k = class e {
 	terms;
 	constant;
 	constructor(e = /* @__PURE__ */ new Map(), t = 0) {
@@ -108,7 +109,7 @@ var T = class e {
 		return new e(this.terms, this.constant);
 	}
 	add(e) {
-		if (e instanceof T) return e.add(this);
+		if (e instanceof O) return e.add(this);
 		let t = this.clone();
 		if (typeof e == "number") t.constant += e;
 		else if ("terms" in e) {
@@ -124,7 +125,7 @@ var T = class e {
 		return t;
 	}
 	sub(e) {
-		return e instanceof T ? e.neg().add(this) : typeof e == "number" ? this.add(-e) : ("terms" in e, this.add(e.mul(-1)));
+		return e instanceof O ? e.neg().add(this) : typeof e == "number" ? this.add(-e) : ("terms" in e, this.add(e.mul(-1)));
 	}
 	mul(t) {
 		if (typeof t == "number") {
@@ -135,9 +136,9 @@ var T = class e {
 			}
 			return n;
 		}
-		let n = new T();
+		let n = new O();
 		Math.abs(this.constant) >= 1e-12 && n.linearTerms.set(t, this.constant);
-		for (let [e, r] of this.terms) n = n.add(T.fromProduct(e, t, r));
+		for (let [e, r] of this.terms) n = n.add(O.fromProduct(e, t, r));
 		return n;
 	}
 	div(e) {
@@ -176,11 +177,11 @@ var T = class e {
 	equalTo(e, t) {
 		return this.eq(e, t);
 	}
-	toConstraint(t, n, r) {
-		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 d(i, t, o, r);
+	toConstraint(t, n, i) {
+		let a = this.clone(), o = 0;
+		typeof n == "number" ? o = n : "terms" in n ? (a = a.sub(new e(n.terms, 0)), o = n.constant) : a = a.sub(n);
+		let s = o - a.constant;
+		return a.constant = 0, new r(a, t, s, i);
 	}
 	toString() {
 		let e = [], t = !0;
@@ -195,7 +196,7 @@ var T = class e {
 		return e.join(" ") || "0";
 	}
 };
-function D(e, t) {
+function A(e, t) {
 	let n = /* @__PURE__ */ new Map(), r = 0, i = 0;
 	for (let a of e) {
 		let e = t ? t(a, i++) : a;
@@ -213,9 +214,9 @@ function D(e, t) {
 		}
 	}
 	for (let [e, t] of n) Math.abs(t) < 1e-12 && n.delete(e);
-	return new E(n, r);
+	return new k(n, r);
 }
-var O = D, k = D, A = 0, j = class e {
+var te = A, j = A, M = 0, N = class e {
 	id;
 	name;
 	type;
@@ -224,7 +225,7 @@ var O = D, k = D, A = 0, j = class e {
 	value = null;
 	reducedCost = null;
 	constructor(e = {}) {
-		this.id = ++A, 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 = ++M, 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;
@@ -233,39 +234,39 @@ var O = D, k = D, A = 0, j = class e {
 		return this.value;
 	}
 	mul(t) {
-		if (typeof t == "number") return new E(/* @__PURE__ */ new Map([[this, t]]), 0);
-		if (t instanceof e) return T.fromProduct(this, t, 1);
-		let n = new T();
+		if (typeof t == "number") return new k(/* @__PURE__ */ new Map([[this, t]]), 0);
+		if (t instanceof e) return O.fromProduct(this, t, 1);
+		let n = new O();
 		Math.abs(t.constant) >= 1e-12 && n.linearTerms.set(this, t.constant);
 		for (let [e, r] of t.terms) {
-			let t = T.fromProduct(this, e, r);
+			let t = O.fromProduct(this, e, r);
 			n = n.add(t);
 		}
 		return n;
 	}
 	add(e) {
-		return e instanceof T ? e.add(this) : new E(/* @__PURE__ */ new Map([[this, 1]]), 0).add(e);
+		return e instanceof O ? e.add(this) : new k(/* @__PURE__ */ new Map([[this, 1]]), 0).add(e);
 	}
 	sub(e) {
-		return e instanceof T ? e.neg().add(this) : new E(/* @__PURE__ */ new Map([[this, 1]]), 0).sub(e);
+		return e instanceof O ? e.neg().add(this) : new k(/* @__PURE__ */ new Map([[this, 1]]), 0).sub(e);
 	}
 	neg() {
 		return this.mul(-1);
 	}
 	le(e, t) {
-		return new E(/* @__PURE__ */ new Map([[this, 1]]), 0).le(e, t);
+		return new k(/* @__PURE__ */ new Map([[this, 1]]), 0).le(e, t);
 	}
 	lessThanOrEqual(e, t) {
 		return this.le(e, t);
 	}
 	ge(e, t) {
-		return new E(/* @__PURE__ */ new Map([[this, 1]]), 0).ge(e, t);
+		return new k(/* @__PURE__ */ new Map([[this, 1]]), 0).ge(e, t);
 	}
 	greaterThanOrEqual(e, t) {
 		return this.ge(e, t);
 	}
 	eq(e, t) {
-		return new E(/* @__PURE__ */ new Map([[this, 1]]), 0).eq(e, t);
+		return new k(/* @__PURE__ */ new Map([[this, 1]]), 0).eq(e, t);
 	}
 	equalTo(e, t) {
 		return this.eq(e, t);
@@ -276,7 +277,7 @@ var O = D, k = D, A = 0, j = class e {
 };
 //#endregion
 //#region src/modeler/parser.ts
-function M(e) {
+function P(e) {
 	let t = [], n = 0, r = e.length;
 	for (; n < r;) {
 		let i = e[n];
@@ -332,7 +333,7 @@ function M(e) {
 	}
 	return t;
 }
-var N = class {
+var F = class {
 	tokens;
 	pos = 0;
 	resolver;
@@ -394,12 +395,12 @@ var N = class {
 				let e = this.consume();
 				return this.resolveVariable(e.value).mul(t);
 			}
-			return new E(/* @__PURE__ */ new Map(), t);
+			return new k(/* @__PURE__ */ new Map(), t);
 		}
 		if (e.type === "IDENT") {
 			this.consume();
 			let t = this.resolveVariable(e.value);
-			return new E(/* @__PURE__ */ new Map([[t, 1]]), 0);
+			return new k(/* @__PURE__ */ new Map([[t, 1]]), 0);
 		}
 		if (e.type === "LPAREN") {
 			this.consume("LPAREN");
@@ -414,10 +415,10 @@ var N = class {
 		return t;
 	}
 };
-function P(e, t) {
-	return new N(M(e), t).parseExpression();
+function I(e, t) {
+	return new F(P(e), t).parseExpression();
 }
-function F(e, t, n) {
+function L(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;
@@ -425,18 +426,18 @@ function F(e, t, n) {
 	else if (i === ">=" || i === "=>") c = ">=";
 	else if (i === "==" || i === "=") c = "==";
 	else throw Error(`Unsupported operator "${i}"`);
-	let l = P(o, t), u = P(s, t);
+	let l = I(o, t), u = I(s, t);
 	return c === "<=" ? l.le(u, n) : c === ">=" ? l.ge(u, n) : l.eq(u, n);
 }
-function I(e, t) {
+function R(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 j) {
+		else if (e instanceof N) {
 			let t = `__v_${i}__`;
 			n.set(t, e), r += t;
-		} else if (e instanceof E) {
+		} else if (e instanceof k) {
 			`${i}`, r += `(${e.toString()})`;
 			for (let [t] of e.terms) n.set(t.name, t);
 		}
@@ -446,42 +447,42 @@ function I(e, t) {
 		resolver: (e) => n.get(e)
 	};
 }
-function L(e, ...t) {
-	let { fullText: n, resolver: r } = I(e, t);
-	return F(n, r);
+function z(e, ...t) {
+	let { fullText: n, resolver: r } = R(e, t);
+	return L(n, r);
 }
-function R(e, ...t) {
-	let { fullText: n, resolver: r } = I(e, t);
-	return /(<=|>=|==|=<|=>|=)/.test(n) ? F(n, r) : P(n, r);
+function B(e, ...t) {
+	let { fullText: n, resolver: r } = R(e, t);
+	return /(<=|>=|==|=<|=>|=)/.test(n) ? L(n, r) : I(n, r);
 }
 //#endregion
 //#region src/modeler/lp-writer.ts
-function z(e, t, n) {
+function V(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 B(e) {
+function H(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 = z(e.name, "x", e.id), n = t, r = 1;
+		let t = V(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 = z(e.name, "c", e.id), n = t, r = 1;
+		let t = V(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 T ? n.linearTerms : n.terms;
+	let f = [], p = !0, m = n instanceof O ? 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 T && n.quadTerms.size > 0) {
+	if (n instanceof O && n.quadTerms.size > 0) {
 		let e = [], t = !0;
 		for (let r of n.quadTerms.values()) {
 			if (Math.abs(r.coeff) < 1e-12) continue;
@@ -533,7 +534,7 @@ function B(e) {
 }
 //#endregion
 //#region src/modeler/model.ts
-var V = class {
+var U = class {
 	name;
 	sense;
 	objective;
@@ -551,7 +552,7 @@ var V = class {
 	solution = null;
 	solver = null;
 	constructor(e = {}) {
-		this.name = e.name || "OptimizationModel", this.sense = e.sense || "Minimize", this.objective = new E(), e.solver && (this.solver = h(e.solver));
+		this.name = e.name || "OptimizationModel", this.sense = e.sense || "Minimize", this.objective = new k(), e.solver && (this.solver = s(e.solver));
 	}
 	get vars() {
 		return this.variables;
@@ -573,7 +574,7 @@ var V = class {
 			lb: n,
 			ub: r
 		} : e || {};
-		let a = new j(i);
+		let a = new N(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;
 	}
@@ -628,7 +629,7 @@ var V = class {
 		return this.constrMapByName.get(e);
 	}
 	setObjective(e, t) {
-		t && (this.sense = t), this.objective = typeof e == "string" ? P(e, (e) => this.getVarByName(e)) : typeof e == "number" ? new E(/* @__PURE__ */ new Map(), e) : e instanceof T || "terms" in e ? e.clone() : new E(/* @__PURE__ */ new Map([[e, 1]]), 0);
+		t && (this.sense = t), this.objective = typeof e == "string" ? I(e, (e) => this.getVarByName(e)) : typeof e == "number" ? new k(/* @__PURE__ */ new Map(), e) : e instanceof O || "terms" in e ? e.clone() : new k(/* @__PURE__ */ new Map([[e, 1]]), 0);
 	}
 	maximize(e) {
 		this.setObjective(e, "Maximize");
@@ -637,11 +638,11 @@ var V = class {
 		this.setObjective(e, "Minimize");
 	}
 	addBoolVar(e) {
-		let n = new t(e);
-		return this.boolVars.push(n), n;
+		let t = new l(e);
+		return this.boolVars.push(t), t;
 	}
 	addConstraint(e, t) {
-		if (e instanceof c) {
+		if (e instanceof i) {
 			let n = t || `lc_${this.logicalConstraints.length + 1}`;
 			return this.logicalConstraints.push({
 				name: n,
@@ -649,7 +650,7 @@ var V = class {
 			}), e;
 		}
 		let n;
-		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`);
+		if (typeof e == "string" ? n = L(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) {
@@ -663,7 +664,7 @@ var V = class {
 			for (let t of e) this.add(t);
 			return this;
 		}
-		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);
+		return e instanceof N ? (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;
@@ -689,7 +690,7 @@ var V = class {
 		return o;
 	}
 	toLpString() {
-		let { lpString: e } = B({
+		let { lpString: e } = H({
 			name: this.name,
 			sense: this.sense,
 			objective: this.objective,
@@ -700,7 +701,7 @@ var V = 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 = h(e, t), r = t || {}) : (r = { ...e }, r.solver ? (n = h(r.solver, r), delete r.solver) : n = this.solver || h()), this.objective instanceof T && 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 = s(e, t), r = t || {}) : (r = { ...e }, r.solver ? (n = s(r.solver, r), delete r.solver) : n = this.solver || s()), this.objective instanceof O && 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,
@@ -709,33 +710,33 @@ var V = class {
 			variables: this.variables,
 			logicalConstraints: this.logicalConstraints,
 			boolVars: this.boolVars
-		}, a = B(i), o = await n.solve(i, a, r);
+		}, a = H(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 = {};
+		let c = {}, l = {}, u = {}, d = {};
 		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);
+			n && (n.value = t, c[n.name] = t);
 		}
 		if (o.reducedCosts) for (let [e, t] of Object.entries(o.reducedCosts)) {
 			let n = this.getVarByName(e) || a.nameToVar.get(e);
-			n && (n.reducedCost = t, l[n.name] = t);
+			n && (n.reducedCost = t, u[n.name] = t);
 		}
 		if (o.duals) for (let [e, t] of Object.entries(o.duals)) {
 			let n = this.getConstraintByName(e) || a.nameToConstraint.get(e);
-			n && (n.dual = t, c[n.name] = t);
+			n && (n.dual = t, l[n.name] = t);
 		}
 		if (o.slacks) for (let [e, t] of Object.entries(o.slacks)) {
 			let n = this.getConstraintByName(e) || a.nameToConstraint.get(e);
-			n && (n.slack = t, u[n.name] = t);
+			n && (n.slack = t, d[n.name] = t);
 		}
 		return this.solution = {
 			status: this.status,
 			objectiveValue: this.objectiveValue,
-			values: s,
-			duals: c,
-			reducedCosts: l,
-			slacks: u,
+			values: c,
+			duals: l,
+			reducedCosts: u,
+			slacks: d,
 			runTime: this.runTime,
 			raw: o.raw
 		}, this.status;
@@ -745,7 +746,7 @@ var V = 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 = 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 (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 = s(e, t), r = t || {}) : (r = { ...e }, r.solver ? (n = s(r.solver, r), delete r.solver) : n = this.solver || s()), 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,
@@ -766,7 +767,7 @@ var V = class {
 		}
 		let i = this.objective, a = this.sense;
 		try {
-			this.objective = new E(), this.sense = "Minimize";
+			this.objective = new k(), 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 {
@@ -778,7 +779,7 @@ var V = class {
 			this.objective = i, this.sense = a;
 		}
 	}
-}, H = "Minimize", U = "Maximize", W = "Continuous", G = "Integer", K = "Binary", q = {
+}, W = "Minimize", G = "Maximize", K = "Continuous", q = "Integer", J = "Binary", Y = {
 	Optimal: "Optimal",
 	Feasible: "Feasible",
 	Infeasible: "Infeasible",
@@ -790,7 +791,7 @@ var V = class {
 	Sat: "Sat",
 	Unsat: "Unsat",
 	Unknown: "Unknown"
-}, J = class e extends j {
+}, X = class e extends N {
 	constructor(e, t, n, r = "Continuous") {
 		super({
 			name: e,
@@ -808,13 +809,13 @@ var V = class {
 		return o;
 	}
 };
-function Y(e) {
+function Z(e) {
 	return e == null ? null : typeof e == "number" ? e : e.value;
 }
-var X = class {
+var ne = class {
 	model;
-	constructor(e = "NoName", t = H) {
-		this.model = new V({
+	constructor(e = "NoName", t = W) {
+		this.model = new U({
 			name: e,
 			sense: t
 		});
@@ -849,7 +850,7 @@ var X = class {
 	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);
+			else e instanceof N && this.addVariable(e);
 		}
 		this.model.setObjective(e);
 	}
@@ -858,7 +859,7 @@ var X = class {
 		return this.model.addConstraint(e, t);
 	}
 	add(e, t) {
-		typeof e == "string" ? /(<=|>=|==|=<|=>|=)/.test(e) ? this.addConstraint(e, t) : this.setObjective(e) : e instanceof d ? this.addConstraint(e, t) : this.setObjective(e);
+		typeof e == "string" ? /(<=|>=|==|=<|=>|=)/.test(e) ? this.addConstraint(e, t) : this.setObjective(e) : e instanceof r ? this.addConstraint(e, t) : this.setObjective(e);
 	}
 	async solve(e, t) {
 		return this.model.optimize(e, t);
@@ -866,21 +867,21 @@ var X = class {
 	toLpString() {
 		return this.model.toLpString();
 	}
-}, Z = "Minimize", Q = "Maximize", $ = "Binary", ee = "Integer", te = "Continuous";
-function ne(e) {
+}, Q = "Minimize", $ = "Maximize", re = "Binary", ie = "Integer", ae = "Continuous";
+function oe(e) {
 	return {
 		expr: e,
-		sense: Q
+		sense: $
 	};
 }
-function re(e) {
+function se(e) {
 	return {
 		expr: e,
-		sense: Z
+		sense: Q
 	};
 }
-var ie = class extends V {
-	constructor(e = "MipModel", t = Z) {
+var ce = class extends U {
+	constructor(e = "MipModel", t = Q) {
 		super({
 			name: e,
 			sense: t
@@ -905,4 +906,4 @@ var ie = class extends V {
 	}
 };
 //#endregion
-export { $ as BINARY, c as BoolExpr, s as BoolOp, t as BoolVar, te as CONTINUOUS, d as Constraint, C as GLPKSolver, i as HiGHS, u as HighsSolver, ee as INTEGER, E as LinExpr, K as LpBinary, W as LpContinuous, G as LpInteger, U as LpMaximize, H as LpMinimize, X as LpProblem, q as LpStatus, J as LpVariable, Q as MAXIMIZE, Z as MINIMIZE, ie as MipModel, g as MockSolver, V as Model, T as QuadExpr, j as Var, _ as Z3Solver, y as and, L as c, R as expr, B as generateLpString, S as getGlpk, v as getHighs, a as getHighsWasmUrl, h as getSolver, x as implies, l as listAvailableSolvers, k as lpSum, ne as maximize, re as minimize, r as not, b as or, F as parseConstraint, P as parseExpr, n as registerSolver, f as registerZ3Solver, p as setDefaultSolver, o as setHighsWasmUrl, m as solveLpWithHighs, D as sum, Y as value, e as xor, O as xsum };
+export { re as BINARY, i as BoolExpr, f as BoolOp, l as BoolVar, ae as CONTINUOUS, r as Constraint, ee as GLPKSolver, c as HiGHS, h as HighsSolver, ie as INTEGER, k as LinExpr, J as LpBinary, K as LpContinuous, q as LpInteger, G as LpMaximize, W as LpMinimize, ne as LpProblem, Y as LpStatus, X as LpVariable, $ as MAXIMIZE, Q as MINIMIZE, ce as MipModel, n as MockSolver, U as Model, T as OFFICIAL_HIGHS_CDN_WASM_URL, O as QuadExpr, N as Var, m as Z3Solver, o as and, z as c, B as expr, H as generateLpString, E as getGlpk, x as getHighs, C as getHighsWasmUrl, s as getSolver, a as implies, b as isValidWasmHeader, t as listAvailableSolvers, j as lpSum, oe as maximize, se as minimize, e as not, g as or, L as parseConstraint, I as parseExpr, v as probeWasmUrl, d as registerSolver, u as registerZ3Solver, S as resolveBrowserWasmUrl, p as setDefaultSolver, w as setHighsWasmUrl, y as solveLpWithHighs, A as sum, Z as value, _ as xor, te as xsum };