@aglyn/aglyn 1.0.0-beta.143

package/src/lib/app-utils/lineal-order.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../../../../libs/aglyn/src/lib/app-utils/lineal-order.ts"],"sourcesContent":["/**\n * @license\n * Copyright 2026 Aglyn LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { LinealDirectiveFlag } from '../foundation/definitions/components.types'\nimport type {\n  ComponentId,\n  ComponentsLinealOrder,\n  PluginId,\n} from '../foundation/definitions/components.types'\n\n/** A directive as a schema declares it, or as the generated palette carries it. */\n/**\n * A lineal order as a JSON emitter writes it (AGL-2905): the directive as\n * the enum's string value rather than the enum, so a generated catalog can\n * carry it and a validator can read it back without the enum in scope.\n */\nexport type JsonLinealOrder = [\n  directiveType: `${LinealDirectiveFlag}`,\n  directiveDefinition: string[] | { plugins?: string[]; components?: string[] },\n]\n\nexport type LinealOrderLike = ComponentsLinealOrder | JsonLinealOrder\n\n/**\n * Which half of a lineal directive a candidate fails, or `null` when the\n * directive admits it.\n *\n * `restrictChildren` and `restrictParent` are one grammar — a `limitedTo` or\n * `forbid` flag over a component list, a plugin list, or both — read from two\n * sides: the besigner's drop check asks it about a dragged element, and the\n * AI node-tree validator asks it about a node a model emitted. The answer has\n * to be the same answer, so the rule lives here with no editor attached and\n * both callers read it (AGL-2905).\n *\n * A `limitedTo` list that is present but empty admits nothing — that is how a\n * component declares it takes no children at all (`layoutSlot`), and the\n * child-contract audit reads the same shape the same way.\n */\nexport function checkLinealOrder(\n  componentId: ComponentId | undefined,\n  pluginId: PluginId | undefined,\n  order: LinealOrderLike,\n): 'component' | 'plugin' | null {\n  const [directiveType, directiveDefinition] = order\n  const flag: string = directiveType\n  const components = Array.isArray(directiveDefinition)\n    ? directiveDefinition\n    : directiveDefinition?.components\n  const plugins = Array.isArray(directiveDefinition)\n    ? undefined\n    : directiveDefinition?.plugins\n\n  if (flag === LinealDirectiveFlag.DISALLOW) {\n    if (components?.some((id) => id === componentId)) return 'component'\n    if (plugins?.some((id) => id === pluginId)) return 'plugin'\n    return null\n  }\n\n  if (flag === LinealDirectiveFlag.LIMIT_TO) {\n    if (\n      Array.isArray(components) &&\n      (components.length === 0 || !components.some((id) => id === componentId))\n    ) {\n      return 'component'\n    }\n    if (\n      Array.isArray(plugins) &&\n      (plugins.length === 0 || !plugins.some((id) => id === pluginId))\n    ) {\n      return 'plugin'\n    }\n  }\n\n  return null\n}\n\n/**\n * Whether `child` may sit directly under `parent`, reading the child's\n * `restrictParent` and the parent's `restrictChildren` — the two directives\n * the besigner's drop check consults, in that order.\n */\nexport function linealRelationshipPermits(\n  child: {\n    componentId?: ComponentId\n    pluginId?: PluginId\n    restrictParent?: LinealOrderLike\n  },\n  parent: {\n    componentId?: ComponentId\n    pluginId?: PluginId\n    restrictChildren?: LinealOrderLike\n  },\n): boolean {\n  if (\n    child.restrictParent &&\n    checkLinealOrder(parent.componentId, parent.pluginId, child.restrictParent)\n  ) {\n    return false\n  }\n  if (\n    parent.restrictChildren &&\n    checkLinealOrder(child.componentId, child.pluginId, parent.restrictChildren)\n  ) {\n    return false\n  }\n  return true\n}\n"],"names":["LinealDirectiveFlag","checkLinealOrder","componentId","pluginId","order","directiveType","directiveDefinition","flag","components","Array","isArray","plugins","undefined","DISALLOW","some","id","LIMIT_TO","length","linealRelationshipPermits","child","parent","restrictParent","restrictChildren"],"mappings":"AAAA;;;;;;;;;;;;;;;CAeC,GAED,SAASA,mBAAmB,QAAQ,gDAA4C;AAoBhF;;;;;;;;;;;;;;CAcC,GACD,OAAO,SAASC,iBACdC,WAAoC,EACpCC,QAA8B,EAC9BC,KAAsB;IAEtB,MAAM,CAACC,eAAeC,oBAAoB,GAAGF;IAC7C,MAAMG,OAAeF;IACrB,MAAMG,aAAaC,MAAMC,OAAO,CAACJ,uBAC7BA,sBACAA,uCAAAA,oBAAqBE,UAAU;IACnC,MAAMG,UAAUF,MAAMC,OAAO,CAACJ,uBAC1BM,YACAN,uCAAAA,oBAAqBK,OAAO;IAEhC,IAAIJ,SAASP,oBAAoBa,QAAQ,EAAE;QACzC,IAAIL,8BAAAA,WAAYM,IAAI,CAAC,CAACC,KAAOA,OAAOb,cAAc,OAAO;QACzD,IAAIS,2BAAAA,QAASG,IAAI,CAAC,CAACC,KAAOA,OAAOZ,WAAW,OAAO;QACnD,OAAO;IACT;IAEA,IAAII,SAASP,oBAAoBgB,QAAQ,EAAE;QACzC,IACEP,MAAMC,OAAO,CAACF,eACbA,CAAAA,WAAWS,MAAM,KAAK,KAAK,CAACT,WAAWM,IAAI,CAAC,CAACC,KAAOA,OAAOb,YAAW,GACvE;YACA,OAAO;QACT;QACA,IACEO,MAAMC,OAAO,CAACC,YACbA,CAAAA,QAAQM,MAAM,KAAK,KAAK,CAACN,QAAQG,IAAI,CAAC,CAACC,KAAOA,OAAOZ,SAAQ,GAC9D;YACA,OAAO;QACT;IACF;IAEA,OAAO;AACT;AAEA;;;;CAIC,GACD,OAAO,SAASe,0BACdC,KAIC,EACDC,MAIC;IAED,IACED,MAAME,cAAc,IACpBpB,iBAAiBmB,OAAOlB,WAAW,EAAEkB,OAAOjB,QAAQ,EAAEgB,MAAME,cAAc,GAC1E;QACA,OAAO;IACT;IACA,IACED,OAAOE,gBAAgB,IACvBrB,iBAAiBkB,MAAMjB,WAAW,EAAEiB,MAAMhB,QAAQ,EAAEiB,OAAOE,gBAAgB,GAC3E;QACA,OAAO;IACT;IACA,OAAO;AACT"}

