@framers/agentos 0.1.28 → 0.1.30

package/dist/discovery/CapabilityGraph.js

@@ -0,0 +1,263 @@
+/**
+ * @fileoverview Capability Relationship Graph
+ * @module @framers/agentos/discovery/CapabilityGraph
+ *
+ * Lightweight, deterministic relationship graph over capabilities.
+ * Built from metadata (SKILL.md frontmatter, preset co-occurrence),
+ * NOT from LLM extraction.
+ *
+ * Uses graphology (already in codebase via GraphRAGEngine) for:
+ * - O(1) neighbor lookups
+ * - Edge attributes (type, weight)
+ * - Sub-millisecond traversal for ~100 nodes
+ *
+ * Implements ICapabilityGraph so Neo4j can be swapped in later
+ * if capabilities scale to 1000+.
+ *
+ * Edge types:
+ * - DEPENDS_ON: Skill → Tool (from requiredTools)
+ * - COMPOSED_WITH: Co-occur in agent presets (suggestedSkills + suggestedExtensions)
+ * - SAME_CATEGORY: Shared category (weak signal, low weight)
+ * - TAGGED_WITH: Shared tags (weighted by overlap count, ≥2 tags)
+ */
+import Graph from 'graphology';
+// ============================================================================
+// GRAPHOLOGY-BASED CAPABILITY GRAPH
+// ============================================================================
+export class CapabilityGraph {
+    constructor() {
+        this.graph = new Graph({ multi: false, type: 'undirected' });
+    }
+    // ============================================================================
+    // BUILD
+    // ============================================================================
+    /**
+     * Build the graph from capability descriptors and preset co-occurrence data.
+     *
+     * Construction order:
+     * 1. Add all capabilities as nodes
+     * 2. Add DEPENDS_ON edges (skill → tool dependencies)
+     * 3. Add COMPOSED_WITH edges (preset co-occurrence)
+     * 4. Add TAGGED_WITH edges (shared tags, ≥2 overlap)
+     * 5. Add SAME_CATEGORY edges (weak signal)
+     */
+    buildGraph(capabilities, presetCoOccurrences) {
+        // Clear any existing graph
+        this.graph.clear();
+        // 1. Add all capabilities as nodes
+        for (const cap of capabilities) {
+            this.graph.addNode(cap.id, {
+                kind: cap.kind,
+                category: cap.category,
+                name: cap.name,
+            });
+        }
+        // 2. Add DEPENDS_ON edges (skill → tool)
+        for (const cap of capabilities) {
+            if (cap.requiredTools.length > 0) {
+                for (const toolName of cap.requiredTools) {
+                    // Try both tool:name and skill:name patterns
+                    const toolId = `tool:${toolName}`;
+                    if (this.graph.hasNode(cap.id) && this.graph.hasNode(toolId)) {
+                        this.safeAddEdge(cap.id, toolId, 'DEPENDS_ON', 1.0);
+                    }
+                }
+            }
+        }
+        // 3. Add COMPOSED_WITH edges from preset co-occurrence
+        if (presetCoOccurrences) {
+            for (const preset of presetCoOccurrences) {
+                const validIds = preset.capabilityIds.filter((id) => this.graph.hasNode(id));
+                for (let i = 0; i < validIds.length; i++) {
+                    for (let j = i + 1; j < validIds.length; j++) {
+                        this.safeAddEdge(validIds[i], validIds[j], 'COMPOSED_WITH', 0.5);
+                    }
+                }
+            }
+        }
+        // 4. Add TAGGED_WITH edges (shared tags, ≥2 overlap)
+        const tagIndex = new Map();
+        for (const cap of capabilities) {
+            for (const tag of cap.tags) {
+                const list = tagIndex.get(tag) ?? [];
+                list.push(cap.id);
+                tagIndex.set(tag, list);
+            }
+        }
+        // Count tag overlaps between capability pairs
+        const pairOverlaps = new Map();
+        for (const [, capIds] of tagIndex) {
+            for (let i = 0; i < capIds.length; i++) {
+                for (let j = i + 1; j < capIds.length; j++) {
+                    const key = [capIds[i], capIds[j]].sort().join('||');
+                    pairOverlaps.set(key, (pairOverlaps.get(key) ?? 0) + 1);
+                }
+            }
+        }
+        for (const [key, count] of pairOverlaps) {
+            if (count >= 2) {
+                const [a, b] = key.split('||');
+                this.safeAddEdge(a, b, 'TAGGED_WITH', count * 0.3);
+            }
+        }
+        // 5. Add SAME_CATEGORY edges (weak signal — only between same-kind capabilities)
+        const categoryIndex = new Map();
+        for (const cap of capabilities) {
+            const key = `${cap.kind}:${cap.category}`;
+            const list = categoryIndex.get(key) ?? [];
+            list.push(cap.id);
+            categoryIndex.set(key, list);
+        }
+        for (const [, capIds] of categoryIndex) {
+            // Only add category edges for groups of 2-8 (avoid massive cliques)
+            if (capIds.length >= 2 && capIds.length <= 8) {
+                for (let i = 0; i < capIds.length; i++) {
+                    for (let j = i + 1; j < capIds.length; j++) {
+                        this.safeAddEdge(capIds[i], capIds[j], 'SAME_CATEGORY', 0.1);
+                    }
+                }
+            }
+        }
+    }
+    // ============================================================================
+    // QUERY
+    // ============================================================================
+    /**
+     * Get capabilities related to a given capability (1-hop neighbors).
+     * Returns neighbors with edge weights, sorted by weight descending.
+     */
+    getRelated(capabilityId) {
+        if (!this.graph.hasNode(capabilityId))
+            return [];
+        const related = [];
+        this.graph.forEachEdge(capabilityId, (_edge, attrs, source, target) => {
+            const neighborId = source === capabilityId ? target : source;
+            related.push({
+                id: neighborId,
+                weight: attrs.weight,
+                relationType: attrs.type,
+            });
+        });
+        // Sort by weight descending
+        related.sort((a, b) => b.weight - a.weight);
+        return related;
+    }
+    /**
+     * Get the subgraph for a set of capability IDs.
+     * Returns all nodes and edges within the induced subgraph.
+     */
+    getSubgraph(capabilityIds) {
+        const nodeSet = new Set(capabilityIds.filter((id) => this.graph.hasNode(id)));
+        const edges = [];
+        for (const nodeId of nodeSet) {
+            this.graph.forEachEdge(nodeId, (_edge, attrs, source, target) => {
+                // Only include edges where both endpoints are in the subgraph
+                if (nodeSet.has(source) && nodeSet.has(target)) {
+                    // Avoid duplicates (undirected graph)
+                    const edgeKey = [source, target].sort().join('||');
+                    if (!edges.some((e) => [e.sourceId, e.targetId].sort().join('||') === edgeKey)) {
+                        edges.push({
+                            sourceId: source,
+                            targetId: target,
+                            type: attrs.type,
+                            weight: attrs.weight,
+                        });
+                    }
+                }
+            });
+        }
+        return {
+            nodes: Array.from(nodeSet),
+            edges,
+        };
+    }
+    /**
+     * Apply graph-based re-ranking boost to search results.
+     *
+     * For each result in the search results:
+     * 1. Look up its graph neighbors
+     * 2. If a neighbor is also in the results, boost both by graphBoostFactor * edge weight
+     * 3. If a neighbor is NOT in results but has a DEPENDS_ON edge, add it as a candidate
+     *
+     * Returns re-ranked results with potentially new candidates added.
+     */
+    rerank(searchResults, graphBoostFactor) {
+        const resultMap = new Map();
+        // Initialize with original scores
+        for (const r of searchResults) {
+            resultMap.set(r.id, { score: r.score, boosted: false });
+        }
+        // Apply graph boosts
+        for (const r of searchResults) {
+            const related = this.getRelated(r.id);
+            for (const rel of related) {
+                if (resultMap.has(rel.id)) {
+                    // Both in results — mutual boost
+                    const existing = resultMap.get(rel.id);
+                    existing.score += graphBoostFactor * rel.weight;
+                    existing.boosted = true;
+                }
+                else if (rel.relationType === 'DEPENDS_ON' || rel.relationType === 'COMPOSED_WITH') {
+                    // Not in results but has strong relationship — pull in as candidate
+                    resultMap.set(rel.id, {
+                        score: r.score * graphBoostFactor * rel.weight,
+                        boosted: true,
+                    });
+                }
+            }
+        }
+        // Sort by score descending
+        return Array.from(resultMap.entries())
+            .map(([id, { score, boosted }]) => ({ id, score, boosted }))
+            .sort((a, b) => b.score - a.score);
+    }
+    // ============================================================================
+    // ACCESSORS
+    // ============================================================================
+    nodeCount() {
+        return this.graph.order;
+    }
+    edgeCount() {
+        return this.graph.size;
+    }
+    clear() {
+        this.graph.clear();
+    }
+    // ============================================================================
+    // INTERNAL HELPERS
+    // ============================================================================
+    /**
+     * Safely add an edge, handling the case where it already exists.
+     * If the edge already exists, update to the higher weight.
+     */
+    safeAddEdge(source, target, type, weight) {
+        if (!this.graph.hasNode(source) || !this.graph.hasNode(target))
+            return;
+        if (source === target)
+            return;
+        try {
+            const existingEdge = this.graph.edge(source, target);
+            if (existingEdge) {
+                // Edge exists — keep the one with higher weight or stronger type
+                const existing = this.graph.getEdgeAttributes(existingEdge);
+                if (weight > existing.weight) {
+                    this.graph.setEdgeAttribute(existingEdge, 'weight', weight);
+                    this.graph.setEdgeAttribute(existingEdge, 'type', type);
+                }
+            }
+            else {
+                this.graph.addEdge(source, target, { type, weight });
+            }
+        }
+        catch {
+            // Edge might already exist in the other direction for undirected
+            try {
+                this.graph.addEdge(source, target, { type, weight });
+            }
+            catch {
+                // Silently ignore — edge already exists
+            }
+        }
+    }
+}
+//# sourceMappingURL=CapabilityGraph.js.map

