sensemaking 0.19.0 → 0.19.1
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/dist/cjs/store/sqlite/connection.js +1 -1
- package/dist/cjs/store/sqlite/connection.js.map +1 -1
- package/dist/cjs/store/sqlite/open.js +25 -5
- package/dist/cjs/store/sqlite/open.js.map +1 -1
- package/dist/cjs/store/sqlite/reconcile.js +111 -101
- package/dist/cjs/store/sqlite/reconcile.js.map +1 -1
- package/dist/cjs/store/transaction.d.cts +2 -1
- package/dist/cjs/store/transaction.d.ts +2 -1
- package/dist/cjs/store/transaction.js +16 -6
- package/dist/cjs/store/transaction.js.map +1 -1
- package/dist/cjs/store/turso/connection.js +1 -1
- package/dist/cjs/store/turso/connection.js.map +1 -1
- package/dist/cjs/store/turso/open.d.cts +2 -0
- package/dist/cjs/store/turso/open.d.ts +2 -0
- package/dist/cjs/store/turso/open.js +112 -55
- package/dist/cjs/store/turso/open.js.map +1 -1
- package/dist/cjs/store/turso/reconcile.js +264 -130
- package/dist/cjs/store/turso/reconcile.js.map +1 -1
- package/dist/esm/store/sqlite/connection.js +2 -2
- package/dist/esm/store/sqlite/connection.js.map +1 -1
- package/dist/esm/store/sqlite/open.js +24 -6
- package/dist/esm/store/sqlite/open.js.map +1 -1
- package/dist/esm/store/sqlite/reconcile.js +7 -4
- package/dist/esm/store/sqlite/reconcile.js.map +1 -1
- package/dist/esm/store/transaction.d.ts +2 -1
- package/dist/esm/store/transaction.js +11 -6
- package/dist/esm/store/transaction.js.map +1 -1
- package/dist/esm/store/turso/connection.js +2 -2
- package/dist/esm/store/turso/connection.js.map +1 -1
- package/dist/esm/store/turso/open.d.ts +2 -0
- package/dist/esm/store/turso/open.js +11 -2
- package/dist/esm/store/turso/open.js.map +1 -1
- package/dist/esm/store/turso/reconcile.js +16 -2
- package/dist/esm/store/turso/reconcile.js.map +1 -1
- package/package.json +1 -1
|
@@ -16,6 +16,7 @@ var _reparsets = require("../../scan/reparse.js");
|
|
|
16
16
|
var _segmentts = require("../../text/segment.js");
|
|
17
17
|
var _sharedts = require("../shared.js");
|
|
18
18
|
var _transactionts = require("../transaction.js");
|
|
19
|
+
var _opents = require("./open.js");
|
|
19
20
|
function _array_like_to_array(arr, len) {
|
|
20
21
|
if (len == null || len > arr.length) len = arr.length;
|
|
21
22
|
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
@@ -205,6 +206,8 @@ function ngramSidecar(text) {
|
|
|
205
206
|
// Not a compile-time cap on ALTER TABLE ADD COLUMN (spike-measured: turso accepts 10,000 with
|
|
206
207
|
// no error); the real fence is a SELECT projecting more than this many result columns, which fails to prepare.
|
|
207
208
|
var MAX_FRONTMATTER_COLUMNS = 2000;
|
|
209
|
+
// Changed files above which rebuilding the FTS index beats maintaining it per row (see reconcile).
|
|
210
|
+
var FTS_REBUILD_THRESHOLD = 250;
|
|
208
211
|
// No rowid coupling (unlike sqlite's FTS5 content): `path` is content's own primary key.
|
|
209
212
|
var INSERT_CONTENT_SQL = 'INSERT INTO content ("path", title, summary, text, title_ngram, summary_ngram, text_ngram) VALUES (?, ?, ?, ?, ?, ?, ?)';
|
|
210
213
|
function contentRow(doc) {
|
|
@@ -341,7 +344,7 @@ function reconcile(conn, cfg, baseDir) {
|
|
|
341
344
|
4,
|
|
342
345
|
(0, _transactionts.withTransaction)(conn, function() {
|
|
343
346
|
return _async_to_generator(function() {
|
|
344
|
-
var _feature_remove, _feature_afterReconcile, _iteratorNormalCompletion, _didIteratorError, _iteratorError, _iterator, _step, col, err, rows,
|
|
347
|
+
var _feature_remove, _feature_afterReconcile, _iteratorNormalCompletion, _didIteratorError, _iteratorError, _iterator, _step, col, err, rows, churn, bulk, _iteratorNormalCompletion1, _didIteratorError1, _iteratorError1, _iterator1, _step1, name, err, contentTouched, _iteratorNormalCompletion2, _didIteratorError2, _iteratorError2, _iterator2, _step2, ddl, err, presetTouched, presetRows, _iteratorNormalCompletion3, _didIteratorError3, _iteratorError3, _iteratorNormalCompletion4, _didIteratorError4, _iteratorError4, _iterator3, _step3, doc, _iterator4, _step4, presetName, removedPaths, _iteratorNormalCompletion5, _didIteratorError5, _iteratorError5, _iterator5, _step5, feature, err, _iteratorNormalCompletion6, _didIteratorError6, _iteratorError6, _loop, _iterator6, _step6, err, _iteratorNormalCompletion7, _didIteratorError7, _iteratorError7, _iterator7, _step7, feature1, err;
|
|
345
348
|
return _ts_generator(this, function(_state) {
|
|
346
349
|
switch(_state.label){
|
|
347
350
|
case 0:
|
|
@@ -426,12 +429,82 @@ function reconcile(conn, cfg, baseDir) {
|
|
|
426
429
|
_state.sent();
|
|
427
430
|
_state.label = 10;
|
|
428
431
|
case 10:
|
|
432
|
+
// Tantivy maintains the FTS index per inserted row and the cost grows with the batch, so a
|
|
433
|
+
// large insert is superlinear: 6,566 notes took 945s with the index live, 3.3s built after.
|
|
434
|
+
// Measured crossover against a full rebuild, in changed files: ~250 on a 6,566-note tree
|
|
435
|
+
// (100 -> 895ms, 300 -> 4.1s, 1,300 -> 45.5s, rebuild 3.35s), ~295 on 13,132 (250 -> 5.2s,
|
|
436
|
+
// 400 -> 10.0s, rebuild 6.7s). Doubling the corpus moved it 250 to 295, so a constant fits
|
|
437
|
+
// where a ratio does not: 20% would allow 1,313 files here, costing 45s to save 3.3s.
|
|
438
|
+
// Erring low is the cheap direction, since a needless rebuild is linear and predictable.
|
|
439
|
+
churn = delta.reparsed.length + delta.vanished.length;
|
|
440
|
+
bulk = delta.files.length === 0 || churn > FTS_REBUILD_THRESHOLD;
|
|
441
|
+
_iteratorNormalCompletion1 = true, _didIteratorError1 = false, _iteratorError1 = undefined;
|
|
442
|
+
if (!bulk) return [
|
|
443
|
+
3,
|
|
444
|
+
18
|
|
445
|
+
];
|
|
446
|
+
_state.label = 11;
|
|
447
|
+
case 11:
|
|
448
|
+
_state.trys.push([
|
|
449
|
+
11,
|
|
450
|
+
16,
|
|
451
|
+
17,
|
|
452
|
+
18
|
|
453
|
+
]);
|
|
454
|
+
_iterator1 = _opents.CONTENT_FTS_NAMES[Symbol.iterator]();
|
|
455
|
+
_state.label = 12;
|
|
456
|
+
case 12:
|
|
457
|
+
if (!!(_iteratorNormalCompletion1 = (_step1 = _iterator1.next()).done)) return [
|
|
458
|
+
3,
|
|
459
|
+
15
|
|
460
|
+
];
|
|
461
|
+
name = _step1.value;
|
|
462
|
+
return [
|
|
463
|
+
4,
|
|
464
|
+
conn.exec("DROP INDEX IF EXISTS ".concat(name))
|
|
465
|
+
];
|
|
466
|
+
case 13:
|
|
467
|
+
_state.sent();
|
|
468
|
+
_state.label = 14;
|
|
469
|
+
case 14:
|
|
470
|
+
_iteratorNormalCompletion1 = true;
|
|
471
|
+
return [
|
|
472
|
+
3,
|
|
473
|
+
12
|
|
474
|
+
];
|
|
475
|
+
case 15:
|
|
476
|
+
return [
|
|
477
|
+
3,
|
|
478
|
+
18
|
|
479
|
+
];
|
|
480
|
+
case 16:
|
|
481
|
+
err = _state.sent();
|
|
482
|
+
_didIteratorError1 = true;
|
|
483
|
+
_iteratorError1 = err;
|
|
484
|
+
return [
|
|
485
|
+
3,
|
|
486
|
+
18
|
|
487
|
+
];
|
|
488
|
+
case 17:
|
|
489
|
+
try {
|
|
490
|
+
if (!_iteratorNormalCompletion1 && _iterator1.return != null) {
|
|
491
|
+
_iterator1.return();
|
|
492
|
+
}
|
|
493
|
+
} finally{
|
|
494
|
+
if (_didIteratorError1) {
|
|
495
|
+
throw _iteratorError1;
|
|
496
|
+
}
|
|
497
|
+
}
|
|
498
|
+
return [
|
|
499
|
+
7
|
|
500
|
+
];
|
|
501
|
+
case 18:
|
|
429
502
|
// content is a plain table keyed by its own path (no rowid subquery, unlike sqlite's FTS5
|
|
430
503
|
// content), so vanished and reparsed docs delete in one pass.
|
|
431
504
|
contentTouched = _to_consumable_array(vanished).concat(_to_consumable_array(reparsedExisting));
|
|
432
505
|
if (!(contentTouched.length > 0)) return [
|
|
433
506
|
3,
|
|
434
|
-
|
|
507
|
+
20
|
|
435
508
|
];
|
|
436
509
|
return [
|
|
437
510
|
4,
|
|
@@ -441,25 +514,86 @@ function reconcile(conn, cfg, baseDir) {
|
|
|
441
514
|
];
|
|
442
515
|
}))
|
|
443
516
|
];
|
|
444
|
-
case
|
|
517
|
+
case 19:
|
|
445
518
|
_state.sent();
|
|
446
|
-
_state.label =
|
|
447
|
-
case
|
|
519
|
+
_state.label = 20;
|
|
520
|
+
case 20:
|
|
448
521
|
if (!(parsedDocs.length > 0)) return [
|
|
449
522
|
3,
|
|
450
|
-
|
|
523
|
+
22
|
|
451
524
|
];
|
|
452
525
|
return [
|
|
453
526
|
4,
|
|
454
527
|
conn.runBatch(INSERT_CONTENT_SQL, parsedDocs.map(contentRow))
|
|
455
528
|
];
|
|
456
|
-
case
|
|
529
|
+
case 21:
|
|
457
530
|
_state.sent();
|
|
458
|
-
_state.label =
|
|
459
|
-
case
|
|
531
|
+
_state.label = 22;
|
|
532
|
+
case 22:
|
|
533
|
+
_iteratorNormalCompletion2 = true, _didIteratorError2 = false, _iteratorError2 = undefined;
|
|
534
|
+
if (!bulk) return [
|
|
535
|
+
3,
|
|
536
|
+
30
|
|
537
|
+
];
|
|
538
|
+
_state.label = 23;
|
|
539
|
+
case 23:
|
|
540
|
+
_state.trys.push([
|
|
541
|
+
23,
|
|
542
|
+
28,
|
|
543
|
+
29,
|
|
544
|
+
30
|
|
545
|
+
]);
|
|
546
|
+
_iterator2 = _opents.CONTENT_FTS_DDL[Symbol.iterator]();
|
|
547
|
+
_state.label = 24;
|
|
548
|
+
case 24:
|
|
549
|
+
if (!!(_iteratorNormalCompletion2 = (_step2 = _iterator2.next()).done)) return [
|
|
550
|
+
3,
|
|
551
|
+
27
|
|
552
|
+
];
|
|
553
|
+
ddl = _step2.value;
|
|
554
|
+
return [
|
|
555
|
+
4,
|
|
556
|
+
conn.exec(ddl)
|
|
557
|
+
];
|
|
558
|
+
case 25:
|
|
559
|
+
_state.sent();
|
|
560
|
+
_state.label = 26;
|
|
561
|
+
case 26:
|
|
562
|
+
_iteratorNormalCompletion2 = true;
|
|
563
|
+
return [
|
|
564
|
+
3,
|
|
565
|
+
24
|
|
566
|
+
];
|
|
567
|
+
case 27:
|
|
568
|
+
return [
|
|
569
|
+
3,
|
|
570
|
+
30
|
|
571
|
+
];
|
|
572
|
+
case 28:
|
|
573
|
+
err = _state.sent();
|
|
574
|
+
_didIteratorError2 = true;
|
|
575
|
+
_iteratorError2 = err;
|
|
576
|
+
return [
|
|
577
|
+
3,
|
|
578
|
+
30
|
|
579
|
+
];
|
|
580
|
+
case 29:
|
|
581
|
+
try {
|
|
582
|
+
if (!_iteratorNormalCompletion2 && _iterator2.return != null) {
|
|
583
|
+
_iterator2.return();
|
|
584
|
+
}
|
|
585
|
+
} finally{
|
|
586
|
+
if (_didIteratorError2) {
|
|
587
|
+
throw _iteratorError2;
|
|
588
|
+
}
|
|
589
|
+
}
|
|
590
|
+
return [
|
|
591
|
+
7
|
|
592
|
+
];
|
|
593
|
+
case 30:
|
|
460
594
|
if (!(vanished.length > 0)) return [
|
|
461
595
|
3,
|
|
462
|
-
|
|
596
|
+
32
|
|
463
597
|
];
|
|
464
598
|
return [
|
|
465
599
|
4,
|
|
@@ -469,16 +603,16 @@ function reconcile(conn, cfg, baseDir) {
|
|
|
469
603
|
];
|
|
470
604
|
}))
|
|
471
605
|
];
|
|
472
|
-
case
|
|
606
|
+
case 31:
|
|
473
607
|
_state.sent();
|
|
474
|
-
_state.label =
|
|
475
|
-
case
|
|
608
|
+
_state.label = 32;
|
|
609
|
+
case 32:
|
|
476
610
|
// A preset edit forces a full rebuild, so an unchanged doc's coverage is already correct;
|
|
477
611
|
// new docs have nothing to clear, which keeps cold builds linear.
|
|
478
612
|
presetTouched = _to_consumable_array(vanished).concat(_to_consumable_array(reparsedExisting));
|
|
479
613
|
if (!(presetTouched.length > 0)) return [
|
|
480
614
|
3,
|
|
481
|
-
|
|
615
|
+
34
|
|
482
616
|
];
|
|
483
617
|
return [
|
|
484
618
|
4,
|
|
@@ -488,141 +622,141 @@ function reconcile(conn, cfg, baseDir) {
|
|
|
488
622
|
];
|
|
489
623
|
}))
|
|
490
624
|
];
|
|
491
|
-
case
|
|
625
|
+
case 33:
|
|
492
626
|
_state.sent();
|
|
493
|
-
_state.label =
|
|
494
|
-
case
|
|
627
|
+
_state.label = 34;
|
|
628
|
+
case 34:
|
|
495
629
|
presetRows = [];
|
|
496
|
-
|
|
630
|
+
_iteratorNormalCompletion3 = true, _didIteratorError3 = false, _iteratorError3 = undefined, _iteratorNormalCompletion4 = true, _didIteratorError4 = false, _iteratorError4 = undefined;
|
|
497
631
|
try {
|
|
498
|
-
for(
|
|
499
|
-
doc =
|
|
632
|
+
for(_iterator3 = parsedDocs[Symbol.iterator](); !(_iteratorNormalCompletion4 = (_step3 = _iterator3.next()).done); _iteratorNormalCompletion4 = true){
|
|
633
|
+
doc = _step3.value;
|
|
500
634
|
try {
|
|
501
|
-
for(
|
|
502
|
-
presetName =
|
|
635
|
+
for(_iterator4 = doc.presets[Symbol.iterator](); !(_iteratorNormalCompletion3 = (_step4 = _iterator4.next()).done); _iteratorNormalCompletion3 = true){
|
|
636
|
+
presetName = _step4.value;
|
|
503
637
|
presetRows.push([
|
|
504
638
|
doc.relPath,
|
|
505
639
|
presetName
|
|
506
640
|
]);
|
|
507
641
|
}
|
|
508
642
|
} catch (err) {
|
|
509
|
-
|
|
510
|
-
|
|
643
|
+
_didIteratorError3 = true;
|
|
644
|
+
_iteratorError3 = err;
|
|
511
645
|
} finally{
|
|
512
646
|
try {
|
|
513
|
-
if (!
|
|
514
|
-
|
|
647
|
+
if (!_iteratorNormalCompletion3 && _iterator4.return != null) {
|
|
648
|
+
_iterator4.return();
|
|
515
649
|
}
|
|
516
650
|
} finally{
|
|
517
|
-
if (
|
|
518
|
-
throw
|
|
651
|
+
if (_didIteratorError3) {
|
|
652
|
+
throw _iteratorError3;
|
|
519
653
|
}
|
|
520
654
|
}
|
|
521
655
|
}
|
|
522
656
|
}
|
|
523
657
|
} catch (err) {
|
|
524
|
-
|
|
525
|
-
|
|
658
|
+
_didIteratorError4 = true;
|
|
659
|
+
_iteratorError4 = err;
|
|
526
660
|
} finally{
|
|
527
661
|
try {
|
|
528
|
-
if (!
|
|
529
|
-
|
|
662
|
+
if (!_iteratorNormalCompletion4 && _iterator3.return != null) {
|
|
663
|
+
_iterator3.return();
|
|
530
664
|
}
|
|
531
665
|
} finally{
|
|
532
|
-
if (
|
|
533
|
-
throw
|
|
666
|
+
if (_didIteratorError4) {
|
|
667
|
+
throw _iteratorError4;
|
|
534
668
|
}
|
|
535
669
|
}
|
|
536
670
|
}
|
|
537
671
|
if (!(presetRows.length > 0)) return [
|
|
538
672
|
3,
|
|
539
|
-
|
|
673
|
+
36
|
|
540
674
|
];
|
|
541
675
|
return [
|
|
542
676
|
4,
|
|
543
677
|
conn.runBatch('INSERT INTO preset_files ("path", preset) VALUES (?, ?)', presetRows)
|
|
544
678
|
];
|
|
545
|
-
case
|
|
679
|
+
case 35:
|
|
546
680
|
_state.sent();
|
|
547
|
-
_state.label =
|
|
548
|
-
case
|
|
681
|
+
_state.label = 36;
|
|
682
|
+
case 36:
|
|
549
683
|
removedPaths = _to_consumable_array(vanished).concat(_to_consumable_array(reparsedExisting));
|
|
550
|
-
|
|
684
|
+
_iteratorNormalCompletion5 = true, _didIteratorError5 = false, _iteratorError5 = undefined;
|
|
551
685
|
if (!(removedPaths.length > 0)) return [
|
|
552
686
|
3,
|
|
553
|
-
|
|
687
|
+
44
|
|
554
688
|
];
|
|
555
|
-
_state.label =
|
|
556
|
-
case
|
|
689
|
+
_state.label = 37;
|
|
690
|
+
case 37:
|
|
557
691
|
_state.trys.push([
|
|
558
|
-
|
|
559
|
-
|
|
560
|
-
|
|
561
|
-
|
|
692
|
+
37,
|
|
693
|
+
42,
|
|
694
|
+
43,
|
|
695
|
+
44
|
|
562
696
|
]);
|
|
563
|
-
|
|
564
|
-
_state.label =
|
|
565
|
-
case
|
|
566
|
-
if (!!(
|
|
697
|
+
_iterator5 = features[Symbol.iterator]();
|
|
698
|
+
_state.label = 38;
|
|
699
|
+
case 38:
|
|
700
|
+
if (!!(_iteratorNormalCompletion5 = (_step5 = _iterator5.next()).done)) return [
|
|
567
701
|
3,
|
|
568
|
-
|
|
702
|
+
41
|
|
569
703
|
];
|
|
570
|
-
feature =
|
|
704
|
+
feature = _step5.value;
|
|
571
705
|
return [
|
|
572
706
|
4,
|
|
573
707
|
(_feature_remove = feature.remove) === null || _feature_remove === void 0 ? void 0 : _feature_remove.call(feature, conn, removedPaths, delta)
|
|
574
708
|
];
|
|
575
|
-
case
|
|
709
|
+
case 39:
|
|
576
710
|
_state.sent();
|
|
577
|
-
_state.label =
|
|
578
|
-
case
|
|
579
|
-
|
|
711
|
+
_state.label = 40;
|
|
712
|
+
case 40:
|
|
713
|
+
_iteratorNormalCompletion5 = true;
|
|
580
714
|
return [
|
|
581
715
|
3,
|
|
582
|
-
|
|
716
|
+
38
|
|
583
717
|
];
|
|
584
|
-
case
|
|
718
|
+
case 41:
|
|
585
719
|
return [
|
|
586
720
|
3,
|
|
587
|
-
|
|
721
|
+
44
|
|
588
722
|
];
|
|
589
|
-
case
|
|
723
|
+
case 42:
|
|
590
724
|
err = _state.sent();
|
|
591
|
-
|
|
592
|
-
|
|
725
|
+
_didIteratorError5 = true;
|
|
726
|
+
_iteratorError5 = err;
|
|
593
727
|
return [
|
|
594
728
|
3,
|
|
595
|
-
|
|
729
|
+
44
|
|
596
730
|
];
|
|
597
|
-
case
|
|
731
|
+
case 43:
|
|
598
732
|
try {
|
|
599
|
-
if (!
|
|
600
|
-
|
|
733
|
+
if (!_iteratorNormalCompletion5 && _iterator5.return != null) {
|
|
734
|
+
_iterator5.return();
|
|
601
735
|
}
|
|
602
736
|
} finally{
|
|
603
|
-
if (
|
|
604
|
-
throw
|
|
737
|
+
if (_didIteratorError5) {
|
|
738
|
+
throw _iteratorError5;
|
|
605
739
|
}
|
|
606
740
|
}
|
|
607
741
|
return [
|
|
608
742
|
7
|
|
609
743
|
];
|
|
610
|
-
case
|
|
611
|
-
|
|
612
|
-
_state.label =
|
|
613
|
-
case
|
|
744
|
+
case 44:
|
|
745
|
+
_iteratorNormalCompletion6 = true, _didIteratorError6 = false, _iteratorError6 = undefined;
|
|
746
|
+
_state.label = 45;
|
|
747
|
+
case 45:
|
|
614
748
|
_state.trys.push([
|
|
615
|
-
|
|
616
|
-
|
|
617
|
-
|
|
618
|
-
|
|
749
|
+
45,
|
|
750
|
+
50,
|
|
751
|
+
51,
|
|
752
|
+
52
|
|
619
753
|
]);
|
|
620
754
|
_loop = function() {
|
|
621
755
|
var feature, _feature_store, docsForFeature;
|
|
622
756
|
return _ts_generator(this, function(_state) {
|
|
623
757
|
switch(_state.label){
|
|
624
758
|
case 0:
|
|
625
|
-
feature =
|
|
759
|
+
feature = _step6.value;
|
|
626
760
|
docsForFeature = parsedDocs.map(function(doc) {
|
|
627
761
|
return {
|
|
628
762
|
path: doc.relPath,
|
|
@@ -641,117 +775,117 @@ function reconcile(conn, cfg, baseDir) {
|
|
|
641
775
|
}
|
|
642
776
|
});
|
|
643
777
|
};
|
|
644
|
-
|
|
645
|
-
_state.label =
|
|
646
|
-
case
|
|
647
|
-
if (!!(
|
|
778
|
+
_iterator6 = features[Symbol.iterator]();
|
|
779
|
+
_state.label = 46;
|
|
780
|
+
case 46:
|
|
781
|
+
if (!!(_iteratorNormalCompletion6 = (_step6 = _iterator6.next()).done)) return [
|
|
648
782
|
3,
|
|
649
|
-
|
|
783
|
+
49
|
|
650
784
|
];
|
|
651
785
|
return [
|
|
652
786
|
5,
|
|
653
787
|
_ts_values(_loop())
|
|
654
788
|
];
|
|
655
|
-
case
|
|
789
|
+
case 47:
|
|
656
790
|
_state.sent();
|
|
657
|
-
_state.label =
|
|
658
|
-
case
|
|
659
|
-
|
|
791
|
+
_state.label = 48;
|
|
792
|
+
case 48:
|
|
793
|
+
_iteratorNormalCompletion6 = true;
|
|
660
794
|
return [
|
|
661
795
|
3,
|
|
662
|
-
|
|
796
|
+
46
|
|
663
797
|
];
|
|
664
|
-
case
|
|
798
|
+
case 49:
|
|
665
799
|
return [
|
|
666
800
|
3,
|
|
667
|
-
|
|
801
|
+
52
|
|
668
802
|
];
|
|
669
|
-
case
|
|
803
|
+
case 50:
|
|
670
804
|
err = _state.sent();
|
|
671
|
-
|
|
672
|
-
|
|
805
|
+
_didIteratorError6 = true;
|
|
806
|
+
_iteratorError6 = err;
|
|
673
807
|
return [
|
|
674
808
|
3,
|
|
675
|
-
|
|
809
|
+
52
|
|
676
810
|
];
|
|
677
|
-
case
|
|
811
|
+
case 51:
|
|
678
812
|
try {
|
|
679
|
-
if (!
|
|
680
|
-
|
|
813
|
+
if (!_iteratorNormalCompletion6 && _iterator6.return != null) {
|
|
814
|
+
_iterator6.return();
|
|
681
815
|
}
|
|
682
816
|
} finally{
|
|
683
|
-
if (
|
|
684
|
-
throw
|
|
817
|
+
if (_didIteratorError6) {
|
|
818
|
+
throw _iteratorError6;
|
|
685
819
|
}
|
|
686
820
|
}
|
|
687
821
|
return [
|
|
688
822
|
7
|
|
689
823
|
];
|
|
690
|
-
case
|
|
691
|
-
|
|
692
|
-
_state.label =
|
|
693
|
-
case
|
|
824
|
+
case 52:
|
|
825
|
+
_iteratorNormalCompletion7 = true, _didIteratorError7 = false, _iteratorError7 = undefined;
|
|
826
|
+
_state.label = 53;
|
|
827
|
+
case 53:
|
|
694
828
|
_state.trys.push([
|
|
695
|
-
|
|
696
|
-
|
|
697
|
-
|
|
698
|
-
|
|
829
|
+
53,
|
|
830
|
+
58,
|
|
831
|
+
59,
|
|
832
|
+
60
|
|
699
833
|
]);
|
|
700
|
-
|
|
701
|
-
_state.label =
|
|
702
|
-
case
|
|
703
|
-
if (!!(
|
|
834
|
+
_iterator7 = features[Symbol.iterator]();
|
|
835
|
+
_state.label = 54;
|
|
836
|
+
case 54:
|
|
837
|
+
if (!!(_iteratorNormalCompletion7 = (_step7 = _iterator7.next()).done)) return [
|
|
704
838
|
3,
|
|
705
|
-
|
|
839
|
+
57
|
|
706
840
|
];
|
|
707
|
-
feature1 =
|
|
841
|
+
feature1 = _step7.value;
|
|
708
842
|
return [
|
|
709
843
|
4,
|
|
710
844
|
(_feature_afterReconcile = feature1.afterReconcile) === null || _feature_afterReconcile === void 0 ? void 0 : _feature_afterReconcile.call(feature1, conn, delta)
|
|
711
845
|
];
|
|
712
|
-
case
|
|
846
|
+
case 55:
|
|
713
847
|
_state.sent();
|
|
714
|
-
_state.label =
|
|
715
|
-
case
|
|
716
|
-
|
|
848
|
+
_state.label = 56;
|
|
849
|
+
case 56:
|
|
850
|
+
_iteratorNormalCompletion7 = true;
|
|
717
851
|
return [
|
|
718
852
|
3,
|
|
719
|
-
|
|
853
|
+
54
|
|
720
854
|
];
|
|
721
|
-
case
|
|
855
|
+
case 57:
|
|
722
856
|
return [
|
|
723
857
|
3,
|
|
724
|
-
|
|
858
|
+
60
|
|
725
859
|
];
|
|
726
|
-
case
|
|
860
|
+
case 58:
|
|
727
861
|
err = _state.sent();
|
|
728
|
-
|
|
729
|
-
|
|
862
|
+
_didIteratorError7 = true;
|
|
863
|
+
_iteratorError7 = err;
|
|
730
864
|
return [
|
|
731
865
|
3,
|
|
732
|
-
|
|
866
|
+
60
|
|
733
867
|
];
|
|
734
|
-
case
|
|
868
|
+
case 59:
|
|
735
869
|
try {
|
|
736
|
-
if (!
|
|
737
|
-
|
|
870
|
+
if (!_iteratorNormalCompletion7 && _iterator7.return != null) {
|
|
871
|
+
_iterator7.return();
|
|
738
872
|
}
|
|
739
873
|
} finally{
|
|
740
|
-
if (
|
|
741
|
-
throw
|
|
874
|
+
if (_didIteratorError7) {
|
|
875
|
+
throw _iteratorError7;
|
|
742
876
|
}
|
|
743
877
|
}
|
|
744
878
|
return [
|
|
745
879
|
7
|
|
746
880
|
];
|
|
747
|
-
case
|
|
881
|
+
case 60:
|
|
748
882
|
return [
|
|
749
883
|
2
|
|
750
884
|
];
|
|
751
885
|
}
|
|
752
886
|
});
|
|
753
887
|
})();
|
|
754
|
-
})
|
|
888
|
+
}, _transactionts.BEGIN_WRITE)
|
|
755
889
|
];
|
|
756
890
|
case 5:
|
|
757
891
|
_state.sent();
|