package/src/lib/app-utils/link-references.d.ts

@@ -0,0 +1,36 @@
+/**
+ * @license
+ * Copyright 2026 Aglyn LLC
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+/** What a page composes, as {@link collectEntryLinkRefs} reads it. */
+export interface EntryLinkRefSources {
+    /**
+     * Flat node maps — the composed page (screen, layout chain, grafted
+     * components, a collection template) and any tree composed beside it.
+     * Each node's `props` bag is walked.
+     */
+    nodes?: ReadonlyArray<Record<string, unknown> | null | undefined>;
+    /**
+     * Markdown-lite rendered with no node to carry it: the entry body of the
+     * legacy article surface, and of the Markdown twin of an entry.
+     */
+    markdown?: ReadonlyArray<string | null | undefined>;
+}
+/**
+ * Every entry a page's links name, as canonical `entry:<collectionId>/<entryId>`
+ * keys — deduplicated and sorted, so the same page always asks the same
+ * question and a cache keyed by the answer is hit.
+ */
+export declare function collectEntryLinkRefs(sources: EntryLinkRefSources): string[];

package/src/lib/app-utils/link-references.js

@@ -0,0 +1,89 @@
+/**
+ * @license
+ * Copyright 2026 Aglyn LLC
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */ /**
+ * Which content collection ENTRIES a page's links name (AGL-3118).
+ *
+ * An entry link is stored as `entry:<collectionId>/<entryId>` — ids, so a
+ * renamed post or a renamed collection cannot break it — and resolving one
+ * needs the entry's current slug, which lives on the entry's own document.
+ * The routing map carries every screen and listing of a site, but a site's
+ * entries can number in the thousands, so a page carries only the entries it
+ * names: this walk finds them, and the tenant reads exactly those documents.
+ *
+ * A reference can sit in two kinds of place:
+ *
+ * - a node's PROPS, anywhere in the bag: the `screenId`/`href` pair of a
+ *   linking element, a `Link`-typed component prop in either slot, and the
+ *   item arrays a nav strip, a tab set or a menu keeps its targets in — deep
+ *   for the reason `nodesReferenceScreen` is deep;
+ * - MARKDOWN — a Markdown element's content, an entry body — where a link
+ *   names its target as `[text](entry:…)`.
+ *
+ * Collecting one too many costs one more document in a bounded read, and a
+ * string that is not a rendered link is never made into one, so a string is
+ * scanned for markdown links wherever it sits, code sample or not. Missing
+ * one is the failure that matters: a live link rendered as plain text.
+ */ import { ENTRY_LINK_VALUE_PREFIX, formatEntryLinkValue, parseEntryLinkValue } from "./screen-link-value.js";
+/**
+ * A markdown-lite link whose target is an entry reference. The target half
+ * is the parser's own (`[^)\s]+`), so this finds what the parser keeps.
+ */ const MARKDOWN_ENTRY_LINK = /\]\((entry:[^)\s]+)\)/g;
+/**
+ * How deep a prop bag is followed. Stored props are JSON and cannot cycle,
+ * but a composed tree is data from any writer, and a stack overflow inside a
+ * render is a 500 on a page that would otherwise serve.
+ */ const MAX_PROP_DEPTH = 64;
+/**
+ * Every entry a page's links name, as canonical `entry:<collectionId>/<entryId>`
+ * keys — deduplicated and sorted, so the same page always asks the same
+ * question and a cache keyed by the answer is hit.
+ */ export function collectEntryLinkRefs(sources) {
+    var _sources_nodes, _sources_markdown;
+    const refs = new Set();
+    const add = (value)=>{
+        const entry = parseEntryLinkValue(value);
+        if (entry) refs.add(formatEntryLinkValue(entry.collectionId, entry.entryId));
+    };
+    const scan = (value)=>{
+        var _match_;
+        // Nearly every string on a page names no entry; one substring test
+        // keeps the walk from trimming and splitting all of them.
+        if (!value.includes(ENTRY_LINK_VALUE_PREFIX)) return;
+        add(value);
+        if (!value.includes(`](${ENTRY_LINK_VALUE_PREFIX}`)) return;
+        for (const match of value.matchAll(MARKDOWN_ENTRY_LINK))add((_match_ = match[1]) != null ? _match_ : '');
+    };
+    const walk = (value, depth)=>{
+        if (typeof value === 'string') return scan(value);
+        if (!value || typeof value !== 'object' || depth >= MAX_PROP_DEPTH) return;
+        const children = Array.isArray(value) ? value : Object.values(value);
+        for (const child of children)walk(child, depth + 1);
+    };
+    for (const nodes of (_sources_nodes = sources.nodes) != null ? _sources_nodes : []){
+        if (!nodes || typeof nodes !== 'object') continue;
+        for (const node of Object.values(nodes)){
+            walk(node == null ? void 0 : node.props, 0);
+        }
+    }
+    for (const markdown of (_sources_markdown = sources.markdown) != null ? _sources_markdown : []){
+        if (typeof markdown === 'string') scan(markdown);
+    }
+    return [
+        ...refs
+    ].sort();
+}
+
+//# sourceMappingURL=link-references.js.map

