agent-knowledge 1.1.6 → 1.3.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/CHANGELOG.md +115 -5
- package/README.md +86 -24
- package/dist/dashboard.d.ts +1 -0
- package/dist/dashboard.d.ts.map +1 -1
- package/dist/dashboard.js +145 -19
- package/dist/dashboard.js.map +1 -1
- package/dist/embeddings/anthropic.d.ts.map +1 -1
- package/dist/embeddings/anthropic.js +2 -1
- package/dist/embeddings/anthropic.js.map +1 -1
- package/dist/embeddings/gemini.d.ts.map +1 -1
- package/dist/embeddings/gemini.js +2 -1
- package/dist/embeddings/gemini.js.map +1 -1
- package/dist/embeddings/local.d.ts.map +1 -1
- package/dist/embeddings/local.js +3 -0
- package/dist/embeddings/local.js.map +1 -1
- package/dist/knowledge/consolidate.d.ts +46 -0
- package/dist/knowledge/consolidate.d.ts.map +1 -0
- package/dist/knowledge/consolidate.js +164 -0
- package/dist/knowledge/consolidate.js.map +1 -0
- package/dist/knowledge/distill.d.ts.map +1 -1
- package/dist/knowledge/distill.js +4 -2
- package/dist/knowledge/distill.js.map +1 -1
- package/dist/knowledge/graph.d.ts +64 -0
- package/dist/knowledge/graph.d.ts.map +1 -0
- package/dist/knowledge/graph.js +214 -0
- package/dist/knowledge/graph.js.map +1 -0
- package/dist/knowledge/reflect.d.ts +33 -0
- package/dist/knowledge/reflect.d.ts.map +1 -0
- package/dist/knowledge/reflect.js +115 -0
- package/dist/knowledge/reflect.js.map +1 -0
- package/dist/knowledge/scoring.d.ts +57 -0
- package/dist/knowledge/scoring.d.ts.map +1 -0
- package/dist/knowledge/scoring.js +194 -0
- package/dist/knowledge/scoring.js.map +1 -0
- package/dist/knowledge/search.d.ts.map +1 -1
- package/dist/knowledge/search.js +15 -2
- package/dist/knowledge/search.js.map +1 -1
- package/dist/knowledge/store.d.ts.map +1 -1
- package/dist/knowledge/store.js +4 -3
- package/dist/knowledge/store.js.map +1 -1
- package/dist/search/excerpt.d.ts.map +1 -1
- package/dist/search/excerpt.js +2 -1
- package/dist/search/excerpt.js.map +1 -1
- package/dist/search/tfidf.d.ts +1 -0
- package/dist/search/tfidf.d.ts.map +1 -1
- package/dist/search/tfidf.js +38 -3
- package/dist/search/tfidf.js.map +1 -1
- package/dist/server.d.ts.map +1 -1
- package/dist/server.js +117 -381
- package/dist/server.js.map +1 -1
- package/dist/sessions/parser.d.ts.map +1 -1
- package/dist/sessions/parser.js +12 -10
- package/dist/sessions/parser.js.map +1 -1
- package/dist/sessions/search.js +17 -3
- package/dist/sessions/search.js.map +1 -1
- package/dist/sessions/summary.d.ts.map +1 -1
- package/dist/sessions/summary.js +6 -3
- package/dist/sessions/summary.js.map +1 -1
- package/dist/tool-handlers.d.ts +42 -0
- package/dist/tool-handlers.d.ts.map +1 -0
- package/dist/tool-handlers.js +425 -0
- package/dist/tool-handlers.js.map +1 -0
- package/dist/types.d.ts.map +1 -1
- package/dist/types.js +6 -4
- package/dist/types.js.map +1 -1
- package/dist/ui/app.js +94 -723
- package/dist/ui/index.html +29 -0
- package/dist/ui/render-knowledge.js +233 -0
- package/dist/ui/render-panel.js +350 -0
- package/dist/ui/render-search.js +109 -0
- package/dist/ui/render-sessions.js +234 -0
- package/dist/ui/styles.css +261 -0
- package/dist/ui/ui-utils.js +196 -0
- package/dist/vectorstore/store.d.ts +25 -44
- package/dist/vectorstore/store.d.ts.map +1 -1
- package/dist/vectorstore/store.js +167 -167
- package/dist/vectorstore/store.js.map +1 -1
- package/docs/ARCHITECTURE.md +94 -1
- package/docs/DASHBOARD.md +26 -13
- package/docs/SETUP.md +17 -3
- package/package.json +2 -2
|
@@ -0,0 +1,214 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* Knowledge Graph Layer — manages typed edges between knowledge entries.
|
|
3
|
+
*
|
|
4
|
+
* Stores edges in the same SQLite database as the vector store, with
|
|
5
|
+
* BFS traversal for multi-hop graph queries.
|
|
6
|
+
*/
|
|
7
|
+
import { join, dirname } from 'path';
|
|
8
|
+
import { mkdirSync } from 'fs';
|
|
9
|
+
import { createRequire } from 'module';
|
|
10
|
+
import { getConfig } from '../types.js';
|
|
11
|
+
const require = createRequire(import.meta.url);
|
|
12
|
+
export const RELATIONSHIP_TYPES = [
|
|
13
|
+
'related_to',
|
|
14
|
+
'supersedes',
|
|
15
|
+
'depends_on',
|
|
16
|
+
'contradicts',
|
|
17
|
+
'specializes',
|
|
18
|
+
'part_of',
|
|
19
|
+
'alternative_to',
|
|
20
|
+
'builds_on',
|
|
21
|
+
];
|
|
22
|
+
/**
|
|
23
|
+
* Knowledge graph backed by SQLite.
|
|
24
|
+
* Lazily initializes the database on first access.
|
|
25
|
+
*/
|
|
26
|
+
export class KnowledgeGraph {
|
|
27
|
+
db = null;
|
|
28
|
+
dbPath;
|
|
29
|
+
initialized = false;
|
|
30
|
+
constructor(dbPath) {
|
|
31
|
+
// Use a separate lightweight DB — NOT the 544MB vector store
|
|
32
|
+
this.dbPath = dbPath ?? join(getConfig().dataDir, 'knowledge-scores.db');
|
|
33
|
+
}
|
|
34
|
+
init() {
|
|
35
|
+
if (this.initialized)
|
|
36
|
+
return;
|
|
37
|
+
try {
|
|
38
|
+
if (!this.db) {
|
|
39
|
+
mkdirSync(dirname(this.dbPath), { recursive: true });
|
|
40
|
+
const BetterSqlite3 = require('better-sqlite3');
|
|
41
|
+
this.db = new BetterSqlite3(this.dbPath);
|
|
42
|
+
this.db.pragma('journal_mode = WAL');
|
|
43
|
+
this.db.pragma('foreign_keys = ON');
|
|
44
|
+
}
|
|
45
|
+
this.db.exec(`
|
|
46
|
+
CREATE TABLE IF NOT EXISTS edges (
|
|
47
|
+
source TEXT NOT NULL,
|
|
48
|
+
target TEXT NOT NULL,
|
|
49
|
+
rel_type TEXT NOT NULL,
|
|
50
|
+
strength REAL DEFAULT 0.5,
|
|
51
|
+
created_at TEXT DEFAULT CURRENT_TIMESTAMP,
|
|
52
|
+
PRIMARY KEY (source, target, rel_type)
|
|
53
|
+
);
|
|
54
|
+
CREATE INDEX IF NOT EXISTS idx_edges_source ON edges(source);
|
|
55
|
+
CREATE INDEX IF NOT EXISTS idx_edges_target ON edges(target);
|
|
56
|
+
`);
|
|
57
|
+
this.initialized = true;
|
|
58
|
+
}
|
|
59
|
+
catch (err) {
|
|
60
|
+
console.error(`[knowledge] Failed to initialize graph: ${err}`);
|
|
61
|
+
throw err;
|
|
62
|
+
}
|
|
63
|
+
}
|
|
64
|
+
/**
|
|
65
|
+
* Create or update an edge between two entries.
|
|
66
|
+
*/
|
|
67
|
+
link(source, target, relType, strength = 0.5) {
|
|
68
|
+
this.init();
|
|
69
|
+
if (!this.db)
|
|
70
|
+
throw new Error('Graph database not available');
|
|
71
|
+
if (!RELATIONSHIP_TYPES.includes(relType)) {
|
|
72
|
+
throw new Error(`Invalid relationship type: ${relType}. Must be one of: ${RELATIONSHIP_TYPES.join(', ')}`);
|
|
73
|
+
}
|
|
74
|
+
if (strength < 0 || strength > 1) {
|
|
75
|
+
throw new Error('Strength must be between 0 and 1');
|
|
76
|
+
}
|
|
77
|
+
if (source === target) {
|
|
78
|
+
throw new Error('Cannot create self-referencing edge');
|
|
79
|
+
}
|
|
80
|
+
this.db
|
|
81
|
+
.prepare(`INSERT INTO edges (source, target, rel_type, strength)
|
|
82
|
+
VALUES (?, ?, ?, ?)
|
|
83
|
+
ON CONFLICT(source, target, rel_type)
|
|
84
|
+
DO UPDATE SET strength = excluded.strength`)
|
|
85
|
+
.run(source, target, relType, strength);
|
|
86
|
+
const row = this.db
|
|
87
|
+
.prepare('SELECT * FROM edges WHERE source = ? AND target = ? AND rel_type = ?')
|
|
88
|
+
.get(source, target, relType);
|
|
89
|
+
return row;
|
|
90
|
+
}
|
|
91
|
+
/**
|
|
92
|
+
* Remove edge(s) between two entries.
|
|
93
|
+
* If relType is omitted, removes all edges between source and target.
|
|
94
|
+
*/
|
|
95
|
+
unlink(source, target, relType) {
|
|
96
|
+
this.init();
|
|
97
|
+
if (!this.db)
|
|
98
|
+
throw new Error('Graph database not available');
|
|
99
|
+
if (relType) {
|
|
100
|
+
const result = this.db
|
|
101
|
+
.prepare('DELETE FROM edges WHERE source = ? AND target = ? AND rel_type = ?')
|
|
102
|
+
.run(source, target, relType);
|
|
103
|
+
return result.changes;
|
|
104
|
+
}
|
|
105
|
+
const result = this.db
|
|
106
|
+
.prepare('DELETE FROM edges WHERE source = ? AND target = ?')
|
|
107
|
+
.run(source, target);
|
|
108
|
+
return result.changes;
|
|
109
|
+
}
|
|
110
|
+
/**
|
|
111
|
+
* List edges, optionally filtered by entry path and/or relationship type.
|
|
112
|
+
*/
|
|
113
|
+
links(entry, relType) {
|
|
114
|
+
this.init();
|
|
115
|
+
if (!this.db)
|
|
116
|
+
return [];
|
|
117
|
+
if (entry && relType) {
|
|
118
|
+
return this.db
|
|
119
|
+
.prepare(`SELECT * FROM edges
|
|
120
|
+
WHERE (source = ? OR target = ?) AND rel_type = ?
|
|
121
|
+
ORDER BY created_at DESC`)
|
|
122
|
+
.all(entry, entry, relType);
|
|
123
|
+
}
|
|
124
|
+
if (entry) {
|
|
125
|
+
return this.db
|
|
126
|
+
.prepare(`SELECT * FROM edges
|
|
127
|
+
WHERE source = ? OR target = ?
|
|
128
|
+
ORDER BY created_at DESC`)
|
|
129
|
+
.all(entry, entry);
|
|
130
|
+
}
|
|
131
|
+
if (relType) {
|
|
132
|
+
return this.db
|
|
133
|
+
.prepare('SELECT * FROM edges WHERE rel_type = ? ORDER BY created_at DESC')
|
|
134
|
+
.all(relType);
|
|
135
|
+
}
|
|
136
|
+
return this.db.prepare('SELECT * FROM edges ORDER BY created_at DESC').all();
|
|
137
|
+
}
|
|
138
|
+
/**
|
|
139
|
+
* BFS traversal from a starting entry, returning all nodes and edges
|
|
140
|
+
* within `depth` hops.
|
|
141
|
+
*/
|
|
142
|
+
graph(entry, depth = 2) {
|
|
143
|
+
this.init();
|
|
144
|
+
if (!this.db)
|
|
145
|
+
return { nodes: [], edges: [] };
|
|
146
|
+
const visited = new Map(); // path -> depth
|
|
147
|
+
const resultEdges = [];
|
|
148
|
+
const queue = [{ path: entry, currentDepth: 0 }];
|
|
149
|
+
visited.set(entry, 0);
|
|
150
|
+
while (queue.length > 0) {
|
|
151
|
+
const item = queue.shift();
|
|
152
|
+
if (item.currentDepth >= depth)
|
|
153
|
+
continue;
|
|
154
|
+
const edges = this.db
|
|
155
|
+
.prepare('SELECT * FROM edges WHERE source = ? OR target = ?')
|
|
156
|
+
.all(item.path, item.path);
|
|
157
|
+
for (const edge of edges) {
|
|
158
|
+
const isDuplicate = resultEdges.some((e) => e.source === edge.source && e.target === edge.target && e.rel_type === edge.rel_type);
|
|
159
|
+
if (!isDuplicate) {
|
|
160
|
+
resultEdges.push(edge);
|
|
161
|
+
}
|
|
162
|
+
const neighbor = edge.source === item.path ? edge.target : edge.source;
|
|
163
|
+
if (!visited.has(neighbor)) {
|
|
164
|
+
const neighborDepth = item.currentDepth + 1;
|
|
165
|
+
visited.set(neighbor, neighborDepth);
|
|
166
|
+
queue.push({ path: neighbor, currentDepth: neighborDepth });
|
|
167
|
+
}
|
|
168
|
+
}
|
|
169
|
+
}
|
|
170
|
+
const nodes = Array.from(visited.entries()).map(([p, d]) => ({
|
|
171
|
+
path: p,
|
|
172
|
+
depth: d,
|
|
173
|
+
}));
|
|
174
|
+
return { nodes, edges: resultEdges };
|
|
175
|
+
}
|
|
176
|
+
/**
|
|
177
|
+
* Get 1-hop connected entries for a given entry path.
|
|
178
|
+
*/
|
|
179
|
+
getRelated(entry) {
|
|
180
|
+
this.init();
|
|
181
|
+
if (!this.db)
|
|
182
|
+
return [];
|
|
183
|
+
const edges = this.db
|
|
184
|
+
.prepare('SELECT * FROM edges WHERE source = ? OR target = ?')
|
|
185
|
+
.all(entry, entry);
|
|
186
|
+
return edges.map((e) => ({
|
|
187
|
+
path: e.source === entry ? e.target : e.source,
|
|
188
|
+
rel_type: e.rel_type,
|
|
189
|
+
strength: e.strength,
|
|
190
|
+
}));
|
|
191
|
+
}
|
|
192
|
+
/** Close the database connection. */
|
|
193
|
+
close() {
|
|
194
|
+
try {
|
|
195
|
+
this.db?.close();
|
|
196
|
+
}
|
|
197
|
+
catch (err) {
|
|
198
|
+
console.error(`[knowledge] Failed to close graph DB: ${err}`);
|
|
199
|
+
}
|
|
200
|
+
finally {
|
|
201
|
+
this.db = null;
|
|
202
|
+
this.initialized = false;
|
|
203
|
+
}
|
|
204
|
+
}
|
|
205
|
+
}
|
|
206
|
+
// ── Singleton instance ───────────────────────────────────────────────────────
|
|
207
|
+
let _graphInstance = null;
|
|
208
|
+
export function getKnowledgeGraph(dbPath) {
|
|
209
|
+
if (!_graphInstance) {
|
|
210
|
+
_graphInstance = new KnowledgeGraph(dbPath);
|
|
211
|
+
}
|
|
212
|
+
return _graphInstance;
|
|
213
|
+
}
|
|
214
|
+
//# sourceMappingURL=graph.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"graph.js","sourceRoot":"","sources":["../../src/knowledge/graph.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,MAAM,CAAC;AACrC,OAAO,EAAE,SAAS,EAAE,MAAM,IAAI,CAAC;AAC/B,OAAO,EAAE,aAAa,EAAE,MAAM,QAAQ,CAAC;AACvC,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAIxC,MAAM,OAAO,GAAG,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAG/C,MAAM,CAAC,MAAM,kBAAkB,GAAG;IAChC,YAAY;IACZ,YAAY;IACZ,YAAY;IACZ,aAAa;IACb,aAAa;IACb,SAAS;IACT,gBAAgB;IAChB,WAAW;CACH,CAAC;AAsBX;;;GAGG;AACH,MAAM,OAAO,cAAc;IACjB,EAAE,GAAoB,IAAI,CAAC;IAC3B,MAAM,CAAS;IACf,WAAW,GAAG,KAAK,CAAC;IAE5B,YAAY,MAAe;QACzB,6DAA6D;QAC7D,IAAI,CAAC,MAAM,GAAG,MAAM,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC,OAAO,EAAE,qBAAqB,CAAC,CAAC;IAC3E,CAAC;IAEO,IAAI;QACV,IAAI,IAAI,CAAC,WAAW;YAAE,OAAO;QAE7B,IAAI,CAAC;YACH,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC;gBACb,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;gBACrD,MAAM,aAAa,GAAG,OAAO,CAAC,gBAAgB,CAA+B,CAAC;gBAC9E,IAAI,CAAC,EAAE,GAAG,IAAI,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACzC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,oBAAoB,CAAC,CAAC;gBACrC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,mBAAmB,CAAC,CAAC;YACtC,CAAC;YAED,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC;;;;;;;;;;;OAWZ,CAAC,CAAC;YAEH,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;QAC1B,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,OAAO,CAAC,KAAK,CAAC,2CAA2C,GAAG,EAAE,CAAC,CAAC;YAChE,MAAM,GAAG,CAAC;QACZ,CAAC;IACH,CAAC;IAED;;OAEG;IACH,IAAI,CAAC,MAAc,EAAE,MAAc,EAAE,OAAyB,EAAE,WAAmB,GAAG;QACpF,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,IAAI,CAAC,IAAI,CAAC,EAAE;YAAE,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,CAAC;QAE9D,IAAI,CAAC,kBAAkB,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;YAC1C,MAAM,IAAI,KAAK,CACb,8BAA8B,OAAO,qBAAqB,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAC1F,CAAC;QACJ,CAAC;QACD,IAAI,QAAQ,GAAG,CAAC,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;YACjC,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,CAAC;QACtD,CAAC;QACD,IAAI,MAAM,KAAK,MAAM,EAAE,CAAC;YACtB,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAC;QACzD,CAAC;QAED,IAAI,CAAC,EAAE;aACJ,OAAO,CACN;;;oDAG4C,CAC7C;aACA,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;QAE1C,MAAM,GAAG,GAAG,IAAI,CAAC,EAAE;aAChB,OAAO,CAAC,sEAAsE,CAAC;aAC/E,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAS,CAAC;QAExC,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,MAAc,EAAE,MAAc,EAAE,OAA0B;QAC/D,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,IAAI,CAAC,IAAI,CAAC,EAAE;YAAE,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,CAAC;QAE9D,IAAI,OAAO,EAAE,CAAC;YACZ,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE;iBACnB,OAAO,CAAC,oEAAoE,CAAC;iBAC7E,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;YAChC,OAAO,MAAM,CAAC,OAAO,CAAC;QACxB,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE;aACnB,OAAO,CAAC,mDAAmD,CAAC;aAC5D,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACvB,OAAO,MAAM,CAAC,OAAO,CAAC;IACxB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,KAAc,EAAE,OAA0B;QAC9C,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,IAAI,CAAC,IAAI,CAAC,EAAE;YAAE,OAAO,EAAE,CAAC;QAExB,IAAI,KAAK,IAAI,OAAO,EAAE,CAAC;YACrB,OAAO,IAAI,CAAC,EAAE;iBACX,OAAO,CACN;;oCAE0B,CAC3B;iBACA,GAAG,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,CAAW,CAAC;QAC1C,CAAC;QAED,IAAI,KAAK,EAAE,CAAC;YACV,OAAO,IAAI,CAAC,EAAE;iBACX,OAAO,CACN;;oCAE0B,CAC3B;iBACA,GAAG,CAAC,KAAK,EAAE,KAAK,CAAW,CAAC;QACjC,CAAC;QAED,IAAI,OAAO,EAAE,CAAC;YACZ,OAAO,IAAI,CAAC,EAAE;iBACX,OAAO,CAAC,iEAAiE,CAAC;iBAC1E,GAAG,CAAC,OAAO,CAAW,CAAC;QAC5B,CAAC;QAED,OAAO,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,8CAA8C,CAAC,CAAC,GAAG,EAAY,CAAC;IACzF,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,KAAa,EAAE,QAAgB,CAAC;QACpC,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,IAAI,CAAC,IAAI,CAAC,EAAE;YAAE,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;QAE9C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC,CAAC,gBAAgB;QAC3D,MAAM,WAAW,GAAW,EAAE,CAAC;QAC/B,MAAM,KAAK,GAAkD,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC,CAAC;QAEhG,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAEtB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAC5B,IAAI,IAAI,CAAC,YAAY,IAAI,KAAK;gBAAE,SAAS;YAEzC,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE;iBAClB,OAAO,CAAC,oDAAoD,CAAC;iBAC7D,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAW,CAAC;YAEvC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,MAAM,WAAW,GAAG,WAAW,CAAC,IAAI,CAClC,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,QAAQ,KAAK,IAAI,CAAC,QAAQ,CACvF,CAAC;gBACF,IAAI,CAAC,WAAW,EAAE,CAAC;oBACjB,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACzB,CAAC;gBAED,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;gBACvE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAC3B,MAAM,aAAa,GAAG,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC;oBAC5C,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,aAAa,CAAC,CAAC;oBACrC,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,YAAY,EAAE,aAAa,EAAE,CAAC,CAAC;gBAC9D,CAAC;YACH,CAAC;QACH,CAAC;QAED,MAAM,KAAK,GAAgB,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACxE,IAAI,EAAE,CAAC;YACP,KAAK,EAAE,CAAC;SACT,CAAC,CAAC,CAAC;QAEJ,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,WAAW,EAAE,CAAC;IACvC,CAAC;IAED;;OAEG;IACH,UAAU,CAAC,KAAa;QACtB,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,IAAI,CAAC,IAAI,CAAC,EAAE;YAAE,OAAO,EAAE,CAAC;QAExB,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE;aAClB,OAAO,CAAC,oDAAoD,CAAC;aAC7D,GAAG,CAAC,KAAK,EAAE,KAAK,CAAW,CAAC;QAE/B,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACvB,IAAI,EAAE,CAAC,CAAC,MAAM,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM;YAC9C,QAAQ,EAAE,CAAC,CAAC,QAAQ;YACpB,QAAQ,EAAE,CAAC,CAAC,QAAQ;SACrB,CAAC,CAAC,CAAC;IACN,CAAC;IAED,qCAAqC;IACrC,KAAK;QACH,IAAI,CAAC;YACH,IAAI,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC;QACnB,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,OAAO,CAAC,KAAK,CAAC,yCAAyC,GAAG,EAAE,CAAC,CAAC;QAChE,CAAC;gBAAS,CAAC;YACT,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC;YACf,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC;QAC3B,CAAC;IACH,CAAC;CACF;AAED,gFAAgF;AAEhF,IAAI,cAAc,GAA0B,IAAI,CAAC;AAEjD,MAAM,UAAU,iBAAiB,CAAC,MAAe;IAC/C,IAAI,CAAC,cAAc,EAAE,CAAC;QACpB,cAAc,GAAG,IAAI,cAAc,CAAC,MAAM,CAAC,CAAC;IAC9C,CAAC;IACD,OAAO,cAAc,CAAC;AACxB,CAAC"}
|
|
@@ -0,0 +1,33 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* Reflection Cycle — surfaces unconnected knowledge entries and prepares
|
|
3
|
+
* a structured prompt for the calling agent's LLM to identify relationships.
|
|
4
|
+
*
|
|
5
|
+
* Does NOT call an LLM itself. Returns entries, summaries, and a prompt
|
|
6
|
+
* that the agent can process to discover new connections.
|
|
7
|
+
*/
|
|
8
|
+
export interface UnconnectedEntry {
|
|
9
|
+
path: string;
|
|
10
|
+
title: string;
|
|
11
|
+
category: string;
|
|
12
|
+
tags: string[];
|
|
13
|
+
/** First 300 chars of body content (frontmatter stripped) */
|
|
14
|
+
summary: string;
|
|
15
|
+
}
|
|
16
|
+
export interface ReflectionResult {
|
|
17
|
+
/** Total entries scanned */
|
|
18
|
+
totalEntries: number;
|
|
19
|
+
/** Entries that have zero graph edges */
|
|
20
|
+
unconnectedEntries: UnconnectedEntry[];
|
|
21
|
+
/** Entries that have edges (for context) */
|
|
22
|
+
connectedCount: number;
|
|
23
|
+
/** Structured prompt for the agent's LLM */
|
|
24
|
+
prompt: string;
|
|
25
|
+
/** Suggested actions after reflection */
|
|
26
|
+
instructions: string;
|
|
27
|
+
}
|
|
28
|
+
/**
|
|
29
|
+
* Scan knowledge entries and find those without any graph edges.
|
|
30
|
+
* Returns a structured prompt the agent can feed to its LLM.
|
|
31
|
+
*/
|
|
32
|
+
export declare function reflect(dir: string, category?: string, maxEntries?: number): ReflectionResult;
|
|
33
|
+
//# sourceMappingURL=reflect.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"reflect.d.ts","sourceRoot":"","sources":["../../src/knowledge/reflect.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAMH,MAAM,WAAW,gBAAgB;IAC/B,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,MAAM,CAAC;IACjB,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,6DAA6D;IAC7D,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,WAAW,gBAAgB;IAC/B,4BAA4B;IAC5B,YAAY,EAAE,MAAM,CAAC;IACrB,yCAAyC;IACzC,kBAAkB,EAAE,gBAAgB,EAAE,CAAC;IACvC,4CAA4C;IAC5C,cAAc,EAAE,MAAM,CAAC;IACvB,4CAA4C;IAC5C,MAAM,EAAE,MAAM,CAAC;IACf,yCAAyC;IACzC,YAAY,EAAE,MAAM,CAAC;CACtB;AAaD;;;GAGG;AACH,wBAAgB,OAAO,CAAC,GAAG,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,MAAM,EAAE,UAAU,GAAE,MAAW,GAAG,gBAAgB,CAiDjG"}
|
|
@@ -0,0 +1,115 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* Reflection Cycle — surfaces unconnected knowledge entries and prepares
|
|
3
|
+
* a structured prompt for the calling agent's LLM to identify relationships.
|
|
4
|
+
*
|
|
5
|
+
* Does NOT call an LLM itself. Returns entries, summaries, and a prompt
|
|
6
|
+
* that the agent can process to discover new connections.
|
|
7
|
+
*/
|
|
8
|
+
import { listEntries, readEntry } from './store.js';
|
|
9
|
+
import { getKnowledgeGraph } from './graph.js';
|
|
10
|
+
import { parseFrontmatter } from './store.js';
|
|
11
|
+
function readEntrySummary(dir, entryPath) {
|
|
12
|
+
try {
|
|
13
|
+
const { content } = readEntry(dir, entryPath);
|
|
14
|
+
const { body } = parseFrontmatter(content);
|
|
15
|
+
const trimmed = body.slice(0, 300).replace(/\n/g, ' ').trim();
|
|
16
|
+
return body.length > 300 ? trimmed + '...' : trimmed;
|
|
17
|
+
}
|
|
18
|
+
catch {
|
|
19
|
+
return '(could not read content)';
|
|
20
|
+
}
|
|
21
|
+
}
|
|
22
|
+
/**
|
|
23
|
+
* Scan knowledge entries and find those without any graph edges.
|
|
24
|
+
* Returns a structured prompt the agent can feed to its LLM.
|
|
25
|
+
*/
|
|
26
|
+
export function reflect(dir, category, maxEntries = 20) {
|
|
27
|
+
const entries = listEntries(dir, category);
|
|
28
|
+
const graph = getKnowledgeGraph();
|
|
29
|
+
const allEdges = graph.links();
|
|
30
|
+
// Build set of paths that appear in any edge
|
|
31
|
+
const connectedPaths = new Set();
|
|
32
|
+
for (const edge of allEdges) {
|
|
33
|
+
connectedPaths.add(edge.source);
|
|
34
|
+
connectedPaths.add(edge.target);
|
|
35
|
+
}
|
|
36
|
+
const unconnected = [];
|
|
37
|
+
const connected = [];
|
|
38
|
+
for (const entry of entries) {
|
|
39
|
+
if (connectedPaths.has(entry.path)) {
|
|
40
|
+
connected.push(entry);
|
|
41
|
+
}
|
|
42
|
+
else {
|
|
43
|
+
if (unconnected.length >= maxEntries)
|
|
44
|
+
continue;
|
|
45
|
+
const summary = readEntrySummary(dir, entry.path);
|
|
46
|
+
unconnected.push({
|
|
47
|
+
path: entry.path,
|
|
48
|
+
title: entry.title,
|
|
49
|
+
category: entry.category,
|
|
50
|
+
tags: entry.tags,
|
|
51
|
+
summary,
|
|
52
|
+
});
|
|
53
|
+
}
|
|
54
|
+
}
|
|
55
|
+
// Build the prompt
|
|
56
|
+
const prompt = buildReflectionPrompt(unconnected, connected, allEdges.length);
|
|
57
|
+
const instructions = 'After analyzing the prompt above, call `knowledge_link` for each relationship ' +
|
|
58
|
+
'you identify. Use relationship types: related_to, supersedes, depends_on, ' +
|
|
59
|
+
'contradicts, specializes, part_of, alternative_to, builds_on. ' +
|
|
60
|
+
'Set strength between 0.3 (weak) and 0.9 (strong).';
|
|
61
|
+
return {
|
|
62
|
+
totalEntries: entries.length,
|
|
63
|
+
unconnectedEntries: unconnected,
|
|
64
|
+
connectedCount: connected.length,
|
|
65
|
+
prompt,
|
|
66
|
+
instructions,
|
|
67
|
+
};
|
|
68
|
+
}
|
|
69
|
+
function buildReflectionPrompt(unconnected, connected, edgeCount) {
|
|
70
|
+
if (unconnected.length === 0) {
|
|
71
|
+
return 'All knowledge entries are connected in the graph. No reflection needed.';
|
|
72
|
+
}
|
|
73
|
+
const lines = [];
|
|
74
|
+
lines.push('# Knowledge Graph Reflection');
|
|
75
|
+
lines.push('');
|
|
76
|
+
lines.push(`The knowledge base has ${unconnected.length + connected.length} entries ` +
|
|
77
|
+
`and ${edgeCount} edges. ${unconnected.length} entries have NO connections.`);
|
|
78
|
+
lines.push('');
|
|
79
|
+
lines.push('## Unconnected Entries');
|
|
80
|
+
lines.push('');
|
|
81
|
+
lines.push('These entries exist in isolation. Analyze each and suggest connections:');
|
|
82
|
+
lines.push('');
|
|
83
|
+
for (const entry of unconnected) {
|
|
84
|
+
lines.push(`### ${entry.path}`);
|
|
85
|
+
lines.push(`- **Title**: ${entry.title}`);
|
|
86
|
+
lines.push(`- **Category**: ${entry.category}`);
|
|
87
|
+
if (entry.tags.length > 0) {
|
|
88
|
+
lines.push(`- **Tags**: ${entry.tags.join(', ')}`);
|
|
89
|
+
}
|
|
90
|
+
lines.push(`- **Summary**: ${entry.summary}`);
|
|
91
|
+
lines.push('');
|
|
92
|
+
}
|
|
93
|
+
if (connected.length > 0) {
|
|
94
|
+
lines.push('## Connected Entries (potential link targets)');
|
|
95
|
+
lines.push('');
|
|
96
|
+
for (const entry of connected) {
|
|
97
|
+
lines.push(`- **${entry.path}** — ${entry.title} [${entry.category}]`);
|
|
98
|
+
}
|
|
99
|
+
lines.push('');
|
|
100
|
+
}
|
|
101
|
+
lines.push('## Task');
|
|
102
|
+
lines.push('');
|
|
103
|
+
lines.push('For each unconnected entry, identify which connected entries (or other ');
|
|
104
|
+
lines.push('unconnected entries) it should be linked to. For each suggested link, specify:');
|
|
105
|
+
lines.push('');
|
|
106
|
+
lines.push('1. `source` — the unconnected entry path');
|
|
107
|
+
lines.push('2. `target` — the entry to link to');
|
|
108
|
+
lines.push('3. `rel_type` — one of: related_to, supersedes, depends_on, contradicts, ');
|
|
109
|
+
lines.push(' specializes, part_of, alternative_to, builds_on');
|
|
110
|
+
lines.push('4. `strength` — a number between 0.3 and 0.9');
|
|
111
|
+
lines.push('');
|
|
112
|
+
lines.push('Return your suggestions as a list of `knowledge_link` calls.');
|
|
113
|
+
return lines.join('\n');
|
|
114
|
+
}
|
|
115
|
+
//# sourceMappingURL=reflect.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"reflect.js","sourceRoot":"","sources":["../../src/knowledge/reflect.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,WAAW,EAAE,SAAS,EAAuB,MAAM,YAAY,CAAC;AACzE,OAAO,EAAE,iBAAiB,EAAE,MAAM,YAAY,CAAC;AAC/C,OAAO,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAC;AAwB9C,SAAS,gBAAgB,CAAC,GAAW,EAAE,SAAiB;IACtD,IAAI,CAAC;QACH,MAAM,EAAE,OAAO,EAAE,GAAG,SAAS,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;QAC9C,MAAM,EAAE,IAAI,EAAE,GAAG,gBAAgB,CAAC,OAAO,CAAC,CAAC;QAC3C,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;QAC9D,OAAO,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC;IACvD,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,0BAA0B,CAAC;IACpC,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,OAAO,CAAC,GAAW,EAAE,QAAiB,EAAE,aAAqB,EAAE;IAC7E,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;IAC3C,MAAM,KAAK,GAAG,iBAAiB,EAAE,CAAC;IAClC,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;IAE/B,6CAA6C;IAC7C,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;IACzC,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAChC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAClC,CAAC;IAED,MAAM,WAAW,GAAuB,EAAE,CAAC;IAC3C,MAAM,SAAS,GAAqB,EAAE,CAAC;IAEvC,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,IAAI,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;YACnC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACxB,CAAC;aAAM,CAAC;YACN,IAAI,WAAW,CAAC,MAAM,IAAI,UAAU;gBAAE,SAAS;YAE/C,MAAM,OAAO,GAAG,gBAAgB,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;YAElD,WAAW,CAAC,IAAI,CAAC;gBACf,IAAI,EAAE,KAAK,CAAC,IAAI;gBAChB,KAAK,EAAE,KAAK,CAAC,KAAK;gBAClB,QAAQ,EAAE,KAAK,CAAC,QAAQ;gBACxB,IAAI,EAAE,KAAK,CAAC,IAAI;gBAChB,OAAO;aACR,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,mBAAmB;IACnB,MAAM,MAAM,GAAG,qBAAqB,CAAC,WAAW,EAAE,SAAS,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC;IAE9E,MAAM,YAAY,GAChB,gFAAgF;QAChF,4EAA4E;QAC5E,gEAAgE;QAChE,mDAAmD,CAAC;IAEtD,OAAO;QACL,YAAY,EAAE,OAAO,CAAC,MAAM;QAC5B,kBAAkB,EAAE,WAAW;QAC/B,cAAc,EAAE,SAAS,CAAC,MAAM;QAChC,MAAM;QACN,YAAY;KACb,CAAC;AACJ,CAAC;AAED,SAAS,qBAAqB,CAC5B,WAA+B,EAC/B,SAA2B,EAC3B,SAAiB;IAEjB,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC7B,OAAO,yEAAyE,CAAC;IACnF,CAAC;IAED,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,KAAK,CAAC,IAAI,CAAC,8BAA8B,CAAC,CAAC;IAC3C,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACf,KAAK,CAAC,IAAI,CACR,0BAA0B,WAAW,CAAC,MAAM,GAAG,SAAS,CAAC,MAAM,WAAW;QACxE,OAAO,SAAS,WAAW,WAAW,CAAC,MAAM,+BAA+B,CAC/E,CAAC;IACF,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACf,KAAK,CAAC,IAAI,CAAC,wBAAwB,CAAC,CAAC;IACrC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACf,KAAK,CAAC,IAAI,CAAC,yEAAyE,CAAC,CAAC;IACtF,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAEf,KAAK,MAAM,KAAK,IAAI,WAAW,EAAE,CAAC;QAChC,KAAK,CAAC,IAAI,CAAC,OAAO,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;QAChC,KAAK,CAAC,IAAI,CAAC,gBAAgB,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;QAC1C,KAAK,CAAC,IAAI,CAAC,mBAAmB,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC;QAChD,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1B,KAAK,CAAC,IAAI,CAAC,eAAe,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACrD,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,kBAAkB,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;QAC9C,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACjB,CAAC;IAED,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzB,KAAK,CAAC,IAAI,CAAC,+CAA+C,CAAC,CAAC;QAC5D,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACf,KAAK,MAAM,KAAK,IAAI,SAAS,EAAE,CAAC;YAC9B,KAAK,CAAC,IAAI,CAAC,OAAO,KAAK,CAAC,IAAI,QAAQ,KAAK,CAAC,KAAK,KAAK,KAAK,CAAC,QAAQ,GAAG,CAAC,CAAC;QACzE,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACjB,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACtB,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACf,KAAK,CAAC,IAAI,CAAC,yEAAyE,CAAC,CAAC;IACtF,KAAK,CAAC,IAAI,CAAC,gFAAgF,CAAC,CAAC;IAC7F,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACf,KAAK,CAAC,IAAI,CAAC,0CAA0C,CAAC,CAAC;IACvD,KAAK,CAAC,IAAI,CAAC,oCAAoC,CAAC,CAAC;IACjD,KAAK,CAAC,IAAI,CAAC,2EAA2E,CAAC,CAAC;IACxF,KAAK,CAAC,IAAI,CAAC,oDAAoD,CAAC,CAAC;IACjE,KAAK,CAAC,IAAI,CAAC,8CAA8C,CAAC,CAAC;IAC3D,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACf,KAAK,CAAC,IAAI,CAAC,8DAA8D,CAAC,CAAC;IAE3E,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC"}
|
|
@@ -0,0 +1,57 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* Confidence/Decay Scoring — tracks access patterns for knowledge entries
|
|
3
|
+
* and provides maturity-based scoring for search result ranking.
|
|
4
|
+
*/
|
|
5
|
+
export type Maturity = 'candidate' | 'established' | 'proven';
|
|
6
|
+
export interface EntryScore {
|
|
7
|
+
entry_path: string;
|
|
8
|
+
access_count: number;
|
|
9
|
+
last_accessed: string;
|
|
10
|
+
maturity: Maturity;
|
|
11
|
+
created_at: string;
|
|
12
|
+
}
|
|
13
|
+
/**
|
|
14
|
+
* Compute decay factor based on days since last access.
|
|
15
|
+
* Half-life of 90 days.
|
|
16
|
+
*/
|
|
17
|
+
export declare function decayFactor(lastAccessed: string): number;
|
|
18
|
+
/**
|
|
19
|
+
* Get maturity multiplier for scoring.
|
|
20
|
+
*/
|
|
21
|
+
export declare function maturityMultiplier(maturity: Maturity): number;
|
|
22
|
+
/**
|
|
23
|
+
* Compute final score: baseRelevance * decayFactor * maturityMultiplier
|
|
24
|
+
*/
|
|
25
|
+
export declare function computeFinalScore(baseRelevance: number, lastAccessed: string | null, maturity: Maturity): number;
|
|
26
|
+
/**
|
|
27
|
+
* Entry scoring backed by SQLite.
|
|
28
|
+
* Tracks access counts, last-accessed timestamps, and maturity levels.
|
|
29
|
+
*/
|
|
30
|
+
export declare class EntryScoring {
|
|
31
|
+
private db;
|
|
32
|
+
private dbPath;
|
|
33
|
+
private initialized;
|
|
34
|
+
constructor(dbPath?: string);
|
|
35
|
+
private init;
|
|
36
|
+
/**
|
|
37
|
+
* Record an access to an entry. Increments access_count, updates
|
|
38
|
+
* last_accessed, and checks for auto-promotion.
|
|
39
|
+
*/
|
|
40
|
+
recordAccess(entryPath: string): EntryScore;
|
|
41
|
+
/**
|
|
42
|
+
* Record access for multiple entry paths (e.g., from search results).
|
|
43
|
+
*/
|
|
44
|
+
recordBulkAccess(entryPaths: string[]): void;
|
|
45
|
+
/**
|
|
46
|
+
* Get the score record for an entry. Returns null if no record exists.
|
|
47
|
+
*/
|
|
48
|
+
getScore(entryPath: string): EntryScore | null;
|
|
49
|
+
/**
|
|
50
|
+
* Get scores for multiple entries at once.
|
|
51
|
+
*/
|
|
52
|
+
getScores(entryPaths: string[]): Map<string, EntryScore>;
|
|
53
|
+
/** Close the database connection. */
|
|
54
|
+
close(): void;
|
|
55
|
+
}
|
|
56
|
+
export declare function getEntryScoring(dbPath?: string): EntryScoring;
|
|
57
|
+
//# sourceMappingURL=scoring.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"scoring.d.ts","sourceRoot":"","sources":["../../src/knowledge/scoring.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAYH,MAAM,MAAM,QAAQ,GAAG,WAAW,GAAG,aAAa,GAAG,QAAQ,CAAC;AAE9D,MAAM,WAAW,UAAU;IACzB,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,EAAE,MAAM,CAAC;IACrB,aAAa,EAAE,MAAM,CAAC;IACtB,QAAQ,EAAE,QAAQ,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;CACpB;AAaD;;;GAGG;AACH,wBAAgB,WAAW,CAAC,YAAY,EAAE,MAAM,GAAG,MAAM,CAMxD;AAED;;GAEG;AACH,wBAAgB,kBAAkB,CAAC,QAAQ,EAAE,QAAQ,GAAG,MAAM,CAE7D;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAC/B,aAAa,EAAE,MAAM,EACrB,YAAY,EAAE,MAAM,GAAG,IAAI,EAC3B,QAAQ,EAAE,QAAQ,GACjB,MAAM,CAIR;AAED;;;GAGG;AACH,qBAAa,YAAY;IACvB,OAAO,CAAC,EAAE,CAAyB;IACnC,OAAO,CAAC,MAAM,CAAS;IACvB,OAAO,CAAC,WAAW,CAAS;gBAEhB,MAAM,CAAC,EAAE,MAAM;IAK3B,OAAO,CAAC,IAAI;IA6BZ;;;OAGG;IACH,YAAY,CAAC,SAAS,EAAE,MAAM,GAAG,UAAU;IAiC3C;;OAEG;IACH,gBAAgB,CAAC,UAAU,EAAE,MAAM,EAAE,GAAG,IAAI;IAsC5C;;OAEG;IACH,QAAQ,CAAC,SAAS,EAAE,MAAM,GAAG,UAAU,GAAG,IAAI;IAW9C;;OAEG;IACH,SAAS,CAAC,UAAU,EAAE,MAAM,EAAE,GAAG,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC;IAiBxD,qCAAqC;IACrC,KAAK,IAAI,IAAI;CAUd;AAMD,wBAAgB,eAAe,CAAC,MAAM,CAAC,EAAE,MAAM,GAAG,YAAY,CAK7D"}
|
|
@@ -0,0 +1,194 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* Confidence/Decay Scoring — tracks access patterns for knowledge entries
|
|
3
|
+
* and provides maturity-based scoring for search result ranking.
|
|
4
|
+
*/
|
|
5
|
+
import { join, dirname } from 'path';
|
|
6
|
+
import { mkdirSync } from 'fs';
|
|
7
|
+
import { createRequire } from 'module';
|
|
8
|
+
import { getConfig } from '../types.js';
|
|
9
|
+
const require = createRequire(import.meta.url);
|
|
10
|
+
const MATURITY_MULTIPLIERS = {
|
|
11
|
+
candidate: 0.5,
|
|
12
|
+
established: 1.0,
|
|
13
|
+
proven: 1.5,
|
|
14
|
+
};
|
|
15
|
+
const PROMOTION_THRESHOLDS = [
|
|
16
|
+
{ from: 'candidate', to: 'established', minAccess: 5 },
|
|
17
|
+
{ from: 'established', to: 'proven', minAccess: 20 },
|
|
18
|
+
];
|
|
19
|
+
/**
|
|
20
|
+
* Compute decay factor based on days since last access.
|
|
21
|
+
* Half-life of 90 days.
|
|
22
|
+
*/
|
|
23
|
+
export function decayFactor(lastAccessed) {
|
|
24
|
+
const now = Date.now();
|
|
25
|
+
const lastDate = new Date(lastAccessed).getTime();
|
|
26
|
+
if (isNaN(lastDate))
|
|
27
|
+
return 1;
|
|
28
|
+
const daysSince = Math.max(0, (now - lastDate) / (1000 * 60 * 60 * 24));
|
|
29
|
+
return Math.pow(0.5, daysSince / 90);
|
|
30
|
+
}
|
|
31
|
+
/**
|
|
32
|
+
* Get maturity multiplier for scoring.
|
|
33
|
+
*/
|
|
34
|
+
export function maturityMultiplier(maturity) {
|
|
35
|
+
return MATURITY_MULTIPLIERS[maturity] ?? 0.5;
|
|
36
|
+
}
|
|
37
|
+
/**
|
|
38
|
+
* Compute final score: baseRelevance * decayFactor * maturityMultiplier
|
|
39
|
+
*/
|
|
40
|
+
export function computeFinalScore(baseRelevance, lastAccessed, maturity) {
|
|
41
|
+
const decay = lastAccessed ? decayFactor(lastAccessed) : 1;
|
|
42
|
+
const multiplier = maturityMultiplier(maturity);
|
|
43
|
+
return baseRelevance * decay * multiplier;
|
|
44
|
+
}
|
|
45
|
+
/**
|
|
46
|
+
* Entry scoring backed by SQLite.
|
|
47
|
+
* Tracks access counts, last-accessed timestamps, and maturity levels.
|
|
48
|
+
*/
|
|
49
|
+
export class EntryScoring {
|
|
50
|
+
db = null;
|
|
51
|
+
dbPath;
|
|
52
|
+
initialized = false;
|
|
53
|
+
constructor(dbPath) {
|
|
54
|
+
// Use a separate lightweight DB for scoring — NOT the 544MB vector store
|
|
55
|
+
this.dbPath = dbPath ?? join(getConfig().dataDir, 'knowledge-scores.db');
|
|
56
|
+
}
|
|
57
|
+
init() {
|
|
58
|
+
if (this.initialized)
|
|
59
|
+
return;
|
|
60
|
+
try {
|
|
61
|
+
if (!this.db) {
|
|
62
|
+
mkdirSync(dirname(this.dbPath), { recursive: true });
|
|
63
|
+
const BetterSqlite3 = require('better-sqlite3');
|
|
64
|
+
this.db = new BetterSqlite3(this.dbPath);
|
|
65
|
+
this.db.pragma('journal_mode = WAL');
|
|
66
|
+
this.db.pragma('foreign_keys = ON');
|
|
67
|
+
}
|
|
68
|
+
this.db.exec(`
|
|
69
|
+
CREATE TABLE IF NOT EXISTS entry_scores (
|
|
70
|
+
entry_path TEXT PRIMARY KEY,
|
|
71
|
+
access_count INTEGER DEFAULT 0,
|
|
72
|
+
last_accessed TEXT,
|
|
73
|
+
maturity TEXT DEFAULT 'candidate',
|
|
74
|
+
created_at TEXT DEFAULT CURRENT_TIMESTAMP
|
|
75
|
+
);
|
|
76
|
+
`);
|
|
77
|
+
this.initialized = true;
|
|
78
|
+
}
|
|
79
|
+
catch (err) {
|
|
80
|
+
console.error(`[knowledge] Failed to initialize scoring: ${err}`);
|
|
81
|
+
throw err;
|
|
82
|
+
}
|
|
83
|
+
}
|
|
84
|
+
/**
|
|
85
|
+
* Record an access to an entry. Increments access_count, updates
|
|
86
|
+
* last_accessed, and checks for auto-promotion.
|
|
87
|
+
*/
|
|
88
|
+
recordAccess(entryPath) {
|
|
89
|
+
this.init();
|
|
90
|
+
if (!this.db)
|
|
91
|
+
throw new Error('Scoring database not available');
|
|
92
|
+
const now = new Date().toISOString();
|
|
93
|
+
// Upsert: create if not exists, increment access_count
|
|
94
|
+
this.db
|
|
95
|
+
.prepare(`INSERT INTO entry_scores (entry_path, access_count, last_accessed, maturity)
|
|
96
|
+
VALUES (?, 1, ?, 'candidate')
|
|
97
|
+
ON CONFLICT(entry_path)
|
|
98
|
+
DO UPDATE SET access_count = access_count + 1, last_accessed = excluded.last_accessed`)
|
|
99
|
+
.run(entryPath, now);
|
|
100
|
+
// Check auto-promotion
|
|
101
|
+
const score = this.db
|
|
102
|
+
.prepare('SELECT * FROM entry_scores WHERE entry_path = ?')
|
|
103
|
+
.get(entryPath);
|
|
104
|
+
for (const threshold of PROMOTION_THRESHOLDS) {
|
|
105
|
+
if (score.maturity === threshold.from && score.access_count >= threshold.minAccess) {
|
|
106
|
+
this.db
|
|
107
|
+
.prepare('UPDATE entry_scores SET maturity = ? WHERE entry_path = ?')
|
|
108
|
+
.run(threshold.to, entryPath);
|
|
109
|
+
score.maturity = threshold.to;
|
|
110
|
+
}
|
|
111
|
+
}
|
|
112
|
+
return score;
|
|
113
|
+
}
|
|
114
|
+
/**
|
|
115
|
+
* Record access for multiple entry paths (e.g., from search results).
|
|
116
|
+
*/
|
|
117
|
+
recordBulkAccess(entryPaths) {
|
|
118
|
+
this.init();
|
|
119
|
+
if (!this.db || entryPaths.length === 0)
|
|
120
|
+
return;
|
|
121
|
+
const now = new Date().toISOString();
|
|
122
|
+
const upsert = this.db.prepare(`INSERT INTO entry_scores (entry_path, access_count, last_accessed, maturity)
|
|
123
|
+
VALUES (?, 1, ?, 'candidate')
|
|
124
|
+
ON CONFLICT(entry_path)
|
|
125
|
+
DO UPDATE SET access_count = access_count + 1, last_accessed = excluded.last_accessed`);
|
|
126
|
+
const checkPromotion = this.db.prepare('SELECT entry_path, access_count, maturity FROM entry_scores WHERE entry_path = ?');
|
|
127
|
+
const promote = this.db.prepare('UPDATE entry_scores SET maturity = ? WHERE entry_path = ?');
|
|
128
|
+
const transaction = this.db.transaction((paths) => {
|
|
129
|
+
for (const p of paths) {
|
|
130
|
+
upsert.run(p, now);
|
|
131
|
+
const row = checkPromotion.get(p);
|
|
132
|
+
if (row) {
|
|
133
|
+
for (const threshold of PROMOTION_THRESHOLDS) {
|
|
134
|
+
if (row.maturity === threshold.from && row.access_count >= threshold.minAccess) {
|
|
135
|
+
promote.run(threshold.to, p);
|
|
136
|
+
}
|
|
137
|
+
}
|
|
138
|
+
}
|
|
139
|
+
}
|
|
140
|
+
});
|
|
141
|
+
transaction(entryPaths);
|
|
142
|
+
}
|
|
143
|
+
/**
|
|
144
|
+
* Get the score record for an entry. Returns null if no record exists.
|
|
145
|
+
*/
|
|
146
|
+
getScore(entryPath) {
|
|
147
|
+
this.init();
|
|
148
|
+
if (!this.db)
|
|
149
|
+
return null;
|
|
150
|
+
const row = this.db
|
|
151
|
+
.prepare('SELECT * FROM entry_scores WHERE entry_path = ?')
|
|
152
|
+
.get(entryPath);
|
|
153
|
+
return row ?? null;
|
|
154
|
+
}
|
|
155
|
+
/**
|
|
156
|
+
* Get scores for multiple entries at once.
|
|
157
|
+
*/
|
|
158
|
+
getScores(entryPaths) {
|
|
159
|
+
this.init();
|
|
160
|
+
if (!this.db || entryPaths.length === 0)
|
|
161
|
+
return new Map();
|
|
162
|
+
const result = new Map();
|
|
163
|
+
const stmt = this.db.prepare('SELECT * FROM entry_scores WHERE entry_path = ?');
|
|
164
|
+
for (const p of entryPaths) {
|
|
165
|
+
const row = stmt.get(p);
|
|
166
|
+
if (row) {
|
|
167
|
+
result.set(p, row);
|
|
168
|
+
}
|
|
169
|
+
}
|
|
170
|
+
return result;
|
|
171
|
+
}
|
|
172
|
+
/** Close the database connection. */
|
|
173
|
+
close() {
|
|
174
|
+
try {
|
|
175
|
+
this.db?.close();
|
|
176
|
+
}
|
|
177
|
+
catch (err) {
|
|
178
|
+
console.error(`[knowledge] Failed to close scoring DB: ${err}`);
|
|
179
|
+
}
|
|
180
|
+
finally {
|
|
181
|
+
this.db = null;
|
|
182
|
+
this.initialized = false;
|
|
183
|
+
}
|
|
184
|
+
}
|
|
185
|
+
}
|
|
186
|
+
// ── Singleton instance ───────────────────────────────────────────────────────
|
|
187
|
+
let _scoringInstance = null;
|
|
188
|
+
export function getEntryScoring(dbPath) {
|
|
189
|
+
if (!_scoringInstance) {
|
|
190
|
+
_scoringInstance = new EntryScoring(dbPath);
|
|
191
|
+
}
|
|
192
|
+
return _scoringInstance;
|
|
193
|
+
}
|
|
194
|
+
//# sourceMappingURL=scoring.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"scoring.js","sourceRoot":"","sources":["../../src/knowledge/scoring.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,MAAM,CAAC;AACrC,OAAO,EAAE,SAAS,EAAE,MAAM,IAAI,CAAC;AAC/B,OAAO,EAAE,aAAa,EAAE,MAAM,QAAQ,CAAC;AACvC,OAAO,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAIxC,MAAM,OAAO,GAAG,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAa/C,MAAM,oBAAoB,GAA6B;IACrD,SAAS,EAAE,GAAG;IACd,WAAW,EAAE,GAAG;IAChB,MAAM,EAAE,GAAG;CACZ,CAAC;AAEF,MAAM,oBAAoB,GAA+D;IACvF,EAAE,IAAI,EAAE,WAAW,EAAE,EAAE,EAAE,aAAa,EAAE,SAAS,EAAE,CAAC,EAAE;IACtD,EAAE,IAAI,EAAE,aAAa,EAAE,EAAE,EAAE,QAAQ,EAAE,SAAS,EAAE,EAAE,EAAE;CACrD,CAAC;AAEF;;;GAGG;AACH,MAAM,UAAU,WAAW,CAAC,YAAoB;IAC9C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IACvB,MAAM,QAAQ,GAAG,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,OAAO,EAAE,CAAC;IAClD,IAAI,KAAK,CAAC,QAAQ,CAAC;QAAE,OAAO,CAAC,CAAC;IAC9B,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;IACxE,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,SAAS,GAAG,EAAE,CAAC,CAAC;AACvC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,kBAAkB,CAAC,QAAkB;IACnD,OAAO,oBAAoB,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC;AAC/C,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAC/B,aAAqB,EACrB,YAA2B,EAC3B,QAAkB;IAElB,MAAM,KAAK,GAAG,YAAY,CAAC,CAAC,CAAC,WAAW,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3D,MAAM,UAAU,GAAG,kBAAkB,CAAC,QAAQ,CAAC,CAAC;IAChD,OAAO,aAAa,GAAG,KAAK,GAAG,UAAU,CAAC;AAC5C,CAAC;AAED;;;GAGG;AACH,MAAM,OAAO,YAAY;IACf,EAAE,GAAoB,IAAI,CAAC;IAC3B,MAAM,CAAS;IACf,WAAW,GAAG,KAAK,CAAC;IAE5B,YAAY,MAAe;QACzB,yEAAyE;QACzE,IAAI,CAAC,MAAM,GAAG,MAAM,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC,OAAO,EAAE,qBAAqB,CAAC,CAAC;IAC3E,CAAC;IAEO,IAAI;QACV,IAAI,IAAI,CAAC,WAAW;YAAE,OAAO;QAE7B,IAAI,CAAC;YACH,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC;gBACb,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;gBACrD,MAAM,aAAa,GAAG,OAAO,CAAC,gBAAgB,CAA+B,CAAC;gBAC9E,IAAI,CAAC,EAAE,GAAG,IAAI,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACzC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,oBAAoB,CAAC,CAAC;gBACrC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,mBAAmB,CAAC,CAAC;YACtC,CAAC;YAED,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC;;;;;;;;OAQZ,CAAC,CAAC;YAEH,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;QAC1B,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,OAAO,CAAC,KAAK,CAAC,6CAA6C,GAAG,EAAE,CAAC,CAAC;YAClE,MAAM,GAAG,CAAC;QACZ,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,YAAY,CAAC,SAAiB;QAC5B,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,IAAI,CAAC,IAAI,CAAC,EAAE;YAAE,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;QAEhE,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QAErC,uDAAuD;QACvD,IAAI,CAAC,EAAE;aACJ,OAAO,CACN;;;+FAGuF,CACxF;aACA,GAAG,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;QAEvB,uBAAuB;QACvB,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE;aAClB,OAAO,CAAC,iDAAiD,CAAC;aAC1D,GAAG,CAAC,SAAS,CAAe,CAAC;QAEhC,KAAK,MAAM,SAAS,IAAI,oBAAoB,EAAE,CAAC;YAC7C,IAAI,KAAK,CAAC,QAAQ,KAAK,SAAS,CAAC,IAAI,IAAI,KAAK,CAAC,YAAY,IAAI,SAAS,CAAC,SAAS,EAAE,CAAC;gBACnF,IAAI,CAAC,EAAE;qBACJ,OAAO,CAAC,2DAA2D,CAAC;qBACpE,GAAG,CAAC,SAAS,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;gBAChC,KAAK,CAAC,QAAQ,GAAG,SAAS,CAAC,EAAE,CAAC;YAChC,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACH,gBAAgB,CAAC,UAAoB;QACnC,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAEhD,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QAErC,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAC5B;;;6FAGuF,CACxF,CAAC;QAEF,MAAM,cAAc,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CACpC,kFAAkF,CACnF,CAAC;QAEF,MAAM,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,2DAA2D,CAAC,CAAC;QAE7F,MAAM,WAAW,GAAG,IAAI,CAAC,EAAE,CAAC,WAAW,CAAC,CAAC,KAAe,EAAE,EAAE;YAC1D,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;gBACtB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;gBACnB,MAAM,GAAG,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC,CAEnB,CAAC;gBACd,IAAI,GAAG,EAAE,CAAC;oBACR,KAAK,MAAM,SAAS,IAAI,oBAAoB,EAAE,CAAC;wBAC7C,IAAI,GAAG,CAAC,QAAQ,KAAK,SAAS,CAAC,IAAI,IAAI,GAAG,CAAC,YAAY,IAAI,SAAS,CAAC,SAAS,EAAE,CAAC;4BAC/E,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;wBAC/B,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,WAAW,CAAC,UAAU,CAAC,CAAC;IAC1B,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,SAAiB;QACxB,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,IAAI,CAAC,IAAI,CAAC,EAAE;YAAE,OAAO,IAAI,CAAC;QAE1B,MAAM,GAAG,GAAG,IAAI,CAAC,EAAE;aAChB,OAAO,CAAC,iDAAiD,CAAC;aAC1D,GAAG,CAAC,SAAS,CAA2B,CAAC;QAE5C,OAAO,GAAG,IAAI,IAAI,CAAC;IACrB,CAAC;IAED;;OAEG;IACH,SAAS,CAAC,UAAoB;QAC5B,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,GAAG,EAAE,CAAC;QAE1D,MAAM,MAAM,GAAG,IAAI,GAAG,EAAsB,CAAC;QAC7C,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,iDAAiD,CAAC,CAAC;QAEhF,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;YAC3B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAA2B,CAAC;YAClD,IAAI,GAAG,EAAE,CAAC;gBACR,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,qCAAqC;IACrC,KAAK;QACH,IAAI,CAAC;YACH,IAAI,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC;QACnB,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,OAAO,CAAC,KAAK,CAAC,2CAA2C,GAAG,EAAE,CAAC,CAAC;QAClE,CAAC;gBAAS,CAAC;YACT,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC;YACf,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC;QAC3B,CAAC;IACH,CAAC;CACF;AAED,gFAAgF;AAEhF,IAAI,gBAAgB,GAAwB,IAAI,CAAC;AAEjD,MAAM,UAAU,eAAe,CAAC,MAAe;IAC7C,IAAI,CAAC,gBAAgB,EAAE,CAAC;QACtB,gBAAgB,GAAG,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC;IAC9C,CAAC;IACD,OAAO,gBAAgB,CAAC;AAC1B,CAAC"}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"search.d.ts","sourceRoot":"","sources":["../../src/knowledge/search.ts"],"names":[],"mappings":"
|
|
1
|
+
{"version":3,"file":"search.d.ts","sourceRoot":"","sources":["../../src/knowledge/search.ts"],"names":[],"mappings":"AAGA,OAAO,EAA0B,cAAc,EAAE,MAAM,YAAY,CAAC;AAEpE,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,aAAa,CAAC,EAAE,OAAO,CAAC;CACzB;AAED,MAAM,WAAW,YAAY;IAC3B,KAAK,EAAE,cAAc,CAAC;IACtB,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,MAAM,CAAC;CACjB;AAED;;;;;;GAMG;AACH,wBAAgB,eAAe,CAC7B,GAAG,EAAE,MAAM,EACX,KAAK,EAAE,MAAM,EACb,OAAO,GAAE,aAAkB,GAC1B,KAAK,CAAC,YAAY,CAAC,CAmFrB"}
|