@ohtaman/washi 0.1.1 → 0.2.0

package/dist/lib/washi.js

@@ -1,11 +1,29 @@
-import { C as e, E as t, S as n, T as r, _ as i, a, b as o, c as s, d as c, f as l, g as u, h as d, i as f, l as p, m, n as h, o as g, p as _, r as v, s as ee, t as y, u as b, v as x, w as S, x as C, y as w } from "./z3-C8g-PtmP.js";
-import { n as T, t as E } from "./glpk-BC32ZaPG.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-XWdn0ID9.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";
+//#region \0rolldown/runtime.js
+var x = Object.defineProperty, te = Object.getOwnPropertyDescriptor, ne = Object.getOwnPropertyNames, re = Object.prototype.hasOwnProperty, S = (e, t) => {
+	let n = {};
+	for (var r in e) x(n, r, {
+		get: e[r],
+		enumerable: !0
+	});
+	return t || x(n, Symbol.toStringTag, { value: "Module" }), n;
+}, C = (e, t, n, r) => {
+	if (t && typeof t == "object" || typeof t == "function") for (var i = ne(t), a = 0, o = i.length, s; a < o; a++) s = i[a], !re.call(e, s) && s !== n && x(e, s, {
+		get: ((e) => t[e]).bind(null, s),
+		enumerable: !(r = te(t, s)) || r.enumerable
+	});
+	return e;
+}, w = (e, t, n) => (C(e, t, "default"), n && C(n, t, "default"));
+//#endregion
 //#region src/modeler/quad-expr.ts
