@manyducks.co/dolla 2.0.0 → 3.0.0

package/dist/signals-CMJPGr_M.js

@@ -0,0 +1,354 @@
+//#region src/utils.ts
+var e = 0;
+function t() {
+	return (e++).toString(36);
+}
+function n(e, t) {
+	let n = {};
+	for (let r in t) e.includes(r) || (n[r] = t[r]);
+	return n;
+}
+function r(e, t) {
+	if (!e) throw TypeError(t);
+}
+function i(e) {
+	return Array.isArray(e);
+}
+function a(e) {
+	return typeof e == "string";
+}
+function o(e) {
+	return typeof e == "function" && !s(e);
+}
+function s(e) {
+	return /^\s*class\s+/.test(String(e));
+}
+function c(e) {
+	return typeof e == "number" && !isNaN(e);
+}
+function l(e) {
+	return typeof e == "object" && !!e && !i(e);
+}
+//#endregion
+//#region src/core/signals.ts
+var u = /* @__PURE__ */ function(e) {
+	return e[e.None = 0] = "None", e[e.Mutable = 1] = "Mutable", e[e.Watching = 2] = "Watching", e[e.RecursedCheck = 4] = "RecursedCheck", e[e.Recursed = 8] = "Recursed", e[e.Dirty = 16] = "Dirty", e[e.Pending = 32] = "Pending", e;
+}(u || {}), d = 0, f = 0, p = 0, m = 0, h, g = [];
+function _(e, t, n) {
+	let r = t._depsTail;
+	if (r !== void 0 && r._dep === e) return;
+	let i = r === void 0 ? t._deps : r._nextDep;
+	if (i !== void 0 && i._dep === e) {
+		i._version = n, t._depsTail = i;
+		return;
+	}
+	let a = e._subsTail;
+	if (a !== void 0 && a._version === n && a._sub === t) return;
+	let o = t._depsTail = e._subsTail = {
+		_version: n,
+		_dep: e,
+		_sub: t,
+		_prevDep: r,
+		_nextDep: i,
+		_prevSub: a,
+		_nextSub: void 0
+	};
+	i !== void 0 && (i._prevDep = o), r === void 0 ? t._deps = o : r._nextDep = o, a === void 0 ? e._subs = o : a._nextSub = o;
+}
+function v(e) {
+	e._flags & u.Mutable ? e._depsTail !== void 0 && (e._depsTail = void 0, e._flags = u.Mutable | u.Dirty, j(e)) : L.call(e);
+}
+function y(e, t = e._sub) {
+	let n = e._dep, r = e._prevDep, i = e._nextDep, a = e._nextSub, o = e._prevSub;
+	return i === void 0 ? t._depsTail = r : i._prevDep = r, r === void 0 ? t._deps = i : r._nextDep = i, a === void 0 ? n._subsTail = o : a._prevSub = o, o === void 0 ? (n._subs = a) === void 0 && v(n) : o._nextSub = a, i;
+}
+function b(e) {
+	let t = m, n = t;
+	do
+		if (g[t++] = e, e._flags &= ~u.Watching, e = e._subs?._sub, e === void 0 || !(e._flags & u.Watching)) break;
+	while (!0);
+	for (m = t; n < --t;) {
+		let e = g[n];
+		g[n++] = g[t], g[t] = e;
+	}
+}
+function x(e) {
+	return e._depsTail === void 0 ? O(e) : D(e);
+}
+function S(e) {
+	let t = e._nextSub, n;
+	top: do {
+		let r = e._sub, i = r._flags;
+		if (i & (u.RecursedCheck | u.Recursed | u.Dirty | u.Pending) ? i & (u.RecursedCheck | u.Recursed) ? i & u.RecursedCheck ? !(i & (u.Dirty | u.Pending)) && T(e, r) ? (r._flags = i | (u.Recursed | u.Pending), i &= u.Mutable) : i = u.None : r._flags = i & ~u.Recursed | u.Pending : i = u.None : r._flags = i | u.Pending, i & u.Watching && b(r), i & u.Mutable) {
+			let i = r._subs;
+			if (i !== void 0) {
+				let r = (e = i)._nextSub;
+				r !== void 0 && (n = {
+					_value: t,
+					_prev: n
+				}, t = r);
+				continue;
+			}
+		}
+		if ((e = t) !== void 0) {
+			t = e._nextSub;
+			continue;
+		}
+		for (; n !== void 0;) if (e = n._value, n = n._prev, e !== void 0) {
+			t = e._nextSub;
+			continue top;
+		}
+		break;
+	} while (!0);
+}
+function C(e, t) {
+	let n, r = 0, i = !1;
+	top: do {
+		let a = e._dep, o = a._flags;
+		if (t._flags & u.Dirty) i = !0;
+		else if ((o & (u.Mutable | u.Dirty)) === (u.Mutable | u.Dirty)) {
+			if (x(a)) {
+				let e = a._subs;
+				e._nextSub !== void 0 && w(e), i = !0;
+			}
+		} else if ((o & (u.Mutable | u.Pending)) === (u.Mutable | u.Pending)) {
+			(e._nextSub !== void 0 || e._prevSub !== void 0) && (n = {
+				_value: e,
+				_prev: n
+			}), e = a._deps, t = a, ++r;
+			continue;
+		}
+		if (!i) {
+			let t = e._nextDep;
+			if (t !== void 0) {
+				e = t;
+				continue;
+			}
+		}
+		for (; r--;) {
+			let r = t._subs, a = r._nextSub !== void 0;
+			if (a ? (e = n._value, n = n._prev) : e = r, i) {
+				if (x(t)) {
+					a && w(r), t = e._sub;
+					continue;
+				}
+				i = !1;
+			} else t._flags &= ~u.Pending;
+			t = e._sub;
+			let o = e._nextDep;
+			if (o !== void 0) {
+				e = o;
+				continue top;
+			}
+		}
+		return i;
+	} while (!0);
+}
+function w(e) {
+	do {
+		let t = e._sub, n = t._flags;
+		(n & (u.Pending | u.Dirty)) === u.Pending && (t._flags = n | u.Dirty, (n & (u.Watching | u.RecursedCheck)) === u.Watching && b(t));
+	} while ((e = e._nextSub) !== void 0);
+}
+function T(e, t) {
+	let n = t._depsTail;
+	for (; n !== void 0;) {
+		if (n === e) return !0;
+		n = n._prevDep;
+	}
+	return !1;
+}
+function E(e) {
+	let t = h;
+	return h = e, t;
+}
+function D(e) {
+	++d, e._depsTail = void 0, e._flags = u.Mutable | u.RecursedCheck;
+	let t = E(e);
+	try {
+		let t = e._value;
+		return t !== (e._value = e._getter(t));
+	} finally {
+		h = t, e._flags &= ~u.RecursedCheck, j(e);
+	}
+}
+function O(e) {
+	return e._flags = u.Mutable, e._currentValue !== (e._currentValue = e._pendingValue);
+}
+function k(e) {
+	let t = e._flags;
+	if (t & u.Dirty || t & u.Pending && C(e._deps, e)) {
+		++d, e._depsTail = void 0, e._flags = u.Watching | u.RecursedCheck;
+		let t = E(e);
+		try {
+			e._cleanup?.(), e._cleanup = void 0;
+			let t = e._fn();
+			o(t) && (e._cleanup = t);
+		} finally {
+			h = t, e._flags &= ~u.RecursedCheck, j(e);
+		}
+	} else e._flags = u.Watching;
+}
+function A() {
+	try {
+		for (; p < m;) {
+			let e = g[p];
+			g[p++] = void 0, k(e);
+		}
+	} finally {
+		for (; p < m;) {
+			let e = g[p];
+			g[p++] = void 0, e._flags |= u.Watching | u.Recursed;
+		}
+		p = 0, m = 0;
+	}
+}
+function j(e) {
+	let t = e._depsTail, n = t === void 0 ? e._deps : t._nextDep;
+	for (; n !== void 0;) n = y(n, e);
+}
+function M(e, t) {
+	return o(e) ? H(() => e(t)) : e;
+}
+function N() {
+	let e = this._flags;
+	if (e & u.Dirty || e & u.Pending && (C(this._deps, this) || (this._flags = e & ~u.Pending, !1))) {
+		if (D(this)) {
+			let e = this._subs;
+			e !== void 0 && w(e);
+		}
+	} else if (!e) {
+		this._flags = u.Mutable | u.RecursedCheck;
+		let e = E(this);
+		try {
+			this._value = V(this._getter());
+		} finally {
+			h = e, this._flags &= ~u.RecursedCheck;
+		}
+	}
+	let t = h;
+	return t !== void 0 && _(this, t, d), this._value;
+}
+function P(e) {
+	let t = M(e, this._value);
+	if (this._value !== t) {
+		this._value = t, this._flags &= ~(u.Dirty | u.Pending);
+		let e = this._subs;
+		for (; e !== void 0;) {
+			let t = e._sub, n = t._flags;
+			(n & (u.Dirty | u.Pending)) === 0 && (t._flags = n | u.Dirty, b(t)), e = e._nextSub;
+		}
+		f || A();
+	}
+	return t;
+}
+function F() {
+	if (this._flags & u.Dirty && O(this)) {
+		let e = this._subs;
+		e !== void 0 && w(e);
+	}
+	let e = h;
+	for (; e !== void 0;) {
+		if (e._flags & (u.Mutable | u.Watching)) {
+			_(this, e, d);
+			break;
+		}
+		e = e._subs?._sub;
+	}
+	return this._currentValue;
+}
+function I(e) {
+	let t = M(e, this._pendingValue);
+	if (this._pendingValue !== (this._pendingValue = t)) {
+		this._flags = u.Mutable | u.Dirty;
+		let e = this._subs;
+		e !== void 0 && (S(e), f || A());
+	}
+}
+function L() {
+	this._depsTail = void 0, this._flags = u.None, j(this);
+	let e = this._subs;
+	e !== void 0 && y(e), this._cleanup?.(), this._cleanup = void 0;
+}
+function R(e) {
+	if (o(e)) {
+		let t = {
+			_value: void 0,
+			_subs: void 0,
+			_subsTail: void 0,
+			_deps: void 0,
+			_depsTail: void 0,
+			_flags: u.None,
+			_getter: e
+		};
+		return [N.bind(t), P.bind(t)];
+	} else {
+		let t = {
+			_currentValue: e,
+			_pendingValue: e,
+			_subs: void 0,
+			_subsTail: void 0,
+			_flags: u.Mutable
+		};
+		return [F.bind(t), I.bind(t)];
+	}
+}
+function z(e) {
+	return N.bind({
+		_value: void 0,
+		_subs: void 0,
+		_subsTail: void 0,
+		_deps: void 0,
+		_depsTail: void 0,
+		_flags: u.None,
+		_getter: e
+	});
+}
+function B(e) {
+	let t = {
+		_fn: e,
+		_cleanup: void 0,
+		_subs: void 0,
+		_subsTail: void 0,
+		_deps: void 0,
+		_depsTail: void 0,
+		_flags: u.Watching | u.RecursedCheck
+	}, n = E(t);
+	n !== void 0 && _(t, n, 0);
+	try {
+		let e = t._fn();
+		o(e) && (t._cleanup = e);
+	} finally {
+		h = n, t._flags &= ~u.RecursedCheck;
+	}
+	return L.bind(t);
+}
+function V(e) {
+	return o(e) ? e() : e;
+}
+function H(e) {
+	let t = E(void 0);
+	try {
+		return V(e);
+	} finally {
+		E(t);
+	}
+}
+function U(e) {
+	++f;
+	try {
+		e();
+	} finally {
+		--f || A();
+	}
+}
+function W(e, t) {
+	return B(() => {
+		let n = e();
+		H(() => t(n));
+	});
+}
+//#endregion
+export { H as a, r as c, c as d, l as f, t as h, B as i, i as l, n as m, z as n, W as o, a as p, R as r, V as s, U as t, o as u };
+
+//# sourceMappingURL=signals-CMJPGr_M.js.map

