@blogmcp/nav-core 0.1.0

package/README.md

@@ -0,0 +1,41 @@
+# @blogmcp/nav-core
+
+Framework-agnostic core for the KB navigation (menu) tree. Pure TypeScript — no
+I/O, no framework. The design lives in
+[`competitor-monitor/docs/internal/navigation-model.md`](../../docs/internal/navigation-model.md).
+
+This package is the shared logic surfaced two ways: the SDK runs it in-memory
+over a cached tree, and the server exposes it as MCP/API tools. Mirrors the
+`@blogmcp/mdx-schema` → renderer split.
+
+## Modules
+
+| Import | Contents |
+|---|---|
+| `@blogmcp/nav-core` | everything (barrel) |
+| `@blogmcp/nav-core/types` | node model: `NavNode` union, `NavTree`, `FlatNode`, `LocalizedNode` |
+| `@blogmcp/nav-core/validate` | `validate(tree, opts)` / `assertValid` — cycles, depth, dangling refs, single-owner, `data`-bag caps |
+| `@blogmcp/nav-core/traverse` | `findNode`, `breadcrumbs`, `getSiblings`, `getNextPrev`, `getSubtree`, `flatten` (FLAT), `localize`, `prune`, `sortTree` |
+| `@blogmcp/nav-core/mutate` | `insertNode`, `removeNode`, `moveNode`, `reorderChildren` — immutable; throw `NavMutationError` |
+
+## Invariants
+
+- **Immutable**: traversal and mutation never edit inputs; mutations return new trees.
+- **Server-authoritative**: the API re-runs `validate()` after every mutation.
+- **Opaque `data`**: the `data` bag is never interpreted, only size/depth-capped.
+- **Single multilingual tree**: `labels` is a per-locale map; `localize()` resolves
+  to one locale with fallback + an optional `labelResolver` (article titles come
+  from the consumer — nav-core does not know article content).
+
+## Not here yet
+
+The content→default-tree auto-builder and the auto-build ⊕ overrides merge ship
+with the API service slice (they need the article content index and the
+auto-append policy — see navigation-model.md §9).
+
+## Scripts
+
+```bash
+npm test --workspace=@blogmcp/nav-core        # vitest
+npm run build --workspace=@blogmcp/nav-core   # tsc → dist
+```

package/dist/index.d.ts

@@ -0,0 +1,17 @@
+/**
+ * @blogmcp/nav-core
+ *
+ * Framework-agnostic core for the KB navigation (menu) tree: the node-model
+ * contract, structural validation, pure traversal, and immutable mutations.
+ * Pure TypeScript — no I/O, no framework. Consumed by the KB API service, the
+ * MCP nav tools, and the blog SDK.
+ *
+ * What lives here: types, validate, traverse, mutate, and resolve (the
+ * content→default-tree auto-builder + the auto-build⊕overrides merge). See
+ * competitor-monitor/docs/internal/navigation-model.md §2, §4, §9.
+ */
+export * from './types/index.js';
+export * from './validate/index.js';
+export * from './traverse/index.js';
+export * from './mutate/index.js';
+export * from './resolve/index.js';

package/dist/index.js

@@ -0,0 +1,18 @@
+/**
+ * @blogmcp/nav-core
+ *
+ * Framework-agnostic core for the KB navigation (menu) tree: the node-model
+ * contract, structural validation, pure traversal, and immutable mutations.
+ * Pure TypeScript — no I/O, no framework. Consumed by the KB API service, the
+ * MCP nav tools, and the blog SDK.
+ *
+ * What lives here: types, validate, traverse, mutate, and resolve (the
+ * content→default-tree auto-builder + the auto-build⊕overrides merge). See
+ * competitor-monitor/docs/internal/navigation-model.md §2, §4, §9.
+ */
+export * from './types/index.js';
+export * from './validate/index.js';
+export * from './traverse/index.js';
+export * from './mutate/index.js';
+export * from './resolve/index.js';
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,cAAc,kBAAkB,CAAC;AACjC,cAAc,qBAAqB,CAAC;AACpC,cAAc,qBAAqB,CAAC;AACpC,cAAc,mBAAmB,CAAC;AAClC,cAAc,oBAAoB,CAAC"}

package/dist/mutate/index.d.ts

