@soulcraft/sdk 1.6.2 → 2.0.0

package/dist/server/handlers/formats.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"formats.js","sourceRoot":"","sources":["../../../src/server/handlers/formats.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAoEH,gFAAgF;AAChF,kBAAkB;AAClB,gFAAgF;AAEhF;;;;;GAKG;AACH,MAAM,UAAU,oBAAoB,CAAC,OAA+B;IAClE,MAAM,SAAS,GAAG,OAAO,EAAE,SAAS,CAAA;IAEpC,SAAS,gBAAgB;QACvB,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,MAAM,IAAI,KAAK,CACb,yFAAyF;gBACzF,iFAAiF,CAClF,CAAA;QACH,CAAC;QACD,OAAO,SAAS,CAAA;IAClB,CAAC;IAED,OAAO;QACL;;;;;;;WAOG;QACH,KAAK,CAAC,OAAO,CACX,YAAoB,EACpB,YAAoB,EACpB,cAAuE;YAEvE,OAAO,gBAAgB,EAAE,CAAC,OAAO,CAC/B,YAAY,EACZ,YAAY,EACZ,cAAc,CAAC,OAAO,EACtB,cAAc,CAAC,OAAO,CACvB,CAAA;QACH,CAAC;QAED;;;;;;WAMG;QACH,KAAK,CAAC,QAAQ,CACZ,MAAc,EACd,QAAiB;YAEjB,OAAO,gBAAgB,EAAE,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAA;QACtD,CAAC;QAED;;;;WAIG;QACH,KAAK,CAAC,gBAAgB;YACpB,OAAO,gBAAgB,EAAE,CAAC,gBAAgB,EAAE,CAAA;QAC9C,CAAC;KACF,CAAA;AACH,CAAC"}

package/dist/server/handlers/graph.d.ts

@@ -0,0 +1,31 @@
+/**
+ * @module server/handlers/graph
+ * @description Graph namespace handler — assembles graph visualization data from
+ * Brainy entities and relationships.
+ *
+ * Absorbs Workshop `routes/graph.ts`. All methods receive the Brainy instance
+ * via {@link HandlerContext} and return plain objects matching the
+ * {@link GraphNamespace} interface in `namespaces.ts`.
+ *
+ * Methods:
+ * - `getData` — Full graph (entities + relationships) for visualization
+ * - `getStats` — Aggregate statistics (node/edge counts, type distributions)
+ * - `getFocused` — Subgraph centered on a specific entity
+ * - `getNeighbors` — Direct neighbors of a node with depth traversal
+ * - `getBatch` — Unified graph for multiple selected entities
+ * - `deleteNode` — Remove an entity and its relationships
+ */
+import type { NamespaceProvider } from '../namespace-router.js';
+/**
+ * Creates the `graph` namespace handler.
+ *
+ * @returns A {@link NamespaceProvider} implementing {@link GraphNamespace}.
+ *
+ * @example
+ * ```typescript
+ * const providers = { graph: createGraphHandler() }
+ * const router = createNamespaceRouter({ resolveBrain, authenticate, providers })
+ * ```
+ */
+export declare function createGraphHandler(): NamespaceProvider;
+//# sourceMappingURL=graph.d.ts.map

package/dist/server/handlers/graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.d.ts","sourceRoot":"","sources":["../../../src/server/handlers/graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAGH,OAAO,KAAK,EAAE,iBAAiB,EAAkB,MAAM,wBAAwB,CAAA;AA6C/E;;;;;;;;;;GAUG;AACH,wBAAgB,kBAAkB,IAAI,iBAAiB,CAuXtD"}

package/dist/server/handlers/graph.js

