cmp-standards 2.8.1 → 3.1.0

package/dist/services/MemoryRelationshipService.d.ts

@@ -0,0 +1,187 @@
+/**
+ * Memory Relationship Service
+ *
+ * Tracks and manages relationships between memory items:
+ * - related_to: General relationship
+ * - derived_from: Source/origin relationship
+ * - supersedes: Replacement relationship
+ * - references: Citation relationship
+ * - depends_on: Dependency relationship
+ *
+ * @version 3.1.0
+ */
+/**
+ * Relationship types between memories
+ */
+export type RelationshipType = 'related_to' | 'derived_from' | 'supersedes' | 'references' | 'depends_on' | 'parent_of' | 'child_of' | 'blocks' | 'blocked_by';
+/**
+ * A relationship between two memories
+ */
+export interface MemoryRelationship {
+    id: string;
+    sourceId: string;
+    targetId: string;
+    type: RelationshipType;
+    metadata?: Record<string, unknown>;
+    createdAt: Date;
+    createdBy?: string;
+}
+/**
+ * Configuration for the relationship service
+ */
+export interface RelationshipServiceConfig {
+    /** Enable debug logging */
+    debug?: boolean;
+    /** Maximum relationships per memory */
+    maxRelationshipsPerItem?: number;
+    /** Store backend (in-memory for now) */
+    store?: RelationshipStore;
+}
+/**
+ * Interface for relationship storage backends
+ */
+export interface RelationshipStore {
+    save(relationship: MemoryRelationship): Promise<void>;
+    delete(id: string): Promise<boolean>;
+    findBySource(sourceId: string): Promise<MemoryRelationship[]>;
+    findByTarget(targetId: string): Promise<MemoryRelationship[]>;
+    findByType(type: RelationshipType): Promise<MemoryRelationship[]>;
+    findBetween(sourceId: string, targetId: string): Promise<MemoryRelationship[]>;
+    getAll(): Promise<MemoryRelationship[]>;
+    clear(): Promise<void>;
+}
+/**
+ * Error thrown when relationship operations fail
+ */
+export declare class RelationshipError extends Error {
+    readonly code: 'MAX_RELATIONSHIPS' | 'DUPLICATE' | 'NOT_FOUND' | 'INVALID_SELF_REFERENCE' | 'CYCLE_DETECTED';
+    constructor(message: string, code: 'MAX_RELATIONSHIPS' | 'DUPLICATE' | 'NOT_FOUND' | 'INVALID_SELF_REFERENCE' | 'CYCLE_DETECTED');
+}
+/**
+ * Simple in-memory store for relationships
+ */
+export declare class InMemoryRelationshipStore implements RelationshipStore {
+    private relationships;
+    save(relationship: MemoryRelationship): Promise<void>;
+    delete(id: string): Promise<boolean>;
+    findBySource(sourceId: string): Promise<MemoryRelationship[]>;
+    findByTarget(targetId: string): Promise<MemoryRelationship[]>;
+    findByType(type: RelationshipType): Promise<MemoryRelationship[]>;
+    findBetween(sourceId: string, targetId: string): Promise<MemoryRelationship[]>;
+    getAll(): Promise<MemoryRelationship[]>;
+    clear(): Promise<void>;
+}
+/**
+ * Service for managing relationships between memory items
+ */
+export declare class MemoryRelationshipService {
+    private config;
+    private store;
+    constructor(config?: RelationshipServiceConfig);
+    /**
+     * Create a relationship between two memories
+     */
+    createRelationship(sourceId: string, targetId: string, type: RelationshipType, options?: {
+        metadata?: Record<string, unknown>;
+        createdBy?: string;
+    }): Promise<MemoryRelationship>;
+    /**
+     * Remove a relationship by ID
+     */
+    removeRelationship(id: string): Promise<boolean>;
+    /**
+     * Remove all relationships between two items
+     */
+    removeRelationshipsBetween(sourceId: string, targetId: string): Promise<number>;
+    /**
+     * Get all relationships for a memory item (both as source and target)
+     */
+    getRelationshipsFor(itemId: string): Promise<{
+        outgoing: MemoryRelationship[];
+        incoming: MemoryRelationship[];
+    }>;
+    /**
+     * Get related items by relationship type
+     */
+    getRelatedItems(itemId: string, type: RelationshipType, direction?: 'outgoing' | 'incoming' | 'both'): Promise<string[]>;
+    /**
+     * Find all descendants (transitive closure) of an item
+     * Useful for hierarchical relationships
+     */
+    getDescendants(itemId: string, type?: RelationshipType, maxDepth?: number): Promise<Map<string, number>>;
+    /**
+     * Find all ancestors (inverse transitive closure) of an item
+     */
+    getAncestors(itemId: string, type?: RelationshipType, maxDepth?: number): Promise<Map<string, number>>;
+    /**
+     * Check if a relationship exists
+     */
+    hasRelationship(sourceId: string, targetId: string, type?: RelationshipType): Promise<boolean>;
+    /**
+     * Get all relationships of a specific type
+     */
+    getRelationshipsByType(type: RelationshipType): Promise<MemoryRelationship[]>;
+    /**
+     * Build a relationship graph for visualization
+     */
+    buildGraph(options?: {
+        types?: RelationshipType[];
+        rootItems?: string[];
+    }): Promise<{
+        nodes: Array<{
+            id: string;
+            relationshipCount: number;
+        }>;
+        edges: Array<{
+            source: string;
+            target: string;
+            type: RelationshipType;
+        }>;
+    }>;
+    /**
+     * Detect cycles in directed relationships
+     */
+    private detectCycle;
+    /**
+     * Get statistics about relationships
+     */
+    getStats(): Promise<{
+        totalRelationships: number;
+        byType: Record<RelationshipType, number>;
+        uniqueItems: number;
+    }>;
+    /**
+     * Clear all relationships
+     */
+    clear(): Promise<void>;
+}
+/**
+ * Get the global relationship service instance
+ */
+export declare function getRelationshipService(config?: RelationshipServiceConfig): MemoryRelationshipService;
+/**
+ * Reset the global relationship service instance
+ */
+export declare function resetRelationshipService(): void;
+/**
+ * Create bidirectional relationship (e.g., A related_to B and B related_to A)
+ */
+export declare function createBidirectionalRelationship(service: MemoryRelationshipService, itemA: string, itemB: string, type: RelationshipType, options?: {
+    metadata?: Record<string, unknown>;
+    createdBy?: string;
+}): Promise<[MemoryRelationship, MemoryRelationship]>;
+/**
+ * Create parent-child relationship (creates both parent_of and child_of)
+ */
+export declare function createHierarchy(service: MemoryRelationshipService, parentId: string, childId: string, options?: {
+    metadata?: Record<string, unknown>;
+    createdBy?: string;
+}): Promise<[MemoryRelationship, MemoryRelationship]>;
+/**
+ * Mark a memory as superseding another (deprecation pattern)
+ */
+export declare function supersede(service: MemoryRelationshipService, newItemId: string, oldItemId: string, options?: {
+    metadata?: Record<string, unknown>;
+    createdBy?: string;
+}): Promise<MemoryRelationship>;
+//# sourceMappingURL=MemoryRelationshipService.d.ts.map

