@weasel-js/prefs 1.10.0 → 1.10.1

package/dist/index.js

@@ -1,5 +1,5 @@
-import { prefLeafHoldingIn, prefLeafHolding, prefSchemaHolding, UNSEEN, prefConditionHolds, prefValueAtPath, isPrefSection, prefSectionLeaves, isPrefLeaf, prefLeafAt, prefAliasTarget, prefAliasedLeaf, pairRowsOf, prefConditionReadsItem, visiblePrefSubtree } from './chunk-5KB3WBJZ.js';
-export { PREF_KINDS, VERSION_RECORD, checkPrefCondition, checkPrefConditions, filterPrefSubtree, flattenPrefValues, isBuiltinPref, isPrefCondition, isPrefLeaf, isPrefLinearUnit, isPrefSection, mapPrefConditionPaths, openPrefs, openPrefsSync, pairRowsOf, prefAliasName, prefAliasTarget, prefAliasedLeaf, prefConditionHolds, prefConditionPaths, prefConditionReadsItem, prefDisplayBounds, prefHoldsValue, prefIsEnabled, prefIsShown, prefLeafAt, prefLeaves, prefSchemaHolding, prefSectionLeaves, prefUnit, prefValueAtPath, prefVariantDefault, prefVariantOf, repairPrefValue, resolvePrefUnit, visiblePrefSubtree } from './chunk-5KB3WBJZ.js';
+import { prefLeafHoldingIn, prefLeafHolding, prefSchemaHolding, UNSEEN, prefConditionHolds, prefValueAtPath, isPrefSection, prefSectionLeaves, isPrefLeaf, prefLeafAt, prefLeaves, prefHoldsValue, prefSelectors, prefAliasTarget, prefAliasedLeaf, isBuiltinPref, pairRowsOf, prefConditionReadsItem, visiblePrefSubtree, resolvePrefUnit, isPrefLocus } from './chunk-ASSX3JHY.js';
+export { PREF_BLENDS, PREF_KINDS, VERSION_RECORD, checkPrefCondition, checkPrefConditions, checkPrefSplits, filterPrefSubtree, flattenPrefValues, isBuiltinPref, isPrefCondition, isPrefLeaf, isPrefLinearUnit, isPrefLocus, isPrefSection, mapPrefConditionPaths, openPrefs, openPrefsSync, pairRowsOf, prefAliasName, prefAliasTarget, prefAliasedLeaf, prefConditionHolds, prefConditionPaths, prefConditionReadsItem, prefDisplayBounds, prefHoldsValue, prefIsEnabled, prefIsShown, prefLeafAt, prefLeaves, memberAt as prefLocusMember, locusSelectors as prefLocusSelectors, prefSchemaHolding, prefSectionLeaves, prefUnit, prefValueAtPath, prefVariantDefault, prefVariantOf, repairPrefValue, resolvePrefUnit, visiblePrefSubtree } from './chunk-ASSX3JHY.js';
 
 // src/tabRuns.ts
 function prefTabRuns(items, isTab) {
@@ -19,9 +19,9 @@ function prefTabRuns(items, isTab) {
 }
 
 // src/shown.ts
-function prefShownValue(leaf, stored, siblings) {
-  if (leaf.kind !== "boolean" && leaf.kind !== "enum") return stored;
-  const { encoding } = leaf;
+function prefShownValue(leaf2, stored, siblings) {
+  if (leaf2.kind !== "boolean" && leaf2.kind !== "enum") return stored;
+  const { encoding } = leaf2;
   return encoding ? encoding.read(stored, siblings) : stored;
 }
 function prefShownReader(schema, read, item, over) {
@@ -55,9 +55,9 @@ function prefReader(schema, values, over) {
     if (held !== void 0) return held;
     if (beyond && prefSchemaHolding(schema, path, over) === over) return beyond(path);
     if (isPrefSection(schema)) {
-      for (const [key, leaf] of prefSectionLeaves(schema.members)) {
-        if (path === key) return leaf.default;
-        if (path.startsWith(`${key}.`)) return prefValueAtPath(leaf.default, path.slice(key.length + 1));
+      for (const [key, leaf2] of prefSectionLeaves(schema.members)) {
+        if (path === key) return leaf2.default;
+        if (path.startsWith(`${key}.`)) return prefValueAtPath(leaf2.default, path.slice(key.length + 1));
       }
       return void 0;
     }
@@ -91,18 +91,18 @@ function scopeAmong(held, rest, above, holds) {
   }
   return void 0;
 }
-function scopeInside(leaf, rest, scope, holds) {
-  if (leaf.kind === "object") return scopeAmong(leaf.children, rest, scope, holds) ?? scope;
-  if (leaf.kind === "list" || leaf.kind === "map") {
-    const { item } = leaf;
+function scopeInside(leaf2, rest, scope, holds) {
+  if (leaf2.kind === "object") return scopeAmong(leaf2.children, rest, scope, holds) ?? scope;
+  if (leaf2.kind === "list" || leaf2.kind === "map") {
+    const { item } = leaf2;
     if (item === void 0) return scope;
     const inItem = deferEntryConditions(holds);
     const entry = prefScopeUnder(scope, { enableIf: item.enableIf }, inItem);
     const dot = rest.indexOf(".");
     return dot < 0 ? entry : scopeInside(item, rest.slice(dot + 1), entry, inItem);
   }
-  if (leaf.kind !== "union") return scope;
-  for (const variant of Object.values(leaf.variants)) {
+  if (leaf2.kind !== "union") return scope;
+  for (const variant of Object.values(leaf2.variants)) {
     const found = scopeAmong(variant.children, rest, scope, holds);
     if (found) return found;
   }
@@ -133,8 +133,8 @@ function prefAliasScope(own, alias, over, holds) {
 }
 function prefScopeAt(schema, path, holds, { aliasOver, aliasHolds } = {}) {
   const own = scopeAt(schema, path, holds);
-  const leaf = prefLeafAt(schema, path);
-  return leaf?.kind === "alias" ? prefAliasScope(own, leaf, aliasOver ?? schema, aliasHolds ?? holds) : own;
+  const leaf2 = prefLeafAt(schema, path);
+  return leaf2?.kind === "alias" ? prefAliasScope(own, leaf2, aliasOver ?? schema, aliasHolds ?? holds) : own;
 }
 
 // src/scope.ts
@@ -142,7 +142,7 @@ var under = (prefix, key) => prefix === "" ? key : `${prefix}.${key}`;
 function leafWalk({ keepEmpty, keepHidden, inItem, aliasOver, aliasHolds }) {
   const disabled = /* @__PURE__ */ new Set();
   const hidden = /* @__PURE__ */ new Set();
-  const leaf = (node, path, above, holds) => {
+  const leaf2 = (node, path, above, holds) => {
     const own = prefScopeUnder(above, node, holds);
     const scope = node.kind === "alias" && aliasOver ? prefAliasScope(own, node, aliasOver, aliasHolds ?? holds) : own;
     return scope.shown || keepHidden ? inside(node, path, scope, holds) : null;
@@ -175,7 +175,7 @@ function leafWalk({ keepEmpty, keepHidden, inItem, aliasOver, aliasHolds }) {
     let changed = false;
     const out = {};
     for (const [key, child] of Object.entries(held)) {
-      const kept = isPrefLeaf(child) ? leaf(child, under(prefix, key), above, holds) : section(child, prefix, above, holds);
+      const kept = isPrefLeaf(child) ? leaf2(child, under(prefix, key), above, holds) : section(child, prefix, above, holds);
       changed ||= kept !== child;
       if (kept !== null) out[key] = kept;
     }
@@ -188,7 +188,7 @@ function leafWalk({ keepEmpty, keepHidden, inItem, aliasOver, aliasHolds }) {
     if (kept === node.members) return node;
     return Object.keys(kept).length === 0 && !keepEmpty ? null : { ...node, members: kept };
   };
-  return { disabled, hidden, leaf, inside, members };
+  return { disabled, hidden, leaf: leaf2, inside, members };
 }
 function applyPrefConditions(schema, holds, { keepEmpty = false, keepHidden = false, aliasOver, aliasHolds } = {}) {
   const walk = leafWalk({ keepEmpty, keepHidden, inItem: deferEntryConditions(holds), aliasOver: aliasOver ?? schema, aliasHolds });
@@ -223,11 +223,133 @@ function applyPrefEntryConditions(item, path, holds, { keepEmpty = false, keepHi
   return { item: walk.inside(item, path, scope, asked), disabled: walk.disabled, hidden: walk.hidden };
 }
 
+// src/build.ts
+var leaf = (kind, name, def, rest) => ({ kind, name, description: "", default: def, ...rest });
+var labeled = (value) => value === "" ? value : value[0].toUpperCase() + value.slice(1);
+var pref = {
+  /** A group: `children` nest under its key, which is a segment of their paths. */
+  group(name, children, options) {
+    return { name, ...options, children };
+  },
+  /** A section: a heading over `members`, whose key adds nothing to their paths. */
+  section(name, members, options) {
+    return { name, ...options, members };
+  },
+  number: (name, def, rest) => leaf("number", name, def, rest),
+  boolean: (name, def, rest) => leaf("boolean", name, def, rest),
+  string: (name, def, rest) => leaf("string", name, def, rest),
+  color: (name, def, rest) => leaf("color", name, def, rest),
+  /** A fixed set of choices. An option given as its value alone is labeled with that value, its first letter raised. */
+  enum(name, def, options, rest) {
+    const full = options.map((option) => typeof option === "string" ? { value: option, label: labeled(option) } : option);
+    return { kind: "enum", name, description: "", default: def, ...rest, options: full };
+  }
+};
+
+// src/css.ts
+var kebab = (path) => path.replace(/\./g, "-").replace(/[A-Z]/g, (letter) => `-${letter.toLowerCase()}`);
+var CSS_UNITS = {
+  px: "px",
+  "%": "%",
+  em: "em",
+  rem: "rem",
+  ch: "ch",
+  pt: "pt",
+  vw: "vw",
+  vh: "vh",
+  ms: "ms",
+  s: "s",
+  "\xB0": "deg",
+  deg: "deg",
+  rad: "rad",
+  turn: "turn"
+};
+var IDENT = /^-?[A-Za-z_][\w-]*$/;
+var quoted = (text) => `'${text.replace(/[\\']/g, "\\$&")}'`;
+function cssValue(leaf2, value) {
+  switch (leaf2.kind) {
+    case "number": {
+      if (typeof value !== "number" || !Number.isFinite(value)) return null;
+      const { unit } = leaf2;
+      const resolved = unit ? resolvePrefUnit(unit) : void 0;
+      const shown = resolved ? resolved.toDisplay(value) : value;
+      const suffix = resolved?.suffix !== void 0 && Object.hasOwn(CSS_UNITS, resolved.suffix) ? CSS_UNITS[resolved.suffix] : "";
+      return `${Number(shown.toFixed(6))}${suffix}`;
+    }
+    case "boolean":
+      return typeof value === "boolean" ? value ? "1" : "0" : null;
+    case "color":
+      return typeof value === "string" && value !== "" ? value : null;
+    case "enum":
+      if (typeof value !== "string" || leaf2.encoding) return null;
+      return IDENT.test(value) ? value : quoted(value);
+    case "string":
+      return typeof value === "string" ? quoted(value) : null;
+    default:
+      return null;
+  }
+}
+function toldApart(held, optionsOf, absent) {
+  const out = [];
+  const walk = (value, under2) => {
+    if (!isPrefLocus(value)) {
+      out.push({ under: under2, value });
+      return;
+    }
+    for (const option of optionsOf(value.$by)) {
+      walk(Object.hasOwn(value.$of, option) ? value.$of[option] : absent, [...under2, [value.$by, option]]);
+    }
+  };
+  walk(held, []);
+  return out;
+}
+function prefsCss(store, options = {}) {
+  const root = options.root ?? ":root";
+  const property = options.property ?? ((path) => `--${kebab(path)}`);
+  const attribute = options.attribute ?? ((selector) => `data-${kebab(selector)}`);
+  const leaves = new Map([...prefLeaves(store.schema)].filter(([, leaf2]) => prefHoldsValue(leaf2)));
+  const selectors = prefSelectors(leaves);
+  const defaults = Object.fromEntries([...selectors.keys()].map((path) => [path, leaves.get(path).default]));
+  const base = store.values({ at: defaults });
+  const blocks = /* @__PURE__ */ new Map();
+  const declare = (under2, path, leaf2, value) => {
+    const name = property(path, leaf2);
+    if (name === null) return;
+    const given = options.value?.(value, leaf2, path);
+    const text = given === void 0 ? cssValue(leaf2, value) : given;
+    if (text === null) return;
+    const key = under2.map(([selector, option]) => `${selector}=${option}`).join("&");
+    if (!blocks.has(key)) blocks.set(key, { under: under2, lines: [] });
+    blocks.get(key).lines.push(`  ${name}: ${text};`);
+  };
+  for (const [path, leaf2] of leaves) {
+    declare([], path, leaf2, prefValueAtPath(base, path));
+    const own = selectors.get(path);
+    if (own) for (const option of own) declare([[path, option]], path, leaf2, option);
+    const held = store.locus(path);
+    if (!held) continue;
+    for (const { under: under2, value } of toldApart(held, (selector) => selectors.get(selector) ?? [], leaf2.default)) {
+      declare(under2, path, leaf2, value);
+    }
+  }
+  return [...blocks.values()].map((block, i) => ({ ...block, i })).sort((a, b) => a.under.length - b.under.length || a.i - b.i).map(({ under: under2, lines }) => {
+    const matched = under2.map(([selector, option]) => `[${attribute(selector)}=${quoted(option)}]`).join("");
+    return `:where(${root}${matched}) {
+${lines.join("\n")}
+}`;
+  }).join("\n\n");
+}
+function prefsCssAttributes(store, options = {}) {
+  const attribute = options.attribute ?? ((selector) => `data-${kebab(selector)}`);
+  const leaves = prefLeaves(store.schema);
+  return Object.fromEntries([...prefSelectors(leaves).keys()].map((path) => [attribute(path), store.get(path)]));
+}
+
 // src/aliasTargets.ts
-function visibleFieldsOf(leaf) {
-  if (leaf.kind !== "object") return leaf;
-  const shown = visiblePrefSubtree({ ...leaf, hidden: false }, false, true);
-  return { ...leaf, children: shown.children };
+function visibleFieldsOf(leaf2) {
+  if (leaf2.kind !== "object") return leaf2;
+  const shown = visiblePrefSubtree({ ...leaf2, hidden: false }, false, true);
+  return { ...leaf2, children: shown.children };
 }
 function prefAliasTargets(over, judge, { showHidden = false, markHidden = false } = {}) {
   const holds = judge();
@@ -235,8 +357,8 @@ function prefAliasTargets(over, judge, { showHidden = false, markHidden = false
   const get = () => applied ??= applyPrefConditions(over, holds, { keepEmpty: true, keepHidden: markHidden });
   const leafAt = (path) => {
     const { shown } = get();
-    const leaf = shown === null ? void 0 : prefLeafAt(shown, path);
-    return leaf === void 0 || showHidden ? leaf : visibleFieldsOf(leaf);
+    const leaf2 = shown === null ? void 0 : prefLeafAt(shown, path);
+    return leaf2 === void 0 || showHidden ? leaf2 : visibleFieldsOf(leaf2);
   };
   return {
     holds,
@@ -253,20 +375,20 @@ function prefAliasTargets(over, judge, { showHidden = false, markHidden = false
 
 // src/object.ts
 var isObject = (v) => typeof v === "object" && v !== null;
-function prefObjectBase(pref, held) {
+function prefObjectBase(pref2, held) {
   if (isObject(held)) return held;
-  return pref.fromScalar?.(held) ?? (isObject(pref.default) ? pref.default : {});
+  return pref2.fromScalar?.(held) ?? (isObject(pref2.default) ? pref2.default : {});
 }
-function prefObjectWithField(pref, held, key, value) {
-  const base = prefObjectBase(pref, held);
+function prefObjectWithField(pref2, held, key, value) {
+  const base = prefObjectBase(pref2, held);
   if (value !== void 0) return { ...base, [key]: value };
   const { [key]: _dropped, ...rest } = base;
   return rest;
 }
 
 // src/type.ts
-function prefType(name, leaf) {
-  return { ...leaf, type: name };
+function prefType(name, leaf2) {
+  return { ...leaf2, type: name };
 }
 
 // src/groups.ts
@@ -274,6 +396,19 @@ function prefGroupIsPage(group) {
   return group.as === void 0 || group.as === "page";
 }
 
+// src/heading.ts
+function prefFitsHeading(leaf2) {
+  return (leaf2.kind === "boolean" || leaf2.kind === "enum") && isBuiltinPref(leaf2);
+}
+function prefHeadingKey(node) {
+  if (node.name === "") return void 0;
+  const held = "members" in node ? node.members : node.children;
+  for (const [key, child] of Object.entries(held)) {
+    if (isPrefLeaf(child) && child.heading === true && prefFitsHeading(child)) return key;
+  }
+  return void 0;
+}
+
 // src/pair.ts
 function pairRuns(items, leafOf) {
   const leaves = items.map(leafOf);
@@ -310,14 +445,14 @@ var PREF_KIND_TRAITS = {
   label: ONE,
   separator: ONE
 };
-var traitsOf = (leaf) => Object.hasOwn(PREF_KIND_TRAITS, leaf.kind) ? PREF_KIND_TRAITS[leaf.kind] : ONE;
-function prefIsCompound(leaf) {
-  return traitsOf(leaf).compound;
+var traitsOf = (leaf2) => Object.hasOwn(PREF_KIND_TRAITS, leaf2.kind) ? PREF_KIND_TRAITS[leaf2.kind] : ONE;
+function prefIsCompound(leaf2) {
+  return traitsOf(leaf2).compound;
 }
-function prefDrawsSeveral(leaf) {
-  return traitsOf(leaf).several;
+function prefDrawsSeveral(leaf2) {
+  return traitsOf(leaf2).several;
 }
 
-export { PREF_ENTRY, PREF_KIND_TRAITS, PREF_SCOPE, applyPrefConditions, applyPrefEntryConditions, pairRuns, prefAliasTargets, prefDrawsSeveral, prefGroupIsPage, prefIsCompound, prefJudge, prefObjectBase, prefObjectWithField, prefReader, prefScopeAt, prefScopeUnder, prefShownReader, prefShownValue, prefTabRuns, prefType };
+export { PREF_ENTRY, PREF_KIND_TRAITS, PREF_SCOPE, applyPrefConditions, applyPrefEntryConditions, pairRuns, pref, prefAliasTargets, prefDrawsSeveral, prefFitsHeading, prefGroupIsPage, prefHeadingKey, prefIsCompound, prefJudge, prefObjectBase, prefObjectWithField, prefReader, prefScopeAt, prefScopeUnder, prefShownReader, prefShownValue, prefTabRuns, prefType, prefsCss, prefsCssAttributes };
 //# sourceMappingURL=index.js.map
 //# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/tabRuns.ts","../src/shown.ts","../src/judge.ts","../src/scopeAt.ts","../src/scope.ts","../src/aliasTargets.ts","../src/object.ts","../src/type.ts","../src/groups.ts","../src/pair.ts","../src/kinds.ts"],"names":["scope","kept"],"mappings":";;;;AAOO,SAAS,WAAA,CAAe,OAAqB,KAAA,EAA8C;AAChG,EAAA,MAAM,MAAuB,EAAC;AAC9B,EAAA,IAAI,GAAA;AACJ,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,IAAI,CAAC,KAAA,CAAM,IAAI,CAAA,EAAG;AAChB,MAAA,GAAA,GAAM,MAAA;AACN,MAAA,GAAA,CAAI,IAAA,CAAK,EAAE,IAAA,EAAM,CAAA;AAAA,IACnB,WAAW,GAAA,EAAK;AACd,MAAA,GAAA,CAAI,KAAK,IAAI,CAAA;AAAA,IACf,CAAA,MAAO;AACL,MAAA,GAAA,CAAI,KAAK,EAAE,IAAA,EAAO,MAAM,CAAC,IAAI,GAAI,CAAA;AAAA,IACnC;AAAA,EACF;AACA,EAAA,OAAO,GAAA;AACT;;;ACRO,SAAS,cAAA,CAAe,IAAA,EAAgB,MAAA,EAAiB,QAAA,EAA6C;AAC3G,EAAA,IAAI,KAAK,IAAA,KAAS,SAAA,IAAa,IAAA,CAAK,IAAA,KAAS,QAAQ,OAAO,MAAA;AAC5D,EAAA,MAAM,EAAE,UAAS,GAAI,IAAA;AACrB,EAAA,OAAO,QAAA,GAAY,QAAA,CAAS,IAAA,CAA0D,MAAA,EAAQ,QAAQ,CAAA,GAAI,MAAA;AAC5G;AAUO,SAAS,eAAA,CACd,MAAA,EAAiC,IAAA,EAA2B,IAAA,EAAiB,IAAA,EACxD;AACrB,EAAA,OAAO,CAAC,MAAM,IAAA,KAAS;AACrB,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,IAAA,EAAM,IAAI,CAAA;AAC9B,IAAA,MAAM,IAAA,GAAO,IAAA,KAAS,MAAA,GAAS,IAAA,IAAQ,kBAAkB,IAAA,EAAM,IAAI,CAAA,GAAI,eAAA,CAAgB,iBAAA,CAAkB,MAAA,EAAQ,IAAA,EAAM,IAAI,GAAG,IAAI,CAAA;AAClI,IAAA,IAAI,IAAA,KAAS,MAAA,IAAa,IAAA,KAAS,MAAA,EAAQ,OAAO,MAAA;AAClD,IAAA,MAAM,MAAA,GAAS,KAAK,MAAA,KAAW,MAAA,GAAY,SAAY,IAAA,CAAK,IAAA,CAAK,QAAQ,IAAI,CAAA;AAC7E,IAAA,OAAO,cAAA,CAAe,IAAA,CAAK,IAAA,EAAM,MAAA,EAAQ,OAAO,WAAW,QAAA,IAAY,MAAA,KAAW,IAAA,GAAQ,MAAA,GAAsB,MAAS,CAAA;AAAA,EAC3H,CAAA;AACF;;;ACXA,SAAS,UAAA,CAAW,EAAE,IAAA,EAAM,KAAA,IAAoB,IAAA,EAAuB;AACrE,EAAA,IAAI,SAAS,EAAA,EAAI,OAAO,KAAA,KAAU,MAAA,GAAY,QAAQ,IAAA,CAAK,OAAA;AAC3D,EAAA,MAAM,IAAA,GAAO,eAAA,CAAgB,KAAA,EAAO,IAAI,CAAA;AACxC,EAAA,OAAO,SAAS,MAAA,GAAY,IAAA,GAAO,eAAA,CAAgB,IAAA,CAAK,SAAS,IAAI,CAAA;AACvE;AAWO,SAAS,SAAA,CACd,MAAA,EAAiC,IAAA,EAAiC,KAAA,EAAmB,IAAA,EACjE;AACpB,EAAA,MAAM,MAAA,GAA8B,CAAC,IAAA,EAAM,IAAA,KAAU,IAAA,KAAS,MAAA,GAAS,KAAA,IAAS,UAAA,CAAW,KAAA,EAAO,IAAI,CAAA,GAAI,IAAA,CAAK,IAAI,CAAA;AACnH,EAAA,MAAM,QAAQ,eAAA,CAAgB,MAAA,EAAQ,MAAA,EAAQ,KAAA,EAAO,MAAM,IAAI,CAAA;AAC/D,EAAA,OAAO,CAAC,SAAA,KAAc,kBAAA,CAAmB,SAAA,EAAW,KAAK,CAAA;AAC3D;AAOO,SAAS,qBAAqB,KAAA,EAA+C;AAClF,EAAA,OAAO,CAAC,WAAW,KAAA,KAAU,sBAAA,CAAuB,SAAS,CAAA,IAAK,KAAA,CAAM,WAAW,KAAK,CAAA;AAC1F;AAQO,SAAS,UAAA,CAAW,MAAA,EAAiC,MAAA,EAAiB,IAAA,EAA2D;AACtI,EAAA,MAAM,MAAA,GAAS,IAAA,IAAQ,UAAA,CAAW,IAAA,EAAM,MAAM,CAAA;AAC9C,EAAA,OAAO,CAAC,IAAA,KAAS;AACf,IAAA,MAAM,IAAA,GAAO,eAAA,CAAgB,MAAA,EAAQ,IAAI,CAAA;AACzC,IAAA,IAAI,IAAA,KAAS,QAAW,OAAO,IAAA;AAC/B,IAAA,IAAI,MAAA,IAAU,kBAAkB,MAAA,EAAQ,IAAA,EAAM,IAAI,CAAA,KAAM,IAAA,EAAM,OAAO,MAAA,CAAO,IAAI,CAAA;AAChF,IAAA,IAAI,aAAA,CAAc,MAAM,CAAA,EAAG;AACzB,MAAA,KAAA,MAAW,CAAC,GAAA,EAAK,IAAI,KAAK,iBAAA,CAAkB,MAAA,CAAO,OAAO,CAAA,EAAG;AAC3D,QAAA,IAAI,IAAA,KAAS,GAAA,EAAK,OAAO,IAAA,CAAK,OAAA;AAC9B,QAAA,IAAI,IAAA,CAAK,UAAA,CAAW,CAAA,EAAG,GAAG,GAAG,CAAA,EAAG,OAAO,eAAA,CAAgB,IAAA,CAAK,SAAS,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,MAAA,GAAS,CAAC,CAAC,CAAA;AAAA,MACjG;AACA,MAAA,OAAO,MAAA;AAAA,IACT;AACA,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,GAAG,CAAA;AAC5B,IAAA,IAAI,IAAA,GAAkB,MAAA;AACtB,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,CAAM,QAAQ,CAAA,EAAA,EAAK;AACrC,MAAA,IAAI,CAAC,OAAO,MAAA,CAAO,IAAA,CAAK,UAAU,KAAA,CAAM,CAAC,CAAE,CAAA,EAAG,OAAO,MAAA;AACrD,MAAA,MAAM,KAAA,GAA8B,IAAA,CAAK,QAAA,CAAS,KAAA,CAAM,CAAC,CAAE,CAAA;AAC3D,MAAA,IAAI,CAAC,UAAA,CAAW,KAAK,CAAA,EAAG,IAAA,GAAO,KAAA;AAAA,kBACnB,CAAA,KAAM,KAAA,CAAM,MAAA,GAAS,CAAA,GAAI,MAAM,OAAA,GAAU,eAAA,CAAgB,KAAA,CAAM,OAAA,EAAS,MAAM,KAAA,CAAM,CAAA,GAAI,CAAC,CAAA,CAAE,IAAA,CAAK,GAAG,CAAC,CAAA;AAAA,IAClH;AACA,IAAA,OAAO,MAAA;AAAA,EACT,CAAA;AACF;;;AClEO,IAAM,UAAA,GAAa;AAGnB,IAAM,UAAA,GAAwB,OAAO,MAAA,CAAO,EAAE,OAAO,IAAA,EAAM,OAAA,EAAS,MAAM;AAG1E,SAAS,cAAA,CACd,KAAA,EACA,IAAA,EACA,KAAA,EACW;AACX,EAAA,MAAM,KAAA,GAAQ,MAAM,KAAA,KAAU,IAAA,CAAK,WAAW,MAAA,IAAa,KAAA,CAAM,IAAA,CAAK,MAAA,EAAQ,QAAQ,CAAA,CAAA;AACtF,EAAA,MAAM,OAAA,GAAU,MAAM,OAAA,KAAY,IAAA,CAAK,aAAa,MAAA,IAAa,KAAA,CAAM,IAAA,CAAK,QAAA,EAAU,UAAU,CAAA,CAAA;AAChG,EAAA,OAAO,KAAA,KAAU,MAAM,KAAA,IAAS,OAAA,KAAY,MAAM,OAAA,GAAU,KAAA,GAAQ,EAAE,KAAA,EAAO,OAAA,EAAQ;AACvF;AAGA,SAAS,UAAA,CACP,IAAA,EAA8B,IAAA,EAAc,KAAA,EAAkB,KAAA,EACvC;AACvB,EAAA,KAAA,MAAW,CAAC,GAAA,EAAK,KAAK,KAAK,MAAA,CAAO,OAAA,CAAQ,IAAI,CAAA,EAAG;AAC/C,IAAA,IAAI,CAAC,UAAA,CAAW,KAAK,CAAA,EAAG;AACtB,MAAA,MAAM,KAAA,GAAQ,UAAA,CAAW,KAAA,CAAM,OAAA,EAAS,IAAA,EAAM,eAAe,KAAA,EAAO,KAAA,EAAO,KAAK,CAAA,EAAG,KAAK,CAAA;AACxF,MAAA,IAAI,OAAO,OAAO,KAAA;AAAA,IACpB,WAAW,IAAA,KAAS,GAAA,SAAY,cAAA,CAAe,KAAA,EAAO,OAAO,KAAK,CAAA;AAAA,SAAA,IACzD,IAAA,CAAK,WAAW,CAAA,EAAG,GAAG,GAAG,CAAA,EAAG,OAAO,YAAY,KAAA,EAAO,IAAA,CAAK,MAAM,GAAA,CAAI,MAAA,GAAS,CAAC,CAAA,EAAG,cAAA,CAAe,OAAO,KAAA,EAAO,KAAK,GAAG,KAAK,CAAA;AAAA,EACvI;AACA,EAAA,OAAO,MAAA;AACT;AAGA,SAAS,WAAA,CAAY,IAAA,EAAgB,IAAA,EAAc,KAAA,EAAkB,KAAA,EAAsC;AACzG,EAAA,IAAI,IAAA,CAAK,IAAA,KAAS,QAAA,EAAU,OAAO,UAAA,CAAY,KAAoB,QAAA,EAAU,IAAA,EAAM,KAAA,EAAO,KAAK,CAAA,IAAK,KAAA;AACpG,EAAA,IAAI,IAAA,CAAK,IAAA,KAAS,MAAA,IAAU,IAAA,CAAK,SAAS,KAAA,EAAO;AAC/C,IAAA,MAAM,EAAE,MAAK,GAAI,IAAA;AACjB,IAAA,IAAI,IAAA,KAAS,QAAW,OAAO,KAAA;AAC/B,IAAA,MAAM,MAAA,GAAS,qBAAqB,KAAK,CAAA;AACzC,IAAA,MAAM,KAAA,GAAQ,eAAe,KAAA,EAAO,EAAE,UAAU,IAAA,CAAK,QAAA,IAAY,MAAM,CAAA;AACvE,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,OAAA,CAAQ,GAAG,CAAA;AAC5B,IAAA,OAAO,GAAA,GAAM,CAAA,GAAI,KAAA,GAAQ,WAAA,CAAY,IAAA,EAAM,IAAA,CAAK,KAAA,CAAM,GAAA,GAAM,CAAC,CAAA,EAAG,KAAA,EAAO,MAAM,CAAA;AAAA,EAC/E;AACA,EAAA,IAAI,IAAA,CAAK,IAAA,KAAS,OAAA,EAAS,OAAO,KAAA;AAClC,EAAA,KAAA,MAAW,OAAA,IAAW,MAAA,CAAO,MAAA,CAAQ,IAAA,CAAmB,QAAQ,CAAA,EAAG;AACjE,IAAA,MAAM,QAAQ,UAAA,CAAW,OAAA,CAAQ,QAAA,EAAU,IAAA,EAAM,OAAO,KAAK,CAAA;AAC7D,IAAA,IAAI,OAAO,OAAO,KAAA;AAAA,EACpB;AACA,EAAA,OAAO,KAAA;AACT;AAEA,SAAS,OAAA,CAAQ,MAAA,EAAiC,IAAA,EAAc,KAAA,EAAsC;AACpG,EAAA,IAAI,KAAA,GAAQ,cAAA,CAAe,UAAA,EAAY,MAAA,EAAQ,KAAK,CAAA;AACpD,EAAA,IAAI,IAAA,KAAS,IAAI,OAAO,KAAA;AACxB,EAAA,IAAI,aAAA,CAAc,MAAM,CAAA,EAAG,OAAO,UAAA,CAAW,OAAO,OAAA,EAAS,IAAA,EAAM,KAAA,EAAO,KAAK,CAAA,IAAK,KAAA;AACpF,EAAA,IAAI,IAAA,GAAkB,MAAA;AACtB,EAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,GAAG,CAAA;AAC5B,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,CAAM,QAAQ,CAAA,EAAA,EAAK;AACrC,IAAA,IAAI,CAAC,OAAO,MAAA,CAAO,IAAA,CAAK,UAAU,KAAA,CAAM,CAAC,CAAE,CAAA,EAAG,OAAO,KAAA;AACrD,IAAA,MAAM,KAAA,GAA8B,IAAA,CAAK,QAAA,CAAS,KAAA,CAAM,CAAC,CAAE,CAAA;AAC3D,IAAA,KAAA,GAAQ,cAAA,CAAe,KAAA,EAAO,KAAA,EAAO,KAAK,CAAA;AAC1C,IAAA,IAAI,UAAA,CAAW,KAAK,CAAA,EAAG,OAAO,MAAM,KAAA,CAAM,MAAA,GAAS,IAAI,KAAA,GAAQ,WAAA,CAAY,OAAO,KAAA,CAAM,KAAA,CAAM,IAAI,CAAC,CAAA,CAAE,KAAK,GAAG,CAAA,EAAG,OAAO,KAAK,CAAA;AAC5H,IAAA,IAAA,GAAO,KAAA;AAAA,EACT;AACA,EAAA,OAAO,KAAA;AACT;AAGO,SAAS,cAAA,CAAe,GAAA,EAAgB,KAAA,EAAkB,IAAA,EAA+B,KAAA,EAAsC;AACpI,EAAA,MAAM,MAAA,GAAS,gBAAgB,KAAA,EAAO,CAAC,SAAS,UAAA,CAAW,IAAA,EAAM,IAAI,CAAC,CAAA;AACtE,EAAA,IAAI,MAAA,KAAW,QAAW,OAAO,GAAA;AACjC,EAAA,MAAM,MAAA,GAAS,OAAA,CAAQ,IAAA,EAAM,MAAA,CAAO,MAAM,KAAK,CAAA;AAC/C,EAAA,MAAM,KAAA,GAAQ,GAAA,CAAI,KAAA,IAAS,MAAA,CAAO,KAAA;AAClC,EAAA,MAAM,OAAA,GAAU,GAAA,CAAI,OAAA,IAAW,MAAA,CAAO,OAAA;AACtC,EAAA,OAAO,KAAA,KAAU,IAAI,KAAA,IAAS,OAAA,KAAY,IAAI,OAAA,GAAU,GAAA,GAAM,EAAE,KAAA,EAAO,OAAA,EAAQ;AACjF;AAoBO,SAAS,WAAA,CACd,QAAiC,IAAA,EAAc,KAAA,EAA2B,EAAE,SAAA,EAAW,UAAA,EAAW,GAAwB,EAAC,EAChH;AACX,EAAA,MAAM,GAAA,GAAM,OAAA,CAAQ,MAAA,EAAQ,IAAA,EAAM,KAAK,CAAA;AACvC,EAAA,MAAM,IAAA,GAAO,UAAA,CAAW,MAAA,EAAQ,IAAI,CAAA;AACpC,EAAA,OAAO,IAAA,EAAM,IAAA,KAAS,OAAA,GAAU,cAAA,CAAe,GAAA,EAAK,MAAmB,SAAA,IAAa,MAAA,EAAQ,UAAA,IAAc,KAAK,CAAA,GAAI,GAAA;AACrH;;;ACrGA,IAAM,KAAA,GAAQ,CAAC,MAAA,EAAgB,GAAA,KAAyB,MAAA,KAAW,KAAK,GAAA,GAAM,CAAA,EAAG,MAAM,CAAA,CAAA,EAAI,GAAG,CAAA,CAAA;AAgD9F,SAAS,SAAS,EAAE,SAAA,EAAW,YAAY,MAAA,EAAQ,SAAA,EAAW,YAAW,EAAgB;AACvF,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAY;AACjC,EAAA,MAAM,MAAA,uBAAa,GAAA,EAAY;AAE/B,EAAA,MAAM,IAAA,GAAO,CAAC,IAAA,EAAgB,IAAA,EAAc,OAAkB,KAAA,KAA+C;AAC3G,IAAA,MAAM,GAAA,GAAM,cAAA,CAAe,KAAA,EAAO,IAAA,EAAM,KAAK,CAAA;AAC7C,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,IAAA,KAAS,OAAA,IAAW,SAAA,GAAY,cAAA,CAAe,GAAA,EAAK,IAAA,EAAmB,SAAA,EAAW,UAAA,IAAc,KAAK,CAAA,GAAI,GAAA;AAC5H,IAAA,OAAO,KAAA,CAAM,SAAS,UAAA,GAAa,MAAA,CAAO,MAAM,IAAA,EAAM,KAAA,EAAO,KAAK,CAAA,GAAI,IAAA;AAAA,EACxE,CAAA;AAGA,EAAA,MAAM,MAAA,GAAS,CAAC,IAAA,EAAgB,IAAA,EAAc,OAAkB,KAAA,KAAwC;AACtG,IAAA,IAAI,CAAC,KAAA,CAAM,KAAA,EAAO,MAAA,CAAO,IAAI,IAAI,CAAA;AACjC,IAAA,IAAI,CAAC,KAAA,CAAM,OAAA,EAAS,QAAA,CAAS,IAAI,IAAI,CAAA;AACrC,IAAA,IAAI,IAAA,CAAK,SAAS,QAAA,EAAU;AAC1B,MAAA,MAAM,WAAW,OAAA,CAAS,IAAA,CAAoB,QAAA,EAAU,IAAA,EAAM,OAAO,KAAK,CAAA;AAC1E,MAAA,OAAO,aAAc,IAAA,CAAoB,QAAA,GAAW,OAAQ,EAAE,GAAG,MAAM,QAAA,EAAS;AAAA,IAClF;AACA,IAAA,IAAI,IAAA,CAAK,IAAA,KAAS,MAAA,IAAU,IAAA,CAAK,SAAS,KAAA,EAAO;AAC/C,MAAA,MAAM,EAAE,MAAK,GAAI,IAAA;AAEjB,MAAA,IAAI,IAAA,KAAS,QAAW,OAAO,IAAA;AAE/B,MAAA,MAAM,QAAQ,MAAA,CAAO,IAAA,EAAM,KAAA,CAAM,IAAA,EAAM,UAAU,CAAA,EAAG,cAAA,CAAe,KAAA,EAAO,EAAE,UAAU,IAAA,CAAK,QAAA,EAAS,EAAG,MAAM,GAAG,MAAM,CAAA;AACtH,MAAA,OAAO,UAAU,IAAA,GAAO,IAAA,GAAQ,EAAE,GAAG,IAAA,EAAM,MAAM,KAAA,EAAM;AAAA,IACzD;AACA,IAAA,IAAI,IAAA,CAAK,IAAA,KAAS,OAAA,EAAS,OAAO,IAAA;AAClC,IAAA,MAAM,EAAE,UAAS,GAAI,IAAA;AACrB,IAAA,IAAI,OAAA,GAAU,KAAA;AACd,IAAA,MAAM,OAA8B,EAAC;AACrC,IAAA,KAAA,MAAW,CAAC,GAAA,EAAK,OAAO,KAAK,MAAA,CAAO,OAAA,CAAQ,QAAQ,CAAA,EAAG;AACrD,MAAA,MAAM,WAAW,OAAA,CAAQ,OAAA,CAAQ,QAAA,EAAU,IAAA,EAAM,OAAO,KAAK,CAAA;AAC7D,MAAA,OAAA,KAAY,aAAa,OAAA,CAAQ,QAAA;AACjC,MAAA,IAAA,CAAK,GAAG,IAAI,QAAA,KAAa,OAAA,CAAQ,WAAW,OAAA,GAAU,EAAE,GAAG,OAAA,EAAS,QAAA,EAAS;AAAA,IAC/E;AACA,IAAA,OAAO,UAAW,EAAE,GAAG,IAAA,EAAM,QAAA,EAAU,MAAK,GAAiB,IAAA;AAAA,EAC/D,CAAA;AAGA,EAAA,MAAM,OAAA,GAAU,CAAC,IAAA,EAA8B,MAAA,EAAgB,OAAkB,KAAA,KAAsD;AACrI,IAAA,IAAI,OAAA,GAAU,KAAA;AACd,IAAA,MAAM,MAA8B,EAAC;AACrC,IAAA,KAAA,MAAW,CAAC,GAAA,EAAK,KAAK,KAAK,MAAA,CAAO,OAAA,CAAQ,IAAI,CAAA,EAAG;AAC/C,MAAA,MAAM,OAAO,UAAA,CAAW,KAAK,CAAA,GAAI,IAAA,CAAK,OAAO,KAAA,CAAM,MAAA,EAAQ,GAAG,CAAA,EAAG,OAAO,KAAK,CAAA,GAAI,QAAQ,KAAA,EAAO,MAAA,EAAQ,OAAO,KAAK,CAAA;AACpH,MAAA,OAAA,KAAY,IAAA,KAAS,KAAA;AACrB,MAAA,IAAI,IAAA,KAAS,IAAA,EAAM,GAAA,CAAI,GAAG,CAAA,GAAI,IAAA;AAAA,IAChC;AACA,IAAA,OAAO,UAAU,GAAA,GAAM,IAAA;AAAA,EACzB,CAAA;AAEA,EAAA,MAAM,OAAA,GAAU,CAAC,IAAA,EAAmB,MAAA,EAAgB,OAAkB,KAAA,KAAkD;AACtH,IAAA,MAAM,KAAA,GAAQ,cAAA,CAAe,KAAA,EAAO,IAAA,EAAM,KAAK,CAAA;AAC/C,IAAA,IAAI,CAAC,KAAA,CAAM,KAAA,IAAS,CAAC,YAAY,OAAO,IAAA;AACxC,IAAA,MAAM,OAAO,OAAA,CAAQ,IAAA,CAAK,OAAA,EAAS,MAAA,EAAQ,OAAO,KAAK,CAAA;AACvD,IAAA,IAAI,IAAA,KAAS,IAAA,CAAK,OAAA,EAAS,OAAO,IAAA;AAClC,IAAA,OAAO,MAAA,CAAO,IAAA,CAAK,IAAI,CAAA,CAAE,MAAA,KAAW,CAAA,IAAK,CAAC,SAAA,GAAY,IAAA,GAAO,EAAE,GAAG,IAAA,EAAM,SAAS,IAAA,EAAK;AAAA,EACxF,CAAA;AAEA,EAAA,OAAO,EAAE,QAAA,EAAU,MAAA,EAAQ,IAAA,EAAM,QAAQ,OAAA,EAAQ;AACnD;AAkBO,SAAS,mBAAA,CACd,MAAA,EACA,KAAA,EACA,EAAE,SAAA,GAAY,KAAA,EAAO,UAAA,GAAa,KAAA,EAAO,SAAA,EAAW,UAAA,EAAW,GAA2B,EAAC,EACjE;AAC1B,EAAA,MAAM,IAAA,GAAO,QAAA,CAAS,EAAE,SAAA,EAAW,UAAA,EAAY,MAAA,EAAQ,oBAAA,CAAqB,KAAK,CAAA,EAAG,SAAA,EAAW,SAAA,IAAa,MAAA,EAAQ,YAAY,CAAA;AAChI,EAAA,MAAM,EAAE,QAAA,EAAU,MAAA,EAAO,GAAI,IAAA;AAE7B,EAAA,MAAM,KAAA,GAAQ,CAAC,IAAA,EAAiB,IAAA,EAAc,KAAA,KAAuC;AACnF,IAAA,MAAMA,MAAAA,GAAQ,cAAA,CAAe,KAAA,EAAO,IAAA,EAAM,KAAK,CAAA;AAC/C,IAAA,IAAI,CAACA,MAAAA,CAAM,KAAA,IAAS,CAAC,YAAY,OAAO,IAAA;AACxC,IAAA,IAAI,CAACA,MAAAA,CAAM,KAAA,IAAS,SAAS,EAAA,EAAI,MAAA,CAAO,IAAI,IAAI,CAAA;AAChD,IAAA,IAAI,CAACA,MAAAA,CAAM,OAAA,IAAW,SAAS,EAAA,EAAI,QAAA,CAAS,IAAI,IAAI,CAAA;AACpD,IAAA,IAAI,OAAA,GAAU,KAAA;AACd,IAAA,MAAM,WAAkC,EAAC;AACzC,IAAA,KAAA,MAAW,CAAC,KAAK,KAAK,CAAA,IAAK,OAAO,OAAA,CAAQ,IAAA,CAAK,QAAQ,CAAA,EAAG;AACxD,MAAA,MAAM,EAAA,GAAK,KAAA,CAAM,IAAA,EAAM,GAAG,CAAA;AAC1B,MAAA,MAAMC,KAAAA,GAAO,UAAA,CAAW,KAAK,CAAA,GAAI,KAAK,IAAA,CAAK,KAAA,EAAO,EAAA,EAAID,MAAAA,EAAO,KAAK,CAAA,GAAI,KAAA,CAAM,KAAA,EAAO,IAAIA,MAAK,CAAA;AAC5F,MAAA,OAAA,KAAYC,KAAAA,KAAS,KAAA;AACrB,MAAA,IAAIA,KAAAA,KAAS,IAAA,EAAM,QAAA,CAAS,GAAG,CAAA,GAAIA,KAAAA;AAAA,IACrC;AACA,IAAA,IAAI,CAAC,SAAS,OAAO,IAAA;AACrB,IAAA,OAAO,MAAA,CAAO,IAAA,CAAK,QAAQ,CAAA,CAAE,WAAW,CAAA,IAAK,CAAC,SAAA,IAAa,IAAA,KAAS,EAAA,GAAK,IAAA,GAAO,EAAE,GAAG,MAAM,QAAA,EAAS;AAAA,EACtG,CAAA;AAEA,EAAA,IAAI,CAAC,aAAA,CAAc,MAAM,CAAA,EAAG,OAAO,EAAE,KAAA,EAAO,KAAA,CAAM,MAAA,EAAQ,EAAA,EAAI,UAAU,CAAA,EAAe,UAAU,MAAA,EAAO;AACxG,EAAA,MAAM,KAAA,GAAQ,cAAA,CAAe,UAAA,EAAY,MAAA,EAAQ,KAAK,CAAA;AACtD,EAAA,IAAI,CAAC,KAAA,CAAM,KAAA,IAAS,CAAC,UAAA,SAAmB,EAAE,KAAA,EAAO,IAAA,EAAM,QAAA,EAAU,MAAA,EAAO;AACxE,EAAA,MAAM,OAAO,IAAA,CAAK,OAAA,CAAQ,OAAO,OAAA,EAAS,EAAA,EAAI,OAAO,KAAK,CAAA;AAC1D,EAAA,OAAO,EAAE,KAAA,EAAO,IAAA,KAAS,MAAA,CAAO,OAAA,GAAU,MAAA,GAAS,EAAE,GAAG,MAAA,EAAQ,OAAA,EAAS,IAAA,EAAK,EAAG,UAAU,MAAA,EAAO;AACpG;AAYA,IAAM,SAA6B,MAAM,IAAA;AAUlC,SAAS,wBAAA,CACd,IAAA,EACA,IAAA,EACA,KAAA,EACA,EAAE,SAAA,GAAY,KAAA,EAAO,UAAA,GAAa,KAAA,EAAM,GAA6D,EAAC,EACpF;AAClB,EAAA,MAAM,KAAA,GAA4B,CAAC,SAAA,EAAW,KAAA,KAAU,CAAC,uBAAuB,SAAS,CAAA,IAAK,KAAA,CAAM,SAAA,EAAW,KAAK,CAAA;AACpH,EAAA,MAAM,OAAO,QAAA,CAAS,EAAE,WAAW,UAAA,EAAY,MAAA,EAAQ,QAAQ,CAAA;AAC/D,EAAA,MAAM,KAAA,GAAQ,eAAe,UAAA,EAAY,EAAE,UAAU,IAAA,CAAK,QAAA,IAAY,KAAK,CAAA;AAC3E,EAAA,OAAO,EAAE,IAAA,EAAM,IAAA,CAAK,MAAA,CAAO,MAAM,IAAA,EAAM,KAAA,EAAO,KAAK,CAAA,EAAG,QAAA,EAAU,IAAA,CAAK,QAAA,EAAU,MAAA,EAAQ,KAAK,MAAA,EAAO;AACrG;;;ACxKA,SAAS,gBAAgB,IAAA,EAA0B;AACjD,EAAA,IAAI,IAAA,CAAK,IAAA,KAAS,QAAA,EAAU,OAAO,IAAA;AACnC,EAAA,MAAM,KAAA,GAAQ,mBAAmB,EAAE,GAAG,MAAM,MAAA,EAAQ,KAAA,EAAM,EAAG,KAAA,EAAO,IAAI,CAAA;AACxE,EAAA,OAAO,EAAE,GAAG,IAAA,EAAM,QAAA,EAAU,MAAM,QAAA,EAAS;AAC7C;AAUO,SAAS,gBAAA,CACd,IAAA,EACA,KAAA,EACA,EAAE,UAAA,GAAa,OAAO,UAAA,GAAa,KAAA,EAAM,GAA6B,EAAC,EACrD;AAClB,EAAA,MAAM,QAAQ,KAAA,EAAM;AACpB,EAAA,IAAI,OAAA;AACJ,EAAA,MAAM,GAAA,GAAM,MACT,OAAA,KAAY,mBAAA,CAAoB,IAAA,EAAM,KAAA,EAAO,EAAE,SAAA,EAAW,IAAA,EAAM,UAAA,EAAY,UAAA,EAAY,CAAA;AAC3F,EAAA,MAAM,MAAA,GAAS,CAAC,IAAA,KAAuC;AACrD,IAAA,MAAM,EAAE,KAAA,EAAM,GAAI,GAAA,EAAI;AACtB,IAAA,MAAM,OAAO,KAAA,KAAU,IAAA,GAAO,MAAA,GAAY,UAAA,CAAW,OAAO,IAAI,CAAA;AAChE,IAAA,OAAO,IAAA,KAAS,MAAA,IAAa,UAAA,GAAa,IAAA,GAAO,gBAAgB,IAAI,CAAA;AAAA,EACvE,CAAA;AACA,EAAA,OAAO;AAAA,IACL,KAAA;AAAA,IACA,MAAA;AAAA,IACA,KAAA,EAAO,CAAC,KAAA,KAAU;AAChB,MAAA,MAAM,MAAA,GAAS,eAAA,CAAgB,KAAA,EAAO,MAAM,CAAA;AAC5C,MAAA,OAAO,MAAA,IAAU,EAAE,IAAA,EAAM,MAAA,CAAO,IAAA,EAAM,MAAM,eAAA,CAAgB,KAAA,EAAO,MAAA,CAAO,IAAI,CAAA,EAAE;AAAA,IAClF,CAAA;AAAA,IACA,YAAY,CAAC,IAAA,KAAS,KAAI,CAAE,QAAA,CAAS,IAAI,IAAI,CAAA;AAAA,IAC7C,GAAI,UAAA,GAAa,EAAE,QAAA,EAAU,CAAC,IAAA,KAAiB,GAAA,EAAI,CAAE,MAAA,CAAO,GAAA,CAAI,IAAI,CAAA,KAAM,EAAC;AAAA,IAC3E,SAAS,CAAC,IAAA,EAAM,IAAA,EAAM,KAAA,KAAU,yBAAyB,IAAA,EAAM,IAAA,EAAM,KAAA,CAAM,EAAE,MAAM,KAAA,EAAO,GAAG,EAAE,UAAA,EAAY,YAAY;AAAA,GACzH;AACF;;;AC3EA,IAAM,WAAW,CAAC,CAAA,KAA6C,OAAO,CAAA,KAAM,YAAY,CAAA,KAAM,IAAA;AAOvF,SAAS,cAAA,CAAe,MAAkB,IAAA,EAAwC;AACvF,EAAA,IAAI,QAAA,CAAS,IAAI,CAAA,EAAG,OAAO,IAAA;AAC3B,EAAA,OAAO,IAAA,CAAK,UAAA,GAAa,IAAI,CAAA,KAAM,QAAA,CAAS,KAAK,OAAO,CAAA,GAAI,IAAA,CAAK,OAAA,GAAU,EAAC,CAAA;AAC9E;AAIO,SAAS,mBAAA,CAAoB,IAAA,EAAkB,IAAA,EAAe,GAAA,EAAa,KAAA,EAAyC;AACzH,EAAA,MAAM,IAAA,GAAO,cAAA,CAAe,IAAA,EAAM,IAAI,CAAA;AACtC,EAAA,IAAI,KAAA,KAAU,QAAW,OAAO,EAAE,GAAG,IAAA,EAAM,CAAC,GAAG,GAAG,KAAA,EAAM;AACxD,EAAA,MAAM,EAAE,CAAC,GAAG,GAAG,QAAA,EAAU,GAAG,MAAK,GAAI,IAAA;AACrC,EAAA,OAAO,IAAA;AACT;;;ACXO,SAAS,QAAA,CAA6B,MAAc,IAAA,EAA+B;AACxF,EAAA,OAAO,EAAE,GAAG,IAAA,EAAM,IAAA,EAAM,IAAA,EAAK;AAC/B;;;ACyDO,SAAS,gBAAgB,KAAA,EAA2B;AACzD,EAAA,OAAO,KAAA,CAAM,EAAA,KAAO,MAAA,IAAa,KAAA,CAAM,EAAA,KAAO,MAAA;AAChD;;;ACxDO,SAAS,QAAA,CACd,OACA,MAAA,EACc;AACd,EAAA,MAAM,MAAA,GAAS,KAAA,CAAM,GAAA,CAAI,MAAM,CAAA;AAC/B,EAAA,MAAM,KAAA,GAAQ,WAAW,MAAA,CAAO,MAAA,CAAO,CAAC,KAAA,KAAU,KAAA,KAAU,MAAS,CAAC,CAAA;AACtE,EAAA,MAAM,IAAA,GAAO,MAAA,CAAO,GAAA,CAAI,CAAC,KAAA,KAAW,KAAA,KAAU,MAAA,GAAY,MAAA,GAAY,KAAA,CAAM,GAAA,CAAI,KAAA,CAAM,CAAC,CAAC,CAAE,CAAA;AAC1F,EAAA,MAAM,OAAqB,EAAC;AAC5B,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,CAAM,MAAA,IAAU;AAClC,IAAA,MAAM,IAAA,GAAO,KAAK,CAAC,CAAA;AACnB,IAAA,IAAI,IAAI,CAAA,GAAI,CAAA;AACZ,IAAA,OAAO,IAAA,KAAS,UAAa,IAAA,CAAK,CAAC,GAAG,GAAA,KAAQ,IAAA,CAAK,KAAK,CAAA,IAAK,CAAA;AAC7D,IAAA,IAAA,CAAK,IAAA,CAAK,IAAI,CAAA,GAAI,CAAA,GAAI,EAAE,KAAA,EAAO,KAAA,CAAM,MAAM,CAAA,EAAG,CAAC,GAAG,IAAA,EAAK,GAAI,EAAE,KAAA,EAAO,CAAC,MAAM,CAAC,CAAE,GAAG,CAAA;AACjF,IAAA,CAAA,GAAI,CAAA;AAAA,EACN;AACA,EAAA,OAAO,IAAA;AACT;;;ACnBA,IAAM,GAAA,GAAsB,EAAE,QAAA,EAAU,KAAA,EAAO,SAAS,KAAA,EAAM;AAC9D,IAAM,IAAA,GAAuB,EAAE,QAAA,EAAU,IAAA,EAAM,SAAS,IAAA,EAAK;AAQtD,IAAM,gBAAA,GAAqD;AAAA,EAChE,MAAA,EAAQ,GAAA;AAAA,EACR,OAAA,EAAS,GAAA;AAAA,EACT,MAAA,EAAQ,GAAA;AAAA,EACR,IAAA,EAAM,GAAA;AAAA,EACN,KAAA,EAAO,GAAA;AAAA,EACP,KAAA,EAAO,GAAA;AAAA,EACP,MAAA,EAAQ,IAAA;AAAA,EACR,IAAA,EAAM,IAAA;AAAA,EACN,GAAA,EAAK,IAAA;AAAA,EACL,KAAA,EAAO,IAAA;AAAA,EACP,KAAA,EAAO,GAAA;AAAA,EACP,MAAA,EAAQ,EAAE,QAAA,EAAU,KAAA,EAAO,SAAS,IAAA,EAAK;AAAA,EACzC,KAAA,EAAO,GAAA;AAAA,EACP,KAAA,EAAO,GAAA;AAAA,EACP,SAAA,EAAW;AACb;AAEA,IAAM,QAAA,GAAW,CAAC,IAAA,KACf,MAAA,CAAO,MAAA,CAAO,gBAAA,EAAkB,IAAA,CAAK,IAAI,CAAA,GAAI,gBAAA,CAAiB,IAAA,CAAK,IAAgB,CAAA,GAAI,GAAA;AAGnF,SAAS,eAAe,IAAA,EAAiC;AAC9D,EAAA,OAAO,QAAA,CAAS,IAAI,CAAA,CAAE,QAAA;AACxB;AAGO,SAAS,iBAAiB,IAAA,EAAiC;AAChE,EAAA,OAAO,QAAA,CAAS,IAAI,CAAA,CAAE,OAAA;AACxB","file":"index.js","sourcesContent":["/** One step of a walk over a group's children: a child on its own, or the neighboring `tab` children that share one strip. */\nexport type PrefTabRun<T> = { item: T; tabs?: undefined } | { tabs: readonly T[]; item?: undefined };\n\n/**\n * `items` in order, each run of neighbors `isTab` holds for folded into one step. What a surface leaves out of\n * `items` neither joins a run nor ends one, and what it keeps and then declines to draw still holds its run together.\n */\nexport function prefTabRuns<T>(items: readonly T[], isTab: (item: T) => boolean): PrefTabRun<T>[] {\n  const out: PrefTabRun<T>[] = [];\n  let run: T[] | undefined;\n  for (const item of items) {\n    if (!isTab(item)) {\n      run = undefined;\n      out.push({ item });\n    } else if (run) {\n      run.push(item);\n    } else {\n      out.push({ tabs: (run = [item]) });\n    }\n  }\n  return out;\n}\n","// A stored value as the control over its leaf shows it. A condition compares\n// that, and not the stored form: a person writes \"is on\" about an Italic\n// toggle, whatever string the toggle stores.\n\nimport type { PrefConditionReader } from './condition';\nimport type { PrefGroup, PrefSection } from './groups';\nimport { prefLeafHolding, prefLeafHoldingIn, prefSchemaHolding, UNSEEN } from './holding';\nimport type { PrefBoolean, PrefEnum, PrefLeaf } from './schema';\n\ntype Siblings = Record<string, unknown> | undefined;\n\n/** What the control over `leaf` shows for `stored`: what its `encoding` reads it as, else `stored` itself.\n *  `siblings` is the object the leaf is a field of. */\nexport function prefShownValue(leaf: PrefLeaf, stored: unknown, siblings?: Record<string, unknown>): unknown {\n  if (leaf.kind !== 'boolean' && leaf.kind !== 'enum') return stored;\n  const { encoding } = leaf as PrefBoolean | PrefEnum;\n  return encoding ? (encoding.read as (stored: unknown, siblings: Siblings) => unknown)(stored, siblings) : stored;\n}\n\n/**\n * `read` with each value handed back as {@link prefShownValue} gives it, for\n * the leaf of `schema` at that path, a field of an `object` or a `union` leaf\n * included. A field's siblings are what `read` finds at its leaf's path. A\n * path read from the entry is held to `item`, the leaf describing that entry.\n * A path no leaf of `schema` holds is held to `over`, the schema it is drawn\n * over.\n */\nexport function prefShownReader(\n  schema: PrefGroup | PrefSection, read: PrefConditionReader, item?: PrefLeaf, over?: PrefGroup | PrefSection,\n): PrefConditionReader {\n  return (path, from) => {\n    const stored = read(path, from);\n    const held = from === 'item' ? item && prefLeafHoldingIn(item, path) : prefLeafHolding(prefSchemaHolding(schema, path, over), path);\n    if (held === undefined || held === UNSEEN) return stored;\n    const object = held.within === undefined ? undefined : read(held.within, from);\n    return prefShownValue(held.leaf, stored, typeof object === 'object' && object !== null ? (object as Siblings) : undefined);\n  };\n}\n","// Who answers a condition: a judge, made from a way to read values.\n\nimport { prefConditionHolds, prefConditionReadsItem, type PrefCondition, type PrefConditionReader } from './condition';\nimport type { PrefGroup, PrefSection } from './groups';\nimport { isPrefLeaf, isPrefSection, prefSectionLeaves, prefValueAtPath } from './helpers';\nimport { prefSchemaHolding } from './holding';\nimport type { PrefLeaf } from './schema';\nimport { prefShownReader } from './shown';\n\n/** Which of a node's two conditions a {@link PrefConditionJudge} is asked about. */\nexport type PrefConditionField = 'showIf' | 'enableIf';\n\n/**\n * Says whether one condition holds. {@link prefJudge} makes one from a value\n * reader; a surface drawing several values at once writes its own, to say\n * what a condition that holds for some and not for others comes to.\n */\nexport type PrefConditionJudge = (condition: PrefCondition, field: PrefConditionField) => boolean;\n\n/** One entry of a list or a map: the `item` leaf describing it, and what it holds. */\nexport interface PrefEntry {\n  item: PrefLeaf;\n  value: unknown;\n}\n\n/** What `entry` holds at `path`, the empty path being the entry itself: its own value, else that part of the item's default. */\nfunction entryValue({ item, value }: PrefEntry, path: string): unknown {\n  if (path === '') return value !== undefined ? value : item.default;\n  const held = prefValueAtPath(value, path);\n  return held !== undefined ? held : prefValueAtPath(item.default, path);\n}\n\n/**\n * A judge over one set of values, read by path. A condition compares each\n * value as the control over its leaf in `schema` shows it\n * ({@link prefShownReader}), so `read` hands back what is stored. A test\n * that reads from the entry (`from: 'item'`) reads `entry`, and finds nothing\n * held where none is given. `over` is the schema `schema` is drawn over: a\n * path no leaf of `schema` holds is compared as the leaf of `over` there\n * shows it.\n */\nexport function prefJudge(\n  schema: PrefGroup | PrefSection, read: (path: string) => unknown, entry?: PrefEntry, over?: PrefGroup | PrefSection,\n): PrefConditionJudge {\n  const stored: PrefConditionReader = (path, from) => (from === 'item' ? entry && entryValue(entry, path) : read(path));\n  const shown = prefShownReader(schema, stored, entry?.item, over);\n  return (condition) => prefConditionHolds(condition, shown);\n}\n\n/**\n * `holds` for every condition but one that reads the entry, which is left\n * unanswered, which is to say holding: what a walk with no entry in hand\n * asks inside the item of a list or a map.\n */\nexport function deferEntryConditions(holds: PrefConditionJudge): PrefConditionJudge {\n  return (condition, field) => prefConditionReadsItem(condition) || holds(condition, field);\n}\n\n/**\n * Reads a value by path the way a form over `schema` shows it: what `values`\n * holds there, else the default of the leaf at that path, or the part of a\n * leaf's default the rest of the path names. `over` is the schema `schema`\n * is drawn over: a path no leaf of `schema` holds takes its default there.\n */\nexport function prefReader(schema: PrefGroup | PrefSection, values: unknown, over?: PrefGroup | PrefSection): (path: string) => unknown {\n  const beyond = over && prefReader(over, values);\n  return (path) => {\n    const held = prefValueAtPath(values, path);\n    if (held !== undefined) return held;\n    if (beyond && prefSchemaHolding(schema, path, over) === over) return beyond(path);\n    if (isPrefSection(schema)) {\n      for (const [key, leaf] of prefSectionLeaves(schema.members)) {\n        if (path === key) return leaf.default;\n        if (path.startsWith(`${key}.`)) return prefValueAtPath(leaf.default, path.slice(key.length + 1));\n      }\n      return undefined;\n    }\n    const steps = path.split('.');\n    let node: PrefGroup = schema;\n    for (let i = 0; i < steps.length; i++) {\n      if (!Object.hasOwn(node.children, steps[i]!)) return undefined;\n      const child: PrefLeaf | PrefGroup = node.children[steps[i]!]!;\n      if (!isPrefLeaf(child)) node = child;\n      else return i === steps.length - 1 ? child.default : prefValueAtPath(child.default, steps.slice(i + 1).join('.'));\n    }\n    return undefined;\n  };\n}\n","// The scope of one node: whether it is drawn and whether it takes input,\n// with everything above it counted.\n\nimport { prefAliasTarget, type PrefAlias } from './alias';\nimport type { PrefCondition } from './condition';\nimport type { PrefGroup, PrefSection } from './groups';\nimport { isPrefLeaf, isPrefSection, prefLeafAt } from './helpers';\nimport { deferEntryConditions, type PrefConditionJudge } from './judge';\nimport type { PrefList } from './list';\nimport type { PrefMap } from './map';\nimport type { PrefLeaf, PrefObject } from './schema';\nimport type { PrefUnion } from './union';\n\n/** Whether a node is drawn and whether it takes input, with what is above it counted. */\nexport interface PrefScope {\n  shown: boolean;\n  enabled: boolean;\n}\n\n/** The step that stands for any entry of a `list` or a `map` in a path: `'phases.*.hold'` answers for that field of\n *  each, by every condition that comes to the same for every entry. */\nexport const PREF_ENTRY = '*';\n\n/** The scope a schema's root sits in. */\nexport const PREF_SCOPE: PrefScope = Object.freeze({ shown: true, enabled: true });\n\n/** The scope of `node`, which sits directly under something whose scope is `above`. */\nexport function prefScopeUnder(\n  above: PrefScope,\n  node: { showIf?: PrefCondition; enableIf?: PrefCondition },\n  holds: PrefConditionJudge,\n): PrefScope {\n  const shown = above.shown && (node.showIf === undefined || holds(node.showIf, 'showIf'));\n  const enabled = above.enabled && (node.enableIf === undefined || holds(node.enableIf, 'enableIf'));\n  return shown === above.shown && enabled === above.enabled ? above : { shown, enabled };\n}\n\n/** The scope of the field at `rest` among an object leaf's children, or `undefined` when none is there. */\nfunction scopeAmong(\n  held: PrefSection['members'], rest: string, above: PrefScope, holds: PrefConditionJudge,\n): PrefScope | undefined {\n  for (const [key, child] of Object.entries(held)) {\n    if (!isPrefLeaf(child)) {\n      const found = scopeAmong(child.members, rest, prefScopeUnder(above, child, holds), holds);\n      if (found) return found;\n    } else if (rest === key) return prefScopeUnder(above, child, holds);\n    else if (rest.startsWith(`${key}.`)) return scopeInside(child, rest.slice(key.length + 1), prefScopeUnder(above, child, holds), holds);\n  }\n  return undefined;\n}\n\n/** The scope at `rest` inside `leaf`, whose own scope is `scope`: that of a field, or the leaf's where `rest` names none. */\nfunction scopeInside(leaf: PrefLeaf, rest: string, scope: PrefScope, holds: PrefConditionJudge): PrefScope {\n  if (leaf.kind === 'object') return scopeAmong((leaf as PrefObject).children, rest, scope, holds) ?? scope;\n  if (leaf.kind === 'list' || leaf.kind === 'map') {\n    const { item } = leaf as Partial<PrefList | PrefMap>;\n    if (item === undefined) return scope;\n    const inItem = deferEntryConditions(holds);\n    const entry = prefScopeUnder(scope, { enableIf: item.enableIf }, inItem);\n    const dot = rest.indexOf('.');\n    return dot < 0 ? entry : scopeInside(item, rest.slice(dot + 1), entry, inItem);\n  }\n  if (leaf.kind !== 'union') return scope;\n  for (const variant of Object.values((leaf as PrefUnion).variants)) {\n    const found = scopeAmong(variant.children, rest, scope, holds);\n    if (found) return found;\n  }\n  return scope;\n}\n\nfunction scopeAt(schema: PrefGroup | PrefSection, path: string, holds: PrefConditionJudge): PrefScope {\n  let scope = prefScopeUnder(PREF_SCOPE, schema, holds);\n  if (path === '') return scope;\n  if (isPrefSection(schema)) return scopeAmong(schema.members, path, scope, holds) ?? scope;\n  let node: PrefGroup = schema;\n  const steps = path.split('.');\n  for (let i = 0; i < steps.length; i++) {\n    if (!Object.hasOwn(node.children, steps[i]!)) return scope;\n    const child: PrefLeaf | PrefGroup = node.children[steps[i]!]!;\n    scope = prefScopeUnder(scope, child, holds);\n    if (isPrefLeaf(child)) return i === steps.length - 1 ? scope : scopeInside(child, steps.slice(i + 1).join('.'), scope, holds);\n    node = child;\n  }\n  return scope;\n}\n\n/** `own`, an alias's scope by its own conditions, narrowed by that of the leaf it shows in `over`, as `holds` judges `over`. */\nexport function prefAliasScope(own: PrefScope, alias: PrefAlias, over: PrefGroup | PrefSection, holds: PrefConditionJudge): PrefScope {\n  const target = prefAliasTarget(alias, (path) => prefLeafAt(over, path));\n  if (target === undefined) return own;\n  const theirs = scopeAt(over, target.path, holds);\n  const shown = own.shown && theirs.shown;\n  const enabled = own.enabled && theirs.enabled;\n  return shown === own.shown && enabled === own.enabled ? own : { shown, enabled };\n}\n\n/** What {@link prefScopeAt} is told beyond the schema. */\nexport interface PrefScopeAtOptions {\n  /** The schema an alias's `of` names a leaf of. Default: the schema asked. */\n  aliasOver?: PrefGroup | PrefSection;\n  /** Says which conditions of `aliasOver` hold, where its values are not the ones `holds` reads. Default: `holds`. */\n  aliasHolds?: PrefConditionJudge;\n}\n\n/**\n * The scope of the node at `path`: a group, a leaf, a field of an `object`\n * or a `union` leaf, or an entry of a `list` or a `map`, whose step may be\n * any key. Under a {@link PrefSection} schema a leaf's key is its whole\n * path. A path that runs past the schema answers for the last node it\n * reaches. An alias answers for itself and for the leaf it shows, as\n * `applyPrefConditions` has it. Inside an entry, a condition that reads the\n * entry (`from: 'item'`) is not asked and counts as holding, there being no\n * entry here to read: `applyPrefEntryConditions` answers it.\n */\nexport function prefScopeAt(\n  schema: PrefGroup | PrefSection, path: string, holds: PrefConditionJudge, { aliasOver, aliasHolds }: PrefScopeAtOptions = {},\n): PrefScope {\n  const own = scopeAt(schema, path, holds);\n  const leaf = prefLeafAt(schema, path);\n  return leaf?.kind === 'alias' ? prefAliasScope(own, leaf as PrefAlias, aliasOver ?? schema, aliasHolds ?? holds) : own;\n}\n","// What a schema's conditions come to once nesting is counted: a node is drawn\n// only while it and everything above it is shown, and takes input only while\n// it and everything above it is enabled. Every surface that draws a schema\n// asks here.\n\nimport type { PrefAlias } from './alias';\nimport { prefConditionReadsItem } from './condition';\nimport type { PrefGroup, PrefSection } from './groups';\nimport { isPrefLeaf, isPrefSection } from './helpers';\nimport { deferEntryConditions, type PrefConditionJudge } from './judge';\nimport type { PrefList } from './list';\nimport type { PrefMap } from './map';\nimport type { PrefLeaf, PrefObject } from './schema';\nimport { PREF_ENTRY, PREF_SCOPE, prefAliasScope, prefScopeUnder, type PrefScope } from './scopeAt';\nimport type { PrefUnion } from './union';\n\nexport { prefJudge, prefReader, type PrefConditionField, type PrefConditionJudge, type PrefEntry } from './judge';\nexport { PREF_ENTRY, PREF_SCOPE, prefScopeAt, prefScopeUnder, type PrefScope, type PrefScopeAtOptions } from './scopeAt';\n\nconst under = (prefix: string, key: string): string => (prefix === '' ? key : `${prefix}.${key}`);\n\n/** A schema with its conditions applied. */\nexport interface PrefConditionsApplied<T> {\n  /** The schema without the nodes that are not shown. The schema itself when\n   *  that is all of it, and `null` when its root is not shown. */\n  shown: T | null;\n  /**\n   * The value path of every leaf that is disabled, a field of an `object` or\n   * a `union` leaf included (`'stroke.width'`), and under a {@link PrefGroup}\n   * schema the path of every group that is. A `list`'s or a `map`'s item is\n   * named once for every entry, with {@link PREF_ENTRY} as the entry's step:\n   * `'phases.*'`, and `'phases.*.hold'` for a field of it.\n   */\n  disabled: ReadonlySet<string>;\n  /**\n   * With `keepHidden`, the path of everything `shown` holds that is not\n   * shown, named as `disabled` names what is disabled. Empty without it,\n   * since `shown` then holds none.\n   */\n  hidden: ReadonlySet<string>;\n}\n\n/** How {@link applyPrefConditions} treats what it would leave out. */\nexport interface PrefConditionsOptions {\n  /** Keep a group or a section that leaves with nothing to draw. */\n  keepEmpty?: boolean;\n  /**\n   * Keep every node whose `showIf` fails, and name it in `hidden`: for a\n   * surface that edits the schema, where a node not drawn cannot be picked.\n   */\n  keepHidden?: boolean;\n  /** The schema an alias's `of` names a leaf of. Default: the schema walked. */\n  aliasOver?: PrefGroup | PrefSection;\n  /** Says which conditions of `aliasOver` hold, where its values are not the ones `holds` reads. Default: `holds`. */\n  aliasHolds?: PrefConditionJudge;\n}\n\ninterface WalkOptions {\n  keepEmpty: boolean;\n  keepHidden: boolean;\n  /** Asked inside the item of a list or a map met on the way, whose entries the walk does not have. */\n  inItem: PrefConditionJudge;\n  aliasOver?: PrefGroup | PrefSection;\n  aliasHolds?: PrefConditionJudge;\n}\n\n/** The walk over leaves and what is inside them, which the schema's pass and an entry's share. */\nfunction leafWalk({ keepEmpty, keepHidden, inItem, aliasOver, aliasHolds }: WalkOptions) {\n  const disabled = new Set<string>();\n  const hidden = new Set<string>();\n\n  const leaf = (node: PrefLeaf, path: string, above: PrefScope, holds: PrefConditionJudge): PrefLeaf | null => {\n    const own = prefScopeUnder(above, node, holds);\n    const scope = node.kind === 'alias' && aliasOver ? prefAliasScope(own, node as PrefAlias, aliasOver, aliasHolds ?? holds) : own;\n    return scope.shown || keepHidden ? inside(node, path, scope, holds) : null;\n  };\n\n  /** `node`, whose scope is `scope`, without what its own value hides: a field, or part of a list's or a map's item. */\n  const inside = (node: PrefLeaf, path: string, scope: PrefScope, holds: PrefConditionJudge): PrefLeaf => {\n    if (!scope.shown) hidden.add(path);\n    if (!scope.enabled) disabled.add(path);\n    if (node.kind === 'object') {\n      const children = members((node as PrefObject).children, path, scope, holds);\n      return children === (node as PrefObject).children ? node : ({ ...node, children } as PrefLeaf);\n    }\n    if (node.kind === 'list' || node.kind === 'map') {\n      const { item } = node as Partial<PrefList | PrefMap>;\n      // A leaf an app's renderer draws under a built-in's kind may hold no item.\n      if (item === undefined) return node;\n      // An item is drawn with its entry, so its own `showIf` is not asked.\n      const entry = inside(item, under(path, PREF_ENTRY), prefScopeUnder(scope, { enableIf: item.enableIf }, inItem), inItem);\n      return entry === item ? node : ({ ...node, item: entry } as PrefLeaf);\n    }\n    if (node.kind !== 'union') return node;\n    const { variants } = node as PrefUnion;\n    let changed = false;\n    const next: PrefUnion['variants'] = {};\n    for (const [key, variant] of Object.entries(variants)) {\n      const children = members(variant.children, path, scope, holds);\n      changed ||= children !== variant.children;\n      next[key] = children === variant.children ? variant : { ...variant, children };\n    }\n    return changed ? ({ ...node, variants: next } as PrefLeaf) : node;\n  };\n\n  /** A section's members or an object leaf's children. `prefix` is the object leaf's path, empty in a section schema. */\n  const members = (held: PrefSection['members'], prefix: string, above: PrefScope, holds: PrefConditionJudge): PrefSection['members'] => {\n    let changed = false;\n    const out: PrefSection['members'] = {};\n    for (const [key, child] of Object.entries(held)) {\n      const kept = isPrefLeaf(child) ? leaf(child, under(prefix, key), above, holds) : section(child, prefix, above, holds);\n      changed ||= kept !== child;\n      if (kept !== null) out[key] = kept;\n    }\n    return changed ? out : held;\n  };\n\n  const section = (node: PrefSection, prefix: string, above: PrefScope, holds: PrefConditionJudge): PrefSection | null => {\n    const scope = prefScopeUnder(above, node, holds);\n    if (!scope.shown && !keepHidden) return null;\n    const kept = members(node.members, prefix, scope, holds);\n    if (kept === node.members) return node;\n    return Object.keys(kept).length === 0 && !keepEmpty ? null : { ...node, members: kept };\n  };\n\n  return { disabled, hidden, leaf, inside, members };\n}\n\n/**\n * `schema` as it is drawn while `holds` says which conditions hold. A node\n * whose `showIf` fails is dropped with everything under it, unless\n * `keepHidden`, and so is a group or a section that leaves with nothing to\n * draw, unless `keepEmpty`. A node\n * whose `enableIf` fails is disabled with everything under it. The item of\n * a `list` or a `map` is walked as its entries are drawn: its fields hide and\n * disable by their conditions, and its own `enableIf` disables every entry.\n * A condition there that reads the entry (`from: 'item'`) has no one answer\n * for every entry and is left holding: {@link applyPrefEntryConditions}\n * answers it for each.\n * An alias is shown only while it and the leaf it shows both are, and enabled\n * only while both are, with everything above that leaf counted. That leaf is\n * looked for in `aliasOver`, and its side is asked of `aliasHolds`.\n * Parts with nothing dropped come back as the objects they were.\n */\nexport function applyPrefConditions<T extends PrefGroup | PrefSection>(\n  schema: T,\n  holds: PrefConditionJudge,\n  { keepEmpty = false, keepHidden = false, aliasOver, aliasHolds }: PrefConditionsOptions = {},\n): PrefConditionsApplied<T> {\n  const walk = leafWalk({ keepEmpty, keepHidden, inItem: deferEntryConditions(holds), aliasOver: aliasOver ?? schema, aliasHolds });\n  const { disabled, hidden } = walk;\n\n  const group = (node: PrefGroup, path: string, above: PrefScope): PrefGroup | null => {\n    const scope = prefScopeUnder(above, node, holds);\n    if (!scope.shown && !keepHidden) return null;\n    if (!scope.shown && path !== '') hidden.add(path);\n    if (!scope.enabled && path !== '') disabled.add(path);\n    let changed = false;\n    const children: PrefGroup['children'] = {};\n    for (const [key, child] of Object.entries(node.children)) {\n      const at = under(path, key);\n      const kept = isPrefLeaf(child) ? walk.leaf(child, at, scope, holds) : group(child, at, scope);\n      changed ||= kept !== child;\n      if (kept !== null) children[key] = kept;\n    }\n    if (!changed) return node;\n    return Object.keys(children).length === 0 && !keepEmpty && path !== '' ? null : { ...node, children };\n  };\n\n  if (!isPrefSection(schema)) return { shown: group(schema, '', PREF_SCOPE) as T | null, disabled, hidden };\n  const scope = prefScopeUnder(PREF_SCOPE, schema, holds);\n  if (!scope.shown && !keepHidden) return { shown: null, disabled, hidden };\n  const kept = walk.members(schema.members, '', scope, holds);\n  return { shown: kept === schema.members ? schema : { ...schema, members: kept }, disabled, hidden };\n}\n\n/** One entry of a list or a map with the conditions that read it applied. */\nexport interface PrefEntryApplied {\n  /** The item as this entry draws it: without the fields not shown, and the item itself when that is all of them. */\n  item: PrefLeaf;\n  /** The path of the entry, and of every field in it, that is disabled, named as {@link PrefConditionsApplied} names them. */\n  disabled: ReadonlySet<string>;\n  /** With `keepHidden`, the path of every field of the entry that is not shown. */\n  hidden: ReadonlySet<string>;\n}\n\nconst ALWAYS: PrefConditionJudge = () => true;\n\n/**\n * The conditions {@link applyPrefConditions} leaves unanswered, answered for\n * one entry: `item`, as that pass left it, drawn for the entry at `path`\n * (`'phases.2'`) while `holds` says which conditions hold. `holds` reads the\n * entry: `prefJudge` given it. Only a condition that reads the entry is\n * asked, the rest being applied already, and one inside a list or a map\n * within the entry is left for that one's own entries.\n */\nexport function applyPrefEntryConditions(\n  item: PrefLeaf,\n  path: string,\n  holds: PrefConditionJudge,\n  { keepEmpty = false, keepHidden = false }: Pick<PrefConditionsOptions, 'keepEmpty' | 'keepHidden'> = {},\n): PrefEntryApplied {\n  const asked: PrefConditionJudge = (condition, field) => !prefConditionReadsItem(condition) || holds(condition, field);\n  const walk = leafWalk({ keepEmpty, keepHidden, inItem: ALWAYS });\n  const scope = prefScopeUnder(PREF_SCOPE, { enableIf: item.enableIf }, asked);\n  return { item: walk.inside(item, path, scope, asked), disabled: walk.disabled, hidden: walk.hidden };\n}\n","// The leaves a surface's aliases show: the schema they point into, as that\n// schema's own conditions leave it. Every surface that draws an alias asks\n// here, whether the schema is its own or another's.\n\nimport { prefAliasedLeaf, prefAliasTarget, type PrefAlias } from './alias';\nimport type { PrefGroup, PrefSection } from './groups';\nimport { prefLeafAt, visiblePrefSubtree } from './helpers';\nimport type { PrefConditionJudge, PrefEntry } from './judge';\nimport type { PrefLeaf, PrefObject } from './schema';\nimport { applyPrefConditions, applyPrefEntryConditions, type PrefConditionsApplied, type PrefEntryApplied } from './scope';\n\n/** What an alias row reads of the leaf it shows: the schema that leaf is in, as that schema's own conditions leave it. */\nexport interface PrefAliasTargets {\n  /** Says which conditions of that schema hold. */\n  holds: PrefConditionJudge;\n  /** The leaf at a path of that schema, without the fields the surface would leave out of the leaf's own row: one\n   *  marked `hidden`, and one a `showIf` hides, unless the surface draws those. */\n  leafAt: (path: string) => PrefLeaf | undefined;\n  /** The leaf `alias` is drawn as, under the alias's own name and description where it gives them, and the path\n   *  its value is read and written at. `undefined` for an alias of nothing. */\n  shown: (alias: PrefAlias) => { path: string; leaf: PrefLeaf } | undefined;\n  /** Whether the field at a path of that schema is one an `enableIf` disables. */\n  disabledAt: (path: string) => boolean;\n  /** Whether the field at a path of that schema is one a `showIf` hides, on a surface that draws those. */\n  hiddenAt?: (path: string) => boolean;\n  /** An entry of a list or a map of that schema, as the conditions that read the entry leave it. */\n  entryAt: (item: PrefLeaf, path: string, value: unknown) => PrefEntryApplied;\n}\n\n/** What a surface draws beyond the default, which its alias rows follow. */\nexport interface PrefAliasTargetsOptions {\n  /** The surface draws fields marked `hidden`. */\n  showHidden?: boolean;\n  /** The surface draws what a `showIf` hides, marked. */\n  markHidden?: boolean;\n}\n\n/** `leaf` without its fields marked `hidden`. The leaf's own mark is not asked: an alias shows a leaf the surface leaves out. */\nfunction visibleFieldsOf(leaf: PrefLeaf): PrefLeaf {\n  if (leaf.kind !== 'object') return leaf;\n  const shown = visiblePrefSubtree({ ...leaf, hidden: false }, false, true) as PrefObject;\n  return { ...leaf, children: shown.children } as PrefLeaf;\n}\n\n/**\n * {@link PrefAliasTargets} over `over`, the schema a surface's aliases point\n * into: the surface's own, or another's. `judge` answers `over`'s conditions\n * as the surface reads values, for one entry of a list or a map where it is\n * given one: `prefJudge` over `over`. A surface's own pass drops a leaf it\n * leaves out and keeps no path of another schema, so the leaves aliases show\n * are conditioned here, the first time one is asked for.\n */\nexport function prefAliasTargets(\n  over: PrefGroup | PrefSection,\n  judge: (entry?: PrefEntry) => PrefConditionJudge,\n  { showHidden = false, markHidden = false }: PrefAliasTargetsOptions = {},\n): PrefAliasTargets {\n  const holds = judge();\n  let applied: PrefConditionsApplied<PrefGroup | PrefSection> | undefined;\n  const get = (): PrefConditionsApplied<PrefGroup | PrefSection> =>\n    (applied ??= applyPrefConditions(over, holds, { keepEmpty: true, keepHidden: markHidden }));\n  const leafAt = (path: string): PrefLeaf | undefined => {\n    const { shown } = get();\n    const leaf = shown === null ? undefined : prefLeafAt(shown, path);\n    return leaf === undefined || showHidden ? leaf : visibleFieldsOf(leaf);\n  };\n  return {\n    holds,\n    leafAt,\n    shown: (alias) => {\n      const target = prefAliasTarget(alias, leafAt);\n      return target && { path: target.path, leaf: prefAliasedLeaf(alias, target.leaf) };\n    },\n    disabledAt: (path) => get().disabled.has(path),\n    ...(markHidden ? { hiddenAt: (path: string) => get().hidden.has(path) } : {}),\n    entryAt: (item, path, value) => applyPrefEntryConditions(item, path, judge({ item, value }), { keepHidden: markHidden }),\n  };\n}\n","import type { PrefObject } from './schema';\n\nconst isObject = (v: unknown): v is Record<string, unknown> => typeof v === 'object' && v !== null;\n\n/**\n * The object a write to one field of an `object` leaf starts from: `held` itself where it is one. Where it is\n * not, the write has to make a whole object, so it starts from the scalar lifted by the leaf's `fromScalar`, else\n * from the leaf's `default`: one field on its own is a stroke with a width and no paint.\n */\nexport function prefObjectBase(pref: PrefObject, held: unknown): Record<string, unknown> {\n  if (isObject(held)) return held;\n  return pref.fromScalar?.(held) ?? (isObject(pref.default) ? pref.default : {});\n}\n\n/** The object an `object` leaf holds after one of its fields is set: {@link prefObjectBase} with `key` at\n *  `value`, or without the key for `undefined`. */\nexport function prefObjectWithField(pref: PrefObject, held: unknown, key: string, value: unknown): Record<string, unknown> {\n  const base = prefObjectBase(pref, held);\n  if (value !== undefined) return { ...base, [key]: value };\n  const { [key]: _dropped, ...rest } = base;\n  return rest;\n}\n","import type { PrefLeaf } from './schema';\n\n/**\n * `leaf` as a named type: the same leaf carrying `name` in its `type` field.\n * Declared once beside the code that reads its value and used wherever a\n * schema wants one, spread with what that place sets for itself\n * (`{ ...GradientStop, name: 'First stop' }`), or as a list's or a map's\n * `item`. `name` is the identifier the type is exported under, which a schema\n * editor prints in place of the leaf's literal.\n */\nexport function prefType<L extends PrefLeaf>(name: string, leaf: L): L & { type: string } {\n  return { ...leaf, type: name };\n}\n","// The two branch nodes of a schema. They differ in whether a key is part of\n// the path a leaf's value lives at, and each holds its members under its own\n// property, so a schema of one kind is neither assignable to nor walkable as\n// the other.\n\nimport type { PrefCondition } from './condition';\nimport type { PrefLeaf } from './schema';\n\n/**\n * How a {@link PrefGroup} is drawn: `page` gets an entry in a form's rail and\n * a pane of its own; `tab` shares a tab strip with the `tab` groups beside it;\n * `panel` is a bordered, titled box; `section` is a heading over its rows;\n * `fragment` draws nothing of its own, so its rows sit among its neighbors'\n * as though they were written there. A fragment exists to hold things\n * together: one key for their values to nest under, one node to move.\n */\nexport type PrefGroupAs = 'page' | 'tab' | 'panel' | 'section' | 'fragment' | 'bar';\n\n/** How a {@link PrefSection} is drawn. */\nexport type PrefSectionAs = Exclude<PrefGroupAs, 'page'>;\n\n/**\n * A group whose key is a path segment: `view` > `gridDensity` is the leaf at\n * `view.gridDensity`, and its value nests the same way. The shape of a\n * preferences schema — what `openPrefs` stores, `PrefsForm` renders, and a\n * tool declares its options as. A key holds no `.`.\n */\nexport interface PrefGroup {\n  /** Heading for the group's rows. **Empty means no heading** — for a group\n   *  that exists to organize, not to name: one whose children are themselves\n   *  groups carrying the labels a reader needs. Give it a name whenever the\n   *  name is the referent (a `Border` group over `Top` / `Right` / `Bottom`\n   *  reads as nothing without it). */\n  name: string;\n  description?: string;\n  /** How the group is drawn. Unset, its depth decides: a top-level group is a\n   *  `page`, and one inside another is a `section`. */\n  as?: PrefGroupAs;\n  /** Drawn, with everything under it, only while this holds. */\n  showIf?: PrefCondition;\n  /** Everything under it is disabled while this does not hold. */\n  enableIf?: PrefCondition;\n  children: Record<string, PrefLeaf | PrefGroup>;\n}\n\n/**\n * A heading over leaves that adds nothing to their paths: each member is\n * addressed by its own key alone, and the section's key only identifies the\n * section. The shape of a node's property schema, where a leaf's key is the\n * whole dotted node path (`pose.x`, `data.fill`), and of the headings inside\n * a {@link PrefObject}, where a key is relative to the object.\n */\nexport interface PrefSection {\n  /** Heading for the section's rows. Empty means no heading, as for a\n   *  {@link PrefGroup}. */\n  name: string;\n  description?: string;\n  /** How the section is drawn, as a {@link PrefGroup}'s `as` — without\n   *  `page`, since nothing that draws sections has a rail. Unset: a heading\n   *  over its rows. */\n  as?: PrefSectionAs;\n  /** As a {@link PrefGroup}'s. */\n  showIf?: PrefCondition;\n  /** As a {@link PrefGroup}'s. */\n  enableIf?: PrefCondition;\n  members: Record<string, PrefLeaf | PrefSection>;\n}\n\n/** Whether a top-level group gets a page of its own, and not a place on the page of the root's own leaves. */\nexport function prefGroupIsPage(group: PrefGroup): boolean {\n  return group.as === undefined || group.as === 'page';\n}\n","import { pairRowsOf, type PrefLeaf } from './schema';\n\n/** Neighboring items one row draws, in {@link pairRuns}' answer. */\nexport interface PairRun<T> {\n  items: T[];\n  /** The pairing the items share: the path of the leaf that declared it, and what the row reads. Absent on a\n   *  run of one, which is no pair. */\n  pair?: { key: string; label: string };\n}\n\n/**\n * `items` as the rows they draw, in order: each leaf a `pair` names joins the row of the leaf naming it where\n * the two are neighbors, and every other item is a run of its own. `leafOf` gives an item's leaf and the path a\n * `pair` would name it by, or nothing for an item that shares no row, which ends a run.\n */\nexport function pairRuns<T>(\n  items: readonly T[],\n  leafOf: (item: T) => readonly [path: string, leaf: PrefLeaf] | undefined,\n): PairRun<T>[] {\n  const leaves = items.map(leafOf);\n  const pairs = pairRowsOf(leaves.filter((entry) => entry !== undefined));\n  const keys = leaves.map((entry) => (entry === undefined ? undefined : pairs.get(entry[0])));\n  const runs: PairRun<T>[] = [];\n  for (let i = 0; i < items.length; ) {\n    const pair = keys[i];\n    let j = i + 1;\n    while (pair !== undefined && keys[j]?.key === pair.key) j += 1;\n    runs.push(j - i > 1 ? { items: items.slice(i, j), pair } : { items: [items[i]!] });\n    i = j;\n  }\n  return runs;\n}\n","import type { PrefKind } from './schema';\n\n/** What a surface has to know about a kind before it can lay its control out. */\nexport interface PrefKindTraits {\n  /** Its value is made of other leaves' values: too much for one control on a\n   *  line, so a bar opens it in a popover and a compact panel in a dialog. */\n  compound: boolean;\n  /** Its control is several controls, or a button. A row drawn as a `<label>`\n   *  would hand a click on its text to the first of them. */\n  several: boolean;\n}\n\nconst ONE: PrefKindTraits = { compound: false, several: false };\nconst MANY: PrefKindTraits = { compound: true, several: true };\n\n/**\n * The traits of every built-in kind. A `Record` over {@link PrefKind}, so a\n * kind added to the union does not compile until it says what it is here:\n * a plain set of kind names lets a new one through to draw inline in a\n * `<label>`, on a bar's line, and with no dialog row.\n */\nexport const PREF_KIND_TRAITS: Record<PrefKind, PrefKindTraits> = {\n  number: ONE,\n  boolean: ONE,\n  string: ONE,\n  enum: ONE,\n  color: ONE,\n  paint: ONE,\n  object: MANY,\n  list: MANY,\n  map: MANY,\n  union: MANY,\n  field: ONE,\n  action: { compound: false, several: true },\n  alias: ONE,\n  label: ONE,\n  separator: ONE,\n};\n\nconst traitsOf = (leaf: { kind: string }): PrefKindTraits =>\n  (Object.hasOwn(PREF_KIND_TRAITS, leaf.kind) ? PREF_KIND_TRAITS[leaf.kind as PrefKind] : ONE);\n\n/** Whether a leaf's value is made of other leaves' values. An app-defined kind is not: its renderer is one control. */\nexport function prefIsCompound(leaf: { kind: string }): boolean {\n  return traitsOf(leaf).compound;\n}\n\n/** Whether a leaf's control is several controls or a button. */\nexport function prefDrawsSeveral(leaf: { kind: string }): boolean {\n  return traitsOf(leaf).several;\n}\n"]}
+{"version":3,"sources":["../src/tabRuns.ts","../src/shown.ts","../src/judge.ts","../src/scopeAt.ts","../src/scope.ts","../src/build.ts","../src/css.ts","../src/aliasTargets.ts","../src/object.ts","../src/type.ts","../src/groups.ts","../src/heading.ts","../src/pair.ts","../src/kinds.ts"],"names":["leaf","scope","kept","under","pref"],"mappings":";;;;AAOO,SAAS,WAAA,CAAe,OAAqB,KAAA,EAA8C;AAChG,EAAA,MAAM,MAAuB,EAAC;AAC9B,EAAA,IAAI,GAAA;AACJ,EAAA,KAAA,MAAW,QAAQ,KAAA,EAAO;AACxB,IAAA,IAAI,CAAC,KAAA,CAAM,IAAI,CAAA,EAAG;AAChB,MAAA,GAAA,GAAM,MAAA;AACN,MAAA,GAAA,CAAI,IAAA,CAAK,EAAE,IAAA,EAAM,CAAA;AAAA,IACnB,WAAW,GAAA,EAAK;AACd,MAAA,GAAA,CAAI,KAAK,IAAI,CAAA;AAAA,IACf,CAAA,MAAO;AACL,MAAA,GAAA,CAAI,KAAK,EAAE,IAAA,EAAO,MAAM,CAAC,IAAI,GAAI,CAAA;AAAA,IACnC;AAAA,EACF;AACA,EAAA,OAAO,GAAA;AACT;;;ACRO,SAAS,cAAA,CAAeA,KAAAA,EAAgB,MAAA,EAAiB,QAAA,EAA6C;AAC3G,EAAA,IAAIA,MAAK,IAAA,KAAS,SAAA,IAAaA,KAAAA,CAAK,IAAA,KAAS,QAAQ,OAAO,MAAA;AAC5D,EAAA,MAAM,EAAE,UAAS,GAAIA,KAAAA;AACrB,EAAA,OAAO,QAAA,GAAY,QAAA,CAAS,IAAA,CAA0D,MAAA,EAAQ,QAAQ,CAAA,GAAI,MAAA;AAC5G;AAUO,SAAS,eAAA,CACd,MAAA,EAAiC,IAAA,EAA2B,IAAA,EAAiB,IAAA,EACxD;AACrB,EAAA,OAAO,CAAC,MAAM,IAAA,KAAS;AACrB,IAAA,MAAM,MAAA,GAAS,IAAA,CAAK,IAAA,EAAM,IAAI,CAAA;AAC9B,IAAA,MAAM,IAAA,GAAO,IAAA,KAAS,MAAA,GAAS,IAAA,IAAQ,kBAAkB,IAAA,EAAM,IAAI,CAAA,GAAI,eAAA,CAAgB,iBAAA,CAAkB,MAAA,EAAQ,IAAA,EAAM,IAAI,GAAG,IAAI,CAAA;AAClI,IAAA,IAAI,IAAA,KAAS,MAAA,IAAa,IAAA,KAAS,MAAA,EAAQ,OAAO,MAAA;AAClD,IAAA,MAAM,MAAA,GAAS,KAAK,MAAA,KAAW,MAAA,GAAY,SAAY,IAAA,CAAK,IAAA,CAAK,QAAQ,IAAI,CAAA;AAC7E,IAAA,OAAO,cAAA,CAAe,IAAA,CAAK,IAAA,EAAM,MAAA,EAAQ,OAAO,WAAW,QAAA,IAAY,MAAA,KAAW,IAAA,GAAQ,MAAA,GAAsB,MAAS,CAAA;AAAA,EAC3H,CAAA;AACF;;;ACXA,SAAS,UAAA,CAAW,EAAE,IAAA,EAAM,KAAA,IAAoB,IAAA,EAAuB;AACrE,EAAA,IAAI,SAAS,EAAA,EAAI,OAAO,KAAA,KAAU,MAAA,GAAY,QAAQ,IAAA,CAAK,OAAA;AAC3D,EAAA,MAAM,IAAA,GAAO,eAAA,CAAgB,KAAA,EAAO,IAAI,CAAA;AACxC,EAAA,OAAO,SAAS,MAAA,GAAY,IAAA,GAAO,eAAA,CAAgB,IAAA,CAAK,SAAS,IAAI,CAAA;AACvE;AAWO,SAAS,SAAA,CACd,MAAA,EAAiC,IAAA,EAAiC,KAAA,EAAmB,IAAA,EACjE;AACpB,EAAA,MAAM,MAAA,GAA8B,CAAC,IAAA,EAAM,IAAA,KAAU,IAAA,KAAS,MAAA,GAAS,KAAA,IAAS,UAAA,CAAW,KAAA,EAAO,IAAI,CAAA,GAAI,IAAA,CAAK,IAAI,CAAA;AACnH,EAAA,MAAM,QAAQ,eAAA,CAAgB,MAAA,EAAQ,MAAA,EAAQ,KAAA,EAAO,MAAM,IAAI,CAAA;AAC/D,EAAA,OAAO,CAAC,SAAA,KAAc,kBAAA,CAAmB,SAAA,EAAW,KAAK,CAAA;AAC3D;AAOO,SAAS,qBAAqB,KAAA,EAA+C;AAClF,EAAA,OAAO,CAAC,WAAW,KAAA,KAAU,sBAAA,CAAuB,SAAS,CAAA,IAAK,KAAA,CAAM,WAAW,KAAK,CAAA;AAC1F;AAQO,SAAS,UAAA,CAAW,MAAA,EAAiC,MAAA,EAAiB,IAAA,EAA2D;AACtI,EAAA,MAAM,MAAA,GAAS,IAAA,IAAQ,UAAA,CAAW,IAAA,EAAM,MAAM,CAAA;AAC9C,EAAA,OAAO,CAAC,IAAA,KAAS;AACf,IAAA,MAAM,IAAA,GAAO,eAAA,CAAgB,MAAA,EAAQ,IAAI,CAAA;AACzC,IAAA,IAAI,IAAA,KAAS,QAAW,OAAO,IAAA;AAC/B,IAAA,IAAI,MAAA,IAAU,kBAAkB,MAAA,EAAQ,IAAA,EAAM,IAAI,CAAA,KAAM,IAAA,EAAM,OAAO,MAAA,CAAO,IAAI,CAAA;AAChF,IAAA,IAAI,aAAA,CAAc,MAAM,CAAA,EAAG;AACzB,MAAA,KAAA,MAAW,CAAC,GAAA,EAAKA,KAAI,KAAK,iBAAA,CAAkB,MAAA,CAAO,OAAO,CAAA,EAAG;AAC3D,QAAA,IAAI,IAAA,KAAS,GAAA,EAAK,OAAOA,KAAAA,CAAK,OAAA;AAC9B,QAAA,IAAI,IAAA,CAAK,UAAA,CAAW,CAAA,EAAG,GAAG,GAAG,CAAA,EAAG,OAAO,eAAA,CAAgBA,KAAAA,CAAK,SAAS,IAAA,CAAK,KAAA,CAAM,GAAA,CAAI,MAAA,GAAS,CAAC,CAAC,CAAA;AAAA,MACjG;AACA,MAAA,OAAO,MAAA;AAAA,IACT;AACA,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,GAAG,CAAA;AAC5B,IAAA,IAAI,IAAA,GAAkB,MAAA;AACtB,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,CAAM,QAAQ,CAAA,EAAA,EAAK;AACrC,MAAA,IAAI,CAAC,OAAO,MAAA,CAAO,IAAA,CAAK,UAAU,KAAA,CAAM,CAAC,CAAE,CAAA,EAAG,OAAO,MAAA;AACrD,MAAA,MAAM,KAAA,GAA8B,IAAA,CAAK,QAAA,CAAS,KAAA,CAAM,CAAC,CAAE,CAAA;AAC3D,MAAA,IAAI,CAAC,UAAA,CAAW,KAAK,CAAA,EAAG,IAAA,GAAO,KAAA;AAAA,kBACnB,CAAA,KAAM,KAAA,CAAM,MAAA,GAAS,CAAA,GAAI,MAAM,OAAA,GAAU,eAAA,CAAgB,KAAA,CAAM,OAAA,EAAS,MAAM,KAAA,CAAM,CAAA,GAAI,CAAC,CAAA,CAAE,IAAA,CAAK,GAAG,CAAC,CAAA;AAAA,IAClH;AACA,IAAA,OAAO,MAAA;AAAA,EACT,CAAA;AACF;;;AClEO,IAAM,UAAA,GAAa;AAGnB,IAAM,UAAA,GAAwB,OAAO,MAAA,CAAO,EAAE,OAAO,IAAA,EAAM,OAAA,EAAS,MAAM;AAG1E,SAAS,cAAA,CACd,KAAA,EACA,IAAA,EACA,KAAA,EACW;AACX,EAAA,MAAM,KAAA,GAAQ,MAAM,KAAA,KAAU,IAAA,CAAK,WAAW,MAAA,IAAa,KAAA,CAAM,IAAA,CAAK,MAAA,EAAQ,QAAQ,CAAA,CAAA;AACtF,EAAA,MAAM,OAAA,GAAU,MAAM,OAAA,KAAY,IAAA,CAAK,aAAa,MAAA,IAAa,KAAA,CAAM,IAAA,CAAK,QAAA,EAAU,UAAU,CAAA,CAAA;AAChG,EAAA,OAAO,KAAA,KAAU,MAAM,KAAA,IAAS,OAAA,KAAY,MAAM,OAAA,GAAU,KAAA,GAAQ,EAAE,KAAA,EAAO,OAAA,EAAQ;AACvF;AAGA,SAAS,UAAA,CACP,IAAA,EAA8B,IAAA,EAAc,KAAA,EAAkB,KAAA,EACvC;AACvB,EAAA,KAAA,MAAW,CAAC,GAAA,EAAK,KAAK,KAAK,MAAA,CAAO,OAAA,CAAQ,IAAI,CAAA,EAAG;AAC/C,IAAA,IAAI,CAAC,UAAA,CAAW,KAAK,CAAA,EAAG;AACtB,MAAA,MAAM,KAAA,GAAQ,UAAA,CAAW,KAAA,CAAM,OAAA,EAAS,IAAA,EAAM,eAAe,KAAA,EAAO,KAAA,EAAO,KAAK,CAAA,EAAG,KAAK,CAAA;AACxF,MAAA,IAAI,OAAO,OAAO,KAAA;AAAA,IACpB,WAAW,IAAA,KAAS,GAAA,SAAY,cAAA,CAAe,KAAA,EAAO,OAAO,KAAK,CAAA;AAAA,SAAA,IACzD,IAAA,CAAK,WAAW,CAAA,EAAG,GAAG,GAAG,CAAA,EAAG,OAAO,YAAY,KAAA,EAAO,IAAA,CAAK,MAAM,GAAA,CAAI,MAAA,GAAS,CAAC,CAAA,EAAG,cAAA,CAAe,OAAO,KAAA,EAAO,KAAK,GAAG,KAAK,CAAA;AAAA,EACvI;AACA,EAAA,OAAO,MAAA;AACT;AAGA,SAAS,WAAA,CAAYA,KAAAA,EAAgB,IAAA,EAAc,KAAA,EAAkB,KAAA,EAAsC;AACzG,EAAA,IAAIA,KAAAA,CAAK,IAAA,KAAS,QAAA,EAAU,OAAO,UAAA,CAAYA,MAAoB,QAAA,EAAU,IAAA,EAAM,KAAA,EAAO,KAAK,CAAA,IAAK,KAAA;AACpG,EAAA,IAAIA,KAAAA,CAAK,IAAA,KAAS,MAAA,IAAUA,KAAAA,CAAK,SAAS,KAAA,EAAO;AAC/C,IAAA,MAAM,EAAE,MAAK,GAAIA,KAAAA;AACjB,IAAA,IAAI,IAAA,KAAS,QAAW,OAAO,KAAA;AAC/B,IAAA,MAAM,MAAA,GAAS,qBAAqB,KAAK,CAAA;AACzC,IAAA,MAAM,KAAA,GAAQ,eAAe,KAAA,EAAO,EAAE,UAAU,IAAA,CAAK,QAAA,IAAY,MAAM,CAAA;AACvE,IAAA,MAAM,GAAA,GAAM,IAAA,CAAK,OAAA,CAAQ,GAAG,CAAA;AAC5B,IAAA,OAAO,GAAA,GAAM,CAAA,GAAI,KAAA,GAAQ,WAAA,CAAY,IAAA,EAAM,IAAA,CAAK,KAAA,CAAM,GAAA,GAAM,CAAC,CAAA,EAAG,KAAA,EAAO,MAAM,CAAA;AAAA,EAC/E;AACA,EAAA,IAAIA,KAAAA,CAAK,IAAA,KAAS,OAAA,EAAS,OAAO,KAAA;AAClC,EAAA,KAAA,MAAW,OAAA,IAAW,MAAA,CAAO,MAAA,CAAQA,KAAAA,CAAmB,QAAQ,CAAA,EAAG;AACjE,IAAA,MAAM,QAAQ,UAAA,CAAW,OAAA,CAAQ,QAAA,EAAU,IAAA,EAAM,OAAO,KAAK,CAAA;AAC7D,IAAA,IAAI,OAAO,OAAO,KAAA;AAAA,EACpB;AACA,EAAA,OAAO,KAAA;AACT;AAEA,SAAS,OAAA,CAAQ,MAAA,EAAiC,IAAA,EAAc,KAAA,EAAsC;AACpG,EAAA,IAAI,KAAA,GAAQ,cAAA,CAAe,UAAA,EAAY,MAAA,EAAQ,KAAK,CAAA;AACpD,EAAA,IAAI,IAAA,KAAS,IAAI,OAAO,KAAA;AACxB,EAAA,IAAI,aAAA,CAAc,MAAM,CAAA,EAAG,OAAO,UAAA,CAAW,OAAO,OAAA,EAAS,IAAA,EAAM,KAAA,EAAO,KAAK,CAAA,IAAK,KAAA;AACpF,EAAA,IAAI,IAAA,GAAkB,MAAA;AACtB,EAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,KAAA,CAAM,GAAG,CAAA;AAC5B,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,CAAM,QAAQ,CAAA,EAAA,EAAK;AACrC,IAAA,IAAI,CAAC,OAAO,MAAA,CAAO,IAAA,CAAK,UAAU,KAAA,CAAM,CAAC,CAAE,CAAA,EAAG,OAAO,KAAA;AACrD,IAAA,MAAM,KAAA,GAA8B,IAAA,CAAK,QAAA,CAAS,KAAA,CAAM,CAAC,CAAE,CAAA;AAC3D,IAAA,KAAA,GAAQ,cAAA,CAAe,KAAA,EAAO,KAAA,EAAO,KAAK,CAAA;AAC1C,IAAA,IAAI,UAAA,CAAW,KAAK,CAAA,EAAG,OAAO,MAAM,KAAA,CAAM,MAAA,GAAS,IAAI,KAAA,GAAQ,WAAA,CAAY,OAAO,KAAA,CAAM,KAAA,CAAM,IAAI,CAAC,CAAA,CAAE,KAAK,GAAG,CAAA,EAAG,OAAO,KAAK,CAAA;AAC5H,IAAA,IAAA,GAAO,KAAA;AAAA,EACT;AACA,EAAA,OAAO,KAAA;AACT;AAGO,SAAS,cAAA,CAAe,GAAA,EAAgB,KAAA,EAAkB,IAAA,EAA+B,KAAA,EAAsC;AACpI,EAAA,MAAM,MAAA,GAAS,gBAAgB,KAAA,EAAO,CAAC,SAAS,UAAA,CAAW,IAAA,EAAM,IAAI,CAAC,CAAA;AACtE,EAAA,IAAI,MAAA,KAAW,QAAW,OAAO,GAAA;AACjC,EAAA,MAAM,MAAA,GAAS,OAAA,CAAQ,IAAA,EAAM,MAAA,CAAO,MAAM,KAAK,CAAA;AAC/C,EAAA,MAAM,KAAA,GAAQ,GAAA,CAAI,KAAA,IAAS,MAAA,CAAO,KAAA;AAClC,EAAA,MAAM,OAAA,GAAU,GAAA,CAAI,OAAA,IAAW,MAAA,CAAO,OAAA;AACtC,EAAA,OAAO,KAAA,KAAU,IAAI,KAAA,IAAS,OAAA,KAAY,IAAI,OAAA,GAAU,GAAA,GAAM,EAAE,KAAA,EAAO,OAAA,EAAQ;AACjF;AAoBO,SAAS,WAAA,CACd,QAAiC,IAAA,EAAc,KAAA,EAA2B,EAAE,SAAA,EAAW,UAAA,EAAW,GAAwB,EAAC,EAChH;AACX,EAAA,MAAM,GAAA,GAAM,OAAA,CAAQ,MAAA,EAAQ,IAAA,EAAM,KAAK,CAAA;AACvC,EAAA,MAAMA,KAAAA,GAAO,UAAA,CAAW,MAAA,EAAQ,IAAI,CAAA;AACpC,EAAA,OAAOA,KAAAA,EAAM,IAAA,KAAS,OAAA,GAAU,cAAA,CAAe,GAAA,EAAKA,OAAmB,SAAA,IAAa,MAAA,EAAQ,UAAA,IAAc,KAAK,CAAA,GAAI,GAAA;AACrH;;;ACrGA,IAAM,KAAA,GAAQ,CAAC,MAAA,EAAgB,GAAA,KAAyB,MAAA,KAAW,KAAK,GAAA,GAAM,CAAA,EAAG,MAAM,CAAA,CAAA,EAAI,GAAG,CAAA,CAAA;AAgD9F,SAAS,SAAS,EAAE,SAAA,EAAW,YAAY,MAAA,EAAQ,SAAA,EAAW,YAAW,EAAgB;AACvF,EAAA,MAAM,QAAA,uBAAe,GAAA,EAAY;AACjC,EAAA,MAAM,MAAA,uBAAa,GAAA,EAAY;AAE/B,EAAA,MAAMA,KAAAA,GAAO,CAAC,IAAA,EAAgB,IAAA,EAAc,OAAkB,KAAA,KAA+C;AAC3G,IAAA,MAAM,GAAA,GAAM,cAAA,CAAe,KAAA,EAAO,IAAA,EAAM,KAAK,CAAA;AAC7C,IAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,IAAA,KAAS,OAAA,IAAW,SAAA,GAAY,cAAA,CAAe,GAAA,EAAK,IAAA,EAAmB,SAAA,EAAW,UAAA,IAAc,KAAK,CAAA,GAAI,GAAA;AAC5H,IAAA,OAAO,KAAA,CAAM,SAAS,UAAA,GAAa,MAAA,CAAO,MAAM,IAAA,EAAM,KAAA,EAAO,KAAK,CAAA,GAAI,IAAA;AAAA,EACxE,CAAA;AAGA,EAAA,MAAM,MAAA,GAAS,CAAC,IAAA,EAAgB,IAAA,EAAc,OAAkB,KAAA,KAAwC;AACtG,IAAA,IAAI,CAAC,KAAA,CAAM,KAAA,EAAO,MAAA,CAAO,IAAI,IAAI,CAAA;AACjC,IAAA,IAAI,CAAC,KAAA,CAAM,OAAA,EAAS,QAAA,CAAS,IAAI,IAAI,CAAA;AACrC,IAAA,IAAI,IAAA,CAAK,SAAS,QAAA,EAAU;AAC1B,MAAA,MAAM,WAAW,OAAA,CAAS,IAAA,CAAoB,QAAA,EAAU,IAAA,EAAM,OAAO,KAAK,CAAA;AAC1E,MAAA,OAAO,aAAc,IAAA,CAAoB,QAAA,GAAW,OAAQ,EAAE,GAAG,MAAM,QAAA,EAAS;AAAA,IAClF;AACA,IAAA,IAAI,IAAA,CAAK,IAAA,KAAS,MAAA,IAAU,IAAA,CAAK,SAAS,KAAA,EAAO;AAC/C,MAAA,MAAM,EAAE,MAAK,GAAI,IAAA;AAEjB,MAAA,IAAI,IAAA,KAAS,QAAW,OAAO,IAAA;AAE/B,MAAA,MAAM,QAAQ,MAAA,CAAO,IAAA,EAAM,KAAA,CAAM,IAAA,EAAM,UAAU,CAAA,EAAG,cAAA,CAAe,KAAA,EAAO,EAAE,UAAU,IAAA,CAAK,QAAA,EAAS,EAAG,MAAM,GAAG,MAAM,CAAA;AACtH,MAAA,OAAO,UAAU,IAAA,GAAO,IAAA,GAAQ,EAAE,GAAG,IAAA,EAAM,MAAM,KAAA,EAAM;AAAA,IACzD;AACA,IAAA,IAAI,IAAA,CAAK,IAAA,KAAS,OAAA,EAAS,OAAO,IAAA;AAClC,IAAA,MAAM,EAAE,UAAS,GAAI,IAAA;AACrB,IAAA,IAAI,OAAA,GAAU,KAAA;AACd,IAAA,MAAM,OAA8B,EAAC;AACrC,IAAA,KAAA,MAAW,CAAC,GAAA,EAAK,OAAO,KAAK,MAAA,CAAO,OAAA,CAAQ,QAAQ,CAAA,EAAG;AACrD,MAAA,MAAM,WAAW,OAAA,CAAQ,OAAA,CAAQ,QAAA,EAAU,IAAA,EAAM,OAAO,KAAK,CAAA;AAC7D,MAAA,OAAA,KAAY,aAAa,OAAA,CAAQ,QAAA;AACjC,MAAA,IAAA,CAAK,GAAG,IAAI,QAAA,KAAa,OAAA,CAAQ,WAAW,OAAA,GAAU,EAAE,GAAG,OAAA,EAAS,QAAA,EAAS;AAAA,IAC/E;AACA,IAAA,OAAO,UAAW,EAAE,GAAG,IAAA,EAAM,QAAA,EAAU,MAAK,GAAiB,IAAA;AAAA,EAC/D,CAAA;AAGA,EAAA,MAAM,OAAA,GAAU,CAAC,IAAA,EAA8B,MAAA,EAAgB,OAAkB,KAAA,KAAsD;AACrI,IAAA,IAAI,OAAA,GAAU,KAAA;AACd,IAAA,MAAM,MAA8B,EAAC;AACrC,IAAA,KAAA,MAAW,CAAC,GAAA,EAAK,KAAK,KAAK,MAAA,CAAO,OAAA,CAAQ,IAAI,CAAA,EAAG;AAC/C,MAAA,MAAM,OAAO,UAAA,CAAW,KAAK,CAAA,GAAIA,KAAAA,CAAK,OAAO,KAAA,CAAM,MAAA,EAAQ,GAAG,CAAA,EAAG,OAAO,KAAK,CAAA,GAAI,QAAQ,KAAA,EAAO,MAAA,EAAQ,OAAO,KAAK,CAAA;AACpH,MAAA,OAAA,KAAY,IAAA,KAAS,KAAA;AACrB,MAAA,IAAI,IAAA,KAAS,IAAA,EAAM,GAAA,CAAI,GAAG,CAAA,GAAI,IAAA;AAAA,IAChC;AACA,IAAA,OAAO,UAAU,GAAA,GAAM,IAAA;AAAA,EACzB,CAAA;AAEA,EAAA,MAAM,OAAA,GAAU,CAAC,IAAA,EAAmB,MAAA,EAAgB,OAAkB,KAAA,KAAkD;AACtH,IAAA,MAAM,KAAA,GAAQ,cAAA,CAAe,KAAA,EAAO,IAAA,EAAM,KAAK,CAAA;AAC/C,IAAA,IAAI,CAAC,KAAA,CAAM,KAAA,IAAS,CAAC,YAAY,OAAO,IAAA;AACxC,IAAA,MAAM,OAAO,OAAA,CAAQ,IAAA,CAAK,OAAA,EAAS,MAAA,EAAQ,OAAO,KAAK,CAAA;AACvD,IAAA,IAAI,IAAA,KAAS,IAAA,CAAK,OAAA,EAAS,OAAO,IAAA;AAClC,IAAA,OAAO,MAAA,CAAO,IAAA,CAAK,IAAI,CAAA,CAAE,MAAA,KAAW,CAAA,IAAK,CAAC,SAAA,GAAY,IAAA,GAAO,EAAE,GAAG,IAAA,EAAM,SAAS,IAAA,EAAK;AAAA,EACxF,CAAA;AAEA,EAAA,OAAO,EAAE,QAAA,EAAU,MAAA,EAAQ,IAAA,EAAAA,KAAAA,EAAM,QAAQ,OAAA,EAAQ;AACnD;AAkBO,SAAS,mBAAA,CACd,MAAA,EACA,KAAA,EACA,EAAE,SAAA,GAAY,KAAA,EAAO,UAAA,GAAa,KAAA,EAAO,SAAA,EAAW,UAAA,EAAW,GAA2B,EAAC,EACjE;AAC1B,EAAA,MAAM,IAAA,GAAO,QAAA,CAAS,EAAE,SAAA,EAAW,UAAA,EAAY,MAAA,EAAQ,oBAAA,CAAqB,KAAK,CAAA,EAAG,SAAA,EAAW,SAAA,IAAa,MAAA,EAAQ,YAAY,CAAA;AAChI,EAAA,MAAM,EAAE,QAAA,EAAU,MAAA,EAAO,GAAI,IAAA;AAE7B,EAAA,MAAM,KAAA,GAAQ,CAAC,IAAA,EAAiB,IAAA,EAAc,KAAA,KAAuC;AACnF,IAAA,MAAMC,MAAAA,GAAQ,cAAA,CAAe,KAAA,EAAO,IAAA,EAAM,KAAK,CAAA;AAC/C,IAAA,IAAI,CAACA,MAAAA,CAAM,KAAA,IAAS,CAAC,YAAY,OAAO,IAAA;AACxC,IAAA,IAAI,CAACA,MAAAA,CAAM,KAAA,IAAS,SAAS,EAAA,EAAI,MAAA,CAAO,IAAI,IAAI,CAAA;AAChD,IAAA,IAAI,CAACA,MAAAA,CAAM,OAAA,IAAW,SAAS,EAAA,EAAI,QAAA,CAAS,IAAI,IAAI,CAAA;AACpD,IAAA,IAAI,OAAA,GAAU,KAAA;AACd,IAAA,MAAM,WAAkC,EAAC;AACzC,IAAA,KAAA,MAAW,CAAC,KAAK,KAAK,CAAA,IAAK,OAAO,OAAA,CAAQ,IAAA,CAAK,QAAQ,CAAA,EAAG;AACxD,MAAA,MAAM,EAAA,GAAK,KAAA,CAAM,IAAA,EAAM,GAAG,CAAA;AAC1B,MAAA,MAAMC,KAAAA,GAAO,UAAA,CAAW,KAAK,CAAA,GAAI,KAAK,IAAA,CAAK,KAAA,EAAO,EAAA,EAAID,MAAAA,EAAO,KAAK,CAAA,GAAI,KAAA,CAAM,KAAA,EAAO,IAAIA,MAAK,CAAA;AAC5F,MAAA,OAAA,KAAYC,KAAAA,KAAS,KAAA;AACrB,MAAA,IAAIA,KAAAA,KAAS,IAAA,EAAM,QAAA,CAAS,GAAG,CAAA,GAAIA,KAAAA;AAAA,IACrC;AACA,IAAA,IAAI,CAAC,SAAS,OAAO,IAAA;AACrB,IAAA,OAAO,MAAA,CAAO,IAAA,CAAK,QAAQ,CAAA,CAAE,WAAW,CAAA,IAAK,CAAC,SAAA,IAAa,IAAA,KAAS,EAAA,GAAK,IAAA,GAAO,EAAE,GAAG,MAAM,QAAA,EAAS;AAAA,EACtG,CAAA;AAEA,EAAA,IAAI,CAAC,aAAA,CAAc,MAAM,CAAA,EAAG,OAAO,EAAE,KAAA,EAAO,KAAA,CAAM,MAAA,EAAQ,EAAA,EAAI,UAAU,CAAA,EAAe,UAAU,MAAA,EAAO;AACxG,EAAA,MAAM,KAAA,GAAQ,cAAA,CAAe,UAAA,EAAY,MAAA,EAAQ,KAAK,CAAA;AACtD,EAAA,IAAI,CAAC,KAAA,CAAM,KAAA,IAAS,CAAC,UAAA,SAAmB,EAAE,KAAA,EAAO,IAAA,EAAM,QAAA,EAAU,MAAA,EAAO;AACxE,EAAA,MAAM,OAAO,IAAA,CAAK,OAAA,CAAQ,OAAO,OAAA,EAAS,EAAA,EAAI,OAAO,KAAK,CAAA;AAC1D,EAAA,OAAO,EAAE,KAAA,EAAO,IAAA,KAAS,MAAA,CAAO,OAAA,GAAU,MAAA,GAAS,EAAE,GAAG,MAAA,EAAQ,OAAA,EAAS,IAAA,EAAK,EAAG,UAAU,MAAA,EAAO;AACpG;AAYA,IAAM,SAA6B,MAAM,IAAA;AAUlC,SAAS,wBAAA,CACd,IAAA,EACA,IAAA,EACA,KAAA,EACA,EAAE,SAAA,GAAY,KAAA,EAAO,UAAA,GAAa,KAAA,EAAM,GAA6D,EAAC,EACpF;AAClB,EAAA,MAAM,KAAA,GAA4B,CAAC,SAAA,EAAW,KAAA,KAAU,CAAC,uBAAuB,SAAS,CAAA,IAAK,KAAA,CAAM,SAAA,EAAW,KAAK,CAAA;AACpH,EAAA,MAAM,OAAO,QAAA,CAAS,EAAE,WAAW,UAAA,EAAY,MAAA,EAAQ,QAAQ,CAAA;AAC/D,EAAA,MAAM,KAAA,GAAQ,eAAe,UAAA,EAAY,EAAE,UAAU,IAAA,CAAK,QAAA,IAAY,KAAK,CAAA;AAC3E,EAAA,OAAO,EAAE,IAAA,EAAM,IAAA,CAAK,MAAA,CAAO,MAAM,IAAA,EAAM,KAAA,EAAO,KAAK,CAAA,EAAG,QAAA,EAAU,IAAA,CAAK,QAAA,EAAU,MAAA,EAAQ,KAAK,MAAA,EAAO;AACrG;;;AClMA,IAAM,IAAA,GAAO,CAAqB,IAAA,EAAiB,IAAA,EAAc,KAAc,IAAA,MAC5E,EAAE,IAAA,EAAM,IAAA,EAAM,WAAA,EAAa,EAAA,EAAI,OAAA,EAAS,GAAA,EAAK,GAAG,IAAA,EAAK,CAAA;AAExD,IAAM,OAAA,GAAU,CAAC,KAAA,KAA2B,KAAA,KAAU,EAAA,GAAK,KAAA,GAAQ,KAAA,CAAM,CAAC,CAAA,CAAG,WAAA,EAAY,GAAI,KAAA,CAAM,MAAM,CAAC,CAAA;AAQnG,IAAM,IAAA,GAAO;AAAA;AAAA,EAElB,KAAA,CACE,IAAA,EACA,QAAA,EACA,OAAA,EAC+C;AAC/C,IAAA,OAAO,EAAE,IAAA,EAAM,GAAG,OAAA,EAAS,QAAA,EAAS;AAAA,EACtC,CAAA;AAAA;AAAA,EAGA,OAAA,CACE,IAAA,EACA,OAAA,EACA,OAAA,EAC+C;AAC/C,IAAA,OAAO,EAAE,IAAA,EAAM,GAAG,OAAA,EAAS,OAAA,EAAQ;AAAA,EACrC,CAAA;AAAA,EAEA,MAAA,EAAQ,CAAC,IAAA,EAAc,GAAA,EAAa,SAAwC,IAAA,CAAK,QAAA,EAAU,IAAA,EAAM,GAAA,EAAK,IAAI,CAAA;AAAA,EAC1G,OAAA,EAAS,CAAC,IAAA,EAAc,GAAA,EAAc,SAA0C,IAAA,CAAK,SAAA,EAAW,IAAA,EAAM,GAAA,EAAK,IAAI,CAAA;AAAA,EAC/G,MAAA,EAAQ,CAAC,IAAA,EAAc,GAAA,EAAa,SAAwC,IAAA,CAAK,QAAA,EAAU,IAAA,EAAM,GAAA,EAAK,IAAI,CAAA;AAAA,EAC1G,KAAA,EAAO,CAAC,IAAA,EAAc,GAAA,EAAa,SAAsC,IAAA,CAAK,OAAA,EAAS,IAAA,EAAM,GAAA,EAAK,IAAI,CAAA;AAAA;AAAA,EAGtG,IAAA,CACE,IAAA,EACA,GAAA,EACA,OAAA,EACA,IAAA,EACqD;AACrD,IAAA,MAAM,OAAO,OAAA,CAAQ,GAAA,CAAI,CAAC,MAAA,KAAY,OAAO,MAAA,KAAW,QAAA,GAAW,EAAE,KAAA,EAAO,QAAQ,KAAA,EAAO,OAAA,CAAQ,MAAM,CAAA,KAAM,MAAO,CAAA;AACtH,IAAA,OAAO,EAAE,IAAA,EAAM,MAAA,EAAQ,IAAA,EAAM,WAAA,EAAa,EAAA,EAAI,OAAA,EAAS,GAAA,EAAK,GAAG,IAAA,EAAM,OAAA,EAAS,IAAA,EAAK;AAAA,EACrF;AACF;;;AC1BA,IAAM,QAAQ,CAAC,IAAA,KAAyB,IAAA,CAAK,OAAA,CAAQ,OAAO,GAAG,CAAA,CAAE,OAAA,CAAQ,QAAA,EAAU,CAAC,MAAA,KAAW,CAAA,CAAA,EAAI,MAAA,CAAO,WAAA,EAAa,CAAA,CAAE,CAAA;AAGzH,IAAM,SAAA,GAA8C;AAAA,EAClD,EAAA,EAAI,IAAA;AAAA,EAAM,GAAA,EAAK,GAAA;AAAA,EAAK,EAAA,EAAI,IAAA;AAAA,EAAM,GAAA,EAAK,KAAA;AAAA,EAAO,EAAA,EAAI,IAAA;AAAA,EAAM,EAAA,EAAI,IAAA;AAAA,EAAM,EAAA,EAAI,IAAA;AAAA,EAAM,EAAA,EAAI,IAAA;AAAA,EAC5E,EAAA,EAAI,IAAA;AAAA,EAAM,CAAA,EAAG,GAAA;AAAA,EAAK,MAAA,EAAK,KAAA;AAAA,EAAO,GAAA,EAAK,KAAA;AAAA,EAAO,GAAA,EAAK,KAAA;AAAA,EAAO,IAAA,EAAM;AAC9D,CAAA;AAEA,IAAM,KAAA,GAAQ,qBAAA;AACd,IAAM,MAAA,GAAS,CAAC,IAAA,KAAyB,CAAA,CAAA,EAAI,KAAK,OAAA,CAAQ,QAAA,EAAU,MAAM,CAAC,CAAA,CAAA,CAAA;AAG3E,SAAS,QAAA,CAASF,OAAgB,KAAA,EAA+B;AAC/D,EAAA,QAAQA,MAAK,IAAA;AAAM,IACjB,KAAK,QAAA,EAAU;AACb,MAAA,IAAI,OAAO,UAAU,QAAA,IAAY,CAAC,OAAO,QAAA,CAAS,KAAK,GAAG,OAAO,IAAA;AACjE,MAAA,MAAM,EAAE,MAAK,GAAIA,KAAAA;AACjB,MAAA,MAAM,QAAA,GAAW,IAAA,GAAO,eAAA,CAAgB,IAAI,CAAA,GAAI,MAAA;AAChD,MAAA,MAAM,KAAA,GAAQ,QAAA,GAAW,QAAA,CAAS,SAAA,CAAU,KAAK,CAAA,GAAI,KAAA;AACrD,MAAA,MAAM,MAAA,GAAS,QAAA,EAAU,MAAA,KAAW,MAAA,IAAa,MAAA,CAAO,MAAA,CAAO,SAAA,EAAW,QAAA,CAAS,MAAM,CAAA,GAAI,SAAA,CAAU,QAAA,CAAS,MAAM,CAAA,GAAI,EAAA;AAC1H,MAAA,OAAO,CAAA,EAAG,OAAO,KAAA,CAAM,OAAA,CAAQ,CAAC,CAAC,CAAC,GAAG,MAAM,CAAA,CAAA;AAAA,IAC7C;AAAA,IACA,KAAK,SAAA;AACH,MAAA,OAAO,OAAO,KAAA,KAAU,SAAA,GAAa,KAAA,GAAQ,MAAM,GAAA,GAAO,IAAA;AAAA,IAC5D,KAAK,OAAA;AACH,MAAA,OAAO,OAAO,KAAA,KAAU,QAAA,IAAY,KAAA,KAAU,KAAK,KAAA,GAAQ,IAAA;AAAA,IAC7D,KAAK,MAAA;AACH,MAAA,IAAI,OAAO,KAAA,KAAU,QAAA,IAAaA,KAAAA,CAAkB,UAAU,OAAO,IAAA;AACrE,MAAA,OAAO,MAAM,IAAA,CAAK,KAAK,CAAA,GAAI,KAAA,GAAQ,OAAO,KAAK,CAAA;AAAA,IACjD,KAAK,QAAA;AACH,MAAA,OAAO,OAAO,KAAA,KAAU,QAAA,GAAW,MAAA,CAAO,KAAK,CAAA,GAAI,IAAA;AAAA,IACrD;AACE,MAAA,OAAO,IAAA;AAAA;AAEb;AAMA,SAAS,SAAA,CAAU,IAAA,EAAe,SAAA,EAAoD,MAAA,EAAyB;AAC7G,EAAA,MAAM,MAAc,EAAC;AACrB,EAAA,MAAM,IAAA,GAAO,CAAC,KAAA,EAAgBG,MAAAA,KAA+B;AAC3D,IAAA,IAAI,CAAC,WAAA,CAAY,KAAK,CAAA,EAAG;AACvB,MAAA,GAAA,CAAI,IAAA,CAAK,EAAE,KAAA,EAAAA,MAAAA,EAAO,OAAO,CAAA;AACzB,MAAA;AAAA,IACF;AACA,IAAA,KAAA,MAAW,MAAA,IAAU,SAAA,CAAU,KAAA,CAAM,GAAG,CAAA,EAAG;AACzC,MAAA,IAAA,CAAK,OAAO,MAAA,CAAO,KAAA,CAAM,KAAK,MAAM,CAAA,GAAI,MAAM,GAAA,CAAI,MAAM,IAAI,MAAA,EAAQ,CAAC,GAAGA,MAAAA,EAAO,CAAC,MAAM,GAAA,EAAK,MAAM,CAAC,CAAC,CAAA;AAAA,IACrG;AAAA,EACF,CAAA;AACA,EAAA,IAAA,CAAK,IAAA,EAAM,EAAE,CAAA;AACb,EAAA,OAAO,GAAA;AACT;AAkBO,SAAS,QAAA,CAAS,KAAA,EAAuB,OAAA,GAA2B,EAAC,EAAW;AACrF,EAAA,MAAM,IAAA,GAAO,QAAQ,IAAA,IAAQ,OAAA;AAC7B,EAAA,MAAM,QAAA,GAAW,QAAQ,QAAA,KAAa,CAAC,SAAyB,CAAA,EAAA,EAAK,KAAA,CAAM,IAAI,CAAC,CAAA,CAAA,CAAA;AAChF,EAAA,MAAM,SAAA,GAAY,QAAQ,SAAA,KAAc,CAAC,aAA6B,CAAA,KAAA,EAAQ,KAAA,CAAM,QAAQ,CAAC,CAAA,CAAA,CAAA;AAC7F,EAAA,MAAM,SAAS,IAAI,GAAA,CAAI,CAAC,GAAG,UAAA,CAAW,MAAM,MAAM,CAAC,EAAE,MAAA,CAAO,CAAC,GAAGH,KAAI,MAAM,cAAA,CAAeA,KAAI,CAAC,CAAC,CAAA;AAC/F,EAAA,MAAM,SAAA,GAAY,cAAc,MAAM,CAAA;AACtC,EAAA,MAAM,QAAA,GAAW,OAAO,WAAA,CAAY,CAAC,GAAG,SAAA,CAAU,IAAA,EAAM,CAAA,CAAE,GAAA,CAAI,CAAC,IAAA,KAAS,CAAC,MAAM,MAAA,CAAO,GAAA,CAAI,IAAI,CAAA,CAAG,OAAiB,CAAC,CAAC,CAAA;AACpH,EAAA,MAAM,OAAO,KAAA,CAAM,MAAA,CAAO,EAAE,EAAA,EAAI,UAAU,CAAA;AAE1C,EAAA,MAAM,MAAA,uBAAa,GAAA,EAAuD;AAC1E,EAAA,MAAM,OAAA,GAAU,CAACG,MAAAA,EAAsB,IAAA,EAAcH,OAAgB,KAAA,KAAyB;AAC5F,IAAA,MAAM,IAAA,GAAO,QAAA,CAAS,IAAA,EAAMA,KAAI,CAAA;AAChC,IAAA,IAAI,SAAS,IAAA,EAAM;AACnB,IAAA,MAAM,KAAA,GAAQ,OAAA,CAAQ,KAAA,GAAQ,KAAA,EAAOA,OAAM,IAAI,CAAA;AAC/C,IAAA,MAAM,OAAO,KAAA,KAAU,MAAA,GAAY,QAAA,CAASA,KAAAA,EAAM,KAAK,CAAA,GAAI,KAAA;AAC3D,IAAA,IAAI,SAAS,IAAA,EAAM;AACnB,IAAA,MAAM,GAAA,GAAMG,MAAAA,CAAM,GAAA,CAAI,CAAC,CAAC,QAAA,EAAU,MAAM,CAAA,KAAM,CAAA,EAAG,QAAQ,CAAA,CAAA,EAAI,MAAM,CAAA,CAAE,CAAA,CAAE,KAAK,GAAG,CAAA;AAC/E,IAAA,IAAI,CAAC,MAAA,CAAO,GAAA,CAAI,GAAG,GAAG,MAAA,CAAO,GAAA,CAAI,GAAA,EAAK,EAAE,KAAA,EAAAA,MAAAA,EAAO,KAAA,EAAO,IAAI,CAAA;AAC1D,IAAA,MAAA,CAAO,GAAA,CAAI,GAAG,CAAA,CAAG,KAAA,CAAM,KAAK,CAAA,EAAA,EAAK,IAAI,CAAA,EAAA,EAAK,IAAI,CAAA,CAAA,CAAG,CAAA;AAAA,EACnD,CAAA;AAEA,EAAA,KAAA,MAAW,CAAC,IAAA,EAAMH,KAAI,CAAA,IAAK,MAAA,EAAQ;AACjC,IAAA,OAAA,CAAQ,EAAC,EAAG,IAAA,EAAMA,OAAM,eAAA,CAAgB,IAAA,EAAM,IAAI,CAAC,CAAA;AACnD,IAAA,MAAM,GAAA,GAAM,SAAA,CAAU,GAAA,CAAI,IAAI,CAAA;AAC9B,IAAA,IAAI,GAAA,EAAK,KAAA,MAAW,MAAA,IAAU,GAAA,EAAK,OAAA,CAAQ,CAAC,CAAC,IAAA,EAAM,MAAM,CAAC,CAAA,EAAG,IAAA,EAAMA,OAAM,MAAM,CAAA;AAC/E,IAAA,MAAM,IAAA,GAAO,KAAA,CAAM,KAAA,CAAM,IAAI,CAAA;AAC7B,IAAA,IAAI,CAAC,IAAA,EAAM;AACX,IAAA,KAAA,MAAW,EAAE,KAAA,EAAAG,MAAAA,EAAO,KAAA,EAAM,IAAK,UAAU,IAAA,EAAM,CAAC,QAAA,KAAa,SAAA,CAAU,IAAI,QAAQ,CAAA,IAAK,EAAC,EAAGH,KAAAA,CAAK,OAAO,CAAA,EAAG;AACzG,MAAA,OAAA,CAAQG,MAAAA,EAAO,IAAA,EAAMH,KAAAA,EAAM,KAAK,CAAA;AAAA,IAClC;AAAA,EACF;AAEA,EAAA,OAAO,CAAC,GAAG,MAAA,CAAO,MAAA,EAAQ,EACvB,GAAA,CAAI,CAAC,KAAA,EAAO,CAAA,MAAO,EAAE,GAAG,KAAA,EAAO,CAAA,EAAE,CAAE,EACnC,IAAA,CAAK,CAAC,CAAA,EAAG,CAAA,KAAM,EAAE,KAAA,CAAM,MAAA,GAAS,CAAA,CAAE,KAAA,CAAM,UAAU,CAAA,CAAE,CAAA,GAAI,CAAA,CAAE,CAAC,EAC3D,GAAA,CAAI,CAAC,EAAE,KAAA,EAAAG,MAAAA,EAAO,OAAM,KAAM;AACzB,IAAA,MAAM,UAAUA,MAAAA,CAAM,GAAA,CAAI,CAAC,CAAC,QAAA,EAAU,MAAM,CAAA,KAAM,CAAA,CAAA,EAAI,UAAU,QAAQ,CAAC,IAAI,MAAA,CAAO,MAAM,CAAC,CAAA,CAAA,CAAG,CAAA,CAAE,KAAK,EAAE,CAAA;AACvG,IAAA,OAAO,CAAA,OAAA,EAAU,IAAI,CAAA,EAAG,OAAO,CAAA;AAAA,EAAQ,KAAA,CAAM,IAAA,CAAK,IAAI,CAAC;AAAA,CAAA,CAAA;AAAA,EACzD,CAAC,CAAA,CACA,IAAA,CAAK,MAAM,CAAA;AAChB;AAOO,SAAS,kBAAA,CAAmB,KAAA,EAA+C,OAAA,GAA8C,EAAC,EAA2B;AAC1J,EAAA,MAAM,SAAA,GAAY,QAAQ,SAAA,KAAc,CAAC,aAA6B,CAAA,KAAA,EAAQ,KAAA,CAAM,QAAQ,CAAC,CAAA,CAAA,CAAA;AAC7F,EAAA,MAAM,MAAA,GAAS,UAAA,CAAW,KAAA,CAAM,MAAM,CAAA;AACtC,EAAA,OAAO,MAAA,CAAO,YAAY,CAAC,GAAG,cAAc,MAAM,CAAA,CAAE,IAAA,EAAM,CAAA,CAAE,GAAA,CAAI,CAAC,IAAA,KAAS,CAAC,UAAU,IAAI,CAAA,EAAG,MAAM,GAAA,CAAI,IAAI,CAAW,CAAC,CAAC,CAAA;AACzH;;;ACnHA,SAAS,gBAAgBH,KAAAA,EAA0B;AACjD,EAAA,IAAIA,KAAAA,CAAK,IAAA,KAAS,QAAA,EAAU,OAAOA,KAAAA;AACnC,EAAA,MAAM,KAAA,GAAQ,mBAAmB,EAAE,GAAGA,OAAM,MAAA,EAAQ,KAAA,EAAM,EAAG,KAAA,EAAO,IAAI,CAAA;AACxE,EAAA,OAAO,EAAE,GAAGA,KAAAA,EAAM,QAAA,EAAU,MAAM,QAAA,EAAS;AAC7C;AAUO,SAAS,gBAAA,CACd,IAAA,EACA,KAAA,EACA,EAAE,UAAA,GAAa,OAAO,UAAA,GAAa,KAAA,EAAM,GAA6B,EAAC,EACrD;AAClB,EAAA,MAAM,QAAQ,KAAA,EAAM;AACpB,EAAA,IAAI,OAAA;AACJ,EAAA,MAAM,GAAA,GAAM,MACT,OAAA,KAAY,mBAAA,CAAoB,IAAA,EAAM,KAAA,EAAO,EAAE,SAAA,EAAW,IAAA,EAAM,UAAA,EAAY,UAAA,EAAY,CAAA;AAC3F,EAAA,MAAM,MAAA,GAAS,CAAC,IAAA,KAAuC;AACrD,IAAA,MAAM,EAAE,KAAA,EAAM,GAAI,GAAA,EAAI;AACtB,IAAA,MAAMA,QAAO,KAAA,KAAU,IAAA,GAAO,MAAA,GAAY,UAAA,CAAW,OAAO,IAAI,CAAA;AAChE,IAAA,OAAOA,KAAAA,KAAS,MAAA,IAAa,UAAA,GAAaA,KAAAA,GAAO,gBAAgBA,KAAI,CAAA;AAAA,EACvE,CAAA;AACA,EAAA,OAAO;AAAA,IACL,KAAA;AAAA,IACA,MAAA;AAAA,IACA,KAAA,EAAO,CAAC,KAAA,KAAU;AAChB,MAAA,MAAM,MAAA,GAAS,eAAA,CAAgB,KAAA,EAAO,MAAM,CAAA;AAC5C,MAAA,OAAO,MAAA,IAAU,EAAE,IAAA,EAAM,MAAA,CAAO,IAAA,EAAM,MAAM,eAAA,CAAgB,KAAA,EAAO,MAAA,CAAO,IAAI,CAAA,EAAE;AAAA,IAClF,CAAA;AAAA,IACA,YAAY,CAAC,IAAA,KAAS,KAAI,CAAE,QAAA,CAAS,IAAI,IAAI,CAAA;AAAA,IAC7C,GAAI,UAAA,GAAa,EAAE,QAAA,EAAU,CAAC,IAAA,KAAiB,GAAA,EAAI,CAAE,MAAA,CAAO,GAAA,CAAI,IAAI,CAAA,KAAM,EAAC;AAAA,IAC3E,SAAS,CAAC,IAAA,EAAM,IAAA,EAAM,KAAA,KAAU,yBAAyB,IAAA,EAAM,IAAA,EAAM,KAAA,CAAM,EAAE,MAAM,KAAA,EAAO,GAAG,EAAE,UAAA,EAAY,YAAY;AAAA,GACzH;AACF;;;AC3EA,IAAM,WAAW,CAAC,CAAA,KAA6C,OAAO,CAAA,KAAM,YAAY,CAAA,KAAM,IAAA;AAOvF,SAAS,cAAA,CAAeI,OAAkB,IAAA,EAAwC;AACvF,EAAA,IAAI,QAAA,CAAS,IAAI,CAAA,EAAG,OAAO,IAAA;AAC3B,EAAA,OAAOA,KAAAA,CAAK,UAAA,GAAa,IAAI,CAAA,KAAM,QAAA,CAASA,MAAK,OAAO,CAAA,GAAIA,KAAAA,CAAK,OAAA,GAAU,EAAC,CAAA;AAC9E;AAIO,SAAS,mBAAA,CAAoBA,KAAAA,EAAkB,IAAA,EAAe,GAAA,EAAa,KAAA,EAAyC;AACzH,EAAA,MAAM,IAAA,GAAO,cAAA,CAAeA,KAAAA,EAAM,IAAI,CAAA;AACtC,EAAA,IAAI,KAAA,KAAU,QAAW,OAAO,EAAE,GAAG,IAAA,EAAM,CAAC,GAAG,GAAG,KAAA,EAAM;AACxD,EAAA,MAAM,EAAE,CAAC,GAAG,GAAG,QAAA,EAAU,GAAG,MAAK,GAAI,IAAA;AACrC,EAAA,OAAO,IAAA;AACT;;;ACXO,SAAS,QAAA,CAA6B,MAAcJ,KAAAA,EAA+B;AACxF,EAAA,OAAO,EAAE,GAAGA,KAAAA,EAAM,IAAA,EAAM,IAAA,EAAK;AAC/B;;;ACuEO,SAAS,gBAAgB,KAAA,EAA2B;AACzD,EAAA,OAAO,KAAA,CAAM,EAAA,KAAO,MAAA,IAAa,KAAA,CAAM,EAAA,KAAO,MAAA;AAChD;;;AChFO,SAAS,gBAAgBA,KAAAA,EAAyB;AACvD,EAAA,OAAA,CAAQA,MAAK,IAAA,KAAS,SAAA,IAAaA,MAAK,IAAA,KAAS,MAAA,KAAW,cAAcA,KAAI,CAAA;AAChF;AAOO,SAAS,eAAe,IAAA,EAAmD;AAChF,EAAA,IAAI,IAAA,CAAK,IAAA,KAAS,EAAA,EAAI,OAAO,MAAA;AAC7B,EAAA,MAAM,IAAA,GAAO,SAAA,IAAa,IAAA,GAAO,IAAA,CAAK,UAAU,IAAA,CAAK,QAAA;AACrD,EAAA,KAAA,MAAW,CAAC,GAAA,EAAK,KAAK,KAAK,MAAA,CAAO,OAAA,CAAQ,IAAI,CAAA,EAAG;AAC/C,IAAA,IAAI,UAAA,CAAW,KAAK,CAAA,IAAK,KAAA,CAAM,YAAY,IAAA,IAAQ,eAAA,CAAgB,KAAK,CAAA,EAAG,OAAO,GAAA;AAAA,EACpF;AACA,EAAA,OAAO,MAAA;AACT;;;ACNO,SAAS,QAAA,CACd,OACA,MAAA,EACc;AACd,EAAA,MAAM,MAAA,GAAS,KAAA,CAAM,GAAA,CAAI,MAAM,CAAA;AAC/B,EAAA,MAAM,KAAA,GAAQ,WAAW,MAAA,CAAO,MAAA,CAAO,CAAC,KAAA,KAAU,KAAA,KAAU,MAAS,CAAC,CAAA;AACtE,EAAA,MAAM,IAAA,GAAO,MAAA,CAAO,GAAA,CAAI,CAAC,KAAA,KAAW,KAAA,KAAU,MAAA,GAAY,MAAA,GAAY,KAAA,CAAM,GAAA,CAAI,KAAA,CAAM,CAAC,CAAC,CAAE,CAAA;AAC1F,EAAA,MAAM,OAAqB,EAAC;AAC5B,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,GAAI,KAAA,CAAM,MAAA,IAAU;AAClC,IAAA,MAAM,IAAA,GAAO,KAAK,CAAC,CAAA;AACnB,IAAA,IAAI,IAAI,CAAA,GAAI,CAAA;AACZ,IAAA,OAAO,IAAA,KAAS,UAAa,IAAA,CAAK,CAAC,GAAG,GAAA,KAAQ,IAAA,CAAK,KAAK,CAAA,IAAK,CAAA;AAC7D,IAAA,IAAA,CAAK,IAAA,CAAK,IAAI,CAAA,GAAI,CAAA,GAAI,EAAE,KAAA,EAAO,KAAA,CAAM,MAAM,CAAA,EAAG,CAAC,GAAG,IAAA,EAAK,GAAI,EAAE,KAAA,EAAO,CAAC,MAAM,CAAC,CAAE,GAAG,CAAA;AACjF,IAAA,CAAA,GAAI,CAAA;AAAA,EACN;AACA,EAAA,OAAO,IAAA;AACT;;;ACnBA,IAAM,GAAA,GAAsB,EAAE,QAAA,EAAU,KAAA,EAAO,SAAS,KAAA,EAAM;AAC9D,IAAM,IAAA,GAAuB,EAAE,QAAA,EAAU,IAAA,EAAM,SAAS,IAAA,EAAK;AAQtD,IAAM,gBAAA,GAAqD;AAAA,EAChE,MAAA,EAAQ,GAAA;AAAA,EACR,OAAA,EAAS,GAAA;AAAA,EACT,MAAA,EAAQ,GAAA;AAAA,EACR,IAAA,EAAM,GAAA;AAAA,EACN,KAAA,EAAO,GAAA;AAAA,EACP,KAAA,EAAO,GAAA;AAAA,EACP,MAAA,EAAQ,IAAA;AAAA,EACR,IAAA,EAAM,IAAA;AAAA,EACN,GAAA,EAAK,IAAA;AAAA,EACL,KAAA,EAAO,IAAA;AAAA,EACP,KAAA,EAAO,GAAA;AAAA,EACP,MAAA,EAAQ,EAAE,QAAA,EAAU,KAAA,EAAO,SAAS,IAAA,EAAK;AAAA,EACzC,KAAA,EAAO,GAAA;AAAA,EACP,KAAA,EAAO,GAAA;AAAA,EACP,SAAA,EAAW;AACb;AAEA,IAAM,QAAA,GAAW,CAACA,KAAAA,KACf,MAAA,CAAO,MAAA,CAAO,gBAAA,EAAkBA,KAAAA,CAAK,IAAI,CAAA,GAAI,gBAAA,CAAiBA,KAAAA,CAAK,IAAgB,CAAA,GAAI,GAAA;AAGnF,SAAS,eAAeA,KAAAA,EAAiC;AAC9D,EAAA,OAAO,QAAA,CAASA,KAAI,CAAA,CAAE,QAAA;AACxB;AAGO,SAAS,iBAAiBA,KAAAA,EAAiC;AAChE,EAAA,OAAO,QAAA,CAASA,KAAI,CAAA,CAAE,OAAA;AACxB","file":"index.js","sourcesContent":["/** One step of a walk over a group's children: a child on its own, or the neighboring `tab` children that share one strip. */\nexport type PrefTabRun<T> = { item: T; tabs?: undefined } | { tabs: readonly T[]; item?: undefined };\n\n/**\n * `items` in order, each run of neighbors `isTab` holds for folded into one step. What a surface leaves out of\n * `items` neither joins a run nor ends one, and what it keeps and then declines to draw still holds its run together.\n */\nexport function prefTabRuns<T>(items: readonly T[], isTab: (item: T) => boolean): PrefTabRun<T>[] {\n  const out: PrefTabRun<T>[] = [];\n  let run: T[] | undefined;\n  for (const item of items) {\n    if (!isTab(item)) {\n      run = undefined;\n      out.push({ item });\n    } else if (run) {\n      run.push(item);\n    } else {\n      out.push({ tabs: (run = [item]) });\n    }\n  }\n  return out;\n}\n","// A stored value as the control over its leaf shows it. A condition compares\n// that, and not the stored form: a person writes \"is on\" about an Italic\n// toggle, whatever string the toggle stores.\n\nimport type { PrefConditionReader } from './condition';\nimport type { PrefGroup, PrefSection } from './groups';\nimport { prefLeafHolding, prefLeafHoldingIn, prefSchemaHolding, UNSEEN } from './holding';\nimport type { PrefBoolean, PrefEnum, PrefLeaf } from './schema';\n\ntype Siblings = Record<string, unknown> | undefined;\n\n/** What the control over `leaf` shows for `stored`: what its `encoding` reads it as, else `stored` itself.\n *  `siblings` is the object the leaf is a field of. */\nexport function prefShownValue(leaf: PrefLeaf, stored: unknown, siblings?: Record<string, unknown>): unknown {\n  if (leaf.kind !== 'boolean' && leaf.kind !== 'enum') return stored;\n  const { encoding } = leaf as PrefBoolean | PrefEnum;\n  return encoding ? (encoding.read as (stored: unknown, siblings: Siblings) => unknown)(stored, siblings) : stored;\n}\n\n/**\n * `read` with each value handed back as {@link prefShownValue} gives it, for\n * the leaf of `schema` at that path, a field of an `object` or a `union` leaf\n * included. A field's siblings are what `read` finds at its leaf's path. A\n * path read from the entry is held to `item`, the leaf describing that entry.\n * A path no leaf of `schema` holds is held to `over`, the schema it is drawn\n * over.\n */\nexport function prefShownReader(\n  schema: PrefGroup | PrefSection, read: PrefConditionReader, item?: PrefLeaf, over?: PrefGroup | PrefSection,\n): PrefConditionReader {\n  return (path, from) => {\n    const stored = read(path, from);\n    const held = from === 'item' ? item && prefLeafHoldingIn(item, path) : prefLeafHolding(prefSchemaHolding(schema, path, over), path);\n    if (held === undefined || held === UNSEEN) return stored;\n    const object = held.within === undefined ? undefined : read(held.within, from);\n    return prefShownValue(held.leaf, stored, typeof object === 'object' && object !== null ? (object as Siblings) : undefined);\n  };\n}\n","// Who answers a condition: a judge, made from a way to read values.\n\nimport { prefConditionHolds, prefConditionReadsItem, type PrefCondition, type PrefConditionReader } from './condition';\nimport type { PrefGroup, PrefSection } from './groups';\nimport { isPrefLeaf, isPrefSection, prefSectionLeaves, prefValueAtPath } from './helpers';\nimport { prefSchemaHolding } from './holding';\nimport type { PrefLeaf } from './schema';\nimport { prefShownReader } from './shown';\n\n/** Which of a node's two conditions a {@link PrefConditionJudge} is asked about. */\nexport type PrefConditionField = 'showIf' | 'enableIf';\n\n/**\n * Says whether one condition holds. {@link prefJudge} makes one from a value\n * reader; a surface drawing several values at once writes its own, to say\n * what a condition that holds for some and not for others comes to.\n */\nexport type PrefConditionJudge = (condition: PrefCondition, field: PrefConditionField) => boolean;\n\n/** One entry of a list or a map: the `item` leaf describing it, and what it holds. */\nexport interface PrefEntry {\n  item: PrefLeaf;\n  value: unknown;\n}\n\n/** What `entry` holds at `path`, the empty path being the entry itself: its own value, else that part of the item's default. */\nfunction entryValue({ item, value }: PrefEntry, path: string): unknown {\n  if (path === '') return value !== undefined ? value : item.default;\n  const held = prefValueAtPath(value, path);\n  return held !== undefined ? held : prefValueAtPath(item.default, path);\n}\n\n/**\n * A judge over one set of values, read by path. A condition compares each\n * value as the control over its leaf in `schema` shows it\n * ({@link prefShownReader}), so `read` hands back what is stored. A test\n * that reads from the entry (`from: 'item'`) reads `entry`, and finds nothing\n * held where none is given. `over` is the schema `schema` is drawn over: a\n * path no leaf of `schema` holds is compared as the leaf of `over` there\n * shows it.\n */\nexport function prefJudge(\n  schema: PrefGroup | PrefSection, read: (path: string) => unknown, entry?: PrefEntry, over?: PrefGroup | PrefSection,\n): PrefConditionJudge {\n  const stored: PrefConditionReader = (path, from) => (from === 'item' ? entry && entryValue(entry, path) : read(path));\n  const shown = prefShownReader(schema, stored, entry?.item, over);\n  return (condition) => prefConditionHolds(condition, shown);\n}\n\n/**\n * `holds` for every condition but one that reads the entry, which is left\n * unanswered, which is to say holding: what a walk with no entry in hand\n * asks inside the item of a list or a map.\n */\nexport function deferEntryConditions(holds: PrefConditionJudge): PrefConditionJudge {\n  return (condition, field) => prefConditionReadsItem(condition) || holds(condition, field);\n}\n\n/**\n * Reads a value by path the way a form over `schema` shows it: what `values`\n * holds there, else the default of the leaf at that path, or the part of a\n * leaf's default the rest of the path names. `over` is the schema `schema`\n * is drawn over: a path no leaf of `schema` holds takes its default there.\n */\nexport function prefReader(schema: PrefGroup | PrefSection, values: unknown, over?: PrefGroup | PrefSection): (path: string) => unknown {\n  const beyond = over && prefReader(over, values);\n  return (path) => {\n    const held = prefValueAtPath(values, path);\n    if (held !== undefined) return held;\n    if (beyond && prefSchemaHolding(schema, path, over) === over) return beyond(path);\n    if (isPrefSection(schema)) {\n      for (const [key, leaf] of prefSectionLeaves(schema.members)) {\n        if (path === key) return leaf.default;\n        if (path.startsWith(`${key}.`)) return prefValueAtPath(leaf.default, path.slice(key.length + 1));\n      }\n      return undefined;\n    }\n    const steps = path.split('.');\n    let node: PrefGroup = schema;\n    for (let i = 0; i < steps.length; i++) {\n      if (!Object.hasOwn(node.children, steps[i]!)) return undefined;\n      const child: PrefLeaf | PrefGroup = node.children[steps[i]!]!;\n      if (!isPrefLeaf(child)) node = child;\n      else return i === steps.length - 1 ? child.default : prefValueAtPath(child.default, steps.slice(i + 1).join('.'));\n    }\n    return undefined;\n  };\n}\n","// The scope of one node: whether it is drawn and whether it takes input,\n// with everything above it counted.\n\nimport { prefAliasTarget, type PrefAlias } from './alias';\nimport type { PrefCondition } from './condition';\nimport type { PrefGroup, PrefSection } from './groups';\nimport { isPrefLeaf, isPrefSection, prefLeafAt } from './helpers';\nimport { deferEntryConditions, type PrefConditionJudge } from './judge';\nimport type { PrefList } from './list';\nimport type { PrefMap } from './map';\nimport type { PrefLeaf, PrefObject } from './schema';\nimport type { PrefUnion } from './union';\n\n/** Whether a node is drawn and whether it takes input, with what is above it counted. */\nexport interface PrefScope {\n  shown: boolean;\n  enabled: boolean;\n}\n\n/** The step that stands for any entry of a `list` or a `map` in a path: `'phases.*.hold'` answers for that field of\n *  each, by every condition that comes to the same for every entry. */\nexport const PREF_ENTRY = '*';\n\n/** The scope a schema's root sits in. */\nexport const PREF_SCOPE: PrefScope = Object.freeze({ shown: true, enabled: true });\n\n/** The scope of `node`, which sits directly under something whose scope is `above`. */\nexport function prefScopeUnder(\n  above: PrefScope,\n  node: { showIf?: PrefCondition; enableIf?: PrefCondition },\n  holds: PrefConditionJudge,\n): PrefScope {\n  const shown = above.shown && (node.showIf === undefined || holds(node.showIf, 'showIf'));\n  const enabled = above.enabled && (node.enableIf === undefined || holds(node.enableIf, 'enableIf'));\n  return shown === above.shown && enabled === above.enabled ? above : { shown, enabled };\n}\n\n/** The scope of the field at `rest` among an object leaf's children, or `undefined` when none is there. */\nfunction scopeAmong(\n  held: PrefSection['members'], rest: string, above: PrefScope, holds: PrefConditionJudge,\n): PrefScope | undefined {\n  for (const [key, child] of Object.entries(held)) {\n    if (!isPrefLeaf(child)) {\n      const found = scopeAmong(child.members, rest, prefScopeUnder(above, child, holds), holds);\n      if (found) return found;\n    } else if (rest === key) return prefScopeUnder(above, child, holds);\n    else if (rest.startsWith(`${key}.`)) return scopeInside(child, rest.slice(key.length + 1), prefScopeUnder(above, child, holds), holds);\n  }\n  return undefined;\n}\n\n/** The scope at `rest` inside `leaf`, whose own scope is `scope`: that of a field, or the leaf's where `rest` names none. */\nfunction scopeInside(leaf: PrefLeaf, rest: string, scope: PrefScope, holds: PrefConditionJudge): PrefScope {\n  if (leaf.kind === 'object') return scopeAmong((leaf as PrefObject).children, rest, scope, holds) ?? scope;\n  if (leaf.kind === 'list' || leaf.kind === 'map') {\n    const { item } = leaf as Partial<PrefList | PrefMap>;\n    if (item === undefined) return scope;\n    const inItem = deferEntryConditions(holds);\n    const entry = prefScopeUnder(scope, { enableIf: item.enableIf }, inItem);\n    const dot = rest.indexOf('.');\n    return dot < 0 ? entry : scopeInside(item, rest.slice(dot + 1), entry, inItem);\n  }\n  if (leaf.kind !== 'union') return scope;\n  for (const variant of Object.values((leaf as PrefUnion).variants)) {\n    const found = scopeAmong(variant.children, rest, scope, holds);\n    if (found) return found;\n  }\n  return scope;\n}\n\nfunction scopeAt(schema: PrefGroup | PrefSection, path: string, holds: PrefConditionJudge): PrefScope {\n  let scope = prefScopeUnder(PREF_SCOPE, schema, holds);\n  if (path === '') return scope;\n  if (isPrefSection(schema)) return scopeAmong(schema.members, path, scope, holds) ?? scope;\n  let node: PrefGroup = schema;\n  const steps = path.split('.');\n  for (let i = 0; i < steps.length; i++) {\n    if (!Object.hasOwn(node.children, steps[i]!)) return scope;\n    const child: PrefLeaf | PrefGroup = node.children[steps[i]!]!;\n    scope = prefScopeUnder(scope, child, holds);\n    if (isPrefLeaf(child)) return i === steps.length - 1 ? scope : scopeInside(child, steps.slice(i + 1).join('.'), scope, holds);\n    node = child;\n  }\n  return scope;\n}\n\n/** `own`, an alias's scope by its own conditions, narrowed by that of the leaf it shows in `over`, as `holds` judges `over`. */\nexport function prefAliasScope(own: PrefScope, alias: PrefAlias, over: PrefGroup | PrefSection, holds: PrefConditionJudge): PrefScope {\n  const target = prefAliasTarget(alias, (path) => prefLeafAt(over, path));\n  if (target === undefined) return own;\n  const theirs = scopeAt(over, target.path, holds);\n  const shown = own.shown && theirs.shown;\n  const enabled = own.enabled && theirs.enabled;\n  return shown === own.shown && enabled === own.enabled ? own : { shown, enabled };\n}\n\n/** What {@link prefScopeAt} is told beyond the schema. */\nexport interface PrefScopeAtOptions {\n  /** The schema an alias's `of` names a leaf of. Default: the schema asked. */\n  aliasOver?: PrefGroup | PrefSection;\n  /** Says which conditions of `aliasOver` hold, where its values are not the ones `holds` reads. Default: `holds`. */\n  aliasHolds?: PrefConditionJudge;\n}\n\n/**\n * The scope of the node at `path`: a group, a leaf, a field of an `object`\n * or a `union` leaf, or an entry of a `list` or a `map`, whose step may be\n * any key. Under a {@link PrefSection} schema a leaf's key is its whole\n * path. A path that runs past the schema answers for the last node it\n * reaches. An alias answers for itself and for the leaf it shows, as\n * `applyPrefConditions` has it. Inside an entry, a condition that reads the\n * entry (`from: 'item'`) is not asked and counts as holding, there being no\n * entry here to read: `applyPrefEntryConditions` answers it.\n */\nexport function prefScopeAt(\n  schema: PrefGroup | PrefSection, path: string, holds: PrefConditionJudge, { aliasOver, aliasHolds }: PrefScopeAtOptions = {},\n): PrefScope {\n  const own = scopeAt(schema, path, holds);\n  const leaf = prefLeafAt(schema, path);\n  return leaf?.kind === 'alias' ? prefAliasScope(own, leaf as PrefAlias, aliasOver ?? schema, aliasHolds ?? holds) : own;\n}\n","// What a schema's conditions come to once nesting is counted: a node is drawn\n// only while it and everything above it is shown, and takes input only while\n// it and everything above it is enabled. Every surface that draws a schema\n// asks here.\n\nimport type { PrefAlias } from './alias';\nimport { prefConditionReadsItem } from './condition';\nimport type { PrefGroup, PrefSection } from './groups';\nimport { isPrefLeaf, isPrefSection } from './helpers';\nimport { deferEntryConditions, type PrefConditionJudge } from './judge';\nimport type { PrefList } from './list';\nimport type { PrefMap } from './map';\nimport type { PrefLeaf, PrefObject } from './schema';\nimport { PREF_ENTRY, PREF_SCOPE, prefAliasScope, prefScopeUnder, type PrefScope } from './scopeAt';\nimport type { PrefUnion } from './union';\n\nexport { prefJudge, prefReader, type PrefConditionField, type PrefConditionJudge, type PrefEntry } from './judge';\nexport { PREF_ENTRY, PREF_SCOPE, prefScopeAt, prefScopeUnder, type PrefScope, type PrefScopeAtOptions } from './scopeAt';\n\nconst under = (prefix: string, key: string): string => (prefix === '' ? key : `${prefix}.${key}`);\n\n/** A schema with its conditions applied. */\nexport interface PrefConditionsApplied<T> {\n  /** The schema without the nodes that are not shown. The schema itself when\n   *  that is all of it, and `null` when its root is not shown. */\n  shown: T | null;\n  /**\n   * The value path of every leaf that is disabled, a field of an `object` or\n   * a `union` leaf included (`'stroke.width'`), and under a {@link PrefGroup}\n   * schema the path of every group that is. A `list`'s or a `map`'s item is\n   * named once for every entry, with {@link PREF_ENTRY} as the entry's step:\n   * `'phases.*'`, and `'phases.*.hold'` for a field of it.\n   */\n  disabled: ReadonlySet<string>;\n  /**\n   * With `keepHidden`, the path of everything `shown` holds that is not\n   * shown, named as `disabled` names what is disabled. Empty without it,\n   * since `shown` then holds none.\n   */\n  hidden: ReadonlySet<string>;\n}\n\n/** How {@link applyPrefConditions} treats what it would leave out. */\nexport interface PrefConditionsOptions {\n  /** Keep a group or a section that leaves with nothing to draw. */\n  keepEmpty?: boolean;\n  /**\n   * Keep every node whose `showIf` fails, and name it in `hidden`: for a\n   * surface that edits the schema, where a node not drawn cannot be picked.\n   */\n  keepHidden?: boolean;\n  /** The schema an alias's `of` names a leaf of. Default: the schema walked. */\n  aliasOver?: PrefGroup | PrefSection;\n  /** Says which conditions of `aliasOver` hold, where its values are not the ones `holds` reads. Default: `holds`. */\n  aliasHolds?: PrefConditionJudge;\n}\n\ninterface WalkOptions {\n  keepEmpty: boolean;\n  keepHidden: boolean;\n  /** Asked inside the item of a list or a map met on the way, whose entries the walk does not have. */\n  inItem: PrefConditionJudge;\n  aliasOver?: PrefGroup | PrefSection;\n  aliasHolds?: PrefConditionJudge;\n}\n\n/** The walk over leaves and what is inside them, which the schema's pass and an entry's share. */\nfunction leafWalk({ keepEmpty, keepHidden, inItem, aliasOver, aliasHolds }: WalkOptions) {\n  const disabled = new Set<string>();\n  const hidden = new Set<string>();\n\n  const leaf = (node: PrefLeaf, path: string, above: PrefScope, holds: PrefConditionJudge): PrefLeaf | null => {\n    const own = prefScopeUnder(above, node, holds);\n    const scope = node.kind === 'alias' && aliasOver ? prefAliasScope(own, node as PrefAlias, aliasOver, aliasHolds ?? holds) : own;\n    return scope.shown || keepHidden ? inside(node, path, scope, holds) : null;\n  };\n\n  /** `node`, whose scope is `scope`, without what its own value hides: a field, or part of a list's or a map's item. */\n  const inside = (node: PrefLeaf, path: string, scope: PrefScope, holds: PrefConditionJudge): PrefLeaf => {\n    if (!scope.shown) hidden.add(path);\n    if (!scope.enabled) disabled.add(path);\n    if (node.kind === 'object') {\n      const children = members((node as PrefObject).children, path, scope, holds);\n      return children === (node as PrefObject).children ? node : ({ ...node, children } as PrefLeaf);\n    }\n    if (node.kind === 'list' || node.kind === 'map') {\n      const { item } = node as Partial<PrefList | PrefMap>;\n      // A leaf an app's renderer draws under a built-in's kind may hold no item.\n      if (item === undefined) return node;\n      // An item is drawn with its entry, so its own `showIf` is not asked.\n      const entry = inside(item, under(path, PREF_ENTRY), prefScopeUnder(scope, { enableIf: item.enableIf }, inItem), inItem);\n      return entry === item ? node : ({ ...node, item: entry } as PrefLeaf);\n    }\n    if (node.kind !== 'union') return node;\n    const { variants } = node as PrefUnion;\n    let changed = false;\n    const next: PrefUnion['variants'] = {};\n    for (const [key, variant] of Object.entries(variants)) {\n      const children = members(variant.children, path, scope, holds);\n      changed ||= children !== variant.children;\n      next[key] = children === variant.children ? variant : { ...variant, children };\n    }\n    return changed ? ({ ...node, variants: next } as PrefLeaf) : node;\n  };\n\n  /** A section's members or an object leaf's children. `prefix` is the object leaf's path, empty in a section schema. */\n  const members = (held: PrefSection['members'], prefix: string, above: PrefScope, holds: PrefConditionJudge): PrefSection['members'] => {\n    let changed = false;\n    const out: PrefSection['members'] = {};\n    for (const [key, child] of Object.entries(held)) {\n      const kept = isPrefLeaf(child) ? leaf(child, under(prefix, key), above, holds) : section(child, prefix, above, holds);\n      changed ||= kept !== child;\n      if (kept !== null) out[key] = kept;\n    }\n    return changed ? out : held;\n  };\n\n  const section = (node: PrefSection, prefix: string, above: PrefScope, holds: PrefConditionJudge): PrefSection | null => {\n    const scope = prefScopeUnder(above, node, holds);\n    if (!scope.shown && !keepHidden) return null;\n    const kept = members(node.members, prefix, scope, holds);\n    if (kept === node.members) return node;\n    return Object.keys(kept).length === 0 && !keepEmpty ? null : { ...node, members: kept };\n  };\n\n  return { disabled, hidden, leaf, inside, members };\n}\n\n/**\n * `schema` as it is drawn while `holds` says which conditions hold. A node\n * whose `showIf` fails is dropped with everything under it, unless\n * `keepHidden`, and so is a group or a section that leaves with nothing to\n * draw, unless `keepEmpty`. A node\n * whose `enableIf` fails is disabled with everything under it. The item of\n * a `list` or a `map` is walked as its entries are drawn: its fields hide and\n * disable by their conditions, and its own `enableIf` disables every entry.\n * A condition there that reads the entry (`from: 'item'`) has no one answer\n * for every entry and is left holding: {@link applyPrefEntryConditions}\n * answers it for each.\n * An alias is shown only while it and the leaf it shows both are, and enabled\n * only while both are, with everything above that leaf counted. That leaf is\n * looked for in `aliasOver`, and its side is asked of `aliasHolds`.\n * Parts with nothing dropped come back as the objects they were.\n */\nexport function applyPrefConditions<T extends PrefGroup | PrefSection>(\n  schema: T,\n  holds: PrefConditionJudge,\n  { keepEmpty = false, keepHidden = false, aliasOver, aliasHolds }: PrefConditionsOptions = {},\n): PrefConditionsApplied<T> {\n  const walk = leafWalk({ keepEmpty, keepHidden, inItem: deferEntryConditions(holds), aliasOver: aliasOver ?? schema, aliasHolds });\n  const { disabled, hidden } = walk;\n\n  const group = (node: PrefGroup, path: string, above: PrefScope): PrefGroup | null => {\n    const scope = prefScopeUnder(above, node, holds);\n    if (!scope.shown && !keepHidden) return null;\n    if (!scope.shown && path !== '') hidden.add(path);\n    if (!scope.enabled && path !== '') disabled.add(path);\n    let changed = false;\n    const children: PrefGroup['children'] = {};\n    for (const [key, child] of Object.entries(node.children)) {\n      const at = under(path, key);\n      const kept = isPrefLeaf(child) ? walk.leaf(child, at, scope, holds) : group(child, at, scope);\n      changed ||= kept !== child;\n      if (kept !== null) children[key] = kept;\n    }\n    if (!changed) return node;\n    return Object.keys(children).length === 0 && !keepEmpty && path !== '' ? null : { ...node, children };\n  };\n\n  if (!isPrefSection(schema)) return { shown: group(schema, '', PREF_SCOPE) as T | null, disabled, hidden };\n  const scope = prefScopeUnder(PREF_SCOPE, schema, holds);\n  if (!scope.shown && !keepHidden) return { shown: null, disabled, hidden };\n  const kept = walk.members(schema.members, '', scope, holds);\n  return { shown: kept === schema.members ? schema : { ...schema, members: kept }, disabled, hidden };\n}\n\n/** One entry of a list or a map with the conditions that read it applied. */\nexport interface PrefEntryApplied {\n  /** The item as this entry draws it: without the fields not shown, and the item itself when that is all of them. */\n  item: PrefLeaf;\n  /** The path of the entry, and of every field in it, that is disabled, named as {@link PrefConditionsApplied} names them. */\n  disabled: ReadonlySet<string>;\n  /** With `keepHidden`, the path of every field of the entry that is not shown. */\n  hidden: ReadonlySet<string>;\n}\n\nconst ALWAYS: PrefConditionJudge = () => true;\n\n/**\n * The conditions {@link applyPrefConditions} leaves unanswered, answered for\n * one entry: `item`, as that pass left it, drawn for the entry at `path`\n * (`'phases.2'`) while `holds` says which conditions hold. `holds` reads the\n * entry: `prefJudge` given it. Only a condition that reads the entry is\n * asked, the rest being applied already, and one inside a list or a map\n * within the entry is left for that one's own entries.\n */\nexport function applyPrefEntryConditions(\n  item: PrefLeaf,\n  path: string,\n  holds: PrefConditionJudge,\n  { keepEmpty = false, keepHidden = false }: Pick<PrefConditionsOptions, 'keepEmpty' | 'keepHidden'> = {},\n): PrefEntryApplied {\n  const asked: PrefConditionJudge = (condition, field) => !prefConditionReadsItem(condition) || holds(condition, field);\n  const walk = leafWalk({ keepEmpty, keepHidden, inItem: ALWAYS });\n  const scope = prefScopeUnder(PREF_SCOPE, { enableIf: item.enableIf }, asked);\n  return { item: walk.inside(item, path, scope, asked), disabled: walk.disabled, hidden: walk.hidden };\n}\n","// Short forms for writing a schema by hand. Each returns the plain data a\n// literal would: nothing reads a schema differently for how it was written.\n\nimport type { PrefGroup, PrefSection } from './groups';\nimport type { PrefBoolean, PrefColor, PrefEnumBase, PrefLeaf, PrefNumber, PrefString } from './schema';\n\n/** What a builder takes after the leaf's name and default: any of the leaf's other fields. */\ntype Rest<L> = Partial<Omit<L, 'kind' | 'name' | 'default'>>;\n\n/** One option of an enum, or its value alone, which is labeled with the value's first letter raised. */\ntype OptionOf<T extends string> = T | PrefEnumBase<T>['options'][number];\n\nconst leaf = <L extends PrefLeaf>(kind: L['kind'], name: string, def: unknown, rest: object | undefined): L =>\n  ({ kind, name, description: '', default: def, ...rest }) as L;\n\nconst labeled = (value: string): string => (value === '' ? value : value[0]!.toUpperCase() + value.slice(1));\n\n/**\n * Builders for a preferences schema, each returning what the literal would\n * hold. `pref.group('View', { grid: pref.boolean('Grid', true) })` is\n * `{ name: 'View', children: { grid: { kind: 'boolean', name: 'Grid', description: '', default: true } } }`,\n * and its paths and value types are read from it the same way.\n */\nexport const pref = {\n  /** A group: `children` nest under its key, which is a segment of their paths. */\n  group<const C extends Record<string, PrefLeaf | PrefGroup>>(\n    name: string,\n    children: C,\n    options?: Omit<PrefGroup, 'name' | 'children'>,\n  ): Omit<PrefGroup, 'children'> & { children: C } {\n    return { name, ...options, children };\n  },\n\n  /** A section: a heading over `members`, whose key adds nothing to their paths. */\n  section<const M extends Record<string, PrefLeaf | PrefSection>>(\n    name: string,\n    members: M,\n    options?: Omit<PrefSection, 'name' | 'members'>,\n  ): Omit<PrefSection, 'members'> & { members: M } {\n    return { name, ...options, members };\n  },\n\n  number: (name: string, def: number, rest?: Rest<PrefNumber>): PrefNumber => leaf('number', name, def, rest),\n  boolean: (name: string, def: boolean, rest?: Rest<PrefBoolean>): PrefBoolean => leaf('boolean', name, def, rest),\n  string: (name: string, def: string, rest?: Rest<PrefString>): PrefString => leaf('string', name, def, rest),\n  color: (name: string, def: string, rest?: Rest<PrefColor>): PrefColor => leaf('color', name, def, rest),\n\n  /** A fixed set of choices. An option given as its value alone is labeled with that value, its first letter raised. */\n  enum<const T extends string>(\n    name: string,\n    def: NoInfer<T>,\n    options: readonly OptionOf<T>[],\n    rest?: Omit<Rest<PrefEnumBase<T>>, 'options'>,\n  ): PrefEnumBase<T> & { default: T; clearable?: false } {\n    const full = options.map((option) => (typeof option === 'string' ? { value: option, label: labeled(option) } : option));\n    return { kind: 'enum', name, description: '', default: def, ...rest, options: full };\n  },\n};\n","// A store's values as CSS custom properties: one block for what every choice\n// of the selectors shares, and one for each choice a split value tells apart.\n\nimport type { PrefGroup } from './groups';\nimport { prefHoldsValue, prefLeaves, prefValueAtPath } from './helpers';\nimport { isPrefLocus, type PrefLocus, type PrefSelection } from './locus';\nimport type { PrefEnum, PrefLeaf, PrefNumber } from './schema';\nimport { prefSelectors } from './splitCheck';\nimport { resolvePrefUnit } from './unit';\n\n/** How {@link prefsCss} names and writes things. */\nexport interface PrefsCssOptions {\n  /** The selector of the element the properties are set on, and the selectors' attributes read from. Default `:root`. */\n  root?: string;\n  /** The custom property a leaf is written as, or `null` to leave the leaf out. Default: `--`, then the path with\n   *  each `.` and each capital turned into a `-` (`look.gridGap` is `--look-grid-gap`). */\n  property?: (path: string, leaf: PrefLeaf) => string | null;\n  /** The attribute a selector's option is read from. Default: `data-`, then the path as a property spells it. */\n  attribute?: (selector: string) => string;\n  /** The CSS text of a value, `null` to leave it out, or `undefined` for what its kind writes by itself. */\n  value?: (value: unknown, leaf: PrefLeaf, path: string) => string | null | undefined;\n}\n\n/** What {@link prefsCss} reads of a store: any `PrefsStore` is one. */\nexport interface PrefsCssSource {\n  schema: PrefGroup;\n  values(read?: { at?: PrefSelection }): Record<string, unknown>;\n  locus(path: string): PrefLocus | undefined;\n  get(path: string): unknown;\n}\n\nconst kebab = (path: string): string => path.replace(/\\./g, '-').replace(/[A-Z]/g, (letter) => `-${letter.toLowerCase()}`);\n\n/** The CSS unit a number leaf's suffix names, for the suffixes that name one. */\nconst CSS_UNITS: Readonly<Record<string, string>> = {\n  px: 'px', '%': '%', em: 'em', rem: 'rem', ch: 'ch', pt: 'pt', vw: 'vw', vh: 'vh',\n  ms: 'ms', s: 's', '°': 'deg', deg: 'deg', rad: 'rad', turn: 'turn',\n};\n\nconst IDENT = /^-?[A-Za-z_][\\w-]*$/;\nconst quoted = (text: string): string => `'${text.replace(/[\\\\']/g, '\\\\$&')}'`;\n\n/** What a value of a built-in kind is written as, `null` for one with no CSS form. */\nfunction cssValue(leaf: PrefLeaf, value: unknown): string | null {\n  switch (leaf.kind) {\n    case 'number': {\n      if (typeof value !== 'number' || !Number.isFinite(value)) return null;\n      const { unit } = leaf as PrefNumber;\n      const resolved = unit ? resolvePrefUnit(unit) : undefined;\n      const shown = resolved ? resolved.toDisplay(value) : value;\n      const suffix = resolved?.suffix !== undefined && Object.hasOwn(CSS_UNITS, resolved.suffix) ? CSS_UNITS[resolved.suffix] : '';\n      return `${Number(shown.toFixed(6))}${suffix}`;\n    }\n    case 'boolean':\n      return typeof value === 'boolean' ? (value ? '1' : '0') : null;\n    case 'color':\n      return typeof value === 'string' && value !== '' ? value : null;\n    case 'enum':\n      if (typeof value !== 'string' || (leaf as PrefEnum).encoding) return null;\n      return IDENT.test(value) ? value : quoted(value);\n    case 'string':\n      return typeof value === 'string' ? quoted(value) : null;\n    default:\n      return null;\n  }\n}\n\n/** One choice of options, a selector's path and its option per step, and the value read under it. */\ntype Told = { under: [selector: string, option: string][]; value: unknown };\n\n/** Every choice of options a held value tells apart, outermost selector first. */\nfunction toldApart(held: unknown, optionsOf: (selector: string) => readonly string[], absent: unknown): Told[] {\n  const out: Told[] = [];\n  const walk = (value: unknown, under: Told['under']): void => {\n    if (!isPrefLocus(value)) {\n      out.push({ under, value });\n      return;\n    }\n    for (const option of optionsOf(value.$by)) {\n      walk(Object.hasOwn(value.$of, option) ? value.$of[option] : absent, [...under, [value.$by, option]]);\n    }\n  };\n  walk(held, []);\n  return out;\n}\n\n/**\n * The store's values as CSS custom properties.\n *\n * The first block sets every leaf on `root`, a split one at the member the\n * selectors' defaults name, so a page that sets no attribute still has a\n * value for each. A block follows for each choice of options some value tells\n * apart, matched by an attribute per selector on that same element; a selector\n * is written under each of its own options too. Every block is inside\n * `:where()`, so none outranks another by how many attributes it names, and a\n * rule of the page's own wins. Blocks naming more selectors come later.\n *\n * A number is written in its display unit where the unit's suffix is a CSS\n * unit, and bare otherwise; a boolean as `1` or `0`; a color as it is held; an\n * enum's option as an identifier; a string quoted. A leaf of any other kind is\n * left out unless `value` writes it.\n */\nexport function prefsCss(store: PrefsCssSource, options: PrefsCssOptions = {}): string {\n  const root = options.root ?? ':root';\n  const property = options.property ?? ((path: string): string => `--${kebab(path)}`);\n  const attribute = options.attribute ?? ((selector: string): string => `data-${kebab(selector)}`);\n  const leaves = new Map([...prefLeaves(store.schema)].filter(([, leaf]) => prefHoldsValue(leaf)));\n  const selectors = prefSelectors(leaves);\n  const defaults = Object.fromEntries([...selectors.keys()].map((path) => [path, leaves.get(path)!.default as string]));\n  const base = store.values({ at: defaults });\n\n  const blocks = new Map<string, { under: Told['under']; lines: string[] }>();\n  const declare = (under: Told['under'], path: string, leaf: PrefLeaf, value: unknown): void => {\n    const name = property(path, leaf);\n    if (name === null) return;\n    const given = options.value?.(value, leaf, path);\n    const text = given === undefined ? cssValue(leaf, value) : given;\n    if (text === null) return;\n    const key = under.map(([selector, option]) => `${selector}=${option}`).join('&');\n    if (!blocks.has(key)) blocks.set(key, { under, lines: [] });\n    blocks.get(key)!.lines.push(`  ${name}: ${text};`);\n  };\n\n  for (const [path, leaf] of leaves) {\n    declare([], path, leaf, prefValueAtPath(base, path));\n    const own = selectors.get(path);\n    if (own) for (const option of own) declare([[path, option]], path, leaf, option);\n    const held = store.locus(path);\n    if (!held) continue;\n    for (const { under, value } of toldApart(held, (selector) => selectors.get(selector) ?? [], leaf.default)) {\n      declare(under, path, leaf, value);\n    }\n  }\n\n  return [...blocks.values()]\n    .map((block, i) => ({ ...block, i }))\n    .sort((a, b) => a.under.length - b.under.length || a.i - b.i)\n    .map(({ under, lines }) => {\n      const matched = under.map(([selector, option]) => `[${attribute(selector)}=${quoted(option)}]`).join('');\n      return `:where(${root}${matched}) {\\n${lines.join('\\n')}\\n}`;\n    })\n    .join('\\n\\n');\n}\n\n/**\n * The attribute for each selector and the option it is set to: what to set\n * on the `root` element for the blocks of {@link prefsCss} to match the\n * store's own choice.\n */\nexport function prefsCssAttributes(store: Pick<PrefsCssSource, 'schema' | 'get'>, options: Pick<PrefsCssOptions, 'attribute'> = {}): Record<string, string> {\n  const attribute = options.attribute ?? ((selector: string): string => `data-${kebab(selector)}`);\n  const leaves = prefLeaves(store.schema);\n  return Object.fromEntries([...prefSelectors(leaves).keys()].map((path) => [attribute(path), store.get(path) as string]));\n}\n","// The leaves a surface's aliases show: the schema they point into, as that\n// schema's own conditions leave it. Every surface that draws an alias asks\n// here, whether the schema is its own or another's.\n\nimport { prefAliasedLeaf, prefAliasTarget, type PrefAlias } from './alias';\nimport type { PrefGroup, PrefSection } from './groups';\nimport { prefLeafAt, visiblePrefSubtree } from './helpers';\nimport type { PrefConditionJudge, PrefEntry } from './judge';\nimport type { PrefLeaf, PrefObject } from './schema';\nimport { applyPrefConditions, applyPrefEntryConditions, type PrefConditionsApplied, type PrefEntryApplied } from './scope';\n\n/** What an alias row reads of the leaf it shows: the schema that leaf is in, as that schema's own conditions leave it. */\nexport interface PrefAliasTargets {\n  /** Says which conditions of that schema hold. */\n  holds: PrefConditionJudge;\n  /** The leaf at a path of that schema, without the fields the surface would leave out of the leaf's own row: one\n   *  marked `hidden`, and one a `showIf` hides, unless the surface draws those. */\n  leafAt: (path: string) => PrefLeaf | undefined;\n  /** The leaf `alias` is drawn as, under the alias's own name and description where it gives them, and the path\n   *  its value is read and written at. `undefined` for an alias of nothing. */\n  shown: (alias: PrefAlias) => { path: string; leaf: PrefLeaf } | undefined;\n  /** Whether the field at a path of that schema is one an `enableIf` disables. */\n  disabledAt: (path: string) => boolean;\n  /** Whether the field at a path of that schema is one a `showIf` hides, on a surface that draws those. */\n  hiddenAt?: (path: string) => boolean;\n  /** An entry of a list or a map of that schema, as the conditions that read the entry leave it. */\n  entryAt: (item: PrefLeaf, path: string, value: unknown) => PrefEntryApplied;\n}\n\n/** What a surface draws beyond the default, which its alias rows follow. */\nexport interface PrefAliasTargetsOptions {\n  /** The surface draws fields marked `hidden`. */\n  showHidden?: boolean;\n  /** The surface draws what a `showIf` hides, marked. */\n  markHidden?: boolean;\n}\n\n/** `leaf` without its fields marked `hidden`. The leaf's own mark is not asked: an alias shows a leaf the surface leaves out. */\nfunction visibleFieldsOf(leaf: PrefLeaf): PrefLeaf {\n  if (leaf.kind !== 'object') return leaf;\n  const shown = visiblePrefSubtree({ ...leaf, hidden: false }, false, true) as PrefObject;\n  return { ...leaf, children: shown.children } as PrefLeaf;\n}\n\n/**\n * {@link PrefAliasTargets} over `over`, the schema a surface's aliases point\n * into: the surface's own, or another's. `judge` answers `over`'s conditions\n * as the surface reads values, for one entry of a list or a map where it is\n * given one: `prefJudge` over `over`. A surface's own pass drops a leaf it\n * leaves out and keeps no path of another schema, so the leaves aliases show\n * are conditioned here, the first time one is asked for.\n */\nexport function prefAliasTargets(\n  over: PrefGroup | PrefSection,\n  judge: (entry?: PrefEntry) => PrefConditionJudge,\n  { showHidden = false, markHidden = false }: PrefAliasTargetsOptions = {},\n): PrefAliasTargets {\n  const holds = judge();\n  let applied: PrefConditionsApplied<PrefGroup | PrefSection> | undefined;\n  const get = (): PrefConditionsApplied<PrefGroup | PrefSection> =>\n    (applied ??= applyPrefConditions(over, holds, { keepEmpty: true, keepHidden: markHidden }));\n  const leafAt = (path: string): PrefLeaf | undefined => {\n    const { shown } = get();\n    const leaf = shown === null ? undefined : prefLeafAt(shown, path);\n    return leaf === undefined || showHidden ? leaf : visibleFieldsOf(leaf);\n  };\n  return {\n    holds,\n    leafAt,\n    shown: (alias) => {\n      const target = prefAliasTarget(alias, leafAt);\n      return target && { path: target.path, leaf: prefAliasedLeaf(alias, target.leaf) };\n    },\n    disabledAt: (path) => get().disabled.has(path),\n    ...(markHidden ? { hiddenAt: (path: string) => get().hidden.has(path) } : {}),\n    entryAt: (item, path, value) => applyPrefEntryConditions(item, path, judge({ item, value }), { keepHidden: markHidden }),\n  };\n}\n","import type { PrefObject } from './schema';\n\nconst isObject = (v: unknown): v is Record<string, unknown> => typeof v === 'object' && v !== null;\n\n/**\n * The object a write to one field of an `object` leaf starts from: `held` itself where it is one. Where it is\n * not, the write has to make a whole object, so it starts from the scalar lifted by the leaf's `fromScalar`, else\n * from the leaf's `default`: one field on its own is a stroke with a width and no paint.\n */\nexport function prefObjectBase(pref: PrefObject, held: unknown): Record<string, unknown> {\n  if (isObject(held)) return held;\n  return pref.fromScalar?.(held) ?? (isObject(pref.default) ? pref.default : {});\n}\n\n/** The object an `object` leaf holds after one of its fields is set: {@link prefObjectBase} with `key` at\n *  `value`, or without the key for `undefined`. */\nexport function prefObjectWithField(pref: PrefObject, held: unknown, key: string, value: unknown): Record<string, unknown> {\n  const base = prefObjectBase(pref, held);\n  if (value !== undefined) return { ...base, [key]: value };\n  const { [key]: _dropped, ...rest } = base;\n  return rest;\n}\n","import type { PrefLeaf } from './schema';\n\n/**\n * `leaf` as a named type: the same leaf carrying `name` in its `type` field.\n * Declared once beside the code that reads its value and used wherever a\n * schema wants one, spread with what that place sets for itself\n * (`{ ...GradientStop, name: 'First stop' }`), or as a list's or a map's\n * `item`. `name` is the identifier the type is exported under, which a schema\n * editor prints in place of the leaf's literal.\n */\nexport function prefType<L extends PrefLeaf>(name: string, leaf: L): L & { type: string } {\n  return { ...leaf, type: name };\n}\n","// The two branch nodes of a schema. They differ in whether a key is part of\n// the path a leaf's value lives at, and each holds its members under its own\n// property, so a schema of one kind is neither assignable to nor walkable as\n// the other.\n\nimport type { PrefCondition } from './condition';\nimport type { PrefLeaf } from './schema';\n\n/**\n * How a {@link PrefGroup} is drawn: `page` gets an entry in a form's rail and\n * a pane of its own; `tab` shares a tab strip with the `tab` groups beside it;\n * `panel` is a bordered, titled box; `section` is a heading over its rows;\n * `fragment` draws nothing of its own, so its rows sit among its neighbors'\n * as though they were written there. A fragment exists to hold things\n * together: one key for their values to nest under, one node to move.\n */\nexport type PrefGroupAs = 'page' | 'tab' | 'panel' | 'section' | 'fragment' | 'bar';\n\n/**\n * What a group or a section drawn `as: 'bar'` does with cells its line has no\n * room for: `scroll` keeps them all on it, and `menu` opens the ones past its\n * end from a button there. A bar set to `menu` takes all the room its host\n * has along the line, which is why it is asked for and not the default.\n */\nexport type PrefBarOverflow = 'scroll' | 'menu';\n\n/** How a {@link PrefSection} is drawn. */\nexport type PrefSectionAs = Exclude<PrefGroupAs, 'page'>;\n\n/**\n * A group whose key is a path segment: `view` > `gridDensity` is the leaf at\n * `view.gridDensity`, and its value nests the same way. The shape of a\n * preferences schema — what `openPrefs` stores, `PrefsForm` renders, and a\n * tool declares its options as. A key holds no `.`.\n */\nexport interface PrefGroup {\n  /** Heading for the group's rows. **Empty means no heading** — for a group\n   *  that exists to organize, not to name: one whose children are themselves\n   *  groups carrying the labels a reader needs. Give it a name whenever the\n   *  name is the referent (a `Border` group over `Top` / `Right` / `Bottom`\n   *  reads as nothing without it). */\n  name: string;\n  description?: string;\n  /** How the group is drawn. Unset, its depth decides: a top-level group is a\n   *  `page`, and one inside another is a `section`. */\n  as?: PrefGroupAs;\n  /** Drawn `as: 'bar'`: what happens to the cells its line has no room for.\n   *  Unset: `scroll`. A surface that takes drops keeps every cell on the line\n   *  whatever this says, so each is there to drop beside. */\n  overflow?: PrefBarOverflow;\n  /** Drawn, with everything under it, only while this holds. */\n  showIf?: PrefCondition;\n  /** Everything under it is disabled while this does not hold. */\n  enableIf?: PrefCondition;\n  children: Record<string, PrefLeaf | PrefGroup>;\n}\n\n/**\n * A heading over leaves that adds nothing to their paths: each member is\n * addressed by its own key alone, and the section's key only identifies the\n * section. The shape of a node's property schema, where a leaf's key is the\n * whole dotted node path (`pose.x`, `data.fill`), and of the headings inside\n * a {@link PrefObject}, where a key is relative to the object.\n */\nexport interface PrefSection {\n  /** Heading for the section's rows. Empty means no heading, as for a\n   *  {@link PrefGroup}. */\n  name: string;\n  description?: string;\n  /** How the section is drawn, as a {@link PrefGroup}'s `as` — without\n   *  `page`, since nothing that draws sections has a rail. Unset: a heading\n   *  over its rows. */\n  as?: PrefSectionAs;\n  /** As a {@link PrefGroup}'s. */\n  overflow?: PrefBarOverflow;\n  /** As a {@link PrefGroup}'s. */\n  showIf?: PrefCondition;\n  /** As a {@link PrefGroup}'s. */\n  enableIf?: PrefCondition;\n  members: Record<string, PrefLeaf | PrefSection>;\n}\n\n/** Whether a top-level group gets a page of its own, and not a place on the page of the root's own leaves. */\nexport function prefGroupIsPage(group: PrefGroup): boolean {\n  return group.as === undefined || group.as === 'page';\n}\n","import type { PrefGroup, PrefSection } from './groups';\nimport { isPrefLeaf } from './helpers';\nimport { isBuiltinPref, type PrefLeaf } from './schema';\n\n/** Whether a leaf's control fits beside a heading's words: a built-in `boolean`'s or `enum`'s does. */\nexport function prefFitsHeading(leaf: PrefLeaf): boolean {\n  return (leaf.kind === 'boolean' || leaf.kind === 'enum') && isBuiltinPref(leaf);\n}\n\n/**\n * The key of the leaf a group or a section draws in its heading: the first\n * directly in it that is marked `heading` and whose control fits there.\n * Undefined for a node with no name, which has no heading to draw it in.\n */\nexport function prefHeadingKey(node: PrefGroup | PrefSection): string | undefined {\n  if (node.name === '') return undefined;\n  const held = 'members' in node ? node.members : node.children;\n  for (const [key, child] of Object.entries(held)) {\n    if (isPrefLeaf(child) && child.heading === true && prefFitsHeading(child)) return key;\n  }\n  return undefined;\n}\n","import { pairRowsOf, type PrefLeaf } from './schema';\n\n/** Neighboring items one row draws, in {@link pairRuns}' answer. */\nexport interface PairRun<T> {\n  items: T[];\n  /** The pairing the items share: the path of the leaf that declared it, and what the row reads. Absent on a\n   *  run of one, which is no pair. */\n  pair?: { key: string; label: string };\n}\n\n/**\n * `items` as the rows they draw, in order: each leaf a `pair` names joins the row of the leaf naming it where\n * the two are neighbors, and every other item is a run of its own. `leafOf` gives an item's leaf and the path a\n * `pair` would name it by, or nothing for an item that shares no row, which ends a run.\n */\nexport function pairRuns<T>(\n  items: readonly T[],\n  leafOf: (item: T) => readonly [path: string, leaf: PrefLeaf] | undefined,\n): PairRun<T>[] {\n  const leaves = items.map(leafOf);\n  const pairs = pairRowsOf(leaves.filter((entry) => entry !== undefined));\n  const keys = leaves.map((entry) => (entry === undefined ? undefined : pairs.get(entry[0])));\n  const runs: PairRun<T>[] = [];\n  for (let i = 0; i < items.length; ) {\n    const pair = keys[i];\n    let j = i + 1;\n    while (pair !== undefined && keys[j]?.key === pair.key) j += 1;\n    runs.push(j - i > 1 ? { items: items.slice(i, j), pair } : { items: [items[i]!] });\n    i = j;\n  }\n  return runs;\n}\n","import type { PrefKind } from './schema';\n\n/** What a surface has to know about a kind before it can lay its control out. */\nexport interface PrefKindTraits {\n  /** Its value is made of other leaves' values: too much for one control on a\n   *  line, so a bar opens it in a popover and a compact panel in a dialog. */\n  compound: boolean;\n  /** Its control is several controls, or a button. A row drawn as a `<label>`\n   *  would hand a click on its text to the first of them. */\n  several: boolean;\n}\n\nconst ONE: PrefKindTraits = { compound: false, several: false };\nconst MANY: PrefKindTraits = { compound: true, several: true };\n\n/**\n * The traits of every built-in kind. A `Record` over {@link PrefKind}, so a\n * kind added to the union does not compile until it says what it is here:\n * a plain set of kind names lets a new one through to draw inline in a\n * `<label>`, on a bar's line, and with no dialog row.\n */\nexport const PREF_KIND_TRAITS: Record<PrefKind, PrefKindTraits> = {\n  number: ONE,\n  boolean: ONE,\n  string: ONE,\n  enum: ONE,\n  color: ONE,\n  paint: ONE,\n  object: MANY,\n  list: MANY,\n  map: MANY,\n  union: MANY,\n  field: ONE,\n  action: { compound: false, several: true },\n  alias: ONE,\n  label: ONE,\n  separator: ONE,\n};\n\nconst traitsOf = (leaf: { kind: string }): PrefKindTraits =>\n  (Object.hasOwn(PREF_KIND_TRAITS, leaf.kind) ? PREF_KIND_TRAITS[leaf.kind as PrefKind] : ONE);\n\n/** Whether a leaf's value is made of other leaves' values. An app-defined kind is not: its renderer is one control. */\nexport function prefIsCompound(leaf: { kind: string }): boolean {\n  return traitsOf(leaf).compound;\n}\n\n/** Whether a leaf's control is several controls or a button. */\nexport function prefDrawsSeveral(leaf: { kind: string }): boolean {\n  return traitsOf(leaf).several;\n}\n"]}