@agentshouse/mdruntime 0.1.0-alpha.2 → 0.1.0-alpha.21

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.
Files changed (110) hide show
  1. package/AGENTS.md +87 -0
  2. package/dist/adapter.d.ts +145 -28
  3. package/dist/adapter.d.ts.map +1 -1
  4. package/dist/adapter.js +2 -1
  5. package/dist/adapter.js.map +1 -1
  6. package/dist/bootstrap.d.ts +11 -13
  7. package/dist/bootstrap.d.ts.map +1 -1
  8. package/dist/bootstrap.js +25 -24
  9. package/dist/bootstrap.js.map +1 -1
  10. package/dist/change-set.d.ts +33 -0
  11. package/dist/change-set.d.ts.map +1 -0
  12. package/dist/change-set.js +74 -0
  13. package/dist/change-set.js.map +1 -0
  14. package/dist/change.d.ts +70 -0
  15. package/dist/change.d.ts.map +1 -0
  16. package/dist/change.js +12 -0
  17. package/dist/change.js.map +1 -0
  18. package/dist/client.d.ts +66 -0
  19. package/dist/client.d.ts.map +1 -0
  20. package/dist/client.js +229 -0
  21. package/dist/client.js.map +1 -0
  22. package/dist/collection.d.ts +25 -3
  23. package/dist/collection.d.ts.map +1 -1
  24. package/dist/collection.js +97 -25
  25. package/dist/collection.js.map +1 -1
  26. package/dist/connection.d.ts +87 -5
  27. package/dist/connection.d.ts.map +1 -1
  28. package/dist/connection.js +1653 -70
  29. package/dist/connection.js.map +1 -1
  30. package/dist/conversation.d.ts +57 -0
  31. package/dist/conversation.d.ts.map +1 -0
  32. package/dist/conversation.js +404 -0
  33. package/dist/conversation.js.map +1 -0
  34. package/dist/durability.d.ts +9 -0
  35. package/dist/durability.d.ts.map +1 -0
  36. package/dist/durability.js +11 -0
  37. package/dist/durability.js.map +1 -0
  38. package/dist/file.d.ts +20 -0
  39. package/dist/file.d.ts.map +1 -0
  40. package/dist/file.js +149 -0
  41. package/dist/file.js.map +1 -0
  42. package/dist/host.d.ts +13 -0
  43. package/dist/host.d.ts.map +1 -0
  44. package/dist/host.js +229 -0
  45. package/dist/host.js.map +1 -0
  46. package/dist/identity.d.ts +2 -0
  47. package/dist/identity.d.ts.map +1 -0
  48. package/dist/identity.js +16 -0
  49. package/dist/identity.js.map +1 -0
  50. package/dist/index.d.ts +13 -2
  51. package/dist/index.d.ts.map +1 -1
  52. package/dist/index.js +1 -0
  53. package/dist/index.js.map +1 -1
  54. package/dist/log.d.ts +5 -0
  55. package/dist/log.d.ts.map +1 -0
  56. package/dist/log.js +15 -0
  57. package/dist/log.js.map +1 -0
  58. package/dist/memory.d.ts +17 -2
  59. package/dist/memory.d.ts.map +1 -1
  60. package/dist/memory.js +264 -21
  61. package/dist/memory.js.map +1 -1
  62. package/dist/model.d.ts +70 -0
  63. package/dist/model.d.ts.map +1 -0
  64. package/dist/model.js +28 -0
  65. package/dist/model.js.map +1 -0
  66. package/dist/outcome.d.ts +37 -0
  67. package/dist/outcome.d.ts.map +1 -0
  68. package/dist/outcome.js +23 -0
  69. package/dist/outcome.js.map +1 -0
  70. package/dist/overlay.d.ts +10 -0
  71. package/dist/overlay.d.ts.map +1 -0
  72. package/dist/overlay.js +245 -0
  73. package/dist/overlay.js.map +1 -0
  74. package/dist/paths.d.ts +6 -0
  75. package/dist/paths.d.ts.map +1 -0
  76. package/dist/paths.js +47 -0
  77. package/dist/paths.js.map +1 -0
  78. package/dist/query.d.ts +13 -0
  79. package/dist/query.d.ts.map +1 -0
  80. package/dist/query.js +18 -0
  81. package/dist/query.js.map +1 -0
  82. package/dist/refresh.d.ts +14 -0
  83. package/dist/refresh.d.ts.map +1 -0
  84. package/dist/refresh.js +65 -0
  85. package/dist/refresh.js.map +1 -0
  86. package/dist/replica.d.ts +33 -0
  87. package/dist/replica.d.ts.map +1 -0
  88. package/dist/replica.js +134 -0
  89. package/dist/replica.js.map +1 -0
  90. package/dist/save.d.ts +35 -0
  91. package/dist/save.d.ts.map +1 -0
  92. package/dist/save.js +561 -0
  93. package/dist/save.js.map +1 -0
  94. package/dist/status.d.ts +25 -0
  95. package/dist/status.d.ts.map +1 -0
  96. package/dist/status.js +32 -0
  97. package/dist/status.js.map +1 -0
  98. package/dist/store.d.ts +86 -4
  99. package/dist/store.d.ts.map +1 -1
  100. package/dist/store.js +394 -9
  101. package/dist/store.js.map +1 -1
  102. package/dist/transfer.d.ts +5 -0
  103. package/dist/transfer.d.ts.map +1 -0
  104. package/dist/transfer.js +5 -0
  105. package/dist/transfer.js.map +1 -0
  106. package/dist/wire.d.ts +63 -0
  107. package/dist/wire.d.ts.map +1 -0
  108. package/dist/wire.js +142 -0
  109. package/dist/wire.js.map +1 -0
  110. package/package.json +13 -4