package/dist/signals-CMJPGr_M.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"signals-CMJPGr_M.js","names":[],"sources":["../src/utils.ts","../src/core/signals.ts"],"sourcesContent":["/*=============================*\\\n||         ID Generator        ||\n\\*=============================*/\n\nlet lastId = 0;\nexport function uniqueId() {\n  return (lastId++).toString(36);\n}\n\n/*=============================*\\\n||         Object Utils        ||\n\\*=============================*/\n\n/**\n * Returns a new object without the specified keys.\n * If called without object, returns a function that takes an object\n * and returns a version with the original keys omitted.\n *\n * @param keys - An array of keys to omit.\n * @param object - An object to clone without the omitted keys.\n */\nexport function omit<O extends Record<any, any>>(keys: (keyof O)[], object: O): Record<any, any> {\n  const newObject: Record<any, any> = {};\n\n  for (const key in object) {\n    if (!keys.includes(key)) {\n      newObject[key] = object[key];\n    }\n  }\n\n  return newObject;\n}\n\n/*=============================*\\\n||        Type Checking        ||\n\\*=============================*/\n\n/**\n * Throws a TypeError unless `condition` is truthy.\n *\n * @param value - Value whose truthiness is in question.\n * @param errorMessage - Optional message for the thrown TypeError.\n */\nexport function assert<T = any>(value: T, errorMessage: string): asserts value is NonNullable<T> {\n  if (!value) throw new TypeError(errorMessage);\n}\n\n/**\n * Returns true if `value` is an array.\n */\nexport function isArray(value: unknown): value is Array<unknown> {\n  return Array.isArray(value);\n}\n\n/**\n * Returns true when `value` is an array and `check` returns true for every item.\n *\n * @param check - Function to check items against.\n * @param value - A possible array.\n */\nexport function isArrayOf<T>(check: (item: unknown) => boolean, value: unknown): value is T[];\nexport function isArrayOf<T>(check: (item: unknown) => boolean): (value: unknown) => value is T[];\n\nexport function isArrayOf<T>(check: (item: unknown) => boolean, value?: unknown) {\n  if (value) {\n    return isArray(value) && value.every((item) => check(item));\n  } else {\n    return (value: unknown) => isArrayOf<T>(check, value);\n  }\n}\n\n/**\n * Returns true if `value` is a string.\n */\nexport function isString(value: unknown): value is string {\n  return typeof value === \"string\";\n}\n\n/**\n * Returns true if `value` is a function (but not a class).\n */\nexport function isFunction<T = (...args: unknown[]) => unknown>(value: unknown): value is T {\n  return typeof value === \"function\" && !isClass(value);\n}\n\nexport function isClass(value: unknown) {\n  return /^\\s*class\\s+/.test(String(value));\n}\n\n/**\n * Returns true if `value` is a number.\n */\nexport function isNumber(value: unknown): value is number {\n  return typeof value === \"number\" && !isNaN(value);\n}\n\n/**\n * Returns `true` if `value` is an instance of `constructor`.\n *\n * @param constructor - The constructor `value` must be an instance of.\n * @param value - A value that may be an instance of `constructor`.\n */\nexport function isInstanceOf<T extends Function>(constructor: T, value: unknown): value is T;\nexport function isInstanceOf<T extends Function>(constructor: T): (value: unknown) => value is T;\n\nexport function isInstanceOf<T extends Function>(constructor: T, value?: unknown) {\n  if (value) {\n    return value instanceof constructor;\n  } else {\n    return (value: unknown) => isInstanceOf(constructor, value);\n  }\n}\n\n/**\n * Returns true if `value` is a JavaScript Promise.\n */\nexport function isPromise<T = unknown>(value: unknown): value is Promise<T> {\n  return value instanceof Promise;\n}\n\n/**\n * Returns true if `value` is a plain JavaScript object.\n */\nexport function isObject<T = Record<string | number | symbol, unknown>>(value: unknown): value is T {\n  return value != null && typeof value === \"object\" && !isArray(value);\n}\n","import { isFunction } from \"../utils.js\";\n\ninterface ReactiveNode {\n  _deps?: Link;\n  _depsTail?: Link;\n  _subs?: Link;\n  _subsTail?: Link;\n  _flags: ReactiveFlags;\n}\n\ninterface EffectNode extends ReactiveNode {\n  _fn(): void | (() => void);\n  _cleanup?: () => void;\n}\n\ninterface ComputedNode<T = any> extends ReactiveNode {\n  _value: T | undefined;\n  _getter: (previousValue?: T) => T;\n}\n\ninterface ValueNode<T = any> extends ReactiveNode {\n  _currentValue: T;\n  _pendingValue: T;\n}\n\ninterface Link {\n  _version: number;\n  _dep: ReactiveNode;\n  _sub: ReactiveNode;\n  _prevSub: Link | undefined;\n  _nextSub: Link | undefined;\n  _prevDep: Link | undefined;\n  _nextDep: Link | undefined;\n}\n\ninterface Stack<T> {\n  _value: T;\n  _prev: Stack<T> | undefined;\n}\n\n/*==================================*\\\n||         Signal Internals         ||\n\\*==================================*/\n\nconst enum ReactiveFlags {\n  None = 0,\n  Mutable = 1,\n  Watching = 2,\n  RecursedCheck = 4,\n  Recursed = 8,\n  Dirty = 16,\n  Pending = 32,\n}\n\nlet cycle = 0;\nlet batchDepth = 0;\nlet notifyIndex = 0;\nlet queuedLength = 0;\nlet activeSub: ReactiveNode | undefined;\n\nconst queued: (EffectNode | undefined)[] = [];\n\nfunction link(dep: ReactiveNode, sub: ReactiveNode, version: number): void {\n  const prevDep = sub._depsTail;\n  if (prevDep !== undefined && prevDep._dep === dep) {\n    return;\n  }\n  const nextDep = prevDep !== undefined ? prevDep._nextDep : sub._deps;\n  if (nextDep !== undefined && nextDep._dep === dep) {\n    nextDep._version = version;\n    sub._depsTail = nextDep;\n    return;\n  }\n  const prevSub = dep._subsTail;\n  if (prevSub !== undefined && prevSub._version === version && prevSub._sub === sub) {\n    return;\n  }\n  const newLink =\n    (sub._depsTail =\n    dep._subsTail =\n      {\n        _version: version,\n        _dep: dep,\n        _sub: sub,\n        _prevDep: prevDep,\n        _nextDep: nextDep,\n        _prevSub: prevSub,\n        _nextSub: undefined,\n      });\n  if (nextDep !== undefined) {\n    nextDep._prevDep = newLink;\n  }\n  if (prevDep !== undefined) {\n    prevDep._nextDep = newLink;\n  } else {\n    sub._deps = newLink;\n  }\n  if (prevSub !== undefined) {\n    prevSub._nextSub = newLink;\n  } else {\n    dep._subs = newLink;\n  }\n}\n\nfunction unwatched(node: ReactiveNode): void {\n  if (!(node._flags & ReactiveFlags.Mutable)) {\n    effectCleanup.call(node);\n  } else if (node._depsTail !== undefined) {\n    node._depsTail = undefined;\n    node._flags = ReactiveFlags.Mutable | ReactiveFlags.Dirty;\n    purgeDeps(node);\n  }\n}\n\nfunction unlink(link: Link, sub = link._sub): Link | undefined {\n  const dep = link._dep;\n  const prevDep = link._prevDep;\n  const nextDep = link._nextDep;\n  const nextSub = link._nextSub;\n  const prevSub = link._prevSub;\n  if (nextDep !== undefined) {\n    nextDep._prevDep = prevDep;\n  } else {\n    sub._depsTail = prevDep;\n  }\n  if (prevDep !== undefined) {\n    prevDep._nextDep = nextDep;\n  } else {\n    sub._deps = nextDep;\n  }\n  if (nextSub !== undefined) {\n    nextSub._prevSub = prevSub;\n  } else {\n    dep._subsTail = prevSub;\n  }\n  if (prevSub !== undefined) {\n    prevSub._nextSub = nextSub;\n  } else if ((dep._subs = nextSub) === undefined) {\n    unwatched(dep);\n  }\n  return nextDep;\n}\n\nfunction notify(effect: EffectNode): void {\n  let insertIndex = queuedLength;\n  let firstInsertedIndex = insertIndex;\n\n  do {\n    queued[insertIndex++] = effect;\n    effect._flags &= ~ReactiveFlags.Watching;\n    effect = effect._subs?._sub as EffectNode;\n    if (effect === undefined || !(effect._flags & ReactiveFlags.Watching)) {\n      break;\n    }\n  } while (true);\n\n  queuedLength = insertIndex;\n\n  while (firstInsertedIndex < --insertIndex) {\n    const left = queued[firstInsertedIndex];\n    queued[firstInsertedIndex++] = queued[insertIndex];\n    queued[insertIndex] = left;\n  }\n}\n\nfunction update(node: ReactiveNode): boolean {\n  if (node._depsTail !== undefined) {\n    return updateComputed(node as ComputedNode);\n  } else {\n    return updateValue(node as ValueNode);\n  }\n}\n\nfunction propagate(link: Link): void {\n  let next = link._nextSub;\n  let stack: Stack<Link | undefined> | undefined;\n\n  top: do {\n    const sub = link._sub;\n    let flags = sub._flags;\n\n    if (\n      !(flags & (ReactiveFlags.RecursedCheck | ReactiveFlags.Recursed | ReactiveFlags.Dirty | ReactiveFlags.Pending))\n    ) {\n      sub._flags = flags | ReactiveFlags.Pending;\n    } else if (!(flags & (ReactiveFlags.RecursedCheck | ReactiveFlags.Recursed))) {\n      flags = ReactiveFlags.None;\n    } else if (!(flags & ReactiveFlags.RecursedCheck)) {\n      sub._flags = (flags & ~ReactiveFlags.Recursed) | ReactiveFlags.Pending;\n    } else if (!(flags & (ReactiveFlags.Dirty | ReactiveFlags.Pending)) && isValidLink(link, sub)) {\n      sub._flags = flags | (ReactiveFlags.Recursed | ReactiveFlags.Pending);\n      flags &= ReactiveFlags.Mutable;\n    } else {\n      flags = ReactiveFlags.None;\n    }\n\n    if (flags & ReactiveFlags.Watching) {\n      notify(sub as EffectNode);\n    }\n\n    if (flags & ReactiveFlags.Mutable) {\n      const subSubs = sub._subs;\n      if (subSubs !== undefined) {\n        const nextSub = (link = subSubs)._nextSub;\n        if (nextSub !== undefined) {\n          stack = { _value: next, _prev: stack };\n          next = nextSub;\n        }\n        continue;\n      }\n    }\n\n    if ((link = next!) !== undefined) {\n      next = link._nextSub;\n      continue;\n    }\n\n    while (stack !== undefined) {\n      link = stack._value!;\n      stack = stack._prev;\n      if (link !== undefined) {\n        next = link._nextSub;\n        continue top;\n      }\n    }\n\n    break;\n  } while (true);\n}\n\nfunction checkDirty(link: Link, sub: ReactiveNode): boolean {\n  let stack: Stack<Link> | undefined;\n  let checkDepth = 0;\n  let dirty = false;\n\n  top: do {\n    const dep = link._dep;\n    const flags = dep._flags;\n\n    if (sub._flags & ReactiveFlags.Dirty) {\n      dirty = true;\n    } else if (\n      (flags & (ReactiveFlags.Mutable | ReactiveFlags.Dirty)) ===\n      (ReactiveFlags.Mutable | ReactiveFlags.Dirty)\n    ) {\n      if (update(dep)) {\n        const subs = dep._subs!;\n        if (subs._nextSub !== undefined) {\n          shallowPropagate(subs);\n        }\n        dirty = true;\n      }\n    } else if (\n      (flags & (ReactiveFlags.Mutable | ReactiveFlags.Pending)) ===\n      (ReactiveFlags.Mutable | ReactiveFlags.Pending)\n    ) {\n      if (link._nextSub !== undefined || link._prevSub !== undefined) {\n        stack = { _value: link, _prev: stack };\n      }\n      link = dep._deps!;\n      sub = dep;\n      ++checkDepth;\n      continue;\n    }\n\n    if (!dirty) {\n      const nextDep = link._nextDep;\n      if (nextDep !== undefined) {\n        link = nextDep;\n        continue;\n      }\n    }\n\n    while (checkDepth--) {\n      const firstSub = sub._subs!;\n      const hasMultipleSubs = firstSub._nextSub !== undefined;\n      if (hasMultipleSubs) {\n        link = stack!._value;\n        stack = stack!._prev;\n      } else {\n        link = firstSub;\n      }\n      if (dirty) {\n        if (update(sub)) {\n          if (hasMultipleSubs) {\n            shallowPropagate(firstSub);\n          }\n          sub = link._sub;\n          continue;\n        }\n        dirty = false;\n      } else {\n        sub._flags &= ~ReactiveFlags.Pending;\n      }\n      sub = link._sub;\n      const nextDep = link._nextDep;\n      if (nextDep !== undefined) {\n        link = nextDep;\n        continue top;\n      }\n    }\n\n    return dirty;\n  } while (true);\n}\n\nfunction shallowPropagate(link: Link): void {\n  do {\n    const sub = link._sub;\n    const flags = sub._flags;\n    if ((flags & (ReactiveFlags.Pending | ReactiveFlags.Dirty)) === ReactiveFlags.Pending) {\n      sub._flags = flags | ReactiveFlags.Dirty;\n      if ((flags & (ReactiveFlags.Watching | ReactiveFlags.RecursedCheck)) === ReactiveFlags.Watching) {\n        notify(sub as EffectNode);\n      }\n    }\n  } while ((link = link._nextSub!) !== undefined);\n}\n\nfunction isValidLink(checkLink: Link, sub: ReactiveNode): boolean {\n  let link = sub._depsTail;\n  while (link !== undefined) {\n    if (link === checkLink) {\n      return true;\n    }\n    link = link._prevDep;\n  }\n  return false;\n}\n\nfunction setActiveSub(sub?: ReactiveNode) {\n  const prevSub = activeSub;\n  activeSub = sub;\n  return prevSub;\n}\n\nfunction updateComputed(c: ComputedNode): boolean {\n  ++cycle;\n  c._depsTail = undefined;\n  c._flags = ReactiveFlags.Mutable | ReactiveFlags.RecursedCheck;\n  const prevSub = setActiveSub(c);\n  try {\n    const oldValue = c._value;\n    return oldValue !== (c._value = c._getter(oldValue));\n  } finally {\n    activeSub = prevSub;\n    c._flags &= ~ReactiveFlags.RecursedCheck;\n    purgeDeps(c);\n  }\n}\n\nfunction updateValue(v: ValueNode): boolean {\n  v._flags = ReactiveFlags.Mutable;\n  return v._currentValue !== (v._currentValue = v._pendingValue);\n}\n\nfunction run(e: EffectNode): void {\n  const flags = e._flags;\n  if (flags & ReactiveFlags.Dirty || (flags & ReactiveFlags.Pending && checkDirty(e._deps!, e))) {\n    ++cycle;\n    e._depsTail = undefined;\n    e._flags = ReactiveFlags.Watching | ReactiveFlags.RecursedCheck;\n    const prevSub = setActiveSub(e);\n    try {\n      e._cleanup?.();\n      e._cleanup = undefined;\n      const result = e._fn();\n      if (isFunction(result)) e._cleanup = result;\n    } finally {\n      activeSub = prevSub;\n      e._flags &= ~ReactiveFlags.RecursedCheck;\n      purgeDeps(e);\n    }\n  } else {\n    e._flags = ReactiveFlags.Watching;\n  }\n}\n\nfunction flush(): void {\n  try {\n    while (notifyIndex < queuedLength) {\n      const effect = queued[notifyIndex]!;\n      queued[notifyIndex++] = undefined;\n      run(effect);\n    }\n  } finally {\n    while (notifyIndex < queuedLength) {\n      const effect = queued[notifyIndex]!;\n      queued[notifyIndex++] = undefined;\n      effect._flags |= ReactiveFlags.Watching | ReactiveFlags.Recursed;\n    }\n    notifyIndex = 0;\n    queuedLength = 0;\n  }\n}\n\nfunction purgeDeps(sub: ReactiveNode) {\n  const depsTail = sub._depsTail;\n  let dep = depsTail !== undefined ? depsTail._nextDep : sub._deps;\n  while (dep !== undefined) {\n    dep = unlink(dep, sub);\n  }\n}\n\n/*==================================*\\\n||        API Implementation        ||\n\\*==================================*/\n\nfunction resolveValue<T>(next: SetterAction<T>, current: T): T {\n  if (isFunction(next)) return peek(() => next(current)) as T;\n  return next as T;\n}\n\nfunction computedGetter(this: ComputedNode) {\n  const flags = this._flags;\n  if (\n    flags & ReactiveFlags.Dirty ||\n    (flags & ReactiveFlags.Pending &&\n      (checkDirty(this._deps!, this) || ((this._flags = flags & ~ReactiveFlags.Pending), false)))\n  ) {\n    if (updateComputed(this)) {\n      const subs = this._subs;\n      if (subs !== undefined) {\n        shallowPropagate(subs);\n      }\n    }\n  } else if (!flags) {\n    this._flags = ReactiveFlags.Mutable | ReactiveFlags.RecursedCheck;\n    const prevSub = setActiveSub(this);\n    try {\n      this._value = unwrap(this._getter());\n    } finally {\n      activeSub = prevSub;\n      this._flags &= ~ReactiveFlags.RecursedCheck;\n    }\n  }\n  const sub = activeSub;\n  if (sub !== undefined) {\n    link(this, sub, cycle);\n  }\n  return this._value!;\n}\n\nfunction computedSetter(this: ComputedNode, next: SetterAction<any>) {\n  const value = resolveValue(next, this._value);\n  if (this._value !== value) {\n    this._value = value;\n\n    // Clear Dirty and Pending so _computedGetter skips updateComputed\n    this._flags &= ~(ReactiveFlags.Dirty | ReactiveFlags.Pending);\n\n    // Manually push the Dirty flag to all subscribers\n    let link = this._subs;\n    while (link !== undefined) {\n      const sub = link._sub;\n      const subFlags = sub._flags;\n\n      // Only modify and notify if it isn't already queued for an update\n      if ((subFlags & (ReactiveFlags.Dirty | ReactiveFlags.Pending)) === 0) {\n        // Force the node to be Dirty so it bypasses checkDirty() upon flush\n        sub._flags = subFlags | ReactiveFlags.Dirty;\n        notify(sub as EffectNode);\n      }\n\n      link = link._nextSub;\n    }\n\n    // Trigger queued effects\n    if (!batchDepth) {\n      flush();\n    }\n  }\n  return value;\n}\n\nfunction computedAccessor<T>(this: ComputedNode<T>, ...next: [SetterAction<T>]): T {\n  if (next.length) {\n    return computedSetter.call(this, next[0]) as T;\n  } else {\n    return computedGetter.call(this) as T;\n  }\n}\n\nfunction valueGetter<T>(this: ValueNode<T>): T {\n  if (this._flags & ReactiveFlags.Dirty) {\n    if (updateValue(this)) {\n      const subs = this._subs;\n      if (subs !== undefined) {\n        shallowPropagate(subs);\n      }\n    }\n  }\n  let sub = activeSub;\n  while (sub !== undefined) {\n    if (sub._flags & (ReactiveFlags.Mutable | ReactiveFlags.Watching)) {\n      link(this, sub, cycle);\n      break;\n    }\n    sub = sub._subs?._sub;\n  }\n  return this._currentValue;\n}\n\nfunction valueSetter<T>(this: ValueNode<T>, next: SetterAction<T>): void {\n  const value = resolveValue(next, this._pendingValue);\n  if (this._pendingValue !== (this._pendingValue = value)) {\n    this._flags = ReactiveFlags.Mutable | ReactiveFlags.Dirty;\n    const subs = this._subs;\n    if (subs !== undefined) {\n      propagate(subs);\n      if (!batchDepth) {\n        flush();\n      }\n    }\n  }\n}\n\nfunction valueAccessor<T>(this: ValueNode<T>, ...args: [SetterAction<T>]): T | void {\n  if (args.length) {\n    return valueSetter.call(this, args[0]);\n  } else {\n    return valueGetter.call(this) as T;\n  }\n}\n\nfunction effectCleanup(this: ReactiveNode): void {\n  this._depsTail = undefined;\n  this._flags = ReactiveFlags.None;\n  purgeDeps(this);\n  const sub = this._subs;\n  if (sub !== undefined) {\n    unlink(sub);\n  }\n  (this as EffectNode)._cleanup?.();\n  (this as EffectNode)._cleanup = undefined;\n}\n\n/*==================================*\\\n||            Public API            ||\n\\*==================================*/\n\n/**\n * Returns the currently held value. Registers the state as a dependency when called within a tracking context.\n */\nexport type Getter<T> = () => T;\n\n/**\n * A value that may be a static value or a getter function.\n * Can be converted to a plain value with `unwrap`.\n */\nexport type MaybeGetter<T> = T | Getter<T>;\n\n/**\n * Updates the value of an atom. Takes a new plain value, or an update function to compute one.\n */\nexport type Setter<T> = (next: SetterAction<T>) => T;\nexport type SetterAction<T> = T | ((prev: T) => T);\n\n/**\n * A getter and setter pair, as returned from `createAtom`.\n */\nexport type AtomAccessors<T> = [Getter<T>, Setter<T>];\n\n/**\n * Creates a new atom with a default `undefined` value.\n * Returns a `[getter, setter]` function tuple.\n *\n * @example\n * const [getValue, setValue] = createAtom();\n */\nexport function createAtom<T>(): AtomAccessors<T | undefined>;\n\n/**\n * Creates a new atom with a value computed from an existing getter.\n * This is usually used to create a 'settable' getter, in which you can store\n * a temporary value until it gets overwritten by a _real_ update.\n *\n * @example\n * const [getValue, setValue] = createAtom(\"\");\n * const [getInputValue, setInputValue] = createAtom(getValue);\n *\n * setInputValue(\"temporary\");\n * getValue(\"\");\n * getInputValue(); // \"temporary\"\n *\n * setValue(\"overwritten\");\n * getValue(\"overwritten\");\n * getInputValue(); // \"overwritten\"\n */\nexport function createAtom<T>(compute: Getter<T>): AtomAccessors<T>;\n\n/**\n * Creates a new atom with an initial value.\n * Returns a `[getter, setter]` function tuple.\n *\n * @example\n * const [getCount, setCount] = createAtom(5);\n */\nexport function createAtom<T>(initialValue: T): AtomAccessors<T>;\n\nexport function createAtom<T>(value?: T) {\n  if (isFunction<Getter<T>>(value)) {\n    const node: ComputedNode<T> = {\n      _value: undefined,\n      _subs: undefined,\n      _subsTail: undefined,\n      _deps: undefined,\n      _depsTail: undefined,\n      _flags: ReactiveFlags.None,\n      _getter: value as (previousValue?: T | undefined) => T,\n    };\n    return [computedGetter.bind(node), computedSetter.bind(node)];\n  } else {\n    const node: ValueNode<T> = {\n      _currentValue: value as T,\n      _pendingValue: value as T,\n      _subs: undefined,\n      _subsTail: undefined,\n      _flags: ReactiveFlags.Mutable,\n    };\n    return [valueGetter.bind(node), valueSetter.bind(node)];\n  }\n}\n\nexport function compose<T>(getter: (previousValue?: T) => Getter<T> | T): Getter<T> {\n  return computedGetter.bind({\n    _value: undefined,\n    _subs: undefined,\n    _subsTail: undefined,\n    _deps: undefined,\n    _depsTail: undefined,\n    _flags: ReactiveFlags.None,\n    _getter: getter as (previousValue?: unknown) => unknown,\n  }) as () => T;\n}\n\nexport function createEffect(fn: () => void): () => void {\n  const e: EffectNode = {\n    _fn: fn,\n    _cleanup: undefined,\n    _subs: undefined,\n    _subsTail: undefined,\n    _deps: undefined,\n    _depsTail: undefined,\n    _flags: ReactiveFlags.Watching | ReactiveFlags.RecursedCheck,\n  };\n  const prevSub = setActiveSub(e);\n  if (prevSub !== undefined) {\n    link(e, prevSub, 0);\n  }\n  try {\n    const result = e._fn();\n    if (isFunction(result)) e._cleanup = result;\n  } finally {\n    activeSub = prevSub;\n    e._flags &= ~ReactiveFlags.RecursedCheck;\n  }\n  return effectCleanup.bind(e);\n}\n\n/**\n * Unwraps a `MaybeGetter<T>` into a plain `T`.\n * Tracks the value if it is a getter.\n * Use the non-tracking `peek` if you're being stealthy.\n */\nexport function unwrap<T>(value: T | Getter<T>): T {\n  if (isFunction<Getter<T>>(value)) {\n    return value();\n  } else {\n    return value;\n  }\n}\n\n/**\n * Unwraps a `MaybeGetter<T>` into a plain `T`. Will _not_ track if the value is a getter.\n */\nexport function peek<T>(value: T | Getter<T>): T {\n  const prevSub = setActiveSub(undefined);\n  try {\n    return unwrap(value);\n  } finally {\n    setActiveSub(prevSub);\n  }\n}\n\n/**\n * Groups several signal changes into a single transaction.\n * Suspends effects until `callback` finishes, then runs all updates at once.\n */\nexport function batch(callback: () => void): void {\n  ++batchDepth;\n  try {\n    callback();\n  } finally {\n    if (!--batchDepth) {\n      flush();\n    }\n  }\n}\n\nexport function subscribe<T>(target: Getter<T>, fn: (value: T) => any): () => void {\n  return createEffect(() => {\n    const value = target();\n    peek(() => fn(value));\n  });\n}\n"],"mappings":";AAIA,IAAI,IAAS;AACb,SAAgB,IAAW;AACzB,SAAQ,KAAU,SAAS,GAAG;;AAehC,SAAgB,EAAiC,GAAmB,GAA6B;CAC/F,IAAM,IAA8B,EAAE;AAEtC,MAAK,IAAM,KAAO,EAChB,CAAK,EAAK,SAAS,EAAI,KACrB,EAAU,KAAO,EAAO;AAI5B,QAAO;;AAaT,SAAgB,EAAgB,GAAU,GAAuD;AAC/F,KAAI,CAAC,EAAO,OAAU,UAAU,EAAa;;AAM/C,SAAgB,EAAQ,GAAyC;AAC/D,QAAO,MAAM,QAAQ,EAAM;;AAuB7B,SAAgB,EAAS,GAAiC;AACxD,QAAO,OAAO,KAAU;;AAM1B,SAAgB,EAAgD,GAA4B;AAC1F,QAAO,OAAO,KAAU,cAAc,CAAC,EAAQ,EAAM;;AAGvD,SAAgB,EAAQ,GAAgB;AACtC,QAAO,eAAe,KAAK,OAAO,EAAM,CAAC;;AAM3C,SAAgB,EAAS,GAAiC;AACxD,QAAO,OAAO,KAAU,YAAY,CAAC,MAAM,EAAM;;AA8BnD,SAAgB,EAAwD,GAA4B;AAClG,QAAwB,OAAO,KAAU,cAAlC,KAA8C,CAAC,EAAQ,EAAM;;;;AChFtE,IAAW,IAAX,yBAAA,GAAA;QACE,EAAA,EAAA,OAAO,KAAA,QACP,EAAA,EAAA,UAAU,KAAA,WACV,EAAA,EAAA,WAAW,KAAA,YACX,EAAA,EAAA,gBAAgB,KAAA,iBAChB,EAAA,EAAA,WAAW,KAAA,YACX,EAAA,EAAA,QAAQ,MAAA,SACR,EAAA,EAAA,UAAU,MAAA;EAPD,KAAA,EAAA,CAQV,EAEG,IAAQ,GACR,IAAa,GACb,IAAc,GACd,IAAe,GACf,GAEE,IAAqC,EAAE;AAE7C,SAAS,EAAK,GAAmB,GAAmB,GAAuB;CACzE,IAAM,IAAU,EAAI;AACpB,KAAI,MAAY,KAAA,KAAa,EAAQ,SAAS,EAC5C;CAEF,IAAM,IAAU,MAAY,KAAA,IAA+B,EAAI,QAAvB,EAAQ;AAChD,KAAI,MAAY,KAAA,KAAa,EAAQ,SAAS,GAAK;AAEjD,EADA,EAAQ,WAAW,GACnB,EAAI,YAAY;AAChB;;CAEF,IAAM,IAAU,EAAI;AACpB,KAAI,MAAY,KAAA,KAAa,EAAQ,aAAa,KAAW,EAAQ,SAAS,EAC5E;CAEF,IAAM,IACH,EAAI,YACL,EAAI,YACF;EACE,UAAU;EACV,MAAM;EACN,MAAM;EACN,UAAU;EACV,UAAU;EACV,UAAU;EACV,UAAU,KAAA;EACX;AASL,CARI,MAAY,KAAA,MACd,EAAQ,WAAW,IAEjB,MAAY,KAAA,IAGd,EAAI,QAAQ,IAFZ,EAAQ,WAAW,GAIjB,MAAY,KAAA,IAGd,EAAI,QAAQ,IAFZ,EAAQ,WAAW;;AAMvB,SAAS,EAAU,GAA0B;AAC3C,CAAM,EAAK,SAAS,EAAc,UAEvB,EAAK,cAAc,KAAA,MAC5B,EAAK,YAAY,KAAA,GACjB,EAAK,SAAS,EAAc,UAAU,EAAc,OACpD,EAAU,EAAK,IAJf,EAAc,KAAK,EAAK;;AAQ5B,SAAS,EAAO,GAAY,IAAM,EAAK,MAAwB;CAC7D,IAAM,IAAM,EAAK,MACX,IAAU,EAAK,UACf,IAAU,EAAK,UACf,IAAU,EAAK,UACf,IAAU,EAAK;AAqBrB,QApBI,MAAY,KAAA,IAGd,EAAI,YAAY,IAFhB,EAAQ,WAAW,GAIjB,MAAY,KAAA,IAGd,EAAI,QAAQ,IAFZ,EAAQ,WAAW,GAIjB,MAAY,KAAA,IAGd,EAAI,YAAY,IAFhB,EAAQ,WAAW,GAIjB,MAAY,KAAA,KAEJ,EAAI,QAAQ,OAAa,KAAA,KACnC,EAAU,EAAI,GAFd,EAAQ,WAAW,GAId;;AAGT,SAAS,EAAO,GAA0B;CACxC,IAAI,IAAc,GACd,IAAqB;AAEzB;AAIE,MAHA,EAAO,OAAiB,GACxB,EAAO,UAAU,CAAC,EAAc,UAChC,IAAS,EAAO,OAAO,MACnB,MAAW,KAAA,KAAa,EAAE,EAAO,SAAS,EAAc,UAC1D;QAEK;AAIT,MAFA,IAAe,GAER,IAAqB,EAAE,IAAa;EACzC,IAAM,IAAO,EAAO;AAEpB,EADA,EAAO,OAAwB,EAAO,IACtC,EAAO,KAAe;;;AAI1B,SAAS,EAAO,GAA6B;AAIzC,QAHE,EAAK,cAAc,KAAA,IAGd,EAAY,EAAkB,GAF9B,EAAe,EAAqB;;AAM/C,SAAS,EAAU,GAAkB;CACnC,IAAI,IAAO,EAAK,UACZ;AAEJ,KAAK,IAAG;EACN,IAAM,IAAM,EAAK,MACb,IAAQ,EAAI;AAqBhB,MAlBI,KAAS,EAAc,gBAAgB,EAAc,WAAW,EAAc,QAAQ,EAAc,WAG3F,KAAS,EAAc,gBAAgB,EAAc,YAErD,IAAQ,EAAc,gBAExB,EAAE,KAAS,EAAc,QAAQ,EAAc,aAAa,EAAY,GAAM,EAAI,IAC3F,EAAI,SAAS,KAAS,EAAc,WAAW,EAAc,UAC7D,KAAS,EAAc,WAEvB,IAAQ,EAAc,OALtB,EAAI,SAAU,IAAQ,CAAC,EAAc,WAAY,EAAc,UAF/D,IAAQ,EAAc,OAFtB,EAAI,SAAS,IAAQ,EAAc,SAYjC,IAAQ,EAAc,YACxB,EAAO,EAAkB,EAGvB,IAAQ,EAAc,SAAS;GACjC,IAAM,IAAU,EAAI;AACpB,OAAI,MAAY,KAAA,GAAW;IACzB,IAAM,KAAW,IAAO,GAAS;AACjC,IAAI,MAAY,KAAA,MACd,IAAQ;KAAE,QAAQ;KAAM,OAAO;KAAO,EACtC,IAAO;AAET;;;AAIJ,OAAK,IAAO,OAAW,KAAA,GAAW;AAChC,OAAO,EAAK;AACZ;;AAGF,SAAO,MAAU,KAAA,GAGf,KAFA,IAAO,EAAM,QACb,IAAQ,EAAM,OACV,MAAS,KAAA,GAAW;AACtB,OAAO,EAAK;AACZ,YAAS;;AAIb;UACO;;AAGX,SAAS,EAAW,GAAY,GAA4B;CAC1D,IAAI,GACA,IAAa,GACb,IAAQ;AAEZ,KAAK,IAAG;EACN,IAAM,IAAM,EAAK,MACX,IAAQ,EAAI;AAElB,MAAI,EAAI,SAAS,EAAc,MAC7B,KAAQ;YAEP,KAAS,EAAc,UAAU,EAAc,aAC/C,EAAc,UAAU,EAAc;OAEnC,EAAO,EAAI,EAAE;IACf,IAAM,IAAO,EAAI;AAIjB,IAHI,EAAK,aAAa,KAAA,KACpB,EAAiB,EAAK,EAExB,IAAQ;;cAGT,KAAS,EAAc,UAAU,EAAc,eAC/C,EAAc,UAAU,EAAc,UACvC;AAMA,IALI,EAAK,aAAa,KAAA,KAAa,EAAK,aAAa,KAAA,OACnD,IAAQ;IAAE,QAAQ;IAAM,OAAO;IAAO,GAExC,IAAO,EAAI,OACX,IAAM,GACN,EAAE;AACF;;AAGF,MAAI,CAAC,GAAO;GACV,IAAM,IAAU,EAAK;AACrB,OAAI,MAAY,KAAA,GAAW;AACzB,QAAO;AACP;;;AAIJ,SAAO,MAAc;GACnB,IAAM,IAAW,EAAI,OACf,IAAkB,EAAS,aAAa,KAAA;AAO9C,OANI,KACF,IAAO,EAAO,QACd,IAAQ,EAAO,SAEf,IAAO,GAEL,GAAO;AACT,QAAI,EAAO,EAAI,EAAE;AAIf,KAHI,KACF,EAAiB,EAAS,EAE5B,IAAM,EAAK;AACX;;AAEF,QAAQ;SAER,GAAI,UAAU,CAAC,EAAc;AAE/B,OAAM,EAAK;GACX,IAAM,IAAU,EAAK;AACrB,OAAI,MAAY,KAAA,GAAW;AACzB,QAAO;AACP,aAAS;;;AAIb,SAAO;UACA;;AAGX,SAAS,EAAiB,GAAkB;AAC1C,IAAG;EACD,IAAM,IAAM,EAAK,MACX,IAAQ,EAAI;AAClB,GAAK,KAAS,EAAc,UAAU,EAAc,YAAY,EAAc,YAC5E,EAAI,SAAS,IAAQ,EAAc,QAC9B,KAAS,EAAc,WAAW,EAAc,oBAAoB,EAAc,YACrF,EAAO,EAAkB;WAGrB,IAAO,EAAK,cAAe,KAAA;;AAGvC,SAAS,EAAY,GAAiB,GAA4B;CAChE,IAAI,IAAO,EAAI;AACf,QAAO,MAAS,KAAA,IAAW;AACzB,MAAI,MAAS,EACX,QAAO;AAET,MAAO,EAAK;;AAEd,QAAO;;AAGT,SAAS,EAAa,GAAoB;CACxC,IAAM,IAAU;AAEhB,QADA,IAAY,GACL;;AAGT,SAAS,EAAe,GAA0B;AAGhD,CAFA,EAAE,GACF,EAAE,YAAY,KAAA,GACd,EAAE,SAAS,EAAc,UAAU,EAAc;CACjD,IAAM,IAAU,EAAa,EAAE;AAC/B,KAAI;EACF,IAAM,IAAW,EAAE;AACnB,SAAO,OAAc,EAAE,SAAS,EAAE,QAAQ,EAAS;WAC3C;AAGR,EAFA,IAAY,GACZ,EAAE,UAAU,CAAC,EAAc,eAC3B,EAAU,EAAE;;;AAIhB,SAAS,EAAY,GAAuB;AAE1C,QADA,EAAE,SAAS,EAAc,SAClB,EAAE,mBAAmB,EAAE,gBAAgB,EAAE;;AAGlD,SAAS,EAAI,GAAqB;CAChC,IAAM,IAAQ,EAAE;AAChB,KAAI,IAAQ,EAAc,SAAU,IAAQ,EAAc,WAAW,EAAW,EAAE,OAAQ,EAAE,EAAG;AAG7F,EAFA,EAAE,GACF,EAAE,YAAY,KAAA,GACd,EAAE,SAAS,EAAc,WAAW,EAAc;EAClD,IAAM,IAAU,EAAa,EAAE;AAC/B,MAAI;AAEF,GADA,EAAE,YAAY,EACd,EAAE,WAAW,KAAA;GACb,IAAM,IAAS,EAAE,KAAK;AACtB,GAAI,EAAW,EAAO,KAAE,EAAE,WAAW;YAC7B;AAGR,GAFA,IAAY,GACZ,EAAE,UAAU,CAAC,EAAc,eAC3B,EAAU,EAAE;;OAGd,GAAE,SAAS,EAAc;;AAI7B,SAAS,IAAc;AACrB,KAAI;AACF,SAAO,IAAc,IAAc;GACjC,IAAM,IAAS,EAAO;AAEtB,GADA,EAAO,OAAiB,KAAA,GACxB,EAAI,EAAO;;WAEL;AACR,SAAO,IAAc,IAAc;GACjC,IAAM,IAAS,EAAO;AAEtB,GADA,EAAO,OAAiB,KAAA,GACxB,EAAO,UAAU,EAAc,WAAW,EAAc;;AAG1D,EADA,IAAc,GACd,IAAe;;;AAInB,SAAS,EAAU,GAAmB;CACpC,IAAM,IAAW,EAAI,WACjB,IAAM,MAAa,KAAA,IAAgC,EAAI,QAAxB,EAAS;AAC5C,QAAO,MAAQ,KAAA,GACb,KAAM,EAAO,GAAK,EAAI;;AAQ1B,SAAS,EAAgB,GAAuB,GAAe;AAE7D,QADI,EAAW,EAAK,GAAS,QAAW,EAAK,EAAQ,CAAC,GAC/C;;AAGT,SAAS,IAAmC;CAC1C,IAAM,IAAQ,KAAK;AACnB,KACE,IAAQ,EAAc,SACrB,IAAQ,EAAc,YACpB,EAAW,KAAK,OAAQ,KAAK,KAAM,KAAK,SAAS,IAAQ,CAAC,EAAc,SAAU;MAEjF,EAAe,KAAK,EAAE;GACxB,IAAM,IAAO,KAAK;AAClB,GAAI,MAAS,KAAA,KACX,EAAiB,EAAK;;YAGjB,CAAC,GAAO;AACjB,OAAK,SAAS,EAAc,UAAU,EAAc;EACpD,IAAM,IAAU,EAAa,KAAK;AAClC,MAAI;AACF,QAAK,SAAS,EAAO,KAAK,SAAS,CAAC;YAC5B;AAER,GADA,IAAY,GACZ,KAAK,UAAU,CAAC,EAAc;;;CAGlC,IAAM,IAAM;AAIZ,QAHI,MAAQ,KAAA,KACV,EAAK,MAAM,GAAK,EAAM,EAEjB,KAAK;;AAGd,SAAS,EAAmC,GAAyB;CACnE,IAAM,IAAQ,EAAa,GAAM,KAAK,OAAO;AAC7C,KAAI,KAAK,WAAW,GAAO;AAIzB,EAHA,KAAK,SAAS,GAGd,KAAK,UAAU,EAAE,EAAc,QAAQ,EAAc;EAGrD,IAAI,IAAO,KAAK;AAChB,SAAO,MAAS,KAAA,IAAW;GACzB,IAAM,IAAM,EAAK,MACX,IAAW,EAAI;AASrB,IANK,KAAY,EAAc,QAAQ,EAAc,cAAc,MAEjE,EAAI,SAAS,IAAW,EAAc,OACtC,EAAO,EAAkB,GAG3B,IAAO,EAAK;;AAId,EAAK,KACH,GAAO;;AAGX,QAAO;;AAWT,SAAS,IAAsC;AAC7C,KAAI,KAAK,SAAS,EAAc,SAC1B,EAAY,KAAK,EAAE;EACrB,IAAM,IAAO,KAAK;AAClB,EAAI,MAAS,KAAA,KACX,EAAiB,EAAK;;CAI5B,IAAI,IAAM;AACV,QAAO,MAAQ,KAAA,IAAW;AACxB,MAAI,EAAI,UAAU,EAAc,UAAU,EAAc,WAAW;AACjE,KAAK,MAAM,GAAK,EAAM;AACtB;;AAEF,MAAM,EAAI,OAAO;;AAEnB,QAAO,KAAK;;AAGd,SAAS,EAAmC,GAA6B;CACvE,IAAM,IAAQ,EAAa,GAAM,KAAK,cAAc;AACpD,KAAI,KAAK,mBAAmB,KAAK,gBAAgB,IAAQ;AACvD,OAAK,SAAS,EAAc,UAAU,EAAc;EACpD,IAAM,IAAO,KAAK;AAClB,EAAI,MAAS,KAAA,MACX,EAAU,EAAK,EACV,KACH,GAAO;;;AAcf,SAAS,IAAwC;AAG/C,CAFA,KAAK,YAAY,KAAA,GACjB,KAAK,SAAS,EAAc,MAC5B,EAAU,KAAK;CACf,IAAM,IAAM,KAAK;AAKhB,CAJG,MAAQ,KAAA,KACV,EAAO,EAAI,EAEZ,KAAoB,YAAY,EAChC,KAAoB,WAAW,KAAA;;AAkElC,SAAgB,EAAc,GAAW;AACvC,KAAI,EAAsB,EAAM,EAAE;EAChC,IAAM,IAAwB;GAC5B,QAAQ,KAAA;GACR,OAAO,KAAA;GACP,WAAW,KAAA;GACX,OAAO,KAAA;GACP,WAAW,KAAA;GACX,QAAQ,EAAc;GACtB,SAAS;GACV;AACD,SAAO,CAAC,EAAe,KAAK,EAAK,EAAE,EAAe,KAAK,EAAK,CAAC;QACxD;EACL,IAAM,IAAqB;GACzB,eAAe;GACf,eAAe;GACf,OAAO,KAAA;GACP,WAAW,KAAA;GACX,QAAQ,EAAc;GACvB;AACD,SAAO,CAAC,EAAY,KAAK,EAAK,EAAE,EAAY,KAAK,EAAK,CAAC;;;AAI3D,SAAgB,EAAW,GAAyD;AAClF,QAAO,EAAe,KAAK;EACzB,QAAQ,KAAA;EACR,OAAO,KAAA;EACP,WAAW,KAAA;EACX,OAAO,KAAA;EACP,WAAW,KAAA;EACX,QAAQ,EAAc;EACtB,SAAS;EACV,CAAC;;AAGJ,SAAgB,EAAa,GAA4B;CACvD,IAAM,IAAgB;EACpB,KAAK;EACL,UAAU,KAAA;EACV,OAAO,KAAA;EACP,WAAW,KAAA;EACX,OAAO,KAAA;EACP,WAAW,KAAA;EACX,QAAQ,EAAc,WAAW,EAAc;EAChD,EACK,IAAU,EAAa,EAAE;AAC/B,CAAI,MAAY,KAAA,KACd,EAAK,GAAG,GAAS,EAAE;AAErB,KAAI;EACF,IAAM,IAAS,EAAE,KAAK;AACtB,EAAI,EAAW,EAAO,KAAE,EAAE,WAAW;WAC7B;AAER,EADA,IAAY,GACZ,EAAE,UAAU,CAAC,EAAc;;AAE7B,QAAO,EAAc,KAAK,EAAE;;AAQ9B,SAAgB,EAAU,GAAyB;AAI/C,QAHE,EAAsB,EAAM,GACvB,GAAO,GAEP;;AAOX,SAAgB,EAAQ,GAAyB;CAC/C,IAAM,IAAU,EAAa,KAAA,EAAU;AACvC,KAAI;AACF,SAAO,EAAO,EAAM;WACZ;AACR,IAAa,EAAQ;;;AAQzB,SAAgB,EAAM,GAA4B;AAChD,GAAE;AACF,KAAI;AACF,KAAU;WACF;AACR,EAAK,EAAE,KACL,GAAO;;;AAKb,SAAgB,EAAa,GAAmB,GAAmC;AACjF,QAAO,QAAmB;EACxB,IAAM,IAAQ,GAAQ;AACtB,UAAW,EAAG,EAAM,CAAC;GACrB"}

