sensemaking 0.19.1 → 0.19.2
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/index.d.cts +1 -1
- package/dist/cjs/index.d.ts +1 -1
- package/dist/cjs/index.js +3 -0
- package/dist/cjs/index.js.map +1 -1
- package/dist/cjs/store/duckdb/fieldStats.js +87 -10
- package/dist/cjs/store/duckdb/fieldStats.js.map +1 -1
- package/dist/cjs/store/duckdb/open.js +3 -2
- package/dist/cjs/store/duckdb/open.js.map +1 -1
- package/dist/cjs/store/duckdb/reconcile.d.cts +2 -6
- package/dist/cjs/store/duckdb/reconcile.d.ts +2 -6
- package/dist/cjs/store/duckdb/reconcile.js +41 -581
- package/dist/cjs/store/duckdb/reconcile.js.map +1 -1
- package/dist/cjs/store/duckdb/store.js +5 -3
- package/dist/cjs/store/duckdb/store.js.map +1 -1
- package/dist/cjs/store/index.d.cts +1 -0
- package/dist/cjs/store/index.d.ts +1 -0
- package/dist/cjs/store/index.js +4 -0
- package/dist/cjs/store/index.js.map +1 -1
- package/dist/cjs/store/reconcile.d.cts +6 -0
- package/dist/cjs/store/reconcile.d.ts +6 -0
- package/dist/cjs/store/reconcile.js +750 -0
- package/dist/cjs/store/reconcile.js.map +1 -0
- package/dist/cjs/store/shared.d.cts +1 -0
- package/dist/cjs/store/shared.d.ts +1 -0
- package/dist/cjs/store/shared.js +37 -0
- package/dist/cjs/store/shared.js.map +1 -1
- package/dist/cjs/store/sqlite/open.js +8 -6
- package/dist/cjs/store/sqlite/open.js.map +1 -1
- package/dist/cjs/store/sqlite/reconcile.d.cts +5 -10
- package/dist/cjs/store/sqlite/reconcile.d.ts +5 -10
- package/dist/cjs/store/sqlite/reconcile.js +48 -850
- package/dist/cjs/store/sqlite/reconcile.js.map +1 -1
- package/dist/cjs/store/sqlite/signature.d.cts +6 -0
- package/dist/cjs/store/sqlite/signature.d.ts +6 -0
- package/dist/cjs/store/sqlite/signature.js +380 -0
- package/dist/cjs/store/sqlite/signature.js.map +1 -0
- package/dist/cjs/store/sqlite/store.js +5 -3
- package/dist/cjs/store/sqlite/store.js.map +1 -1
- package/dist/cjs/store/turso/open.js +3 -2
- package/dist/cjs/store/turso/open.js.map +1 -1
- package/dist/cjs/store/turso/reconcile.d.cts +3 -6
- package/dist/cjs/store/turso/reconcile.d.ts +3 -6
- package/dist/cjs/store/turso/reconcile.js +157 -728
- package/dist/cjs/store/turso/reconcile.js.map +1 -1
- package/dist/cjs/store/turso/store.js +3 -2
- package/dist/cjs/store/turso/store.js.map +1 -1
- package/dist/cjs/store/types.d.cts +12 -2
- package/dist/cjs/store/types.d.ts +12 -2
- package/dist/cjs/store/types.js +14 -0
- package/dist/cjs/store/types.js.map +1 -1
- package/dist/esm/index.d.ts +1 -1
- package/dist/esm/index.js +1 -1
- package/dist/esm/index.js.map +1 -1
- package/dist/esm/store/duckdb/fieldStats.js +32 -19
- package/dist/esm/store/duckdb/fieldStats.js.map +1 -1
- package/dist/esm/store/duckdb/open.js +3 -2
- package/dist/esm/store/duckdb/open.js.map +1 -1
- package/dist/esm/store/duckdb/reconcile.d.ts +2 -6
- package/dist/esm/store/duckdb/reconcile.js +20 -117
- package/dist/esm/store/duckdb/reconcile.js.map +1 -1
- package/dist/esm/store/duckdb/store.js +5 -3
- package/dist/esm/store/duckdb/store.js.map +1 -1
- package/dist/esm/store/index.d.ts +1 -0
- package/dist/esm/store/index.js +1 -0
- package/dist/esm/store/index.js.map +1 -1
- package/dist/esm/store/reconcile.d.ts +6 -0
- package/dist/esm/store/reconcile.js +130 -0
- package/dist/esm/store/reconcile.js.map +1 -0
- package/dist/esm/store/shared.d.ts +1 -0
- package/dist/esm/store/shared.js +9 -0
- package/dist/esm/store/shared.js.map +1 -1
- package/dist/esm/store/sqlite/open.js +4 -2
- package/dist/esm/store/sqlite/open.js.map +1 -1
- package/dist/esm/store/sqlite/reconcile.d.ts +5 -10
- package/dist/esm/store/sqlite/reconcile.js +31 -201
- package/dist/esm/store/sqlite/reconcile.js.map +1 -1
- package/dist/esm/store/sqlite/signature.d.ts +6 -0
- package/dist/esm/store/sqlite/signature.js +58 -0
- package/dist/esm/store/sqlite/signature.js.map +1 -0
- package/dist/esm/store/sqlite/store.js +5 -3
- package/dist/esm/store/sqlite/store.js.map +1 -1
- package/dist/esm/store/turso/open.js +3 -2
- package/dist/esm/store/turso/open.js.map +1 -1
- package/dist/esm/store/turso/reconcile.d.ts +3 -6
- package/dist/esm/store/turso/reconcile.js +30 -145
- package/dist/esm/store/turso/reconcile.js.map +1 -1
- package/dist/esm/store/turso/store.js +3 -2
- package/dist/esm/store/turso/store.js.map +1 -1
- package/dist/esm/store/types.d.ts +12 -2
- package/dist/esm/store/types.js +12 -1
- package/dist/esm/store/types.js.map +1 -1
- package/package.json +1 -1
|
@@ -2,29 +2,25 @@
|
|
|
2
2
|
Object.defineProperty(exports, "__esModule", {
|
|
3
3
|
value: true
|
|
4
4
|
});
|
|
5
|
-
|
|
6
|
-
|
|
7
|
-
|
|
8
|
-
|
|
5
|
+
function _export(target, all) {
|
|
6
|
+
for(var name in all)Object.defineProperty(target, name, {
|
|
7
|
+
enumerable: true,
|
|
8
|
+
get: Object.getOwnPropertyDescriptor(all, name).get
|
|
9
|
+
});
|
|
10
|
+
}
|
|
11
|
+
_export(exports, {
|
|
12
|
+
get FTS_REBUILD_THRESHOLD () {
|
|
13
|
+
return FTS_REBUILD_THRESHOLD;
|
|
14
|
+
},
|
|
15
|
+
get tursoDialect () {
|
|
16
|
+
return tursoDialect;
|
|
9
17
|
}
|
|
10
18
|
});
|
|
11
19
|
var _errorsts = require("../../errors.js");
|
|
12
|
-
var _indexts = require("../../features/index.js");
|
|
13
|
-
var _progressts = require("../../output/progress.js");
|
|
14
|
-
var _indexts1 = require("../../scan/index.js");
|
|
15
|
-
var _reparsets = require("../../scan/reparse.js");
|
|
16
20
|
var _segmentts = require("../../text/segment.js");
|
|
17
21
|
var _sharedts = require("../shared.js");
|
|
18
22
|
var _transactionts = require("../transaction.js");
|
|
19
23
|
var _opents = require("./open.js");
|
|
20
|
-
function _array_like_to_array(arr, len) {
|
|
21
|
-
if (len == null || len > arr.length) len = arr.length;
|
|
22
|
-
for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
|
|
23
|
-
return arr2;
|
|
24
|
-
}
|
|
25
|
-
function _array_without_holes(arr) {
|
|
26
|
-
if (Array.isArray(arr)) return _array_like_to_array(arr);
|
|
27
|
-
}
|
|
28
24
|
function asyncGeneratorStep(gen, resolve, reject, _next, _throw, key, arg) {
|
|
29
25
|
try {
|
|
30
26
|
var info = gen[key](arg);
|
|
@@ -51,17 +47,6 @@ function _async_to_generator(fn) {
|
|
|
51
47
|
});
|
|
52
48
|
};
|
|
53
49
|
}
|
|
54
|
-
function _iterable_to_array(iter) {
|
|
55
|
-
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) {
|
|
56
|
-
return Array.from(iter);
|
|
57
|
-
}
|
|
58
|
-
}
|
|
59
|
-
function _non_iterable_spread() {
|
|
60
|
-
throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
|
61
|
-
}
|
|
62
|
-
function _to_consumable_array(arr) {
|
|
63
|
-
return _array_without_holes(arr) || _iterable_to_array(arr) || _unsupported_iterable_to_array(arr) || _non_iterable_spread();
|
|
64
|
-
}
|
|
65
50
|
function _ts_generator(thisArg, body) {
|
|
66
51
|
var f, y, t, _ = {
|
|
67
52
|
label: 0,
|
|
@@ -161,43 +146,8 @@ function _ts_generator(thisArg, body) {
|
|
|
161
146
|
};
|
|
162
147
|
}
|
|
163
148
|
}
|
|
164
|
-
|
|
165
|
-
|
|
166
|
-
if (m) {
|
|
167
|
-
return m.call(o);
|
|
168
|
-
}
|
|
169
|
-
if (o && typeof o.length === "number") {
|
|
170
|
-
return {
|
|
171
|
-
next: function() {
|
|
172
|
-
if (o && i >= o.length) {
|
|
173
|
-
o = void 0;
|
|
174
|
-
}
|
|
175
|
-
return {
|
|
176
|
-
value: o && o[i++],
|
|
177
|
-
done: !o
|
|
178
|
-
};
|
|
179
|
-
}
|
|
180
|
-
};
|
|
181
|
-
}
|
|
182
|
-
throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
|
|
183
|
-
}
|
|
184
|
-
function _unsupported_iterable_to_array(o, minLen) {
|
|
185
|
-
if (!o) return;
|
|
186
|
-
if (typeof o === "string") return _array_like_to_array(o, minLen);
|
|
187
|
-
var n = Object.prototype.toString.call(o).slice(8, -1);
|
|
188
|
-
if (n === "Object" && o.constructor) n = o.constructor.name;
|
|
189
|
-
if (n === "Map" || n === "Set") return Array.from(n);
|
|
190
|
-
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array(o, minLen);
|
|
191
|
-
}
|
|
192
|
-
// Fork of sqlite/reconcile.ts, not duckdb's, so this store keeps reconcile_max_ms bookkeeping
|
|
193
|
-
// (open.ts's busy timeout derives from it). content is a plain table with "_ngram" sidecars for lexical.ts.
|
|
194
|
-
var CORE_FRONTMATTER_COLUMNS = new Set([
|
|
195
|
-
'path',
|
|
196
|
-
'_mtime',
|
|
197
|
-
'_ctime',
|
|
198
|
-
'_size',
|
|
199
|
-
'_parse_error'
|
|
200
|
-
]);
|
|
149
|
+
// This store's dialect (types.ts's ReconcileDialect) for the shared orchestration in
|
|
150
|
+
// store/reconcile.ts. content is a plain table with "_ngram" sidecars for lexical.ts.
|
|
201
151
|
// '' when the field has no unspaced-script run (the common case), so the ngram index carries
|
|
202
152
|
// nothing for it -- same "pay for nothing when absent" shape as sqlite's segmentField sidecars.
|
|
203
153
|
function ngramSidecar(text) {
|
|
@@ -206,7 +156,6 @@ function ngramSidecar(text) {
|
|
|
206
156
|
// Not a compile-time cap on ALTER TABLE ADD COLUMN (spike-measured: turso accepts 10,000 with
|
|
207
157
|
// no error); the real fence is a SELECT projecting more than this many result columns, which fails to prepare.
|
|
208
158
|
var MAX_FRONTMATTER_COLUMNS = 2000;
|
|
209
|
-
// Changed files above which rebuilding the FTS index beats maintaining it per row (see reconcile).
|
|
210
159
|
var FTS_REBUILD_THRESHOLD = 250;
|
|
211
160
|
// No rowid coupling (unlike sqlite's FTS5 content): `path` is content's own primary key.
|
|
212
161
|
var INSERT_CONTENT_SQL = 'INSERT INTO content ("path", title, summary, text, title_ngram, summary_ngram, text_ngram) VALUES (?, ?, ?, ?, ?, ?, ?)';
|
|
@@ -222,706 +171,186 @@ function contentRow(doc) {
|
|
|
222
171
|
ngramSidecar(text)
|
|
223
172
|
];
|
|
224
173
|
}
|
|
225
|
-
function
|
|
174
|
+
function reconcileContent(conn, touched, docs, delta) {
|
|
226
175
|
return _async_to_generator(function() {
|
|
227
|
-
var
|
|
176
|
+
var churn, bulk, _iteratorNormalCompletion, _didIteratorError, _iteratorError, _iterator, _step, name, err, _iteratorNormalCompletion1, _didIteratorError1, _iteratorError1, _iterator1, _step1, ddl, err;
|
|
228
177
|
return _ts_generator(this, function(_state) {
|
|
229
178
|
switch(_state.label){
|
|
230
179
|
case 0:
|
|
231
|
-
|
|
232
|
-
|
|
233
|
-
|
|
234
|
-
|
|
235
|
-
|
|
236
|
-
|
|
237
|
-
|
|
180
|
+
churn = delta.reparsed.length + delta.vanished.length;
|
|
181
|
+
// Tantivy indexes per inserted row at a cost that grows with the batch, so a large insert is
|
|
182
|
+
// superlinear and a rebuild wins past the threshold.
|
|
183
|
+
bulk = delta.files.length === 0 || churn > FTS_REBUILD_THRESHOLD;
|
|
184
|
+
_iteratorNormalCompletion = true, _didIteratorError = false, _iteratorError = undefined;
|
|
185
|
+
if (!bulk) return [
|
|
186
|
+
3,
|
|
187
|
+
8
|
|
238
188
|
];
|
|
189
|
+
_state.label = 1;
|
|
239
190
|
case 1:
|
|
240
|
-
|
|
241
|
-
|
|
242
|
-
|
|
243
|
-
|
|
244
|
-
|
|
191
|
+
_state.trys.push([
|
|
192
|
+
1,
|
|
193
|
+
6,
|
|
194
|
+
7,
|
|
195
|
+
8
|
|
196
|
+
]);
|
|
197
|
+
_iterator = _opents.CONTENT_FTS_NAMES[Symbol.iterator]();
|
|
198
|
+
_state.label = 2;
|
|
245
199
|
case 2:
|
|
246
|
-
|
|
247
|
-
|
|
248
|
-
|
|
249
|
-
r.path,
|
|
250
|
-
r
|
|
251
|
-
];
|
|
252
|
-
}));
|
|
253
|
-
vanished = existingRows.filter(function(r) {
|
|
254
|
-
return !currentSet.has(r.path);
|
|
255
|
-
}).map(function(r) {
|
|
256
|
-
return r.path;
|
|
257
|
-
});
|
|
258
|
-
toReparse = files.filter(function(f) {
|
|
259
|
-
var row = existing.get(f.relPath);
|
|
260
|
-
return !row || row._mtime !== f.mtimeMs || row._size !== f.size;
|
|
261
|
-
});
|
|
262
|
-
if (vanished.length === 0 && toReparse.length === 0) return [
|
|
263
|
-
2,
|
|
264
|
-
{
|
|
265
|
-
parsed: 0,
|
|
266
|
-
warnings: []
|
|
267
|
-
}
|
|
200
|
+
if (!!(_iteratorNormalCompletion = (_step = _iterator.next()).done)) return [
|
|
201
|
+
3,
|
|
202
|
+
5
|
|
268
203
|
];
|
|
269
|
-
|
|
204
|
+
name = _step.value;
|
|
270
205
|
return [
|
|
271
206
|
4,
|
|
272
|
-
(
|
|
207
|
+
conn.exec("DROP INDEX IF EXISTS ".concat(name))
|
|
273
208
|
];
|
|
274
209
|
case 3:
|
|
275
|
-
|
|
276
|
-
|
|
277
|
-
|
|
278
|
-
|
|
210
|
+
_state.sent();
|
|
211
|
+
_state.label = 4;
|
|
212
|
+
case 4:
|
|
213
|
+
_iteratorNormalCompletion = true;
|
|
279
214
|
return [
|
|
280
|
-
|
|
281
|
-
|
|
215
|
+
3,
|
|
216
|
+
2
|
|
282
217
|
];
|
|
283
|
-
case
|
|
284
|
-
|
|
285
|
-
|
|
286
|
-
|
|
218
|
+
case 5:
|
|
219
|
+
return [
|
|
220
|
+
3,
|
|
221
|
+
8
|
|
222
|
+
];
|
|
223
|
+
case 6:
|
|
224
|
+
err = _state.sent();
|
|
225
|
+
_didIteratorError = true;
|
|
226
|
+
_iteratorError = err;
|
|
227
|
+
return [
|
|
228
|
+
3,
|
|
229
|
+
8
|
|
230
|
+
];
|
|
231
|
+
case 7:
|
|
287
232
|
try {
|
|
288
|
-
|
|
289
|
-
|
|
290
|
-
seenColumns.add(col);
|
|
233
|
+
if (!_iteratorNormalCompletion && _iterator.return != null) {
|
|
234
|
+
_iterator.return();
|
|
291
235
|
}
|
|
292
|
-
} catch (err) {
|
|
293
|
-
_didIteratorError = true;
|
|
294
|
-
_iteratorError = err;
|
|
295
236
|
} finally{
|
|
296
|
-
|
|
297
|
-
|
|
298
|
-
_iterator.return();
|
|
299
|
-
}
|
|
300
|
-
} finally{
|
|
301
|
-
if (_didIteratorError) {
|
|
302
|
-
throw _iteratorError;
|
|
303
|
-
}
|
|
237
|
+
if (_didIteratorError) {
|
|
238
|
+
throw _iteratorError;
|
|
304
239
|
}
|
|
305
240
|
}
|
|
306
|
-
|
|
307
|
-
|
|
308
|
-
|
|
309
|
-
|
|
310
|
-
|
|
311
|
-
|
|
312
|
-
|
|
313
|
-
|
|
314
|
-
});
|
|
315
|
-
// ON CONFLICT UPDATE, rather than the delete-and-insert `OR` clause, keeps the row's identity stable across reparses.
|
|
316
|
-
insertSql = "INSERT INTO frontmatter (".concat(writableColumns.map(_sharedts.quoteIdent).join(', '), ") VALUES (").concat(writableColumns.map(function() {
|
|
317
|
-
return '?';
|
|
318
|
-
}).join(', '), ') ON CONFLICT("path") DO UPDATE SET ').concat(writableColumns.filter(function(c) {
|
|
319
|
-
return c !== 'path';
|
|
320
|
-
}).map(function(c) {
|
|
321
|
-
return "".concat((0, _sharedts.quoteIdent)(c), " = excluded.").concat((0, _sharedts.quoteIdent)(c));
|
|
322
|
-
}).join(', '));
|
|
323
|
-
added = toReparse.filter(function(f) {
|
|
324
|
-
return !existing.has(f.relPath);
|
|
325
|
-
}).map(function(f) {
|
|
326
|
-
return f.relPath;
|
|
327
|
-
});
|
|
328
|
-
delta = {
|
|
329
|
-
files: files,
|
|
330
|
-
reparsed: parsedDocs.map(function(d) {
|
|
331
|
-
return d.relPath;
|
|
332
|
-
}),
|
|
333
|
-
added: added,
|
|
334
|
-
vanished: vanished
|
|
335
|
-
};
|
|
336
|
-
addedSet = new Set(added);
|
|
337
|
-
reparsedExisting = parsedDocs.map(function(d) {
|
|
338
|
-
return d.relPath;
|
|
339
|
-
}).filter(function(p) {
|
|
340
|
-
return !addedSet.has(p);
|
|
341
|
-
});
|
|
342
|
-
txStart = Date.now();
|
|
241
|
+
return [
|
|
242
|
+
7
|
|
243
|
+
];
|
|
244
|
+
case 8:
|
|
245
|
+
if (!(touched.length > 0)) return [
|
|
246
|
+
3,
|
|
247
|
+
10
|
|
248
|
+
];
|
|
343
249
|
return [
|
|
344
250
|
4,
|
|
345
|
-
(
|
|
346
|
-
return
|
|
347
|
-
|
|
348
|
-
|
|
349
|
-
|
|
350
|
-
case 0:
|
|
351
|
-
_iteratorNormalCompletion = true, _didIteratorError = false, _iteratorError = undefined;
|
|
352
|
-
_state.label = 1;
|
|
353
|
-
case 1:
|
|
354
|
-
_state.trys.push([
|
|
355
|
-
1,
|
|
356
|
-
6,
|
|
357
|
-
7,
|
|
358
|
-
8
|
|
359
|
-
]);
|
|
360
|
-
_iterator = newColumns[Symbol.iterator]();
|
|
361
|
-
_state.label = 2;
|
|
362
|
-
case 2:
|
|
363
|
-
if (!!(_iteratorNormalCompletion = (_step = _iterator.next()).done)) return [
|
|
364
|
-
3,
|
|
365
|
-
5
|
|
366
|
-
];
|
|
367
|
-
col = _step.value;
|
|
368
|
-
return [
|
|
369
|
-
4,
|
|
370
|
-
conn.exec("ALTER TABLE frontmatter ADD COLUMN ".concat((0, _sharedts.quoteIdent)(col)))
|
|
371
|
-
];
|
|
372
|
-
case 3:
|
|
373
|
-
_state.sent();
|
|
374
|
-
_state.label = 4;
|
|
375
|
-
case 4:
|
|
376
|
-
_iteratorNormalCompletion = true;
|
|
377
|
-
return [
|
|
378
|
-
3,
|
|
379
|
-
2
|
|
380
|
-
];
|
|
381
|
-
case 5:
|
|
382
|
-
return [
|
|
383
|
-
3,
|
|
384
|
-
8
|
|
385
|
-
];
|
|
386
|
-
case 6:
|
|
387
|
-
err = _state.sent();
|
|
388
|
-
_didIteratorError = true;
|
|
389
|
-
_iteratorError = err;
|
|
390
|
-
return [
|
|
391
|
-
3,
|
|
392
|
-
8
|
|
393
|
-
];
|
|
394
|
-
case 7:
|
|
395
|
-
try {
|
|
396
|
-
if (!_iteratorNormalCompletion && _iterator.return != null) {
|
|
397
|
-
_iterator.return();
|
|
398
|
-
}
|
|
399
|
-
} finally{
|
|
400
|
-
if (_didIteratorError) {
|
|
401
|
-
throw _iteratorError;
|
|
402
|
-
}
|
|
403
|
-
}
|
|
404
|
-
return [
|
|
405
|
-
7
|
|
406
|
-
];
|
|
407
|
-
case 8:
|
|
408
|
-
if (!(parsedDocs.length > 0)) return [
|
|
409
|
-
3,
|
|
410
|
-
10
|
|
411
|
-
];
|
|
412
|
-
rows = parsedDocs.map(function(doc) {
|
|
413
|
-
return writableColumns.map(function(col) {
|
|
414
|
-
var _doc_data_col;
|
|
415
|
-
if (col === 'path') return doc.relPath;
|
|
416
|
-
if (col === '_mtime') return doc.mtimeMs;
|
|
417
|
-
if (col === '_ctime') return doc.ctimeMs;
|
|
418
|
-
if (col === '_size') return doc.size;
|
|
419
|
-
// Written per parse, unlike _rank, which a feature pass owns and the upsert skips.
|
|
420
|
-
if (col === '_parse_error') return doc.parseError;
|
|
421
|
-
return (_doc_data_col = doc.data[col]) !== null && _doc_data_col !== void 0 ? _doc_data_col : null;
|
|
422
|
-
});
|
|
423
|
-
});
|
|
424
|
-
return [
|
|
425
|
-
4,
|
|
426
|
-
conn.runBatch(insertSql, rows)
|
|
427
|
-
];
|
|
428
|
-
case 9:
|
|
429
|
-
_state.sent();
|
|
430
|
-
_state.label = 10;
|
|
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:
|
|
502
|
-
// content is a plain table keyed by its own path (no rowid subquery, unlike sqlite's FTS5
|
|
503
|
-
// content), so vanished and reparsed docs delete in one pass.
|
|
504
|
-
contentTouched = _to_consumable_array(vanished).concat(_to_consumable_array(reparsedExisting));
|
|
505
|
-
if (!(contentTouched.length > 0)) return [
|
|
506
|
-
3,
|
|
507
|
-
20
|
|
508
|
-
];
|
|
509
|
-
return [
|
|
510
|
-
4,
|
|
511
|
-
conn.runBatch('DELETE FROM content WHERE "path" = ?', contentTouched.map(function(p) {
|
|
512
|
-
return [
|
|
513
|
-
p
|
|
514
|
-
];
|
|
515
|
-
}))
|
|
516
|
-
];
|
|
517
|
-
case 19:
|
|
518
|
-
_state.sent();
|
|
519
|
-
_state.label = 20;
|
|
520
|
-
case 20:
|
|
521
|
-
if (!(parsedDocs.length > 0)) return [
|
|
522
|
-
3,
|
|
523
|
-
22
|
|
524
|
-
];
|
|
525
|
-
return [
|
|
526
|
-
4,
|
|
527
|
-
conn.runBatch(INSERT_CONTENT_SQL, parsedDocs.map(contentRow))
|
|
528
|
-
];
|
|
529
|
-
case 21:
|
|
530
|
-
_state.sent();
|
|
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:
|
|
594
|
-
if (!(vanished.length > 0)) return [
|
|
595
|
-
3,
|
|
596
|
-
32
|
|
597
|
-
];
|
|
598
|
-
return [
|
|
599
|
-
4,
|
|
600
|
-
conn.runBatch('DELETE FROM frontmatter WHERE "path" = ?', vanished.map(function(p) {
|
|
601
|
-
return [
|
|
602
|
-
p
|
|
603
|
-
];
|
|
604
|
-
}))
|
|
605
|
-
];
|
|
606
|
-
case 31:
|
|
607
|
-
_state.sent();
|
|
608
|
-
_state.label = 32;
|
|
609
|
-
case 32:
|
|
610
|
-
// A preset edit forces a full rebuild, so an unchanged doc's coverage is already correct;
|
|
611
|
-
// new docs have nothing to clear, which keeps cold builds linear.
|
|
612
|
-
presetTouched = _to_consumable_array(vanished).concat(_to_consumable_array(reparsedExisting));
|
|
613
|
-
if (!(presetTouched.length > 0)) return [
|
|
614
|
-
3,
|
|
615
|
-
34
|
|
616
|
-
];
|
|
617
|
-
return [
|
|
618
|
-
4,
|
|
619
|
-
conn.runBatch('DELETE FROM preset_files WHERE "path" = ?', presetTouched.map(function(p) {
|
|
620
|
-
return [
|
|
621
|
-
p
|
|
622
|
-
];
|
|
623
|
-
}))
|
|
624
|
-
];
|
|
625
|
-
case 33:
|
|
626
|
-
_state.sent();
|
|
627
|
-
_state.label = 34;
|
|
628
|
-
case 34:
|
|
629
|
-
presetRows = [];
|
|
630
|
-
_iteratorNormalCompletion3 = true, _didIteratorError3 = false, _iteratorError3 = undefined, _iteratorNormalCompletion4 = true, _didIteratorError4 = false, _iteratorError4 = undefined;
|
|
631
|
-
try {
|
|
632
|
-
for(_iterator3 = parsedDocs[Symbol.iterator](); !(_iteratorNormalCompletion4 = (_step3 = _iterator3.next()).done); _iteratorNormalCompletion4 = true){
|
|
633
|
-
doc = _step3.value;
|
|
634
|
-
try {
|
|
635
|
-
for(_iterator4 = doc.presets[Symbol.iterator](); !(_iteratorNormalCompletion3 = (_step4 = _iterator4.next()).done); _iteratorNormalCompletion3 = true){
|
|
636
|
-
presetName = _step4.value;
|
|
637
|
-
presetRows.push([
|
|
638
|
-
doc.relPath,
|
|
639
|
-
presetName
|
|
640
|
-
]);
|
|
641
|
-
}
|
|
642
|
-
} catch (err) {
|
|
643
|
-
_didIteratorError3 = true;
|
|
644
|
-
_iteratorError3 = err;
|
|
645
|
-
} finally{
|
|
646
|
-
try {
|
|
647
|
-
if (!_iteratorNormalCompletion3 && _iterator4.return != null) {
|
|
648
|
-
_iterator4.return();
|
|
649
|
-
}
|
|
650
|
-
} finally{
|
|
651
|
-
if (_didIteratorError3) {
|
|
652
|
-
throw _iteratorError3;
|
|
653
|
-
}
|
|
654
|
-
}
|
|
655
|
-
}
|
|
656
|
-
}
|
|
657
|
-
} catch (err) {
|
|
658
|
-
_didIteratorError4 = true;
|
|
659
|
-
_iteratorError4 = err;
|
|
660
|
-
} finally{
|
|
661
|
-
try {
|
|
662
|
-
if (!_iteratorNormalCompletion4 && _iterator3.return != null) {
|
|
663
|
-
_iterator3.return();
|
|
664
|
-
}
|
|
665
|
-
} finally{
|
|
666
|
-
if (_didIteratorError4) {
|
|
667
|
-
throw _iteratorError4;
|
|
668
|
-
}
|
|
669
|
-
}
|
|
670
|
-
}
|
|
671
|
-
if (!(presetRows.length > 0)) return [
|
|
672
|
-
3,
|
|
673
|
-
36
|
|
674
|
-
];
|
|
675
|
-
return [
|
|
676
|
-
4,
|
|
677
|
-
conn.runBatch('INSERT INTO preset_files ("path", preset) VALUES (?, ?)', presetRows)
|
|
678
|
-
];
|
|
679
|
-
case 35:
|
|
680
|
-
_state.sent();
|
|
681
|
-
_state.label = 36;
|
|
682
|
-
case 36:
|
|
683
|
-
removedPaths = _to_consumable_array(vanished).concat(_to_consumable_array(reparsedExisting));
|
|
684
|
-
_iteratorNormalCompletion5 = true, _didIteratorError5 = false, _iteratorError5 = undefined;
|
|
685
|
-
if (!(removedPaths.length > 0)) return [
|
|
686
|
-
3,
|
|
687
|
-
44
|
|
688
|
-
];
|
|
689
|
-
_state.label = 37;
|
|
690
|
-
case 37:
|
|
691
|
-
_state.trys.push([
|
|
692
|
-
37,
|
|
693
|
-
42,
|
|
694
|
-
43,
|
|
695
|
-
44
|
|
696
|
-
]);
|
|
697
|
-
_iterator5 = features[Symbol.iterator]();
|
|
698
|
-
_state.label = 38;
|
|
699
|
-
case 38:
|
|
700
|
-
if (!!(_iteratorNormalCompletion5 = (_step5 = _iterator5.next()).done)) return [
|
|
701
|
-
3,
|
|
702
|
-
41
|
|
703
|
-
];
|
|
704
|
-
feature = _step5.value;
|
|
705
|
-
return [
|
|
706
|
-
4,
|
|
707
|
-
(_feature_remove = feature.remove) === null || _feature_remove === void 0 ? void 0 : _feature_remove.call(feature, conn, removedPaths, delta)
|
|
708
|
-
];
|
|
709
|
-
case 39:
|
|
710
|
-
_state.sent();
|
|
711
|
-
_state.label = 40;
|
|
712
|
-
case 40:
|
|
713
|
-
_iteratorNormalCompletion5 = true;
|
|
714
|
-
return [
|
|
715
|
-
3,
|
|
716
|
-
38
|
|
717
|
-
];
|
|
718
|
-
case 41:
|
|
719
|
-
return [
|
|
720
|
-
3,
|
|
721
|
-
44
|
|
722
|
-
];
|
|
723
|
-
case 42:
|
|
724
|
-
err = _state.sent();
|
|
725
|
-
_didIteratorError5 = true;
|
|
726
|
-
_iteratorError5 = err;
|
|
727
|
-
return [
|
|
728
|
-
3,
|
|
729
|
-
44
|
|
730
|
-
];
|
|
731
|
-
case 43:
|
|
732
|
-
try {
|
|
733
|
-
if (!_iteratorNormalCompletion5 && _iterator5.return != null) {
|
|
734
|
-
_iterator5.return();
|
|
735
|
-
}
|
|
736
|
-
} finally{
|
|
737
|
-
if (_didIteratorError5) {
|
|
738
|
-
throw _iteratorError5;
|
|
739
|
-
}
|
|
740
|
-
}
|
|
741
|
-
return [
|
|
742
|
-
7
|
|
743
|
-
];
|
|
744
|
-
case 44:
|
|
745
|
-
_iteratorNormalCompletion6 = true, _didIteratorError6 = false, _iteratorError6 = undefined;
|
|
746
|
-
_state.label = 45;
|
|
747
|
-
case 45:
|
|
748
|
-
_state.trys.push([
|
|
749
|
-
45,
|
|
750
|
-
50,
|
|
751
|
-
51,
|
|
752
|
-
52
|
|
753
|
-
]);
|
|
754
|
-
_loop = function() {
|
|
755
|
-
var feature, _feature_store, docsForFeature;
|
|
756
|
-
return _ts_generator(this, function(_state) {
|
|
757
|
-
switch(_state.label){
|
|
758
|
-
case 0:
|
|
759
|
-
feature = _step6.value;
|
|
760
|
-
docsForFeature = parsedDocs.map(function(doc) {
|
|
761
|
-
return {
|
|
762
|
-
path: doc.relPath,
|
|
763
|
-
extracted: doc.extracted[feature.name]
|
|
764
|
-
};
|
|
765
|
-
});
|
|
766
|
-
return [
|
|
767
|
-
4,
|
|
768
|
-
(_feature_store = feature.store) === null || _feature_store === void 0 ? void 0 : _feature_store.call(feature, conn, docsForFeature, delta)
|
|
769
|
-
];
|
|
770
|
-
case 1:
|
|
771
|
-
_state.sent();
|
|
772
|
-
return [
|
|
773
|
-
2
|
|
774
|
-
];
|
|
775
|
-
}
|
|
776
|
-
});
|
|
777
|
-
};
|
|
778
|
-
_iterator6 = features[Symbol.iterator]();
|
|
779
|
-
_state.label = 46;
|
|
780
|
-
case 46:
|
|
781
|
-
if (!!(_iteratorNormalCompletion6 = (_step6 = _iterator6.next()).done)) return [
|
|
782
|
-
3,
|
|
783
|
-
49
|
|
784
|
-
];
|
|
785
|
-
return [
|
|
786
|
-
5,
|
|
787
|
-
_ts_values(_loop())
|
|
788
|
-
];
|
|
789
|
-
case 47:
|
|
790
|
-
_state.sent();
|
|
791
|
-
_state.label = 48;
|
|
792
|
-
case 48:
|
|
793
|
-
_iteratorNormalCompletion6 = true;
|
|
794
|
-
return [
|
|
795
|
-
3,
|
|
796
|
-
46
|
|
797
|
-
];
|
|
798
|
-
case 49:
|
|
799
|
-
return [
|
|
800
|
-
3,
|
|
801
|
-
52
|
|
802
|
-
];
|
|
803
|
-
case 50:
|
|
804
|
-
err = _state.sent();
|
|
805
|
-
_didIteratorError6 = true;
|
|
806
|
-
_iteratorError6 = err;
|
|
807
|
-
return [
|
|
808
|
-
3,
|
|
809
|
-
52
|
|
810
|
-
];
|
|
811
|
-
case 51:
|
|
812
|
-
try {
|
|
813
|
-
if (!_iteratorNormalCompletion6 && _iterator6.return != null) {
|
|
814
|
-
_iterator6.return();
|
|
815
|
-
}
|
|
816
|
-
} finally{
|
|
817
|
-
if (_didIteratorError6) {
|
|
818
|
-
throw _iteratorError6;
|
|
819
|
-
}
|
|
820
|
-
}
|
|
821
|
-
return [
|
|
822
|
-
7
|
|
823
|
-
];
|
|
824
|
-
case 52:
|
|
825
|
-
_iteratorNormalCompletion7 = true, _didIteratorError7 = false, _iteratorError7 = undefined;
|
|
826
|
-
_state.label = 53;
|
|
827
|
-
case 53:
|
|
828
|
-
_state.trys.push([
|
|
829
|
-
53,
|
|
830
|
-
58,
|
|
831
|
-
59,
|
|
832
|
-
60
|
|
833
|
-
]);
|
|
834
|
-
_iterator7 = features[Symbol.iterator]();
|
|
835
|
-
_state.label = 54;
|
|
836
|
-
case 54:
|
|
837
|
-
if (!!(_iteratorNormalCompletion7 = (_step7 = _iterator7.next()).done)) return [
|
|
838
|
-
3,
|
|
839
|
-
57
|
|
840
|
-
];
|
|
841
|
-
feature1 = _step7.value;
|
|
842
|
-
return [
|
|
843
|
-
4,
|
|
844
|
-
(_feature_afterReconcile = feature1.afterReconcile) === null || _feature_afterReconcile === void 0 ? void 0 : _feature_afterReconcile.call(feature1, conn, delta)
|
|
845
|
-
];
|
|
846
|
-
case 55:
|
|
847
|
-
_state.sent();
|
|
848
|
-
_state.label = 56;
|
|
849
|
-
case 56:
|
|
850
|
-
_iteratorNormalCompletion7 = true;
|
|
851
|
-
return [
|
|
852
|
-
3,
|
|
853
|
-
54
|
|
854
|
-
];
|
|
855
|
-
case 57:
|
|
856
|
-
return [
|
|
857
|
-
3,
|
|
858
|
-
60
|
|
859
|
-
];
|
|
860
|
-
case 58:
|
|
861
|
-
err = _state.sent();
|
|
862
|
-
_didIteratorError7 = true;
|
|
863
|
-
_iteratorError7 = err;
|
|
864
|
-
return [
|
|
865
|
-
3,
|
|
866
|
-
60
|
|
867
|
-
];
|
|
868
|
-
case 59:
|
|
869
|
-
try {
|
|
870
|
-
if (!_iteratorNormalCompletion7 && _iterator7.return != null) {
|
|
871
|
-
_iterator7.return();
|
|
872
|
-
}
|
|
873
|
-
} finally{
|
|
874
|
-
if (_didIteratorError7) {
|
|
875
|
-
throw _iteratorError7;
|
|
876
|
-
}
|
|
877
|
-
}
|
|
878
|
-
return [
|
|
879
|
-
7
|
|
880
|
-
];
|
|
881
|
-
case 60:
|
|
882
|
-
return [
|
|
883
|
-
2
|
|
884
|
-
];
|
|
885
|
-
}
|
|
886
|
-
});
|
|
887
|
-
})();
|
|
888
|
-
}, _transactionts.BEGIN_WRITE)
|
|
251
|
+
conn.runBatch('DELETE FROM content WHERE "path" = ?', touched.map(function(p) {
|
|
252
|
+
return [
|
|
253
|
+
p
|
|
254
|
+
];
|
|
255
|
+
}))
|
|
889
256
|
];
|
|
890
|
-
case
|
|
257
|
+
case 9:
|
|
891
258
|
_state.sent();
|
|
892
|
-
|
|
893
|
-
|
|
894
|
-
|
|
259
|
+
_state.label = 10;
|
|
260
|
+
case 10:
|
|
261
|
+
if (!(docs.length > 0)) return [
|
|
262
|
+
3,
|
|
263
|
+
12
|
|
264
|
+
];
|
|
895
265
|
return [
|
|
896
266
|
4,
|
|
897
|
-
(
|
|
267
|
+
conn.runBatch(INSERT_CONTENT_SQL, docs.map(contentRow))
|
|
898
268
|
];
|
|
899
|
-
case
|
|
900
|
-
|
|
901
|
-
|
|
902
|
-
|
|
903
|
-
|
|
904
|
-
if (!
|
|
269
|
+
case 11:
|
|
270
|
+
_state.sent();
|
|
271
|
+
_state.label = 12;
|
|
272
|
+
case 12:
|
|
273
|
+
_iteratorNormalCompletion1 = true, _didIteratorError1 = false, _iteratorError1 = undefined;
|
|
274
|
+
if (!bulk) return [
|
|
905
275
|
3,
|
|
906
|
-
|
|
276
|
+
20
|
|
277
|
+
];
|
|
278
|
+
_state.label = 13;
|
|
279
|
+
case 13:
|
|
280
|
+
_state.trys.push([
|
|
281
|
+
13,
|
|
282
|
+
18,
|
|
283
|
+
19,
|
|
284
|
+
20
|
|
285
|
+
]);
|
|
286
|
+
_iterator1 = _opents.CONTENT_FTS_DDL[Symbol.iterator]();
|
|
287
|
+
_state.label = 14;
|
|
288
|
+
case 14:
|
|
289
|
+
if (!!(_iteratorNormalCompletion1 = (_step1 = _iterator1.next()).done)) return [
|
|
290
|
+
3,
|
|
291
|
+
17
|
|
907
292
|
];
|
|
293
|
+
ddl = _step1.value;
|
|
908
294
|
return [
|
|
909
295
|
4,
|
|
910
|
-
|
|
296
|
+
conn.exec(ddl)
|
|
911
297
|
];
|
|
912
|
-
case
|
|
298
|
+
case 15:
|
|
913
299
|
_state.sent();
|
|
914
|
-
_state.label =
|
|
915
|
-
case
|
|
300
|
+
_state.label = 16;
|
|
301
|
+
case 16:
|
|
302
|
+
_iteratorNormalCompletion1 = true;
|
|
303
|
+
return [
|
|
304
|
+
3,
|
|
305
|
+
14
|
|
306
|
+
];
|
|
307
|
+
case 17:
|
|
916
308
|
return [
|
|
917
|
-
|
|
918
|
-
|
|
919
|
-
|
|
920
|
-
|
|
309
|
+
3,
|
|
310
|
+
20
|
|
311
|
+
];
|
|
312
|
+
case 18:
|
|
313
|
+
err = _state.sent();
|
|
314
|
+
_didIteratorError1 = true;
|
|
315
|
+
_iteratorError1 = err;
|
|
316
|
+
return [
|
|
317
|
+
3,
|
|
318
|
+
20
|
|
319
|
+
];
|
|
320
|
+
case 19:
|
|
321
|
+
try {
|
|
322
|
+
if (!_iteratorNormalCompletion1 && _iterator1.return != null) {
|
|
323
|
+
_iterator1.return();
|
|
921
324
|
}
|
|
325
|
+
} finally{
|
|
326
|
+
if (_didIteratorError1) {
|
|
327
|
+
throw _iteratorError1;
|
|
328
|
+
}
|
|
329
|
+
}
|
|
330
|
+
return [
|
|
331
|
+
7
|
|
332
|
+
];
|
|
333
|
+
case 20:
|
|
334
|
+
return [
|
|
335
|
+
2
|
|
922
336
|
];
|
|
923
337
|
}
|
|
924
338
|
});
|
|
925
339
|
})();
|
|
926
340
|
}
|
|
341
|
+
var tursoDialect = {
|
|
342
|
+
beginMode: function beginMode() {
|
|
343
|
+
return _transactionts.BEGIN_WRITE;
|
|
344
|
+
},
|
|
345
|
+
checkColumnLimit: function checkColumnLimit(count) {
|
|
346
|
+
if (count > MAX_FRONTMATTER_COLUMNS) {
|
|
347
|
+
throw new _errorsts.SenseError('COLUMN_LIMIT', "frontmatter would need ".concat(count, " columns, crossing turso's SELECT result-set column limit (").concat(MAX_FRONTMATTER_COLUMNS, "; ALTER TABLE ADD COLUMN itself accepts far more, but a query projecting past this many columns fails to prepare). Narrow the presets' include globs so fewer/other files are indexed, or fix whatever is generating unbounded frontmatter keys."));
|
|
348
|
+
}
|
|
349
|
+
},
|
|
350
|
+
columnTypeSuffix: function columnTypeSuffix() {
|
|
351
|
+
return '';
|
|
352
|
+
},
|
|
353
|
+
reconcileContent: reconcileContent,
|
|
354
|
+
recordDuration: _sharedts.recordReconcileDuration
|
|
355
|
+
};
|
|
927
356
|
/* 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; }
|