package/src/lib/app-utils/link-references.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../../../../libs/aglyn/src/lib/app-utils/link-references.ts"],"sourcesContent":["/**\n * @license\n * Copyright 2026 Aglyn LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/**\n * Which content collection ENTRIES a page's links name (AGL-3118).\n *\n * An entry link is stored as `entry:<collectionId>/<entryId>` — ids, so a\n * renamed post or a renamed collection cannot break it — and resolving one\n * needs the entry's current slug, which lives on the entry's own document.\n * The routing map carries every screen and listing of a site, but a site's\n * entries can number in the thousands, so a page carries only the entries it\n * names: this walk finds them, and the tenant reads exactly those documents.\n *\n * A reference can sit in two kinds of place:\n *\n * - a node's PROPS, anywhere in the bag: the `screenId`/`href` pair of a\n *   linking element, a `Link`-typed component prop in either slot, and the\n *   item arrays a nav strip, a tab set or a menu keeps its targets in — deep\n *   for the reason `nodesReferenceScreen` is deep;\n * - MARKDOWN — a Markdown element's content, an entry body — where a link\n *   names its target as `[text](entry:…)`.\n *\n * Collecting one too many costs one more document in a bounded read, and a\n * string that is not a rendered link is never made into one, so a string is\n * scanned for markdown links wherever it sits, code sample or not. Missing\n * one is the failure that matters: a live link rendered as plain text.\n */\n\nimport {\n  ENTRY_LINK_VALUE_PREFIX,\n  formatEntryLinkValue,\n  parseEntryLinkValue,\n} from './screen-link-value'\n\n/** What a page composes, as {@link collectEntryLinkRefs} reads it. */\nexport interface EntryLinkRefSources {\n  /**\n   * Flat node maps — the composed page (screen, layout chain, grafted\n   * components, a collection template) and any tree composed beside it.\n   * Each node's `props` bag is walked.\n   */\n  nodes?: ReadonlyArray<Record<string, unknown> | null | undefined>\n  /**\n   * Markdown-lite rendered with no node to carry it: the entry body of the\n   * legacy article surface, and of the Markdown twin of an entry.\n   */\n  markdown?: ReadonlyArray<string | null | undefined>\n}\n\n/**\n * A markdown-lite link whose target is an entry reference. The target half\n * is the parser's own (`[^)\\s]+`), so this finds what the parser keeps.\n */\nconst MARKDOWN_ENTRY_LINK = /\\]\\((entry:[^)\\s]+)\\)/g\n\n/**\n * How deep a prop bag is followed. Stored props are JSON and cannot cycle,\n * but a composed tree is data from any writer, and a stack overflow inside a\n * render is a 500 on a page that would otherwise serve.\n */\nconst MAX_PROP_DEPTH = 64\n\n/**\n * Every entry a page's links name, as canonical `entry:<collectionId>/<entryId>`\n * keys — deduplicated and sorted, so the same page always asks the same\n * question and a cache keyed by the answer is hit.\n */\nexport function collectEntryLinkRefs(sources: EntryLinkRefSources): string[] {\n  const refs = new Set<string>()\n  const add = (value: string): void => {\n    const entry = parseEntryLinkValue(value)\n    if (entry) refs.add(formatEntryLinkValue(entry.collectionId, entry.entryId))\n  }\n  const scan = (value: string): void => {\n    // Nearly every string on a page names no entry; one substring test\n    // keeps the walk from trimming and splitting all of them.\n    if (!value.includes(ENTRY_LINK_VALUE_PREFIX)) return\n    add(value)\n    if (!value.includes(`](${ENTRY_LINK_VALUE_PREFIX}`)) return\n    for (const match of value.matchAll(MARKDOWN_ENTRY_LINK)) add(match[1] ?? '')\n  }\n  const walk = (value: unknown, depth: number): void => {\n    if (typeof value === 'string') return scan(value)\n    if (!value || typeof value !== 'object' || depth >= MAX_PROP_DEPTH) return\n    const children = Array.isArray(value)\n      ? value\n      : Object.values(value as Record<string, unknown>)\n    for (const child of children) walk(child, depth + 1)\n  }\n  for (const nodes of sources.nodes ?? []) {\n    if (!nodes || typeof nodes !== 'object') continue\n    for (const node of Object.values(nodes)) {\n      walk((node as { props?: unknown } | null | undefined)?.props, 0)\n    }\n  }\n  for (const markdown of sources.markdown ?? []) {\n    if (typeof markdown === 'string') scan(markdown)\n  }\n  return [...refs].sort()\n}\n"],"names":["ENTRY_LINK_VALUE_PREFIX","formatEntryLinkValue","parseEntryLinkValue","MARKDOWN_ENTRY_LINK","MAX_PROP_DEPTH","collectEntryLinkRefs","sources","refs","Set","add","value","entry","collectionId","entryId","scan","match","includes","matchAll","walk","depth","children","Array","isArray","Object","values","child","nodes","node","props","markdown","sort"],"mappings":"AAAA;;;;;;;;;;;;;;;CAeC,GAED;;;;;;;;;;;;;;;;;;;;;;;CAuBC,GAED,SACEA,uBAAuB,EACvBC,oBAAoB,EACpBC,mBAAmB,QACd,yBAAqB;AAiB5B;;;CAGC,GACD,MAAMC,sBAAsB;AAE5B;;;;CAIC,GACD,MAAMC,iBAAiB;AAEvB;;;;CAIC,GACD,OAAO,SAASC,qBAAqBC,OAA4B;QAsB3CA,gBAMGA;IA3BvB,MAAMC,OAAO,IAAIC;IACjB,MAAMC,MAAM,CAACC;QACX,MAAMC,QAAQT,oBAAoBQ;QAClC,IAAIC,OAAOJ,KAAKE,GAAG,CAACR,qBAAqBU,MAAMC,YAAY,EAAED,MAAME,OAAO;IAC5E;IACA,MAAMC,OAAO,CAACJ;YAMiDK;QAL7D,mEAAmE;QACnE,0DAA0D;QAC1D,IAAI,CAACL,MAAMM,QAAQ,CAAChB,0BAA0B;QAC9CS,IAAIC;QACJ,IAAI,CAACA,MAAMM,QAAQ,CAAC,CAAC,EAAE,EAAEhB,yBAAyB,GAAG;QACrD,KAAK,MAAMe,SAASL,MAAMO,QAAQ,CAACd,qBAAsBM,KAAIM,UAAAA,KAAK,CAAC,EAAE,YAARA,UAAY;IAC3E;IACA,MAAMG,OAAO,CAACR,OAAgBS;QAC5B,IAAI,OAAOT,UAAU,UAAU,OAAOI,KAAKJ;QAC3C,IAAI,CAACA,SAAS,OAAOA,UAAU,YAAYS,SAASf,gBAAgB;QACpE,MAAMgB,WAAWC,MAAMC,OAAO,CAACZ,SAC3BA,QACAa,OAAOC,MAAM,CAACd;QAClB,KAAK,MAAMe,SAASL,SAAUF,KAAKO,OAAON,QAAQ;IACpD;IACA,KAAK,MAAMO,UAASpB,iBAAAA,QAAQoB,KAAK,YAAbpB,iBAAiB,EAAE,CAAE;QACvC,IAAI,CAACoB,SAAS,OAAOA,UAAU,UAAU;QACzC,KAAK,MAAMC,QAAQJ,OAAOC,MAAM,CAACE,OAAQ;YACvCR,KAAMS,wBAAD,AAACA,KAAiDC,KAAK,EAAE;QAChE;IACF;IACA,KAAK,MAAMC,aAAYvB,oBAAAA,QAAQuB,QAAQ,YAAhBvB,oBAAoB,EAAE,CAAE;QAC7C,IAAI,OAAOuB,aAAa,UAAUf,KAAKe;IACzC;IACA,OAAO;WAAItB;KAAK,CAACuB,IAAI;AACvB"}

package/src/lib/app-utils/link-target-search-context.d.ts

@@ -0,0 +1,123 @@
+/**
+ * @license
+ * Copyright 2026 Aglyn LLC
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+/** An entry's publication state, as its document stores it. */
+export type LinkTargetEntryStatus = 'draft' | 'published' | 'scheduled';
+/** One entry a search found — see {@link LinkTargetSearchContextValue}. */
+export interface LinkTargetOption {
+    /** The stored reference, `entry:<collectionId>/<entryId>`. */
+    value: string;
+    /** One line naming it — see {@link entryLinkTargetLabel}. */
+    label: string;
+    /** The entry's own title: what a link to it says when nothing else does. */
+    title: string;
+    /** The name of the collection it belongs to. */
+    collectionName?: string;
+    status: LinkTargetEntryStatus;
+}
+export interface LinkTargetSearchOptions {
+    /** Aborted when the author has typed on: the answer is no longer wanted. */
+    signal?: AbortSignal;
+}
+export interface LinkTargetSearchContextValue {
+    /**
+     * Whether anything here can search. False only on the default, where the
+     * pickers offer no Entries group at all rather than an empty one.
+     */
+    available: boolean;
+    /**
+     * The entries matching what the author typed, a few per collection. An
+     * empty query asks for the most recently edited ones instead, so a picker
+     * opened before anything is typed still offers something.
+     *
+     * Rejects with an `AbortError` once `signal` aborts.
+     */
+    searchEntries: (query: string, options?: LinkTargetSearchOptions) => Promise<LinkTargetOption[]>;
+    /**
+     * The label for one stored entry reference — the {@link LinkTargetOption}
+     * label a search would give it — or `undefined` when no such entry exists.
+     * A failed read rejects, because a network error is not evidence that an
+     * entry is gone.
+     */
+    describeTarget: (value: string) => Promise<string | undefined>;
+}
+/** The default: no provider mounted, so no entry can be searched or named. */
+export declare const NO_LINK_TARGET_SEARCH: LinkTargetSearchContextValue;
+/**
+ * Provided by the console around every surface that edits links — each
+ * besigner and the content entry editor — and absent everywhere else.
+ */
+export declare const LinkTargetSearchContext: import("react").Context<LinkTargetSearchContextValue>;
+/**
+ * How long a picker waits after the last keystroke before it searches: long
+ * enough that typing a word is one search, short enough to feel live.
+ */
+export declare const LINK_TARGET_SEARCH_DEBOUNCE_MS = 250;
+/** A stored status as one of the three the entries table offers. */
+export declare function normalizeLinkTargetEntryStatus(value: unknown): LinkTargetEntryStatus;
+/**
+ * The one line a picker shows for an entry: its title and address, the
+ * collection it belongs to, and whether it is live — `Hello (/blog/hello) —
+ * Blog entry · draft`. The same shape as a listing's label, so a closed picker
+ * says what KIND of target it holds, and the status is there because a link
+ * to a draft goes nowhere until the draft is published.
+ */
+export declare function entryLinkTargetLabel(entry: {
+    title?: string | null;
+    path?: string | null;
+    collectionName?: string | null;
+    status: LinkTargetEntryStatus;
+}): string;
+/** What {@link useLinkTargetEntrySearch} holds for a picker to draw. */
+export interface LinkTargetEntrySearch {
+    /** A provider is mounted, so the picker has an Entries group at all. */
+    available: boolean;
+    /** The entries matching the current query, once its search settles. */
+    entries: LinkTargetOption[];
+    /** The current query's search is waiting out its debounce or in flight. */
+    searching: boolean;
+    /** The current query's search failed, so `entries` being empty says nothing. */
+    failed: boolean;
+}
+/**
+ * Searches entries for what the author typed, while `active` — a picker
+ * passes whether its list is open, so a closed picker reads nothing.
+ *
+ * Debounced by {@link LINK_TARGET_SEARCH_DEBOUNCE_MS}, and each new query
+ * aborts the search before it: typing `hello` is one search, not five, and an
+ * answer for `hel` that lands after the one for `hello` is dropped rather than
+ * shown.
+ */
+export declare function useLinkTargetEntrySearch(query: string, active: boolean): LinkTargetEntrySearch;
+/** What {@link useLinkTargetLabel} calls a stored target. */
+export interface LinkTargetLabel {
+    label: string;
+    /** Known to be gone: whatever holds the target has been asked and said so. */
+    missing: boolean;
+    /** Still being looked up, so `label` is a stand-in. */
+    pending: boolean;
+}
+/**
+ * A readable name for a stored link target: a routing-map key (a bare screen
+ * id, `collection:`, `feed:`, `entry:`) or a `screen:` value. `undefined` for
+ * nothing stored.
+ *
+ * Screens, listings and feeds are named from `ScreenLinkContext` exactly as
+ * the pickers label them. An entry is named through the search seam, with a
+ * stand-in naming its collection while that read is out — never its raw ids,
+ * which say nothing to an author.
+ */
+export declare function useLinkTargetLabel(key: string | null | undefined): LinkTargetLabel | undefined;

package/src/lib/app-utils/link-target-search-context.js

@@ -0,0 +1,221 @@
+/**
+ * @license
+ * Copyright 2026 Aglyn LLC
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *   http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */ /**
+ * The link-target search seam (AGL-3119): how a link picker finds ENTRIES.
+ *
+ * Screens, collection listings and feeds are a handful of targets the
+ * console already holds in `ScreenLinkContext`, so a picker filters them in
+ * memory. Entries are different in kind: a blog can hold thousands, and
+ * reading them all into a dropdown is exactly the read bill a lookup exists
+ * to avoid. So a picker asks for the few entries that match what the author
+ * typed, when they type it, and names a stored entry reference with one
+ * keyed read.
+ *
+ * The picker lives in libraries that cannot know how the data is read — the
+ * designer and the markdown editor — and the console is what can. This
+ * context is the contract between them. Its default offers nothing, so every
+ * surface without a provider (the tenant, a marketplace README, an isolated
+ * spec) keeps working with the targets it has.
+ *
+ * Same placement rationale as `screen-link-context.ts`: in @aglyn/aglyn
+ * without a `'use client'` banner, so the designer, the markdown editor and
+ * the console share one context instance; `createContext` at module scope
+ * keeps it out of the `@aglyn/aglyn/server` barrel.
+ */ import { createContext, useContext, useEffect, useState } from "react";
+import { screenLinkTargetLabel, unavailableScreenLabel } from "./screen-link-context.js";
+import { ScreenLinkContext } from "./screen-link-context-value.js";
+import { formatCollectionLinkValue, formatEntryLinkValue, parseEntryLinkValue, parseScreenLinkValue, screenRoutesAnswerFor } from "./screen-link-value.js";
+/** The default: no provider mounted, so no entry can be searched or named. */ export const NO_LINK_TARGET_SEARCH = Object.freeze({
+    available: false,
+    searchEntries: ()=>Promise.resolve([]),
+    describeTarget: ()=>Promise.resolve(undefined)
+});
+/**
+ * Provided by the console around every surface that edits links — each
+ * besigner and the content entry editor — and absent everywhere else.
+ */ export const LinkTargetSearchContext = createContext(NO_LINK_TARGET_SEARCH);
+LinkTargetSearchContext.displayName = 'LinkTargetSearchContext';
+/**
+ * How long a picker waits after the last keystroke before it searches: long
+ * enough that typing a word is one search, short enough to feel live.
+ */ export const LINK_TARGET_SEARCH_DEBOUNCE_MS = 250;
+/** A stored status as one of the three the entries table offers. */ export function normalizeLinkTargetEntryStatus(value) {
+    return value === 'published' || value === 'scheduled' ? value : 'draft';
+}
+/**
+ * The one line a picker shows for an entry: its title and address, the
+ * collection it belongs to, and whether it is live — `Hello (/blog/hello) —
+ * Blog entry · draft`. The same shape as a listing's label, so a closed picker
+ * says what KIND of target it holds, and the status is there because a link
+ * to a draft goes nowhere until the draft is published.
+ */ export function entryLinkTargetLabel(entry) {
+    var _entry_title, _entry_collectionName;
+    const name = ((_entry_title = entry.title) == null ? void 0 : _entry_title.trim()) || 'Untitled entry';
+    const address = entry.path ? ` (${entry.path})` : '';
+    const owner = ((_entry_collectionName = entry.collectionName) == null ? void 0 : _entry_collectionName.trim()) ? `${entry.collectionName.trim()} entry` : 'entry';
+    return `${name}${address} — ${owner} · ${entry.status}`;
+}
+/**
+ * Searches entries for what the author typed, while `active` — a picker
+ * passes whether its list is open, so a closed picker reads nothing.
+ *
+ * Debounced by {@link LINK_TARGET_SEARCH_DEBOUNCE_MS}, and each new query
+ * aborts the search before it: typing `hello` is one search, not five, and an
+ * answer for `hel` that lands after the one for `hello` is dropped rather than
+ * shown.
+ */ export function useLinkTargetEntrySearch(query, active) {
+    var _ref;
+    const search = useContext(LinkTargetSearchContext);
+    const enabled = active && search.available;
+    const [settled, setSettled] = useState(null);
+    useEffect(()=>{
+        if (!enabled) return undefined;
+        const controller = new AbortController();
+        const timer = setTimeout(()=>{
+            search.searchEntries(query, {
+                signal: controller.signal
+            }).then((entries)=>{
+                if (controller.signal.aborted) return;
+                setSettled({
+                    query,
+                    search,
+                    entries,
+                    failed: false
+                });
+            }, ()=>{
+                if (controller.signal.aborted) return;
+                setSettled({
+                    query,
+                    search,
+                    entries: [],
+                    failed: true
+                });
+            });
+        }, LINK_TARGET_SEARCH_DEBOUNCE_MS);
+        return ()=>{
+            clearTimeout(timer);
+            controller.abort();
+        };
+    }, [
+        enabled,
+        query,
+        search
+    ]);
+    // Only an answer to THIS query from THIS provider counts: the previous
+    // query's entries would be a wrong answer shown as a right one.
+    const current = enabled && (settled == null ? void 0 : settled.query) === query && settled.search === search ? settled : null;
+    return {
+        available: search.available,
+        entries: (_ref = current == null ? void 0 : current.entries) != null ? _ref : [],
+        searching: enabled && !current,
+        failed: Boolean(current == null ? void 0 : current.failed)
+    };
+}
+/**
+ * A readable name for a stored link target: a routing-map key (a bare screen
+ * id, `collection:`, `feed:`, `entry:`) or a `screen:` value. `undefined` for
+ * nothing stored.
+ *
+ * Screens, listings and feeds are named from `ScreenLinkContext` exactly as
+ * the pickers label them. An entry is named through the search seam, with a
+ * stand-in naming its collection while that read is out — never its raw ids,
+ * which say nothing to an author.
+ */ export function useLinkTargetLabel(key) {
+    var _parseScreenLinkValue;
+    const { screens, labels } = useContext(ScreenLinkContext);
+    const search = useContext(LinkTargetSearchContext);
+    const raw = typeof key === 'string' ? key.trim() : '';
+    const target = raw ? (_parseScreenLinkValue = parseScreenLinkValue(raw)) != null ? _parseScreenLinkValue : raw : '';
+    const entry = target ? parseEntryLinkValue(target) : undefined;
+    const entryKey = entry ? formatEntryLinkValue(entry.collectionId, entry.entryId) : undefined;
+    const [described, setDescribed] = useState(null);
+    useEffect(()=>{
+        if (!entryKey || !search.available) return undefined;
+        let live = true;
+        search.describeTarget(entryKey).then((label)=>{
+            if (live) setDescribed({
+                key: entryKey,
+                search,
+                label,
+                failed: false
+            });
+        }, ()=>{
+            if (live) {
+                setDescribed({
+                    key: entryKey,
+                    search,
+                    label: undefined,
+                    failed: true
+                });
+            }
+        });
+        return ()=>{
+            live = false;
+        };
+    }, [
+        entryKey,
+        search
+    ]);
+    if (!target) return undefined;
+    if (entry && entryKey) {
+        const collectionName = labels == null ? void 0 : labels[formatCollectionLinkValue(entry.collectionId)];
+        const standIn = collectionName ? `Entry in ${collectionName}` : 'Linked entry';
+        if (!search.available) {
+            return {
+                label: standIn,
+                missing: false,
+                pending: false
+            };
+        }
+        const answer = (described == null ? void 0 : described.key) === entryKey && described.search === search ? described : null;
+        if (!answer) return {
+            label: standIn,
+            missing: false,
+            pending: true
+        };
+        if (answer.label) return {
+            label: answer.label,
+            missing: false,
+            pending: false
+        };
+        // A read that failed proves nothing about the entry, so it is named as
+        // if the seam were absent rather than condemned.
+        if (answer.failed) return {
+            label: standIn,
+            missing: false,
+            pending: false
+        };
+        return {
+            label: collectionName ? `⚠ Unavailable entry in ${collectionName} — deleted` : '⚠ Unavailable entry — deleted',
+            missing: true,
+            pending: false
+        };
+    }
+    const named = screenLinkTargetLabel(target, screens, labels);
+    if (named) return {
+        label: named,
+        missing: false,
+        pending: false
+    };
+    const known = screenRoutesAnswerFor(screens, target);
+    return {
+        label: unavailableScreenLabel(target, known),
+        missing: known,
+        pending: false
+    };
+}
+
+//# sourceMappingURL=link-target-search-context.js.map

package/src/lib/app-utils/link-target-search-context.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../../../../libs/aglyn/src/lib/app-utils/link-target-search-context.ts"],"sourcesContent":["/**\n * @license\n * Copyright 2026 Aglyn LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/**\n * The link-target search seam (AGL-3119): how a link picker finds ENTRIES.\n *\n * Screens, collection listings and feeds are a handful of targets the\n * console already holds in `ScreenLinkContext`, so a picker filters them in\n * memory. Entries are different in kind: a blog can hold thousands, and\n * reading them all into a dropdown is exactly the read bill a lookup exists\n * to avoid. So a picker asks for the few entries that match what the author\n * typed, when they type it, and names a stored entry reference with one\n * keyed read.\n *\n * The picker lives in libraries that cannot know how the data is read — the\n * designer and the markdown editor — and the console is what can. This\n * context is the contract between them. Its default offers nothing, so every\n * surface without a provider (the tenant, a marketplace README, an isolated\n * spec) keeps working with the targets it has.\n *\n * Same placement rationale as `screen-link-context.ts`: in @aglyn/aglyn\n * without a `'use client'` banner, so the designer, the markdown editor and\n * the console share one context instance; `createContext` at module scope\n * keeps it out of the `@aglyn/aglyn/server` barrel.\n */\n\nimport { createContext, useContext, useEffect, useState } from 'react'\nimport {\n  screenLinkTargetLabel,\n  unavailableScreenLabel,\n} from './screen-link-context'\nimport { ScreenLinkContext } from './screen-link-context-value'\nimport {\n  formatCollectionLinkValue,\n  formatEntryLinkValue,\n  parseEntryLinkValue,\n  parseScreenLinkValue,\n  screenRoutesAnswerFor,\n} from './screen-link-value'\n\n/** An entry's publication state, as its document stores it. */\nexport type LinkTargetEntryStatus = 'draft' | 'published' | 'scheduled'\n\n/** One entry a search found — see {@link LinkTargetSearchContextValue}. */\nexport interface LinkTargetOption {\n  /** The stored reference, `entry:<collectionId>/<entryId>`. */\n  value: string\n  /** One line naming it — see {@link entryLinkTargetLabel}. */\n  label: string\n  /** The entry's own title: what a link to it says when nothing else does. */\n  title: string\n  /** The name of the collection it belongs to. */\n  collectionName?: string\n  status: LinkTargetEntryStatus\n}\n\nexport interface LinkTargetSearchOptions {\n  /** Aborted when the author has typed on: the answer is no longer wanted. */\n  signal?: AbortSignal\n}\n\nexport interface LinkTargetSearchContextValue {\n  /**\n   * Whether anything here can search. False only on the default, where the\n   * pickers offer no Entries group at all rather than an empty one.\n   */\n  available: boolean\n  /**\n   * The entries matching what the author typed, a few per collection. An\n   * empty query asks for the most recently edited ones instead, so a picker\n   * opened before anything is typed still offers something.\n   *\n   * Rejects with an `AbortError` once `signal` aborts.\n   */\n  searchEntries: (\n    query: string,\n    options?: LinkTargetSearchOptions,\n  ) => Promise<LinkTargetOption[]>\n  /**\n   * The label for one stored entry reference — the {@link LinkTargetOption}\n   * label a search would give it — or `undefined` when no such entry exists.\n   * A failed read rejects, because a network error is not evidence that an\n   * entry is gone.\n   */\n  describeTarget: (value: string) => Promise<string | undefined>\n}\n\n/** The default: no provider mounted, so no entry can be searched or named. */\nexport const NO_LINK_TARGET_SEARCH: LinkTargetSearchContextValue =\n  Object.freeze({\n    available: false,\n    searchEntries: () => Promise.resolve([]),\n    describeTarget: () => Promise.resolve(undefined),\n  })\n\n/**\n * Provided by the console around every surface that edits links — each\n * besigner and the content entry editor — and absent everywhere else.\n */\nexport const LinkTargetSearchContext =\n  createContext<LinkTargetSearchContextValue>(NO_LINK_TARGET_SEARCH)\nLinkTargetSearchContext.displayName = 'LinkTargetSearchContext'\n\n/**\n * How long a picker waits after the last keystroke before it searches: long\n * enough that typing a word is one search, short enough to feel live.\n */\nexport const LINK_TARGET_SEARCH_DEBOUNCE_MS = 250\n\n/** A stored status as one of the three the entries table offers. */\nexport function normalizeLinkTargetEntryStatus(\n  value: unknown,\n): LinkTargetEntryStatus {\n  return value === 'published' || value === 'scheduled' ? value : 'draft'\n}\n\n/**\n * The one line a picker shows for an entry: its title and address, the\n * collection it belongs to, and whether it is live — `Hello (/blog/hello) —\n * Blog entry · draft`. The same shape as a listing's label, so a closed picker\n * says what KIND of target it holds, and the status is there because a link\n * to a draft goes nowhere until the draft is published.\n */\nexport function entryLinkTargetLabel(entry: {\n  title?: string | null\n  path?: string | null\n  collectionName?: string | null\n  status: LinkTargetEntryStatus\n}): string {\n  const name = entry.title?.trim() || 'Untitled entry'\n  const address = entry.path ? ` (${entry.path})` : ''\n  const owner = entry.collectionName?.trim()\n    ? `${entry.collectionName.trim()} entry`\n    : 'entry'\n  return `${name}${address} — ${owner} · ${entry.status}`\n}\n\n/** What {@link useLinkTargetEntrySearch} holds for a picker to draw. */\nexport interface LinkTargetEntrySearch {\n  /** A provider is mounted, so the picker has an Entries group at all. */\n  available: boolean\n  /** The entries matching the current query, once its search settles. */\n  entries: LinkTargetOption[]\n  /** The current query's search is waiting out its debounce or in flight. */\n  searching: boolean\n  /** The current query's search failed, so `entries` being empty says nothing. */\n  failed: boolean\n}\n\ninterface SettledSearch {\n  query: string\n  search: LinkTargetSearchContextValue\n  entries: LinkTargetOption[]\n  failed: boolean\n}\n\n/**\n * Searches entries for what the author typed, while `active` — a picker\n * passes whether its list is open, so a closed picker reads nothing.\n *\n * Debounced by {@link LINK_TARGET_SEARCH_DEBOUNCE_MS}, and each new query\n * aborts the search before it: typing `hello` is one search, not five, and an\n * answer for `hel` that lands after the one for `hello` is dropped rather than\n * shown.\n */\nexport function useLinkTargetEntrySearch(\n  query: string,\n  active: boolean,\n): LinkTargetEntrySearch {\n  const search = useContext(LinkTargetSearchContext)\n  const enabled = active && search.available\n  const [settled, setSettled] = useState<SettledSearch | null>(null)\n\n  useEffect(() => {\n    if (!enabled) return undefined\n    const controller = new AbortController()\n    const timer = setTimeout(() => {\n      search.searchEntries(query, { signal: controller.signal }).then(\n        (entries) => {\n          if (controller.signal.aborted) return\n          setSettled({ query, search, entries, failed: false })\n        },\n        () => {\n          if (controller.signal.aborted) return\n          setSettled({ query, search, entries: [], failed: true })\n        },\n      )\n    }, LINK_TARGET_SEARCH_DEBOUNCE_MS)\n    return () => {\n      clearTimeout(timer)\n      controller.abort()\n    }\n  }, [enabled, query, search])\n\n  // Only an answer to THIS query from THIS provider counts: the previous\n  // query's entries would be a wrong answer shown as a right one.\n  const current =\n    enabled && settled?.query === query && settled.search === search\n      ? settled\n      : null\n  return {\n    available: search.available,\n    entries: current?.entries ?? [],\n    searching: enabled && !current,\n    failed: Boolean(current?.failed),\n  }\n}\n\n/** What {@link useLinkTargetLabel} calls a stored target. */\nexport interface LinkTargetLabel {\n  label: string\n  /** Known to be gone: whatever holds the target has been asked and said so. */\n  missing: boolean\n  /** Still being looked up, so `label` is a stand-in. */\n  pending: boolean\n}\n\ninterface DescribedEntry {\n  key: string\n  search: LinkTargetSearchContextValue\n  label: string | undefined\n  failed: boolean\n}\n\n/**\n * A readable name for a stored link target: a routing-map key (a bare screen\n * id, `collection:`, `feed:`, `entry:`) or a `screen:` value. `undefined` for\n * nothing stored.\n *\n * Screens, listings and feeds are named from `ScreenLinkContext` exactly as\n * the pickers label them. An entry is named through the search seam, with a\n * stand-in naming its collection while that read is out — never its raw ids,\n * which say nothing to an author.\n */\nexport function useLinkTargetLabel(\n  key: string | null | undefined,\n): LinkTargetLabel | undefined {\n  const { screens, labels } = useContext(ScreenLinkContext)\n  const search = useContext(LinkTargetSearchContext)\n  const raw = typeof key === 'string' ? key.trim() : ''\n  const target = raw ? (parseScreenLinkValue(raw) ?? raw) : ''\n  const entry = target ? parseEntryLinkValue(target) : undefined\n  const entryKey = entry\n    ? formatEntryLinkValue(entry.collectionId, entry.entryId)\n    : undefined\n  const [described, setDescribed] = useState<DescribedEntry | null>(null)\n\n  useEffect(() => {\n    if (!entryKey || !search.available) return undefined\n    let live = true\n    search.describeTarget(entryKey).then(\n      (label) => {\n        if (live) setDescribed({ key: entryKey, search, label, failed: false })\n      },\n      () => {\n        if (live) {\n          setDescribed({ key: entryKey, search, label: undefined, failed: true })\n        }\n      },\n    )\n    return () => {\n      live = false\n    }\n  }, [entryKey, search])\n\n  if (!target) return undefined\n  if (entry && entryKey) {\n    const collectionName =\n      labels?.[formatCollectionLinkValue(entry.collectionId)]\n    const standIn = collectionName ? `Entry in ${collectionName}` : 'Linked entry'\n    if (!search.available) {\n      return { label: standIn, missing: false, pending: false }\n    }\n    const answer =\n      described?.key === entryKey && described.search === search\n        ? described\n        : null\n    if (!answer) return { label: standIn, missing: false, pending: true }\n    if (answer.label) return { label: answer.label, missing: false, pending: false }\n    // A read that failed proves nothing about the entry, so it is named as\n    // if the seam were absent rather than condemned.\n    if (answer.failed) return { label: standIn, missing: false, pending: false }\n    return {\n      label: collectionName\n        ? `⚠ Unavailable entry in ${collectionName} — deleted`\n        : '⚠ Unavailable entry — deleted',\n      missing: true,\n      pending: false,\n    }\n  }\n  const named = screenLinkTargetLabel(target, screens, labels)\n  if (named) return { label: named, missing: false, pending: false }\n  const known = screenRoutesAnswerFor(screens, target)\n  return {\n    label: unavailableScreenLabel(target, known),\n    missing: known,\n    pending: false,\n  }\n}\n"],"names":["createContext","useContext","useEffect","useState","screenLinkTargetLabel","unavailableScreenLabel","ScreenLinkContext","formatCollectionLinkValue","formatEntryLinkValue","parseEntryLinkValue","parseScreenLinkValue","screenRoutesAnswerFor","NO_LINK_TARGET_SEARCH","Object","freeze","available","searchEntries","Promise","resolve","describeTarget","undefined","LinkTargetSearchContext","displayName","LINK_TARGET_SEARCH_DEBOUNCE_MS","normalizeLinkTargetEntryStatus","value","entryLinkTargetLabel","entry","name","title","trim","address","path","owner","collectionName","status","useLinkTargetEntrySearch","query","active","search","enabled","settled","setSettled","controller","AbortController","timer","setTimeout","signal","then","entries","aborted","failed","clearTimeout","abort","current","searching","Boolean","useLinkTargetLabel","key","screens","labels","raw","target","entryKey","collectionId","entryId","described","setDescribed","live","label","standIn","missing","pending","answer","named","known"],"mappings":"AAAA;;;;;;;;;;;;;;;CAeC,GAED;;;;;;;;;;;;;;;;;;;;;CAqBC,GAED,SAASA,aAAa,EAAEC,UAAU,EAAEC,SAAS,EAAEC,QAAQ,QAAQ,QAAO;AACtE,SACEC,qBAAqB,EACrBC,sBAAsB,QACjB,2BAAuB;AAC9B,SAASC,iBAAiB,QAAQ,iCAA6B;AAC/D,SACEC,yBAAyB,EACzBC,oBAAoB,EACpBC,mBAAmB,EACnBC,oBAAoB,EACpBC,qBAAqB,QAChB,yBAAqB;AAiD5B,4EAA4E,GAC5E,OAAO,MAAMC,wBACXC,OAAOC,MAAM,CAAC;IACZC,WAAW;IACXC,eAAe,IAAMC,QAAQC,OAAO,CAAC,EAAE;IACvCC,gBAAgB,IAAMF,QAAQC,OAAO,CAACE;AACxC,GAAE;AAEJ;;;CAGC,GACD,OAAO,MAAMC,0BACXrB,cAA4CY,uBAAsB;AACpES,wBAAwBC,WAAW,GAAG;AAEtC;;;CAGC,GACD,OAAO,MAAMC,iCAAiC,IAAG;AAEjD,kEAAkE,GAClE,OAAO,SAASC,+BACdC,KAAc;IAEd,OAAOA,UAAU,eAAeA,UAAU,cAAcA,QAAQ;AAClE;AAEA;;;;;;CAMC,GACD,OAAO,SAASC,qBAAqBC,KAKpC;QACcA,cAECA;IAFd,MAAMC,OAAOD,EAAAA,eAAAA,MAAME,KAAK,qBAAXF,aAAaG,IAAI,OAAM;IACpC,MAAMC,UAAUJ,MAAMK,IAAI,GAAG,CAAC,EAAE,EAAEL,MAAMK,IAAI,CAAC,CAAC,CAAC,GAAG;IAClD,MAAMC,QAAQN,EAAAA,wBAAAA,MAAMO,cAAc,qBAApBP,sBAAsBG,IAAI,MACpC,GAAGH,MAAMO,cAAc,CAACJ,IAAI,GAAG,MAAM,CAAC,GACtC;IACJ,OAAO,GAAGF,OAAOG,QAAQ,GAAG,EAAEE,MAAM,GAAG,EAAEN,MAAMQ,MAAM,EAAE;AACzD;AAqBA;;;;;;;;CAQC,GACD,OAAO,SAASC,yBACdC,KAAa,EACbC,MAAe;;IAEf,MAAMC,SAAStC,WAAWoB;IAC1B,MAAMmB,UAAUF,UAAUC,OAAOxB,SAAS;IAC1C,MAAM,CAAC0B,SAASC,WAAW,GAAGvC,SAA+B;IAE7DD,UAAU;QACR,IAAI,CAACsC,SAAS,OAAOpB;QACrB,MAAMuB,aAAa,IAAIC;QACvB,MAAMC,QAAQC,WAAW;YACvBP,OAAOvB,aAAa,CAACqB,OAAO;gBAAEU,QAAQJ,WAAWI,MAAM;YAAC,GAAGC,IAAI,CAC7D,CAACC;gBACC,IAAIN,WAAWI,MAAM,CAACG,OAAO,EAAE;gBAC/BR,WAAW;oBAAEL;oBAAOE;oBAAQU;oBAASE,QAAQ;gBAAM;YACrD,GACA;gBACE,IAAIR,WAAWI,MAAM,CAACG,OAAO,EAAE;gBAC/BR,WAAW;oBAAEL;oBAAOE;oBAAQU,SAAS,EAAE;oBAAEE,QAAQ;gBAAK;YACxD;QAEJ,GAAG5B;QACH,OAAO;YACL6B,aAAaP;YACbF,WAAWU,KAAK;QAClB;IACF,GAAG;QAACb;QAASH;QAAOE;KAAO;IAE3B,uEAAuE;IACvE,gEAAgE;IAChE,MAAMe,UACJd,WAAWC,CAAAA,2BAAAA,QAASJ,KAAK,MAAKA,SAASI,QAAQF,MAAM,KAAKA,SACtDE,UACA;IACN,OAAO;QACL1B,WAAWwB,OAAOxB,SAAS;QAC3BkC,OAAO,UAAEK,2BAAAA,QAASL,OAAO,mBAAI,EAAE;QAC/BM,WAAWf,WAAW,CAACc;QACvBH,QAAQK,QAAQF,2BAAAA,QAASH,MAAM;IACjC;AACF;AAkBA;;;;;;;;;CASC,GACD,OAAO,SAASM,mBACdC,GAA8B;QAKRhD;IAHtB,MAAM,EAAEiD,OAAO,EAAEC,MAAM,EAAE,GAAG3D,WAAWK;IACvC,MAAMiC,SAAStC,WAAWoB;IAC1B,MAAMwC,MAAM,OAAOH,QAAQ,WAAWA,IAAI5B,IAAI,KAAK;IACnD,MAAMgC,SAASD,OAAOnD,wBAAAA,qBAAqBmD,gBAArBnD,wBAA6BmD,MAAO;IAC1D,MAAMlC,QAAQmC,SAASrD,oBAAoBqD,UAAU1C;IACrD,MAAM2C,WAAWpC,QACbnB,qBAAqBmB,MAAMqC,YAAY,EAAErC,MAAMsC,OAAO,IACtD7C;IACJ,MAAM,CAAC8C,WAAWC,aAAa,GAAGhE,SAAgC;IAElED,UAAU;QACR,IAAI,CAAC6D,YAAY,CAACxB,OAAOxB,SAAS,EAAE,OAAOK;QAC3C,IAAIgD,OAAO;QACX7B,OAAOpB,cAAc,CAAC4C,UAAUf,IAAI,CAClC,CAACqB;YACC,IAAID,MAAMD,aAAa;gBAAET,KAAKK;gBAAUxB;gBAAQ8B;gBAAOlB,QAAQ;YAAM;QACvE,GACA;YACE,IAAIiB,MAAM;gBACRD,aAAa;oBAAET,KAAKK;oBAAUxB;oBAAQ8B,OAAOjD;oBAAW+B,QAAQ;gBAAK;YACvE;QACF;QAEF,OAAO;YACLiB,OAAO;QACT;IACF,GAAG;QAACL;QAAUxB;KAAO;IAErB,IAAI,CAACuB,QAAQ,OAAO1C;IACpB,IAAIO,SAASoC,UAAU;QACrB,MAAM7B,iBACJ0B,0BAAAA,MAAQ,CAACrD,0BAA0BoB,MAAMqC,YAAY,EAAE;QACzD,MAAMM,UAAUpC,iBAAiB,CAAC,SAAS,EAAEA,gBAAgB,GAAG;QAChE,IAAI,CAACK,OAAOxB,SAAS,EAAE;YACrB,OAAO;gBAAEsD,OAAOC;gBAASC,SAAS;gBAAOC,SAAS;YAAM;QAC1D;QACA,MAAMC,SACJP,CAAAA,6BAAAA,UAAWR,GAAG,MAAKK,YAAYG,UAAU3B,MAAM,KAAKA,SAChD2B,YACA;QACN,IAAI,CAACO,QAAQ,OAAO;YAAEJ,OAAOC;YAASC,SAAS;YAAOC,SAAS;QAAK;QACpE,IAAIC,OAAOJ,KAAK,EAAE,OAAO;YAAEA,OAAOI,OAAOJ,KAAK;YAAEE,SAAS;YAAOC,SAAS;QAAM;QAC/E,uEAAuE;QACvE,iDAAiD;QACjD,IAAIC,OAAOtB,MAAM,EAAE,OAAO;YAAEkB,OAAOC;YAASC,SAAS;YAAOC,SAAS;QAAM;QAC3E,OAAO;YACLH,OAAOnC,iBACH,CAAC,uBAAuB,EAAEA,eAAe,UAAU,CAAC,GACpD;YACJqC,SAAS;YACTC,SAAS;QACX;IACF;IACA,MAAME,QAAQtE,sBAAsB0D,QAAQH,SAASC;IACrD,IAAIc,OAAO,OAAO;QAAEL,OAAOK;QAAOH,SAAS;QAAOC,SAAS;IAAM;IACjE,MAAMG,QAAQhE,sBAAsBgD,SAASG;IAC7C,OAAO;QACLO,OAAOhE,uBAAuByD,QAAQa;QACtCJ,SAASI;QACTH,SAAS;IACX;AACF"}