aberdeen 1.4.3 → 1.6.0

package/dist/route.js

@@ -91,9 +91,9 @@ function go(target, nav = "go") {
   runQueue();
 }
 function push(target) {
-  let copy2 = clone(unproxy(current));
-  merge(copy2, targetToPartial(target));
-  go(copy2);
+  const c = clone(unproxy(current));
+  merge(c, targetToPartial(target));
+  go(c);
 }
 function back(target = {}) {
   const partial = targetToPartial(target);
@@ -192,5 +192,5 @@ export {
   back
 };
 
-//# debugId=5B5243A451755E6B64756E2164756E21
+//# debugId=9EEC9BCF7ADAD59464756E2164756E21
 //# sourceMappingURL=route.js.map

package/dist/route.js.map

@@ -2,9 +2,9 @@
   "version": 3,
   "sources": ["../src/route.ts"],
   "sourcesContent": [
-    "import {clean, getParentElement, $, proxy, runQueue, unproxy, copy, merge, clone, leakScope} from \"./aberdeen.js\";\n\ntype NavType = \"load\" | \"back\" | \"forward\" | \"go\" | \"push\";\n\n/**\n* The class for the global `route` object.\n*/\nexport interface Route {\n\t/** The current path of the URL as a string. For instance `\"/\"` or `\"/users/123/feed\"`. Paths are normalized to always start with a `/` and never end with a `/` (unless it's the root path). */\n\tpath: string;\n\t/** An convenience array containing path segments, mapping to `path`. For instance `[]` (for `\"/\"`) or `['users', '123', 'feed']` (for `\"/users/123/feed\"`). */\n\tp: string[];\n\t/** The hash fragment including the leading `#`, or an empty string. For instance `\"#my_section\"` or `\"\"`. */\n\thash: string;\n\t/** The query string interpreted as search parameters. So `\"a=x&b=y\"` becomes `{a: \"x\", b: \"y\"}`. */\n\tsearch: Record<string, string>;\n\t/** An object to be used for any additional data you want to associate with the current page. Data should be JSON-compatible. */\n\tstate: Record<string, any>;\n\t/** The navigation depth of the current session. Starts at 1. Writing to this property has no effect. */\n\tdepth: number;\n\t/** The navigation action that got us to this page. Writing to this property has no effect.\n\t- `\"load\"`: An initial page load.\n\t- `\"back\"` or `\"forward\"`: When we navigated backwards or forwards in the stack.\n\t- `\"go\"`: When we added a new page on top of the stack.\n\t- `\"push\"`: When we added a new page on top of the stack, merging with the current page.\n\tMostly useful for page transition animations. Writing to this property has no effect.\n\t*/\n\tnav: NavType;\n}\n\nlet log: (...args: any) => void = () => {};\n\n/**\n * Configure logging on route changes.\n * @param value `true` to enable logging to console, `false` to disable logging, or a custom logging function. Defaults to `false`.\n */\nexport function setLog(value: boolean | ((...args: any[]) => void)) {\n\tif (value === true) {\n\t\tlog = console.log.bind(console, 'aberdeen router');\n\t} else if (value === false) {\n\t\tlog = () => {};\n\t} else {\n\t\tlog = value;\n\t}\n}\n\nfunction getRouteFromBrowser(): Route {\n\treturn toCanonRoute({\n\t\tpath: location.pathname,\n\t\thash: location.hash,\n\t\tsearch: Object.fromEntries(new URLSearchParams(location.search)),\n\t\tstate: history.state?.state || {},\n\t}, \"load\", (history.state?.stack?.length || 0) + 1);\n}\n\n/**\n* Deep compare `a` and `b`. If `partial` is true, objects contained in `b` may be a subset\n* of their counterparts in `a` and still be considered equal.\n*/\nfunction equal(a: any, b: any, partial: boolean): boolean {\n\tif (a===b) return true;\n\tif (typeof a !== \"object\" || !a || typeof b !== \"object\" || !b) return false; // otherwise they would have been equal\n\tif (a.constructor !== b.constructor) return false;\n\tif (b instanceof Array) {\n\t\tif (a.length !== b.length) return false;\n\t\tfor(let i = 0; i < b.length; i++) {\n\t\t\tif (!equal(a[i], b[i], partial)) return false;\n\t\t}\n\t} else {\n\t\tfor(const k of Object.keys(b)) {\n\t\t\tif (!equal(a[k], b[k], partial)) return false;\n\t\t}\n\t\tif (!partial) {\n\t\t\tfor(const k of Object.keys(a)) {\n\t\t\t\tif (!b.hasOwnProperty(k)) return false;\n\t\t\t}\n\t\t}\n\t}\n\treturn true;\n}\n\nfunction getUrl(target: Route) {\n\tconst search = new URLSearchParams(target.search).toString();\n\treturn (search ? `${target.path}?${search}` : target.path) + target.hash;\n}\n\nfunction toCanonRoute(target: Partial<Route>, nav: NavType, depth: number): Route {\n\tlet path = target.path || (target.p || []).join(\"/\") || \"/\";\n\tpath = (\"\"+path).replace(/\\/+$/, \"\");\n\tif (!path.startsWith(\"/\")) path = `/${path}`;\n\t\n\treturn {\n\t\tpath,\n\t\thash: target.hash && target.hash !==\"#\" ? (target.hash.startsWith(\"#\") ? target.hash : \"#\" + target.hash) : \"\",\n\t\tp: path.length > 1 ? path.slice(1).replace(/\\/+$/, \"\").split(\"/\") : [],\n\t\tnav,\n\t\tsearch: typeof target.search === 'object' && target.search ? clone(target.search) : {},\n\t\tstate: typeof target.state === 'object' && target.state ? clone(target.state) : {},\n\t\tdepth,\n\t};\n}\n\n\ntype RouteTarget = string | (string|number)[] | Partial<Omit<Omit<Route,\"p\">,\"search\"> & {\n\t/** An convenience array containing path segments, mapping to `path`. For instance `[]` (for `\"/\"`) or `['users', 123, 'feed']` (for `\"/users/123/feed\"`). Values may be integers but will be converted to strings.*/\n\tp: (string|number)[],\n\t/** The query string interpreted as search parameters. So `\"a=x&b=y\"` becomes `{a: \"x\", b: \"y\", c: 42}`. Values may be integers but will be converted to strings. */\n\tsearch: Record<string,string|number>,\n}>;\n\nfunction targetToPartial(target: RouteTarget) {\n\t// Convert shortcut values to objects\n\tif (typeof target === 'string') {\n\t\ttarget = {path: target};\n\t} else if (target instanceof Array) {\n\t\ttarget = {p: target};\n\t}\n\t// Convert numbers in p and search to strings\n\tif (target.p) {\n\t\ttarget.p = target.p.map(String);\n\t}\n\tif (target.search) {\n\t\tfor(const key of Object.keys(target.search)) {\n\t\t\ttarget.search[key] = String(target.search[key]);\n\t\t}\n\t}\n\treturn target as Partial<Route>;\n}\n\n\n/**\n* Navigate to a new URL by pushing a new history entry.\n* \n* Note that this happens synchronously, immediately updating `route` and processing any reactive updates based on that.\n* \n* @param target A subset of the {@link Route} properties to navigate to. If neither `p` nor `path` is given, the current path is used. For other properties, an empty/default value is assumed if not given. For convenience:\n* - You may pass a string instead of an object, which is interpreted as the `path`.\n* - You may pass an array instead of an object, which is interpreted as the `p` array.\n* - If you pass `p`, it may contain numbers, which will be converted to strings.\n* - If you pass `search`, its values may be numbers, which will be converted to strings.\n* \n* Examples:\n* ```js\n* // Navigate to /users/123\n* route.go(\"/users/123\");\n* \n* // Navigate to /users/123?tab=feed#top\n* route.go({p: [\"users\", 123], search: {tab: \"feed\"}, hash: \"top\"});\n* ```\n*/\nexport function go(target: RouteTarget, nav: NavType = \"go\"): void {\n\tconst stack: string[] = history.state?.stack || [];\n\n\tprevStack = stack.concat(JSON.stringify(unproxy(current)));\n\t\n\tconst newRoute: Route = toCanonRoute(targetToPartial(target), nav, prevStack.length + 1);\n\tcopy(current, newRoute);\n\t\n\tlog(nav, newRoute);\n\thistory.pushState({state: newRoute.state, stack: prevStack}, \"\", getUrl(newRoute));\n\t\n\trunQueue();\n}\n\n/**\n * Modify the current route by merging `target` into it (using {@link merge}), pushing a new history entry.\n * \n * This is useful for things like opening modals or side panels, where you want a browser back action to return to the previous state.\n * \n * @param target Same as for {@link go}, but merged into the current route instead deleting all state.\n */\nexport function push(target: RouteTarget): void {\n\tlet copy = clone(unproxy(current));\n\tmerge(copy, targetToPartial(target));\n\tgo(copy);\n}\n\n/**\n * Try to go back in history to the first entry that matches the given target. If none is found, the given state will replace the current page. This is useful for \"cancel\" or \"close\" actions that should return to the previous page if possible, but create a new page if not (for instance when arriving at the current page through a direct link).\n * \n * Consider using {@link up} to go up in the path hierarchy.\n * \n * @param target The target route to go back to. May be a subset of {@link Route}, or a string (for `path`), or an array of strings (for `p`).\n */\nexport function back(target: RouteTarget = {}): void {\n\tconst partial = targetToPartial(target);\n\tconst stack: string[] = history.state?.stack || [];\n\tfor(let i = stack.length - 1; i >= 0; i--) {\n\t\tconst histRoute: Route = JSON.parse(stack[i]);\n\t\tif (equal(histRoute, partial, true)) {\n\t\t\tconst pages = i - stack.length;\n\t\t\tlog(`back`, pages, histRoute);\n\t\t\thistory.go(pages);\n\t\t\treturn;\n\t\t}\n\t}\n\n\tconst newRoute = toCanonRoute(partial, \"back\", stack.length + 1);\n\tlog(`back not found, replacing`, partial);\n\tcopy(current, newRoute);\n}\n\n/**\n* Navigate up in the path hierarchy, by going back to the first history entry\n* that has a shorter path than the current one. If there's none, we just shorten\n* the current path.\n* \n* Note that going back in browser history happens asynchronously, so `route` will not be updated immediately.\n*/\nexport function up(stripCount: number = 1): void {\n\tconst currentP = unproxy(current).p;\n\tconst stack: string[] = history.state?.stack || [];\n\tfor(let i = stack.length - 1; i >= 0; i--) {\n\t\tconst histRoute: Route = JSON.parse(stack[i]);\n\t\tif (histRoute.p.length < currentP.length && equal(histRoute.p, currentP.slice(0, histRoute.p.length), false)) {\n\t\t\t// This route is shorter and matches the start of the current path\n\t\t\tlog(`up to ${i+1} / ${stack.length}`, histRoute);\n\t\t\thistory.go(i - stack.length);\n\t\t\treturn;\n\t\t}\n\t}\n\t// Replace current route with /\n\tconst newRoute = toCanonRoute({p: currentP.slice(0, currentP.length - stripCount)}, \"back\", stack.length + 1);\n\tlog(`up not found, replacing`, newRoute);\n\tcopy(current, newRoute);\n}\n\n/**\n* Restore and store the vertical and horizontal scroll position for\n* the parent element to the page state.\n*\n* @param {string} name - A unique (within this page) name for this\n* scrollable element. Defaults to 'main'.\n*\n* The scroll position will be persisted in `route.aux.scroll.<name>`.\n*/\nexport function persistScroll(name = \"main\") {\n\tconst el = getParentElement();\n\tel.addEventListener(\"scroll\", onScroll);\n\tclean(() => el.removeEventListener(\"scroll\", onScroll));\n\t\n\tconst restore = unproxy(current).state.scroll?.[name];\n\tif (restore) {\n\t\tlog(\"restoring scroll\", name, restore);\n\t\tObject.assign(el, restore);\n\t}\n\t\n\tfunction onScroll() {\n\t\t(current.state.scroll ||= {})[name] = {\n\t\t\tscrollTop: el.scrollTop,\n\t\t\tscrollLeft: el.scrollLeft,\n\t\t};\n\t}\n}\n\nlet prevStack: string[];\n\n/**\n* The global {@link Route} object reflecting the current URL and browser history state. Changes you make to this affect the current browser history item (modifying the URL if needed).\n*/\nexport const current: Route = proxy({}) as Route;\n\n/**\n * Reset the router to its initial state, based on the current browser state. Intended for testing purposes only.\n * @internal\n * */\nexport function reset() {\n\tprevStack = history.state?.stack || [];\n\tconst initRoute = getRouteFromBrowser();\n\tlog('initial', initRoute);\n\tcopy(unproxy(current), initRoute);\n}\nreset();\n\n// Handle browser history back and forward\nwindow.addEventListener(\"popstate\", function(event: PopStateEvent) {\n\tconst newRoute = getRouteFromBrowser();\n\t\n\t// If the stack length changes, and at least the top-most shared entry is the same,\n\t// we'll interpret this as a \"back\" or \"forward\" navigation.\n\tconst stack: string[] = history.state?.stack || [];\n\tif (stack.length !== prevStack.length) {\n\t\tconst maxIndex = Math.min(prevStack.length, stack.length) - 1;\n\t\tif (maxIndex < 0 || stack[maxIndex] === prevStack[maxIndex]) {\n\t\t\tnewRoute.nav = stack.length < prevStack.length ? \"back\" : \"forward\";\n\t\t}\n\t}\n\t// else nav will be \"load\"\n\t\n\tprevStack = stack;\n\tlog('popstate', newRoute);\n\tcopy(current, newRoute);\n\t\n\trunQueue();\n});\n\n// Make sure these observers are never cleaned up, not even by `unmountAll`.\nleakScope(() => {\n\t// Sync `p` to `path`. We need to do this in a separate, higher-priority observer,\n\t// so that setting `route.p` will not be immediately overruled by the pre-existing `route.path`.\n\t$(() => {\n\t\tcurrent.path = \"/\" + Array.from(current.p).join(\"/\");\n\t});\n\n\t// Do a replaceState based on changes to proxy\n\t$(() => {\n\n\t\t// First normalize `route`\n\t\tconst stack = history.state?.stack || [];\n\t\tconst newRoute = toCanonRoute(current, unproxy(current).nav, stack.length + 1);\n\t\tcopy(current, newRoute);\n\t\t\n\t\t// Then replace the current browser state if something actually changed\n\t\tconst state = {state: newRoute.state, stack};\n\t\tconst url = getUrl(newRoute);\n\t\tif (url !== location.pathname + location.search + location.hash || !equal(history.state, state, false)) {\n\t\t\tlog('replaceState', newRoute, state, url);\n\t\t\thistory.replaceState(state, \"\", url);\n\t\t}\n\t});\n});\n"
+    "import {clean, getParentElement, $, proxy, runQueue, unproxy, copy, merge, clone, leakScope} from \"./aberdeen.js\";\n\ntype NavType = \"load\" | \"back\" | \"forward\" | \"go\" | \"push\";\n\n/**\n* The class for the global `route` object.\n*/\nexport interface Route {\n\t/** The current path of the URL as a string. For instance `\"/\"` or `\"/users/123/feed\"`. Paths are normalized to always start with a `/` and never end with a `/` (unless it's the root path). */\n\tpath: string;\n\t/** An convenience array containing path segments, mapping to `path`. For instance `[]` (for `\"/\"`) or `['users', '123', 'feed']` (for `\"/users/123/feed\"`). */\n\tp: string[];\n\t/** The hash fragment including the leading `#`, or an empty string. For instance `\"#my_section\"` or `\"\"`. */\n\thash: string;\n\t/** The query string interpreted as search parameters. So `\"a=x&b=y\"` becomes `{a: \"x\", b: \"y\"}`. */\n\tsearch: Record<string, string>;\n\t/** An object to be used for any additional data you want to associate with the current page. Data should be JSON-compatible. */\n\tstate: Record<string, any>;\n\t/** The navigation depth of the current session. Starts at 1. Writing to this property has no effect. */\n\tdepth: number;\n\t/** The navigation action that got us to this page. Writing to this property has no effect.\n\t- `\"load\"`: An initial page load.\n\t- `\"back\"` or `\"forward\"`: When we navigated backwards or forwards in the stack.\n\t- `\"go\"`: When we added a new page on top of the stack.\n\t- `\"push\"`: When we added a new page on top of the stack, merging with the current page.\n\tMostly useful for page transition animations. Writing to this property has no effect.\n\t*/\n\tnav: NavType;\n}\n\nlet log: (...args: any) => void = () => {};\n\n/**\n * Configure logging on route changes.\n * @param value `true` to enable logging to console, `false` to disable logging, or a custom logging function. Defaults to `false`.\n */\nexport function setLog(value: boolean | ((...args: any[]) => void)) {\n\tif (value === true) {\n\t\tlog = console.log.bind(console, 'aberdeen router');\n\t} else if (value === false) {\n\t\tlog = () => {};\n\t} else {\n\t\tlog = value;\n\t}\n}\n\nfunction getRouteFromBrowser(): Route {\n\treturn toCanonRoute({\n\t\tpath: location.pathname,\n\t\thash: location.hash,\n\t\tsearch: Object.fromEntries(new URLSearchParams(location.search)),\n\t\tstate: history.state?.state || {},\n\t}, \"load\", (history.state?.stack?.length || 0) + 1);\n}\n\n/**\n* Deep compare `a` and `b`. If `partial` is true, objects contained in `b` may be a subset\n* of their counterparts in `a` and still be considered equal.\n*/\nfunction equal(a: any, b: any, partial: boolean): boolean {\n\tif (a===b) return true;\n\tif (typeof a !== \"object\" || !a || typeof b !== \"object\" || !b) return false; // otherwise they would have been equal\n\tif (a.constructor !== b.constructor) return false;\n\tif (b instanceof Array) {\n\t\tif (a.length !== b.length) return false;\n\t\tfor(let i = 0; i < b.length; i++) {\n\t\t\tif (!equal(a[i], b[i], partial)) return false;\n\t\t}\n\t} else {\n\t\tfor(const k of Object.keys(b)) {\n\t\t\tif (!equal(a[k], b[k], partial)) return false;\n\t\t}\n\t\tif (!partial) {\n\t\t\tfor(const k of Object.keys(a)) {\n\t\t\t\tif (!b.hasOwnProperty(k)) return false;\n\t\t\t}\n\t\t}\n\t}\n\treturn true;\n}\n\nfunction getUrl(target: Route) {\n\tconst search = new URLSearchParams(target.search).toString();\n\treturn (search ? `${target.path}?${search}` : target.path) + target.hash;\n}\n\nfunction toCanonRoute(target: Partial<Route>, nav: NavType, depth: number): Route {\n\tlet path = target.path || (target.p || []).join(\"/\") || \"/\";\n\tpath = (\"\"+path).replace(/\\/+$/, \"\");\n\tif (!path.startsWith(\"/\")) path = `/${path}`;\n\t\n\treturn {\n\t\tpath,\n\t\thash: target.hash && target.hash !==\"#\" ? (target.hash.startsWith(\"#\") ? target.hash : \"#\" + target.hash) : \"\",\n\t\tp: path.length > 1 ? path.slice(1).replace(/\\/+$/, \"\").split(\"/\") : [],\n\t\tnav,\n\t\tsearch: typeof target.search === 'object' && target.search ? clone(target.search) : {},\n\t\tstate: typeof target.state === 'object' && target.state ? clone(target.state) : {},\n\t\tdepth,\n\t};\n}\n\n\ntype RouteTarget = string | (string|number)[] | Partial<Omit<Omit<Route,\"p\">,\"search\"> & {\n\t/** An convenience array containing path segments, mapping to `path`. For instance `[]` (for `\"/\"`) or `['users', 123, 'feed']` (for `\"/users/123/feed\"`). Values may be integers but will be converted to strings.*/\n\tp: (string|number)[],\n\t/** The query string interpreted as search parameters. So `\"a=x&b=y\"` becomes `{a: \"x\", b: \"y\", c: 42}`. Values may be integers but will be converted to strings. */\n\tsearch: Record<string,string|number>,\n}>;\n\nfunction targetToPartial(target: RouteTarget) {\n\t// Convert shortcut values to objects\n\tif (typeof target === 'string') {\n\t\ttarget = {path: target};\n\t} else if (target instanceof Array) {\n\t\ttarget = {p: target};\n\t}\n\t// Convert numbers in p and search to strings\n\tif (target.p) {\n\t\ttarget.p = target.p.map(String);\n\t}\n\tif (target.search) {\n\t\tfor(const key of Object.keys(target.search)) {\n\t\t\ttarget.search[key] = String(target.search[key]);\n\t\t}\n\t}\n\treturn target as Partial<Route>;\n}\n\n\n/**\n* Navigate to a new URL by pushing a new history entry.\n* \n* Note that this happens synchronously, immediately updating `route` and processing any reactive updates based on that.\n* \n* @param target A subset of the {@link Route} properties to navigate to. If neither `p` nor `path` is given, the current path is used. For other properties, an empty/default value is assumed if not given. For convenience:\n* - You may pass a string instead of an object, which is interpreted as the `path`.\n* - You may pass an array instead of an object, which is interpreted as the `p` array.\n* - If you pass `p`, it may contain numbers, which will be converted to strings.\n* - If you pass `search`, its values may be numbers, which will be converted to strings.\n* \n* Examples:\n* ```js\n* // Navigate to /users/123\n* route.go(\"/users/123\");\n* \n* // Navigate to /users/123?tab=feed#top\n* route.go({p: [\"users\", 123], search: {tab: \"feed\"}, hash: \"top\"});\n* ```\n*/\nexport function go(target: RouteTarget, nav: NavType = \"go\"): void {\n\tconst stack: string[] = history.state?.stack || [];\n\n\tprevStack = stack.concat(JSON.stringify(unproxy(current)));\n\t\n\tconst newRoute: Route = toCanonRoute(targetToPartial(target), nav, prevStack.length + 1);\n\tcopy(current, newRoute);\n\t\n\tlog(nav, newRoute);\n\thistory.pushState({state: newRoute.state, stack: prevStack}, \"\", getUrl(newRoute));\n\t\n\trunQueue();\n}\n\n/**\n * Modify the current route by merging `target` into it (using {@link merge}), pushing a new history entry.\n * \n * This is useful for things like opening modals or side panels, where you want a browser back action to return to the previous state.\n * \n * @param target Same as for {@link go}, but merged into the current route instead deleting all state.\n */\nexport function push(target: RouteTarget): void {\n\tconst c = clone(unproxy(current));\n\tmerge(c, targetToPartial(target));\n\tgo(c);\n}\n\n/**\n * Try to go back in history to the first entry that matches the given target. If none is found, the given state will replace the current page. This is useful for \"cancel\" or \"close\" actions that should return to the previous page if possible, but create a new page if not (for instance when arriving at the current page through a direct link).\n * \n * Consider using {@link up} to go up in the path hierarchy.\n * \n * @param target The target route to go back to. May be a subset of {@link Route}, or a string (for `path`), or an array of strings (for `p`).\n */\nexport function back(target: RouteTarget = {}): void {\n\tconst partial = targetToPartial(target);\n\tconst stack: string[] = history.state?.stack || [];\n\tfor(let i = stack.length - 1; i >= 0; i--) {\n\t\tconst histRoute: Route = JSON.parse(stack[i]);\n\t\tif (equal(histRoute, partial, true)) {\n\t\t\tconst pages = i - stack.length;\n\t\t\tlog(`back`, pages, histRoute);\n\t\t\thistory.go(pages);\n\t\t\treturn;\n\t\t}\n\t}\n\n\tconst newRoute = toCanonRoute(partial, \"back\", stack.length + 1);\n\tlog(`back not found, replacing`, partial);\n\tcopy(current, newRoute);\n}\n\n/**\n* Navigate up in the path hierarchy, by going back to the first history entry\n* that has a shorter path than the current one. If there's none, we just shorten\n* the current path.\n* \n* Note that going back in browser history happens asynchronously, so `route` will not be updated immediately.\n*/\nexport function up(stripCount: number = 1): void {\n\tconst currentP = unproxy(current).p;\n\tconst stack: string[] = history.state?.stack || [];\n\tfor(let i = stack.length - 1; i >= 0; i--) {\n\t\tconst histRoute: Route = JSON.parse(stack[i]);\n\t\tif (histRoute.p.length < currentP.length && equal(histRoute.p, currentP.slice(0, histRoute.p.length), false)) {\n\t\t\t// This route is shorter and matches the start of the current path\n\t\t\tlog(`up to ${i+1} / ${stack.length}`, histRoute);\n\t\t\thistory.go(i - stack.length);\n\t\t\treturn;\n\t\t}\n\t}\n\t// Replace current route with /\n\tconst newRoute = toCanonRoute({p: currentP.slice(0, currentP.length - stripCount)}, \"back\", stack.length + 1);\n\tlog(`up not found, replacing`, newRoute);\n\tcopy(current, newRoute);\n}\n\n/**\n* Restore and store the vertical and horizontal scroll position for\n* the parent element to the page state.\n*\n* @param {string} name - A unique (within this page) name for this\n* scrollable element. Defaults to 'main'.\n*\n* The scroll position will be persisted in `route.aux.scroll.<name>`.\n*/\nexport function persistScroll(name = \"main\") {\n\tconst el = getParentElement();\n\tel.addEventListener(\"scroll\", onScroll);\n\tclean(() => el.removeEventListener(\"scroll\", onScroll));\n\t\n\tconst restore = unproxy(current).state.scroll?.[name];\n\tif (restore) {\n\t\tlog(\"restoring scroll\", name, restore);\n\t\tObject.assign(el, restore);\n\t}\n\t\n\tfunction onScroll() {\n\t\t(current.state.scroll ||= {})[name] = {\n\t\t\tscrollTop: el.scrollTop,\n\t\t\tscrollLeft: el.scrollLeft,\n\t\t};\n\t}\n}\n\nlet prevStack: string[];\n\n/**\n* The global {@link Route} object reflecting the current URL and browser history state. Changes you make to this affect the current browser history item (modifying the URL if needed).\n*/\nexport const current: Route = proxy({}) as Route;\n\n/**\n * Reset the router to its initial state, based on the current browser state. Intended for testing purposes only.\n * @internal\n * */\nexport function reset() {\n\tprevStack = history.state?.stack || [];\n\tconst initRoute = getRouteFromBrowser();\n\tlog('initial', initRoute);\n\tcopy(unproxy(current), initRoute);\n}\nreset();\n\n// Handle browser history back and forward\nwindow.addEventListener(\"popstate\", function(event: PopStateEvent) {\n\tconst newRoute = getRouteFromBrowser();\n\t\n\t// If the stack length changes, and at least the top-most shared entry is the same,\n\t// we'll interpret this as a \"back\" or \"forward\" navigation.\n\tconst stack: string[] = history.state?.stack || [];\n\tif (stack.length !== prevStack.length) {\n\t\tconst maxIndex = Math.min(prevStack.length, stack.length) - 1;\n\t\tif (maxIndex < 0 || stack[maxIndex] === prevStack[maxIndex]) {\n\t\t\tnewRoute.nav = stack.length < prevStack.length ? \"back\" : \"forward\";\n\t\t}\n\t}\n\t// else nav will be \"load\"\n\t\n\tprevStack = stack;\n\tlog('popstate', newRoute);\n\tcopy(current, newRoute);\n\t\n\trunQueue();\n});\n\n// Make sure these observers are never cleaned up, not even by `unmountAll`.\nleakScope(() => {\n\t// Sync `p` to `path`. We need to do this in a separate, higher-priority observer,\n\t// so that setting `route.p` will not be immediately overruled by the pre-existing `route.path`.\n\t$(() => {\n\t\tcurrent.path = \"/\" + Array.from(current.p).join(\"/\");\n\t});\n\n\t// Do a replaceState based on changes to proxy\n\t$(() => {\n\n\t\t// First normalize `route`\n\t\tconst stack = history.state?.stack || [];\n\t\tconst newRoute = toCanonRoute(current, unproxy(current).nav, stack.length + 1);\n\t\tcopy(current, newRoute);\n\t\t\n\t\t// Then replace the current browser state if something actually changed\n\t\tconst state = {state: newRoute.state, stack};\n\t\tconst url = getUrl(newRoute);\n\t\tif (url !== location.pathname + location.search + location.hash || !equal(history.state, state, false)) {\n\t\t\tlog('replaceState', newRoute, state, url);\n\t\t\thistory.replaceState(state, \"\", url);\n\t\t}\n\t});\n});\n"
   ],
-  "mappings": ";AAAA;AA8BA,IAAI,MAA8B,MAAM;AAMjC,SAAS,MAAM,CAAC,OAA6C;AAAA,EACnE,IAAI,UAAU,MAAM;AAAA,IACnB,MAAM,QAAQ,IAAI,KAAK,SAAS,iBAAiB;AAAA,EAClD,EAAO,SAAI,UAAU,OAAO;AAAA,IAC3B,MAAM,MAAM;AAAA,EACb,EAAO;AAAA,IACN,MAAM;AAAA;AAAA;AAIR,SAAS,mBAAmB,GAAU;AAAA,EACrC,OAAO,aAAa;AAAA,IACnB,MAAM,SAAS;AAAA,IACf,MAAM,SAAS;AAAA,IACf,QAAQ,OAAO,YAAY,IAAI,gBAAgB,SAAS,MAAM,CAAC;AAAA,IAC/D,OAAO,QAAQ,OAAO,SAAS,CAAC;AAAA,EACjC,GAAG,SAAS,QAAQ,OAAO,OAAO,UAAU,KAAK,CAAC;AAAA;AAOnD,SAAS,KAAK,CAAC,GAAQ,GAAQ,SAA2B;AAAA,EACzD,IAAI,MAAI;AAAA,IAAG,OAAO;AAAA,EAClB,IAAI,OAAO,MAAM,YAAY,CAAC,KAAK,OAAO,MAAM,YAAY,CAAC;AAAA,IAAG,OAAO;AAAA,EACvE,IAAI,EAAE,gBAAgB,EAAE;AAAA,IAAa,OAAO;AAAA,EAC5C,IAAI,aAAa,OAAO;AAAA,IACvB,IAAI,EAAE,WAAW,EAAE;AAAA,MAAQ,OAAO;AAAA,IAClC,SAAQ,IAAI,EAAG,IAAI,EAAE,QAAQ,KAAK;AAAA,MACjC,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,OAAO;AAAA,QAAG,OAAO;AAAA,IACzC;AAAA,EACD,EAAO;AAAA,IACN,WAAU,KAAK,OAAO,KAAK,CAAC,GAAG;AAAA,MAC9B,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,OAAO;AAAA,QAAG,OAAO;AAAA,IACzC;AAAA,IACA,IAAI,CAAC,SAAS;AAAA,MACb,WAAU,KAAK,OAAO,KAAK,CAAC,GAAG;AAAA,QAC9B,IAAI,CAAC,EAAE,eAAe,CAAC;AAAA,UAAG,OAAO;AAAA,MAClC;AAAA,IACD;AAAA;AAAA,EAED,OAAO;AAAA;AAGR,SAAS,MAAM,CAAC,QAAe;AAAA,EAC9B,MAAM,SAAS,IAAI,gBAAgB,OAAO,MAAM,EAAE,SAAS;AAAA,EAC3D,QAAQ,SAAS,GAAG,OAAO,QAAQ,WAAW,OAAO,QAAQ,OAAO;AAAA;AAGrE,SAAS,YAAY,CAAC,QAAwB,KAAc,OAAsB;AAAA,EACjF,IAAI,OAAO,OAAO,SAAS,OAAO,KAAK,CAAC,GAAG,KAAK,GAAG,KAAK;AAAA,EACxD,QAAQ,KAAG,MAAM,QAAQ,QAAQ,EAAE;AAAA,EACnC,IAAI,CAAC,KAAK,WAAW,GAAG;AAAA,IAAG,OAAO,IAAI;AAAA,EAEtC,OAAO;AAAA,IACN;AAAA,IACA,MAAM,OAAO,QAAQ,OAAO,SAAQ,MAAO,OAAO,KAAK,WAAW,GAAG,IAAI,OAAO,OAAO,MAAM,OAAO,OAAQ;AAAA,IAC5G,GAAG,KAAK,SAAS,IAAI,KAAK,MAAM,CAAC,EAAE,QAAQ,QAAQ,EAAE,EAAE,MAAM,GAAG,IAAI,CAAC;AAAA,IACrE;AAAA,IACA,QAAQ,OAAO,OAAO,WAAW,YAAY,OAAO,SAAS,MAAM,OAAO,MAAM,IAAI,CAAC;AAAA,IACrF,OAAO,OAAO,OAAO,UAAU,YAAY,OAAO,QAAQ,MAAM,OAAO,KAAK,IAAI,CAAC;AAAA,IACjF;AAAA,EACD;AAAA;AAWD,SAAS,eAAe,CAAC,QAAqB;AAAA,EAE7C,IAAI,OAAO,WAAW,UAAU;AAAA,IAC/B,SAAS,EAAC,MAAM,OAAM;AAAA,EACvB,EAAO,SAAI,kBAAkB,OAAO;AAAA,IACnC,SAAS,EAAC,GAAG,OAAM;AAAA,EACpB;AAAA,EAEA,IAAI,OAAO,GAAG;AAAA,IACb,OAAO,IAAI,OAAO,EAAE,IAAI,MAAM;AAAA,EAC/B;AAAA,EACA,IAAI,OAAO,QAAQ;AAAA,IAClB,WAAU,OAAO,OAAO,KAAK,OAAO,MAAM,GAAG;AAAA,MAC5C,OAAO,OAAO,OAAO,OAAO,OAAO,OAAO,IAAI;AAAA,IAC/C;AAAA,EACD;AAAA,EACA,OAAO;AAAA;AAwBD,SAAS,EAAE,CAAC,QAAqB,MAAe,MAAY;AAAA,EAClE,MAAM,QAAkB,QAAQ,OAAO,SAAS,CAAC;AAAA,EAEjD,YAAY,MAAM,OAAO,KAAK,UAAU,QAAQ,OAAO,CAAC,CAAC;AAAA,EAEzD,MAAM,WAAkB,aAAa,gBAAgB,MAAM,GAAG,KAAK,UAAU,SAAS,CAAC;AAAA,EACvF,KAAK,SAAS,QAAQ;AAAA,EAEtB,IAAI,KAAK,QAAQ;AAAA,EACjB,QAAQ,UAAU,EAAC,OAAO,SAAS,OAAO,OAAO,UAAS,GAAG,IAAI,OAAO,QAAQ,CAAC;AAAA,EAEjF,SAAS;AAAA;AAUH,SAAS,IAAI,CAAC,QAA2B;AAAA,EAC/C,IAAI,QAAO,MAAM,QAAQ,OAAO,CAAC;AAAA,EACjC,MAAM,OAAM,gBAAgB,MAAM,CAAC;AAAA,EACnC,GAAG,KAAI;AAAA;AAUD,SAAS,IAAI,CAAC,SAAsB,CAAC,GAAS;AAAA,EACpD,MAAM,UAAU,gBAAgB,MAAM;AAAA,EACtC,MAAM,QAAkB,QAAQ,OAAO,SAAS,CAAC;AAAA,EACjD,SAAQ,IAAI,MAAM,SAAS,EAAG,KAAK,GAAG,KAAK;AAAA,IAC1C,MAAM,YAAmB,KAAK,MAAM,MAAM,EAAE;AAAA,IAC5C,IAAI,MAAM,WAAW,SAAS,IAAI,GAAG;AAAA,MACpC,MAAM,QAAQ,IAAI,MAAM;AAAA,MACxB,IAAI,QAAQ,OAAO,SAAS;AAAA,MAC5B,QAAQ,GAAG,KAAK;AAAA,MAChB;AAAA,IACD;AAAA,EACD;AAAA,EAEA,MAAM,WAAW,aAAa,SAAS,QAAQ,MAAM,SAAS,CAAC;AAAA,EAC/D,IAAI,6BAA6B,OAAO;AAAA,EACxC,KAAK,SAAS,QAAQ;AAAA;AAUhB,SAAS,EAAE,CAAC,aAAqB,GAAS;AAAA,EAChD,MAAM,WAAW,QAAQ,OAAO,EAAE;AAAA,EAClC,MAAM,QAAkB,QAAQ,OAAO,SAAS,CAAC;AAAA,EACjD,SAAQ,IAAI,MAAM,SAAS,EAAG,KAAK,GAAG,KAAK;AAAA,IAC1C,MAAM,YAAmB,KAAK,MAAM,MAAM,EAAE;AAAA,IAC5C,IAAI,UAAU,EAAE,SAAS,SAAS,UAAU,MAAM,UAAU,GAAG,SAAS,MAAM,GAAG,UAAU,EAAE,MAAM,GAAG,KAAK,GAAG;AAAA,MAE7G,IAAI,SAAS,IAAE,OAAO,MAAM,UAAU,SAAS;AAAA,MAC/C,QAAQ,GAAG,IAAI,MAAM,MAAM;AAAA,MAC3B;AAAA,IACD;AAAA,EACD;AAAA,EAEA,MAAM,WAAW,aAAa,EAAC,GAAG,SAAS,MAAM,GAAG,SAAS,SAAS,UAAU,EAAC,GAAG,QAAQ,MAAM,SAAS,CAAC;AAAA,EAC5G,IAAI,2BAA2B,QAAQ;AAAA,EACvC,KAAK,SAAS,QAAQ;AAAA;AAYhB,SAAS,aAAa,CAAC,OAAO,QAAQ;AAAA,EAC5C,MAAM,KAAK,iBAAiB;AAAA,EAC5B,GAAG,iBAAiB,UAAU,QAAQ;AAAA,EACtC,MAAM,MAAM,GAAG,oBAAoB,UAAU,QAAQ,CAAC;AAAA,EAEtD,MAAM,UAAU,QAAQ,OAAO,EAAE,MAAM,SAAS;AAAA,EAChD,IAAI,SAAS;AAAA,IACZ,IAAI,oBAAoB,MAAM,OAAO;AAAA,IACrC,OAAO,OAAO,IAAI,OAAO;AAAA,EAC1B;AAAA,EAEA,SAAS,QAAQ,GAAG;AAAA,KAClB,QAAQ,MAAM,WAAW,CAAC,GAAG,QAAQ;AAAA,MACrC,WAAW,GAAG;AAAA,MACd,YAAY,GAAG;AAAA,IAChB;AAAA;AAAA;AAIF,IAAI;AAKG,IAAM,UAAiB,MAAM,CAAC,CAAC;AAM/B,SAAS,KAAK,GAAG;AAAA,EACvB,YAAY,QAAQ,OAAO,SAAS,CAAC;AAAA,EACrC,MAAM,YAAY,oBAAoB;AAAA,EACtC,IAAI,WAAW,SAAS;AAAA,EACxB,KAAK,QAAQ,OAAO,GAAG,SAAS;AAAA;AAEjC,MAAM;AAGN,OAAO,iBAAiB,YAAY,QAAQ,CAAC,OAAsB;AAAA,EAClE,MAAM,WAAW,oBAAoB;AAAA,EAIrC,MAAM,QAAkB,QAAQ,OAAO,SAAS,CAAC;AAAA,EACjD,IAAI,MAAM,WAAW,UAAU,QAAQ;AAAA,IACtC,MAAM,WAAW,KAAK,IAAI,UAAU,QAAQ,MAAM,MAAM,IAAI;AAAA,IAC5D,IAAI,WAAW,KAAK,MAAM,cAAc,UAAU,WAAW;AAAA,MAC5D,SAAS,MAAM,MAAM,SAAS,UAAU,SAAS,SAAS;AAAA,IAC3D;AAAA,EACD;AAAA,EAGA,YAAY;AAAA,EACZ,IAAI,YAAY,QAAQ;AAAA,EACxB,KAAK,SAAS,QAAQ;AAAA,EAEtB,SAAS;AAAA,CACT;AAGD,UAAU,MAAM;AAAA,EAGf,EAAE,MAAM;AAAA,IACP,QAAQ,OAAO,MAAM,MAAM,KAAK,QAAQ,CAAC,EAAE,KAAK,GAAG;AAAA,GACnD;AAAA,EAGD,EAAE,MAAM;AAAA,IAGP,MAAM,QAAQ,QAAQ,OAAO,SAAS,CAAC;AAAA,IACvC,MAAM,WAAW,aAAa,SAAS,QAAQ,OAAO,EAAE,KAAK,MAAM,SAAS,CAAC;AAAA,IAC7E,KAAK,SAAS,QAAQ;AAAA,IAGtB,MAAM,QAAQ,EAAC,OAAO,SAAS,OAAO,MAAK;AAAA,IAC3C,MAAM,MAAM,OAAO,QAAQ;AAAA,IAC3B,IAAI,QAAQ,SAAS,WAAW,SAAS,SAAS,SAAS,QAAQ,CAAC,MAAM,QAAQ,OAAO,OAAO,KAAK,GAAG;AAAA,MACvG,IAAI,gBAAgB,UAAU,OAAO,GAAG;AAAA,MACxC,QAAQ,aAAa,OAAO,IAAI,GAAG;AAAA,IACpC;AAAA,GACA;AAAA,CACD;",
-  "debugId": "5B5243A451755E6B64756E2164756E21",
+  "mappings": ";AAAA;AA8BA,IAAI,MAA8B,MAAM;AAMjC,SAAS,MAAM,CAAC,OAA6C;AAAA,EACnE,IAAI,UAAU,MAAM;AAAA,IACnB,MAAM,QAAQ,IAAI,KAAK,SAAS,iBAAiB;AAAA,EAClD,EAAO,SAAI,UAAU,OAAO;AAAA,IAC3B,MAAM,MAAM;AAAA,EACb,EAAO;AAAA,IACN,MAAM;AAAA;AAAA;AAIR,SAAS,mBAAmB,GAAU;AAAA,EACrC,OAAO,aAAa;AAAA,IACnB,MAAM,SAAS;AAAA,IACf,MAAM,SAAS;AAAA,IACf,QAAQ,OAAO,YAAY,IAAI,gBAAgB,SAAS,MAAM,CAAC;AAAA,IAC/D,OAAO,QAAQ,OAAO,SAAS,CAAC;AAAA,EACjC,GAAG,SAAS,QAAQ,OAAO,OAAO,UAAU,KAAK,CAAC;AAAA;AAOnD,SAAS,KAAK,CAAC,GAAQ,GAAQ,SAA2B;AAAA,EACzD,IAAI,MAAI;AAAA,IAAG,OAAO;AAAA,EAClB,IAAI,OAAO,MAAM,YAAY,CAAC,KAAK,OAAO,MAAM,YAAY,CAAC;AAAA,IAAG,OAAO;AAAA,EACvE,IAAI,EAAE,gBAAgB,EAAE;AAAA,IAAa,OAAO;AAAA,EAC5C,IAAI,aAAa,OAAO;AAAA,IACvB,IAAI,EAAE,WAAW,EAAE;AAAA,MAAQ,OAAO;AAAA,IAClC,SAAQ,IAAI,EAAG,IAAI,EAAE,QAAQ,KAAK;AAAA,MACjC,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,OAAO;AAAA,QAAG,OAAO;AAAA,IACzC;AAAA,EACD,EAAO;AAAA,IACN,WAAU,KAAK,OAAO,KAAK,CAAC,GAAG;AAAA,MAC9B,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,OAAO;AAAA,QAAG,OAAO;AAAA,IACzC;AAAA,IACA,IAAI,CAAC,SAAS;AAAA,MACb,WAAU,KAAK,OAAO,KAAK,CAAC,GAAG;AAAA,QAC9B,IAAI,CAAC,EAAE,eAAe,CAAC;AAAA,UAAG,OAAO;AAAA,MAClC;AAAA,IACD;AAAA;AAAA,EAED,OAAO;AAAA;AAGR,SAAS,MAAM,CAAC,QAAe;AAAA,EAC9B,MAAM,SAAS,IAAI,gBAAgB,OAAO,MAAM,EAAE,SAAS;AAAA,EAC3D,QAAQ,SAAS,GAAG,OAAO,QAAQ,WAAW,OAAO,QAAQ,OAAO;AAAA;AAGrE,SAAS,YAAY,CAAC,QAAwB,KAAc,OAAsB;AAAA,EACjF,IAAI,OAAO,OAAO,SAAS,OAAO,KAAK,CAAC,GAAG,KAAK,GAAG,KAAK;AAAA,EACxD,QAAQ,KAAG,MAAM,QAAQ,QAAQ,EAAE;AAAA,EACnC,IAAI,CAAC,KAAK,WAAW,GAAG;AAAA,IAAG,OAAO,IAAI;AAAA,EAEtC,OAAO;AAAA,IACN;AAAA,IACA,MAAM,OAAO,QAAQ,OAAO,SAAQ,MAAO,OAAO,KAAK,WAAW,GAAG,IAAI,OAAO,OAAO,MAAM,OAAO,OAAQ;AAAA,IAC5G,GAAG,KAAK,SAAS,IAAI,KAAK,MAAM,CAAC,EAAE,QAAQ,QAAQ,EAAE,EAAE,MAAM,GAAG,IAAI,CAAC;AAAA,IACrE;AAAA,IACA,QAAQ,OAAO,OAAO,WAAW,YAAY,OAAO,SAAS,MAAM,OAAO,MAAM,IAAI,CAAC;AAAA,IACrF,OAAO,OAAO,OAAO,UAAU,YAAY,OAAO,QAAQ,MAAM,OAAO,KAAK,IAAI,CAAC;AAAA,IACjF;AAAA,EACD;AAAA;AAWD,SAAS,eAAe,CAAC,QAAqB;AAAA,EAE7C,IAAI,OAAO,WAAW,UAAU;AAAA,IAC/B,SAAS,EAAC,MAAM,OAAM;AAAA,EACvB,EAAO,SAAI,kBAAkB,OAAO;AAAA,IACnC,SAAS,EAAC,GAAG,OAAM;AAAA,EACpB;AAAA,EAEA,IAAI,OAAO,GAAG;AAAA,IACb,OAAO,IAAI,OAAO,EAAE,IAAI,MAAM;AAAA,EAC/B;AAAA,EACA,IAAI,OAAO,QAAQ;AAAA,IAClB,WAAU,OAAO,OAAO,KAAK,OAAO,MAAM,GAAG;AAAA,MAC5C,OAAO,OAAO,OAAO,OAAO,OAAO,OAAO,IAAI;AAAA,IAC/C;AAAA,EACD;AAAA,EACA,OAAO;AAAA;AAwBD,SAAS,EAAE,CAAC,QAAqB,MAAe,MAAY;AAAA,EAClE,MAAM,QAAkB,QAAQ,OAAO,SAAS,CAAC;AAAA,EAEjD,YAAY,MAAM,OAAO,KAAK,UAAU,QAAQ,OAAO,CAAC,CAAC;AAAA,EAEzD,MAAM,WAAkB,aAAa,gBAAgB,MAAM,GAAG,KAAK,UAAU,SAAS,CAAC;AAAA,EACvF,KAAK,SAAS,QAAQ;AAAA,EAEtB,IAAI,KAAK,QAAQ;AAAA,EACjB,QAAQ,UAAU,EAAC,OAAO,SAAS,OAAO,OAAO,UAAS,GAAG,IAAI,OAAO,QAAQ,CAAC;AAAA,EAEjF,SAAS;AAAA;AAUH,SAAS,IAAI,CAAC,QAA2B;AAAA,EAC/C,MAAM,IAAI,MAAM,QAAQ,OAAO,CAAC;AAAA,EAChC,MAAM,GAAG,gBAAgB,MAAM,CAAC;AAAA,EAChC,GAAG,CAAC;AAAA;AAUE,SAAS,IAAI,CAAC,SAAsB,CAAC,GAAS;AAAA,EACpD,MAAM,UAAU,gBAAgB,MAAM;AAAA,EACtC,MAAM,QAAkB,QAAQ,OAAO,SAAS,CAAC;AAAA,EACjD,SAAQ,IAAI,MAAM,SAAS,EAAG,KAAK,GAAG,KAAK;AAAA,IAC1C,MAAM,YAAmB,KAAK,MAAM,MAAM,EAAE;AAAA,IAC5C,IAAI,MAAM,WAAW,SAAS,IAAI,GAAG;AAAA,MACpC,MAAM,QAAQ,IAAI,MAAM;AAAA,MACxB,IAAI,QAAQ,OAAO,SAAS;AAAA,MAC5B,QAAQ,GAAG,KAAK;AAAA,MAChB;AAAA,IACD;AAAA,EACD;AAAA,EAEA,MAAM,WAAW,aAAa,SAAS,QAAQ,MAAM,SAAS,CAAC;AAAA,EAC/D,IAAI,6BAA6B,OAAO;AAAA,EACxC,KAAK,SAAS,QAAQ;AAAA;AAUhB,SAAS,EAAE,CAAC,aAAqB,GAAS;AAAA,EAChD,MAAM,WAAW,QAAQ,OAAO,EAAE;AAAA,EAClC,MAAM,QAAkB,QAAQ,OAAO,SAAS,CAAC;AAAA,EACjD,SAAQ,IAAI,MAAM,SAAS,EAAG,KAAK,GAAG,KAAK;AAAA,IAC1C,MAAM,YAAmB,KAAK,MAAM,MAAM,EAAE;AAAA,IAC5C,IAAI,UAAU,EAAE,SAAS,SAAS,UAAU,MAAM,UAAU,GAAG,SAAS,MAAM,GAAG,UAAU,EAAE,MAAM,GAAG,KAAK,GAAG;AAAA,MAE7G,IAAI,SAAS,IAAE,OAAO,MAAM,UAAU,SAAS;AAAA,MAC/C,QAAQ,GAAG,IAAI,MAAM,MAAM;AAAA,MAC3B;AAAA,IACD;AAAA,EACD;AAAA,EAEA,MAAM,WAAW,aAAa,EAAC,GAAG,SAAS,MAAM,GAAG,SAAS,SAAS,UAAU,EAAC,GAAG,QAAQ,MAAM,SAAS,CAAC;AAAA,EAC5G,IAAI,2BAA2B,QAAQ;AAAA,EACvC,KAAK,SAAS,QAAQ;AAAA;AAYhB,SAAS,aAAa,CAAC,OAAO,QAAQ;AAAA,EAC5C,MAAM,KAAK,iBAAiB;AAAA,EAC5B,GAAG,iBAAiB,UAAU,QAAQ;AAAA,EACtC,MAAM,MAAM,GAAG,oBAAoB,UAAU,QAAQ,CAAC;AAAA,EAEtD,MAAM,UAAU,QAAQ,OAAO,EAAE,MAAM,SAAS;AAAA,EAChD,IAAI,SAAS;AAAA,IACZ,IAAI,oBAAoB,MAAM,OAAO;AAAA,IACrC,OAAO,OAAO,IAAI,OAAO;AAAA,EAC1B;AAAA,EAEA,SAAS,QAAQ,GAAG;AAAA,KAClB,QAAQ,MAAM,WAAW,CAAC,GAAG,QAAQ;AAAA,MACrC,WAAW,GAAG;AAAA,MACd,YAAY,GAAG;AAAA,IAChB;AAAA;AAAA;AAIF,IAAI;AAKG,IAAM,UAAiB,MAAM,CAAC,CAAC;AAM/B,SAAS,KAAK,GAAG;AAAA,EACvB,YAAY,QAAQ,OAAO,SAAS,CAAC;AAAA,EACrC,MAAM,YAAY,oBAAoB;AAAA,EACtC,IAAI,WAAW,SAAS;AAAA,EACxB,KAAK,QAAQ,OAAO,GAAG,SAAS;AAAA;AAEjC,MAAM;AAGN,OAAO,iBAAiB,YAAY,QAAQ,CAAC,OAAsB;AAAA,EAClE,MAAM,WAAW,oBAAoB;AAAA,EAIrC,MAAM,QAAkB,QAAQ,OAAO,SAAS,CAAC;AAAA,EACjD,IAAI,MAAM,WAAW,UAAU,QAAQ;AAAA,IACtC,MAAM,WAAW,KAAK,IAAI,UAAU,QAAQ,MAAM,MAAM,IAAI;AAAA,IAC5D,IAAI,WAAW,KAAK,MAAM,cAAc,UAAU,WAAW;AAAA,MAC5D,SAAS,MAAM,MAAM,SAAS,UAAU,SAAS,SAAS;AAAA,IAC3D;AAAA,EACD;AAAA,EAGA,YAAY;AAAA,EACZ,IAAI,YAAY,QAAQ;AAAA,EACxB,KAAK,SAAS,QAAQ;AAAA,EAEtB,SAAS;AAAA,CACT;AAGD,UAAU,MAAM;AAAA,EAGf,EAAE,MAAM;AAAA,IACP,QAAQ,OAAO,MAAM,MAAM,KAAK,QAAQ,CAAC,EAAE,KAAK,GAAG;AAAA,GACnD;AAAA,EAGD,EAAE,MAAM;AAAA,IAGP,MAAM,QAAQ,QAAQ,OAAO,SAAS,CAAC;AAAA,IACvC,MAAM,WAAW,aAAa,SAAS,QAAQ,OAAO,EAAE,KAAK,MAAM,SAAS,CAAC;AAAA,IAC7E,KAAK,SAAS,QAAQ;AAAA,IAGtB,MAAM,QAAQ,EAAC,OAAO,SAAS,OAAO,MAAK;AAAA,IAC3C,MAAM,MAAM,OAAO,QAAQ;AAAA,IAC3B,IAAI,QAAQ,SAAS,WAAW,SAAS,SAAS,SAAS,QAAQ,CAAC,MAAM,QAAQ,OAAO,OAAO,KAAK,GAAG;AAAA,MACvG,IAAI,gBAAgB,UAAU,OAAO,GAAG;AAAA,MACxC,QAAQ,aAAa,OAAO,IAAI,GAAG;AAAA,IACpC;AAAA,GACA;AAAA,CACD;",
+  "debugId": "9EEC9BCF7ADAD59464756E2164756E21",
   "names": []
 }

