aberdeen 1.0.13 → 1.1.0

package/dist/route.js.map

@@ -2,9 +2,9 @@
   "version": 3,
   "sources": ["../src/route.ts"],
   "sourcesContent": [
-    "import {\n\tclean,\n\tclone,\n\tgetParentElement,\n\timmediateObserve,\n\tobserve,\n\tproxy,\n\trunQueue,\n\tunproxy,\n} from \"./aberdeen.js\";\n\n/**\n * The class for the singleton `route` object.\n *\n */\n\nexport class Route {\n\t/** The current path of the URL split into components. For instance `/` or `/users/123/feed`. Updates will be reflected in the URL and will *push* a new entry to the browser history. */\n\tpath!: string;\n\t/** Array containing the path segments. For instance `[]` or `['users', 123, 'feed']`. Updates will be reflected in the URL and will *push* a new entry to the browser history. Also, the values of `p` and `path` will be synced. */\n\tp!: string[];\n\t/** An observable object containing search parameters (a split up query string). For instance `{order: \"date\", title: \"something\"}` or just `{}`. By default, updates will be reflected in the URL, replacing the current history state. */\n\thash!: string;\n\t/** A part of the browser history *state* that is considered part of the page *identify*, meaning changes will (by default) cause a history push, and when going *back*, it must match. */\n\tsearch!: Record<string, string>;\n\t/** The `hash` interpreted as search parameters. So `\"a=x&b=y\"` becomes `{a: \"x\", b: \"y\"}`. */\n\tid!: Record<string, any>;\n\t/** The auxiliary part of the browser history *state*, not considered part of the page *identity*. Changes will be reflected in the browser history using a replace. */\n\taux!: Record<string, any>;\n\t/** The navigation depth of the current session. Starts at 1. Writing to this property has no effect. */\n\tdepth = 1;\n\t/** The navigation action that got us to this page. Writing to this property has no effect.\n        - `\"load\"`: An initial page load.\n        - `\"back\"` or `\"forward\"`: When we navigated backwards or forwards in the stack.\n        - `\"push\"`: When we added a new page on top of the stack. \n    */\n\tnav: \"load\" | \"back\" | \"forward\" | \"push\" = \"load\";\n\t/** As described above, this library takes a best guess about whether pushing an item to the browser history makes sense or not. When `mode` is... \n   \t    - `\"push\"`: Force creation of a new browser history entry. \n   \t    - `\"replace\"`: Update the current history entry, even when updates to other keys would normally cause a *push*.\n \t    - `\"back\"`: Unwind the history (like repeatedly pressing the *back* button) until we find a page that matches the given `path` and `id` (or that is the first page in our stack), and then *replace* that state by the full given state.\n        The `mode` key can be written to `route` but will be immediately and silently removed.\n    */\n\tmode: \"push\" | \"replace\" | \"back\" | undefined;\n}\n\n/**\n * The singleton {@link Route} object reflecting the current URL and browser history state. You can make changes to it to affect the URL and browser history. See {@link Route} for details.\n */\nexport const route = proxy(new Route());\n\nlet stateRoute = {\n\tnonce: -1,\n\tdepth: 0,\n};\n\n// Reflect changes to the browser URL (back/forward navigation) in the `route` and `stack`.\nfunction handleLocationUpdate(event?: PopStateEvent) {\n\tconst state = event?.state || {};\n\tlet nav: \"load\" | \"back\" | \"forward\" | \"push\" = \"load\";\n\tif (state.route?.nonce == null) {\n\t\tstate.route = {\n\t\t\tnonce: Math.floor(Math.random() * Number.MAX_SAFE_INTEGER),\n\t\t\tdepth: 1,\n\t\t};\n\t\thistory.replaceState(state, \"\");\n\t} else if (stateRoute.nonce === state.route.nonce) {\n\t\tnav = state.route.depth > stateRoute.depth ? \"forward\" : \"back\";\n\t}\n\tstateRoute = state.route;\n\n\tif (unproxy(route).mode === \"back\") {\n\t\troute.depth = stateRoute.depth;\n\t\t// We are still in the process of searching for a page in our navigation history..\n\t\tupdateHistory();\n\t\treturn;\n\t}\n\n\tconst search: any = {};\n\tfor (const [k, v] of new URLSearchParams(location.search)) {\n\t\tsearch[k] = v;\n\t}\n\n\troute.path = location.pathname;\n\troute.p = location.pathname.slice(1).split(\"/\");\n\troute.search = search;\n\troute.hash = location.hash;\n\troute.id = state.id;\n\troute.aux = state.aux;\n\troute.depth = stateRoute.depth;\n\troute.nav = nav;\n\n\t// Forward or back event. Redraw synchronously, because we can!\n\tif (event) runQueue();\n}\nhandleLocationUpdate();\nwindow.addEventListener(\"popstate\", handleLocationUpdate);\n\n// These immediate-mode observers will rewrite the data in `route` to its canonical form.\n// We want to to this immediately, so that user-code running immediately after a user-code\n// initiated `set` will see the canonical form (instead of doing a rerender shortly after,\n// or crashing due to non-canonical data).\nfunction updatePath(): void {\n\tlet path = route.path;\n\tif (path == null && unproxy(route).p) {\n\t\tupdateP();\n\t\treturn;\n\t}\n\tpath = `${path || \"/\"}`;\n\tif (!path.startsWith(\"/\")) path = `/${path}`;\n\troute.path = path;\n\troute.p = path.slice(1).split(\"/\");\n}\nimmediateObserve(updatePath);\n\nfunction updateP() {\n\tconst p = route.p;\n\tif (p == null && unproxy(route).path) {\n\t\tupdatePath();\n\t\treturn;\n\t}\n\tif (!(p instanceof Array)) {\n\t\tconsole.error(\n\t\t\t`aberdeen route: 'p' must be a non-empty array, not ${JSON.stringify(p)}`,\n\t\t);\n\t\troute.p = [\"\"]; // This will cause a recursive call this observer.\n\t} else if (p.length === 0) {\n\t\troute.p = [\"\"]; // This will cause a recursive call this observer.\n\t} else {\n\t\troute.path = `/${p.join(\"/\")}`;\n\t}\n}\nimmediateObserve(updateP);\n\nimmediateObserve(() => {\n\tif (!route.search || typeof route.search !== \"object\") route.search = {};\n});\n\nimmediateObserve(() => {\n\tif (!route.id || typeof route.id !== \"object\") route.id = {};\n});\n\nimmediateObserve(() => {\n\tif (!route.aux || typeof route.aux !== \"object\") route.aux = {};\n});\n\nimmediateObserve(() => {\n\tlet hash = `${route.hash || \"\"}`;\n\tif (hash && !hash.startsWith(\"#\")) hash = `#${hash}`;\n\troute.hash = hash;\n});\n\nfunction isSamePage(path: string, state: any): boolean {\n\treturn (\n\t\tlocation.pathname === path &&\n\t\tJSON.stringify(history.state.id || {}) === JSON.stringify(state.id || {})\n\t);\n}\n\nfunction updateHistory() {\n\t// Get and delete mode without triggering anything.\n\tlet mode = route.mode;\n\tconst state = {\n\t\tid: clone(route.id),\n\t\taux: clone(route.aux),\n\t\troute: stateRoute,\n\t};\n\n\t// Construct the URL.\n\tconst path = route.path;\n\n\t// Change browser state, according to `mode`.\n\tif (mode === \"back\") {\n\t\troute.nav = \"back\";\n\t\tif (!isSamePage(path, state) && (history.state.route?.depth || 0) > 1) {\n\t\t\thistory.back();\n\t\t\treturn;\n\t\t}\n\t\tmode = \"replace\";\n\t\t// We'll replace the state async, to give the history.go the time to take affect first.\n\t\t//setTimeout(() => history.replaceState(state, '', url), 0)\n\t}\n\n\tif (mode) route.mode = undefined;\n\tconst search = new URLSearchParams(route.search).toString();\n\tconst url = (search ? `${path}?${search}` : path) + route.hash;\n\n\tif (mode === \"push\" || (!mode && !isSamePage(path, state))) {\n\t\tstateRoute.depth++; // stateRoute === state.route\n\t\thistory.pushState(state, \"\", url);\n\t\troute.nav = \"push\";\n\t\troute.depth = stateRoute.depth;\n\t} else {\n\t\t// Default to `push` when the URL changed or top-level state keys changed.\n\t\thistory.replaceState(state, \"\", url);\n\t}\n}\n\n// This deferred-mode observer will update the URL and history based on `route` changes.\nobserve(updateHistory);\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\n\tconst restore = unproxy(route).aux.scroll?.name;\n\tif (restore) {\n\t\tObject.assign(el, restore);\n\t}\n\n\tfunction onScroll() {\n\t\troute.mode = \"replace\";\n\t\tif (!route.aux.scroll) route.aux.scroll = {};\n\t\troute.aux.scroll[name] = {\n\t\t\tscrollTop: el.scrollTop,\n\t\t\tscrollLeft: el.scrollLeft,\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\";\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\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): 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), \"go\", prevStack.length + 1);\n\tcopy(current, newRoute);\n\t\n\tlog('go', 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"
   ],
