aberdeen 1.1.0 → 1.2.0

package/dist/prediction.js.map

@@ -4,7 +4,7 @@
   "sourcesContent": [
     "import { defaultEmitHandler, withEmitHandler } from \"./aberdeen.js\";\nimport type { TargetType } from \"./aberdeen.js\";\n\n/**\n * Represents a set of changes that can be applied to proxied objects.\n * This is an opaque type - its internal structure is not part of the public API.\n * @private\n */\nexport type Patch = Map<TargetType, Map<any, [any, any]>>;\n\nfunction recordPatch(func: () => void): Patch {\n\tconst recordingPatch = new Map();\n\twithEmitHandler((target, index, newData, oldData) => {\n\t\taddToPatch(recordingPatch, target, index, newData, oldData);\n\t}, func);\n\treturn recordingPatch;\n}\n\nfunction addToPatch(\n\tpatch: Patch,\n\tcollection: TargetType,\n\tindex: any,\n\tnewData: any,\n\toldData: any,\n) {\n\tlet collectionMap = patch.get(collection);\n\tif (!collectionMap) {\n\t\tcollectionMap = new Map();\n\t\tpatch.set(collection, collectionMap);\n\t}\n\tconst prev = collectionMap.get(index);\n\tconst oldData0 = prev ? prev[1] : oldData;\n\tif (newData === oldData0) collectionMap.delete(index);\n\telse collectionMap.set(index, [newData, oldData0]);\n}\n\nfunction emitPatch(patch: Patch) {\n\tfor (const [collection, collectionMap] of patch) {\n\t\tfor (const [index, [newData, oldData]] of collectionMap) {\n\t\t\tdefaultEmitHandler(collection, index, newData, oldData);\n\t\t}\n\t}\n}\n\nfunction mergePatch(target: Patch, source: Patch, reverse = false) {\n\tfor (const [collection, collectionMap] of source) {\n\t\tfor (const [index, [newData, oldData]] of collectionMap) {\n\t\t\taddToPatch(\n\t\t\t\ttarget,\n\t\t\t\tcollection,\n\t\t\t\tindex,\n\t\t\t\treverse ? oldData : newData,\n\t\t\t\treverse ? newData : oldData,\n\t\t\t);\n\t\t}\n\t}\n}\n\nfunction silentlyApplyPatch(patch: Patch, force = false): boolean {\n\tfor (const [collection, collectionMap] of patch) {\n\t\tfor (const [index, [newData, oldData]] of collectionMap) {\n\t\t\tconst actualData = (collection as any)[index];\n\t\t\tif (actualData !== oldData) {\n\t\t\t\tif (force)\n\t\t\t\t\tsetTimeout(() => {\n\t\t\t\t\t\tthrow new Error(\n\t\t\t\t\t\t\t`Applying invalid patch: data ${actualData} is unequal to expected old data ${oldData} for index ${index}`,\n\t\t\t\t\t\t);\n\t\t\t\t\t}, 0);\n\t\t\t\telse return false;\n\t\t\t}\n\t\t}\n\t}\n\tfor (const [collection, collectionMap] of patch) {\n\t\tfor (const [index, [newData, oldData]] of collectionMap) {\n\t\t\t(collection as any)[index] = newData;\n\t\t}\n\t}\n\treturn true;\n}\n\nconst appliedPredictions: Array<Patch> = [];\n\n/**\n * Run the provided function, while treating all changes to Observables as predictions,\n * meaning they will be reverted when changes come back from the server (or some other\n * async source).\n * @param predictFunc The function to run. It will generally modify some Observables\n * \tto immediately reflect state (as closely as possible) that we expect the server\n *  to communicate back to us later on.\n * @returns A `Patch` object. Don't modify it. This is only meant to be passed to `applyCanon`.\n */\nexport function applyPrediction(predictFunc: () => void): Patch {\n\tconst patch = recordPatch(predictFunc);\n\tappliedPredictions.push(patch);\n\temitPatch(patch);\n\treturn patch;\n}\n\n/**\n * Temporarily revert all outstanding predictions, optionally run the provided function\n * (which will generally make authoritative changes to the data based on a server response),\n * and then attempt to reapply the predictions on top of the new canonical state, dropping\n * any predictions that can no longer be applied cleanly (the data has been modified) or\n * that were specified in `dropPredictions`.\n *\n * All of this is done such that redraws are only triggered if the overall effect is an\n * actual change to an `Observable`.\n * @param canonFunc The function to run without any predictions applied. This will typically\n *  make authoritative changes to the data, based on a server response.\n * @param dropPredictions An optional list of predictions (as returned by `applyPrediction`)\n *  to undo. Typically, when a server response for a certain request is being handled,\n *  you'd want to drop the prediction that was done for that request.\n */\nexport function applyCanon(\n\tcanonFunc?: () => void,\n\tdropPredictions: Array<Patch> = [],\n) {\n\tconst resultPatch = new Map();\n\tfor (const prediction of appliedPredictions)\n\t\tmergePatch(resultPatch, prediction, true);\n\tsilentlyApplyPatch(resultPatch, true);\n\n\tfor (const prediction of dropPredictions) {\n\t\tconst pos = appliedPredictions.indexOf(prediction);\n\t\tif (pos >= 0) appliedPredictions.splice(pos, 1);\n\t}\n\tif (canonFunc) mergePatch(resultPatch, recordPatch(canonFunc));\n\n\tfor (let idx = 0; idx < appliedPredictions.length; idx++) {\n\t\tif (silentlyApplyPatch(appliedPredictions[idx])) {\n\t\t\tmergePatch(resultPatch, appliedPredictions[idx]);\n\t\t} else {\n\t\t\tappliedPredictions.splice(idx, 1);\n\t\t\tidx--;\n\t\t}\n\t}\n\n\temitPatch(resultPatch);\n}\n"
   ],