package/dist-min/aberdeen.js

@@ -1,7 +1,9 @@
-class m{keyProp;tail;symbols;constructor(J){this.keyProp=J;this.tail={},this.symbols=[Symbol(0)]}add(J){if(this.symbols[0]in J)return!1;let X=1+(Math.clz32(Math.random()*4294967295)>>2);for(let Z=this.symbols.length;Z<X;Z++)this.symbols.push(Symbol(Z));let W=this.keyProp,z=J[W],F,U=this.tail;for(let Z=this.symbols.length-1;Z>=0;Z--){let j=this.symbols[Z];while((F=U[j])&&F[W]>z)U=F;if(Z<X)J[j]=U[j],U[j]=J}return!0}has(J){return this.symbols[0]in J}fetchLast(){let J=this.tail[this.symbols[0]];if(J)return this.remove(J),J}isEmpty(){return this.tail[this.symbols[0]]===void 0}get(J){let X=this.keyProp,W,z=this.tail;for(let F=this.symbols.length-1;F>=0;F--){let U=this.symbols[F];while((W=z[U])&&W[X]>J)z=W}return z[this.symbols[0]]?.[X]===J?z[this.symbols[0]]:void 0}*[Symbol.iterator](){let J=this.symbols[0],X=this.tail[J];while(X)yield X,X=X[J]}prev(J){return J[this.symbols[0]]}remove(J){if(!(this.symbols[0]in J))return!1;let X=this.keyProp,W=J[X],z,F=this.tail;for(let U=this.symbols.length-1;U>=0;U--){let Z=this.symbols[U];while((z=F[Z])&&z[X]>=W&&z!==J)F=z;if(z===J)F[Z]=z[Z],delete z[Z]}return z===J}clear(){let J=this.symbols[0],X=this.tail;while(X){let W=X[J];for(let z of this.symbols){if(!(z in X))break;delete X[z]}X=W}this.tail={}}}var L,Y=0,_;function h(J){if(!L)L=new m("prio"),setTimeout(RJ,0);else if(!(Y&1)){if(Y++,Y>98)throw Error("Too many recursive updates from observes")}L.add(J)}function RJ(){let J=Date.now();while(L){let X=L.fetchLast();if(!X)break;if(Y&1)Y++;X.queueRun()}if(L=void 0,Y=0,J=Date.now()-J,J>9)console.debug(`Aberdeen queue took ${J}ms`)}function JJ(J){if(typeof J==="string")return`${J}\x01`;let X="",W=Math.abs(Math.round(J)),z=J<0;while(W>0)X=String.fromCharCode(z?65534-W%65533:2+W%65533)+X,W=Math.floor(W/65533);return String.fromCharCode(128+(z?-X.length:X.length))+X}function kJ(J){let X="";for(let W=0;W<J.length;W++)X+=String.fromCodePoint(65535-J.charCodeAt(W));return X}var jJ=0;class s{prio=--jJ;onChange(J){h(this)}remove(){let J=this.getLastNode();if(J)S(J,this.getPrecedingNode());this.delete()}}class qJ{queueRun;prio=--jJ;constructor(J){this.queueRun=J;h(this)}}class P extends s{cleaners;constructor(J=[]){super();this.cleaners=J}lastChild;redraw(){}getLastNode(){return D(this.lastChild)}delete(){for(let J of this.cleaners)if(typeof J==="function")J();else J.delete(this);this.cleaners.length=0,L?.remove(this),this.lastChild=void 0}queueRun(){this.remove(),_=this,this.redraw(),_=void 0}getInsertAfterNode(){return this.getLastNode()||this.getPrecedingNode()}onChange(){h(this)}getChildPrevSibling(){return this.lastChild}}class g extends P{el;svg;prevSibling;constructor(J,X,W=!1){super(W?q.cleaners:[]);this.el=J;this.svg=X;if(J===q.el)this.prevSibling=q.getChildPrevSibling(),q.lastChild=this;else this.prevSibling=J.lastChild||void 0;if(!W)q.cleaners.push(this)}getPrecedingNode(){return D(this.prevSibling)}getChildPrevSibling(){return this.lastChild||this.prevSibling}}class a extends g{renderer;constructor(J,X,W){super(J,X);this.renderer=W;this.redraw()}redraw(){let J=q;q=this;try{this.renderer()}catch(X){e(X,!0)}q=J}}class r extends P{el=document.body;svg=!1;getPrecedingNode(){return}}class $J extends P{el;renderer;svg;constructor(J,X){super();this.el=J;this.renderer=X;this.svg=J.namespaceURI==="http://www.w3.org/2000/svg",this.redraw(),q.cleaners.push(this)}redraw(){a.prototype.redraw.call(this)}getPrecedingNode(){return}delete(){S(this.getLastNode(),this.getPrecedingNode()),super.delete()}remove(){this.delete()}}function S(J,X){while(J&&J!==X){let W=J.previousSibling,z=l.get(J);if(z&&J instanceof Element){if(z!==!0){if(typeof z==="function")z(J);else TJ(J,z);l.set(J,!0)}}else J.remove();J=W}}function D(J){if(!J||J instanceof Node)return J;return J.getLastNode()||J.getPrecedingNode()}class HJ extends g{renderer;result=N({value:void 0});constructor(J){super(q.el,q.svg);this.renderer=J;this.redraw()}redraw(){let J=q;q=this;try{this.result.value=this.renderer()}catch(X){e(X,!0)}q=J}}class QJ extends g{key;target;svg=!1;constructor(J,X,W){super(J,J.namespaceURI==="http://www.w3.org/2000/svg");this.key=X;this.target=W;this.redraw()}redraw(){let J=q;q=this,f(this.el,this.key,this.target.value),q=J}}class KJ extends s{renderer;makeSortKey;parentElement=q.el;prevSibling;target;byIndex=new Map;sortedSet=new m("sortKey");changedIndexes=new Set;constructor(J,X,W){super();this.renderer=X;this.makeSortKey=W;let z=this.target=J[H]||J;if(B(z,A,this),this.prevSibling=q.getChildPrevSibling(),q.lastChild=this,q.cleaners.push(this),z instanceof Array)for(let F=0;F<z.length;F++)new v(this,F,!1);else for(let F of z instanceof Map?z.keys():Object.keys(z))new v(this,F,!1)}getPrecedingNode(){return D(this.prevSibling)}onChange(J){if(!(this.target instanceof Array)||typeof J==="number")this.changedIndexes.add(J);h(this)}queueRun(){let J=this.changedIndexes;this.changedIndexes=new Set;for(let X of J){let W=this.byIndex.get(X);if(W)W.remove();if(this.target instanceof Map?this.target.has(X):(X in this.target))new v(this,X,!0);else this.byIndex.delete(X)}_=void 0}delete(){for(let J of this.byIndex.values())J.delete();L?.remove(this),this.byIndex.clear(),setTimeout(()=>{this.sortedSet.clear()},1)}getLastNode(){for(let J of this.sortedSet){let X=J.getActualLastNode();if(X)return X}}}class v extends P{parent;itemIndex;sortKey;el;svg;constructor(J,X,W){super();this.parent=J;this.itemIndex=X;if(this.el=J.parentElement,this.svg=q.svg,this.parent.byIndex.set(this.itemIndex,this),this.lastChild=this,W)_=this;this.redraw()}getPrecedingNode(){this.parent.sortedSet.add(this);let J=this.parent.sortedSet.prev(this);if(J)return D(J.lastChild);return this.parent.getPrecedingNode()}getLastNode(){return this.getPrecedingNode()}getActualLastNode(){let J=this.lastChild;while(J&&J!==this){if(J instanceof Node)return J;let X=J.getLastNode();if(X)return X;J=J.getPrecedingNode()}}queueRun(){if(q!==b)ZJ(4);if(this.sortKey!==void 0){let J=this.getActualLastNode();if(J)S(J,this.getPrecedingNode())}this.delete(),this.lastChild=this,_=this,this.redraw(),_=void 0}redraw(){let J,X=this.parent.target,W=this.itemIndex;if(X instanceof Map)J=N(X.get(W)),W=N(W);else J=N(X[W]);let z=q;q=this;let F;try{if(this.parent.makeSortKey){let U=this.parent.makeSortKey(J,W);if(U!=null)F=U instanceof Array?U.map(JJ).join(""):U}else F=W;if(typeof F==="number")F=JJ(F);if(this.sortKey!==F)this.parent.sortedSet.remove(this),this.sortKey=F;if(F!=null)this.parent.renderer(J,W)}catch(U){e(U,F!=null)}q=z}getInsertAfterNode(){if(this.sortKey==null)ZJ(1);return D(this.lastChild)}remove(){if(this.sortKey!==void 0){let J=this.getActualLastNode();if(J)S(J,this.getPrecedingNode());this.parent.sortedSet.remove(this),this.sortKey=void 0}this.delete()}}function y(J,X){if(J!==q.el){J.appendChild(X);return}let W=q.el,z=q.getInsertAfterNode();W.insertBefore(X,z?z.nextSibling:W.firstChild),q.lastChild=X}var b=new r,q=b;function SJ(J){let X=q;q=new r;try{return J()}finally{q=X}}var A=Symbol("any"),H=Symbol("target"),T=Symbol("mapSize"),p=new WeakMap,i=0;function B(J,X,W=q){if(W===b||i)return;let z=p.get(J);if(!z)p.set(J,z=new Map);if(X!==A&&z.get(A)?.has(W))return;let F=z.get(X);if(!F)z.set(X,F=new Set);if(F.has(W))return;if(F.add(W),W===q)q.cleaners.push(F);else q.cleaners.push(()=>{F.delete(W)})}function u(J,X,W){if(!J||typeof J!=="object")throw Error("onEach requires an object");J=J[H]||J,new KJ(J,X,W)}function GJ(J){for(let X of Object.keys(J))return!1;return!0}var G=Symbol("empty");function yJ(J){let X=J[H]||J,W=q;if(X instanceof Array)return B(X,"length",(F,U,Z)=>{if(!U!==!Z)h(W)}),!X.length;if(X instanceof Map)return B(X,T,(F,U,Z)=>{if(!U!==!Z)h(W)}),!X.size;let z=GJ(X);return B(X,A,(F,U,Z)=>{if(z?Z===G:U===G)h(W)}),z}function iJ(J){if(J instanceof Array)return n(J,"length");if(J instanceof Map)return n(J,"size");let X=J[H]||J,W=0;for(let F of Object.keys(X))if(X[F]!==void 0)W++;let z=MJ(W);return B(X,A,(F,U,Z)=>{if(Z===U);else if(Z===G)z.value=++W;else if(U===G)z.value=--W}),z}function fJ(J,X,W,z){if(W===z&&W!==void 0)return;let F=p.get(J);if(F===void 0)return;for(let U of[X,A]){let Z=F.get(U);if(Z)for(let j of Z)if(typeof j==="function")j(X,W,z);else j.onChange(X)}}var Q=fJ,_J={get(J,X){if(X===H)return J;return B(J,X),N(J[X])},set(J,X,W){if(typeof W==="object"&&W)W=W[H]||W;let z=J.hasOwnProperty(X)?J[X]:G;if(W!==z)J[X]=W,Q(J,X,W,z);return!0},deleteProperty(J,X){let W=J.hasOwnProperty(X)?J[X]:G;return delete J[X],Q(J,X,G,W),!0},has(J,X){return B(J,X),J.hasOwnProperty(X)},ownKeys(J){return B(J,A),Reflect.ownKeys(J)}};function hJ(J,X,W){if(typeof W==="object"&&W)W=W[H]||W;let z=J[X];if(z===void 0&&!J.hasOwnProperty(X))z=G;if(W!==z){let F=J.length;if(X==="length"){J.length=W;for(let U=W;U<F;U++)Q(J,U,G,J[U])}else{if(typeof X==="string"){let U=0|X;if(String(U)===X&&U>=0)X=U}J[X]=W,Q(J,X,W,z)}if(J.length!==F)Q(J,"length",J.length,F)}return!0}var wJ={get(J,X){if(X===H)return J;if(typeof X==="string"){let W=0|X;if(String(W)===X&&W>=0)X=W}return B(J,X),N(J[X])},set:hJ,deleteProperty(J,X){if(typeof X==="string"){let z=0|X;if(String(z)===X&&z>=0)X=z}let W=J[X];if(W===void 0&&!J.hasOwnProperty(X))W=G;return delete J[X],Q(J,X,G,W),!0}};function XJ(J){return{[Symbol.iterator](){return this},next(){let X=J.next();if(X.done)return X;return{done:!1,value:N(X.value)}}}}function WJ(J){return{[Symbol.iterator](){return this},next(){let X=J.next();if(X.done)return X;return{done:!1,value:[N(X.value[0]),N(X.value[1])]}}}}var zJ={get(J){let X=this[H];if(typeof J==="object"&&J)J=J[H]||J;return B(X,J),N(X.get(J))},set(J,X){let W=this[H];if(typeof J==="object"&&J)J=J[H]||J;if(typeof X==="object"&&X)X=X[H]||X;let z=W.get(J);if(z===void 0&&!W.has(J))z=G;if(X!==z){let F=W.size;W.set(J,X),Q(W,J,X,z),Q(W,T,W.size,F)}return this},delete(J){let X=this[H];if(typeof J==="object"&&J)J=J[H]||J;let W=X.get(J);if(W===void 0&&!X.has(J))W=G;let z=X.delete(J);if(z)Q(X,J,G,W),Q(X,T,X.size,X.size+1);return z},clear(){let J=this[H],X=J.size;for(let W of J.keys())Q(J,W,void 0,J.get(W));J.clear(),Q(J,T,0,X)},has(J){let X=this[H];if(typeof J==="object"&&J)J=J[H]||J;return B(X,J),X.has(J)},keys(){let J=this[H];return B(J,A),XJ(J.keys())},values(){let J=this[H];return B(J,A),XJ(J.values())},entries(){let J=this[H];return B(J,A),WJ(J.entries())},[Symbol.iterator](){let J=this[H];return B(J,A),WJ(J[Symbol.iterator]())}},YJ={get(J,X){if(X===H)return J;if(zJ.hasOwnProperty(X))return zJ[X];if(X==="size")return B(J,T),J.size;return J[X]}},UJ=new WeakMap;function N(J){if(typeof J!=="object"||!J||J[H]!==void 0||w in J)return J;let X=UJ.get(J);if(X)return X;let W;if(J instanceof Array)W=wJ;else if(J instanceof Map)W=YJ;else W=_J;return X=new Proxy(J,W),UJ.set(J,X),X}function MJ(J){if(J instanceof Promise){let X=N({busy:!0});return J.then((W)=>{X.value=W,X.busy=!1}).catch((W)=>{X.error=W,X.busy=!1}),X}return N(typeof J==="object"&&J!==null?J:{value:J})}function NJ(J){return J?J[H]||J:J}var l=new WeakMap;function TJ(J,X){let W=X.split(".").filter((z)=>z);J.classList.add(...W),setTimeout(()=>J.remove(),2000)}function gJ(J,X,W){if(arguments.length>2)return BJ(J,X,W,0);return c(J,X,0)}function BJ(J,X,W,z){let F=bJ(J,X);if(W===F)return!1;if(typeof F==="object"&&F&&typeof W==="object"&&W&&F.constructor===W.constructor)return c(F,W,z);if(W=O(W),J instanceof Map)J.set(X,W);else J[X]=O(W);return!0}function uJ(J,X,W){if(arguments.length>2)return BJ(J,X,W,E);return c(J,X,E)}function c(J,X,W){let z=J[H];if(z)J=z,W|=V;if(z=X[H],z){if(X=z,q!==b&&!i)W|=AJ}return k(J,X,W)}function k(J,X,W){if(W&AJ)B(X,A);let z=!1;if(X instanceof Array&&J instanceof Array){let F=J.length,U=X.length;for(let Z=0;Z<U;Z++){let j=J[Z];if(j===void 0&&!J.hasOwnProperty(Z))j=G;let $=X[Z];if($===void 0&&!X.hasOwnProperty(Z)){if(delete J[Z],W&V)Q(J,Z,G,j);z=!0}else if(j!==$){if($&&typeof $==="object"){if(typeof j==="object"&&j&&$.constructor===j.constructor&&!(w in $)){z=k(j,$,W)||z;continue}$=O($)}if(J[Z]=$,W&V)Q(J,Z,$,j);z=!0}}if(U!==F){if(W&V){for(let Z=U;Z<F;Z++){let j=J[Z];delete J[Z],Q(J,Z,G,j)}J.length=U,Q(J,"length",U,F)}else J.length=U;z=!0}}else if(X instanceof Map&&J instanceof Map){for(let F of X.keys()){let U=X.get(F),Z=J.get(F);if(Z===void 0&&!J.has(F))Z=G;if(Z!==U){if(U&&typeof U==="object"){if(typeof Z==="object"&&Z&&U.constructor===Z.constructor&&!(w in U)){z=k(Z,U,W)||z;continue}U=O(U)}if(J.set(F,U),W&V)Q(J,F,U,Z);z=!0}}if(!(W&E)){for(let F of J.keys())if(!X.has(F)){let U=J.get(F);if(J.delete(F),W&V)Q(J,F,void 0,U);z=!0}}}else if(X.constructor===J.constructor){for(let F of Object.keys(X)){let U=X[F],Z=J.hasOwnProperty(F)?J[F]:G;if(Z!==U){if(U&&typeof U==="object"){if(typeof Z==="object"&&Z&&U.constructor===Z.constructor&&!(w in U)){z=k(Z,U,W)||z;continue}U=O(U)}if(J[F]=U,W&V)Q(J,F,U,Z);z=!0}}if(!(W&E)){for(let F of Object.keys(J))if(!X.hasOwnProperty(F)){let U=J[F];if(delete J[F],W&V&&U!==void 0)Q(J,F,void 0,U);z=!0}}}else throw Error(`Incompatible or non-object types: ${X?.constructor?.name||typeof X} vs ${J?.constructor?.name||typeof J}`);return z}var E=1,AJ=32,V=64,w=Symbol("NO_COPY");Promise.prototype[w]=!0;var t=N({});for(let J=1;J<=12;J++)t[J]=2**(J-3)+"rem";function O(J){if(w in J)return J;let X=Array.isArray(J)?[]:J instanceof Map?new Map:Object.create(Object.getPrototypeOf(J));return c(X,J,E),X}var OJ={get(J,X){if(X===H)return n(NJ(J.proxy),J.index);if(X==="value")return J.proxy[J.index]},set(J,X,W){if(X==="value")return J.proxy[J.index]=W,!0;return!1}};function n(J,X){return new Proxy({proxy:J,index:X},OJ)}function DJ(J,X){let W,z,F=J.getAttribute("type"),U=NJ(X).value;if(F==="checkbox"){if(U===void 0)X.value=J.checked;W=()=>{J.checked=X.value},z=()=>{X.value=J.checked}}else if(F==="radio"){if(U===void 0&&J.checked)X.value=J.value;W=()=>{J.checked=X.value===J.value},z=()=>{if(J.checked)X.value=J.value}}else{if(z=()=>{X.value=F==="number"||F==="range"?J.value===""?null:+J.value:J.value},U===void 0)z();W=()=>{if(J.value=X.value,J.tagName==="SELECT"&&J.value!=X.value)new qJ(()=>J.value=X.value)}}PJ(W),J.addEventListener("input",z),M(()=>{J.removeEventListener("input",z)})}var FJ={create:(J,X)=>{if(q!==_)return;if(typeof X==="function")X(J);else{let W=X.split(".").filter((z)=>z);J.classList.add(...W),(async()=>{J.offsetHeight,J.classList.remove(...W)})()}},destroy:(J,X)=>{l.set(J,X)},html:(J,X)=>{let W=document.createElement(q.el.tagName);W.innerHTML=`${X}`;while(W.firstChild)y(J,W.firstChild)},text:(J,X)=>{y(J,document.createTextNode(X))}};function I(...J){let{el:X,svg:W}=q,z=J.length;for(let F=0;F<z;F++){let U=J[F];if(U==null||U===!1);else if(typeof U==="string"){let Z=U.length,j=0;for(let $=0;$<Z;$=j+1){j=x(U," .=:#",$);let R=U[j];if(R===":"||R==="="){let K=U.substring($,j);if(R===":")K="$"+K;if(j+1>=Z){f(X,K,J[++F]);break}if(U[j+1]==='"'){let C=x(U,'"',j+2),d=U.substring(j+2,C);f(X,K,d),j=C}else{let C=x(U," ",j+1),d=U.substring(j+1,C);f(X,K,d),j=C}}else{if(j>$){let K=U.substring($,j);W||=K==="svg";let C=W?document.createElementNS("http://www.w3.org/2000/svg",K):document.createElement(K);y(X,C),X=C}if(R==="#"){let K=j+1<Z?U.substring(j+1):J[++F];f(X,"text",K);break}if(R==="."){let K=x(U," #=.",j+1);if(U[K]==="="&&K+1>=Z)f(X,U.substring(j,K),J[++F]),j=K;else{let C=U.substring(j+1,K);X.classList.add(C||J[++F]),j=K-1}}}}}else if(typeof U==="object")if(U.constructor!==Object)if(U instanceof Node){if(y(X,U),U instanceof Element)X=U,W=U.namespaceURI==="http://www.w3.org/2000/svg"}else throw Error(`Unexpected argument: ${U}`);else for(let Z of Object.keys(U))f(X,Z,U[Z]);else if(typeof U==="function")new a(X,W,U);else throw Error(`Unexpected argument: ${U}`)}return X}function x(J,X,W){if(X.length===1){let F=J.indexOf(X,W);return F>=0?F:J.length}let z=J.length;for(let F=W;F<z;F++)if(X.indexOf(J[F])>=0)return F;return z}var CJ=0;function EJ(J,X=!1){let W=X?"":`.AbdStl${++CJ}`,z=o(J,W);if(z)I(`style#${z}`);return W}function cJ(J){return EJ(J,!0)}var VJ={m:"margin",mt:"marginTop",mb:"marginBottom",ml:"marginLeft",mr:"marginRight",mh:["marginLeft","marginRight"],mv:["marginTop","marginBottom"],p:"padding",pt:"paddingTop",pb:"paddingBottom",pl:"paddingLeft",pr:"paddingRight",ph:["paddingLeft","paddingRight"],pv:["paddingTop","paddingBottom"],w:"width",h:"height",bg:"background",fg:"color",r:"borderRadius"};function o(J,X){let W="",z="";for(let F of Object.keys(J)){let U=J[F];for(let Z of F.split(/, ?/g))if(U&&typeof U==="object")if(Z.startsWith("@"))z+=`${Z}{
-${o(U,X)}}
-`;else z+=o(U,Z.includes("&")?Z.replace(/&/g,X):`${X} ${Z}`);else{let j=U==null||U===!1?"":typeof U==="string"?U[0]==="@"?t[U.substring(1)]||"":U:String(U),$=VJ[Z]||Z;for(let R of Array.isArray($)?$:[$])W+=`${R.replace(/[A-Z]/g,(K)=>`-${K.toLowerCase()}`)}:${j};`}}if(W)z=`${X.trimStart()||"*"}{${W}}
-${z}`;return z}function f(J,X,W){if(typeof W==="object"&&W!==null&&W[H])if(X==="bind")DJ(J,W);else new QJ(J,X,W);else if(X[0]==="."){let z=X.substring(1).split(".");if(W)J.classList.add(...z);else J.classList.remove(...z)}else if(X[0]==="$"){X=X.substring(1);let z=W==null||W===!1?"":typeof W==="string"?W[0]==="@"?t[W.substring(1)]||"":W:String(W),F=VJ[X]||X;if(typeof F==="string")J.style[F]=z;else for(let U of F)J.style[U]=z}else if(W==null);else if(X in FJ)FJ[X](J,W);else if(typeof W==="function"){if(J.addEventListener(X,W),J===q.el)M(()=>J.removeEventListener(X,W))}else if(W===!0||W===!1||X==="value"||X==="selectedIndex")J[X]=W;else J.setAttribute(X,W)}function IJ(J){return console.error("Error while in Aberdeen render:",J),!0}var LJ=IJ;function dJ(J){LJ=J||IJ}function pJ(){return q.el}function M(J){q.cleaners.push(J)}function PJ(J){return new HJ(J).result}function lJ(J,X){new $J(J,X)}function nJ(){b.remove(),CJ=0}function bJ(J,X){i++;try{if(arguments.length===1)return J();else return J instanceof Map?J.get(X):J[X]}finally{i--}}function oJ(J,X){let W;if(J instanceof Array)W=N([]);else if(J instanceof Map)W=N(new Map);else W=N({});return u(J,(z,F)=>{let U=X(z,F);if(U!==void 0)if(W instanceof Map)W.set(F,U),M(()=>{W.delete(F)});else W[F]=U,M(()=>{delete W[F]})}),W}function sJ(J,X){let W=N({});return u(J,(z,F)=>{let U=X(z,F);if(U){for(let Z of Object.keys(U))W[Z]=U[Z];M(()=>{for(let Z of Object.keys(U))delete W[Z]})}}),W}function aJ(J,X){let W={},z=N(W);return u(J,(F,U)=>{let Z=X(F,U);if(Z!=null){let j=Z instanceof Array?Z:[Z];if(j.length){for(let $ of j)if(W[$])z[$][U]=F;else z[$]={[U]:F};M(()=>{for(let $ of j)if(delete z[$][U],GJ(W[$]))delete z[$]})}}}),z}function mJ(J){if(J&&typeof J==="object"){let X=J.constructor.name.toLowerCase()||"unknown object";if(I(`#<${X}>`),w in J)I("# [NO_COPY]");else I("ul",()=>{u(J,(W,z)=>{I("li",()=>{I(`#${JSON.stringify(z)}: `),mJ(W)})})})}else if(J!==void 0)I("#"+JSON.stringify(J));return J}function ZJ(J){throw Error(`Aberdeen internal error ${J}`)}function e(J,X){try{if(LJ(J)===!1)X=!1}catch(W){console.error(W)}try{if(X)I("div.aberdeen-error#Error")}catch{}}function rJ(J,X){let W=Q;Q=J;try{X()}finally{Q=W}}export{rJ as withEmitHandler,NJ as unproxy,nJ as unmountAll,dJ as setErrorHandler,RJ as runQueue,n as ref,MJ as proxy,bJ as peek,aJ as partition,u as onEach,sJ as multiMap,lJ as mount,uJ as merge,oJ as map,SJ as leakScope,yJ as isEmpty,kJ as invertString,cJ as insertGlobalCss,EJ as insertCss,pJ as getParentElement,mJ as dump,PJ as derive,fJ as defaultEmitHandler,t as cssVars,iJ as count,gJ as copy,O as clone,M as clean,w as NO_COPY,I as $};
+class m{keyProp;tail;symbols;constructor(J){this.keyProp=J;this.tail={},this.symbols=[Symbol(0)]}add(J){if(this.symbols[0]in J)return!1;let X=1+(Math.clz32(Math.random()*4294967295)>>2);for(let j=this.symbols.length;j<X;j++)this.symbols.push(Symbol(j));let W=this.keyProp,z=J[W],Z,U=this.tail;for(let j=this.symbols.length-1;j>=0;j--){let F=this.symbols[j];while((Z=U[F])&&Z[W]>z)U=Z;if(j<X)J[F]=U[F],U[F]=J}return!0}has(J){return this.symbols[0]in J}fetchLast(){let J=this.tail[this.symbols[0]];if(J)return this.remove(J),J}isEmpty(){return this.tail[this.symbols[0]]===void 0}get(J){let X=this.keyProp,W,z=this.tail;for(let Z=this.symbols.length-1;Z>=0;Z--){let U=this.symbols[Z];while((W=z[U])&&W[X]>J)z=W}return z[this.symbols[0]]?.[X]===J?z[this.symbols[0]]:void 0}*[Symbol.iterator](){let J=this.symbols[0],X=this.tail[J];while(X)yield X,X=X[J]}prev(J){return J[this.symbols[0]]}remove(J){if(!(this.symbols[0]in J))return!1;let X=this.keyProp,W=J[X],z,Z=this.tail;for(let U=this.symbols.length-1;U>=0;U--){let j=this.symbols[U];while((z=Z[j])&&z[X]>=W&&z!==J)Z=z;if(z===J)Z[j]=z[j],delete z[j]}return z===J}clear(){let J=this.symbols[0],X=this.tail;while(X){let W=X[J];for(let z of this.symbols){if(!(z in X))break;delete X[z]}X=W}this.tail={}}}var I,M=0,_;function h(J){if(!I)I=new m("prio"),setTimeout(hJ,0);else if(!(M&1)){if(M++,M>98)throw Error("Too many recursive updates from observes")}I.add(J)}function hJ(){let J=Date.now();while(I){let X=I.fetchLast();if(!X)break;if(M&1)M++;X.queueRun()}if(I=void 0,M=0,J=Date.now()-J,J>9)console.debug(`Aberdeen queue took ${J}ms`)}function JJ(J){if(typeof J==="string")return`${J}\x01`;let X="",W=Math.abs(Math.round(J)),z=J<0;while(W>0)X=String.fromCharCode(z?65534-W%65533:2+W%65533)+X,W=Math.floor(W/65533);return String.fromCharCode(128+(z?-X.length:X.length))+X}function uJ(J){let X="";for(let W=0;W<J.length;W++)X+=String.fromCodePoint(65535-J.charCodeAt(W));return X}var FJ=0;class a{prio=--FJ;onChange(J){h(this)}remove(){let J=this.getLastNode();if(J)S(J,this.getPrecedingNode());this.delete()}}class qJ{queueRun;prio=--FJ;constructor(J){this.queueRun=J;h(this)}}class P extends a{cleaners;constructor(J=[]){super();this.cleaners=J}lastChild;redraw(){}getLastNode(){return D(this.lastChild)}delete(){for(let J of this.cleaners)if(typeof J==="function")J();else J.delete(this);this.cleaners.length=0,I?.remove(this),this.lastChild=void 0}queueRun(){this.remove(),_=this,this.redraw(),_=void 0}getInsertAfterNode(){return this.getLastNode()||this.getPrecedingNode()}onChange(){h(this)}getChildPrevSibling(){return this.lastChild}}class g extends P{el;svg;prevSibling;constructor(J,X,W=!1){super(W?q.cleaners:[]);this.el=J;this.svg=X;if(J===q.el)this.prevSibling=q.getChildPrevSibling(),q.lastChild=this;else this.prevSibling=J.lastChild||void 0;if(!W)q.cleaners.push(this)}getPrecedingNode(){return D(this.prevSibling)}getChildPrevSibling(){return this.lastChild||this.prevSibling}}class r extends g{renderer;constructor(J,X,W){super(J,X);this.renderer=W;this.redraw()}redraw(){let J=q;q=this;try{this.renderer()}catch(X){e(X,!0)}q=J}}class t extends P{el=document.body;svg=!1;getPrecedingNode(){return}}class HJ extends P{el;renderer;svg;constructor(J,X){super();this.el=J;this.renderer=X;this.svg=J.namespaceURI==="http://www.w3.org/2000/svg",this.redraw(),q.cleaners.push(this)}redraw(){r.prototype.redraw.call(this)}getPrecedingNode(){return}delete(){S(this.getLastNode(),this.getPrecedingNode()),super.delete()}remove(){this.delete()}}function S(J,X){while(J&&J!==X){let W=J.previousSibling,z=l.get(J);if(z&&J instanceof Element){if(z!==!0){if(typeof z==="function")z(J);else PJ(J,z);l.set(J,!0)}}else J.remove();J=W}}function D(J){if(!J||J instanceof Node)return J;return J.getLastNode()||J.getPrecedingNode()}class $J extends g{renderer;result=N({value:void 0});constructor(J){super(q.el,q.svg);this.renderer=J;this.redraw()}redraw(){let J=q;q=this;try{this.result.value=this.renderer()}catch(X){e(X,!0)}q=J}}class QJ extends g{key;target;svg=!1;constructor(J,X,W){super(J,J.namespaceURI==="http://www.w3.org/2000/svg");this.key=X;this.target=W;this.redraw()}redraw(){let J=q;q=this,f(this.el,this.key,this.target.value),q=J}}class KJ extends a{renderer;makeSortKey;parentElement=q.el;prevSibling;target;byIndex=new Map;sortedSet=new m("sortKey");changedIndexes=new Set;constructor(J,X,W){super();this.renderer=X;this.makeSortKey=W;let z=this.target=J[$]||J;if(B(z,A,this),this.prevSibling=q.getChildPrevSibling(),q.lastChild=this,q.cleaners.push(this),z instanceof Array)for(let Z=0;Z<z.length;Z++)new v(this,Z,!1);else for(let Z of z instanceof Map?z.keys():Object.keys(z))new v(this,Z,!1)}getPrecedingNode(){return D(this.prevSibling)}onChange(J){if(!(this.target instanceof Array)||typeof J==="number")this.changedIndexes.add(J);h(this)}queueRun(){let J=this.changedIndexes;this.changedIndexes=new Set;for(let X of J){let W=this.byIndex.get(X);if(W)W.remove();if(this.target instanceof Map?this.target.has(X):(X in this.target))new v(this,X,!0);else this.byIndex.delete(X)}_=void 0}delete(){for(let J of this.byIndex.values())J.delete();I?.remove(this),this.byIndex.clear(),setTimeout(()=>{this.sortedSet.clear()},1)}getLastNode(){for(let J of this.sortedSet){let X=J.getActualLastNode();if(X)return X}}}class v extends P{parent;itemIndex;sortKey;el;svg;constructor(J,X,W){super();this.parent=J;this.itemIndex=X;if(this.el=J.parentElement,this.svg=q.svg,this.parent.byIndex.set(this.itemIndex,this),this.lastChild=this,W)_=this;this.redraw()}getPrecedingNode(){this.parent.sortedSet.add(this);let J=this.parent.sortedSet.prev(this);if(J)return D(J.lastChild);return this.parent.getPrecedingNode()}getLastNode(){return this.getPrecedingNode()}getActualLastNode(){let J=this.lastChild;while(J&&J!==this){if(J instanceof Node)return J;let X=J.getLastNode();if(X)return X;J=J.getPrecedingNode()}}queueRun(){if(q!==b)jJ(4);if(this.sortKey!==void 0){let J=this.getActualLastNode();if(J)S(J,this.getPrecedingNode())}this.delete(),this.lastChild=this,_=this,this.redraw(),_=void 0}redraw(){let J,X=this.parent.target,W=this.itemIndex;if(X instanceof Map)J=N(X.get(W)),W=N(W);else J=N(X[W]);let z=q;q=this;let Z;try{if(this.parent.makeSortKey){let U=this.parent.makeSortKey(J,W);if(U!=null)Z=U instanceof Array?U.map(JJ).join(""):U}else Z=W;if(typeof Z==="number")Z=JJ(Z);if(this.sortKey!==Z)this.parent.sortedSet.remove(this),this.sortKey=Z;if(Z!=null)this.parent.renderer(J,W)}catch(U){e(U,Z!=null)}q=z}getInsertAfterNode(){if(this.sortKey==null)jJ(1);return D(this.lastChild)}remove(){if(this.sortKey!==void 0){let J=this.getActualLastNode();if(J)S(J,this.getPrecedingNode());this.parent.sortedSet.remove(this),this.sortKey=void 0}this.delete()}}function y(J,X){if(J!==q.el){J.appendChild(X);return}let W=q.el,z=q.getInsertAfterNode();W.insertBefore(X,z?z.nextSibling:W.firstChild),q.lastChild=X}var b=new t,q=b;function wJ(J){let X=q;q=new t;try{return J()}finally{q=X}}var A=Symbol("any"),$=Symbol("target"),O=Symbol("mapSize"),p=new WeakMap,i=0;function B(J,X,W=q){if(W===b||i)return;let z=p.get(J);if(!z)p.set(J,z=new Map);if(X!==A&&z.get(A)?.has(W))return;let Z=z.get(X);if(!Z)z.set(X,Z=new Set);if(Z.has(W))return;if(Z.add(W),W===q)q.cleaners.push(Z);else q.cleaners.push(()=>{Z.delete(W)})}function u(J,X,W){if(!J||typeof J!=="object")throw Error("onEach requires an object");J=J[$]||J,new KJ(J,X,W)}function GJ(J){for(let X of Object.keys(J))return!1;return!0}var K=Symbol("empty");function YJ(J){let X=J[$]||J,W=q;if(X instanceof Array)return B(X,"length",(Z,U,j)=>{if(!U!==!j)h(W)}),!X.length;if(X instanceof Map)return B(X,O,(Z,U,j)=>{if(!U!==!j)h(W)}),!X.size;let z=GJ(X);return B(X,A,(Z,U,j)=>{if(z?j===K:U===K)h(W)}),z}function cJ(J){if(J instanceof Array)return o(J,"length");if(J instanceof Map)return o(J,"size");let X=J[$]||J,W=0;for(let Z of Object.keys(X))if(X[Z]!==void 0)W++;let z=NJ(W);return B(X,A,(Z,U,j)=>{if(j===U);else if(j===K)z.value=++W;else if(U===K)z.value=--W}),z}function MJ(J,X,W,z){if(W===z&&W!==void 0)return;let Z=p.get(J);if(Z===void 0)return;for(let U of[X,A]){let j=Z.get(U);if(j)for(let F of j)if(typeof F==="function")F(X,W,z);else F.onChange(X)}}var Q=MJ,OJ={get(J,X){if(X===$)return J;return B(J,X),N(J[X])},set(J,X,W){if(typeof W==="object"&&W)W=W[$]||W;let z=J.hasOwnProperty(X)?J[X]:K;if(W!==z)J[X]=W,Q(J,X,W,z);return!0},deleteProperty(J,X){let W=J.hasOwnProperty(X)?J[X]:K;return delete J[X],Q(J,X,K,W),!0},has(J,X){return B(J,X),J.hasOwnProperty(X)},ownKeys(J){return B(J,A),Reflect.ownKeys(J)}};function TJ(J,X,W){if(typeof W==="object"&&W)W=W[$]||W;let z=J[X];if(z===void 0&&!J.hasOwnProperty(X))z=K;if(W!==z){let Z=J.length;if(X==="length"){J.length=W;for(let U=W;U<Z;U++)Q(J,U,K,J[U])}else{if(typeof X==="string"){let U=0|X;if(String(U)===X&&U>=0)X=U}J[X]=W,Q(J,X,W,z)}if(J.length!==Z)Q(J,"length",J.length,Z)}return!0}var DJ={get(J,X){if(X===$)return J;if(typeof X==="string"){let W=0|X;if(String(W)===X&&W>=0)X=W}return B(J,X),N(J[X])},set:TJ,deleteProperty(J,X){if(typeof X==="string"){let z=0|X;if(String(z)===X&&z>=0)X=z}let W=J[X];if(W===void 0&&!J.hasOwnProperty(X))W=K;return delete J[X],Q(J,X,K,W),!0}};function XJ(J){return{[Symbol.iterator](){return this},next(){let X=J.next();if(X.done)return X;return{done:!1,value:N(X.value)}}}}function WJ(J){return{[Symbol.iterator](){return this},next(){let X=J.next();if(X.done)return X;return{done:!1,value:[N(X.value[0]),N(X.value[1])]}}}}var zJ={get(J){let X=this[$];if(typeof J==="object"&&J)J=J[$]||J;return B(X,J),N(X.get(J))},set(J,X){let W=this[$];if(typeof J==="object"&&J)J=J[$]||J;if(typeof X==="object"&&X)X=X[$]||X;let z=W.get(J);if(z===void 0&&!W.has(J))z=K;if(X!==z){let Z=W.size;W.set(J,X),Q(W,J,X,z),Q(W,O,W.size,Z)}return this},delete(J){let X=this[$];if(typeof J==="object"&&J)J=J[$]||J;let W=X.get(J);if(W===void 0&&!X.has(J))W=K;let z=X.delete(J);if(z)Q(X,J,K,W),Q(X,O,X.size,X.size+1);return z},clear(){let J=this[$],X=J.size;for(let W of J.keys())Q(J,W,void 0,J.get(W));J.clear(),Q(J,O,0,X)},has(J){let X=this[$];if(typeof J==="object"&&J)J=J[$]||J;return B(X,J),X.has(J)},keys(){let J=this[$];return B(J,A),XJ(J.keys())},values(){let J=this[$];return B(J,A),XJ(J.values())},entries(){let J=this[$];return B(J,A),WJ(J.entries())},[Symbol.iterator](){let J=this[$];return B(J,A),WJ(J[Symbol.iterator]())}},EJ={get(J,X){if(X===$)return J;if(zJ.hasOwnProperty(X))return zJ[X];if(X==="size")return B(J,O),J.size;return J[X]}},UJ=new WeakMap;function N(J){if(typeof J!=="object"||!J||J[$]!==void 0||w in J)return J;let X=UJ.get(J);if(X)return X;let W;if(J instanceof Array)W=DJ;else if(J instanceof Map)W=EJ;else W=OJ;return X=new Proxy(J,W),UJ.set(J,X),X}function NJ(J){if(J instanceof Promise){let X=N({busy:!0});return J.then((W)=>{X.value=W,X.busy=!1}).catch((W)=>{X.error=W,X.busy=!1}),X}return N(typeof J==="object"&&J!==null?J:{value:J})}function BJ(J){return J?J[$]||J:J}var l=new WeakMap;function PJ(J,X){let W=X.split(".").filter((z)=>z);J.classList.add(...W),setTimeout(()=>J.remove(),2000)}function dJ(J,X,W){if(arguments.length>2)return AJ(J,X,W,0);return c(J,X,0)}function AJ(J,X,W,z){let Z=SJ(J,X);if(W===Z)return!1;if(typeof Z==="object"&&Z&&typeof W==="object"&&W&&Z.constructor===W.constructor)return c(Z,W,z);if(W=T(W),J instanceof Map)J.set(X,W);else J[X]=T(W);return!0}function pJ(J,X,W){if(arguments.length>2)return AJ(J,X,W,E);return c(J,X,E)}function c(J,X,W){let z=J[$];if(z)J=z,W|=L;if(z=X[$],z){if(X=z,q!==b&&!i)W|=CJ}return k(J,X,W)}function k(J,X,W){if(W&CJ)B(X,A);let z=!1;if(X instanceof Array&&J instanceof Array){let Z=J.length,U=X.length;for(let j=0;j<U;j++){let F=J[j];if(F===void 0&&!J.hasOwnProperty(j))F=K;let H=X[j];if(H===void 0&&!X.hasOwnProperty(j)){if(delete J[j],W&L)Q(J,j,K,F);z=!0}else if(F!==H){if(H&&typeof H==="object"){if(typeof F==="object"&&F&&H.constructor===F.constructor&&!(w in H)){z=k(F,H,W)||z;continue}H=T(H)}if(J[j]=H,W&L)Q(J,j,H,F);z=!0}}if(U!==Z){if(W&L){for(let j=U;j<Z;j++){let F=J[j];delete J[j],Q(J,j,K,F)}J.length=U,Q(J,"length",U,Z)}else J.length=U;z=!0}}else if(X instanceof Map&&J instanceof Map){for(let Z of X.keys()){let U=X.get(Z),j=J.get(Z);if(j===void 0&&!J.has(Z))j=K;if(j!==U){if(U&&typeof U==="object"){if(typeof j==="object"&&j&&U.constructor===j.constructor&&!(w in U)){z=k(j,U,W)||z;continue}U=T(U)}if(J.set(Z,U),W&L)Q(J,Z,U,j);z=!0}}if(!(W&E)){for(let Z of J.keys())if(!X.has(Z)){let U=J.get(Z);if(J.delete(Z),W&L)Q(J,Z,K,U);z=!0}}}else if(X.constructor===J.constructor){for(let Z of Object.keys(X)){let U=X[Z],j=J.hasOwnProperty(Z)?J[Z]:K;if(j!==U){if(U&&typeof U==="object"){if(typeof j==="object"&&j&&U.constructor===j.constructor&&!(w in U)){z=k(j,U,W)||z;continue}U=T(U)}if(J[Z]=U,W&L)Q(J,Z,U,j);z=!0}}if(!(W&E)){for(let Z of Object.keys(J))if(!X.hasOwnProperty(Z)){let U=J[Z];if(delete J[Z],W&L&&U!==void 0)Q(J,Z,K,U);z=!0}}}else throw Error(`Incompatible or non-object types: ${X?.constructor?.name||typeof X} vs ${J?.constructor?.name||typeof J}`);return z}var E=1,CJ=32,L=64,w=Symbol("NO_COPY");Promise.prototype[w]=!0;var n=N({});function lJ(J=1,X="rem"){for(let W=1;W<=12;W++)n[W]=2**(W-3)*J+X}var VJ=/^\d/;function LJ(J){return`var(--${VJ.test(J)?`m${J}`:J})`}if(typeof document<"u")wJ(()=>{C(()=>{if(!YJ(n))kJ(document.head,()=>{C("style",()=>{let J=`:root {
+`;for(let[X,W]of Object.entries(n)){let z=VJ.test(String(X))?`m${X}`:X;J+=`  --${z}: ${W};
+`}J+="}",C(`#${J}`)})})})});function nJ(){if(typeof window>"u"||!window.matchMedia)return!1;let J=window.matchMedia("(prefers-color-scheme: dark)"),X=NJ(!1);X.value;function W(){X.value=!0}return J.addEventListener("change",W),Y(()=>{J.removeEventListener("change",W)}),J.matches}function T(J){if(w in J)return J;let X=Array.isArray(J)?[]:J instanceof Map?new Map:Object.create(Object.getPrototypeOf(J));return c(X,J,E),X}var bJ={get(J,X){if(X===$)return o(BJ(J.proxy),J.index);if(X==="value")return J.proxy[J.index]},set(J,X,W){if(X==="value")return J.proxy[J.index]=W,!0;return!1}};function o(J,X){return new Proxy({proxy:J,index:X},bJ)}function mJ(J,X){let W,z,Z=J.getAttribute("type"),U=BJ(X).value;if(Z==="checkbox"){if(U===void 0)X.value=J.checked;W=()=>{J.checked=X.value},z=()=>{X.value=J.checked}}else if(Z==="radio"){if(U===void 0&&J.checked)X.value=J.value;W=()=>{J.checked=X.value===J.value},z=()=>{if(J.checked)X.value=J.value}}else{if(z=()=>{X.value=Z==="number"||Z==="range"?J.value===""?null:+J.value:J.value},U===void 0)z();W=()=>{if(J.value=X.value,J.tagName==="SELECT"&&J.value!=X.value)new qJ(()=>J.value=X.value)}}vJ(W),J.addEventListener("input",z),Y(()=>{J.removeEventListener("input",z)})}var ZJ={create:(J,X)=>{if(q!==_)return;if(typeof X==="function")X(J);else{let W=X.split(".").filter((z)=>z);J.classList.add(...W),(async()=>{J.offsetHeight,J.classList.remove(...W)})()}},destroy:(J,X)=>{l.set(J,X)},html:(J,X)=>{let W=document.createElement(q.el.tagName);W.innerHTML=`${X}`;while(W.firstChild)y(J,W.firstChild)},text:(J,X)=>{y(J,document.createTextNode(X))}};function C(...J){let{el:X,svg:W}=q,z=J.length;for(let Z=0;Z<z;Z++){let U=J[Z];if(U==null||U===!1);else if(typeof U==="string"){let j=U.length,F=0;for(let H=0;H<j;H=F+1){F=x(U," .=:#",H);let R=U[F];if(R===":"||R==="="){let G=U.substring(H,F);if(R===":")G="$"+G;if(F+1>=j){f(X,G,J[++Z]);break}if(U[F+1]==='"'){let V=x(U,'"',F+2),d=U.substring(F+2,V);f(X,G,d),F=V}else{let V=x(U," ",F+1),d=U.substring(F+1,V);f(X,G,d),F=V}}else{if(F>H){let G=U.substring(H,F);W||=G==="svg";let V=W?document.createElementNS("http://www.w3.org/2000/svg",G):document.createElement(G);y(X,V),X=V}if(R==="#"){let G=F+1<j?U.substring(F+1):J[++Z];f(X,"text",G);break}if(R==="."){let G=x(U," #=.",F+1);if(U[G]==="="&&G+1>=j)f(X,U.substring(F,G),J[++Z]),F=G;else{let V=U.substring(F+1,G);X.classList.add(V||J[++Z]),F=G-1}}}}}else if(typeof U==="object")if(U.constructor!==Object)if(U instanceof Node){if(y(X,U),U instanceof Element)X=U,W=U.namespaceURI==="http://www.w3.org/2000/svg"}else throw Error(`Unexpected argument: ${U}`);else for(let j of Object.keys(U))f(X,j,U[j]);else if(typeof U==="function")new r(X,W,U);else throw Error(`Unexpected argument: ${U}`)}return X}function x(J,X,W){if(X.length===1){let Z=J.indexOf(X,W);return Z>=0?Z:J.length}let z=J.length;for(let Z=W;Z<z;Z++)if(X.indexOf(J[Z])>=0)return Z;return z}var IJ=0;function xJ(J,X=!1){let W=X?"":`.AbdStl${++IJ}`,z=s(J,W);if(z)C(`style#${z}`);return W}function oJ(J){return xJ(J,!0)}var RJ={m:"margin",mt:"marginTop",mb:"marginBottom",ml:"marginLeft",mr:"marginRight",mh:["marginLeft","marginRight"],mv:["marginTop","marginBottom"],p:"padding",pt:"paddingTop",pb:"paddingBottom",pl:"paddingLeft",pr:"paddingRight",ph:["paddingLeft","paddingRight"],pv:["paddingTop","paddingBottom"],w:"width",h:"height",bg:"background",fg:"color",r:"borderRadius"};function s(J,X){let W="",z="";for(let Z of Object.keys(J)){let U=J[Z];for(let j of Z.split(/, ?/g))if(U&&typeof U==="object")if(j.startsWith("@"))z+=`${j}{
+${s(U,X)}}
+`;else z+=s(U,j.includes("&")?j.replace(/&/g,X):`${X} ${j}`);else{let F=U==null||U===!1?"":typeof U==="string"?U[0]==="$"?LJ(U.substring(1)):U:String(U),H=RJ[j]||j;for(let R of Array.isArray(H)?H:[H])W+=`${R.replace(/[A-Z]/g,(G)=>`-${G.toLowerCase()}`)}:${F};`}}if(W)z=`${X.trimStart()||"*"}{${W}}
+${z}`;return z}function f(J,X,W){if(typeof W==="object"&&W!==null&&W[$])if(X==="bind")mJ(J,W);else new QJ(J,X,W);else if(X[0]==="."){let z=X.substring(1).split(".");if(W)J.classList.add(...z);else J.classList.remove(...z)}else if(X[0]==="$"){X=X.substring(1);let z=W==null||W===!1?"":typeof W==="string"?W[0]==="$"?LJ(W.substring(1)):W:String(W),Z=RJ[X]||X;if(typeof Z==="string")J.style[Z]=z;else for(let U of Z)J.style[U]=z}else if(W==null);else if(X in ZJ)ZJ[X](J,W);else if(typeof W==="function"){if(J.addEventListener(X,W),J===q.el)Y(()=>J.removeEventListener(X,W))}else if(W===!0||W===!1||X==="value"||X==="selectedIndex")J[X]=W;else J.setAttribute(X,W)}function fJ(J){return console.error("Error while in Aberdeen render:",J),!0}var _J=fJ;function sJ(J){_J=J||fJ}function aJ(){return q.el}function Y(J){q.cleaners.push(J)}function vJ(J){return new $J(J).result}function kJ(J,X){new HJ(J,X)}function rJ(){b.remove(),IJ=0}function SJ(J,X){i++;try{if(arguments.length===1)return J();else return J instanceof Map?J.get(X):J[X]}finally{i--}}function tJ(J,X){let W;if(J instanceof Array)W=N([]);else if(J instanceof Map)W=N(new Map);else W=N({});return u(J,(z,Z)=>{let U=X(z,Z);if(U!==void 0)if(W instanceof Map)W.set(Z,U),Y(()=>{W.delete(Z)});else W[Z]=U,Y(()=>{delete W[Z]})}),W}function eJ(J,X){let W=N({});return u(J,(z,Z)=>{let U=X(z,Z);if(U){for(let j of Object.keys(U))W[j]=U[j];Y(()=>{for(let j of Object.keys(U))delete W[j]})}}),W}function JX(J,X){let W={},z=N(W);return u(J,(Z,U)=>{let j=X(Z,U);if(j!=null){let F=j instanceof Array?j:[j];if(F.length){for(let H of F)if(W[H])z[H][U]=Z;else z[H]={[U]:Z};Y(()=>{for(let H of F)if(delete z[H][U],GJ(W[H]))delete z[H]})}}}),z}function yJ(J){if(J&&typeof J==="object"){let X=J.constructor.name.toLowerCase()||"unknown object";if(C(`#<${X}>`),w in J)C("# [NO_COPY]");else C("ul",()=>{u(J,(W,z)=>{C("li",()=>{C(`#${JSON.stringify(z)}: `),yJ(W)})})})}else if(J!==void 0)C("#"+JSON.stringify(J));return J}function jJ(J){throw Error(`Aberdeen internal error ${J}`)}function e(J,X){try{if(_J(J)===!1)X=!1}catch(W){console.error(W)}try{if(X)C("div.aberdeen-error#Error")}catch{}}function XX(J,X){let W=Q;Q=J;try{X()}finally{Q=W}}export{XX as withEmitHandler,BJ as unproxy,rJ as unmountAll,lJ as setSpacingCssVars,sJ as setErrorHandler,hJ as runQueue,o as ref,NJ as proxy,SJ as peek,JX as partition,u as onEach,eJ as multiMap,kJ as mount,pJ as merge,tJ as map,wJ as leakScope,YJ as isEmpty,uJ as invertString,oJ as insertGlobalCss,xJ as insertCss,aJ as getParentElement,yJ as dump,vJ as derive,MJ as defaultEmitHandler,nJ as darkMode,n as cssVars,cJ as count,dJ as copy,T as clone,Y as clean,w as NO_COPY,C as $};
 
-//# debugId=53D84396E8E0618364756E2164756E21
+//# debugId=09FC7F005769075B64756E2164756E21
 //# sourceMappingURL=aberdeen.js.map