package/dist/translate/index.d.ts

@@ -0,0 +1,82 @@
+import { Context } from "../core/context.js";
+import { DollaPlugin } from "../core/root.js";
+import { type Getter } from "../core/signals.js";
+/**
+ * A JSON object of translated strings. Values can be string templates or nested objects.
+ */
+export interface LocalizedStrings extends Record<string, string | LocalizedStrings> {
+}
+/**
+ * A function that returns an object of localized strings.
+ */
+export type TranslationFetchFn = () => LocalizedStrings | Promise<LocalizedStrings>;
+export type TOptions = {
+    /**
+     *
+     */
+    count?: Getter<number> | number;
+    /**
+     *
+     */
+    context?: Getter<string> | string;
+    [value: string]: Getter<any> | any;
+};
+export type LookupFn = (selector: string, options?: TOptions) => string;
+export type Formatter = (locale: string, value: any, options: Record<string, any>) => string;
+type BuiltInFormatters = {
+    number: [number | bigint, Intl.NumberFormatOptions?];
+    datetime: [Date, Intl.DateTimeFormatOptions?];
+    list: [Iterable<string>, Intl.ListFormatOptions?];
+};
+export interface Translator {
+    /**
+     * An array of locale names for all translations the app supports.
+     */
+    supportedLocales: string[];
+    /**
+     * A Readable containing the currently loaded locale.
+     */
+    currentLocale: Getter<string>;
+    /**
+     * Updates the locale, fetching any translation files as required.
+     * Returns a promise that resolves when the new locale is applied.
+     *
+     * If `name` is undefined the library will try to match the browser language automatically.
+     */
+    setLocale(name?: string): Promise<void>;
+    /**
+     * Returns a Readable of the value at `key`.
+  
+     * @param selector - Key to the translated value.
+     * @param options - A map of `{{placeholder}}` names and the values to replace them with.
+     *
+     * @example
+     * const value = t("your.key.here", { count: 5 });
+     */
+    t(selector: string, options?: TOptions): Getter<string>;
+    format<K extends keyof BuiltInFormatters, V extends BuiltInFormatters[K][0], O extends BuiltInFormatters[K][1]>(name: K, value: Getter<V> | V, options?: O): Getter<string>;
+    format<V, O>(name: string, value: Getter<V> | V, options?: O): Getter<string>;
+}
+export interface TranslatorOptions {
+    translations: Record<string, LocalizedStrings | TranslationFetchFn>;
+    /**
+     * Default locale to load on startup. The translator will try to match the user's browser language if left undefined.
+     */
+    locale?: string;
+    formatters?: Record<string, Formatter>;
+}
+export declare function createTranslatePlugin(options: TranslatorOptions): DollaPlugin;
+export declare function getTranslate(context: Context): Translator;
+/**
+ * Compiles an object of translated strings into a set of function templates.
+ */
+export declare function compile(strings: {
+    [key: string]: any;
+}, path?: string[]): [string, CompiledTemplate][];
+export type TemplateSegmentFn = (options: Record<string, any> | undefined, formatters: Map<string, Formatter>, locale: string) => string;
+export type CompiledTemplate = TemplateSegmentFn[];
+/**
+ * Parse a string template into an array of functions that will produce each piece of the output when called.
+ */
+export declare function parseTemplate(template: string): CompiledTemplate;
+export {};