package/dist/discovery/CapabilityGraph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"CapabilityGraph.js","sourceRoot":"","sources":["../../src/discovery/CapabilityGraph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAEH,OAAO,KAAK,MAAM,YAAY,CAAC;AAW/B,+EAA+E;AAC/E,oCAAoC;AACpC,+EAA+E;AAE/E,MAAM,OAAO,eAAe;IAG1B;QACE,IAAI,CAAC,KAAK,GAAG,IAAI,KAAK,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,YAAY,EAAE,CAAC,CAAC;IAC/D,CAAC;IAED,+EAA+E;IAC/E,QAAQ;IACR,+EAA+E;IAE/E;;;;;;;;;OASG;IACH,UAAU,CACR,YAAoC,EACpC,mBAA0C;QAE1C,2BAA2B;QAC3B,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QAEnB,mCAAmC;QACnC,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;YAC/B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE;gBACzB,IAAI,EAAE,GAAG,CAAC,IAAI;gBACd,QAAQ,EAAE,GAAG,CAAC,QAAQ;gBACtB,IAAI,EAAE,GAAG,CAAC,IAAI;aACf,CAAC,CAAC;QACL,CAAC;QAED,yCAAyC;QACzC,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;YAC/B,IAAI,GAAG,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACjC,KAAK,MAAM,QAAQ,IAAI,GAAG,CAAC,aAAa,EAAE,CAAC;oBACzC,6CAA6C;oBAC7C,MAAM,MAAM,GAAG,QAAQ,QAAQ,EAAE,CAAC;oBAClC,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;wBAC7D,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,EAAE,YAAY,EAAE,GAAG,CAAC,CAAC;oBACtD,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,uDAAuD;QACvD,IAAI,mBAAmB,EAAE,CAAC;YACxB,KAAK,MAAM,MAAM,IAAI,mBAAmB,EAAE,CAAC;gBACzC,MAAM,QAAQ,GAAG,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC7E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBACzC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;wBAC7C,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,eAAe,EAAE,GAAG,CAAC,CAAC;oBACnE,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,qDAAqD;QACrD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAC;QAC7C,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;YAC/B,KAAK,MAAM,GAAG,IAAI,GAAG,CAAC,IAAI,EAAE,CAAC;gBAC3B,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;gBACrC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBAClB,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YAC1B,CAAC;QACH,CAAC;QAED,8CAA8C;QAC9C,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC/C,KAAK,MAAM,CAAC,EAAE,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACvC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC3C,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACrD,YAAY,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC1D,CAAC;YACH,CAAC;QACH,CAAC;QAED,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,YAAY,EAAE,CAAC;YACxC,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;gBACf,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBAC/B,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,aAAa,EAAE,KAAK,GAAG,GAAG,CAAC,CAAC;YACrD,CAAC;QACH,CAAC;QAED,iFAAiF;QACjF,MAAM,aAAa,GAAG,IAAI,GAAG,EAAoB,CAAC;QAClD,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;YAC/B,MAAM,GAAG,GAAG,GAAG,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,QAAQ,EAAE,CAAC;YAC1C,MAAM,IAAI,GAAG,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;YAC1C,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAClB,aAAa,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAC/B,CAAC;QAED,KAAK,MAAM,CAAC,EAAE,MAAM,CAAC,IAAI,aAAa,EAAE,CAAC;YACvC,oEAAoE;YACpE,IAAI,MAAM,CAAC,MAAM,IAAI,CAAC,IAAI,MAAM,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;gBAC7C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBACvC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;wBAC3C,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,eAAe,EAAE,GAAG,CAAC,CAAC;oBAC/D,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,+EAA+E;IAC/E,QAAQ;IACR,+EAA+E;IAE/E;;;OAGG;IACH,UAAU,CAAC,YAAoB;QAC7B,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC;YAAE,OAAO,EAAE,CAAC;QAEjD,MAAM,OAAO,GAAwB,EAAE,CAAC;QAExC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,YAAY,EAAE,CAAC,KAAa,EAAE,KAA8B,EAAE,MAAc,EAAE,MAAc,EAAE,EAAE;YACrH,MAAM,UAAU,GAAG,MAAM,KAAK,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC;YAC7D,OAAO,CAAC,IAAI,CAAC;gBACX,EAAE,EAAE,UAAU;gBACd,MAAM,EAAG,KAA4B,CAAC,MAAM;gBAC5C,YAAY,EAAG,KAAsC,CAAC,IAAI;aAC3D,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,4BAA4B;QAC5B,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;QAE5C,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;OAGG;IACH,WAAW,CAAC,aAAuB;QAIjC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC9E,MAAM,KAAK,GAAqB,EAAE,CAAC;QAEnC,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,KAAa,EAAE,KAA8B,EAAE,MAAc,EAAE,MAAc,EAAE,EAAE;gBAC/G,8DAA8D;gBAC9D,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;oBAC/C,sCAAsC;oBACtC,MAAM,OAAO,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACnD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,OAAO,CAAC,EAAE,CAAC;wBAC/E,KAAK,CAAC,IAAI,CAAC;4BACT,QAAQ,EAAE,MAAM;4BAChB,QAAQ,EAAE,MAAM;4BAChB,IAAI,EAAG,KAAsC,CAAC,IAAI;4BAClD,MAAM,EAAG,KAA4B,CAAC,MAAM;yBAC7C,CAAC,CAAC;oBACL,CAAC;gBACH,CAAC;YACH,CAAC,CAAC,CAAC;QACL,CAAC;QAED,OAAO;YACL,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC;YAC1B,KAAK;SACN,CAAC;IACJ,CAAC;IAED;;;;;;;;;OASG;IACH,MAAM,CACJ,aAAmD,EACnD,gBAAwB;QAExB,MAAM,SAAS,GAAG,IAAI,GAAG,EAA+C,CAAC;QAEzE,kCAAkC;QAClC,KAAK,MAAM,CAAC,IAAI,aAAa,EAAE,CAAC;YAC9B,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;QAC1D,CAAC;QAED,qBAAqB;QACrB,KAAK,MAAM,CAAC,IAAI,aAAa,EAAE,CAAC;YAC9B,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAEtC,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;gBAC1B,IAAI,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;oBAC1B,iCAAiC;oBACjC,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;oBACxC,QAAQ,CAAC,KAAK,IAAI,gBAAgB,GAAG,GAAG,CAAC,MAAM,CAAC;oBAChD,QAAQ,CAAC,OAAO,GAAG,IAAI,CAAC;gBAC1B,CAAC;qBAAM,IAAI,GAAG,CAAC,YAAY,KAAK,YAAY,IAAI,GAAG,CAAC,YAAY,KAAK,eAAe,EAAE,CAAC;oBACrF,oEAAoE;oBACpE,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE;wBACpB,KAAK,EAAE,CAAC,CAAC,KAAK,GAAG,gBAAgB,GAAG,GAAG,CAAC,MAAM;wBAC9C,OAAO,EAAE,IAAI;qBACd,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;QAED,2BAA2B;QAC3B,OAAO,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC;aACnC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;aAC3D,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IACvC,CAAC;IAED,+EAA+E;IAC/E,YAAY;IACZ,+EAA+E;IAE/E,SAAS;QACP,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC;IAC1B,CAAC;IAED,SAAS;QACP,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACzB,CAAC;IAED,KAAK;QACH,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;IACrB,CAAC;IAED,+EAA+E;IAC/E,mBAAmB;IACnB,+EAA+E;IAE/E;;;OAGG;IACK,WAAW,CACjB,MAAc,EACd,MAAc,EACd,IAAwB,EACxB,MAAc;QAEd,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;YAAE,OAAO;QACvE,IAAI,MAAM,KAAK,MAAM;YAAE,OAAO;QAE9B,IAAI,CAAC;YACH,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YACrD,IAAI,YAAY,EAAE,CAAC;gBACjB,iEAAiE;gBACjE,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,YAAY,CAGzD,CAAC;gBACF,IAAI,MAAM,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;oBAC7B,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,YAAY,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;oBAC5D,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,YAAY,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;gBAC1D,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC;YACvD,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,iEAAiE;YACjE,IAAI,CAAC;gBACH,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC;YACvD,CAAC;YAAC,MAAM,CAAC;gBACP,wCAAwC;YAC1C,CAAC;QACH,CAAC;IACH,CAAC;CACF"}