@@ -0,0 +1,41 @@
+/**
+ * @blogmcp/nav-core — mutate
+ *
+ * Immutable tree mutations. Every function returns a NEW tree and never edits
+ * its input. These back both the optimistic client-side apply (SDK) and the
+ * server-authoritative MCP/API tools — the server always re-runs `validate()`
+ * after a mutation (see navigation-model.md §5).
+ *
+ * Invalid operations throw {@link NavMutationError} (e.g. unknown id, or moving
+ * a node into its own descendant).
+ */
+import type { NavNode, NavTree } from '../types/index.js';
+export declare class NavMutationError extends Error {
+    readonly code: NavMutationCode;
+    constructor(message: string, code: NavMutationCode);
+}
+export type NavMutationCode = 'NODE_NOT_FOUND' | 'PARENT_NOT_FOUND' | 'DUPLICATE_ID' | 'CYCLE' | 'NOT_A_CONTAINER';
+export interface InsertOptions {
+    /** Parent id, or null/undefined to insert at the root level. */
+    readonly parentId?: string | null;
+    /** Position among target siblings; clamped to [0, len]. Defaults to end. */
+    readonly index?: number;
+}
+/** Insert a (sub)tree. Throws if the id already exists or the parent is missing. */
+export declare function insertNode(tree: NavTree, node: NavNode, options?: InsertOptions): NavNode[];
+/** Remove a node and its subtree. Throws if the node is not found. */
+export declare function removeNode(tree: NavTree, id: string): NavNode[];
+export interface MoveOptions {
+    /** New parent id, or null for the root level. */
+    readonly parentId?: string | null;
+    /** Position among the new siblings; clamped. Defaults to end. */
+    readonly index?: number;
+}
+/** Move a node (with its subtree) under a new parent. Throws on cycles. */
+export declare function moveNode(tree: NavTree, id: string, options?: MoveOptions): NavNode[];
+/**
+ * Reorder a parent's children to match `orderedIds`, reassigning each child's
+ * `order` to its new index. Ids present in the tree but absent from `orderedIds`
+ * keep their relative order at the end. Throws on unknown ids or missing parent.
+ */
+export declare function reorderChildren(tree: NavTree, parentId: string | null, orderedIds: readonly string[]): NavNode[];

package/dist/mutate/index.js

@@ -0,0 +1,123 @@
+/**
+ * @blogmcp/nav-core — mutate
+ *
+ * Immutable tree mutations. Every function returns a NEW tree and never edits
+ * its input. These back both the optimistic client-side apply (SDK) and the
+ * server-authoritative MCP/API tools — the server always re-runs `validate()`
+ * after a mutation (see navigation-model.md §5).
+ *
+ * Invalid operations throw {@link NavMutationError} (e.g. unknown id, or moving
+ * a node into its own descendant).
+ */
+import { findNode, walk } from '../traverse/index.js';
+export class NavMutationError extends Error {
+    code;
+    constructor(message, code) {
+        super(message);
+        this.code = code;
+        this.name = 'NavMutationError';
+    }
+}
+/** Insert a (sub)tree. Throws if the id already exists or the parent is missing. */
+export function insertNode(tree, node, options = {}) {
+    if (findNode(tree, node.id)) {
+        throw new NavMutationError(`Node "${node.id}" already exists.`, 'DUPLICATE_ID');
+    }
+    const { parentId = null, index } = options;
+    if (parentId === null) {
+        return insertAt([...tree], node, index);
+    }
+    if (!findNode(tree, parentId)) {
+        throw new NavMutationError(`Parent "${parentId}" not found.`, 'PARENT_NOT_FOUND');
+    }
+    return mapInto(tree, parentId, (children) => insertAt([...children], node, index));
+}
+/** Remove a node and its subtree. Throws if the node is not found. */
+export function removeNode(tree, id) {
+    if (!findNode(tree, id)) {
+        throw new NavMutationError(`Node "${id}" not found.`, 'NODE_NOT_FOUND');
+    }
+    const recur = (nodes) => nodes
+        .filter((n) => n.id !== id)
+        .map((n) => (n.children ? { ...n, children: recur(n.children) } : n));
+    return recur(tree);
+}
+/** Move a node (with its subtree) under a new parent. Throws on cycles. */
+export function moveNode(tree, id, options = {}) {
+    const node = findNode(tree, id);
+    if (!node) {
+        throw new NavMutationError(`Node "${id}" not found.`, 'NODE_NOT_FOUND');
+    }
+    const { parentId = null, index } = options;
+    if (parentId !== null) {
+        if (parentId === id) {
+            throw new NavMutationError(`Cannot move node "${id}" into itself.`, 'CYCLE');
+        }
+        if (descendantIds(node).has(parentId)) {
+            throw new NavMutationError(`Cannot move node "${id}" into its own descendant "${parentId}".`, 'CYCLE');
+        }
+        if (!findNode(tree, parentId)) {
+            throw new NavMutationError(`Parent "${parentId}" not found.`, 'PARENT_NOT_FOUND');
+        }
+    }
+    const detached = removeNode(tree, id);
+    return insertNode(detached, node, { parentId, index });
+}
+/**
+ * Reorder a parent's children to match `orderedIds`, reassigning each child's
+ * `order` to its new index. Ids present in the tree but absent from `orderedIds`
+ * keep their relative order at the end. Throws on unknown ids or missing parent.
+ */
+export function reorderChildren(tree, parentId, orderedIds) {
+    const apply = (children) => {
+        const byId = new Map(children.map((c) => [c.id, c]));
+        for (const oid of orderedIds) {
+            if (!byId.has(oid)) {
+                throw new NavMutationError(`Cannot reorder: "${oid}" is not a child of "${parentId ?? '<root>'}".`, 'NODE_NOT_FOUND');
+            }
+        }
+        const ordered = [
+            ...orderedIds.map((oid) => byId.get(oid)),
+            ...children.filter((c) => !orderedIds.includes(c.id)),
+        ];
+        return ordered.map((child, i) => ({ ...child, order: i }));
+    };
+    if (parentId === null) {
+        return apply(tree);
+    }
+    if (!findNode(tree, parentId)) {
+        throw new NavMutationError(`Parent "${parentId}" not found.`, 'PARENT_NOT_FOUND');
+    }
+    return mapInto(tree, parentId, apply);
+}
+/* -------------------------------------------------------------------------- */
+/* helpers                                                                     */
+/* -------------------------------------------------------------------------- */
+function insertAt(siblings, node, index) {
+    const at = index === undefined ? siblings.length : clamp(index, 0, siblings.length);
+    siblings.splice(at, 0, node);
+    return siblings;
+}
+/** Rebuild the tree, replacing the children array of the node with id === targetId. */
+function mapInto(tree, targetId, transform) {
+    return tree.map((node) => {
+        if (node.id === targetId) {
+            return { ...node, children: transform(node.children ?? []) };
+        }
+        if (node.children) {
+            return { ...node, children: mapInto(node.children, targetId, transform) };
+        }
+        return node;
+    });
+}
+function descendantIds(node) {
+    const ids = new Set();
+    walk(node.children ?? [], (n) => {
+        ids.add(n.id);
+    });
+    return ids;
+}
+function clamp(n, lo, hi) {
+    return Math.max(lo, Math.min(hi, n));
+}
+//# sourceMappingURL=index.js.map