-  "mappings": ";AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAgBO,MAAM,MAAM;AAAA,EAElB;AAAA,EAEA;AAAA,EAEA;AAAA,EAEA;AAAA,EAEA;AAAA,EAEA;AAAA,EAEA,QAAQ;AAAA,EAMR,MAA4C;AAAA,EAO5C;AACD;AAKO,IAAM,QAAQ,MAAM,IAAI,KAAO;AAEtC,IAAI,aAAa;AAAA,EAChB,OAAO;AAAA,EACP,OAAO;AACR;AAGA,SAAS,oBAAoB,CAAC,OAAuB;AAAA,EACpD,MAAM,QAAQ,OAAO,SAAS,CAAC;AAAA,EAC/B,IAAI,MAA4C;AAAA,EAChD,IAAI,MAAM,OAAO,SAAS,MAAM;AAAA,IAC/B,MAAM,QAAQ;AAAA,MACb,OAAO,KAAK,MAAM,KAAK,OAAO,IAAI,OAAO,gBAAgB;AAAA,MACzD,OAAO;AAAA,IACR;AAAA,IACA,QAAQ,aAAa,OAAO,EAAE;AAAA,EAC/B,EAAO,SAAI,WAAW,UAAU,MAAM,MAAM,OAAO;AAAA,IAClD,MAAM,MAAM,MAAM,QAAQ,WAAW,QAAQ,YAAY;AAAA,EAC1D;AAAA,EACA,aAAa,MAAM;AAAA,EAEnB,IAAI,QAAQ,KAAK,EAAE,SAAS,QAAQ;AAAA,IACnC,MAAM,QAAQ,WAAW;AAAA,IAEzB,cAAc;AAAA,IACd;AAAA,EACD;AAAA,EAEA,MAAM,SAAc,CAAC;AAAA,EACrB,YAAY,GAAG,MAAM,IAAI,gBAAgB,SAAS,MAAM,GAAG;AAAA,IAC1D,OAAO,KAAK;AAAA,EACb;AAAA,EAEA,MAAM,OAAO,SAAS;AAAA,EACtB,MAAM,IAAI,SAAS,SAAS,MAAM,CAAC,EAAE,MAAM,GAAG;AAAA,EAC9C,MAAM,SAAS;AAAA,EACf,MAAM,OAAO,SAAS;AAAA,EACtB,MAAM,KAAK,MAAM;AAAA,EACjB,MAAM,MAAM,MAAM;AAAA,EAClB,MAAM,QAAQ,WAAW;AAAA,EACzB,MAAM,MAAM;AAAA,EAGZ,IAAI;AAAA,IAAO,SAAS;AAAA;AAErB,qBAAqB;AACrB,OAAO,iBAAiB,YAAY,oBAAoB;AAMxD,SAAS,UAAU,GAAS;AAAA,EAC3B,IAAI,OAAO,MAAM;AAAA,EACjB,IAAI,QAAQ,QAAQ,QAAQ,KAAK,EAAE,GAAG;AAAA,IACrC,QAAQ;AAAA,IACR;AAAA,EACD;AAAA,EACA,OAAO,GAAG,QAAQ;AAAA,EAClB,KAAK,KAAK,WAAW,GAAG;AAAA,IAAG,OAAO,IAAI;AAAA,EACtC,MAAM,OAAO;AAAA,EACb,MAAM,IAAI,KAAK,MAAM,CAAC,EAAE,MAAM,GAAG;AAAA;AAElC,iBAAiB,UAAU;AAE3B,SAAS,OAAO,GAAG;AAAA,EAClB,MAAM,IAAI,MAAM;AAAA,EAChB,IAAI,KAAK,QAAQ,QAAQ,KAAK,EAAE,MAAM;AAAA,IACrC,WAAW;AAAA,IACX;AAAA,EACD;AAAA,EACA,MAAM,aAAa,QAAQ;AAAA,IAC1B,QAAQ,MACP,sDAAsD,KAAK,UAAU,CAAC,GACvE;AAAA,IACA,MAAM,IAAI,CAAC,EAAE;AAAA,EACd,EAAO,SAAI,EAAE,WAAW,GAAG;AAAA,IAC1B,MAAM,IAAI,CAAC,EAAE;AAAA,EACd,EAAO;AAAA,IACN,MAAM,OAAO,IAAI,EAAE,KAAK,GAAG;AAAA;AAAA;AAG7B,iBAAiB,OAAO;AAExB,iBAAiB,MAAM;AAAA,EACtB,KAAK,MAAM,UAAU,OAAO,MAAM,WAAW;AAAA,IAAU,MAAM,SAAS,CAAC;AAAA,CACvE;AAED,iBAAiB,MAAM;AAAA,EACtB,KAAK,MAAM,MAAM,OAAO,MAAM,OAAO;AAAA,IAAU,MAAM,KAAK,CAAC;AAAA,CAC3D;AAED,iBAAiB,MAAM;AAAA,EACtB,KAAK,MAAM,OAAO,OAAO,MAAM,QAAQ;AAAA,IAAU,MAAM,MAAM,CAAC;AAAA,CAC9D;AAED,iBAAiB,MAAM;AAAA,EACtB,IAAI,OAAO,GAAG,MAAM,QAAQ;AAAA,EAC5B,IAAI,SAAS,KAAK,WAAW,GAAG;AAAA,IAAG,OAAO,IAAI;AAAA,EAC9C,MAAM,OAAO;AAAA,CACb;AAED,SAAS,UAAU,CAAC,MAAc,OAAqB;AAAA,EACtD,OACC,SAAS,aAAa,QACtB,KAAK,UAAU,QAAQ,MAAM,MAAM,CAAC,CAAC,MAAM,KAAK,UAAU,MAAM,MAAM,CAAC,CAAC;AAAA;AAI1E,SAAS,aAAa,GAAG;AAAA,EAExB,IAAI,OAAO,MAAM;AAAA,EACjB,MAAM,QAAQ;AAAA,IACb,IAAI,MAAM,MAAM,EAAE;AAAA,IAClB,KAAK,MAAM,MAAM,GAAG;AAAA,IACpB,OAAO;AAAA,EACR;AAAA,EAGA,MAAM,OAAO,MAAM;AAAA,EAGnB,IAAI,SAAS,QAAQ;AAAA,IACpB,MAAM,MAAM;AAAA,IACZ,KAAK,WAAW,MAAM,KAAK,MAAM,QAAQ,MAAM,OAAO,SAAS,KAAK,GAAG;AAAA,MACtE,QAAQ,KAAK;AAAA,MACb;AAAA,IACD;AAAA,IACA,OAAO;AAAA,EAGR;AAAA,EAEA,IAAI;AAAA,IAAM,MAAM,OAAO;AAAA,EACvB,MAAM,SAAS,IAAI,gBAAgB,MAAM,MAAM,EAAE,SAAS;AAAA,EAC1D,MAAM,OAAO,SAAS,GAAG,QAAQ,WAAW,QAAQ,MAAM;AAAA,EAE1D,IAAI,SAAS,WAAY,SAAS,WAAW,MAAM,KAAK,GAAI;AAAA,IAC3D,WAAW;AAAA,IACX,QAAQ,UAAU,OAAO,IAAI,GAAG;AAAA,IAChC,MAAM,MAAM;AAAA,IACZ,MAAM,QAAQ,WAAW;AAAA,EAC1B,EAAO;AAAA,IAEN,QAAQ,aAAa,OAAO,IAAI,GAAG;AAAA;AAAA;AAKrC,QAAQ,aAAa;AAWd,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,KAAK,EAAE,IAAI,QAAQ;AAAA,EAC3C,IAAI,SAAS;AAAA,IACZ,OAAO,OAAO,IAAI,OAAO;AAAA,EAC1B;AAAA,EAEA,SAAS,QAAQ,GAAG;AAAA,IACnB,MAAM,OAAO;AAAA,IACb,KAAK,MAAM,IAAI;AAAA,MAAQ,MAAM,IAAI,SAAS,CAAC;AAAA,IAC3C,MAAM,IAAI,OAAO,QAAQ;AAAA,MACxB,WAAW,GAAG;AAAA,MACd,YAAY,GAAG;AAAA,IAChB;AAAA;AAAA;",
-  "debugId": "D9D83FC76589C40E64756E2164756E21",
+  "mappings": ";AAAA;AA6BA,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,aAAa,KAAK,OAAO,MAAM,aAAa;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,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,OAAO;AAAA,QAAG,OAAO;AAAA,IACzC;AAAA,EACD,EAAO;AAAA,IACN,WAAU,KAAK,OAAO,KAAK,CAAC,GAAG;AAAA,MAC9B,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,OAAO;AAAA,QAAG,OAAO;AAAA,IACzC;AAAA,IACA,KAAK,SAAS;AAAA,MACb,WAAU,KAAK,OAAO,KAAK,CAAC,GAAG;AAAA,QAC9B,KAAK,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,KAAK,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,QAA2B;AAAA,EAC7C,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,MAAM,UAAU,SAAS,CAAC;AAAA,EACxF,KAAK,SAAS,QAAQ;AAAA,EAEtB,IAAI,MAAM,QAAQ;AAAA,EAClB,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,SAAS,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": "A8B2D764F285F09564756E2164756E21",
   "names": []
 }