package/dist/discovery/CapabilityIndex.d.ts

@@ -0,0 +1,93 @@
+/**
+ * @fileoverview Capability Index — vector index over all capabilities.
+ * @module @framers/agentos/discovery/CapabilityIndex
+ *
+ * Normalizes tools, skills, extensions, and channels into unified
+ * CapabilityDescriptor objects, embeds them, and stores them in a
+ * vector index for semantic search.
+ *
+ * Reuses existing infrastructure:
+ * - IEmbeddingManager for embedding generation (with LRU cache)
+ * - IVectorStore for vector storage (InMemory, HNSW, Qdrant, SQL)
+ *
+ * Performance targets:
+ * - Index build: ~3s for ~100 capabilities (one-time, embedding API calls)
+ * - Search: <1ms HNSW lookup + ~50ms embedding cold / <5ms warm
+ */
+import type { IEmbeddingManager } from '../rag/IEmbeddingManager.js';
+import type { IVectorStore } from '../rag/IVectorStore.js';
+import type { CapabilityDescriptor, CapabilityKind, CapabilitySearchResult, CapabilityIndexSources } from './types.js';
+import { CapabilityEmbeddingStrategy } from './CapabilityEmbeddingStrategy.js';
+export declare class CapabilityIndex {
+    private readonly embeddingManager;
+    private readonly vectorStore;
+    private readonly collectionName;
+    private readonly embeddingModelId?;
+    private readonly descriptors;
+    private readonly embeddingStrategy;
+    private built;
+    constructor(embeddingManager: IEmbeddingManager, vectorStore: IVectorStore, collectionName: string, embeddingModelId?: string | undefined);
+    /**
+     * Build the index from all capability sources.
+     * Normalizes sources into CapabilityDescriptors, embeds them, and stores
+     * in the vector store.
+     */
+    buildIndex(sources: CapabilityIndexSources): Promise<void>;
+    /**
+     * Incrementally add or update a single capability.
+     */
+    upsertCapability(cap: CapabilityDescriptor): Promise<void>;
+    /**
+     * Remove a capability from the index.
+     */
+    removeCapability(id: string): Promise<void>;
+    /**
+     * Semantic search for capabilities matching a query.
+     *
+     * @param query - Natural language query (e.g., "search the web for news")
+     * @param topK - Number of results to return
+     * @param filters - Optional filters by kind, category, availability
+     */
+    search(query: string, topK: number, filters?: {
+        kind?: CapabilityKind | 'any';
+        category?: string;
+        onlyAvailable?: boolean;
+    }): Promise<CapabilitySearchResult[]>;
+    /**
+     * Get a capability by ID.
+     */
+    getCapability(id: string): CapabilityDescriptor | undefined;
+    /**
+     * Get all registered capabilities.
+     */
+    getAllCapabilities(): CapabilityDescriptor[];
+    /**
+     * Get all capability IDs.
+     */
+    listIds(): string[];
+    /**
+     * Get capabilities grouped by category.
+     */
+    getByCategory(): Map<string, CapabilityDescriptor[]>;
+    /**
+     * Whether the index has been built.
+     */
+    isBuilt(): boolean;
+    /**
+     * Number of indexed capabilities.
+     */
+    size(): number;
+    /**
+     * Get the embedding strategy (for external use by assembler).
+     */
+    getEmbeddingStrategy(): CapabilityEmbeddingStrategy;
+    /**
+     * Normalize all sources into CapabilityDescriptor objects.
+     */
+    normalizeSources(sources: CapabilityIndexSources): CapabilityDescriptor[];
+    private normalizeToolSource;
+    private normalizeSkillSource;
+    private normalizeExtensionSource;
+    private normalizeChannelSource;
+}
+//# sourceMappingURL=CapabilityIndex.d.ts.map

