@estiva-app/ui 0.21.1 → 0.23.0

package/dist/registry/chunk-W2B2G7OE.js

@@ -0,0 +1,188 @@
+#!/usr/bin/env node
+
+// src/registry/find.ts
+var STOP = /* @__PURE__ */ new Set([
+  "a",
+  "an",
+  "and",
+  "are",
+  "as",
+  "at",
+  "be",
+  "but",
+  "by",
+  "can",
+  "do",
+  "for",
+  "from",
+  "how",
+  "i",
+  "if",
+  "in",
+  "is",
+  "it",
+  "its",
+  "me",
+  "my",
+  "no",
+  "not",
+  "of",
+  "on",
+  "or",
+  "our",
+  "so",
+  "that",
+  "the",
+  "their",
+  "them",
+  "then",
+  "there",
+  "they",
+  "this",
+  "to",
+  "up",
+  "was",
+  "we",
+  "what",
+  "when",
+  "which",
+  "with",
+  "you",
+  "your"
+]);
+function words(text) {
+  const found = [];
+  for (const token of text.match(/[A-Za-z0-9]+/g) ?? []) {
+    found.push(token.toLowerCase());
+    const parts = token.split(/(?<=[a-z0-9])(?=[A-Z])|(?<=[A-Z])(?=[A-Z][a-z])/);
+    if (parts.length > 1) found.push(...parts.map((part) => part.toLowerCase()));
+  }
+  return found;
+}
+function alike(query, text) {
+  if (query === text) return true;
+  if (Math.min(query.length, text.length) < 3) return false;
+  if (text.startsWith(query) || query.startsWith(text)) return true;
+  return query.slice(0, 5) === text.slice(0, 5);
+}
+var hit = (query, text) => words(text).some((word) => alike(query, word));
+function findInRegistry(registry, query, { limit = 5 } = {}) {
+  return findInRegistries([registry], query, { limit });
+}
+function findInRegistries(registries, query, { limit = 5 } = {}) {
+  const all = words(query);
+  const carrying = all.filter((word) => word.length >= 3 && !STOP.has(word));
+  const asked = carrying.length ? carrying : all;
+  if (asked.length === 0) return [];
+  const findings = [];
+  const entries = registries.flatMap((registry) => registry.entries).filter((entry) => entry.app?.class !== "re-export");
+  for (const entry of entries) {
+    let score = 0;
+    let matched = 0;
+    const where = /* @__PURE__ */ new Set();
+    const byName = /* @__PURE__ */ new Set();
+    const byNote = /* @__PURE__ */ new Set();
+    for (const word of asked) {
+      let best = 0;
+      if (entry.name.toLowerCase() === word) {
+        best = 100;
+        where.add("name");
+      } else if (hit(word, entry.name)) {
+        best = 40;
+        where.add("name");
+      }
+      if (hit(word, entry.purpose)) {
+        best = Math.max(best, 20);
+        where.add("purpose");
+      }
+      for (const owned of entry.ownsBehaviours) {
+        if (hit(word, owned.behaviour) || hit(word, owned.id)) {
+          best = Math.max(best, 15);
+          where.add("behaviour");
+        }
+      }
+      for (const variant of entry.variants) {
+        if (variant.values.some((value) => hit(word, value)) || hit(word, variant.prop)) {
+          best = Math.max(best, 8);
+          where.add("variant");
+          byName.add(variant.prop);
+        }
+      }
+      for (const prop of entry.props) {
+        if (hit(word, prop.name)) {
+          best = Math.max(best, 14);
+          where.add("prop");
+          byName.add(prop.name);
+        } else if (prop.note !== null && hit(word, prop.note)) {
+          best = Math.max(best, 10);
+          where.add("prop");
+          byNote.add(prop.name);
+        }
+      }
+      if (best > 0) matched += 1;
+      score += best;
+    }
+    if (matched > 0) findings.push({ entry, matched, score, where: [...where], props: [...byName] });
+  }
+  const fromPackage = (finding) => finding.entry.app === null ? 0 : 1;
+  findings.sort((a, b) => b.matched - a.matched || b.score - a.score || fromPackage(a) - fromPackage(b) || a.entry.name.localeCompare(b.entry.name));
+  return findings.slice(0, limit);
+}
+function docsLink(registry, entry) {
+  if (!entry.docsId) return null;
+  return registry.storybook.devUrl + registry.storybook.docsPath.replace("{docsId}", entry.docsId);
+}
+var CLASS_WORDS = {
+  "one-off": "used in one place",
+  reusable: "used in several places",
+  "promote-candidate": "used in several places; could move into the package",
+  unused: "used nowhere in the app"
+};
+function formatFindings(searched, findings, query) {
+  const registries = Array.isArray(searched) ? searched : [searched];
+  if (findings.length === 0) {
+    return [
+      `Nothing in ${registries.map((registry) => registry.builtFrom.repo).join(", ")} matches "${query}".`,
+      "If nothing here does what you need, say so and ask \u2014 do not invent a component."
+    ].join("\n");
+  }
+  const registryOf = (entry) => registries.find((registry) => registry.builtFrom.repo === entry.repo) ?? registries[0];
+  const handedOn = /* @__PURE__ */ new Map();
+  for (const registry of registries) {
+    for (const entry of registry.entries) {
+      if (entry.app?.class !== "re-export" || entry.app.handsOn === null) continue;
+      handedOn.set(entry.app.handsOn, [...handedOn.get(entry.app.handsOn) ?? [], `${entry.repo} hands it on${entry.name === entry.app.handsOn ? "" : ` as ${entry.name}`} from ${entry.importPath}`]);
+    }
+  }
+  const blocks = findings.map((finding) => {
+    const { entry } = finding;
+    const facts = entry.app;
+    const lines = [
+      `${entry.name}  \xB7  ${facts ? CLASS_WORDS[facts.class] ?? facts.class : entry.kind}  \xB7  ${entry.repo}  (matched ${finding.where.join(", ")})`,
+      `  ${entry.purpose}`,
+      facts?.defaultExport ? `  import ${entry.name} from '${entry.importPath}'` : `  import { ${entry.name} } from '${entry.importPath}'`
+    ];
+    if (!facts) for (const said of handedOn.get(entry.name) ?? []) lines.push(`  ${said}`);
+    if (facts?.packageNamesake) lines.push(`  the package has a ${facts.packageNamesake} too: check it first`);
+    if (facts && facts.usedIn.length) lines.push(`  used in ${facts.usedIn.slice(0, 2).join(", ")}${facts.usedIn.length > 2 ? ` and ${facts.usedIn.length - 2} more` : ""}`);
+    if (entry.ownsBehaviours.length) lines.push(`  owns: ${entry.ownsBehaviours.map((owned) => owned.behaviour).join(" \xB7 ")}`);
+    if (entry.variants.length) lines.push(`  ${entry.variants.map((variant) => `${variant.prop}: ${variant.values.join(" | ")}`).join("   ")}`);
+    const shown = finding.props.filter((name) => !entry.variants.some((variant) => variant.prop === name)).slice(0, 3).map((name) => entry.props.find((prop) => prop.name === name));
+    for (const prop of shown) {
+      if (prop) lines.push(`  ${prop.name}: ${prop.takes}${prop.note ? ` \u2014 ${prop.note}` : ""}`);
+    }
+    if (entry.props.length) lines.push(`  ${entry.props.length} props in all; see ${entry.docsId ? "the page" : entry.sourceFile} for the rest`);
+    const link = docsLink(registryOf(entry), entry);
+    if (link) lines.push(`  ${link}`);
+    return lines.join("\n");
+  });
+  return blocks.join("\n\n");
+}
+
+export {
+  findInRegistry,
+  findInRegistries,
+  docsLink,
+  formatFindings
+};
+//# sourceMappingURL=chunk-W2B2G7OE.js.map

