@unbrained/pm-cli 2026.9.7 → 2026.9.8

package/dist/sdk/relationships.js

@@ -1,580 +1,2 @@
-
-!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]="d7d44fba-603b-5ef2-8490-51112b929433")}catch(e){}}();
-import { BUILTIN_RELATIONSHIP_KINDS, } from "./relationship-kinds/contract.js";
-export { BUILTIN_RELATIONSHIP_KINDS, } from "./relationship-kinds/contract.js";
-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 assertRelationshipTemporalOrder(definition, kind) {
-    if (definition.temporalOrder !== undefined &&
-        definition.temporalOrder !== "source_after_target")
-        throw new TypeError(`Invalid relationship temporal order for ${kind}`);
-    if (definition.direction !== "directed" &&
-        definition.temporalOrder !== undefined)
-        throw new TypeError(`Undirected relationship kind cannot declare temporal order: ${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}`);
-}
-/** Validate and normalize the stable identifier and compatibility version. */
-function normalizeRelationshipKindIdentifier(definition) {
-    if (typeof definition !== "object" || definition === null)
-        throw new TypeError("Relationship kind definition requires an object");
-    if (typeof definition.kind !== "string")
-        throw new TypeError("Relationship kind requires a string identifier");
-    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}`);
-    return kind;
-}
-/** Validate traversal, ordering, hierarchy, cardinality, and lifecycle semantics. */
-function assertRelationshipKindSemantics(definition, kind) {
-    if (!["directed", "undirected"].includes(definition.direction))
-        throw new TypeError(`Invalid relationship direction for ${kind}`);
-    if (typeof definition.ordering !== "boolean")
-        throw new TypeError(`Invalid relationship ordering flag for ${kind}`);
-    if (![undefined, true, false].includes(definition.hierarchy))
-        throw new TypeError(`Invalid relationship hierarchy flag for ${kind}`);
-    if (!["one", "many"].includes(definition.outgoing))
-        throw new TypeError(`Invalid outgoing relationship cardinality for ${kind}`);
-    if (!["one", "many"].includes(definition.incoming))
-        throw new TypeError(`Invalid incoming relationship cardinality for ${kind}`);
-    if (!["persistent", "supersedable", "ephemeral"].includes(definition.lifecycle))
-        throw new TypeError(`Invalid relationship lifecycle for ${kind}`);
-    if (typeof definition.allowSelf !== "boolean")
-        throw new TypeError(`Invalid relationship self-edge flag for ${kind}`);
-    if (definition.traversal !== undefined &&
-        !["hierarchy", "ordering", "semantic", "association"].includes(definition.traversal))
-        throw new TypeError(`Invalid relationship traversal family for ${kind}`);
-    if (definition.outcomeTraversal !== undefined &&
-        !["source_to_target", "target_to_source", "both"].includes(definition.outcomeTraversal))
-        throw new TypeError(`Invalid outcome traversal for ${kind}`);
-    if (definition.direction === "undirected" &&
-        definition.outcomeTraversal !== undefined &&
-        definition.outcomeTraversal !== "both")
-        throw new TypeError(`Undirected relationship kind cannot declare directional outcome traversal: ${kind}`);
-}
-/** Validate application payload-schema and compatibility-alias containers. */
-function assertRelationshipKindPayload(definition, kind) {
-    if (definition.payloadSchema !== undefined &&
-        (typeof definition.payloadSchema !== "object" ||
-            definition.payloadSchema === null ||
-            Array.isArray(definition.payloadSchema)))
-        throw new TypeError(`Invalid relationship payload schema for ${kind}`);
-    if (definition.aliases !== undefined &&
-        (!Array.isArray(definition.aliases) ||
-            definition.aliases.some((alias) => typeof alias !== "string")))
-        throw new TypeError(`Invalid relationship aliases for ${kind}`);
-}
-function resolveRelationshipTraversal(definition) {
-    if (definition.traversal)
-        return definition.traversal;
-    // Dual-family extension kinds use ordering precedence, matching relationship
-    // context role classification. Explicit traversal always remains authoritative.
-    if (definition.ordering)
-        return "ordering";
-    if (definition.hierarchy)
-        return "hierarchy";
-    return definition.direction === "undirected" ? "association" : "semantic";
-}
-/** 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 = normalizeRelationshipKindIdentifier(definition);
-        assertRelationshipKindSemantics(definition, kind);
-        assertRelationshipKindPayload(definition, kind);
-        assertRelationshipPrecedence(definition, kind);
-        assertRelationshipTemporalOrder(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,
-            traversal: resolveRelationshipTraversal(definition),
-            hierarchy: definition.hierarchy ?? false,
-            hierarchyDirection: definition.hierarchy
-                ? (definition.hierarchyDirection ?? "source_parent")
-                : undefined,
-            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();
-/** Resolve an accepted built-in relationship spelling to its canonical stored kind. */
-export function canonicalizeRelationshipKind(kind) {
-    return defaultRegistry.require(kind).kind;
-}
-/** Resolve an accepted built-in relationship spelling, returning undefined for unknown kinds. */
-export function resolveCanonicalRelationshipKind(kind) {
-    return defaultRegistry.resolve(kind)?.kind;
-}
-/** Report whether a kind participates in execution-order cycle detection. */
-export function isOrderingRelationshipKind(kind, registry = defaultRegistry) {
-    return registry.resolve(kind)?.ordering === true;
-}
-/**
- * Validate one prospective edge against the resolved relationship ontology.
- *
- * Mutation adapters use this before persistence so aliases, extension-defined
- * kinds, and self-edge policy share the same semantics as graph construction.
- * The canonical definition is returned for callers that also need normalized
- * kind metadata.
- */
-export function assertRelationshipEdgeAllowed(source, target, kind, registry = defaultRegistry) {
-    const normalizedSource = normalizeNodeId(source);
-    const normalizedTarget = normalizeNodeId(target);
-    if (!normalizedSource || !normalizedTarget) {
-        throw new TypeError("Relationship endpoint must not be empty");
-    }
-    const definition = registry.require(kind);
-    if (normalizedSource === normalizedTarget && !definition.allowSelf) {
-        throw new TypeError(`Self relationship is not allowed for ${definition.kind}`);
-    }
-    return definition;
-}
-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() : "";
-    if (!nodes.has(source) || !nodes.has(target))
-        throw new TypeError(`Relationship endpoint not found: ${source} -> ${target}`);
-    const definition = assertRelationshipEdgeAllowed(source, target, candidate.kind, registry);
-    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;
-    }
-    /** Report whether an identifier names an indexed node. */
-    hasNode(id) {
-        return this.#nodes.has(id);
-    }
-    /** Return the registry that interprets this graph's relationship kinds. */
-    registry() {
-        return this.#registry;
-    }
-    #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 deterministic one-hop neighbor rows paired with each connecting edge. */
-    neighborEdges(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 value = rows.slice(0, limit);
-        return {
-            value,
-            meta: {
-                visitedNodes: 1,
-                inspectedEdges: rows.length,
-                truncated: value.length < rows.length,
-                nextCursor: value.at(-1)?.id,
-            },
-        };
-    }
-    /** 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,
-    };
-}
+!(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]="b658dc99-fdbb-5d10-9dd6-5f5c263bf48b")}catch(e2){}})();import{BUILTIN_RELATIONSHIP_KINDS}from"./relationship-kinds/contract.js";import{BUILTIN_RELATIONSHIP_KINDS as BUILTIN_RELATIONSHIP_KINDS2}from"./relationship-kinds/contract.js";function normalizeKind(kind){return kind.trim().toLowerCase().replaceAll("-","_")}function normalizeInverseKind(inverse){if(inverse===void 0)return void 0;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!==void 0&&definition.precedence!=="source_before_target"&&definition.precedence!=="target_before_source")throw new TypeError(`Invalid relationship precedence for ${kind}`);if(!definition.ordering&&definition.precedence!==void 0)throw new TypeError(`Non-ordering relationship kind cannot declare precedence: ${kind}`)}function assertRelationshipTemporalOrder(definition,kind){if(definition.temporalOrder!==void 0&&definition.temporalOrder!=="source_after_target")throw new TypeError(`Invalid relationship temporal order for ${kind}`);if(definition.direction!=="directed"&&definition.temporalOrder!==void 0)throw new TypeError(`Undirected relationship kind cannot declare temporal order: ${kind}`)}function assertRelationshipHierarchyDirection(definition,kind){if(definition.hierarchyDirection!==void 0&&definition.hierarchyDirection!=="source_parent"&&definition.hierarchyDirection!=="target_parent")throw new TypeError(`Invalid relationship hierarchy direction for ${kind}`);if(!definition.hierarchy&&definition.hierarchyDirection!==void 0)throw new TypeError(`Non-hierarchy relationship kind cannot declare hierarchy direction: ${kind}`)}function normalizeRelationshipKindIdentifier(definition){if(typeof definition!=="object"||definition===null)throw new TypeError("Relationship kind definition requires an object");if(typeof definition.kind!=="string")throw new TypeError("Relationship kind requires a string identifier");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}`);return kind}function assertRelationshipKindSemantics(definition,kind){if(!["directed","undirected"].includes(definition.direction))throw new TypeError(`Invalid relationship direction for ${kind}`);if(typeof definition.ordering!=="boolean")throw new TypeError(`Invalid relationship ordering flag for ${kind}`);if(![void 0,true,false].includes(definition.hierarchy))throw new TypeError(`Invalid relationship hierarchy flag for ${kind}`);if(!["one","many"].includes(definition.outgoing))throw new TypeError(`Invalid outgoing relationship cardinality for ${kind}`);if(!["one","many"].includes(definition.incoming))throw new TypeError(`Invalid incoming relationship cardinality for ${kind}`);if(!["persistent","supersedable","ephemeral"].includes(definition.lifecycle))throw new TypeError(`Invalid relationship lifecycle for ${kind}`);if(typeof definition.allowSelf!=="boolean")throw new TypeError(`Invalid relationship self-edge flag for ${kind}`);if(definition.traversal!==void 0&&!["hierarchy","ordering","semantic","association"].includes(definition.traversal))throw new TypeError(`Invalid relationship traversal family for ${kind}`);if(definition.outcomeTraversal!==void 0&&!["source_to_target","target_to_source","both"].includes(definition.outcomeTraversal))throw new TypeError(`Invalid outcome traversal for ${kind}`);if(definition.direction==="undirected"&&definition.outcomeTraversal!==void 0&&definition.outcomeTraversal!=="both")throw new TypeError(`Undirected relationship kind cannot declare directional outcome traversal: ${kind}`)}function assertRelationshipKindPayload(definition,kind){if(definition.payloadSchema!==void 0&&(typeof definition.payloadSchema!=="object"||definition.payloadSchema===null||Array.isArray(definition.payloadSchema)))throw new TypeError(`Invalid relationship payload schema for ${kind}`);if(definition.aliases!==void 0&&(!Array.isArray(definition.aliases)||definition.aliases.some(alias=>typeof alias!=="string")))throw new TypeError(`Invalid relationship aliases for ${kind}`)}function resolveRelationshipTraversal(definition){if(definition.traversal)return definition.traversal;if(definition.ordering)return"ordering";if(definition.hierarchy)return"hierarchy";return definition.direction==="undirected"?"association":"semantic"}class RelationshipKindRegistry{#definitions=new Map;#aliases=new Map;constructor(definitions=BUILTIN_RELATIONSHIP_KINDS){for(const definition of definitions)this.register(definition)}register(definition){const kind=normalizeRelationshipKindIdentifier(definition);assertRelationshipKindSemantics(definition,kind);assertRelationshipKindPayload(definition,kind);assertRelationshipPrecedence(definition,kind);assertRelationshipTemporalOrder(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,traversal:resolveRelationshipTraversal(definition),hierarchy:definition.hierarchy??false,hierarchyDirection:definition.hierarchy?definition.hierarchyDirection??"source_parent":void 0,inverse,aliases:Object.freeze(aliases),payloadSchema:definition.payloadSchema?freezeValue(structuredClone(definition.payloadSchema)):void 0});this.#definitions.set(kind,normalized);for(const alias of aliases)this.#aliases.set(alias,kind);return this}resolve(kind){if(typeof kind!=="string")return void 0;const normalized=normalizeKind(kind);return this.#definitions.get(this.#aliases.get(normalized)??normalized)}require(kind){const definition=this.resolve(kind);if(!definition)throw new TypeError(`Unknown relationship kind: ${kind}`);return definition}list(){return Object.freeze([...this.#definitions.values()].sort((left,right)=>left.kind.localeCompare(right.kind)))}}function createRelationshipKindRegistry(){return new RelationshipKindRegistry}const defaultRegistry=createRelationshipKindRegistry();function canonicalizeRelationshipKind(kind){return defaultRegistry.require(kind).kind}function resolveCanonicalRelationshipKind(kind){return defaultRegistry.resolve(kind)?.kind}function isOrderingRelationshipKind(kind,registry=defaultRegistry){return registry.resolve(kind)?.ordering===true}function assertRelationshipEdgeAllowed(source,target,kind,registry=defaultRegistry){const normalizedSource=normalizeNodeId(source);const normalizedTarget=normalizeNodeId(target);if(!normalizedSource||!normalizedTarget){throw new TypeError("Relationship endpoint must not be empty")}const definition=registry.require(kind);if(normalizedSource===normalizedTarget&&!definition.allowSelf){throw new TypeError(`Self relationship is not allowed for ${definition.kind}`)}return definition}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():"";if(!nodes.has(source)||!nodes.has(target))throw new TypeError(`Relationship endpoint not found: ${source} -> ${target}`);const definition=assertRelationshipEdgeAllowed(source,target,candidate.kind,registry);const edge=Object.freeze({...candidate,source,target,kind:definition.kind});const endpoints=definition.direction==="undirected"?[source,target].sort().join("\0"):`${source}\0${target}`;return{edge,identity:`${definition.kind}\0${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:void 0}function reconstructPath(source,target,parents){const path=[target];let cursor=target;while(cursor!==source){cursor=parents.get(cursor);path.push(cursor)}return path.reverse()}class RelationshipGraph{#registry;#nodes;#nodeSnapshot;#edges;#outgoing=new Map;#incoming=new Map;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)}}}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)}edges(){return this.#edges}incidentEdges(id){this.#assertNode(id);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===void 0?incomingEdge:incomingEdge===void 0||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)}nodes(){return this.#nodeSnapshot}hasNode(id){return this.#nodes.has(id)}registry(){return this.#registry}#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!==void 0&&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))}adjacency(id,options={}){this.#assertNode(id);options.signal?.throwIfAborted();const kinds=options.kinds?new Set(options.kinds.map(kind=>this.#registry.require(kind).kind)):void 0;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)}}}neighborEdges(id,options={}){this.#assertNode(id);options.signal?.throwIfAborted();const kinds=options.kinds?new Set(options.kinds.map(kind=>this.#registry.require(kind).kind)):void 0;const rows=this.#neighbors(id,options.direction??"outgoing",kinds);const limit=options.limit??Number.POSITIVE_INFINITY;const value=rows.slice(0,limit);return{value,meta:{visitedNodes:1,inspectedEdges:rows.length,truncated:value.length<rows.length,nextCursor:value.at(-1)?.id}}}closure(id,options={}){this.#assertNode(id);const kinds=options.kinds?new Set(options.kinds.map(kind=>this.#registry.require(kind).kind)):void 0;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)}}}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)):void 0;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}}}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)):void 0;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}}}function dependencyToRelationship(source,dependency,registry=defaultRegistry){return{source,target:dependency.id,kind:registry.require(dependency.kind).kind,createdAt:dependency.created_at,author:dependency.author}}export{BUILTIN_RELATIONSHIP_KINDS2 as BUILTIN_RELATIONSHIP_KINDS,RelationshipGraph,RelationshipKindRegistry,assertRelationshipEdgeAllowed,canonicalizeRelationshipKind,createRelationshipKindRegistry,dependencyToRelationship,isOrderingRelationshipKind,resolveCanonicalRelationshipKind};
 //# sourceMappingURL=relationships.js.map
-//# debugId=d7d44fba-603b-5ef2-8490-51112b929433