sensemaking 0.9.4 → 0.10.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/README.md +50 -100
- package/dist/cjs/cli/check.js +7 -13
- package/dist/cjs/cli/check.js.map +1 -1
- package/dist/cjs/cli/download.d.cts +3 -0
- package/dist/cjs/cli/download.d.ts +3 -0
- package/dist/cjs/cli/download.js +214 -0
- package/dist/cjs/cli/download.js.map +1 -0
- package/dist/cjs/cli/index.d.cts +6 -3
- package/dist/cjs/cli/index.d.ts +6 -3
- package/dist/cjs/cli/index.js +23 -5
- package/dist/cjs/cli/index.js.map +1 -1
- package/dist/cjs/cli/init.js +4 -1
- package/dist/cjs/cli/init.js.map +1 -1
- package/dist/cjs/cli/map.js +2 -2
- package/dist/cjs/cli/map.js.map +1 -1
- package/dist/cjs/cli/named.js +10 -18
- package/dist/cjs/cli/named.js.map +1 -1
- package/dist/cjs/cli/path.d.cts +3 -0
- package/dist/cjs/cli/path.d.ts +3 -0
- package/dist/cjs/cli/path.js +161 -0
- package/dist/cjs/cli/path.js.map +1 -0
- package/dist/cjs/cli/peek.js +3 -2
- package/dist/cjs/cli/peek.js.map +1 -1
- package/dist/cjs/cli/related.d.cts +3 -0
- package/dist/cjs/cli/related.d.ts +3 -0
- package/dist/cjs/cli/related.js +279 -0
- package/dist/cjs/cli/related.js.map +1 -0
- package/dist/cjs/cli/search.js +3 -7
- package/dist/cjs/cli/search.js.map +1 -1
- package/dist/cjs/cli/shared.d.cts +3 -1
- package/dist/cjs/cli/shared.d.ts +3 -1
- package/dist/cjs/cli/shared.js +28 -5
- package/dist/cjs/cli/shared.js.map +1 -1
- package/dist/cjs/cli/sql.d.cts +3 -0
- package/dist/cjs/cli/sql.d.ts +3 -0
- package/dist/cjs/cli/{query.js → sql.js} +4 -4
- package/dist/cjs/cli/sql.js.map +1 -0
- package/dist/cjs/cli/status.js +9 -2
- package/dist/cjs/cli/status.js.map +1 -1
- package/dist/cjs/cli.js +14 -15
- package/dist/cjs/cli.js.map +1 -1
- package/dist/cjs/commands.d.cts +12 -4
- package/dist/cjs/commands.d.ts +12 -4
- package/dist/cjs/commands.js +138 -58
- package/dist/cjs/commands.js.map +1 -1
- package/dist/cjs/config.d.cts +6 -4
- package/dist/cjs/config.d.ts +6 -4
- package/dist/cjs/config.js +137 -58
- package/dist/cjs/config.js.map +1 -1
- package/dist/cjs/db.js +14 -34
- package/dist/cjs/db.js.map +1 -1
- package/dist/cjs/errors.d.cts +1 -1
- package/dist/cjs/errors.d.ts +1 -1
- package/dist/cjs/errors.js.map +1 -1
- package/dist/cjs/features/embed.d.cts +14 -0
- package/dist/cjs/features/embed.d.ts +14 -0
- package/dist/cjs/features/embed.js +248 -54
- package/dist/cjs/features/embed.js.map +1 -1
- package/dist/cjs/features/links.js +7 -16
- package/dist/cjs/features/links.js.map +1 -1
- package/dist/cjs/features/rank.js +2 -6
- package/dist/cjs/features/rank.js.map +1 -1
- package/dist/cjs/index.d.cts +1 -1
- package/dist/cjs/index.d.ts +1 -1
- package/dist/cjs/index.js.map +1 -1
- package/dist/cjs/output.js +11 -14
- package/dist/cjs/output.js.map +1 -1
- package/dist/cjs/progress.js +2 -4
- package/dist/cjs/progress.js.map +1 -1
- package/dist/cjs/scan.d.cts +1 -0
- package/dist/cjs/scan.d.ts +1 -0
- package/dist/cjs/scan.js +67 -32
- package/dist/cjs/scan.js.map +1 -1
- package/dist/cjs/search-error.js +4 -6
- package/dist/cjs/search-error.js.map +1 -1
- package/dist/cjs/traverse.d.cts +8 -0
- package/dist/cjs/traverse.d.ts +8 -0
- package/dist/cjs/traverse.js +97 -0
- package/dist/cjs/traverse.js.map +1 -0
- package/dist/esm/cli/check.js +7 -13
- package/dist/esm/cli/check.js.map +1 -1
- package/dist/esm/cli/download.d.ts +3 -0
- package/dist/esm/cli/download.js +27 -0
- package/dist/esm/cli/download.js.map +1 -0
- package/dist/esm/cli/index.d.ts +6 -3
- package/dist/esm/cli/index.js +13 -7
- package/dist/esm/cli/index.js.map +1 -1
- package/dist/esm/cli/init.js +4 -1
- package/dist/esm/cli/init.js.map +1 -1
- package/dist/esm/cli/map.js +3 -2
- package/dist/esm/cli/map.js.map +1 -1
- package/dist/esm/cli/named.js +10 -16
- package/dist/esm/cli/named.js.map +1 -1
- package/dist/esm/cli/path.d.ts +3 -0
- package/dist/esm/cli/path.js +51 -0
- package/dist/esm/cli/path.js.map +1 -0
- package/dist/esm/cli/peek.js +4 -2
- package/dist/esm/cli/peek.js.map +1 -1
- package/dist/esm/cli/related.d.ts +3 -0
- package/dist/esm/cli/related.js +26 -0
- package/dist/esm/cli/related.js.map +1 -0
- package/dist/esm/cli/search.js +2 -5
- package/dist/esm/cli/search.js.map +1 -1
- package/dist/esm/cli/shared.d.ts +3 -1
- package/dist/esm/cli/shared.js +28 -5
- package/dist/esm/cli/shared.js.map +1 -1
- package/dist/esm/cli/sql.d.ts +3 -0
- package/dist/esm/cli/{query.js → sql.js} +4 -4
- package/dist/esm/cli/sql.js.map +1 -0
- package/dist/esm/cli/status.js +8 -1
- package/dist/esm/cli/status.js.map +1 -1
- package/dist/esm/cli.js +13 -10
- package/dist/esm/cli.js.map +1 -1
- package/dist/esm/commands.d.ts +12 -4
- package/dist/esm/commands.js +111 -68
- package/dist/esm/commands.js.map +1 -1
- package/dist/esm/config.d.ts +6 -4
- package/dist/esm/config.js +126 -75
- package/dist/esm/config.js.map +1 -1
- package/dist/esm/db.js +16 -38
- package/dist/esm/db.js.map +1 -1
- package/dist/esm/errors.d.ts +1 -1
- package/dist/esm/errors.js.map +1 -1
- package/dist/esm/features/embed.d.ts +14 -0
- package/dist/esm/features/embed.js +110 -35
- package/dist/esm/features/embed.js.map +1 -1
- package/dist/esm/features/links.js +8 -17
- package/dist/esm/features/links.js.map +1 -1
- package/dist/esm/features/rank.js +2 -6
- package/dist/esm/features/rank.js.map +1 -1
- package/dist/esm/features/types.js.map +1 -1
- package/dist/esm/index.d.ts +1 -1
- package/dist/esm/index.js.map +1 -1
- package/dist/esm/output.js +13 -16
- package/dist/esm/output.js.map +1 -1
- package/dist/esm/progress.js +2 -4
- package/dist/esm/progress.js.map +1 -1
- package/dist/esm/scan.d.ts +1 -0
- package/dist/esm/scan.js +41 -34
- package/dist/esm/scan.js.map +1 -1
- package/dist/esm/search-error.js +4 -6
- package/dist/esm/search-error.js.map +1 -1
- package/dist/esm/traverse.d.ts +8 -0
- package/dist/esm/traverse.js +71 -0
- package/dist/esm/traverse.js.map +1 -0
- package/package.json +18 -5
- package/schema.json +12 -16
- package/skills/sense/EXAMPLES.md +13 -22
- package/skills/sense/SKILL.md +65 -140
- package/skills/sense-setup/EXAMPLES.md +30 -46
- package/skills/sense-setup/SKILL.md +22 -83
- package/dist/cjs/cli/query.d.cts +0 -3
- package/dist/cjs/cli/query.d.ts +0 -3
- package/dist/cjs/cli/query.js.map +0 -1
- package/dist/esm/cli/query.d.ts +0 -3
- package/dist/esm/cli/query.js.map +0 -1
|
@@ -9,14 +9,35 @@ function _export(target, all) {
|
|
|
9
9
|
});
|
|
10
10
|
}
|
|
11
11
|
_export(exports, {
|
|
12
|
+
get MODEL_FILENAMES () {
|
|
13
|
+
return MODEL_FILENAMES;
|
|
14
|
+
},
|
|
15
|
+
get downloadModel () {
|
|
16
|
+
return downloadModel;
|
|
17
|
+
},
|
|
12
18
|
get embed () {
|
|
13
19
|
return embed;
|
|
14
20
|
},
|
|
15
21
|
get embedPending () {
|
|
16
22
|
return embedPending;
|
|
17
23
|
},
|
|
24
|
+
get hasModelFiles () {
|
|
25
|
+
return hasModelFiles;
|
|
26
|
+
},
|
|
27
|
+
get isDownloadable () {
|
|
28
|
+
return isDownloadable;
|
|
29
|
+
},
|
|
30
|
+
get modelDir () {
|
|
31
|
+
return modelDir;
|
|
32
|
+
},
|
|
33
|
+
get modelPresent () {
|
|
34
|
+
return modelPresent;
|
|
35
|
+
},
|
|
18
36
|
get semanticCandidates () {
|
|
19
37
|
return semanticCandidates;
|
|
38
|
+
},
|
|
39
|
+
get similarNotes () {
|
|
40
|
+
return similarNotes;
|
|
20
41
|
}
|
|
21
42
|
});
|
|
22
43
|
var _nodefs = require("node:fs");
|
|
@@ -267,18 +288,16 @@ function _ts_values(o) {
|
|
|
267
288
|
};
|
|
268
289
|
throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
|
|
269
290
|
}
|
|
270
|
-
//
|
|
271
|
-
//
|
|
272
|
-
// Reconcile stores dirty rows inside its transaction; embedding tops up on the next
|
|
273
|
-
// semantic query (embedPending), so staleness costs recall, never correctness.
|
|
291
|
+
// Heading-based chunks, int8 vectors with a per-vector scale, NULL vector = not yet embedded.
|
|
292
|
+
// Reconcile writes dirty rows; embedding tops up on the next search, so staleness costs recall.
|
|
274
293
|
// Storage lever fixed by the bake-off (BENCHMARKING.md): int8 at 256 dims is
|
|
275
294
|
// quality-free vs f32-512 when fused. Queries stay f32 at the same dims.
|
|
276
295
|
var STORE_DIMS = 256;
|
|
296
|
+
// Seed chunks that participate in a `related` scan; see similarNotes for the measurement.
|
|
297
|
+
var TARGET_CHUNK_CAP = 16;
|
|
277
298
|
var BATCH = 64;
|
|
278
|
-
// Deterministic
|
|
279
|
-
//
|
|
280
|
-
// preamble kept; whole file when no headings. The title/summary prefix mirrors the
|
|
281
|
-
// bm25 column weighting.
|
|
299
|
+
// Deterministic, so embed time can re-derive text from stored line ranges. Heading-delimited,
|
|
300
|
+
// preamble kept, whole file when no headings; the title/summary prefix mirrors bm25 weighting.
|
|
282
301
|
function chunksOf(raw, search) {
|
|
283
302
|
var lines = raw.split('\n');
|
|
284
303
|
var starts = [];
|
|
@@ -322,8 +341,8 @@ var embed = {
|
|
|
322
341
|
remove: function remove(db, path) {
|
|
323
342
|
db.prepare('DELETE FROM embeddings WHERE "path" = ?').run(path);
|
|
324
343
|
},
|
|
325
|
-
// A
|
|
326
|
-
//
|
|
344
|
+
// A tree with no embedding model never had extract() run for the doc (db.ts's per-file
|
|
345
|
+
// filter skips it), so extracted is undefined here -- store nothing, i.e. no rows.
|
|
327
346
|
store: function store(db, path, extracted) {
|
|
328
347
|
if (!extracted) return;
|
|
329
348
|
var insert = db.prepare('INSERT INTO embeddings ("path", chunk, start_line, end_line, scale, vector) VALUES (?, ?, ?, ?, NULL, NULL)');
|
|
@@ -338,6 +357,39 @@ var embed = {
|
|
|
338
357
|
// --- static type: Model2Vec safetensors + pure-JS tokenizer, model cached in ~/.cache ---
|
|
339
358
|
// Encode convention from model2vec/model.py: no special tokens, drop unk ids, mean-pool,
|
|
340
359
|
// L2-normalize.
|
|
360
|
+
var MODEL_FILES = [
|
|
361
|
+
'model.safetensors',
|
|
362
|
+
'tokenizer.json'
|
|
363
|
+
];
|
|
364
|
+
var MODEL_FILENAMES = MODEL_FILES.join(' and ');
|
|
365
|
+
// A Hugging Face repo id: one slash, HF's charset. Anything else is a path, used as one rather
|
|
366
|
+
// than flattened into a cache key Windows would reject.
|
|
367
|
+
var HF_MODEL_ID = /^[A-Za-z0-9][\w.-]*\/[A-Za-z0-9][\w.-]*$/;
|
|
368
|
+
function isDownloadable(model) {
|
|
369
|
+
return HF_MODEL_ID.test(model);
|
|
370
|
+
}
|
|
371
|
+
// Machine-wide, not per-tree: `.sense/` is the index a rebuild throws away, while a 124 MB
|
|
372
|
+
// model is shared by every tree on the machine. Honors XDG_CACHE_HOME where it is set;
|
|
373
|
+
// elsewhere ~/.cache, which is also where Hugging Face's own libraries keep theirs.
|
|
374
|
+
function cacheRoot() {
|
|
375
|
+
var xdg = process.env.XDG_CACHE_HOME;
|
|
376
|
+
return (0, _nodepath.join)(xdg && xdg.length > 0 ? xdg : (0, _nodepath.join)((0, _nodeos.homedir)(), '.cache'), 'sensemaking', 'models');
|
|
377
|
+
}
|
|
378
|
+
function modelDir(model) {
|
|
379
|
+
if (!HF_MODEL_ID.test(model)) return model;
|
|
380
|
+
return (0, _nodepath.join)(cacheRoot(), model.replace(/\//g, '--'));
|
|
381
|
+
}
|
|
382
|
+
function hasModelFiles(model) {
|
|
383
|
+
var dir = modelDir(model);
|
|
384
|
+
return MODEL_FILES.every(function(file) {
|
|
385
|
+
return (0, _nodefs.existsSync)((0, _nodepath.join)(dir, file));
|
|
386
|
+
});
|
|
387
|
+
}
|
|
388
|
+
function modelPresent(cfg) {
|
|
389
|
+
var e = (0, _configts.embedConfig)(cfg);
|
|
390
|
+
if (!e) return false;
|
|
391
|
+
return e.type === 'api' || hasModelFiles(e.model);
|
|
392
|
+
}
|
|
341
393
|
function fetchToFile(url, dest) {
|
|
342
394
|
return fetch(url).then(function(res) {
|
|
343
395
|
return _async_to_generator(function() {
|
|
@@ -369,9 +421,92 @@ function fetchToFile(url, dest) {
|
|
|
369
421
|
})();
|
|
370
422
|
});
|
|
371
423
|
}
|
|
424
|
+
function downloadModel(model, onFile) {
|
|
425
|
+
return _async_to_generator(function() {
|
|
426
|
+
var dir, _iteratorNormalCompletion, _didIteratorError, _iteratorError, _iterator, _step, file, err;
|
|
427
|
+
return _ts_generator(this, function(_state) {
|
|
428
|
+
switch(_state.label){
|
|
429
|
+
case 0:
|
|
430
|
+
if (!isDownloadable(model)) {
|
|
431
|
+
throw new _errorsts.SenseError('EMBED_MODEL', 'embed.model "'.concat(model, '" is a local path, not a Hugging Face model id, so there is nothing to download; put model.safetensors and tokenizer.json in that directory, or name a model id like "minishlab/potion-retrieval-32M"'));
|
|
432
|
+
}
|
|
433
|
+
dir = modelDir(model);
|
|
434
|
+
(0, _nodefs.mkdirSync)(dir, {
|
|
435
|
+
recursive: true
|
|
436
|
+
});
|
|
437
|
+
_iteratorNormalCompletion = true, _didIteratorError = false, _iteratorError = undefined;
|
|
438
|
+
_state.label = 1;
|
|
439
|
+
case 1:
|
|
440
|
+
_state.trys.push([
|
|
441
|
+
1,
|
|
442
|
+
6,
|
|
443
|
+
7,
|
|
444
|
+
8
|
|
445
|
+
]);
|
|
446
|
+
_iterator = MODEL_FILES[Symbol.iterator]();
|
|
447
|
+
_state.label = 2;
|
|
448
|
+
case 2:
|
|
449
|
+
if (!!(_iteratorNormalCompletion = (_step = _iterator.next()).done)) return [
|
|
450
|
+
3,
|
|
451
|
+
5
|
|
452
|
+
];
|
|
453
|
+
file = _step.value;
|
|
454
|
+
if ((0, _nodefs.existsSync)((0, _nodepath.join)(dir, file))) return [
|
|
455
|
+
3,
|
|
456
|
+
4
|
|
457
|
+
];
|
|
458
|
+
onFile === null || onFile === void 0 ? void 0 : onFile(file, dir);
|
|
459
|
+
return [
|
|
460
|
+
4,
|
|
461
|
+
fetchToFile("https://huggingface.co/".concat(model, "/resolve/main/").concat(file), (0, _nodepath.join)(dir, file))
|
|
462
|
+
];
|
|
463
|
+
case 3:
|
|
464
|
+
_state.sent();
|
|
465
|
+
_state.label = 4;
|
|
466
|
+
case 4:
|
|
467
|
+
_iteratorNormalCompletion = true;
|
|
468
|
+
return [
|
|
469
|
+
3,
|
|
470
|
+
2
|
|
471
|
+
];
|
|
472
|
+
case 5:
|
|
473
|
+
return [
|
|
474
|
+
3,
|
|
475
|
+
8
|
|
476
|
+
];
|
|
477
|
+
case 6:
|
|
478
|
+
err = _state.sent();
|
|
479
|
+
_didIteratorError = true;
|
|
480
|
+
_iteratorError = err;
|
|
481
|
+
return [
|
|
482
|
+
3,
|
|
483
|
+
8
|
|
484
|
+
];
|
|
485
|
+
case 7:
|
|
486
|
+
try {
|
|
487
|
+
if (!_iteratorNormalCompletion && _iterator.return != null) {
|
|
488
|
+
_iterator.return();
|
|
489
|
+
}
|
|
490
|
+
} finally{
|
|
491
|
+
if (_didIteratorError) {
|
|
492
|
+
throw _iteratorError;
|
|
493
|
+
}
|
|
494
|
+
}
|
|
495
|
+
return [
|
|
496
|
+
7
|
|
497
|
+
];
|
|
498
|
+
case 8:
|
|
499
|
+
return [
|
|
500
|
+
2,
|
|
501
|
+
dir
|
|
502
|
+
];
|
|
503
|
+
}
|
|
504
|
+
});
|
|
505
|
+
})();
|
|
506
|
+
}
|
|
372
507
|
function staticProvider(model) {
|
|
373
508
|
return _async_to_generator(function() {
|
|
374
|
-
var _ref, _tokenizerJson_model, _tokenizerJson_model_vocab, _tokenizerJson_model1, dir,
|
|
509
|
+
var _ref, _tokenizerJson_model, _tokenizerJson_model_vocab, _tokenizerJson_model1, dir, _iteratorNormalCompletion, _didIteratorError, _iteratorError, _iterator, _step, file, fix, raw, headerLen, header, entry, spec, dims, dataStart, matrix, tokenizerJson, Tokenizer, tok, unkId;
|
|
375
510
|
function one(text) {
|
|
376
511
|
// The tokenizer yields undefined (not the unk id) for tokens outside the vocab; an
|
|
377
512
|
// undefined id would index the matrix at NaN and poison the whole mean-pool -- and the
|
|
@@ -416,45 +551,32 @@ function staticProvider(model) {
|
|
|
416
551
|
return _ts_generator(this, function(_state) {
|
|
417
552
|
switch(_state.label){
|
|
418
553
|
case 0:
|
|
419
|
-
dir = model;
|
|
420
|
-
|
|
421
|
-
|
|
422
|
-
|
|
423
|
-
|
|
424
|
-
|
|
425
|
-
|
|
426
|
-
|
|
427
|
-
|
|
428
|
-
|
|
429
|
-
|
|
430
|
-
|
|
431
|
-
|
|
432
|
-
|
|
433
|
-
|
|
434
|
-
|
|
435
|
-
|
|
436
|
-
|
|
437
|
-
|
|
438
|
-
|
|
439
|
-
|
|
440
|
-
|
|
441
|
-
|
|
442
|
-
|
|
443
|
-
|
|
444
|
-
|
|
445
|
-
4,
|
|
446
|
-
fetchToFile("https://huggingface.co/".concat(model, "/resolve/main/").concat(file), (0, _nodepath.join)(dir, file))
|
|
447
|
-
];
|
|
448
|
-
case 2:
|
|
449
|
-
_state.sent();
|
|
450
|
-
_state.label = 3;
|
|
451
|
-
case 3:
|
|
452
|
-
_i++;
|
|
453
|
-
return [
|
|
454
|
-
3,
|
|
455
|
-
1
|
|
456
|
-
];
|
|
457
|
-
case 4:
|
|
554
|
+
dir = modelDir(model);
|
|
555
|
+
_iteratorNormalCompletion = true, _didIteratorError = false, _iteratorError = undefined;
|
|
556
|
+
try {
|
|
557
|
+
for(_iterator = MODEL_FILES[Symbol.iterator](); !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true){
|
|
558
|
+
file = _step.value;
|
|
559
|
+
if (!(0, _nodefs.existsSync)((0, _nodepath.join)(dir, file))) {
|
|
560
|
+
// A local path the caller controls gets told what is missing where; only a repo id can
|
|
561
|
+
// be fixed by downloading.
|
|
562
|
+
fix = isDownloadable(model) ? 'run `sense download`' : "expected ".concat(MODEL_FILENAMES, " in that directory");
|
|
563
|
+
throw new _errorsts.SenseError('EMBED_MODEL_MISSING', "embed model ".concat(model, " is not available (looked in ").concat(dir, "); ").concat(fix));
|
|
564
|
+
}
|
|
565
|
+
}
|
|
566
|
+
} catch (err) {
|
|
567
|
+
_didIteratorError = true;
|
|
568
|
+
_iteratorError = err;
|
|
569
|
+
} finally{
|
|
570
|
+
try {
|
|
571
|
+
if (!_iteratorNormalCompletion && _iterator.return != null) {
|
|
572
|
+
_iterator.return();
|
|
573
|
+
}
|
|
574
|
+
} finally{
|
|
575
|
+
if (_didIteratorError) {
|
|
576
|
+
throw _iteratorError;
|
|
577
|
+
}
|
|
578
|
+
}
|
|
579
|
+
}
|
|
458
580
|
raw = (0, _nodefs.readFileSync)((0, _nodepath.join)(dir, 'model.safetensors'));
|
|
459
581
|
headerLen = Number(raw.readBigUInt64LE(0));
|
|
460
582
|
header = JSON.parse(raw.subarray(8, 8 + headerLen).toString('utf8'));
|
|
@@ -474,7 +596,7 @@ function staticProvider(model) {
|
|
|
474
596
|
return /*#__PURE__*/ _interop_require_wildcard(require("@huggingface/tokenizers"));
|
|
475
597
|
})
|
|
476
598
|
];
|
|
477
|
-
case
|
|
599
|
+
case 1:
|
|
478
600
|
Tokenizer = _state.sent().Tokenizer;
|
|
479
601
|
tok = new Tokenizer(tokenizerJson, {});
|
|
480
602
|
unkId = (_ref = (_tokenizerJson_model1 = tokenizerJson.model) === null || _tokenizerJson_model1 === void 0 ? void 0 : (_tokenizerJson_model_vocab = _tokenizerJson_model1.vocab) === null || _tokenizerJson_model_vocab === void 0 ? void 0 : _tokenizerJson_model_vocab[(_tokenizerJson_model = tokenizerJson.model) === null || _tokenizerJson_model === void 0 ? void 0 : _tokenizerJson_model.unk_token]) !== null && _ref !== void 0 ? _ref : -1;
|
|
@@ -573,7 +695,7 @@ var providers = new Map();
|
|
|
573
695
|
function getProvider(cfg) {
|
|
574
696
|
var _e_url;
|
|
575
697
|
var e = (0, _configts.embedConfig)(cfg);
|
|
576
|
-
if (!e) throw new _errorsts.SenseError('EMBED_DISABLED', '
|
|
698
|
+
if (!e) throw new _errorsts.SenseError('EMBED_DISABLED', 'this tree has no embedding model: add an "embed" block naming one to sense.config.json, then run `sense download`');
|
|
577
699
|
var sig = "".concat(e.type, ":").concat(e.model, ":").concat((_e_url = e.url) !== null && _e_url !== void 0 ? _e_url : '');
|
|
578
700
|
var p = providers.get(sig);
|
|
579
701
|
if (!p) {
|
|
@@ -683,7 +805,7 @@ function embedPending(db, cfg, baseDir) {
|
|
|
683
805
|
chunks = void 0;
|
|
684
806
|
try {
|
|
685
807
|
// presets/embed are irrelevant here -- re-deriving chunk text for a doc that already
|
|
686
|
-
// has embeddings rows means
|
|
808
|
+
// has embeddings rows means the tree had an embedding model at reconcile time.
|
|
687
809
|
chunks = (0, _scants.parseFile)({
|
|
688
810
|
relPath: path,
|
|
689
811
|
absPath: (0, _nodepath.join)(baseDir, path),
|
|
@@ -737,7 +859,7 @@ function embedPending(db, cfg, baseDir) {
|
|
|
737
859
|
}
|
|
738
860
|
}
|
|
739
861
|
update = db.prepare('UPDATE embeddings SET scale = ?, vector = ? WHERE "path" = ? AND chunk = ?');
|
|
740
|
-
// The lazy build is the one long silence a first
|
|
862
|
+
// The lazy build is the one long silence a first search hits (measured 23s at
|
|
741
863
|
// 26k notes); progress makes it distinguishable from a hang.
|
|
742
864
|
report = (0, _progressts.progress)('embedding chunks', jobs.length);
|
|
743
865
|
i = 0;
|
|
@@ -857,4 +979,76 @@ function semanticCandidates(db, cfg, terms, fetch1) {
|
|
|
857
979
|
});
|
|
858
980
|
})();
|
|
859
981
|
}
|
|
982
|
+
function similarNotes(db, _cfg, path, opts) {
|
|
983
|
+
// Cost is target_chunks x stored_chunks, so a heading-dense seed multiplies a full-corpus
|
|
984
|
+
// scan (12.7s at 201 chunks/note). Sample evenly, so late sections still get a vote.
|
|
985
|
+
var targetRows = db.prepare('SELECT scale, vector FROM embeddings WHERE "path" = ? AND vector IS NOT NULL ORDER BY chunk').all(path);
|
|
986
|
+
if (targetRows.length === 0) return [];
|
|
987
|
+
var step = Math.max(1, Math.ceil(targetRows.length / TARGET_CHUNK_CAP));
|
|
988
|
+
var target = targetRows.filter(function(_, i) {
|
|
989
|
+
return i % step === 0;
|
|
990
|
+
}).map(function(row) {
|
|
991
|
+
return {
|
|
992
|
+
v: new Int8Array(row.vector.buffer, row.vector.byteOffset, row.vector.byteLength),
|
|
993
|
+
scale: row.scale
|
|
994
|
+
};
|
|
995
|
+
});
|
|
996
|
+
var rows = db.prepare('SELECT "path", scale, vector FROM embeddings WHERE vector IS NOT NULL').all();
|
|
997
|
+
var best = new Map();
|
|
998
|
+
var _iteratorNormalCompletion = true, _didIteratorError = false, _iteratorError = undefined;
|
|
999
|
+
try {
|
|
1000
|
+
for(var _iterator = rows[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true){
|
|
1001
|
+
var row = _step.value;
|
|
1002
|
+
if (row.path === path || opts.exclude.has(row.path) || opts.allowed && !opts.allowed.has(row.path)) continue;
|
|
1003
|
+
var other = new Int8Array(row.vector.buffer, row.vector.byteOffset, row.vector.byteLength);
|
|
1004
|
+
var _iteratorNormalCompletion1 = true, _didIteratorError1 = false, _iteratorError1 = undefined;
|
|
1005
|
+
try {
|
|
1006
|
+
for(var _iterator1 = target[Symbol.iterator](), _step1; !(_iteratorNormalCompletion1 = (_step1 = _iterator1.next()).done); _iteratorNormalCompletion1 = true){
|
|
1007
|
+
var t = _step1.value;
|
|
1008
|
+
var dot = 0;
|
|
1009
|
+
var len = Math.min(t.v.length, other.length);
|
|
1010
|
+
for(var d = 0; d < len; d++)dot += t.v[d] * other[d];
|
|
1011
|
+
var score = dot * t.scale * row.scale;
|
|
1012
|
+
var existing = best.get(row.path);
|
|
1013
|
+
if (existing === undefined || score > existing) best.set(row.path, score);
|
|
1014
|
+
}
|
|
1015
|
+
} catch (err) {
|
|
1016
|
+
_didIteratorError1 = true;
|
|
1017
|
+
_iteratorError1 = err;
|
|
1018
|
+
} finally{
|
|
1019
|
+
try {
|
|
1020
|
+
if (!_iteratorNormalCompletion1 && _iterator1.return != null) {
|
|
1021
|
+
_iterator1.return();
|
|
1022
|
+
}
|
|
1023
|
+
} finally{
|
|
1024
|
+
if (_didIteratorError1) {
|
|
1025
|
+
throw _iteratorError1;
|
|
1026
|
+
}
|
|
1027
|
+
}
|
|
1028
|
+
}
|
|
1029
|
+
}
|
|
1030
|
+
} catch (err) {
|
|
1031
|
+
_didIteratorError = true;
|
|
1032
|
+
_iteratorError = err;
|
|
1033
|
+
} finally{
|
|
1034
|
+
try {
|
|
1035
|
+
if (!_iteratorNormalCompletion && _iterator.return != null) {
|
|
1036
|
+
_iterator.return();
|
|
1037
|
+
}
|
|
1038
|
+
} finally{
|
|
1039
|
+
if (_didIteratorError) {
|
|
1040
|
+
throw _iteratorError;
|
|
1041
|
+
}
|
|
1042
|
+
}
|
|
1043
|
+
}
|
|
1044
|
+
return _to_consumable_array(best.entries()).sort(function(a, b) {
|
|
1045
|
+
return b[1] - a[1];
|
|
1046
|
+
}).slice(0, opts.k).map(function(param) {
|
|
1047
|
+
var _param = _sliced_to_array(param, 2), p = _param[0], score = _param[1];
|
|
1048
|
+
return {
|
|
1049
|
+
path: p,
|
|
1050
|
+
similarity: Math.round(score * 1000) / 1000
|
|
1051
|
+
};
|
|
1052
|
+
});
|
|
1053
|
+
}
|
|
860
1054
|
/* CJS INTEROP */ if (exports.__esModule && exports.default) { try { Object.defineProperty(exports.default, '__esModule', { value: true }); for (var key in exports) { exports.default[key] = exports[key]; } } catch (_) {}; module.exports = exports.default; }
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"sources":["/Users/kevin/Dev/OpenSource/ai/sensemaking/src/features/embed.ts"],"sourcesContent":["import { existsSync, mkdirSync, readFileSync, renameSync, writeFileSync } from 'node:fs';\nimport { homedir } from 'node:os';\nimport { join } from 'node:path';\nimport type { DatabaseSync } from 'node:sqlite';\nimport type { Config, ResolvedConfig } from '../config.ts';\nimport { embedConfig } from '../config.ts';\nimport { SenseError } from '../errors.ts';\nimport { progress } from '../progress.ts';\nimport { parseFile } from '../scan.ts';\nimport type { Feature } from './types.ts';\n\n// embeddings(path, chunk, start_line, end_line, scale, vector): heading-based chunks,\n// int8 vectors with a per-vector dequantization scale, vector NULL = not yet embedded.\n// Reconcile stores dirty rows inside its transaction; embedding tops up on the next\n// semantic query (embedPending), so staleness costs recall, never correctness.\n\n// Storage lever fixed by the bake-off (BENCHMARKING.md): int8 at 256 dims is\n// quality-free vs f32-512 when fused. Queries stay f32 at the same dims.\nconst STORE_DIMS = 256;\nconst BATCH = 64;\n\nexport interface EmbedProvider {\n id: string; // model identity; participates in the cache key, change -> re-embed\n dims: number;\n embed(texts: string[]): Promise<Float32Array[]>;\n}\n\ninterface Chunk {\n startLine: number;\n endLine: number;\n text: string;\n}\n\n// Deterministic chunker used at reconcile (line ranges stored) and at embed time (text\n// re-derived from the file -- chunk text is never stored). Heading-delimited with the\n// preamble kept; whole file when no headings. The title/summary prefix mirrors the\n// bm25 column weighting.\nfunction chunksOf(raw: string, search?: { title: string; summary: string }): Chunk[] {\n const lines = raw.split('\\n');\n const starts: number[] = [];\n let inFence = false;\n for (let i = 0; i < lines.length; i++) {\n if (/^(```|~~~)/.test(lines[i])) {\n inFence = !inFence;\n continue;\n }\n if (!inFence && /^#{1,6} +/.test(lines[i])) starts.push(i + 1);\n }\n const bounds = starts.length === 0 ? [1] : starts[0] > 1 ? [1, ...starts] : starts;\n const prefix = [search?.title, search?.summary].filter(Boolean).join('\\n');\n const chunks: Chunk[] = [];\n bounds.forEach((start, i) => {\n const end = i + 1 < bounds.length ? bounds[i + 1] - 1 : lines.length;\n const text = lines\n .slice(start - 1, end)\n .join('\\n')\n .trim();\n if (text.length > 0) chunks.push({ startLine: start, endLine: end, text: prefix ? `${prefix}\\n${text}` : text });\n });\n return chunks;\n}\n\nexport const embed: Feature = {\n name: 'embed',\n schema(db) {\n db.exec(`CREATE TABLE IF NOT EXISTS embeddings (\"path\" TEXT, chunk INTEGER, start_line INTEGER, end_line INTEGER, scale REAL, vector BLOB, PRIMARY KEY (\"path\", chunk))`);\n },\n extract(raw, _body, search) {\n return chunksOf(raw, search);\n },\n remove(db, path) {\n db.prepare('DELETE FROM embeddings WHERE \"path\" = ?').run(path);\n },\n // A doc covered only by semantic-false presets never had extract() run for it (db.ts's\n // per-file filter skips it), so extracted is undefined here -- store nothing, i.e. no rows.\n store(db, path, extracted) {\n if (!extracted) return;\n const insert = db.prepare('INSERT INTO embeddings (\"path\", chunk, start_line, end_line, scale, vector) VALUES (?, ?, ?, ?, NULL, NULL)');\n (extracted as Chunk[]).forEach((c, idx) => insert.run(path, idx, c.startLine, c.endLine));\n },\n enabledForFile(_cfg, file) {\n return file.embed;\n },\n};\n\n// --- static type: Model2Vec safetensors + pure-JS tokenizer, model cached in ~/.cache ---\n// Encode convention from model2vec/model.py: no special tokens, drop unk ids, mean-pool,\n// L2-normalize.\n\nfunction fetchToFile(url: string, dest: string): Promise<void> {\n return fetch(url).then(async (res) => {\n if (!res.ok) throw new SenseError('EMBED_MODEL', `model download failed: ${url} -> HTTP ${res.status}`);\n writeFileSync(`${dest}.part`, Buffer.from(await res.arrayBuffer()));\n renameSync(`${dest}.part`, dest);\n });\n}\n\nasync function staticProvider(model: string): Promise<EmbedProvider> {\n let dir = model;\n if (!existsSync(join(dir, 'model.safetensors'))) {\n dir = join(homedir(), '.cache', 'sensemaking', 'models', model.replace(/\\//g, '--'));\n mkdirSync(dir, { recursive: true });\n for (const file of ['model.safetensors', 'tokenizer.json']) {\n if (!existsSync(join(dir, file))) {\n console.error(`fetching ${model}/${file} into ${dir} (once; delete to refetch)`);\n await fetchToFile(`https://huggingface.co/${model}/resolve/main/${file}`, join(dir, file));\n }\n }\n }\n\n const raw = readFileSync(join(dir, 'model.safetensors'));\n const headerLen = Number(raw.readBigUInt64LE(0));\n const header = JSON.parse(raw.subarray(8, 8 + headerLen).toString('utf8')) as Record<string, { dtype: string; shape: number[]; data_offsets: number[] }>;\n const entry = Object.entries(header).find(([k]) => k !== '__metadata__');\n if (!entry || entry[1].dtype !== 'F32') throw new SenseError('EMBED_MODEL', `${model}: expected an F32 safetensors matrix`);\n const spec = entry[1];\n const dims = spec.shape[1];\n const dataStart = raw.byteOffset + 8 + headerLen + spec.data_offsets[0];\n const matrix = dataStart % 4 === 0 ? new Float32Array(raw.buffer, dataStart, spec.shape[0] * dims) : new Float32Array(raw.buffer.slice(dataStart, dataStart + spec.shape[0] * dims * 4));\n\n const tokenizerJson = JSON.parse(readFileSync(join(dir, 'tokenizer.json'), 'utf8'));\n // Lazy import: the tokenizer loads only on the semantic path, never at CLI startup.\n const { Tokenizer } = await import('@huggingface/tokenizers');\n const tok = new Tokenizer(tokenizerJson, {});\n const unkId = tokenizerJson.model?.vocab?.[tokenizerJson.model?.unk_token] ?? -1;\n\n function one(text: string): Float32Array {\n // The tokenizer yields undefined (not the unk id) for tokens outside the vocab; an\n // undefined id would index the matrix at NaN and poison the whole mean-pool -- and the\n // int8 conversion then stores the NaN vector as all zeros, silently. Keep integers only.\n const ids = (tok.encode(text, { add_special_tokens: false }).ids as number[]).filter((id) => Number.isInteger(id) && id !== unkId);\n const v = new Float32Array(dims);\n if (ids.length === 0) return v;\n for (const id of ids) {\n const off = id * dims;\n for (let d = 0; d < dims; d++) v[d] += matrix[off + d];\n }\n let norm = 0;\n for (let d = 0; d < dims; d++) {\n v[d] /= ids.length;\n norm += v[d] * v[d];\n }\n norm = Math.sqrt(norm) + 1e-32;\n for (let d = 0; d < dims; d++) v[d] /= norm;\n return v;\n }\n\n return { id: `static:${model}`, dims, embed: async (texts) => texts.map(one) };\n}\n\n// --- api type: one POST against any OpenAI-compatible /embeddings endpoint ---\n\nasync function apiProvider(model: string, url: string | undefined, keyEnv: string | undefined): Promise<EmbedProvider> {\n if (!url) throw new SenseError('EMBED_MODEL', 'features.embed.type \"api\" requires a url');\n const base = url.replace(/\\/+$/, '');\n const headers: Record<string, string> = { 'content-type': 'application/json' };\n const key = keyEnv ? process.env[keyEnv] : undefined;\n if (key) headers.authorization = `Bearer ${key}`;\n\n async function post(texts: string[]): Promise<Float32Array[]> {\n const res = await fetch(`${base}/embeddings`, { method: 'POST', headers, body: JSON.stringify({ model, input: texts }) });\n if (!res.ok) throw new SenseError('EMBED_MODEL', `${base}/embeddings -> HTTP ${res.status}`);\n const body = (await res.json()) as { data: Array<{ embedding: number[] }> };\n return body.data.map((d) => Float32Array.from(d.embedding));\n }\n\n const dims = (await post(['dimension probe']))[0].length;\n return { id: `api:${base}:${model}`, dims, embed: post };\n}\n\nconst providers = new Map<string, Promise<EmbedProvider>>();\n\nfunction getProvider(cfg: Config): Promise<EmbedProvider> {\n const e = embedConfig(cfg);\n if (!e) throw new SenseError('EMBED_DISABLED', 'semantic search needs at least one preset with vectors on (semantic !== false); every declared preset in sense.config.json has \"semantic\": false');\n const sig = `${e.type}:${e.model}:${e.url ?? ''}`;\n let p = providers.get(sig);\n if (!p) {\n p = e.type === 'api' ? apiProvider(e.model, e.url, e.key) : staticProvider(e.model);\n providers.set(sig, p);\n }\n return p;\n}\n\n// Slice + re-normalize (Matryoshka); optionally round through int8 storage.\nfunction toStore(full: Float32Array, dims: number, int8: boolean): { v: Float32Array; scale: number } {\n const v = new Float32Array(dims);\n let norm = 0;\n for (let d = 0; d < dims; d++) norm += full[d] * full[d];\n norm = Math.sqrt(norm) + 1e-32;\n for (let d = 0; d < dims; d++) v[d] = full[d] / norm;\n if (!int8) return { v, scale: 1 };\n let max = 0;\n for (let d = 0; d < dims; d++) max = Math.max(max, Math.abs(v[d]));\n return { v, scale: max / 127 || 1 };\n}\n\n// Embed rows whose vector is NULL, re-deriving chunk text from the files through the\n// same parse + chunker that stored the rows.\nexport async function embedPending(db: DatabaseSync, cfg: Config, baseDir: string): Promise<void> {\n const provider = await getProvider(cfg); // throws EMBED_DISABLED before touching the table\n const dirty = db.prepare('SELECT \"path\", chunk FROM embeddings WHERE vector IS NULL ORDER BY \"path\", chunk').all() as Array<{ path: string; chunk: number }>;\n if (dirty.length === 0) return;\n const storeDims = Math.min(STORE_DIMS, provider.dims);\n\n const byPath = new Map<string, number[]>();\n for (const row of dirty) {\n const list = byPath.get(row.path) ?? [];\n list.push(row.chunk);\n byPath.set(row.path, list);\n }\n\n const jobs: Array<{ path: string; chunk: number; text: string }> = [];\n for (const [path, chunkIdxs] of byPath) {\n let chunks: Chunk[];\n try {\n // presets/embed are irrelevant here -- re-deriving chunk text for a doc that already\n // has embeddings rows means it was covered by a semantic-on preset at reconcile time.\n chunks = parseFile({ relPath: path, absPath: join(baseDir, path), mtimeMs: 0, size: 0, presets: [], embed: true }, [embed]).doc.extracted.embed as Chunk[];\n } catch {\n continue; // vanished since reconcile; the next reconcile removes its rows\n }\n for (const idx of chunkIdxs) if (chunks[idx]) jobs.push({ path, chunk: idx, text: chunks[idx].text });\n }\n\n const update = db.prepare('UPDATE embeddings SET scale = ?, vector = ? WHERE \"path\" = ? AND chunk = ?');\n // The lazy build is the one long silence a first --semantic query hits (measured 23s at\n // 26k notes); progress makes it distinguishable from a hang.\n const report = progress('embedding chunks', jobs.length);\n for (let i = 0; i < jobs.length; i += BATCH) {\n const batch = jobs.slice(i, i + BATCH);\n const vectors = await provider.embed(batch.map((j) => j.text));\n db.exec('BEGIN');\n try {\n batch.forEach((job, j) => {\n const { v, scale } = toStore(vectors[j], storeDims, true);\n const q = new Int8Array(storeDims);\n for (let d = 0; d < storeDims; d++) q[d] = Math.round(v[d] / scale);\n update.run(scale, Buffer.from(q.buffer), job.path, job.chunk);\n });\n db.exec('COMMIT');\n } catch (err) {\n db.exec('ROLLBACK');\n throw err;\n }\n report.tick(Math.min(i + BATCH, jobs.length));\n }\n report.finish();\n}\n\n// Top candidates by cosine for a semantic find: best chunk per file, its line range\n// riding along. FTS5 operators in the terms are lexical syntax, not meaning -- stripped\n// before embedding.\n// Returns the cosine similarity alongside each candidate: stored and query vectors are both\n// L2-normalised before quantisation, so the dot product is cosine in [-1, 1]. `find` surfaces\n// it because the fused rank score cannot express match quality -- nearest-neighbour search\n// always returns a nearest neighbour, so without a magnitude an agent cannot tell a real hit\n// from the best of a bad lot.\nexport async function semanticCandidates(db: DatabaseSync, cfg: Config, terms: string, fetch: number): Promise<Array<{ path: string; lines: string; similarity: number }>> {\n const baseDir = (cfg as Partial<ResolvedConfig>).baseDir;\n if (!baseDir) throw new SenseError('EMBED_MODEL', 'semantic expansion needs a config with baseDir (use loadConfig/open)');\n await embedPending(db, cfg, baseDir);\n\n const provider = await getProvider(cfg);\n const storeDims = Math.min(STORE_DIMS, provider.dims);\n const text = (terms.match(/[\\p{L}\\p{N}]+/gu) ?? []).filter((t) => !['AND', 'OR', 'NOT', 'NEAR'].includes(t)).join(' ');\n const { v: qv } = toStore((await provider.embed([text]))[0], storeDims, false);\n\n const rows = db.prepare('SELECT \"path\", start_line, end_line, scale, vector FROM embeddings WHERE vector IS NOT NULL').all() as Array<{\n path: string;\n start_line: number;\n end_line: number;\n scale: number;\n vector: Uint8Array;\n }>;\n\n const best = new Map<string, { score: number; lines: string }>();\n for (const row of rows) {\n const q = new Int8Array(row.vector.buffer, row.vector.byteOffset, Math.min(storeDims, row.vector.byteLength));\n let dot = 0;\n for (let d = 0; d < q.length; d++) dot += q[d] * qv[d];\n const score = dot * row.scale;\n const existing = best.get(row.path);\n if (!existing || score > existing.score) best.set(row.path, { score, lines: `L${row.start_line}-${row.end_line}` });\n }\n return [...best.entries()]\n .sort((a, b) => b[1].score - a[1].score)\n .slice(0, fetch)\n .map(([path, b]) => ({ path, lines: b.lines, similarity: Math.round(b.score * 1000) / 1000 }));\n}\n"],"names":["embed","embedPending","semanticCandidates","STORE_DIMS","BATCH","chunksOf","raw","search","lines","split","starts","inFence","i","length","test","push","bounds","prefix","title","summary","filter","Boolean","join","chunks","forEach","start","end","text","slice","trim","startLine","endLine","name","schema","db","exec","extract","_body","remove","path","prepare","run","store","extracted","insert","c","idx","enabledForFile","_cfg","file","fetchToFile","url","dest","fetch","then","res","ok","SenseError","status","Buffer","from","arrayBuffer","writeFileSync","renameSync","staticProvider","model","tokenizerJson","dir","headerLen","header","entry","spec","dims","dataStart","matrix","Tokenizer","tok","unkId","one","ids","encode","add_special_tokens","id","Number","isInteger","v","Float32Array","off","d","norm","Math","sqrt","existsSync","homedir","replace","mkdirSync","recursive","console","error","readFileSync","readBigUInt64LE","JSON","parse","subarray","toString","Object","entries","find","k","dtype","shape","byteOffset","data_offsets","buffer","vocab","unk_token","texts","map","apiProvider","keyEnv","base","headers","key","post","body","method","stringify","input","json","data","embedding","process","env","undefined","authorization","providers","Map","getProvider","cfg","e","embedConfig","sig","type","p","get","set","toStore","full","int8","scale","max","abs","baseDir","provider","dirty","storeDims","byPath","row","list","jobs","chunkIdxs","update","report","batch","vectors","j","job","q","Int8Array","round","chunk","err","tick","min","all","parseFile","relPath","absPath","mtimeMs","size","presets","doc","progress","finish","terms","qv","rows","best","dot","score","existing","match","t","includes","vector","byteLength","start_line","end_line","sort","a","b","similarity"],"mappings":";;;;;;;;;;;QA8DaA;eAAAA;;QAyISC;eAAAA;;QA2DAC;eAAAA;;;sBAlQyD;sBACvD;wBACH;wBAGO;wBACD;0BACF;sBACC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAG1B,sFAAsF;AACtF,uFAAuF;AACvF,oFAAoF;AACpF,+EAA+E;AAE/E,6EAA6E;AAC7E,yEAAyE;AACzE,IAAMC,aAAa;AACnB,IAAMC,QAAQ;AAcd,uFAAuF;AACvF,sFAAsF;AACtF,mFAAmF;AACnF,yBAAyB;AACzB,SAASC,SAASC,GAAW,EAAEC,MAA2C;IACxE,IAAMC,QAAQF,IAAIG,KAAK,CAAC;IACxB,IAAMC,SAAmB,EAAE;IAC3B,IAAIC,UAAU;IACd,IAAK,IAAIC,IAAI,GAAGA,IAAIJ,MAAMK,MAAM,EAAED,IAAK;QACrC,IAAI,aAAaE,IAAI,CAACN,KAAK,CAACI,EAAE,GAAG;YAC/BD,UAAU,CAACA;YACX;QACF;QACA,IAAI,CAACA,WAAW,YAAYG,IAAI,CAACN,KAAK,CAACI,EAAE,GAAGF,OAAOK,IAAI,CAACH,IAAI;IAC9D;IACA,IAAMI,SAASN,OAAOG,MAAM,KAAK,IAAI;QAAC;KAAE,GAAGH,MAAM,CAAC,EAAE,GAAG,IAAI;QAAC;KAAa,CAAd,OAAI,qBAAGA,WAAUA;IAC5E,IAAMO,SAAS;QAACV,mBAAAA,6BAAAA,OAAQW,KAAK;QAAEX,mBAAAA,6BAAAA,OAAQY,OAAO;KAAC,CAACC,MAAM,CAACC,SAASC,IAAI,CAAC;IACrE,IAAMC,SAAkB,EAAE;IAC1BP,OAAOQ,OAAO,CAAC,SAACC,OAAOb;QACrB,IAAMc,MAAMd,IAAI,IAAII,OAAOH,MAAM,GAAGG,MAAM,CAACJ,IAAI,EAAE,GAAG,IAAIJ,MAAMK,MAAM;QACpE,IAAMc,OAAOnB,MACVoB,KAAK,CAACH,QAAQ,GAAGC,KACjBJ,IAAI,CAAC,MACLO,IAAI;QACP,IAAIF,KAAKd,MAAM,GAAG,GAAGU,OAAOR,IAAI,CAAC;YAAEe,WAAWL;YAAOM,SAASL;YAAKC,MAAMV,SAAS,AAAC,GAAaU,OAAXV,QAAO,MAAS,OAALU,QAASA;QAAK;IAChH;IACA,OAAOJ;AACT;AAEO,IAAMvB,QAAiB;IAC5BgC,MAAM;IACNC,QAAAA,SAAAA,OAAOC,EAAE;QACPA,GAAGC,IAAI,CAAC;IACV;IACAC,SAAAA,SAAAA,QAAQ9B,GAAG,EAAE+B,KAAK,EAAE9B,MAAM;QACxB,OAAOF,SAASC,KAAKC;IACvB;IACA+B,QAAAA,SAAAA,OAAOJ,EAAE,EAAEK,IAAI;QACbL,GAAGM,OAAO,CAAC,2CAA2CC,GAAG,CAACF;IAC5D;IACA,uFAAuF;IACvF,4FAA4F;IAC5FG,OAAAA,SAAAA,MAAMR,EAAE,EAAEK,IAAI,EAAEI,SAAS;QACvB,IAAI,CAACA,WAAW;QAChB,IAAMC,SAASV,GAAGM,OAAO,CAAC;QACzBG,UAAsBnB,OAAO,CAAC,SAACqB,GAAGC;mBAAQF,OAAOH,GAAG,CAACF,MAAMO,KAAKD,EAAEf,SAAS,EAAEe,EAAEd,OAAO;;IACzF;IACAgB,gBAAAA,SAAAA,eAAeC,IAAI,EAAEC,IAAI;QACvB,OAAOA,KAAKjD,KAAK;IACnB;AACF;AAEA,2FAA2F;AAC3F,yFAAyF;AACzF,gBAAgB;AAEhB,SAASkD,YAAYC,GAAW,EAAEC,IAAY;IAC5C,OAAOC,MAAMF,KAAKG,IAAI,CAAC,SAAOC;;;;;;wBAC5B,IAAI,CAACA,IAAIC,EAAE,EAAE,MAAM,IAAIC,oBAAU,CAAC,eAAe,AAAC,0BAAwCF,OAAfJ,KAAI,aAAsB,OAAXI,IAAIG,MAAM;;4BACrF,GAAO,OAALN,MAAK;;4BAAQO,OAAOC,IAAI;wBAAC;;4BAAML,IAAIM,WAAW;;;wBAA/DC,qBAAa;4BAAiBH,QAAAA;gCAAY;;;wBAC1CI,IAAAA,kBAAU,EAAC,AAAC,GAAO,OAALX,MAAK,UAAQA;;;;;;QAC7B;;AACF;AAEA,SAAeY,eAAeC,KAAa;;kBA2BEC,sBAA7BA,4BAAAA,uBA1BVC,SAIiB,OAARlB,MAQP3C,KACA8D,WACAC,QACAC,OAEAC,MACAC,MACAC,WACAC,QAEAR,eAEES,WACFC,KACAC;QAEN,SAASC,IAAInD,IAAY;YACvB,mFAAmF;YACnF,uFAAuF;YACvF,yFAAyF;YACzF,IAAMoD,MAAM,AAACH,IAAII,MAAM,CAACrD,MAAM;gBAAEsD,oBAAoB;YAAM,GAAGF,GAAG,CAAc3D,MAAM,CAAC,SAAC8D;uBAAOC,OAAOC,SAAS,CAACF,OAAOA,OAAOL;;YAC5H,IAAMQ,IAAI,IAAIC,aAAad;YAC3B,IAAIO,IAAIlE,MAAM,KAAK,GAAG,OAAOwE;gBACxB,kCAAA,2BAAA;;gBAAL,QAAK,YAAYN,wBAAZ,SAAA,6BAAA,QAAA,yBAAA,iCAAiB;oBAAjB,IAAMG,KAAN;oBACH,IAAMK,MAAML,KAAKV;oBACjB,IAAK,IAAIgB,IAAI,GAAGA,IAAIhB,MAAMgB,IAAKH,CAAC,CAACG,EAAE,IAAId,MAAM,CAACa,MAAMC,EAAE;gBACxD;;gBAHK;gBAAA;;;yBAAA,6BAAA;wBAAA;;;wBAAA;8BAAA;;;;YAIL,IAAIC,OAAO;YACX,IAAK,IAAID,KAAI,GAAGA,KAAIhB,MAAMgB,KAAK;gBAC7BH,CAAC,CAACG,GAAE,IAAIT,IAAIlE,MAAM;gBAClB4E,QAAQJ,CAAC,CAACG,GAAE,GAAGH,CAAC,CAACG,GAAE;YACrB;YACAC,OAAOC,KAAKC,IAAI,CAACF,QAAQ;YACzB,IAAK,IAAID,KAAI,GAAGA,KAAIhB,MAAMgB,KAAKH,CAAC,CAACG,GAAE,IAAIC;YACvC,OAAOJ;QACT;;;;oBA/CIlB,MAAMF;yBACN,CAAC2B,IAAAA,kBAAU,EAACtE,IAAAA,cAAI,EAAC6C,KAAK,uBAAtB;;;;oBACFA,MAAM7C,IAAAA,cAAI,EAACuE,IAAAA,eAAO,KAAI,UAAU,eAAe,UAAU5B,MAAM6B,OAAO,CAAC,OAAO;oBAC9EC,IAAAA,iBAAS,EAAC5B,KAAK;wBAAE6B,WAAW;oBAAK;4BACd;wBAAC;wBAAqB;;;;+BAAtB;;;;oBAAR/C,OAAQ;yBACb,CAAC2C,IAAAA,kBAAU,EAACtE,IAAAA,cAAI,EAAC6C,KAAKlB,QAAtB;;;;oBACFgD,QAAQC,KAAK,CAAC,AAAC,YAAoBjD,OAATgB,OAAM,KAAgBE,OAAblB,MAAK,UAAY,OAAJkB,KAAI;oBACpD;;wBAAMjB,YAAY,AAAC,0BAA+CD,OAAtBgB,OAAM,kBAAqB,OAALhB,OAAQ3B,IAAAA,cAAI,EAAC6C,KAAKlB;;;oBAApF;;;;;;;;;oBAKA3C,MAAM6F,IAAAA,oBAAY,EAAC7E,IAAAA,cAAI,EAAC6C,KAAK;oBAC7BC,YAAYe,OAAO7E,IAAI8F,eAAe,CAAC;oBACvC/B,SAASgC,KAAKC,KAAK,CAAChG,IAAIiG,QAAQ,CAAC,GAAG,IAAInC,WAAWoC,QAAQ,CAAC;oBAC5DlC,QAAQmC,OAAOC,OAAO,CAACrC,QAAQsC,IAAI,CAAC;iEAAEC;+BAAOA,MAAM;;oBACzD,IAAI,CAACtC,SAASA,KAAK,CAAC,EAAE,CAACuC,KAAK,KAAK,OAAO,MAAM,IAAIpD,oBAAU,CAAC,eAAe,AAAC,GAAQ,OAANQ,OAAM;oBAC/EM,OAAOD,KAAK,CAAC,EAAE;oBACfE,OAAOD,KAAKuC,KAAK,CAAC,EAAE;oBACpBrC,YAAYnE,IAAIyG,UAAU,GAAG,IAAI3C,YAAYG,KAAKyC,YAAY,CAAC,EAAE;oBACjEtC,SAASD,YAAY,MAAM,IAAI,IAAIa,aAAahF,IAAI2G,MAAM,EAAExC,WAAWF,KAAKuC,KAAK,CAAC,EAAE,GAAGtC,QAAQ,IAAIc,aAAahF,IAAI2G,MAAM,CAACrF,KAAK,CAAC6C,WAAWA,YAAYF,KAAKuC,KAAK,CAAC,EAAE,GAAGtC,OAAO;oBAE/KN,gBAAgBmC,KAAKC,KAAK,CAACH,IAAAA,oBAAY,EAAC7E,IAAAA,cAAI,EAAC6C,KAAK,mBAAmB;oBAErD;;wBAAM;2EAAA,QAAO;;;;oBAA3BQ,YAAc,cAAdA;oBACFC,MAAM,IAAID,UAAUT,eAAe,CAAC;oBACpCW,iBAAQX,wBAAAA,cAAcD,KAAK,cAAnBC,6CAAAA,6BAAAA,sBAAqBgD,KAAK,cAA1BhD,iDAAAA,0BAA4B,EAACA,uBAAAA,cAAcD,KAAK,cAAnBC,2CAAAA,qBAAqBiD,SAAS,CAAC,uCAAI,CAAC;oBAuB/E;;wBAAO;4BAAEjC,IAAI,AAAC,UAAe,OAANjB;4BAASO,MAAAA;4BAAMxE,OAAO,SAAPA,MAAcoH;;;;;4CAAUA,MAAMC,GAAG,CAACvC;;;;;wBAAK;;;;IAC/E;;AAEA,gFAAgF;AAEhF,SAAewC,YAAYrD,KAAa,EAAEd,GAAuB,EAAEoE,MAA0B;;YAErFC,MACAC,SACAC,KAUAlD;QAPN,SAAemD,KAAKP,KAAe;;oBAC3B7D,KAEAqE;;;;4BAFM;;gCAAMvE,MAAM,AAAC,GAAO,OAALmE,MAAK,gBAAc;oCAAEK,QAAQ;oCAAQJ,SAAAA;oCAASG,MAAMvB,KAAKyB,SAAS,CAAC;wCAAE7D,OAAAA;wCAAO8D,OAAOX;oCAAM;gCAAG;;;4BAAjH7D,MAAM;4BACZ,IAAI,CAACA,IAAIC,EAAE,EAAE,MAAM,IAAIC,oBAAU,CAAC,eAAe,AAAC,GAA6BF,OAA3BiE,MAAK,wBAAiC,OAAXjE,IAAIG,MAAM;4BAC3E;;gCAAMH,IAAIyE,IAAI;;;4BAAtBJ,OAAQ;4BACd;;gCAAOA,KAAKK,IAAI,CAACZ,GAAG,CAAC,SAAC7B;2CAAMF,aAAa1B,IAAI,CAAC4B,EAAE0C,SAAS;;;;;YAC3D;;;;;oBAXA,IAAI,CAAC/E,KAAK,MAAM,IAAIM,oBAAU,CAAC,eAAe;oBACxC+D,OAAOrE,IAAI2C,OAAO,CAAC,QAAQ;oBAC3B2B,UAAkC;wBAAE,gBAAgB;oBAAmB;oBACvEC,MAAMH,SAASY,QAAQC,GAAG,CAACb,OAAO,GAAGc;oBAC3C,IAAIX,KAAKD,QAAQa,aAAa,GAAG,AAAC,UAAa,OAAJZ;oBAS7B;;wBAAMC;4BAAM;;;;oBAApBnD,OAAO,AAAC,aAAgC,CAAC,EAAE,CAAC3D,MAAM;oBACxD;;wBAAO;4BAAEqE,IAAI,AAAC,OAAcjB,OAARuD,MAAK,KAAS,OAANvD;4BAASO,MAAAA;4BAAMxE,OAAO2H;wBAAK;;;;IACzD;;AAEA,IAAMY,YAAY,IAAIC;AAEtB,SAASC,YAAYC,GAAW;QAGMC;IAFpC,IAAMA,IAAIC,IAAAA,qBAAW,EAACF;IACtB,IAAI,CAACC,GAAG,MAAM,IAAIlF,oBAAU,CAAC,kBAAkB;IAC/C,IAAMoF,MAAM,AA/Kd,AA+Ke,GAAYF,OAAVA,EAAEG,IAAI,EAAC,YAAGH,EAAE1E,KAAK,EAAC,KAAe,QAAZ0E,SAAAA,EAAExF,GAAG,cAALwF,oBAAAA,SAAS;IAC7C,IAAII,IAAIR,UAAUS,GAAG,CAACH;IACtB,IAAI,CAACE,GAAG;QACNA,IAAIJ,EAAEG,IAAI,KAAK,QAAQxB,YAAYqB,EAAE1E,KAAK,EAAE0E,EAAExF,GAAG,EAAEwF,EAAEjB,GAAG,IAAI1D,eAAe2E,EAAE1E,KAAK;QAClFsE,UAAUU,GAAG,CAACJ,KAAKE;IACrB;IACA,OAAOA;AACT;AAEA,4EAA4E;AAC5E,SAASG,QAAQC,IAAkB,EAAE3E,IAAY,EAAE4E,IAAa;IAC9D,IAAM/D,IAAI,IAAIC,aAAad;IAC3B,IAAIiB,OAAO;IACX,IAAK,IAAID,IAAI,GAAGA,IAAIhB,MAAMgB,IAAKC,QAAQ0D,IAAI,CAAC3D,EAAE,GAAG2D,IAAI,CAAC3D,EAAE;IACxDC,OAAOC,KAAKC,IAAI,CAACF,QAAQ;IACzB,IAAK,IAAID,KAAI,GAAGA,KAAIhB,MAAMgB,KAAKH,CAAC,CAACG,GAAE,GAAG2D,IAAI,CAAC3D,GAAE,GAAGC;IAChD,IAAI,CAAC2D,MAAM,OAAO;QAAE/D,GAAAA;QAAGgE,OAAO;IAAE;IAChC,IAAIC,MAAM;IACV,IAAK,IAAI9D,KAAI,GAAGA,KAAIhB,MAAMgB,KAAK8D,MAAM5D,KAAK4D,GAAG,CAACA,KAAK5D,KAAK6D,GAAG,CAAClE,CAAC,CAACG,GAAE;IAChE,OAAO;QAAEH,GAAAA;QAAGgE,OAAOC,MAAM,OAAO;IAAE;AACpC;AAIO,SAAerJ,aAAaiC,EAAgB,EAAEwG,GAAW,EAAEc,OAAe;;mBACzEC,UACAC,OAEAC,WAEAC,QACD,2BAAA,mBAAA,gBAAA,WAAA,OAAMC,KACID,aAAPE,MAKFC,MACD,4BAAA,oBAAA,iBAAA,YAAA,qBAAOxH,MAAMyH,WACZzI,QAQC,4BAAA,oBAAA,iBAAA,YAAA,QAAMuB,KAGPmH,QAGAC,QACGtJ;;;;;4BACDuJ,OACAC;;;;oCADAD,QAAQJ,KAAKnI,KAAK,CAAChB,GAAGA,IAAIR;oCAChB;;wCAAMqJ,SAASzJ,KAAK,CAACmK,MAAM9C,GAAG,CAAC,SAACgD;mDAAMA,EAAE1I,IAAI;;;;oCAAtDyI,UAAU;oCAChBlI,GAAGC,IAAI,CAAC;oCACR,IAAI;wCACFgI,MAAM3I,OAAO,CAAC,SAAC8I,KAAKD;4CAClB,IAAqBnB,WAAAA,QAAQkB,OAAO,CAACC,EAAE,EAAEV,WAAW,OAA5CtE,IAAa6D,SAAb7D,GAAGgE,QAAUH,SAAVG;4CACX,IAAMkB,IAAI,IAAIC,UAAUb;4CACxB,IAAK,IAAInE,IAAI,GAAGA,IAAImE,WAAWnE,IAAK+E,CAAC,CAAC/E,EAAE,GAAGE,KAAK+E,KAAK,CAACpF,CAAC,CAACG,EAAE,GAAG6D;4CAC7DY,OAAOxH,GAAG,CAAC4G,OAAO1F,OAAOC,IAAI,CAAC2G,EAAEtD,MAAM,GAAGqD,IAAI/H,IAAI,EAAE+H,IAAII,KAAK;wCAC9D;wCACAxI,GAAGC,IAAI,CAAC;oCACV,EAAE,OAAOwI,KAAK;wCACZzI,GAAGC,IAAI,CAAC;wCACR,MAAMwI;oCACR;oCACAT,OAAOU,IAAI,CAAClF,KAAKmF,GAAG,CAACjK,IAAIR,OAAO2J,KAAKlJ,MAAM;;;;;;oBAC7C;oBA9CiB;;wBAAM4H,YAAYC;;;oBAA7Be,WAAW;oBACXC,QAAQxH,GAAGM,OAAO,CAAC,oFAAoFsI,GAAG;oBAChH,IAAIpB,MAAM7I,MAAM,KAAK,GAAG;;;oBAClB8I,YAAYjE,KAAKmF,GAAG,CAAC1K,YAAYsJ,SAASjF,IAAI;oBAE9CoF,SAAS,IAAIpB;oBACd,kCAAA,2BAAA;;wBAAL,IAAK,YAAakB,4BAAb,6BAAA,QAAA,yBAAA,iCAAoB;4BAAdG,MAAN;;4BACGC,QAAOF,cAAAA,OAAOZ,GAAG,CAACa,IAAItH,IAAI,eAAnBqH,yBAAAA;4BACbE,KAAK/I,IAAI,CAAC8I,IAAIa,KAAK;4BACnBd,OAAOX,GAAG,CAACY,IAAItH,IAAI,EAAEuH;wBACvB;;wBAJK;wBAAA;;;iCAAA,6BAAA;gCAAA;;;gCAAA;sCAAA;;;;oBAMCC;oBACD,mCAAA,4BAAA;;wBAAL,IAAK,aAA2BH,6BAA3B,8BAAA,SAAA,0BAAA,kCAAmC;2DAAnC,kBAAOrH,uBAAMyH;4BACZzI,SAAAA,KAAAA;4BACJ,IAAI;gCACF,qFAAqF;gCACrF,sFAAsF;gCACtFA,SAASwJ,IAAAA,iBAAS,EAAC;oCAAEC,SAASzI;oCAAM0I,SAAS3J,IAAAA,cAAI,EAACkI,SAASjH;oCAAO2I,SAAS;oCAAGC,MAAM;oCAAGC,OAAO;oCAAMpL,OAAO;gCAAK;oCAAIA;mCAAQqL,GAAG,CAAC1I,SAAS,CAAC3C,KAAK;4BACjJ,EAAE,eAAM;gCACN,UAAU,gEAAgE;4BAC5E;4BACK,mCAAA,4BAAA;;gCAAL,IAAK,aAAagK,gCAAb,8BAAA,SAAA,0BAAA;oCAAMlH,MAAN;oCAAwB,IAAIvB,MAAM,CAACuB,IAAI,EAAEiH,KAAKhJ,IAAI,CAAC;wCAAEwB,MAAAA;wCAAMmI,OAAO5H;wCAAKnB,MAAMJ,MAAM,CAACuB,IAAI,CAACnB,IAAI;oCAAC;;;gCAA9F;gCAAA;;;yCAAA,8BAAA;wCAAA;;;wCAAA;8CAAA;;;;wBACP;;wBAVK;wBAAA;;;iCAAA,8BAAA;gCAAA;;;gCAAA;sCAAA;;;;oBAYCsI,SAAS/H,GAAGM,OAAO,CAAC;oBAC1B,wFAAwF;oBACxF,6DAA6D;oBACvD0H,SAASoB,IAAAA,oBAAQ,EAAC,oBAAoBvB,KAAKlJ,MAAM;oBAC9CD,IAAI;;;yBAAGA,CAAAA,IAAImJ,KAAKlJ,MAAM,AAAD;;;;;;;;;;;;oBAAGD,KAAKR;;;;;;oBAkBtC8J,OAAOqB,MAAM;;;;;;IACf;;AAUO,SAAerL,mBAAmBgC,EAAgB,EAAEwG,GAAW,EAAE8C,KAAa,EAAEnI,MAAa;;YAOpFmI,cANRhC,SAIAC,UACAE,WACAhI,MACYuH,UAAPuC,IAELC,MAQAC,MACD,2BAAA,mBAAA,gBAAA,WAAA,OAAM9B,KACHU,GACFqB,KACKpG,GACHqG,OACAC;;;;oBAvBFtC,UAAU,AAACd,IAAgCc,OAAO;oBACxD,IAAI,CAACA,SAAS,MAAM,IAAI/F,oBAAU,CAAC,eAAe;oBAClD;;wBAAMxD,aAAaiC,IAAIwG,KAAKc;;;oBAA5B;oBAEiB;;wBAAMf,YAAYC;;;oBAA7Be,WAAW;oBACXE,YAAYjE,KAAKmF,GAAG,CAAC1K,YAAYsJ,SAASjF,IAAI;oBAC9C7C,OAAO,EAAC6J,eAAAA,MAAMO,KAAK,CAAC,2naAAZP,0BAAAA,mBAAsCpK,MAAM,CAAC,SAAC4K;+BAAM,CAAC;4BAAC;4BAAO;4BAAM;4BAAO;yBAAO,CAACC,QAAQ,CAACD;uBAAI1K,IAAI,CAAC;oBACvF;;wBAAMmI,SAASzJ,KAAK;4BAAE2B;;;;oBAA/BuH,WAAAA;wBAAS,aAA6B,CAAC,EAAE;wBAAES;wBAAW;wBAA7D8B,KAAOvC,SAAV7D;oBAEFqG,OAAOxJ,GAAGM,OAAO,CAAC,+FAA+FsI,GAAG;oBAQpHa,OAAO,IAAInD;oBACZ,kCAAA,2BAAA;;wBAAL,IAAK,YAAakD,2BAAb,6BAAA,QAAA,yBAAA,iCAAmB;4BAAb7B,MAAN;4BACGU,IAAI,IAAIC,UAAUX,IAAIqC,MAAM,CAACjF,MAAM,EAAE4C,IAAIqC,MAAM,CAACnF,UAAU,EAAErB,KAAKmF,GAAG,CAAClB,WAAWE,IAAIqC,MAAM,CAACC,UAAU;4BACvGP,MAAM;4BACV,IAASpG,IAAI,GAAGA,IAAI+E,EAAE1J,MAAM,EAAE2E,IAAKoG,OAAOrB,CAAC,CAAC/E,EAAE,GAAGiG,EAAE,CAACjG,EAAE;4BAChDqG,QAAQD,MAAM/B,IAAIR,KAAK;4BACvByC,WAAWH,KAAK3C,GAAG,CAACa,IAAItH,IAAI;4BAClC,IAAI,CAACuJ,YAAYD,QAAQC,SAASD,KAAK,EAAEF,KAAK1C,GAAG,CAACY,IAAItH,IAAI,EAAE;gCAAEsJ,OAAAA;gCAAOrL,OAAO,AAAC,IAAqBqJ,OAAlBA,IAAIuC,UAAU,EAAC,KAAgB,OAAbvC,IAAIwC,QAAQ;4BAAG;wBACnH;;wBAPK;wBAAA;;;iCAAA,6BAAA;gCAAA;;;gCAAA;sCAAA;;;;oBAQL;;wBAAQ,qBAAGV,KAAKjF,OAAO,IACpB4F,IAAI,CAAC,SAACC,GAAGC;mCAAMA,CAAC,CAAC,EAAE,CAACX,KAAK,GAAGU,CAAC,CAAC,EAAE,CAACV,KAAK;2BACtCjK,KAAK,CAAC,GAAGyB,QACTgE,GAAG,CAAC;qEAAE9E,kBAAMiK;mCAAQ;gCAAEjK,MAAAA;gCAAM/B,OAAOgM,EAAEhM,KAAK;gCAAEiM,YAAY/G,KAAK+E,KAAK,CAAC+B,EAAEX,KAAK,GAAG,QAAQ;4BAAK;;;;;IAC/F"}
|
|
1
|
+
{"version":3,"sources":["/Users/kevin/Dev/OpenSource/ai/sensemaking/src/features/embed.ts"],"sourcesContent":["import { existsSync, mkdirSync, readFileSync, renameSync, writeFileSync } from 'node:fs';\nimport { homedir } from 'node:os';\nimport { join } from 'node:path';\nimport type { DatabaseSync } from 'node:sqlite';\nimport type { Config, ResolvedConfig } from '../config.ts';\nimport { embedConfig } from '../config.ts';\nimport { SenseError } from '../errors.ts';\nimport { progress } from '../progress.ts';\nimport { parseFile } from '../scan.ts';\nimport type { Feature } from './types.ts';\n\n// Heading-based chunks, int8 vectors with a per-vector scale, NULL vector = not yet embedded.\n// Reconcile writes dirty rows; embedding tops up on the next search, so staleness costs recall.\n\n// Storage lever fixed by the bake-off (BENCHMARKING.md): int8 at 256 dims is\n// quality-free vs f32-512 when fused. Queries stay f32 at the same dims.\nconst STORE_DIMS = 256;\n// Seed chunks that participate in a `related` scan; see similarNotes for the measurement.\nconst TARGET_CHUNK_CAP = 16;\nconst BATCH = 64;\n\nexport interface EmbedProvider {\n id: string; // model identity; participates in the cache key, change -> re-embed\n dims: number;\n embed(texts: string[]): Promise<Float32Array[]>;\n}\n\ninterface Chunk {\n startLine: number;\n endLine: number;\n text: string;\n}\n\n// Deterministic, so embed time can re-derive text from stored line ranges. Heading-delimited,\n// preamble kept, whole file when no headings; the title/summary prefix mirrors bm25 weighting.\nfunction chunksOf(raw: string, search?: { title: string; summary: string }): Chunk[] {\n const lines = raw.split('\\n');\n const starts: number[] = [];\n let inFence = false;\n for (let i = 0; i < lines.length; i++) {\n if (/^(```|~~~)/.test(lines[i])) {\n inFence = !inFence;\n continue;\n }\n if (!inFence && /^#{1,6} +/.test(lines[i])) starts.push(i + 1);\n }\n const bounds = starts.length === 0 ? [1] : starts[0] > 1 ? [1, ...starts] : starts;\n const prefix = [search?.title, search?.summary].filter(Boolean).join('\\n');\n const chunks: Chunk[] = [];\n bounds.forEach((start, i) => {\n const end = i + 1 < bounds.length ? bounds[i + 1] - 1 : lines.length;\n const text = lines\n .slice(start - 1, end)\n .join('\\n')\n .trim();\n if (text.length > 0) chunks.push({ startLine: start, endLine: end, text: prefix ? `${prefix}\\n${text}` : text });\n });\n return chunks;\n}\n\nexport const embed: Feature = {\n name: 'embed',\n schema(db) {\n db.exec(`CREATE TABLE IF NOT EXISTS embeddings (\"path\" TEXT, chunk INTEGER, start_line INTEGER, end_line INTEGER, scale REAL, vector BLOB, PRIMARY KEY (\"path\", chunk))`);\n },\n extract(raw, _body, search) {\n return chunksOf(raw, search);\n },\n remove(db, path) {\n db.prepare('DELETE FROM embeddings WHERE \"path\" = ?').run(path);\n },\n // A tree with no embedding model never had extract() run for the doc (db.ts's per-file\n // filter skips it), so extracted is undefined here -- store nothing, i.e. no rows.\n store(db, path, extracted) {\n if (!extracted) return;\n const insert = db.prepare('INSERT INTO embeddings (\"path\", chunk, start_line, end_line, scale, vector) VALUES (?, ?, ?, ?, NULL, NULL)');\n (extracted as Chunk[]).forEach((c, idx) => insert.run(path, idx, c.startLine, c.endLine));\n },\n enabledForFile(_cfg, file) {\n return file.embed;\n },\n};\n\n// --- static type: Model2Vec safetensors + pure-JS tokenizer, model cached in ~/.cache ---\n// Encode convention from model2vec/model.py: no special tokens, drop unk ids, mean-pool,\n// L2-normalize.\n\nconst MODEL_FILES = ['model.safetensors', 'tokenizer.json'];\n// The pair, for messages that name what a local model directory must contain.\nexport const MODEL_FILENAMES = MODEL_FILES.join(' and ');\n\n// A Hugging Face repo id: one slash, HF's charset. Anything else is a path, used as one rather\n// than flattened into a cache key Windows would reject.\nconst HF_MODEL_ID = /^[A-Za-z0-9][\\w.-]*\\/[A-Za-z0-9][\\w.-]*$/;\n\n// Downloadable iff it names a Hugging Face repo; a local path is the caller's to populate.\nexport function isDownloadable(model: string): boolean {\n return HF_MODEL_ID.test(model);\n}\n\n// Machine-wide, not per-tree: `.sense/` is the index a rebuild throws away, while a 124 MB\n// model is shared by every tree on the machine. Honors XDG_CACHE_HOME where it is set;\n// elsewhere ~/.cache, which is also where Hugging Face's own libraries keep theirs.\nfunction cacheRoot(): string {\n const xdg = process.env.XDG_CACHE_HOME;\n return join(xdg && xdg.length > 0 ? xdg : join(homedir(), '.cache'), 'sensemaking', 'models');\n}\n\n// A model is either a local directory the caller pointed at, or the cache `sense download`\n// fills. Nothing here fetches: an absent model degrades search to its other signals rather\n// than pulling 124 MB out of a command that reads like a query.\nexport function modelDir(model: string): string {\n if (!HF_MODEL_ID.test(model)) return model;\n return join(cacheRoot(), model.replace(/\\//g, '--'));\n}\n\n// Both files, so an interrupted download reads as absent and the next one resumes it.\nexport function hasModelFiles(model: string): boolean {\n const dir = modelDir(model);\n return MODEL_FILES.every((file) => existsSync(join(dir, file)));\n}\n\n// api providers have nothing to download, so they are never \"missing\" here; an unreachable\n// endpoint surfaces as an EMBED_MODEL error at call time instead.\nexport function modelPresent(cfg: Config): boolean {\n const e = embedConfig(cfg);\n if (!e) return false;\n return e.type === 'api' || hasModelFiles(e.model);\n}\n\nfunction fetchToFile(url: string, dest: string): Promise<void> {\n return fetch(url).then(async (res) => {\n if (!res.ok) throw new SenseError('EMBED_MODEL', `model download failed: ${url} -> HTTP ${res.status}`);\n writeFileSync(`${dest}.part`, Buffer.from(await res.arrayBuffer()));\n renameSync(`${dest}.part`, dest);\n });\n}\n\n// The only code path that touches the network for weights. `sense download` calls it; no\n// query ever does. Idempotent: a file already on disk is left alone.\nexport async function downloadModel(model: string, onFile?: (file: string, dir: string) => void): Promise<string> {\n if (!isDownloadable(model)) {\n throw new SenseError('EMBED_MODEL', `embed.model \"${model}\" is a local path, not a Hugging Face model id, so there is nothing to download; put model.safetensors and tokenizer.json in that directory, or name a model id like \"minishlab/potion-retrieval-32M\"`);\n }\n const dir = modelDir(model);\n mkdirSync(dir, { recursive: true });\n for (const file of MODEL_FILES) {\n if (existsSync(join(dir, file))) continue;\n onFile?.(file, dir);\n await fetchToFile(`https://huggingface.co/${model}/resolve/main/${file}`, join(dir, file));\n }\n return dir;\n}\n\nasync function staticProvider(model: string): Promise<EmbedProvider> {\n const dir = modelDir(model);\n for (const file of MODEL_FILES) {\n if (!existsSync(join(dir, file))) {\n // A local path the caller controls gets told what is missing where; only a repo id can\n // be fixed by downloading.\n const fix = isDownloadable(model) ? 'run `sense download`' : `expected ${MODEL_FILENAMES} in that directory`;\n throw new SenseError('EMBED_MODEL_MISSING', `embed model ${model} is not available (looked in ${dir}); ${fix}`);\n }\n }\n\n const raw = readFileSync(join(dir, 'model.safetensors'));\n const headerLen = Number(raw.readBigUInt64LE(0));\n const header = JSON.parse(raw.subarray(8, 8 + headerLen).toString('utf8')) as Record<string, { dtype: string; shape: number[]; data_offsets: number[] }>;\n const entry = Object.entries(header).find(([k]) => k !== '__metadata__');\n if (!entry || entry[1].dtype !== 'F32') throw new SenseError('EMBED_MODEL', `${model}: expected an F32 safetensors matrix`);\n const spec = entry[1];\n const dims = spec.shape[1];\n const dataStart = raw.byteOffset + 8 + headerLen + spec.data_offsets[0];\n const matrix = dataStart % 4 === 0 ? new Float32Array(raw.buffer, dataStart, spec.shape[0] * dims) : new Float32Array(raw.buffer.slice(dataStart, dataStart + spec.shape[0] * dims * 4));\n\n const tokenizerJson = JSON.parse(readFileSync(join(dir, 'tokenizer.json'), 'utf8'));\n // Lazy import: the tokenizer loads only on the semantic path, never at CLI startup.\n const { Tokenizer } = await import('@huggingface/tokenizers');\n const tok = new Tokenizer(tokenizerJson, {});\n const unkId = tokenizerJson.model?.vocab?.[tokenizerJson.model?.unk_token] ?? -1;\n\n function one(text: string): Float32Array {\n // The tokenizer yields undefined (not the unk id) for tokens outside the vocab; an\n // undefined id would index the matrix at NaN and poison the whole mean-pool -- and the\n // int8 conversion then stores the NaN vector as all zeros, silently. Keep integers only.\n const ids = (tok.encode(text, { add_special_tokens: false }).ids as number[]).filter((id) => Number.isInteger(id) && id !== unkId);\n const v = new Float32Array(dims);\n if (ids.length === 0) return v;\n for (const id of ids) {\n const off = id * dims;\n for (let d = 0; d < dims; d++) v[d] += matrix[off + d];\n }\n let norm = 0;\n for (let d = 0; d < dims; d++) {\n v[d] /= ids.length;\n norm += v[d] * v[d];\n }\n norm = Math.sqrt(norm) + 1e-32;\n for (let d = 0; d < dims; d++) v[d] /= norm;\n return v;\n }\n\n return { id: `static:${model}`, dims, embed: async (texts) => texts.map(one) };\n}\n\n// --- api type: one POST against any OpenAI-compatible /embeddings endpoint ---\n\nasync function apiProvider(model: string, url: string | undefined, keyEnv: string | undefined): Promise<EmbedProvider> {\n if (!url) throw new SenseError('EMBED_MODEL', 'features.embed.type \"api\" requires a url');\n const base = url.replace(/\\/+$/, '');\n const headers: Record<string, string> = { 'content-type': 'application/json' };\n const key = keyEnv ? process.env[keyEnv] : undefined;\n if (key) headers.authorization = `Bearer ${key}`;\n\n async function post(texts: string[]): Promise<Float32Array[]> {\n const res = await fetch(`${base}/embeddings`, { method: 'POST', headers, body: JSON.stringify({ model, input: texts }) });\n if (!res.ok) throw new SenseError('EMBED_MODEL', `${base}/embeddings -> HTTP ${res.status}`);\n const body = (await res.json()) as { data: Array<{ embedding: number[] }> };\n return body.data.map((d) => Float32Array.from(d.embedding));\n }\n\n const dims = (await post(['dimension probe']))[0].length;\n return { id: `api:${base}:${model}`, dims, embed: post };\n}\n\nconst providers = new Map<string, Promise<EmbedProvider>>();\n\nfunction getProvider(cfg: Config): Promise<EmbedProvider> {\n const e = embedConfig(cfg);\n if (!e) throw new SenseError('EMBED_DISABLED', 'this tree has no embedding model: add an \"embed\" block naming one to sense.config.json, then run `sense download`');\n const sig = `${e.type}:${e.model}:${e.url ?? ''}`;\n let p = providers.get(sig);\n if (!p) {\n p = e.type === 'api' ? apiProvider(e.model, e.url, e.key) : staticProvider(e.model);\n providers.set(sig, p);\n }\n return p;\n}\n\n// Slice + re-normalize (Matryoshka); optionally round through int8 storage.\nfunction toStore(full: Float32Array, dims: number, int8: boolean): { v: Float32Array; scale: number } {\n const v = new Float32Array(dims);\n let norm = 0;\n for (let d = 0; d < dims; d++) norm += full[d] * full[d];\n norm = Math.sqrt(norm) + 1e-32;\n for (let d = 0; d < dims; d++) v[d] = full[d] / norm;\n if (!int8) return { v, scale: 1 };\n let max = 0;\n for (let d = 0; d < dims; d++) max = Math.max(max, Math.abs(v[d]));\n return { v, scale: max / 127 || 1 };\n}\n\n// Embed rows whose vector is NULL, re-deriving chunk text from the files through the\n// same parse + chunker that stored the rows.\nexport async function embedPending(db: DatabaseSync, cfg: Config, baseDir: string): Promise<void> {\n const provider = await getProvider(cfg); // throws EMBED_DISABLED before touching the table\n const dirty = db.prepare('SELECT \"path\", chunk FROM embeddings WHERE vector IS NULL ORDER BY \"path\", chunk').all() as Array<{ path: string; chunk: number }>;\n if (dirty.length === 0) return;\n const storeDims = Math.min(STORE_DIMS, provider.dims);\n\n const byPath = new Map<string, number[]>();\n for (const row of dirty) {\n const list = byPath.get(row.path) ?? [];\n list.push(row.chunk);\n byPath.set(row.path, list);\n }\n\n const jobs: Array<{ path: string; chunk: number; text: string }> = [];\n for (const [path, chunkIdxs] of byPath) {\n let chunks: Chunk[];\n try {\n // presets/embed are irrelevant here -- re-deriving chunk text for a doc that already\n // has embeddings rows means the tree had an embedding model at reconcile time.\n chunks = parseFile({ relPath: path, absPath: join(baseDir, path), mtimeMs: 0, size: 0, presets: [], embed: true }, [embed]).doc.extracted.embed as Chunk[];\n } catch {\n continue; // vanished since reconcile; the next reconcile removes its rows\n }\n for (const idx of chunkIdxs) if (chunks[idx]) jobs.push({ path, chunk: idx, text: chunks[idx].text });\n }\n\n const update = db.prepare('UPDATE embeddings SET scale = ?, vector = ? WHERE \"path\" = ? AND chunk = ?');\n // The lazy build is the one long silence a first search hits (measured 23s at\n // 26k notes); progress makes it distinguishable from a hang.\n const report = progress('embedding chunks', jobs.length);\n for (let i = 0; i < jobs.length; i += BATCH) {\n const batch = jobs.slice(i, i + BATCH);\n const vectors = await provider.embed(batch.map((j) => j.text));\n db.exec('BEGIN');\n try {\n batch.forEach((job, j) => {\n const { v, scale } = toStore(vectors[j], storeDims, true);\n const q = new Int8Array(storeDims);\n for (let d = 0; d < storeDims; d++) q[d] = Math.round(v[d] / scale);\n update.run(scale, Buffer.from(q.buffer), job.path, job.chunk);\n });\n db.exec('COMMIT');\n } catch (err) {\n db.exec('ROLLBACK');\n throw err;\n }\n report.tick(Math.min(i + BATCH, jobs.length));\n }\n report.finish();\n}\n\n// Best chunk per file by cosine, its line range riding along; FTS5 operators are stripped as\n// lexical syntax. Similarity comes back because the fused score cannot express match quality,\n// and nearest-neighbour search always returns a neighbour however far away.\nexport async function semanticCandidates(db: DatabaseSync, cfg: Config, terms: string, fetch: number): Promise<Array<{ path: string; lines: string; similarity: number }>> {\n const baseDir = (cfg as Partial<ResolvedConfig>).baseDir;\n if (!baseDir) throw new SenseError('EMBED_MODEL', 'semantic expansion needs a config with baseDir (use loadConfig/open)');\n await embedPending(db, cfg, baseDir);\n\n const provider = await getProvider(cfg);\n const storeDims = Math.min(STORE_DIMS, provider.dims);\n const text = (terms.match(/[\\p{L}\\p{N}]+/gu) ?? []).filter((t) => !['AND', 'OR', 'NOT', 'NEAR'].includes(t)).join(' ');\n const { v: qv } = toStore((await provider.embed([text]))[0], storeDims, false);\n\n const rows = db.prepare('SELECT \"path\", start_line, end_line, scale, vector FROM embeddings WHERE vector IS NOT NULL').all() as Array<{\n path: string;\n start_line: number;\n end_line: number;\n scale: number;\n vector: Uint8Array;\n }>;\n\n const best = new Map<string, { score: number; lines: string }>();\n for (const row of rows) {\n const q = new Int8Array(row.vector.buffer, row.vector.byteOffset, Math.min(storeDims, row.vector.byteLength));\n let dot = 0;\n for (let d = 0; d < q.length; d++) dot += q[d] * qv[d];\n const score = dot * row.scale;\n const existing = best.get(row.path);\n if (!existing || score > existing.score) best.set(row.path, { score, lines: `L${row.start_line}-${row.end_line}` });\n }\n return [...best.entries()]\n .sort((a, b) => b[1].score - a[1].score)\n .slice(0, fetch)\n .map(([path, b]) => ({ path, lines: b.lines, similarity: Math.round(b.score * 1000) / 1000 }));\n}\n\n// Note-to-note similarity is the max cosine over (target chunk, other chunk) pairs, one linear\n// scan of stored vectors. Reads only what is stored, so it stays sync.\nexport function similarNotes(db: DatabaseSync, _cfg: Config, path: string, opts: { exclude: Set<string>; allowed?: Set<string>; k: number }): Array<{ path: string; similarity: number }> {\n // Cost is target_chunks x stored_chunks, so a heading-dense seed multiplies a full-corpus\n // scan (12.7s at 201 chunks/note). Sample evenly, so late sections still get a vote.\n const targetRows = db.prepare('SELECT scale, vector FROM embeddings WHERE \"path\" = ? AND vector IS NOT NULL ORDER BY chunk').all(path) as Array<{ scale: number; vector: Uint8Array }>;\n if (targetRows.length === 0) return [];\n const step = Math.max(1, Math.ceil(targetRows.length / TARGET_CHUNK_CAP));\n const target = targetRows.filter((_, i) => i % step === 0).map((row) => ({ v: new Int8Array(row.vector.buffer, row.vector.byteOffset, row.vector.byteLength), scale: row.scale }));\n\n const rows = db.prepare('SELECT \"path\", scale, vector FROM embeddings WHERE vector IS NOT NULL').all() as Array<{ path: string; scale: number; vector: Uint8Array }>;\n const best = new Map<string, number>();\n for (const row of rows) {\n if (row.path === path || opts.exclude.has(row.path) || (opts.allowed && !opts.allowed.has(row.path))) continue;\n const other = new Int8Array(row.vector.buffer, row.vector.byteOffset, row.vector.byteLength);\n for (const t of target) {\n let dot = 0;\n const len = Math.min(t.v.length, other.length);\n for (let d = 0; d < len; d++) dot += t.v[d] * other[d];\n const score = dot * t.scale * row.scale;\n const existing = best.get(row.path);\n if (existing === undefined || score > existing) best.set(row.path, score);\n }\n }\n\n return [...best.entries()]\n .sort((a, b) => b[1] - a[1])\n .slice(0, opts.k)\n .map(([p, score]) => ({ path: p, similarity: Math.round(score * 1000) / 1000 }));\n}\n"],"names":["MODEL_FILENAMES","downloadModel","embed","embedPending","hasModelFiles","isDownloadable","modelDir","modelPresent","semanticCandidates","similarNotes","STORE_DIMS","TARGET_CHUNK_CAP","BATCH","chunksOf","raw","search","lines","split","starts","inFence","i","length","test","push","bounds","prefix","title","summary","filter","Boolean","join","chunks","forEach","start","end","text","slice","trim","startLine","endLine","name","schema","db","exec","extract","_body","remove","path","prepare","run","store","extracted","insert","c","idx","enabledForFile","_cfg","file","MODEL_FILES","HF_MODEL_ID","model","cacheRoot","xdg","process","env","XDG_CACHE_HOME","homedir","replace","dir","every","existsSync","cfg","e","embedConfig","type","fetchToFile","url","dest","fetch","then","res","ok","SenseError","status","Buffer","from","arrayBuffer","writeFileSync","renameSync","onFile","mkdirSync","recursive","staticProvider","tokenizerJson","fix","headerLen","header","entry","spec","dims","dataStart","matrix","Tokenizer","tok","unkId","one","ids","encode","add_special_tokens","id","Number","isInteger","v","Float32Array","off","d","norm","Math","sqrt","readFileSync","readBigUInt64LE","JSON","parse","subarray","toString","Object","entries","find","k","dtype","shape","byteOffset","data_offsets","buffer","vocab","unk_token","texts","map","apiProvider","keyEnv","base","headers","key","post","body","method","stringify","input","json","data","embedding","undefined","authorization","providers","Map","getProvider","sig","p","get","set","toStore","full","int8","scale","max","abs","baseDir","provider","dirty","storeDims","byPath","row","list","jobs","chunkIdxs","update","report","batch","vectors","j","job","q","Int8Array","round","chunk","err","tick","min","all","parseFile","relPath","absPath","mtimeMs","size","presets","doc","progress","finish","terms","qv","rows","best","dot","score","existing","match","t","includes","vector","byteLength","start_line","end_line","sort","a","b","similarity","opts","targetRows","step","ceil","target","_","exclude","has","allowed","other","len"],"mappings":";;;;;;;;;;;QAyFaA;eAAAA;;QAmDSC;eAAAA;;QAhFTC;eAAAA;;QAkMSC;eAAAA;;QAzINC;eAAAA;;QArBAC;eAAAA;;QAeAC;eAAAA;;QAaAC;eAAAA;;QAwLMC;eAAAA;;QAmCNC;eAAAA;;;sBAvV+D;sBACvD;wBACH;wBAGO;wBACD;0BACF;sBACC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAG1B,8FAA8F;AAC9F,gGAAgG;AAEhG,6EAA6E;AAC7E,yEAAyE;AACzE,IAAMC,aAAa;AACnB,0FAA0F;AAC1F,IAAMC,mBAAmB;AACzB,IAAMC,QAAQ;AAcd,8FAA8F;AAC9F,+FAA+F;AAC/F,SAASC,SAASC,GAAW,EAAEC,MAA2C;IACxE,IAAMC,QAAQF,IAAIG,KAAK,CAAC;IACxB,IAAMC,SAAmB,EAAE;IAC3B,IAAIC,UAAU;IACd,IAAK,IAAIC,IAAI,GAAGA,IAAIJ,MAAMK,MAAM,EAAED,IAAK;QACrC,IAAI,aAAaE,IAAI,CAACN,KAAK,CAACI,EAAE,GAAG;YAC/BD,UAAU,CAACA;YACX;QACF;QACA,IAAI,CAACA,WAAW,YAAYG,IAAI,CAACN,KAAK,CAACI,EAAE,GAAGF,OAAOK,IAAI,CAACH,IAAI;IAC9D;IACA,IAAMI,SAASN,OAAOG,MAAM,KAAK,IAAI;QAAC;KAAE,GAAGH,MAAM,CAAC,EAAE,GAAG,IAAI;QAAC;KAAa,CAAd,OAAI,qBAAGA,WAAUA;IAC5E,IAAMO,SAAS;QAACV,mBAAAA,6BAAAA,OAAQW,KAAK;QAAEX,mBAAAA,6BAAAA,OAAQY,OAAO;KAAC,CAACC,MAAM,CAACC,SAASC,IAAI,CAAC;IACrE,IAAMC,SAAkB,EAAE;IAC1BP,OAAOQ,OAAO,CAAC,SAACC,OAAOb;QACrB,IAAMc,MAAMd,IAAI,IAAII,OAAOH,MAAM,GAAGG,MAAM,CAACJ,IAAI,EAAE,GAAG,IAAIJ,MAAMK,MAAM;QACpE,IAAMc,OAAOnB,MACVoB,KAAK,CAACH,QAAQ,GAAGC,KACjBJ,IAAI,CAAC,MACLO,IAAI;QACP,IAAIF,KAAKd,MAAM,GAAG,GAAGU,OAAOR,IAAI,CAAC;YAAEe,WAAWL;YAAOM,SAASL;YAAKC,MAAMV,SAAS,AAAC,GAAaU,OAAXV,QAAO,MAAS,OAALU,QAASA;QAAK;IAChH;IACA,OAAOJ;AACT;AAEO,IAAM7B,QAAiB;IAC5BsC,MAAM;IACNC,QAAAA,SAAAA,OAAOC,EAAE;QACPA,GAAGC,IAAI,CAAC;IACV;IACAC,SAAAA,SAAAA,QAAQ9B,GAAG,EAAE+B,KAAK,EAAE9B,MAAM;QACxB,OAAOF,SAASC,KAAKC;IACvB;IACA+B,QAAAA,SAAAA,OAAOJ,EAAE,EAAEK,IAAI;QACbL,GAAGM,OAAO,CAAC,2CAA2CC,GAAG,CAACF;IAC5D;IACA,uFAAuF;IACvF,mFAAmF;IACnFG,OAAAA,SAAAA,MAAMR,EAAE,EAAEK,IAAI,EAAEI,SAAS;QACvB,IAAI,CAACA,WAAW;QAChB,IAAMC,SAASV,GAAGM,OAAO,CAAC;QACzBG,UAAsBnB,OAAO,CAAC,SAACqB,GAAGC;mBAAQF,OAAOH,GAAG,CAACF,MAAMO,KAAKD,EAAEf,SAAS,EAAEe,EAAEd,OAAO;;IACzF;IACAgB,gBAAAA,SAAAA,eAAeC,IAAI,EAAEC,IAAI;QACvB,OAAOA,KAAKvD,KAAK;IACnB;AACF;AAEA,2FAA2F;AAC3F,yFAAyF;AACzF,gBAAgB;AAEhB,IAAMwD,cAAc;IAAC;IAAqB;CAAiB;AAEpD,IAAM1D,kBAAkB0D,YAAY5B,IAAI,CAAC;AAEhD,+FAA+F;AAC/F,wDAAwD;AACxD,IAAM6B,cAAc;AAGb,SAAStD,eAAeuD,KAAa;IAC1C,OAAOD,YAAYrC,IAAI,CAACsC;AAC1B;AAEA,2FAA2F;AAC3F,uFAAuF;AACvF,oFAAoF;AACpF,SAASC;IACP,IAAMC,MAAMC,QAAQC,GAAG,CAACC,cAAc;IACtC,OAAOnC,IAAAA,cAAI,EAACgC,OAAOA,IAAIzC,MAAM,GAAG,IAAIyC,MAAMhC,IAAAA,cAAI,EAACoC,IAAAA,eAAO,KAAI,WAAW,eAAe;AACtF;AAKO,SAAS5D,SAASsD,KAAa;IACpC,IAAI,CAACD,YAAYrC,IAAI,CAACsC,QAAQ,OAAOA;IACrC,OAAO9B,IAAAA,cAAI,EAAC+B,aAAaD,MAAMO,OAAO,CAAC,OAAO;AAChD;AAGO,SAAS/D,cAAcwD,KAAa;IACzC,IAAMQ,MAAM9D,SAASsD;IACrB,OAAOF,YAAYW,KAAK,CAAC,SAACZ;eAASa,IAAAA,kBAAU,EAACxC,IAAAA,cAAI,EAACsC,KAAKX;;AAC1D;AAIO,SAASlD,aAAagE,GAAW;IACtC,IAAMC,IAAIC,IAAAA,qBAAW,EAACF;IACtB,IAAI,CAACC,GAAG,OAAO;IACf,OAAOA,EAAEE,IAAI,KAAK,SAAStE,cAAcoE,EAAEZ,KAAK;AAClD;AAEA,SAASe,YAAYC,GAAW,EAAEC,IAAY;IAC5C,OAAOC,MAAMF,KAAKG,IAAI,CAAC,SAAOC;;;;;;wBAC5B,IAAI,CAACA,IAAIC,EAAE,EAAE,MAAM,IAAIC,oBAAU,CAAC,eAAe,AAAC,0BAAwCF,OAAfJ,KAAI,aAAsB,OAAXI,IAAIG,MAAM;;4BACrF,GAAO,OAALN,MAAK;;4BAAQO,OAAOC,IAAI;wBAAC;;4BAAML,IAAIM,WAAW;;;wBAA/DC,qBAAa;4BAAiBH,QAAAA;gCAAY;;;wBAC1CI,IAAAA,kBAAU,EAAC,AAAC,GAAO,OAALX,MAAK,UAAQA;;;;;;QAC7B;;AACF;AAIO,SAAe5E,cAAc2D,KAAa,EAAE6B,MAA4C;;YAIvFrB,KAED,2BAAA,mBAAA,gBAAA,WAAA,OAAMX;;;;oBALX,IAAI,CAACpD,eAAeuD,QAAQ;wBAC1B,MAAM,IAAIsB,oBAAU,CAAC,eAAe,AAAC,gBAAqB,OAANtB,OAAM;oBAC5D;oBACMQ,MAAM9D,SAASsD;oBACrB8B,IAAAA,iBAAS,EAACtB,KAAK;wBAAEuB,WAAW;oBAAK;oBAC5B,kCAAA,2BAAA;;;;;;;;;oBAAA,YAAcjC;;;2BAAd,6BAAA,QAAA;;;;oBAAMD,OAAN;oBACH,IAAIa,IAAAA,kBAAU,EAACxC,IAAAA,cAAI,EAACsC,KAAKX,QAAQ;;;;oBACjCgC,mBAAAA,6BAAAA,OAAShC,MAAMW;oBACf;;wBAAMO,YAAY,AAAC,0BAA+ClB,OAAtBG,OAAM,kBAAqB,OAALH,OAAQ3B,IAAAA,cAAI,EAACsC,KAAKX;;;oBAApF;;;oBAHG;;;;;;;;;;;;oBAAA;oBAAA;;;;;;;6BAAA,6BAAA;4BAAA;;;4BAAA;kCAAA;;;;;;;oBAKL;;wBAAOW;;;;IACT;;AAEA,SAAewB,eAAehC,KAAa;;kBAyBEiC,sBAA7BA,4BAAAA,uBAxBRzB,KACD,2BAAA,mBAAA,gBAAA,WAAA,OAAMX,MAIDqC,KAKJhF,KACAiF,WACAC,QACAC,OAEAC,MACAC,MACAC,WACAC,QAEAR,eAEES,WACFC,KACAC;QAEN,SAASC,IAAItE,IAAY;YACvB,mFAAmF;YACnF,uFAAuF;YACvF,yFAAyF;YACzF,IAAMuE,MAAM,AAACH,IAAII,MAAM,CAACxE,MAAM;gBAAEyE,oBAAoB;YAAM,GAAGF,GAAG,CAAc9E,MAAM,CAAC,SAACiF;uBAAOC,OAAOC,SAAS,CAACF,OAAOA,OAAOL;;YAC5H,IAAMQ,IAAI,IAAIC,aAAad;YAC3B,IAAIO,IAAIrF,MAAM,KAAK,GAAG,OAAO2F;gBACxB,kCAAA,2BAAA;;gBAAL,QAAK,YAAYN,wBAAZ,SAAA,6BAAA,QAAA,yBAAA,iCAAiB;oBAAjB,IAAMG,KAAN;oBACH,IAAMK,MAAML,KAAKV;oBACjB,IAAK,IAAIgB,IAAI,GAAGA,IAAIhB,MAAMgB,IAAKH,CAAC,CAACG,EAAE,IAAId,MAAM,CAACa,MAAMC,EAAE;gBACxD;;gBAHK;gBAAA;;;yBAAA,6BAAA;wBAAA;;;wBAAA;8BAAA;;;;YAIL,IAAIC,OAAO;YACX,IAAK,IAAID,KAAI,GAAGA,KAAIhB,MAAMgB,KAAK;gBAC7BH,CAAC,CAACG,GAAE,IAAIT,IAAIrF,MAAM;gBAClB+F,QAAQJ,CAAC,CAACG,GAAE,GAAGH,CAAC,CAACG,GAAE;YACrB;YACAC,OAAOC,KAAKC,IAAI,CAACF,QAAQ;YACzB,IAAK,IAAID,KAAI,GAAGA,KAAIhB,MAAMgB,KAAKH,CAAC,CAACG,GAAE,IAAIC;YACvC,OAAOJ;QACT;;;;oBA7CM5C,MAAM9D,SAASsD;oBAChB,kCAAA,2BAAA;;wBAAL,IAAK,YAAcF,kCAAd,6BAAA,QAAA,yBAAA,iCAA2B;4BAArBD,OAAN;4BACH,IAAI,CAACa,IAAAA,kBAAU,EAACxC,IAAAA,cAAI,EAACsC,KAAKX,QAAQ;gCAChC,uFAAuF;gCACvF,2BAA2B;gCACrBqC,MAAMzF,eAAeuD,SAAS,yBAAyB,AAAC,YAA2B,OAAhB5D,iBAAgB;gCACzF,MAAM,IAAIkF,oBAAU,CAAC,uBAAuB,AAAC,eAAmDd,OAArCR,OAAM,iCAAwCkC,OAAT1B,KAAI,OAAS,OAAJ0B;4BAC3G;wBACF;;wBAPK;wBAAA;;;iCAAA,6BAAA;gCAAA;;;gCAAA;sCAAA;;;;oBASChF,MAAMyG,IAAAA,oBAAY,EAACzF,IAAAA,cAAI,EAACsC,KAAK;oBAC7B2B,YAAYe,OAAOhG,IAAI0G,eAAe,CAAC;oBACvCxB,SAASyB,KAAKC,KAAK,CAAC5G,IAAI6G,QAAQ,CAAC,GAAG,IAAI5B,WAAW6B,QAAQ,CAAC;oBAC5D3B,QAAQ4B,OAAOC,OAAO,CAAC9B,QAAQ+B,IAAI,CAAC;iEAAEC;+BAAOA,MAAM;;oBACzD,IAAI,CAAC/B,SAASA,KAAK,CAAC,EAAE,CAACgC,KAAK,KAAK,OAAO,MAAM,IAAI/C,oBAAU,CAAC,eAAe,AAAC,GAAQ,OAANtB,OAAM;oBAC/EsC,OAAOD,KAAK,CAAC,EAAE;oBACfE,OAAOD,KAAKgC,KAAK,CAAC,EAAE;oBACpB9B,YAAYtF,IAAIqH,UAAU,GAAG,IAAIpC,YAAYG,KAAKkC,YAAY,CAAC,EAAE;oBACjE/B,SAASD,YAAY,MAAM,IAAI,IAAIa,aAAanG,IAAIuH,MAAM,EAAEjC,WAAWF,KAAKgC,KAAK,CAAC,EAAE,GAAG/B,QAAQ,IAAIc,aAAanG,IAAIuH,MAAM,CAACjG,KAAK,CAACgE,WAAWA,YAAYF,KAAKgC,KAAK,CAAC,EAAE,GAAG/B,OAAO;oBAE/KN,gBAAgB4B,KAAKC,KAAK,CAACH,IAAAA,oBAAY,EAACzF,IAAAA,cAAI,EAACsC,KAAK,mBAAmB;oBAErD;;wBAAM;2EAAA,QAAO;;;;oBAA3BkC,YAAc,cAAdA;oBACFC,MAAM,IAAID,UAAUT,eAAe,CAAC;oBACpCW,iBAAQX,wBAAAA,cAAcjC,KAAK,cAAnBiC,6CAAAA,6BAAAA,sBAAqByC,KAAK,cAA1BzC,iDAAAA,0BAA4B,EAACA,uBAAAA,cAAcjC,KAAK,cAAnBiC,2CAAAA,qBAAqB0C,SAAS,CAAC,uCAAI,CAAC;oBAuB/E;;wBAAO;4BAAE1B,IAAI,AAAC,UAAe,OAANjD;4BAASuC,MAAAA;4BAAMjG,OAAO,SAAPA,MAAcsI;;;;;4CAAUA,MAAMC,GAAG,CAAChC;;;;;wBAAK;;;;IAC/E;;AAEA,gFAAgF;AAEhF,SAAeiC,YAAY9E,KAAa,EAAEgB,GAAuB,EAAE+D,MAA0B;;YAErFC,MACAC,SACAC,KAUA3C;QAPN,SAAe4C,KAAKP,KAAe;;oBAC3BxD,KAEAgE;;;;4BAFM;;gCAAMlE,MAAM,AAAC,GAAO,OAAL8D,MAAK,gBAAc;oCAAEK,QAAQ;oCAAQJ,SAAAA;oCAASG,MAAMvB,KAAKyB,SAAS,CAAC;wCAAEtF,OAAAA;wCAAOuF,OAAOX;oCAAM;gCAAG;;;4BAAjHxD,MAAM;4BACZ,IAAI,CAACA,IAAIC,EAAE,EAAE,MAAM,IAAIC,oBAAU,CAAC,eAAe,AAAC,GAA6BF,OAA3B4D,MAAK,wBAAiC,OAAX5D,IAAIG,MAAM;4BAC3E;;gCAAMH,IAAIoE,IAAI;;;4BAAtBJ,OAAQ;4BACd;;gCAAOA,KAAKK,IAAI,CAACZ,GAAG,CAAC,SAACtB;2CAAMF,aAAa5B,IAAI,CAAC8B,EAAEmC,SAAS;;;;;YAC3D;;;;;oBAXA,IAAI,CAAC1E,KAAK,MAAM,IAAIM,oBAAU,CAAC,eAAe;oBACxC0D,OAAOhE,IAAIT,OAAO,CAAC,QAAQ;oBAC3B0E,UAAkC;wBAAE,gBAAgB;oBAAmB;oBACvEC,MAAMH,SAAS5E,QAAQC,GAAG,CAAC2E,OAAO,GAAGY;oBAC3C,IAAIT,KAAKD,QAAQW,aAAa,GAAG,AAAC,UAAa,OAAJV;oBAS7B;;wBAAMC;4BAAM;;;;oBAApB5C,OAAO,AAAC,aAAgC,CAAC,EAAE,CAAC9E,MAAM;oBACxD;;wBAAO;4BAAEwF,IAAI,AAAC,OAAcjD,OAARgF,MAAK,KAAS,OAANhF;4BAASuC,MAAAA;4BAAMjG,OAAO6I;wBAAK;;;;IACzD;;AAEA,IAAMU,YAAY,IAAIC;AAEtB,SAASC,YAAYpF,GAAW;QAGMC;IAFpC,IAAMA,IAAIC,IAAAA,qBAAW,EAACF;IACtB,IAAI,CAACC,GAAG,MAAM,IAAIU,oBAAU,CAAC,kBAAkB;IAC/C,IAAM0E,MAAM,AAtOd,AAsOe,GAAYpF,OAAVA,EAAEE,IAAI,EAAC,YAAGF,EAAEZ,KAAK,EAAC,KAAe,QAAZY,SAAAA,EAAEI,GAAG,cAALJ,oBAAAA,SAAS;IAC7C,IAAIqF,IAAIJ,UAAUK,GAAG,CAACF;IACtB,IAAI,CAACC,GAAG;QACNA,IAAIrF,EAAEE,IAAI,KAAK,QAAQgE,YAAYlE,EAAEZ,KAAK,EAAEY,EAAEI,GAAG,EAAEJ,EAAEsE,GAAG,IAAIlD,eAAepB,EAAEZ,KAAK;QAClF6F,UAAUM,GAAG,CAACH,KAAKC;IACrB;IACA,OAAOA;AACT;AAEA,4EAA4E;AAC5E,SAASG,QAAQC,IAAkB,EAAE9D,IAAY,EAAE+D,IAAa;IAC9D,IAAMlD,IAAI,IAAIC,aAAad;IAC3B,IAAIiB,OAAO;IACX,IAAK,IAAID,IAAI,GAAGA,IAAIhB,MAAMgB,IAAKC,QAAQ6C,IAAI,CAAC9C,EAAE,GAAG8C,IAAI,CAAC9C,EAAE;IACxDC,OAAOC,KAAKC,IAAI,CAACF,QAAQ;IACzB,IAAK,IAAID,KAAI,GAAGA,KAAIhB,MAAMgB,KAAKH,CAAC,CAACG,GAAE,GAAG8C,IAAI,CAAC9C,GAAE,GAAGC;IAChD,IAAI,CAAC8C,MAAM,OAAO;QAAElD,GAAAA;QAAGmD,OAAO;IAAE;IAChC,IAAIC,MAAM;IACV,IAAK,IAAIjD,KAAI,GAAGA,KAAIhB,MAAMgB,KAAKiD,MAAM/C,KAAK+C,GAAG,CAACA,KAAK/C,KAAKgD,GAAG,CAACrD,CAAC,CAACG,GAAE;IAChE,OAAO;QAAEH,GAAAA;QAAGmD,OAAOC,MAAM,OAAO;IAAE;AACpC;AAIO,SAAejK,aAAauC,EAAgB,EAAE6B,GAAW,EAAE+F,OAAe;;mBACzEC,UACAC,OAEAC,WAEAC,QACD,2BAAA,mBAAA,gBAAA,WAAA,OAAMC,KACID,aAAPE,MAKFC,MACD,4BAAA,oBAAA,iBAAA,YAAA,qBAAO9H,MAAM+H,WACZ/I,QAQC,4BAAA,oBAAA,iBAAA,YAAA,QAAMuB,KAGPyH,QAGAC,QACG5J;;;;;4BACD6J,OACAC;;;;oCADAD,QAAQJ,KAAKzI,KAAK,CAAChB,GAAGA,IAAIR;oCAChB;;wCAAM2J,SAASrK,KAAK,CAAC+K,MAAMxC,GAAG,CAAC,SAAC0C;mDAAMA,EAAEhJ,IAAI;;;;oCAAtD+I,UAAU;oCAChBxI,GAAGC,IAAI,CAAC;oCACR,IAAI;wCACFsI,MAAMjJ,OAAO,CAAC,SAACoJ,KAAKD;4CAClB,IAAqBnB,WAAAA,QAAQkB,OAAO,CAACC,EAAE,EAAEV,WAAW,OAA5CzD,IAAagD,SAAbhD,GAAGmD,QAAUH,SAAVG;4CACX,IAAMkB,IAAI,IAAIC,UAAUb;4CACxB,IAAK,IAAItD,IAAI,GAAGA,IAAIsD,WAAWtD,IAAKkE,CAAC,CAAClE,EAAE,GAAGE,KAAKkE,KAAK,CAACvE,CAAC,CAACG,EAAE,GAAGgD;4CAC7DY,OAAO9H,GAAG,CAACkH,OAAO/E,OAAOC,IAAI,CAACgG,EAAEhD,MAAM,GAAG+C,IAAIrI,IAAI,EAAEqI,IAAII,KAAK;wCAC9D;wCACA9I,GAAGC,IAAI,CAAC;oCACV,EAAE,OAAO8I,KAAK;wCACZ/I,GAAGC,IAAI,CAAC;wCACR,MAAM8I;oCACR;oCACAT,OAAOU,IAAI,CAACrE,KAAKsE,GAAG,CAACvK,IAAIR,OAAOiK,KAAKxJ,MAAM;;;;;;oBAC7C;oBA9CiB;;wBAAMsI,YAAYpF;;;oBAA7BgG,WAAW;oBACXC,QAAQ9H,GAAGM,OAAO,CAAC,oFAAoF4I,GAAG;oBAChH,IAAIpB,MAAMnJ,MAAM,KAAK,GAAG;;;oBAClBoJ,YAAYpD,KAAKsE,GAAG,CAACjL,YAAY6J,SAASpE,IAAI;oBAE9CuE,SAAS,IAAIhB;oBACd,kCAAA,2BAAA;;wBAAL,IAAK,YAAac,4BAAb,6BAAA,QAAA,yBAAA,iCAAoB;4BAAdG,MAAN;;4BACGC,QAAOF,cAAAA,OAAOZ,GAAG,CAACa,IAAI5H,IAAI,eAAnB2H,yBAAAA;4BACbE,KAAKrJ,IAAI,CAACoJ,IAAIa,KAAK;4BACnBd,OAAOX,GAAG,CAACY,IAAI5H,IAAI,EAAE6H;wBACvB;;wBAJK;wBAAA;;;iCAAA,6BAAA;gCAAA;;;gCAAA;sCAAA;;;;oBAMCC;oBACD,mCAAA,4BAAA;;wBAAL,IAAK,aAA2BH,6BAA3B,8BAAA,SAAA,0BAAA,kCAAmC;2DAAnC,kBAAO3H,uBAAM+H;4BACZ/I,SAAAA,KAAAA;4BACJ,IAAI;gCACF,qFAAqF;gCACrF,+EAA+E;gCAC/EA,SAAS8J,IAAAA,iBAAS,EAAC;oCAAEC,SAAS/I;oCAAMgJ,SAASjK,IAAAA,cAAI,EAACwI,SAASvH;oCAAOiJ,SAAS;oCAAGC,MAAM;oCAAGC,OAAO;oCAAMhM,OAAO;gCAAK;oCAAIA;mCAAQiM,GAAG,CAAChJ,SAAS,CAACjD,KAAK;4BACjJ,EAAE,eAAM;gCACN,UAAU,gEAAgE;4BAC5E;4BACK,mCAAA,4BAAA;;gCAAL,IAAK,aAAa4K,gCAAb,8BAAA,SAAA,0BAAA;oCAAMxH,MAAN;oCAAwB,IAAIvB,MAAM,CAACuB,IAAI,EAAEuH,KAAKtJ,IAAI,CAAC;wCAAEwB,MAAAA;wCAAMyI,OAAOlI;wCAAKnB,MAAMJ,MAAM,CAACuB,IAAI,CAACnB,IAAI;oCAAC;;;gCAA9F;gCAAA;;;yCAAA,8BAAA;wCAAA;;;wCAAA;8CAAA;;;;wBACP;;wBAVK;wBAAA;;;iCAAA,8BAAA;gCAAA;;;gCAAA;sCAAA;;;;oBAYC4I,SAASrI,GAAGM,OAAO,CAAC;oBAC1B,8EAA8E;oBAC9E,6DAA6D;oBACvDgI,SAASoB,IAAAA,oBAAQ,EAAC,oBAAoBvB,KAAKxJ,MAAM;oBAC9CD,IAAI;;;yBAAGA,CAAAA,IAAIyJ,KAAKxJ,MAAM,AAAD;;;;;;;;;;;;oBAAGD,KAAKR;;;;;;oBAkBtCoK,OAAOqB,MAAM;;;;;;IACf;;AAKO,SAAe7L,mBAAmBkC,EAAgB,EAAE6B,GAAW,EAAE+H,KAAa,EAAExH,MAAa;;YAOpFwH,cANRhC,SAIAC,UACAE,WACAtI,MACY6H,UAAPuC,IAELC,MAQAC,MACD,2BAAA,mBAAA,gBAAA,WAAA,OAAM9B,KACHU,GACFqB,KACKvF,GACHwF,OACAC;;;;oBAvBFtC,UAAU,AAAC/F,IAAgC+F,OAAO;oBACxD,IAAI,CAACA,SAAS,MAAM,IAAIpF,oBAAU,CAAC,eAAe;oBAClD;;wBAAM/E,aAAauC,IAAI6B,KAAK+F;;;oBAA5B;oBAEiB;;wBAAMX,YAAYpF;;;oBAA7BgG,WAAW;oBACXE,YAAYpD,KAAKsE,GAAG,CAACjL,YAAY6J,SAASpE,IAAI;oBAC9ChE,OAAO,EAACmK,eAAAA,MAAMO,KAAK,CAAC,2naAAZP,0BAAAA,mBAAsC1K,MAAM,CAAC,SAACkL;+BAAM,CAAC;4BAAC;4BAAO;4BAAM;4BAAO;yBAAO,CAACC,QAAQ,CAACD;uBAAIhL,IAAI,CAAC;oBACvF;;wBAAMyI,SAASrK,KAAK;4BAAEiC;;;;oBAA/B6H,WAAAA;wBAAS,aAA6B,CAAC,EAAE;wBAAES;wBAAW;wBAA7D8B,KAAOvC,SAAVhD;oBAEFwF,OAAO9J,GAAGM,OAAO,CAAC,+FAA+F4I,GAAG;oBAQpHa,OAAO,IAAI/C;oBACZ,kCAAA,2BAAA;;wBAAL,IAAK,YAAa8C,2BAAb,6BAAA,QAAA,yBAAA,iCAAmB;4BAAb7B,MAAN;4BACGU,IAAI,IAAIC,UAAUX,IAAIqC,MAAM,CAAC3E,MAAM,EAAEsC,IAAIqC,MAAM,CAAC7E,UAAU,EAAEd,KAAKsE,GAAG,CAAClB,WAAWE,IAAIqC,MAAM,CAACC,UAAU;4BACvGP,MAAM;4BACV,IAASvF,IAAI,GAAGA,IAAIkE,EAAEhK,MAAM,EAAE8F,IAAKuF,OAAOrB,CAAC,CAAClE,EAAE,GAAGoF,EAAE,CAACpF,EAAE;4BAChDwF,QAAQD,MAAM/B,IAAIR,KAAK;4BACvByC,WAAWH,KAAK3C,GAAG,CAACa,IAAI5H,IAAI;4BAClC,IAAI,CAAC6J,YAAYD,QAAQC,SAASD,KAAK,EAAEF,KAAK1C,GAAG,CAACY,IAAI5H,IAAI,EAAE;gCAAE4J,OAAAA;gCAAO3L,OAAO,AAAC,IAAqB2J,OAAlBA,IAAIuC,UAAU,EAAC,KAAgB,OAAbvC,IAAIwC,QAAQ;4BAAG;wBACnH;;wBAPK;wBAAA;;;iCAAA,6BAAA;gCAAA;;;gCAAA;sCAAA;;;;oBAQL;;wBAAQ,qBAAGV,KAAK3E,OAAO,IACpBsF,IAAI,CAAC,SAACC,GAAGC;mCAAMA,CAAC,CAAC,EAAE,CAACX,KAAK,GAAGU,CAAC,CAAC,EAAE,CAACV,KAAK;2BACtCvK,KAAK,CAAC,GAAG0C,QACT2D,GAAG,CAAC;qEAAE1F,kBAAMuK;mCAAQ;gCAAEvK,MAAAA;gCAAM/B,OAAOsM,EAAEtM,KAAK;gCAAEuM,YAAYlG,KAAKkE,KAAK,CAAC+B,EAAEX,KAAK,GAAG,QAAQ;4BAAK;;;;;IAC/F;;AAIO,SAASlM,aAAaiC,EAAgB,EAAEc,IAAY,EAAET,IAAY,EAAEyK,IAAgE;IACzI,0FAA0F;IAC1F,qFAAqF;IACrF,IAAMC,aAAa/K,GAAGM,OAAO,CAAC,+FAA+F4I,GAAG,CAAC7I;IACjI,IAAI0K,WAAWpM,MAAM,KAAK,GAAG,OAAO,EAAE;IACtC,IAAMqM,OAAOrG,KAAK+C,GAAG,CAAC,GAAG/C,KAAKsG,IAAI,CAACF,WAAWpM,MAAM,GAAGV;IACvD,IAAMiN,SAASH,WAAW7L,MAAM,CAAC,SAACiM,GAAGzM;eAAMA,IAAIsM,SAAS;OAAGjF,GAAG,CAAC,SAACkC;eAAS;YAAE3D,GAAG,IAAIsE,UAAUX,IAAIqC,MAAM,CAAC3E,MAAM,EAAEsC,IAAIqC,MAAM,CAAC7E,UAAU,EAAEwC,IAAIqC,MAAM,CAACC,UAAU;YAAG9C,OAAOQ,IAAIR,KAAK;QAAC;;IAE/K,IAAMqC,OAAO9J,GAAGM,OAAO,CAAC,yEAAyE4I,GAAG;IACpG,IAAMa,OAAO,IAAI/C;QACZ,kCAAA,2BAAA;;QAAL,QAAK,YAAa8C,yBAAb,SAAA,6BAAA,QAAA,yBAAA,iCAAmB;YAAnB,IAAM7B,MAAN;YACH,IAAIA,IAAI5H,IAAI,KAAKA,QAAQyK,KAAKM,OAAO,CAACC,GAAG,CAACpD,IAAI5H,IAAI,KAAMyK,KAAKQ,OAAO,IAAI,CAACR,KAAKQ,OAAO,CAACD,GAAG,CAACpD,IAAI5H,IAAI,GAAI;YACtG,IAAMkL,QAAQ,IAAI3C,UAAUX,IAAIqC,MAAM,CAAC3E,MAAM,EAAEsC,IAAIqC,MAAM,CAAC7E,UAAU,EAAEwC,IAAIqC,MAAM,CAACC,UAAU;gBACtF,mCAAA,4BAAA;;gBAAL,QAAK,aAAWW,2BAAX,UAAA,8BAAA,SAAA,0BAAA,kCAAmB;oBAAnB,IAAMd,IAAN;oBACH,IAAIJ,MAAM;oBACV,IAAMwB,MAAM7G,KAAKsE,GAAG,CAACmB,EAAE9F,CAAC,CAAC3F,MAAM,EAAE4M,MAAM5M,MAAM;oBAC7C,IAAK,IAAI8F,IAAI,GAAGA,IAAI+G,KAAK/G,IAAKuF,OAAOI,EAAE9F,CAAC,CAACG,EAAE,GAAG8G,KAAK,CAAC9G,EAAE;oBACtD,IAAMwF,QAAQD,MAAMI,EAAE3C,KAAK,GAAGQ,IAAIR,KAAK;oBACvC,IAAMyC,WAAWH,KAAK3C,GAAG,CAACa,IAAI5H,IAAI;oBAClC,IAAI6J,aAAarD,aAAaoD,QAAQC,UAAUH,KAAK1C,GAAG,CAACY,IAAI5H,IAAI,EAAE4J;gBACrE;;gBAPK;gBAAA;;;yBAAA,8BAAA;wBAAA;;;wBAAA;8BAAA;;;;QAQP;;QAXK;QAAA;;;iBAAA,6BAAA;gBAAA;;;gBAAA;sBAAA;;;;IAaL,OAAO,AAAC,qBAAGF,KAAK3E,OAAO,IACpBsF,IAAI,CAAC,SAACC,GAAGC;eAAMA,CAAC,CAAC,EAAE,GAAGD,CAAC,CAAC,EAAE;OAC1BjL,KAAK,CAAC,GAAGoL,KAAKxF,CAAC,EACfS,GAAG,CAAC;iDAAEoB,eAAG8C;eAAY;YAAE5J,MAAM8G;YAAG0D,YAAYlG,KAAKkE,KAAK,CAACoB,QAAQ,QAAQ;QAAK;;AACjF"}
|
|
@@ -192,13 +192,9 @@ function resolveAll(db, files) {
|
|
|
192
192
|
var rows = db.prepare('SELECT src, target, dst FROM links').all();
|
|
193
193
|
return resolveRows(db, rows, pathSet, byBase);
|
|
194
194
|
}
|
|
195
|
-
// Re-resolve only what this reconcile could have
|
|
196
|
-
//
|
|
197
|
-
//
|
|
198
|
-
// lexicographic-tie ambiguity hinge on exactly that set), and (c) links whose dst was a
|
|
199
|
-
// path that just vanished. All three are indexed lookups (src is the links PK's leading
|
|
200
|
-
// column; target_base and dst each have their own index), so this reads only the rows this
|
|
201
|
-
// reconcile could plausibly have changed, not the whole table.
|
|
195
|
+
// Re-resolve only what this reconcile could have touched: re-stored sources, links whose
|
|
196
|
+
// target basename matches an added/vanished file, and links whose dst just vanished. All
|
|
197
|
+
// three are indexed lookups, so this never reads the whole table.
|
|
202
198
|
function resolveIncremental(db, delta) {
|
|
203
199
|
var pathSet = new Set(delta.files.map(function(f) {
|
|
204
200
|
return f.relPath;
|
|
@@ -294,11 +290,8 @@ function linkEdges(db) {
|
|
|
294
290
|
];
|
|
295
291
|
});
|
|
296
292
|
}
|
|
297
|
-
//
|
|
298
|
-
//
|
|
299
|
-
// afterReconcile can't tell from the links table alone whether deleted rows carried edges.
|
|
300
|
-
// remove() records that here, keyed on the reconcile's own delta object -- state dies with
|
|
301
|
-
// the reconcile, including on ROLLBACK, and distinct reconciles never share it.
|
|
293
|
+
// remove() has already deleted the rows by the time afterReconcile runs, so it records here
|
|
294
|
+
// whether they carried edges. Keyed on the delta object, so the state dies with the reconcile.
|
|
302
295
|
var removedWithLinks = new WeakMap();
|
|
303
296
|
function recordRemoved(delta, path) {
|
|
304
297
|
var set = removedWithLinks.get(delta);
|
|
@@ -382,10 +375,8 @@ var links = {
|
|
|
382
375
|
// reparsed-to-zero-links case (no surviving rows to re-resolve).
|
|
383
376
|
var removeHadLinks = ((_ref = (_removedWithLinks_get = removedWithLinks.get(delta)) === null || _removedWithLinks_get === void 0 ? void 0 : _removedWithLinks_get.size) !== null && _ref !== void 0 ? _ref : 0) > 0;
|
|
384
377
|
var churn = delta.reparsed.length + delta.vanished.length;
|
|
385
|
-
//
|
|
386
|
-
//
|
|
387
|
-
// rules exactly. A cold build reparses ~every file, so it clears this threshold on its
|
|
388
|
-
// own without a separate check.
|
|
378
|
+
// Past this share of the tree, a full pass is the only one guaranteed to match
|
|
379
|
+
// resolveTarget's ambiguity rules. A cold build clears the threshold on its own.
|
|
389
380
|
var large = delta.files.length === 0 || churn > 0.2 * delta.files.length;
|
|
390
381
|
var dstChanged = large ? resolveAll(db, delta.files) : resolveIncremental(db, delta);
|
|
391
382
|
delta.linksChanged = dstChanged || removeHadLinks;
|