@ohtaman/washi 0.3.0 → 0.5.0

package/dist/lib/registry-BEfvpZW3.js

@@ -0,0 +1,951 @@
+//#region src/modeler/boolean-expr.ts
+var e = 0;
+function t(e, t) {
+	if (e instanceof n || e instanceof d) return e;
+	throw typeof e == "object" && e && ("terms" in e || "quadTerms" in e) ? Error(`Cannot use an arithmetic expression without a comparison operator (<=, >=, ==) in logical operator "${t}". Use a comparison constraint such as expr\`\${x} <= 10\` or a BoolVar/BoolExpr.`) : Error(`Invalid operand passed to logical operator "${t}": expected a BoolVar, BoolExpr, or Constraint.`);
+}
+var n = class {
+	and(e) {
+		return new i("and", [this, t(e, "and")]);
+	}
+	or(e) {
+		return new i("or", [this, t(e, "or")]);
+	}
+	implies(e) {
+		return new i("implies", [this, t(e, "implies")]);
+	}
+	xor(e) {
+		return new i("xor", [this, t(e, "xor")]);
+	}
+	not() {
+		return new i("not", [this]);
+	}
+}, r = class extends n {
+	id;
+	name;
+	value = null;
+	constructor(t) {
+		super(), this.id = ++e, this.name = t || `p_${this.id}`;
+	}
+	toString() {
+		return this.name;
+	}
+}, i = class extends n {
+	op;
+	children;
+	constructor(e, n) {
+		super(), this.op = e, this.children = n.map((n) => t(n, e));
+	}
+	toString() {
+		return this.op === "not" ? `not(${this.children[0].toString()})` : `(${this.children.map((e) => e.toString()).join(` ${this.op} `)})`;
+	}
+};
+function a(...e) {
+	if (e.length === 0) throw Error("and() requires at least one expression");
+	return new i("and", e);
+}
+function o(...e) {
+	if (e.length === 0) throw Error("or() requires at least one expression");
+	return new i("or", e);
+}
+function s(e) {
+	return new i("not", [e]);
+}
+function c(e, t) {
+	return new i("implies", [e, t]);
+}
+function l(...e) {
+	if (e.length === 0) throw Error("xor() requires at least one expression");
+	return new i("xor", e);
+}
+//#endregion
+//#region src/modeler/constraint.ts
+var u = 0, d = class e {
+	kind = "constraint";
+	id;
+	_lhs;
+	_sense;
+	_rhs;
+	_name;
+	hasExplicitName;
+	ownerModel = null;
+	slack = null;
+	dual = null;
+	constructor(e, t, n, r) {
+		this.id = ++u, this._lhs = e, this._sense = t, this._rhs = n;
+		let i = typeof r == "string" ? r.trim() : void 0;
+		i && i.length > 0 ? (this._name = i, this.hasExplicitName = !0) : (this._name = `c_${this.id}`, this.hasExplicitName = !1);
+	}
+	get lhs() {
+		return this._lhs;
+	}
+	set lhs(e) {
+		this._lhs !== e && (this._lhs = e, this.ownerModel?.notifyMutation?.());
+	}
+	get sense() {
+		return this._sense;
+	}
+	set sense(e) {
+		this._sense !== e && (this._sense = e, this.ownerModel?.notifyMutation?.());
+	}
+	get rhs() {
+		return this._rhs;
+	}
+	set rhs(e) {
+		Object.is(this._rhs, e) || (this._rhs = e, this.ownerModel?.notifyMutation?.());
+	}
+	get name() {
+		return this._name;
+	}
+	set name(e) {
+		this._name !== e && (this._name = e, this.ownerModel?.notifyMutation?.()), this.hasExplicitName = !0;
+	}
+	_assignModelName(e, t) {
+		this._name = e, this.hasExplicitName = t;
+	}
+	and(e) {
+		return new i("and", [this, e]);
+	}
+	or(e) {
+		return new i("or", [this, e]);
+	}
+	implies(e) {
+		return new i("implies", [this, e]);
+	}
+	xor(e) {
+		return new i("xor", [this, e]);
+	}
+	not() {
+		return new i("not", [this]);
+	}
+	add(e) {
+		throw Error("Cannot perform arithmetic on a Constraint: expected a number, Var, LinExpr, or QuadExpr.");
+	}
+	sub(e) {
+		throw Error("Cannot perform arithmetic on a Constraint: expected a number, Var, LinExpr, or QuadExpr.");
+	}
+	mul(e) {
+		throw Error("Cannot perform arithmetic on a Constraint: expected a number, Var, LinExpr, or QuadExpr.");
+	}
+	div(e) {
+		throw Error("Cannot perform arithmetic on a Constraint: expected a number, Var, LinExpr, or QuadExpr.");
+	}
+	neg() {
+		throw Error("Cannot perform arithmetic on a Constraint: expected a number, Var, LinExpr, or QuadExpr.");
+	}
+	le(e, t) {
+		throw Error("Cannot compare a Constraint in (<=): expected a number, Var, or LinExpr.");
+	}
+	ge(e, t) {
+		throw Error("Cannot compare a Constraint in (>=): expected a number, Var, or LinExpr.");
+	}
+	eq(e, t) {
+		throw Error("Cannot compare a Constraint in (==): expected a number, Var, or LinExpr.");
+	}
+	get value() {
+		throw Error("Cannot read numeric value of a Constraint: expected a Var, LinExpr, or QuadExpr.");
+	}
+	get constant() {
+		throw Error("Cannot read numeric constant of a Constraint: expected a LinExpr or QuadExpr.");
+	}
+	clone() {
+		return new e(this._lhs.clone(), this._sense, this._rhs, this.hasExplicitName ? this._name : void 0);
+	}
+	toString() {
+		let e = this.sense === "==" ? "=" : this.sense;
+		return `${this.name}: ${this.lhs.toString()} ${e} ${this.rhs}`;
+	}
+};
+function f(e) {
+	return e instanceof d || typeof e == "object" && !!e && "sense" in e && "lhs" in e && "rhs" in e;
+}
+//#endregion
+//#region src/modeler/quad-expr.ts
+function p(e, t) {
+	let n = e.id, r = t.id;
+	return n <= r ? `${n}:${r}` : `${r}:${n}`;
+}
+var m = class e {
+	kind = "quadratic";
+	linearTerms;
+	quadTerms;
+	constant;
+	constructor(e = /* @__PURE__ */ new Map(), t = /* @__PURE__ */ new Map(), n = 0) {
+		this.linearTerms = new Map(e), this.quadTerms = /* @__PURE__ */ new Map();
+		for (let [e, n] of t) this.quadTerms.set(e, { ...n });
+		this.constant = n;
+	}
+	clone() {
+		return new e(this.linearTerms, this.quadTerms, this.constant);
+	}
+	getQuadCoeff(e, t) {
+		let n = p(e, t), r = this.quadTerms.get(n);
+		return r ? r.coeff : 0;
+	}
+	add(t) {
+		if (f(t)) throw Error("Cannot perform arithmetic on a Constraint: expected a number, Var, LinExpr, or QuadExpr.");
+		let n = this.clone();
+		if (typeof t == "number") return n.constant += t, n;
+		if (t instanceof e) {
+			for (let [e, r] of t.quadTerms) {
+				let t = n.quadTerms.get(e), i = (t ? t.coeff : 0) + r.coeff;
+				i === 0 ? n.quadTerms.delete(e) : n.quadTerms.set(e, {
+					var1: r.var1,
+					var2: r.var2,
+					coeff: i
+				});
+			}
+			for (let [e, r] of t.linearTerms) {
+				let t = (n.linearTerms.get(e) ?? 0) + r;
+				t === 0 ? n.linearTerms.delete(e) : n.linearTerms.set(e, t);
+			}
+			return n.constant += t.constant, n;
+		}
+		if ("terms" in t && t.terms instanceof Map) {
+			for (let [e, r] of t.terms) {
+				let t = (n.linearTerms.get(e) ?? 0) + r;
+				t === 0 ? n.linearTerms.delete(e) : n.linearTerms.set(e, t);
+			}
+			return n.constant += t.constant, n;
+		}
+		let r = t, i = (n.linearTerms.get(r) ?? 0) + 1;
+		return i === 0 ? n.linearTerms.delete(r) : n.linearTerms.set(r, i), n;
+	}
+	sub(e) {
+		if (f(e)) throw Error("Cannot perform arithmetic on a Constraint: expected a number, Var, LinExpr, or QuadExpr.");
+		return typeof e == "number" ? this.add(-e) : this.add(e.mul(-1));
+	}
+	mul(t) {
+		if (f(t)) throw Error("Cannot perform arithmetic on a Constraint: expected a number, Var, LinExpr, or QuadExpr.");
+		if (typeof t == "number") {
+			let n = this.linearTerms.size > 0 || this.quadTerms.size > 0, r = this.constant === 0 && n ? 0 : this.constant * t;
+			if (this.constant !== 0 && t !== 0 && r === 0) throw Error("Constant multiplication underflows to zero.");
+			let i = new e(/* @__PURE__ */ new Map(), /* @__PURE__ */ new Map(), r);
+			for (let [e, n] of this.linearTerms) {
+				let r = n * t;
+				if (n !== 0 && t !== 0 && r === 0) throw Error("Coefficient multiplication underflows to zero.");
+				r !== 0 && i.linearTerms.set(e, r);
+			}
+			for (let [e, n] of this.quadTerms) {
+				let r = n.coeff * t;
+				if (n.coeff !== 0 && t !== 0 && r === 0) throw Error("Coefficient multiplication underflows to zero.");
+				r !== 0 && i.quadTerms.set(e, {
+					var1: n.var1,
+					var2: n.var2,
+					coeff: r
+				});
+			}
+			return i;
+		}
+		let n = "id" in t && "name" in t && !("terms" in t) && !("quadTerms" in t), r = "quadTerms" in t ? t.quadTerms.size : 0, i = n ? /* @__PURE__ */ new Map([[t, 1]]) : "quadTerms" in t ? t.linearTerms : t.terms, a = n ? 0 : t.constant;
+		if (this.quadTerms.size > 0 && (r > 0 || i.size > 0) || r > 0 && this.linearTerms.size > 0) throw Error("Multiplication creates a non-linear term of degree > 2 (not allowed in MILP/LP/QP)");
+		if (r === 0 && i.size === 0) return this.mul(a);
+		if (this.quadTerms.size === 0 && this.linearTerms.size === 0 && !n) {
+			let n = t.mul(this.constant);
+			return "quadTerms" in n ? n : new e(n.terms, /* @__PURE__ */ new Map(), n.constant);
+		}
+		return e.multiplyLinearTerms(this.constant, this.linearTerms, a, i);
+	}
+	div(t) {
+		let n = e.extractScalarDivisor(t, "QuadExpr.div()");
+		return this.mul(1 / n);
+	}
+	neg() {
+		return this.mul(-1);
+	}
+	get value() {
+		let e = this.constant;
+		for (let [t, n] of this.linearTerms) {
+			if (t.value === null) return null;
+			e += n * t.value;
+		}
+		for (let t of this.quadTerms.values()) {
+			if (t.var1.value === null || t.var2.value === null) return null;
+			e += t.coeff * t.var1.value * t.var2.value;
+		}
+		return e;
+	}
+	le(e, t) {
+		return this.toConstraint("<=", e, t);
+	}
+	ge(e, t) {
+		return this.toConstraint(">=", e, t);
+	}
+	eq(e, t) {
+		return this.toConstraint("==", e, t);
+	}
+	toConstraint(e, t, n) {
+		if (this.quadTerms.size > 0) throw Error(`Quadratic expressions are not supported in linear constraints (${e}): quadratic terms are only allowed in objectives.`);
+		let r = new h(this.linearTerms, this.constant);
+		return e === "<=" ? r.le(t, n) : e === ">=" ? r.ge(t, n) : r.eq(t, n);
+	}
+	and(e) {
+		throw Error("Cannot use an arithmetic expression without a comparison operator (<=, >=, ==) in logical 'and': expected a BoolVar, Constraint, or BoolOp.");
+	}
+	or(e) {
+		throw Error("Cannot use an arithmetic expression without a comparison operator (<=, >=, ==) in logical 'or': expected a BoolVar, Constraint, or BoolOp.");
+	}
+	implies(e) {
+		throw Error("Cannot use an arithmetic expression without a comparison operator (<=, >=, ==) in logical 'implies': expected a BoolVar, Constraint, or BoolOp.");
+	}
+	xor(e) {
+		throw Error("Cannot use an arithmetic expression without a comparison operator (<=, >=, ==) in logical 'xor': expected a BoolVar, Constraint, or BoolOp.");
+	}
+	not() {
+		throw Error("Cannot use an arithmetic expression without a comparison operator (<=, >=, ==) in logical 'not': expected a BoolVar, Constraint, or BoolOp.");
+	}
+	toString() {
+		let e = [], t = !0;
+		for (let n of this.quadTerms.values()) {
+			let r = n.coeff, i = r >= 0 ? t ? "" : "+ " : "- ", a = Math.abs(r), o = a === 1 ? "" : `${a} `;
+			n.var1 === n.var2 ? e.push(`${i}${o}${n.var1.name}^2`) : e.push(`${i}${o}${n.var1.name} * ${n.var2.name}`), t = !1;
+		}
+		for (let [n, r] of this.linearTerms) {
+			let i = r >= 0 ? t ? "" : "+ " : "- ", a = Math.abs(r), o = a === 1 ? "" : `${a} `;
+			e.push(`${i}${o}${n.name}`), t = !1;
+		}
+		if (this.constant !== 0 || e.length === 0) {
+			let n = this.constant >= 0 ? t ? "" : "+ " : "- ";
+			e.push(`${n}${Math.abs(this.constant)}`);
+		}
+		return e.join(" ") || "0";
+	}
+	static fromProduct(t, n, r = 1) {
+		let i = new e();
+		if (r === 0) return i;
+		let a = p(t, n);
+		return i.quadTerms.set(a, {
+			var1: t.id <= n.id ? t : n,
+			var2: t.id <= n.id ? n : t,
+			coeff: r
+		}), i;
+	}
+	static multiplyLinearTerms(t, n, r, i) {
+		let a = n.size > 0 || i.size > 0, o = (t === 0 || r === 0) && a ? 0 : t * r;
+		if (t !== 0 && r !== 0 && o === 0) throw Error("Constant multiplication underflows to zero.");
+		let s = new e(/* @__PURE__ */ new Map(), /* @__PURE__ */ new Map(), o === 0 ? 0 : o);
+		if (r !== 0) for (let [e, t] of n) {
+			let n = t * r;
+			if (t !== 0 && n === 0) throw Error("Coefficient multiplication underflows to zero.");
+			n !== 0 && s.linearTerms.set(e, n);
+		}
+		if (t !== 0) for (let [e, n] of i) {
+			let r = s.linearTerms.get(e) ?? 0, i = n * t;
+			if (n !== 0 && i === 0) throw Error("Coefficient multiplication underflows to zero.");
+			let a = r + i;
+			a === 0 ? s.linearTerms.delete(e) : s.linearTerms.set(e, a);
+		}
+		for (let [t, r] of n) for (let [n, a] of i) {
+			let i = r * a;
+			if (r !== 0 && a !== 0 && i === 0) throw Error("Coefficient multiplication underflows to zero.");
+			s = s.add(e.fromProduct(t, n, i));
+		}
+		return s;
+	}
+	static extractScalarDivisor(e, t) {
+		if (f(e)) throw Error("Cannot perform arithmetic on a Constraint: expected a number, Var, LinExpr, or QuadExpr.");
+		if (typeof e == "number") {
+			if (e === 0) throw Error(`Division by zero in ${t}`);
+			return e;
+		}
+		let n = "quadTerms" in e ? e.linearTerms.size : e.terms.size, r = "quadTerms" in e ? e.quadTerms.size : 0;
+		if (n > 0 || r > 0) throw Error("Cannot divide by variable in expression");
+		if (e.constant === 0) throw Error(`Division by zero in ${t}`);
+		return e.constant;
+	}
+}, h = class e {
+	kind = "linear";
+	terms;
+	constant;
+	constructor(e = /* @__PURE__ */ new Map(), t = 0) {
+		this.terms = new Map(e), this.constant = t;
+	}
+	clone() {
+		return new e(this.terms, this.constant);
+	}
+	add(e) {
+		if (f(e)) throw Error("Cannot perform arithmetic on a Constraint: expected a number, Var, LinExpr, or QuadExpr.");
+		if (e instanceof m) return e.add(this);
+		let t = this.clone();
+		if (typeof e == "number") t.constant += e;
+		else if ("terms" in e) {
+			for (let [n, r] of e.terms) {
+				let e = (t.terms.get(n) ?? 0) + r;
+				e === 0 ? t.terms.delete(n) : t.terms.set(n, e);
+			}
+			t.constant += e.constant;
+		} else {
+			let n = (t.terms.get(e) ?? 0) + 1;
+			n === 0 ? t.terms.delete(e) : t.terms.set(e, n);
+		}
+		return t;
+	}
+	sub(e) {
+		if (f(e)) throw Error("Cannot perform arithmetic on a Constraint: expected a number, Var, LinExpr, or QuadExpr.");
+		return e instanceof m ? e.neg().add(this) : typeof e == "number" ? this.add(-e) : this.add(e.mul(-1));
+	}
+	mul(t) {
+		if (f(t)) throw Error("Cannot perform arithmetic on a Constraint: expected a number, Var, LinExpr, or QuadExpr.");
+		if (typeof t == "number") {
+			let n = this.constant === 0 && this.terms.size > 0 ? 0 : this.constant * t;
+			if (this.constant !== 0 && t !== 0 && n === 0) throw Error("Constant multiplication underflows to zero.");
+			let r = new e(/* @__PURE__ */ new Map(), n);
+			for (let [e, n] of this.terms) {
+				let i = n * t;
+				if (n !== 0 && t !== 0 && i === 0) throw Error("Coefficient multiplication underflows to zero.");
+				i !== 0 && r.terms.set(e, i);
+			}
+			return r;
+		}
+		return t instanceof F || typeof t == "object" && t && "id" in t && !("terms" in t) && !("quadTerms" in t) ? m.multiplyLinearTerms(this.constant, this.terms, 0, /* @__PURE__ */ new Map([[t, 1]])) : t instanceof m ? this.terms.size === 0 ? t.mul(this.constant) : new m(this.terms, /* @__PURE__ */ new Map(), this.constant).mul(t) : this.terms.size === 0 ? t.mul(this.constant) : t.terms.size === 0 ? this.mul(t.constant) : m.multiplyLinearTerms(this.constant, this.terms, t.constant, t.terms);
+	}
+	div(e) {
+		let t = m.extractScalarDivisor(e, "LinExpr.div()");
+		return this.mul(1 / t);
+	}
+	neg() {
+		return this.mul(-1);
+	}
+	get value() {
+		let e = this.constant;
+		for (let [t, n] of this.terms) {
+			if (t.value === null) return null;
+			e += n * t.value;
+		}
+		return e;
+	}
+	le(e, t) {
+		return this.toConstraint("<=", e, t);
+	}
+	ge(e, t) {
+		return this.toConstraint(">=", e, t);
+	}
+	eq(e, t) {
+		return this.toConstraint("==", e, t);
+	}
+	toConstraint(t, n, r) {
+		let i = this.clone(), a = 0;
+		if (typeof n == "number") a = n;
+		else if (n instanceof d || typeof n == "object" && n && "sense" in n && "lhs" in n) throw Error(`Cannot compare against a Constraint in (${t}): expected a number, Var, or LinExpr.`);
+		else if (n instanceof m || typeof n == "object" && n && "quadTerms" in n) {
+			let r = n;
+			if (r.quadTerms.size > 0) throw Error(`Quadratic expressions are not supported in linear constraints (${t}): quadratic terms are only allowed in objectives.`);
+			i = i.sub(new e(r.linearTerms, 0)), a = r.constant;
+		} else "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);
+	}
+	and(e) {
+		throw Error("Cannot use an arithmetic expression without a comparison operator (<=, >=, ==) in logical 'and': expected a BoolVar, Constraint, or BoolOp.");
+	}
+	or(e) {
+		throw Error("Cannot use an arithmetic expression without a comparison operator (<=, >=, ==) in logical 'or': expected a BoolVar, Constraint, or BoolOp.");
+	}
+	implies(e) {
+		throw Error("Cannot use an arithmetic expression without a comparison operator (<=, >=, ==) in logical 'implies': expected a BoolVar, Constraint, or BoolOp.");
+	}
+	xor(e) {
+		throw Error("Cannot use an arithmetic expression without a comparison operator (<=, >=, ==) in logical 'xor': expected a BoolVar, Constraint, or BoolOp.");
+	}
+	not() {
+		throw Error("Cannot use an arithmetic expression without a comparison operator (<=, >=, ==) in logical 'not': expected a BoolVar, Constraint, or BoolOp.");
+	}
+	toString() {
+		let e = [], t = !0;
+		for (let [n, r] of this.terms) {
+			let i = r >= 0 ? t ? "" : "+ " : "- ", a = Math.abs(r), o = a === 1 ? "" : `${a} `;
+			e.push(`${i}${o}${n.name}`), t = !1;
+		}
+		if (this.constant !== 0 || e.length === 0) {
+			let n = this.constant >= 0 ? t ? "" : "+ " : "- ";
+			e.push(`${n}${Math.abs(this.constant)}`);
+		}
+		return e.join(" ") || "0";
+	}
+};
+function g(e, t) {
+	let n = /* @__PURE__ */ new Map(), r = 0;
+	function i(e) {
+		if (e != null) {
+			if (typeof e == "number") r += e;
+			else if (e instanceof d || typeof e == "object" && "sense" in e && "lhs" in e && "rhs" in e) throw Error("Cannot sum a constraint comparison (<=, >=, ==) in sum(): expected a number, Var, or LinExpr.");
+			else if (e instanceof m || typeof e == "object" && "quadTerms" in e && e.quadTerms instanceof Map) {
+				let t = e;
+				if (t.quadTerms.size > 0) throw Error("Quadratic expressions are not supported in sum(): sum() produces a linear expression (LinExpr).");
+				for (let [e, r] of t.linearTerms) {
+					let t = n.get(e) ?? 0;
+					n.set(e, t + r);
+				}
+				r += t.constant;
+			} else if (typeof e == "object" && "terms" in e) {
+				let t = e;
+				for (let [e, r] of t.terms) {
+					let t = n.get(e) ?? 0;
+					n.set(e, t + r);
+				}
+				r += t.constant;
+			} else if (typeof e == "object" && "id" in e && "name" in e && "lb" in e && "ub" in e) {
+				let t = e, r = n.get(t) ?? 0;
+				n.set(t, r + 1);
+			} else throw Error("Unsupported item in sum(): expected a number, Var, or LinExpr.");
+		}
+	}
+	if (typeof e == "number") {
+		let n = e, r = t;
+		for (let e = 0; e < n; e++) i(r(e, e));
+	} else {
+		let n = 0;
+		for (let r of e) i(t ? t(r, n++) : r);
+	}
+	for (let [e, t] of n) t === 0 && n.delete(e);
+	return new h(n, r);
+}
+function _(e, t) {
+	let n = /* @__PURE__ */ new Map(), r = 0;
+	function i(e) {
+		return typeof e == "object" && !!e && !(e instanceof d) && typeof e.id == "number" && typeof e.name == "string" && typeof e.lb == "number" && typeof e.ub == "number" && typeof e.type == "string" && typeof e.mul == "function" && typeof e.le == "function";
+	}
+	function a(e) {
+		return i(e) || e instanceof h || e instanceof m;
+	}
+	function o(e, t, a) {
+		if (!Number.isFinite(e)) throw Error(`Invalid non-finite coefficient "${e}" in dot() at '${a || "root"}'.`);
+		if (t instanceof m) throw Error(`Quadratic expressions are not supported in dot() at '${a || "root"}': dot() produces a linear expression (LinExpr).`);
+		if (t instanceof h) {
+			if (!Number.isFinite(t.constant)) throw Error(`Invalid non-finite constant "${t.constant}" in dot() at '${a || "root"}'.`);
+			let i = e === 0 || t.constant === 0 ? 0 : e * t.constant;
+			if (e !== 0 && t.constant !== 0 && i === 0) throw Error("Constant multiplication underflows to zero.");
+			if (!Number.isFinite(i)) throw Error(`Coefficient multiplication overflows finite floating-point range in dot() at '${a || "root"}'.`);
+			let o = r + i;
+			if (!Number.isFinite(o)) throw Error(`Constant accumulation overflows finite floating-point range in dot() at '${a || "root"}'.`);
+			r = o;
+			for (let [r, i] of t.terms) {
+				if (!Number.isFinite(i)) throw Error(`Invalid non-finite coefficient "${i}" in dot() at '${a || "root"}'.`);
+				let t = e * i;
+				if (e !== 0 && i !== 0 && t === 0) throw Error("Coefficient multiplication underflows to zero.");
+				if (!Number.isFinite(t)) throw Error(`Coefficient multiplication overflows finite floating-point range in dot() at '${a || "root"}'.`);
+				let o = (n.get(r) ?? 0) + t;
+				if (!Number.isFinite(o)) throw Error(`Coefficient accumulation overflows finite floating-point range in dot() at '${a || "root"}'.`);
+				n.set(r, o);
+			}
+		} else if (i(t)) {
+			let r = t, i = (n.get(r) ?? 0) + e;
+			if (!Number.isFinite(i)) throw Error(`Coefficient accumulation overflows finite floating-point range in dot() at '${a || "root"}'.`);
+			n.set(r, i);
+		} else throw Error(`Cannot multiply number by non-variable/expression operand in dot() at '${a || "root"}'.`);
+	}
+	function s(e) {
+		return typeof e == "object" && !!e && !Array.isArray(e) && !a(e) && !(e instanceof d) && e.kind !== "constraint";
+	}
+	function c(e, t, n = "") {
+		if (e === void 0 || t === void 0 || e === null || t === null) throw Error(`Nullish or undefined operand encountered in dot() at '${n || "root"}'.`);
+		if (typeof e == "number" && typeof t == "number") throw Error(`Cannot multiply two numbers in dot() at '${n || "root"}': expected one numeric coefficient and one Var or LinExpr.`);
+		if (typeof e == "number") {
+			o(e, t, n);
+			return;
+		}
+		if (typeof t == "number") {
+			o(t, e, n);
+			return;
+		}
+		if (Array.isArray(e) || Array.isArray(t)) {
+			if (Array.isArray(e) && Array.isArray(t)) {
+				if (e.length !== t.length) throw Error(`Array length mismatch in dot() at '${n || "root"}': received lengths ${e.length} and ${t.length}.`);
+				for (let r = 0; r < e.length; r++) c(e[r], t[r], n ? `${n}[${r}]` : `[${r}]`);
+				return;
+			}
+			let r = Array.isArray(e) ? e : t, i = Array.isArray(e) ? t : e;
+			if (s(i)) {
+				if (Object.getOwnPropertySymbols(i).length > 0) throw Error(`Symbol keys are not supported in dot() at '${n || "root"}'.`);
+				let a = Object.keys(i);
+				if (a.length === r.length && a.every((e) => /^(?:0|[1-9]\d*)$/.test(e))) {
+					let a = [];
+					for (let e = 0; e < r.length; e++) Object.prototype.hasOwnProperty.call(i, e) || a.push(e);
+					if (a.length > 0) throw Error(`Key mismatch in dot() at '${n || "root"}': missing indices [${a.join(", ")}] in numeric record.`);
+					for (let i = 0; i < r.length; i++) c(e[i], t[i], n ? `${n}[${i}]` : `[${i}]`);
+					return;
+				}
+				throw a.length > 0 && a.every((e) => /^(?:0|[1-9]\d*)$/.test(e)) ? Error(`Array length mismatch in dot() at '${n || "root"}': array has length ${r.length}, but object has ${a.length} indices.`) : Error(`Type mismatch in dot() at '${n || "root"}': one operand is an Array while the other is an Object with keys [${a.slice(0, 5).join(", ")}].`);
+			}
+			throw Error(`Type mismatch in dot() at '${n || "root"}': one operand is an Array while the other is not.`);
+		}
+		if (s(e) && s(t)) {
+			if (Object.getOwnPropertySymbols(e).length > 0 || Object.getOwnPropertySymbols(t).length > 0) throw Error(`Symbol keys are not supported in dot() at '${n || "root"}'.`);
+			let r = Object.keys(e), i = Object.keys(t), a = r.filter((e) => !Object.prototype.hasOwnProperty.call(t, e)), o = i.filter((t) => !Object.prototype.hasOwnProperty.call(e, t));
+			if (a.length > 0 || o.length > 0) {
+				let e = [];
+				throw a.length > 0 && e.push(`missing in second operand: [${a.join(", ")}]`), o.length > 0 && e.push(`missing in first operand: [${o.join(", ")}]`), Error(`Key mismatch in dot() at '${n || "root"}': ${e.join("; ")}.`);
+			}
+			for (let i of r) c(e[i], t[i], n ? `${n}.${i}` : i);
+			return;
+		}
+		throw Error(`Unsupported operand types in dot() at '${n || "root"}'.`);
+	}
+	c(e, t);
+	for (let [e, t] of n) t === 0 && n.delete(e);
+	return new h(n, r);
+}
+//#endregion
+//#region src/modeler/validation.ts
+var v = /* @__PURE__ */ new WeakMap(), y = /* @__PURE__ */ new WeakMap(), b = /* @__PURE__ */ new WeakMap();
+function x(e, t, n) {
+	if (e instanceof i) for (let r of e.children) x(r, t, n);
+	else if (e instanceof d) {
+		let r = e.ownerModel, i = y.get(e);
+		(r !== t || i !== t) && (n && n.push(() => {
+			e.ownerModel = r, i ? y.set(e, i) : y.delete(e);
+		}), e.ownerModel = t, y.set(e, t));
+	}
+}
+function S(e, t) {
+	let n = v.get(e);
+	if (n && n !== t) throw Error(`Variable "${e.name}" already belongs to model "${n.name}" and cannot be added to model "${t.name}".`);
+	v.set(e, t);
+}
+function C(e, t) {
+	let n = b.get(e);
+	if (n) throw Error(n === t ? `Constraint "${e.name}" is already registered in model "${t.name}".` : `Constraint "${e.name}" already belongs to model "${n.name}" and cannot be added to model "${t.name}".`);
+	let r = y.get(e);
+	if (r && r !== t) throw Error(`Constraint "${e.name}" already belongs to model "${r.name}" and cannot be added to model "${t.name}".`);
+	return b.set(e, t), y.set(e, t), r;
+}
+function w(e, t) {
+	v.get(e) === t && v.delete(e);
+}
+function T(e, t, n) {
+	b.get(e) === t && b.delete(e), y.get(e) === t && (n ? y.set(e, n) : y.delete(e));
+}
+var E = 1e-6;
+function D(e) {
+	if (typeof e.lb != "number" || Number.isNaN(e.lb)) throw Error(`Variable "${e.name}" has invalid lower bound: ${e.lb} (NaN or non-numeric bound is not allowed).`);
+	if (e.lb === Infinity) throw Error(`Variable "${e.name}" has invalid lower bound: +Infinity is not allowed as a lower bound.`);
+	if (typeof e.ub != "number" || Number.isNaN(e.ub)) throw Error(`Variable "${e.name}" has invalid upper bound: ${e.ub} (NaN or non-numeric bound is not allowed).`);
+	if (e.ub === -Infinity) throw Error(`Variable "${e.name}" has invalid upper bound: -Infinity is not allowed as an upper bound.`);
+	if (e.lb > e.ub) throw Error(`Variable "${e.name}" has invalid bounds: lower bound (${e.lb}) is strictly greater than upper bound (${e.ub}).`);
+	if (e.initialValue !== void 0) {
+		if (typeof e.initialValue != "number" || !Number.isFinite(e.initialValue)) throw Error(`Variable "${e.name}" has invalid initialValue: ${String(e.initialValue)} (initialValue must be a finite number).`);
+		let t = e.type === "Binary" ? Math.max(0, e.lb) : e.lb, n = e.type === "Binary" ? Math.min(1, e.ub) : e.ub;
+		if (e.initialValue < t - 1e-6 || e.initialValue > n + 1e-6) throw Error(`Variable "${e.name}" has initialValue (${e.initialValue}) outside its bounds [${t}, ${n}] (tolerance ${E}).`);
+		if (e.type === "Integer" || e.type === "Binary") {
+			let r = Math.round(e.initialValue);
+			if (Math.abs(e.initialValue - r) > 1e-6 || r < t || r > n) throw Error(`Variable "${e.name}" of type "${e.type}" has non-integral or out-of-domain initialValue: ${e.initialValue} (must be within ${E} of an integer in [${t}, ${n}]).`);
+		}
+	}
+}
+function O(e) {
+	if (e.initialValue === void 0) return;
+	if (D(e), e.type === "Integer" || e.type === "Binary") {
+		let t = Math.round(e.initialValue);
+		return Object.is(t, -0) ? 0 : t;
+	}
+	let t = Math.min(e.ub, Math.max(e.lb, e.initialValue));
+	return Object.is(t, -0) ? 0 : t;
+}
+function k(e, t, n) {
+	if (e instanceof m) {
+		if (!Number.isFinite(e.constant)) throw Error(`Objective function has invalid constant: ${e.constant}. Constant must be a finite number.`);
+		for (let [r, i] of e.linearTerms) {
+			if (!n(r)) throw Error(`Variable "${r.name}" in objective function does not belong to model "${t}". All variables must belong to the model by object identity.`);
+			if (!Number.isFinite(i)) throw Error(`Variable "${r.name}" in objective function has invalid coefficient: ${i}. Coefficients must be finite numbers.`);
+		}
+		for (let [, r] of e.quadTerms) {
+			if (!n(r.var1)) throw Error(`Variable "${r.var1.name}" in quadratic objective function does not belong to model "${t}". All variables must belong to the model by object identity.`);
+			if (!n(r.var2)) throw Error(`Variable "${r.var2.name}" in quadratic objective function does not belong to model "${t}". All variables must belong to the model by object identity.`);
+			if (!Number.isFinite(r.coeff) || !Number.isFinite(r.coeff * 2)) throw Error(`Quadratic term (${r.var1.name} * ${r.var2.name}) in objective function has invalid coefficient: ${r.coeff}.`);
+		}
+	} else if ("terms" in e) {
+		if (!Number.isFinite(e.constant)) throw Error(`Objective function has invalid constant: ${e.constant}. Constant must be a finite number.`);
+		for (let [r, i] of e.terms) {
+			if (!n(r)) throw Error(`Variable "${r.name}" in objective function does not belong to model "${t}". All variables must belong to the model by object identity.`);
+			if (!Number.isFinite(i)) throw Error(`Variable "${r.name}" in objective function has invalid coefficient: ${i}. Coefficients must be finite numbers.`);
+		}
+	}
+}
+function A(e, t, n, r = e.name) {
+	if (!Number.isFinite(e.rhs)) throw Error(`Constraint "${r}" has invalid right-hand side (RHS): ${e.rhs}. RHS must be a finite number.`);
+	if (e.lhs.constant !== void 0 && !Number.isFinite(e.lhs.constant)) throw Error(`Constraint "${r}" has invalid LHS constant: ${e.lhs.constant}. Constant must be a finite number.`);
+	for (let [i, a] of e.lhs.terms) {
+		if (!n(i)) throw Error(`Variable "${i.name}" in constraint "${r}" does not belong to model "${t}". All variables must belong to the model by object identity.`);
+		if (!Number.isFinite(a)) throw Error(`Variable "${i.name}" in constraint "${r}" has invalid coefficient: ${a}. Coefficients must be finite numbers.`);
+	}
+}
+function j(e, t, n, a, o, s) {
+	if (e instanceof r) {
+		if (!o(e)) throw Error(`Boolean variable "${e.name}" in logical constraint "${t}" does not belong to model "${n}".`);
+	} else if (e instanceof i) for (let r of e.children) j(r, t, n, a, o, s);
+	else if (e instanceof d) {
+		if (s) {
+			let r = y.get(e) ?? e.ownerModel ?? void 0;
+			if (r && r !== s) throw Error(`Constraint "${e.name}" embedded in logical constraint "${t}" already belongs to model "${r.name ?? "another model"}" and cannot be added to model "${n}".`);
+		}
+		if (!Number.isFinite(e.rhs)) throw Error(`Constraint "${e.name}" embedded in logical constraint "${t}" has invalid RHS: ${e.rhs}.`);
+		if (e.lhs.constant !== void 0 && !Number.isFinite(e.lhs.constant)) throw Error(`Constraint "${e.name}" embedded in logical constraint "${t}" has invalid LHS constant: ${e.lhs.constant}.`);
+		for (let [r, i] of e.lhs.terms) {
+			if (!a(r)) throw Error(`Variable "${r.name}" embedded in logical constraint "${t}" does not belong to model "${n}".`);
+			if (!Number.isFinite(i)) throw Error(`Variable "${r.name}" embedded in logical constraint "${t}" has invalid coefficient: ${i}.`);
+		}
+	}
+}
+function M(e) {
+	let t = /* @__PURE__ */ new Set(), n = /* @__PURE__ */ new Set();
+	for (let r of e.variables) {
+		D(r);
+		let i = v.get(r);
+		if (i && i !== e || t.has(r.name) || e.getVarByName(r.name) !== r) throw Error(`Variable "${r.name}" is duplicated or not canonically registered in model "${e.name}".`);
+		t.add(r.name), n.add(r);
+	}
+	let r = /* @__PURE__ */ new Set(), i = /* @__PURE__ */ new Set();
+	for (let t of e.boolVars) {
+		if (r.has(t.name) || e.getBoolVarByName(t.name) !== t) throw Error(`Boolean variable "${t.name}" is duplicated or not canonically registered in model "${e.name}".`);
+		r.add(t.name), i.add(t);
+	}
+	let a = /* @__PURE__ */ new Set();
+	for (let t of e.constraints) {
+		if (r.has(t.name)) throw Error(`Constraint name "${t.name}" conflicts with Boolean variable "${t.name}" in model "${e.name}".`);
+		if (a.has(t.name)) throw Error(`Duplicate constraint name "${t.name}" in model "${e.name}".`);
+		a.add(t.name);
+	}
+	for (let t of e.logicalConstraints) {
+		if (r.has(t.name)) throw Error(`Logical constraint name "${t.name}" conflicts with Boolean variable "${t.name}" in model "${e.name}".`);
+		if (a.has(t.name)) throw Error(`Conflicting constraint name "${t.name}" across arithmetic and logical constraints in model "${e.name}".`);
+		a.add(t.name);
+	}
+	for (let t of e.constraints) {
+		let n = y.get(t);
+		if (n && n !== e || e.getConstraintByName(t.name) !== t) throw Error(`Constraint "${t.name}" is duplicated or not canonically registered in model "${e.name}".`);
+	}
+	for (let t of e.logicalConstraints) if (e.getLogicalConstraintByName(t.name) !== t) throw Error(`Logical constraint "${t.name}" is duplicated or not canonically registered in model "${e.name}".`);
+	e.objectiveExpr && k(e.objectiveExpr, e.name, (e) => n.has(e));
+	for (let t of e.constraints) A(t, e.name, (e) => n.has(e));
+	for (let t of e.logicalConstraints) j(t.expr, t.name, e.name, (e) => n.has(e), (e) => i.has(e), e);
+}
+//#endregion
+//#region src/modeler/variable.ts
+var N = 0;
+function P(e) {
+	if (e === void 0) return "Continuous";
+	if (typeof e == "string") {
+		let t = e.toLowerCase();
+		if (t === "binary" || t === "bin") return "Binary";
+		if (t === "integer" || t === "int") return "Integer";
+		if (t === "continuous" || t === "cont") return "Continuous";
+	}
+	throw Error(`Invalid variable type "${String(e)}": expected "Continuous", "Integer", or "Binary".`);
+}
+var F = class {
+	id;
+	_name;
+	prefix;
+	hasExplicitName;
+	ownerModel = null;
+	_type;
+	_lb;
+	_ub;
+	_initialValue;
+	value = null;
+	reducedCost = null;
+	constructor(e = {}) {
+		this.id = ++N;
+		let t = typeof e.name == "string" ? e.name.trim() : "", n = typeof e.prefix == "string" ? e.prefix.trim() : "";
+		this.prefix = n.length > 0 ? n : "x", this.hasExplicitName = t.length > 0, this._name = this.hasExplicitName ? t : `${this.prefix}_${this.id}`, this._type = P(e.type), this._type === "Binary" ? (this._lb = 0, this._ub = 1) : (this._lb = e.lb === void 0 ? 0 : e.lb, this._ub = e.ub === void 0 ? Infinity : e.ub), this._initialValue = e.initialValue === void 0 ? void 0 : Object.is(e.initialValue, -0) ? 0 : e.initialValue, this._initialValue !== void 0 && D(this);
+	}
+	get name() {
+		return this._name;
+	}
+	get type() {
+		return this._type;
+	}
+	set type(e) {
+		let t = P(e);
+		this._type !== t && (this._type = t, this.ownerModel?.notifyMutation?.());
+	}
+	get lb() {
+		return this._lb;
+	}
+	set lb(e) {
+		Object.is(this._lb, e) || (this._lb = e, this.ownerModel?.notifyMutation?.());
+	}
+	get ub() {
+		return this._ub;
+	}
+	set ub(e) {
+		Object.is(this._ub, e) || (this._ub = e, this.ownerModel?.notifyMutation?.());
+	}
+	get initialValue() {
+		return this._initialValue;
+	}
+	set initialValue(e) {
+		let t = e !== void 0 && Object.is(e, -0) ? 0 : e;
+		Object.is(this._initialValue, t) || (this._initialValue = t, this.ownerModel?.notifyMutation?.());
+	}
+	_assignModelName(e) {
+		this._name = e;
+	}
+	mul(e) {
+		return typeof e == "number" ? new h(/* @__PURE__ */ new Map([[this, 1]]), 0).mul(e) : new m(/* @__PURE__ */ new Map([[this, 1]]), /* @__PURE__ */ new Map(), 0).mul(e);
+	}
+	add(e) {
+		return e instanceof m ? e.add(this) : new h(/* @__PURE__ */ new Map([[this, 1]]), 0).add(e);
+	}
+	sub(e) {
+		return e instanceof m ? e.neg().add(this) : new h(/* @__PURE__ */ new Map([[this, 1]]), 0).sub(e);
+	}
+	neg() {
+		return this.mul(-1);
+	}
+	le(e, t) {
+		return new h(/* @__PURE__ */ new Map([[this, 1]]), 0).le(e, t);
+	}
+	ge(e, t) {
+		return new h(/* @__PURE__ */ new Map([[this, 1]]), 0).ge(e, t);
+	}
+	eq(e, t) {
+		return new h(/* @__PURE__ */ new Map([[this, 1]]), 0).eq(e, t);
+	}
+	toString() {
+		return this.name;
+	}
+};
+//#endregion
+//#region src/modeler/lp-writer.ts
+function I(e) {
+	return typeof e == "object" && !!e && typeof e.lpString == "string" && e.nameToVar instanceof Map && e.nameToConstraint instanceof Map;
+}
+function L(e, t = "x", n = 0) {
+	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 R(e) {
+	let t = e.variables || [], n = e.constraints || [], r = /* @__PURE__ */ new Map(), i = /* @__PURE__ */ new Map(), a = /* @__PURE__ */ new Map(), o = /* @__PURE__ */ new Map(), s = /* @__PURE__ */ new Map(), c = /* @__PURE__ */ new Set();
+	for (let e = 0; e < t.length; e++) {
+		let n = t[e];
+		s.set(n, e);
+		let a = L(n.name, "x", e), o = a, l = 1;
+		for (; c.has(o);) o = `${a}_${l++}`;
+		c.add(o), i.set(n, o), r.set(o, n);
+	}
+	let l = /* @__PURE__ */ new Set();
+	for (let e = 0; e < n.length; e++) {
+		let t = n[e], r = L(t.name, "c", e + 1), i = r, s = 1;
+		for (; l.has(i);) i = `${r}_${s++}`;
+		l.add(i), o.set(t, i), a.set(i, t);
+	}
+	return {
+		nameToVar: r,
+		varToName: i,
+		nameToConstraint: a,
+		constraintToName: o,
+		constrToName: o,
+		varOrder: s
+	};
+}
+function z(e) {
+	let { sense: t, objective: n, constraints: r, variables: i } = e, { nameToVar: a, varToName: o, nameToConstraint: s, constrToName: c, varOrder: l } = R(e), u = [];
+	u.push(t && t.toLowerCase() === "maximize" ? "Maximize" : "Minimize");
+	let d = [], f = !0, p = n instanceof m ? n.linearTerms : n.terms;
+	if (p) for (let [e, t] of p) {
+		if (t === 0) continue;
+		let n = o.get(e), r = t >= 0 ? f ? "" : "+ " : "- ", i = Math.abs(t), a = i === 1 ? "" : `${i} `;
+		d.push(`${r}${a}${n}`), f = !1;
+	}
+	if (n instanceof m && n.quadTerms.size > 0) {
+		let e = [], t = !0, r = Array.from(n.quadTerms.values()).filter((e) => e.coeff !== 0).map((e) => {
+			let t = l.get(e.var1) ?? e.var1.id, n = l.get(e.var2) ?? e.var2.id, [r, i, a, o] = t <= n ? [
+				e.var1,
+				e.var2,
+				t,
+				n
+			] : [
+				e.var2,
+				e.var1,
+				n,
+				t
+			];
+			return {
+				firstVar: r,
+				secondVar: i,
+				firstIdx: a,
+				secondIdx: o,
+				coeff: e.coeff
+			};
+		}).sort((e, t) => e.firstIdx - t.firstIdx || e.secondIdx - t.secondIdx);
+		for (let n of r) {
+			let r = 2 * n.coeff, i = r >= 0 ? t ? "" : "+ " : "- ", a = Math.abs(r), s = a === 1 ? "" : `${a} `, c = o.get(n.firstVar), l = o.get(n.secondVar);
+			n.firstVar === n.secondVar ? e.push(`${i}${s}${c} ^ 2`) : e.push(`${i}${s}${c} * ${l}`), t = !1;
+		}
+		if (e.length > 0) {
+			let t = `[ ${e.join(" ")} ] / 2`;
+			d.length > 0 ? d.push("+", t) : d.push(t);
+		}
+	}
+	let h = d.length > 0 ? d.join(" ") : "0";
+	u.push(` obj: ${h}`), u.push("Subject To");
+	for (let e of r) {
+		let t = c.get(e), n = [], r = !0;
+		for (let [t, i] of e.lhs.terms) {
+			if (i === 0) continue;
+			let e = o.get(t), a = i >= 0 ? r ? "" : "+ " : "- ", s = Math.abs(i), c = s === 1 ? "" : `${s} `;
+			n.push(`${a}${c}${e}`), r = !1;
+		}
+		let i = n.length > 0 ? n.join(" ") : "0", a = e.sense === "==" ? "=" : e.sense;
+		u.push(` ${t}: ${i} ${a} ${e.rhs}`);
+	}
+	u.push("Bounds");
+	let g = [], _ = [];
+	for (let e of i) {
+		let t = o.get(e);
+		if (e.type === "Binary") {
+			_.push(t);
+			continue;
+		}
+		e.type === "Integer" && g.push(t);
+		let n = e.lb === -Infinity, r = e.ub === Infinity;
+		n && r ? u.push(` ${t} free`) : n && !r ? u.push(` -infinity <= ${t} <= ${e.ub}`) : !n && r ? (e.lb !== 0 || e.initialValue !== void 0) && u.push(` ${t} >= ${e.lb}`) : u.push(` ${e.lb} <= ${t} <= ${e.ub}`);
+	}
+	if (g.length > 0) {
+		u.push("Generals");
+		for (let e = 0; e < g.length; e += 10) u.push(" " + g.slice(e, e + 10).join(" "));
+	}
+	if (_.length > 0) {
+		u.push("Binary");
+		for (let e = 0; e < _.length; e += 10) u.push(" " + _.slice(e, e + 10).join(" "));
+	}
+	return u.push("End"), {
+		lpString: u.join("\n") + "\n",
+		nameToVar: a,
+		nameToConstraint: s
+	};
+}
+//#endregion
+//#region src/modeler/solvers/registry.ts
+var B = Symbol.for("washi.solverRegistry"), V = Symbol.for("washi.defaultSolverFactory"), H = globalThis;
+H[B] || (H[B] = /* @__PURE__ */ new Map());
+var U = H[B];
+function W(e, t) {
+	U.set(e.toLowerCase(), t);
+}
+function G(e) {
+	if (typeof e == "string") {
+		let t = U.get(e.toLowerCase());
+		if (!t) throw Error(`Solver '${e}' is not registered.`);
+		H[V] = t;
+	} else H[V] = typeof e == "function" ? e : () => e;
+}
+function K(e, t) {
+	if (!e) {
+		let e = H[V] || U.get("highs");
+		if (!e) throw Error(`No default solver available. Available solvers: ${q().join(", ")}`);
+		return e(t);
+	}
+	if (typeof e == "string") {
+		let n = e.toLowerCase(), r = U.get(n);
+		if (!r) throw Error(n === "glpk" ? `Solver 'glpk' not found. Available solvers: ${q().join(", ")}. Please import '@ohtaman/washi/solvers/glpk' before selecting this solver.` : n === "z3" ? `Solver 'z3' not found. Available solvers: ${q().join(", ")}. Please import '@ohtaman/washi/solvers/z3' before selecting this solver.` : `Solver '${e}' not found. Available solvers: ${q().join(", ")}`);
+		return r(t);
+	}
+	return e;
+}
+function q() {
+	return Array.from(U.keys());
+}
+//#endregion
+export { c as A, g as C, i as D, n as E, o as M, l as N, r as O, _ as S, d as T, j as _, R as a, D as b, L as c, C as d, S as f, A as g, w as h, G as i, s as j, a as k, F as l, T as m, q as n, z as o, O as p, W as r, I as s, K as t, x as u, M as v, m as w, h as x, k as y };