package/dist/discovery/CapabilityIndex.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"CapabilityIndex.d.ts","sourceRoot":"","sources":["../../src/discovery/CapabilityIndex.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,6BAA6B,CAAC;AACrE,OAAO,KAAK,EAAE,YAAY,EAAkC,MAAM,wBAAwB,CAAC;AAC3F,OAAO,KAAK,EACV,oBAAoB,EACpB,cAAc,EACd,sBAAsB,EACtB,sBAAsB,EAEvB,MAAM,YAAY,CAAC;AACpB,OAAO,EAAE,2BAA2B,EAAE,MAAM,kCAAkC,CAAC;AAM/E,qBAAa,eAAe;IAMxB,OAAO,CAAC,QAAQ,CAAC,gBAAgB;IACjC,OAAO,CAAC,QAAQ,CAAC,WAAW;IAC5B,OAAO,CAAC,QAAQ,CAAC,cAAc;IAC/B,OAAO,CAAC,QAAQ,CAAC,gBAAgB,CAAC;IARpC,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAgD;IAC5E,OAAO,CAAC,QAAQ,CAAC,iBAAiB,CAA8B;IAChE,OAAO,CAAC,KAAK,CAAS;gBAGH,gBAAgB,EAAE,iBAAiB,EACnC,WAAW,EAAE,YAAY,EACzB,cAAc,EAAE,MAAM,EACtB,gBAAgB,CAAC,EAAE,MAAM,YAAA;IAS5C;;;;OAIG;IACG,UAAU,CAAC,OAAO,EAAE,sBAAsB,GAAG,OAAO,CAAC,IAAI,CAAC;IA0DhE;;OAEG;IACG,gBAAgB,CAAC,GAAG,EAAE,oBAAoB,GAAG,OAAO,CAAC,IAAI,CAAC;IAwBhE;;OAEG;IACG,gBAAgB,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IASjD;;;;;;OAMG;IACG,MAAM,CACV,KAAK,EAAE,MAAM,EACb,IAAI,EAAE,MAAM,EACZ,OAAO,CAAC,EAAE;QACR,IAAI,CAAC,EAAE,cAAc,GAAG,KAAK,CAAC;QAC9B,QAAQ,CAAC,EAAE,MAAM,CAAC;QAClB,aAAa,CAAC,EAAE,OAAO,CAAC;KACzB,GACA,OAAO,CAAC,sBAAsB,EAAE,CAAC;IAgDpC;;OAEG;IACH,aAAa,CAAC,EAAE,EAAE,MAAM,GAAG,oBAAoB,GAAG,SAAS;IAI3D;;OAEG;IACH,kBAAkB,IAAI,oBAAoB,EAAE;IAI5C;;OAEG;IACH,OAAO,IAAI,MAAM,EAAE;IAInB;;OAEG;IACH,aAAa,IAAI,GAAG,CAAC,MAAM,EAAE,oBAAoB,EAAE,CAAC;IAUpD;;OAEG;IACH,OAAO,IAAI,OAAO;IAIlB;;OAEG;IACH,IAAI,IAAI,MAAM;IAId;;OAEG;IACH,oBAAoB,IAAI,2BAA2B;IAQnD;;OAEG;IACH,gBAAgB,CAAC,OAAO,EAAE,sBAAsB,GAAG,oBAAoB,EAAE;IAoCzE,OAAO,CAAC,mBAAmB;IAkB3B,OAAO,CAAC,oBAAoB;IAqB5B,OAAO,CAAC,wBAAwB;IAoBhC,OAAO,CAAC,sBAAsB;CAe/B"}