package/dist/services/MemoryRelationshipService.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"MemoryRelationshipService.d.ts","sourceRoot":"","sources":["../../src/services/MemoryRelationshipService.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AASH;;GAEG;AACH,MAAM,MAAM,gBAAgB,GACxB,YAAY,GACZ,cAAc,GACd,YAAY,GACZ,YAAY,GACZ,YAAY,GACZ,WAAW,GACX,UAAU,GACV,QAAQ,GACR,YAAY,CAAA;AAEhB;;GAEG;AACH,MAAM,WAAW,kBAAkB;IACjC,EAAE,EAAE,MAAM,CAAA;IACV,QAAQ,EAAE,MAAM,CAAA;IAChB,QAAQ,EAAE,MAAM,CAAA;IAChB,IAAI,EAAE,gBAAgB,CAAA;IACtB,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;IAClC,SAAS,EAAE,IAAI,CAAA;IACf,SAAS,CAAC,EAAE,MAAM,CAAA;CACnB;AAED;;GAEG;AACH,MAAM,WAAW,yBAAyB;IACxC,2BAA2B;IAC3B,KAAK,CAAC,EAAE,OAAO,CAAA;IACf,uCAAuC;IACvC,uBAAuB,CAAC,EAAE,MAAM,CAAA;IAChC,wCAAwC;IACxC,KAAK,CAAC,EAAE,iBAAiB,CAAA;CAC1B;AAED;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAChC,IAAI,CAAC,YAAY,EAAE,kBAAkB,GAAG,OAAO,CAAC,IAAI,CAAC,CAAA;IACrD,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAAA;IACpC,YAAY,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,kBAAkB,EAAE,CAAC,CAAA;IAC7D,YAAY,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,kBAAkB,EAAE,CAAC,CAAA;IAC7D,UAAU,CAAC,IAAI,EAAE,gBAAgB,GAAG,OAAO,CAAC,kBAAkB,EAAE,CAAC,CAAA;IACjE,WAAW,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,kBAAkB,EAAE,CAAC,CAAA;IAC9E,MAAM,IAAI,OAAO,CAAC,kBAAkB,EAAE,CAAC,CAAA;IACvC,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC,CAAA;CACvB;AAED;;GAEG;AACH,qBAAa,iBAAkB,SAAQ,KAAK;aAGxB,IAAI,EAAE,mBAAmB,GAAG,WAAW,GAAG,WAAW,GAAG,wBAAwB,GAAG,gBAAgB;gBADnH,OAAO,EAAE,MAAM,EACC,IAAI,EAAE,mBAAmB,GAAG,WAAW,GAAG,WAAW,GAAG,wBAAwB,GAAG,gBAAgB;CAKtH;AAMD;;GAEG;AACH,qBAAa,yBAA0B,YAAW,iBAAiB;IACjE,OAAO,CAAC,aAAa,CAAwC;IAEvD,IAAI,CAAC,YAAY,EAAE,kBAAkB,GAAG,OAAO,CAAC,IAAI,CAAC;IAIrD,MAAM,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAIpC,YAAY,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,kBAAkB,EAAE,CAAC;IAK7D,YAAY,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,kBAAkB,EAAE,CAAC;IAK7D,UAAU,CAAC,IAAI,EAAE,gBAAgB,GAAG,OAAO,CAAC,kBAAkB,EAAE,CAAC;IAKjE,WAAW,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,kBAAkB,EAAE,CAAC;IAK9E,MAAM,IAAI,OAAO,CAAC,kBAAkB,EAAE,CAAC;IAIvC,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;CAG7B;AAMD;;GAEG;AACH,qBAAa,yBAAyB;IACpC,OAAO,CAAC,MAAM,CAAqC;IACnD,OAAO,CAAC,KAAK,CAAmB;gBAEpB,MAAM,GAAE,yBAA8B;IASlD;;OAEG;IACG,kBAAkB,CACtB,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,MAAM,EAChB,IAAI,EAAE,gBAAgB,EACtB,OAAO,CAAC,EAAE;QAAE,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QAAC,SAAS,CAAC,EAAE,MAAM,CAAA;KAAE,GACnE,OAAO,CAAC,kBAAkB,CAAC;IAyD9B;;OAEG;IACG,kBAAkB,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC;IAUtD;;OAEG;IACG,0BAA0B,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;IAUrF;;OAEG;IACG,mBAAmB,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC;QACjD,QAAQ,EAAE,kBAAkB,EAAE,CAAA;QAC9B,QAAQ,EAAE,kBAAkB,EAAE,CAAA;KAC/B,CAAC;IASF;;OAEG;IACG,eAAe,CACnB,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,gBAAgB,EACtB,SAAS,GAAE,UAAU,GAAG,UAAU,GAAG,MAAe,GACnD,OAAO,CAAC,MAAM,EAAE,CAAC;IAwBpB;;;OAGG;IACG,cAAc,CAClB,MAAM,EAAE,MAAM,EACd,IAAI,GAAE,gBAA8B,EACpC,QAAQ,GAAE,MAAW,GACpB,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IA4B/B;;OAEG;IACG,YAAY,CAChB,MAAM,EAAE,MAAM,EACd,IAAI,GAAE,gBAA6B,EACnC,QAAQ,GAAE,MAAW,GACpB,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IA4B/B;;OAEG;IACG,eAAe,CACnB,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,MAAM,EAChB,IAAI,CAAC,EAAE,gBAAgB,GACtB,OAAO,CAAC,OAAO,CAAC;IAUnB;;OAEG;IACG,sBAAsB,CAAC,IAAI,EAAE,gBAAgB,GAAG,OAAO,CAAC,kBAAkB,EAAE,CAAC;IAInF;;OAEG;IACG,UAAU,CAAC,OAAO,CAAC,EAAE;QACzB,KAAK,CAAC,EAAE,gBAAgB,EAAE,CAAA;QAC1B,SAAS,CAAC,EAAE,MAAM,EAAE,CAAA;KACrB,GAAG,OAAO,CAAC;QACV,KAAK,EAAE,KAAK,CAAC;YAAE,EAAE,EAAE,MAAM,CAAC;YAAC,iBAAiB,EAAE,MAAM,CAAA;SAAE,CAAC,CAAA;QACvD,KAAK,EAAE,KAAK,CAAC;YAAE,MAAM,EAAE,MAAM,CAAC;YAAC,MAAM,EAAE,MAAM,CAAC;YAAC,IAAI,EAAE,gBAAgB,CAAA;SAAE,CAAC,CAAA;KACzE,CAAC;IA4CF;;OAEG;YACW,WAAW;IA8BzB;;OAEG;IACG,QAAQ,IAAI,OAAO,CAAC;QACxB,kBAAkB,EAAE,MAAM,CAAA;QAC1B,MAAM,EAAE,MAAM,CAAC,gBAAgB,EAAE,MAAM,CAAC,CAAA;QACxC,WAAW,EAAE,MAAM,CAAA;KACpB,CAAC;IAmBF;;OAEG;IACG,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;CAO7B;AAQD;;GAEG;AACH,wBAAgB,sBAAsB,CACpC,MAAM,CAAC,EAAE,yBAAyB,GACjC,yBAAyB,CAK3B;AAED;;GAEG;AACH,wBAAgB,wBAAwB,IAAI,IAAI,CAE/C;AAMD;;GAEG;AACH,wBAAsB,+BAA+B,CACnD,OAAO,EAAE,yBAAyB,EAClC,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,MAAM,EACb,IAAI,EAAE,gBAAgB,EACtB,OAAO,CAAC,EAAE;IAAE,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAAC,SAAS,CAAC,EAAE,MAAM,CAAA;CAAE,GACnE,OAAO,CAAC,CAAC,kBAAkB,EAAE,kBAAkB,CAAC,CAAC,CAInD;AAED;;GAEG;AACH,wBAAsB,eAAe,CACnC,OAAO,EAAE,yBAAyB,EAClC,QAAQ,EAAE,MAAM,EAChB,OAAO,EAAE,MAAM,EACf,OAAO,CAAC,EAAE;IAAE,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAAC,SAAS,CAAC,EAAE,MAAM,CAAA;CAAE,GACnE,OAAO,CAAC,CAAC,kBAAkB,EAAE,kBAAkB,CAAC,CAAC,CAInD;AAED;;GAEG;AACH,wBAAsB,SAAS,CAC7B,OAAO,EAAE,yBAAyB,EAClC,SAAS,EAAE,MAAM,EACjB,SAAS,EAAE,MAAM,EACjB,OAAO,CAAC,EAAE;IAAE,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAAC,SAAS,CAAC,EAAE,MAAM,CAAA;CAAE,GACnE,OAAO,CAAC,kBAAkB,CAAC,CAQ7B"}