package/dist/save.js ADDED
@@ -0,0 +1,561 @@
1
+ import { apply, links, parse, serialize } from '@agentshouse/mdmodel';
2
+ import { immutable } from './change.js';
3
+ import { governing, parseCollection, typesAt, validateCollection } from './collection.js';
4
+ import { changeBatchIdentity } from './identity.js';
5
+ import { overlay } from './overlay.js';
6
+ import { beneath, covered, normalize, relative, resolve } from './paths.js';
7
+ function refuse(rule, file, location) {
8
+ return {
9
+ kind: 'refused',
10
+ refusal: {
11
+ rule,
12
+ ...file === undefined ? {} : {
13
+ file
14
+ },
15
+ ...location === undefined ? {} : {
16
+ location
17
+ }
18
+ }
19
+ };
20
+ }
21
+ function members(visible, prefix) {
22
+ return [
23
+ ...Object.keys(visible.documents),
24
+ ...visible.binaryTargets
25
+ ].filter((path)=>beneath(prefix, path)).sort();
26
+ }
27
+ function spread(change, path, member) {
28
+ if (change.kind === 'remove') return {
29
+ kind: 'remove',
30
+ path: member
31
+ };
32
+ return {
33
+ kind: 'move',
34
+ path: member,
35
+ to: `${change.to}${member.slice(path.length)}`
36
+ };
37
+ }
38
+ function expand(changes, visible) {
39
+ const expanded = [];
40
+ for (const change of changes){
41
+ if (change.kind !== 'move' && change.kind !== 'remove') {
42
+ expanded.push(change);
43
+ continue;
44
+ }
45
+ const path = normalize(change.path);
46
+ const to = change.kind === 'move' ? normalize(change.to) : '';
47
+ if (path === null || path === '' || to === null || change.kind === 'move' && to === '') {
48
+ return {
49
+ kind: 'refused',
50
+ refusal: {
51
+ rule: 'room-root',
52
+ file: change.path
53
+ }
54
+ };
55
+ }
56
+ const structural = change.kind === 'move' ? {
57
+ ...change,
58
+ path,
59
+ to
60
+ } : {
61
+ ...change,
62
+ path
63
+ };
64
+ const present = visible.documents[path] !== undefined || visible.binaryTargets.includes(path);
65
+ if (present) {
66
+ expanded.push(structural);
67
+ continue;
68
+ }
69
+ const beneathIt = members(visible, path);
70
+ if (beneathIt.length === 0) {
71
+ return {
72
+ kind: 'refused',
73
+ refusal: {
74
+ rule: 'path-absent',
75
+ file: change.path
76
+ }
77
+ };
78
+ }
79
+ for (const member of beneathIt)expanded.push(spread(structural, path, member));
80
+ }
81
+ return {
82
+ kind: 'changes',
83
+ changes: expanded
84
+ };
85
+ }
86
+ function referenceField(spec) {
87
+ if (typeof spec !== 'object' || spec === null) return false;
88
+ const declared = spec;
89
+ return declared.kind === 'reference' || declared.kind === 'list' && declared.of === 'reference';
90
+ }
91
+ function definitionOf(types, type) {
92
+ return types.find((declared)=>declared.name === type);
93
+ }
94
+ function retarget(value, from, to, moves) {
95
+ if (Array.isArray(value)) {
96
+ const next = value.map((item)=>retarget(item, from, to, moves) ?? item);
97
+ return next.some((item, index)=>item !== value[index]) ? next : undefined;
98
+ }
99
+ if (typeof value !== 'string') return undefined;
100
+ const target = resolve(from, value);
101
+ if (target === null) return undefined;
102
+ const next = relative(to, moves.get(target) ?? target);
103
+ return next === value ? undefined : next;
104
+ }
105
+ function edited(document, path, changes) {
106
+ let next = document;
107
+ for (const change of changes){
108
+ if (change.path !== path) continue;
109
+ if (change.kind !== 'section' && change.kind !== 'preamble') continue;
110
+ const applied = apply(next, change.kind === 'preamble' ? {
111
+ kind: 'preamble',
112
+ value: change.value,
113
+ prior: next.preamble
114
+ } : {
115
+ kind: 'section',
116
+ name: change.name,
117
+ value: change.value,
118
+ prior: next.sections[change.name]
119
+ });
120
+ if (applied.outcome === 'applied') next = applied.document;
121
+ }
122
+ return next;
123
+ }
124
+ function bodies(path, before, after) {
125
+ const changes = [];
126
+ if (after.preamble !== before.preamble) {
127
+ changes.push({
128
+ kind: 'preamble',
129
+ path,
130
+ value: after.preamble
131
+ });
132
+ }
133
+ for (const [name, value] of Object.entries(after.sections)){
134
+ if (before.sections[name] === value) continue;
135
+ changes.push({
136
+ kind: 'section',
137
+ path,
138
+ name,
139
+ value
140
+ });
141
+ }
142
+ return changes;
143
+ }
144
+ function relinks(path, moved, before, moves) {
145
+ let after = before;
146
+ for (const link of links(before, path)){
147
+ const destination = moves.get(link.target) ?? link.target;
148
+ if (destination === link.target && moved === path) continue;
149
+ const to = relative(moved, destination);
150
+ if (to === relative(path, link.target)) continue;
151
+ const applied = apply(after, {
152
+ kind: 'link',
153
+ href: link.href,
154
+ to
155
+ });
156
+ if (applied.outcome === 'refuse') {
157
+ return {
158
+ kind: 'refused',
159
+ refusal: {
160
+ rule: applied.refusal.rule,
161
+ file: path,
162
+ ...applied.refusal.location === undefined ? {} : {
163
+ location: applied.refusal.location
164
+ }
165
+ }
166
+ };
167
+ }
168
+ after = applied.document;
169
+ }
170
+ if (after === before) return {
171
+ kind: 'changes',
172
+ changes: []
173
+ };
174
+ if (before.type === undefined) {
175
+ return {
176
+ kind: 'changes',
177
+ changes: [
178
+ {
179
+ kind: 'replace',
180
+ path,
181
+ content: serialize(after)
182
+ }
183
+ ]
184
+ };
185
+ }
186
+ return {
187
+ kind: 'changes',
188
+ changes: bodies(path, before, after)
189
+ };
190
+ }
191
+ function subsumed(merged, path) {
192
+ for(let index = merged.length - 1; index >= 0; index -= 1){
193
+ const item = merged[index];
194
+ if (item.path !== path) continue;
195
+ if (item.kind === 'section' || item.kind === 'preamble') merged.splice(index, 1);
196
+ }
197
+ }
198
+ function rewrites(changes, visible) {
199
+ const moves = new Map();
200
+ const settled = new Set();
201
+ for (const change of changes){
202
+ if (change.kind === 'move') moves.set(change.path, change.to);
203
+ if (change.kind === 'remove' || change.kind === 'replace' || change.kind === 'create') {
204
+ settled.add(change.path);
205
+ }
206
+ if (change.kind === 'field') settled.add(`${change.path} ${change.name}`);
207
+ }
208
+ if (moves.size === 0) return {
209
+ kind: 'changes',
210
+ changes
211
+ };
212
+ const merged = [
213
+ ...changes
214
+ ];
215
+ const added = [];
216
+ for (const [path, document] of Object.entries(visible.collection.documents)){
217
+ if (settled.has(path)) continue;
218
+ const moved = moves.get(path) ?? path;
219
+ const definition = definitionOf(typesAt(visible.collection.composition, path), document.type);
220
+ for (const [name, spec] of Object.entries(definition?.fields ?? {})){
221
+ if (!referenceField(spec) || settled.has(`${path} ${name}`)) continue;
222
+ const value = retarget(document.fields[name], path, moved, moves);
223
+ if (value === undefined) continue;
224
+ added.push({
225
+ kind: 'field',
226
+ path,
227
+ name,
228
+ value
229
+ });
230
+ }
231
+ const relinked = relinks(path, moved, edited(document, path, merged), moves);
232
+ if (relinked.kind === 'refused') return relinked;
233
+ for (const change of relinked.changes){
234
+ if (change.kind === 'replace') {
235
+ subsumed(merged, path);
236
+ added.push(change);
237
+ continue;
238
+ }
239
+ const index = merged.findIndex((item)=>item.kind === change.kind && item.path === path && (change.kind !== 'section' || item.kind === 'section' && item.name === change.name));
240
+ if (index === -1) added.push(change);
241
+ else merged[index] = change;
242
+ }
243
+ }
244
+ return {
245
+ kind: 'changes',
246
+ changes: [
247
+ ...added,
248
+ ...merged
249
+ ]
250
+ };
251
+ }
252
+ function anticipated(changes, preconditions, rewritten, visible) {
253
+ const derived = rewritten.filter((change)=>!changes.includes(change));
254
+ return {
255
+ changes: rewritten,
256
+ preconditions: [
257
+ ...preconditionsOf(derived, visible),
258
+ ...preconditions
259
+ ]
260
+ };
261
+ }
262
+ export function providerRewritten(batch, visible) {
263
+ const rewritten = rewrites(batch.changes, visible);
264
+ if (rewritten.kind === 'refused') return batch;
265
+ return {
266
+ ...batch,
267
+ ...anticipated(batch.changes, batch.preconditions, rewritten.changes, visible)
268
+ };
269
+ }
270
+ function targets(value, from) {
271
+ const values = Array.isArray(value) ? value : [
272
+ value
273
+ ];
274
+ const resolved = [];
275
+ for (const item of values){
276
+ if (typeof item !== 'string') continue;
277
+ const target = resolve(from, item);
278
+ if (target !== null) resolved.push(target);
279
+ }
280
+ return resolved;
281
+ }
282
+ function incoming(collection, removed) {
283
+ const found = new Map();
284
+ const note = (target, file)=>{
285
+ if (!removed.has(target)) return;
286
+ const referrers = found.get(target) ?? new Set();
287
+ referrers.add(file);
288
+ found.set(target, referrers);
289
+ };
290
+ for (const [path, document] of Object.entries(collection.documents)){
291
+ const definition = definitionOf(typesAt(collection.composition, path), document.type);
292
+ for (const [name, spec] of Object.entries(definition?.fields ?? {})){
293
+ if (!referenceField(spec)) continue;
294
+ for (const target of targets(document.fields[name], path))note(target, path);
295
+ }
296
+ for (const link of links(document, path))note(link.target, path);
297
+ }
298
+ const [first] = [
299
+ ...found.keys()
300
+ ].sort();
301
+ if (first === undefined) return null;
302
+ const every = new Set();
303
+ for (const referrers of found.values())for (const file of referrers)every.add(file);
304
+ return {
305
+ kind: 'refused',
306
+ refusal: {
307
+ rule: 'referenced-missing-file',
308
+ file: first,
309
+ referrers: [
310
+ ...every
311
+ ].sort()
312
+ }
313
+ };
314
+ }
315
+ function affected(change) {
316
+ return change.kind === 'move' ? [
317
+ change.path,
318
+ change.to
319
+ ] : [
320
+ change.path
321
+ ];
322
+ }
323
+ function definitionAddresses(composition) {
324
+ const addresses = new Set();
325
+ if (composition.model.status !== 'unavailable') {
326
+ for (const path of Object.keys(composition.model.snapshot.definitions))addresses.add(path);
327
+ }
328
+ if (composition.selection !== null && composition.selection.model.status !== 'unavailable') {
329
+ for (const path of Object.keys(composition.selection.model.snapshot.definitions)){
330
+ addresses.add(path);
331
+ }
332
+ }
333
+ return addresses;
334
+ }
335
+ function guard(changes, input) {
336
+ const existing = new Set([
337
+ ...Object.keys(input.visible.documents),
338
+ ...input.visible.binaryTargets
339
+ ]);
340
+ const definitions = definitionAddresses(input.composition);
341
+ for (const change of changes){
342
+ for (const path of affected(change)){
343
+ const normalized = normalize(path);
344
+ if (normalized === null || normalized === '') return refuse('room-root', path);
345
+ if (definitions.has(normalized)) return refuse('model-definition', normalized);
346
+ if (covered(input.providerOwnedPaths, normalized)) {
347
+ return refuse('provider-owned-path', normalized);
348
+ }
349
+ const operation = change.kind === 'remove' ? 'delete' : 'write';
350
+ if (!covered(input.operations[operation], normalized)) return refuse(`${operation}-grant`, normalized);
351
+ }
352
+ if (change.kind === 'create') {
353
+ if (existing.has(change.path)) return refuse('path-collision', change.path);
354
+ existing.add(change.path);
355
+ continue;
356
+ }
357
+ if (change.kind === 'move') {
358
+ if (!existing.has(change.path)) return refuse('path-absent', change.path);
359
+ if (existing.has(change.to)) return refuse('path-collision', change.to);
360
+ existing.delete(change.path);
361
+ existing.add(change.to);
362
+ continue;
363
+ }
364
+ if (!existing.has(change.path)) return refuse('path-absent', change.path);
365
+ if (change.kind === 'remove') {
366
+ existing.delete(change.path);
367
+ continue;
368
+ }
369
+ if (change.kind === 'replace') {
370
+ if (input.visible.revisions[change.path] === undefined) {
371
+ return refuse('unknown-revision', change.path);
372
+ }
373
+ continue;
374
+ }
375
+ const document = input.visible.collection.documents[change.path];
376
+ if (document === undefined) return refuse('path-absent', change.path);
377
+ if (change.kind === 'section' && document.sections[change.name] === undefined) {
378
+ return refuse('required-section', change.path, change.name);
379
+ }
380
+ }
381
+ return null;
382
+ }
383
+ function existence(visible, path) {
384
+ const revision = visible.revisions[path];
385
+ return revision === undefined ? {
386
+ kind: 'present',
387
+ path
388
+ } : {
389
+ kind: 'revision',
390
+ path,
391
+ revision
392
+ };
393
+ }
394
+ function preconditionsOf(changes, visible) {
395
+ const preconditions = [];
396
+ const seen = new Set();
397
+ const add = (precondition)=>{
398
+ const part = precondition.kind === 'field' || precondition.kind === 'section' ? precondition.name : '';
399
+ const identity = `${precondition.kind} ${precondition.path} ${part}`;
400
+ if (seen.has(identity)) return;
401
+ seen.add(identity);
402
+ preconditions.push(precondition);
403
+ };
404
+ for (const change of changes){
405
+ if (change.kind === 'field') {
406
+ const document = visible.collection.documents[change.path];
407
+ add({
408
+ kind: 'field',
409
+ path: change.path,
410
+ name: change.name,
411
+ value: document.fields[change.name]
412
+ });
413
+ continue;
414
+ }
415
+ if (change.kind === 'section') {
416
+ const document = visible.collection.documents[change.path];
417
+ add({
418
+ kind: 'section',
419
+ path: change.path,
420
+ name: change.name,
421
+ value: document.sections[change.name]
422
+ });
423
+ continue;
424
+ }
425
+ if (change.kind === 'preamble') {
426
+ const document = visible.collection.documents[change.path];
427
+ add({
428
+ kind: 'preamble',
429
+ path: change.path,
430
+ value: document.preamble
431
+ });
432
+ continue;
433
+ }
434
+ if (change.kind === 'create') {
435
+ add({
436
+ kind: 'absent',
437
+ path: change.path
438
+ });
439
+ continue;
440
+ }
441
+ add(existence(visible, change.path));
442
+ if (change.kind === 'move') add({
443
+ kind: 'absent',
444
+ path: change.to
445
+ });
446
+ }
447
+ return preconditions;
448
+ }
449
+ function depth(path) {
450
+ return path.split('/').length;
451
+ }
452
+ function exceeded(limits, changes, resulting) {
453
+ const written = changes.map((change)=>change.kind === 'move' ? change.to : change.path);
454
+ const created = changes.filter((change)=>change.kind === 'create' || change.kind === 'move').map((change)=>change.kind === 'move' ? change.to : change.path);
455
+ for (const limit of limits){
456
+ const value = limit.value;
457
+ if (typeof value !== 'number') continue;
458
+ if (limit.name === 'change-batch-operations' && changes.length > value) {
459
+ return refuse('provider-limit', undefined, limit.name);
460
+ }
461
+ if (limit.name === 'document-size') {
462
+ const large = written.find((path)=>(resulting.documents[path] ?? '').length > value);
463
+ if (large !== undefined) return refuse('provider-limit', large, limit.name);
464
+ }
465
+ if (limit.name === 'path-length') {
466
+ const long = created.find((path)=>path.length > value);
467
+ if (long !== undefined) return refuse('provider-limit', long, limit.name);
468
+ }
469
+ if (limit.name === 'path-depth') {
470
+ const deep = created.find((path)=>depth(path) > value);
471
+ if (deep !== undefined) return refuse('provider-limit', deep, limit.name);
472
+ }
473
+ }
474
+ return null;
475
+ }
476
+ export function buildBatch(input) {
477
+ const structural = input.changes.find((change)=>change.kind === 'move' || change.kind === 'remove');
478
+ if (structural !== undefined && Object.entries(input.visible.collection.documents).some(([path, document])=>document.type !== undefined && document.type !== 'any' && governing(input.composition, path).status === 'unavailable')) return refuse('model-unavailable', structural.path);
479
+ const expanded = expand(input.changes, input.visible);
480
+ if (expanded.kind === 'refused') return expanded;
481
+ const rewritten = rewrites(expanded.changes, input.visible);
482
+ if (rewritten.kind === 'refused') return rewritten;
483
+ const changes = input.rewriting === 'provider' ? expanded.changes : rewritten.changes;
484
+ if (changes.length === 0) return refuse('no-change');
485
+ const refusal = guard(changes, input);
486
+ if (refusal !== null) return refusal;
487
+ const preconditions = preconditionsOf(changes, input.visible);
488
+ const predicted = input.rewriting === 'provider' ? anticipated(changes, preconditions, rewritten.changes, input.visible) : {
489
+ changes,
490
+ preconditions
491
+ };
492
+ const resulting = overlay(input.visible, [
493
+ {
494
+ id: '',
495
+ baseRoomVersion: input.baseRoomVersion,
496
+ ...predicted
497
+ }
498
+ ]);
499
+ const removed = new Set(changes.filter((change)=>change.kind === 'remove').map((change)=>change.path));
500
+ if (removed.size > 0) {
501
+ const referenced = incoming(parseCollection(resulting.documents, input.composition), removed);
502
+ if (referenced !== null) return referenced;
503
+ }
504
+ const typed = (content)=>{
505
+ if (content === undefined) return false;
506
+ const parsed = parse(content);
507
+ return parsed.ok && parsed.document.type !== undefined && parsed.document.type !== 'any';
508
+ };
509
+ const typedPaths = [
510
+ ...new Set(predicted.changes.flatMap(affected))
511
+ ].filter((path)=>typed(input.visible.documents[path]) || typed(resulting.documents[path]));
512
+ const needsModel = typedPaths.length > 0;
513
+ const withoutModel = typedPaths.find((path)=>governing(input.composition, path).status === 'unavailable');
514
+ if (needsModel && (withoutModel !== undefined || input.binding === null)) {
515
+ return refuse('model-unavailable', withoutModel ?? typedPaths[0]);
516
+ }
517
+ const validationText = needsModel ? resulting.documents : Object.fromEntries(Object.entries(resulting.documents).filter(([path])=>predicted.changes.some((change)=>affected(change).includes(path))));
518
+ const verdict = validateCollection(validationText, resulting.binaryTargets, input.composition, input.binding);
519
+ if (verdict.verdict === 'refuse') {
520
+ return {
521
+ kind: 'refused',
522
+ refusal: {
523
+ ...verdict.source === 'model' ? {
524
+ source: 'model'
525
+ } : {},
526
+ rule: verdict.rule,
527
+ file: verdict.file,
528
+ ...verdict.location === undefined ? {} : {
529
+ location: verdict.location
530
+ },
531
+ ...verdict.referrers === undefined ? {} : {
532
+ referrers: verdict.referrers
533
+ }
534
+ }
535
+ };
536
+ }
537
+ const limited = exceeded(input.providerLimits, changes, resulting);
538
+ if (limited !== null) return limited;
539
+ const validated = typedPaths.map((path)=>governing(input.composition, path)).find((model)=>model.status !== 'unavailable');
540
+ return {
541
+ kind: 'batch',
542
+ batch: immutable({
543
+ id: changeBatchIdentity(),
544
+ baseRoomVersion: input.baseRoomVersion,
545
+ changes,
546
+ preconditions,
547
+ ...input.writtenBy === undefined ? {} : {
548
+ writtenBy: input.writtenBy
549
+ },
550
+ ...validated === undefined ? {} : {
551
+ validation: {
552
+ identity: validated.snapshot.identity,
553
+ version: validated.snapshot.version,
554
+ source: validated.status
555
+ }
556
+ }
557
+ })
558
+ };
559
+ }
560
+
561
+ //# sourceMappingURL=save.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"sources":["/workspace/packages/mdruntime/src/save.ts"],"sourcesContent":["import type { AttachedModelBinding, ModelState } from './model.js';\nimport { apply, links, parse, serialize, type Document } from '@agentshouse/mdmodel';\nimport type { ProviderLimit } from './adapter.js';\nimport {\n immutable,\n type Change,\n type ChangeBatch,\n type Precondition,\n type WrittenBy,\n} from './change.js';\nimport {\n governing,\n parseCollection,\n typesAt,\n validateCollection,\n type Collection,\n type Composition,\n type MdType,\n} from './collection.js';\nimport { changeBatchIdentity } from './identity.js';\nimport { overlay, type Layer } from './overlay.js';\nimport { beneath, covered, normalize, relative, resolve } from './paths.js';\nimport type { VisibleLayer } from './replica.js';\n\nexport type SaveRefusal = {\n source?: 'model';\n rule: string;\n file?: string;\n location?: string;\n referrers?: readonly string[];\n};\n\nexport type Rewriting = 'runtime' | 'provider';\n\nexport type SaveInput = {\n composition: Composition;\n rewriting: Rewriting;\n baseRoomVersion: string;\n operations: import('./adapter.js').OperationScopes;\n binding: AttachedModelBinding | null;\n providerOwnedPaths: readonly string[];\n providerLimits: readonly ProviderLimit[];\n visible: VisibleLayer;\n changes: readonly Change[];\n writtenBy?: WrittenBy;\n};\n\nexport type BatchResult =\n | { kind: 'batch'; batch: ChangeBatch }\n | { kind: 'refused'; refusal: SaveRefusal };\n\ntype Structural = { kind: 'move'; path: string; to: string } | { kind: 'remove'; path: string };\n\ntype Expansion =\n | { kind: 'changes'; changes: readonly Change[] }\n | { kind: 'refused'; refusal: SaveRefusal };\n\nfunction refuse(rule: string, file?: string, location?: string): BatchResult {\n return {\n kind: 'refused',\n refusal: {\n rule,\n ...(file === undefined ? {} : { file }),\n ...(location === undefined ? {} : { location }),\n },\n };\n}\n\nfunction members(visible: Layer, prefix: string): readonly string[] {\n return [...Object.keys(visible.documents), ...visible.binaryTargets]\n .filter((path) => beneath(prefix, path))\n .sort();\n}\n\nfunction spread(change: Structural, path: string, member: string): Change {\n if (change.kind === 'remove') return { kind: 'remove', path: member };\n return { kind: 'move', path: member, to: `${change.to}${member.slice(path.length)}` };\n}\n\nfunction expand(changes: readonly Change[], visible: VisibleLayer): Expansion {\n const expanded: Change[] = [];\n for (const change of changes) {\n if (change.kind !== 'move' && change.kind !== 'remove') {\n expanded.push(change);\n continue;\n }\n const path = normalize(change.path);\n const to = change.kind === 'move' ? normalize(change.to) : '';\n if (path === null || path === '' || to === null || (change.kind === 'move' && to === '')) {\n return { kind: 'refused', refusal: { rule: 'room-root', file: change.path } };\n }\n const structural = change.kind === 'move' ? { ...change, path, to } : { ...change, path };\n const present = visible.documents[path] !== undefined || visible.binaryTargets.includes(path);\n if (present) {\n expanded.push(structural);\n continue;\n }\n const beneathIt = members(visible, path);\n if (beneathIt.length === 0) {\n return { kind: 'refused', refusal: { rule: 'path-absent', file: change.path } };\n }\n for (const member of beneathIt) expanded.push(spread(structural, path, member));\n }\n return { kind: 'changes', changes: expanded };\n}\n\nfunction referenceField(spec: unknown): boolean {\n if (typeof spec !== 'object' || spec === null) return false;\n const declared = spec as { kind?: unknown; of?: unknown };\n return declared.kind === 'reference' || (declared.kind === 'list' && declared.of === 'reference');\n}\n\nfunction definitionOf(types: readonly MdType[], type: string | undefined) {\n return types.find((declared) => declared.name === type);\n}\n\nfunction retarget(\n value: unknown,\n from: string,\n to: string,\n moves: ReadonlyMap<string, string>,\n): unknown {\n if (Array.isArray(value)) {\n const next = value.map((item) => retarget(item, from, to, moves) ?? item);\n return next.some((item, index) => item !== value[index]) ? next : undefined;\n }\n if (typeof value !== 'string') return undefined;\n const target = resolve(from, value);\n if (target === null) return undefined;\n const next = relative(to, moves.get(target) ?? target);\n return next === value ? undefined : next;\n}\n\nfunction edited(document: Document, path: string, changes: readonly Change[]): Document {\n let next = document;\n for (const change of changes) {\n if (change.path !== path) continue;\n if (change.kind !== 'section' && change.kind !== 'preamble') continue;\n const applied = apply(\n next,\n change.kind === 'preamble'\n ? { kind: 'preamble', value: change.value, prior: next.preamble }\n : {\n kind: 'section',\n name: change.name,\n value: change.value,\n prior: next.sections[change.name],\n },\n );\n if (applied.outcome === 'applied') next = applied.document;\n }\n return next;\n}\n\nfunction bodies(path: string, before: Document, after: Document): readonly Change[] {\n const changes: Change[] = [];\n if (after.preamble !== before.preamble) {\n changes.push({ kind: 'preamble', path, value: after.preamble });\n }\n for (const [name, value] of Object.entries(after.sections)) {\n if (before.sections[name] === value) continue;\n changes.push({ kind: 'section', path, name, value });\n }\n return changes;\n}\n\nfunction relinks(\n path: string,\n moved: string,\n before: Document,\n moves: ReadonlyMap<string, string>,\n): Expansion {\n let after = before;\n for (const link of links(before, path)) {\n const destination = moves.get(link.target) ?? link.target;\n if (destination === link.target && moved === path) continue;\n const to = relative(moved, destination);\n if (to === relative(path, link.target)) continue;\n const applied = apply(after, { kind: 'link', href: link.href, to });\n if (applied.outcome === 'refuse') {\n return {\n kind: 'refused',\n refusal: {\n rule: applied.refusal.rule,\n file: path,\n ...(applied.refusal.location === undefined ? {} : { location: applied.refusal.location }),\n },\n };\n }\n after = applied.document;\n }\n if (after === before) return { kind: 'changes', changes: [] };\n if (before.type === undefined) {\n return { kind: 'changes', changes: [{ kind: 'replace', path, content: serialize(after) }] };\n }\n return { kind: 'changes', changes: bodies(path, before, after) };\n}\n\nfunction subsumed(merged: Change[], path: string) {\n for (let index = merged.length - 1; index >= 0; index -= 1) {\n const item = merged[index];\n if (item.path !== path) continue;\n if (item.kind === 'section' || item.kind === 'preamble') merged.splice(index, 1);\n }\n}\n\nfunction rewrites(changes: readonly Change[], visible: VisibleLayer): Expansion {\n const moves = new Map<string, string>();\n const settled = new Set<string>();\n for (const change of changes) {\n if (change.kind === 'move') moves.set(change.path, change.to);\n if (change.kind === 'remove' || change.kind === 'replace' || change.kind === 'create') {\n settled.add(change.path);\n }\n if (change.kind === 'field') settled.add(`${change.path} ${change.name}`);\n }\n if (moves.size === 0) return { kind: 'changes', changes };\n const merged = [...changes];\n const added: Change[] = [];\n for (const [path, document] of Object.entries(visible.collection.documents)) {\n if (settled.has(path)) continue;\n const moved = moves.get(path) ?? path;\n const definition = definitionOf(typesAt(visible.collection.composition, path), document.type);\n for (const [name, spec] of Object.entries(definition?.fields ?? {})) {\n if (!referenceField(spec) || settled.has(`${path} ${name}`)) continue;\n const value = retarget(document.fields[name], path, moved, moves);\n if (value === undefined) continue;\n added.push({ kind: 'field', path, name, value });\n }\n const relinked = relinks(path, moved, edited(document, path, merged), moves);\n if (relinked.kind === 'refused') return relinked;\n for (const change of relinked.changes) {\n if (change.kind === 'replace') {\n subsumed(merged, path);\n added.push(change);\n continue;\n }\n const index = merged.findIndex(\n (item) =>\n item.kind === change.kind &&\n item.path === path &&\n (change.kind !== 'section' || (item.kind === 'section' && item.name === change.name)),\n );\n if (index === -1) added.push(change);\n else merged[index] = change;\n }\n }\n return { kind: 'changes', changes: [...added, ...merged] };\n}\n\nfunction anticipated(\n changes: readonly Change[],\n preconditions: readonly Precondition[],\n rewritten: readonly Change[],\n visible: VisibleLayer,\n) {\n const derived = rewritten.filter((change) => !changes.includes(change));\n return {\n changes: rewritten,\n preconditions: [...preconditionsOf(derived, visible), ...preconditions],\n };\n}\n\nexport function providerRewritten(batch: ChangeBatch, visible: VisibleLayer): ChangeBatch {\n const rewritten = rewrites(batch.changes, visible);\n if (rewritten.kind === 'refused') return batch;\n return {\n ...batch,\n ...anticipated(batch.changes, batch.preconditions, rewritten.changes, visible),\n };\n}\n\nfunction targets(value: unknown, from: string): readonly string[] {\n const values = Array.isArray(value) ? value : [value];\n const resolved: string[] = [];\n for (const item of values) {\n if (typeof item !== 'string') continue;\n const target = resolve(from, item);\n if (target !== null) resolved.push(target);\n }\n return resolved;\n}\n\nfunction incoming(collection: Collection, removed: ReadonlySet<string>): BatchResult | null {\n const found = new Map<string, Set<string>>();\n const note = (target: string, file: string) => {\n if (!removed.has(target)) return;\n const referrers = found.get(target) ?? new Set<string>();\n referrers.add(file);\n found.set(target, referrers);\n };\n for (const [path, document] of Object.entries(collection.documents)) {\n const definition = definitionOf(typesAt(collection.composition, path), document.type);\n for (const [name, spec] of Object.entries(definition?.fields ?? {})) {\n if (!referenceField(spec)) continue;\n for (const target of targets(document.fields[name], path)) note(target, path);\n }\n for (const link of links(document, path)) note(link.target, path);\n }\n const [first] = [...found.keys()].sort();\n if (first === undefined) return null;\n const every = new Set<string>();\n for (const referrers of found.values()) for (const file of referrers) every.add(file);\n return {\n kind: 'refused',\n refusal: { rule: 'referenced-missing-file', file: first, referrers: [...every].sort() },\n };\n}\n\nfunction affected(change: Change): readonly string[] {\n return change.kind === 'move' ? [change.path, change.to] : [change.path];\n}\n\nfunction definitionAddresses(composition: Composition): ReadonlySet<string> {\n const addresses = new Set<string>();\n if (composition.model.status !== 'unavailable') {\n for (const path of Object.keys(composition.model.snapshot.definitions)) addresses.add(path);\n }\n if (composition.selection !== null && composition.selection.model.status !== 'unavailable') {\n for (const path of Object.keys(composition.selection.model.snapshot.definitions)) {\n addresses.add(path);\n }\n }\n return addresses;\n}\n\nfunction guard(changes: readonly Change[], input: SaveInput): BatchResult | null {\n const existing = new Set([\n ...Object.keys(input.visible.documents),\n ...input.visible.binaryTargets,\n ]);\n const definitions = definitionAddresses(input.composition);\n for (const change of changes) {\n for (const path of affected(change)) {\n const normalized = normalize(path);\n if (normalized === null || normalized === '') return refuse('room-root', path);\n if (definitions.has(normalized)) return refuse('model-definition', normalized);\n if (covered(input.providerOwnedPaths, normalized)) {\n return refuse('provider-owned-path', normalized);\n }\n const operation = change.kind === 'remove' ? 'delete' : 'write';\n if (!covered(input.operations[operation], normalized))\n return refuse(`${operation}-grant`, normalized);\n }\n if (change.kind === 'create') {\n if (existing.has(change.path)) return refuse('path-collision', change.path);\n existing.add(change.path);\n continue;\n }\n if (change.kind === 'move') {\n if (!existing.has(change.path)) return refuse('path-absent', change.path);\n if (existing.has(change.to)) return refuse('path-collision', change.to);\n existing.delete(change.path);\n existing.add(change.to);\n continue;\n }\n if (!existing.has(change.path)) return refuse('path-absent', change.path);\n if (change.kind === 'remove') {\n existing.delete(change.path);\n continue;\n }\n if (change.kind === 'replace') {\n if (input.visible.revisions[change.path] === undefined) {\n return refuse('unknown-revision', change.path);\n }\n continue;\n }\n const document = input.visible.collection.documents[change.path];\n if (document === undefined) return refuse('path-absent', change.path);\n if (change.kind === 'section' && document.sections[change.name] === undefined) {\n return refuse('required-section', change.path, change.name);\n }\n }\n return null;\n}\n\nfunction existence(visible: VisibleLayer, path: string): Precondition {\n const revision = visible.revisions[path];\n return revision === undefined ? { kind: 'present', path } : { kind: 'revision', path, revision };\n}\n\nfunction preconditionsOf(\n changes: readonly Change[],\n visible: VisibleLayer,\n): readonly Precondition[] {\n const preconditions: Precondition[] = [];\n const seen = new Set<string>();\n const add = (precondition: Precondition) => {\n const part =\n precondition.kind === 'field' || precondition.kind === 'section' ? precondition.name : '';\n const identity = `${precondition.kind} ${precondition.path} ${part}`;\n if (seen.has(identity)) return;\n seen.add(identity);\n preconditions.push(precondition);\n };\n for (const change of changes) {\n if (change.kind === 'field') {\n const document = visible.collection.documents[change.path];\n add({\n kind: 'field',\n path: change.path,\n name: change.name,\n value: document.fields[change.name],\n });\n continue;\n }\n if (change.kind === 'section') {\n const document = visible.collection.documents[change.path];\n add({\n kind: 'section',\n path: change.path,\n name: change.name,\n value: document.sections[change.name],\n });\n continue;\n }\n if (change.kind === 'preamble') {\n const document = visible.collection.documents[change.path];\n add({ kind: 'preamble', path: change.path, value: document.preamble });\n continue;\n }\n if (change.kind === 'create') {\n add({ kind: 'absent', path: change.path });\n continue;\n }\n add(existence(visible, change.path));\n if (change.kind === 'move') add({ kind: 'absent', path: change.to });\n }\n return preconditions;\n}\n\nfunction depth(path: string) {\n return path.split('/').length;\n}\n\nfunction exceeded(\n limits: readonly ProviderLimit[],\n changes: readonly Change[],\n resulting: Layer,\n): BatchResult | null {\n const written = changes.map((change) => (change.kind === 'move' ? change.to : change.path));\n const created = changes\n .filter((change) => change.kind === 'create' || change.kind === 'move')\n .map((change) => (change.kind === 'move' ? change.to : change.path));\n for (const limit of limits) {\n const value = limit.value;\n if (typeof value !== 'number') continue;\n if (limit.name === 'change-batch-operations' && changes.length > value) {\n return refuse('provider-limit', undefined, limit.name);\n }\n if (limit.name === 'document-size') {\n const large = written.find((path) => (resulting.documents[path] ?? '').length > value);\n if (large !== undefined) return refuse('provider-limit', large, limit.name);\n }\n if (limit.name === 'path-length') {\n const long = created.find((path) => path.length > value);\n if (long !== undefined) return refuse('provider-limit', long, limit.name);\n }\n if (limit.name === 'path-depth') {\n const deep = created.find((path) => depth(path) > value);\n if (deep !== undefined) return refuse('provider-limit', deep, limit.name);\n }\n }\n return null;\n}\n\nexport function buildBatch(input: SaveInput): BatchResult {\n const structural = input.changes.find(\n (change) => change.kind === 'move' || change.kind === 'remove',\n );\n if (\n structural !== undefined &&\n Object.entries(input.visible.collection.documents).some(\n ([path, document]) =>\n document.type !== undefined &&\n document.type !== 'any' &&\n governing(input.composition, path).status === 'unavailable',\n )\n )\n return refuse('model-unavailable', structural.path);\n const expanded = expand(input.changes, input.visible);\n if (expanded.kind === 'refused') return expanded;\n const rewritten = rewrites(expanded.changes, input.visible);\n if (rewritten.kind === 'refused') return rewritten;\n const changes = input.rewriting === 'provider' ? expanded.changes : rewritten.changes;\n if (changes.length === 0) return refuse('no-change');\n const refusal = guard(changes, input);\n if (refusal !== null) return refusal;\n const preconditions = preconditionsOf(changes, input.visible);\n const predicted =\n input.rewriting === 'provider'\n ? anticipated(changes, preconditions, rewritten.changes, input.visible)\n : { changes, preconditions };\n const resulting = overlay(input.visible, [\n { id: '', baseRoomVersion: input.baseRoomVersion, ...predicted },\n ]);\n const removed = new Set(\n changes.filter((change) => change.kind === 'remove').map((change) => change.path),\n );\n if (removed.size > 0) {\n const referenced = incoming(parseCollection(resulting.documents, input.composition), removed);\n if (referenced !== null) return referenced;\n }\n const typed = (content: string | undefined) => {\n if (content === undefined) return false;\n const parsed = parse(content);\n return parsed.ok && parsed.document.type !== undefined && parsed.document.type !== 'any';\n };\n const typedPaths = [...new Set(predicted.changes.flatMap(affected))].filter(\n (path) => typed(input.visible.documents[path]) || typed(resulting.documents[path]),\n );\n const needsModel = typedPaths.length > 0;\n const withoutModel = typedPaths.find(\n (path) => governing(input.composition, path).status === 'unavailable',\n );\n if (needsModel && (withoutModel !== undefined || input.binding === null)) {\n return refuse('model-unavailable', withoutModel ?? typedPaths[0]);\n }\n const validationText = needsModel\n ? resulting.documents\n : Object.fromEntries(\n Object.entries(resulting.documents).filter(([path]) =>\n predicted.changes.some((change) => affected(change).includes(path)),\n ),\n );\n const verdict = validateCollection(\n validationText,\n resulting.binaryTargets,\n input.composition,\n input.binding,\n );\n if (verdict.verdict === 'refuse') {\n return {\n kind: 'refused',\n refusal: {\n ...(verdict.source === 'model' ? { source: 'model' as const } : {}),\n rule: verdict.rule,\n file: verdict.file,\n ...(verdict.location === undefined ? {} : { location: verdict.location }),\n ...(verdict.referrers === undefined ? {} : { referrers: verdict.referrers }),\n },\n };\n }\n const limited = exceeded(input.providerLimits, changes, resulting);\n if (limited !== null) return limited;\n const validated = typedPaths\n .map((path) => governing(input.composition, path))\n .find(\n (model): model is Extract<ModelState, { status: 'current' | 'cached' }> =>\n model.status !== 'unavailable',\n );\n return {\n kind: 'batch',\n batch: immutable({\n id: changeBatchIdentity(),\n baseRoomVersion: input.baseRoomVersion,\n changes,\n preconditions,\n ...(input.writtenBy === undefined ? {} : { writtenBy: input.writtenBy }),\n ...(validated === undefined\n ? {}\n : {\n validation: {\n identity: validated.snapshot.identity,\n version: validated.snapshot.version,\n source: validated.status,\n },\n }),\n }),\n };\n}\n"],"names":["apply","links","parse","serialize","immutable","governing","parseCollection","typesAt","validateCollection","changeBatchIdentity","overlay","beneath","covered","normalize","relative","resolve","refuse","rule","file","location","kind","refusal","undefined","members","visible","prefix","Object","keys","documents","binaryTargets","filter","path","sort","spread","change","member","to","slice","length","expand","changes","expanded","push","structural","present","includes","beneathIt","referenceField","spec","declared","of","definitionOf","types","type","find","name","retarget","value","from","moves","Array","isArray","next","map","item","some","index","target","get","edited","document","applied","prior","preamble","sections","outcome","bodies","before","after","entries","relinks","moved","link","destination","href","content","subsumed","merged","splice","rewrites","Map","settled","Set","set","add","size","added","collection","has","definition","composition","fields","relinked","findIndex","anticipated","preconditions","rewritten","derived","preconditionsOf","providerRewritten","batch","targets","values","resolved","incoming","removed","found","note","referrers","first","every","affected","definitionAddresses","addresses","model","status","snapshot","definitions","selection","guard","input","existing","normalized","providerOwnedPaths","operation","operations","delete","revisions","existence","revision","seen","precondition","part","identity","depth","split","exceeded","limits","resulting","written","created","limit","large","long","deep","buildBatch","rewriting","predicted","id","baseRoomVersion","referenced","typed","parsed","ok","typedPaths","flatMap","needsModel","withoutModel","binding","validationText","fromEntries","verdict","source","limited","providerLimits","validated","writtenBy","validation","version"],"mappings":"AACA,SAASA,KAAK,EAAEC,KAAK,EAAEC,KAAK,EAAEC,SAAS,QAAuB,uBAAuB;AAErF,SACEC,SAAS,QAKJ,cAAc;AACrB,SACEC,SAAS,EACTC,eAAe,EACfC,OAAO,EACPC,kBAAkB,QAIb,kBAAkB;AACzB,SAASC,mBAAmB,QAAQ,gBAAgB;AACpD,SAASC,OAAO,QAAoB,eAAe;AACnD,SAASC,OAAO,EAAEC,OAAO,EAAEC,SAAS,EAAEC,QAAQ,EAAEC,OAAO,QAAQ,aAAa;AAoC5E,SAASC,OAAOC,IAAY,EAAEC,IAAa,EAAEC,QAAiB;IAC5D,OAAO;QACLC,MAAM;QACNC,SAAS;YACPJ;YACA,GAAIC,SAASI,YAAY,CAAC,IAAI;gBAAEJ;YAAK,CAAC;YACtC,GAAIC,aAAaG,YAAY,CAAC,IAAI;gBAAEH;YAAS,CAAC;QAChD;IACF;AACF;AAEA,SAASI,QAAQC,OAAc,EAAEC,MAAc;IAC7C,OAAO;WAAIC,OAAOC,IAAI,CAACH,QAAQI,SAAS;WAAMJ,QAAQK,aAAa;KAAC,CACjEC,MAAM,CAAC,CAACC,OAASpB,QAAQc,QAAQM,OACjCC,IAAI;AACT;AAEA,SAASC,OAAOC,MAAkB,EAAEH,IAAY,EAAEI,MAAc;IAC9D,IAAID,OAAOd,IAAI,KAAK,UAAU,OAAO;QAAEA,MAAM;QAAUW,MAAMI;IAAO;IACpE,OAAO;QAAEf,MAAM;QAAQW,MAAMI;QAAQC,IAAI,GAAGF,OAAOE,EAAE,GAAGD,OAAOE,KAAK,CAACN,KAAKO,MAAM,GAAG;IAAC;AACtF;AAEA,SAASC,OAAOC,OAA0B,EAAEhB,OAAqB;IAC/D,MAAMiB,WAAqB,EAAE;IAC7B,KAAK,MAAMP,UAAUM,QAAS;QAC5B,IAAIN,OAAOd,IAAI,KAAK,UAAUc,OAAOd,IAAI,KAAK,UAAU;YACtDqB,SAASC,IAAI,CAACR;YACd;QACF;QACA,MAAMH,OAAOlB,UAAUqB,OAAOH,IAAI;QAClC,MAAMK,KAAKF,OAAOd,IAAI,KAAK,SAASP,UAAUqB,OAAOE,EAAE,IAAI;QAC3D,IAAIL,SAAS,QAAQA,SAAS,MAAMK,OAAO,QAASF,OAAOd,IAAI,KAAK,UAAUgB,OAAO,IAAK;YACxF,OAAO;gBAAEhB,MAAM;gBAAWC,SAAS;oBAAEJ,MAAM;oBAAaC,MAAMgB,OAAOH,IAAI;gBAAC;YAAE;QAC9E;QACA,MAAMY,aAAaT,OAAOd,IAAI,KAAK,SAAS;YAAE,GAAGc,MAAM;YAAEH;YAAMK;QAAG,IAAI;YAAE,GAAGF,MAAM;YAAEH;QAAK;QACxF,MAAMa,UAAUpB,QAAQI,SAAS,CAACG,KAAK,KAAKT,aAAaE,QAAQK,aAAa,CAACgB,QAAQ,CAACd;QACxF,IAAIa,SAAS;YACXH,SAASC,IAAI,CAACC;YACd;QACF;QACA,MAAMG,YAAYvB,QAAQC,SAASO;QACnC,IAAIe,UAAUR,MAAM,KAAK,GAAG;YAC1B,OAAO;gBAAElB,MAAM;gBAAWC,SAAS;oBAAEJ,MAAM;oBAAeC,MAAMgB,OAAOH,IAAI;gBAAC;YAAE;QAChF;QACA,KAAK,MAAMI,UAAUW,UAAWL,SAASC,IAAI,CAACT,OAAOU,YAAYZ,MAAMI;IACzE;IACA,OAAO;QAAEf,MAAM;QAAWoB,SAASC;IAAS;AAC9C;AAEA,SAASM,eAAeC,IAAa;IACnC,IAAI,OAAOA,SAAS,YAAYA,SAAS,MAAM,OAAO;IACtD,MAAMC,WAAWD;IACjB,OAAOC,SAAS7B,IAAI,KAAK,eAAgB6B,SAAS7B,IAAI,KAAK,UAAU6B,SAASC,EAAE,KAAK;AACvF;AAEA,SAASC,aAAaC,KAAwB,EAAEC,IAAwB;IACtE,OAAOD,MAAME,IAAI,CAAC,CAACL,WAAaA,SAASM,IAAI,KAAKF;AACpD;AAEA,SAASG,SACPC,KAAc,EACdC,IAAY,EACZtB,EAAU,EACVuB,KAAkC;IAElC,IAAIC,MAAMC,OAAO,CAACJ,QAAQ;QACxB,MAAMK,OAAOL,MAAMM,GAAG,CAAC,CAACC,OAASR,SAASQ,MAAMN,MAAMtB,IAAIuB,UAAUK;QACpE,OAAOF,KAAKG,IAAI,CAAC,CAACD,MAAME,QAAUF,SAASP,KAAK,CAACS,MAAM,IAAIJ,OAAOxC;IACpE;IACA,IAAI,OAAOmC,UAAU,UAAU,OAAOnC;IACtC,MAAM6C,SAASpD,QAAQ2C,MAAMD;IAC7B,IAAIU,WAAW,MAAM,OAAO7C;IAC5B,MAAMwC,OAAOhD,SAASsB,IAAIuB,MAAMS,GAAG,CAACD,WAAWA;IAC/C,OAAOL,SAASL,QAAQnC,YAAYwC;AACtC;AAEA,SAASO,OAAOC,QAAkB,EAAEvC,IAAY,EAAES,OAA0B;IAC1E,IAAIsB,OAAOQ;IACX,KAAK,MAAMpC,UAAUM,QAAS;QAC5B,IAAIN,OAAOH,IAAI,KAAKA,MAAM;QAC1B,IAAIG,OAAOd,IAAI,KAAK,aAAac,OAAOd,IAAI,KAAK,YAAY;QAC7D,MAAMmD,UAAUvE,MACd8D,MACA5B,OAAOd,IAAI,KAAK,aACZ;YAAEA,MAAM;YAAYqC,OAAOvB,OAAOuB,KAAK;YAAEe,OAAOV,KAAKW,QAAQ;QAAC,IAC9D;YACErD,MAAM;YACNmC,MAAMrB,OAAOqB,IAAI;YACjBE,OAAOvB,OAAOuB,KAAK;YACnBe,OAAOV,KAAKY,QAAQ,CAACxC,OAAOqB,IAAI,CAAC;QACnC;QAEN,IAAIgB,QAAQI,OAAO,KAAK,WAAWb,OAAOS,QAAQD,QAAQ;IAC5D;IACA,OAAOR;AACT;AAEA,SAASc,OAAO7C,IAAY,EAAE8C,MAAgB,EAAEC,KAAe;IAC7D,MAAMtC,UAAoB,EAAE;IAC5B,IAAIsC,MAAML,QAAQ,KAAKI,OAAOJ,QAAQ,EAAE;QACtCjC,QAAQE,IAAI,CAAC;YAAEtB,MAAM;YAAYW;YAAM0B,OAAOqB,MAAML,QAAQ;QAAC;IAC/D;IACA,KAAK,MAAM,CAAClB,MAAME,MAAM,IAAI/B,OAAOqD,OAAO,CAACD,MAAMJ,QAAQ,EAAG;QAC1D,IAAIG,OAAOH,QAAQ,CAACnB,KAAK,KAAKE,OAAO;QACrCjB,QAAQE,IAAI,CAAC;YAAEtB,MAAM;YAAWW;YAAMwB;YAAME;QAAM;IACpD;IACA,OAAOjB;AACT;AAEA,SAASwC,QACPjD,IAAY,EACZkD,KAAa,EACbJ,MAAgB,EAChBlB,KAAkC;IAElC,IAAImB,QAAQD;IACZ,KAAK,MAAMK,QAAQjF,MAAM4E,QAAQ9C,MAAO;QACtC,MAAMoD,cAAcxB,MAAMS,GAAG,CAACc,KAAKf,MAAM,KAAKe,KAAKf,MAAM;QACzD,IAAIgB,gBAAgBD,KAAKf,MAAM,IAAIc,UAAUlD,MAAM;QACnD,MAAMK,KAAKtB,SAASmE,OAAOE;QAC3B,IAAI/C,OAAOtB,SAASiB,MAAMmD,KAAKf,MAAM,GAAG;QACxC,MAAMI,UAAUvE,MAAM8E,OAAO;YAAE1D,MAAM;YAAQgE,MAAMF,KAAKE,IAAI;YAAEhD;QAAG;QACjE,IAAImC,QAAQI,OAAO,KAAK,UAAU;YAChC,OAAO;gBACLvD,MAAM;gBACNC,SAAS;oBACPJ,MAAMsD,QAAQlD,OAAO,CAACJ,IAAI;oBAC1BC,MAAMa;oBACN,GAAIwC,QAAQlD,OAAO,CAACF,QAAQ,KAAKG,YAAY,CAAC,IAAI;wBAAEH,UAAUoD,QAAQlD,OAAO,CAACF,QAAQ;oBAAC,CAAC;gBAC1F;YACF;QACF;QACA2D,QAAQP,QAAQD,QAAQ;IAC1B;IACA,IAAIQ,UAAUD,QAAQ,OAAO;QAAEzD,MAAM;QAAWoB,SAAS,EAAE;IAAC;IAC5D,IAAIqC,OAAOxB,IAAI,KAAK/B,WAAW;QAC7B,OAAO;YAAEF,MAAM;YAAWoB,SAAS;gBAAC;oBAAEpB,MAAM;oBAAWW;oBAAMsD,SAASlF,UAAU2E;gBAAO;aAAE;QAAC;IAC5F;IACA,OAAO;QAAE1D,MAAM;QAAWoB,SAASoC,OAAO7C,MAAM8C,QAAQC;IAAO;AACjE;AAEA,SAASQ,SAASC,MAAgB,EAAExD,IAAY;IAC9C,IAAK,IAAImC,QAAQqB,OAAOjD,MAAM,GAAG,GAAG4B,SAAS,GAAGA,SAAS,EAAG;QAC1D,MAAMF,OAAOuB,MAAM,CAACrB,MAAM;QAC1B,IAAIF,KAAKjC,IAAI,KAAKA,MAAM;QACxB,IAAIiC,KAAK5C,IAAI,KAAK,aAAa4C,KAAK5C,IAAI,KAAK,YAAYmE,OAAOC,MAAM,CAACtB,OAAO;IAChF;AACF;AAEA,SAASuB,SAASjD,OAA0B,EAAEhB,OAAqB;IACjE,MAAMmC,QAAQ,IAAI+B;IAClB,MAAMC,UAAU,IAAIC;IACpB,KAAK,MAAM1D,UAAUM,QAAS;QAC5B,IAAIN,OAAOd,IAAI,KAAK,QAAQuC,MAAMkC,GAAG,CAAC3D,OAAOH,IAAI,EAAEG,OAAOE,EAAE;QAC5D,IAAIF,OAAOd,IAAI,KAAK,YAAYc,OAAOd,IAAI,KAAK,aAAac,OAAOd,IAAI,KAAK,UAAU;YACrFuE,QAAQG,GAAG,CAAC5D,OAAOH,IAAI;QACzB;QACA,IAAIG,OAAOd,IAAI,KAAK,SAASuE,QAAQG,GAAG,CAAC,GAAG5D,OAAOH,IAAI,CAAC,CAAC,EAAEG,OAAOqB,IAAI,EAAE;IAC1E;IACA,IAAII,MAAMoC,IAAI,KAAK,GAAG,OAAO;QAAE3E,MAAM;QAAWoB;IAAQ;IACxD,MAAM+C,SAAS;WAAI/C;KAAQ;IAC3B,MAAMwD,QAAkB,EAAE;IAC1B,KAAK,MAAM,CAACjE,MAAMuC,SAAS,IAAI5C,OAAOqD,OAAO,CAACvD,QAAQyE,UAAU,CAACrE,SAAS,EAAG;QAC3E,IAAI+D,QAAQO,GAAG,CAACnE,OAAO;QACvB,MAAMkD,QAAQtB,MAAMS,GAAG,CAACrC,SAASA;QACjC,MAAMoE,aAAahD,aAAa5C,QAAQiB,QAAQyE,UAAU,CAACG,WAAW,EAAErE,OAAOuC,SAASjB,IAAI;QAC5F,KAAK,MAAM,CAACE,MAAMP,KAAK,IAAItB,OAAOqD,OAAO,CAACoB,YAAYE,UAAU,CAAC,GAAI;YACnE,IAAI,CAACtD,eAAeC,SAAS2C,QAAQO,GAAG,CAAC,GAAGnE,KAAK,CAAC,EAAEwB,MAAM,GAAG;YAC7D,MAAME,QAAQD,SAASc,SAAS+B,MAAM,CAAC9C,KAAK,EAAExB,MAAMkD,OAAOtB;YAC3D,IAAIF,UAAUnC,WAAW;YACzB0E,MAAMtD,IAAI,CAAC;gBAAEtB,MAAM;gBAASW;gBAAMwB;gBAAME;YAAM;QAChD;QACA,MAAM6C,WAAWtB,QAAQjD,MAAMkD,OAAOZ,OAAOC,UAAUvC,MAAMwD,SAAS5B;QACtE,IAAI2C,SAASlF,IAAI,KAAK,WAAW,OAAOkF;QACxC,KAAK,MAAMpE,UAAUoE,SAAS9D,OAAO,CAAE;YACrC,IAAIN,OAAOd,IAAI,KAAK,WAAW;gBAC7BkE,SAASC,QAAQxD;gBACjBiE,MAAMtD,IAAI,CAACR;gBACX;YACF;YACA,MAAMgC,QAAQqB,OAAOgB,SAAS,CAC5B,CAACvC,OACCA,KAAK5C,IAAI,KAAKc,OAAOd,IAAI,IACzB4C,KAAKjC,IAAI,KAAKA,QACbG,CAAAA,OAAOd,IAAI,KAAK,aAAc4C,KAAK5C,IAAI,KAAK,aAAa4C,KAAKT,IAAI,KAAKrB,OAAOqB,IAAI;YAEvF,IAAIW,UAAU,CAAC,GAAG8B,MAAMtD,IAAI,CAACR;iBACxBqD,MAAM,CAACrB,MAAM,GAAGhC;QACvB;IACF;IACA,OAAO;QAAEd,MAAM;QAAWoB,SAAS;eAAIwD;eAAUT;SAAO;IAAC;AAC3D;AAEA,SAASiB,YACPhE,OAA0B,EAC1BiE,aAAsC,EACtCC,SAA4B,EAC5BlF,OAAqB;IAErB,MAAMmF,UAAUD,UAAU5E,MAAM,CAAC,CAACI,SAAW,CAACM,QAAQK,QAAQ,CAACX;IAC/D,OAAO;QACLM,SAASkE;QACTD,eAAe;eAAIG,gBAAgBD,SAASnF;eAAaiF;SAAc;IACzE;AACF;AAEA,OAAO,SAASI,kBAAkBC,KAAkB,EAAEtF,OAAqB;IACzE,MAAMkF,YAAYjB,SAASqB,MAAMtE,OAAO,EAAEhB;IAC1C,IAAIkF,UAAUtF,IAAI,KAAK,WAAW,OAAO0F;IACzC,OAAO;QACL,GAAGA,KAAK;QACR,GAAGN,YAAYM,MAAMtE,OAAO,EAAEsE,MAAML,aAAa,EAAEC,UAAUlE,OAAO,EAAEhB,QAAQ;IAChF;AACF;AAEA,SAASuF,QAAQtD,KAAc,EAAEC,IAAY;IAC3C,MAAMsD,SAASpD,MAAMC,OAAO,CAACJ,SAASA,QAAQ;QAACA;KAAM;IACrD,MAAMwD,WAAqB,EAAE;IAC7B,KAAK,MAAMjD,QAAQgD,OAAQ;QACzB,IAAI,OAAOhD,SAAS,UAAU;QAC9B,MAAMG,SAASpD,QAAQ2C,MAAMM;QAC7B,IAAIG,WAAW,MAAM8C,SAASvE,IAAI,CAACyB;IACrC;IACA,OAAO8C;AACT;AAEA,SAASC,SAASjB,UAAsB,EAAEkB,OAA4B;IACpE,MAAMC,QAAQ,IAAI1B;IAClB,MAAM2B,OAAO,CAAClD,QAAgBjD;QAC5B,IAAI,CAACiG,QAAQjB,GAAG,CAAC/B,SAAS;QAC1B,MAAMmD,YAAYF,MAAMhD,GAAG,CAACD,WAAW,IAAIyB;QAC3C0B,UAAUxB,GAAG,CAAC5E;QACdkG,MAAMvB,GAAG,CAAC1B,QAAQmD;IACpB;IACA,KAAK,MAAM,CAACvF,MAAMuC,SAAS,IAAI5C,OAAOqD,OAAO,CAACkB,WAAWrE,SAAS,EAAG;QACnE,MAAMuE,aAAahD,aAAa5C,QAAQ0F,WAAWG,WAAW,EAAErE,OAAOuC,SAASjB,IAAI;QACpF,KAAK,MAAM,CAACE,MAAMP,KAAK,IAAItB,OAAOqD,OAAO,CAACoB,YAAYE,UAAU,CAAC,GAAI;YACnE,IAAI,CAACtD,eAAeC,OAAO;YAC3B,KAAK,MAAMmB,UAAU4C,QAAQzC,SAAS+B,MAAM,CAAC9C,KAAK,EAAExB,MAAOsF,KAAKlD,QAAQpC;QAC1E;QACA,KAAK,MAAMmD,QAAQjF,MAAMqE,UAAUvC,MAAOsF,KAAKnC,KAAKf,MAAM,EAAEpC;IAC9D;IACA,MAAM,CAACwF,MAAM,GAAG;WAAIH,MAAMzF,IAAI;KAAG,CAACK,IAAI;IACtC,IAAIuF,UAAUjG,WAAW,OAAO;IAChC,MAAMkG,QAAQ,IAAI5B;IAClB,KAAK,MAAM0B,aAAaF,MAAMJ,MAAM,GAAI,KAAK,MAAM9F,QAAQoG,UAAWE,MAAM1B,GAAG,CAAC5E;IAChF,OAAO;QACLE,MAAM;QACNC,SAAS;YAAEJ,MAAM;YAA2BC,MAAMqG;YAAOD,WAAW;mBAAIE;aAAM,CAACxF,IAAI;QAAG;IACxF;AACF;AAEA,SAASyF,SAASvF,MAAc;IAC9B,OAAOA,OAAOd,IAAI,KAAK,SAAS;QAACc,OAAOH,IAAI;QAAEG,OAAOE,EAAE;KAAC,GAAG;QAACF,OAAOH,IAAI;KAAC;AAC1E;AAEA,SAAS2F,oBAAoBtB,WAAwB;IACnD,MAAMuB,YAAY,IAAI/B;IACtB,IAAIQ,YAAYwB,KAAK,CAACC,MAAM,KAAK,eAAe;QAC9C,KAAK,MAAM9F,QAAQL,OAAOC,IAAI,CAACyE,YAAYwB,KAAK,CAACE,QAAQ,CAACC,WAAW,EAAGJ,UAAU7B,GAAG,CAAC/D;IACxF;IACA,IAAIqE,YAAY4B,SAAS,KAAK,QAAQ5B,YAAY4B,SAAS,CAACJ,KAAK,CAACC,MAAM,KAAK,eAAe;QAC1F,KAAK,MAAM9F,QAAQL,OAAOC,IAAI,CAACyE,YAAY4B,SAAS,CAACJ,KAAK,CAACE,QAAQ,CAACC,WAAW,EAAG;YAChFJ,UAAU7B,GAAG,CAAC/D;QAChB;IACF;IACA,OAAO4F;AACT;AAEA,SAASM,MAAMzF,OAA0B,EAAE0F,KAAgB;IACzD,MAAMC,WAAW,IAAIvC,IAAI;WACpBlE,OAAOC,IAAI,CAACuG,MAAM1G,OAAO,CAACI,SAAS;WACnCsG,MAAM1G,OAAO,CAACK,aAAa;KAC/B;IACD,MAAMkG,cAAcL,oBAAoBQ,MAAM9B,WAAW;IACzD,KAAK,MAAMlE,UAAUM,QAAS;QAC5B,KAAK,MAAMT,QAAQ0F,SAASvF,QAAS;YACnC,MAAMkG,aAAavH,UAAUkB;YAC7B,IAAIqG,eAAe,QAAQA,eAAe,IAAI,OAAOpH,OAAO,aAAae;YACzE,IAAIgG,YAAY7B,GAAG,CAACkC,aAAa,OAAOpH,OAAO,oBAAoBoH;YACnE,IAAIxH,QAAQsH,MAAMG,kBAAkB,EAAED,aAAa;gBACjD,OAAOpH,OAAO,uBAAuBoH;YACvC;YACA,MAAME,YAAYpG,OAAOd,IAAI,KAAK,WAAW,WAAW;YACxD,IAAI,CAACR,QAAQsH,MAAMK,UAAU,CAACD,UAAU,EAAEF,aACxC,OAAOpH,OAAO,GAAGsH,UAAU,MAAM,CAAC,EAAEF;QACxC;QACA,IAAIlG,OAAOd,IAAI,KAAK,UAAU;YAC5B,IAAI+G,SAASjC,GAAG,CAAChE,OAAOH,IAAI,GAAG,OAAOf,OAAO,kBAAkBkB,OAAOH,IAAI;YAC1EoG,SAASrC,GAAG,CAAC5D,OAAOH,IAAI;YACxB;QACF;QACA,IAAIG,OAAOd,IAAI,KAAK,QAAQ;YAC1B,IAAI,CAAC+G,SAASjC,GAAG,CAAChE,OAAOH,IAAI,GAAG,OAAOf,OAAO,eAAekB,OAAOH,IAAI;YACxE,IAAIoG,SAASjC,GAAG,CAAChE,OAAOE,EAAE,GAAG,OAAOpB,OAAO,kBAAkBkB,OAAOE,EAAE;YACtE+F,SAASK,MAAM,CAACtG,OAAOH,IAAI;YAC3BoG,SAASrC,GAAG,CAAC5D,OAAOE,EAAE;YACtB;QACF;QACA,IAAI,CAAC+F,SAASjC,GAAG,CAAChE,OAAOH,IAAI,GAAG,OAAOf,OAAO,eAAekB,OAAOH,IAAI;QACxE,IAAIG,OAAOd,IAAI,KAAK,UAAU;YAC5B+G,SAASK,MAAM,CAACtG,OAAOH,IAAI;YAC3B;QACF;QACA,IAAIG,OAAOd,IAAI,KAAK,WAAW;YAC7B,IAAI8G,MAAM1G,OAAO,CAACiH,SAAS,CAACvG,OAAOH,IAAI,CAAC,KAAKT,WAAW;gBACtD,OAAON,OAAO,oBAAoBkB,OAAOH,IAAI;YAC/C;YACA;QACF;QACA,MAAMuC,WAAW4D,MAAM1G,OAAO,CAACyE,UAAU,CAACrE,SAAS,CAACM,OAAOH,IAAI,CAAC;QAChE,IAAIuC,aAAahD,WAAW,OAAON,OAAO,eAAekB,OAAOH,IAAI;QACpE,IAAIG,OAAOd,IAAI,KAAK,aAAakD,SAASI,QAAQ,CAACxC,OAAOqB,IAAI,CAAC,KAAKjC,WAAW;YAC7E,OAAON,OAAO,oBAAoBkB,OAAOH,IAAI,EAAEG,OAAOqB,IAAI;QAC5D;IACF;IACA,OAAO;AACT;AAEA,SAASmF,UAAUlH,OAAqB,EAAEO,IAAY;IACpD,MAAM4G,WAAWnH,QAAQiH,SAAS,CAAC1G,KAAK;IACxC,OAAO4G,aAAarH,YAAY;QAAEF,MAAM;QAAWW;IAAK,IAAI;QAAEX,MAAM;QAAYW;QAAM4G;IAAS;AACjG;AAEA,SAAS/B,gBACPpE,OAA0B,EAC1BhB,OAAqB;IAErB,MAAMiF,gBAAgC,EAAE;IACxC,MAAMmC,OAAO,IAAIhD;IACjB,MAAME,MAAM,CAAC+C;QACX,MAAMC,OACJD,aAAazH,IAAI,KAAK,WAAWyH,aAAazH,IAAI,KAAK,YAAYyH,aAAatF,IAAI,GAAG;QACzF,MAAMwF,WAAW,GAAGF,aAAazH,IAAI,CAAC,CAAC,EAAEyH,aAAa9G,IAAI,CAAC,CAAC,EAAE+G,MAAM;QACpE,IAAIF,KAAK1C,GAAG,CAAC6C,WAAW;QACxBH,KAAK9C,GAAG,CAACiD;QACTtC,cAAc/D,IAAI,CAACmG;IACrB;IACA,KAAK,MAAM3G,UAAUM,QAAS;QAC5B,IAAIN,OAAOd,IAAI,KAAK,SAAS;YAC3B,MAAMkD,WAAW9C,QAAQyE,UAAU,CAACrE,SAAS,CAACM,OAAOH,IAAI,CAAC;YAC1D+D,IAAI;gBACF1E,MAAM;gBACNW,MAAMG,OAAOH,IAAI;gBACjBwB,MAAMrB,OAAOqB,IAAI;gBACjBE,OAAOa,SAAS+B,MAAM,CAACnE,OAAOqB,IAAI,CAAC;YACrC;YACA;QACF;QACA,IAAIrB,OAAOd,IAAI,KAAK,WAAW;YAC7B,MAAMkD,WAAW9C,QAAQyE,UAAU,CAACrE,SAAS,CAACM,OAAOH,IAAI,CAAC;YAC1D+D,IAAI;gBACF1E,MAAM;gBACNW,MAAMG,OAAOH,IAAI;gBACjBwB,MAAMrB,OAAOqB,IAAI;gBACjBE,OAAOa,SAASI,QAAQ,CAACxC,OAAOqB,IAAI,CAAC;YACvC;YACA;QACF;QACA,IAAIrB,OAAOd,IAAI,KAAK,YAAY;YAC9B,MAAMkD,WAAW9C,QAAQyE,UAAU,CAACrE,SAAS,CAACM,OAAOH,IAAI,CAAC;YAC1D+D,IAAI;gBAAE1E,MAAM;gBAAYW,MAAMG,OAAOH,IAAI;gBAAE0B,OAAOa,SAASG,QAAQ;YAAC;YACpE;QACF;QACA,IAAIvC,OAAOd,IAAI,KAAK,UAAU;YAC5B0E,IAAI;gBAAE1E,MAAM;gBAAUW,MAAMG,OAAOH,IAAI;YAAC;YACxC;QACF;QACA+D,IAAI4C,UAAUlH,SAASU,OAAOH,IAAI;QAClC,IAAIG,OAAOd,IAAI,KAAK,QAAQ0E,IAAI;YAAE1E,MAAM;YAAUW,MAAMG,OAAOE,EAAE;QAAC;IACpE;IACA,OAAOqE;AACT;AAEA,SAASuC,MAAMjH,IAAY;IACzB,OAAOA,KAAKkH,KAAK,CAAC,KAAK3G,MAAM;AAC/B;AAEA,SAAS4G,SACPC,MAAgC,EAChC3G,OAA0B,EAC1B4G,SAAgB;IAEhB,MAAMC,UAAU7G,QAAQuB,GAAG,CAAC,CAAC7B,SAAYA,OAAOd,IAAI,KAAK,SAASc,OAAOE,EAAE,GAAGF,OAAOH,IAAI;IACzF,MAAMuH,UAAU9G,QACbV,MAAM,CAAC,CAACI,SAAWA,OAAOd,IAAI,KAAK,YAAYc,OAAOd,IAAI,KAAK,QAC/D2C,GAAG,CAAC,CAAC7B,SAAYA,OAAOd,IAAI,KAAK,SAASc,OAAOE,EAAE,GAAGF,OAAOH,IAAI;IACpE,KAAK,MAAMwH,SAASJ,OAAQ;QAC1B,MAAM1F,QAAQ8F,MAAM9F,KAAK;QACzB,IAAI,OAAOA,UAAU,UAAU;QAC/B,IAAI8F,MAAMhG,IAAI,KAAK,6BAA6Bf,QAAQF,MAAM,GAAGmB,OAAO;YACtE,OAAOzC,OAAO,kBAAkBM,WAAWiI,MAAMhG,IAAI;QACvD;QACA,IAAIgG,MAAMhG,IAAI,KAAK,iBAAiB;YAClC,MAAMiG,QAAQH,QAAQ/F,IAAI,CAAC,CAACvB,OAAS,AAACqH,CAAAA,UAAUxH,SAAS,CAACG,KAAK,IAAI,EAAC,EAAGO,MAAM,GAAGmB;YAChF,IAAI+F,UAAUlI,WAAW,OAAON,OAAO,kBAAkBwI,OAAOD,MAAMhG,IAAI;QAC5E;QACA,IAAIgG,MAAMhG,IAAI,KAAK,eAAe;YAChC,MAAMkG,OAAOH,QAAQhG,IAAI,CAAC,CAACvB,OAASA,KAAKO,MAAM,GAAGmB;YAClD,IAAIgG,SAASnI,WAAW,OAAON,OAAO,kBAAkByI,MAAMF,MAAMhG,IAAI;QAC1E;QACA,IAAIgG,MAAMhG,IAAI,KAAK,cAAc;YAC/B,MAAMmG,OAAOJ,QAAQhG,IAAI,CAAC,CAACvB,OAASiH,MAAMjH,QAAQ0B;YAClD,IAAIiG,SAASpI,WAAW,OAAON,OAAO,kBAAkB0I,MAAMH,MAAMhG,IAAI;QAC1E;IACF;IACA,OAAO;AACT;AAEA,OAAO,SAASoG,WAAWzB,KAAgB;IACzC,MAAMvF,aAAauF,MAAM1F,OAAO,CAACc,IAAI,CACnC,CAACpB,SAAWA,OAAOd,IAAI,KAAK,UAAUc,OAAOd,IAAI,KAAK;IAExD,IACEuB,eAAerB,aACfI,OAAOqD,OAAO,CAACmD,MAAM1G,OAAO,CAACyE,UAAU,CAACrE,SAAS,EAAEqC,IAAI,CACrD,CAAC,CAAClC,MAAMuC,SAAS,GACfA,SAASjB,IAAI,KAAK/B,aAClBgD,SAASjB,IAAI,KAAK,SAClBhD,UAAU6H,MAAM9B,WAAW,EAAErE,MAAM8F,MAAM,KAAK,gBAGlD,OAAO7G,OAAO,qBAAqB2B,WAAWZ,IAAI;IACpD,MAAMU,WAAWF,OAAO2F,MAAM1F,OAAO,EAAE0F,MAAM1G,OAAO;IACpD,IAAIiB,SAASrB,IAAI,KAAK,WAAW,OAAOqB;IACxC,MAAMiE,YAAYjB,SAAShD,SAASD,OAAO,EAAE0F,MAAM1G,OAAO;IAC1D,IAAIkF,UAAUtF,IAAI,KAAK,WAAW,OAAOsF;IACzC,MAAMlE,UAAU0F,MAAM0B,SAAS,KAAK,aAAanH,SAASD,OAAO,GAAGkE,UAAUlE,OAAO;IACrF,IAAIA,QAAQF,MAAM,KAAK,GAAG,OAAOtB,OAAO;IACxC,MAAMK,UAAU4G,MAAMzF,SAAS0F;IAC/B,IAAI7G,YAAY,MAAM,OAAOA;IAC7B,MAAMoF,gBAAgBG,gBAAgBpE,SAAS0F,MAAM1G,OAAO;IAC5D,MAAMqI,YACJ3B,MAAM0B,SAAS,KAAK,aAChBpD,YAAYhE,SAASiE,eAAeC,UAAUlE,OAAO,EAAE0F,MAAM1G,OAAO,IACpE;QAAEgB;QAASiE;IAAc;IAC/B,MAAM2C,YAAY1I,QAAQwH,MAAM1G,OAAO,EAAE;QACvC;YAAEsI,IAAI;YAAIC,iBAAiB7B,MAAM6B,eAAe;YAAE,GAAGF,SAAS;QAAC;KAChE;IACD,MAAM1C,UAAU,IAAIvB,IAClBpD,QAAQV,MAAM,CAAC,CAACI,SAAWA,OAAOd,IAAI,KAAK,UAAU2C,GAAG,CAAC,CAAC7B,SAAWA,OAAOH,IAAI;IAElF,IAAIoF,QAAQpB,IAAI,GAAG,GAAG;QACpB,MAAMiE,aAAa9C,SAAS5G,gBAAgB8I,UAAUxH,SAAS,EAAEsG,MAAM9B,WAAW,GAAGe;QACrF,IAAI6C,eAAe,MAAM,OAAOA;IAClC;IACA,MAAMC,QAAQ,CAAC5E;QACb,IAAIA,YAAY/D,WAAW,OAAO;QAClC,MAAM4I,SAAShK,MAAMmF;QACrB,OAAO6E,OAAOC,EAAE,IAAID,OAAO5F,QAAQ,CAACjB,IAAI,KAAK/B,aAAa4I,OAAO5F,QAAQ,CAACjB,IAAI,KAAK;IACrF;IACA,MAAM+G,aAAa;WAAI,IAAIxE,IAAIiE,UAAUrH,OAAO,CAAC6H,OAAO,CAAC5C;KAAW,CAAC3F,MAAM,CACzE,CAACC,OAASkI,MAAM/B,MAAM1G,OAAO,CAACI,SAAS,CAACG,KAAK,KAAKkI,MAAMb,UAAUxH,SAAS,CAACG,KAAK;IAEnF,MAAMuI,aAAaF,WAAW9H,MAAM,GAAG;IACvC,MAAMiI,eAAeH,WAAW9G,IAAI,CAClC,CAACvB,OAAS1B,UAAU6H,MAAM9B,WAAW,EAAErE,MAAM8F,MAAM,KAAK;IAE1D,IAAIyC,cAAeC,CAAAA,iBAAiBjJ,aAAa4G,MAAMsC,OAAO,KAAK,IAAG,GAAI;QACxE,OAAOxJ,OAAO,qBAAqBuJ,gBAAgBH,UAAU,CAAC,EAAE;IAClE;IACA,MAAMK,iBAAiBH,aACnBlB,UAAUxH,SAAS,GACnBF,OAAOgJ,WAAW,CAChBhJ,OAAOqD,OAAO,CAACqE,UAAUxH,SAAS,EAAEE,MAAM,CAAC,CAAC,CAACC,KAAK,GAChD8H,UAAUrH,OAAO,CAACyB,IAAI,CAAC,CAAC/B,SAAWuF,SAASvF,QAAQW,QAAQ,CAACd;IAGrE,MAAM4I,UAAUnK,mBACdiK,gBACArB,UAAUvH,aAAa,EACvBqG,MAAM9B,WAAW,EACjB8B,MAAMsC,OAAO;IAEf,IAAIG,QAAQA,OAAO,KAAK,UAAU;QAChC,OAAO;YACLvJ,MAAM;YACNC,SAAS;gBACP,GAAIsJ,QAAQC,MAAM,KAAK,UAAU;oBAAEA,QAAQ;gBAAiB,IAAI,CAAC,CAAC;gBAClE3J,MAAM0J,QAAQ1J,IAAI;gBAClBC,MAAMyJ,QAAQzJ,IAAI;gBAClB,GAAIyJ,QAAQxJ,QAAQ,KAAKG,YAAY,CAAC,IAAI;oBAAEH,UAAUwJ,QAAQxJ,QAAQ;gBAAC,CAAC;gBACxE,GAAIwJ,QAAQrD,SAAS,KAAKhG,YAAY,CAAC,IAAI;oBAAEgG,WAAWqD,QAAQrD,SAAS;gBAAC,CAAC;YAC7E;QACF;IACF;IACA,MAAMuD,UAAU3B,SAAShB,MAAM4C,cAAc,EAAEtI,SAAS4G;IACxD,IAAIyB,YAAY,MAAM,OAAOA;IAC7B,MAAME,YAAYX,WACfrG,GAAG,CAAC,CAAChC,OAAS1B,UAAU6H,MAAM9B,WAAW,EAAErE,OAC3CuB,IAAI,CACH,CAACsE,QACCA,MAAMC,MAAM,KAAK;IAEvB,OAAO;QACLzG,MAAM;QACN0F,OAAO1G,UAAU;YACf0J,IAAIrJ;YACJsJ,iBAAiB7B,MAAM6B,eAAe;YACtCvH;YACAiE;YACA,GAAIyB,MAAM8C,SAAS,KAAK1J,YAAY,CAAC,IAAI;gBAAE0J,WAAW9C,MAAM8C,SAAS;YAAC,CAAC;YACvE,GAAID,cAAczJ,YACd,CAAC,IACD;gBACE2J,YAAY;oBACVlC,UAAUgC,UAAUjD,QAAQ,CAACiB,QAAQ;oBACrCmC,SAASH,UAAUjD,QAAQ,CAACoD,OAAO;oBACnCN,QAAQG,UAAUlD,MAAM;gBAC1B;YACF,CAAC;QACP;IACF;AACF"}
@@ -0,0 +1,25 @@
1
+ import type { ProviderRefusal } from './adapter.js';
2
+ export type AttentionEntry = {
3
+ locator: string;
4
+ batch: string;
5
+ outcome: 'conflicted' | 'rejected' | 'expired';
6
+ refusal: ProviderRefusal | null;
7
+ roomVersion?: string;
8
+ };
9
+ export type SyncStatus = {
10
+ state: 'pending' | 'syncing' | 'synced';
11
+ lastCompleted: string | null;
12
+ providerUnreachable: boolean;
13
+ attentionRequired: readonly AttentionEntry[];
14
+ reset: string | null;
15
+ };
16
+ export type CycleProgress = {
17
+ complete: boolean;
18
+ reachable: boolean;
19
+ };
20
+ export declare const STARTING: SyncStatus;
21
+ export declare function transferring(status: SyncStatus): SyncStatus;
22
+ export declare function settled(status: SyncStatus, progress: CycleProgress, at: string | null, queued: boolean, attention: Pick<SyncStatus, 'attentionRequired' | 'reset'>): SyncStatus;
23
+ export declare function saving(status: SyncStatus): SyncStatus;
24
+ export declare function same(one: SyncStatus, other: SyncStatus): boolean;
25
+ //# sourceMappingURL=status.d.ts.map