-  "mappings": ";AAAA;AAUA,SAAS,WAAW,CAAC,MAAyB;AAAA,EAC7C,MAAM,iBAAiB,IAAI;AAAA,EAC3B,gBAAgB,CAAC,QAAQ,OAAO,SAAS,YAAY;AAAA,IACpD,WAAW,gBAAgB,QAAQ,OAAO,SAAS,OAAO;AAAA,KACxD,IAAI;AAAA,EACP,OAAO;AAAA;AAGR,SAAS,UAAU,CAClB,OACA,YACA,OACA,SACA,SACC;AAAA,EACD,IAAI,gBAAgB,MAAM,IAAI,UAAU;AAAA,EACxC,KAAK,eAAe;AAAA,IACnB,gBAAgB,IAAI;AAAA,IACpB,MAAM,IAAI,YAAY,aAAa;AAAA,EACpC;AAAA,EACA,MAAM,OAAO,cAAc,IAAI,KAAK;AAAA,EACpC,MAAM,WAAW,OAAO,KAAK,KAAK;AAAA,EAClC,IAAI,YAAY;AAAA,IAAU,cAAc,OAAO,KAAK;AAAA,EAC/C;AAAA,kBAAc,IAAI,OAAO,CAAC,SAAS,QAAQ,CAAC;AAAA;AAGlD,SAAS,SAAS,CAAC,OAAc;AAAA,EAChC,YAAY,YAAY,kBAAkB,OAAO;AAAA,IAChD,YAAY,QAAQ,SAAS,aAAa,eAAe;AAAA,MACxD,mBAAmB,YAAY,OAAO,SAAS,OAAO;AAAA,IACvD;AAAA,EACD;AAAA;AAGD,SAAS,UAAU,CAAC,QAAe,QAAe,UAAU,OAAO;AAAA,EAClE,YAAY,YAAY,kBAAkB,QAAQ;AAAA,IACjD,YAAY,QAAQ,SAAS,aAAa,eAAe;AAAA,MACxD,WACC,QACA,YACA,OACA,UAAU,UAAU,SACpB,UAAU,UAAU,OACrB;AAAA,IACD;AAAA,EACD;AAAA;AAGD,SAAS,kBAAkB,CAAC,OAAc,QAAQ,OAAgB;AAAA,EACjE,YAAY,YAAY,kBAAkB,OAAO;AAAA,IAChD,YAAY,QAAQ,SAAS,aAAa,eAAe;AAAA,MACxD,MAAM,aAAc,WAAmB;AAAA,MACvC,IAAI,eAAe,SAAS;AAAA,QAC3B,IAAI;AAAA,UACH,WAAW,MAAM;AAAA,YAChB,MAAM,IAAI,MACT,gCAAgC,8CAA8C,qBAAqB,OACpG;AAAA,aACE,CAAC;AAAA,QACA;AAAA,iBAAO;AAAA,MACb;AAAA,IACD;AAAA,EACD;AAAA,EACA,YAAY,YAAY,kBAAkB,OAAO;AAAA,IAChD,YAAY,QAAQ,SAAS,aAAa,eAAe;AAAA,MACvD,WAAmB,SAAS;AAAA,IAC9B;AAAA,EACD;AAAA,EACA,OAAO;AAAA;AAGR,IAAM,qBAAmC,CAAC;AAWnC,SAAS,eAAe,CAAC,aAAgC;AAAA,EAC/D,MAAM,QAAQ,YAAY,WAAW;AAAA,EACrC,mBAAmB,KAAK,KAAK;AAAA,EAC7B,UAAU,KAAK;AAAA,EACf,OAAO;AAAA;AAkBD,SAAS,UAAU,CACzB,WACA,kBAAgC,CAAC,GAChC;AAAA,EACD,MAAM,cAAc,IAAI;AAAA,EACxB,WAAW,cAAc;AAAA,IACxB,WAAW,aAAa,YAAY,IAAI;AAAA,EACzC,mBAAmB,aAAa,IAAI;AAAA,EAEpC,WAAW,cAAc,iBAAiB;AAAA,IACzC,MAAM,MAAM,mBAAmB,QAAQ,UAAU;AAAA,IACjD,IAAI,OAAO;AAAA,MAAG,mBAAmB,OAAO,KAAK,CAAC;AAAA,EAC/C;AAAA,EACA,IAAI;AAAA,IAAW,WAAW,aAAa,YAAY,SAAS,CAAC;AAAA,EAE7D,SAAS,MAAM,EAAG,MAAM,mBAAmB,QAAQ,OAAO;AAAA,IACzD,IAAI,mBAAmB,mBAAmB,IAAI,GAAG;AAAA,MAChD,WAAW,aAAa,mBAAmB,IAAI;AAAA,IAChD,EAAO;AAAA,MACN,mBAAmB,OAAO,KAAK,CAAC;AAAA,MAChC;AAAA;AAAA,EAEF;AAAA,EAEA,UAAU,WAAW;AAAA;",
+  "mappings": ";AAAA;AAUA,SAAS,WAAW,CAAC,MAAyB;AAAA,EAC7C,MAAM,iBAAiB,IAAI;AAAA,EAC3B,gBAAgB,CAAC,QAAQ,OAAO,SAAS,YAAY;AAAA,IACpD,WAAW,gBAAgB,QAAQ,OAAO,SAAS,OAAO;AAAA,KACxD,IAAI;AAAA,EACP,OAAO;AAAA;AAGR,SAAS,UAAU,CAClB,OACA,YACA,OACA,SACA,SACC;AAAA,EACD,IAAI,gBAAgB,MAAM,IAAI,UAAU;AAAA,EACxC,IAAI,CAAC,eAAe;AAAA,IACnB,gBAAgB,IAAI;AAAA,IACpB,MAAM,IAAI,YAAY,aAAa;AAAA,EACpC;AAAA,EACA,MAAM,OAAO,cAAc,IAAI,KAAK;AAAA,EACpC,MAAM,WAAW,OAAO,KAAK,KAAK;AAAA,EAClC,IAAI,YAAY;AAAA,IAAU,cAAc,OAAO,KAAK;AAAA,EAC/C;AAAA,kBAAc,IAAI,OAAO,CAAC,SAAS,QAAQ,CAAC;AAAA;AAGlD,SAAS,SAAS,CAAC,OAAc;AAAA,EAChC,YAAY,YAAY,kBAAkB,OAAO;AAAA,IAChD,YAAY,QAAQ,SAAS,aAAa,eAAe;AAAA,MACxD,mBAAmB,YAAY,OAAO,SAAS,OAAO;AAAA,IACvD;AAAA,EACD;AAAA;AAGD,SAAS,UAAU,CAAC,QAAe,QAAe,UAAU,OAAO;AAAA,EAClE,YAAY,YAAY,kBAAkB,QAAQ;AAAA,IACjD,YAAY,QAAQ,SAAS,aAAa,eAAe;AAAA,MACxD,WACC,QACA,YACA,OACA,UAAU,UAAU,SACpB,UAAU,UAAU,OACrB;AAAA,IACD;AAAA,EACD;AAAA;AAGD,SAAS,kBAAkB,CAAC,OAAc,QAAQ,OAAgB;AAAA,EACjE,YAAY,YAAY,kBAAkB,OAAO;AAAA,IAChD,YAAY,QAAQ,SAAS,aAAa,eAAe;AAAA,MACxD,MAAM,aAAc,WAAmB;AAAA,MACvC,IAAI,eAAe,SAAS;AAAA,QAC3B,IAAI;AAAA,UACH,WAAW,MAAM;AAAA,YAChB,MAAM,IAAI,MACT,gCAAgC,8CAA8C,qBAAqB,OACpG;AAAA,aACE,CAAC;AAAA,QACA;AAAA,iBAAO;AAAA,MACb;AAAA,IACD;AAAA,EACD;AAAA,EACA,YAAY,YAAY,kBAAkB,OAAO;AAAA,IAChD,YAAY,QAAQ,SAAS,aAAa,eAAe;AAAA,MACvD,WAAmB,SAAS;AAAA,IAC9B;AAAA,EACD;AAAA,EACA,OAAO;AAAA;AAGR,IAAM,qBAAmC,CAAC;AAWnC,SAAS,eAAe,CAAC,aAAgC;AAAA,EAC/D,MAAM,QAAQ,YAAY,WAAW;AAAA,EACrC,mBAAmB,KAAK,KAAK;AAAA,EAC7B,UAAU,KAAK;AAAA,EACf,OAAO;AAAA;AAkBD,SAAS,UAAU,CACzB,WACA,kBAAgC,CAAC,GAChC;AAAA,EACD,MAAM,cAAc,IAAI;AAAA,EACxB,WAAW,cAAc;AAAA,IACxB,WAAW,aAAa,YAAY,IAAI;AAAA,EACzC,mBAAmB,aAAa,IAAI;AAAA,EAEpC,WAAW,cAAc,iBAAiB;AAAA,IACzC,MAAM,MAAM,mBAAmB,QAAQ,UAAU;AAAA,IACjD,IAAI,OAAO;AAAA,MAAG,mBAAmB,OAAO,KAAK,CAAC;AAAA,EAC/C;AAAA,EACA,IAAI;AAAA,IAAW,WAAW,aAAa,YAAY,SAAS,CAAC;AAAA,EAE7D,SAAS,MAAM,EAAG,MAAM,mBAAmB,QAAQ,OAAO;AAAA,IACzD,IAAI,mBAAmB,mBAAmB,IAAI,GAAG;AAAA,MAChD,WAAW,aAAa,mBAAmB,IAAI;AAAA,IAChD,EAAO;AAAA,MACN,mBAAmB,OAAO,KAAK,CAAC;AAAA,MAChC;AAAA;AAAA,EAEF;AAAA,EAEA,UAAU,WAAW;AAAA;",
   "debugId": "55BE44FF877D138F64756E2164756E21",
   "names": []
 }