package/dist/services/MemoryRelationshipService.js

@@ -0,0 +1,375 @@
+/**
+ * Memory Relationship Service
+ *
+ * Tracks and manages relationships between memory items:
+ * - related_to: General relationship
+ * - derived_from: Source/origin relationship
+ * - supersedes: Replacement relationship
+ * - references: Citation relationship
+ * - depends_on: Dependency relationship
+ *
+ * @version 3.1.0
+ */
+import { ulid } from 'ulid';
+/**
+ * Error thrown when relationship operations fail
+ */
+export class RelationshipError extends Error {
+    code;
+    constructor(message, code) {
+        super(message);
+        this.code = code;
+        this.name = 'RelationshipError';
+    }
+}
+// =============================================================================
+// In-Memory Store Implementation
+// =============================================================================
+/**
+ * Simple in-memory store for relationships
+ */
+export class InMemoryRelationshipStore {
+    relationships = new Map();
+    async save(relationship) {
+        this.relationships.set(relationship.id, relationship);
+    }
+    async delete(id) {
+        return this.relationships.delete(id);
+    }
+    async findBySource(sourceId) {
+        return Array.from(this.relationships.values())
+            .filter(r => r.sourceId === sourceId);
+    }
+    async findByTarget(targetId) {
+        return Array.from(this.relationships.values())
+            .filter(r => r.targetId === targetId);
+    }
+    async findByType(type) {
+        return Array.from(this.relationships.values())
+            .filter(r => r.type === type);
+    }
+    async findBetween(sourceId, targetId) {
+        return Array.from(this.relationships.values())
+            .filter(r => r.sourceId === sourceId && r.targetId === targetId);
+    }
+    async getAll() {
+        return Array.from(this.relationships.values());
+    }
+    async clear() {
+        this.relationships.clear();
+    }
+}
+// =============================================================================
+// Memory Relationship Service
+// =============================================================================
+/**
+ * Service for managing relationships between memory items
+ */
+export class MemoryRelationshipService {
+    config;
+    store;
+    constructor(config = {}) {
+        this.config = {
+            debug: config.debug ?? false,
+            maxRelationshipsPerItem: config.maxRelationshipsPerItem ?? 100,
+            store: config.store ?? new InMemoryRelationshipStore(),
+        };
+        this.store = this.config.store;
+    }
+    /**
+     * Create a relationship between two memories
+     */
+    async createRelationship(sourceId, targetId, type, options) {
+        // Validate: no self-references
+        if (sourceId === targetId) {
+            throw new RelationshipError('Cannot create self-referencing relationship', 'INVALID_SELF_REFERENCE');
+        }
+        // Check for duplicates
+        const existing = await this.store.findBetween(sourceId, targetId);
+        if (existing.some(r => r.type === type)) {
+            throw new RelationshipError(`Relationship of type '${type}' already exists between these items`, 'DUPLICATE');
+        }
+        // Check max relationships limit
+        const sourceRelationships = await this.store.findBySource(sourceId);
+        if (sourceRelationships.length >= this.config.maxRelationshipsPerItem) {
+            throw new RelationshipError(`Source item has reached maximum relationships (${this.config.maxRelationshipsPerItem})`, 'MAX_RELATIONSHIPS');
+        }
+        // Check for cycles in hierarchical relationships
+        if (type === 'parent_of' || type === 'child_of' || type === 'depends_on') {
+            const hasCycle = await this.detectCycle(sourceId, targetId, type);
+            if (hasCycle) {
+                throw new RelationshipError(`Creating this relationship would introduce a cycle`, 'CYCLE_DETECTED');
+            }
+        }
+        const relationship = {
+            id: ulid(),
+            sourceId,
+            targetId,
+            type,
+            metadata: options?.metadata,
+            createdAt: new Date(),
+            createdBy: options?.createdBy,
+        };
+        await this.store.save(relationship);
+        if (this.config.debug) {
+            console.log(`[Relationship] Created: ${sourceId} --${type}--> ${targetId}`);
+        }
+        return relationship;
+    }
+    /**
+     * Remove a relationship by ID
+     */
+    async removeRelationship(id) {
+        const deleted = await this.store.delete(id);
+        if (this.config.debug && deleted) {
+            console.log(`[Relationship] Removed: ${id}`);
+        }
+        return deleted;
+    }
+    /**
+     * Remove all relationships between two items
+     */
+    async removeRelationshipsBetween(sourceId, targetId) {
+        const relationships = await this.store.findBetween(sourceId, targetId);
+        for (const rel of relationships) {
+            await this.store.delete(rel.id);
+        }
+        return relationships.length;
+    }
+    /**
+     * Get all relationships for a memory item (both as source and target)
+     */
+    async getRelationshipsFor(itemId) {
+        const [outgoing, incoming] = await Promise.all([
+            this.store.findBySource(itemId),
+            this.store.findByTarget(itemId),
+        ]);
+        return { outgoing, incoming };
+    }
+    /**
+     * Get related items by relationship type
+     */
+    async getRelatedItems(itemId, type, direction = 'both') {
+        const relatedIds = new Set();
+        if (direction === 'outgoing' || direction === 'both') {
+            const outgoing = await this.store.findBySource(itemId);
+            for (const rel of outgoing) {
+                if (rel.type === type) {
+                    relatedIds.add(rel.targetId);
+                }
+            }
+        }
+        if (direction === 'incoming' || direction === 'both') {
+            const incoming = await this.store.findByTarget(itemId);
+            for (const rel of incoming) {
+                if (rel.type === type) {
+                    relatedIds.add(rel.sourceId);
+                }
+            }
+        }
+        return Array.from(relatedIds);
+    }
+    /**
+     * Find all descendants (transitive closure) of an item
+     * Useful for hierarchical relationships
+     */
+    async getDescendants(itemId, type = 'parent_of', maxDepth = 10) {
+        const descendants = new Map();
+        const visited = new Set();
+        const queue = [{ id: itemId, depth: 0 }];
+        while (queue.length > 0) {
+            const current = queue.shift();
+            if (visited.has(current.id) || current.depth > maxDepth) {
+                continue;
+            }
+            visited.add(current.id);
+            const children = await this.getRelatedItems(current.id, type, 'outgoing');
+            const childDepth = current.depth + 1;
+            for (const childId of children) {
+                if (!visited.has(childId) && childDepth <= maxDepth) {
+                    descendants.set(childId, childDepth);
+                    queue.push({ id: childId, depth: childDepth });
+                }
+            }
+        }
+        return descendants;
+    }
+    /**
+     * Find all ancestors (inverse transitive closure) of an item
+     */
+    async getAncestors(itemId, type = 'child_of', maxDepth = 10) {
+        const ancestors = new Map();
+        const visited = new Set();
+        const queue = [{ id: itemId, depth: 0 }];
+        while (queue.length > 0) {
+            const current = queue.shift();
+            if (visited.has(current.id) || current.depth > maxDepth) {
+                continue;
+            }
+            visited.add(current.id);
+            const parents = await this.getRelatedItems(current.id, type, 'outgoing');
+            const parentDepth = current.depth + 1;
+            for (const parentId of parents) {
+                if (!visited.has(parentId) && parentDepth <= maxDepth) {
+                    ancestors.set(parentId, parentDepth);
+                    queue.push({ id: parentId, depth: parentDepth });
+                }
+            }
+        }
+        return ancestors;
+    }
+    /**
+     * Check if a relationship exists
+     */
+    async hasRelationship(sourceId, targetId, type) {
+        const relationships = await this.store.findBetween(sourceId, targetId);
+        if (type) {
+            return relationships.some(r => r.type === type);
+        }
+        return relationships.length > 0;
+    }
+    /**
+     * Get all relationships of a specific type
+     */
+    async getRelationshipsByType(type) {
+        return this.store.findByType(type);
+    }
+    /**
+     * Build a relationship graph for visualization
+     */
+    async buildGraph(options) {
+        let relationships = await this.store.getAll();
+        if (options?.types) {
+            relationships = relationships.filter(r => options.types.includes(r.type));
+        }
+        if (options?.rootItems) {
+            const connected = new Set(options.rootItems);
+            // Find all connected items
+            for (const rel of relationships) {
+                if (connected.has(rel.sourceId) || connected.has(rel.targetId)) {
+                    connected.add(rel.sourceId);
+                    connected.add(rel.targetId);
+                }
+            }
+            relationships = relationships.filter(r => connected.has(r.sourceId) && connected.has(r.targetId));
+        }
+        // Build nodes
+        const nodeCounts = new Map();
+        for (const rel of relationships) {
+            nodeCounts.set(rel.sourceId, (nodeCounts.get(rel.sourceId) ?? 0) + 1);
+            nodeCounts.set(rel.targetId, (nodeCounts.get(rel.targetId) ?? 0) + 1);
+        }
+        const nodes = Array.from(nodeCounts.entries()).map(([id, count]) => ({
+            id,
+            relationshipCount: count,
+        }));
+        const edges = relationships.map(rel => ({
+            source: rel.sourceId,
+            target: rel.targetId,
+            type: rel.type,
+        }));
+        return { nodes, edges };
+    }
+    /**
+     * Detect cycles in directed relationships
+     */
+    async detectCycle(sourceId, targetId, type) {
+        // If adding source -> target, check if target can reach source
+        const visited = new Set();
+        const queue = [targetId];
+        while (queue.length > 0) {
+            const current = queue.shift();
+            if (visited.has(current))
+                continue;
+            visited.add(current);
+            if (current === sourceId) {
+                return true; // Cycle detected
+            }
+            const outgoing = await this.store.findBySource(current);
+            for (const rel of outgoing) {
+                if (rel.type === type && !visited.has(rel.targetId)) {
+                    queue.push(rel.targetId);
+                }
+            }
+        }
+        return false;
+    }
+    /**
+     * Get statistics about relationships
+     */
+    async getStats() {
+        const relationships = await this.store.getAll();
+        const byType = {};
+        const items = new Set();
+        for (const rel of relationships) {
+            byType[rel.type] = (byType[rel.type] ?? 0) + 1;
+            items.add(rel.sourceId);
+            items.add(rel.targetId);
+        }
+        return {
+            totalRelationships: relationships.length,
+            byType: byType,
+            uniqueItems: items.size,
+        };
+    }
+    /**
+     * Clear all relationships
+     */
+    async clear() {
+        await this.store.clear();
+        if (this.config.debug) {
+            console.log('[Relationship] All relationships cleared');
+        }
+    }
+}
+// =============================================================================
+// Global Instance
+// =============================================================================
+let globalInstance = null;
+/**
+ * Get the global relationship service instance
+ */
+export function getRelationshipService(config) {
+    if (!globalInstance) {
+        globalInstance = new MemoryRelationshipService(config);
+    }
+    return globalInstance;
+}
+/**
+ * Reset the global relationship service instance
+ */
+export function resetRelationshipService() {
+    globalInstance = null;
+}
+// =============================================================================
+// Helper Functions
+// =============================================================================
+/**
+ * Create bidirectional relationship (e.g., A related_to B and B related_to A)
+ */
+export async function createBidirectionalRelationship(service, itemA, itemB, type, options) {
+    const relA = await service.createRelationship(itemA, itemB, type, options);
+    const relB = await service.createRelationship(itemB, itemA, type, options);
+    return [relA, relB];
+}
+/**
+ * Create parent-child relationship (creates both parent_of and child_of)
+ */
+export async function createHierarchy(service, parentId, childId, options) {
+    const parentRel = await service.createRelationship(parentId, childId, 'parent_of', options);
+    const childRel = await service.createRelationship(childId, parentId, 'child_of', options);
+    return [parentRel, childRel];
+}
+/**
+ * Mark a memory as superseding another (deprecation pattern)
+ */
+export async function supersede(service, newItemId, oldItemId, options) {
+    return service.createRelationship(newItemId, oldItemId, 'supersedes', {
+        ...options,
+        metadata: {
+            ...options?.metadata,
+            supersededAt: new Date().toISOString(),
+        },
+    });
+}
+//# sourceMappingURL=MemoryRelationshipService.js.map

