@agentshouse/mdruntime 0.1.0-cc5745cd9af96 → 0.1.0-cc8c6d652ec3b

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 (235) hide show
  1. package/README.md +18 -15
  2. package/dist/adapter.d.ts +97 -72
  3. package/dist/adapter.d.ts.map +1 -1
  4. package/dist/attached-model.d.ts +5 -1
  5. package/dist/attached-model.d.ts.map +1 -1
  6. package/dist/attached-model.js +38 -4
  7. package/dist/binary.d.ts +0 -5
  8. package/dist/binary.d.ts.map +1 -1
  9. package/dist/binary.js +1 -1
  10. package/dist/bootstrap.d.ts +25 -10
  11. package/dist/bootstrap.d.ts.map +1 -1
  12. package/dist/bootstrap.js +180 -103
  13. package/dist/chain.d.ts +11 -0
  14. package/dist/chain.d.ts.map +1 -0
  15. package/dist/chain.js +64 -0
  16. package/dist/change-set.d.ts +6 -16
  17. package/dist/change-set.d.ts.map +1 -1
  18. package/dist/change-set.js +11 -94
  19. package/dist/change.d.ts +31 -1
  20. package/dist/change.d.ts.map +1 -1
  21. package/dist/change.js +10 -1
  22. package/dist/client.d.ts +11 -8
  23. package/dist/client.d.ts.map +1 -1
  24. package/dist/client.js +80 -7
  25. package/dist/collection.d.ts +10 -22
  26. package/dist/collection.d.ts.map +1 -1
  27. package/dist/collection.js +39 -356
  28. package/dist/compile.d.ts +16 -0
  29. package/dist/compile.d.ts.map +1 -0
  30. package/dist/compile.js +786 -0
  31. package/dist/connection.d.ts +17 -11
  32. package/dist/connection.d.ts.map +1 -1
  33. package/dist/connection.js +2714 -1334
  34. package/dist/conversation.d.ts +13 -11
  35. package/dist/conversation.d.ts.map +1 -1
  36. package/dist/conversation.js +262 -165
  37. package/dist/digest.d.ts +7 -0
  38. package/dist/digest.d.ts.map +1 -0
  39. package/dist/digest.js +113 -0
  40. package/dist/durability.d.ts +2 -5
  41. package/dist/durability.d.ts.map +1 -1
  42. package/dist/durability.js +5 -0
  43. package/dist/entry.d.ts +4 -1
  44. package/dist/entry.d.ts.map +1 -1
  45. package/dist/entry.js +18 -24
  46. package/dist/file.d.ts +2 -19
  47. package/dist/file.d.ts.map +1 -1
  48. package/dist/file.js +7 -122
  49. package/dist/fulltext.d.ts +27 -0
  50. package/dist/fulltext.d.ts.map +1 -0
  51. package/dist/fulltext.js +370 -0
  52. package/dist/host.d.ts +3 -5
  53. package/dist/host.d.ts.map +1 -1
  54. package/dist/host.js +48 -21
  55. package/dist/identity.d.ts +0 -1
  56. package/dist/identity.d.ts.map +1 -1
  57. package/dist/identity.js +0 -3
  58. package/dist/index.d.ts +14 -11
  59. package/dist/index.d.ts.map +1 -1
  60. package/dist/index.js +6 -2
  61. package/dist/live.d.ts +22 -0
  62. package/dist/live.d.ts.map +1 -0
  63. package/dist/live.js +123 -0
  64. package/dist/media.d.ts +8 -0
  65. package/dist/media.d.ts.map +1 -0
  66. package/dist/media.js +218 -0
  67. package/dist/memory.d.ts +10 -6
  68. package/dist/memory.d.ts.map +1 -1
  69. package/dist/memory.js +195 -102
  70. package/dist/messages.d.ts +28 -0
  71. package/dist/messages.d.ts.map +1 -0
  72. package/dist/messages.js +90 -0
  73. package/dist/model.d.ts +6 -1
  74. package/dist/model.d.ts.map +1 -1
  75. package/dist/model.js +7 -10
  76. package/dist/name.d.ts +4 -0
  77. package/dist/name.d.ts.map +1 -0
  78. package/dist/name.js +122 -0
  79. package/dist/observation.d.ts +13 -0
  80. package/dist/observation.d.ts.map +1 -1
  81. package/dist/observation.js +84 -0
  82. package/dist/opened.d.ts +22 -0
  83. package/dist/opened.d.ts.map +1 -0
  84. package/dist/opened.js +107 -0
  85. package/dist/outcome.d.ts +40 -8
  86. package/dist/outcome.d.ts.map +1 -1
  87. package/dist/outcome.js +38 -2
  88. package/dist/overlay.d.ts +1 -4
  89. package/dist/overlay.d.ts.map +1 -1
  90. package/dist/overlay.js +22 -148
  91. package/dist/paths.d.ts +1 -0
  92. package/dist/paths.d.ts.map +1 -1
  93. package/dist/paths.js +4 -0
  94. package/dist/query.d.ts +11 -1
  95. package/dist/query.d.ts.map +1 -1
  96. package/dist/query.js +13 -1
  97. package/dist/reach.d.ts +13 -4
  98. package/dist/reach.d.ts.map +1 -1
  99. package/dist/reach.js +199 -77
  100. package/dist/readiness.d.ts +14 -15
  101. package/dist/readiness.d.ts.map +1 -1
  102. package/dist/readiness.js +2 -8
  103. package/dist/recovery.d.ts +3 -2
  104. package/dist/recovery.d.ts.map +1 -1
  105. package/dist/recovery.js +34 -7
  106. package/dist/refresh.d.ts +17 -15
  107. package/dist/refresh.d.ts.map +1 -1
  108. package/dist/refresh.js +115 -77
  109. package/dist/replica.d.ts +55 -39
  110. package/dist/replica.d.ts.map +1 -1
  111. package/dist/replica.js +277 -200
  112. package/dist/room-draft.d.ts +21 -3
  113. package/dist/room-draft.d.ts.map +1 -1
  114. package/dist/room-draft.js +94 -19
  115. package/dist/rows.d.ts +38 -31
  116. package/dist/rows.d.ts.map +1 -1
  117. package/dist/rows.js +173 -101
  118. package/dist/save.d.ts +51 -14
  119. package/dist/save.d.ts.map +1 -1
  120. package/dist/save.js +363 -103
  121. package/dist/search.d.ts +11 -43
  122. package/dist/search.d.ts.map +1 -1
  123. package/dist/search.js +0 -213
  124. package/dist/shared.d.ts +3 -3
  125. package/dist/shared.d.ts.map +1 -1
  126. package/dist/shared.js +57 -34
  127. package/dist/status.d.ts +4 -3
  128. package/dist/status.d.ts.map +1 -1
  129. package/dist/status.js +3 -1
  130. package/dist/store.d.ts +81 -103
  131. package/dist/store.d.ts.map +1 -1
  132. package/dist/store.js +287 -728
  133. package/dist/stored.d.ts +130 -0
  134. package/dist/stored.d.ts.map +1 -0
  135. package/dist/stored.js +560 -0
  136. package/dist/tables.d.ts +325 -0
  137. package/dist/tables.d.ts.map +1 -0
  138. package/dist/tables.js +578 -0
  139. package/dist/transfer.d.ts +0 -5
  140. package/dist/transfer.d.ts.map +1 -1
  141. package/dist/turn.d.ts +1 -1
  142. package/dist/turn.d.ts.map +1 -1
  143. package/dist/turn.js +31 -20
  144. package/dist/validation.d.ts +29 -0
  145. package/dist/validation.d.ts.map +1 -0
  146. package/dist/validation.js +101 -0
  147. package/dist/windows.d.ts +2 -6
  148. package/dist/windows.d.ts.map +1 -1
  149. package/dist/windows.js +30 -34
  150. package/dist/wire.d.ts +17 -5
  151. package/dist/wire.d.ts.map +1 -1
  152. package/dist/wire.js +5 -2
  153. package/dist/words.d.ts +19 -0
  154. package/dist/words.d.ts.map +1 -0
  155. package/dist/words.js +156 -0
  156. package/package.json +18 -19
  157. package/AGENTS.md +0 -299
  158. package/dist/chat/acts.d.ts +0 -33
  159. package/dist/chat/acts.d.ts.map +0 -1
  160. package/dist/chat/acts.js +0 -36
  161. package/dist/chat/context.d.ts +0 -3
  162. package/dist/chat/context.d.ts.map +0 -1
  163. package/dist/chat/context.js +0 -10
  164. package/dist/chat/earlier.d.ts +0 -10
  165. package/dist/chat/earlier.d.ts.map +0 -1
  166. package/dist/chat/earlier.js +0 -54
  167. package/dist/chat/input.d.ts +0 -9
  168. package/dist/chat/input.d.ts.map +0 -1
  169. package/dist/chat/input.js +0 -99
  170. package/dist/chat/kit.d.ts +0 -61
  171. package/dist/chat/kit.d.ts.map +0 -1
  172. package/dist/chat/kit.js +0 -123
  173. package/dist/chat/lasting.d.ts +0 -6
  174. package/dist/chat/lasting.d.ts.map +0 -1
  175. package/dist/chat/lasting.js +0 -19
  176. package/dist/chat/list.d.ts +0 -28
  177. package/dist/chat/list.d.ts.map +0 -1
  178. package/dist/chat/list.js +0 -103
  179. package/dist/chat/markdown.d.ts +0 -21
  180. package/dist/chat/markdown.d.ts.map +0 -1
  181. package/dist/chat/markdown.js +0 -246
  182. package/dist/chat/message.d.ts +0 -7
  183. package/dist/chat/message.d.ts.map +0 -1
  184. package/dist/chat/message.js +0 -202
  185. package/dist/chat/messages.d.ts +0 -24
  186. package/dist/chat/messages.d.ts.map +0 -1
  187. package/dist/chat/messages.js +0 -187
  188. package/dist/chat/name.d.ts +0 -6
  189. package/dist/chat/name.d.ts.map +0 -1
  190. package/dist/chat/name.js +0 -37
  191. package/dist/chat/opened.d.ts +0 -11
  192. package/dist/chat/opened.d.ts.map +0 -1
  193. package/dist/chat/opened.js +0 -17
  194. package/dist/chat/overlay.d.ts +0 -32
  195. package/dist/chat/overlay.d.ts.map +0 -1
  196. package/dist/chat/overlay.js +0 -107
  197. package/dist/chat/parts.d.ts +0 -57
  198. package/dist/chat/parts.d.ts.map +0 -1
  199. package/dist/chat/parts.js +0 -119
  200. package/dist/chat/pieces.d.ts +0 -62
  201. package/dist/chat/pieces.d.ts.map +0 -1
  202. package/dist/chat/pieces.js +0 -1110
  203. package/dist/chat/process.d.ts +0 -20
  204. package/dist/chat/process.d.ts.map +0 -1
  205. package/dist/chat/process.js +0 -32
  206. package/dist/chat/provider.d.ts +0 -64
  207. package/dist/chat/provider.d.ts.map +0 -1
  208. package/dist/chat/provider.js +0 -638
  209. package/dist/chat/question.d.ts +0 -9
  210. package/dist/chat/question.d.ts.map +0 -1
  211. package/dist/chat/question.js +0 -69
  212. package/dist/chat/questions.d.ts +0 -31
  213. package/dist/chat/questions.d.ts.map +0 -1
  214. package/dist/chat/questions.js +0 -111
  215. package/dist/chat/read.d.ts +0 -5
  216. package/dist/chat/read.d.ts.map +0 -1
  217. package/dist/chat/read.js +0 -13
  218. package/dist/chat/ready.d.ts +0 -34
  219. package/dist/chat/ready.d.ts.map +0 -1
  220. package/dist/chat/ready.js +0 -91
  221. package/dist/chat/steady.d.ts +0 -3
  222. package/dist/chat/steady.d.ts.map +0 -1
  223. package/dist/chat/steady.js +0 -26
  224. package/dist/chat/style.d.ts +0 -4
  225. package/dist/chat/style.d.ts.map +0 -1
  226. package/dist/chat/style.js +0 -302
  227. package/dist/chat.d.ts +0 -14
  228. package/dist/chat.d.ts.map +0 -1
  229. package/dist/chat.js +0 -8
  230. package/dist/read-side.d.ts +0 -27
  231. package/dist/read-side.d.ts.map +0 -1
  232. package/dist/read-side.js +0 -826
  233. package/dist/reads.d.ts +0 -11
  234. package/dist/reads.d.ts.map +0 -1
  235. package/dist/reads.js +0 -98
