@designerbyron/lifecode-rag 0.0.0-stage → 1.1.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/LICENSE +21 -0
- package/README.md +220 -2
- package/bin/lifecode-rag.mjs +449 -0
- package/client.js +3515 -0
- package/cordis.patch.yml +3 -0
- package/docs/ARCHITECTURE-v0.2.md +269 -0
- package/docs/AUTO-DISCOVERY.md +111 -0
- package/docs/AUTOMATION-POLICIES.md +232 -0
- package/docs/CONTRATO-v0.1.md +195 -0
- package/docs/EMBEDDING-PROVIDERS.md +105 -0
- package/docs/OBSERVABILITY.md +241 -0
- package/docs/PA-UI-0-API-CONTRACT.md +887 -0
- package/docs/PERFORMANCE-BUDGETS.md +118 -0
- package/docs/PROJECT-AWARE-ARCHITECTURE.md +580 -0
- package/docs/PROJECT-AWARE-DATA-CONTRACT.md +411 -0
- package/docs/PROJECT-AWARE-ERROR-CONTRACT.md +112 -0
- package/docs/PROJECT-AWARE-SESSION-CONTRACT.md +120 -0
- package/docs/WORKSPACE-API.md +239 -0
- package/icon.svg +7 -0
- package/index.js +198 -0
- package/lib/audit-export.mjs +70 -0
- package/lib/audit.mjs +120 -0
- package/lib/auto-context.mjs +322 -0
- package/lib/automation.mjs +214 -0
- package/lib/chunk.mjs +100 -0
- package/lib/config-resolve.mjs +119 -0
- package/lib/context.mjs +150 -0
- package/lib/conversation-events.mjs +145 -0
- package/lib/db.mjs +309 -0
- package/lib/diagnose.mjs +197 -0
- package/lib/discovery.mjs +402 -0
- package/lib/doctor.mjs +82 -0
- package/lib/embed.mjs +96 -0
- package/lib/embedders.mjs +103 -0
- package/lib/errors.mjs +231 -0
- package/lib/exec-context.mjs +238 -0
- package/lib/extract.mjs +260 -0
- package/lib/harness-workspaces.mjs +85 -0
- package/lib/hash.mjs +34 -0
- package/lib/ingest.mjs +239 -0
- package/lib/inputs.mjs +67 -0
- package/lib/library-state.mjs +252 -0
- package/lib/maintenance.mjs +113 -0
- package/lib/metrics.mjs +164 -0
- package/lib/migrate.mjs +373 -0
- package/lib/operations.mjs +132 -0
- package/lib/pa-api.mjs +946 -0
- package/lib/paths.mjs +345 -0
- package/lib/policy.mjs +125 -0
- package/lib/profile.mjs +128 -0
- package/lib/readmodel.mjs +159 -0
- package/lib/recovery.mjs +557 -0
- package/lib/registry-schema.mjs +206 -0
- package/lib/registry.mjs +606 -0
- package/lib/resolve.mjs +318 -0
- package/lib/retention.mjs +143 -0
- package/lib/revocation.mjs +124 -0
- package/lib/roots-structure.mjs +224 -0
- package/lib/schema.mjs +173 -0
- package/lib/scope-ops.mjs +379 -0
- package/lib/scope-stores.mjs +128 -0
- package/lib/search.mjs +345 -0
- package/lib/selection.mjs +225 -0
- package/lib/server.mjs +340 -0
- package/lib/session-identity.mjs +51 -0
- package/lib/sessions.mjs +343 -0
- package/lib/sync-scheduler.mjs +354 -0
- package/lib/sync.mjs +755 -0
- package/lib/tags.mjs +45 -0
- package/lib/tools.mjs +364 -0
- package/lib/trusted-roots.mjs +149 -0
- package/lib/worker-context.mjs +22 -0
- package/package.json +67 -5
|
@@ -0,0 +1,224 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* Protección estructural de raíces (PA4-D).
|
|
3
|
+
*
|
|
4
|
+
* PA2 detectaba el solapamiento *al resolver* (`scope-ambiguous`), pero el registro aceptaba dos
|
|
5
|
+
* raíces padre/hijo o dos rutas que apuntaban a la misma zona física. Eso deja la ambigüedad
|
|
6
|
+
* latente: dos ámbitos pueden reclamar la misma carpeta y el resultado depende del orden de la
|
|
7
|
+
* consulta. Aquí la ambigüedad se rechaza **al registrar** y se vuelve a comprobar al abrir.
|
|
8
|
+
*
|
|
9
|
+
* Reglas:
|
|
10
|
+
* - La ruta se canonicaliza con `realpathSync.native`, no con `resolve`: resolver la cadena de
|
|
11
|
+
* enlaces es lo único que impide que `C:\docs` y `C:\enlace-a-docs` convivan como dos raíces.
|
|
12
|
+
* - En Windows la comparación es insensible a mayúsculas y acepta `\` y `/`.
|
|
13
|
+
* - Un enlace simbólico, una junction o un reparse point que Node pueda ver (`lstat` marca
|
|
14
|
+
* `symbolicLink`) se rechaza con `root-symlink`: la zona física quedaría reclamada por el destino
|
|
15
|
+
* y por la raíz a la vez.
|
|
16
|
+
* - Un solapamiento padre/hijo o un duplicado se rechaza con `root-overlap` / `invalid-argument`
|
|
17
|
+
* aunque pertenezcan al mismo ámbito: la misma carpeta no puede ser dos raíces distintas.
|
|
18
|
+
* - Si el destino real de una raíz ya registrada cambia después (enlace re-apuntado, carpeta
|
|
19
|
+
* sustituida), `assertRootUnchanged` falla en cerrado con `root-changed`.
|
|
20
|
+
*
|
|
21
|
+
* Límites que este módulo **no** inventa:
|
|
22
|
+
* - Node no expone el tag de reparse point de Windows: una junction y un enlace de directorio se
|
|
23
|
+
* ven igual (`lstat().isSymbolicLink()`), y un reparse point de proveedor (OneDrive, DFS) cuyo
|
|
24
|
+
* destino no cambia la ruta canónica no es distinguible. Ambos casos se documentan como límite;
|
|
25
|
+
* el segundo se mitiga comparando el destino canónico en cada reapertura.
|
|
26
|
+
* - Los hardlinks de directorio no existen en NTFS; para ficheros la comprobación vive en la
|
|
27
|
+
* política de ingesta (`hardlink-refused`), no aquí.
|
|
28
|
+
*/
|
|
29
|
+
|
|
30
|
+
import { lstatSync, readlinkSync, realpathSync, statSync } from 'node:fs';
|
|
31
|
+
import { isAbsolute, resolve } from 'node:path';
|
|
32
|
+
|
|
33
|
+
import { RagError } from './errors.mjs';
|
|
34
|
+
|
|
35
|
+
/** Relaciones posibles entre dos claves canónicas. */
|
|
36
|
+
export const ROOT_RELATIONS = Object.freeze(['same', 'left-ancestor', 'left-descendant', 'disjoint']);
|
|
37
|
+
|
|
38
|
+
/** Normaliza una ruta a clave comparable: barras `/`, sin barra final y minúsculas en Windows. */
|
|
39
|
+
export function normalizeKey(path) {
|
|
40
|
+
const slashes = String(path).replace(/\\/g, '/').replace(/\/+$/, '');
|
|
41
|
+
return process.platform === 'win32' ? slashes.toLowerCase() : slashes;
|
|
42
|
+
}
|
|
43
|
+
|
|
44
|
+
/**
|
|
45
|
+
* Clave canónica de una ruta. Resuelve enlaces si la ruta existe; si no existe (por ejemplo un cwd
|
|
46
|
+
* borrado), usa la ruta resuelta: la comparación sigue siendo determinista y no crea nada.
|
|
47
|
+
*/
|
|
48
|
+
export function canonicalKey(path) {
|
|
49
|
+
const absolute = resolve(path);
|
|
50
|
+
let real = absolute;
|
|
51
|
+
try {
|
|
52
|
+
real = realpathSync.native(absolute);
|
|
53
|
+
} catch {
|
|
54
|
+
real = absolute;
|
|
55
|
+
}
|
|
56
|
+
return normalizeKey(real);
|
|
57
|
+
}
|
|
58
|
+
|
|
59
|
+
/** Relación entre dos claves ya normalizadas. */
|
|
60
|
+
export function relationOf(leftKey, rightKey) {
|
|
61
|
+
if (leftKey === rightKey) return 'same';
|
|
62
|
+
if (rightKey.startsWith(`${leftKey}/`)) return 'left-ancestor';
|
|
63
|
+
if (leftKey.startsWith(`${rightKey}/`)) return 'left-descendant';
|
|
64
|
+
return 'disjoint';
|
|
65
|
+
}
|
|
66
|
+
|
|
67
|
+
/**
|
|
68
|
+
* Inspecciona una ruta de raíz sin modificarla. Lanza `source-unreadable` si no existe o no se
|
|
69
|
+
* puede leer; el resto de comprobaciones las decide `assertRootStructure`.
|
|
70
|
+
*/
|
|
71
|
+
export function inspectRoot(path) {
|
|
72
|
+
if (typeof path !== 'string' || path.trim() === '' || !isAbsolute(path)) {
|
|
73
|
+
throw new RagError('invalid-argument', 'la raíz debe ser una ruta absoluta');
|
|
74
|
+
}
|
|
75
|
+
const absolute = resolve(path);
|
|
76
|
+
let link = null;
|
|
77
|
+
try {
|
|
78
|
+
link = lstatSync(absolute);
|
|
79
|
+
} catch (error) {
|
|
80
|
+
throw new RagError('source-unreadable', 'la raíz no existe o no se puede leer', {
|
|
81
|
+
details: { path: absolute },
|
|
82
|
+
cause: error,
|
|
83
|
+
});
|
|
84
|
+
}
|
|
85
|
+
const isLink = link.isSymbolicLink();
|
|
86
|
+
let linkTarget = null;
|
|
87
|
+
if (isLink) {
|
|
88
|
+
try {
|
|
89
|
+
linkTarget = readlinkSync(absolute);
|
|
90
|
+
} catch {
|
|
91
|
+
linkTarget = null;
|
|
92
|
+
}
|
|
93
|
+
}
|
|
94
|
+
let real;
|
|
95
|
+
try {
|
|
96
|
+
real = realpathSync.native(absolute);
|
|
97
|
+
} catch (error) {
|
|
98
|
+
throw new RagError('source-unreadable', 'la raíz no se puede resolver a una ruta real', {
|
|
99
|
+
details: { path: absolute },
|
|
100
|
+
cause: error,
|
|
101
|
+
});
|
|
102
|
+
}
|
|
103
|
+
let stat;
|
|
104
|
+
try {
|
|
105
|
+
stat = statSync(real);
|
|
106
|
+
} catch (error) {
|
|
107
|
+
throw new RagError('source-unreadable', 'el destino de la raíz no se puede leer', {
|
|
108
|
+
details: { path: real },
|
|
109
|
+
cause: error,
|
|
110
|
+
});
|
|
111
|
+
}
|
|
112
|
+
return {
|
|
113
|
+
input: path,
|
|
114
|
+
absolute,
|
|
115
|
+
exists: true,
|
|
116
|
+
isLink,
|
|
117
|
+
linkTarget,
|
|
118
|
+
linkKind: isLink ? classifyLink(link, linkTarget) : null,
|
|
119
|
+
canonical: real,
|
|
120
|
+
key: normalizeKey(real),
|
|
121
|
+
identicalToCanonical: normalizeKey(absolute) === normalizeKey(real),
|
|
122
|
+
isDirectory: stat.isDirectory(),
|
|
123
|
+
hardlinkCount: stat.nlink,
|
|
124
|
+
};
|
|
125
|
+
}
|
|
126
|
+
|
|
127
|
+
/**
|
|
128
|
+
* Node no distingue una junction de un enlace de directorio (ambas se ven como `symbolicLink`).
|
|
129
|
+
* Se declara explícitamente ese límite en vez de fingir una clasificación que la API no da.
|
|
130
|
+
*/
|
|
131
|
+
function classifyLink(link, target) {
|
|
132
|
+
const permissions = link.mode & 0o777;
|
|
133
|
+
if (process.platform !== 'win32') return 'symlink';
|
|
134
|
+
// Un enlace de directorio creado con `symlink(...,'dir')` hereda 0o777; una junction no.
|
|
135
|
+
return permissions === 0o777 ? 'dir-symlink' : 'junction-or-reparse';
|
|
136
|
+
}
|
|
137
|
+
|
|
138
|
+
/** Rechaza una raíz que no puede usarse como zona física inequívoca. */
|
|
139
|
+
export function assertRootStructure(info) {
|
|
140
|
+
if (info.isLink) {
|
|
141
|
+
throw new RagError('root-symlink', 'una raíz no puede ser un enlace, una junction ni un reparse point', {
|
|
142
|
+
details: { path: info.absolute, linkKind: info.linkKind },
|
|
143
|
+
});
|
|
144
|
+
}
|
|
145
|
+
if (!info.identicalToCanonical) {
|
|
146
|
+
throw new RagError('root-symlink', 'la ruta de la raíz atraviesa un enlace o un reparse point', {
|
|
147
|
+
details: { path: info.absolute, canonical: info.canonical },
|
|
148
|
+
});
|
|
149
|
+
}
|
|
150
|
+
if (!info.isDirectory) {
|
|
151
|
+
throw new RagError('invalid-argument', 'la raíz debe ser un directorio', { details: { path: info.absolute } });
|
|
152
|
+
}
|
|
153
|
+
return info;
|
|
154
|
+
}
|
|
155
|
+
|
|
156
|
+
/**
|
|
157
|
+
* Decide si una raíz candidata puede registrarse junto a las existentes. Función pura: la usa el
|
|
158
|
+
* registro y las pruebas sin tocar el sistema de ficheros.
|
|
159
|
+
*
|
|
160
|
+
* @param {{key: string, path?: string}} candidate
|
|
161
|
+
* @param {Array<{id?: string, scope_kind?: string, scope_id?: string, path: string, path_key?: string}>} existing
|
|
162
|
+
*/
|
|
163
|
+
export function classifyRootRegistration(candidate, existing = [], { allowNested = false } = {}) {
|
|
164
|
+
for (const root of existing) {
|
|
165
|
+
const key = root.path_key ?? canonicalKey(root.path);
|
|
166
|
+
const relation = relationOf(candidate.key, key);
|
|
167
|
+
if (relation === 'same') {
|
|
168
|
+
return {
|
|
169
|
+
ok: false,
|
|
170
|
+
code: 'invalid-argument',
|
|
171
|
+
message: 'esa ruta ya está registrada en este perfil',
|
|
172
|
+
conflict: { relation, root },
|
|
173
|
+
};
|
|
174
|
+
}
|
|
175
|
+
if ((relation === 'left-ancestor' || relation === 'left-descendant') && !allowNested) {
|
|
176
|
+
return {
|
|
177
|
+
ok: false,
|
|
178
|
+
code: 'root-overlap',
|
|
179
|
+
message: 'la raíz se solapa con otra raíz ya autorizada; dos ámbitos no pueden reclamar la misma zona',
|
|
180
|
+
conflict: { relation, root },
|
|
181
|
+
};
|
|
182
|
+
}
|
|
183
|
+
}
|
|
184
|
+
return { ok: true, conflict: null };
|
|
185
|
+
}
|
|
186
|
+
|
|
187
|
+
/** Lista de pares de raíces ya registradas que se solapan (diagnóstico de registros heredados). */
|
|
188
|
+
export function findRootConflicts(roots = []) {
|
|
189
|
+
const conflicts = [];
|
|
190
|
+
for (let index = 0; index < roots.length; index += 1) {
|
|
191
|
+
for (let other = index + 1; other < roots.length; other += 1) {
|
|
192
|
+
const left = roots[index];
|
|
193
|
+
const right = roots[other];
|
|
194
|
+
const relation = relationOf(left.path_key ?? canonicalKey(left.path), right.path_key ?? canonicalKey(right.path));
|
|
195
|
+
if (relation !== 'disjoint') {
|
|
196
|
+
conflicts.push({ left, right, relation });
|
|
197
|
+
}
|
|
198
|
+
}
|
|
199
|
+
}
|
|
200
|
+
return conflicts;
|
|
201
|
+
}
|
|
202
|
+
|
|
203
|
+
/**
|
|
204
|
+
* Comprueba que el destino real de una raíz registrada sigue siendo el mismo. Si cambió, la raíz
|
|
205
|
+
* deja de representar la zona que se autorizó: se falla en cerrado con `root-changed`.
|
|
206
|
+
*/
|
|
207
|
+
export function assertRootUnchanged(root) {
|
|
208
|
+
let info;
|
|
209
|
+
try {
|
|
210
|
+
info = inspectRoot(root.path);
|
|
211
|
+
} catch (error) {
|
|
212
|
+
throw new RagError('root-changed', 'la raíz autorizada ya no se puede resolver', {
|
|
213
|
+
details: { path: root.path, scopeId: root.scope_id },
|
|
214
|
+
cause: error,
|
|
215
|
+
});
|
|
216
|
+
}
|
|
217
|
+
const expected = root.path_key ?? canonicalKey(root.path);
|
|
218
|
+
if (info.key !== expected) {
|
|
219
|
+
throw new RagError('root-changed', 'el destino real de la raíz cambió desde que se autorizó', {
|
|
220
|
+
details: { path: root.path, expected, found: info.canonical, scopeId: root.scope_id },
|
|
221
|
+
});
|
|
222
|
+
}
|
|
223
|
+
return info;
|
|
224
|
+
}
|
package/lib/schema.mjs
ADDED
|
@@ -0,0 +1,173 @@
|
|
|
1
|
+
/**
|
|
2
|
+
* Esquema del almacén de LifeCode RAG (versión 2, con el delta de la resolución v2.1).
|
|
3
|
+
*
|
|
4
|
+
* Reglas que este módulo fija y ninguna migración puede romper:
|
|
5
|
+
* - `chunks_fts` es **externa**: no duplica texto, lee de `chunks`, y se mantiene con disparadores.
|
|
6
|
+
* - `audit` es la fuente autoritativa; `audit.jsonl` es una exportación derivada y regenerable.
|
|
7
|
+
* - `sources` no guarda estados parciales: una fila existe sólo si está indexada (`indexed_at NOT NULL`).
|
|
8
|
+
* - `source_tags` es normalizada, no JSON: el filtro se hace en SQL antes de materializar resultados.
|
|
9
|
+
*/
|
|
10
|
+
|
|
11
|
+
/** Identificador de aplicación SQLite: 0x4C435247 = 'LCRG'. Un fichero sin él no es de este plugin. */
|
|
12
|
+
export const APPLICATION_ID = 1_279_480_391;
|
|
13
|
+
|
|
14
|
+
/** Versión de esquema. `PRAGMA user_version` manda; una mayor no se abre. */
|
|
15
|
+
export const SCHEMA_VERSION = 3;
|
|
16
|
+
|
|
17
|
+
/**
|
|
18
|
+
* Delta v0.2 (esquema 3). Se aplica a almacenes 2 y se crea con el resto en almacenes nuevos.
|
|
19
|
+
* `metrics_daily` guarda **agregados** por día, métrica y dimensión cerrada: nunca texto de consultas.
|
|
20
|
+
* `index_jobs` es el histórico de trabajos de automatización; `policies` la política vigente.
|
|
21
|
+
*/
|
|
22
|
+
export const DDL_V3 = Object.freeze([
|
|
23
|
+
`CREATE TABLE metrics_daily (
|
|
24
|
+
day TEXT NOT NULL,
|
|
25
|
+
metric TEXT NOT NULL,
|
|
26
|
+
dim TEXT NOT NULL DEFAULT '',
|
|
27
|
+
value REAL NOT NULL,
|
|
28
|
+
updated_at INTEGER NOT NULL,
|
|
29
|
+
PRIMARY KEY (day, metric, dim)
|
|
30
|
+
) STRICT`,
|
|
31
|
+
|
|
32
|
+
`CREATE INDEX metrics_daily_metric ON metrics_daily(metric, day)`,
|
|
33
|
+
|
|
34
|
+
`CREATE TABLE index_jobs (
|
|
35
|
+
id INTEGER PRIMARY KEY AUTOINCREMENT,
|
|
36
|
+
at INTEGER NOT NULL,
|
|
37
|
+
kind TEXT NOT NULL,
|
|
38
|
+
status TEXT NOT NULL CHECK (status IN ('queued','running','ok','failed','cancelled')),
|
|
39
|
+
detail TEXT NOT NULL DEFAULT '{}',
|
|
40
|
+
started_at INTEGER,
|
|
41
|
+
finished_at INTEGER
|
|
42
|
+
) STRICT`,
|
|
43
|
+
|
|
44
|
+
`CREATE TABLE policies (
|
|
45
|
+
key TEXT PRIMARY KEY,
|
|
46
|
+
value TEXT NOT NULL,
|
|
47
|
+
updated_at INTEGER NOT NULL
|
|
48
|
+
) STRICT`,
|
|
49
|
+
]);
|
|
50
|
+
|
|
51
|
+
export const DDL = Object.freeze([
|
|
52
|
+
`CREATE TABLE meta (
|
|
53
|
+
key TEXT PRIMARY KEY,
|
|
54
|
+
value TEXT NOT NULL
|
|
55
|
+
) STRICT`,
|
|
56
|
+
|
|
57
|
+
`CREATE TABLE sources (
|
|
58
|
+
id TEXT PRIMARY KEY,
|
|
59
|
+
collection TEXT NOT NULL DEFAULT 'default',
|
|
60
|
+
uri TEXT NOT NULL,
|
|
61
|
+
title TEXT NOT NULL,
|
|
62
|
+
mime TEXT,
|
|
63
|
+
sha256 TEXT NOT NULL,
|
|
64
|
+
bytes INTEGER NOT NULL,
|
|
65
|
+
char_count INTEGER NOT NULL,
|
|
66
|
+
metadata TEXT NOT NULL DEFAULT '{}',
|
|
67
|
+
created_at INTEGER NOT NULL,
|
|
68
|
+
updated_at INTEGER NOT NULL,
|
|
69
|
+
indexed_at INTEGER NOT NULL,
|
|
70
|
+
UNIQUE (collection, uri)
|
|
71
|
+
) STRICT`,
|
|
72
|
+
|
|
73
|
+
`CREATE TABLE chunks (
|
|
74
|
+
id INTEGER PRIMARY KEY,
|
|
75
|
+
chunk_key TEXT NOT NULL UNIQUE,
|
|
76
|
+
source_id TEXT NOT NULL REFERENCES sources(id) ON DELETE CASCADE,
|
|
77
|
+
ordinal INTEGER NOT NULL,
|
|
78
|
+
title TEXT NOT NULL,
|
|
79
|
+
heading TEXT,
|
|
80
|
+
text TEXT NOT NULL,
|
|
81
|
+
char_start INTEGER NOT NULL,
|
|
82
|
+
char_end INTEGER NOT NULL,
|
|
83
|
+
token_est INTEGER NOT NULL,
|
|
84
|
+
UNIQUE (source_id, ordinal)
|
|
85
|
+
) STRICT`,
|
|
86
|
+
|
|
87
|
+
`CREATE VIRTUAL TABLE chunks_fts USING fts5(
|
|
88
|
+
text, title, heading,
|
|
89
|
+
content = 'chunks',
|
|
90
|
+
content_rowid = 'id',
|
|
91
|
+
tokenize = 'unicode61 remove_diacritics 2'
|
|
92
|
+
)`,
|
|
93
|
+
|
|
94
|
+
`CREATE TRIGGER chunks_ai AFTER INSERT ON chunks BEGIN
|
|
95
|
+
INSERT INTO chunks_fts(rowid, text, title, heading)
|
|
96
|
+
VALUES (new.id, new.text, new.title, new.heading);
|
|
97
|
+
END`,
|
|
98
|
+
|
|
99
|
+
`CREATE TRIGGER chunks_ad AFTER DELETE ON chunks BEGIN
|
|
100
|
+
INSERT INTO chunks_fts(chunks_fts, rowid, text, title, heading)
|
|
101
|
+
VALUES ('delete', old.id, old.text, old.title, old.heading);
|
|
102
|
+
END`,
|
|
103
|
+
|
|
104
|
+
`CREATE TRIGGER chunks_au AFTER UPDATE ON chunks BEGIN
|
|
105
|
+
INSERT INTO chunks_fts(chunks_fts, rowid, text, title, heading)
|
|
106
|
+
VALUES ('delete', old.id, old.text, old.title, old.heading);
|
|
107
|
+
INSERT INTO chunks_fts(rowid, text, title, heading)
|
|
108
|
+
VALUES (new.id, new.text, new.title, new.heading);
|
|
109
|
+
END`,
|
|
110
|
+
|
|
111
|
+
`CREATE TABLE source_tags (
|
|
112
|
+
source_id TEXT NOT NULL REFERENCES sources(id) ON DELETE CASCADE,
|
|
113
|
+
tag TEXT NOT NULL,
|
|
114
|
+
PRIMARY KEY (source_id, tag)
|
|
115
|
+
) STRICT`,
|
|
116
|
+
|
|
117
|
+
`CREATE INDEX source_tags_tag ON source_tags(tag, source_id)`,
|
|
118
|
+
|
|
119
|
+
`CREATE TABLE vectors (
|
|
120
|
+
chunk_key TEXT NOT NULL REFERENCES chunks(chunk_key) ON DELETE CASCADE,
|
|
121
|
+
model TEXT NOT NULL,
|
|
122
|
+
dim INTEGER NOT NULL,
|
|
123
|
+
vec BLOB NOT NULL,
|
|
124
|
+
PRIMARY KEY (chunk_key, model)
|
|
125
|
+
) STRICT`,
|
|
126
|
+
|
|
127
|
+
`CREATE TABLE audit (
|
|
128
|
+
seq INTEGER PRIMARY KEY AUTOINCREMENT,
|
|
129
|
+
at INTEGER NOT NULL,
|
|
130
|
+
actor TEXT NOT NULL,
|
|
131
|
+
session_id TEXT,
|
|
132
|
+
call_id TEXT,
|
|
133
|
+
tool TEXT NOT NULL,
|
|
134
|
+
action TEXT NOT NULL,
|
|
135
|
+
target TEXT,
|
|
136
|
+
outcome TEXT NOT NULL CHECK (outcome IN ('ok','failed','denied','skipped')),
|
|
137
|
+
details TEXT NOT NULL DEFAULT '{}',
|
|
138
|
+
prev_hash TEXT NOT NULL,
|
|
139
|
+
hash TEXT NOT NULL
|
|
140
|
+
) STRICT`,
|
|
141
|
+
|
|
142
|
+
`CREATE INDEX chunks_source ON chunks(source_id)`,
|
|
143
|
+
`CREATE INDEX sources_collection ON sources(collection)`,
|
|
144
|
+
`CREATE INDEX vectors_model ON vectors(model)`,
|
|
145
|
+
...DDL_V3,
|
|
146
|
+
]);
|
|
147
|
+
|
|
148
|
+
/** Claves iniciales de `meta`. `audit_head_hash` vacío significa «sin auditoría todavía». */
|
|
149
|
+
export function initialMeta(now) {
|
|
150
|
+
return [
|
|
151
|
+
['schema_version', String(SCHEMA_VERSION)],
|
|
152
|
+
['created_at', String(now)],
|
|
153
|
+
['index_revision', '0'],
|
|
154
|
+
['embedding_model', 'local-hash-v1'],
|
|
155
|
+
['audit_head_seq', '0'],
|
|
156
|
+
['audit_head_hash', ''],
|
|
157
|
+
['audit_exported_seq', '0'],
|
|
158
|
+
];
|
|
159
|
+
}
|
|
160
|
+
|
|
161
|
+
/** Todas las tablas que el esquema declara, para comprobaciones de integridad. */
|
|
162
|
+
export const EXPECTED_TABLES = Object.freeze([
|
|
163
|
+
'audit',
|
|
164
|
+
'chunks',
|
|
165
|
+
'chunks_fts',
|
|
166
|
+
'index_jobs',
|
|
167
|
+
'meta',
|
|
168
|
+
'metrics_daily',
|
|
169
|
+
'policies',
|
|
170
|
+
'source_tags',
|
|
171
|
+
'sources',
|
|
172
|
+
'vectors',
|
|
173
|
+
]);
|