@@ -0,0 +1,490 @@
+/**
+ * @module server/handlers/graph
+ * @description Graph namespace handler — assembles graph visualization data from
+ * Brainy entities and relationships.
+ *
+ * Absorbs Workshop `routes/graph.ts`. All methods receive the Brainy instance
+ * via {@link HandlerContext} and return plain objects matching the
+ * {@link GraphNamespace} interface in `namespaces.ts`.
+ *
+ * Methods:
+ * - `getData` — Full graph (entities + relationships) for visualization
+ * - `getStats` — Aggregate statistics (node/edge counts, type distributions)
+ * - `getFocused` — Subgraph centered on a specific entity
+ * - `getNeighbors` — Direct neighbors of a node with depth traversal
+ * - `getBatch` — Unified graph for multiple selected entities
+ * - `deleteNode` — Remove an entity and its relationships
+ */
+// ─────────────────────────────────────────────────────────────────────────────
+// Helpers
+// ─────────────────────────────────────────────────────────────────────────────
+/**
+ * Extract a display name from a Brainy entity.
+ *
+ * @param entity - The entity (any shape from brain.get / brain.find).
+ * @returns A human-readable name string.
+ */
+function extractName(entity) {
+    const meta = entity.metadata;
+    if (meta?.name && typeof meta.name === 'string')
+        return meta.name;
+    if (meta?.label && typeof meta.label === 'string')
+        return meta.label;
+    if (typeof entity.data === 'string' && entity.data.length < 100)
+        return entity.data;
+    if (typeof entity.data === 'object' && entity.data !== null) {
+        const d = entity.data;
+        if (typeof d.name === 'string')
+            return d.name;
+        if (typeof d.title === 'string')
+            return d.title;
+    }
+    return String(entity.id ?? 'untitled');
+}
+/**
+ * Parse the `_data` metadata field, which stores embedded JSON in Smart Import entities.
+ *
+ * @param metadata - Entity metadata object.
+ * @returns Parsed data or null.
+ */
+function parseDataField(metadata) {
+    if (!metadata?._data || typeof metadata._data !== 'string')
+        return null;
+    try {
+        return JSON.parse(metadata._data);
+    }
+    catch {
+        return null;
+    }
+}
+// ─────────────────────────────────────────────────────────────────────────────
+// Handler factory
+// ─────────────────────────────────────────────────────────────────────────────
+/**
+ * Creates the `graph` namespace handler.
+ *
+ * @returns A {@link NamespaceProvider} implementing {@link GraphNamespace}.
+ *
+ * @example
+ * ```typescript
+ * const providers = { graph: createGraphHandler() }
+ * const router = createNamespaceRouter({ resolveBrain, authenticate, providers })
+ * ```
+ */
+export function createGraphHandler() {
+    return {
+        /**
+         * Get full graph data for visualization.
+         *
+         * @param options - Query options.
+         * @param options.limit - Max nodes to return (default 900, max 900).
+         * @param options.includeVFS - Include VFS file hierarchy (default false).
+         * @param ctx - Handler context with authenticated user and Brainy instance.
+         * @returns Graph data with nodes and edges.
+         */
+        async getData(options, ctx) {
+            const { brain } = ctx;
+            const limit = Math.min(options?.limit ?? 900, 900);
+            const includeVFS = options?.includeVFS ?? false;
+            const nodes = [];
+            const edges = [];
+            if (includeVFS) {
+                await _buildVfsGraph(brain, nodes, edges);
+            }
+            else {
+                await _buildEntityGraph(brain, nodes, edges, limit);
+            }
+            return { nodes, edges };
+        },
+        /**
+         * Get aggregate graph statistics.
+         *
+         * Uses Brainy 7.1.0+ `indexStats()` for instant metrics. Falls back to
+         * manual counting on older versions.
+         *
+         * @param ctx - Handler context.
+         * @returns Graph statistics including counts and distributions.
+         */
+        async getStats(ctx) {
+            const { brain } = ctx;
+            // Use indexStats() for instant metrics (Brainy 7.1.0+)
+            if (typeof brain.indexStats === 'function') {
+                const stats = await brain.indexStats();
+                const nodeCount = stats.totalEntities || stats.nouns?.total || 0;
+                const edgeCount = stats.totalRelationships || stats.verbs?.total || 0;
+                return {
+                    nodeCount,
+                    edgeCount,
+                    typeDistribution: stats.nouns?.byType || stats.entityTypes || {},
+                    verbDistribution: stats.verbs?.byType || stats.relationshipTypes || {},
+                };
+            }
+            // Fallback: query all entities and relationships
+            const entities = await brain.find({ limit: 900, includeVFS: false });
+            const relations = await brain.getRelations({ limit: 900 });
+            const typeDistribution = {};
+            for (const entity of entities) {
+                const type = entity.entity?.type || entity.type || 'unknown';
+                typeDistribution[type] = (typeDistribution[type] || 0) + 1;
+            }
+            const verbDistribution = {};
+            for (const rel of relations) {
+                const verb = rel.type || 'unknown';
+                verbDistribution[verb] = (verbDistribution[verb] || 0) + 1;
+            }
+            return {
+                nodeCount: entities.length,
+                edgeCount: relations.length,
+                typeDistribution,
+                verbDistribution,
+            };
+        },
+        /**
+         * Get a focused subgraph centered on a specific entity.
+         *
+         * @param entityId - The center entity ID.
+         * @param options - Focus options.
+         * @param options.verb - Filter edges to a specific verb type.
+         * @param options.depth - Traversal depth (default 1).
+         * @param options.maxNodes - Max neighbor nodes to return (default 50).
+         * @param ctx - Handler context.
+         * @returns Subgraph centered on the entity with neighbors and edges.
+         */
+        async getFocused(entityId, options, ctx) {
+            const { brain } = ctx;
+            const depth = options?.depth ?? 1;
+            const maxNodes = options?.maxNodes ?? 50;
+            const verbFilter = options?.verb;
+            // Get center entity
+            const center = await brain.get(entityId);
+            if (!center)
+                throw new Error(`Entity ${entityId} not found`);
+            // Get all relationships for traversal
+            const allRelations = await brain.getRelations({ limit: 10_000 });
+            const neighborIds = new Set();
+            const edges = [];
+            // 1-hop neighbors
+            for (const rel of allRelations) {
+                const relType = rel.type || rel.verb;
+                const sourceId = rel.sourceId || rel.from || rel.source;
+                const targetId = rel.targetId || rel.to || rel.target;
+                if (verbFilter && relType !== verbFilter)
+                    continue;
+                if (sourceId === entityId || targetId === entityId) {
+                    const otherId = sourceId === entityId ? targetId : sourceId;
+                    neighborIds.add(otherId);
+                    edges.push({
+                        id: `${sourceId}-${relType}-${targetId}`,
+                        source: sourceId,
+                        target: targetId,
+                        label: relType,
+                        type: relType,
+                    });
+                }
+            }
+            // Limit neighbors
+            const limitedIds = Array.from(neighborIds).slice(0, maxNodes);
+            const hasMore = neighborIds.size > maxNodes;
+            // Build nodes — center + neighbors
+            const nodes = [{
+                    id: center.id,
+                    label: extractName(center),
+                    type: center.type || 'document',
+                }];
+            // Fetch neighbor entities in parallel
+            const neighborResults = await Promise.all(limitedIds.map(async (id) => {
+                try {
+                    return await brain.get(id);
+                }
+                catch {
+                    return null;
+                }
+            }));
+            for (const neighbor of neighborResults) {
+                if (neighbor) {
+                    nodes.push({
+                        id: neighbor.id,
+                        label: extractName(neighbor),
+                        type: neighbor.type || 'unknown',
+                    });
+                }
+            }
+            // Filter edges to only those with both endpoints present
+            const nodeIdSet = new Set(nodes.map(n => n.id));
+            const filteredEdges = edges.filter(e => nodeIdSet.has(e.source) && nodeIdSet.has(e.target));
+            return { nodes, edges: filteredEdges, depth, hasMore };
+        },
+        /**
+         * Get neighbors of a specific node.
+         *
+         * Uses Brainy 7.1.0+ `neighbors()` for optimized O(log n) traversal
+         * when available. Falls back to manual getRelations() scan.
+         *
+         * @param nodeId - The node to find neighbors for.
+         * @param options - Neighbor query options.
+         * @param ctx - Handler context.
+         * @returns Neighbor nodes, edges, and total count.
+         */
+        async getNeighbors(nodeId, options, ctx) {
+            const { brain } = ctx;
+            const depth = options?.depth ?? 1;
+            const limit = options?.limit ?? 50;
+            const direction = options?.direction ?? 'both';
+            // Verify node exists
+            const node = await brain.get(nodeId);
+            if (!node)
+                throw new Error(`Node ${nodeId} not found`);
+            // Use neighbors() API for optimized traversal (Brainy 7.1.0+)
+            if (typeof brain.neighbors === 'function') {
+                const result = await brain.neighbors(nodeId, {
+                    depth, limit, direction, includeMetadata: true,
+                });
+                const neighbors = (result.nodes || []).map((n) => ({
+                    id: n.id,
+                    label: extractName(n),
+                    type: n.type || 'unknown',
+                }));
+                const edges = (result.edges || []).map((e) => ({
+                    id: e.id || `${e.from || e.source}-${e.to || e.target}`,
+                    source: e.from || e.source,
+                    target: e.to || e.target,
+                    label: e.type || e.verb || 'relatedTo',
+                    type: e.type || e.verb || 'relatedTo',
+                }));
+                return { nodeId, neighbors, edges, total: result.total || neighbors.length };
+            }
+            // Fallback: manual getRelations
+            const outgoing = (direction !== 'incoming')
+                ? await brain.getRelations({ from: nodeId }) || []
+                : [];
+            const incoming = (direction !== 'outgoing')
+                ? await brain.getRelations({ to: nodeId }) || []
+                : [];
+            const neighborIds = new Set();
+            const edges = [];
+            for (const link of outgoing) {
+                neighborIds.add(link.to);
+                edges.push({
+                    id: link.id || `${nodeId}-${link.to}`,
+                    source: nodeId, target: link.to,
+                    label: link.type || 'relatedTo', type: link.type || 'relatedTo',
+                });
+            }
+            for (const link of incoming) {
+                neighborIds.add(link.from);
+                edges.push({
+                    id: link.id || `${link.from}-${nodeId}`,
+                    source: link.from, target: nodeId,
+                    label: link.type || 'relatedTo', type: link.type || 'relatedTo',
+                });
+            }
+            // Fetch neighbor entities in parallel
+            const limitedIds = Array.from(neighborIds).slice(0, limit);
+            const neighborResults = await Promise.all(limitedIds.map(async (id) => {
+                try {
+                    return await brain.get(id);
+                }
+                catch {
+                    return null;
+                }
+            }));
+            const neighbors = neighborResults
+                .filter((n) => n !== null)
+                .map((n) => ({ id: n.id, label: extractName(n), type: n.type || 'unknown' }));
+            return { nodeId, neighbors, edges, total: neighborIds.size };
+        },
+        /**
+         * Get unified graph for multiple selected entities.
+         *
+         * @param options - Batch query options.
+         * @param ctx - Handler context.
+         * @returns Combined graph data with selected node indicators.
+         */
+        async getBatch(options, ctx) {
+            const { brain } = ctx;
+            const allSelectedIds = [...(options.entityIds || []), ...(options.fileIds || [])];
+            const depth = options.depth ?? 1;
+            const maxNodes = options.maxNodes ?? 100;
+            if (allSelectedIds.length === 0) {
+                throw new Error('At least one entityId or fileId is required');
+            }
+            const nodesMap = new Map();
+            const edgesMap = new Map();
+            const neighborIds = new Set();
+            // Process each selected entity
+            for (const selectedId of allSelectedIds) {
+                let entity;
+                try {
+                    entity = await brain.get(selectedId);
+                }
+                catch {
+                    continue;
+                }
+                if (!entity)
+                    continue;
+                nodesMap.set(selectedId, {
+                    id: entity.id,
+                    label: extractName(entity),
+                    type: entity.type || 'document',
+                    metadata: entity.metadata,
+                });
+                // Get relationships for this entity
+                const outgoing = await brain.getRelations({ from: selectedId }) || [];
+                const incoming = await brain.getRelations({ to: selectedId }) || [];
+                for (const link of outgoing) {
+                    const edgeId = `${selectedId}-${link.type || 'relatedTo'}-${link.to}`;
+                    neighborIds.add(link.to);
+                    edgesMap.set(edgeId, {
+                        id: edgeId, source: selectedId, target: link.to,
+                        label: link.type || 'relatedTo', type: link.type || 'relatedTo',
+                    });
+                }
+                for (const link of incoming) {
+                    const edgeId = `${link.from}-${link.type || 'relatedTo'}-${selectedId}`;
+                    neighborIds.add(link.from);
+                    edgesMap.set(edgeId, {
+                        id: edgeId, source: link.from, target: selectedId,
+                        label: link.type || 'relatedTo', type: link.type || 'relatedTo',
+                    });
+                }
+            }
+            // Fetch neighbor entities (not already in selection)
+            const limitedNeighborIds = Array.from(neighborIds)
+                .filter(id => !nodesMap.has(id))
+                .slice(0, maxNodes);
+            const neighborResults = await Promise.all(limitedNeighborIds.map(async (id) => {
+                try {
+                    return await brain.get(id);
+                }
+                catch {
+                    return null;
+                }
+            }));
+            for (const neighbor of neighborResults) {
+                if (!neighbor)
+                    continue;
+                const meta = neighbor.metadata;
+                if (meta?.isViewCollection)
+                    continue; // Exclude infrastructure nodes
+                nodesMap.set(neighbor.id, {
+                    id: neighbor.id,
+                    label: extractName(neighbor),
+                    type: neighbor.type || 'document',
+                    metadata: meta,
+                });
+            }
+            // Filter edges to those with both endpoints present
+            const nodeIdSet = new Set(nodesMap.keys());
+            const nodes = Array.from(nodesMap.values());
+            const edges = Array.from(edgesMap.values()).filter(e => nodeIdSet.has(e.source) && nodeIdSet.has(e.target));
+            return {
+                nodes,
+                edges,
+                selectedNodeIds: allSelectedIds,
+                depth,
+                hasMore: neighborIds.size > maxNodes,
+            };
+        },
+        /**
+         * Delete a node from the graph (entity + relationships).
+         *
+         * @param nodeId - The node to delete.
+         * @param ctx - Handler context.
+         * @returns Success confirmation.
+         */
+        async deleteNode(nodeId, ctx) {
+            const { brain } = ctx;
+            const node = await brain.get(nodeId);
+            if (!node)
+                throw new Error(`Node ${nodeId} not found`);
+            await brain.delete(nodeId);
+            return { success: true, id: nodeId };
+        },
+    };
+}
+// ─────────────────────────────────────────────────────────────────────────────
+// Internal graph builders
+// ─────────────────────────────────────────────────────────────────────────────
+/**
+ * Build graph from VFS file hierarchy.
+ */
+async function _buildVfsGraph(brain, nodes, edges) {
+    const vfs = brain.vfs;
+    const descendants = await vfs.getDescendants('/', { includeAncestor: true });
+    const pathToId = new Map();
+    for (const item of descendants) {
+        const meta = item.metadata;
+        const path = meta?.path || '/';
+        const isDirectory = meta?.vfsType === 'directory';
+        const parsed = parseDataField(meta);
+        let name = meta?.name || path.split('/').pop() || 'root';
+        let entityType = isDirectory ? 'directory' : 'file';
+        if (parsed?.name && typeof parsed.name === 'string')
+            name = parsed.name;
+        if (parsed?.type && typeof parsed.type === 'string')
+            entityType = parsed.type;
+        if (path === '/') {
+            pathToId.set(path, item.id);
+            continue;
+        }
+        nodes.push({ id: item.id, label: name, type: entityType });
+        pathToId.set(path, item.id);
+    }
+    // Build parent-child edges from paths
+    for (const node of nodes) {
+        const entity = descendants.find((d) => d.id === node.id);
+        const meta = entity?.metadata;
+        const path = meta?.path || '';
+        const parts = path.split('/').filter(Boolean);
+        if (parts.length === 0)
+            continue;
+        parts.pop();
+        const parentPath = parts.length > 0 ? '/' + parts.join('/') : '/';
+        if (parentPath === '/')
+            continue;
+        const parentId = pathToId.get(parentPath);
+        if (parentId) {
+            const isDir = meta?.vfsType === 'directory';
+            edges.push({
+                id: `vfs-${parentId}-${node.id}`,
+                source: parentId,
+                target: node.id,
+                label: isDir ? 'contains_dir' : 'contains_file',
+                type: 'vfs_hierarchy',
+            });
+        }
+    }
+}
+/**
+ * Build graph from non-VFS entities and their relationships.
+ */
+async function _buildEntityGraph(brain, nodes, edges, limit) {
+    const results = await brain.find({ query: '', limit, includeVFS: false });
+    const nodeIds = new Set();
+    for (const result of results) {
+        const entity = result.entity || result;
+        const id = result.id || entity.id;
+        const parsed = parseDataField(entity.metadata);
+        nodes.push({
+            id,
+            label: extractName(result),
+            type: entity.type || entity.metadata?.noun || 'concept',
+            metadata: parsed || entity.metadata?.nodeData || (typeof entity.data === 'object' ? entity.data : undefined),
+        });
+        nodeIds.add(id);
+    }
+    // Get all relationships and filter to visible nodes
+    const allRelations = await brain.getRelations();
+    for (const rel of allRelations) {
+        if (nodeIds.has(rel.from) && nodeIds.has(rel.to)) {
+            edges.push({
+                id: `${rel.from}-${rel.type}-${rel.to}`,
+                source: rel.from,
+                target: rel.to,
+                label: rel.type,
+                type: 'semantic',
+            });
+        }
+    }
+}
+//# sourceMappingURL=graph.js.map

