@unbrained/pm-cli 2026.7.14 → 2026.7.16

package/dist/sdk/relationships.js

@@ -0,0 +1,551 @@
+
+!function(){try{var e="undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof globalThis?globalThis:"undefined"!=typeof self?self:{},n=(new e.Error).stack;n&&(e._sentryDebugIds=e._sentryDebugIds||{},e._sentryDebugIds[n]="f5e9e0a6-4550-5e55-9fef-ee54ec06a495")}catch(e){}}();
+const BUILTIN_RELATIONSHIP_KINDS = [
+    {
+        kind: "blocked_by",
+        direction: "directed",
+        inverse: "blocks",
+        ordering: true,
+        precedence: "target_before_source",
+        hierarchy: false,
+        outgoing: "many",
+        incoming: "many",
+        lifecycle: "persistent",
+        aliases: ["depends_on"],
+        compatibilityVersion: 1,
+        allowSelf: false,
+    },
+    {
+        kind: "blocks",
+        direction: "directed",
+        inverse: "blocked_by",
+        ordering: true,
+        precedence: "source_before_target",
+        hierarchy: false,
+        outgoing: "many",
+        incoming: "many",
+        lifecycle: "persistent",
+        compatibilityVersion: 1,
+        allowSelf: false,
+    },
+    {
+        kind: "parent",
+        direction: "directed",
+        inverse: "child",
+        ordering: false,
+        hierarchy: true,
+        hierarchyDirection: "target_parent",
+        outgoing: "one",
+        incoming: "many",
+        lifecycle: "supersedable",
+        aliases: ["child_of", "epic"],
+        compatibilityVersion: 1,
+        allowSelf: false,
+    },
+    {
+        kind: "child",
+        direction: "directed",
+        inverse: "parent",
+        ordering: false,
+        hierarchy: true,
+        hierarchyDirection: "source_parent",
+        outgoing: "many",
+        incoming: "one",
+        lifecycle: "supersedable",
+        aliases: ["parent_child", "task"],
+        compatibilityVersion: 1,
+        allowSelf: false,
+    },
+    {
+        kind: "related",
+        direction: "undirected",
+        ordering: false,
+        hierarchy: false,
+        outgoing: "many",
+        incoming: "many",
+        lifecycle: "persistent",
+        aliases: ["related_to"],
+        compatibilityVersion: 1,
+        allowSelf: false,
+    },
+    {
+        kind: "discovered_from",
+        direction: "directed",
+        ordering: false,
+        hierarchy: false,
+        outgoing: "many",
+        incoming: "many",
+        lifecycle: "persistent",
+        compatibilityVersion: 1,
+        allowSelf: false,
+    },
+    {
+        kind: "incident_from",
+        direction: "directed",
+        ordering: false,
+        hierarchy: false,
+        outgoing: "many",
+        incoming: "many",
+        lifecycle: "persistent",
+        compatibilityVersion: 1,
+        allowSelf: false,
+    },
+    {
+        kind: "supersedes",
+        direction: "directed",
+        ordering: false,
+        hierarchy: false,
+        outgoing: "many",
+        incoming: "many",
+        lifecycle: "supersedable",
+        compatibilityVersion: 1,
+        allowSelf: false,
+    },
+];
+function normalizeKind(kind) {
+    return kind.trim().toLowerCase().replaceAll("-", "_");
+}
+function normalizeInverseKind(inverse) {
+    if (inverse === undefined)
+        return undefined;
+    const normalized = normalizeKind(inverse);
+    if (!/^[a-z][a-z0-9_]*$/.test(normalized))
+        throw new TypeError(`Invalid inverse relationship kind: ${inverse}`);
+    return normalized;
+}
+function freezeValue(value, visited = new Set()) {
+    if (value === null || typeof value !== "object")
+        return value;
+    if (visited.has(value))
+        return value;
+    visited.add(value);
+    if (Array.isArray(value)) {
+        for (const entry of value)
+            freezeValue(entry, visited);
+        return Object.freeze(value);
+    }
+    for (const entry of Object.values(value))
+        freezeValue(entry, visited);
+    return Object.freeze(value);
+}
+function assertRelationshipPrecedence(definition, kind) {
+    if (definition.precedence !== undefined &&
+        definition.precedence !== "source_before_target" &&
+        definition.precedence !== "target_before_source")
+        throw new TypeError(`Invalid relationship precedence for ${kind}`);
+    if (!definition.ordering && definition.precedence !== undefined)
+        throw new TypeError(`Non-ordering relationship kind cannot declare precedence: ${kind}`);
+}
+function assertRelationshipHierarchyDirection(definition, kind) {
+    if (definition.hierarchyDirection !== undefined &&
+        definition.hierarchyDirection !== "source_parent" &&
+        definition.hierarchyDirection !== "target_parent")
+        throw new TypeError(`Invalid relationship hierarchy direction for ${kind}`);
+    if (!definition.hierarchy && definition.hierarchyDirection !== undefined)
+        throw new TypeError(`Non-hierarchy relationship kind cannot declare hierarchy direction: ${kind}`);
+}
+/** Mutable registry with immutable snapshots and collision-safe extension registration. */
+export class RelationshipKindRegistry {
+    #definitions = new Map();
+    #aliases = new Map();
+    /** Create a registry initialized with the stable built-in ontology by default. */
+    constructor(definitions = BUILTIN_RELATIONSHIP_KINDS) {
+        for (const definition of definitions)
+            this.register(definition);
+    }
+    /** Register one definition after validating its identifier, version, and aliases. */
+    register(definition) {
+        const kind = normalizeKind(definition.kind);
+        if (!/^[a-z][a-z0-9_]*$/.test(kind))
+            throw new TypeError(`Invalid relationship kind: ${definition.kind}`);
+        if (!Number.isInteger(definition.compatibilityVersion) ||
+            definition.compatibilityVersion < 1)
+            throw new TypeError(`Invalid compatibility version for ${kind}`);
+        assertRelationshipPrecedence(definition, kind);
+        assertRelationshipHierarchyDirection(definition, kind);
+        if (this.#definitions.has(kind) || this.#aliases.has(kind))
+            throw new TypeError(`Relationship kind already registered: ${kind}`);
+        const inverse = normalizeInverseKind(definition.inverse);
+        const aliases = [
+            ...new Set((definition.aliases ?? []).map(normalizeKind)),
+        ].sort();
+        for (const alias of aliases) {
+            if (!/^[a-z][a-z0-9_]*$/.test(alias))
+                throw new TypeError(`Invalid relationship alias: ${alias}`);
+            if (alias === kind ||
+                this.#definitions.has(alias) ||
+                this.#aliases.has(alias))
+                throw new TypeError(`Relationship alias already registered: ${alias}`);
+        }
+        const normalized = Object.freeze({
+            ...definition,
+            kind,
+            inverse,
+            aliases: Object.freeze(aliases),
+            payloadSchema: definition.payloadSchema
+                ? freezeValue(structuredClone(definition.payloadSchema))
+                : undefined,
+        });
+        this.#definitions.set(kind, normalized);
+        for (const alias of aliases)
+            this.#aliases.set(alias, kind);
+        return this;
+    }
+    /** Resolve a canonical kind or compatibility alias. */
+    resolve(kind) {
+        if (typeof kind !== "string")
+            return undefined;
+        const normalized = normalizeKind(kind);
+        return this.#definitions.get(this.#aliases.get(normalized) ?? normalized);
+    }
+    /** Resolve a kind or throw a precise error suitable for command adapters. */
+    require(kind) {
+        const definition = this.resolve(kind);
+        if (!definition)
+            throw new TypeError(`Unknown relationship kind: ${kind}`);
+        return definition;
+    }
+    /** Return a deterministic immutable registry snapshot. */
+    list() {
+        return Object.freeze([...this.#definitions.values()].sort((left, right) => left.kind.localeCompare(right.kind)));
+    }
+}
+/** Create a registry containing the built-in relationship ontology. */
+export function createRelationshipKindRegistry() {
+    return new RelationshipKindRegistry();
+}
+const defaultRegistry = createRelationshipKindRegistry();
+/** Report whether a kind participates in execution-order cycle detection. */
+export function isOrderingRelationshipKind(kind, registry = defaultRegistry) {
+    return registry.resolve(kind)?.ordering === true;
+}
+function compareEdges(left, right) {
+    return (left.source.localeCompare(right.source) ||
+        left.target.localeCompare(right.target) ||
+        left.kind.localeCompare(right.kind));
+}
+function normalizeRelationshipEdge(candidate, nodes, registry) {
+    const source = typeof candidate.source === "string" ? candidate.source.trim() : "";
+    const target = typeof candidate.target === "string" ? candidate.target.trim() : "";
+    const definition = registry.require(candidate.kind);
+    if (!nodes.has(source) || !nodes.has(target))
+        throw new TypeError(`Relationship endpoint not found: ${source} -> ${target}`);
+    if (source === target && !definition.allowSelf)
+        throw new TypeError(`Self relationship is not allowed for ${definition.kind}`);
+    const edge = Object.freeze({
+        ...candidate,
+        source,
+        target,
+        kind: definition.kind,
+    });
+    const endpoints = definition.direction === "undirected"
+        ? [source, target].sort().join("\u0000")
+        : `${source}\u0000${target}`;
+    return { edge, identity: `${definition.kind}\u0000${endpoints}` };
+}
+function appendIndexedEdge(index, node, edge) {
+    const indexed = index.get(node);
+    if (indexed)
+        indexed.push(edge);
+    else
+        index.set(node, [edge]);
+}
+function normalizeNodeId(value) {
+    return typeof value === "string" ? value.trim() : "";
+}
+function resolveExistingNodeId(value, ids) {
+    const id = normalizeNodeId(value);
+    return id && ids.has(id) ? id : undefined;
+}
+function reconstructPath(source, target, parents) {
+    const path = [target];
+    let cursor = target;
+    while (cursor !== source) {
+        cursor = parents.get(cursor);
+        path.push(cursor);
+    }
+    return path.reverse();
+}
+/** Build an immutable, deterministic in-memory relationship index. */
+export class RelationshipGraph {
+    #registry;
+    #nodes;
+    #nodeSnapshot;
+    #edges;
+    #outgoing = new Map();
+    #incoming = new Map();
+    /** Validate and index nodes and edges without reading tracker storage. */
+    constructor(nodes, edges, registry = defaultRegistry) {
+        this.#registry = registry;
+        this.#nodes = new Set([...nodes]
+            .filter((id) => typeof id === "string")
+            .map((id) => id.trim())
+            .filter(Boolean));
+        this.#nodeSnapshot = Object.freeze([...this.#nodes].sort());
+        const deduped = new Map();
+        for (const candidate of edges) {
+            const { edge, identity } = normalizeRelationshipEdge(candidate, this.#nodes, registry);
+            deduped.set(identity, edge);
+        }
+        this.#edges = Object.freeze([...deduped.values()].sort(compareEdges));
+        for (const edge of this.#edges) {
+            appendIndexedEdge(this.#outgoing, edge.source, edge);
+            appendIndexedEdge(this.#incoming, edge.target, edge);
+            if (registry.require(edge.kind).direction === "undirected") {
+                appendIndexedEdge(this.#outgoing, edge.target, edge);
+                appendIndexedEdge(this.#incoming, edge.source, edge);
+            }
+        }
+    }
+    /** Build the graph directly from item metadata, including hierarchy and legacy blocker fields. */
+    static fromItems(items, registry = defaultRegistry) {
+        const ids = new Set(items.map((item) => normalizeNodeId(item.id)).filter(Boolean));
+        const edges = [];
+        for (const item of items) {
+            const source = normalizeNodeId(item.id);
+            if (!source)
+                continue;
+            const parent = resolveExistingNodeId(item.parent, ids);
+            if (parent)
+                edges.push({ source, target: parent, kind: "parent" });
+            const blockedBy = resolveExistingNodeId(item.blocked_by, ids);
+            if (blockedBy)
+                edges.push({
+                    source,
+                    target: blockedBy,
+                    kind: "blocked_by",
+                });
+            for (const dependency of item.dependencies ?? []) {
+                const dependencyId = resolveExistingNodeId(dependency.id, ids);
+                if (dependencyId && registry.resolve(dependency.kind))
+                    edges.push({
+                        source,
+                        target: dependencyId,
+                        kind: dependency.kind,
+                        createdAt: dependency.created_at,
+                        author: dependency.author,
+                    });
+            }
+        }
+        return new RelationshipGraph(ids, edges, registry);
+    }
+    /** Return the deterministic immutable edge snapshot. */
+    edges() {
+        return this.#edges;
+    }
+    /** Return the deterministic immutable edges incident to one node. */
+    incidentEdges(id) {
+        this.#assertNode(id);
+        // Preserve empty fallbacks for legacy indexes and JSON-derived graph state.
+        const outgoing = this.#outgoing.get(id) ?? [];
+        const incoming = this.#incoming.get(id) ?? [];
+        if (outgoing.length === 0)
+            return Object.freeze([...incoming]);
+        if (incoming.length === 0)
+            return Object.freeze([...outgoing]);
+        const edges = [];
+        let outgoingIndex = 0;
+        let incomingIndex = 0;
+        while (outgoingIndex < outgoing.length || incomingIndex < incoming.length) {
+            const outgoingEdge = outgoing[outgoingIndex];
+            const incomingEdge = incoming[incomingIndex];
+            const edge = outgoingEdge === undefined
+                ? incomingEdge
+                : incomingEdge === undefined ||
+                    compareEdges(outgoingEdge, incomingEdge) <= 0
+                    ? outgoingEdge
+                    : incomingEdge;
+            if (edges.at(-1) !== edge)
+                edges.push(edge);
+            if (outgoingEdge === edge)
+                outgoingIndex += 1;
+            if (incomingEdge === edge)
+                incomingIndex += 1;
+        }
+        return Object.freeze(edges);
+    }
+    /** Return the deterministic immutable node snapshot. */
+    nodes() {
+        return this.#nodeSnapshot;
+    }
+    #assertNode(id) {
+        if (!this.#nodes.has(id))
+            throw new TypeError(`Relationship node not found: ${id}`);
+    }
+    #matchesKinds(edge, kinds) {
+        if (!kinds)
+            return true;
+        const definition = this.#registry.require(edge.kind);
+        return (kinds.has(edge.kind) ||
+            (definition.inverse !== undefined && kinds.has(definition.inverse)));
+    }
+    #neighbors(id, direction, kinds) {
+        const candidates = [
+            ...(direction === "incoming" ? [] : (this.#outgoing.get(id) ?? [])),
+            ...(direction === "outgoing" ? [] : (this.#incoming.get(id) ?? [])),
+        ];
+        return [...new Set(candidates)]
+            .filter((edge) => this.#matchesKinds(edge, kinds))
+            .map((edge) => ({
+            id: edge.source === id ? edge.target : edge.source,
+            edge,
+        }))
+            .sort((left, right) => left.id.localeCompare(right.id) ||
+            compareEdges(left.edge, right.edge));
+    }
+    /** Return one-hop adjacent node identifiers. */
+    adjacency(id, options = {}) {
+        this.#assertNode(id);
+        options.signal?.throwIfAborted();
+        const kinds = options.kinds
+            ? new Set(options.kinds.map((kind) => this.#registry.require(kind).kind))
+            : undefined;
+        const rows = this.#neighbors(id, options.direction ?? "outgoing", kinds);
+        const limit = options.limit ?? Number.POSITIVE_INFINITY;
+        const uniqueNeighbors = [...new Set(rows.map((row) => row.id))];
+        const value = uniqueNeighbors.slice(0, limit);
+        return {
+            value,
+            meta: {
+                visitedNodes: 1,
+                inspectedEdges: rows.length,
+                truncated: value.length < uniqueNeighbors.length,
+                nextCursor: value.at(-1),
+            },
+        };
+    }
+    /** Return bounded transitive closure in breadth-first discovery order. */
+    closure(id, options = {}) {
+        this.#assertNode(id);
+        const kinds = options.kinds
+            ? new Set(options.kinds.map((kind) => this.#registry.require(kind).kind))
+            : undefined;
+        const direction = options.direction ?? "outgoing";
+        const limit = options.limit ?? Number.POSITIVE_INFINITY;
+        const maxDepth = options.maxDepth ?? Number.POSITIVE_INFINITY;
+        const seen = new Set([id]);
+        const value = [];
+        const queue = [{ id, depth: 0 }];
+        let visitedNodes = 0;
+        let inspectedEdges = 0;
+        let truncated = false;
+        traversal: for (let index = 0; index < queue.length; index += 1) {
+            options.signal?.throwIfAborted();
+            const current = queue[index];
+            visitedNodes += 1;
+            const neighbors = this.#neighbors(current.id, direction, kinds);
+            inspectedEdges += neighbors.length;
+            if (current.depth >= maxDepth) {
+                if (neighbors.some((neighbor) => !seen.has(neighbor.id)))
+                    truncated = true;
+                continue;
+            }
+            for (const neighbor of neighbors) {
+                if (seen.has(neighbor.id))
+                    continue;
+                if (value.length >= limit) {
+                    truncated = true;
+                    break traversal;
+                }
+                seen.add(neighbor.id);
+                value.push(neighbor.id);
+                queue.push({ id: neighbor.id, depth: current.depth + 1 });
+            }
+        }
+        return {
+            value,
+            meta: {
+                visitedNodes,
+                inspectedEdges,
+                truncated,
+                nextCursor: value.at(-1),
+            },
+        };
+    }
+    /** Return a deterministic shortest path, or an empty array when disconnected. */
+    shortestPath(source, target, options = {}) {
+        this.#assertNode(source);
+        this.#assertNode(target);
+        if (source === target)
+            return {
+                value: [source],
+                meta: { visitedNodes: 1, inspectedEdges: 0, truncated: false },
+            };
+        const kinds = options.kinds
+            ? new Set(options.kinds.map((kind) => this.#registry.require(kind).kind))
+            : undefined;
+        const direction = options.direction ?? "outgoing";
+        const maxDepth = options.maxDepth ?? Number.POSITIVE_INFINITY;
+        const queue = [{ id: source, depth: 0 }];
+        const parents = new Map();
+        const seen = new Set([source]);
+        let visitedNodes = 0;
+        let inspectedEdges = 0;
+        let truncated = false;
+        for (let index = 0; index < queue.length; index += 1) {
+            options.signal?.throwIfAborted();
+            const current = queue[index];
+            visitedNodes += 1;
+            const neighbors = this.#neighbors(current.id, direction, kinds);
+            inspectedEdges += neighbors.length;
+            if (current.depth >= maxDepth) {
+                if (neighbors.some((neighbor) => !seen.has(neighbor.id)))
+                    truncated = true;
+                continue;
+            }
+            for (const neighbor of neighbors) {
+                if (seen.has(neighbor.id))
+                    continue;
+                parents.set(neighbor.id, current.id);
+                if (neighbor.id === target)
+                    return {
+                        value: reconstructPath(source, target, parents),
+                        meta: { visitedNodes, inspectedEdges, truncated: false },
+                    };
+                seen.add(neighbor.id);
+                queue.push({ id: neighbor.id, depth: current.depth + 1 });
+            }
+        }
+        return {
+            value: [],
+            meta: { visitedNodes, inspectedEdges, truncated },
+        };
+    }
+    /** Return the induced subgraph over a bounded closure including the root. */
+    subgraph(id, options = {}) {
+        const closure = this.closure(id, options);
+        const nodes = [id, ...closure.value].sort();
+        const included = new Set(nodes);
+        const kinds = options.kinds
+            ? new Set(options.kinds.map((kind) => this.#registry.require(kind).kind))
+            : undefined;
+        const edges = new Set();
+        for (const node of nodes) {
+            for (const edge of this.#outgoing.get(node) ?? []) {
+                if (included.has(edge.source) &&
+                    included.has(edge.target) &&
+                    this.#matchesKinds(edge, kinds))
+                    edges.add(edge);
+            }
+        }
+        return {
+            value: {
+                nodes,
+                edges: [...edges].sort(compareEdges),
+            },
+            meta: closure.meta,
+        };
+    }
+}
+/** Convert one stored dependency into the public relationship edge contract. */
+export function dependencyToRelationship(source, dependency, registry = defaultRegistry) {
+    return {
+        source,
+        target: dependency.id,
+        kind: registry.require(dependency.kind).kind,
+        createdAt: dependency.created_at,
+        author: dependency.author,
+    };
+}
+//# sourceMappingURL=relationships.js.map
+//# debugId=f5e9e0a6-4550-5e55-9fef-ee54ec06a495

package/dist/sdk/relationships.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"relationships.js","sources":["sdk/relationships.ts"],"sourceRoot":"/","sourcesContent":["/**\n * @module sdk/relationships\n *\n * Provides the dependency-free relationship ontology and bounded graph-query\n * kernel shared by the SDK, CLI, MCP adapters, extensions, and non-PM apps.\n */\nimport type { Dependency, ItemMetadata } from \"../types/index.js\";\n\n/** Direction exposed by a relationship kind. */\nexport type RelationshipDirection = \"directed\" | \"undirected\";\n/** Cardinality constraint applied independently to outgoing and incoming edges. */\nexport type RelationshipCardinality = \"one\" | \"many\";\n/** Lifecycle policy for a relationship kind. */\nexport type RelationshipLifecycle = \"persistent\" | \"supersedable\" | \"ephemeral\";\n/** Direction in which an ordering edge contributes to execution precedence. */\nexport type RelationshipPrecedence =\n  | \"source_before_target\"\n  | \"target_before_source\";\n/** Endpoint that represents the structural parent for hierarchy kinds. */\nexport type RelationshipHierarchyDirection = \"source_parent\" | \"target_parent\";\n\n/** Versioned semantic definition for a built-in or application-defined edge kind. */\nexport interface RelationshipKindDefinition {\n  /** Canonical, case-insensitive kind identifier. */\n  kind: string;\n  /** Whether traversing source to target has distinct meaning from the reverse. */\n  direction: RelationshipDirection;\n  /** Optional canonical kind used when traversing a directed edge in reverse. */\n  inverse?: string;\n  /** Whether the kind participates in execution-order cycle checks. */\n  ordering: boolean;\n  /** Execution direction for ordering kinds; defaults to source before target. */\n  precedence?: RelationshipPrecedence;\n  /** Whether the kind contributes to structural ancestry. */\n  hierarchy: boolean;\n  /** Endpoint that represents the parent; defaults to source for custom kinds. */\n  hierarchyDirection?: RelationshipHierarchyDirection;\n  /** Maximum logical outgoing edges of this kind from one node. */\n  outgoing: RelationshipCardinality;\n  /** Maximum logical incoming edges of this kind to one node. */\n  incoming: RelationshipCardinality;\n  /** Edge replacement and retention behavior. */\n  lifecycle: RelationshipLifecycle;\n  /** JSON Schema for optional application-owned payloads. */\n  payloadSchema?: Readonly<Record<string, unknown>>;\n  /** Legacy spellings normalized to this definition. */\n  aliases?: readonly string[];\n  /** Compatibility version of this semantic contract. */\n  compatibilityVersion: number;\n  /** Whether source and target may be the same node. */\n  allowSelf: boolean;\n}\n\n/** One normalized relationship edge indexed by the graph kernel. */\nexport interface RelationshipEdge {\n  /** Source node identifier. */\n  source: string;\n  /** Target node identifier. */\n  target: string;\n  /** Canonical relationship kind. */\n  kind: string;\n  /** Optional creation timestamp retained from storage. */\n  createdAt?: string;\n  /** Optional author retained from storage. */\n  author?: string;\n  /** Optional application-owned edge payload. */\n  payload?: Readonly<Record<string, unknown>>;\n}\n\n/** Direction used by adjacency, closure, and path traversal. */\nexport type RelationshipTraversalDirection = \"outgoing\" | \"incoming\" | \"both\";\n\n/** Shared bounded-query controls. */\nexport interface RelationshipQueryOptions {\n  /** Edge kinds to traverse after alias normalization. */\n  kinds?: readonly string[];\n  /** Traversal direction relative to each visited node. */\n  direction?: RelationshipTraversalDirection;\n  /** Maximum number of returned nodes, excluding the starting node. */\n  limit?: number;\n  /** Maximum traversal depth. */\n  maxDepth?: number;\n  /** Abort signal checked throughout traversal. */\n  signal?: AbortSignal;\n}\n\n/** Cost and truncation metadata returned by every graph query. */\nexport interface RelationshipQueryMeta {\n  /** Number of nodes removed from the traversal frontier. */\n  visitedNodes: number;\n  /** Number of candidate edges inspected. */\n  inspectedEdges: number;\n  /** Whether a configured bound stopped traversal. */\n  truncated: boolean;\n  /** Deterministic continuation cursor for the final returned node. */\n  nextCursor?: string;\n}\n\n/** Generic bounded graph query result. */\nexport interface RelationshipQueryResult<T> {\n  /** Deterministically ordered query value. */\n  value: T;\n  /** Explicit query work and truncation metadata. */\n  meta: RelationshipQueryMeta;\n}\n\n/** Induced subgraph returned by bounded traversal. */\nexport interface RelationshipSubgraph {\n  /** Deterministically ordered node identifiers. */\n  nodes: string[];\n  /** Deterministically ordered edges whose endpoints are both present. */\n  edges: RelationshipEdge[];\n}\n\nconst BUILTIN_RELATIONSHIP_KINDS: readonly RelationshipKindDefinition[] = [\n  {\n    kind: \"blocked_by\",\n    direction: \"directed\",\n    inverse: \"blocks\",\n    ordering: true,\n    precedence: \"target_before_source\",\n    hierarchy: false,\n    outgoing: \"many\",\n    incoming: \"many\",\n    lifecycle: \"persistent\",\n    aliases: [\"depends_on\"],\n    compatibilityVersion: 1,\n    allowSelf: false,\n  },\n  {\n    kind: \"blocks\",\n    direction: \"directed\",\n    inverse: \"blocked_by\",\n    ordering: true,\n    precedence: \"source_before_target\",\n    hierarchy: false,\n    outgoing: \"many\",\n    incoming: \"many\",\n    lifecycle: \"persistent\",\n    compatibilityVersion: 1,\n    allowSelf: false,\n  },\n  {\n    kind: \"parent\",\n    direction: \"directed\",\n    inverse: \"child\",\n    ordering: false,\n    hierarchy: true,\n    hierarchyDirection: \"target_parent\",\n    outgoing: \"one\",\n    incoming: \"many\",\n    lifecycle: \"supersedable\",\n    aliases: [\"child_of\", \"epic\"],\n    compatibilityVersion: 1,\n    allowSelf: false,\n  },\n  {\n    kind: \"child\",\n    direction: \"directed\",\n    inverse: \"parent\",\n    ordering: false,\n    hierarchy: true,\n    hierarchyDirection: \"source_parent\",\n    outgoing: \"many\",\n    incoming: \"one\",\n    lifecycle: \"supersedable\",\n    aliases: [\"parent_child\", \"task\"],\n    compatibilityVersion: 1,\n    allowSelf: false,\n  },\n  {\n    kind: \"related\",\n    direction: \"undirected\",\n    ordering: false,\n    hierarchy: false,\n    outgoing: \"many\",\n    incoming: \"many\",\n    lifecycle: \"persistent\",\n    aliases: [\"related_to\"],\n    compatibilityVersion: 1,\n    allowSelf: false,\n  },\n  {\n    kind: \"discovered_from\",\n    direction: \"directed\",\n    ordering: false,\n    hierarchy: false,\n    outgoing: \"many\",\n    incoming: \"many\",\n    lifecycle: \"persistent\",\n    compatibilityVersion: 1,\n    allowSelf: false,\n  },\n  {\n    kind: \"incident_from\",\n    direction: \"directed\",\n    ordering: false,\n    hierarchy: false,\n    outgoing: \"many\",\n    incoming: \"many\",\n    lifecycle: \"persistent\",\n    compatibilityVersion: 1,\n    allowSelf: false,\n  },\n  {\n    kind: \"supersedes\",\n    direction: \"directed\",\n    ordering: false,\n    hierarchy: false,\n    outgoing: \"many\",\n    incoming: \"many\",\n    lifecycle: \"supersedable\",\n    compatibilityVersion: 1,\n    allowSelf: false,\n  },\n] as const;\n\nfunction normalizeKind(kind: string): string {\n  return kind.trim().toLowerCase().replaceAll(\"-\", \"_\");\n}\n\nfunction normalizeInverseKind(inverse: string | undefined): string | undefined {\n  if (inverse === undefined) return undefined;\n  const normalized = normalizeKind(inverse);\n  if (!/^[a-z][a-z0-9_]*$/.test(normalized))\n    throw new TypeError(`Invalid inverse relationship kind: ${inverse}`);\n  return normalized;\n}\n\nfunction freezeValue(value: unknown, visited = new Set<object>()): unknown {\n  if (value === null || typeof value !== \"object\") return value;\n  if (visited.has(value)) return value;\n  visited.add(value);\n  if (Array.isArray(value)) {\n    for (const entry of value) freezeValue(entry, visited);\n    return Object.freeze(value);\n  }\n  for (const entry of Object.values(value)) freezeValue(entry, visited);\n  return Object.freeze(value);\n}\n\nfunction assertRelationshipPrecedence(\n  definition: RelationshipKindDefinition,\n  kind: string,\n): void {\n  if (\n    definition.precedence !== undefined &&\n    definition.precedence !== \"source_before_target\" &&\n    definition.precedence !== \"target_before_source\"\n  )\n    throw new TypeError(`Invalid relationship precedence for ${kind}`);\n  if (!definition.ordering && definition.precedence !== undefined)\n    throw new TypeError(\n      `Non-ordering relationship kind cannot declare precedence: ${kind}`,\n    );\n}\n\nfunction assertRelationshipHierarchyDirection(\n  definition: RelationshipKindDefinition,\n  kind: string,\n): void {\n  if (\n    definition.hierarchyDirection !== undefined &&\n    definition.hierarchyDirection !== \"source_parent\" &&\n    definition.hierarchyDirection !== \"target_parent\"\n  )\n    throw new TypeError(`Invalid relationship hierarchy direction for ${kind}`);\n  if (!definition.hierarchy && definition.hierarchyDirection !== undefined)\n    throw new TypeError(\n      `Non-hierarchy relationship kind cannot declare hierarchy direction: ${kind}`,\n    );\n}\n\n/** Mutable registry with immutable snapshots and collision-safe extension registration. */\nexport class RelationshipKindRegistry {\n  readonly #definitions = new Map<string, RelationshipKindDefinition>();\n  readonly #aliases = new Map<string, string>();\n\n  /** Create a registry initialized with the stable built-in ontology by default. */\n  public constructor(\n    definitions: readonly RelationshipKindDefinition[] = BUILTIN_RELATIONSHIP_KINDS,\n  ) {\n    for (const definition of definitions) this.register(definition);\n  }\n\n  /** Register one definition after validating its identifier, version, and aliases. */\n  public register(definition: RelationshipKindDefinition): this {\n    const kind = normalizeKind(definition.kind);\n    if (!/^[a-z][a-z0-9_]*$/.test(kind))\n      throw new TypeError(`Invalid relationship kind: ${definition.kind}`);\n    if (\n      !Number.isInteger(definition.compatibilityVersion) ||\n      definition.compatibilityVersion < 1\n    )\n      throw new TypeError(`Invalid compatibility version for ${kind}`);\n    assertRelationshipPrecedence(definition, kind);\n    assertRelationshipHierarchyDirection(definition, kind);\n    if (this.#definitions.has(kind) || this.#aliases.has(kind))\n      throw new TypeError(`Relationship kind already registered: ${kind}`);\n    const inverse = normalizeInverseKind(definition.inverse);\n    const aliases = [\n      ...new Set((definition.aliases ?? []).map(normalizeKind)),\n    ].sort();\n    for (const alias of aliases) {\n      if (!/^[a-z][a-z0-9_]*$/.test(alias))\n        throw new TypeError(`Invalid relationship alias: ${alias}`);\n      if (\n        alias === kind ||\n        this.#definitions.has(alias) ||\n        this.#aliases.has(alias)\n      )\n        throw new TypeError(`Relationship alias already registered: ${alias}`);\n    }\n    const normalized = Object.freeze({\n      ...definition,\n      kind,\n      inverse,\n      aliases: Object.freeze(aliases),\n      payloadSchema: definition.payloadSchema\n        ? (freezeValue(structuredClone(definition.payloadSchema)) as Readonly<\n            Record<string, unknown>\n          >)\n        : undefined,\n    });\n    this.#definitions.set(kind, normalized);\n    for (const alias of aliases) this.#aliases.set(alias, kind);\n    return this;\n  }\n\n  /** Resolve a canonical kind or compatibility alias. */\n  public resolve(kind: unknown): RelationshipKindDefinition | undefined {\n    if (typeof kind !== \"string\") return undefined;\n    const normalized = normalizeKind(kind);\n    return this.#definitions.get(this.#aliases.get(normalized) ?? normalized);\n  }\n\n  /** Resolve a kind or throw a precise error suitable for command adapters. */\n  public require(kind: string): RelationshipKindDefinition {\n    const definition = this.resolve(kind);\n    if (!definition) throw new TypeError(`Unknown relationship kind: ${kind}`);\n    return definition;\n  }\n\n  /** Return a deterministic immutable registry snapshot. */\n  public list(): readonly RelationshipKindDefinition[] {\n    return Object.freeze(\n      [...this.#definitions.values()].sort((left, right) =>\n        left.kind.localeCompare(right.kind),\n      ),\n    );\n  }\n}\n\n/** Create a registry containing the built-in relationship ontology. */\nexport function createRelationshipKindRegistry(): RelationshipKindRegistry {\n  return new RelationshipKindRegistry();\n}\n\nconst defaultRegistry = createRelationshipKindRegistry();\n\n/** Report whether a kind participates in execution-order cycle detection. */\nexport function isOrderingRelationshipKind(\n  kind: string,\n  registry: RelationshipKindRegistry = defaultRegistry,\n): boolean {\n  return registry.resolve(kind)?.ordering === true;\n}\n\nfunction compareEdges(left: RelationshipEdge, right: RelationshipEdge): number {\n  return (\n    left.source.localeCompare(right.source) ||\n    left.target.localeCompare(right.target) ||\n    left.kind.localeCompare(right.kind)\n  );\n}\n\nfunction normalizeRelationshipEdge(\n  candidate: RelationshipEdge,\n  nodes: ReadonlySet<string>,\n  registry: RelationshipKindRegistry,\n): { edge: RelationshipEdge; identity: string } {\n  const source =\n    typeof candidate.source === \"string\" ? candidate.source.trim() : \"\";\n  const target =\n    typeof candidate.target === \"string\" ? candidate.target.trim() : \"\";\n  const definition = registry.require(candidate.kind);\n  if (!nodes.has(source) || !nodes.has(target))\n    throw new TypeError(\n      `Relationship endpoint not found: ${source} -> ${target}`,\n    );\n  if (source === target && !definition.allowSelf)\n    throw new TypeError(\n      `Self relationship is not allowed for ${definition.kind}`,\n    );\n  const edge = Object.freeze({\n    ...candidate,\n    source,\n    target,\n    kind: definition.kind,\n  });\n  const endpoints =\n    definition.direction === \"undirected\"\n      ? [source, target].sort().join(\"\\u0000\")\n      : `${source}\\u0000${target}`;\n  return { edge, identity: `${definition.kind}\\u0000${endpoints}` };\n}\n\nfunction appendIndexedEdge(\n  index: Map<string, RelationshipEdge[]>,\n  node: string,\n  edge: RelationshipEdge,\n): void {\n  const indexed = index.get(node);\n  if (indexed) indexed.push(edge);\n  else index.set(node, [edge]);\n}\n\nfunction normalizeNodeId(value: unknown): string {\n  return typeof value === \"string\" ? value.trim() : \"\";\n}\n\nfunction resolveExistingNodeId(\n  value: unknown,\n  ids: ReadonlySet<string>,\n): string | undefined {\n  const id = normalizeNodeId(value);\n  return id && ids.has(id) ? id : undefined;\n}\n\nfunction reconstructPath(\n  source: string,\n  target: string,\n  parents: ReadonlyMap<string, string>,\n): string[] {\n  const path = [target];\n  let cursor = target;\n  while (cursor !== source) {\n    cursor = parents.get(cursor)!;\n    path.push(cursor);\n  }\n  return path.reverse();\n}\n\n/** Build an immutable, deterministic in-memory relationship index. */\nexport class RelationshipGraph {\n  readonly #registry: RelationshipKindRegistry;\n  readonly #nodes: Set<string>;\n  readonly #nodeSnapshot: readonly string[];\n  readonly #edges: readonly RelationshipEdge[];\n  readonly #outgoing = new Map<string, RelationshipEdge[]>();\n  readonly #incoming = new Map<string, RelationshipEdge[]>();\n\n  /** Validate and index nodes and edges without reading tracker storage. */\n  public constructor(\n    nodes: Iterable<string>,\n    edges: Iterable<RelationshipEdge>,\n    registry: RelationshipKindRegistry = defaultRegistry,\n  ) {\n    this.#registry = registry;\n    this.#nodes = new Set(\n      [...nodes]\n        .filter((id): id is string => typeof id === \"string\")\n        .map((id) => id.trim())\n        .filter(Boolean),\n    );\n    this.#nodeSnapshot = Object.freeze([...this.#nodes].sort());\n    const deduped = new Map<string, RelationshipEdge>();\n    for (const candidate of edges) {\n      const { edge, identity } = normalizeRelationshipEdge(\n        candidate,\n        this.#nodes,\n        registry,\n      );\n      deduped.set(identity, edge);\n    }\n    this.#edges = Object.freeze([...deduped.values()].sort(compareEdges));\n    for (const edge of this.#edges) {\n      appendIndexedEdge(this.#outgoing, edge.source, edge);\n      appendIndexedEdge(this.#incoming, edge.target, edge);\n      if (registry.require(edge.kind).direction === \"undirected\") {\n        appendIndexedEdge(this.#outgoing, edge.target, edge);\n        appendIndexedEdge(this.#incoming, edge.source, edge);\n      }\n    }\n  }\n\n  /** Build the graph directly from item metadata, including hierarchy and legacy blocker fields. */\n  public static fromItems(\n    items: readonly Pick<\n      ItemMetadata,\n      \"id\" | \"parent\" | \"blocked_by\" | \"dependencies\"\n    >[],\n    registry: RelationshipKindRegistry = defaultRegistry,\n  ): RelationshipGraph {\n    const ids = new Set(\n      items.map((item) => normalizeNodeId(item.id)).filter(Boolean),\n    );\n    const edges: RelationshipEdge[] = [];\n    for (const item of items) {\n      const source = normalizeNodeId(item.id);\n      if (!source) continue;\n      const parent = resolveExistingNodeId(item.parent, ids);\n      if (parent) edges.push({ source, target: parent, kind: \"parent\" });\n      const blockedBy = resolveExistingNodeId(item.blocked_by, ids);\n      if (blockedBy)\n        edges.push({\n          source,\n          target: blockedBy,\n          kind: \"blocked_by\",\n        });\n      for (const dependency of item.dependencies ?? []) {\n        const dependencyId = resolveExistingNodeId(dependency.id, ids);\n        if (dependencyId && registry.resolve(dependency.kind))\n          edges.push({\n            source,\n            target: dependencyId,\n            kind: dependency.kind,\n            createdAt: dependency.created_at,\n            author: dependency.author,\n          });\n      }\n    }\n    return new RelationshipGraph(ids, edges, registry);\n  }\n\n  /** Return the deterministic immutable edge snapshot. */\n  public edges(): readonly RelationshipEdge[] {\n    return this.#edges;\n  }\n\n  /** Return the deterministic immutable edges incident to one node. */\n  public incidentEdges(id: string): readonly RelationshipEdge[] {\n    this.#assertNode(id);\n    // Preserve empty fallbacks for legacy indexes and JSON-derived graph state.\n    const outgoing = this.#outgoing.get(id) ?? [];\n    const incoming = this.#incoming.get(id) ?? [];\n    if (outgoing.length === 0) return Object.freeze([...incoming]);\n    if (incoming.length === 0) return Object.freeze([...outgoing]);\n    const edges: RelationshipEdge[] = [];\n    let outgoingIndex = 0;\n    let incomingIndex = 0;\n    while (outgoingIndex < outgoing.length || incomingIndex < incoming.length) {\n      const outgoingEdge = outgoing[outgoingIndex];\n      const incomingEdge = incoming[incomingIndex];\n      const edge =\n        outgoingEdge === undefined\n          ? incomingEdge!\n          : incomingEdge === undefined ||\n              compareEdges(outgoingEdge, incomingEdge) <= 0\n            ? outgoingEdge\n            : incomingEdge;\n      if (edges.at(-1) !== edge) edges.push(edge);\n      if (outgoingEdge === edge) outgoingIndex += 1;\n      if (incomingEdge === edge) incomingIndex += 1;\n    }\n    return Object.freeze(edges);\n  }\n\n  /** Return the deterministic immutable node snapshot. */\n  public nodes(): readonly string[] {\n    return this.#nodeSnapshot;\n  }\n\n  #assertNode(id: string): void {\n    if (!this.#nodes.has(id))\n      throw new TypeError(`Relationship node not found: ${id}`);\n  }\n\n  #matchesKinds(\n    edge: RelationshipEdge,\n    kinds: ReadonlySet<string> | undefined,\n  ): boolean {\n    if (!kinds) return true;\n    const definition = this.#registry.require(edge.kind);\n    return (\n      kinds.has(edge.kind) ||\n      (definition.inverse !== undefined && kinds.has(definition.inverse))\n    );\n  }\n\n  #neighbors(\n    id: string,\n    direction: RelationshipTraversalDirection,\n    kinds: ReadonlySet<string> | undefined,\n  ): { id: string; edge: RelationshipEdge }[] {\n    const candidates = [\n      ...(direction === \"incoming\" ? [] : (this.#outgoing.get(id) ?? [])),\n      ...(direction === \"outgoing\" ? [] : (this.#incoming.get(id) ?? [])),\n    ];\n    return [...new Set(candidates)]\n      .filter((edge) => this.#matchesKinds(edge, kinds))\n      .map((edge) => ({\n        id: edge.source === id ? edge.target : edge.source,\n        edge,\n      }))\n      .sort(\n        (left, right) =>\n          left.id.localeCompare(right.id) ||\n          compareEdges(left.edge, right.edge),\n      );\n  }\n\n  /** Return one-hop adjacent node identifiers. */\n  public adjacency(\n    id: string,\n    options: RelationshipQueryOptions = {},\n  ): RelationshipQueryResult<string[]> {\n    this.#assertNode(id);\n    options.signal?.throwIfAborted();\n    const kinds = options.kinds\n      ? new Set(options.kinds.map((kind) => this.#registry.require(kind).kind))\n      : undefined;\n    const rows = this.#neighbors(id, options.direction ?? \"outgoing\", kinds);\n    const limit = options.limit ?? Number.POSITIVE_INFINITY;\n    const uniqueNeighbors = [...new Set(rows.map((row) => row.id))];\n    const value = uniqueNeighbors.slice(0, limit);\n    return {\n      value,\n      meta: {\n        visitedNodes: 1,\n        inspectedEdges: rows.length,\n        truncated: value.length < uniqueNeighbors.length,\n        nextCursor: value.at(-1),\n      },\n    };\n  }\n\n  /** Return bounded transitive closure in breadth-first discovery order. */\n  public closure(\n    id: string,\n    options: RelationshipQueryOptions = {},\n  ): RelationshipQueryResult<string[]> {\n    this.#assertNode(id);\n    const kinds = options.kinds\n      ? new Set(options.kinds.map((kind) => this.#registry.require(kind).kind))\n      : undefined;\n    const direction = options.direction ?? \"outgoing\";\n    const limit = options.limit ?? Number.POSITIVE_INFINITY;\n    const maxDepth = options.maxDepth ?? Number.POSITIVE_INFINITY;\n    const seen = new Set([id]);\n    const value: string[] = [];\n    const queue = [{ id, depth: 0 }];\n    let visitedNodes = 0;\n    let inspectedEdges = 0;\n    let truncated = false;\n    traversal: for (let index = 0; index < queue.length; index += 1) {\n      options.signal?.throwIfAborted();\n      const current = queue[index]!;\n      visitedNodes += 1;\n      const neighbors = this.#neighbors(current.id, direction, kinds);\n      inspectedEdges += neighbors.length;\n      if (current.depth >= maxDepth) {\n        if (neighbors.some((neighbor) => !seen.has(neighbor.id)))\n          truncated = true;\n        continue;\n      }\n      for (const neighbor of neighbors) {\n        if (seen.has(neighbor.id)) continue;\n        if (value.length >= limit) {\n          truncated = true;\n          break traversal;\n        }\n        seen.add(neighbor.id);\n        value.push(neighbor.id);\n        queue.push({ id: neighbor.id, depth: current.depth + 1 });\n      }\n    }\n    return {\n      value,\n      meta: {\n        visitedNodes,\n        inspectedEdges,\n        truncated,\n        nextCursor: value.at(-1),\n      },\n    };\n  }\n\n  /** Return a deterministic shortest path, or an empty array when disconnected. */\n  public shortestPath(\n    source: string,\n    target: string,\n    options: RelationshipQueryOptions = {},\n  ): RelationshipQueryResult<string[]> {\n    this.#assertNode(source);\n    this.#assertNode(target);\n    if (source === target)\n      return {\n        value: [source],\n        meta: { visitedNodes: 1, inspectedEdges: 0, truncated: false },\n      };\n    const kinds = options.kinds\n      ? new Set(options.kinds.map((kind) => this.#registry.require(kind).kind))\n      : undefined;\n    const direction = options.direction ?? \"outgoing\";\n    const maxDepth = options.maxDepth ?? Number.POSITIVE_INFINITY;\n    const queue = [{ id: source, depth: 0 }];\n    const parents = new Map<string, string>();\n    const seen = new Set([source]);\n    let visitedNodes = 0;\n    let inspectedEdges = 0;\n    let truncated = false;\n    for (let index = 0; index < queue.length; index += 1) {\n      options.signal?.throwIfAborted();\n      const current = queue[index]!;\n      visitedNodes += 1;\n      const neighbors = this.#neighbors(current.id, direction, kinds);\n      inspectedEdges += neighbors.length;\n      if (current.depth >= maxDepth) {\n        if (neighbors.some((neighbor) => !seen.has(neighbor.id)))\n          truncated = true;\n        continue;\n      }\n      for (const neighbor of neighbors) {\n        if (seen.has(neighbor.id)) continue;\n        parents.set(neighbor.id, current.id);\n        if (neighbor.id === target)\n          return {\n            value: reconstructPath(source, target, parents),\n            meta: { visitedNodes, inspectedEdges, truncated: false },\n          };\n        seen.add(neighbor.id);\n        queue.push({ id: neighbor.id, depth: current.depth + 1 });\n      }\n    }\n    return {\n      value: [],\n      meta: { visitedNodes, inspectedEdges, truncated },\n    };\n  }\n\n  /** Return the induced subgraph over a bounded closure including the root. */\n  public subgraph(\n    id: string,\n    options: RelationshipQueryOptions = {},\n  ): RelationshipQueryResult<RelationshipSubgraph> {\n    const closure = this.closure(id, options);\n    const nodes = [id, ...closure.value].sort();\n    const included = new Set(nodes);\n    const kinds = options.kinds\n      ? new Set(options.kinds.map((kind) => this.#registry.require(kind).kind))\n      : undefined;\n    const edges = new Set<RelationshipEdge>();\n    for (const node of nodes) {\n      for (const edge of this.#outgoing.get(node) ?? []) {\n        if (\n          included.has(edge.source) &&\n          included.has(edge.target) &&\n          this.#matchesKinds(edge, kinds)\n        )\n          edges.add(edge);\n      }\n    }\n    return {\n      value: {\n        nodes,\n        edges: [...edges].sort(compareEdges),\n      },\n      meta: closure.meta,\n    };\n  }\n}\n\n/** Convert one stored dependency into the public relationship edge contract. */\nexport function dependencyToRelationship(\n  source: string,\n  dependency: Dependency,\n  registry: RelationshipKindRegistry = defaultRegistry,\n): RelationshipEdge {\n  return {\n    source,\n    target: dependency.id,\n    kind: registry.require(dependency.kind).kind,\n    createdAt: dependency.created_at,\n    author: dependency.author,\n  };\n}\n"],"names":[],"mappings":";;AAkHA,MAAM,0BAA0B,GAA0C;IACxE;QACE,IAAI,EAAE,YAAY;QAClB,SAAS,EAAE,UAAU;QACrB,OAAO,EAAE,QAAQ;QACjB,QAAQ,EAAE,IAAI;QACd,UAAU,EAAE,sBAAsB;QAClC,SAAS,EAAE,KAAK;QAChB,QAAQ,EAAE,MAAM;QAChB,QAAQ,EAAE,MAAM;QAChB,SAAS,EAAE,YAAY;QACvB,OAAO,EAAE,CAAC,YAAY,CAAC;QACvB,oBAAoB,EAAE,CAAC;QACvB,SAAS,EAAE,KAAK;KACjB;IACD;QACE,IAAI,EAAE,QAAQ;QACd,SAAS,EAAE,UAAU;QACrB,OAAO,EAAE,YAAY;QACrB,QAAQ,EAAE,IAAI;QACd,UAAU,EAAE,sBAAsB;QAClC,SAAS,EAAE,KAAK;QAChB,QAAQ,EAAE,MAAM;QAChB,QAAQ,EAAE,MAAM;QAChB,SAAS,EAAE,YAAY;QACvB,oBAAoB,EAAE,CAAC;QACvB,SAAS,EAAE,KAAK;KACjB;IACD;QACE,IAAI,EAAE,QAAQ;QACd,SAAS,EAAE,UAAU;QACrB,OAAO,EAAE,OAAO;QAChB,QAAQ,EAAE,KAAK;QACf,SAAS,EAAE,IAAI;QACf,kBAAkB,EAAE,eAAe;QACnC,QAAQ,EAAE,KAAK;QACf,QAAQ,EAAE,MAAM;QAChB,SAAS,EAAE,cAAc;QACzB,OAAO,EAAE,CAAC,UAAU,EAAE,MAAM,CAAC;QAC7B,oBAAoB,EAAE,CAAC;QACvB,SAAS,EAAE,KAAK;KACjB;IACD;QACE,IAAI,EAAE,OAAO;QACb,SAAS,EAAE,UAAU;QACrB,OAAO,EAAE,QAAQ;QACjB,QAAQ,EAAE,KAAK;QACf,SAAS,EAAE,IAAI;QACf,kBAAkB,EAAE,eAAe;QACnC,QAAQ,EAAE,MAAM;QAChB,QAAQ,EAAE,KAAK;QACf,SAAS,EAAE,cAAc;QACzB,OAAO,EAAE,CAAC,cAAc,EAAE,MAAM,CAAC;QACjC,oBAAoB,EAAE,CAAC;QACvB,SAAS,EAAE,KAAK;KACjB;IACD;QACE,IAAI,EAAE,SAAS;QACf,SAAS,EAAE,YAAY;QACvB,QAAQ,EAAE,KAAK;QACf,SAAS,EAAE,KAAK;QAChB,QAAQ,EAAE,MAAM;QAChB,QAAQ,EAAE,MAAM;QAChB,SAAS,EAAE,YAAY;QACvB,OAAO,EAAE,CAAC,YAAY,CAAC;QACvB,oBAAoB,EAAE,CAAC;QACvB,SAAS,EAAE,KAAK;KACjB;IACD;QACE,IAAI,EAAE,iBAAiB;QACvB,SAAS,EAAE,UAAU;QACrB,QAAQ,EAAE,KAAK;QACf,SAAS,EAAE,KAAK;QAChB,QAAQ,EAAE,MAAM;QAChB,QAAQ,EAAE,MAAM;QAChB,SAAS,EAAE,YAAY;QACvB,oBAAoB,EAAE,CAAC;QACvB,SAAS,EAAE,KAAK;KACjB;IACD;QACE,IAAI,EAAE,eAAe;QACrB,SAAS,EAAE,UAAU;QACrB,QAAQ,EAAE,KAAK;QACf,SAAS,EAAE,KAAK;QAChB,QAAQ,EAAE,MAAM;QAChB,QAAQ,EAAE,MAAM;QAChB,SAAS,EAAE,YAAY;QACvB,oBAAoB,EAAE,CAAC;QACvB,SAAS,EAAE,KAAK;KACjB;IACD;QACE,IAAI,EAAE,YAAY;QAClB,SAAS,EAAE,UAAU;QACrB,QAAQ,EAAE,KAAK;QACf,SAAS,EAAE,KAAK;QAChB,QAAQ,EAAE,MAAM;QAChB,QAAQ,EAAE,MAAM;QAChB,SAAS,EAAE,cAAc;QACzB,oBAAoB,EAAE,CAAC;QACvB,SAAS,EAAE,KAAK;KACjB;CACO,CAAC;AAEX,SAAS,aAAa,CAAC,IAAY;IACjC,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,UAAU,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;AACxD,CAAC;AAED,SAAS,oBAAoB,CAAC,OAA2B;IACvD,IAAI,OAAO,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IAC5C,MAAM,UAAU,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC;IAC1C,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,UAAU,CAAC;QACvC,MAAM,IAAI,SAAS,CAAC,sCAAsC,OAAO,EAAE,CAAC,CAAC;IACvE,OAAO,UAAU,CAAC;AACpB,CAAC;AAED,SAAS,WAAW,CAAC,KAAc,EAAE,UAAU,IAAI,GAAG,EAAU;IAC9D,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC;IAC9D,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IACrC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACnB,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACzB,KAAK,MAAM,KAAK,IAAI,KAAK;YAAE,WAAW,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QACvD,OAAO,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC9B,CAAC;IACD,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC;QAAE,WAAW,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IACtE,OAAO,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AAC9B,CAAC;AAED,SAAS,4BAA4B,CACnC,UAAsC,EACtC,IAAY;IAEZ,IACE,UAAU,CAAC,UAAU,KAAK,SAAS;QACnC,UAAU,CAAC,UAAU,KAAK,sBAAsB;QAChD,UAAU,CAAC,UAAU,KAAK,sBAAsB;QAEhD,MAAM,IAAI,SAAS,CAAC,uCAAuC,IAAI,EAAE,CAAC,CAAC;IACrE,IAAI,CAAC,UAAU,CAAC,QAAQ,IAAI,UAAU,CAAC,UAAU,KAAK,SAAS;QAC7D,MAAM,IAAI,SAAS,CACjB,6DAA6D,IAAI,EAAE,CACpE,CAAC;AACN,CAAC;AAED,SAAS,oCAAoC,CAC3C,UAAsC,EACtC,IAAY;IAEZ,IACE,UAAU,CAAC,kBAAkB,KAAK,SAAS;QAC3C,UAAU,CAAC,kBAAkB,KAAK,eAAe;QACjD,UAAU,CAAC,kBAAkB,KAAK,eAAe;QAEjD,MAAM,IAAI,SAAS,CAAC,gDAAgD,IAAI,EAAE,CAAC,CAAC;IAC9E,IAAI,CAAC,UAAU,CAAC,SAAS,IAAI,UAAU,CAAC,kBAAkB,KAAK,SAAS;QACtE,MAAM,IAAI,SAAS,CACjB,uEAAuE,IAAI,EAAE,CAC9E,CAAC;AACN,CAAC;AAED,2FAA2F;AAC3F,MAAM,OAAO,wBAAwB;IAC1B,YAAY,GAAG,IAAI,GAAG,EAAsC,CAAC;IAC7D,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAE9C,kFAAkF;IAClF,YACE,cAAqD,0BAA0B;QAE/E,KAAK,MAAM,UAAU,IAAI,WAAW;YAAE,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;IAClE,CAAC;IAED,qFAAqF;IAC9E,QAAQ,CAAC,UAAsC;QACpD,MAAM,IAAI,GAAG,aAAa,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QAC5C,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,IAAI,CAAC;YACjC,MAAM,IAAI,SAAS,CAAC,8BAA8B,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC;QACvE,IACE,CAAC,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,oBAAoB,CAAC;YAClD,UAAU,CAAC,oBAAoB,GAAG,CAAC;YAEnC,MAAM,IAAI,SAAS,CAAC,qCAAqC,IAAI,EAAE,CAAC,CAAC;QACnE,4BAA4B,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAC/C,oCAAoC,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QACvD,IAAI,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC;YACxD,MAAM,IAAI,SAAS,CAAC,yCAAyC,IAAI,EAAE,CAAC,CAAC;QACvE,MAAM,OAAO,GAAG,oBAAoB,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACzD,MAAM,OAAO,GAAG;YACd,GAAG,IAAI,GAAG,CAAC,CAAC,UAAU,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;SAC1D,CAAC,IAAI,EAAE,CAAC;QACT,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,KAAK,CAAC;gBAClC,MAAM,IAAI,SAAS,CAAC,+BAA+B,KAAK,EAAE,CAAC,CAAC;YAC9D,IACE,KAAK,KAAK,IAAI;gBACd,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC;gBAC5B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC;gBAExB,MAAM,IAAI,SAAS,CAAC,0CAA0C,KAAK,EAAE,CAAC,CAAC;QAC3E,CAAC;QACD,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC;YAC/B,GAAG,UAAU;YACb,IAAI;YACJ,OAAO;YACP,OAAO,EAAE,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC;YAC/B,aAAa,EAAE,UAAU,CAAC,aAAa;gBACrC,CAAC,CAAE,WAAW,CAAC,eAAe,CAAC,UAAU,CAAC,aAAa,CAAC,CAEpD;gBACJ,CAAC,CAAC,SAAS;SACd,CAAC,CAAC;QACH,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;QACxC,KAAK,MAAM,KAAK,IAAI,OAAO;YAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QAC5D,OAAO,IAAI,CAAC;IACd,CAAC;IAED,uDAAuD;IAChD,OAAO,CAAC,IAAa;QAC1B,IAAI,OAAO,IAAI,KAAK,QAAQ;YAAE,OAAO,SAAS,CAAC;QAC/C,MAAM,UAAU,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;QACvC,OAAO,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,UAAU,CAAC,CAAC;IAC5E,CAAC;IAED,6EAA6E;IACtE,OAAO,CAAC,IAAY;QACzB,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACtC,IAAI,CAAC,UAAU;YAAE,MAAM,IAAI,SAAS,CAAC,8BAA8B,IAAI,EAAE,CAAC,CAAC;QAC3E,OAAO,UAAU,CAAC;IACpB,CAAC;IAED,0DAA0D;IACnD,IAAI;QACT,OAAO,MAAM,CAAC,MAAM,CAClB,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CACnD,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,CACpC,CACF,CAAC;IACJ,CAAC;CACF;AAED,uEAAuE;AACvE,MAAM,UAAU,8BAA8B;IAC5C,OAAO,IAAI,wBAAwB,EAAE,CAAC;AACxC,CAAC;AAED,MAAM,eAAe,GAAG,8BAA8B,EAAE,CAAC;AAEzD,6EAA6E;AAC7E,MAAM,UAAU,0BAA0B,CACxC,IAAY,EACZ,WAAqC,eAAe;IAEpD,OAAO,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,QAAQ,KAAK,IAAI,CAAC;AACnD,CAAC;AAED,SAAS,YAAY,CAAC,IAAsB,EAAE,KAAuB;IACnE,OAAO,CACL,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,MAAM,CAAC;QACvC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,MAAM,CAAC;QACvC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,CACpC,CAAC;AACJ,CAAC;AAED,SAAS,yBAAyB,CAChC,SAA2B,EAC3B,KAA0B,EAC1B,QAAkC;IAElC,MAAM,MAAM,GACV,OAAO,SAAS,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;IACtE,MAAM,MAAM,GACV,OAAO,SAAS,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;IACtE,MAAM,UAAU,GAAG,QAAQ,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;IACpD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC;QAC1C,MAAM,IAAI,SAAS,CACjB,oCAAoC,MAAM,OAAO,MAAM,EAAE,CAC1D,CAAC;IACJ,IAAI,MAAM,KAAK,MAAM,IAAI,CAAC,UAAU,CAAC,SAAS;QAC5C,MAAM,IAAI,SAAS,CACjB,wCAAwC,UAAU,CAAC,IAAI,EAAE,CAC1D,CAAC;IACJ,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC;QACzB,GAAG,SAAS;QACZ,MAAM;QACN,MAAM;QACN,IAAI,EAAE,UAAU,CAAC,IAAI;KACtB,CAAC,CAAC;IACH,MAAM,SAAS,GACb,UAAU,CAAC,SAAS,KAAK,YAAY;QACnC,CAAC,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC;QACxC,CAAC,CAAC,GAAG,MAAM,SAAS,MAAM,EAAE,CAAC;IACjC,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,UAAU,CAAC,IAAI,SAAS,SAAS,EAAE,EAAE,CAAC;AACpE,CAAC;AAED,SAAS,iBAAiB,CACxB,KAAsC,EACtC,IAAY,EACZ,IAAsB;IAEtB,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAChC,IAAI,OAAO;QAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;QAC3B,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;AAC/B,CAAC;AAED,SAAS,eAAe,CAAC,KAAc;IACrC,OAAO,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;AACvD,CAAC;AAED,SAAS,qBAAqB,CAC5B,KAAc,EACd,GAAwB;IAExB,MAAM,EAAE,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;IAClC,OAAO,EAAE,IAAI,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;AAC5C,CAAC;AAED,SAAS,eAAe,CACtB,MAAc,EACd,MAAc,EACd,OAAoC;IAEpC,MAAM,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC;IACtB,IAAI,MAAM,GAAG,MAAM,CAAC;IACpB,OAAO,MAAM,KAAK,MAAM,EAAE,CAAC;QACzB,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;QAC9B,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACpB,CAAC;IACD,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;AACxB,CAAC;AAED,sEAAsE;AACtE,MAAM,OAAO,iBAAiB;IACnB,SAAS,CAA2B;IACpC,MAAM,CAAc;IACpB,aAAa,CAAoB;IACjC,MAAM,CAA8B;IACpC,SAAS,GAAG,IAAI,GAAG,EAA8B,CAAC;IAClD,SAAS,GAAG,IAAI,GAAG,EAA8B,CAAC;IAE3D,0EAA0E;IAC1E,YACE,KAAuB,EACvB,KAAiC,EACjC,WAAqC,eAAe;QAEpD,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC1B,IAAI,CAAC,MAAM,GAAG,IAAI,GAAG,CACnB,CAAC,GAAG,KAAK,CAAC;aACP,MAAM,CAAC,CAAC,EAAE,EAAgB,EAAE,CAAC,OAAO,EAAE,KAAK,QAAQ,CAAC;aACpD,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;aACtB,MAAM,CAAC,OAAO,CAAC,CACnB,CAAC;QACF,IAAI,CAAC,aAAa,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;QAC5D,MAAM,OAAO,GAAG,IAAI,GAAG,EAA4B,CAAC;QACpD,KAAK,MAAM,SAAS,IAAI,KAAK,EAAE,CAAC;YAC9B,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,yBAAyB,CAClD,SAAS,EACT,IAAI,CAAC,MAAM,EACX,QAAQ,CACT,CAAC;YACF,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;QAC9B,CAAC;QACD,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC;QACtE,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAC/B,iBAAiB,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YACrD,iBAAiB,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YACrD,IAAI,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,SAAS,KAAK,YAAY,EAAE,CAAC;gBAC3D,iBAAiB,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;gBACrD,iBAAiB,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YACvD,CAAC;QACH,CAAC;IACH,CAAC;IAED,kGAAkG;IAC3F,MAAM,CAAC,SAAS,CACrB,KAGG,EACH,WAAqC,eAAe;QAEpD,MAAM,GAAG,GAAG,IAAI,GAAG,CACjB,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,eAAe,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAC9D,CAAC;QACF,MAAM,KAAK,GAAuB,EAAE,CAAC;QACrC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,MAAM,GAAG,eAAe,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACxC,IAAI,CAAC,MAAM;gBAAE,SAAS;YACtB,MAAM,MAAM,GAAG,qBAAqB,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;YACvD,IAAI,MAAM;gBAAE,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC;YACnE,MAAM,SAAS,GAAG,qBAAqB,CAAC,IAAI,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC;YAC9D,IAAI,SAAS;gBACX,KAAK,CAAC,IAAI,CAAC;oBACT,MAAM;oBACN,MAAM,EAAE,SAAS;oBACjB,IAAI,EAAE,YAAY;iBACnB,CAAC,CAAC;YACL,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,YAAY,IAAI,EAAE,EAAE,CAAC;gBACjD,MAAM,YAAY,GAAG,qBAAqB,CAAC,UAAU,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;gBAC/D,IAAI,YAAY,IAAI,QAAQ,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC;oBACnD,KAAK,CAAC,IAAI,CAAC;wBACT,MAAM;wBACN,MAAM,EAAE,YAAY;wBACpB,IAAI,EAAE,UAAU,CAAC,IAAI;wBACrB,SAAS,EAAE,UAAU,CAAC,UAAU;wBAChC,MAAM,EAAE,UAAU,CAAC,MAAM;qBAC1B,CAAC,CAAC;YACP,CAAC;QACH,CAAC;QACD,OAAO,IAAI,iBAAiB,CAAC,GAAG,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;IACrD,CAAC;IAED,wDAAwD;IACjD,KAAK;QACV,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED,qEAAqE;IAC9D,aAAa,CAAC,EAAU;QAC7B,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;QACrB,4EAA4E;QAC5E,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QAC9C,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QAC9C,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;QAC/D,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;QAC/D,MAAM,KAAK,GAAuB,EAAE,CAAC;QACrC,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,OAAO,aAAa,GAAG,QAAQ,CAAC,MAAM,IAAI,aAAa,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;YAC1E,MAAM,YAAY,GAAG,QAAQ,CAAC,aAAa,CAAC,CAAC;YAC7C,MAAM,YAAY,GAAG,QAAQ,CAAC,aAAa,CAAC,CAAC;YAC7C,MAAM,IAAI,GACR,YAAY,KAAK,SAAS;gBACxB,CAAC,CAAC,YAAa;gBACf,CAAC,CAAC,YAAY,KAAK,SAAS;oBACxB,YAAY,CAAC,YAAY,EAAE,YAAY,CAAC,IAAI,CAAC;oBAC/C,CAAC,CAAC,YAAY;oBACd,CAAC,CAAC,YAAY,CAAC;YACrB,IAAI,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI;gBAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC5C,IAAI,YAAY,KAAK,IAAI;gBAAE,aAAa,IAAI,CAAC,CAAC;YAC9C,IAAI,YAAY,KAAK,IAAI;gBAAE,aAAa,IAAI,CAAC,CAAC;QAChD,CAAC;QACD,OAAO,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC9B,CAAC;IAED,wDAAwD;IACjD,KAAK;QACV,OAAO,IAAI,CAAC,aAAa,CAAC;IAC5B,CAAC;IAED,WAAW,CAAC,EAAU;QACpB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;YACtB,MAAM,IAAI,SAAS,CAAC,gCAAgC,EAAE,EAAE,CAAC,CAAC;IAC9D,CAAC;IAED,aAAa,CACX,IAAsB,EACtB,KAAsC;QAEtC,IAAI,CAAC,KAAK;YAAE,OAAO,IAAI,CAAC;QACxB,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrD,OAAO,CACL,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;YACpB,CAAC,UAAU,CAAC,OAAO,KAAK,SAAS,IAAI,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CACpE,CAAC;IACJ,CAAC;IAED,UAAU,CACR,EAAU,EACV,SAAyC,EACzC,KAAsC;QAEtC,MAAM,UAAU,GAAG;YACjB,GAAG,CAAC,SAAS,KAAK,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;YACnE,GAAG,CAAC,SAAS,KAAK,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;SACpE,CAAC;QACF,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,CAAC;aAC5B,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;aACjD,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YACd,EAAE,EAAE,IAAI,CAAC,MAAM,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM;YAClD,IAAI;SACL,CAAC,CAAC;aACF,IAAI,CACH,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CACd,IAAI,CAAC,EAAE,CAAC,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC;YAC/B,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,CACtC,CAAC;IACN,CAAC;IAED,gDAAgD;IACzC,SAAS,CACd,EAAU,EACV,UAAoC,EAAE;QAEtC,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;QACrB,OAAO,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;QACjC,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK;YACzB,CAAC,CAAC,IAAI,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;YACzE,CAAC,CAAC,SAAS,CAAC;QACd,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,EAAE,EAAE,OAAO,CAAC,SAAS,IAAI,UAAU,EAAE,KAAK,CAAC,CAAC;QACzE,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,MAAM,CAAC,iBAAiB,CAAC;QACxD,MAAM,eAAe,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAChE,MAAM,KAAK,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QAC9C,OAAO;YACL,KAAK;YACL,IAAI,EAAE;gBACJ,YAAY,EAAE,CAAC;gBACf,cAAc,EAAE,IAAI,CAAC,MAAM;gBAC3B,SAAS,EAAE,KAAK,CAAC,MAAM,GAAG,eAAe,CAAC,MAAM;gBAChD,UAAU,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;aACzB;SACF,CAAC;IACJ,CAAC;IAED,0EAA0E;IACnE,OAAO,CACZ,EAAU,EACV,UAAoC,EAAE;QAEtC,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;QACrB,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK;YACzB,CAAC,CAAC,IAAI,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;YACzE,CAAC,CAAC,SAAS,CAAC;QACd,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,UAAU,CAAC;QAClD,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,MAAM,CAAC,iBAAiB,CAAC;QACxD,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,MAAM,CAAC,iBAAiB,CAAC;QAC9D,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3B,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,MAAM,KAAK,GAAG,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QACjC,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,cAAc,GAAG,CAAC,CAAC;QACvB,IAAI,SAAS,GAAG,KAAK,CAAC;QACtB,SAAS,EAAE,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,KAAK,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;YAChE,OAAO,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;YACjC,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,CAAE,CAAC;YAC9B,YAAY,IAAI,CAAC,CAAC;YAClB,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;YAChE,cAAc,IAAI,SAAS,CAAC,MAAM,CAAC;YACnC,IAAI,OAAO,CAAC,KAAK,IAAI,QAAQ,EAAE,CAAC;gBAC9B,IAAI,SAAS,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;oBACtD,SAAS,GAAG,IAAI,CAAC;gBACnB,SAAS;YACX,CAAC;YACD,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,IAAI,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAAE,SAAS;gBACpC,IAAI,KAAK,CAAC,MAAM,IAAI,KAAK,EAAE,CAAC;oBAC1B,SAAS,GAAG,IAAI,CAAC;oBACjB,MAAM,SAAS,CAAC;gBAClB,CAAC;gBACD,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;gBACtB,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;gBACxB,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,QAAQ,CAAC,EAAE,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;YAC5D,CAAC;QACH,CAAC;QACD,OAAO;YACL,KAAK;YACL,IAAI,EAAE;gBACJ,YAAY;gBACZ,cAAc;gBACd,SAAS;gBACT,UAAU,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;aACzB;SACF,CAAC;IACJ,CAAC;IAED,iFAAiF;IAC1E,YAAY,CACjB,MAAc,EACd,MAAc,EACd,UAAoC,EAAE;QAEtC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QACzB,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QACzB,IAAI,MAAM,KAAK,MAAM;YACnB,OAAO;gBACL,KAAK,EAAE,CAAC,MAAM,CAAC;gBACf,IAAI,EAAE,EAAE,YAAY,EAAE,CAAC,EAAE,cAAc,EAAE,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE;aAC/D,CAAC;QACJ,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK;YACzB,CAAC,CAAC,IAAI,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;YACzE,CAAC,CAAC,SAAS,CAAC;QACd,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,UAAU,CAAC;QAClD,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,MAAM,CAAC,iBAAiB,CAAC;QAC9D,MAAM,KAAK,GAAG,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QACzC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC1C,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;QAC/B,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,IAAI,cAAc,GAAG,CAAC,CAAC;QACvB,IAAI,SAAS,GAAG,KAAK,CAAC;QACtB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,KAAK,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;YACrD,OAAO,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC;YACjC,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,CAAE,CAAC;YAC9B,YAAY,IAAI,CAAC,CAAC;YAClB,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,EAAE,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;YAChE,cAAc,IAAI,SAAS,CAAC,MAAM,CAAC;YACnC,IAAI,OAAO,CAAC,KAAK,IAAI,QAAQ,EAAE,CAAC;gBAC9B,IAAI,SAAS,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;oBACtD,SAAS,GAAG,IAAI,CAAC;gBACnB,SAAS;YACX,CAAC;YACD,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,IAAI,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAAE,SAAS;gBACpC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,EAAE,OAAO,CAAC,EAAE,CAAC,CAAC;gBACrC,IAAI,QAAQ,CAAC,EAAE,KAAK,MAAM;oBACxB,OAAO;wBACL,KAAK,EAAE,eAAe,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC;wBAC/C,IAAI,EAAE,EAAE,YAAY,EAAE,cAAc,EAAE,SAAS,EAAE,KAAK,EAAE;qBACzD,CAAC;gBACJ,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;gBACtB,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,QAAQ,CAAC,EAAE,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;YAC5D,CAAC;QACH,CAAC;QACD,OAAO;YACL,KAAK,EAAE,EAAE;YACT,IAAI,EAAE,EAAE,YAAY,EAAE,cAAc,EAAE,SAAS,EAAE;SAClD,CAAC;IACJ,CAAC;IAED,6EAA6E;IACtE,QAAQ,CACb,EAAU,EACV,UAAoC,EAAE;QAEtC,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;QAC1C,MAAM,KAAK,GAAG,CAAC,EAAE,EAAE,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;QAC5C,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;QAChC,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK;YACzB,CAAC,CAAC,IAAI,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;YACzE,CAAC,CAAC,SAAS,CAAC;QACd,MAAM,KAAK,GAAG,IAAI,GAAG,EAAoB,CAAC;QAC1C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;gBAClD,IACE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC;oBACzB,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC;oBACzB,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,KAAK,CAAC;oBAE/B,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;QACD,OAAO;YACL,KAAK,EAAE;gBACL,KAAK;gBACL,KAAK,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC;aACrC;YACD,IAAI,EAAE,OAAO,CAAC,IAAI;SACnB,CAAC;IACJ,CAAC;CACF;AAED,gFAAgF;AAChF,MAAM,UAAU,wBAAwB,CACtC,MAAc,EACd,UAAsB,EACtB,WAAqC,eAAe;IAEpD,OAAO;QACL,MAAM;QACN,MAAM,EAAE,UAAU,CAAC,EAAE;QACrB,IAAI,EAAE,QAAQ,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,IAAI;QAC5C,SAAS,EAAE,UAAU,CAAC,UAAU;QAChC,MAAM,EAAE,UAAU,CAAC,MAAM;KAC1B,CAAC;AACJ,CAAC","debugId":"f5e9e0a6-4550-5e55-9fef-ee54ec06a495"}

package/dist/sdk/runtime-input.d.ts

@@ -0,0 +1,10 @@
+/** Read a non-empty string without altering its caller-provided whitespace. */
+export declare function readRuntimeString(args: Record<string, unknown>, key: string): string | undefined;
+/** Normalize a non-empty string or finite number into a scalar string. */
+export declare function readRuntimeScalarString(args: Record<string, unknown>, key: string): string | undefined;
+/** Normalize a string, including blank text, or a finite number into text. */
+export declare function readRuntimeScalarStringAllowBlank(args: Record<string, unknown>, key: string): string | undefined;
+/** Narrow unknown values to plain record-shaped action payloads. */
+export declare function isRuntimeRecord(value: unknown): value is Record<string, unknown>;
+/** Parse an integer-valued MCP option while retaining a caller-specific label. */
+export declare function parseRuntimeInteger(value: unknown, label: string): number | undefined;