@marimo-team/islands 0.25.3-dev23 → 0.25.3-dev230

package/dist/utils-DXkj82sK.js

@@ -0,0 +1,813 @@
+import { a as e, r as t } from "./rolldown-runtime-Cb76FRpK.js";
+import { t as n } from "./react-sHtZdjeP.js";
+import { t as r } from "./compiler-runtime-CldRdSsv.js";
+//#region ../node_modules/.pnpm/react-use-event-hook@0.9.6_react@19.3.0/node_modules/react-use-event-hook/dist/esm/useEvent.js
+var i = /* @__PURE__ */ e(n()), a = typeof window < "u" ? i.useInsertionEffect || i.useLayoutEffect : () => {};
+function o(e) {
+	let t = i.useRef(s);
+	a(() => {
+		t.current = e;
+	}, [e]);
+	let n = i.useRef(null);
+	return n.current ||= function() {
+		return t.current.apply(this, arguments);
+	}, n.current;
+}
+function s() {
+	throw Error("INVALID_USEEVENT_INVOCATION: the callback from useEvent cannot be invoked before the component has mounted.");
+}
+//#endregion
+//#region ../node_modules/.pnpm/jotai@2.20.3_@babel+core@7.29.0_supports-color@10.0.0__@babel+template@7.28.6_@types+react@19.3.0_react@19.3.0/node_modules/jotai/esm/vanilla/internals.mjs
+var c = /* @__PURE__ */ t({
+	INTERNAL_addPendingPromiseToDependency: () => g,
+	INTERNAL_buildStoreRev3: () => L,
+	INTERNAL_getBuildingBlocksRev3: () => I,
+	INTERNAL_getMountedOrPendingDependents: () => _,
+	INTERNAL_hasInitialValue: () => l,
+	INTERNAL_initializeStoreHooksRev3: () => b,
+	INTERNAL_isActuallyWritableAtom: () => u,
+	INTERNAL_isAtomStateInitialized: () => f,
+	INTERNAL_isPromiseLike: () => m,
+	INTERNAL_returnAtomValue: () => p,
+	INTERNAL_shouldThrowSynchronously: () => h
+});
+function l(e) {
+	return "init" in e;
+}
+function u(e) {
+	return typeof e.write == "function";
+}
+function d(e) {
+	return !!e.onMount;
+}
+function f(e) {
+	return "v" in e || "e" in e;
+}
+function p(e) {
+	if ("e" in e) throw e.e;
+	return e.v;
+}
+function m(e) {
+	return typeof e?.then == "function";
+}
+function h(e) {
+	if (!(e instanceof Error)) return !1;
+	let t = e.name, n = e.message.toLowerCase();
+	return (t === "RangeError" || t === "InternalError") && (n.includes("call stack") || n.includes("too much recursion") || n.includes("stack overflow"));
+}
+function g(e, t, n) {
+	if (!n.p.has(e)) {
+		n.p.add(e);
+		let r = () => n.p.delete(e);
+		t.then(r, r);
+	}
+}
+function _(e, t, n) {
+	let r = n.get(e)?.t, i = t.p;
+	if (!r?.size) return i;
+	if (!i.size) return r;
+	let a = new Set(r);
+	for (let e of i) a.add(e);
+	return a;
+}
+var v = () => {
+	let e = /* @__PURE__ */ new Set(), t = () => e.forEach((e) => e());
+	return t.add = (t) => (e.add(t), () => e.delete(t)), t;
+}, y = () => {
+	let e = {}, t = /* @__PURE__ */ new WeakMap(), n = (n) => {
+		var r, i;
+		(r = t.get(e)) == null || r.forEach((e) => e(n)), (i = t.get(n)) == null || i.forEach((e) => e());
+	};
+	return n.add = (n, r) => {
+		let i = n || e, a = t.get(i);
+		return a || (a = /* @__PURE__ */ new Set(), t.set(i, a)), a.add(r), () => {
+			a.delete(r), a.size || t.delete(i);
+		};
+	}, n;
+};
+function b(e) {
+	return e.i ||= y(), e.r ||= y(), e.c ||= y(), e.m ||= y(), e.u ||= y(), e.f ||= v(), e;
+}
+function x(e) {
+	return !!e.INTERNAL_onInit;
+}
+var ee = (e, t, n, ...r) => n.read(...r), S = (e, t, n, ...r) => n.write(...r), te = (e, t, n) => n.INTERNAL_onInit(t), ne = (e, t, n, r) => n.onMount?.call(n, r), C = (e, t, n) => {
+	var r;
+	let i = e[0], a = i.get(n);
+	if (!a) {
+		let o = e[6], s = e[9];
+		a = {
+			d: /* @__PURE__ */ new Map(),
+			p: /* @__PURE__ */ new Set(),
+			n: 0
+		}, i.set(n, a), (r = o.i) == null || r.call(o, n), x(n) && s(e, t, n);
+	}
+	return a;
+}, w = (e, t) => {
+	let n = e[1], r = e[3], i = e[4], a = e[5], o = e[6], s = e[13];
+	if (!o.f && !r.size && !i.size && !a.size) return;
+	let c = [], l = (e) => {
+		try {
+			e();
+		} catch (e) {
+			c.push(e);
+		}
+	};
+	do {
+		o.f && l(o.f);
+		let c = /* @__PURE__ */ new Set();
+		for (let e of r) {
+			let t = n.get(e)?.l;
+			if (t) for (let e of t) c.add(e);
+		}
+		r.clear();
+		for (let e of a) c.add(e);
+		a.clear();
+		for (let e of i) c.add(e);
+		i.clear();
+		for (let e of c) l(e);
+		r.size && s(e, t);
+	} while (r.size || a.size || i.size);
+	if (c.length) throw AggregateError(c);
+}, T = (e, t) => {
+	let n = e[1], r = e[2], i = e[3], a = e[11], o = e[14], s = e[17];
+	if (!i.size) return;
+	let c = [], l = [], u = /* @__PURE__ */ new WeakSet(), d = /* @__PURE__ */ new WeakSet(), f = [], p = [];
+	for (let n of i) f.push(n), p.push(a(e, t, n));
+	for (; f.length;) {
+		let i = f.length - 1, o = f[i], s = p[i];
+		if (d.has(o)) {
+			f.pop(), p.pop();
+			continue;
+		}
+		if (u.has(o)) {
+			r.get(o) === s.n && (c.push(o), l.push(s)), d.add(o), f.pop(), p.pop();
+			continue;
+		}
+		u.add(o);
+		for (let r of _(o, s, n)) u.has(r) || (f.push(r), p.push(a(e, t, r)));
+	}
+	for (let n = c.length - 1; n >= 0; --n) {
+		let a = c[n], u = l[n], d = !1;
+		for (let e of u.d.keys()) if (e !== a && i.has(e)) {
+			d = !0;
+			break;
+		}
+		d && (r.set(a, u.n), o(e, t, a), s(e, t, a)), r.delete(a);
+	}
+}, E = (e, t, n) => {
+	var r, i;
+	let a = e[1], o = e[2], s = e[3], c = e[6], d = e[7], _ = e[11], v = e[12], y = e[13], b = e[14], x = e[16], ee = e[17], S = e[20], te = e[26], ne = e[28], C = _(e, t, n), w = ne[0];
+	if (f(C)) {
+		if (a.has(n) && o.get(n) !== C.n || C.m === w) return C.m = w, C;
+		let r = !1;
+		for (let [n, i] of C.d) if (b(e, t, n).n !== i) {
+			r = !0;
+			break;
+		}
+		if (!r) return C.m = w, C;
+	}
+	let T = !0, E = new Set(C.d.keys()), D = () => {
+		for (let e of E) C.d.delete(e);
+	}, O = () => {
+		if (a.has(n)) {
+			let r = !s.size;
+			ee(e, t, n), r && (y(e, t), v(e, t));
+		}
+	}, k = (r) => {
+		var i;
+		if (r === n) {
+			let n = _(e, t, r);
+			if (!f(n)) {
+				if (l(r)) S(e, t, r, r.init);
+				else throw Error("no atom init");
+			}
+			return p(n);
+		}
+		let o = b(e, t, r);
+		try {
+			return p(o);
+		} finally {
+			E.delete(r), C.d.set(r, o.n), m(C.v) && g(n, C.v, o), a.has(n) && ((i = a.get(r)) == null || i.t.add(n)), T || O();
+		}
+	}, A, j, M = {
+		get signal() {
+			return A ||= new AbortController(), A.signal;
+		},
+		get setSelf() {
+			return !j && u(n) && (j = (...r) => {
+				if (!T) try {
+					return x(e, t, n, r);
+				} finally {
+					y(e, t), v(e, t);
+				}
+			}), j;
+		}
+	}, N = C.n, P = o.get(n) === N;
+	try {
+		let i = d(e, t, n, k, M);
+		if (S(e, t, n, i), m(i)) {
+			te(e, t, i, () => A?.abort());
+			let n = () => {
+				D(), O();
+			};
+			i.then(n, n);
+		} else D();
+		return (r = c.r) == null || r.call(c, n), C.m = w, C;
+	} catch (e) {
+		if (h(e)) throw e;
+		return delete C.v, C.e = e, ++C.n, C.m = w, C;
+	} finally {
+		T = !1, C.n !== N && P && (o.set(n, C.n), s.add(n), (i = c.c) == null || i.call(c, n));
+	}
+}, D = (e, t, n) => {
+	let r = e[1], i = e[2], a = e[11], o = [n];
+	for (; o.length;) {
+		let n = o.pop(), s = a(e, t, n);
+		for (let c of _(n, s, r)) {
+			let n = a(e, t, c);
+			i.get(c) !== n.n && (i.set(c, n.n), o.push(c));
+		}
+	}
+}, O = (e, t, n, r) => {
+	let i = e[3], a = e[6], o = e[8], s = e[11], c = e[12], u = e[13], d = e[14], f = e[15], m = e[16], h = e[17], g = e[20], _ = e[28], v = !0, y = (n) => p(d(e, t, n)), b = (r, ...o) => {
+		var d;
+		let p = s(e, t, r);
+		try {
+			if (r === n) {
+				if (!l(r)) throw Error("atom not writable");
+				let n = p.n, s = o[0];
+				g(e, t, r, s), h(e, t, r), n !== p.n && (++_[0], i.add(r), f(e, t, r), (d = a.c) == null || d.call(a, r));
+				return;
+			}
+			return m(e, t, r, o);
+		} finally {
+			v || (u(e, t), c(e, t));
+		}
+	};
+	try {
+		return o(e, t, n, y, b, ...r);
+	} finally {
+		v = !1;
+	}
+}, k = (e, t, n) => {
+	var r;
+	let i = e[1], a = e[3], o = e[6], s = e[11], c = e[15], l = e[18], u = e[19], d = s(e, t, n), f = i.get(n);
+	if (f && d.d.size > 0) {
+		for (let [i, u] of d.d) if (!f.d.has(i)) {
+			let d = s(e, t, i);
+			l(e, t, i).t.add(n), f.d.add(i), u !== d.n && (a.add(i), c(e, t, i), (r = o.c) == null || r.call(o, i));
+		}
+		for (let r of f.d) d.d.has(r) || (f.d.delete(r), u(e, t, r)?.t.delete(n));
+	}
+}, A = (e, t, n) => {
+	var r;
+	let i = e[1], a = e[4], o = e[6], s = e[10], c = e[11], l = e[12], f = e[13], p = e[14], m = e[16], h = e[18], g = c(e, t, n), _ = i.get(n);
+	if (!_) {
+		p(e, t, n);
+		for (let r of g.d.keys()) h(e, t, r).t.add(n);
+		_ = {
+			l: /* @__PURE__ */ new Set(),
+			d: new Set(g.d.keys()),
+			t: /* @__PURE__ */ new Set()
+		}, i.set(n, _), u(n) && d(n) && a.add(() => {
+			let r = !0, i = (...i) => {
+				try {
+					return m(e, t, n, i);
+				} finally {
+					r || (f(e, t), l(e, t));
+				}
+			};
+			try {
+				let a = s(e, t, n, i);
+				a && (_.u = () => {
+					r = !0;
+					try {
+						a();
+					} finally {
+						r = !1;
+					}
+				});
+			} finally {
+				r = !1;
+			}
+		}), (r = o.m) == null || r.call(o, n);
+	}
+	return _;
+}, j = (e, t, n) => {
+	var r;
+	let i = e[1], a = e[5], o = e[6], s = e[11], c = e[19], l = s(e, t, n), u = i.get(n);
+	if (!u || u.l.size) return u;
+	let d = !1;
+	for (let e of u.t) if (i.get(e)?.d.has(n)) {
+		d = !0;
+		break;
+	}
+	if (!d) {
+		u.u && a.add(u.u), u = void 0, i.delete(n);
+		for (let r of l.d.keys()) c(e, t, r)?.t.delete(n);
+		(r = o.u) == null || r.call(o, n);
+		return;
+	}
+	return u;
+}, M = (e, t, n, r) => {
+	let i = e[11], a = e[27], o = i(e, t, n), s = "v" in o, c = o.v;
+	if (m(r)) for (let a of o.d.keys()) g(n, r, i(e, t, a));
+	o.v = r, delete o.e, (!s || !Object.is(c, o.v)) && (++o.n, m(c) && a(e, t, c));
+}, N = (e, t, n) => {
+	let r = e[14];
+	return p(r(e, t, n));
+}, P = (e, t, n, ...r) => {
+	let i = e[3], a = e[12], o = e[13], s = e[16], c = i.size;
+	try {
+		return s(e, t, n, r);
+	} finally {
+		i.size !== c && (o(e, t), a(e, t));
+	}
+}, re = (e, t, n, r) => {
+	let i = e[12], a = e[13], o = e[18], s = e[19], c = o(e, t, n).l;
+	return c.add(r), a(e, t), i(e, t), () => {
+		c.delete(r), s(e, t, n), a(e, t), i(e, t);
+	};
+}, ie = (e, t, n, r) => {
+	let i = e[25], a = i.get(n);
+	if (!a) {
+		a = /* @__PURE__ */ new Set(), i.set(n, a);
+		let e = () => i.delete(n);
+		n.then(e, e);
+	}
+	a.add(r);
+}, ae = (e, t, n) => {
+	e[25].get(n)?.forEach((e) => e());
+}, F = /* @__PURE__ */ new WeakMap();
+function I(e) {
+	let t = F.get(e), n = t[24];
+	return n ? n(t, e) : t;
+}
+function L(...e) {
+	let t = {
+		get(e) {
+			return r(n, t, e);
+		},
+		set(e, ...r) {
+			return i(n, t, e, ...r);
+		},
+		sub(e, r) {
+			return a(n, t, e, r);
+		}
+	}, n = [
+		/* @__PURE__ */ new WeakMap(),
+		/* @__PURE__ */ new WeakMap(),
+		/* @__PURE__ */ new WeakMap(),
+		/* @__PURE__ */ new Set(),
+		/* @__PURE__ */ new Set(),
+		/* @__PURE__ */ new Set(),
+		{},
+		ee,
+		S,
+		te,
+		ne,
+		C,
+		w,
+		T,
+		E,
+		D,
+		O,
+		k,
+		A,
+		j,
+		M,
+		N,
+		P,
+		re,
+		void 0,
+		/* @__PURE__ */ new WeakMap(),
+		ie,
+		ae,
+		[0]
+	].map((t, n) => e[n] || t);
+	F.set(t, Object.freeze(n));
+	let r = n[21], i = n[22], a = n[23];
+	return t;
+}
+//#endregion
+//#region ../node_modules/.pnpm/jotai@2.20.3_@babel+core@7.29.0_supports-color@10.0.0__@babel+template@7.28.6_@types+react@19.3.0_react@19.3.0/node_modules/jotai/esm/vanilla.mjs
+var oe = 0;
+function R(e, t) {
+	let n = `atom${++oe}`, r = { toString() {
+		return n;
+	} };
+	return typeof e == "function" ? r.read = e : (r.init = e, r.read = se, r.write = ce), t && (r.write = t), r;
+}
+function se(e) {
+	return e(this);
+}
+function ce(e, t, n) {
+	return t(this, typeof n == "function" ? n(e(this)) : n);
+}
+function z() {
+	return L();
+}
+var le;
+function ue() {
+	return le ||= z(), le;
+}
+//#endregion
+//#region ../node_modules/.pnpm/jotai@2.20.3_@babel+core@7.29.0_supports-color@10.0.0__@babel+template@7.28.6_@types+react@19.3.0_react@19.3.0/node_modules/jotai/esm/react.mjs
+var B = (0, i.createContext)(void 0);
+function V(e) {
+	let t = (0, i.useContext)(B);
+	return e?.store || t || ue();
+}
+function de({ children: e, store: t }) {
+	let n = (0, i.useRef)(null);
+	return t ? (0, i.createElement)(B.Provider, { value: t }, e) : (n.current === null && (n.current = z()), (0, i.createElement)(B.Provider, { value: n.current }, e));
+}
+var H = (e) => typeof e?.then == "function", U = (e) => {
+	e.status || (e.status = "pending", e.then((t) => {
+		e.status = "fulfilled", e.value = t;
+	}, (t) => {
+		e.status = "rejected", e.reason = t;
+	}));
+}, fe = i.use || ((e) => {
+	if (e.status === "pending") throw e;
+	if (e.status === "fulfilled") return e.value;
+	throw e.status === "rejected" ? e.reason : (U(e), e);
+}), W = /* @__PURE__ */ new WeakMap(), G = (e, t, n) => {
+	let r = I(e), i = r[26], a = W.get(t);
+	return a || (a = new Promise((o, s) => {
+		let c = t, l = (e) => (t) => {
+			c === e && o(t);
+		}, u = (e) => (t) => {
+			c === e && s(t);
+		}, d = () => {
+			try {
+				let t = n();
+				H(t) ? (W.set(t, a), c = t, t.then(l(t), u(t)), i(r, e, t, d)) : o(t);
+			} catch (e) {
+				s(e);
+			}
+		};
+		t.then(l(t), u(t)), i(r, e, t, d);
+	}), W.set(t, a)), a;
+};
+function K(e, t) {
+	let { delay: n, unstable_promiseStatus: r = !i.use } = t || {}, a = V(t), [[o, s, c], l] = (0, i.useReducer)((t) => {
+		let n = a.get(e);
+		return Object.is(t[0], n) && t[1] === a && t[2] === e ? t : [
+			n,
+			a,
+			e
+		];
+	}, void 0, () => [
+		a.get(e),
+		a,
+		e
+	]), u = o;
+	if ((s !== a || c !== e) && (l(), u = a.get(e)), (0, i.useEffect)(() => {
+		let t = a.sub(e, () => {
+			if (r) try {
+				let t = a.get(e);
+				H(t) && U(G(a, t, () => a.get(e)));
+			} catch {}
+			if (typeof n == "number") {
+				console.warn("[DEPRECATED] delay option is deprecated and will be removed in v3.\n\nMigration guide:\n\nCreate a custom hook like the following.\n\nfunction useAtomValueWithDelay<Value>(\n  atom: Atom<Value>,\n  options: { delay: number },\n): Value {\n  const { delay } = options\n  const store = useStore(options)\n  const [value, setValue] = useState(() => store.get(atom))\n  useEffect(() => {\n    const unsub = store.sub(atom, () => {\n      setTimeout(() => setValue(store.get(atom)), delay)\n    })\n    return unsub\n  }, [store, atom, delay])\n  return value\n}\n"), setTimeout(l, n);
+				return;
+			}
+			l();
+		});
+		return l(), t;
+	}, [
+		a,
+		e,
+		n,
+		r
+	]), (0, i.useDebugValue)(u), H(u)) {
+		let t = G(a, u, () => a.get(e));
+		return r && U(t), fe(t);
+	}
+	return u;
+}
+function q(e, t) {
+	let n = V(t);
+	return (0, i.useCallback)((...t) => n.set(e, ...t), [n, e]);
+}
+function pe(e, t) {
+	return [K(e, t), q(e, t)];
+}
+//#endregion
+//#region ../node_modules/.pnpm/jotai@2.20.3_@babel+core@7.29.0_supports-color@10.0.0__@babel+template@7.28.6_@types+react@19.3.0_react@19.3.0/node_modules/jotai/esm/vanilla/utils.mjs
+var me = /* @__PURE__ */ Symbol("");
+function he(e, t) {
+	return R(e, function(e, n, r) {
+		n(this, t(e(this), r));
+	});
+}
+function ge(e, t) {
+	let n = null, r = /* @__PURE__ */ new Map(), i = /* @__PURE__ */ new Set(), a = (i) => {
+		let s;
+		if (t === void 0) s = r.get(i);
+		else for (let [e, n] of r) if (t(e, i)) {
+			s = n;
+			break;
+		}
+		if (s !== void 0) {
+			if (n?.(s[1], i)) a.remove(i);
+			else return s[0];
+		}
+		let c = e(i);
+		return r.set(i, [c, Date.now()]), o("CREATE", i, c), c;
+	}, o = (e, t, n) => {
+		for (let r of i) r({
+			type: e,
+			param: t,
+			atom: n
+		});
+	};
+	return a.unstable_listen = (e) => (i.add(e), () => {
+		i.delete(e);
+	}), a.getParams = () => r.keys(), a.remove = (e) => {
+		if (t === void 0) {
+			if (!r.has(e)) return;
+			let [t] = r.get(e);
+			r.delete(e), o("REMOVE", e, t);
+		} else for (let [n, [i]] of r) if (t(n, e)) {
+			r.delete(n), o("REMOVE", n, i);
+			break;
+		}
+	}, a.setShouldRemove = (e) => {
+		if (n = e, n) for (let [e, [t, i]] of r) n(i, e) && (r.delete(e), o("REMOVE", e, t));
+	}, a;
+}
+var J = (e, t, n) => (t.has(n) ? t : t.set(n, e())).get(n), _e = /* @__PURE__ */ new WeakMap(), ve = (e, t, n, r) => J(e, J(() => /* @__PURE__ */ new WeakMap(), J(() => /* @__PURE__ */ new WeakMap(), _e, t), n), r);
+function ye(e, t, n = Object.is) {
+	return ve(() => {
+		let r = /* @__PURE__ */ Symbol(), i = ([e, i]) => {
+			if (i === r) return t(e);
+			let a = t(e, i);
+			return n(i, a) ? i : a;
+		}, a = R((t) => {
+			let n = t(a), r = t(e);
+			return i([r, n]);
+		});
+		return a.init = r, a;
+	}, e, t, n);
+}
+var Y = (e, t, n) => (t.has(n) ? t : t.set(n, e())).get(n), be = /* @__PURE__ */ new WeakMap(), xe = (e, t, n) => Y(e, Y(() => /* @__PURE__ */ new WeakMap(), be, t), n), Se = {}, X = (e) => !!e.write, Ce = (e) => typeof e == "function";
+function we(e, t) {
+	return xe(() => {
+		let n = /* @__PURE__ */ new WeakMap(), r = (a, o) => {
+			let s = n.get(a);
+			if (s) return s;
+			let c = o && n.get(o), l = [], u = [];
+			return a.forEach((n, o) => {
+				let s = t ? t(n) : o;
+				u[o] = s;
+				let d = c && c.atomList[c.keyList.indexOf(s)];
+				if (d) {
+					l[o] = d;
+					return;
+				}
+				let f = (t) => {
+					let n = t(i), o = t(e), c = r(o, n?.arr).keyList.indexOf(s);
+					if (c < 0 || c >= o.length) {
+						let e = a[r(a).keyList.indexOf(s)];
+						if (e) return e;
+						throw Error("splitAtom: index out of bounds for read");
+					}
+					return o[c];
+				};
+				l[o] = X(e) ? R(f, (t, n, a) => {
+					let o = t(i), c = t(e), l = r(c, o?.arr).keyList.indexOf(s);
+					if (l < 0 || l >= c.length) throw Error("splitAtom: index out of bounds for write");
+					let u = Ce(a) ? a(c[l]) : a;
+					Object.is(c[l], u) || n(e, [
+						...c.slice(0, l),
+						u,
+						...c.slice(l + 1)
+					]);
+				}) : R(f);
+			}), s = c && c.keyList.length === u.length && c.keyList.every((e, t) => e === u[t]) ? c : {
+				arr: a,
+				atomList: l,
+				keyList: u
+			}, n.set(a, s), s;
+		}, i = R((t) => {
+			let n = t(i), a = t(e);
+			return r(a, n?.arr);
+		});
+		i.init = void 0;
+		let a = X(e) ? R((e) => e(i).atomList, (t, n, r) => {
+			switch (r.type) {
+				case "remove": {
+					let i = t(a).indexOf(r.atom);
+					if (i >= 0) {
+						let r = t(e);
+						n(e, [...r.slice(0, i), ...r.slice(i + 1)]);
+					}
+					break;
+				}
+				case "insert": {
+					let i = r.before ? t(a).indexOf(r.before) : t(a).length;
+					if (i >= 0) {
+						let a = t(e);
+						n(e, [
+							...a.slice(0, i),
+							r.value,
+							...a.slice(i)
+						]);
+					}
+					break;
+				}
+				case "move": {
+					let i = t(a).indexOf(r.atom), o = r.before ? t(a).indexOf(r.before) : t(a).length;
+					if (i >= 0 && o >= 0) {
+						let r = t(e);
+						i < o ? n(e, [
+							...r.slice(0, i),
+							...r.slice(i + 1, o),
+							r[i],
+							...r.slice(o)
+						]) : n(e, [
+							...r.slice(0, o),
+							r[i],
+							...r.slice(o, i),
+							...r.slice(i + 1)
+						]);
+					}
+					break;
+				}
+			}
+		}) : R((e) => e(i).atomList);
+		return a;
+	}, e, t || Se);
+}
+var Te = (e) => typeof e?.then == "function";
+function Ee(e = () => {
+	try {
+		return window.localStorage;
+	} catch {
+		return;
+	}
+}, t) {
+	let n, r, i = {
+		getItem: (i, a) => {
+			let o = (e) => {
+				if (e ||= "", n !== e) {
+					try {
+						r = JSON.parse(e, t?.reviver);
+					} catch {
+						return a;
+					}
+					n = e;
+				}
+				return r;
+			}, s = e()?.getItem(i) ?? null;
+			return Te(s) ? s.then(o) : o(s);
+		},
+		setItem: (n, r) => e()?.setItem(n, JSON.stringify(r, t?.replacer)),
+		removeItem: (t) => e()?.removeItem(t)
+	}, a = (e) => (n, r, i) => e(n, (e) => {
+		let n;
+		try {
+			n = JSON.parse(e || "", t?.reviver);
+		} catch {
+			n = i;
+		}
+		r(n);
+	}), o;
+	try {
+		o = e()?.subscribe;
+	} catch {}
+	return !o && typeof window < "u" && typeof window.addEventListener == "function" && window.Storage && (o = (t, n) => {
+		if (!(e() instanceof window.Storage)) return () => {};
+		let r = (r) => {
+			r.storageArea === e() && r.key === t && n(r.newValue);
+		};
+		return window.addEventListener("storage", r), () => {
+			window.removeEventListener("storage", r);
+		};
+	}), o && (i.subscribe = a(o)), i;
+}
+var De = Ee();
+function Oe(e, t, n = De, r) {
+	let i = r?.getOnInit, a = R(i ? n.getItem(e, t) : t);
+	return a.onMount = (r) => (r(n.getItem(e, t)), n.subscribe?.call(n, e, r, t)), R((e) => e(a), (r, i, o) => {
+		let s = typeof o == "function" ? o(r(a)) : o;
+		return s === me ? (i(a, t), n.removeItem(e)) : Te(s) ? s.then((t) => (i(a, t), n.setItem(e, t))) : (i(a, s), n.setItem(e, s));
+	});
+}
+//#endregion
+//#region ../node_modules/.pnpm/dequal@2.0.3/node_modules/dequal/dist/index.mjs
+var ke = r(), Ae = Object.prototype.hasOwnProperty;
+function je(e, t, n) {
+	for (n of e.keys()) if (Z(n, t)) return n;
+}
+function Z(e, t) {
+	var n, r, i;
+	if (e === t) return !0;
+	if (e && t && (n = e.constructor) === t.constructor) {
+		if (n === Date) return e.getTime() === t.getTime();
+		if (n === RegExp) return e.toString() === t.toString();
+		if (n === Array) {
+			if ((r = e.length) === t.length) for (; r-- && Z(e[r], t[r]););
+			return r === -1;
+		}
+		if (n === Set) {
+			if (e.size !== t.size) return !1;
+			for (r of e) if (i = r, i && typeof i == "object" && (i = je(t, i), !i) || !t.has(i)) return !1;
+			return !0;
+		}
+		if (n === Map) {
+			if (e.size !== t.size) return !1;
+			for (r of e) if (i = r[0], i && typeof i == "object" && (i = je(t, i), !i) || !Z(r[1], t.get(i))) return !1;
+			return !0;
+		}
+		if (n === ArrayBuffer) e = new Uint8Array(e), t = new Uint8Array(t);
+		else if (n === DataView) {
+			if ((r = e.byteLength) === t.byteLength) for (; r-- && e.getInt8(r) === t.getInt8(r););
+			return r === -1;
+		}
+		if (ArrayBuffer.isView(e)) {
+			if ((r = e.byteLength) === t.byteLength) for (; r-- && e[r] === t[r];);
+			return r === -1;
+		}
+		if (!n || typeof e == "object") {
+			for (n in r = 0, e) if (Ae.call(e, n) && ++r && !Ae.call(t, n) || !(n in t) || !Z(e[n], t[n])) return !1;
+			return Object.keys(t).length === r;
+		}
+	}
+	return e !== e && t !== t;
+}
+//#endregion
+//#region src/core/state/jotai.ts
+var Q = z();
+async function Me(e, t) {
+	return t(Q.get(e)) ? Q.get(e) : new Promise((n) => {
+		let r = Q.sub(e, () => {
+			let i = Q.get(e);
+			t(i) && (r(), n(i));
+		});
+	});
+}
+function Ne(e, t) {
+	let n = (0, ke.c)(5), r = V(), a, o;
+	n[0] !== e || n[1] !== t || n[2] !== r ? (a = () => {
+		let n = r.get(e);
+		return r.sub(e, () => {
+			let i = r.get(e);
+			t(i, n), n = i;
+		});
+	}, o = [
+		e,
+		t,
+		r
+	], n[0] = e, n[1] = t, n[2] = r, n[3] = a, n[4] = o) : (a = n[3], o = n[4]), (0, i.useEffect)(a, o);
+}
+var Pe = Symbol("sentinel");
+function Fe(e, t = Z) {
+	let n = Pe;
+	return R((r) => {
+		let i = r(e);
+		return (n === Pe || !t(n, i)) && (n = i), n;
+	});
+}
+//#endregion
+//#region src/core/session/active-notebook.ts
+var $ = R(null), Ie = R(null);
+R((e) => {
+	let t = e($);
+	return t === null ? null : e(t.backendAtom);
+});
+var Le = R((e) => {
+	let t = e($);
+	return t === null ? null : e(t.documentAtom);
+}), Re = {
+	githubPage: "https://github.com/marimo-team/marimo",
+	releasesPage: "https://github.com/marimo-team/marimo/releases",
+	issuesPage: "https://github.com/marimo-team/marimo/issues",
+	bugReportUrl: "https://github.com/marimo-team/marimo/issues/new?template=bug_report.yaml",
+	feedbackForm: "https://marimo.io/feedback",
+	discordLink: "https://marimo.io/discord?ref=notebook",
+	docsPage: "https://docs.marimo.io",
+	youtube: "https://www.youtube.com/@marimo-team",
+	molab: "https://molab.marimo.io"
+}, ze = {
+	showCode: "show-code",
+	includeCode: "include-code",
+	sessionId: "session_id",
+	kiosk: "kiosk",
+	vscode: "vscode",
+	filePath: "file",
+	accessToken: "access_token",
+	viewAs: "view-as",
+	showChrome: "show-chrome",
+	theme: "theme"
+}, Be = { outputArea: "output-area" };
+//#endregion
+//#region src/core/islands/utils.ts
+function Ve() {
+	return !0;
+}
+//#endregion
+export { V as C, o as D, c as E, q as S, z as T, ye as _, Ie as a, pe as b, Fe as c, Me as d, Z as f, Ee as g, Oe as h, ze as i, Q as l, he as m, Be as n, $ as o, ge as p, Re as r, Le as s, Ve as t, Ne as u, we as v, R as w, K as x, de as y };