package/dist/server/handlers/graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.js","sourceRoot":"","sources":["../../../src/server/handlers/graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG;AAMH,gFAAgF;AAChF,UAAU;AACV,gFAAgF;AAEhF;;;;;GAKG;AACH,SAAS,WAAW,CAAC,MAA+B;IAClD,MAAM,IAAI,GAAG,MAAM,CAAC,QAA+C,CAAA;IACnE,IAAI,IAAI,EAAE,IAAI,IAAI,OAAO,IAAI,CAAC,IAAI,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC,IAAI,CAAA;IACjE,IAAI,IAAI,EAAE,KAAK,IAAI,OAAO,IAAI,CAAC,KAAK,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC,KAAK,CAAA;IACpE,IAAI,OAAO,MAAM,CAAC,IAAI,KAAK,QAAQ,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,GAAG,GAAG;QAAE,OAAO,MAAM,CAAC,IAAI,CAAA;IACnF,IAAI,OAAO,MAAM,CAAC,IAAI,KAAK,QAAQ,IAAI,MAAM,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;QAC5D,MAAM,CAAC,GAAG,MAAM,CAAC,IAA+B,CAAA;QAChD,IAAI,OAAO,CAAC,CAAC,IAAI,KAAK,QAAQ;YAAE,OAAO,CAAC,CAAC,IAAI,CAAA;QAC7C,IAAI,OAAO,CAAC,CAAC,KAAK,KAAK,QAAQ;YAAE,OAAO,CAAC,CAAC,KAAK,CAAA;IACjD,CAAC;IACD,OAAO,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,UAAU,CAAC,CAAA;AACxC,CAAC;AAED;;;;;GAKG;AACH,SAAS,cAAc,CAAC,QAA6C;IACnE,IAAI,CAAC,QAAQ,EAAE,KAAK,IAAI,OAAO,QAAQ,CAAC,KAAK,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAA;IACvE,IAAI,CAAC;QACH,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAA;IACnC,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAA;IACb,CAAC;AACH,CAAC;AAED,gFAAgF;AAChF,kBAAkB;AAClB,gFAAgF;AAEhF;;;;;;;;;;GAUG;AACH,MAAM,UAAU,kBAAkB;IAChC,OAAO;QACL;;;;;;;;WAQG;QACH,KAAK,CAAC,OAAO,CACX,OAA6D,EAC7D,GAAmB;YAEnB,MAAM,EAAE,KAAK,EAAE,GAAG,GAAG,CAAA;YACrB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,KAAK,IAAI,GAAG,EAAE,GAAG,CAAC,CAAA;YAClD,MAAM,UAAU,GAAG,OAAO,EAAE,UAAU,IAAI,KAAK,CAAA;YAE/C,MAAM,KAAK,GAAgB,EAAE,CAAA;YAC7B,MAAM,KAAK,GAAgB,EAAE,CAAA;YAE7B,IAAI,UAAU,EAAE,CAAC;gBACf,MAAM,cAAc,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAA;YAC3C,CAAC;iBAAM,CAAC;gBACN,MAAM,iBAAiB,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAA;YACrD,CAAC;YAED,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAA;QACzB,CAAC;QAED;;;;;;;;WAQG;QACH,KAAK,CAAC,QAAQ,CAAC,GAAmB;YAChC,MAAM,EAAE,KAAK,EAAE,GAAG,GAAG,CAAA;YAErB,uDAAuD;YACvD,IAAI,OAAQ,KAAa,CAAC,UAAU,KAAK,UAAU,EAAE,CAAC;gBACpD,MAAM,KAAK,GAAG,MAAO,KAAa,CAAC,UAAU,EAAE,CAAA;gBAC/C,MAAM,SAAS,GAAG,KAAK,CAAC,aAAa,IAAI,KAAK,CAAC,KAAK,EAAE,KAAK,IAAI,CAAC,CAAA;gBAChE,MAAM,SAAS,GAAG,KAAK,CAAC,kBAAkB,IAAI,KAAK,CAAC,KAAK,EAAE,KAAK,IAAI,CAAC,CAAA;gBAErE,OAAO;oBACL,SAAS;oBACT,SAAS;oBACT,gBAAgB,EAAE,KAAK,CAAC,KAAK,EAAE,MAAM,IAAI,KAAK,CAAC,WAAW,IAAI,EAAE;oBAChE,gBAAgB,EAAE,KAAK,CAAC,KAAK,EAAE,MAAM,IAAI,KAAK,CAAC,iBAAiB,IAAI,EAAE;iBACvE,CAAA;YACH,CAAC;YAED,iDAAiD;YACjD,MAAM,QAAQ,GAAG,MAAM,KAAK,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,UAAU,EAAE,KAAK,EAAS,CAAC,CAAA;YAC3E,MAAM,SAAS,GAAG,MAAO,KAAa,CAAC,YAAY,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAA;YAEnE,MAAM,gBAAgB,GAA2B,EAAE,CAAA;YACnD,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;gBAC9B,MAAM,IAAI,GAAI,MAAc,CAAC,MAAM,EAAE,IAAI,IAAK,MAAc,CAAC,IAAI,IAAI,SAAS,CAAA;gBAC9E,gBAAgB,CAAC,IAAI,CAAC,GAAG,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAA;YAC5D,CAAC;YAED,MAAM,gBAAgB,GAA2B,EAAE,CAAA;YACnD,KAAK,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;gBAC5B,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI,IAAI,SAAS,CAAA;gBAClC,gBAAgB,CAAC,IAAI,CAAC,GAAG,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAA;YAC5D,CAAC;YAED,OAAO;gBACL,SAAS,EAAE,QAAQ,CAAC,MAAM;gBAC1B,SAAS,EAAE,SAAS,CAAC,MAAM;gBAC3B,gBAAgB;gBAChB,gBAAgB;aACjB,CAAA;QACH,CAAC;QAED;;;;;;;;;;WAUG;QACH,KAAK,CAAC,UAAU,CACd,QAAgB,EAChB,OAAyE,EACzE,GAAmB;YAEnB,MAAM,EAAE,KAAK,EAAE,GAAG,GAAG,CAAA;YACrB,MAAM,KAAK,GAAG,OAAO,EAAE,KAAK,IAAI,CAAC,CAAA;YACjC,MAAM,QAAQ,GAAG,OAAO,EAAE,QAAQ,IAAI,EAAE,CAAA;YACxC,MAAM,UAAU,GAAG,OAAO,EAAE,IAAI,CAAA;YAEhC,oBAAoB;YACpB,MAAM,MAAM,GAAG,MAAM,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;YACxC,IAAI,CAAC,MAAM;gBAAE,MAAM,IAAI,KAAK,CAAC,UAAU,QAAQ,YAAY,CAAC,CAAA;YAE5D,sCAAsC;YACtC,MAAM,YAAY,GAAG,MAAO,KAAa,CAAC,YAAY,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAA;YAEzE,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAA;YACrC,MAAM,KAAK,GAAgB,EAAE,CAAA;YAE7B,kBAAkB;YAClB,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;gBAC/B,MAAM,OAAO,GAAG,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,IAAI,CAAA;gBACpC,MAAM,QAAQ,GAAG,GAAG,CAAC,QAAQ,IAAI,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,MAAM,CAAA;gBACvD,MAAM,QAAQ,GAAG,GAAG,CAAC,QAAQ,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,MAAM,CAAA;gBAErD,IAAI,UAAU,IAAI,OAAO,KAAK,UAAU;oBAAE,SAAQ;gBAElD,IAAI,QAAQ,KAAK,QAAQ,IAAI,QAAQ,KAAK,QAAQ,EAAE,CAAC;oBACnD,MAAM,OAAO,GAAG,QAAQ,KAAK,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAA;oBAC3D,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;oBACxB,KAAK,CAAC,IAAI,CAAC;wBACT,EAAE,EAAE,GAAG,QAAQ,IAAI,OAAO,IAAI,QAAQ,EAAE;wBACxC,MAAM,EAAE,QAAQ;wBAChB,MAAM,EAAE,QAAQ;wBAChB,KAAK,EAAE,OAAO;wBACd,IAAI,EAAE,OAAO;qBACd,CAAC,CAAA;gBACJ,CAAC;YACH,CAAC;YAED,kBAAkB;YAClB,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAA;YAC7D,MAAM,OAAO,GAAG,WAAW,CAAC,IAAI,GAAG,QAAQ,CAAA;YAE3C,mCAAmC;YACnC,MAAM,KAAK,GAAgB,CAAC;oBAC1B,EAAE,EAAG,MAAc,CAAC,EAAE;oBACtB,KAAK,EAAE,WAAW,CAAC,MAAa,CAAC;oBACjC,IAAI,EAAG,MAAc,CAAC,IAAI,IAAI,UAAU;iBACzC,CAAC,CAAA;YAEF,sCAAsC;YACtC,MAAM,eAAe,GAAG,MAAM,OAAO,CAAC,GAAG,CACvC,UAAU,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,EAAE,EAAE;gBAC1B,IAAI,CAAC;oBAAC,OAAO,MAAM,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;gBAAC,CAAC;gBAAC,MAAM,CAAC;oBAAC,OAAO,IAAI,CAAA;gBAAC,CAAC;YAC1D,CAAC,CAAC,CACH,CAAA;YAED,KAAK,MAAM,QAAQ,IAAI,eAAe,EAAE,CAAC;gBACvC,IAAI,QAAQ,EAAE,CAAC;oBACb,KAAK,CAAC,IAAI,CAAC;wBACT,EAAE,EAAG,QAAgB,CAAC,EAAE;wBACxB,KAAK,EAAE,WAAW,CAAC,QAAe,CAAC;wBACnC,IAAI,EAAG,QAAgB,CAAC,IAAI,IAAI,SAAS;qBAC1C,CAAC,CAAA;gBACJ,CAAC;YACH,CAAC;YAED,yDAAyD;YACzD,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;YAC/C,MAAM,aAAa,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAA;YAE3F,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,aAAa,EAAE,KAAK,EAAE,OAAO,EAAE,CAAA;QACxD,CAAC;QAED;;;;;;;;;;WAUG;QACH,KAAK,CAAC,YAAY,CAChB,MAAc,EACd,OAAqG,EACrG,GAAmB;YAEnB,MAAM,EAAE,KAAK,EAAE,GAAG,GAAG,CAAA;YACrB,MAAM,KAAK,GAAG,OAAO,EAAE,KAAK,IAAI,CAAC,CAAA;YACjC,MAAM,KAAK,GAAG,OAAO,EAAE,KAAK,IAAI,EAAE,CAAA;YAClC,MAAM,SAAS,GAAG,OAAO,EAAE,SAAS,IAAI,MAAM,CAAA;YAE9C,qBAAqB;YACrB,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;YACpC,IAAI,CAAC,IAAI;gBAAE,MAAM,IAAI,KAAK,CAAC,QAAQ,MAAM,YAAY,CAAC,CAAA;YAEtD,8DAA8D;YAC9D,IAAI,OAAQ,KAAa,CAAC,SAAS,KAAK,UAAU,EAAE,CAAC;gBACnD,MAAM,MAAM,GAAG,MAAO,KAAa,CAAC,SAAS,CAAC,MAAM,EAAE;oBACpD,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,eAAe,EAAE,IAAI;iBAC/C,CAAC,CAAA;gBAEF,MAAM,SAAS,GAAgB,CAAC,MAAM,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC;oBACnE,EAAE,EAAE,CAAC,CAAC,EAAE;oBACR,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC;oBACrB,IAAI,EAAE,CAAC,CAAC,IAAI,IAAI,SAAS;iBAC1B,CAAC,CAAC,CAAA;gBAEH,MAAM,KAAK,GAAgB,CAAC,MAAM,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC;oBAC/D,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,MAAM,EAAE;oBACvD,MAAM,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,MAAM;oBAC1B,MAAM,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,MAAM;oBACxB,KAAK,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,IAAI,WAAW;oBACtC,IAAI,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,IAAI,WAAW;iBACtC,CAAC,CAAC,CAAA;gBAEH,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,IAAI,SAAS,CAAC,MAAM,EAAE,CAAA;YAC9E,CAAC;YAED,gCAAgC;YAChC,MAAM,QAAQ,GAAG,CAAC,SAAS,KAAK,UAAU,CAAC;gBACzC,CAAC,CAAC,MAAO,KAAa,CAAC,YAAY,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,IAAI,EAAE;gBAC3D,CAAC,CAAC,EAAE,CAAA;YACN,MAAM,QAAQ,GAAG,CAAC,SAAS,KAAK,UAAU,CAAC;gBACzC,CAAC,CAAC,MAAO,KAAa,CAAC,YAAY,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,IAAI,EAAE;gBACzD,CAAC,CAAC,EAAE,CAAA;YAEN,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAA;YACrC,MAAM,KAAK,GAAgB,EAAE,CAAA;YAE7B,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;gBAC5B,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;gBACxB,KAAK,CAAC,IAAI,CAAC;oBACT,EAAE,EAAE,IAAI,CAAC,EAAE,IAAI,GAAG,MAAM,IAAI,IAAI,CAAC,EAAE,EAAE;oBACrC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE;oBAC/B,KAAK,EAAE,IAAI,CAAC,IAAI,IAAI,WAAW,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,IAAI,WAAW;iBAChE,CAAC,CAAA;YACJ,CAAC;YACD,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;gBAC5B,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBAC1B,KAAK,CAAC,IAAI,CAAC;oBACT,EAAE,EAAE,IAAI,CAAC,EAAE,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,MAAM,EAAE;oBACvC,MAAM,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM;oBACjC,KAAK,EAAE,IAAI,CAAC,IAAI,IAAI,WAAW,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,IAAI,WAAW;iBAChE,CAAC,CAAA;YACJ,CAAC;YAED,sCAAsC;YACtC,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAA;YAC1D,MAAM,eAAe,GAAG,MAAM,OAAO,CAAC,GAAG,CACvC,UAAU,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,EAAE,EAAE;gBAC1B,IAAI,CAAC;oBAAC,OAAO,MAAM,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;gBAAC,CAAC;gBAAC,MAAM,CAAC;oBAAC,OAAO,IAAI,CAAA;gBAAC,CAAC;YAC1D,CAAC,CAAC,CACH,CAAA;YAED,MAAM,SAAS,GAAgB,eAAe;iBAC3C,MAAM,CAAC,CAAC,CAAC,EAA8B,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC;iBACrD,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,IAAI,SAAS,EAAE,CAAC,CAAC,CAAA;YAEpF,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,KAAK,EAAE,KAAK,EAAE,WAAW,CAAC,IAAI,EAAE,CAAA;QAC9D,CAAC;QAED;;;;;;WAMG;QACH,KAAK,CAAC,QAAQ,CACZ,OAAwF,EACxF,GAAmB;YAEnB,MAAM,EAAE,KAAK,EAAE,GAAG,GAAG,CAAA;YACrB,MAAM,cAAc,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,SAAS,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,OAAO,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,CAAA;YACjF,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,CAAC,CAAA;YAChC,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,GAAG,CAAA;YAExC,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAChC,MAAM,IAAI,KAAK,CAAC,6CAA6C,CAAC,CAAA;YAChE,CAAC;YAED,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAgD,CAAA;YACxE,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAqB,CAAA;YAC7C,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAA;YAErC,+BAA+B;YAC/B,KAAK,MAAM,UAAU,IAAI,cAAc,EAAE,CAAC;gBACxC,IAAI,MAAW,CAAA;gBACf,IAAI,CAAC;oBAAC,MAAM,GAAG,MAAM,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;gBAAC,CAAC;gBAAC,MAAM,CAAC;oBAAC,SAAQ;gBAAC,CAAC;gBAC/D,IAAI,CAAC,MAAM;oBAAE,SAAQ;gBAErB,QAAQ,CAAC,GAAG,CAAC,UAAU,EAAE;oBACvB,EAAE,EAAE,MAAM,CAAC,EAAE;oBACb,KAAK,EAAE,WAAW,CAAC,MAAM,CAAC;oBAC1B,IAAI,EAAE,MAAM,CAAC,IAAI,IAAI,UAAU;oBAC/B,QAAQ,EAAE,MAAM,CAAC,QAAQ;iBAC1B,CAAC,CAAA;gBAEF,oCAAoC;gBACpC,MAAM,QAAQ,GAAG,MAAO,KAAa,CAAC,YAAY,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,IAAI,EAAE,CAAA;gBAC9E,MAAM,QAAQ,GAAG,MAAO,KAAa,CAAC,YAAY,CAAC,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC,IAAI,EAAE,CAAA;gBAE5E,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;oBAC5B,MAAM,MAAM,GAAG,GAAG,UAAU,IAAI,IAAI,CAAC,IAAI,IAAI,WAAW,IAAI,IAAI,CAAC,EAAE,EAAE,CAAA;oBACrE,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;oBACxB,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE;wBACnB,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE;wBAC/C,KAAK,EAAE,IAAI,CAAC,IAAI,IAAI,WAAW,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,IAAI,WAAW;qBAChE,CAAC,CAAA;gBACJ,CAAC;gBACD,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;oBAC5B,MAAM,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,IAAI,WAAW,IAAI,UAAU,EAAE,CAAA;oBACvE,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;oBAC1B,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE;wBACnB,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,UAAU;wBACjD,KAAK,EAAE,IAAI,CAAC,IAAI,IAAI,WAAW,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,IAAI,WAAW;qBAChE,CAAC,CAAA;gBACJ,CAAC;YACH,CAAC;YAED,qDAAqD;YACrD,MAAM,kBAAkB,GAAG,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC;iBAC/C,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;iBAC/B,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAA;YAErB,MAAM,eAAe,GAAG,MAAM,OAAO,CAAC,GAAG,CACvC,kBAAkB,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,EAAE,EAAE;gBAClC,IAAI,CAAC;oBAAC,OAAO,MAAM,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;gBAAC,CAAC;gBAAC,MAAM,CAAC;oBAAC,OAAO,IAAI,CAAA;gBAAC,CAAC;YAC1D,CAAC,CAAC,CACH,CAAA;YAED,KAAK,MAAM,QAAQ,IAAI,eAAe,EAAE,CAAC;gBACvC,IAAI,CAAC,QAAQ;oBAAE,SAAQ;gBACvB,MAAM,IAAI,GAAI,QAAgB,CAAC,QAA+C,CAAA;gBAC9E,IAAI,IAAI,EAAE,gBAAgB;oBAAE,SAAQ,CAAC,+BAA+B;gBAEpE,QAAQ,CAAC,GAAG,CAAE,QAAgB,CAAC,EAAE,EAAE;oBACjC,EAAE,EAAG,QAAgB,CAAC,EAAE;oBACxB,KAAK,EAAE,WAAW,CAAC,QAAe,CAAC;oBACnC,IAAI,EAAG,QAAgB,CAAC,IAAI,IAAI,UAAU;oBAC1C,QAAQ,EAAE,IAAI;iBACf,CAAC,CAAA;YACJ,CAAC;YAED,oDAAoD;YACpD,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAA;YAC1C,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAA;YAC3C,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAChD,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CACxD,CAAA;YAED,OAAO;gBACL,KAAK;gBACL,KAAK;gBACL,eAAe,EAAE,cAAc;gBAC/B,KAAK;gBACL,OAAO,EAAE,WAAW,CAAC,IAAI,GAAG,QAAQ;aACrC,CAAA;QACH,CAAC;QAED;;;;;;WAMG;QACH,KAAK,CAAC,UAAU,CAAC,MAAc,EAAE,GAAmB;YAClD,MAAM,EAAE,KAAK,EAAE,GAAG,GAAG,CAAA;YAErB,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;YACpC,IAAI,CAAC,IAAI;gBAAE,MAAM,IAAI,KAAK,CAAC,QAAQ,MAAM,YAAY,CAAC,CAAA;YAEtD,MAAM,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;YAC1B,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,CAAA;QACtC,CAAC;KACF,CAAA;AACH,CAAC;AAED,gFAAgF;AAChF,0BAA0B;AAC1B,gFAAgF;AAEhF;;GAEG;AACH,KAAK,UAAU,cAAc,CAC3B,KAAa,EACb,KAAkB,EAClB,KAAkB;IAElB,MAAM,GAAG,GAAI,KAAa,CAAC,GAAG,CAAA;IAC9B,MAAM,WAAW,GAAG,MAAM,GAAG,CAAC,cAAc,CAAC,GAAG,EAAE,EAAE,eAAe,EAAE,IAAI,EAAE,CAAC,CAAA;IAC5E,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAA;IAE1C,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;QAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,QAA+C,CAAA;QACjE,MAAM,IAAI,GAAI,IAAI,EAAE,IAAe,IAAI,GAAG,CAAA;QAC1C,MAAM,WAAW,GAAG,IAAI,EAAE,OAAO,KAAK,WAAW,CAAA;QACjD,MAAM,MAAM,GAAG,cAAc,CAAC,IAAI,CAAC,CAAA;QAEnC,IAAI,IAAI,GAAI,IAAI,EAAE,IAAe,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,IAAI,MAAM,CAAA;QACpE,IAAI,UAAU,GAAG,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,MAAM,CAAA;QAEnD,IAAI,MAAM,EAAE,IAAI,IAAI,OAAO,MAAM,CAAC,IAAI,KAAK,QAAQ;YAAE,IAAI,GAAG,MAAM,CAAC,IAAI,CAAA;QACvE,IAAI,MAAM,EAAE,IAAI,IAAI,OAAO,MAAM,CAAC,IAAI,KAAK,QAAQ;YAAE,UAAU,GAAG,MAAM,CAAC,IAAI,CAAA;QAE7E,IAAI,IAAI,KAAK,GAAG,EAAE,CAAC;YAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;YAAC,SAAQ;QAAC,CAAC;QAE3D,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,CAAA;QAC1D,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,CAAA;IAC7B,CAAC;IAED,sCAAsC;IACtC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC,CAAA;QAC7D,MAAM,IAAI,GAAG,MAAM,EAAE,QAA+C,CAAA;QACpE,MAAM,IAAI,GAAI,IAAI,EAAE,IAAe,IAAI,EAAE,CAAA;QACzC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;QAC7C,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,SAAQ;QAEhC,KAAK,CAAC,GAAG,EAAE,CAAA;QACX,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAA;QACjE,IAAI,UAAU,KAAK,GAAG;YAAE,SAAQ;QAEhC,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;QACzC,IAAI,QAAQ,EAAE,CAAC;YACb,MAAM,KAAK,GAAG,IAAI,EAAE,OAAO,KAAK,WAAW,CAAA;YAC3C,KAAK,CAAC,IAAI,CAAC;gBACT,EAAE,EAAE,OAAO,QAAQ,IAAI,IAAI,CAAC,EAAE,EAAE;gBAChC,MAAM,EAAE,QAAQ;gBAChB,MAAM,EAAE,IAAI,CAAC,EAAE;gBACf,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,eAAe;gBAC/C,IAAI,EAAE,eAAe;aACtB,CAAC,CAAA;QACJ,CAAC;IACH,CAAC;AACH,CAAC;AAED;;GAEG;AACH,KAAK,UAAU,iBAAiB,CAC9B,KAAa,EACb,KAAkB,EAClB,KAAkB,EAClB,KAAa;IAEb,MAAM,OAAO,GAAG,MAAM,KAAK,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,UAAU,EAAE,KAAK,EAAS,CAAC,CAAA;IAChF,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;IAEjC,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,MAAM,MAAM,GAAI,MAAc,CAAC,MAAM,IAAI,MAAM,CAAA;QAC/C,MAAM,EAAE,GAAI,MAAc,CAAC,EAAE,IAAI,MAAM,CAAC,EAAE,CAAA;QAC1C,MAAM,MAAM,GAAG,cAAc,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAA;QAE9C,KAAK,CAAC,IAAI,CAAC;YACT,EAAE;YACF,KAAK,EAAE,WAAW,CAAC,MAAa,CAAC;YACjC,IAAI,EAAE,MAAM,CAAC,IAAI,IAAI,MAAM,CAAC,QAAQ,EAAE,IAAI,IAAI,SAAS;YACvD,QAAQ,EAAE,MAAM,IAAI,MAAM,CAAC,QAAQ,EAAE,QAAQ,IAAI,CAAC,OAAO,MAAM,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;SAC7G,CAAC,CAAA;QACF,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;IACjB,CAAC;IAED,oDAAoD;IACpD,MAAM,YAAY,GAAG,MAAO,KAAa,CAAC,YAAY,EAAE,CAAA;IACxD,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;QAC/B,IAAI,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACjD,KAAK,CAAC,IAAI,CAAC;gBACT,EAAE,EAAE,GAAG,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,EAAE,EAAE;gBACvC,MAAM,EAAE,GAAG,CAAC,IAAI;gBAChB,MAAM,EAAE,GAAG,CAAC,EAAE;gBACd,KAAK,EAAE,GAAG,CAAC,IAAI;gBACf,IAAI,EAAE,UAAU;aACjB,CAAC,CAAA;QACJ,CAAC;IACH,CAAC;AACH,CAAC"}