-function D(e, t) {
+function T(e, t) {
 	let n = e.id, r = t.id;
 	return n <= r ? `${n}:${r}` : `${r}:${n}`;
 }
-var O = class e {
+var E = class e {
 	linearTerms;
 	quadTerms;
 	constant;
@@ -18,7 +36,7 @@ var O = class e {
 		return new e(this.linearTerms, this.quadTerms, this.constant);
 	}
 	getQuadCoeff(e, t) {
-		let n = D(e, t), r = this.quadTerms.get(n);
+		let n = T(e, t), r = this.quadTerms.get(n);
 		return r ? r.coeff : 0;
 	}
 	add(t) {
@@ -91,14 +109,14 @@ var O = class e {
 		return this.value;
 	}
 	static fromProduct(t, n, r = 1) {
-		let i = new e(), a = D(t, n);
+		let i = new e(), a = T(t, n);
 		return i.quadTerms.set(a, {
 			var1: t.id <= n.id ? t : n,
 			var2: t.id <= n.id ? n : t,
 			coeff: r
 		}), i;
 	}
-}, k = class e {
+}, D = class e {
 	terms;
 	constant;
 	constructor(e = /* @__PURE__ */ new Map(), t = 0) {
@@ -108,7 +126,7 @@ var O = class e {
 		return new e(this.terms, this.constant);
 	}
 	add(e) {
-		if (e instanceof O) return e.add(this);
+		if (e instanceof E) return e.add(this);
 		let t = this.clone();
 		if (typeof e == "number") t.constant += e;
 		else if ("terms" in e) {
@@ -124,7 +142,7 @@ var O = class e {
 		return t;
 	}
 	sub(e) {
-		return e instanceof O ? e.neg().add(this) : typeof e == "number" ? this.add(-e) : ("terms" in e, this.add(e.mul(-1)));
+		return e instanceof E ? 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 +153,9 @@ var O = class e {
 			}
 			return n;
 		}
-		let n = new O();
+		let n = new E();
 		Math.abs(this.constant) >= 1e-12 && n.linearTerms.set(t, this.constant);
-		for (let [e, r] of this.terms) n = n.add(O.fromProduct(e, t, r));
+		for (let [e, r] of this.terms) n = n.add(E.fromProduct(e, t, r));
 		return n;
 	}
 	div(e) {
@@ -180,7 +198,7 @@ var O = 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 x(i, t, o, r);
+		return i.constant = 0, new c(i, t, o, r);
 	}
 	toString() {
 		let e = [], t = !0;
@@ -195,7 +213,7 @@ var O = class e {
 		return e.join(" ") || "0";
 	}
 };
-function A(e, t) {
+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;
@@ -213,9 +231,9 @@ function A(e, t) {
 		}
 	}
 	for (let [e, t] of n) Math.abs(t) < 1e-12 && n.delete(e);
-	return new k(n, r);
+	return new D(n, r);
 }
-var j = A, M = A, N = 0, P = class e {
+var k = O, A = O, ie = 0, j = class e {
 	id;
 	name;
 	type;
@@ -224,7 +242,7 @@ var j = A, M = A, N = 0, P = class e {
 	value = null;
 	reducedCost = null;
 	constructor(e = {}) {
-		this.id = ++N, 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 = ++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;
@@ -233,39 +251,39 @@ var j = A, M = A, N = 0, P = class e {
 		return this.value;
 	}
 	mul(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();
+		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();
 		Math.abs(t.constant) >= 1e-12 && n.linearTerms.set(this, t.constant);
 		for (let [e, r] of t.terms) {
-			let t = O.fromProduct(this, e, r);
+			let t = E.fromProduct(this, e, r);
 			n = n.add(t);
 		}
 		return n;
 	}
 	add(e) {
-		return e instanceof O ? e.add(this) : new k(/* @__PURE__ */ new Map([[this, 1]]), 0).add(e);
+		return e instanceof E ? e.add(this) : new D(/* @__PURE__ */ new Map([[this, 1]]), 0).add(e);
 	}
 	sub(e) {
-		return e instanceof O ? e.neg().add(this) : new k(/* @__PURE__ */ new Map([[this, 1]]), 0).sub(e);
+		return e instanceof E ? e.neg().add(this) : new D(/* @__PURE__ */ new Map([[this, 1]]), 0).sub(e);
 	}
 	neg() {
 		return this.mul(-1);
 	}
 	le(e, t) {
-		return new k(/* @__PURE__ */ new Map([[this, 1]]), 0).le(e, t);
+		return new D(/* @__PURE__ */ new Map([[this, 1]]), 0).le(e, t);
 	}
 	lessThanOrEqual(e, t) {
 		return this.le(e, t);
 	}
 	ge(e, t) {
-		return new k(/* @__PURE__ */ new Map([[this, 1]]), 0).ge(e, t);
+		return new D(/* @__PURE__ */ new Map([[this, 1]]), 0).ge(e, t);
 	}
 	greaterThanOrEqual(e, t) {
 		return this.ge(e, t);
 	}
 	eq(e, t) {
-		return new k(/* @__PURE__ */ new Map([[this, 1]]), 0).eq(e, t);
+		return new D(/* @__PURE__ */ new Map([[this, 1]]), 0).eq(e, t);
 	}
 	equalTo(e, t) {
 		return this.eq(e, t);
@@ -276,7 +294,7 @@ var j = A, M = A, N = 0, P = class e {
 };
 //#endregion
 //#region src/modeler/parser.ts
-function F(e) {
+function ae(e) {
 	let t = [], n = 0, r = e.length;
 	for (; n < r;) {
 		let i = e[n];
@@ -332,7 +350,7 @@ function F(e) {
 	}
 	return t;
 }
-var te = class {
+var oe = class {
 	tokens;
 	pos = 0;
 	resolver;
@@ -394,12 +412,12 @@ var te = class {
 				let e = this.consume();
 				return this.resolveVariable(e.value).mul(t);
 			}
-			return new k(/* @__PURE__ */ new Map(), t);
+			return new D(/* @__PURE__ */ new Map(), t);
 		}
 		if (e.type === "IDENT") {
 			this.consume();
 			let t = this.resolveVariable(e.value);
-			return new k(/* @__PURE__ */ new Map([[t, 1]]), 0);
+			return new D(/* @__PURE__ */ new Map([[t, 1]]), 0);
 		}
 		if (e.type === "LPAREN") {
 			this.consume("LPAREN");
@@ -414,10 +432,10 @@ var te = class {
 		return t;
 	}
 };
-function I(e, t) {
-	return new te(F(e), t).parseExpression();
+function M(e, t) {
+	return new oe(ae(e), t).parseExpression();
 }
-function L(e, t, n) {
+function N(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 +443,18 @@ function L(e, t, n) {
 	else if (i === ">=" || i === "=>") c = ">=";
 	else if (i === "==" || i === "=") c = "==";
 	else throw Error(`Unsupported operator "${i}"`);
-	let l = I(o, t), u = I(s, t);
+	let l = M(o, t), u = M(s, t);
 	return c === "<=" ? l.le(u, n) : c === ">=" ? l.ge(u, n) : l.eq(u, n);
 }
-function R(e, t) {
+function P(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 P) {
+		else if (e instanceof j) {
 			let t = `__v_${i}__`;
 			n.set(t, e), r += t;
-		} else if (e instanceof k) {
+		} else if (e instanceof D) {
 			`${i}`, r += `(${e.toString()})`;
 			for (let [t] of e.terms) n.set(t.name, t);
 		}
@@ -446,42 +464,42 @@ function R(e, t) {
 		resolver: (e) => n.get(e)
 	};
 }
-function z(e, ...t) {
-	let { fullText: n, resolver: r } = R(e, t);
-	return L(n, r);
+function se(e, ...t) {
+	let { fullText: n, resolver: r } = P(e, t);
+	return N(n, r);
 }
-function B(e, ...t) {
-	let { fullText: n, resolver: r } = R(e, t);
-	return /(<=|>=|==|=<|=>|=)/.test(n) ? L(n, r) : I(n, r);
+function ce(e, ...t) {
+	let { fullText: n, resolver: r } = P(e, t);
+	return /(<=|>=|==|=<|=>|=)/.test(n) ? N(n, r) : M(n, r);
 }
 //#endregion
 //#region src/modeler/lp-writer.ts
-function V(e, t, n) {
+function le(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 H(e) {
+function F(e) {
 	let { sense: t, objective: n, constraints: r, variables: i } = e, a = /* @__PURE__ */ new Map(), o = /* @__PURE__ */ new Map(), s = /* @__PURE__ */ new Map(), c = /* @__PURE__ */ new Set();
 	for (let e of i) {
-		let t = V(e.name, "x", e.id), n = t, r = 1;
+		let t = le(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 = V(e.name, "c", e.id), n = t, r = 1;
+		let t = le(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 O ? n.linearTerms : n.terms;
+	let f = [], p = !0, m = n instanceof E ? 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 O && n.quadTerms.size > 0) {
+	if (n instanceof E && n.quadTerms.size > 0) {
 		let e = [], t = !0;
 		for (let r of n.quadTerms.values()) {
 			if (Math.abs(r.coeff) < 1e-12) continue;
@@ -532,8 +550,237 @@ function H(e) {
 	};
 }
 //#endregion
+//#region src/modeler/solvers/highs/worker-client.ts
+var I = null, ue = 0, L = /* @__PURE__ */ new Map();
+function de() {
+	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({
+				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();
+			}
+		};
+		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."));
+	} catch {
+		I = null;
+	}
+	return I;
+}
+async function R(e, t = {}) {
+	let n = await _(t.wasmUrl), r = t.useWorker ?? typeof window < "u" ? de() : null;
+	if (!r) return m(e, t);
+	let i = {
+		...t,
+		wasmUrl: n
+	}, a = `req_${++ue}`;
+	return new Promise((t, n) => {
+		L.set(a, {
+			resolve: t,
+			reject: n
+		});
+		try {
+			r.postMessage({
+				type: "SOLVE",
+				id: a,
+				lpString: e,
+				options: i
+			});
+		} catch (e) {
+			L.delete(a), n(e);
+		}
+	});
+}
+//#endregion
+//#region src/modeler/solvers/highs/solver.ts
+function z(e) {
+	if (typeof e != "string") return "Unknown";
+	let t = e.trim();
+	if (!t) return "Unknown";
+	switch (t) {
+		case "Optimal": return "Optimal";
+		case "Infeasible": return "Infeasible";
+		case "Unbounded": return "Unbounded";
+		case "Primal infeasible or unbounded": return "Unknown";
+		case "Time limit reached":
+		case "TimeLimit": return "TimeLimit";
+		case "Iteration limit reached":
+		case "IterationLimit": return "IterationLimit";
+		case "Bound on objective reached":
+		case "Target for objective reached":
+		case "Feasible": return "Feasible";
+		case "Not Set": return "NotSolved";
+		case "Load error":
+		case "Model error":
+		case "Presolve error":
+		case "Solve error":
+		case "Postsolve error":
+		case "Error": return "Error";
+		case "Empty":
+		case "Unknown": return "Unknown";
+	}
+	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 {
+	static capabilities = {
+		supportsMIP: !0,
+		supportsQP: !0
+	};
+	name = "HiGHS";
+	version = "1.15.3";
+	capabilities = e.capabilities;
+	options;
+	constructor(e = {}) {
+		this.options = e;
+	}
+	async solve(e, t, n = {}) {
+		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 = {};
+		if (s.Columns) for (let [e, t] of Object.entries(s.Columns)) {
+			let n = a.get(e);
+			if (n) {
+				let e = Math.abs(t.Primal) < 1e-9 ? 0 : t.Primal;
+				f[n.name] = e, t.Dual !== void 0 && (m[n.name] = Math.abs(t.Dual) < 1e-9 ? 0 : t.Dual);
+			}
+		}
+		if (s.Rows) {
+			let e = Array.isArray(s.Rows) ? s.Rows : Object.values(s.Rows);
+			for (let t of e) {
+				let e = t.Name, n = o.get(e);
+				if (n && (t.Dual !== void 0 && (p[n.name] = Math.abs(t.Dual) < 1e-9 ? 0 : t.Dual), t.Primal !== void 0)) {
+					let e = n.rhs - t.Primal;
+					h[n.name] = Math.abs(e) < 1e-9 ? 0 : e;
+				}
+			}
+		}
+		return {
+			status: l,
+			objectiveValue: d,
+			values: f,
+			reducedCosts: m,
+			duals: p,
+			slacks: h,
+			runTime: c,
+			raw: s
+		};
+	}
+}, V = B;
+function H() {
+	d("highs", (e) => new B(e)), l((e) => new B(e));
+}
+H();
+//#endregion
+//#region src/modeler/solvers/highs/index.ts
+var U = /* @__PURE__ */ S({
+	HiGHS: () => V,
+	HighsSolver: () => B,
+	OFFICIAL_HIGHS_CDN_WASM_URL: () => b,
+	getHighs: () => g,
+	getHighsWasmUrl: () => v,
+	isValidWasmHeader: () => h,
+	mapHighsStatus: () => z,
+	probeWasmUrl: () => p,
+	registerHighsSolver: () => H,
+	resolveBrowserWasmUrl: () => _,
+	setHighsWasmUrl: () => y,
+	solveLp: () => R,
+	solveLpWithHighs: () => m
+});
+import * as fe from "./highs-worker-factory.js";
+w(U, fe);
+import * as pe from "./highs-assets.js";
+w(U, pe);
+//#endregion
+//#region src/modeler/solvers/highs.ts
+var W = /* @__PURE__ */ S({
+	HiGHS: () => V,
+	HighsSolver: () => B,
+	OFFICIAL_HIGHS_CDN_WASM_URL: () => b,
+	getHighs: () => g,
+	getHighsWasmUrl: () => v,
+	isValidWasmHeader: () => h,
+	mapHighsStatus: () => z,
+	probeWasmUrl: () => p,
+	registerHighsSolver: () => H,
+	resolveBrowserWasmUrl: () => _,
+	setHighsWasmUrl: () => y,
+	solveLp: () => R,
+	solveLpWithHighs: () => m
+});
+w(W, U);
+//#endregion
+//#region src/modeler/solvers/mock.ts
+var G = class {
+	name;
+	capabilities;
+	options;
+	constructor(e = {}) {
+		this.name = e.name || "MockSolver", this.capabilities = e.capabilities || {
+			supportsMIP: !0,
+			supportsQP: !0
+		}, this.options = e;
+	}
+	async solve(e, t, n = {}) {
+		let r = {
+			...this.options,
+			...n
+		};
+		return r.delayMs && r.delayMs > 0 && await new Promise((e) => setTimeout(e, r.delayMs)), {
+			status: r.status || "Optimal",
+			objectiveValue: r.objectiveValue ?? 0,
+			values: r.values || {},
+			reducedCosts: r.reducedCosts,
+			duals: r.duals,
+			slacks: r.slacks,
+			runTime: .001,
+			raw: { mock: !0 }
+		};
+	}
+};
+function K() {
+	d("mock", (e) => new G(e));
+}
+K();
+//#endregion
+//#region src/modeler/solvers/index.ts
+var q = /* @__PURE__ */ S({
+	HiGHS: () => V,
+	HighsSolver: () => B,
+	MockSolver: () => G,
+	OFFICIAL_HIGHS_CDN_WASM_URL: () => b,
+	getHighs: () => g,
+	getHighsWasmUrl: () => v,
+	getSolver: () => f,
+	isValidWasmHeader: () => h,
+	listAvailableSolvers: () => u,
+	mapHighsStatus: () => z,
+	probeWasmUrl: () => p,
+	registerHighsSolver: () => H,
+	registerMockSolver: () => K,
+	registerSolver: () => d,
+	resolveBrowserWasmUrl: () => _,
+	setDefaultSolver: () => l,
+	setHighsWasmUrl: () => y,
+	solveLp: () => R,
+	solveLpWithHighs: () => m
+});
+w(q, W);
+//#endregion
 //#region src/modeler/model.ts
-var U = class {
+var J = class {
 	name;
 	sense;
 	objective;
@@ -550,8 +797,12 @@ var U = class {
 	runTime = 0;
 	solution = null;
 	solver = null;
-	constructor(e = {}) {
-		this.name = e.name || "OptimizationModel", this.sense = e.sense || "Minimize", this.objective = new k(), e.solver && (this.solver = v(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 D(), n.solver && (this.solver = f(n.solver));
 	}
 	get vars() {
 		return this.variables;
@@ -573,7 +824,7 @@ var U = class {
 			lb: n,
 			ub: r
 		} : e || {};
-		let a = new P(i);
+		let a = new j(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 +879,7 @@ var U = class {
 		return this.constrMapByName.get(e);
 	}
 	setObjective(e, t) {
-		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);
+		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);
 	}
 	maximize(e) {
 		this.setObjective(e, "Maximize");
@@ -637,11 +888,11 @@ var U = class {
 		this.setObjective(e, "Minimize");
 	}
 	addBoolVar(e) {
-		let t = new C(e);
+		let t = new n(e);
 		return this.boolVars.push(t), t;
 	}
 	addConstraint(e, t) {
-		if (e instanceof w) {
+		if (e instanceof i) {
 			let n = t || `lc_${this.logicalConstraints.length + 1}`;
 			return this.logicalConstraints.push({
 				name: n,
@@ -649,7 +900,7 @@ var U = class {
 			}), e;
 		}
 		let n;
-		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`);
+		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`);
 		return this.constraints.push(n), this.constrMapByName.set(n.name, n), n;
 	}
 	addConstr(e, t) {
@@ -663,7 +914,7 @@ var U = class {
 			for (let t of e) this.add(t);
 			return this;
 		}
-		return e instanceof P ? (this.varMapByName.has(e.name) || (this.variables.push(e), this.varMapByName.set(e.name, e)), this) : (this.addConstraint(e, t), 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);
 	}
 	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 +940,7 @@ var U = class {
 		return o;
 	}
 	toLpString() {
-		let { lpString: e } = H({
+		let { lpString: e } = F({
 			name: this.name,
 			sense: this.sense,
 			objective: this.objective,
@@ -700,7 +951,7 @@ var U = 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 = v(e, t), r = t || {}) : (r = { ...e }, r.solver ? (n = v(r.solver, r), delete r.solver) : n = this.solver || v()), 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.`);
+		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.`);
 		let i = {
 			name: this.name,
 			sense: this.sense,
@@ -709,7 +960,7 @@ var U = class {
 			variables: this.variables,
 			logicalConstraints: this.logicalConstraints,
 			boolVars: this.boolVars
-		}, a = H(i), o = await n.solve(i, a, r);
+		}, a = F(i), o = await n.solve(i, a, r);
 		this.runTime = o.runTime ?? 0, this.status = o.status, this.objectiveValue = o.objectiveValue ?? null;
 		let s = {}, c = {}, l = {}, u = {};
 		if (this.values.clear(), o.values) for (let [e, t] of Object.entries(o.values)) {
@@ -745,7 +996,7 @@ var U = 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 = v(e, t), r = t || {}) : (r = { ...e }, r.solver ? (n = v(r.solver, r), delete r.solver) : n = this.solver || v()), 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 = f(e, t), r = t || {}) : (r = { ...e }, r.solver ? (n = f(r.solver, r), delete r.solver) : n = this.solver || f()), 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 +1017,7 @@ var U = class {
 		}
 		let i = this.objective, a = this.sense;
 		try {
-			this.objective = new k(), this.sense = "Minimize";
+			this.objective = new D(), 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 +1029,7 @@ var U = class {
 			this.objective = i, this.sense = a;
 		}
 	}
-}, W = "Minimize", G = "Maximize", K = "Continuous", q = "Integer", J = "Binary", Y = {
+}, Y = "Minimize", me = "Maximize", he = "Continuous", ge = "Integer", _e = "Binary", ve = {
 	Optimal: "Optimal",
 	Feasible: "Feasible",
 	Infeasible: "Infeasible",
@@ -790,7 +1041,7 @@ var U = class {
 	Sat: "Sat",
 	Unsat: "Unsat",
 	Unknown: "Unknown"
-}, X = class e extends P {
+}, ye = class e extends j {
 	constructor(e, t, n, r = "Continuous") {
 		super({
 			name: e,
@@ -808,13 +1059,13 @@ var U = class {
 		return o;
 	}
 };
-function Z(e) {
+function be(e) {
 	return e == null ? null : typeof e == "number" ? e : e.value;
 }
-var ne = class {
+var xe = class {
 	model;
-	constructor(e = "NoName", t = W) {
-		this.model = new U({
+	constructor(e = "NoName", t = Y) {
+		this.model = new J({
 			name: e,
 			sense: t
 		});
@@ -849,7 +1100,7 @@ var ne = class {
 	setObjective(e) {
 		if (typeof e == "object" && e) {
 			if ("terms" in e) for (let [t] of e.terms) this.addVariable(t);
-			else e instanceof P && this.addVariable(e);
+			else e instanceof j && this.addVariable(e);
 		}
 		this.model.setObjective(e);
 	}
@@ -858,7 +1109,7 @@ var ne = class {
 		return this.model.addConstraint(e, t);
 	}
 	add(e, t) {
-		typeof e == "string" ? /(<=|>=|==|=<|=>|=)/.test(e) ? this.addConstraint(e, t) : this.setObjective(e) : e instanceof x ? this.addConstraint(e, t) : this.setObjective(e);
+		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);
@@ -866,21 +1117,21 @@ var ne = class {
 	toLpString() {
 		return this.model.toLpString();
 	}
-}, Q = "Minimize", $ = "Maximize", re = "Binary", ie = "Integer", ae = "Continuous";
-function oe(e) {
+}, X = "Minimize", Z = "Maximize", Q = "Binary", Se = "Integer", Ce = "Continuous";
+function we(e) {
 	return {
 		expr: e,
-		sense: $
+		sense: Z
 	};
 }
-function se(e) {
+function Te(e) {
 	return {
 		expr: e,
-		sense: Q
+		sense: X
 	};
 }
-var ce = class extends U {
-	constructor(e = "MipModel", t = Q) {
+var $ = class extends J {
+	constructor(e = "MipModel", t = X) {
 		super({
 			name: e,
 			sense: t
@@ -904,5 +1155,64 @@ var ce = class extends U {
 		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,
+	OFFICIAL_HIGHS_CDN_WASM_URL: () => b,
+	QuadExpr: () => E,
+	Var: () => j,
+	and: () => e,
+	c: () => se,
+	expr: () => ce,
+	generateLpString: () => F,
+	getHighs: () => g,
+	getHighsWasmUrl: () => v,
+	getSolver: () => f,
+	implies: () => a,
+	isValidWasmHeader: () => h,
+	listAvailableSolvers: () => u,
+	lpSum: () => A,
+	mapHighsStatus: () => z,
+	maximize: () => we,
+	minimize: () => Te,
+	not: () => s,
+	or: () => t,
+	parseConstraint: () => N,
+	parseExpr: () => M,
+	probeWasmUrl: () => p,
+	registerHighsSolver: () => H,
+	registerMockSolver: () => K,
+	registerSolver: () => d,
+	resolveBrowserWasmUrl: () => _,
+	setDefaultSolver: () => l,
+	setHighsWasmUrl: () => y,
+	solveLp: () => R,
+	solveLpWithHighs: () => m,
+	sum: () => O,
+	value: () => be,
+	xor: () => r,
+	xsum: () => k
+}), q);
 //#endregion
-export { re as BINARY, w as BoolExpr, o as BoolOp, C as BoolVar, ae as CONTINUOUS, x as Constraint, E as GLPKSolver, s as HiGHS, p 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, ee as MockSolver, U as Model, b as OFFICIAL_HIGHS_CDN_WASM_URL, O as QuadExpr, P as Var, y as Z3Solver, n as and, z as c, B as expr, H as generateLpString, T as getGlpk, c as getHighs, l as getHighsWasmUrl, v as getSolver, e as implies, _ as isValidWasmHeader, f as listAvailableSolvers, M as lpSum, oe as maximize, se as minimize, S as not, r as or, L as parseConstraint, I as parseExpr, m as probeWasmUrl, a as registerSolver, h as registerZ3Solver, d as resolveBrowserWasmUrl, g as setDefaultSolver, u as setHighsWasmUrl, i as solveLpWithHighs, A as sum, Z as value, t as xor, j as xsum };
+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 };