package/dist/mutate/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/mutate/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,sBAAsB,CAAC;AAGtD,MAAM,OAAO,gBAAiB,SAAQ,KAAK;IACI;IAA7C,YAAY,OAAe,EAAkB,IAAqB;QAChE,KAAK,CAAC,OAAO,CAAC,CAAC;QAD4B,SAAI,GAAJ,IAAI,CAAiB;QAEhE,IAAI,CAAC,IAAI,GAAG,kBAAkB,CAAC;IACjC,CAAC;CACF;AAgBD,oFAAoF;AACpF,MAAM,UAAU,UAAU,CAAC,IAAa,EAAE,IAAa,EAAE,UAAyB,EAAE;IAClF,IAAI,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;QAC5B,MAAM,IAAI,gBAAgB,CAAC,SAAS,IAAI,CAAC,EAAE,mBAAmB,EAAE,cAAc,CAAC,CAAC;IAClF,CAAC;IACD,MAAM,EAAE,QAAQ,GAAG,IAAI,EAAE,KAAK,EAAE,GAAG,OAAO,CAAC;IAE3C,IAAI,QAAQ,KAAK,IAAI,EAAE,CAAC;QACtB,OAAO,QAAQ,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;IAC1C,CAAC;IACD,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC;QAC9B,MAAM,IAAI,gBAAgB,CAAC,WAAW,QAAQ,cAAc,EAAE,kBAAkB,CAAC,CAAC;IACpF,CAAC;IACD,OAAO,OAAO,CAAC,IAAI,EAAE,QAAQ,EAAE,CAAC,QAAQ,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,GAAG,QAAQ,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;AACrF,CAAC;AAED,sEAAsE;AACtE,MAAM,UAAU,UAAU,CAAC,IAAa,EAAE,EAAU;IAClD,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,gBAAgB,CAAC,SAAS,EAAE,cAAc,EAAE,gBAAgB,CAAC,CAAC;IAC1E,CAAC;IACD,MAAM,KAAK,GAAG,CAAC,KAAyB,EAAa,EAAE,CACrD,KAAK;SACF,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC;SAC1B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAE,EAAE,GAAG,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvF,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC;AACrB,CAAC;AASD,2EAA2E;AAC3E,MAAM,UAAU,QAAQ,CAAC,IAAa,EAAE,EAAU,EAAE,UAAuB,EAAE;IAC3E,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IAChC,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,MAAM,IAAI,gBAAgB,CAAC,SAAS,EAAE,cAAc,EAAE,gBAAgB,CAAC,CAAC;IAC1E,CAAC;IACD,MAAM,EAAE,QAAQ,GAAG,IAAI,EAAE,KAAK,EAAE,GAAG,OAAO,CAAC;IAE3C,IAAI,QAAQ,KAAK,IAAI,EAAE,CAAC;QACtB,IAAI,QAAQ,KAAK,EAAE,EAAE,CAAC;YACpB,MAAM,IAAI,gBAAgB,CAAC,qBAAqB,EAAE,gBAAgB,EAAE,OAAO,CAAC,CAAC;QAC/E,CAAC;QACD,IAAI,aAAa,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YACtC,MAAM,IAAI,gBAAgB,CAAC,qBAAqB,EAAE,8BAA8B,QAAQ,IAAI,EAAE,OAAO,CAAC,CAAC;QACzG,CAAC;QACD,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC;YAC9B,MAAM,IAAI,gBAAgB,CAAC,WAAW,QAAQ,cAAc,EAAE,kBAAkB,CAAC,CAAC;QACpF,CAAC;IACH,CAAC;IAED,MAAM,QAAQ,GAAG,UAAU,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IACtC,OAAO,UAAU,CAAC,QAAQ,EAAE,IAAI,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;AACzD,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAAC,IAAa,EAAE,QAAuB,EAAE,UAA6B;IACnG,MAAM,KAAK,GAAG,CAAC,QAA4B,EAAa,EAAE;QACxD,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACrD,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;YAC7B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACnB,MAAM,IAAI,gBAAgB,CAAC,oBAAoB,GAAG,wBAAwB,QAAQ,IAAI,QAAQ,IAAI,EAAE,gBAAgB,CAAC,CAAC;YACxH,CAAC;QACH,CAAC;QACD,MAAM,OAAO,GAAG;YACd,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;YAC1C,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;SACtD,CAAC;QACF,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,CAAY,CAAC,CAAC;IACxE,CAAC,CAAC;IAEF,IAAI,QAAQ,KAAK,IAAI,EAAE,CAAC;QACtB,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC;IACrB,CAAC;IACD,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC;QAC9B,MAAM,IAAI,gBAAgB,CAAC,WAAW,QAAQ,cAAc,EAAE,kBAAkB,CAAC,CAAC;IACpF,CAAC;IACD,OAAO,OAAO,CAAC,IAAI,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;AACxC,CAAC;AAED,gFAAgF;AAChF,iFAAiF;AACjF,gFAAgF;AAEhF,SAAS,QAAQ,CAAC,QAAmB,EAAE,IAAa,EAAE,KAAc;IAClE,MAAM,EAAE,GAAG,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC;IACpF,QAAQ,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;IAC7B,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,uFAAuF;AACvF,SAAS,OAAO,CACd,IAAa,EACb,QAAgB,EAChB,SAAsD;IAEtD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;QACvB,IAAI,IAAI,CAAC,EAAE,KAAK,QAAQ,EAAE,CAAC;YACzB,OAAO,EAAE,GAAG,IAAI,EAAE,QAAQ,EAAE,SAAS,CAAC,IAAI,CAAC,QAAQ,IAAI,EAAE,CAAC,EAAa,CAAC;QAC1E,CAAC;QACD,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,OAAO,EAAE,GAAG,IAAI,EAAE,QAAQ,EAAE,OAAO,CAAC,IAAI,CAAC,QAAQ,EAAE,QAAQ,EAAE,SAAS,CAAC,EAAa,CAAC;QACvF,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC,CAAC,CAAC;AACL,CAAC;AAED,SAAS,aAAa,CAAC,IAAa;IAClC,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,IAAI,CAAC,IAAI,CAAC,QAAQ,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE;QAC9B,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAChB,CAAC,CAAC,CAAC;IACH,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,KAAK,CAAC,CAAS,EAAE,EAAU,EAAE,EAAU;IAC9C,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;AACvC,CAAC"}