package/dist/translate.js

@@ -0,0 +1,125 @@
+import { n as e, r as t, s as n, u as r } from "./signals-CMJPGr_M.js";
+//#region src/translate/index.ts
+var i = Symbol("Dolla.Translator");
+function a(e) {
+	return async function(t) {
+		let n = s(e);
+		t[i] = n, await n.setLocale(e.locale);
+	};
+}
+function o(e) {
+	if (!e[i]) throw Error("Translate plugin isn't loaded.");
+	return e[i];
+}
+function s(r) {
+	let i = /* @__PURE__ */ new Map();
+	if (i.set("number", (e, t, n) => new Intl.NumberFormat(e, n).format(Number(t))), i.set("datetime", (e, t, n) => new Intl.DateTimeFormat(e, n).format(new Date(t))), i.set("list", (e, t, n) => new Intl.ListFormat(e, n).format(t)), r.formatters) for (let e in r.formatters) i.set(e, r.formatters[e]);
+	let a, [o, s] = t("en"), l = [...Object.keys(r.translations)];
+	async function u(e) {
+		let t;
+		if (e === void 0) {
+			let e = [];
+			if (typeof navigator < "u") {
+				let t = navigator;
+				t.languages?.length > 0 ? e.push(...t.languages) : t.language ? e.push(t.language) : t.browserLanguage ? e.push(t.browserLanguage) : t.userLanguage && e.push(t.userLanguage);
+			}
+			for (let n of e) if (n in r.translations) {
+				t = n;
+				break;
+			}
+		} else e in r.translations && (t = e);
+		if (t == null) {
+			let e = Object.keys(r.translations).at(0);
+			e && (t = e);
+		}
+		if (!t || !(t in r.translations)) throw Error(`Locale '${e}' has no translation.`);
+		a = await c(t, i, r.translations[t]), s(t);
+	}
+	function d(t, n) {
+		return e(() => (o(), a?.(t, n) ?? t));
+	}
+	function f(t, r, a) {
+		let s = i.get(t);
+		if (!s) throw Error(`Unknown format: ${t}`);
+		return e(() => s(o(), n(r), a ?? {}));
+	}
+	return {
+		supportedLocales: l,
+		currentLocale: o,
+		setLocale: u,
+		t: d,
+		format: f
+	};
+}
+async function c(e, t, i) {
+	let a = l(r(i) ? await i() : i), o = new Map(a);
+	return function(r, i) {
+		if (i && (i.context != null && (r += "_" + i.context), i.count != null)) if (i.ordinal) {
+			let t = `${r}_ordinal_(=${i.count})`;
+			o.has(t) ? r = t : r += "_ordinal_" + new Intl.PluralRules(e, { type: "ordinal" }).select(n(i.count));
+		} else {
+			let t = `${r}_(=${i.count})`;
+			o.has(t) ? r = t : r += "_" + new Intl.PluralRules(e).select(n(i.count));
+		}
+		let a = o.get(r);
+		if (!a) return r;
+		let s = "";
+		for (let n = 0; n < a.length; n++) s += a[n](i, t, e);
+		return s;
+	};
+}
+function l(e, t = []) {
+	let n = [];
+	for (let r in e) switch (typeof e[r]) {
+		case "string":
+			n.push([[...t, r].join("."), u(e[r])]);
+			break;
+		case "object":
+			n.push(...l(e[r], [...t, r]));
+			break;
+		default: throw Error(`Expected to find a string or object at ${[...t, r].join(".")}. Got: ${typeof e[r]}`);
+	}
+	return n;
+}
+function u(e) {
+	let t = e.split(/(\{\{.*?\}\})/g), r = [];
+	for (let e = 0; e < t.length; e++) {
+		let i = t[e];
+		if (i) if (i.startsWith("{{") && i.endsWith("}}")) {
+			let e = i.slice(2, -2).trim().split("|").map((e) => e.trim()), t = e[0], a = [];
+			for (let t = 1; t < e.length; t++) {
+				let n = e[t], r = n.match(/^([a-zA-Z0-9_]+)(?:\((.*)\))?$/);
+				if (r) {
+					let e = r[1], t = r[2], n = {};
+					if (t) {
+						let e = t.split(",");
+						for (let t = 0; t < e.length; t++) {
+							let r = e[t], i = r.indexOf(":");
+							i > -1 && (n[r.slice(0, i).trim()] = r.slice(i + 1).trim());
+						}
+					}
+					a.push({
+						name: e,
+						options: n
+					});
+				} else a.push({
+					name: n,
+					options: {}
+				});
+			}
+			r.push((e, r, i) => {
+				let o = e ? n(e[t]) : void 0;
+				for (let e = 0; e < a.length; e++) {
+					let t = a[e], n = r.get(t.name);
+					n && (o = n(i, o, t.options));
+				}
+				return o == null ? "" : String(o);
+			});
+		} else r.push(() => i);
+	}
+	return r;
+}
+//#endregion
+export { l as compile, a as createTranslatePlugin, o as getTranslate, u as parseTemplate };
+
+//# sourceMappingURL=translate.js.map