package/dist/registry/chunk-W2B2G7OE.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../src/registry/find.ts"],
+  "sourcesContent": ["/**\n * The catalogue's reader (UIG-12): `ui:find <words>`.\n *\n * It exists to prove the format. A schema nobody consumes is a schema nobody\n * has tested, and the questions it has to answer are regression tests, not the\n * scope: \"floating panel\" must find `Popover`, \"scrolling\" `ScrollArea`,\n * \"empty\" `EmptyState`.\n *\n * It is also the answer to \"what do we have for this?\", which is the question\n * the wall cannot answer: a lint rule refuses the wrong thing, and this is\n * where the right one is named (UIG-20 makes a session ask it first).\n */\nimport type { Registry, RegistryEntry } from './schema'\n\nexport interface Finding {\n  entry: RegistryEntry\n  /** How many of the query's words matched anywhere. Ranked on this first. */\n  matched: number\n  score: number\n  /** Which fields matched, for the reader to say why. */\n  where: string[]\n  /**\n   * The props the query named **by name**, so the answer shows those rather\n   * than all of them. A prop whose note merely carries one of the words counts\n   * towards the score and is not shown: on \"floating panel\", six of `Popover`'s\n   * notes say \"panel\", and printing all six buries the answer.\n   */\n  props: string[]\n}\n\n/**\n * Words that are in nearly every sentence, and so tell a search nothing.\n *\n * Measured: `ui:find \"truncate a long link\"` printed `Link`'s `external` prop,\n * because its note says \"in **a** new tab\" and the one-letter word matched\n * itself exactly. The minimum length in `alike` only guards a *prefix* match;\n * an exact match short-circuits it, which is right for `tab` and useless for `a`.\n */\nconst STOP = new Set([\n  'a', 'an', 'and', 'are', 'as', 'at', 'be', 'but', 'by', 'can', 'do', 'for', 'from', 'how', 'i', 'if', 'in', 'is', 'it', 'its', 'me', 'my', 'no', 'not', 'of',\n  'on', 'or', 'our', 'so', 'that', 'the', 'their', 'them', 'then', 'there', 'they', 'this', 'to', 'up', 'was', 'we', 'what', 'when', 'which', 'with', 'you', 'your',\n])\n\n/**\n * The words of a piece of text, with names taken apart.\n *\n * `CommandPalette` is kept whole *and* split, so \"palette\" reaches it and\n * \"commandpalette\" still does. Prose is already words; this costs it nothing.\n */\nfunction words(text: string): string[] {\n  const found: string[] = []\n  for (const token of text.match(/[A-Za-z0-9]+/g) ?? []) {\n    found.push(token.toLowerCase())\n    const parts = token.split(/(?<=[a-z0-9])(?=[A-Z])|(?<=[A-Z])(?=[A-Z][a-z])/)\n    if (parts.length > 1) found.push(...parts.map((part) => part.toLowerCase()))\n  }\n  return found\n}\n\n/**\n * Whether a word of the query means a word of the text.\n *\n * Either being a prefix of the other covers \"scroll\" against \"scrolling\"; the\n * five-letter key covers \"scrolls\" against \"scrolling\", where neither is. Crude\n * on purpose \u2014 a stemmer is a dependency and a surprise, and the failure here\n * is an extra row in a list of five, not a wrong answer.\n *\n * **Three letters at least**, or a prefix match is no match at all: `person's`\n * puts the word \"s\" in the text, and every query on earth starts with some\n * letter. Measured \u2014 before this, \"scrolling\" found `Avatar`.\n */\nfunction alike(query: string, text: string): boolean {\n  if (query === text) return true\n  if (Math.min(query.length, text.length) < 3) return false\n  if (text.startsWith(query) || query.startsWith(text)) return true\n  return query.slice(0, 5) === text.slice(0, 5)\n}\n\nconst hit = (query: string, text: string) => words(text).some((word) => alike(query, word))\n\n/**\n * Search name, purpose, behaviours and variants.\n *\n * A row that answers more of the question comes first, whatever it scored:\n * \"floating panel\" has to reach `Popover`, whose purpose carries both words,\n * over `MenuPanel`, whose name carries one of them loudly.\n */\nexport function findInRegistry(registry: Registry, query: string, { limit = 5 }: { limit?: number } = {}): Finding[] {\n  return findInRegistries([registry], query, { limit })\n}\n\n/**\n * Search several catalogues as one: the package's, the app's own, and any app\n * beside it (UIG-13).\n *\n * An app's pass-on is not a result of its own \u2014 it is the package's part, and\n * the package's entry answers for it, saying which apps hand it on. At the\n * same strength the package's part comes first: it is the one to reach for.\n */\nexport function findInRegistries(registries: Registry[], query: string, { limit = 5 }: { limit?: number } = {}): Finding[] {\n  const all = words(query)\n  // Drop the words that mean nothing. If the question was only those, keep them\n  // rather than answer nothing at all.\n  const carrying = all.filter((word) => word.length >= 3 && !STOP.has(word))\n  const asked = carrying.length ? carrying : all\n  if (asked.length === 0) return []\n\n  const findings: Finding[] = []\n  const entries = registries.flatMap((registry) => registry.entries).filter((entry) => entry.app?.class !== 're-export')\n  for (const entry of entries) {\n    let score = 0\n    let matched = 0\n    const where = new Set<string>()\n    const byName = new Set<string>()\n    const byNote = new Set<string>()\n    for (const word of asked) {\n      let best = 0\n      if (entry.name.toLowerCase() === word) {\n        best = 100\n        where.add('name')\n      } else if (hit(word, entry.name)) {\n        best = 40\n        where.add('name')\n      }\n      if (hit(word, entry.purpose)) {\n        best = Math.max(best, 20)\n        where.add('purpose')\n      }\n      for (const owned of entry.ownsBehaviours) {\n        if (hit(word, owned.behaviour) || hit(word, owned.id)) {\n          best = Math.max(best, 15)\n          where.add('behaviour')\n        }\n      }\n      for (const variant of entry.variants) {\n        if (variant.values.some((value) => hit(word, value)) || hit(word, variant.prop)) {\n          best = Math.max(best, 8)\n          where.add('variant')\n          byName.add(variant.prop)\n        }\n      }\n      // What it can do. \"does Link already truncate?\" is the question this\n      // answers, and answering it is what stops the thing being built twice.\n      for (const prop of entry.props) {\n        // A prop the question named by name is the answer; one whose note\n        // happens to carry the word is a hint. Named ones go first, so a short\n        // answer shows the right lines.\n        if (hit(word, prop.name)) {\n          best = Math.max(best, 14)\n          where.add('prop')\n          byName.add(prop.name)\n        } else if (prop.note !== null && hit(word, prop.note)) {\n          best = Math.max(best, 10)\n          where.add('prop')\n          byNote.add(prop.name)\n        }\n      }\n      if (best > 0) matched += 1\n      score += best\n    }\n    if (matched > 0) findings.push({ entry, matched, score, where: [...where], props: [...byName] })\n  }\n\n  const fromPackage = (finding: Finding) => (finding.entry.app === null ? 0 : 1)\n  findings.sort((a, b) => b.matched - a.matched || b.score - a.score || fromPackage(a) - fromPackage(b) || a.entry.name.localeCompare(b.entry.name))\n  return findings.slice(0, limit)\n}\n\n/** `http://localhost:6008/?path=/docs/overlays-popover--docs`, or `null` where the entry has no page. */\nexport function docsLink(registry: Registry, entry: RegistryEntry): string | null {\n  if (!entry.docsId) return null\n  return registry.storybook.devUrl + registry.storybook.docsPath.replace('{docsId}', entry.docsId)\n}\n\n/** What an app's part is, in the words the search prints. */\nconst CLASS_WORDS: Record<string, string> = {\n  'one-off': 'used in one place',\n  reusable: 'used in several places',\n  'promote-candidate': 'used in several places; could move into the package',\n  unused: 'used nowhere in the app',\n}\n\n/** What the command prints: the import line first, because that is what the reader came for. */\nexport function formatFindings(searched: Registry | Registry[], findings: Finding[], query: string): string {\n  const registries = Array.isArray(searched) ? searched : [searched]\n  if (findings.length === 0) {\n    return [\n      `Nothing in ${registries.map((registry) => registry.builtFrom.repo).join(', ')} matches \"${query}\".`,\n      'If nothing here does what you need, say so and ask \u2014 do not invent a component.',\n    ].join('\\n')\n  }\n  const registryOf = (entry: RegistryEntry) => registries.find((registry) => registry.builtFrom.repo === entry.repo) ?? registries[0]\n  // Which apps hand a package part on, and from where: in Peek, `Button` is\n  // imported from `@/components/ui/Button`, and the answer should say so.\n  const handedOn = new Map<string, string[]>()\n  for (const registry of registries) {\n    for (const entry of registry.entries) {\n      if (entry.app?.class !== 're-export' || entry.app.handsOn === null) continue\n      handedOn.set(entry.app.handsOn, [...(handedOn.get(entry.app.handsOn) ?? []), `${entry.repo} hands it on${entry.name === entry.app.handsOn ? '' : ` as ${entry.name}`} from ${entry.importPath}`])\n    }\n  }\n\n  const blocks = findings.map((finding) => {\n    const { entry } = finding\n    const facts = entry.app\n    const lines = [\n      `${entry.name}  \u00B7  ${facts ? CLASS_WORDS[facts.class] ?? facts.class : entry.kind}  \u00B7  ${entry.repo}  (matched ${finding.where.join(', ')})`,\n      `  ${entry.purpose}`,\n      facts?.defaultExport ? `  import ${entry.name} from '${entry.importPath}'` : `  import { ${entry.name} } from '${entry.importPath}'`,\n    ]\n    if (!facts) for (const said of handedOn.get(entry.name) ?? []) lines.push(`  ${said}`)\n    if (facts?.packageNamesake) lines.push(`  the package has a ${facts.packageNamesake} too: check it first`)\n    if (facts && facts.usedIn.length) lines.push(`  used in ${facts.usedIn.slice(0, 2).join(', ')}${facts.usedIn.length > 2 ? ` and ${facts.usedIn.length - 2} more` : ''}`)\n    if (entry.ownsBehaviours.length) lines.push(`  owns: ${entry.ownsBehaviours.map((owned) => owned.behaviour).join(' \u00B7 ')}`)\n    if (entry.variants.length) lines.push(`  ${entry.variants.map((variant) => `${variant.prop}: ${variant.values.join(' | ')}`).join('   ')}`)\n    // The props the question named, with their own line \u2014 not all of them. A\n    // component with twenty props would bury its own answer.\n    const shown = finding.props\n      .filter((name) => !entry.variants.some((variant) => variant.prop === name))\n      .slice(0, 3)\n      .map((name) => entry.props.find((prop) => prop.name === name))\n    for (const prop of shown) {\n      if (prop) lines.push(`  ${prop.name}: ${prop.takes}${prop.note ? ` \u2014 ${prop.note}` : ''}`)\n    }\n    if (entry.props.length) lines.push(`  ${entry.props.length} props in all; see ${entry.docsId ? 'the page' : entry.sourceFile} for the rest`)\n    const link = docsLink(registryOf(entry), entry)\n    if (link) lines.push(`  ${link}`)\n    return lines.join('\\n')\n  })\n\n  return blocks.join('\\n\\n')\n}\n"],
+  "mappings": ";;;AAsCA,IAAM,OAAO,oBAAI,IAAI;AAAA,EACnB;AAAA,EAAK;AAAA,EAAM;AAAA,EAAO;AAAA,EAAO;AAAA,EAAM;AAAA,EAAM;AAAA,EAAM;AAAA,EAAO;AAAA,EAAM;AAAA,EAAO;AAAA,EAAM;AAAA,EAAO;AAAA,EAAQ;AAAA,EAAO;AAAA,EAAK;AAAA,EAAM;AAAA,EAAM;AAAA,EAAM;AAAA,EAAM;AAAA,EAAO;AAAA,EAAM;AAAA,EAAM;AAAA,EAAM;AAAA,EAAO;AAAA,EACxJ;AAAA,EAAM;AAAA,EAAM;AAAA,EAAO;AAAA,EAAM;AAAA,EAAQ;AAAA,EAAO;AAAA,EAAS;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAM;AAAA,EAAM;AAAA,EAAO;AAAA,EAAM;AAAA,EAAQ;AAAA,EAAQ;AAAA,EAAS;AAAA,EAAQ;AAAA,EAAO;AAC7J,CAAC;AAQD,SAAS,MAAM,MAAwB;AACrC,QAAM,QAAkB,CAAC;AACzB,aAAW,SAAS,KAAK,MAAM,eAAe,KAAK,CAAC,GAAG;AACrD,UAAM,KAAK,MAAM,YAAY,CAAC;AAC9B,UAAM,QAAQ,MAAM,MAAM,iDAAiD;AAC3E,QAAI,MAAM,SAAS,EAAG,OAAM,KAAK,GAAG,MAAM,IAAI,CAAC,SAAS,KAAK,YAAY,CAAC,CAAC;AAAA,EAC7E;AACA,SAAO;AACT;AAcA,SAAS,MAAM,OAAe,MAAuB;AACnD,MAAI,UAAU,KAAM,QAAO;AAC3B,MAAI,KAAK,IAAI,MAAM,QAAQ,KAAK,MAAM,IAAI,EAAG,QAAO;AACpD,MAAI,KAAK,WAAW,KAAK,KAAK,MAAM,WAAW,IAAI,EAAG,QAAO;AAC7D,SAAO,MAAM,MAAM,GAAG,CAAC,MAAM,KAAK,MAAM,GAAG,CAAC;AAC9C;AAEA,IAAM,MAAM,CAAC,OAAe,SAAiB,MAAM,IAAI,EAAE,KAAK,CAAC,SAAS,MAAM,OAAO,IAAI,CAAC;AASnF,SAAS,eAAe,UAAoB,OAAe,EAAE,QAAQ,EAAE,IAAwB,CAAC,GAAc;AACnH,SAAO,iBAAiB,CAAC,QAAQ,GAAG,OAAO,EAAE,MAAM,CAAC;AACtD;AAUO,SAAS,iBAAiB,YAAwB,OAAe,EAAE,QAAQ,EAAE,IAAwB,CAAC,GAAc;AACzH,QAAM,MAAM,MAAM,KAAK;AAGvB,QAAM,WAAW,IAAI,OAAO,CAAC,SAAS,KAAK,UAAU,KAAK,CAAC,KAAK,IAAI,IAAI,CAAC;AACzE,QAAM,QAAQ,SAAS,SAAS,WAAW;AAC3C,MAAI,MAAM,WAAW,EAAG,QAAO,CAAC;AAEhC,QAAM,WAAsB,CAAC;AAC7B,QAAM,UAAU,WAAW,QAAQ,CAAC,aAAa,SAAS,OAAO,EAAE,OAAO,CAAC,UAAU,MAAM,KAAK,UAAU,WAAW;AACrH,aAAW,SAAS,SAAS;AAC3B,QAAI,QAAQ;AACZ,QAAI,UAAU;AACd,UAAM,QAAQ,oBAAI,IAAY;AAC9B,UAAM,SAAS,oBAAI,IAAY;AAC/B,UAAM,SAAS,oBAAI,IAAY;AAC/B,eAAW,QAAQ,OAAO;AACxB,UAAI,OAAO;AACX,UAAI,MAAM,KAAK,YAAY,MAAM,MAAM;AACrC,eAAO;AACP,cAAM,IAAI,MAAM;AAAA,MAClB,WAAW,IAAI,MAAM,MAAM,IAAI,GAAG;AAChC,eAAO;AACP,cAAM,IAAI,MAAM;AAAA,MAClB;AACA,UAAI,IAAI,MAAM,MAAM,OAAO,GAAG;AAC5B,eAAO,KAAK,IAAI,MAAM,EAAE;AACxB,cAAM,IAAI,SAAS;AAAA,MACrB;AACA,iBAAW,SAAS,MAAM,gBAAgB;AACxC,YAAI,IAAI,MAAM,MAAM,SAAS,KAAK,IAAI,MAAM,MAAM,EAAE,GAAG;AACrD,iBAAO,KAAK,IAAI,MAAM,EAAE;AACxB,gBAAM,IAAI,WAAW;AAAA,QACvB;AAAA,MACF;AACA,iBAAW,WAAW,MAAM,UAAU;AACpC,YAAI,QAAQ,OAAO,KAAK,CAAC,UAAU,IAAI,MAAM,KAAK,CAAC,KAAK,IAAI,MAAM,QAAQ,IAAI,GAAG;AAC/E,iBAAO,KAAK,IAAI,MAAM,CAAC;AACvB,gBAAM,IAAI,SAAS;AACnB,iBAAO,IAAI,QAAQ,IAAI;AAAA,QACzB;AAAA,MACF;AAGA,iBAAW,QAAQ,MAAM,OAAO;AAI9B,YAAI,IAAI,MAAM,KAAK,IAAI,GAAG;AACxB,iBAAO,KAAK,IAAI,MAAM,EAAE;AACxB,gBAAM,IAAI,MAAM;AAChB,iBAAO,IAAI,KAAK,IAAI;AAAA,QACtB,WAAW,KAAK,SAAS,QAAQ,IAAI,MAAM,KAAK,IAAI,GAAG;AACrD,iBAAO,KAAK,IAAI,MAAM,EAAE;AACxB,gBAAM,IAAI,MAAM;AAChB,iBAAO,IAAI,KAAK,IAAI;AAAA,QACtB;AAAA,MACF;AACA,UAAI,OAAO,EAAG,YAAW;AACzB,eAAS;AAAA,IACX;AACA,QAAI,UAAU,EAAG,UAAS,KAAK,EAAE,OAAO,SAAS,OAAO,OAAO,CAAC,GAAG,KAAK,GAAG,OAAO,CAAC,GAAG,MAAM,EAAE,CAAC;AAAA,EACjG;AAEA,QAAM,cAAc,CAAC,YAAsB,QAAQ,MAAM,QAAQ,OAAO,IAAI;AAC5E,WAAS,KAAK,CAAC,GAAG,MAAM,EAAE,UAAU,EAAE,WAAW,EAAE,QAAQ,EAAE,SAAS,YAAY,CAAC,IAAI,YAAY,CAAC,KAAK,EAAE,MAAM,KAAK,cAAc,EAAE,MAAM,IAAI,CAAC;AACjJ,SAAO,SAAS,MAAM,GAAG,KAAK;AAChC;AAGO,SAAS,SAAS,UAAoB,OAAqC;AAChF,MAAI,CAAC,MAAM,OAAQ,QAAO;AAC1B,SAAO,SAAS,UAAU,SAAS,SAAS,UAAU,SAAS,QAAQ,YAAY,MAAM,MAAM;AACjG;AAGA,IAAM,cAAsC;AAAA,EAC1C,WAAW;AAAA,EACX,UAAU;AAAA,EACV,qBAAqB;AAAA,EACrB,QAAQ;AACV;AAGO,SAAS,eAAe,UAAiC,UAAqB,OAAuB;AAC1G,QAAM,aAAa,MAAM,QAAQ,QAAQ,IAAI,WAAW,CAAC,QAAQ;AACjE,MAAI,SAAS,WAAW,GAAG;AACzB,WAAO;AAAA,MACL,cAAc,WAAW,IAAI,CAAC,aAAa,SAAS,UAAU,IAAI,EAAE,KAAK,IAAI,CAAC,aAAa,KAAK;AAAA,MAChG;AAAA,IACF,EAAE,KAAK,IAAI;AAAA,EACb;AACA,QAAM,aAAa,CAAC,UAAyB,WAAW,KAAK,CAAC,aAAa,SAAS,UAAU,SAAS,MAAM,IAAI,KAAK,WAAW,CAAC;AAGlI,QAAM,WAAW,oBAAI,IAAsB;AAC3C,aAAW,YAAY,YAAY;AACjC,eAAW,SAAS,SAAS,SAAS;AACpC,UAAI,MAAM,KAAK,UAAU,eAAe,MAAM,IAAI,YAAY,KAAM;AACpE,eAAS,IAAI,MAAM,IAAI,SAAS,CAAC,GAAI,SAAS,IAAI,MAAM,IAAI,OAAO,KAAK,CAAC,GAAI,GAAG,MAAM,IAAI,eAAe,MAAM,SAAS,MAAM,IAAI,UAAU,KAAK,OAAO,MAAM,IAAI,EAAE,SAAS,MAAM,UAAU,EAAE,CAAC;AAAA,IAClM;AAAA,EACF;AAEA,QAAM,SAAS,SAAS,IAAI,CAAC,YAAY;AACvC,UAAM,EAAE,MAAM,IAAI;AAClB,UAAM,QAAQ,MAAM;AACpB,UAAM,QAAQ;AAAA,MACZ,GAAG,MAAM,IAAI,WAAQ,QAAQ,YAAY,MAAM,KAAK,KAAK,MAAM,QAAQ,MAAM,IAAI,WAAQ,MAAM,IAAI,cAAc,QAAQ,MAAM,KAAK,IAAI,CAAC;AAAA,MACzI,KAAK,MAAM,OAAO;AAAA,MAClB,OAAO,gBAAgB,YAAY,MAAM,IAAI,UAAU,MAAM,UAAU,MAAM,cAAc,MAAM,IAAI,YAAY,MAAM,UAAU;AAAA,IACnI;AACA,QAAI,CAAC,MAAO,YAAW,QAAQ,SAAS,IAAI,MAAM,IAAI,KAAK,CAAC,EAAG,OAAM,KAAK,KAAK,IAAI,EAAE;AACrF,QAAI,OAAO,gBAAiB,OAAM,KAAK,uBAAuB,MAAM,eAAe,sBAAsB;AACzG,QAAI,SAAS,MAAM,OAAO,OAAQ,OAAM,KAAK,aAAa,MAAM,OAAO,MAAM,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,GAAG,MAAM,OAAO,SAAS,IAAI,QAAQ,MAAM,OAAO,SAAS,CAAC,UAAU,EAAE,EAAE;AACvK,QAAI,MAAM,eAAe,OAAQ,OAAM,KAAK,WAAW,MAAM,eAAe,IAAI,CAAC,UAAU,MAAM,SAAS,EAAE,KAAK,QAAK,CAAC,EAAE;AACzH,QAAI,MAAM,SAAS,OAAQ,OAAM,KAAK,KAAK,MAAM,SAAS,IAAI,CAAC,YAAY,GAAG,QAAQ,IAAI,KAAK,QAAQ,OAAO,KAAK,KAAK,CAAC,EAAE,EAAE,KAAK,KAAK,CAAC,EAAE;AAG1I,UAAM,QAAQ,QAAQ,MACnB,OAAO,CAAC,SAAS,CAAC,MAAM,SAAS,KAAK,CAAC,YAAY,QAAQ,SAAS,IAAI,CAAC,EACzE,MAAM,GAAG,CAAC,EACV,IAAI,CAAC,SAAS,MAAM,MAAM,KAAK,CAAC,SAAS,KAAK,SAAS,IAAI,CAAC;AAC/D,eAAW,QAAQ,OAAO;AACxB,UAAI,KAAM,OAAM,KAAK,KAAK,KAAK,IAAI,KAAK,KAAK,KAAK,GAAG,KAAK,OAAO,WAAM,KAAK,IAAI,KAAK,EAAE,EAAE;AAAA,IAC3F;AACA,QAAI,MAAM,MAAM,OAAQ,OAAM,KAAK,KAAK,MAAM,MAAM,MAAM,sBAAsB,MAAM,SAAS,aAAa,MAAM,UAAU,eAAe;AAC3I,UAAM,OAAO,SAAS,WAAW,KAAK,GAAG,KAAK;AAC9C,QAAI,KAAM,OAAM,KAAK,KAAK,IAAI,EAAE;AAChC,WAAO,MAAM,KAAK,IAAI;AAAA,EACxB,CAAC;AAED,SAAO,OAAO,KAAK,MAAM;AAC3B;",
+  "names": []
+}