package/dist/resolve/index.d.ts

@@ -0,0 +1,105 @@
+/**
+ * @blogmcp/nav-core — resolve (auto-build + override merge)
+ *
+ * The heart of the "one resolved tree, never two" design (navigation-model.md §2/§4):
+ *
+ *   resolved = applyOverrides( buildDefaultTree(currentContent), curatedOverrides )
+ *
+ * `buildDefaultTree` is recomputed from the CURRENT published content on every
+ * resolve, so it is never stale: a new article appears automatically, a deleted
+ * one disappears, and an override that targets a now-absent node is simply
+ * skipped (non-fatal). The curated overrides (`doc` in `kb_navigation`) store
+ * only deviations — never the flattened tree.
+ *
+ * Pure: no I/O. The consumer (KB API service) supplies the content index from SQL
+ * and persists the overrides; this module just transforms data → tree.
+ *
+ * v1 auto-build policy: group published articles by their primary tag (first tag
+ * by slug); untagged articles land in an "Unfiled" group. `frontmatter`-based
+ * parent/order is intentionally NOT used (that column is legacy/empty in the KB).
+ */
+import type { Locale, LocaleLabels, NavData, NavNode, NavTree } from '../types/index.js';
+import type { BadgeSpec } from '../types/index.js';
+export interface ContentLocaleMeta {
+    readonly title: string;
+    readonly description?: string;
+}
+/** One published article, as needed to auto-build the default tree. */
+export interface ContentItem {
+    /** kb_articles.id */
+    readonly id: string;
+    /** Public URL handle (filename without extension). */
+    readonly slug?: string;
+    /** Tag slugs. */
+    readonly tags: readonly string[];
+    /** Per-locale title/description. */
+    readonly locales: Readonly<Record<Locale, ContentLocaleMeta>>;
+    /** Source language code (fallback locale for this item). */
+    readonly sourceLocale: Locale;
+    /** ISO timestamp, used as a secondary sort key. */
+    readonly updatedAt?: string;
+}
+export interface BuildOptions {
+    readonly nodeIdPrefix?: string;
+    readonly groupIdPrefix?: string;
+    readonly unfiledGroupId?: string;
+    readonly unfiledLabel?: string;
+    /** Per-tag display labels (e.g. from kb_tags). Falls back to the tag slug. */
+    readonly tagLabels?: Readonly<Record<string, LocaleLabels>>;
+    /** Choose an item's primary tag. Default: first tag by slug ascending. */
+    readonly primaryTag?: (item: ContentItem) => string | undefined;
+}
+/**
+ * Build the default navigation tree from the current published content.
+ * Deterministic: groups sorted by tag slug (Unfiled last), articles sorted by
+ * source-locale title then updatedAt. Labels are baked from content so the tree
+ * is self-contained; overrides may relabel.
+ */
+export declare function buildDefaultTree(items: readonly ContentItem[], options?: BuildOptions): NavNode[];
+/** A per-node deviation from the auto-built tree. */
+export interface NodePatch {
+    /** Move under a new parent (null = root). */
+    readonly parentId?: string | null;
+    readonly order?: number;
+    readonly hidden?: boolean;
+    /** Merged over the node's existing labels. */
+    readonly labels?: LocaleLabels;
+    readonly badge?: BadgeSpec;
+    readonly icon?: string;
+    /** group only. */
+    readonly collapsed?: boolean;
+    /** article-ref only. */
+    readonly owned?: boolean;
+    /** Merged over the node's existing data bag. */
+    readonly data?: NavData;
+    /** Drop this node (and its subtree) from the menu. */
+    readonly removed?: boolean;
+}
+/** A hand-authored node not derivable from content (external link, custom group, separator…). */
+export interface PlacedNode {
+    readonly node: NavNode;
+    readonly parentId?: string | null;
+    readonly index?: number;
+}
+/** The curated overrides document persisted in `kb_navigation.doc`. */
+export interface NavOverrides {
+    readonly patches?: Readonly<Record<string, NodePatch>>;
+    readonly extra?: readonly PlacedNode[];
+}
+/**
+ * Apply curated overrides to a freshly auto-built tree. Order of operations:
+ * extra inserts → field patches + removals → moves → sort. Targets that no
+ * longer exist (e.g. an unpublished article) are skipped — the resolved tree
+ * always reflects current content.
+ *
+ * Extra (hand-authored) nodes are inserted FIRST so that field patches and
+ * removals below apply to them uniformly: an external link or custom group can
+ * be relabeled, hidden, reordered, or removed via the same `patches` mechanism
+ * as an auto-built node. (Previously inserts ran after patching, so any patch
+ * targeting a placed node — including `removed` — was silently a no-op.)
+ */
+export declare function applyOverrides(autoTree: NavTree, overrides?: NavOverrides): NavNode[];
+/** Convenience: build + apply in one call. */
+export declare function resolve(items: readonly ContentItem[], overrides?: NavOverrides, buildOptions?: BuildOptions): NavNode[];
+/** Sorted union of locales present across the content index. */
+export declare function collectLocales(items: readonly ContentItem[]): Locale[];