package/dist/save.js CHANGED
@@ -1,12 +1,13 @@
1
1
  import { definitionOf } from './model.js';
2
- import { apply, ATTACHMENT, links, parse, pointerSegments, references, relative, relativize, retarget, serialize, target, } from '@agentshouse/mdmodel';
3
- import { immutable, queuedFile, departure, } from './change.js';
4
- import { available, changedCleanly, collectionOf, documentsOf, governing, referring, validateCollection, } from './collection.js';
2
+ import { apply, ARRAY_INDEX, ATTACHMENT, links, parse, pointerSegments, references, relative, relativize, retarget, roomReferences, serialize, target, } from '@agentshouse/mdmodel';
3
+ import { immutable, leaving, queuedFile, departure, } from './change.js';
4
+ import { collectionOf, documentsOf, governing, } from './collection.js';
5
5
  import { changeBatchIdentity } from './identity.js';
6
6
  import { overlaying } from './overlay.js';
7
- import { covered, normalize } from './paths.js';
8
- import { differences } from './shared.js';
9
- import { finished, ROW_WEIGHT, stepped } from './turn.js';
7
+ import { ancestors, covered, normalize } from './paths.js';
8
+ import { sorting } from './shared.js';
9
+ import { paced, ROW_WEIGHT, stepped } from './turn.js';
10
+ import { validatedCollection } from './validation.js';
10
11
  function refuse(code, file, location) {
11
12
  return {
12
13
  kind: 'refused',
@@ -143,12 +144,13 @@ function* rewrites(changes, visible) {
143
144
  return { kind: 'changes', changes };
144
145
  const merged = [...changes];
145
146
  const added = [];
146
- for (const [path, document] of documentsOf(visible.collection)) {
147
+ for (const [path, document] of yield* documentsOf(visible.collection)) {
147
148
  if (settled.has(path))
148
149
  continue;
149
150
  const moved = moves.get(path) ?? path;
150
151
  const definition = definitionOf(governing(visible.collection.composition, path), document.type);
151
- added.push(...repointed(document, definition, path, moved, moves, settled));
152
+ const repointing = repointed(document, definition, path, moved, moves, settled);
153
+ added.push(...repointing);
152
154
  const own = parts.get(path) ?? [];
153
155
  const relinked = relinks(path, moved, edited(document, own.map((index) => merged[index])), moves);
154
156
  if (relinked.kind === 'refused')
@@ -175,7 +177,9 @@ function* rewrites(changes, visible) {
175
177
  else
176
178
  merged[index] = change;
177
179
  }
178
- yield ROW_WEIGHT + visible.collection.text[path].length;
180
+ const text = visible.collection.text[path].length;
181
+ const rewritten = repointing.length > 0 || relinked.changes.length > 0;
182
+ yield ROW_WEIGHT + text + (rewritten ? text : 0);
179
183
  }
180
184
  return {
181
185
  kind: 'changes',
@@ -199,6 +203,71 @@ export function* providerRewritten(batch, visible) {
199
203
  ...(yield* anticipated(batch.changes, batch.preconditions, rewritten.changes, visible)),
200
204
  };
201
205
  }
206
+ function crossed(document, definition, path, to) {
207
+ const changes = [];
208
+ for (const link of links(document, path)) {
209
+ const written = to(link.target, link.href);
210
+ if (written !== undefined)
211
+ changes.push({ kind: 'link', href: link.href, to: written });
212
+ }
213
+ for (const { pointer, value } of definition === undefined
214
+ ? []
215
+ : references(document, definition)) {
216
+ const named = target(path, value);
217
+ const written = named === null ? undefined : to(named, value);
218
+ if (written !== undefined) {
219
+ changes.push({ kind: 'reference', pointer, value: retarget(value, written), prior: value });
220
+ }
221
+ }
222
+ return changes;
223
+ }
224
+ function rewritten(path, document, changes) {
225
+ if (changes.length === 0)
226
+ return [];
227
+ const applied = apply(document, changes);
228
+ if (applied.outcome !== 'applied')
229
+ return [];
230
+ const after = applied.document;
231
+ if (document.type === undefined)
232
+ return [{ kind: 'replace', path, content: serialize(after) }];
233
+ const names = new Set(changes.flatMap((change) => change.kind === 'reference' ? [pointerSegments(change.pointer)[0] ?? ''] : []));
234
+ return [
235
+ ...[...names].map((name) => ({ kind: 'field', path, name, value: after.fields[name] })),
236
+ ...bodies(path, document, after),
237
+ ];
238
+ }
239
+ function roomPathOf(handle, path) {
240
+ return `/rooms/${handle}/${path}`;
241
+ }
242
+ export function* leavingRewritten(batch, visible) {
243
+ const between = batch.between;
244
+ if (between === undefined)
245
+ return batch;
246
+ const moved = new Map(between.moves.map(({ path, to }) => [path, roomPathOf(between.destination.handle, to)]));
247
+ const derived = [];
248
+ for (const [path, document] of yield* documentsOf(visible.collection)) {
249
+ if (moved.has(path))
250
+ continue;
251
+ const definition = definitionOf(governing(visible.collection.composition, path), document.type);
252
+ derived.push(...rewritten(path, document, crossed(document, definition, path, (named) => moved.get(named))));
253
+ yield ROW_WEIGHT + visible.collection.text[path].length;
254
+ }
255
+ if (derived.length === 0)
256
+ return batch;
257
+ return {
258
+ ...batch,
259
+ changes: [...derived, ...batch.changes],
260
+ preconditions: [...(yield* preconditionsOf(derived, visible, [])), ...batch.preconditions],
261
+ };
262
+ }
263
+ export function rewriting(batch, locator) {
264
+ return leaving(batch, locator) || batch.changes.some((change) => change.kind === 'move');
265
+ }
266
+ export function* effectiveIn(batch, locator, visible) {
267
+ return leaving(batch, locator)
268
+ ? yield* leavingRewritten(batch, visible)
269
+ : yield* providerRewritten(batch, visible);
270
+ }
202
271
  function* incoming(collection, removed, candidates) {
203
272
  const found = new Map();
204
273
  const note = (target, file) => {
@@ -209,13 +278,19 @@ function* incoming(collection, removed, candidates) {
209
278
  found.set(target, referrers);
210
279
  };
211
280
  const read = function* (paths) {
212
- for (const path of [...new Set(paths)].sort()) {
281
+ const seen = new Set();
282
+ for (const path of paths) {
283
+ if (seen.has(path))
284
+ continue;
285
+ seen.add(path);
213
286
  const document = collection.document(path);
214
287
  if (document !== undefined)
215
288
  yield [path, document];
216
289
  }
217
290
  };
218
- for (const [path, document] of candidates === null ? documentsOf(collection) : read(candidates)) {
291
+ for (const [path, document] of candidates === null
292
+ ? yield* documentsOf(collection)
293
+ : read(candidates)) {
219
294
  const definition = definitionOf(governing(collection.composition, path), document.type);
220
295
  for (const { value, to } of definition === undefined ? [] : references(document, definition)) {
221
296
  if (to.includes(ATTACHMENT))
@@ -226,7 +301,7 @@ function* incoming(collection, removed, candidates) {
226
301
  }
227
302
  yield ROW_WEIGHT + collection.text[path].length;
228
303
  }
229
- const [first] = [...found.keys()].sort();
304
+ const [first] = yield* sorting(found.keys());
230
305
  if (first === undefined)
231
306
  return null;
232
307
  const every = new Set();
@@ -239,14 +314,14 @@ function* incoming(collection, removed, candidates) {
239
314
  code: 'referenced-missing-file',
240
315
  retryable: false,
241
316
  file: first,
242
- referrers: [...every].sort(),
317
+ referrers: yield* sorting(every),
243
318
  },
244
319
  };
245
320
  }
246
321
  function affected(change) {
247
322
  return change.kind === 'move' ? [change.path, change.to] : [change.path];
248
323
  }
249
- function guard(changes, input) {
324
+ function guard(changes, input, removing) {
250
325
  const overridden = new Map();
251
326
  const existing = {
252
327
  has: (path) => overridden.get(path) ??
@@ -254,6 +329,7 @@ function guard(changes, input) {
254
329
  add: (path) => void overridden.set(path, true),
255
330
  delete: (path) => void overridden.set(path, false),
256
331
  };
332
+ const occupied = (path) => input.folders.has(path) ? path : (ancestors(path).find((one) => existing.has(one)) ?? null);
257
333
  for (const [index, change] of changes.entries()) {
258
334
  for (const path of affected(change)) {
259
335
  const normalized = normalize(path);
@@ -262,13 +338,14 @@ function guard(changes, input) {
262
338
  if (covered(input.providerOwnedPaths, normalized)) {
263
339
  return refuse('provider-owned-path', normalized);
264
340
  }
265
- const operation = change.kind === 'remove' ? 'delete' : 'write';
341
+ const operation = change.kind === 'remove' ? removing : 'write';
266
342
  if (!input.local && !covered(input.operations[operation], normalized))
267
343
  return refuse(`${operation}-grant`, normalized);
268
344
  }
269
- if (change.kind === 'create') {
270
- if (existing.has(change.path))
271
- return refuse('path-collision', change.path);
345
+ if (change.kind === 'create' || change.kind === 'arrival') {
346
+ const taken = existing.has(change.path) ? change.path : occupied(change.path);
347
+ if (taken !== null)
348
+ return refuse('path-collision', taken);
272
349
  existing.add(change.path);
273
350
  continue;
274
351
  }
@@ -278,6 +355,9 @@ function guard(changes, input) {
278
355
  input.bases.some((base) => base.kind === 'absent' && base.path === change.path))) {
279
356
  return refuse('path-collision', change.path);
280
357
  }
358
+ const taken = occupied(change.path);
359
+ if (taken !== null)
360
+ return refuse('path-collision', taken);
281
361
  if (!input.local &&
282
362
  existing.has(change.path) &&
283
363
  input.visible.revisions[departure(changes, index)] === undefined) {
@@ -289,8 +369,9 @@ function guard(changes, input) {
289
369
  if (change.kind === 'move') {
290
370
  if (!existing.has(change.path))
291
371
  return refuse('path-absent', change.path);
292
- if (existing.has(change.to))
293
- return refuse('path-collision', change.to);
372
+ const taken = existing.has(change.to) ? change.to : occupied(change.to);
373
+ if (taken !== null)
374
+ return refuse('path-collision', taken);
294
375
  if (unrevised(input, change.path)) {
295
376
  return refuse('unknown-revision', change.path);
296
377
  }
@@ -326,7 +407,7 @@ export function queuedDocuments(queue) {
326
407
  const paths = new Set();
327
408
  for (const batch of queue) {
328
409
  for (const change of batch.changes) {
329
- if (change.kind === 'binary')
410
+ if (change.kind === 'binary' || (change.kind === 'arrival' && !('content' in change)))
330
411
  continue;
331
412
  if (change.kind === 'remove')
332
413
  paths.delete(change.path);
@@ -417,7 +498,10 @@ function depth(path) {
417
498
  function* exceeding(limits, changes, effective, resulting) {
418
499
  const written = effective.map((change) => (change.kind === 'move' ? change.to : change.path));
419
500
  const created = changes
420
- .filter((change) => change.kind === 'create' || change.kind === 'move' || change.kind === 'binary')
501
+ .filter((change) => change.kind === 'create' ||
502
+ change.kind === 'move' ||
503
+ change.kind === 'binary' ||
504
+ change.kind === 'arrival')
421
505
  .map((change) => (change.kind === 'move' ? change.to : change.path));
422
506
  for (const limit of limits) {
423
507
  const value = limit.value;
@@ -503,18 +587,6 @@ function relativeChanges(input) {
503
587
  return { ...change, fields, sections };
504
588
  });
505
589
  }
506
- function* unmodeledType(collection, composition) {
507
- if (available(composition))
508
- return false;
509
- for (const [path, document] of documentsOf(collection)) {
510
- if (document.type !== undefined &&
511
- document.type !== 'any' &&
512
- governing(composition, path).status === 'unavailable')
513
- return true;
514
- yield ROW_WEIGHT + collection.text[path].length;
515
- }
516
- return false;
517
- }
518
590
  function unqueueable(file) {
519
591
  return { kind: 'refused', refusal: { code: 'unknown-revision', retryable: false, file } };
520
592
  }
@@ -617,8 +689,8 @@ function folded(changes, change, appending, deferred) {
617
689
  changes.push(change);
618
690
  return 'appended';
619
691
  }
620
- function relinked(batch, move, before, after, appending) {
621
- const derived = finished(rewrites([move], after));
692
+ function* relinked(batch, move, before, after, appending) {
693
+ const derived = yield* rewrites([move], after);
622
694
  if (derived.kind === 'refused')
623
695
  return derived;
624
696
  const changes = [...batch.changes];
@@ -645,6 +717,7 @@ function relinked(batch, move, before, after, appending) {
645
717
  if (!changed)
646
718
  return { kind: 'relinked', batch };
647
719
  const held = new Set(batch.preconditions.map(identity));
720
+ const added = yield* preconditionsOf(appended, before, []);
648
721
  return {
649
722
  kind: 'relinked',
650
723
  batch: immutable({
@@ -653,7 +726,7 @@ function relinked(batch, move, before, after, appending) {
653
726
  changes,
654
727
  preconditions: [
655
728
  ...batch.preconditions,
656
- ...finished(preconditionsOf(appended, before, [])).filter((precondition) => !held.has(identity(precondition))),
729
+ ...added.filter((precondition) => !held.has(identity(precondition))),
657
730
  ],
658
731
  }),
659
732
  };
@@ -699,7 +772,7 @@ function withdrawnFile(batch, change, at) {
699
772
  ];
700
773
  return immutable({ ...batch, id: changeBatchIdentity(), changes, preconditions });
701
774
  }
702
- export function requeued(queue, changes, visible, changeable, state) {
775
+ export function* requeuing(queue, changes, visible, changeable, state) {
703
776
  const next = [...queue];
704
777
  const origins = new Map();
705
778
  const withdrawn = new Map();
@@ -722,19 +795,19 @@ export function requeued(queue, changes, visible, changeable, state) {
722
795
  return unqueueable(change.path);
723
796
  const following = next.slice(index);
724
797
  const rebuilt = [];
725
- let before = change.kind === 'move' ? state(next.slice(0, index)) : visible;
798
+ let before = change.kind === 'move' ? yield* state(next.slice(0, index)) : visible;
726
799
  for (const [offset, batch] of following.entries()) {
727
800
  let current = batch;
728
801
  if (change.kind === 'move') {
729
- const after = state(next.slice(0, index + offset + 1));
802
+ const after = yield* state(next.slice(0, index + offset + 1));
730
803
  const appending = offset === 0 && created(batch, queuedFile(batch, change.path, held.localId));
731
- const relinking = relinked(batch, change, before, after, appending);
804
+ const relinking = yield* relinked(batch, change, before, after, appending);
732
805
  if (relinking.kind === 'refused')
733
806
  return relinking;
734
807
  current = relinking.batch;
735
808
  before = after;
736
809
  }
737
- if (current !== batch && !open(batch))
810
+ if (current !== batch && (!open(batch) || batch.between !== undefined))
738
811
  return unqueueable(change.path);
739
812
  rebuilt.push(offset === 0
740
813
  ? withdrawnFile(current, change, queuedFile(current, change.path, held.localId))
@@ -804,67 +877,66 @@ export function joined(queue, owner, extra) {
804
877
  });
805
878
  return { kind: 'joined', batch, queue: queue.map((item) => (item === owner ? batch : item)) };
806
879
  }
807
- export function limitedIn(queue, batch, limits, state) {
880
+ export function* limiting(queue, batch, limits, state) {
808
881
  const at = queue.indexOf(batch);
809
- const limited = finished(exceeding(limits, batch.changes, finished(providerRewritten(batch, state(queue.slice(0, at)))).changes, state(queue.slice(0, at + 1))));
882
+ const rewritten = yield* providerRewritten(batch, yield* state(queue.slice(0, at)));
883
+ const limited = yield* exceeding(limits, batch.changes, rewritten.changes, yield* state(queue.slice(0, at + 1)));
810
884
  return limited?.kind === 'refused' ? limited.refusal : null;
811
885
  }
812
- function* batching(input) {
813
- const changes = relativeChanges(input);
814
- const structural = changes.find((change) => change.kind === 'move' || change.kind === 'remove');
815
- if (structural !== undefined &&
816
- (yield* unmodeledType(input.visible.collection, input.composition)))
817
- return refuse('model-unavailable', structural.path);
818
- if (changes.length === 0)
819
- return refuse('no-change');
820
- const rewritten = yield* rewrites(changes, input.visible);
821
- if (rewritten.kind === 'refused')
822
- return rewritten;
823
- const refusal = guard(changes, input);
824
- if (refusal !== null)
825
- return refusal;
826
- const preconditions = yield* preconditionsOf(changes, input.visible, input.bases);
827
- const predicted = yield* anticipated(changes, preconditions, rewritten.changes, input.visible);
828
- const resulting = yield* overlaying(input.visible, [
829
- { id: '', baseRoomVersion: input.baseRoomVersion, ...predicted },
830
- ]);
831
- const clean = input.clean !== undefined && available(input.composition) ? input.clean : null;
832
- const removed = new Set(changes.filter((change) => change.kind === 'remove').map((change) => change.path));
886
+ function typedText(content) {
887
+ if (content === undefined)
888
+ return false;
889
+ const parsed = parse(content);
890
+ return parsed.ok && parsed.document.type !== undefined && parsed.document.type !== 'any';
891
+ }
892
+ function touchedLibrary(resulting, touched, composition) {
893
+ const entries = touched
894
+ .flatMap((path) => {
895
+ const content = resulting.documents[path];
896
+ const binary = resulting.binaries[path] !== undefined;
897
+ return content === undefined && !binary ? [] : [{ path, content: content ?? null }];
898
+ })
899
+ .sort((left, right) => (left.path < right.path ? -1 : left.path > right.path ? 1 : 0));
900
+ const contents = new Map(entries.map(({ path, content }) => [path, content]));
901
+ const binaries = new Set(Object.keys(resulting.binaries).filter((path) => resulting.binaries[path] !== undefined));
902
+ return validatedCollection(() => Promise.resolve({ entries, next: null }), async (paths) => {
903
+ const known = new Map();
904
+ const pace = paced();
905
+ for (const path of paths) {
906
+ const content = contents.get(path);
907
+ if (binaries.has(path))
908
+ known.set(path, { type: undefined, binary: true });
909
+ else if (content !== undefined && content !== null) {
910
+ const read = parse(content, path);
911
+ if (read.ok)
912
+ known.set(path, { type: read.document.type ?? 'any', binary: false });
913
+ await pace(content.length + ROW_WEIGHT);
914
+ }
915
+ }
916
+ return known;
917
+ }, composition);
918
+ }
919
+ async function judging(visible, resulting, composition, validate, removed, touched) {
833
920
  if (removed.size > 0) {
834
- const referrers = clean === null ? null : referring(clean, input.composition, removed);
835
- const referenced = yield* incoming(collectionOf(resulting.documents, input.composition), removed, clean === null || referrers === null
836
- ? null
837
- : [...referrers, ...(yield* differences(clean.text, resulting.documents))]);
921
+ const referenced = await stepped(incoming(collectionOf(resulting.documents, composition), removed, null));
838
922
  if (referenced !== null)
839
923
  return referenced;
840
924
  }
841
- const typed = (content) => {
842
- if (content === undefined)
843
- return false;
844
- const parsed = parse(content);
845
- return parsed.ok && parsed.document.type !== undefined && parsed.document.type !== 'any';
846
- };
847
- const touched = [...new Set(predicted.changes.flatMap(affected))];
848
925
  const typedPaths = [];
926
+ const pace = paced();
849
927
  for (const path of touched) {
850
- const before = input.visible.documents[path];
928
+ const before = visible.documents[path];
851
929
  const after = resulting.documents[path];
852
- if (typed(before) || typed(after))
930
+ if (typedText(before) || typedText(after))
853
931
  typedPaths.push(path);
854
- yield ROW_WEIGHT + (before?.length ?? 0) + (after?.length ?? 0);
932
+ await pace((before?.length ?? 0) + (after?.length ?? 0) + ROW_WEIGHT);
855
933
  }
856
- const needsModel = typedPaths.length > 0;
857
- const withoutModel = typedPaths.find((path) => governing(input.composition, path).status === 'unavailable');
934
+ const withoutModel = typedPaths.find((path) => governing(composition, path).status === 'unavailable');
858
935
  if (withoutModel !== undefined)
859
936
  return refuse('model-unavailable', withoutModel);
860
- const verdict = clean !== null &&
861
- (yield* changedCleanly({ text: resulting.documents, binaries: resulting.binaries }, clean, input.composition))
862
- ? { verdict: 'accept' }
863
- : yield* validateCollection(needsModel
864
- ? resulting.documents
865
- : Object.fromEntries(touched.flatMap((path) => resulting.documents[path] === undefined
866
- ? []
867
- : [[path, resulting.documents[path]]])), Object.keys(resulting.binaries), input.composition);
937
+ const verdict = typedPaths.length > 0
938
+ ? await validate(resulting, touched)
939
+ : await touchedLibrary(resulting, touched, composition);
868
940
  if (verdict.verdict === 'refuse') {
869
941
  return {
870
942
  kind: 'refused',
@@ -877,12 +949,92 @@ function* batching(input) {
877
949
  },
878
950
  };
879
951
  }
880
- const limited = yield* exceeding(input.providerLimits, changes, predicted.changes, resulting);
952
+ return {
953
+ kind: 'judged',
954
+ validated: typedPaths
955
+ .map((path) => governing(composition, path))
956
+ .find((model) => model.status !== 'unavailable'),
957
+ };
958
+ }
959
+ function placed(reference) {
960
+ const key = roomPathOf(reference.handle, reference.path);
961
+ if (reference.kind === 'link')
962
+ return `link ${key}`;
963
+ if (reference.kind === 'item')
964
+ return `section ${reference.section} ${key}`;
965
+ const pointer = reference.pointer
966
+ .split('/')
967
+ .map((segment) => (ARRAY_INDEX.test(segment) ? '-' : segment))
968
+ .join('/');
969
+ return `field ${pointer} ${key}`;
970
+ }
971
+ function roomReferencesIn(path, content, composition) {
972
+ if (content === undefined)
973
+ return [];
974
+ const parsed = parse(content, path);
975
+ if (!parsed.ok)
976
+ return [];
977
+ return roomReferences(path, content, definitionOf(governing(composition, path), parsed.document.type));
978
+ }
979
+ function* admittedRooms(changes, visible, resulting, composition) {
980
+ const from = new Map();
981
+ for (const [index, change] of changes.entries()) {
982
+ if (change.kind === 'move')
983
+ from.set(change.to, departure(changes, index));
984
+ }
985
+ for (const path of [...new Set(changes.flatMap(affected))].sort()) {
986
+ const now = resulting.documents[path];
987
+ if (now === undefined)
988
+ continue;
989
+ const held = new Set(roomReferencesIn(path, visible.documents[from.get(path) ?? path], composition).map(placed));
990
+ for (const reference of roomReferencesIn(path, now, composition)) {
991
+ if (reference.kind === 'link' || reference.crossRoom === true)
992
+ continue;
993
+ if (held.has(placed(reference)))
994
+ continue;
995
+ return refuse('unresolved-reference', path, reference.kind === 'field' ? reference.pointer : reference.section);
996
+ }
997
+ yield ROW_WEIGHT + now.length;
998
+ }
999
+ return null;
1000
+ }
1001
+ function validationOf(validated) {
1002
+ return validated === undefined
1003
+ ? {}
1004
+ : {
1005
+ validation: {
1006
+ identity: validated.snapshot.identity,
1007
+ version: validated.snapshot.version,
1008
+ source: validated.status,
1009
+ },
1010
+ };
1011
+ }
1012
+ async function batching(input) {
1013
+ const changes = relativeChanges(input);
1014
+ const structural = changes.find((change) => change.kind === 'move' || change.kind === 'remove');
1015
+ if (structural !== undefined && input.unmodeled) {
1016
+ return refuse('model-unavailable', structural.path);
1017
+ }
1018
+ if (changes.length === 0)
1019
+ return refuse('no-change');
1020
+ const rewritten = await stepped(rewrites(changes, input.visible));
1021
+ if (rewritten.kind === 'refused')
1022
+ return rewritten;
1023
+ const refusal = guard(changes, input, 'delete');
1024
+ if (refusal !== null)
1025
+ return refusal;
1026
+ const preconditions = await stepped(preconditionsOf(changes, input.visible, input.bases));
1027
+ const predicted = await stepped(anticipated(changes, preconditions, rewritten.changes, input.visible));
1028
+ const resulting = await stepped(overlaying(input.visible, [{ id: '', baseRoomVersion: input.baseRoomVersion, ...predicted }]));
1029
+ const judged = await judging(input.visible, resulting, input.composition, input.validate, new Set(changes.filter((change) => change.kind === 'remove').map((change) => change.path)), [...new Set(predicted.changes.flatMap(affected))]);
1030
+ if (judged.kind === 'refused')
1031
+ return judged;
1032
+ const crossing = await stepped(admittedRooms(changes, input.visible, resulting, input.composition));
1033
+ if (crossing !== null)
1034
+ return crossing;
1035
+ const limited = await stepped(exceeding(input.providerLimits, changes, predicted.changes, resulting));
881
1036
  if (limited !== null)
882
1037
  return limited;
883
- const validated = typedPaths
884
- .map((path) => governing(input.composition, path))
885
- .find((model) => model.status !== 'unavailable');
886
1038
  return {
887
1039
  kind: 'batch',
888
1040
  batch: immutable({
@@ -891,18 +1043,126 @@ function* batching(input) {
891
1043
  changes,
892
1044
  preconditions,
893
1045
  ...(input.writtenBy === undefined ? {} : { writtenBy: input.writtenBy }),
894
- ...(validated === undefined
895
- ? {}
896
- : {
897
- validation: {
898
- identity: validated.snapshot.identity,
899
- version: validated.snapshot.version,
900
- source: validated.status,
901
- },
902
- }),
1046
+ ...validationOf(judged.validated),
903
1047
  }),
904
1048
  };
905
1049
  }
1050
+ export const MOVE_DOCUMENTS = 'move-documents';
1051
+ function heldAt(visible, path) {
1052
+ return visible.documents[path] !== undefined || visible.binaries[path] !== undefined;
1053
+ }
1054
+ function arrivingText(path, to, source, moved) {
1055
+ const content = source.visible.documents[path];
1056
+ const document = source.visible.collection.document(path);
1057
+ if (document === undefined)
1058
+ return content;
1059
+ const definition = definitionOf(governing(source.composition, path), document.type);
1060
+ const changes = crossed(document, definition, path, (named, href) => {
1061
+ const at = moved.get(named);
1062
+ if (at !== undefined)
1063
+ return target(to, href) === at ? undefined : relative(to, at);
1064
+ return heldAt(source.visible, named) ? roomPathOf(source.handle, named) : undefined;
1065
+ });
1066
+ if (changes.length === 0)
1067
+ return content;
1068
+ const applied = apply(document, changes);
1069
+ return applied.outcome === 'applied' ? serialize(applied.document) : content;
1070
+ }
1071
+ function arrivalOf({ path, to }, source, moved) {
1072
+ const { documents, revisions, fileIds, changes, binaries } = source.visible;
1073
+ const kept = {
1074
+ ...(fileIds[path] === undefined ? {} : { fileId: fileIds[path] }),
1075
+ ...(changes[path] === undefined ? {} : { change: changes[path] }),
1076
+ };
1077
+ const heads = {
1078
+ ...(revisions[path] === undefined ? {} : { revision: revisions[path] }),
1079
+ ...kept,
1080
+ };
1081
+ const binary = binaries[path];
1082
+ if (binary?.state === 'accepted') {
1083
+ const { byteLength, mediaType, sha256 } = binary;
1084
+ return {
1085
+ kind: 'arrival',
1086
+ path: to,
1087
+ binary: { byteLength, mediaType, sha256 },
1088
+ ...heads,
1089
+ };
1090
+ }
1091
+ const content = arrivingText(path, to, source, moved);
1092
+ return {
1093
+ kind: 'arrival',
1094
+ path: to,
1095
+ content,
1096
+ ...(content === documents[path] ? heads : kept),
1097
+ };
1098
+ }
1099
+ async function moving(input) {
1100
+ const { source, destination, moves } = input;
1101
+ if (moves.length === 0)
1102
+ return refuse('no-change');
1103
+ const removals = moves.map(({ path }) => ({ kind: 'remove', path }));
1104
+ const leaves = guard(removals, { ...source, local: input.local, bases: [] }, 'write');
1105
+ if (leaves !== null)
1106
+ return leaves;
1107
+ const uploading = moves.find(({ path }) => source.visible.binaries[path]?.state === 'pending');
1108
+ if (uploading !== undefined)
1109
+ return refuse('unknown-revision', uploading.path);
1110
+ const moved = new Map(moves.map(({ path, to }) => [path, to]));
1111
+ const arrivals = moves.map((move) => arrivalOf(move, source, moved));
1112
+ const arrives = guard(arrivals, { ...destination, local: input.local, bases: [] }, 'write');
1113
+ if (arrives !== null)
1114
+ return arrives;
1115
+ const bound = input.providerLimits.find((limit) => limit.name === MOVE_DOCUMENTS)?.value;
1116
+ if (typeof bound === 'number' && moves.length > bound) {
1117
+ return refuse('provider-limit', undefined, MOVE_DOCUMENTS);
1118
+ }
1119
+ if (source.unmodeled)
1120
+ return refuse('model-unavailable', moves[0].path);
1121
+ const id = changeBatchIdentity();
1122
+ const between = {
1123
+ source: { room: source.room, baseRoomVersion: source.baseRoomVersion },
1124
+ destination: {
1125
+ room: destination.room,
1126
+ baseRoomVersion: destination.baseRoomVersion,
1127
+ handle: destination.handle,
1128
+ },
1129
+ moves,
1130
+ };
1131
+ const written = input.writtenBy === undefined ? {} : { writtenBy: input.writtenBy };
1132
+ const leavingBatch = {
1133
+ id,
1134
+ baseRoomVersion: source.baseRoomVersion,
1135
+ changes: removals,
1136
+ preconditions: moves.map(({ path }) => existence(source.visible, path)),
1137
+ ...written,
1138
+ between,
1139
+ };
1140
+ const effective = await stepped(leavingRewritten(leavingBatch, source.visible));
1141
+ const left = await stepped(overlaying(source.visible, [effective]));
1142
+ const sourceJudged = await judging(source.visible, left, source.composition, source.validate, new Set(moves.map(({ path }) => path)), [...new Set(effective.changes.map((change) => change.path))]);
1143
+ if (sourceJudged.kind === 'refused')
1144
+ return sourceJudged;
1145
+ const arrivingBatch = {
1146
+ id,
1147
+ baseRoomVersion: destination.baseRoomVersion,
1148
+ changes: arrivals,
1149
+ preconditions: moves.map(({ to }) => ({ kind: 'absent', path: to })),
1150
+ ...written,
1151
+ between,
1152
+ };
1153
+ const arrived = await stepped(overlaying(destination.visible, [arrivingBatch]));
1154
+ const destinationJudged = await judging(destination.visible, arrived, destination.composition, destination.validate, new Set(), moves.map(({ to }) => to));
1155
+ if (destinationJudged.kind === 'refused')
1156
+ return destinationJudged;
1157
+ const limited = (await stepped(exceeding(input.providerLimits, removals, effective.changes, left))) ??
1158
+ (await stepped(exceeding(input.providerLimits, arrivals, arrivals, arrived)));
1159
+ if (limited !== null)
1160
+ return limited;
1161
+ return { kind: 'moved', leaving: immutable(leavingBatch), arriving: immutable(arrivingBatch) };
1162
+ }
1163
+ export function buildMove(input) {
1164
+ return moving(input);
1165
+ }
906
1166
  export function buildBatch(input) {
907
- return stepped(batching(input));
1167
+ return batching(input);
908
1168
  }