package/dist/server/handlers/import.d.ts

@@ -0,0 +1,96 @@
+/**
+ * @module server/handlers/import
+ * @description Import namespace handler — smart file upload and structured data
+ * import with streaming progress.
+ *
+ * Absorbs Workshop `routes/import.ts` and `routes/import-data.ts`. Both
+ * `uploadFiles` and `importData` return async iterables that stream
+ * {@link ImportProgress} events as the import pipeline processes each phase.
+ *
+ * The handler delegates format parsing to an injected `ImportPipeline`
+ * interface, allowing products to register parsers for their supported formats.
+ *
+ * Methods:
+ * - `uploadFiles` — Smart file import with streaming progress
+ * - `importData` — Structured data import (JSON, CSV, GraphML, etc.)
+ * - `getFormats` — List supported import formats
+ * - `detectFormat` — Auto-detect data format
+ * - `getProgress` — Get progress of an ongoing import
+ * - `cancel` — Cancel an in-progress import
+ */
+import type { NamespaceProvider } from '../namespace-router.js';
+import type { ImportProgress } from '../../namespaces.js';
+/**
+ * Import pipeline interface for processing files and structured data.
+ *
+ * Products implement this to register parsers for their supported formats.
+ * Workshop uses `routes/parsers/` which supports GraphML, GEXF, DOT, OPML,
+ * CSV, JSON, Obsidian vault, Turtle/JSON-LD, etc.
+ */
+export interface ImportPipeline {
+    /**
+     * Import files into the workspace.
+     *
+     * @param files - Array of files to import.
+     * @param brain - Brainy instance to write to.
+     * @param userId - User performing the import.
+     * @returns Async iterable of progress events.
+     */
+    importFiles(files: Array<{
+        name: string;
+        content: string | ArrayBuffer;
+        mimeType: string;
+    }>, brain: any, userId: string): AsyncIterable<ImportProgress>;
+    /**
+     * Import structured data into the workspace.
+     *
+     * @param options - Import configuration.
+     * @param brain - Brainy instance to write to.
+     * @param userId - User performing the import.
+     * @returns Async iterable of progress events.
+     */
+    importData(options: {
+        format: string;
+        data: string | ArrayBuffer;
+        mappings?: Record<string, string>;
+    }, brain: any, userId: string): AsyncIterable<ImportProgress>;
+    /**
+     * List supported import formats.
+     *
+     * @returns Array of format descriptors.
+     */
+    getFormats(): Array<{
+        id: string;
+        name: string;
+        extensions: string[];
+        description: string;
+    }>;
+    /**
+     * Auto-detect the format of data content.
+     *
+     * @param data - Data to analyze.
+     * @returns Detected format and confidence score.
+     */
+    detectFormat(data: string): {
+        format: string;
+        confidence: number;
+    };
+}
+/**
+ * Options for {@link createImportHandler}.
+ */
+export interface ImportHandlerOptions {
+    /**
+     * Import pipeline implementation.
+     * If not provided, all methods throw with a "not configured" error.
+     */
+    pipeline: ImportPipeline;
+}
+/**
+ * Creates the `import` namespace handler.
+ *
+ * @param options - Import handler dependencies. If omitted, all methods throw.
+ * @returns A {@link NamespaceProvider} implementing {@link ImportNamespace}.
+ */
+export declare function createImportHandler(options?: ImportHandlerOptions): NamespaceProvider;
+//# sourceMappingURL=import.d.ts.map