package/dist/resolve/index.js

@@ -0,0 +1,217 @@
+/**
+ * @blogmcp/nav-core — resolve (auto-build + override merge)
+ *
+ * The heart of the "one resolved tree, never two" design (navigation-model.md §2/§4):
+ *
+ *   resolved = applyOverrides( buildDefaultTree(currentContent), curatedOverrides )
+ *
+ * `buildDefaultTree` is recomputed from the CURRENT published content on every
+ * resolve, so it is never stale: a new article appears automatically, a deleted
+ * one disappears, and an override that targets a now-absent node is simply
+ * skipped (non-fatal). The curated overrides (`doc` in `kb_navigation`) store
+ * only deviations — never the flattened tree.
+ *
+ * Pure: no I/O. The consumer (KB API service) supplies the content index from SQL
+ * and persists the overrides; this module just transforms data → tree.
+ *
+ * v1 auto-build policy: group published articles by their primary tag (first tag
+ * by slug); untagged articles land in an "Unfiled" group. `frontmatter`-based
+ * parent/order is intentionally NOT used (that column is legacy/empty in the KB).
+ */
+import { findNode, sortTree } from '../traverse/index.js';
+import { insertNode, moveNode } from '../mutate/index.js';
+const DEFAULTS = {
+    nodeIdPrefix: 'auto:',
+    groupIdPrefix: 'auto:group:',
+    unfiledLabel: 'Unfiled',
+};
+/**
+ * Build the default navigation tree from the current published content.
+ * Deterministic: groups sorted by tag slug (Unfiled last), articles sorted by
+ * source-locale title then updatedAt. Labels are baked from content so the tree
+ * is self-contained; overrides may relabel.
+ */
+export function buildDefaultTree(items, options = {}) {
+    const nodeIdPrefix = options.nodeIdPrefix ?? DEFAULTS.nodeIdPrefix;
+    const groupIdPrefix = options.groupIdPrefix ?? DEFAULTS.groupIdPrefix;
+    const unfiledGroupId = options.unfiledGroupId ?? `${groupIdPrefix}unfiled`;
+    const unfiledLabel = options.unfiledLabel ?? DEFAULTS.unfiledLabel;
+    const pickPrimary = options.primaryTag ?? defaultPrimaryTag;
+    const allLocales = collectLocales(items);
+    // bucket items by primary tag ('' = unfiled)
+    const buckets = new Map();
+    for (const item of items) {
+        const key = pickPrimary(item) ?? '';
+        const bucket = buckets.get(key);
+        if (bucket)
+            bucket.push(item);
+        else
+            buckets.set(key, [item]);
+    }
+    const tagKeys = [...buckets.keys()].filter((k) => k !== '').sort();
+    const orderedKeys = buckets.has('') ? [...tagKeys, ''] : tagKeys;
+    return orderedKeys.map((key, groupIndex) => {
+        const isUnfiled = key === '';
+        const groupId = isUnfiled ? unfiledGroupId : `${groupIdPrefix}${key}`;
+        const labels = isUnfiled
+            ? labelsForAll(allLocales, unfiledLabel)
+            : (options.tagLabels?.[key] ?? labelsForAll(allLocales, key));
+        const children = sortItems(buckets.get(key)).map((item, i) => ({
+            id: `${nodeIdPrefix}${item.id}`,
+            type: 'article-ref',
+            ref: item.id,
+            slug: item.slug,
+            owned: true,
+            order: i,
+            labels: articleLabels(item),
+        }));
+        return {
+            id: groupId,
+            type: 'group',
+            order: groupIndex,
+            labels,
+            collapsible: true,
+            data: { auto: true, tag: isUnfiled ? null : key },
+            children,
+        };
+    });
+}
+/**
+ * Apply curated overrides to a freshly auto-built tree. Order of operations:
+ * extra inserts → field patches + removals → moves → sort. Targets that no
+ * longer exist (e.g. an unpublished article) are skipped — the resolved tree
+ * always reflects current content.
+ *
+ * Extra (hand-authored) nodes are inserted FIRST so that field patches and
+ * removals below apply to them uniformly: an external link or custom group can
+ * be relabeled, hidden, reordered, or removed via the same `patches` mechanism
+ * as an auto-built node. (Previously inserts ran after patching, so any patch
+ * targeting a placed node — including `removed` — was silently a no-op.)
+ */
+export function applyOverrides(autoTree, overrides = {}) {
+    const patches = overrides.patches ?? {};
+    const extra = overrides.extra ?? [];
+    // 1. extra inserts. A placed `article-ref` (a cross-listed internal link) is
+    //    skipped when its target article is no longer a live auto node — deleted,
+    //    unpublished, or not visible at this access tier — so cross-listed links
+    //    never dangle, the same "never stale" guarantee the auto nodes get.
+    const liveRefs = collectArticleRefs(autoTree);
+    let tree = [...autoTree];
+    for (const placed of extra) {
+        if (placed.node.type === 'article-ref' && !liveRefs.has(placed.node.ref))
+            continue;
+        if (findNode(tree, placed.node.id))
+            continue;
+        if (placed.parentId != null && !findNode(tree, placed.parentId))
+            continue;
+        tree = insertNode(tree, placed.node, { parentId: placed.parentId ?? null, index: placed.index });
+    }
+    // 2. field patches + removals (recursive, immutable) over the combined tree
+    const patchNode = (node) => {
+        const patch = patches[node.id];
+        if (patch?.removed)
+            return null;
+        let next = patch ? applyFieldPatch(node, patch) : node;
+        if (next.children && next.children.length > 0) {
+            const kids = next.children
+                .map(patchNode)
+                .filter((n) => n !== null);
+            next = { ...next, children: kids };
+        }
+        return next;
+    };
+    tree = tree.map(patchNode).filter((n) => n !== null);
+    // 3. moves (parentId in a patch). Skip absent targets/parents; ignore cycles.
+    for (const [id, patch] of Object.entries(patches)) {
+        if (patch.parentId === undefined)
+            continue;
+        if (!findNode(tree, id))
+            continue;
+        if (patch.parentId !== null && !findNode(tree, patch.parentId))
+            continue;
+        try {
+            tree = moveNode(tree, id, { parentId: patch.parentId });
+        }
+        catch {
+            // cycle / invalid move → leave node where it is (non-fatal)
+        }
+    }
+    // 4. canonical display order
+    return sortTree(tree);
+}
+/** Convenience: build + apply in one call. */
+export function resolve(items, overrides = {}, buildOptions = {}) {
+    return applyOverrides(buildDefaultTree(items, buildOptions), overrides);
+}
+/* -------------------------------------------------------------------------- */
+/* helpers                                                                     */
+/* -------------------------------------------------------------------------- */
+function defaultPrimaryTag(item) {
+    if (item.tags.length === 0)
+        return undefined;
+    return [...item.tags].sort()[0];
+}
+/** Article ids that have a live node in the auto-built tree (for prune checks). */
+function collectArticleRefs(tree) {
+    const refs = new Set();
+    const walk = (nodes) => {
+        for (const n of nodes) {
+            if (n.type === 'article-ref')
+                refs.add(n.ref);
+            if (n.children)
+                walk(n.children);
+        }
+    };
+    walk(tree);
+    return refs;
+}
+/** Sorted union of locales present across the content index. */
+export function collectLocales(items) {
+    const set = new Set();
+    for (const item of items) {
+        for (const locale of Object.keys(item.locales))
+            set.add(locale);
+    }
+    return [...set].sort();
+}
+function labelsForAll(locales, text) {
+    return Object.fromEntries(locales.map((l) => [l, text]));
+}
+function articleLabels(item) {
+    const out = {};
+    for (const [locale, meta] of Object.entries(item.locales)) {
+        out[locale] = meta.title;
+    }
+    return out;
+}
+function sortItems(items) {
+    return [...items].sort((a, b) => {
+        const ta = a.locales[a.sourceLocale]?.title ?? '';
+        const tb = b.locales[b.sourceLocale]?.title ?? '';
+        const byTitle = ta.localeCompare(tb);
+        if (byTitle !== 0)
+            return byTitle;
+        return (b.updatedAt ?? '').localeCompare(a.updatedAt ?? '');
+    });
+}
+function applyFieldPatch(node, patch) {
+    const next = { ...node };
+    if (patch.order !== undefined)
+        next.order = patch.order;
+    if (patch.hidden !== undefined)
+        next.hidden = patch.hidden;
+    if (patch.labels)
+        next.labels = { ...(node.labels ?? {}), ...patch.labels };
+    if (patch.badge !== undefined)
+        next.badge = patch.badge;
+    if (patch.icon !== undefined)
+        next.icon = patch.icon;
+    if (patch.data)
+        next.data = { ...(node.data ?? {}), ...patch.data };
+    if (patch.collapsed !== undefined && node.type === 'group')
+        next.collapsed = patch.collapsed;
+    if (patch.owned !== undefined && node.type === 'article-ref')
+        next.owned = patch.owned;
+    return next;
+}
+//# sourceMappingURL=index.js.map