package/dist-min/aberdeen.js

@@ -1,7 +1,7 @@
-class Y{keyProp;tail;symbols;constructor(F){this.keyProp=F;this.tail={},this.symbols=[Symbol(0)]}add(F){if(this.symbols[0]in F)return!1;let J=1+(Math.clz32(Math.random()*4294967295)>>2);for(let q=this.symbols.length;q<J;q++)this.symbols.push(Symbol(q));let X=this.keyProp,z=F[X],U,W=this.tail;for(let q=this.symbols.length-1;q>=0;q--){let H=this.symbols[q];while((U=W[H])&&U[X]>z)W=U;if(q<J)F[H]=W[H],W[H]=F}return!0}has(F){return this.symbols[0]in F}fetchLast(){let F=this.tail[this.symbols[0]];if(F)return this.remove(F),F}isEmpty(){return this.tail[this.symbols[0]]===void 0}get(F){let J=this.keyProp,X,z=this.tail;for(let U=this.symbols.length-1;U>=0;U--){let W=this.symbols[U];while((X=z[W])&&X[J]>F)z=X}return z[this.symbols[0]]?.[J]===F?z[this.symbols[0]]:void 0}*[Symbol.iterator](){let F=this.symbols[0],J=this.tail[F];while(J)yield J,J=J[F]}prev(F){return F[this.symbols[0]]}remove(F){if(!(this.symbols[0]in F))return!1;let J=this.keyProp,X=F[J],z,U=this.tail;for(let W=this.symbols.length-1;W>=0;W--){let q=this.symbols[W];while((z=U[q])&&z[J]>=X&&z!==F)U=z;if(z===F)U[q]=z[q],delete z[q]}return z===F}clear(){let F=this.symbols[0],J=this.tail;while(J){let X=J[F];for(let z of this.symbols){if(!(z in J))break;delete J[z]}J=X}this.tail={}}}var B,L=0,V;function f(F){if(!B)B=new Y("prio"),setTimeout(CF,0);else if(!(L&1)){if(L++,L>98)throw new Error("Too many recursive updates from observes")}B.add(F)}function CF(){let F=Date.now();while(B){let J=B.fetchLast();if(!J)break;if(L&1)L++;J.queueRun()}if(B=void 0,L=0,F=Date.now()-F,F>9)console.debug(`Aberdeen queue took ${F}ms`)}function n(F){if(typeof F==="string")return`${F}\x01`;let J="",X=Math.abs(Math.round(F)),z=F<0;while(X>0)J=String.fromCharCode(z?65534-X%65533:2+X%65533)+J,X=Math.floor(X/65533);return String.fromCharCode(128+(z?-J.length:J.length))+J}function xF(F){let J="";for(let X=0;X<F.length;X++)J+=String.fromCodePoint(65535-F.charCodeAt(X));return J}var YF=0;class p{prio=--YF;remove(){let F=this.getLastNode();if(F)x(F,this.getPrecedingNode());this.delete()}}class T extends p{cleaners;inSvgNamespace=!1;constructor(F=[]){super();this.cleaners=F}lastChild;redraw(){}getLastNode(){return P(this.lastChild)}delete(){for(let F of this.cleaners)if(typeof F==="function")F();else F.delete(this);this.cleaners.length=0,B?.remove(this),this.lastChild=void 0}queueRun(){this.remove(),V=this,this.redraw(),V=void 0}getInsertAfterNode(){return this.getLastNode()||this.getPrecedingNode()}onChange(F,J,X){f(this)}getChildPrevSibling(){return this.lastChild}}class M extends T{parentElement;prevSibling;constructor(F,J=!1){super(J?Z.cleaners:[]);this.parentElement=F;if(this.inSvgNamespace=Z.inSvgNamespace,F===Z.parentElement)this.prevSibling=Z.getChildPrevSibling(),Z.lastChild=this;if(!J)Z.cleaners.push(this)}getPrecedingNode(){return P(this.prevSibling)}getChildPrevSibling(){return this.lastChild||this.prevSibling}}class k extends M{renderer;constructor(F,J){super(F);this.renderer=J;this.redraw()}redraw(){let F=Z;Z=this;try{this.renderer()}catch(J){s(J,!0)}Z=F}}class WF extends T{parentElement=document.body;getPrecedingNode(){return}}class qF extends T{parentElement;renderer;constructor(F,J){super();this.parentElement=F;this.renderer=J;this.inSvgNamespace=Z.inSvgNamespace,this.redraw(),Z.cleaners.push(this)}redraw(){k.prototype.redraw.call(this)}getPrecedingNode(){return}delete(){x(this.getLastNode(),this.getPrecedingNode()),super.delete()}remove(){this.delete()}}function x(F,J){while(F&&F!==J){let X=F.previousSibling,z=d.get(F);if(z&&F instanceof Element){if(z!==!0){if(typeof z==="function")z(F);else fF(F,z);d.set(F,!0)}}else F.remove();F=X}}function P(F){if(!F||F instanceof Node)return F;return F.getLastNode()||F.getPrecedingNode()}class ZF extends M{renderer;result=Q({value:void 0});constructor(F,J){super(F);this.renderer=J;this.redraw()}redraw(){let F=Z;Z=this;try{this.result.value=this.renderer()}catch(J){s(J,!0)}Z=F}}class $F extends M{key;target;constructor(F,J,X){super(F);this.key=J;this.target=X;this.redraw()}redraw(){let F=Z;Z=this,BF(this.key,this.target.value),Z=F}}var h=new Y("prio");class HF extends k{onChange(F,J,X){h.add(this)}}var i=!1;function I(){for(let F=0;!h.isEmpty()&&!i;F++){if(F>42)throw h.clear(),new Error("Too many immediate-mode recursive updates");i=!0;let J=h;h=new Y("prio");try{for(let X of J)X.queueRun()}finally{i=!1}}}class jF extends p{renderer;makeSortKey;parentElement=Z.parentElement;prevSibling;target;byIndex=new Map;sortedSet=new Y("sortKey");changedIndexes=new Set;constructor(F,J,X){super();this.renderer=J;this.makeSortKey=X;let z=this.target=F[$]||F;if(j(z,G,this),this.prevSibling=Z.getChildPrevSibling(),Z.lastChild=this,Z.cleaners.push(this),z instanceof Array){for(let U=0;U<z.length;U++)if(z[U]!==void 0)new w(this,U,!1)}else for(let[U,W]of NF(z))if(W!==void 0)new w(this,U,!1)}getPrecedingNode(){return P(this.prevSibling)}onChange(F,J,X){if(!(this.target instanceof Array)||typeof F==="number")this.changedIndexes.add(F);f(this)}queueRun(){let F=this.changedIndexes;this.changedIndexes=new Set;for(let J of F){let X=this.byIndex.get(J);if(X)X.remove();let z;if(this.target instanceof Map)z=this.target.has(J);else z=this.target[J]!==void 0;if(!z)this.byIndex.delete(J);else new w(this,J,!0)}V=void 0}delete(){for(let F of this.byIndex.values())F.delete();B?.remove(this),this.byIndex.clear(),setTimeout(()=>{this.sortedSet.clear()},1)}getLastNode(){for(let F of this.sortedSet){let J=F.getActualLastNode();if(J)return J}}}class w extends T{parent;itemIndex;sortKey;parentElement;constructor(F,J,X){super();this.parent=F;this.itemIndex=J;if(this.parentElement=F.parentElement,this.inSvgNamespace=Z.inSvgNamespace,this.parent.byIndex.set(this.itemIndex,this),this.lastChild=this,X)V=this;this.redraw()}getPrecedingNode(){this.parent.sortedSet.add(this);let F=this.parent.sortedSet.prev(this);if(F)return P(F.lastChild);return this.parent.getPrecedingNode()}getLastNode(){return this.getPrecedingNode()}getActualLastNode(){let F=this.lastChild;while(F&&F!==this){if(F instanceof Node)return F;let J=F.getLastNode();if(J)return J;F=F.getPrecedingNode()}}queueRun(){if(Z!==O)UF(4);if(this.sortKey!==void 0){let F=this.getActualLastNode();if(F)x(F,this.getPrecedingNode())}this.delete(),this.lastChild=this,V=this,this.redraw(),V=void 0}redraw(){let F,J=this.parent.target,X=this.itemIndex;if(J instanceof Map)F=Q(J.get(X)),X=Q(X);else F=Q(J[X]);let z=Z;Z=this;let U;try{if(this.parent.makeSortKey){let W=this.parent.makeSortKey(F,X);if(W!=null)U=W instanceof Array?W.map(n).join(""):W}else U=X;if(typeof U==="number")U=n(U);if(this.sortKey!==U)this.parent.sortedSet.remove(this),this.sortKey=U;if(U!=null)this.parent.renderer(F,X)}catch(W){s(W,U!=null)}Z=z}getInsertAfterNode(){if(this.sortKey==null)UF(1);return P(this.lastChild)}remove(){if(this.sortKey!==void 0){let F=this.getActualLastNode();if(F)x(F,this.getPrecedingNode());this.parent.sortedSet.remove(this),this.sortKey=void 0}this.delete()}}function A(F){let J=Z.parentElement,X=Z.getInsertAfterNode();J.insertBefore(F,X?X.nextSibling:J.firstChild),Z.lastChild=F}var O=new WF,Z=O,G=Symbol("any"),$=Symbol("target"),R=Symbol("mapSize"),g=new WeakMap,b=0;function j(F,J,X=Z){if(X===O||b)return;let z=g.get(F);if(!z)g.set(F,z=new Map);if(J!==G&&z.get(G)?.has(X))return;let U=z.get(J);if(!U)z.set(J,U=new Set);if(U.has(X))return;if(U.add(X),X===Z)Z.cleaners.push(U);else Z.cleaners.push(()=>{U.delete(X)})}function S(F,J,X){if(!F||typeof F!=="object")throw new Error("onEach requires an object");F=F[$]||F,new jF(F,J,X)}function KF(F){for(let J in F)return!1;return!0}function bF(F){let J=F[$]||F,X=Z;if(J instanceof Array)return j(J,"length",(U,W,q)=>{if(!W!==!q)f(X)}),!J.length;if(J instanceof Map)return j(J,R,(U,W,q)=>{if(!W!==!q)f(X)}),!J.size;let z=KF(J);return j(J,G,(U,W,q)=>{if(z?q===void 0:W===void 0)f(X)}),z}function vF(F){if(F instanceof Array)return c(F,"length");if(F instanceof Map)return c(F,"size");let J=F[$]||F,X=0;for(let U in J)if(J[U]!==void 0)X++;let z=QF(X);return j(J,G,(U,W,q)=>{if(q===W);else if(q===void 0)z.value=++X;else if(W===void 0)z.value=--X}),z}function _F(F,J,X,z){if(X===z&&X!==void 0)return;let U=g.get(F);if(U===void 0)return;for(let W of[J,G]){let q=U.get(W);if(q)for(let H of q)if(typeof H==="function")H(J,X,z);else H.onChange(J,X,z)}}var K=_F,LF={get(F,J){if(J===$)return F;return j(F,J),Q(F[J])},set(F,J,X){if(typeof X==="object"&&X)X=X[$]||X;let z=F[J];if(X!==z)F[J]=X,K(F,J,X,z),I();return!0},deleteProperty(F,J){let X=F[J];return delete F[J],K(F,J,void 0,X),I(),!0},has(F,J){let X=J in F;return j(F,J),X},ownKeys(F){return j(F,G),Reflect.ownKeys(F)}};function o(F,J,X){if(typeof X==="object"&&X)X=X[$]||X;let z=F[J];if(X!==z){let U=F.length;if(J==="length"){F.length=X;for(let W=X;W<U;W++)K(F,W,void 0,F[W])}else{let W=Number.parseInt(J);if(W.toString()===J)J=W;F[J]=X,K(F,J,X,z)}if(F.length!==U)K(F,"length",F.length,U);I()}return!0}var MF={get(F,J){if(J===$)return F;let X=J;if(typeof J!=="symbol"){let z=Number.parseInt(J);if(z.toString()===J)X=z}return j(F,X),Q(F[J])},set:o,deleteProperty(F,J){return o(F,J,void 0)}};function a(F){return{[Symbol.iterator](){return this},next(){let J=F.next();if(J.done)return J;return{done:!1,value:Q(J.value)}}}}function r(F){return{[Symbol.iterator](){return this},next(){let J=F.next();if(J.done)return J;return{done:!1,value:[Q(J.value[0]),Q(J.value[1])]}}}}var t={get(F){let J=this[$];if(typeof F==="object"&&F)F=F[$]||F;return j(J,F),Q(J.get(F))},set(F,J){let X=this[$];if(typeof F==="object"&&F)F=F[$]||F;if(typeof J==="object"&&J)J=J[$]||J;let z=X.get(F);if(J!==z){let U=X.size;X.set(F,J),K(X,F,J,z),K(X,R,X.size,U),I()}return this},delete(F){let J=this[$];if(typeof F==="object"&&F)F=F[$]||F;let X=J.get(F),z=J.delete(F);if(z)K(J,F,void 0,X),K(J,R,J.size,J.size+1),I();return z},clear(){let F=this[$],J=F.size;for(let X of F.keys()){let z=F.get(X);K(F,X,void 0,z)}F.clear(),K(F,R,0,J),I()},has(F){let J=this[$];if(typeof F==="object"&&F)F=F[$]||F;return j(J,F),J.has(F)},keys(){let F=this[$];return j(F,G),a(F.keys())},values(){let F=this[$];return j(F,G),a(F.values())},entries(){let F=this[$];return j(F,G),r(F.entries())},[Symbol.iterator](){let F=this[$];return j(F,G),r(F[Symbol.iterator]())}},hF={get(F,J){if(J===$)return F;if(J in t)return t[J];if(J==="size")return j(F,R),F.size;return j(F,J),Q(F[J])}},e=new WeakMap;function Q(F){if(typeof F!=="object"||!F||F[$]!==void 0)return F;let J=e.get(F);if(J)return J;let X;if(F instanceof Array)X=MF;else if(F instanceof Map)X=hF;else X=LF;return J=new Proxy(F,X),e.set(F,J),J}function QF(F){return Q(typeof F==="object"&&F!==null?F:{value:F})}function GF(F){return F?F[$]||F:F}var d=new WeakMap;function fF(F,J){let X=J.split(".").filter((z)=>z);F.classList.add(...X),setTimeout(()=>F.remove(),2000)}function mF(F,J,X=0){m(F,J,X),I()}var D=1,RF=2,FF=32,v=64;function kF(F,J=0){let X;if(F instanceof Map)X=new Map;else X=Object.create(Object.getPrototypeOf(F));return m(X,F,J),X}function NF(F){return F instanceof Map?F.entries():Object.entries(F)}function JF(F){return F instanceof Map?F.keys():Object.keys(F)}function m(F,J,X){let z=F[$];if(z)F=z,X|=v;if(z=J[$],z){if(J=z,Z!==O&&!b)X|=FF}if(X&FF)j(J,G);if(J instanceof Array){if(!(F instanceof Array))throw new Error("Cannot copy array into object");let U=F.length,W=J.length;for(let q=0;q<W;q++)zF(F,q,J[q],X);if(W!==U)if(X&v){for(let q=W;q<U;q++){let H=F[q];F[q]=void 0,K(F,q,void 0,H)}F.length=W,K(F,"length",W,U)}else F.length=W}else{for(let[U,W]of NF(J))zF(F,U,W,X);if(!(X&D)){if(J instanceof Map){for(let U of JF(F))if(!J.has(U))XF(F,U,X)}else for(let U of JF(F))if(!(U in J))XF(F,U,X)}}}function XF(F,J,X){let z;if(F instanceof Map)z=F.get(J),F.delete(J);else z=F[J],delete F[J];if(X&v&&z!==void 0)K(F,J,void 0,z)}function zF(F,J,X,z){let U=F instanceof Map?F.get(J):F[J];if(X!==U){if(X&&U&&typeof X==="object"&&typeof U==="object"&&(X.constructor===U.constructor||z&D&&U instanceof Array)){m(U,X,z);return}if(!(z&RF)&&X&&typeof X==="object"){let W=Object.create(Object.getPrototypeOf(X));m(W,X,0),X=W}if(F instanceof Map)if(z&D&&X==null)F.delete(J);else F.set(J,X);else if(z&D&&X==null)delete F[J];else F[J]=X;if(z&v)K(F,J,X,U)}}var PF={get(F,J){if(J===$)return c(GF(F.proxy),F.index);if(J==="value")return F.proxy[F.index]},set(F,J,X){if(J==="value")return F.proxy[F.index]=X,!0;return!1}};function c(F,J){return new Proxy({proxy:F,index:J},PF)}function TF(F,J){let X,z,U=F.getAttribute("type"),W=GF(J).value;if(U==="checkbox"){if(W===void 0)J.value=F.checked;X=()=>{F.checked=J.value},z=()=>{J.value=F.checked}}else if(U==="radio"){if(W===void 0&&F.checked)J.value=F.value;X=()=>{F.checked=J.value===F.value},z=()=>{if(F.checked)J.value=F.value}}else{if(z=()=>{J.value=U==="number"||U==="range"?F.value===""?null:+F.value:F.value},W===void 0)z();X=()=>{if(F.value=J.value,F.tagName==="SELECT"&&F.value!=J.value)throw new Error(`SELECT has no '${J.value}' OPTION (yet)`)}}OF(X),F.addEventListener("input",z),C(()=>{F.removeEventListener("input",z)})}var l={create:(F)=>{let J=Z.parentElement;if(Z!==V)return;if(typeof F==="function")F(J);else{let X=F.split(".").filter((z)=>z);J.classList.add(...X),(async()=>{J.offsetHeight,J.classList.remove(...X)})()}},destroy:(F)=>{let J=Z.parentElement;d.set(J,F)},html:(F)=>{let J=document.createElement(Z.parentElement.tagName);J.innerHTML=`${F}`;while(J.firstChild)A(J.firstChild)},text:(F)=>{A(document.createTextNode(F))},element:(F)=>{console.log("Aberdeen: $({element: myElement}) is deprecated, use $(myElement) instead"),A(F),l.element=A}};function _(...F){let J,X,z;for(let U of F){if(U==null||U===!1)continue;if(typeof U==="string"){let W,q,H=U.indexOf(":");if(H>=0)W=U.substring(H+1),U=U.substring(0,H);let N=U.indexOf(".");if(N>=0)q=U.substring(N+1),U=U.substring(0,N);if(U===""){if(W)A(document.createTextNode(W));if(q){let y=Z.parentElement;if(y.classList.add(...q.split(".")),!J)C(()=>y.classList.remove(...q.split(".")))}}else if(U.indexOf(" ")>=0){X=`Tag '${U}' cannot contain space`;break}else{if(Z.inSvgNamespace||U==="svg")z=document.createElementNS("http://www.w3.org/2000/svg",U);else z=document.createElement(U);if(q)z.className=q.replaceAll("."," ");if(W)z.textContent=W;if(A(z),!J)J=Z;let E=new M(z,!0);if(U==="svg")E.inSvgNamespace=!0;if(E.lastChild=z.lastChild||void 0,V===Z)V=E;Z=E}}else if(typeof U==="object")if(U.constructor!==Object)if(U instanceof Node){if(A(U),U instanceof Element){if(!J)J=Z;Z=new M(U,!0),Z.lastChild=U.lastChild||void 0}}else{X=`Unexpected argument: ${U}`;break}else for(let W in U){let q=U[W];BF(W,q)}else if(typeof U==="function")new k(Z.parentElement,U);else{X=`Unexpected argument: ${U}`;break}}if(J)Z=J;if(X)throw new Error(X);return z}var VF=0;function SF(F,J=!1){let X=J?"":`.AbdStl${++VF}`,z=u(F,X);if(z)_(`style:${z}`);return X}function u(F,J){let X="",z="";for(let U in F){let W=F[U];for(let q of U.split(/, ?/g))if(W&&typeof W==="object")if(q.startsWith("@"))z+=`${q}{
-${u(W,J)}}
-`;else z+=u(W,q.includes("&")?q.replace(/&/g,J):`${J} ${q}`);else X+=`${q.replace(/[A-Z]/g,(H)=>`-${H.toLowerCase()}`)}:${W};`}if(X)z=`${J.trimStart()||"*"}{${X}}
-${z}`;return z}function BF(F,J){let X=Z.parentElement;if(typeof J==="object"&&J!==null&&J[$])if(F==="bind")TF(X,J);else new $F(X,F,J);else if(F[0]==="."){let z=F.substring(1).split(".");if(J)X.classList.add(...z);else X.classList.remove(...z)}else if(F[0]==="$"){let z=F.substring(1);if(J==null||J===!1)X.style[z]="";else X.style[z]=`${J}`}else if(J==null);else if(F in l)l[F](J);else if(typeof J==="function")X.addEventListener(F,J),C(()=>X.removeEventListener(F,J));else if(J===!0||J===!1||F==="value"||F==="selectedIndex")X[F]=J;else X.setAttribute(F,J)}function AF(F){return console.error("Error while in Aberdeen render:",F),!0}var IF=AF;function yF(F){IF=F||AF}function iF(){return Z.parentElement}function C(F){Z.cleaners.push(F)}function OF(F){return new ZF(Z.parentElement,F).result}function gF(F){new HF(Z.parentElement,F)}function dF(F,J){new qF(F,J)}function cF(){O.remove(),VF=0}function lF(F){b++;try{return F()}finally{b--}}function uF(F,J){let X;if(F instanceof Array)X=Q([]);else if(F instanceof Map)X=Q(new Map);else X=Q({});return S(F,(z,U)=>{let W=J(z,U);if(W!==void 0)if(X instanceof Map)X.set(U,W),C(()=>{X.delete(U)});else X[U]=W,C(()=>{delete X[U]})}),X}function pF(F,J){let X=Q({});return S(F,(z,U)=>{let W=J(z,U);if(W){for(let q in W)X[q]=W[q];C(()=>{for(let q in W)delete X[q]})}}),X}function sF(F,J){let X={},z=QF(X);return S(F,(U,W)=>{let q=J(U,W);if(q!=null){let H=q instanceof Array?q:[q];if(H.length){for(let N of H)if(X[N])z[N][W]=U;else z[N]={[W]:U};C(()=>{for(let N of H)if(delete z[N][W],KF(X[N]))delete z[N]})}}}),z}function EF(F){if(F&&typeof F==="object"){let J;if(F instanceof Array)J="<array>";else if(F instanceof Map)J="<Map>";else J="<object>";_({text:J}),_("ul",()=>{S(F,(X,z)=>{_(`li:${JSON.stringify(z)}: `,()=>{EF(X)})})})}else _({text:JSON.stringify(F)});return F}function UF(F){throw new Error(`Aberdeen internal error ${F}`)}function s(F,J){try{if(IF(F)===!1)J=!1}catch(X){console.error(X)}try{if(J)_("div.aberdeen-error:Error")}catch{}}function nF(F,J){let X=K;K=F;try{J()}finally{K=X}}export{nF as withEmitHandler,GF as unproxy,cF as unmountAll,yF as setErrorHandler,CF as runQueue,c as ref,QF as proxy,lF as peek,sF as partition,S as onEach,OF as observe,pF as multiMap,dF as mount,uF as map,bF as isEmpty,xF as invertString,SF as insertCss,gF as immediateObserve,iF as getParentElement,EF as dump,_F as defaultEmitHandler,vF as count,mF as copy,kF as clone,C as clean,RF as SHALLOW,D as MERGE,_ as $};
+class x{keyProp;tail;symbols;constructor(F){this.keyProp=F;this.tail={},this.symbols=[Symbol(0)]}add(F){if(this.symbols[0]in F)return!1;let J=1+(Math.clz32(Math.random()*4294967295)>>2);for(let q=this.symbols.length;q<J;q++)this.symbols.push(Symbol(q));let X=this.keyProp,W=F[X],z,U=this.tail;for(let q=this.symbols.length-1;q>=0;q--){let j=this.symbols[q];while((z=U[j])&&z[X]>W)U=z;if(q<J)F[j]=U[j],U[j]=F}return!0}has(F){return this.symbols[0]in F}fetchLast(){let F=this.tail[this.symbols[0]];if(F)return this.remove(F),F}isEmpty(){return this.tail[this.symbols[0]]===void 0}get(F){let J=this.keyProp,X,W=this.tail;for(let z=this.symbols.length-1;z>=0;z--){let U=this.symbols[z];while((X=W[U])&&X[J]>F)W=X}return W[this.symbols[0]]?.[J]===F?W[this.symbols[0]]:void 0}*[Symbol.iterator](){let F=this.symbols[0],J=this.tail[F];while(J)yield J,J=J[F]}prev(F){return F[this.symbols[0]]}remove(F){if(!(this.symbols[0]in F))return!1;let J=this.keyProp,X=F[J],W,z=this.tail;for(let U=this.symbols.length-1;U>=0;U--){let q=this.symbols[U];while((W=z[q])&&W[J]>=X&&W!==F)z=W;if(W===F)z[q]=W[q],delete W[q]}return W===F}clear(){let F=this.symbols[0],J=this.tail;while(J){let X=J[F];for(let W of this.symbols){if(!(W in J))break;delete J[W]}J=X}this.tail={}}}var C,R=0,I;function Y(F){if(!C)C=new x("prio"),setTimeout(GF,0);else if(!(R&1)){if(R++,R>98)throw new Error("Too many recursive updates from observes")}C.add(F)}function GF(){let F=Date.now();while(C){let J=C.fetchLast();if(!J)break;if(R&1)R++;J.queueRun()}if(C=void 0,R=0,F=Date.now()-F,F>9)console.debug(`Aberdeen queue took ${F}ms`)}function n(F){if(typeof F==="string")return`${F}\x01`;let J="",X=Math.abs(Math.round(F)),W=F<0;while(X>0)J=String.fromCharCode(W?65534-X%65533:2+X%65533)+J,X=Math.floor(X/65533);return String.fromCharCode(128+(W?-J.length:J.length))+J}function MF(F){let J="";for(let X=0;X<F.length;X++)J+=String.fromCodePoint(65535-F.charCodeAt(X));return J}var NF=0;class d{prio=--NF;remove(){let F=this.getLastNode();if(F)v(F,this.getPrecedingNode());this.delete()}}class D extends d{cleaners;inSvgNamespace=!1;constructor(F=[]){super();this.cleaners=F}lastChild;redraw(){}getLastNode(){return w(this.lastChild)}delete(){for(let F of this.cleaners)if(typeof F==="function")F();else F.delete(this);this.cleaners.length=0,C?.remove(this),this.lastChild=void 0}queueRun(){this.remove(),I=this,this.redraw(),I=void 0}getInsertAfterNode(){return this.getLastNode()||this.getPrecedingNode()}onChange(){Y(this)}getChildPrevSibling(){return this.lastChild}}class h extends D{parentElement;prevSibling;constructor(F,J=!1){super(J?Z.cleaners:[]);this.parentElement=F;if(this.inSvgNamespace=Z.inSvgNamespace,F===Z.parentElement)this.prevSibling=Z.getChildPrevSibling(),Z.lastChild=this;if(!J)Z.cleaners.push(this)}getPrecedingNode(){return w(this.prevSibling)}getChildPrevSibling(){return this.lastChild||this.prevSibling}}class c extends h{renderer;constructor(F,J){super(F);this.renderer=J;this.redraw()}redraw(){let F=Z;Z=this;try{this.renderer()}catch(J){p(J,!0)}Z=F}}class l extends D{parentElement=document.body;getPrecedingNode(){return}}class JF extends D{parentElement;renderer;constructor(F,J){super();this.parentElement=F;this.renderer=J;this.inSvgNamespace=Z.inSvgNamespace,this.redraw(),Z.cleaners.push(this)}redraw(){c.prototype.redraw.call(this)}getPrecedingNode(){return}delete(){v(this.getLastNode(),this.getPrecedingNode()),super.delete()}remove(){this.delete()}}function v(F,J){while(F&&F!==J){let X=F.previousSibling,W=i.get(F);if(W&&F instanceof Element){if(W!==!0){if(typeof W==="function")W(F);else LF(F,W);i.set(F,!0)}}else F.remove();F=X}}function w(F){if(!F||F instanceof Node)return F;return F.getLastNode()||F.getPrecedingNode()}class XF extends h{renderer;result=N({value:void 0});constructor(F,J){super(F);this.renderer=J;this.redraw()}redraw(){let F=Z;Z=this;try{this.result.value=this.renderer()}catch(J){p(J,!0)}Z=F}}class WF extends h{key;target;constructor(F,J,X){super(F);this.key=J;this.target=X;this.redraw()}redraw(){let F=Z;Z=this,HF(this.key,this.target.value),Z=F}}class zF extends d{renderer;makeSortKey;parentElement=Z.parentElement;prevSibling;target;byIndex=new Map;sortedSet=new x("sortKey");changedIndexes=new Set;constructor(F,J,X){super();this.renderer=J;this.makeSortKey=X;let W=this.target=F[$]||F;if(G(W,A,this),this.prevSibling=Z.getChildPrevSibling(),Z.lastChild=this,Z.cleaners.push(this),W instanceof Array)for(let z=0;z<W.length;z++)new m(this,z,!1);else for(let z of W instanceof Map?W.keys():Object.keys(W))new m(this,z,!1)}getPrecedingNode(){return w(this.prevSibling)}onChange(F){if(!(this.target instanceof Array)||typeof F==="number")this.changedIndexes.add(F);Y(this)}queueRun(){let F=this.changedIndexes;this.changedIndexes=new Set;for(let J of F){let X=this.byIndex.get(J);if(X)X.remove();if(this.target instanceof Map?this.target.has(J):(J in this.target))new m(this,J,!0);else this.byIndex.delete(J)}I=void 0}delete(){for(let F of this.byIndex.values())F.delete();C?.remove(this),this.byIndex.clear(),setTimeout(()=>{this.sortedSet.clear()},1)}getLastNode(){for(let F of this.sortedSet){let J=F.getActualLastNode();if(J)return J}}}class m extends D{parent;itemIndex;sortKey;parentElement;constructor(F,J,X){super();this.parent=F;this.itemIndex=J;if(this.parentElement=F.parentElement,this.inSvgNamespace=Z.inSvgNamespace,this.parent.byIndex.set(this.itemIndex,this),this.lastChild=this,X)I=this;this.redraw()}getPrecedingNode(){this.parent.sortedSet.add(this);let F=this.parent.sortedSet.prev(this);if(F)return w(F.lastChild);return this.parent.getPrecedingNode()}getLastNode(){return this.getPrecedingNode()}getActualLastNode(){let F=this.lastChild;while(F&&F!==this){if(F instanceof Node)return F;let J=F.getLastNode();if(J)return J;F=F.getPrecedingNode()}}queueRun(){if(Z!==E)FF(4);if(this.sortKey!==void 0){let F=this.getActualLastNode();if(F)v(F,this.getPrecedingNode())}this.delete(),this.lastChild=this,I=this,this.redraw(),I=void 0}redraw(){let F,J=this.parent.target,X=this.itemIndex;if(J instanceof Map)F=N(J.get(X)),X=N(X);else F=N(J[X]);let W=Z;Z=this;let z;try{if(this.parent.makeSortKey){let U=this.parent.makeSortKey(F,X);if(U!=null)z=U instanceof Array?U.map(n).join(""):U}else z=X;if(typeof z==="number")z=n(z);if(this.sortKey!==z)this.parent.sortedSet.remove(this),this.sortKey=z;if(z!=null)this.parent.renderer(F,X)}catch(U){p(U,z!=null)}Z=W}getInsertAfterNode(){if(this.sortKey==null)FF(1);return w(this.lastChild)}remove(){if(this.sortKey!==void 0){let F=this.getActualLastNode();if(F)v(F,this.getPrecedingNode());this.parent.sortedSet.remove(this),this.sortKey=void 0}this.delete()}}function P(F){let J=Z.parentElement,X=Z.getInsertAfterNode();J.insertBefore(F,X?X.nextSibling:J.firstChild),Z.lastChild=F}var E=new l,Z=E;function wF(F){let J=Z;Z=new l;try{return F()}finally{Z=J}}var A=Symbol("any"),$=Symbol("target"),O=Symbol("mapSize"),y=new WeakMap,k=0;function G(F,J,X=Z){if(X===E||k)return;let W=y.get(F);if(!W)y.set(F,W=new Map);if(J!==A&&W.get(A)?.has(X))return;let z=W.get(J);if(!z)W.set(J,z=new Set);if(z.has(X))return;if(z.add(X),X===Z)Z.cleaners.push(z);else Z.cleaners.push(()=>{z.delete(X)})}function S(F,J,X){if(!F||typeof F!=="object")throw new Error("onEach requires an object");F=F[$]||F,new zF(F,J,X)}function UF(F){for(let J of Object.keys(F))return!1;return!0}var K=Symbol("empty");function TF(F){let J=F[$]||F,X=Z;if(J instanceof Array)return G(J,"length",(z,U,q)=>{if(!U!==!q)Y(X)}),!J.length;if(J instanceof Map)return G(J,O,(z,U,q)=>{if(!U!==!q)Y(X)}),!J.size;let W=UF(J);return G(J,A,(z,U,q)=>{if(W?q===K:U===K)Y(X)}),W}function DF(F){if(F instanceof Array)return g(F,"length");if(F instanceof Map)return g(F,"size");let J=F[$]||F,X=0;for(let z of Object.keys(J))if(J[z]!==void 0)X++;let W=qF(X);return G(J,A,(z,U,q)=>{if(q===U);else if(q===K)W.value=++X;else if(U===K)W.value=--X}),W}function BF(F,J,X,W){if(X===W&&X!==void 0)return;let z=y.get(F);if(z===void 0)return;for(let U of[J,A]){let q=z.get(U);if(q)for(let j of q)if(typeof j==="function")j(J,X,W);else j.onChange(J)}}var Q=BF,AF={get(F,J){if(J===$)return F;return G(F,J),N(F[J])},set(F,J,X){if(typeof X==="object"&&X)X=X[$]||X;let W=F.hasOwnProperty(J)?F[J]:K;if(X!==W)F[J]=X,Q(F,J,X,W);return!0},deleteProperty(F,J){let X=F.hasOwnProperty(J)?F[J]:void 0;return delete F[J],Q(F,J,K,X),!0},has(F,J){return G(F,J),F.hasOwnProperty(J)},ownKeys(F){return G(F,A),Reflect.ownKeys(F)}};function IF(F,J,X){if(typeof X==="object"&&X)X=X[$]||X;let W=F[J];if(W===void 0&&!F.hasOwnProperty(J))W=K;if(X!==W){let z=F.length;if(J==="length"){F.length=X;for(let U=X;U<z;U++)Q(F,U,K,F[U])}else{if(typeof J==="string"){let U=0|J;if(String(U)===J&&U>=0)J=U}F[J]=X,Q(F,J,X,W)}if(F.length!==z)Q(F,"length",F.length,z)}return!0}var VF={get(F,J){if(J===$)return F;if(typeof J==="string"){let X=0|J;if(String(X)===J&&X>=0)J=X}return G(F,J),N(F[J])},set:IF,deleteProperty(F,J){if(typeof J==="string"){let W=0|J;if(String(W)===J&&W>=0)J=W}let X=F[J];if(X===void 0&&!F.hasOwnProperty(J))X=K;return delete F[J],Q(F,J,K,X),!0}};function s(F){return{[Symbol.iterator](){return this},next(){let J=F.next();if(J.done)return J;return{done:!1,value:N(J.value)}}}}function o(F){return{[Symbol.iterator](){return this},next(){let J=F.next();if(J.done)return J;return{done:!1,value:[N(J.value[0]),N(J.value[1])]}}}}var a={get(F){let J=this[$];if(typeof F==="object"&&F)F=F[$]||F;return G(J,F),N(J.get(F))},set(F,J){let X=this[$];if(typeof F==="object"&&F)F=F[$]||F;if(typeof J==="object"&&J)J=J[$]||J;let W=X.get(F);if(W===void 0&&!X.has(F))W=K;if(J!==W){let z=X.size;X.set(F,J),Q(X,F,J,W),Q(X,O,X.size,z)}return this},delete(F){let J=this[$];if(typeof F==="object"&&F)F=F[$]||F;let X=J.get(F);if(X===void 0&&!J.has(F))X=K;let W=J.delete(F);if(W)Q(J,F,K,X),Q(J,O,J.size,J.size+1);return W},clear(){let F=this[$],J=F.size;for(let X of F.keys())Q(F,X,void 0,F.get(X));F.clear(),Q(F,O,0,J)},has(F){let J=this[$];if(typeof F==="object"&&F)F=F[$]||F;return G(J,F),J.has(F)},keys(){let F=this[$];return G(F,A),s(F.keys())},values(){let F=this[$];return G(F,A),s(F.values())},entries(){let F=this[$];return G(F,A),o(F.entries())},[Symbol.iterator](){let F=this[$];return G(F,A),o(F[Symbol.iterator]())}},CF={get(F,J){if(J===$)return F;if(a.hasOwnProperty(J))return a[J];if(J==="size")return G(F,O),F.size;return F[J]}},r=new WeakMap;function N(F){if(typeof F!=="object"||!F||F[$]!==void 0)return F;let J=r.get(F);if(J)return J;let X;if(F instanceof Array)X=VF;else if(F instanceof Map)X=CF;else X=AF;return J=new Proxy(F,X),r.set(F,J),J}function qF(F){return N(typeof F==="object"&&F!==null?F:{value:F})}function ZF(F){return F?F[$]||F:F}var i=new WeakMap;function LF(F,J){let X=J.split(".").filter((W)=>W);F.classList.add(...X),setTimeout(()=>F.remove(),2000)}function EF(F,J,X){if(arguments.length>2)return jF(F,J,X,0);return L(F,J,0)}function jF(F,J,X,W){let z=hF(F,J);if(X===z)return!1;if(typeof z==="object"&&z&&typeof X==="object"&&X&&z.constructor===X.constructor)return L(z,X,W);if(X=M(X),F instanceof Map)F.set(J,X);else F[J]=M(X);return!0}function bF(F,J,X){if(arguments.length>2)return jF(F,J,X,T);return L(F,J,T)}function L(F,J,X){let W=F[$];if(W)F=W,X|=V;if(W=J[$],W){if(J=W,Z!==E&&!k)X|=t}if(X&t)G(J,A);let z=!1;if(J instanceof Array&&F instanceof Array){let U=F.length,q=J.length;for(let j=0;j<q;j++){let H=F[j];if(H===void 0&&!F.hasOwnProperty(j))H=K;let B=J[j];if(B===void 0&&!J.hasOwnProperty(j)){if(delete F[j],X&V)Q(F,j,K,H);z=!0}else if(H!==B){if(B&&typeof B==="object"){if(typeof H==="object"&&H&&B.constructor===H.constructor){z=L(H,B,X)||z;continue}B=M(B)}if(F[j]=B,X&V)Q(F,j,B,H);z=!0}}if(q!==U){if(X&V){for(let j=q;j<U;j++){let H=F[j];delete F[j],Q(F,j,K,H)}F.length=q,Q(F,"length",q,U)}else F.length=q;z=!0}}else if(J instanceof Map&&F instanceof Map){for(let U of J.keys()){let q=J.get(U),j=F.get(U);if(j===void 0&&!F.has(U))j=K;if(j!==q){if(q&&typeof q==="object"){if(typeof j==="object"&&j&&q.constructor===j.constructor){z=L(j,q,X)||z;continue}q=M(q)}if(F.set(U,q),X&V)Q(F,U,q,j);z=!0}}if(!(X&T)){for(let U of F.keys())if(!J.has(U)){let q=F.get(U);if(F.delete(U),X&V)Q(F,U,void 0,q);z=!0}}}else if(J.constructor===F.constructor){for(let U of Object.keys(J)){let q=J[U],j=F.hasOwnProperty(U)?F[U]:K;if(j!==q){if(q&&typeof q==="object"){if(typeof j==="object"&&j&&q.constructor===j.constructor){z=L(j,q,X)||z;continue}q=M(q)}if(F[U]=q,X&V)Q(F,U,q,j);z=!0}}if(!(X&T)){for(let U of Object.keys(F))if(!J.hasOwnProperty(U)){let q=F[U];if(delete F[U],X&V&&q!==void 0)Q(F,U,void 0,q);z=!0}}}else throw new Error(`Incompatible or non-object types: ${J?.constructor?.name||typeof J} vs ${F?.constructor?.name||typeof F}`);return z}var T=1,t=32,V=64;function M(F){let J=Array.isArray(F)?[]:F instanceof Map?new Map:Object.create(Object.getPrototypeOf(F));return L(J,F,T),J}var _F={get(F,J){if(J===$)return g(ZF(F.proxy),F.index);if(J==="value")return F.proxy[F.index]},set(F,J,X){if(J==="value")return F.proxy[F.index]=X,!0;return!1}};function g(F,J){return new Proxy({proxy:F,index:J},_F)}function fF(F,J){let X,W,z=F.getAttribute("type"),U=ZF(J).value;if(z==="checkbox"){if(U===void 0)J.value=F.checked;X=()=>{F.checked=J.value},W=()=>{J.value=F.checked}}else if(z==="radio"){if(U===void 0&&F.checked)J.value=F.value;X=()=>{F.checked=J.value===F.value},W=()=>{if(F.checked)J.value=F.value}}else{if(W=()=>{J.value=z==="number"||z==="range"?F.value===""?null:+F.value:F.value},U===void 0)W();X=()=>{if(F.value=J.value,F.tagName==="SELECT"&&F.value!=J.value)throw new Error(`SELECT has no '${J.value}' OPTION (yet)`)}}RF(X),F.addEventListener("input",W),_(()=>{F.removeEventListener("input",W)})}var e={create:(F)=>{let J=Z.parentElement;if(Z!==I)return;if(typeof F==="function")F(J);else{let X=F.split(".").filter((W)=>W);J.classList.add(...X),(async()=>{J.offsetHeight,J.classList.remove(...X)})()}},destroy:(F)=>{let J=Z.parentElement;i.set(J,F)},html:(F)=>{let J=document.createElement(Z.parentElement.tagName);J.innerHTML=`${F}`;while(J.firstChild)P(J.firstChild)},text:(F)=>{P(document.createTextNode(F))}};function f(...F){let J,X,W;for(let z of F){if(z==null||z===!1)continue;if(typeof z==="string"){let U,q,j=z.indexOf(":");if(j>=0)U=z.substring(j+1),z=z.substring(0,j);let H=z.indexOf(".");if(H>=0)q=z.substring(H+1),z=z.substring(0,H);if(z===""){if(U)P(document.createTextNode(U));if(q){let B=Z.parentElement;if(B.classList.add(...q.split(".")),!J)_(()=>B.classList.remove(...q.split(".")))}}else if(z.indexOf(" ")>=0){X=`Tag '${z}' cannot contain space`;break}else{if(Z.inSvgNamespace||z==="svg")W=document.createElementNS("http://www.w3.org/2000/svg",z);else W=document.createElement(z);if(q)W.className=q.replaceAll("."," ");if(U)W.textContent=U;if(P(W),!J)J=Z;let b=new h(W,!0);if(z==="svg")b.inSvgNamespace=!0;if(b.lastChild=W.lastChild||void 0,I===Z)I=b;Z=b}}else if(typeof z==="object")if(z.constructor!==Object)if(z instanceof Node){if(P(z),z instanceof Element){if(!J)J=Z;Z=new h(z,!0),Z.lastChild=z.lastChild||void 0}}else{X=`Unexpected argument: ${z}`;break}else for(let U of Object.keys(z)){let q=z[U];HF(U,q)}else if(typeof z==="function")new c(Z.parentElement,z);else{X=`Unexpected argument: ${z}`;break}}if(J)Z=J;if(X)throw new Error(X);return W}var $F=0;function xF(F,J=!1){let X=J?"":`.AbdStl${++$F}`,W=u(F,X);if(W)f(`style:${W}`);return X}function u(F,J){let X="",W="";for(let z of Object.keys(F)){let U=F[z];for(let q of z.split(/, ?/g))if(U&&typeof U==="object")if(q.startsWith("@"))W+=`${q}{
+${u(U,J)}}
+`;else W+=u(U,q.includes("&")?q.replace(/&/g,J):`${J} ${q}`);else X+=`${q.replace(/[A-Z]/g,(j)=>`-${j.toLowerCase()}`)}:${U};`}if(X)W=`${J.trimStart()||"*"}{${X}}
+${W}`;return W}function HF(F,J){let X=Z.parentElement;if(typeof J==="object"&&J!==null&&J[$])if(F==="bind")fF(X,J);else new WF(X,F,J);else if(F[0]==="."){let W=F.substring(1).split(".");if(J)X.classList.add(...W);else X.classList.remove(...W)}else if(F[0]==="$"){let W=F.substring(1);if(J==null||J===!1)X.style[W]="";else X.style[W]=`${J}`}else if(J==null);else if(F in e)e[F](J);else if(typeof J==="function")X.addEventListener(F,J),_(()=>X.removeEventListener(F,J));else if(J===!0||J===!1||F==="value"||F==="selectedIndex")X[F]=J;else X.setAttribute(F,J)}function QF(F){return console.error("Error while in Aberdeen render:",F),!0}var KF=QF;function mF(F){KF=F||QF}function vF(){return Z.parentElement}function _(F){Z.cleaners.push(F)}function RF(F){return new XF(Z.parentElement,F).result}function kF(F,J){new JF(F,J)}function SF(){E.remove(),$F=0}function hF(F,J){k++;try{if(arguments.length===1)return F();else return F instanceof Map?F.get(J):F[J]}finally{k--}}function yF(F,J){let X;if(F instanceof Array)X=N([]);else if(F instanceof Map)X=N(new Map);else X=N({});return S(F,(W,z)=>{let U=J(W,z);if(U!==void 0)if(X instanceof Map)X.set(z,U),_(()=>{X.delete(z)});else X[z]=U,_(()=>{delete X[z]})}),X}function iF(F,J){let X=N({});return S(F,(W,z)=>{let U=J(W,z);if(U){for(let q of Object.keys(U))X[q]=U[q];_(()=>{for(let q of Object.keys(U))delete X[q]})}}),X}function gF(F,J){let X={},W=qF(X);return S(F,(z,U)=>{let q=J(z,U);if(q!=null){let j=q instanceof Array?q:[q];if(j.length){for(let H of j)if(X[H])W[H][U]=z;else W[H]={[U]:z};_(()=>{for(let H of j)if(delete W[H][U],UF(X[H]))delete W[H]})}}}),W}function YF(F){if(F&&typeof F==="object"){let J;if(F instanceof Array)J="<array>";else if(F instanceof Map)J="<Map>";else J="<object>";f({text:J}),f("ul",()=>{S(F,(X,W)=>{f(`li:${JSON.stringify(W)}: `,()=>{YF(X)})})})}else f({text:JSON.stringify(F)});return F}function FF(F){throw new Error(`Aberdeen internal error ${F}`)}function p(F,J){try{if(KF(F)===!1)J=!1}catch(X){console.error(X)}try{if(J)f("div.aberdeen-error:Error")}catch{}}function uF(F,J){let X=Q;Q=F;try{J()}finally{Q=X}}export{uF as withEmitHandler,ZF as unproxy,SF as unmountAll,mF as setErrorHandler,GF as runQueue,g as ref,qF as proxy,hF as peek,gF as partition,S as onEach,iF as multiMap,kF as mount,bF as merge,yF as map,wF as leakScope,TF as isEmpty,MF as invertString,xF as insertCss,vF as getParentElement,YF as dump,RF as derive,BF as defaultEmitHandler,DF as count,EF as copy,M as clone,_ as clean,f as $};
 
-//# debugId=354190D828DAA24964756E2164756E21
+//# debugId=6FA66B654CB0F00764756E2164756E21
 //# sourceMappingURL=aberdeen.js.map