package/dist/translate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"translate.js","names":[],"sources":["../src/translate/index.ts"],"sourcesContent":["import { Context } from \"../core/context.js\";\nimport { DollaPlugin } from \"../core/root.js\";\nimport { unwrap, compose, createAtom, type Getter } from \"../core/signals.js\";\nimport { isFunction } from \"../utils.js\";\n\n// ----- Types ----- //\n\n/**\n * A JSON object of translated strings. Values can be string templates or nested objects.\n */\nexport interface LocalizedStrings extends Record<string, string | LocalizedStrings> {}\n\n/**\n * A function that returns an object of localized strings.\n */\nexport type TranslationFetchFn = () => LocalizedStrings | Promise<LocalizedStrings>;\n\nexport type TOptions = {\n  /**\n   *\n   */\n  count?: Getter<number> | number;\n\n  /**\n   *\n   */\n  context?: Getter<string> | string;\n\n  [value: string]: Getter<any> | any;\n};\n\nexport type LookupFn = (selector: string, options?: TOptions) => string;\n\nexport type Formatter = (locale: string, value: any, options: Record<string, any>) => string;\n\ntype BuiltInFormatters = {\n  number: [number | bigint, Intl.NumberFormatOptions?];\n  datetime: [Date, Intl.DateTimeFormatOptions?];\n  list: [Iterable<string>, Intl.ListFormatOptions?];\n};\n\nexport interface Translator {\n  /**\n   * An array of locale names for all translations the app supports.\n   */\n  supportedLocales: string[];\n\n  /**\n   * A Readable containing the currently loaded locale.\n   */\n  currentLocale: Getter<string>;\n\n  /**\n   * Updates the locale, fetching any translation files as required.\n   * Returns a promise that resolves when the new locale is applied.\n   *\n   * If `name` is undefined the library will try to match the browser language automatically.\n   */\n  setLocale(name?: string): Promise<void>;\n\n  /**\n   * Returns a Readable of the value at `key`.\n\n   * @param selector - Key to the translated value.\n   * @param options - A map of `{{placeholder}}` names and the values to replace them with.\n   *\n   * @example\n   * const value = t(\"your.key.here\", { count: 5 });\n   */\n  t(selector: string, options?: TOptions): Getter<string>;\n\n  format<K extends keyof BuiltInFormatters, V extends BuiltInFormatters[K][0], O extends BuiltInFormatters[K][1]>(\n    name: K,\n    value: Getter<V> | V,\n    options?: O,\n  ): Getter<string>;\n\n  format<V, O>(name: string, value: Getter<V> | V, options?: O): Getter<string>;\n}\n\nexport interface TranslatorOptions {\n  translations: Record<string, LocalizedStrings | TranslationFetchFn>;\n\n  /**\n   * Default locale to load on startup. The translator will try to match the user's browser language if left undefined.\n   */\n  locale?: string;\n\n  formatters?: Record<string, Formatter>;\n}\n\nconst TRANSLATE = Symbol(\"Dolla.Translator\");\n\nexport function createTranslatePlugin(options: TranslatorOptions): DollaPlugin {\n  return async function (context) {\n    const translator = createTranslator(options);\n    context[TRANSLATE] = translator;\n    await translator.setLocale(options.locale);\n  };\n}\n\nexport function getTranslate(context: Context): Translator {\n  if (!context[TRANSLATE]) throw new Error(\"Translate plugin isn't loaded.\");\n  return context[TRANSLATE];\n}\n\n// ----- Code ----- //\n\nfunction createTranslator(options: TranslatorOptions): Translator {\n  const formatters = new Map<string, Formatter>();\n\n  formatters.set(\"number\", (locale, value, options) => {\n    return new Intl.NumberFormat(locale, options).format(Number(value));\n  });\n  formatters.set(\"datetime\", (locale, value, options) => {\n    return new Intl.DateTimeFormat(locale, options).format(new Date(value));\n  });\n  formatters.set(\"list\", (locale, value, options) => {\n    return new Intl.ListFormat(locale, options).format(value);\n  });\n\n  if (options.formatters) {\n    for (const key in options.formatters) {\n      formatters.set(key, options.formatters[key]);\n    }\n  }\n\n  let lookup: LookupFn | undefined;\n\n  const [currentLocale, setCurrentLocale] = createAtom(\"en\");\n  const supportedLocales = [...Object.keys(options.translations)];\n\n  /**\n   * Loads translation for the locale.\n   */\n  async function setLocale(name?: string) {\n    let locale!: string;\n\n    if (name === undefined) {\n      let names = [];\n\n      if (typeof navigator !== \"undefined\") {\n        const nav = navigator as any;\n\n        if (nav.languages?.length > 0) {\n          names.push(...nav.languages);\n        } else if (nav.language) {\n          names.push(nav.language);\n        } else if (nav.browserLanguage) {\n          names.push(nav.browserLanguage);\n        } else if (nav.userLanguage) {\n          names.push(nav.userLanguage);\n        }\n      }\n\n      for (const name of names) {\n        if (name in options.translations) {\n          // Found a matching language.\n          locale = name;\n          break;\n        }\n      }\n    } else {\n      // Tag is the actual tag to set.\n      if (name in options.translations) {\n        locale = name;\n      }\n    }\n\n    if (locale == null) {\n      const firstLanguage = Object.keys(options.translations).at(0);\n      if (firstLanguage) {\n        locale = firstLanguage;\n      }\n    }\n\n    if (!locale || !(locale in options.translations)) {\n      throw new Error(`Locale '${name}' has no translation.`);\n    }\n\n    lookup = await createLookup(locale, formatters, options.translations[locale]);\n\n    // Update locale string after init so t() signals will update.\n    setCurrentLocale(locale);\n  }\n\n  function t(selector: string, options?: TOptions): Getter<string> {\n    return compose(() => {\n      currentLocale(); // track locale\n      return lookup?.(selector, options) ?? selector;\n    });\n  }\n\n  function format<\n    K extends keyof BuiltInFormatters,\n    V extends BuiltInFormatters[K][0],\n    O extends BuiltInFormatters[K][1],\n  >(name: K, value: Getter<V> | V, options?: O): Getter<string>;\n\n  function format<V, O>(name: string, value: Getter<V> | V, options?: O): Getter<string>;\n\n  function format(name: string, value: unknown, options?: Record<string, any>): Getter<string> {\n    const callback = formatters.get(name);\n    if (!callback) {\n      throw new Error(`Unknown format: ${name}`);\n    }\n\n    return compose(() => callback(currentLocale(), unwrap(value), options ?? {}));\n  }\n\n  return {\n    supportedLocales,\n    currentLocale,\n    setLocale,\n    t,\n    format,\n  };\n}\n\n/**\n * Loads the translation and produces an efficient lookup function.\n */\nasync function createLookup(\n  locale: string,\n  formatters: Map<string, Formatter>,\n  translation: TranslationFetchFn | LocalizedStrings,\n) {\n  const strings = isFunction(translation) ? await translation() : translation;\n  const entries = compile(strings);\n  const templates = new Map(entries);\n\n  /**\n   * Looks up the template and produces the output. Any reactive values in `options` are tracked when used.\n   */\n  return function lookup(selector: string, options?: TOptions): string {\n    if (options) {\n      // Handle count (pluralization) and context. Keys become \"key_context_pluralization\".\n      if (options.context != null) {\n        selector += \"_\" + options.context;\n      }\n      if (options.count != null) {\n        if (options.ordinal) {\n          // Try to match the exact number key if there is one (e.g. \"myExampleKey_ordinal_(=2)\" when count is 2).\n          const exact = `${selector}_ordinal_(=${options.count})`;\n          if (templates.has(exact)) {\n            selector = exact;\n          } else {\n            selector += \"_ordinal_\" + new Intl.PluralRules(locale, { type: \"ordinal\" }).select(unwrap(options.count));\n          }\n        } else {\n          // Try to match the exact number key if there is one (e.g. \"myExampleKey_(=2)\" when count is 2).\n          const exact = `${selector}_(=${options.count})`;\n          if (templates.has(exact)) {\n            selector = exact;\n          } else {\n            selector += \"_\" + new Intl.PluralRules(locale).select(unwrap(options.count));\n          }\n        }\n      }\n    }\n\n    const template = templates.get(selector);\n    if (!template) return selector;\n\n    let output = \"\";\n\n    for (let i = 0; i < template.length; i++) {\n      output += template[i](options, formatters, locale);\n    }\n\n    return output;\n  };\n}\n\n/**\n * Compiles an object of translated strings into a set of function templates.\n */\nexport function compile(strings: { [key: string]: any }, path: string[] = []): [string, CompiledTemplate][] {\n  const entries: [string, CompiledTemplate][] = [];\n\n  for (const key in strings) {\n    switch (typeof strings[key]) {\n      case \"string\":\n        entries.push([[...path, key].join(\".\"), parseTemplate(strings[key])]);\n        break;\n      case \"object\":\n        entries.push(...compile(strings[key], [...path, key]));\n        break;\n      default:\n        throw new Error(\n          `Expected to find a string or object at ${[...path, key].join(\".\")}. Got: ${typeof strings[key]}`,\n        );\n    }\n  }\n\n  return entries;\n}\n\nexport type TemplateSegmentFn = (\n  options: Record<string, any> | undefined,\n  formatters: Map<string, Formatter>,\n  locale: string,\n) => string;\n\nexport type CompiledTemplate = TemplateSegmentFn[];\n\n/**\n * Parse a string template into an array of functions that will produce each piece of the output when called.\n */\nexport function parseTemplate(template: string): CompiledTemplate {\n  const tokens = template.split(/(\\{\\{.*?\\}\\})/g);\n  const segments: TemplateSegmentFn[] = [];\n\n  for (let i = 0; i < tokens.length; i++) {\n    const token = tokens[i];\n    if (!token) continue;\n\n    if (token.startsWith(\"{{\") && token.endsWith(\"}}\")) {\n      const inner = token.slice(2, -2).trim();\n      const parts = inner.split(\"|\").map((p) => p.trim());\n\n      const name = parts[0];\n      const parsedFormats: { name: string; options: Record<string, string> }[] = [];\n\n      // Parse formatters at build-time to prevent string splitting on every render\n      for (let j = 1; j < parts.length; j++) {\n        const formatStr = parts[j];\n        const match = formatStr.match(/^([a-zA-Z0-9_]+)(?:\\((.*)\\))?$/);\n\n        if (match) {\n          const formatName = match[1];\n          const optionsStr = match[2];\n          const optsObj: Record<string, string> = {};\n\n          if (optionsStr) {\n            const pairs = optionsStr.split(\",\");\n            for (let k = 0; k < pairs.length; k++) {\n              const pair = pairs[k];\n              const colonIndex = pair.indexOf(\":\");\n              if (colonIndex > -1) {\n                optsObj[pair.slice(0, colonIndex).trim()] = pair.slice(colonIndex + 1).trim();\n              }\n            }\n          }\n          parsedFormats.push({ name: formatName, options: optsObj });\n        } else {\n          parsedFormats.push({ name: formatStr, options: {} });\n        }\n      }\n\n      // Push the dynamic closure\n      segments.push((options, formatters, locale) => {\n        // Evaluate and track the specific option at runtime.\n        // This code runs in the t() computed context.\n        let value = options ? unwrap(options[name]) : undefined;\n\n        for (let k = 0; k < parsedFormats.length; k++) {\n          const fmt = parsedFormats[k];\n          const formatterFn = formatters.get(fmt.name);\n          if (formatterFn) {\n            value = formatterFn(locale, value, fmt.options);\n          }\n        }\n\n        return value != null ? String(value) : \"\";\n      });\n    } else {\n      // Push a static closure that just returns the token\n      segments.push(() => token);\n    }\n  }\n\n  return segments;\n}\n"],"mappings":";;AA2FA,IAAM,IAAY,OAAO,mBAAmB;AAE5C,SAAgB,EAAsB,GAAyC;AAC7E,QAAO,eAAgB,GAAS;EAC9B,IAAM,IAAa,EAAiB,EAAQ;AAE5C,EADA,EAAQ,KAAa,GACrB,MAAM,EAAW,UAAU,EAAQ,OAAO;;;AAI9C,SAAgB,EAAa,GAA8B;AACzD,KAAI,CAAC,EAAQ,GAAY,OAAU,MAAM,iCAAiC;AAC1E,QAAO,EAAQ;;AAKjB,SAAS,EAAiB,GAAwC;CAChE,IAAM,oBAAa,IAAI,KAAwB;AAY/C,KAVA,EAAW,IAAI,WAAW,GAAQ,GAAO,MAChC,IAAI,KAAK,aAAa,GAAQ,EAAQ,CAAC,OAAO,OAAO,EAAM,CAAC,CACnE,EACF,EAAW,IAAI,aAAa,GAAQ,GAAO,MAClC,IAAI,KAAK,eAAe,GAAQ,EAAQ,CAAC,OAAO,IAAI,KAAK,EAAM,CAAC,CACvE,EACF,EAAW,IAAI,SAAS,GAAQ,GAAO,MAC9B,IAAI,KAAK,WAAW,GAAQ,EAAQ,CAAC,OAAO,EAAM,CACzD,EAEE,EAAQ,WACV,MAAK,IAAM,KAAO,EAAQ,WACxB,GAAW,IAAI,GAAK,EAAQ,WAAW,GAAK;CAIhD,IAAI,GAEE,CAAC,GAAe,KAAoB,EAAW,KAAK,EACpD,IAAmB,CAAC,GAAG,OAAO,KAAK,EAAQ,aAAa,CAAC;CAK/D,eAAe,EAAU,GAAe;EACtC,IAAI;AAEJ,MAAI,MAAS,KAAA,GAAW;GACtB,IAAI,IAAQ,EAAE;AAEd,OAAI,OAAO,YAAc,KAAa;IACpC,IAAM,IAAM;AAEZ,IAAI,EAAI,WAAW,SAAS,IAC1B,EAAM,KAAK,GAAG,EAAI,UAAU,GACnB,EAAI,WACb,EAAM,KAAK,EAAI,SAAS,GACf,EAAI,kBACb,EAAM,KAAK,EAAI,gBAAgB,GACtB,EAAI,gBACb,EAAM,KAAK,EAAI,aAAa;;AAIhC,QAAK,IAAM,KAAQ,EACjB,KAAI,KAAQ,EAAQ,cAAc;AAEhC,QAAS;AACT;;SAKA,KAAQ,EAAQ,iBAClB,IAAS;AAIb,MAAI,KAAU,MAAM;GAClB,IAAM,IAAgB,OAAO,KAAK,EAAQ,aAAa,CAAC,GAAG,EAAE;AAC7D,GAAI,MACF,IAAS;;AAIb,MAAI,CAAC,KAAU,EAAE,KAAU,EAAQ,cACjC,OAAU,MAAM,WAAW,EAAK,uBAAuB;AAMzD,EAHA,IAAS,MAAM,EAAa,GAAQ,GAAY,EAAQ,aAAa,GAAQ,EAG7E,EAAiB,EAAO;;CAG1B,SAAS,EAAE,GAAkB,GAAoC;AAC/D,SAAO,SACL,GAAe,EACR,IAAS,GAAU,EAAQ,IAAI,GACtC;;CAWJ,SAAS,EAAO,GAAc,GAAgB,GAA+C;EAC3F,IAAM,IAAW,EAAW,IAAI,EAAK;AACrC,MAAI,CAAC,EACH,OAAU,MAAM,mBAAmB,IAAO;AAG5C,SAAO,QAAc,EAAS,GAAe,EAAE,EAAO,EAAM,EAAE,KAAW,EAAE,CAAC,CAAC;;AAG/E,QAAO;EACL;EACA;EACA;EACA;EACA;EACD;;AAMH,eAAe,EACb,GACA,GACA,GACA;CAEA,IAAM,IAAU,EADA,EAAW,EAAY,GAAG,MAAM,GAAa,GAAG,EAChC,EAC1B,IAAY,IAAI,IAAI,EAAQ;AAKlC,QAAO,SAAgB,GAAkB,GAA4B;AACnE,MAAI,MAEE,EAAQ,WAAW,SACrB,KAAY,MAAM,EAAQ,UAExB,EAAQ,SAAS,MACnB,KAAI,EAAQ,SAAS;GAEnB,IAAM,IAAQ,GAAG,EAAS,aAAa,EAAQ,MAAM;AACrD,GAAI,EAAU,IAAI,EAAM,GACtB,IAAW,IAEX,KAAY,cAAc,IAAI,KAAK,YAAY,GAAQ,EAAE,MAAM,WAAW,CAAC,CAAC,OAAO,EAAO,EAAQ,MAAM,CAAC;SAEtG;GAEL,IAAM,IAAQ,GAAG,EAAS,KAAK,EAAQ,MAAM;AAC7C,GAAI,EAAU,IAAI,EAAM,GACtB,IAAW,IAEX,KAAY,MAAM,IAAI,KAAK,YAAY,EAAO,CAAC,OAAO,EAAO,EAAQ,MAAM,CAAC;;EAMpF,IAAM,IAAW,EAAU,IAAI,EAAS;AACxC,MAAI,CAAC,EAAU,QAAO;EAEtB,IAAI,IAAS;AAEb,OAAK,IAAI,IAAI,GAAG,IAAI,EAAS,QAAQ,IACnC,MAAU,EAAS,GAAG,GAAS,GAAY,EAAO;AAGpD,SAAO;;;AAOX,SAAgB,EAAQ,GAAiC,IAAiB,EAAE,EAAgC;CAC1G,IAAM,IAAwC,EAAE;AAEhD,MAAK,IAAM,KAAO,EAChB,SAAQ,OAAO,EAAQ,IAAvB;EACE,KAAK;AACH,KAAQ,KAAK,CAAC,CAAC,GAAG,GAAM,EAAI,CAAC,KAAK,IAAI,EAAE,EAAc,EAAQ,GAAK,CAAC,CAAC;AACrE;EACF,KAAK;AACH,KAAQ,KAAK,GAAG,EAAQ,EAAQ,IAAM,CAAC,GAAG,GAAM,EAAI,CAAC,CAAC;AACtD;EACF,QACE,OAAU,MACR,0CAA0C,CAAC,GAAG,GAAM,EAAI,CAAC,KAAK,IAAI,CAAC,SAAS,OAAO,EAAQ,KAC5F;;AAIP,QAAO;;AAcT,SAAgB,EAAc,GAAoC;CAChE,IAAM,IAAS,EAAS,MAAM,iBAAiB,EACzC,IAAgC,EAAE;AAExC,MAAK,IAAI,IAAI,GAAG,IAAI,EAAO,QAAQ,KAAK;EACtC,IAAM,IAAQ,EAAO;AAChB,QAEL,KAAI,EAAM,WAAW,KAAK,IAAI,EAAM,SAAS,KAAK,EAAE;GAElD,IAAM,IADQ,EAAM,MAAM,GAAG,GAAG,CAAC,MACnB,CAAM,MAAM,IAAI,CAAC,KAAK,MAAM,EAAE,MAAM,CAAC,EAE7C,IAAO,EAAM,IACb,IAAqE,EAAE;AAG7E,QAAK,IAAI,IAAI,GAAG,IAAI,EAAM,QAAQ,KAAK;IACrC,IAAM,IAAY,EAAM,IAClB,IAAQ,EAAU,MAAM,iCAAiC;AAE/D,QAAI,GAAO;KACT,IAAM,IAAa,EAAM,IACnB,IAAa,EAAM,IACnB,IAAkC,EAAE;AAE1C,SAAI,GAAY;MACd,IAAM,IAAQ,EAAW,MAAM,IAAI;AACnC,WAAK,IAAI,IAAI,GAAG,IAAI,EAAM,QAAQ,KAAK;OACrC,IAAM,IAAO,EAAM,IACb,IAAa,EAAK,QAAQ,IAAI;AACpC,OAAI,IAAa,OACf,EAAQ,EAAK,MAAM,GAAG,EAAW,CAAC,MAAM,IAAI,EAAK,MAAM,IAAa,EAAE,CAAC,MAAM;;;AAInF,OAAc,KAAK;MAAE,MAAM;MAAY,SAAS;MAAS,CAAC;UAE1D,GAAc,KAAK;KAAE,MAAM;KAAW,SAAS,EAAE;KAAE,CAAC;;AAKxD,KAAS,MAAM,GAAS,GAAY,MAAW;IAG7C,IAAI,IAAQ,IAAU,EAAO,EAAQ,GAAM,GAAG,KAAA;AAE9C,SAAK,IAAI,IAAI,GAAG,IAAI,EAAc,QAAQ,KAAK;KAC7C,IAAM,IAAM,EAAc,IACpB,IAAc,EAAW,IAAI,EAAI,KAAK;AAC5C,KAAI,MACF,IAAQ,EAAY,GAAQ,GAAO,EAAI,QAAQ;;AAInD,WAAO,KAAS,OAAuB,KAAhB,OAAO,EAAM;KACpC;QAGF,GAAS,WAAW,EAAM;;AAI9B,QAAO"}