package/dist/resolve/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/resolve/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AAC1D,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAc,MAAM,oBAAoB,CAAC;AAgDtE,MAAM,QAAQ,GAAG;IACf,YAAY,EAAE,OAAO;IACrB,aAAa,EAAE,aAAa;IAC5B,YAAY,EAAE,SAAS;CACf,CAAC;AAEX;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAA6B,EAAE,UAAwB,EAAE;IACxF,MAAM,YAAY,GAAG,OAAO,CAAC,YAAY,IAAI,QAAQ,CAAC,YAAY,CAAC;IACnE,MAAM,aAAa,GAAG,OAAO,CAAC,aAAa,IAAI,QAAQ,CAAC,aAAa,CAAC;IACtE,MAAM,cAAc,GAAG,OAAO,CAAC,cAAc,IAAI,GAAG,aAAa,SAAS,CAAC;IAC3E,MAAM,YAAY,GAAG,OAAO,CAAC,YAAY,IAAI,QAAQ,CAAC,YAAY,CAAC;IACnE,MAAM,WAAW,GAAG,OAAO,CAAC,UAAU,IAAI,iBAAiB,CAAC;IAE5D,MAAM,UAAU,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;IAEzC,6CAA6C;IAC7C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAyB,CAAC;IACjD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,GAAG,GAAG,WAAW,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QACpC,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAChC,IAAI,MAAM;YAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;YACzB,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;IAChC,CAAC;IAED,MAAM,OAAO,GAAG,CAAC,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;IACnE,MAAM,WAAW,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;IAEjE,OAAO,WAAW,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,UAAU,EAAa,EAAE;QACpD,MAAM,SAAS,GAAG,GAAG,KAAK,EAAE,CAAC;QAC7B,MAAM,OAAO,GAAG,SAAS,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,GAAG,aAAa,GAAG,GAAG,EAAE,CAAC;QACtE,MAAM,MAAM,GAAG,SAAS;YACtB,CAAC,CAAC,YAAY,CAAC,UAAU,EAAE,YAAY,CAAC;YACxC,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC,GAAG,CAAC,IAAI,YAAY,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC,CAAC;QAEhE,MAAM,QAAQ,GAAG,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAkB,EAAE,CAAC,CAAC;YAC9E,EAAE,EAAE,GAAG,YAAY,GAAG,IAAI,CAAC,EAAE,EAAE;YAC/B,IAAI,EAAE,aAAa;YACnB,GAAG,EAAE,IAAI,CAAC,EAAE;YACZ,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,KAAK,EAAE,IAAI;YACX,KAAK,EAAE,CAAC;YACR,MAAM,EAAE,aAAa,CAAC,IAAI,CAAC;SAC5B,CAAC,CAAC,CAAC;QAEJ,OAAO;YACL,EAAE,EAAE,OAAO;YACX,IAAI,EAAE,OAAO;YACb,KAAK,EAAE,UAAU;YACjB,MAAM;YACN,WAAW,EAAE,IAAI;YACjB,IAAI,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,EAAE;YACjD,QAAQ;SACT,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC;AAuCD;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,cAAc,CAAC,QAAiB,EAAE,YAA0B,EAAE;IAC5E,MAAM,OAAO,GAAG,SAAS,CAAC,OAAO,IAAI,EAAE,CAAC;IACxC,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,IAAI,EAAE,CAAC;IAEpC,6EAA6E;IAC7E,8EAA8E;IAC9E,6EAA6E;IAC7E,wEAAwE;IACxE,MAAM,QAAQ,GAAG,kBAAkB,CAAC,QAAQ,CAAC,CAAC;IAC9C,IAAI,IAAI,GAAc,CAAC,GAAG,QAAQ,CAAC,CAAC;IACpC,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;QAC3B,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,KAAK,aAAa,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC;YAAE,SAAS;QACnF,IAAI,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;YAAE,SAAS;QAC7C,IAAI,MAAM,CAAC,QAAQ,IAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,QAAQ,CAAC;YAAE,SAAS;QAC1E,IAAI,GAAG,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,EAAE,QAAQ,EAAE,MAAM,CAAC,QAAQ,IAAI,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC;IACnG,CAAC;IAED,4EAA4E;IAC5E,MAAM,SAAS,GAAG,CAAC,IAAa,EAAkB,EAAE;QAClD,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAI,KAAK,EAAE,OAAO;YAAE,OAAO,IAAI,CAAC;QAChC,IAAI,IAAI,GAAY,KAAK,CAAC,CAAC,CAAC,eAAe,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAChE,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC9C,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ;iBACvB,GAAG,CAAC,SAAS,CAAC;iBACd,MAAM,CAAC,CAAC,CAAC,EAAgB,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;YAC3C,IAAI,GAAG,EAAE,GAAG,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAa,CAAC;QAChD,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC,CAAC;IACF,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAgB,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;IAEnE,8EAA8E;IAC9E,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;QAClD,IAAI,KAAK,CAAC,QAAQ,KAAK,SAAS;YAAE,SAAS;QAC3C,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC;YAAE,SAAS;QAClC,IAAI,KAAK,CAAC,QAAQ,KAAK,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,QAAQ,CAAC;YAAE,SAAS;QACzE,IAAI,CAAC;YACH,IAAI,GAAG,QAAQ,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC;QAC1D,CAAC;QAAC,MAAM,CAAC;YACP,4DAA4D;QAC9D,CAAC;IACH,CAAC;IAED,6BAA6B;IAC7B,OAAO,QAAQ,CAAC,IAAI,CAAC,CAAC;AACxB,CAAC;AAED,8CAA8C;AAC9C,MAAM,UAAU,OAAO,CACrB,KAA6B,EAC7B,YAA0B,EAAE,EAC5B,eAA6B,EAAE;IAE/B,OAAO,cAAc,CAAC,gBAAgB,CAAC,KAAK,EAAE,YAAY,CAAC,EAAE,SAAS,CAAC,CAAC;AAC1E,CAAC;AAED,gFAAgF;AAChF,iFAAiF;AACjF,gFAAgF;AAEhF,SAAS,iBAAiB,CAAC,IAAiB;IAC1C,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IAC7C,OAAO,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;AAClC,CAAC;AAED,mFAAmF;AACnF,SAAS,kBAAkB,CAAC,IAAa;IACvC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,IAAI,GAAG,CAAC,KAAyB,EAAQ,EAAE;QAC/C,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,IAAI,CAAC,CAAC,IAAI,KAAK,aAAa;gBAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAC9C,IAAI,CAAC,CAAC,QAAQ;gBAAE,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;QACnC,CAAC;IACH,CAAC,CAAC;IACF,IAAI,CAAC,IAAI,CAAC,CAAC;IACX,OAAO,IAAI,CAAC;AACd,CAAC;AAED,gEAAgE;AAChE,MAAM,UAAU,cAAc,CAAC,KAA6B;IAC1D,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC;YAAE,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAClE,CAAC;IACD,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;AACzB,CAAC;AAED,SAAS,YAAY,CAAC,OAA0B,EAAE,IAAY;IAC5D,OAAO,MAAM,CAAC,WAAW,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;AAC3D,CAAC;AAED,SAAS,aAAa,CAAC,IAAiB;IACtC,MAAM,GAAG,GAA2B,EAAE,CAAC;IACvC,KAAK,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;QAC1D,GAAG,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC;IAC3B,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,SAAS,CAAC,KAAoB;IACrC,OAAO,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC9B,MAAM,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,YAAY,CAAC,EAAE,KAAK,IAAI,EAAE,CAAC;QAClD,MAAM,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,YAAY,CAAC,EAAE,KAAK,IAAI,EAAE,CAAC;QAClD,MAAM,OAAO,GAAG,EAAE,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;QACrC,IAAI,OAAO,KAAK,CAAC;YAAE,OAAO,OAAO,CAAC;QAClC,OAAO,CAAC,CAAC,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC;IAC9D,CAAC,CAAC,CAAC;AACL,CAAC;AAED,SAAS,eAAe,CAAC,IAAa,EAAE,KAAgB;IACtD,MAAM,IAAI,GAA4B,EAAE,GAAG,IAAI,EAAE,CAAC;IAClD,IAAI,KAAK,CAAC,KAAK,KAAK,SAAS;QAAE,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;IACxD,IAAI,KAAK,CAAC,MAAM,KAAK,SAAS;QAAE,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAC3D,IAAI,KAAK,CAAC,MAAM;QAAE,IAAI,CAAC,MAAM,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,MAAM,IAAI,EAAE,CAAC,EAAE,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;IAC5E,IAAI,KAAK,CAAC,KAAK,KAAK,SAAS;QAAE,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;IACxD,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS;QAAE,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;IACrD,IAAI,KAAK,CAAC,IAAI;QAAE,IAAI,CAAC,IAAI,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;IACpE,IAAI,KAAK,CAAC,SAAS,KAAK,SAAS,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO;QAAE,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC,SAAS,CAAC;IAC7F,IAAI,KAAK,CAAC,KAAK,KAAK,SAAS,IAAI,IAAI,CAAC,IAAI,KAAK,aAAa;QAAE,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;IACvF,OAAO,IAA0B,CAAC;AACpC,CAAC"}