package/dist/server/handlers/import.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"import.d.ts","sourceRoot":"","sources":["../../../src/server/handlers/import.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,OAAO,KAAK,EAAE,iBAAiB,EAAkB,MAAM,wBAAwB,CAAA;AAC/E,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,qBAAqB,CAAA;AAMzD;;;;;;GAMG;AACH,MAAM,WAAW,cAAc;IAC7B;;;;;;;OAOG;IACH,WAAW,CACT,KAAK,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,GAAG,WAAW,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAC,EAC/E,KAAK,EAAE,GAAG,EACV,MAAM,EAAE,MAAM,GACb,aAAa,CAAC,cAAc,CAAC,CAAA;IAEhC;;;;;;;OAOG;IACH,UAAU,CACR,OAAO,EAAE;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,GAAG,WAAW,CAAC;QAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;KAAE,EAC1F,KAAK,EAAE,GAAG,EACV,MAAM,EAAE,MAAM,GACb,aAAa,CAAC,cAAc,CAAC,CAAA;IAEhC;;;;OAIG;IACH,UAAU,IAAI,KAAK,CAAC;QAClB,EAAE,EAAE,MAAM,CAAA;QACV,IAAI,EAAE,MAAM,CAAA;QACZ,UAAU,EAAE,MAAM,EAAE,CAAA;QACpB,WAAW,EAAE,MAAM,CAAA;KACpB,CAAC,CAAA;IAEF;;;;;OAKG;IACH,YAAY,CAAC,IAAI,EAAE,MAAM,GAAG;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAA;KAAE,CAAA;CACnE;AAED;;GAEG;AACH,MAAM,WAAW,oBAAoB;IACnC;;;OAGG;IACH,QAAQ,EAAE,cAAc,CAAA;CACzB;AAgBD;;;;;GAKG;AACH,wBAAgB,mBAAmB,CAAC,OAAO,CAAC,EAAE,oBAAoB,GAAG,iBAAiB,CAuFrF"}