@critical-path/svelte 0.19.2 → 0.19.4

package/dist/index.js

@@ -1059,7 +1059,7 @@ var u = l.arrayToEnum([
 p.create = (e) => new p(e);
 //#endregion
 //#region ../../node_modules/.pnpm/zod@3.25.76/node_modules/zod/v3/locales/en.js
-var m = (e, t) => {
+var ve = (e, t) => {
 	let n;
 	switch (e.code) {
 		case f.invalid_type:
@@ -1113,13 +1113,13 @@ var m = (e, t) => {
 		default: n = t.defaultError, l.assertNever(e);
 	}
 	return { message: n };
-}, ve = m;
-function ye() {
-	return ve;
+}, ye = ve;
+function be() {
+	return ye;
 }
 //#endregion
 //#region ../../node_modules/.pnpm/zod@3.25.76/node_modules/zod/v3/helpers/parseUtil.js
-var be = (e) => {
+var xe = (e) => {
 	let { data: t, path: n, errorMaps: r, issueData: i } = e, a = [...n, ...i.path || []], o = {
 		...i,
 		path: a
@@ -1140,8 +1140,8 @@ var be = (e) => {
 		message: s
 	};
 };
-function h(e, t) {
-	let n = ye(), r = be({
+function m(e, t) {
+	let n = be(), r = xe({
 		issueData: t,
 		data: e.data,
 		path: e.path,
@@ -1149,12 +1149,12 @@ function h(e, t) {
 			e.common.contextualErrorMap,
 			e.schemaErrorMap,
 			n,
-			n === m ? void 0 : m
+			n === ve ? void 0 : ve
 		].filter((e) => !!e)
 	});
 	e.common.issues.push(r);
 }
-var g = class e {
+var h = class e {
 	constructor() {
 		this.value = "valid";
 	}
@@ -1167,7 +1167,7 @@ var g = class e {
 	static mergeArray(e, t) {
 		let n = [];
 		for (let r of t) {
-			if (r.status === "aborted") return _;
+			if (r.status === "aborted") return g;
 			r.status === "dirty" && e.dirty(), n.push(r.value);
 		}
 		return {
@@ -1190,7 +1190,7 @@ var g = class e {
 		let n = {};
 		for (let r of t) {
 			let { key: t, value: i } = r;
-			if (t.status === "aborted" || i.status === "aborted") return _;
+			if (t.status === "aborted" || i.status === "aborted") return g;
 			t.status === "dirty" && e.dirty(), i.status === "dirty" && e.dirty(), t.value !== "__proto__" && (i.value !== void 0 || r.alwaysSet) && (n[t.value] = i.value);
 		}
 		return {
@@ -1198,27 +1198,27 @@ var g = class e {
 			value: n
 		};
 	}
-}, _ = Object.freeze({ status: "aborted" }), xe = (e) => ({
+}, g = Object.freeze({ status: "aborted" }), Se = (e) => ({
 	status: "dirty",
 	value: e
-}), v = (e) => ({
+}), _ = (e) => ({
 	status: "valid",
 	value: e
-}), Se = (e) => e.status === "aborted", Ce = (e) => e.status === "dirty", y = (e) => e.status === "valid", we = (e) => typeof Promise < "u" && e instanceof Promise, b;
+}), Ce = (e) => e.status === "aborted", we = (e) => e.status === "dirty", v = (e) => e.status === "valid", Te = (e) => typeof Promise < "u" && e instanceof Promise, y;
 (function(e) {
 	e.errToObj = (e) => typeof e == "string" ? { message: e } : e || {}, e.toString = (e) => typeof e == "string" ? e : e?.message;
-})(b ||= {});
+})(y ||= {});
 //#endregion
 //#region ../../node_modules/.pnpm/zod@3.25.76/node_modules/zod/v3/types.js
-var x = class {
+var b = class {
 	constructor(e, t, n, r) {
 		this._cachedPath = [], this.parent = e, this.data = t, this._path = n, this._key = r;
 	}
 	get path() {
 		return this._cachedPath.length || (Array.isArray(this._key) ? this._cachedPath.push(...this._path, ...this._key) : this._cachedPath.push(...this._path, this._key)), this._cachedPath;
 	}
-}, Te = (e, t) => {
-	if (y(t)) return {
+}, Ee = (e, t) => {
+	if (v(t)) return {
 		success: !0,
 		data: t.value
 	};
@@ -1232,7 +1232,7 @@ var x = class {
 		}
 	};
 };
-function S(e) {
+function x(e) {
 	if (!e) return {};
 	let { errorMap: t, invalid_type_error: n, required_error: r, description: i } = e;
 	if (t && (n || r)) throw Error("Can't use \"invalid_type_error\" or \"required_error\" in conjunction with custom error map.");
@@ -1247,7 +1247,7 @@ function S(e) {
 		description: i
 	};
 }
-var C = class {
+var S = class {
 	get description() {
 		return this._def.description;
 	}
@@ -1266,7 +1266,7 @@ var C = class {
 	}
 	_processInputParams(e) {
 		return {
-			status: new g(),
+			status: new h(),
 			ctx: {
 				common: e.parent.common,
 				data: e.data,
@@ -1279,7 +1279,7 @@ var C = class {
 	}
 	_parseSync(e) {
 		let t = this._parse(e);
-		if (we(t)) throw Error("Synchronous parse encountered promise.");
+		if (Te(t)) throw Error("Synchronous parse encountered promise.");
 		return t;
 	}
 	_parseAsync(e) {
@@ -1304,7 +1304,7 @@ var C = class {
 			data: e,
 			parsedType: d(e)
 		};
-		return Te(n, this._parseSync({
+		return Ee(n, this._parseSync({
 			data: e,
 			path: n.path,
 			parent: n
@@ -1328,7 +1328,7 @@ var C = class {
 				path: [],
 				parent: t
 			});
-			return y(n) ? { value: n.value } : { issues: t.common.issues };
+			return v(n) ? { value: n.value } : { issues: t.common.issues };
 		} catch (e) {
 			e?.message?.toLowerCase()?.includes("encountered") && (this["~standard"].async = !0), t.common = {
 				issues: [],
@@ -1339,7 +1339,7 @@ var C = class {
 			data: e,
 			path: [],
 			parent: t
-		}).then((e) => y(e) ? { value: e.value } : { issues: t.common.issues });
+		}).then((e) => v(e) ? { value: e.value } : { issues: t.common.issues });
 	}
 	async parseAsync(e, t) {
 		let n = await this.safeParseAsync(e, t);
@@ -1363,7 +1363,7 @@ var C = class {
 			path: n.path,
 			parent: n
 		});
-		return Te(n, await (we(r) ? r : Promise.resolve(r)));
+		return Ee(n, await (Te(r) ? r : Promise.resolve(r)));
 	}
 	refine(e, t) {
 		let n = (e) => typeof t == "string" || t === void 0 ? { message: t } : typeof t == "function" ? t(e) : t;
@@ -1379,9 +1379,9 @@ var C = class {
 		return this._refinement((n, r) => e(n) ? !0 : (r.addIssue(typeof t == "function" ? t(n, r) : t), !1));
 	}
 	_refinement(e) {
-		return new M({
+		return new j({
 			schema: this,
-			typeName: F.ZodEffects,
+			typeName: P.ZodEffects,
 			effect: {
 				type: "refinement",
 				refinement: e
@@ -1399,31 +1399,31 @@ var C = class {
 		};
 	}
 	optional() {
-		return N.create(this, this._def);
+		return M.create(this, this._def);
 	}
 	nullable() {
-		return P.create(this, this._def);
+		return N.create(this, this._def);
 	}
 	nullish() {
 		return this.nullable().optional();
 	}
 	array() {
-		return E.create(this);
+		return T.create(this);
 	}
 	promise() {
-		return j.create(this, this._def);
+		return A.create(this, this._def);
 	}
 	or(e) {
-		return st.create([this, e], this._def);
+		return ct.create([this, e], this._def);
 	}
 	and(e) {
-		return ut.create(this, e, this._def);
+		return dt.create(this, e, this._def);
 	}
 	transform(e) {
-		return new M({
-			...S(this._def),
+		return new j({
+			...x(this._def),
 			schema: this,
-			typeName: F.ZodEffects,
+			typeName: P.ZodEffects,
 			effect: {
 				type: "transform",
 				transform: e
@@ -1432,27 +1432,27 @@ var C = class {
 	}
 	default(e) {
 		let t = typeof e == "function" ? e : () => e;
-		return new bt({
-			...S(this._def),
+		return new xt({
+			...x(this._def),
 			innerType: this,
 			defaultValue: t,
-			typeName: F.ZodDefault
+			typeName: P.ZodDefault
 		});
 	}
 	brand() {
-		return new Ct({
-			typeName: F.ZodBranded,
+		return new wt({
+			typeName: P.ZodBranded,
 			type: this,
-			...S(this._def)
+			...x(this._def)
 		});
 	}
 	catch(e) {
 		let t = typeof e == "function" ? e : () => e;
-		return new xt({
-			...S(this._def),
+		return new St({
+			...x(this._def),
 			innerType: this,
 			catchValue: t,
-			typeName: F.ZodCatch
+			typeName: P.ZodCatch
 		});
 	}
 	describe(e) {
@@ -1463,10 +1463,10 @@ var C = class {
 		});
 	}
 	pipe(e) {
-		return wt.create(this, e);
+		return Tt.create(this, e);
 	}
 	readonly() {
-		return Tt.create(this);
+		return Et.create(this);
 	}
 	isOptional() {
 		return this.safeParse(void 0).success;
@@ -1474,25 +1474,25 @@ var C = class {
 	isNullable() {
 		return this.safeParse(null).success;
 	}
-}, Ee = /^c[^\s-]{8,}$/i, De = /^[0-9a-z]+$/, Oe = /^[0-9A-HJKMNP-TV-Z]{26}$/i, ke = /^[0-9a-fA-F]{8}\b-[0-9a-fA-F]{4}\b-[0-9a-fA-F]{4}\b-[0-9a-fA-F]{4}\b-[0-9a-fA-F]{12}$/i, Ae = /^[a-z0-9_-]{21}$/i, je = /^[A-Za-z0-9-_]+\.[A-Za-z0-9-_]+\.[A-Za-z0-9-_]*$/, Me = /^[-+]?P(?!$)(?:(?:[-+]?\d+Y)|(?:[-+]?\d+[.,]\d+Y$))?(?:(?:[-+]?\d+M)|(?:[-+]?\d+[.,]\d+M$))?(?:(?:[-+]?\d+W)|(?:[-+]?\d+[.,]\d+W$))?(?:(?:[-+]?\d+D)|(?:[-+]?\d+[.,]\d+D$))?(?:T(?=[\d+-])(?:(?:[-+]?\d+H)|(?:[-+]?\d+[.,]\d+H$))?(?:(?:[-+]?\d+M)|(?:[-+]?\d+[.,]\d+M$))?(?:[-+]?\d+(?:[.,]\d+)?S)?)??$/, Ne = /^(?!\.)(?!.*\.\.)([A-Z0-9_'+\-\.]*)[A-Z0-9_+-]@([A-Z0-9][A-Z0-9\-]*\.)+[A-Z]{2,}$/i, Pe = "^(\\p{Extended_Pictographic}|\\p{Emoji_Component})+$", Fe, Ie = /^(?:(?:25[0-5]|2[0-4][0-9]|1[0-9][0-9]|[1-9][0-9]|[0-9])\.){3}(?:25[0-5]|2[0-4][0-9]|1[0-9][0-9]|[1-9][0-9]|[0-9])$/, Le = /^(?:(?:25[0-5]|2[0-4][0-9]|1[0-9][0-9]|[1-9][0-9]|[0-9])\.){3}(?:25[0-5]|2[0-4][0-9]|1[0-9][0-9]|[1-9][0-9]|[0-9])\/(3[0-2]|[12]?[0-9])$/, Re = /^(([0-9a-fA-F]{1,4}:){7,7}[0-9a-fA-F]{1,4}|([0-9a-fA-F]{1,4}:){1,7}:|([0-9a-fA-F]{1,4}:){1,6}:[0-9a-fA-F]{1,4}|([0-9a-fA-F]{1,4}:){1,5}(:[0-9a-fA-F]{1,4}){1,2}|([0-9a-fA-F]{1,4}:){1,4}(:[0-9a-fA-F]{1,4}){1,3}|([0-9a-fA-F]{1,4}:){1,3}(:[0-9a-fA-F]{1,4}){1,4}|([0-9a-fA-F]{1,4}:){1,2}(:[0-9a-fA-F]{1,4}){1,5}|[0-9a-fA-F]{1,4}:((:[0-9a-fA-F]{1,4}){1,6})|:((:[0-9a-fA-F]{1,4}){1,7}|:)|fe80:(:[0-9a-fA-F]{0,4}){0,4}%[0-9a-zA-Z]{1,}|::(ffff(:0{1,4}){0,1}:){0,1}((25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9])\.){3,3}(25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9])|([0-9a-fA-F]{1,4}:){1,4}:((25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9])\.){3,3}(25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9]))$/, ze = /^(([0-9a-fA-F]{1,4}:){7,7}[0-9a-fA-F]{1,4}|([0-9a-fA-F]{1,4}:){1,7}:|([0-9a-fA-F]{1,4}:){1,6}:[0-9a-fA-F]{1,4}|([0-9a-fA-F]{1,4}:){1,5}(:[0-9a-fA-F]{1,4}){1,2}|([0-9a-fA-F]{1,4}:){1,4}(:[0-9a-fA-F]{1,4}){1,3}|([0-9a-fA-F]{1,4}:){1,3}(:[0-9a-fA-F]{1,4}){1,4}|([0-9a-fA-F]{1,4}:){1,2}(:[0-9a-fA-F]{1,4}){1,5}|[0-9a-fA-F]{1,4}:((:[0-9a-fA-F]{1,4}){1,6})|:((:[0-9a-fA-F]{1,4}){1,7}|:)|fe80:(:[0-9a-fA-F]{0,4}){0,4}%[0-9a-zA-Z]{1,}|::(ffff(:0{1,4}){0,1}:){0,1}((25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9])\.){3,3}(25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9])|([0-9a-fA-F]{1,4}:){1,4}:((25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9])\.){3,3}(25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9]))\/(12[0-8]|1[01][0-9]|[1-9]?[0-9])$/, Be = /^([0-9a-zA-Z+/]{4})*(([0-9a-zA-Z+/]{2}==)|([0-9a-zA-Z+/]{3}=))?$/, Ve = /^([0-9a-zA-Z-_]{4})*(([0-9a-zA-Z-_]{2}(==)?)|([0-9a-zA-Z-_]{3}(=)?))?$/, He = "((\\d\\d[2468][048]|\\d\\d[13579][26]|\\d\\d0[48]|[02468][048]00|[13579][26]00)-02-29|\\d{4}-((0[13578]|1[02])-(0[1-9]|[12]\\d|3[01])|(0[469]|11)-(0[1-9]|[12]\\d|30)|(02)-(0[1-9]|1\\d|2[0-8])))", Ue = RegExp(`^${He}$`);
-function We(e) {
+}, De = /^c[^\s-]{8,}$/i, Oe = /^[0-9a-z]+$/, ke = /^[0-9A-HJKMNP-TV-Z]{26}$/i, Ae = /^[0-9a-fA-F]{8}\b-[0-9a-fA-F]{4}\b-[0-9a-fA-F]{4}\b-[0-9a-fA-F]{4}\b-[0-9a-fA-F]{12}$/i, je = /^[a-z0-9_-]{21}$/i, Me = /^[A-Za-z0-9-_]+\.[A-Za-z0-9-_]+\.[A-Za-z0-9-_]*$/, Ne = /^[-+]?P(?!$)(?:(?:[-+]?\d+Y)|(?:[-+]?\d+[.,]\d+Y$))?(?:(?:[-+]?\d+M)|(?:[-+]?\d+[.,]\d+M$))?(?:(?:[-+]?\d+W)|(?:[-+]?\d+[.,]\d+W$))?(?:(?:[-+]?\d+D)|(?:[-+]?\d+[.,]\d+D$))?(?:T(?=[\d+-])(?:(?:[-+]?\d+H)|(?:[-+]?\d+[.,]\d+H$))?(?:(?:[-+]?\d+M)|(?:[-+]?\d+[.,]\d+M$))?(?:[-+]?\d+(?:[.,]\d+)?S)?)??$/, Pe = /^(?!\.)(?!.*\.\.)([A-Z0-9_'+\-\.]*)[A-Z0-9_+-]@([A-Z0-9][A-Z0-9\-]*\.)+[A-Z]{2,}$/i, Fe = "^(\\p{Extended_Pictographic}|\\p{Emoji_Component})+$", Ie, Le = /^(?:(?:25[0-5]|2[0-4][0-9]|1[0-9][0-9]|[1-9][0-9]|[0-9])\.){3}(?:25[0-5]|2[0-4][0-9]|1[0-9][0-9]|[1-9][0-9]|[0-9])$/, Re = /^(?:(?:25[0-5]|2[0-4][0-9]|1[0-9][0-9]|[1-9][0-9]|[0-9])\.){3}(?:25[0-5]|2[0-4][0-9]|1[0-9][0-9]|[1-9][0-9]|[0-9])\/(3[0-2]|[12]?[0-9])$/, ze = /^(([0-9a-fA-F]{1,4}:){7,7}[0-9a-fA-F]{1,4}|([0-9a-fA-F]{1,4}:){1,7}:|([0-9a-fA-F]{1,4}:){1,6}:[0-9a-fA-F]{1,4}|([0-9a-fA-F]{1,4}:){1,5}(:[0-9a-fA-F]{1,4}){1,2}|([0-9a-fA-F]{1,4}:){1,4}(:[0-9a-fA-F]{1,4}){1,3}|([0-9a-fA-F]{1,4}:){1,3}(:[0-9a-fA-F]{1,4}){1,4}|([0-9a-fA-F]{1,4}:){1,2}(:[0-9a-fA-F]{1,4}){1,5}|[0-9a-fA-F]{1,4}:((:[0-9a-fA-F]{1,4}){1,6})|:((:[0-9a-fA-F]{1,4}){1,7}|:)|fe80:(:[0-9a-fA-F]{0,4}){0,4}%[0-9a-zA-Z]{1,}|::(ffff(:0{1,4}){0,1}:){0,1}((25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9])\.){3,3}(25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9])|([0-9a-fA-F]{1,4}:){1,4}:((25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9])\.){3,3}(25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9]))$/, Be = /^(([0-9a-fA-F]{1,4}:){7,7}[0-9a-fA-F]{1,4}|([0-9a-fA-F]{1,4}:){1,7}:|([0-9a-fA-F]{1,4}:){1,6}:[0-9a-fA-F]{1,4}|([0-9a-fA-F]{1,4}:){1,5}(:[0-9a-fA-F]{1,4}){1,2}|([0-9a-fA-F]{1,4}:){1,4}(:[0-9a-fA-F]{1,4}){1,3}|([0-9a-fA-F]{1,4}:){1,3}(:[0-9a-fA-F]{1,4}){1,4}|([0-9a-fA-F]{1,4}:){1,2}(:[0-9a-fA-F]{1,4}){1,5}|[0-9a-fA-F]{1,4}:((:[0-9a-fA-F]{1,4}){1,6})|:((:[0-9a-fA-F]{1,4}){1,7}|:)|fe80:(:[0-9a-fA-F]{0,4}){0,4}%[0-9a-zA-Z]{1,}|::(ffff(:0{1,4}){0,1}:){0,1}((25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9])\.){3,3}(25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9])|([0-9a-fA-F]{1,4}:){1,4}:((25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9])\.){3,3}(25[0-5]|(2[0-4]|1{0,1}[0-9]){0,1}[0-9]))\/(12[0-8]|1[01][0-9]|[1-9]?[0-9])$/, Ve = /^([0-9a-zA-Z+/]{4})*(([0-9a-zA-Z+/]{2}==)|([0-9a-zA-Z+/]{3}=))?$/, He = /^([0-9a-zA-Z-_]{4})*(([0-9a-zA-Z-_]{2}(==)?)|([0-9a-zA-Z-_]{3}(=)?))?$/, Ue = "((\\d\\d[2468][048]|\\d\\d[13579][26]|\\d\\d0[48]|[02468][048]00|[13579][26]00)-02-29|\\d{4}-((0[13578]|1[02])-(0[1-9]|[12]\\d|3[01])|(0[469]|11)-(0[1-9]|[12]\\d|30)|(02)-(0[1-9]|1\\d|2[0-8])))", We = RegExp(`^${Ue}$`);
+function Ge(e) {
 	let t = "[0-5]\\d";
 	e.precision ? t = `${t}\\.\\d{${e.precision}}` : e.precision ?? (t = `${t}(\\.\\d+)?`);
 	let n = e.precision ? "+" : "?";
 	return `([01]\\d|2[0-3]):[0-5]\\d(:${t})${n}`;
 }
-function Ge(e) {
-	return RegExp(`^${We(e)}$`);
-}
 function Ke(e) {
-	let t = `${He}T${We(e)}`, n = [];
-	return n.push(e.local ? "Z?" : "Z"), e.offset && n.push("([+-]\\d{2}:?\\d{2})"), t = `${t}(${n.join("|")})`, RegExp(`^${t}$`);
+	return RegExp(`^${Ge(e)}$`);
 }
-function qe(e, t) {
-	return !((t !== "v4" && t || !Ie.test(e)) && (t !== "v6" && t || !Re.test(e)));
+function qe(e) {
+	let t = `${Ue}T${Ge(e)}`, n = [];
+	return n.push(e.local ? "Z?" : "Z"), e.offset && n.push("([+-]\\d{2}:?\\d{2})"), t = `${t}(${n.join("|")})`, RegExp(`^${t}$`);
 }
 function Je(e, t) {
-	if (!je.test(e)) return !1;
+	return !((t !== "v4" && t || !Le.test(e)) && (t !== "v6" && t || !ze.test(e)));
+}
+function Ye(e, t) {
+	if (!Me.test(e)) return !1;
 	try {
 		let [n] = e.split(".");
 		if (!n) return !1;
@@ -1502,21 +1502,21 @@ function Je(e, t) {
 		return !1;
 	}
 }
-function Ye(e, t) {
-	return !((t !== "v4" && t || !Le.test(e)) && (t !== "v6" && t || !ze.test(e)));
+function Xe(e, t) {
+	return !((t !== "v4" && t || !Re.test(e)) && (t !== "v6" && t || !Be.test(e)));
 }
-var Xe = class e extends C {
+var Ze = class e extends S {
 	_parse(e) {
 		if (this._def.coerce && (e.data = String(e.data)), this._getType(e) !== u.string) {
 			let t = this._getOrReturnCtx(e);
-			return h(t, {
+			return m(t, {
 				code: f.invalid_type,
 				expected: u.string,
 				received: t.parsedType
-			}), _;
+			}), g;
 		}
-		let t = new g(), n;
-		for (let r of this._def.checks) if (r.kind === "min") e.data.length < r.value && (n = this._getOrReturnCtx(e, n), h(n, {
+		let t = new h(), n;
+		for (let r of this._def.checks) if (r.kind === "min") e.data.length < r.value && (n = this._getOrReturnCtx(e, n), m(n, {
 			code: f.too_small,
 			minimum: r.value,
 			type: "string",
@@ -1524,7 +1524,7 @@ var Xe = class e extends C {
 			exact: !1,
 			message: r.message
 		}), t.dirty());
-		else if (r.kind === "max") e.data.length > r.value && (n = this._getOrReturnCtx(e, n), h(n, {
+		else if (r.kind === "max") e.data.length > r.value && (n = this._getOrReturnCtx(e, n), m(n, {
 			code: f.too_big,
 			maximum: r.value,
 			type: "string",
@@ -1534,14 +1534,14 @@ var Xe = class e extends C {
 		}), t.dirty());
 		else if (r.kind === "length") {
 			let i = e.data.length > r.value, a = e.data.length < r.value;
-			(i || a) && (n = this._getOrReturnCtx(e, n), i ? h(n, {
+			(i || a) && (n = this._getOrReturnCtx(e, n), i ? m(n, {
 				code: f.too_big,
 				maximum: r.value,
 				type: "string",
 				inclusive: !0,
 				exact: !0,
 				message: r.message
-			}) : a && h(n, {
+			}) : a && m(n, {
 				code: f.too_small,
 				minimum: r.value,
 				type: "string",
@@ -1549,37 +1549,37 @@ var Xe = class e extends C {
 				exact: !0,
 				message: r.message
 			}), t.dirty());
-		} else if (r.kind === "email") Ne.test(e.data) || (n = this._getOrReturnCtx(e, n), h(n, {
+		} else if (r.kind === "email") Pe.test(e.data) || (n = this._getOrReturnCtx(e, n), m(n, {
 			validation: "email",
 			code: f.invalid_string,
 			message: r.message
 		}), t.dirty());
-		else if (r.kind === "emoji") Fe ||= new RegExp(Pe, "u"), Fe.test(e.data) || (n = this._getOrReturnCtx(e, n), h(n, {
+		else if (r.kind === "emoji") Ie ||= new RegExp(Fe, "u"), Ie.test(e.data) || (n = this._getOrReturnCtx(e, n), m(n, {
 			validation: "emoji",
 			code: f.invalid_string,
 			message: r.message
 		}), t.dirty());
-		else if (r.kind === "uuid") ke.test(e.data) || (n = this._getOrReturnCtx(e, n), h(n, {
+		else if (r.kind === "uuid") Ae.test(e.data) || (n = this._getOrReturnCtx(e, n), m(n, {
 			validation: "uuid",
 			code: f.invalid_string,
 			message: r.message
 		}), t.dirty());
-		else if (r.kind === "nanoid") Ae.test(e.data) || (n = this._getOrReturnCtx(e, n), h(n, {
+		else if (r.kind === "nanoid") je.test(e.data) || (n = this._getOrReturnCtx(e, n), m(n, {
 			validation: "nanoid",
 			code: f.invalid_string,
 			message: r.message
 		}), t.dirty());
-		else if (r.kind === "cuid") Ee.test(e.data) || (n = this._getOrReturnCtx(e, n), h(n, {
+		else if (r.kind === "cuid") De.test(e.data) || (n = this._getOrReturnCtx(e, n), m(n, {
 			validation: "cuid",
 			code: f.invalid_string,
 			message: r.message
 		}), t.dirty());
-		else if (r.kind === "cuid2") De.test(e.data) || (n = this._getOrReturnCtx(e, n), h(n, {
+		else if (r.kind === "cuid2") Oe.test(e.data) || (n = this._getOrReturnCtx(e, n), m(n, {
 			validation: "cuid2",
 			code: f.invalid_string,
 			message: r.message
 		}), t.dirty());
-		else if (r.kind === "ulid") Oe.test(e.data) || (n = this._getOrReturnCtx(e, n), h(n, {
+		else if (r.kind === "ulid") ke.test(e.data) || (n = this._getOrReturnCtx(e, n), m(n, {
 			validation: "ulid",
 			code: f.invalid_string,
 			message: r.message
@@ -1587,64 +1587,64 @@ var Xe = class e extends C {
 		else if (r.kind === "url") try {
 			new URL(e.data);
 		} catch {
-			n = this._getOrReturnCtx(e, n), h(n, {
+			n = this._getOrReturnCtx(e, n), m(n, {
 				validation: "url",
 				code: f.invalid_string,
 				message: r.message
 			}), t.dirty();
 		}
-		else r.kind === "regex" ? (r.regex.lastIndex = 0, r.regex.test(e.data) || (n = this._getOrReturnCtx(e, n), h(n, {
+		else r.kind === "regex" ? (r.regex.lastIndex = 0, r.regex.test(e.data) || (n = this._getOrReturnCtx(e, n), m(n, {
 			validation: "regex",
 			code: f.invalid_string,
 			message: r.message
-		}), t.dirty())) : r.kind === "trim" ? e.data = e.data.trim() : r.kind === "includes" ? e.data.includes(r.value, r.position) || (n = this._getOrReturnCtx(e, n), h(n, {
+		}), t.dirty())) : r.kind === "trim" ? e.data = e.data.trim() : r.kind === "includes" ? e.data.includes(r.value, r.position) || (n = this._getOrReturnCtx(e, n), m(n, {
 			code: f.invalid_string,
 			validation: {
 				includes: r.value,
 				position: r.position
 			},
 			message: r.message
-		}), t.dirty()) : r.kind === "toLowerCase" ? e.data = e.data.toLowerCase() : r.kind === "toUpperCase" ? e.data = e.data.toUpperCase() : r.kind === "startsWith" ? e.data.startsWith(r.value) || (n = this._getOrReturnCtx(e, n), h(n, {
+		}), t.dirty()) : r.kind === "toLowerCase" ? e.data = e.data.toLowerCase() : r.kind === "toUpperCase" ? e.data = e.data.toUpperCase() : r.kind === "startsWith" ? e.data.startsWith(r.value) || (n = this._getOrReturnCtx(e, n), m(n, {
 			code: f.invalid_string,
 			validation: { startsWith: r.value },
 			message: r.message
-		}), t.dirty()) : r.kind === "endsWith" ? e.data.endsWith(r.value) || (n = this._getOrReturnCtx(e, n), h(n, {
+		}), t.dirty()) : r.kind === "endsWith" ? e.data.endsWith(r.value) || (n = this._getOrReturnCtx(e, n), m(n, {
 			code: f.invalid_string,
 			validation: { endsWith: r.value },
 			message: r.message
-		}), t.dirty()) : r.kind === "datetime" ? Ke(r).test(e.data) || (n = this._getOrReturnCtx(e, n), h(n, {
+		}), t.dirty()) : r.kind === "datetime" ? qe(r).test(e.data) || (n = this._getOrReturnCtx(e, n), m(n, {
 			code: f.invalid_string,
 			validation: "datetime",
 			message: r.message
-		}), t.dirty()) : r.kind === "date" ? Ue.test(e.data) || (n = this._getOrReturnCtx(e, n), h(n, {
+		}), t.dirty()) : r.kind === "date" ? We.test(e.data) || (n = this._getOrReturnCtx(e, n), m(n, {
 			code: f.invalid_string,
 			validation: "date",
 			message: r.message
-		}), t.dirty()) : r.kind === "time" ? Ge(r).test(e.data) || (n = this._getOrReturnCtx(e, n), h(n, {
+		}), t.dirty()) : r.kind === "time" ? Ke(r).test(e.data) || (n = this._getOrReturnCtx(e, n), m(n, {
 			code: f.invalid_string,
 			validation: "time",
 			message: r.message
-		}), t.dirty()) : r.kind === "duration" ? Me.test(e.data) || (n = this._getOrReturnCtx(e, n), h(n, {
+		}), t.dirty()) : r.kind === "duration" ? Ne.test(e.data) || (n = this._getOrReturnCtx(e, n), m(n, {
 			validation: "duration",
 			code: f.invalid_string,
 			message: r.message
-		}), t.dirty()) : r.kind === "ip" ? qe(e.data, r.version) || (n = this._getOrReturnCtx(e, n), h(n, {
+		}), t.dirty()) : r.kind === "ip" ? Je(e.data, r.version) || (n = this._getOrReturnCtx(e, n), m(n, {
 			validation: "ip",
 			code: f.invalid_string,
 			message: r.message
-		}), t.dirty()) : r.kind === "jwt" ? Je(e.data, r.alg) || (n = this._getOrReturnCtx(e, n), h(n, {
+		}), t.dirty()) : r.kind === "jwt" ? Ye(e.data, r.alg) || (n = this._getOrReturnCtx(e, n), m(n, {
 			validation: "jwt",
 			code: f.invalid_string,
 			message: r.message
-		}), t.dirty()) : r.kind === "cidr" ? Ye(e.data, r.version) || (n = this._getOrReturnCtx(e, n), h(n, {
+		}), t.dirty()) : r.kind === "cidr" ? Xe(e.data, r.version) || (n = this._getOrReturnCtx(e, n), m(n, {
 			validation: "cidr",
 			code: f.invalid_string,
 			message: r.message
-		}), t.dirty()) : r.kind === "base64" ? Be.test(e.data) || (n = this._getOrReturnCtx(e, n), h(n, {
+		}), t.dirty()) : r.kind === "base64" ? Ve.test(e.data) || (n = this._getOrReturnCtx(e, n), m(n, {
 			validation: "base64",
 			code: f.invalid_string,
 			message: r.message
-		}), t.dirty()) : r.kind === "base64url" ? Ve.test(e.data) || (n = this._getOrReturnCtx(e, n), h(n, {
+		}), t.dirty()) : r.kind === "base64url" ? He.test(e.data) || (n = this._getOrReturnCtx(e, n), m(n, {
 			validation: "base64url",
 			code: f.invalid_string,
 			message: r.message
@@ -1658,7 +1658,7 @@ var Xe = class e extends C {
 		return this.refinement((t) => e.test(t), {
 			validation: t,
 			code: f.invalid_string,
-			...b.errToObj(n)
+			...y.errToObj(n)
 		});
 	}
 	_addCheck(t) {
@@ -1670,79 +1670,79 @@ var Xe = class e extends C {
 	email(e) {
 		return this._addCheck({
 			kind: "email",
-			...b.errToObj(e)
+			...y.errToObj(e)
 		});
 	}
 	url(e) {
 		return this._addCheck({
 			kind: "url",
-			...b.errToObj(e)
+			...y.errToObj(e)
 		});
 	}
 	emoji(e) {
 		return this._addCheck({
 			kind: "emoji",
-			...b.errToObj(e)
+			...y.errToObj(e)
 		});
 	}
 	uuid(e) {
 		return this._addCheck({
 			kind: "uuid",
-			...b.errToObj(e)
+			...y.errToObj(e)
 		});
 	}
 	nanoid(e) {
 		return this._addCheck({
 			kind: "nanoid",
-			...b.errToObj(e)
+			...y.errToObj(e)
 		});
 	}
 	cuid(e) {
 		return this._addCheck({
 			kind: "cuid",
-			...b.errToObj(e)
+			...y.errToObj(e)
 		});
 	}
 	cuid2(e) {
 		return this._addCheck({
 			kind: "cuid2",
-			...b.errToObj(e)
+			...y.errToObj(e)
 		});
 	}
 	ulid(e) {
 		return this._addCheck({
 			kind: "ulid",
-			...b.errToObj(e)
+			...y.errToObj(e)
 		});
 	}
 	base64(e) {
 		return this._addCheck({
 			kind: "base64",
-			...b.errToObj(e)
+			...y.errToObj(e)
 		});
 	}
 	base64url(e) {
 		return this._addCheck({
 			kind: "base64url",
-			...b.errToObj(e)
+			...y.errToObj(e)
 		});
 	}
 	jwt(e) {
 		return this._addCheck({
 			kind: "jwt",
-			...b.errToObj(e)
+			...y.errToObj(e)
 		});
 	}
 	ip(e) {
 		return this._addCheck({
 			kind: "ip",
-			...b.errToObj(e)
+			...y.errToObj(e)
 		});
 	}
 	cidr(e) {
 		return this._addCheck({
 			kind: "cidr",
-			...b.errToObj(e)
+			...y.errToObj(e)
 		});
 	}
 	datetime(e) {
@@ -1757,7 +1757,7 @@ var Xe = class e extends C {
 			precision: e?.precision === void 0 ? null : e?.precision,
 			offset: e?.offset ?? !1,
 			local: e?.local ?? !1,
-			...b.errToObj(e?.message)
+			...y.errToObj(e?.message)
 		});
 	}
 	date(e) {
@@ -1774,20 +1774,20 @@ var Xe = class e extends C {
 		}) : this._addCheck({
 			kind: "time",
 			precision: e?.precision === void 0 ? null : e?.precision,
-			...b.errToObj(e?.message)
+			...y.errToObj(e?.message)
 		});
 	}
 	duration(e) {
 		return this._addCheck({
 			kind: "duration",
-			...b.errToObj(e)
+			...y.errToObj(e)
 		});
 	}
 	regex(e, t) {
 		return this._addCheck({
 			kind: "regex",
 			regex: e,
-			...b.errToObj(t)
+			...y.errToObj(t)
 		});
 	}
 	includes(e, t) {
@@ -1795,46 +1795,46 @@ var Xe = class e extends C {
 			kind: "includes",
 			value: e,
 			position: t?.position,
-			...b.errToObj(t?.message)
+			...y.errToObj(t?.message)
 		});
 	}
 	startsWith(e, t) {
 		return this._addCheck({
 			kind: "startsWith",
 			value: e,
-			...b.errToObj(t)
+			...y.errToObj(t)
 		});
 	}
 	endsWith(e, t) {
 		return this._addCheck({
 			kind: "endsWith",
 			value: e,
-			...b.errToObj(t)
+			...y.errToObj(t)
 		});
 	}
 	min(e, t) {
 		return this._addCheck({
 			kind: "min",
 			value: e,
-			...b.errToObj(t)
+			...y.errToObj(t)
 		});
 	}
 	max(e, t) {
 		return this._addCheck({
 			kind: "max",
 			value: e,
-			...b.errToObj(t)
+			...y.errToObj(t)
 		});
 	}
 	length(e, t) {
 		return this._addCheck({
 			kind: "length",
 			value: e,
-			...b.errToObj(t)
+			...y.errToObj(t)
 		});
 	}
 	nonempty(e) {
-		return this.min(1, b.errToObj(e));
+		return this.min(1, y.errToObj(e));
 	}
 	trim() {
 		return new e({
@@ -1913,54 +1913,54 @@ var Xe = class e extends C {
 		return e;
 	}
 };
-Xe.create = (e) => new Xe({
+Ze.create = (e) => new Ze({
 	checks: [],
-	typeName: F.ZodString,
+	typeName: P.ZodString,
 	coerce: e?.coerce ?? !1,
-	...S(e)
+	...x(e)
 });
-function Ze(e, t) {
+function Qe(e, t) {
 	let n = (e.toString().split(".")[1] || "").length, r = (t.toString().split(".")[1] || "").length, i = n > r ? n : r;
 	return Number.parseInt(e.toFixed(i).replace(".", "")) % Number.parseInt(t.toFixed(i).replace(".", "")) / 10 ** i;
 }
-var Qe = class e extends C {
+var $e = class e extends S {
 	constructor() {
 		super(...arguments), this.min = this.gte, this.max = this.lte, this.step = this.multipleOf;
 	}
 	_parse(e) {
 		if (this._def.coerce && (e.data = Number(e.data)), this._getType(e) !== u.number) {
 			let t = this._getOrReturnCtx(e);
-			return h(t, {
+			return m(t, {
 				code: f.invalid_type,
 				expected: u.number,
 				received: t.parsedType
-			}), _;
+			}), g;
 		}
-		let t, n = new g();
-		for (let r of this._def.checks) r.kind === "int" ? l.isInteger(e.data) || (t = this._getOrReturnCtx(e, t), h(t, {
+		let t, n = new h();
+		for (let r of this._def.checks) r.kind === "int" ? l.isInteger(e.data) || (t = this._getOrReturnCtx(e, t), m(t, {
 			code: f.invalid_type,
 			expected: "integer",
 			received: "float",
 			message: r.message
-		}), n.dirty()) : r.kind === "min" ? (r.inclusive ? e.data < r.value : e.data <= r.value) && (t = this._getOrReturnCtx(e, t), h(t, {
+		}), n.dirty()) : r.kind === "min" ? (r.inclusive ? e.data < r.value : e.data <= r.value) && (t = this._getOrReturnCtx(e, t), m(t, {
 			code: f.too_small,
 			minimum: r.value,
 			type: "number",
 			inclusive: r.inclusive,
 			exact: !1,
 			message: r.message
-		}), n.dirty()) : r.kind === "max" ? (r.inclusive ? e.data > r.value : e.data >= r.value) && (t = this._getOrReturnCtx(e, t), h(t, {
+		}), n.dirty()) : r.kind === "max" ? (r.inclusive ? e.data > r.value : e.data >= r.value) && (t = this._getOrReturnCtx(e, t), m(t, {
 			code: f.too_big,
 			maximum: r.value,
 			type: "number",
 			inclusive: r.inclusive,
 			exact: !1,
 			message: r.message
-		}), n.dirty()) : r.kind === "multipleOf" ? Ze(e.data, r.value) !== 0 && (t = this._getOrReturnCtx(e, t), h(t, {
+		}), n.dirty()) : r.kind === "multipleOf" ? Qe(e.data, r.value) !== 0 && (t = this._getOrReturnCtx(e, t), m(t, {
 			code: f.not_multiple_of,
 			multipleOf: r.value,
 			message: r.message
-		}), n.dirty()) : r.kind === "finite" ? Number.isFinite(e.data) || (t = this._getOrReturnCtx(e, t), h(t, {
+		}), n.dirty()) : r.kind === "finite" ? Number.isFinite(e.data) || (t = this._getOrReturnCtx(e, t), m(t, {
 			code: f.not_finite,
 			message: r.message
 		}), n.dirty()) : l.assertNever(r);
@@ -1970,16 +1970,16 @@ var Qe = class e extends C {
 		};
 	}
 	gte(e, t) {
-		return this.setLimit("min", e, !0, b.toString(t));
+		return this.setLimit("min", e, !0, y.toString(t));
 	}
 	gt(e, t) {
-		return this.setLimit("min", e, !1, b.toString(t));
+		return this.setLimit("min", e, !1, y.toString(t));
 	}
 	lte(e, t) {
-		return this.setLimit("max", e, !0, b.toString(t));
+		return this.setLimit("max", e, !0, y.toString(t));
 	}
 	lt(e, t) {
-		return this.setLimit("max", e, !1, b.toString(t));
+		return this.setLimit("max", e, !1, y.toString(t));
 	}
 	setLimit(t, n, r, i) {
 		return new e({
@@ -1988,7 +1988,7 @@ var Qe = class e extends C {
 				kind: t,
 				value: n,
 				inclusive: r,
-				message: b.toString(i)
+				message: y.toString(i)
 			}]
 		});
 	}
@@ -2001,7 +2001,7 @@ var Qe = class e extends C {
 	int(e) {
 		return this._addCheck({
 			kind: "int",
-			message: b.toString(e)
+			message: y.toString(e)
 		});
 	}
 	positive(e) {
@@ -2009,7 +2009,7 @@ var Qe = class e extends C {
 			kind: "min",
 			value: 0,
 			inclusive: !1,
-			message: b.toString(e)
+			message: y.toString(e)
 		});
 	}
 	negative(e) {
@@ -2017,7 +2017,7 @@ var Qe = class e extends C {
 			kind: "max",
 			value: 0,
 			inclusive: !1,
-			message: b.toString(e)
+			message: y.toString(e)
 		});
 	}
 	nonpositive(e) {
@@ -2025,7 +2025,7 @@ var Qe = class e extends C {
 			kind: "max",
 			value: 0,
 			inclusive: !0,
-			message: b.toString(e)
+			message: y.toString(e)
 		});
 	}
 	nonnegative(e) {
@@ -2033,20 +2033,20 @@ var Qe = class e extends C {
 			kind: "min",
 			value: 0,
 			inclusive: !0,
-			message: b.toString(e)
+			message: y.toString(e)
 		});
 	}
 	multipleOf(e, t) {
 		return this._addCheck({
 			kind: "multipleOf",
 			value: e,
-			message: b.toString(t)
+			message: y.toString(t)
 		});
 	}
 	finite(e) {
 		return this._addCheck({
 			kind: "finite",
-			message: b.toString(e)
+			message: y.toString(e)
 		});
 	}
 	safe(e) {
@@ -2054,12 +2054,12 @@ var Qe = class e extends C {
 			kind: "min",
 			inclusive: !0,
 			value: -(2 ** 53 - 1),
-			message: b.toString(e)
+			message: y.toString(e)
 		})._addCheck({
 			kind: "max",
 			inclusive: !0,
 			value: 2 ** 53 - 1,
-			message: b.toString(e)
+			message: y.toString(e)
 		});
 	}
 	get minValue() {
@@ -2082,13 +2082,13 @@ var Qe = class e extends C {
 		return Number.isFinite(t) && Number.isFinite(e);
 	}
 };
-Qe.create = (e) => new Qe({
+$e.create = (e) => new $e({
 	checks: [],
-	typeName: F.ZodNumber,
+	typeName: P.ZodNumber,
 	coerce: e?.coerce || !1,
-	...S(e)
+	...x(e)
 });
-var $e = class e extends C {
+var et = class e extends S {
 	constructor() {
 		super(...arguments), this.min = this.gte, this.max = this.lte;
 	}
@@ -2099,20 +2099,20 @@ var $e = class e extends C {
 			return this._getInvalidInput(e);
 		}
 		if (this._getType(e) !== u.bigint) return this._getInvalidInput(e);
-		let t, n = new g();
-		for (let r of this._def.checks) r.kind === "min" ? (r.inclusive ? e.data < r.value : e.data <= r.value) && (t = this._getOrReturnCtx(e, t), h(t, {
+		let t, n = new h();
+		for (let r of this._def.checks) r.kind === "min" ? (r.inclusive ? e.data < r.value : e.data <= r.value) && (t = this._getOrReturnCtx(e, t), m(t, {
 			code: f.too_small,
 			type: "bigint",
 			minimum: r.value,
 			inclusive: r.inclusive,
 			message: r.message
-		}), n.dirty()) : r.kind === "max" ? (r.inclusive ? e.data > r.value : e.data >= r.value) && (t = this._getOrReturnCtx(e, t), h(t, {
+		}), n.dirty()) : r.kind === "max" ? (r.inclusive ? e.data > r.value : e.data >= r.value) && (t = this._getOrReturnCtx(e, t), m(t, {
 			code: f.too_big,
 			type: "bigint",
 			maximum: r.value,
 			inclusive: r.inclusive,
 			message: r.message
-		}), n.dirty()) : r.kind === "multipleOf" ? e.data % r.value !== BigInt(0) && (t = this._getOrReturnCtx(e, t), h(t, {
+		}), n.dirty()) : r.kind === "multipleOf" ? e.data % r.value !== BigInt(0) && (t = this._getOrReturnCtx(e, t), m(t, {
 			code: f.not_multiple_of,
 			multipleOf: r.value,
 			message: r.message
@@ -2124,23 +2124,23 @@ var $e = class e extends C {
 	}
 	_getInvalidInput(e) {
 		let t = this._getOrReturnCtx(e);
-		return h(t, {
+		return m(t, {
 			code: f.invalid_type,
 			expected: u.bigint,
 			received: t.parsedType
-		}), _;
+		}), g;
 	}
 	gte(e, t) {
-		return this.setLimit("min", e, !0, b.toString(t));
+		return this.setLimit("min", e, !0, y.toString(t));
 	}
 	gt(e, t) {
-		return this.setLimit("min", e, !1, b.toString(t));
+		return this.setLimit("min", e, !1, y.toString(t));
 	}
 	lte(e, t) {
-		return this.setLimit("max", e, !0, b.toString(t));
+		return this.setLimit("max", e, !0, y.toString(t));
 	}
 	lt(e, t) {
-		return this.setLimit("max", e, !1, b.toString(t));
+		return this.setLimit("max", e, !1, y.toString(t));
 	}
 	setLimit(t, n, r, i) {
 		return new e({
@@ -2149,7 +2149,7 @@ var $e = class e extends C {
 				kind: t,
 				value: n,
 				inclusive: r,
-				message: b.toString(i)
+				message: y.toString(i)
 			}]
 		});
 	}
@@ -2164,7 +2164,7 @@ var $e = class e extends C {
 			kind: "min",
 			value: BigInt(0),
 			inclusive: !1,
-			message: b.toString(e)
+			message: y.toString(e)
 		});
 	}
 	negative(e) {
@@ -2172,7 +2172,7 @@ var $e = class e extends C {
 			kind: "max",
 			value: BigInt(0),
 			inclusive: !1,
-			message: b.toString(e)
+			message: y.toString(e)
 		});
 	}
 	nonpositive(e) {
@@ -2180,7 +2180,7 @@ var $e = class e extends C {
 			kind: "max",
 			value: BigInt(0),
 			inclusive: !0,
-			message: b.toString(e)
+			message: y.toString(e)
 		});
 	}
 	nonnegative(e) {
@@ -2188,14 +2188,14 @@ var $e = class e extends C {
 			kind: "min",
 			value: BigInt(0),
 			inclusive: !0,
-			message: b.toString(e)
+			message: y.toString(e)
 		});
 	}
 	multipleOf(e, t) {
 		return this._addCheck({
 			kind: "multipleOf",
 			value: e,
-			message: b.toString(t)
+			message: y.toString(t)
 		});
 	}
 	get minValue() {
@@ -2209,50 +2209,50 @@ var $e = class e extends C {
 		return e;
 	}
 };
-$e.create = (e) => new $e({
+et.create = (e) => new et({
 	checks: [],
-	typeName: F.ZodBigInt,
+	typeName: P.ZodBigInt,
 	coerce: e?.coerce ?? !1,
-	...S(e)
+	...x(e)
 });
-var et = class extends C {
+var tt = class extends S {
 	_parse(e) {
 		if (this._def.coerce && (e.data = !!e.data), this._getType(e) !== u.boolean) {
 			let t = this._getOrReturnCtx(e);
-			return h(t, {
+			return m(t, {
 				code: f.invalid_type,
 				expected: u.boolean,
 				received: t.parsedType
-			}), _;
+			}), g;
 		}
-		return v(e.data);
+		return _(e.data);
 	}
 };
-et.create = (e) => new et({
-	typeName: F.ZodBoolean,
+tt.create = (e) => new tt({
+	typeName: P.ZodBoolean,
 	coerce: e?.coerce || !1,
-	...S(e)
+	...x(e)
 });
-var tt = class e extends C {
+var nt = class e extends S {
 	_parse(e) {
 		if (this._def.coerce && (e.data = new Date(e.data)), this._getType(e) !== u.date) {
 			let t = this._getOrReturnCtx(e);
-			return h(t, {
+			return m(t, {
 				code: f.invalid_type,
 				expected: u.date,
 				received: t.parsedType
-			}), _;
+			}), g;
 		}
-		if (Number.isNaN(e.data.getTime())) return h(this._getOrReturnCtx(e), { code: f.invalid_date }), _;
-		let t = new g(), n;
-		for (let r of this._def.checks) r.kind === "min" ? e.data.getTime() < r.value && (n = this._getOrReturnCtx(e, n), h(n, {
+		if (Number.isNaN(e.data.getTime())) return m(this._getOrReturnCtx(e), { code: f.invalid_date }), g;
+		let t = new h(), n;
+		for (let r of this._def.checks) r.kind === "min" ? e.data.getTime() < r.value && (n = this._getOrReturnCtx(e, n), m(n, {
 			code: f.too_small,
 			message: r.message,
 			inclusive: !0,
 			exact: !1,
 			minimum: r.value,
 			type: "date"
-		}), t.dirty()) : r.kind === "max" ? e.data.getTime() > r.value && (n = this._getOrReturnCtx(e, n), h(n, {
+		}), t.dirty()) : r.kind === "max" ? e.data.getTime() > r.value && (n = this._getOrReturnCtx(e, n), m(n, {
 			code: f.too_big,
 			message: r.message,
 			inclusive: !0,
@@ -2275,14 +2275,14 @@ var tt = class e extends C {
 		return this._addCheck({
 			kind: "min",
 			value: e.getTime(),
-			message: b.toString(t)
+			message: y.toString(t)
 		});
 	}
 	max(e, t) {
 		return this._addCheck({
 			kind: "max",
 			value: e.getTime(),
-			message: b.toString(t)
+			message: y.toString(t)
 		});
 	}
 	get minDate() {
@@ -2296,129 +2296,129 @@ var tt = class e extends C {
 		return e == null ? null : new Date(e);
 	}
 };
-tt.create = (e) => new tt({
+nt.create = (e) => new nt({
 	checks: [],
 	coerce: e?.coerce || !1,
-	typeName: F.ZodDate,
-	...S(e)
+	typeName: P.ZodDate,
+	...x(e)
 });
-var nt = class extends C {
+var rt = class extends S {
 	_parse(e) {
 		if (this._getType(e) !== u.symbol) {
 			let t = this._getOrReturnCtx(e);
-			return h(t, {
+			return m(t, {
 				code: f.invalid_type,
 				expected: u.symbol,
 				received: t.parsedType
-			}), _;
+			}), g;
 		}
-		return v(e.data);
+		return _(e.data);
 	}
 };
-nt.create = (e) => new nt({
-	typeName: F.ZodSymbol,
-	...S(e)
+rt.create = (e) => new rt({
+	typeName: P.ZodSymbol,
+	...x(e)
 });
-var rt = class extends C {
+var it = class extends S {
 	_parse(e) {
 		if (this._getType(e) !== u.undefined) {
 			let t = this._getOrReturnCtx(e);
-			return h(t, {
+			return m(t, {
 				code: f.invalid_type,
 				expected: u.undefined,
 				received: t.parsedType
-			}), _;
+			}), g;
 		}
-		return v(e.data);
+		return _(e.data);
 	}
 };
-rt.create = (e) => new rt({
-	typeName: F.ZodUndefined,
-	...S(e)
+it.create = (e) => new it({
+	typeName: P.ZodUndefined,
+	...x(e)
 });
-var it = class extends C {
+var at = class extends S {
 	_parse(e) {
 		if (this._getType(e) !== u.null) {
 			let t = this._getOrReturnCtx(e);
-			return h(t, {
+			return m(t, {
 				code: f.invalid_type,
 				expected: u.null,
 				received: t.parsedType
-			}), _;
+			}), g;
 		}
-		return v(e.data);
+		return _(e.data);
 	}
 };
-it.create = (e) => new it({
-	typeName: F.ZodNull,
-	...S(e)
+at.create = (e) => new at({
+	typeName: P.ZodNull,
+	...x(e)
 });
-var at = class extends C {
+var ot = class extends S {
 	constructor() {
 		super(...arguments), this._any = !0;
 	}
 	_parse(e) {
-		return v(e.data);
+		return _(e.data);
 	}
 };
-at.create = (e) => new at({
-	typeName: F.ZodAny,
-	...S(e)
+ot.create = (e) => new ot({
+	typeName: P.ZodAny,
+	...x(e)
 });
-var w = class extends C {
+var C = class extends S {
 	constructor() {
 		super(...arguments), this._unknown = !0;
 	}
 	_parse(e) {
-		return v(e.data);
+		return _(e.data);
 	}
 };
-w.create = (e) => new w({
-	typeName: F.ZodUnknown,
-	...S(e)
+C.create = (e) => new C({
+	typeName: P.ZodUnknown,
+	...x(e)
 });
-var T = class extends C {
+var w = class extends S {
 	_parse(e) {
 		let t = this._getOrReturnCtx(e);
-		return h(t, {
+		return m(t, {
 			code: f.invalid_type,
 			expected: u.never,
 			received: t.parsedType
-		}), _;
+		}), g;
 	}
 };
-T.create = (e) => new T({
-	typeName: F.ZodNever,
-	...S(e)
+w.create = (e) => new w({
+	typeName: P.ZodNever,
+	...x(e)
 });
-var ot = class extends C {
+var st = class extends S {
 	_parse(e) {
 		if (this._getType(e) !== u.undefined) {
 			let t = this._getOrReturnCtx(e);
-			return h(t, {
+			return m(t, {
 				code: f.invalid_type,
 				expected: u.void,
 				received: t.parsedType
-			}), _;
+			}), g;
 		}
-		return v(e.data);
+		return _(e.data);
 	}
 };
-ot.create = (e) => new ot({
-	typeName: F.ZodVoid,
-	...S(e)
+st.create = (e) => new st({
+	typeName: P.ZodVoid,
+	...x(e)
 });
-var E = class e extends C {
+var T = class e extends S {
 	_parse(e) {
 		let { ctx: t, status: n } = this._processInputParams(e), r = this._def;
-		if (t.parsedType !== u.array) return h(t, {
+		if (t.parsedType !== u.array) return m(t, {
 			code: f.invalid_type,
 			expected: u.array,
 			received: t.parsedType
-		}), _;
+		}), g;
 		if (r.exactLength !== null) {
 			let e = t.data.length > r.exactLength.value, i = t.data.length < r.exactLength.value;
-			(e || i) && (h(t, {
+			(e || i) && (m(t, {
 				code: e ? f.too_big : f.too_small,
 				minimum: i ? r.exactLength.value : void 0,
 				maximum: e ? r.exactLength.value : void 0,
@@ -2428,23 +2428,23 @@ var E = class e extends C {
 				message: r.exactLength.message
 			}), n.dirty());
 		}
-		if (r.minLength !== null && t.data.length < r.minLength.value && (h(t, {
+		if (r.minLength !== null && t.data.length < r.minLength.value && (m(t, {
 			code: f.too_small,
 			minimum: r.minLength.value,
 			type: "array",
 			inclusive: !0,
 			exact: !1,
 			message: r.minLength.message
-		}), n.dirty()), r.maxLength !== null && t.data.length > r.maxLength.value && (h(t, {
+		}), n.dirty()), r.maxLength !== null && t.data.length > r.maxLength.value && (m(t, {
 			code: f.too_big,
 			maximum: r.maxLength.value,
 			type: "array",
 			inclusive: !0,
 			exact: !1,
 			message: r.maxLength.message
-		}), n.dirty()), t.common.async) return Promise.all([...t.data].map((e, n) => r.type._parseAsync(new x(t, e, t.path, n)))).then((e) => g.mergeArray(n, e));
-		let i = [...t.data].map((e, n) => r.type._parseSync(new x(t, e, t.path, n)));
-		return g.mergeArray(n, i);
+		}), n.dirty()), t.common.async) return Promise.all([...t.data].map((e, n) => r.type._parseAsync(new b(t, e, t.path, n)))).then((e) => h.mergeArray(n, e));
+		let i = [...t.data].map((e, n) => r.type._parseSync(new b(t, e, t.path, n)));
+		return h.mergeArray(n, i);
 	}
 	get element() {
 		return this._def.type;
@@ -2454,7 +2454,7 @@ var E = class e extends C {
 			...this._def,
 			minLength: {
 				value: t,
-				message: b.toString(n)
+				message: y.toString(n)
 			}
 		});
 	}
@@ -2463,7 +2463,7 @@ var E = class e extends C {
 			...this._def,
 			maxLength: {
 				value: t,
-				message: b.toString(n)
+				message: y.toString(n)
 			}
 		});
 	}
@@ -2472,7 +2472,7 @@ var E = class e extends C {
 			...this._def,
 			exactLength: {
 				value: t,
-				message: b.toString(n)
+				message: y.toString(n)
 			}
 		});
 	}
@@ -2480,32 +2480,32 @@ var E = class e extends C {
 		return this.min(1, e);
 	}
 };
-E.create = (e, t) => new E({
+T.create = (e, t) => new T({
 	type: e,
 	minLength: null,
 	maxLength: null,
 	exactLength: null,
-	typeName: F.ZodArray,
-	...S(t)
+	typeName: P.ZodArray,
+	...x(t)
 });
-function D(e) {
-	if (e instanceof O) {
+function E(e) {
+	if (e instanceof D) {
 		let t = {};
 		for (let n in e.shape) {
 			let r = e.shape[n];
-			t[n] = N.create(D(r));
+			t[n] = M.create(E(r));
 		}
-		return new O({
+		return new D({
 			...e._def,
 			shape: () => t
 		});
 	}
-	return e instanceof E ? new E({
+	return e instanceof T ? new T({
 		...e._def,
-		type: D(e.element)
-	}) : e instanceof N ? N.create(D(e.unwrap())) : e instanceof P ? P.create(D(e.unwrap())) : e instanceof A ? A.create(e.items.map((e) => D(e))) : e;
+		type: E(e.element)
+	}) : e instanceof M ? M.create(E(e.unwrap())) : e instanceof N ? N.create(E(e.unwrap())) : e instanceof k ? k.create(e.items.map((e) => E(e))) : e;
 }
-var O = class e extends C {
+var D = class e extends S {
 	constructor() {
 		super(...arguments), this._cached = null, this.nonstrict = this.passthrough, this.augment = this.extend;
 	}
@@ -2520,14 +2520,14 @@ var O = class e extends C {
 	_parse(e) {
 		if (this._getType(e) !== u.object) {
 			let t = this._getOrReturnCtx(e);
-			return h(t, {
+			return m(t, {
 				code: f.invalid_type,
 				expected: u.object,
 				received: t.parsedType
-			}), _;
+			}), g;
 		}
 		let { status: t, ctx: n } = this._processInputParams(e), { shape: r, keys: i } = this._getCached(), a = [];
-		if (!(this._def.catchall instanceof T && this._def.unknownKeys === "strip")) for (let e in n.data) i.includes(e) || a.push(e);
+		if (!(this._def.catchall instanceof w && this._def.unknownKeys === "strip")) for (let e in n.data) i.includes(e) || a.push(e);
 		let o = [];
 		for (let e of i) {
 			let t = r[e], i = n.data[e];
@@ -2536,11 +2536,11 @@ var O = class e extends C {
 					status: "valid",
 					value: e
 				},
-				value: t._parse(new x(n, i, n.path, e)),
+				value: t._parse(new b(n, i, n.path, e)),
 				alwaysSet: e in n.data
 			});
 		}
-		if (this._def.catchall instanceof T) {
+		if (this._def.catchall instanceof w) {
 			let e = this._def.unknownKeys;
 			if (e === "passthrough") for (let e of a) o.push({
 				key: {
@@ -2552,7 +2552,7 @@ var O = class e extends C {
 					value: n.data[e]
 				}
 			});
-			else if (e === "strict") a.length > 0 && (h(n, {
+			else if (e === "strict") a.length > 0 && (m(n, {
 				code: f.unrecognized_keys,
 				keys: a
 			}), t.dirty());
@@ -2566,7 +2566,7 @@ var O = class e extends C {
 						status: "valid",
 						value: t
 					},
-					value: e._parse(new x(n, r, n.path, t)),
+					value: e._parse(new b(n, r, n.path, t)),
 					alwaysSet: t in n.data
 				});
 			}
@@ -2582,18 +2582,18 @@ var O = class e extends C {
 				});
 			}
 			return e;
-		}).then((e) => g.mergeObjectSync(t, e)) : g.mergeObjectSync(t, o);
+		}).then((e) => h.mergeObjectSync(t, e)) : h.mergeObjectSync(t, o);
 	}
 	get shape() {
 		return this._def.shape();
 	}
 	strict(t) {
-		return b.errToObj, new e({
+		return y.errToObj, new e({
 			...this._def,
 			unknownKeys: "strict",
 			...t === void 0 ? {} : { errorMap: (e, n) => {
 				let r = this._def.errorMap?.(e, n).message ?? n.defaultError;
-				return e.code === "unrecognized_keys" ? { message: b.errToObj(t).message ?? r } : { message: r };
+				return e.code === "unrecognized_keys" ? { message: y.errToObj(t).message ?? r } : { message: r };
 			} }
 		});
 	}
@@ -2626,7 +2626,7 @@ var O = class e extends C {
 				...this._def.shape(),
 				...t._def.shape()
 			}),
-			typeName: F.ZodObject
+			typeName: P.ZodObject
 		});
 	}
 	setKey(e, t) {
@@ -2655,7 +2655,7 @@ var O = class e extends C {
 		});
 	}
 	deepPartial() {
-		return D(this);
+		return E(this);
 	}
 	partial(t) {
 		let n = {};
@@ -2673,7 +2673,7 @@ var O = class e extends C {
 		for (let e of l.objectKeys(this.shape)) if (t && !t[e]) n[e] = this.shape[e];
 		else {
 			let t = this.shape[e];
-			for (; t instanceof N;) t = t._def.innerType;
+			for (; t instanceof M;) t = t._def.innerType;
 			n[e] = t;
 		}
 		return new e({
@@ -2682,39 +2682,39 @@ var O = class e extends C {
 		});
 	}
 	keyof() {
-		return _t(l.objectKeys(this.shape));
+		return vt(l.objectKeys(this.shape));
 	}
 };
-O.create = (e, t) => new O({
+D.create = (e, t) => new D({
 	shape: () => e,
 	unknownKeys: "strip",
-	catchall: T.create(),
-	typeName: F.ZodObject,
-	...S(t)
-}), O.strictCreate = (e, t) => new O({
+	catchall: w.create(),
+	typeName: P.ZodObject,
+	...x(t)
+}), D.strictCreate = (e, t) => new D({
 	shape: () => e,
 	unknownKeys: "strict",
-	catchall: T.create(),
-	typeName: F.ZodObject,
-	...S(t)
-}), O.lazycreate = (e, t) => new O({
+	catchall: w.create(),
+	typeName: P.ZodObject,
+	...x(t)
+}), D.lazycreate = (e, t) => new D({
 	shape: e,
 	unknownKeys: "strip",
-	catchall: T.create(),
-	typeName: F.ZodObject,
-	...S(t)
+	catchall: w.create(),
+	typeName: P.ZodObject,
+	...x(t)
 });
-var st = class extends C {
+var ct = class extends S {
 	_parse(e) {
 		let { ctx: t } = this._processInputParams(e), n = this._def.options;
 		function r(e) {
 			for (let t of e) if (t.result.status === "valid") return t.result;
 			for (let n of e) if (n.result.status === "dirty") return t.common.issues.push(...n.ctx.common.issues), n.result;
 			let n = e.map((e) => new p(e.ctx.common.issues));
-			return h(t, {
+			return m(t, {
 				code: f.invalid_union,
 				unionErrors: n
-			}), _;
+			}), g;
 		}
 		if (t.common.async) return Promise.all(n.map(async (e) => {
 			let n = {
@@ -2757,29 +2757,29 @@ var st = class extends C {
 			}
 			if (e) return t.common.issues.push(...e.ctx.common.issues), e.result;
 			let i = r.map((e) => new p(e));
-			return h(t, {
+			return m(t, {
 				code: f.invalid_union,
 				unionErrors: i
-			}), _;
+			}), g;
 		}
 	}
 	get options() {
 		return this._def.options;
 	}
 };
-st.create = (e, t) => new st({
+ct.create = (e, t) => new ct({
 	options: e,
-	typeName: F.ZodUnion,
-	...S(t)
+	typeName: P.ZodUnion,
+	...x(t)
 });
-var k = (e) => e instanceof ht ? k(e.schema) : e instanceof M ? k(e.innerType()) : e instanceof gt ? [e.value] : e instanceof vt ? e.options : e instanceof yt ? l.objectValues(e.enum) : e instanceof bt ? k(e._def.innerType) : e instanceof rt ? [void 0] : e instanceof it ? [null] : e instanceof N ? [void 0, ...k(e.unwrap())] : e instanceof P ? [null, ...k(e.unwrap())] : e instanceof Ct || e instanceof Tt ? k(e.unwrap()) : e instanceof xt ? k(e._def.innerType) : [], ct = class e extends C {
+var O = (e) => e instanceof gt ? O(e.schema) : e instanceof j ? O(e.innerType()) : e instanceof _t ? [e.value] : e instanceof yt ? e.options : e instanceof bt ? l.objectValues(e.enum) : e instanceof xt ? O(e._def.innerType) : e instanceof it ? [void 0] : e instanceof at ? [null] : e instanceof M ? [void 0, ...O(e.unwrap())] : e instanceof N ? [null, ...O(e.unwrap())] : e instanceof wt || e instanceof Et ? O(e.unwrap()) : e instanceof St ? O(e._def.innerType) : [], lt = class e extends S {
 	_parse(e) {
 		let { ctx: t } = this._processInputParams(e);
-		if (t.parsedType !== u.object) return h(t, {
+		if (t.parsedType !== u.object) return m(t, {
 			code: f.invalid_type,
 			expected: u.object,
 			received: t.parsedType
-		}), _;
+		}), g;
 		let n = this.discriminator, r = t.data[n], i = this.optionsMap.get(r);
 		return i ? t.common.async ? i._parseAsync({
 			data: t.data,
@@ -2789,11 +2789,11 @@ var k = (e) => e instanceof ht ? k(e.schema) : e instanceof M ? k(e.innerType())
 			data: t.data,
 			path: t.path,
 			parent: t
-		}) : (h(t, {
+		}) : (m(t, {
 			code: f.invalid_union_discriminator,
 			options: Array.from(this.optionsMap.keys()),
 			path: [n]
-		}), _);
+		}), g);
 	}
 	get discriminator() {
 		return this._def.discriminator;
@@ -2807,7 +2807,7 @@ var k = (e) => e instanceof ht ? k(e.schema) : e instanceof M ? k(e.innerType())
 	static create(t, n, r) {
 		let i = /* @__PURE__ */ new Map();
 		for (let e of n) {
-			let n = k(e.shape[t]);
+			let n = O(e.shape[t]);
 			if (!n.length) throw Error(`A discriminator value for key \`${t}\` could not be extracted from all schema options`);
 			for (let r of n) {
 				if (i.has(r)) throw Error(`Discriminator property ${String(t)} has duplicate value ${String(r)}`);
@@ -2815,15 +2815,15 @@ var k = (e) => e instanceof ht ? k(e.schema) : e instanceof M ? k(e.innerType())
 			}
 		}
 		return new e({
-			typeName: F.ZodDiscriminatedUnion,
+			typeName: P.ZodDiscriminatedUnion,
 			discriminator: t,
 			options: n,
 			optionsMap: i,
-			...S(r)
+			...x(r)
 		});
 	}
 };
-function lt(e, t) {
+function ut(e, t) {
 	let n = d(e), r = d(t);
 	if (e === t) return {
 		valid: !0,
@@ -2835,7 +2835,7 @@ function lt(e, t) {
 			...t
 		};
 		for (let n of r) {
-			let r = lt(e[n], t[n]);
+			let r = ut(e[n], t[n]);
 			if (!r.valid) return { valid: !1 };
 			i[n] = r.data;
 		}
@@ -2848,7 +2848,7 @@ function lt(e, t) {
 		if (e.length !== t.length) return { valid: !1 };
 		let n = [];
 		for (let r = 0; r < e.length; r++) {
-			let i = e[r], a = t[r], o = lt(i, a);
+			let i = e[r], a = t[r], o = ut(i, a);
 			if (!o.valid) return { valid: !1 };
 			n.push(o.data);
 		}
@@ -2862,15 +2862,15 @@ function lt(e, t) {
 		data: e
 	} : { valid: !1 };
 }
-var ut = class extends C {
+var dt = class extends S {
 	_parse(e) {
 		let { status: t, ctx: n } = this._processInputParams(e), r = (e, r) => {
-			if (Se(e) || Se(r)) return _;
-			let i = lt(e.value, r.value);
-			return i.valid ? ((Ce(e) || Ce(r)) && t.dirty(), {
+			if (Ce(e) || Ce(r)) return g;
+			let i = ut(e.value, r.value);
+			return i.valid ? ((we(e) || we(r)) && t.dirty(), {
 				status: t.value,
 				value: i.data
-			}) : (h(n, { code: f.invalid_intersection_types }), _);
+			}) : (m(n, { code: f.invalid_intersection_types }), g);
 		};
 		return n.common.async ? Promise.all([this._def.left._parseAsync({
 			data: n.data,
@@ -2891,28 +2891,28 @@ var ut = class extends C {
 		}));
 	}
 };
-ut.create = (e, t, n) => new ut({
+dt.create = (e, t, n) => new dt({
 	left: e,
 	right: t,
-	typeName: F.ZodIntersection,
-	...S(n)
+	typeName: P.ZodIntersection,
+	...x(n)
 });
-var A = class e extends C {
+var k = class e extends S {
 	_parse(e) {
 		let { status: t, ctx: n } = this._processInputParams(e);
-		if (n.parsedType !== u.array) return h(n, {
+		if (n.parsedType !== u.array) return m(n, {
 			code: f.invalid_type,
 			expected: u.array,
 			received: n.parsedType
-		}), _;
-		if (n.data.length < this._def.items.length) return h(n, {
+		}), g;
+		if (n.data.length < this._def.items.length) return m(n, {
 			code: f.too_small,
 			minimum: this._def.items.length,
 			inclusive: !0,
 			exact: !1,
 			type: "array"
-		}), _;
-		!this._def.rest && n.data.length > this._def.items.length && (h(n, {
+		}), g;
+		!this._def.rest && n.data.length > this._def.items.length && (m(n, {
 			code: f.too_big,
 			maximum: this._def.items.length,
 			inclusive: !0,
@@ -2921,9 +2921,9 @@ var A = class e extends C {
 		}), t.dirty());
 		let r = [...n.data].map((e, t) => {
 			let r = this._def.items[t] || this._def.rest;
-			return r ? r._parse(new x(n, e, n.path, t)) : null;
+			return r ? r._parse(new b(n, e, n.path, t)) : null;
 		}).filter((e) => !!e);
-		return n.common.async ? Promise.all(r).then((e) => g.mergeArray(t, e)) : g.mergeArray(t, r);
+		return n.common.async ? Promise.all(r).then((e) => h.mergeArray(t, e)) : h.mergeArray(t, r);
 	}
 	get items() {
 		return this._def.items;
@@ -2935,16 +2935,16 @@ var A = class e extends C {
 		});
 	}
 };
-A.create = (e, t) => {
+k.create = (e, t) => {
 	if (!Array.isArray(e)) throw Error("You must pass an array of schemas to z.tuple([ ... ])");
-	return new A({
+	return new k({
 		items: e,
-		typeName: F.ZodTuple,
+		typeName: P.ZodTuple,
 		rest: null,
-		...S(t)
+		...x(t)
 	});
 };
-var dt = class e extends C {
+var ft = class e extends S {
 	get keySchema() {
 		return this._def.keyType;
 	}
@@ -2953,36 +2953,36 @@ var dt = class e extends C {
 	}
 	_parse(e) {
 		let { status: t, ctx: n } = this._processInputParams(e);
-		if (n.parsedType !== u.object) return h(n, {
+		if (n.parsedType !== u.object) return m(n, {
 			code: f.invalid_type,
 			expected: u.object,
 			received: n.parsedType
-		}), _;
+		}), g;
 		let r = [], i = this._def.keyType, a = this._def.valueType;
 		for (let e in n.data) r.push({
-			key: i._parse(new x(n, e, n.path, e)),
-			value: a._parse(new x(n, n.data[e], n.path, e)),
+			key: i._parse(new b(n, e, n.path, e)),
+			value: a._parse(new b(n, n.data[e], n.path, e)),
 			alwaysSet: e in n.data
 		});
-		return n.common.async ? g.mergeObjectAsync(t, r) : g.mergeObjectSync(t, r);
+		return n.common.async ? h.mergeObjectAsync(t, r) : h.mergeObjectSync(t, r);
 	}
 	get element() {
 		return this._def.valueType;
 	}
 	static create(t, n, r) {
-		return n instanceof C ? new e({
+		return n instanceof S ? new e({
 			keyType: t,
 			valueType: n,
-			typeName: F.ZodRecord,
-			...S(r)
+			typeName: P.ZodRecord,
+			...x(r)
 		}) : new e({
-			keyType: Xe.create(),
+			keyType: Ze.create(),
 			valueType: t,
-			typeName: F.ZodRecord,
-			...S(n)
+			typeName: P.ZodRecord,
+			...x(n)
 		});
 	}
-}, ft = class extends C {
+}, pt = class extends S {
 	get keySchema() {
 		return this._def.keyType;
 	}
@@ -2991,21 +2991,21 @@ var dt = class e extends C {
 	}
 	_parse(e) {
 		let { status: t, ctx: n } = this._processInputParams(e);
-		if (n.parsedType !== u.map) return h(n, {
+		if (n.parsedType !== u.map) return m(n, {
 			code: f.invalid_type,
 			expected: u.map,
 			received: n.parsedType
-		}), _;
+		}), g;
 		let r = this._def.keyType, i = this._def.valueType, a = [...n.data.entries()].map(([e, t], a) => ({
-			key: r._parse(new x(n, e, n.path, [a, "key"])),
-			value: i._parse(new x(n, t, n.path, [a, "value"]))
+			key: r._parse(new b(n, e, n.path, [a, "key"])),
+			value: i._parse(new b(n, t, n.path, [a, "value"]))
 		}));
 		if (n.common.async) {
 			let e = /* @__PURE__ */ new Map();
 			return Promise.resolve().then(async () => {
 				for (let n of a) {
 					let r = await n.key, i = await n.value;
-					if (r.status === "aborted" || i.status === "aborted") return _;
+					if (r.status === "aborted" || i.status === "aborted") return g;
 					(r.status === "dirty" || i.status === "dirty") && t.dirty(), e.set(r.value, i.value);
 				}
 				return {
@@ -3018,7 +3018,7 @@ var dt = class e extends C {
 			let e = /* @__PURE__ */ new Map();
 			for (let n of a) {
 				let r = n.key, i = n.value;
-				if (r.status === "aborted" || i.status === "aborted") return _;
+				if (r.status === "aborted" || i.status === "aborted") return g;
 				(r.status === "dirty" || i.status === "dirty") && t.dirty(), e.set(r.value, i.value);
 			}
 			return {
@@ -3028,29 +3028,29 @@ var dt = class e extends C {
 		}
 	}
 };
-ft.create = (e, t, n) => new ft({
+pt.create = (e, t, n) => new pt({
 	valueType: t,
 	keyType: e,
-	typeName: F.ZodMap,
-	...S(n)
+	typeName: P.ZodMap,
+	...x(n)
 });
-var pt = class e extends C {
+var mt = class e extends S {
 	_parse(e) {
 		let { status: t, ctx: n } = this._processInputParams(e);
-		if (n.parsedType !== u.set) return h(n, {
+		if (n.parsedType !== u.set) return m(n, {
 			code: f.invalid_type,
 			expected: u.set,
 			received: n.parsedType
-		}), _;
+		}), g;
 		let r = this._def;
-		r.minSize !== null && n.data.size < r.minSize.value && (h(n, {
+		r.minSize !== null && n.data.size < r.minSize.value && (m(n, {
 			code: f.too_small,
 			minimum: r.minSize.value,
 			type: "set",
 			inclusive: !0,
 			exact: !1,
 			message: r.minSize.message
-		}), t.dirty()), r.maxSize !== null && n.data.size > r.maxSize.value && (h(n, {
+		}), t.dirty()), r.maxSize !== null && n.data.size > r.maxSize.value && (m(n, {
 			code: f.too_big,
 			maximum: r.maxSize.value,
 			type: "set",
@@ -3062,7 +3062,7 @@ var pt = class e extends C {
 		function a(e) {
 			let n = /* @__PURE__ */ new Set();
 			for (let r of e) {
-				if (r.status === "aborted") return _;
+				if (r.status === "aborted") return g;
 				r.status === "dirty" && t.dirty(), n.add(r.value);
 			}
 			return {
@@ -3070,7 +3070,7 @@ var pt = class e extends C {
 				value: n
 			};
 		}
-		let o = [...n.data.values()].map((e, t) => i._parse(new x(n, e, n.path, t)));
+		let o = [...n.data.values()].map((e, t) => i._parse(new b(n, e, n.path, t)));
 		return n.common.async ? Promise.all(o).then((e) => a(e)) : a(o);
 	}
 	min(t, n) {
@@ -3078,7 +3078,7 @@ var pt = class e extends C {
 			...this._def,
 			minSize: {
 				value: t,
-				message: b.toString(n)
+				message: y.toString(n)
 			}
 		});
 	}
@@ -3087,7 +3087,7 @@ var pt = class e extends C {
 			...this._def,
 			maxSize: {
 				value: t,
-				message: b.toString(n)
+				message: y.toString(n)
 			}
 		});
 	}
@@ -3098,33 +3098,33 @@ var pt = class e extends C {
 		return this.min(1, e);
 	}
 };
-pt.create = (e, t) => new pt({
+mt.create = (e, t) => new mt({
 	valueType: e,
 	minSize: null,
 	maxSize: null,
-	typeName: F.ZodSet,
-	...S(t)
+	typeName: P.ZodSet,
+	...x(t)
 });
-var mt = class e extends C {
+var ht = class e extends S {
 	constructor() {
 		super(...arguments), this.validate = this.implement;
 	}
 	_parse(e) {
 		let { ctx: t } = this._processInputParams(e);
-		if (t.parsedType !== u.function) return h(t, {
+		if (t.parsedType !== u.function) return m(t, {
 			code: f.invalid_type,
 			expected: u.function,
 			received: t.parsedType
-		}), _;
+		}), g;
 		function n(e, n) {
-			return be({
+			return xe({
 				data: e,
 				path: t.path,
 				errorMaps: [
 					t.common.contextualErrorMap,
 					t.schemaErrorMap,
-					ye(),
-					m
+					be(),
+					ve
 				].filter((e) => !!e),
 				issueData: {
 					code: f.invalid_arguments,
@@ -3133,14 +3133,14 @@ var mt = class e extends C {
 			});
 		}
 		function r(e, n) {
-			return be({
+			return xe({
 				data: e,
 				path: t.path,
 				errorMaps: [
 					t.common.contextualErrorMap,
 					t.schemaErrorMap,
-					ye(),
-					m
+					be(),
+					ve
 				].filter((e) => !!e),
 				issueData: {
 					code: f.invalid_return_type,
@@ -3149,9 +3149,9 @@ var mt = class e extends C {
 			});
 		}
 		let i = { errorMap: t.common.contextualErrorMap }, a = t.data;
-		if (this._def.returns instanceof j) {
+		if (this._def.returns instanceof A) {
 			let e = this;
-			return v(async function(...t) {
+			return _(async function(...t) {
 				let o = new p([]), s = await e._def.args.parseAsync(t, i).catch((e) => {
 					throw o.addIssue(n(t, e)), o;
 				}), c = await Reflect.apply(a, this, s);
@@ -3162,7 +3162,7 @@ var mt = class e extends C {
 		}
 		{
 			let e = this;
-			return v(function(...t) {
+			return _(function(...t) {
 				let o = e._def.args.safeParse(t, i);
 				if (!o.success) throw new p([n(t, o.error)]);
 				let s = Reflect.apply(a, this, o.data), c = e._def.returns.safeParse(s, i);
@@ -3180,7 +3180,7 @@ var mt = class e extends C {
 	args(...t) {
 		return new e({
 			...this._def,
-			args: A.create(t).rest(w.create())
+			args: k.create(t).rest(C.create())
 		});
 	}
 	returns(t) {
@@ -3197,13 +3197,13 @@ var mt = class e extends C {
 	}
 	static create(t, n, r) {
 		return new e({
-			args: t || A.create([]).rest(w.create()),
-			returns: n || w.create(),
-			typeName: F.ZodFunction,
-			...S(r)
+			args: t || k.create([]).rest(C.create()),
+			returns: n || C.create(),
+			typeName: P.ZodFunction,
+			...x(r)
 		});
 	}
-}, ht = class extends C {
+}, gt = class extends S {
 	get schema() {
 		return this._def.getter();
 	}
@@ -3216,20 +3216,20 @@ var mt = class e extends C {
 		});
 	}
 };
-ht.create = (e, t) => new ht({
+gt.create = (e, t) => new gt({
 	getter: e,
-	typeName: F.ZodLazy,
-	...S(t)
+	typeName: P.ZodLazy,
+	...x(t)
 });
-var gt = class extends C {
+var _t = class extends S {
 	_parse(e) {
 		if (e.data !== this._def.value) {
 			let t = this._getOrReturnCtx(e);
-			return h(t, {
+			return m(t, {
 				received: t.data,
 				code: f.invalid_literal,
 				expected: this._def.value
-			}), _;
+			}), g;
 		}
 		return {
 			status: "valid",
@@ -3240,37 +3240,37 @@ var gt = class extends C {
 		return this._def.value;
 	}
 };
-gt.create = (e, t) => new gt({
+_t.create = (e, t) => new _t({
 	value: e,
-	typeName: F.ZodLiteral,
-	...S(t)
+	typeName: P.ZodLiteral,
+	...x(t)
 });
-function _t(e, t) {
-	return new vt({
+function vt(e, t) {
+	return new yt({
 		values: e,
-		typeName: F.ZodEnum,
-		...S(t)
+		typeName: P.ZodEnum,
+		...x(t)
 	});
 }
-var vt = class e extends C {
+var yt = class e extends S {
 	_parse(e) {
 		if (typeof e.data != "string") {
 			let t = this._getOrReturnCtx(e), n = this._def.values;
-			return h(t, {
+			return m(t, {
 				expected: l.joinValues(n),
 				received: t.parsedType,
 				code: f.invalid_type
-			}), _;
+			}), g;
 		}
 		if (this._cache ||= new Set(this._def.values), !this._cache.has(e.data)) {
 			let t = this._getOrReturnCtx(e), n = this._def.values;
-			return h(t, {
+			return m(t, {
 				received: t.data,
 				code: f.invalid_enum_value,
 				options: n
-			}), _;
+			}), g;
 		}
-		return v(e.data);
+		return _(e.data);
 	}
 	get options() {
 		return this._def.values;
@@ -3303,69 +3303,69 @@ var vt = class e extends C {
 		});
 	}
 };
-vt.create = _t;
-var yt = class extends C {
+yt.create = vt;
+var bt = class extends S {
 	_parse(e) {
 		let t = l.getValidEnumValues(this._def.values), n = this._getOrReturnCtx(e);
 		if (n.parsedType !== u.string && n.parsedType !== u.number) {
 			let e = l.objectValues(t);
-			return h(n, {
+			return m(n, {
 				expected: l.joinValues(e),
 				received: n.parsedType,
 				code: f.invalid_type
-			}), _;
+			}), g;
 		}
 		if (this._cache ||= new Set(l.getValidEnumValues(this._def.values)), !this._cache.has(e.data)) {
 			let e = l.objectValues(t);
-			return h(n, {
+			return m(n, {
 				received: n.data,
 				code: f.invalid_enum_value,
 				options: e
-			}), _;
+			}), g;
 		}
-		return v(e.data);
+		return _(e.data);
 	}
 	get enum() {
 		return this._def.values;
 	}
 };
-yt.create = (e, t) => new yt({
+bt.create = (e, t) => new bt({
 	values: e,
-	typeName: F.ZodNativeEnum,
-	...S(t)
+	typeName: P.ZodNativeEnum,
+	...x(t)
 });
-var j = class extends C {
+var A = class extends S {
 	unwrap() {
 		return this._def.type;
 	}
 	_parse(e) {
 		let { ctx: t } = this._processInputParams(e);
-		return t.parsedType !== u.promise && t.common.async === !1 ? (h(t, {
+		return t.parsedType !== u.promise && t.common.async === !1 ? (m(t, {
 			code: f.invalid_type,
 			expected: u.promise,
 			received: t.parsedType
-		}), _) : v((t.parsedType === u.promise ? t.data : Promise.resolve(t.data)).then((e) => this._def.type.parseAsync(e, {
+		}), g) : _((t.parsedType === u.promise ? t.data : Promise.resolve(t.data)).then((e) => this._def.type.parseAsync(e, {
 			path: t.path,
 			errorMap: t.common.contextualErrorMap
 		})));
 	}
 };
-j.create = (e, t) => new j({
+A.create = (e, t) => new A({
 	type: e,
-	typeName: F.ZodPromise,
-	...S(t)
+	typeName: P.ZodPromise,
+	...x(t)
 });
-var M = class extends C {
+var j = class extends S {
 	innerType() {
 		return this._def.schema;
 	}
 	sourceType() {
-		return this._def.schema._def.typeName === F.ZodEffects ? this._def.schema.sourceType() : this._def.schema;
+		return this._def.schema._def.typeName === P.ZodEffects ? this._def.schema.sourceType() : this._def.schema;
 	}
 	_parse(e) {
 		let { status: t, ctx: n } = this._processInputParams(e), r = this._def.effect || null, i = {
 			addIssue: (e) => {
-				h(n, e), e.fatal ? t.abort() : t.dirty();
+				m(n, e), e.fatal ? t.abort() : t.dirty();
 			},
 			get path() {
 				return n.path;
@@ -3374,22 +3374,22 @@ var M = class extends C {
 		if (i.addIssue = i.addIssue.bind(i), r.type === "preprocess") {
 			let e = r.transform(n.data, i);
 			if (n.common.async) return Promise.resolve(e).then(async (e) => {
-				if (t.value === "aborted") return _;
+				if (t.value === "aborted") return g;
 				let r = await this._def.schema._parseAsync({
 					data: e,
 					path: n.path,
 					parent: n
 				});
-				return r.status === "aborted" ? _ : r.status === "dirty" || t.value === "dirty" ? xe(r.value) : r;
+				return r.status === "aborted" ? g : r.status === "dirty" || t.value === "dirty" ? Se(r.value) : r;
 			});
 			{
-				if (t.value === "aborted") return _;
+				if (t.value === "aborted") return g;
 				let r = this._def.schema._parseSync({
 					data: e,
 					path: n.path,
 					parent: n
 				});
-				return r.status === "aborted" ? _ : r.status === "dirty" || t.value === "dirty" ? xe(r.value) : r;
+				return r.status === "aborted" ? g : r.status === "dirty" || t.value === "dirty" ? Se(r.value) : r;
 			}
 		}
 		if (r.type === "refinement") {
@@ -3405,7 +3405,7 @@ var M = class extends C {
 					path: n.path,
 					parent: n
 				});
-				return r.status === "aborted" ? _ : (r.status === "dirty" && t.dirty(), e(r.value), {
+				return r.status === "aborted" ? g : (r.status === "dirty" && t.dirty(), e(r.value), {
 					status: t.value,
 					value: r.value
 				});
@@ -3414,7 +3414,7 @@ var M = class extends C {
 				data: n.data,
 				path: n.path,
 				parent: n
-			}).then((n) => n.status === "aborted" ? _ : (n.status === "dirty" && t.dirty(), e(n.value).then(() => ({
+			}).then((n) => n.status === "aborted" ? g : (n.status === "dirty" && t.dirty(), e(n.value).then(() => ({
 				status: t.value,
 				value: n.value
 			}))));
@@ -3426,7 +3426,7 @@ var M = class extends C {
 					path: n.path,
 					parent: n
 				});
-				if (!y(e)) return _;
+				if (!v(e)) return g;
 				let a = r.transform(e.value, i);
 				if (a instanceof Promise) throw Error("Asynchronous transform encountered during synchronous parse operation. Use .parseAsync instead.");
 				return {
@@ -3438,55 +3438,55 @@ var M = class extends C {
 				data: n.data,
 				path: n.path,
 				parent: n
-			}).then((e) => y(e) ? Promise.resolve(r.transform(e.value, i)).then((e) => ({
+			}).then((e) => v(e) ? Promise.resolve(r.transform(e.value, i)).then((e) => ({
 				status: t.value,
 				value: e
-			})) : _);
+			})) : g);
 		}
 		l.assertNever(r);
 	}
 };
-M.create = (e, t, n) => new M({
+j.create = (e, t, n) => new j({
 	schema: e,
-	typeName: F.ZodEffects,
+	typeName: P.ZodEffects,
 	effect: t,
-	...S(n)
-}), M.createWithPreprocess = (e, t, n) => new M({
+	...x(n)
+}), j.createWithPreprocess = (e, t, n) => new j({
 	schema: t,
 	effect: {
 		type: "preprocess",
 		transform: e
 	},
-	typeName: F.ZodEffects,
-	...S(n)
+	typeName: P.ZodEffects,
+	...x(n)
 });
-var N = class extends C {
+var M = class extends S {
 	_parse(e) {
-		return this._getType(e) === u.undefined ? v(void 0) : this._def.innerType._parse(e);
+		return this._getType(e) === u.undefined ? _(void 0) : this._def.innerType._parse(e);
 	}
 	unwrap() {
 		return this._def.innerType;
 	}
 };
-N.create = (e, t) => new N({
+M.create = (e, t) => new M({
 	innerType: e,
-	typeName: F.ZodOptional,
-	...S(t)
+	typeName: P.ZodOptional,
+	...x(t)
 });
-var P = class extends C {
+var N = class extends S {
 	_parse(e) {
-		return this._getType(e) === u.null ? v(null) : this._def.innerType._parse(e);
+		return this._getType(e) === u.null ? _(null) : this._def.innerType._parse(e);
 	}
 	unwrap() {
 		return this._def.innerType;
 	}
 };
-P.create = (e, t) => new P({
+N.create = (e, t) => new N({
 	innerType: e,
-	typeName: F.ZodNullable,
-	...S(t)
+	typeName: P.ZodNullable,
+	...x(t)
 });
-var bt = class extends C {
+var xt = class extends S {
 	_parse(e) {
 		let { ctx: t } = this._processInputParams(e), n = t.data;
 		return t.parsedType === u.undefined && (n = this._def.defaultValue()), this._def.innerType._parse({
@@ -3499,13 +3499,13 @@ var bt = class extends C {
 		return this._def.innerType;
 	}
 };
-bt.create = (e, t) => new bt({
+xt.create = (e, t) => new xt({
 	innerType: e,
-	typeName: F.ZodDefault,
+	typeName: P.ZodDefault,
 	defaultValue: typeof t.default == "function" ? t.default : () => t.default,
-	...S(t)
+	...x(t)
 });
-var xt = class extends C {
+var St = class extends S {
 	_parse(e) {
 		let { ctx: t } = this._processInputParams(e), n = {
 			...t,
@@ -3518,7 +3518,7 @@ var xt = class extends C {
 			path: n.path,
 			parent: { ...n }
 		});
-		return we(r) ? r.then((e) => ({
+		return Te(r) ? r.then((e) => ({
 			status: "valid",
 			value: e.status === "valid" ? e.value : this._def.catchValue({
 				get error() {
@@ -3540,21 +3540,21 @@ var xt = class extends C {
 		return this._def.innerType;
 	}
 };
-xt.create = (e, t) => new xt({
+St.create = (e, t) => new St({
 	innerType: e,
-	typeName: F.ZodCatch,
+	typeName: P.ZodCatch,
 	catchValue: typeof t.catch == "function" ? t.catch : () => t.catch,
-	...S(t)
+	...x(t)
 });
-var St = class extends C {
+var Ct = class extends S {
 	_parse(e) {
 		if (this._getType(e) !== u.nan) {
 			let t = this._getOrReturnCtx(e);
-			return h(t, {
+			return m(t, {
 				code: f.invalid_type,
 				expected: u.nan,
 				received: t.parsedType
-			}), _;
+			}), g;
 		}
 		return {
 			status: "valid",
@@ -3562,11 +3562,11 @@ var St = class extends C {
 		};
 	}
 };
-St.create = (e) => new St({
-	typeName: F.ZodNaN,
-	...S(e)
+Ct.create = (e) => new Ct({
+	typeName: P.ZodNaN,
+	...x(e)
 });
-var Ct = class extends C {
+var wt = class extends S {
 	_parse(e) {
 		let { ctx: t } = this._processInputParams(e), n = t.data;
 		return this._def.type._parse({
@@ -3578,7 +3578,7 @@ var Ct = class extends C {
 	unwrap() {
 		return this._def.type;
 	}
-}, wt = class e extends C {
+}, Tt = class e extends S {
 	_parse(e) {
 		let { status: t, ctx: n } = this._processInputParams(e);
 		if (n.common.async) return (async () => {
@@ -3587,7 +3587,7 @@ var Ct = class extends C {
 				path: n.path,
 				parent: n
 			});
-			return e.status === "aborted" ? _ : e.status === "dirty" ? (t.dirty(), xe(e.value)) : this._def.out._parseAsync({
+			return e.status === "aborted" ? g : e.status === "dirty" ? (t.dirty(), Se(e.value)) : this._def.out._parseAsync({
 				data: e.value,
 				path: n.path,
 				parent: n
@@ -3599,7 +3599,7 @@ var Ct = class extends C {
 				path: n.path,
 				parent: n
 			});
-			return e.status === "aborted" ? _ : e.status === "dirty" ? (t.dirty(), {
+			return e.status === "aborted" ? g : e.status === "dirty" ? (t.dirty(), {
 				status: "dirty",
 				value: e.value
 			}) : this._def.out._parseSync({
@@ -3613,39 +3613,39 @@ var Ct = class extends C {
 		return new e({
 			in: t,
 			out: n,
-			typeName: F.ZodPipeline
+			typeName: P.ZodPipeline
 		});
 	}
-}, Tt = class extends C {
+}, Et = class extends S {
 	_parse(e) {
-		let t = this._def.innerType._parse(e), n = (e) => (y(e) && (e.value = Object.freeze(e.value)), e);
-		return we(t) ? t.then((e) => n(e)) : n(t);
+		let t = this._def.innerType._parse(e), n = (e) => (v(e) && (e.value = Object.freeze(e.value)), e);
+		return Te(t) ? t.then((e) => n(e)) : n(t);
 	}
 	unwrap() {
 		return this._def.innerType;
 	}
 };
-Tt.create = (e, t) => new Tt({
+Et.create = (e, t) => new Et({
 	innerType: e,
-	typeName: F.ZodReadonly,
-	...S(t)
-}), O.lazycreate;
-var F;
+	typeName: P.ZodReadonly,
+	...x(t)
+}), D.lazycreate;
+var P;
 (function(e) {
 	e.ZodString = "ZodString", e.ZodNumber = "ZodNumber", e.ZodNaN = "ZodNaN", e.ZodBigInt = "ZodBigInt", e.ZodBoolean = "ZodBoolean", e.ZodDate = "ZodDate", e.ZodSymbol = "ZodSymbol", e.ZodUndefined = "ZodUndefined", e.ZodNull = "ZodNull", e.ZodAny = "ZodAny", e.ZodUnknown = "ZodUnknown", e.ZodNever = "ZodNever", e.ZodVoid = "ZodVoid", e.ZodArray = "ZodArray", e.ZodObject = "ZodObject", e.ZodUnion = "ZodUnion", e.ZodDiscriminatedUnion = "ZodDiscriminatedUnion", e.ZodIntersection = "ZodIntersection", e.ZodTuple = "ZodTuple", e.ZodRecord = "ZodRecord", e.ZodMap = "ZodMap", e.ZodSet = "ZodSet", e.ZodFunction = "ZodFunction", e.ZodLazy = "ZodLazy", e.ZodLiteral = "ZodLiteral", e.ZodEnum = "ZodEnum", e.ZodEffects = "ZodEffects", e.ZodNativeEnum = "ZodNativeEnum", e.ZodOptional = "ZodOptional", e.ZodNullable = "ZodNullable", e.ZodDefault = "ZodDefault", e.ZodCatch = "ZodCatch", e.ZodPromise = "ZodPromise", e.ZodBranded = "ZodBranded", e.ZodPipeline = "ZodPipeline", e.ZodReadonly = "ZodReadonly";
-})(F ||= {});
-var I = Xe.create, L = Qe.create;
-St.create, $e.create;
-var R = et.create;
-tt.create, nt.create, rt.create, it.create, at.create;
-var Et = w.create;
-T.create, ot.create;
-var z = E.create, B = O.create;
-O.strictCreate, st.create, ct.create, ut.create, A.create;
-var V = dt.create;
-ft.create, pt.create, mt.create, ht.create, gt.create;
-var H = vt.create;
-yt.create, j.create, M.create, N.create, P.create, M.createWithPreprocess, wt.create;
+})(P ||= {});
+var F = Ze.create, I = $e.create;
+Ct.create, et.create;
+var L = tt.create;
+nt.create, rt.create, it.create, at.create, ot.create;
+var R = C.create;
+w.create, st.create;
+var z = T.create, B = D.create;
+D.strictCreate, ct.create, lt.create, dt.create, k.create;
+var V = ft.create;
+pt.create, mt.create, ht.create, gt.create, _t.create;
+var H = yt.create;
+bt.create, A.create, j.create, M.create, N.create, j.createWithPreprocess, Tt.create;
 //#endregion
 //#region ../../node_modules/.pnpm/zod-to-json-schema@3.25.2_zod@3.25.76/node_modules/zod-to-json-schema/dist/esm/Options.js
 var Dt = Symbol("Let zodToJsonSchema decide on which parser to use"), Ot = {
@@ -3732,7 +3732,7 @@ function W(e) {
 //#region ../../node_modules/.pnpm/zod-to-json-schema@3.25.2_zod@3.25.76/node_modules/zod-to-json-schema/dist/esm/parsers/array.js
 function Nt(e, t) {
 	let n = { type: "array" };
-	return e.type?._def && e.type?._def?.typeName !== F.ZodAny && (n.items = J(e.type._def, {
+	return e.type?._def && e.type?._def?.typeName !== P.ZodAny && (n.items = J(e.type._def, {
 		...t,
 		currentPath: [...t.currentPath, "items"]
 	})), e.minLength && U(n, "minItems", e.minLength.value, e.minLength.message, t), e.maxLength && U(n, "maxItems", e.maxLength.value, e.maxLength.message, t), e.exactLength && (U(n, "minItems", e.exactLength.value, e.exactLength.message, t), U(n, "maxItems", e.exactLength.value, e.exactLength.message, t)), n;
@@ -4047,7 +4047,7 @@ function Zt(e, t) {
 //#endregion
 //#region ../../node_modules/.pnpm/zod-to-json-schema@3.25.2_zod@3.25.76/node_modules/zod-to-json-schema/dist/esm/parsers/record.js
 function Qt(e, t) {
-	if (t.target === "openAi" && console.warn("Warning: OpenAI may not support records in schemas! Try an array of key-value pairs instead."), t.target === "openApi3" && e.keyType?._def.typeName === F.ZodEnum) return {
+	if (t.target === "openAi" && console.warn("Warning: OpenAI may not support records in schemas! Try an array of key-value pairs instead."), t.target === "openApi3" && e.keyType?._def.typeName === P.ZodEnum) return {
 		type: "object",
 		required: e.keyType._def.values,
 		properties: e.keyType._def.values.reduce((n, r) => ({
@@ -4071,18 +4071,18 @@ function Qt(e, t) {
 		}) ?? t.allowedAdditionalProperties
 	};
 	if (t.target === "openApi3") return n;
-	if (e.keyType?._def.typeName === F.ZodString && e.keyType._def.checks?.length) {
+	if (e.keyType?._def.typeName === P.ZodString && e.keyType._def.checks?.length) {
 		let { type: r, ...i } = qt(e.keyType._def, t);
 		return {
 			...n,
 			propertyNames: i
 		};
 	}
-	if (e.keyType?._def.typeName === F.ZodEnum) return {
+	if (e.keyType?._def.typeName === P.ZodEnum) return {
 		...n,
 		propertyNames: { enum: e.keyType._def.values }
 	};
-	if (e.keyType?._def.typeName === F.ZodBranded && e.keyType._def.type._def.typeName === F.ZodString && e.keyType._def.type._def.checks?.length) {
+	if (e.keyType?._def.typeName === P.ZodBranded && e.keyType._def.type._def.typeName === P.ZodString && e.keyType._def.type._def.checks?.length) {
 		let { type: r, ...i } = It(e.keyType._def, t);
 		return {
 			...n,
@@ -4402,42 +4402,42 @@ function vn(e) {
 //#region ../../node_modules/.pnpm/zod-to-json-schema@3.25.2_zod@3.25.76/node_modules/zod-to-json-schema/dist/esm/parsers/readonly.js
 var yn = (e, t) => J(e.innerType._def, t), bn = (e, t, n) => {
 	switch (t) {
-		case F.ZodString: return qt(e, n);
-		case F.ZodNumber: return cn(e, n);
-		case F.ZodObject: return ln(e, n);
-		case F.ZodBigInt: return Pt(e, n);
-		case F.ZodBoolean: return Ft();
-		case F.ZodDate: return Rt(e, n);
-		case F.ZodUndefined: return _n(n);
-		case F.ZodNull: return nn(n);
-		case F.ZodArray: return Nt(e, n);
-		case F.ZodUnion:
-		case F.ZodDiscriminatedUnion: return an(e, n);
-		case F.ZodIntersection: return Wt(e, n);
-		case F.ZodTuple: return gn(e, n);
-		case F.ZodRecord: return Qt(e, n);
-		case F.ZodLiteral: return Gt(e, n);
-		case F.ZodEnum: return Ht(e);
-		case F.ZodNativeEnum: return en(e);
-		case F.ZodNullable: return sn(e, n);
-		case F.ZodOptional: return fn(e, n);
-		case F.ZodMap: return $t(e, n);
-		case F.ZodSet: return hn(e, n);
-		case F.ZodLazy: return () => e.getter()._def;
-		case F.ZodPromise: return mn(e, n);
-		case F.ZodNaN:
-		case F.ZodNever: return tn(n);
-		case F.ZodEffects: return Vt(e, n);
-		case F.ZodAny: return W(n);
-		case F.ZodUnknown: return vn(n);
-		case F.ZodDefault: return Bt(e, n);
-		case F.ZodBranded: return It(e, n);
-		case F.ZodReadonly: return yn(e, n);
-		case F.ZodCatch: return Lt(e, n);
-		case F.ZodPipeline: return pn(e, n);
-		case F.ZodFunction:
-		case F.ZodVoid:
-		case F.ZodSymbol: return;
+		case P.ZodString: return qt(e, n);
+		case P.ZodNumber: return cn(e, n);
+		case P.ZodObject: return ln(e, n);
+		case P.ZodBigInt: return Pt(e, n);
+		case P.ZodBoolean: return Ft();
+		case P.ZodDate: return Rt(e, n);
+		case P.ZodUndefined: return _n(n);
+		case P.ZodNull: return nn(n);
+		case P.ZodArray: return Nt(e, n);
+		case P.ZodUnion:
+		case P.ZodDiscriminatedUnion: return an(e, n);
+		case P.ZodIntersection: return Wt(e, n);
+		case P.ZodTuple: return gn(e, n);
+		case P.ZodRecord: return Qt(e, n);
+		case P.ZodLiteral: return Gt(e, n);
+		case P.ZodEnum: return Ht(e);
+		case P.ZodNativeEnum: return en(e);
+		case P.ZodNullable: return sn(e, n);
+		case P.ZodOptional: return fn(e, n);
+		case P.ZodMap: return $t(e, n);
+		case P.ZodSet: return hn(e, n);
+		case P.ZodLazy: return () => e.getter()._def;
+		case P.ZodPromise: return mn(e, n);
+		case P.ZodNaN:
+		case P.ZodNever: return tn(n);
+		case P.ZodEffects: return Vt(e, n);
+		case P.ZodAny: return W(n);
+		case P.ZodUnknown: return vn(n);
+		case P.ZodDefault: return Bt(e, n);
+		case P.ZodBranded: return It(e, n);
+		case P.ZodReadonly: return yn(e, n);
+		case P.ZodCatch: return Lt(e, n);
+		case P.ZodPipeline: return pn(e, n);
+		case P.ZodFunction:
+		case P.ZodVoid:
+		case P.ZodSymbol: return;
 		default: return ((e) => void 0)(t);
 	}
 };
@@ -4523,176 +4523,185 @@ var xn = (e, t) => {
 	};
 	return n.target === "jsonSchema7" ? s.$schema = "http://json-schema.org/draft-07/schema#" : (n.target === "jsonSchema2019-09" || n.target === "openAi") && (s.$schema = "https://json-schema.org/draft/2019-09/schema#"), n.target === "openAi" && ("anyOf" in s || "oneOf" in s || "allOf" in s || "type" in s && Array.isArray(s.type)) && console.warn("Warning: OpenAI may not support schemas with unions as roots! Try wrapping it in an object property."), s;
 }, Y = (e) => B(e).passthrough(), X = (e) => e.nullable().optional(), Z = B({}).passthrough(), wn = Y({
-	id: I().describe("Project id; pass as projectId to other tools"),
-	name: I(),
-	key: X(I()).describe("Short prefix, e.g. \"PROJ\""),
-	description: X(I())
+	id: F().describe("Project id; pass as projectId to other tools"),
+	name: F(),
+	key: X(F()).describe("Short prefix, e.g. \"PROJ\""),
+	description: X(F())
 }).describe("A project"), Tn = Y({
-	id: I().describe("Task id; pass as id or taskId to other tools"),
-	projectId: I(),
-	title: I(),
-	status: I().describe("Workflow status key"),
-	priority: I().describe("urgent, high, medium, low or none"),
-	assigneeId: X(I()),
-	dueDate: X(I()),
-	deadline: X(I()).describe("Latest acceptable finish, enforced by critical path analysis"),
-	isMilestone: X(R()).describe("A zero-duration checkpoint"),
-	estimatedHours: X(L()),
-	loggedHours: X(L()),
-	isBlocked: X(R())
+	id: F().describe("Task id; pass as id or taskId to other tools"),
+	projectId: F(),
+	title: F(),
+	status: F().describe("Workflow status key"),
+	priority: F().describe("urgent, high, medium, low or none"),
+	assigneeId: X(F()),
+	dueDate: X(F()),
+	deadline: X(F()).describe("Latest acceptable finish, enforced by critical path analysis"),
+	isMilestone: X(L()).describe("A zero-duration checkpoint"),
+	estimatedHours: X(I()),
+	loggedHours: X(I()),
+	isBlocked: X(L())
 }).describe("A task"), En = Y({
-	dependencyId: I().describe("Id of the dependency record"),
-	taskId: I().describe("The other task"),
-	title: I(),
-	status: I(),
-	type: I().describe("'blocking' (the waiting task cannot start until the other finishes) or 'relates_to' (informational)")
+	dependencyId: F().describe("Id of the dependency record"),
+	taskId: F().describe("The other task"),
+	title: F(),
+	status: F(),
+	type: F().describe("'blocking' (the waiting task cannot start until the other finishes) or 'relates_to' (informational)")
 }), Dn = Tn.extend({ dependencies: X(Y({
 	dependsOn: z(En).describe("Tasks this task waits for (upstream)"),
 	dependents: z(En).describe("Tasks waiting for this task (downstream)")
 })).describe("Present when includeDependencies is true") }).describe("A task"), On = Y({
-	id: I(),
-	taskId: I().describe("The task that waits"),
-	dependsOnTaskId: I().describe("The task it waits for"),
-	type: I().describe("blocking or relates_to")
+	id: F(),
+	taskId: F().describe("The task that waits"),
+	dependsOnTaskId: F().describe("The task it waits for"),
+	type: F().describe("blocking or relates_to")
 }).describe("A dependency between two tasks"), kn = Y({
-	id: I(),
-	projectId: I(),
-	title: I(),
-	dueDate: X(I())
+	id: F(),
+	projectId: F(),
+	title: F(),
+	dueDate: X(F())
 }).describe("A deliverable"), An = Y({
-	id: I(),
-	taskId: I(),
-	content: I(),
-	authorId: X(I())
-}).describe("A task comment"), jn = Y({
-	assigneeId: X(I()),
-	teamId: X(I()),
-	capacity: L().describe("1 for a person, headcount for a team pool"),
-	allocation: L().describe("Total booked in the period, e.g. 1.5 for 150%"),
-	start: I(),
-	end: I(),
-	taskIds: z(I())
-}), Mn = Y({
-	taskId: I(),
-	isCritical: R().describe("True when any delay to this task delays the project end"),
-	totalSlack: L().describe("Slack in hours; 0 means critical, negative means a deadline is missed by that much"),
-	slackWorkingHours: X(L()).describe("Slack in working hours on the task calendar"),
-	earlyStartDate: X(I()),
-	earlyFinishDate: X(I()),
-	lateStartDate: X(I()),
-	lateFinishDate: X(I()),
-	levelingDelayHours: X(L()).describe("With levelling: hours spent waiting for the assignee"),
-	waitingOn: X(I()).describe("With levelling: the task this one waited for"),
-	isMilestone: X(R()).describe("True for a milestone"),
-	deadlineDate: X(I()).describe("The task's deadline as an instant"),
-	deadlineVarianceHours: X(L()).describe("Working hours from forecast finish to deadline; negative means it will be missed")
+	id: F(),
+	taskId: F(),
+	hours: I(),
+	userId: X(F()),
+	loggedAt: X(F())
+}).describe("A time entry"), jn = Y({
+	id: F(),
+	taskId: F(),
+	content: F(),
+	authorId: X(F())
+}).describe("A task comment"), Mn = Y({
+	assigneeId: X(F()),
+	teamId: X(F()),
+	capacity: I().describe("1 for a person, headcount for a team pool"),
+	allocation: I().describe("Total booked in the period, e.g. 1.5 for 150%"),
+	start: F(),
+	end: F(),
+	taskIds: z(F())
 }), Nn = Y({
-	projectId: I(),
-	projectStartDate: X(I()),
-	projectEndDate: X(I()).describe("Forecast finish date"),
-	totalDurationHours: L(),
-	criticalTaskIds: z(I()).describe("Tasks with zero or negative slack, in schedule order"),
-	missedDeadlineTaskIds: X(z(I())).describe("Tasks forecast to finish after their deadline"),
-	tasks: z(Mn),
-	leveled: X(R()),
-	unleveledProjectEndDate: X(I()).describe("With levelling: the end date before levelling"),
-	overallocations: X(z(jn)).describe("Assignee mode: periods where someone is booked above capacity")
+	taskId: F(),
+	isCritical: L().describe("True when any delay to this task delays the project end"),
+	totalSlack: I().describe("Slack in hours; 0 means critical, negative means a deadline is missed by that much"),
+	slackWorkingHours: X(I()).describe("Slack in working hours on the task calendar"),
+	earlyStartDate: X(F()),
+	earlyFinishDate: X(F()),
+	lateStartDate: X(F()),
+	lateFinishDate: X(F()),
+	levelingDelayHours: X(I()).describe("With levelling: hours spent waiting for the assignee"),
+	waitingOn: X(F()).describe("With levelling: the task this one waited for"),
+	isMilestone: X(L()).describe("True for a milestone"),
+	isSummary: X(L()).describe("True for a task with subtasks: its dates and slack are roll-ups of them"),
+	deadlineDate: X(F()).describe("The task's deadline as an instant"),
+	deadlineVarianceHours: X(I()).describe("Working hours from forecast finish to deadline; negative means it will be missed")
 }), Pn = Y({
-	projects: z(Nn).describe("One analysis per project"),
-	projectEndDate: X(I()).describe("The latest project end"),
-	leveled: X(R()),
-	overallocations: z(jn)
+	projectId: F(),
+	projectStartDate: X(F()),
+	projectEndDate: X(F()).describe("Forecast finish date"),
+	totalDurationHours: I(),
+	criticalTaskIds: z(F()).describe("Tasks with zero or negative slack, in schedule order"),
+	missedDeadlineTaskIds: X(z(F())).describe("Tasks forecast to finish after their deadline"),
+	unestimatedTaskIds: X(z(F())).describe("Unfinished tasks with no estimate, scheduled for defaultEstimateHours"),
+	cyclicTaskIds: X(z(F())).describe("Tasks on a dependency cycle; their dates are not reliable"),
+	tasks: z(Nn),
+	leveled: X(L()),
+	unleveledProjectEndDate: X(F()).describe("With levelling: the end date before levelling"),
+	overallocations: X(z(Mn)).describe("Assignee mode: periods where someone is booked above capacity")
 }), Fn = Y({
-	id: I(),
-	type: I().describe("container, iteration, deliverable or phase"),
-	name: I(),
-	health: I().describe("on_track, at_risk, blocked, overdue or completed"),
-	progressPercentage: L().describe("0-100"),
-	isCritical: R(),
-	blockedTasks: L(),
-	taskIds: z(I())
+	projects: z(Pn).describe("One analysis per project"),
+	projectEndDate: X(F()).describe("The latest project end"),
+	leveled: X(L()),
+	overallocations: z(Mn)
 }), In = Y({
-	projectId: I(),
-	level: I(),
+	id: F(),
+	type: F().describe("container, iteration, deliverable or phase"),
+	name: F(),
+	health: F().describe("on_track, at_risk, blocked, overdue or completed"),
+	progressPercentage: I().describe("0-100"),
+	isCritical: L(),
+	blockedTasks: I(),
+	taskIds: z(F())
+}), Ln = Y({
+	projectId: F(),
+	level: F(),
 	macro: X(Y({
-		health: I().describe("on_track, at_risk, blocked, overdue or completed"),
-		overallProgressPercentage: L().describe("0-100"),
-		projectedFinishDate: X(I()),
-		totalTasks: L(),
-		completedTasks: L(),
-		blockedTasks: L(),
-		phases: z(Fn)
+		health: F().describe("on_track, at_risk, blocked, overdue or completed"),
+		overallProgressPercentage: I().describe("0-100"),
+		projectedFinishDate: X(F()),
+		totalTasks: I(),
+		completedTasks: I(),
+		blockedTasks: I(),
+		phases: z(In)
 	})).describe("Phase-level summary"),
 	standard: X(Z).describe("Task timeline: { tasks, criticalPathTaskIds, dependencies, totalDurationHours }"),
 	concrete: X(V(Z)).describe("Work evidence (time entries, attachments) by task id")
-}), Ln = Y({
-	taskId: I(),
-	macroPhase: X(Fn).describe("The phase this task belongs to"),
+}), Rn = Y({
+	taskId: F(),
+	macroPhase: X(In).describe("The phase this task belongs to"),
 	standard: Z.describe("The task with cpm (isCritical, slackWorkingHours, dates), blockingTaskIds and dependentTaskIds"),
 	concrete: Z.describe("Evidence of work on the task"),
 	metrics: X(Z).describe("Same as get_task_metrics")
-}), Rn = Y({
-	taskId: I(),
+}), zn = Y({
+	taskId: F(),
 	points: z(Y({
-		timestamp: I(),
-		progress: L().describe("0-100"),
-		status: I()
+		timestamp: F(),
+		progress: I().describe("0-100"),
+		status: F()
 	})),
-	curveProfile: I().describe("linear, s_curve, early_surge, late_rush, stalled or insufficient_data")
-}), zn = Y({
-	taskId: I(),
+	curveProfile: F().describe("linear, s_curve, early_surge, late_rush, stalled or insufficient_data")
+}), Bn = Y({
+	taskId: F(),
 	progress: Y({
-		progressPercentage: L().describe("0-100"),
-		source: I().describe("Where the figure comes from: explicit, todos, time_effort, schedule_elapsed or blended")
+		progressPercentage: I().describe("0-100"),
+		source: F().describe("Where the figure comes from: explicit, todos, time_effort, schedule_elapsed or blended")
 	}),
 	realityDelta: Y({
-		estimatedHours: L(),
-		loggedHours: L(),
-		varianceHours: L().describe("logged minus estimated"),
-		isOverdue: R(),
-		isOverEstimate: R(),
-		scheduleVarianceWorkingDays: X(L()).describe("Working days late (positive) or early (negative)")
+		estimatedHours: I(),
+		loggedHours: I(),
+		varianceHours: I().describe("logged minus estimated"),
+		isOverdue: L(),
+		isOverEstimate: L(),
+		scheduleVarianceWorkingDays: X(I()).describe("Working days late (positive) or early (negative)")
 	}),
 	evm: Y({
-		plannedValue: L(),
-		earnedValue: L(),
-		actualCost: L(),
-		costPerformanceIndex: L().describe("CPI = EV / AC; below 1 is over budget"),
-		schedulePerformanceIndex: L().describe("SPI = EV / PV; below 1 is behind schedule")
+		plannedValue: I(),
+		earnedValue: I(),
+		actualCost: I(),
+		costPerformanceIndex: I().describe("CPI = EV / AC; below 1 is over budget"),
+		schedulePerformanceIndex: I().describe("SPI = EV / PV; below 1 is behind schedule")
 	}),
 	inferredActuals: Z.describe("Actual start/end dates and active working time"),
-	progressHistory: Rn
-}), Bn = Y({
-	startDate: I(),
-	endDate: I(),
-	interval: I(),
-	groupBy: I(),
-	metric: I(),
-	seriesKeys: z(I()).describe("Ids of the people, teams, etc. in the series"),
-	seriesLabels: V(I()).describe("Display name for each series key"),
+	progressHistory: zn
+}), Vn = Y({
+	startDate: F(),
+	endDate: F(),
+	interval: F(),
+	groupBy: F(),
+	metric: F(),
+	seriesKeys: z(F()).describe("Ids of the people, teams, etc. in the series"),
+	seriesLabels: V(F()).describe("Display name for each series key"),
 	buckets: z(Y({
-		date: I().describe("Start of the bucket (YYYY-MM-DD)"),
-		totalHours: L(),
-		values: V(L()).describe("Hours per series key"),
-		capacity: X(V(L())).describe("Capacity hours per series key"),
-		utilizationRatio: X(L()).describe("totalHours / totalCapacity; above 1 is overloaded")
+		date: F().describe("Start of the bucket (YYYY-MM-DD)"),
+		totalHours: I(),
+		values: V(I()).describe("Hours per series key"),
+		capacity: X(V(I())).describe("Capacity hours per series key"),
+		utilizationRatio: X(I()).describe("totalHours / totalCapacity; above 1 is overloaded")
 	})),
-	totalHours: L(),
-	totalCapacity: X(L()),
-	averageUtilization: X(L())
-}), Vn = Y({
+	totalHours: I(),
+	totalCapacity: X(I()),
+	averageUtilization: X(I())
+}), Hn = Y({
 	skills: X(z(Y({
-		name: I(),
-		description: I()
+		name: F(),
+		description: F()
 	}))).describe("Present when no name was given"),
-	name: X(I()),
-	description: X(I()),
-	content: X(I()).describe("The playbook (markdown); follow its steps")
+	name: X(F()),
+	description: X(F()),
+	content: X(F()).describe("The playbook (markdown); follow its steps")
 }), Q = [
 	{
 		name: "analyze-schedule",
 		description: "Find what drives a project's end date, how much each task can slip and where people are double-booked, then recommend fixes. Use for \"when will we finish?\", \"what is critical?\" or deadline-risk questions.",
-		content: "---\nname: analyze-schedule\ndescription: Find what drives a project's end date, how much each task can slip and where people are double-booked, then recommend fixes. Use for \"when will we finish?\", \"what is critical?\" or deadline-risk questions.\n---\n\n# Analyze the schedule\n\n## 1. Run the schedule\n\n1. Get the `projectId` (`list_projects`).\n2. Call `calculate_critical_path` with `calendars: \"assignee\"` and `levelResources: true`, so each person works on one task at a time on their own calendar. If the user wants the ideal schedule with unlimited people, call it with no options instead.\n3. If the question spans projects that share people, call `calculate_portfolio_critical_path` with their `projectIds` (and `projectOrder` if the user ranked them) instead.\n4. For in-flight projects, pass `effort: \"remaining\"` so finished hours are not scheduled again.\n\n## 2. Read the result\n\n- `projectEndDate` is the forecast finish. With levelling, compare it with `unleveledProjectEndDate`: the gap is time lost waiting for busy people.\n- `criticalTaskIds` are the tasks with zero or negative slack. Any delay to one of them moves the end date or misses a deadline.\n- `missedDeadlineTaskIds` lists tasks forecast to finish after their `deadline`. Their `deadlineVarianceHours` says by how much (negative working hours), and the negative `totalSlack` on the tasks before them shows which work drives the miss. Entries with `isMilestone: true` are checkpoints such as releases or sign-offs.\n- Each entry in `tasks` has `slackWorkingHours`: how many working hours the task can slip without moving the end. Under about 8 hours is near-critical.\n- `levelingDelayHours` and `waitingOn` show a task that waited for its assignee to finish another task.\n- `overallocations` lists periods where a person (`assigneeId`) or team (`teamId`) is booked above `capacity`; `allocation` 1.5 means 150%.\n\nLook up titles for the task ids you mention with `get_task` or `list_tasks`; report titles, not ids. To see why a critical task cannot start earlier, call `get_task` with `includeDependencies: true`: `dependencies.dependsOn` lists what it waits for and `dependencies.dependents` what waits for it.\n\n## 3. Recommend\n\nRank fixes by how much they pull the end date in:\n\n1. **Unblock critical tasks.** A critical task with `isBlocked: true` delays everything; say what it waits for.\n2. **Move work off the bottleneck person.** If critical tasks wait on one assignee (`waitingOn`), suggest reassigning a non-critical task of theirs.\n3. **Remove false dependencies.** A critical task waiting on work it does not really need (`dependencies.dependsOn`) can start earlier once the link is removed.\n4. **Split long critical tasks** so parts can run in parallel.\n5. **Cut or defer** tasks feeding late deliverables, if dates are fixed.\n\nShow the recommendation to the user. Change tasks (`update_task`) or dependencies (`add_dependency`, `remove_dependency`) only when they ask, then run the schedule again to show the effect.\n\n## Report format\n\n- Forecast finish date, and against any deadline the user gave. If the user gives a date that is not yet on a task, offer to record it as a `deadline` (on a milestone task with `isMilestone: true` if it is a checkpoint) so later runs track it.\n- Each milestone: forecast date against its deadline.\n- Critical path: task titles in order, with assignee.\n- Top risks: near-critical tasks, blocked critical tasks, over-allocations.\n- Recommended actions, each with its expected effect.\n"
+		content: "---\nname: analyze-schedule\ndescription: Find what drives a project's end date, how much each task can slip and where people are double-booked, then recommend fixes. Use for \"when will we finish?\", \"what is critical?\" or deadline-risk questions.\n---\n\n# Analyze the schedule\n\n## 1. Run the schedule\n\n1. Get the `projectId` (`list_projects`).\n2. Call `calculate_critical_path` with `calendars: \"assignee\"` and `levelResources: true`, so each person works on one task at a time on their own calendar. If the user wants the ideal schedule with unlimited people, call it with no options instead.\n3. If the question spans projects that share people, call `calculate_portfolio_critical_path` with their `projectIds` (and `projectOrder` if the user ranked them) instead.\n4. For in-flight projects, pass `effort: \"remaining\"` so finished hours are not scheduled again.\n\n## 2. Read the result\n\n- `projectEndDate` is the forecast finish. With levelling, compare it with `unleveledProjectEndDate`: the gap is time lost waiting for busy people.\n- `criticalTaskIds` are the tasks with zero or negative slack. Any delay to one of them moves the end date or misses a deadline.\n- `unestimatedTaskIds` lists unfinished tasks with no estimate; each was assumed to take `defaultEstimateHours` (1 by default), so say the forecast is uncertain and suggest estimating them. Entries with `isSummary: true` are parent tasks shown as the span of their subtasks.\n- `missedDeadlineTaskIds` lists tasks forecast to finish after their `deadline`. Their `deadlineVarianceHours` says by how much (negative working hours), and the negative `totalSlack` on the tasks before them shows which work drives the miss. Entries with `isMilestone: true` are checkpoints such as releases or sign-offs.\n- Each entry in `tasks` has `slackWorkingHours`: how many working hours the task can slip without moving the end. Under about 8 hours is near-critical.\n- `levelingDelayHours` and `waitingOn` show a task that waited for its assignee to finish another task.\n- `overallocations` lists periods where a person (`assigneeId`) or team (`teamId`) is booked above `capacity`; `allocation` 1.5 means 150%.\n\nLook up titles for the task ids you mention with `get_task` or `list_tasks`; report titles, not ids. To see why a critical task cannot start earlier, call `get_task` with `includeDependencies: true`: `dependencies.dependsOn` lists what it waits for and `dependencies.dependents` what waits for it.\n\n## 3. Recommend\n\nRank fixes by how much they pull the end date in:\n\n1. **Unblock critical tasks.** A critical task with `isBlocked: true` delays everything; say what it waits for.\n2. **Move work off the bottleneck person.** If critical tasks wait on one assignee (`waitingOn`), suggest reassigning a non-critical task of theirs.\n3. **Remove false dependencies.** A critical task waiting on work it does not really need (`dependencies.dependsOn`) can start earlier once the link is removed.\n4. **Split long critical tasks** so parts can run in parallel.\n5. **Cut or defer** tasks feeding late deliverables, if dates are fixed.\n\nShow the recommendation to the user. Change tasks (`update_task`) or dependencies (`add_dependency`, `remove_dependency`) only when they ask, then run the schedule again to show the effect.\n\n## Report format\n\n- Forecast finish date, and against any deadline the user gave. If the user gives a date that is not yet on a task, offer to record it as a `deadline` (on a milestone task with `isMilestone: true` if it is a checkpoint) so later runs track it.\n- Each milestone: forecast date against its deadline.\n- Critical path: task titles in order, with assignee.\n- Top risks: near-critical tasks, blocked critical tasks, over-allocations.\n- Recommended actions, each with its expected effect.\n"
 	},
 	{
 		name: "investigate-task",
@@ -4720,19 +4729,19 @@ var xn = (e, t) => {
 		content: "---\nname: triage-tasks\ndescription: Review new, unprioritized or stale tasks and set priority, estimate, tags and blocked state consistently. Use when the user asks to triage, groom or clean up a backlog.\n---\n\n# Triage tasks\n\nMake every task in scope actionable: a clear title, a priority, an estimate and an honest blocked state.\n\n## 1. Gather the tasks\n\n1. Get the `projectId` with `list_projects` if you do not have it, then `get_project` to learn the workflow status keys.\n2. Call `list_tasks` with filters that match the request, for example:\n   - untriaged: `priority: \"none\"`;\n   - a backlog: `status` set to the backlog key from the workflow;\n   - one person's work: `assigneeId`.\n   Page with `nextCursor` until it is empty, or stop at a sensible batch (about 25) and say how many remain.\n3. For tasks whose description is thin or which look blocked, read the discussion with `list_comments`.\n\n## 2. Decide, task by task\n\n| Field | Rule |\n| --- | --- |\n| `priority` | `urgent`: blocks other people now or a live problem. `high`: needed for the next deliverable. `medium`: planned work. `low`: nice to have. Reserve `urgent` for a handful of tasks. |\n| `estimatedHours` | Effort in hours. If a task is over about 24 hours, propose splitting it instead of estimating it. |\n| `tags` | Reuse tags already used in the project; do not invent a new scheme. |\n| `isBlocked` / `blockedReason` | Blocked only when work cannot continue; the reason names what it waits for. |\n| title | Starts with a verb and says the outcome. Rewrite only when it is unclear. |\n\nFlag likely duplicates (same outcome, different words) instead of deleting them.\n\n## 3. Propose, then apply\n\n1. Show the user a table: task title, current values, proposed values, one-line reason.\n2. After the user approves (all or some), apply each change with `update_task`, passing only the fields that change.\n3. For any non-obvious change, record why with `add_comment` on the task.\n\n## Guardrails\n\n- Do not change `status` or `assigneeId` during triage unless the user asked for it.\n- Never call `delete_task` during triage. Suggest canceling duplicates and let the user decide.\n"
 	}
 ];
-function Hn(e) {
+function Un(e) {
 	return Q.find((t) => t.name === e);
 }
 //#endregion
 //#region ../mcp/dist/tools/definitions.js
-var Un = {
+var Wn = {
 	core: "Projects, tasks and task dependencies: find, read, create, update and delete",
 	collaboration: "Deliverables and task comments",
 	scheduling: "Critical path, portfolio scheduling and workload/capacity",
 	analytics: "Project status ladder, task metrics, earned value and progress history",
 	guidance: "Skills: step-by-step playbooks for multi-step jobs"
 };
-function Wn(e) {
+function Gn(e) {
 	let { $schema: t, ...n } = Cn(e, { $refStrategy: "none" });
 	return n;
 }
@@ -4740,8 +4749,8 @@ function $(e) {
 	let t = e.annotations?.readOnlyHint ?? !1;
 	return {
 		...e,
-		inputSchema: Wn(e.zodSchema),
-		outputSchema: Wn(e.outputZodSchema),
+		inputSchema: Gn(e.zodSchema),
+		outputSchema: Gn(e.outputZodSchema),
 		annotations: {
 			readOnlyHint: t,
 			destructiveHint: e.annotations?.destructiveHint ?? !1,
@@ -4750,23 +4759,23 @@ function $(e) {
 		}
 	};
 }
-var Gn = class extends Error {
+var Kn = class extends Error {
 	constructor(e, t) {
 		super(`Invalid arguments for tool "${e}": ${t}`), this.name = "ToolArgumentError";
 	}
 };
-function Kn(e, t) {
+function qn(e, t) {
 	let n = e.zodSchema.strict().safeParse(t ?? {});
 	if (!n.success) {
 		let t = n.error.issues.map((e) => `${e.path.join(".") || "(root)"}: ${e.message}`).join("; ");
-		throw new Gn(e.name, t);
+		throw new Kn(e.name, t);
 	}
 	return n.data;
 }
-async function qn(e) {
+async function Jn(e) {
 	return { isEngine: "store" in e && typeof e.store == "object" };
 }
-var Jn = $({
+var Yn = $({
 	name: "list_projects",
 	title: "List Projects",
 	description: "List every project you can read, with its id, name and key. Start here to find a projectId; never guess ids. Returns { projects }.",
@@ -4775,40 +4784,40 @@ var Jn = $({
 	zodSchema: B({}),
 	annotations: { readOnlyHint: !0 },
 	execute: async (e, t) => ({ projects: await t.getProjects() })
-}), Yn = $({
+}), Xn = $({
 	name: "get_project",
 	title: "Get Project",
 	description: "Get one project by id: name, key, workflow statuses, custom field definitions and calendar. Use it before creating or moving tasks to learn the valid status keys and custom fields. Returns the project. For its tasks use `list_tasks`.",
 	toolset: "core",
 	outputZodSchema: wn,
-	zodSchema: B({ id: I().describe("The project ID") }),
+	zodSchema: B({ id: F().describe("The project ID") }),
 	annotations: { readOnlyHint: !0 },
 	execute: async (e, t) => t.getProject(e.id)
-}), Xn = $({
+}), Zn = $({
 	name: "create_project",
 	title: "Create Project",
 	description: "Create a new, empty project. Use only when the user wants a new project; to add work to an existing one use `create_task`. Returns the created project with its id.",
 	toolset: "core",
 	outputZodSchema: wn,
 	zodSchema: B({
-		name: I().describe("Name of the project"),
-		description: I().optional().describe("Description of the project"),
-		key: I().optional().describe("Short project key/prefix (e.g. \"PROJ\")"),
-		customFields: V(Et()).optional().describe("Custom field values as a JSON object (validated against the project's field definitions for tasks)")
+		name: F().describe("Name of the project"),
+		description: F().optional().describe("Description of the project"),
+		key: F().optional().describe("Short project key/prefix (e.g. \"PROJ\")"),
+		customFields: V(R()).optional().describe("Custom field values as a JSON object (validated against the project's field definitions for tasks)")
 	}),
 	execute: async (e, t) => t.createProject(e)
-}), Zn = $({
+}), Qn = $({
 	name: "list_tasks",
 	title: "List Tasks",
 	description: "Find tasks, oldest first, filtered by project, status, priority, assignee, iteration, deliverable, container or parent task ('none' for top-level tasks only). Use it for questions like \"what is blocked / assigned to X / in progress\" and to look up task ids. Returns { tasks, nextCursor }; pass nextCursor back as cursor for the next page. For one task's full record use `get_task`.",
 	toolset: "core",
 	outputZodSchema: B({
 		tasks: z(Tn),
-		nextCursor: I().nullable().optional()
+		nextCursor: F().nullable().optional()
 	}),
 	zodSchema: B({
-		projectId: I().optional().describe("Filter by project ID"),
-		status: I().optional().describe("Filter by task status key"),
+		projectId: F().optional().describe("Filter by project ID"),
+		status: F().optional().describe("Filter by task status key"),
 		priority: H([
 			"urgent",
 			"high",
@@ -4816,13 +4825,13 @@ var Jn = $({
 			"low",
 			"none"
 		]).optional().describe("Filter by priority"),
-		assigneeId: I().optional().describe("Filter by assignee ID"),
-		iterationId: I().optional().describe("Filter by iteration (sprint) ID"),
-		deliverableId: I().optional().describe("Filter by deliverable ID"),
-		containerId: I().optional().describe("Filter by container (e.g. epic) ID"),
-		parentId: I().optional().describe("Subtasks of this task ID, or 'none' for top-level tasks only"),
-		limit: L().int().min(1).max(500).optional().describe("Page size (default 100)"),
-		cursor: I().optional().describe("nextCursor from a previous call")
+		assigneeId: F().optional().describe("Filter by assignee ID"),
+		iterationId: F().optional().describe("Filter by iteration (sprint) ID"),
+		deliverableId: F().optional().describe("Filter by deliverable ID"),
+		containerId: F().optional().describe("Filter by container (e.g. epic) ID"),
+		parentId: F().optional().describe("Subtasks of this task ID, or 'none' for top-level tasks only"),
+		limit: I().int().min(1).max(500).optional().describe("Page size (default 100)"),
+		cursor: F().optional().describe("nextCursor from a previous call")
 	}),
 	annotations: { readOnlyHint: !0 },
 	execute: async (e, t, n) => {
@@ -4843,21 +4852,21 @@ var Jn = $({
 			nextCursor: r.nextCursor
 		};
 	}
-}), Qn = $({
+}), $n = $({
 	name: "get_task",
 	title: "Get Task",
 	description: "Get one task by id: status, priority, assignee, estimate, logged hours, dates, blocked state and custom fields. Set includeDependencies to also see which tasks it waits for and which wait for it. Returns the task, with { dependencies: { dependsOn, dependents } } when asked. For its discussion use `list_comments`; for progress and variance use `get_task_metrics`.",
 	toolset: "core",
 	outputZodSchema: Dn,
 	zodSchema: B({
-		id: I().describe("The task ID"),
-		includeDependencies: R().optional().describe("Also return the tasks this one waits for (dependsOn) and the tasks waiting for it (dependents)")
+		id: F().describe("The task ID"),
+		includeDependencies: L().optional().describe("Also return the tasks this one waits for (dependsOn) and the tasks waiting for it (dependents)")
 	}),
 	annotations: { readOnlyHint: !0 },
 	execute: async (e, t) => {
 		let n = await t.getTask(e.id);
 		if (!n || !e.includeDependencies) return n;
-		let r = await tr(t, e.id), i = new Map([...r.upstreamTasks, ...r.downstreamTasks].map((e) => [e.id, e]));
+		let r = await nr(t, e.id), i = new Map([...r.upstreamTasks, ...r.downstreamTasks].map((e) => [e.id, e]));
 		for (let n of r.dependencies) {
 			let r = n.taskId === e.id ? n.dependsOnTaskId : n.taskId;
 			if (i.has(r) || r === e.id) continue;
@@ -4866,14 +4875,14 @@ var Jn = $({
 		}
 		let a = [], o = [];
 		for (let t of r.dependencies) {
-			let { waiting: n, waitedFor: r } = $n(t), s = n === e.id ? r : n, c = i.get(s);
+			let { waiting: n, waitedFor: r } = er(t), s = n === e.id ? r : n, c = i.get(s);
 			if (!c || s === e.id) continue;
 			let ee = {
 				dependencyId: t.id,
 				taskId: c.id,
 				title: c.title,
 				status: c.status,
-				type: er(t)
+				type: tr(t)
 			};
 			(n === e.id ? a : o).push(ee);
 		}
@@ -4886,7 +4895,7 @@ var Jn = $({
 		};
 	}
 });
-function $n(e) {
+function er(e) {
 	let t = r(e);
 	return t ? {
 		waiting: t.after,
@@ -4896,22 +4905,22 @@ function $n(e) {
 		waitedFor: e.dependsOnTaskId
 	};
 }
-var er = (e) => e.type === "relates_to" ? "relates_to" : "blocking";
-async function tr(e, t) {
-	let { isEngine: n } = await qn(e);
+var tr = (e) => e.type === "relates_to" ? "relates_to" : "blocking";
+async function nr(e, t) {
+	let { isEngine: n } = await Jn(e);
 	return n ? e.getTaskDependencyGraph(t) : e.getTaskDependencies(t);
 }
-var nr = $({
+var rr = $({
 	name: "create_task",
 	title: "Create Task",
 	description: "Create a task in a project. Check with `list_tasks` first so you do not add a duplicate. Without a status the task starts in the project's default workflow status. Returns the created task with its id.",
 	toolset: "core",
 	outputZodSchema: Tn,
 	zodSchema: B({
-		projectId: I().optional().describe("Project ID (inferred from active view in browser if omitted)"),
-		title: I().describe("Title of the task"),
-		description: I().optional().describe("Detailed description / markdown"),
-		status: I().optional().describe("Status key (defaults to the project workflow's default status)"),
+		projectId: F().optional().describe("Project ID (inferred from active view in browser if omitted)"),
+		title: F().describe("Title of the task"),
+		description: F().optional().describe("Detailed description / markdown"),
+		status: F().optional().describe("Status key (defaults to the project workflow's default status)"),
 		priority: H([
 			"urgent",
 			"high",
@@ -4919,16 +4928,16 @@ var nr = $({
 			"low",
 			"none"
 		]).optional().default("none").describe("Task priority"),
-		assigneeId: I().optional().describe("User ID to assign task to"),
-		dueDate: I().optional().describe("Due date (ISO string)"),
-		deadline: I().optional().describe("Latest acceptable finish (YYYY-MM-DD for the end of that working day, or an ISO date-time). Critical path analysis reports a miss as negative slack"),
-		isMilestone: R().optional().describe("Mark the task as a milestone: a zero-duration checkpoint (release, sign-off) fed by dependencies; its estimate is ignored"),
-		tags: z(I()).optional().describe("Tags for categorization"),
-		estimatedHours: L().optional().describe("Estimated hours to complete"),
-		allocation: L().gt(0).max(1).optional().describe("Share of the assignee's time the task takes, in (0, 1]; e.g. 0.5 for half-time. Estimates are effort, so a 0.5 task takes twice as long"),
-		isBlocked: R().optional().describe("Whether the task is blocked"),
-		blockedReason: I().optional().describe("Reason why the task is blocked"),
-		customFields: V(Et()).optional().describe("Custom field values as a JSON object (validated against the project's field definitions for tasks)")
+		assigneeId: F().optional().describe("User ID to assign task to"),
+		dueDate: F().optional().describe("Due date (ISO string)"),
+		deadline: F().optional().describe("Latest acceptable finish (YYYY-MM-DD for the end of that working day, or an ISO date-time). Critical path analysis reports a miss as negative slack"),
+		isMilestone: L().optional().describe("Mark the task as a milestone: a zero-duration checkpoint (release, sign-off) fed by dependencies; its estimate is ignored"),
+		tags: z(F()).optional().describe("Tags for categorization"),
+		estimatedHours: I().optional().describe("Estimated hours to complete"),
+		allocation: I().gt(0).max(1).optional().describe("Share of the assignee's time the task takes, in (0, 1]; e.g. 0.5 for half-time. Estimates are effort, so a 0.5 task takes twice as long"),
+		isBlocked: L().optional().describe("Whether the task is blocked"),
+		blockedReason: F().optional().describe("Reason why the task is blocked"),
+		customFields: V(R()).optional().describe("Custom field values as a JSON object (validated against the project's field definitions for tasks)")
 	}),
 	execute: async (e, t, n) => {
 		let r = e.projectId || n?.projectId;
@@ -4952,17 +4961,17 @@ var nr = $({
 		};
 		return t.createTask(i);
 	}
-}), rr = $({
+}), ir = $({
 	name: "update_task",
 	title: "Update Task",
-	description: "Change an existing task: title, description, status, priority, assignee, due date, deadline, milestone flag, estimate, logged hours, allocation, blocked state, tags or custom fields. Only the fields you pass change. Use it to move a task through its workflow or re-plan it. Returns the updated task.",
+	description: "Change an existing task: title, description, status, priority, assignee, due date, deadline, milestone flag, estimate, allocation, blocked state, tags or custom fields. Only the fields you pass change. Use it to move a task through its workflow or re-plan it. Returns the updated task.",
 	toolset: "core",
 	outputZodSchema: Tn,
 	zodSchema: B({
-		id: I().describe("The task ID"),
-		title: I().optional().describe("New title"),
-		description: I().optional().describe("New description (markdown)"),
-		status: I().optional().describe("Status key from the project's workflow (see `get_project`)"),
+		id: F().describe("The task ID"),
+		title: F().optional().describe("New title"),
+		description: F().optional().describe("New description (markdown)"),
+		status: F().optional().describe("Status key from the project's workflow (see `get_project`)"),
 		priority: H([
 			"urgent",
 			"high",
@@ -4970,49 +4979,62 @@ var nr = $({
 			"low",
 			"none"
 		]).optional().describe("New priority"),
-		assigneeId: I().optional().describe("User ID to assign the task to"),
-		dueDate: I().optional().describe("Due date (ISO string)"),
-		deadline: I().optional().describe("Latest acceptable finish (YYYY-MM-DD for the end of that working day, or an ISO date-time). Critical path analysis reports a miss as negative slack"),
-		isMilestone: R().optional().describe("Mark the task as a milestone: a zero-duration checkpoint (release, sign-off) fed by dependencies; its estimate is ignored"),
-		tags: z(I()).optional().describe("Replaces all tags"),
-		estimatedHours: L().optional().describe("Estimated effort in hours"),
-		allocation: L().gt(0).max(1).optional().describe("Share of the assignee's time the task takes, in (0, 1]; e.g. 0.5 for half-time. Estimates are effort, so a 0.5 task takes twice as long"),
-		loggedHours: L().optional().describe("Total hours worked so far"),
-		isBlocked: R().optional().describe("Whether the task is blocked"),
-		blockedReason: I().optional().describe("Reason why the task is blocked"),
-		customFields: V(Et()).optional().describe("Custom field values as a JSON object (validated against the project's field definitions for tasks)")
+		assigneeId: F().optional().describe("User ID to assign the task to"),
+		dueDate: F().optional().describe("Due date (ISO string)"),
+		deadline: F().optional().describe("Latest acceptable finish (YYYY-MM-DD for the end of that working day, or an ISO date-time). Critical path analysis reports a miss as negative slack"),
+		isMilestone: L().optional().describe("Mark the task as a milestone: a zero-duration checkpoint (release, sign-off) fed by dependencies; its estimate is ignored"),
+		tags: z(F()).optional().describe("Replaces all tags"),
+		estimatedHours: I().optional().describe("Estimated effort in hours"),
+		allocation: I().gt(0).max(1).optional().describe("Share of the assignee's time the task takes, in (0, 1]; e.g. 0.5 for half-time. Estimates are effort, so a 0.5 task takes twice as long"),
+		isBlocked: L().optional().describe("Whether the task is blocked"),
+		blockedReason: F().optional().describe("Reason why the task is blocked"),
+		customFields: V(R()).optional().describe("Custom field values as a JSON object (validated against the project's field definitions for tasks)")
 	}),
 	annotations: { idempotentHint: !0 },
 	execute: async (e, t) => {
 		let { id: n, ...r } = e;
 		return t.updateTask(n, r);
 	}
-}), ir = $({
+}), ar = $({
 	name: "delete_task",
 	title: "Delete Task",
 	description: "Permanently delete a task by id. This cannot be undone: confirm with the user first, and prefer `update_task` with a canceled status when the history should be kept. Returns { success }.",
 	toolset: "core",
-	outputZodSchema: B({ success: R() }),
-	zodSchema: B({ id: I().describe("The task ID to delete") }),
+	outputZodSchema: B({ success: L() }),
+	zodSchema: B({ id: F().describe("The task ID to delete") }),
 	annotations: {
 		destructiveHint: !0,
 		idempotentHint: !0
 	},
 	execute: async (e, t) => ({ success: await t.deleteTask(e.id) })
-}), ar = $({
+}), or = $({
+	name: "log_time",
+	title: "Log Time",
+	description: "Record time worked on a task. The task's logged hours are the sum of its time entries, so this is how hours are added (they cannot be set directly). Returns the time entry.",
+	toolset: "core",
+	outputZodSchema: An,
+	zodSchema: B({
+		taskId: F().describe("The task worked on"),
+		hours: I().positive().describe("Hours worked, e.g. 1.5"),
+		description: F().optional().describe("What was done"),
+		isBillable: L().optional().describe("Whether the time is billable (default true)"),
+		loggedAt: F().optional().describe("When the work was done (ISO date-time; default now)")
+	}),
+	execute: async (e, t) => t.logTime(e)
+}), sr = $({
 	name: "add_dependency",
 	title: "Add Dependency",
 	description: "Record that a task cannot start until another task finishes, so the critical path schedules them in order. Use it when planning or re-sequencing work. Adding a link that already exists returns it; a link that would make a loop is refused. Returns the dependency { id, taskId, dependsOnTaskId, type }. To undo use `remove_dependency`.",
 	toolset: "core",
 	outputZodSchema: On,
 	zodSchema: B({
-		taskId: I().describe("The task that waits"),
-		dependsOnTaskId: I().describe("The task that must finish first"),
+		taskId: F().describe("The task that waits"),
+		dependsOnTaskId: F().describe("The task that must finish first"),
 		type: H(["blocking", "relates_to"]).optional().describe("'blocking' (default) affects the schedule; 'relates_to' only links the tasks for reference")
 	}),
 	annotations: { idempotentHint: !0 },
 	execute: async (e, t) => {
-		let n = e.type ?? "blocking", { isEngine: r } = await qn(t);
+		let n = e.type ?? "blocking", { isEngine: r } = await Jn(t);
 		return r ? t.addDependency({
 			taskId: e.taskId,
 			dependsOnTaskId: e.dependsOnTaskId,
@@ -5022,58 +5044,58 @@ var nr = $({
 			type: n
 		});
 	}
-}), or = $({
+}), cr = $({
 	name: "remove_dependency",
 	title: "Remove Dependency",
 	description: "Stop a task waiting for another task, for example when the order was wrong or the work no longer depends on it. Identify the link by its two task ids, as given to `add_dependency`. Removing a link that does not exist is not an error. Returns { removed, dependencyIds } with the number of links removed.",
 	toolset: "core",
 	outputZodSchema: B({
-		removed: L().describe("How many dependency records were removed (0 if none matched)"),
-		dependencyIds: z(I()).describe("Ids of the removed records")
+		removed: I().describe("How many dependency records were removed (0 if none matched)"),
+		dependencyIds: z(F()).describe("Ids of the removed records")
 	}),
 	zodSchema: B({
-		taskId: I().describe("The task that waits"),
-		dependsOnTaskId: I().describe("The task it waits for"),
+		taskId: F().describe("The task that waits"),
+		dependsOnTaskId: F().describe("The task it waits for"),
 		type: H(["blocking", "relates_to"]).optional().describe("Remove only links of this type (default: both)")
 	}),
 	annotations: { idempotentHint: !0 },
 	execute: async (e, t) => {
-		let n = (await tr(t, e.taskId)).dependencies.filter((t) => {
-			let { waiting: n, waitedFor: r } = $n(t);
-			return n === e.taskId && r === e.dependsOnTaskId && (!e.type || er(t) === e.type);
-		}), { isEngine: r } = await qn(t), i = [];
+		let n = (await nr(t, e.taskId)).dependencies.filter((t) => {
+			let { waiting: n, waitedFor: r } = er(t);
+			return n === e.taskId && r === e.dependsOnTaskId && (!e.type || tr(t) === e.type);
+		}), { isEngine: r } = await Jn(t), i = [];
 		for (let e of n) (r ? await t.removeDependency(e.id) : await t.removeDependency(e.taskId, e.id)) && i.push(e.id);
 		return {
 			removed: i.length,
 			dependencyIds: i
 		};
 	}
-}), sr = $({
+}), lr = $({
 	name: "list_deliverables",
 	title: "List Deliverables",
 	description: "List a project's deliverables: outputs that group the tasks producing them. Use it to see what is due and which tasks feed each deliverable. For dated checkpoints, look for milestone tasks (`isMilestone`). Returns { deliverables }.",
 	toolset: "collaboration",
 	outputZodSchema: B({ deliverables: z(kn) }),
-	zodSchema: B({ projectId: I().optional().describe("Project ID (falls back to ambient context if omitted)") }),
+	zodSchema: B({ projectId: F().optional().describe("Project ID (falls back to ambient context if omitted)") }),
 	annotations: { readOnlyHint: !0 },
 	execute: async (e, t, n) => {
 		let r = e.projectId || n?.projectId;
 		if (!r) throw Error("projectId is required to list deliverables. Find one with `list_projects`.");
 		return "getDeliverables" in t && typeof t.getDeliverables == "function" ? { deliverables: await t.getDeliverables(r) } : { deliverables: [] };
 	}
-}), cr = $({
+}), ur = $({
 	name: "create_deliverable",
 	title: "Create Deliverable",
 	description: "Create a deliverable in a project, optionally linking existing tasks by id. Use it for an output (a document, a build, an asset) that several tasks produce. For a dated checkpoint the schedule should enforce, create a task with `isMilestone: true` and a `deadline` instead. Returns the created deliverable.",
 	toolset: "collaboration",
 	outputZodSchema: kn,
 	zodSchema: B({
-		projectId: I().optional().describe("Project ID (falls back to ambient context if omitted)"),
-		title: I().describe("Name of the deliverable"),
-		description: I().optional().describe("What the deliverable is and how it is accepted"),
-		dueDate: I().optional().describe("Due date (ISO string)"),
-		taskIds: z(I()).optional().describe("IDs of existing tasks that feed this deliverable"),
-		customFields: V(Et()).optional().describe("Custom field values as a JSON object (validated against the project's field definitions for tasks)")
+		projectId: F().optional().describe("Project ID (falls back to ambient context if omitted)"),
+		title: F().describe("Name of the deliverable"),
+		description: F().optional().describe("What the deliverable is and how it is accepted"),
+		dueDate: F().optional().describe("Due date (ISO string)"),
+		taskIds: z(F()).optional().describe("IDs of existing tasks that feed this deliverable"),
+		customFields: V(R()).optional().describe("Custom field values as a JSON object (validated against the project's field definitions for tasks)")
 	}),
 	execute: async (e, t, n) => {
 		let r = e.projectId || n?.projectId;
@@ -5084,60 +5106,60 @@ var nr = $({
 		});
 		throw Error("createDeliverable is not supported by this backend target.");
 	}
-}), lr = $({
+}), dr = $({
 	name: "list_comments",
 	title: "List Comments",
 	description: "List the comments on a task. Use it to read the discussion, decisions or blockers recorded there. Returns { comments }.",
 	toolset: "collaboration",
-	outputZodSchema: B({ comments: z(An) }),
-	zodSchema: B({ taskId: I().describe("The task ID") }),
+	outputZodSchema: B({ comments: z(jn) }),
+	zodSchema: B({ taskId: F().describe("The task ID") }),
 	annotations: { readOnlyHint: !0 },
 	execute: async (e, t) => "getComments" in t && typeof t.getComments == "function" ? { comments: await t.getComments(e.taskId) } : { comments: [] }
-}), ur = $({
+}), fr = $({
 	name: "add_comment",
 	title: "Add Comment",
 	description: "Post a comment on a task, attributed to the identity this server runs as. Use it to record a decision, status note, question or the reasoning behind a change you made. Returns the created comment.",
 	toolset: "collaboration",
-	outputZodSchema: An,
+	outputZodSchema: jn,
 	zodSchema: B({
-		taskId: I().describe("The task ID"),
-		content: I().describe("Comment body/markdown"),
-		customFields: V(Et()).optional().describe("Custom field values as a JSON object (validated against the project's field definitions for tasks)")
+		taskId: F().describe("The task ID"),
+		content: F().describe("Comment body/markdown"),
+		customFields: V(R()).optional().describe("Custom field values as a JSON object (validated against the project's field definitions for tasks)")
 	}),
 	execute: async (e, t) => t.addComment({
 		taskId: e.taskId,
 		content: e.content,
 		customFields: e.customFields
 	})
-}), dr = $({
+}), pr = $({
 	name: "calculate_portfolio_critical_path",
 	title: "Calculate Portfolio Critical Path",
 	description: "Schedule several projects together (default: every project you can read) so people and teams shared between them are not double-booked. Use it for cross-project delivery dates and resource conflicts. Returns { projects, projectEndDate, overallocations } with one analysis per project. For a single project use `calculate_critical_path`.",
 	toolset: "scheduling",
-	outputZodSchema: Pn,
+	outputZodSchema: Fn,
 	zodSchema: B({
-		projectIds: z(I()).optional().describe("Projects to include (default: every project you can read)"),
-		projectOrder: z(I()).optional().describe("Project ids in priority order for levelling; unlisted projects come last"),
-		includeHiddenWork: R().optional().describe("Also count other projects' work (even unreadable ones, shown only as 'hidden') toward people's capacity. Requires workspace.manage"),
+		projectIds: z(F()).optional().describe("Projects to include (default: every project you can read)"),
+		projectOrder: z(F()).optional().describe("Project ids in priority order for levelling; unlisted projects come last"),
+		includeHiddenWork: L().optional().describe("Also count other projects' work (even unreadable ones, shown only as 'hidden') toward people's capacity. Requires workspace.manage"),
 		calendars: H(["project", "assignee"]).optional().describe("'assignee' schedules each task on its assignee's or team's calendar"),
-		levelResources: R().optional().describe("With calendars 'assignee': share people and team pools across the projects"),
+		levelResources: L().optional().describe("With calendars 'assignee': share people and team pools across the projects"),
 		levelingPriority: H([
 			"slack",
 			"priority",
 			"dueDate",
 			"order"
 		]).optional().describe("Which ready task gets an assignee first when levelling (default: least slack, then task priority)"),
-		effort: H(["estimate", "remaining"]).optional().describe("'remaining' schedules only estimate minus logged hours for in-progress tasks (default: full estimates)")
+		effort: H(["estimate", "remaining"]).optional().describe("'remaining' schedules only estimate minus logged hours for in-progress tasks (default: full estimates)"),
+		defaultEstimateHours: I().nonnegative().optional().describe("Hours to assume for tasks with no estimate (default 1). They are listed in unestimatedTaskIds")
 	}),
 	annotations: { readOnlyHint: !0 },
 	execute: async (e, t) => t.calculatePortfolioCriticalPath(e)
-}), fr = [
-	Jn,
+}), mr = [
 	Yn,
 	Xn,
 	Zn,
 	Qn,
-	nr,
+	$n,
 	rr,
 	ir,
 	ar,
@@ -5146,54 +5168,58 @@ var nr = $({
 	cr,
 	lr,
 	ur,
+	dr,
+	fr,
 	$({
 		name: "calculate_critical_path",
 		title: "Calculate Critical Path",
 		description: "Schedule one project with the Critical Path Method: which tasks drive the end date, each task's early and late start and finish, and how much it can slip (slack). Use it for \"when will this finish?\", \"what is on the critical path?\" or \"can this task slip?\". Set calendars 'assignee' with levelResources so each person works on one task at a time. Returns { projectEndDate, criticalTaskIds, tasks, overallocations }. For several projects that share people use `calculate_portfolio_critical_path`.",
 		toolset: "scheduling",
-		outputZodSchema: Nn,
+		outputZodSchema: Pn,
 		zodSchema: B({
-			projectId: I().optional().describe("Project ID (falls back to ambient context if omitted)"),
+			projectId: F().optional().describe("Project ID (falls back to ambient context if omitted)"),
 			calendars: H(["project", "assignee"]).optional().describe("'assignee' schedules each task on its assignee's or team's working calendar; default uses the project calendar"),
-			levelResources: R().optional().describe("With calendars 'assignee': delay tasks so each assignee works on one task at a time"),
+			levelResources: L().optional().describe("With calendars 'assignee': delay tasks so each assignee works on one task at a time"),
 			levelingPriority: H([
 				"slack",
 				"priority",
 				"dueDate",
 				"order"
 			]).optional().describe("Which ready task gets an assignee first when levelling (default: least slack, then task priority)"),
-			effort: H(["estimate", "remaining"]).optional().describe("'remaining' schedules only estimate minus logged hours for in-progress tasks (default: full estimates)")
+			effort: H(["estimate", "remaining"]).optional().describe("'remaining' schedules only estimate minus logged hours for in-progress tasks (default: full estimates)"),
+			defaultEstimateHours: I().nonnegative().optional().describe("Hours to assume for tasks with no estimate (default 1). They are listed in unestimatedTaskIds")
 		}),
 		annotations: { readOnlyHint: !0 },
 		execute: async (e, t, n) => {
 			let r = e.projectId || n?.projectId;
 			if (!r) throw Error("projectId is required to calculate the critical path. Find one with `list_projects`.");
-			let { calendars: i, levelResources: a, levelingPriority: o, effort: s } = e;
+			let { calendars: i, levelResources: a, levelingPriority: o, effort: s, defaultEstimateHours: c } = e;
 			return t.calculateCriticalPath(r, {
 				calendars: i,
 				levelResources: a,
 				levelingPriority: o,
-				effort: s
+				effort: s,
+				defaultEstimateHours: c
 			});
 		}
 	}),
-	dr,
+	pr,
 	$({
 		name: "get_timeline_ladder",
 		title: "Get Timeline Ladder of Abstraction",
 		description: "Project status at three zoom levels: 'macro' phases with health (on_track, at_risk, blocked, overdue) and progress, 'standard' task timeline with the critical path and dependencies, and 'concrete' evidence of work (time logged, attachments) per task. Use it for project status reports; level 'macro' gives a compact summary. Returns { macro, standard, concrete }. For a single task use `get_task_ladder`.",
 		toolset: "analytics",
-		outputZodSchema: In,
+		outputZodSchema: Ln,
 		zodSchema: B({
-			projectId: I().optional().describe("Project ID (falls back to ambient context if omitted)"),
+			projectId: F().optional().describe("Project ID (falls back to ambient context if omitted)"),
 			level: H([
 				"macro",
 				"standard",
 				"concrete",
 				"all"
 			]).optional().describe("Abstraction level (macro, standard, concrete, or all)"),
-			containerId: I().optional().describe("Optional container ID filter"),
-			iterationId: I().optional().describe("Optional iteration/sprint ID filter")
+			containerId: F().optional().describe("Optional container ID filter"),
+			iterationId: F().optional().describe("Optional iteration/sprint ID filter")
 		}),
 		annotations: { readOnlyHint: !0 },
 		execute: async (e, t, n) => {
@@ -5211,8 +5237,8 @@ var nr = $({
 		title: "Get Task Ladder View",
 		description: "One task in context: the phase it belongs to and that phase's health, its place in the schedule (dates, slack, critical or not) and evidence of work done. Use it to explain where a task fits and whether it puts its phase at risk. Returns { macroPhase, standard, concrete, metrics }. For the numbers alone use `get_task_metrics`.",
 		toolset: "analytics",
-		outputZodSchema: Ln,
-		zodSchema: B({ taskId: I().describe("The task ID") }),
+		outputZodSchema: Rn,
+		zodSchema: B({ taskId: F().describe("The task ID") }),
 		annotations: { readOnlyHint: !0 },
 		execute: async (e, t) => t.getTaskLadder(e.taskId)
 	}),
@@ -5221,8 +5247,8 @@ var nr = $({
 		title: "Get Task Metrics",
 		description: "Is a task on track? Progress percentage, actual against estimated hours, schedule variance, overdue flags and earned value (CPI, SPI). Use it to diagnose a late or over-budget task. Returns { progress, realityDelta, evm, inferredActuals, progressHistory }.",
 		toolset: "analytics",
-		outputZodSchema: zn,
-		zodSchema: B({ taskId: I().describe("The task ID") }),
+		outputZodSchema: Bn,
+		zodSchema: B({ taskId: F().describe("The task ID") }),
 		annotations: { readOnlyHint: !0 },
 		execute: async (e, t) => t.getTaskMetrics(e.taskId)
 	}),
@@ -5231,8 +5257,8 @@ var nr = $({
 		title: "Get Task Progress History",
 		description: "How a task's progress has moved over time: dated progress points and a curve shape (linear, s_curve, early_surge, late_rush, stalled). Use it to tell whether work is stalling or being rushed at the end. Returns { points, curveProfile }. `get_task_metrics` includes the same history alongside variance and earned value.",
 		toolset: "analytics",
-		outputZodSchema: Rn,
-		zodSchema: B({ taskId: I().describe("The task ID") }),
+		outputZodSchema: zn,
+		zodSchema: B({ taskId: F().describe("The task ID") }),
 		annotations: { readOnlyHint: !0 },
 		execute: async (e, t) => t.getTaskProgressHistory(e.taskId)
 	}),
@@ -5241,11 +5267,11 @@ var nr = $({
 		title: "Get Workload Distribution",
 		description: "Hours of work per person, team, task type, priority or status in each day, week or month, with capacity and utilization. Use it for \"who is overloaded?\" and capacity planning; a utilizationRatio above 1 means more work than capacity. Omit projectId for the whole workspace. Returns { buckets, seriesKeys, seriesLabels, totalHours, averageUtilization }.",
 		toolset: "scheduling",
-		outputZodSchema: Bn,
+		outputZodSchema: Vn,
 		zodSchema: B({
-			projectId: I().optional().describe("Project ID (optional, defaults to workspace-wide or ambient project)"),
-			startDate: I().optional().describe("Start date ISO (YYYY-MM-DD)"),
-			endDate: I().optional().describe("End date ISO (YYYY-MM-DD)"),
+			projectId: F().optional().describe("Project ID (optional, defaults to workspace-wide or ambient project)"),
+			startDate: F().optional().describe("Start date ISO (YYYY-MM-DD)"),
+			endDate: F().optional().describe("End date ISO (YYYY-MM-DD)"),
 			interval: H([
 				"day",
 				"week",
@@ -5264,7 +5290,7 @@ var nr = $({
 				"remaining",
 				"blended"
 			]).optional().describe("Effort metric mode"),
-			defaultWeeklyCapacityHours: L().optional().describe("Default weekly capacity hours per person (default 40)")
+			defaultWeeklyCapacityHours: I().optional().describe("Default weekly capacity hours per person (default 40)")
 		}),
 		annotations: { readOnlyHint: !0 },
 		execute: async (e, t, n) => {
@@ -5284,49 +5310,49 @@ var nr = $({
 		title: "Get Skill",
 		description: "Load a step-by-step playbook for a multi-step project management job, such as planning a project, triaging tasks, finding schedule risk, writing a status report, checking capacity or investigating a late task. Call it before starting such a job and follow its steps. Omit name to list the skills. Returns { name, description, content }, or { skills } without a name.",
 		toolset: "guidance",
-		outputZodSchema: Vn,
-		zodSchema: B({ name: I().optional().describe("Skill name, e.g. \"plan-project\"; omit to list all skills") }),
+		outputZodSchema: Hn,
+		zodSchema: B({ name: F().optional().describe("Skill name, e.g. \"plan-project\"; omit to list all skills") }),
 		annotations: { readOnlyHint: !0 },
 		execute: async (e) => {
 			if (!e.name) return { skills: Q.map(({ name: e, description: t }) => ({
 				name: e,
 				description: t
 			})) };
-			let t = Hn(e.name);
+			let t = Un(e.name);
 			if (!t) throw Error(`Skill "${e.name}" not found. Available skills: ${Q.map((e) => e.name).join(", ")}.`);
 			return t;
 		}
 	})
-], pr = new Map(fr.map((e) => [e.name, e]));
-function mr(e = {}) {
-	let { tools: t, toolsets: n, readOnly: r } = e, i = (t ?? []).filter((e) => !pr.has(e));
-	if (i.length > 0) throw Error(`Unknown Critical Path tool(s): ${i.join(", ")}. Known tools: ${fr.map((e) => e.name).join(", ")}.`);
-	let a = (n ?? []).filter((e) => !(e in Un));
-	if (a.length > 0) throw Error(`Unknown Critical Path toolset(s): ${a.join(", ")}. Known toolsets: ${Object.keys(Un).join(", ")}.`);
+], hr = new Map(mr.map((e) => [e.name, e]));
+function gr(e = {}) {
+	let { tools: t, toolsets: n, readOnly: r } = e, i = (t ?? []).filter((e) => !hr.has(e));
+	if (i.length > 0) throw Error(`Unknown Critical Path tool(s): ${i.join(", ")}. Known tools: ${mr.map((e) => e.name).join(", ")}.`);
+	let a = (n ?? []).filter((e) => !(e in Wn));
+	if (a.length > 0) throw Error(`Unknown Critical Path toolset(s): ${a.join(", ")}. Known toolsets: ${Object.keys(Wn).join(", ")}.`);
 	let o = !t && !n;
-	return fr.filter((e) => (o || t?.includes(e.name) || n?.includes(e.toolset)) && (!r || e.annotations.readOnlyHint));
+	return mr.filter((e) => (o || t?.includes(e.name) || n?.includes(e.toolset)) && (!r || e.annotations.readOnlyHint));
 }
-var hr = class extends Error {
+var _r = class extends Error {
 	constructor(e) {
 		super(e), this.name = "ToolNotFoundError";
 	}
-}, gr = "Check the id: find valid project ids with `list_projects` and task ids with `list_tasks`. Ids are never guessable, and items you cannot read are reported as not found.";
-async function _r(e, t, n, r) {
+}, vr = "Check the id: find valid project ids with `list_projects` and task ids with `list_tasks`. Ids are never guessable, and items you cannot read are reported as not found.";
+async function yr(e, t, n, r) {
 	try {
-		let i = await e.execute(Kn(e, t), n, r);
-		if (i == null) throw new hr(`Nothing found for ${JSON.stringify(t ?? {})}.`);
+		let i = await e.execute(qn(e, t), n, r);
+		if (i == null) throw new _r(`Nothing found for ${JSON.stringify(t ?? {})}.`);
 		return JSON.parse(JSON.stringify(i));
 	} catch (t) {
-		throw Error(vr(e, t));
+		throw Error(br(e, t));
 	}
 }
-function vr(e, t) {
+function br(e, t) {
 	let n = t?.message || String(t);
-	return t instanceof Gn ? `${n}. Fix the arguments to match the input schema of "${e.name}" and call it again.` : t instanceof hr || t?.name === "NotFoundError" || t?.status === 404 || /not found/i.test(n) ? `${n} ${gr}` : t?.name === "CircularDependencyError" || /circular/i.test(n) ? `${n} The tasks are already ordered the other way round. Check with \`get_task\` and includeDependencies, and ask the user which order is right rather than retrying.` : t?.name === "ForbiddenError" || t?.status === 403 ? `${n} You do not have permission for this; tell the user rather than retrying.` : n;
+	return t instanceof Kn ? `${n}. Fix the arguments to match the input schema of "${e.name}" and call it again.` : t instanceof _r || t?.name === "NotFoundError" || t?.status === 404 || /not found/i.test(n) ? `${n} ${vr}` : t?.name === "CircularDependencyError" || /circular/i.test(n) ? `${n} The tasks are already ordered the other way round. Check with \`get_task\` and includeDependencies, and ask the user which order is right rather than retrying.` : t?.name === "ForbiddenError" || t?.status === 403 ? `${n} You do not have permission for this; tell the user rather than retrying.` : n;
 }
 //#endregion
 //#region ../mcp/dist/tools/instructions.js
-var yr = [
+var xr = [
 	{
 		when: "Find a project or task id",
 		tools: ["list_projects", "list_tasks"]
@@ -5380,7 +5406,7 @@ var yr = [
 		tools: ["get_workload_distribution"]
 	}
 ];
-function br(e, t = {}) {
+function Sr(e, t = {}) {
 	let n = new Set(e.map((e) => e.name)), r = [
 		"Critical Path is a project management backend. A project holds tasks and deliverables (outputs that group the tasks producing them). Tasks have a workflow status, priority, assignee, effort estimate, logged hours, optional subtasks (parentId) and dependencies, and comments. A task with `isMilestone: true` is a zero-duration checkpoint, and a `deadline` on any task is enforced by critical path analysis.",
 		"",
@@ -5391,7 +5417,7 @@ function br(e, t = {}) {
 		"- Confirm with the user before any tool marked destructive."
 	];
 	t.projectId && r.push(`- The user is viewing project "${t.projectId}"; tools use it when you omit projectId.`);
-	let i = yr.map((e) => ({
+	let i = xr.map((e) => ({
 		...e,
 		tools: e.tools.filter((e) => n.has(e))
 	})).filter((e) => e.tools.length > 0);
@@ -5407,7 +5433,7 @@ function br(e, t = {}) {
 }
 //#endregion
 //#region ../mcp/dist/web/index.js
-function xr(e = typeof document < "u" ? document : null) {
+function Cr(e = typeof document < "u" ? document : null) {
 	if (!e) return null;
 	if (!e.modelContext) {
 		let t = /* @__PURE__ */ new Map();
@@ -5432,14 +5458,14 @@ function xr(e = typeof document < "u" ? document : null) {
 	}
 	return e.modelContext;
 }
-function Sr(e) {
+function wr(e) {
 	let t = e.document ?? (typeof document < "u" ? document : null), n = e.navigator ?? (typeof navigator < "u" ? navigator : null), r = e.window ?? (typeof window < "u" ? window : null), i;
-	t?.modelContext ? i = t.modelContext : n?.modelContext ? i = n.modelContext : t && (i = xr(t) ?? void 0);
-	let a = mr({
+	t?.modelContext ? i = t.modelContext : n?.modelContext ? i = n.modelContext : t && (i = Cr(t) ?? void 0);
+	let a = gr({
 		tools: e.tools,
 		toolsets: e.toolsets,
 		readOnly: e.readOnly
-	}), o = br(a, { projectId: e.projectId }), s = [], c = new AbortController();
+	}), o = Sr(a, { projectId: e.projectId }), s = [], c = new AbortController();
 	if (e.signal?.aborted) return {
 		unregister: () => {},
 		getRegisteredTools: () => [],
@@ -5455,7 +5481,7 @@ function Sr(e) {
 			outputSchema: t.outputSchema,
 			annotations: { ...t.annotations },
 			execute: async (n) => {
-				let r = e.projectId ? { projectId: e.projectId } : void 0, i = await _r(t, n, e.client, r);
+				let r = e.projectId ? { projectId: e.projectId } : void 0, i = await yr(t, n, e.client, r);
 				return e.onToolExecuted?.(t.name, n, i), i;
 			}
 		};
@@ -5485,7 +5511,7 @@ function Sr(e) {
 }
 //#endregion
 //#region src/webmcp-state.svelte.ts
-var Cr = class {
+var Tr = class {
 	client;
 	options;
 	#e = t.state(!1);
@@ -5532,7 +5558,7 @@ var Cr = class {
 		if (!this.registered) {
 			this.error = null;
 			try {
-				this.abortController = new AbortController(), this.handle = Sr({
+				this.abortController = new AbortController(), this.handle = wr({
 					client: this.client,
 					projectId: this.activeProjectId,
 					tools: this.options.tools,
@@ -5558,12 +5584,12 @@ var Cr = class {
 		this.activeProjectId !== e && (this.activeProjectId = e, this.registered && (this.unregister(), this.register()));
 	}
 };
-function wr(e, t) {
-	return new Cr(e, t);
+function Er(e, t) {
+	return new Tr(e, t);
 }
 //#endregion
 //#region src/critical-path-state.svelte.ts
-var Tr = class {
+var Dr = class {
 	client;
 	projectId;
 	#e = new a();
@@ -5607,12 +5633,12 @@ var Tr = class {
 		this.#e.cancel();
 	}
 };
-function Er(e, t) {
-	return new Tr(e, t);
+function Or(e, t) {
+	return new Dr(e, t);
 }
 //#endregion
 //#region src/timeline-ladder-state.svelte.ts
-var Dr = class {
+var kr = class {
 	client;
 	projectId;
 	#e = new a();
@@ -5690,12 +5716,12 @@ var Dr = class {
 		this.#e.cancel();
 	}
 };
-function Or(e, t, n) {
-	return new Dr(e, t, n);
+function Ar(e, t, n) {
+	return new kr(e, t, n);
 }
 //#endregion
 //#region src/task-metrics-state.svelte.ts
-var kr = class {
+var jr = class {
 	client;
 	taskId;
 	#e = new a();
@@ -5814,12 +5840,12 @@ var kr = class {
 		this.#e.cancel(), this.#t.cancel(), this.#n.cancel();
 	}
 };
-function Ar(e, t) {
-	return new kr(e, t);
+function Mr(e, t) {
+	return new jr(e, t);
 }
 //#endregion
 //#region src/workload-state.svelte.ts
-var jr = class {
+var Nr = class {
 	client;
 	projectId;
 	initialOptions;
@@ -5942,13 +5968,13 @@ var jr = class {
 		this.#e.cancel();
 	}
 };
-function Mr(e, t, n) {
-	return new jr(e, t, n);
+function Pr(e, t, n) {
+	return new Nr(e, t, n);
 }
 //#endregion
 //#region src/index.ts
-function Nr(t) {
+function Fr(t) {
 	return new e(t);
 }
 //#endregion
-export { ae as AttachmentState, re as CommentState, Tr as CriticalPathState, le as DeliverableState, de as DeliverableSummaryState, pe as KanbanState, o as ProjectState, se as TaskActivityState, kr as TaskMetricsState, c as TaskState, he as TaskTransitionsState, Dr as TimelineLadderState, Cr as WebMcpState, te as WorkflowState, jr as WorkloadState, oe as createAttachmentState, ie as createCommentState, Nr as createCriticalPathClient, Er as createCriticalPathState, ue as createDeliverableState, fe as createDeliverableSummaryState, me as createKanbanState, s as createProjectState, ce as createTaskActivityState, Ar as createTaskMetricsState, ee as createTaskState, ge as createTaskTransitionsState, Or as createTimelineLadderState, wr as createWebMcpState, ne as createWorkflowState, Mr as createWorkloadState };
+export { ae as AttachmentState, re as CommentState, Dr as CriticalPathState, le as DeliverableState, de as DeliverableSummaryState, pe as KanbanState, o as ProjectState, se as TaskActivityState, jr as TaskMetricsState, c as TaskState, he as TaskTransitionsState, kr as TimelineLadderState, Tr as WebMcpState, te as WorkflowState, Nr as WorkloadState, oe as createAttachmentState, ie as createCommentState, Fr as createCriticalPathClient, Or as createCriticalPathState, ue as createDeliverableState, fe as createDeliverableSummaryState, me as createKanbanState, s as createProjectState, ce as createTaskActivityState, Mr as createTaskMetricsState, ee as createTaskState, ge as createTaskTransitionsState, Ar as createTimelineLadderState, Er as createWebMcpState, ne as createWorkflowState, Pr as createWorkloadState };