package/dist/route.d.ts

@@ -1,4 +1,4 @@
-type NavType = "load" | "back" | "forward" | "go";
+type NavType = "load" | "back" | "forward" | "go" | "push";
 /**
 * The class for the global `route` object.
 */
@@ -19,6 +19,7 @@ export interface Route {
     - `"load"`: An initial page load.
     - `"back"` or `"forward"`: When we navigated backwards or forwards in the stack.
     - `"go"`: When we added a new page on top of the stack.
+    - `"push"`: When we added a new page on top of the stack, merging with the current page.
     Mostly useful for page transition animations. Writing to this property has no effect.
     */
     nav: NavType;
@@ -54,7 +55,7 @@ type RouteTarget = string | (string | number)[] | Partial<Omit<Omit<Route, "p">,
 * route.go({p: ["users", 123], search: {tab: "feed"}, hash: "top"});
 * ```
 */
-export declare function go(target: RouteTarget): void;
+export declare function go(target: RouteTarget, nav?: NavType): void;
 /**
  * Modify the current route by merging `target` into it (using {@link merge}), pushing a new history entry.
  *

package/dist/route.js

@@ -81,12 +81,12 @@ function targetToPartial(target) {
   }
   return target;
 }
-function go(target) {
+function go(target, nav = "go") {
   const stack = history.state?.stack || [];
   prevStack = stack.concat(JSON.stringify(unproxy(current)));
-  const newRoute = toCanonRoute(targetToPartial(target), "go", prevStack.length + 1);
+  const newRoute = toCanonRoute(targetToPartial(target), nav, prevStack.length + 1);
   copy(current, newRoute);
-  log("go", newRoute);
+  log(nav, newRoute);
   history.pushState({ state: newRoute.state, stack: prevStack }, "", getUrl(newRoute));
   runQueue();
 }
@@ -192,5 +192,5 @@ export {
   back
 };
 
-//# debugId=A8B2D764F285F09564756E2164756E21
+//# debugId=5B5243A451755E6B64756E2164756E21
 //# 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\";\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"
+    "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"
   ],
-  "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",
+  "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",
   "names": []
 }

package/dist-min/aberdeen.js

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