package/dist/services/MemoryRelationshipService.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"MemoryRelationshipService.js","sourceRoot":"","sources":["../../src/services/MemoryRelationshipService.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,EAAE,IAAI,EAAE,MAAM,MAAM,CAAA;AA4D3B;;GAEG;AACH,MAAM,OAAO,iBAAkB,SAAQ,KAAK;IAGxB;IAFlB,YACE,OAAe,EACC,IAAmG;QAEnH,KAAK,CAAC,OAAO,CAAC,CAAA;QAFE,SAAI,GAAJ,IAAI,CAA+F;QAGnH,IAAI,CAAC,IAAI,GAAG,mBAAmB,CAAA;IACjC,CAAC;CACF;AAED,gFAAgF;AAChF,iCAAiC;AACjC,gFAAgF;AAEhF;;GAEG;AACH,MAAM,OAAO,yBAAyB;IAC5B,aAAa,GAAG,IAAI,GAAG,EAA8B,CAAA;IAE7D,KAAK,CAAC,IAAI,CAAC,YAAgC;QACzC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,EAAE,YAAY,CAAC,CAAA;IACvD,CAAC;IAED,KAAK,CAAC,MAAM,CAAC,EAAU;QACrB,OAAO,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,EAAE,CAAC,CAAA;IACtC,CAAC;IAED,KAAK,CAAC,YAAY,CAAC,QAAgB;QACjC,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,CAAC;aAC3C,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAA;IACzC,CAAC;IAED,KAAK,CAAC,YAAY,CAAC,QAAgB;QACjC,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,CAAC;aAC3C,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAA;IACzC,CAAC;IAED,KAAK,CAAC,UAAU,CAAC,IAAsB;QACrC,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,CAAC;aAC3C,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAA;IACjC,CAAC;IAED,KAAK,CAAC,WAAW,CAAC,QAAgB,EAAE,QAAgB;QAClD,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,CAAC;aAC3C,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,QAAQ,IAAI,CAAC,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAA;IACpE,CAAC;IAED,KAAK,CAAC,MAAM;QACV,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,CAAC,CAAA;IAChD,CAAC;IAED,KAAK,CAAC,KAAK;QACT,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,CAAA;IAC5B,CAAC;CACF;AAED,gFAAgF;AAChF,8BAA8B;AAC9B,gFAAgF;AAEhF;;GAEG;AACH,MAAM,OAAO,yBAAyB;IAC5B,MAAM,CAAqC;IAC3C,KAAK,CAAmB;IAEhC,YAAY,SAAoC,EAAE;QAChD,IAAI,CAAC,MAAM,GAAG;YACZ,KAAK,EAAE,MAAM,CAAC,KAAK,IAAI,KAAK;YAC5B,uBAAuB,EAAE,MAAM,CAAC,uBAAuB,IAAI,GAAG;YAC9D,KAAK,EAAE,MAAM,CAAC,KAAK,IAAI,IAAI,yBAAyB,EAAE;SACvD,CAAA;QACD,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAA;IAChC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,kBAAkB,CACtB,QAAgB,EAChB,QAAgB,EAChB,IAAsB,EACtB,OAAoE;QAEpE,+BAA+B;QAC/B,IAAI,QAAQ,KAAK,QAAQ,EAAE,CAAC;YAC1B,MAAM,IAAI,iBAAiB,CACzB,6CAA6C,EAC7C,wBAAwB,CACzB,CAAA;QACH,CAAC;QAED,uBAAuB;QACvB,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAA;QACjE,IAAI,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;YACxC,MAAM,IAAI,iBAAiB,CACzB,yBAAyB,IAAI,sCAAsC,EACnE,WAAW,CACZ,CAAA;QACH,CAAC;QAED,gCAAgC;QAChC,MAAM,mBAAmB,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAA;QACnE,IAAI,mBAAmB,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,uBAAuB,EAAE,CAAC;YACtE,MAAM,IAAI,iBAAiB,CACzB,kDAAkD,IAAI,CAAC,MAAM,CAAC,uBAAuB,GAAG,EACxF,mBAAmB,CACpB,CAAA;QACH,CAAC;QAED,iDAAiD;QACjD,IAAI,IAAI,KAAK,WAAW,IAAI,IAAI,KAAK,UAAU,IAAI,IAAI,KAAK,YAAY,EAAE,CAAC;YACzE,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAA;YACjE,IAAI,QAAQ,EAAE,CAAC;gBACb,MAAM,IAAI,iBAAiB,CACzB,oDAAoD,EACpD,gBAAgB,CACjB,CAAA;YACH,CAAC;QACH,CAAC;QAED,MAAM,YAAY,GAAuB;YACvC,EAAE,EAAE,IAAI,EAAE;YACV,QAAQ;YACR,QAAQ;YACR,IAAI;YACJ,QAAQ,EAAE,OAAO,EAAE,QAAQ;YAC3B,SAAS,EAAE,IAAI,IAAI,EAAE;YACrB,SAAS,EAAE,OAAO,EAAE,SAAS;SAC9B,CAAA;QAED,MAAM,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,CAAA;QAEnC,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;YACtB,OAAO,CAAC,GAAG,CAAC,2BAA2B,QAAQ,MAAM,IAAI,OAAO,QAAQ,EAAE,CAAC,CAAA;QAC7E,CAAC;QAED,OAAO,YAAY,CAAA;IACrB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,kBAAkB,CAAC,EAAU;QACjC,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAA;QAE3C,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,IAAI,OAAO,EAAE,CAAC;YACjC,OAAO,CAAC,GAAG,CAAC,2BAA2B,EAAE,EAAE,CAAC,CAAA;QAC9C,CAAC;QAED,OAAO,OAAO,CAAA;IAChB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,0BAA0B,CAAC,QAAgB,EAAE,QAAgB;QACjE,MAAM,aAAa,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAA;QAEtE,KAAK,MAAM,GAAG,IAAI,aAAa,EAAE,CAAC;YAChC,MAAM,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QACjC,CAAC;QAED,OAAO,aAAa,CAAC,MAAM,CAAA;IAC7B,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,mBAAmB,CAAC,MAAc;QAItC,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;YAC7C,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC;YAC/B,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC;SAChC,CAAC,CAAA;QAEF,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAA;IAC/B,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,eAAe,CACnB,MAAc,EACd,IAAsB,EACtB,YAA8C,MAAM;QAEpD,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAA;QAEpC,IAAI,SAAS,KAAK,UAAU,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;YACrD,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,CAAA;YACtD,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;gBAC3B,IAAI,GAAG,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;oBACtB,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;gBAC9B,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,SAAS,KAAK,UAAU,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;YACrD,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,CAAA;YACtD,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;gBAC3B,IAAI,GAAG,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;oBACtB,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;gBAC9B,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAA;IAC/B,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,cAAc,CAClB,MAAc,EACd,OAAyB,WAAW,EACpC,WAAmB,EAAE;QAErB,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAA;QAC7C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;QACjC,MAAM,KAAK,GAAyC,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAA;QAE9E,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAA;YAE9B,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,IAAI,OAAO,CAAC,KAAK,GAAG,QAAQ,EAAE,CAAC;gBACxD,SAAQ;YACV,CAAC;YAED,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAA;YAEvB,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,EAAE,EAAE,IAAI,EAAE,UAAU,CAAC,CAAA;YACzE,MAAM,UAAU,GAAG,OAAO,CAAC,KAAK,GAAG,CAAC,CAAA;YAEpC,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;gBAC/B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,UAAU,IAAI,QAAQ,EAAE,CAAC;oBACpD,WAAW,CAAC,GAAG,CAAC,OAAO,EAAE,UAAU,CAAC,CAAA;oBACpC,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,CAAA;gBAChD,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,WAAW,CAAA;IACpB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,YAAY,CAChB,MAAc,EACd,OAAyB,UAAU,EACnC,WAAmB,EAAE;QAErB,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAA;QAC3C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;QACjC,MAAM,KAAK,GAAyC,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAA;QAE9E,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAA;YAE9B,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,IAAI,OAAO,CAAC,KAAK,GAAG,QAAQ,EAAE,CAAC;gBACxD,SAAQ;YACV,CAAC;YAED,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAA;YAEvB,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,EAAE,EAAE,IAAI,EAAE,UAAU,CAAC,CAAA;YACxE,MAAM,WAAW,GAAG,OAAO,CAAC,KAAK,GAAG,CAAC,CAAA;YAErC,KAAK,MAAM,QAAQ,IAAI,OAAO,EAAE,CAAC;gBAC/B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,WAAW,IAAI,QAAQ,EAAE,CAAC;oBACtD,SAAS,CAAC,GAAG,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAA;oBACpC,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,WAAW,EAAE,CAAC,CAAA;gBAClD,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAA;IAClB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,eAAe,CACnB,QAAgB,EAChB,QAAgB,EAChB,IAAuB;QAEvB,MAAM,aAAa,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAA;QAEtE,IAAI,IAAI,EAAE,CAAC;YACT,OAAO,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAA;QACjD,CAAC;QAED,OAAO,aAAa,CAAC,MAAM,GAAG,CAAC,CAAA;IACjC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,sBAAsB,CAAC,IAAsB;QACjD,OAAO,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,CAAA;IACpC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,UAAU,CAAC,OAGhB;QAIC,IAAI,aAAa,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAA;QAE7C,IAAI,OAAO,EAAE,KAAK,EAAE,CAAC;YACnB,aAAa,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,KAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAA;QAC5E,CAAC;QAED,IAAI,OAAO,EAAE,SAAS,EAAE,CAAC;YACvB,MAAM,SAAS,GAAG,IAAI,GAAG,CAAS,OAAO,CAAC,SAAS,CAAC,CAAA;YAEpD,2BAA2B;YAC3B,KAAK,MAAM,GAAG,IAAI,aAAa,EAAE,CAAC;gBAChC,IAAI,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAC/D,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;oBAC3B,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;gBAC7B,CAAC;YACH,CAAC;YAED,aAAa,GAAG,aAAa,CAAC,MAAM,CAClC,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAC5D,CAAA;QACH,CAAC;QAED,cAAc;QACd,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAA;QAC5C,KAAK,MAAM,GAAG,IAAI,aAAa,EAAE,CAAC;YAChC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;YACrE,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QACvE,CAAC;QAED,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC;YACnE,EAAE;YACF,iBAAiB,EAAE,KAAK;SACzB,CAAC,CAAC,CAAA;QAEH,MAAM,KAAK,GAAG,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACtC,MAAM,EAAE,GAAG,CAAC,QAAQ;YACpB,MAAM,EAAE,GAAG,CAAC,QAAQ;YACpB,IAAI,EAAE,GAAG,CAAC,IAAI;SACf,CAAC,CAAC,CAAA;QAEH,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAA;IACzB,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,WAAW,CACvB,QAAgB,EAChB,QAAgB,EAChB,IAAsB;QAEtB,+DAA+D;QAC/D,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;QACjC,MAAM,KAAK,GAAG,CAAC,QAAQ,CAAC,CAAA;QAExB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAA;YAE9B,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC;gBAAE,SAAQ;YAClC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;YAEpB,IAAI,OAAO,KAAK,QAAQ,EAAE,CAAC;gBACzB,OAAO,IAAI,CAAA,CAAC,iBAAiB;YAC/B,CAAC;YAED,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,OAAO,CAAC,CAAA;YACvD,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;gBAC3B,IAAI,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBACpD,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;gBAC1B,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAA;IACd,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,QAAQ;QAKZ,MAAM,aAAa,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAA;QAE/C,MAAM,MAAM,GAA2B,EAAE,CAAA;QACzC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAA;QAE/B,KAAK,MAAM,GAAG,IAAI,aAAa,EAAE,CAAC;YAChC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAA;YAC9C,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;YACvB,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;QACzB,CAAC;QAED,OAAO;YACL,kBAAkB,EAAE,aAAa,CAAC,MAAM;YACxC,MAAM,EAAE,MAA0C;YAClD,WAAW,EAAE,KAAK,CAAC,IAAI;SACxB,CAAA;IACH,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,KAAK;QACT,MAAM,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAA;QAExB,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;YACtB,OAAO,CAAC,GAAG,CAAC,0CAA0C,CAAC,CAAA;QACzD,CAAC;IACH,CAAC;CACF;AAED,gFAAgF;AAChF,kBAAkB;AAClB,gFAAgF;AAEhF,IAAI,cAAc,GAAqC,IAAI,CAAA;AAE3D;;GAEG;AACH,MAAM,UAAU,sBAAsB,CACpC,MAAkC;IAElC,IAAI,CAAC,cAAc,EAAE,CAAC;QACpB,cAAc,GAAG,IAAI,yBAAyB,CAAC,MAAM,CAAC,CAAA;IACxD,CAAC;IACD,OAAO,cAAc,CAAA;AACvB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,wBAAwB;IACtC,cAAc,GAAG,IAAI,CAAA;AACvB,CAAC;AAED,gFAAgF;AAChF,mBAAmB;AACnB,gFAAgF;AAEhF;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,+BAA+B,CACnD,OAAkC,EAClC,KAAa,EACb,KAAa,EACb,IAAsB,EACtB,OAAoE;IAEpE,MAAM,IAAI,GAAG,MAAM,OAAO,CAAC,kBAAkB,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,OAAO,CAAC,CAAA;IAC1E,MAAM,IAAI,GAAG,MAAM,OAAO,CAAC,kBAAkB,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,OAAO,CAAC,CAAA;IAC1E,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;AACrB,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CACnC,OAAkC,EAClC,QAAgB,EAChB,OAAe,EACf,OAAoE;IAEpE,MAAM,SAAS,GAAG,MAAM,OAAO,CAAC,kBAAkB,CAAC,QAAQ,EAAE,OAAO,EAAE,WAAW,EAAE,OAAO,CAAC,CAAA;IAC3F,MAAM,QAAQ,GAAG,MAAM,OAAO,CAAC,kBAAkB,CAAC,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,OAAO,CAAC,CAAA;IACzF,OAAO,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAA;AAC9B,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,SAAS,CAC7B,OAAkC,EAClC,SAAiB,EACjB,SAAiB,EACjB,OAAoE;IAEpE,OAAO,OAAO,CAAC,kBAAkB,CAAC,SAAS,EAAE,SAAS,EAAE,YAAY,EAAE;QACpE,GAAG,OAAO;QACV,QAAQ,EAAE;YACR,GAAG,OAAO,EAAE,QAAQ;YACpB,YAAY,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;SACvC;KACF,CAAC,CAAA;AACJ,CAAC"}