@oomol-lab/open-flow 0.1.0-beta.6 → 0.1.0-beta.7

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.
@@ -100,14 +100,18 @@ function v(e) {
100
100
  function y(e) {
101
101
  return Object.fromEntries(e.flatMap((e) => "handle" in e ? [[e.handle, e]] : []));
102
102
  }
103
- var b = class extends Error {};
104
- function x() {
105
- throw new b();
103
+ var b = class extends Error {
104
+ constructor(e) {
105
+ super(e), this.name = "FlowChangeError";
106
+ }
107
+ };
108
+ function x(e) {
109
+ throw new b(e);
106
110
  }
107
111
  function S(e, t) {
108
112
  if (t.kind == "flow") return e.graph;
109
113
  let n = e.subflows[t.id];
110
- return n ?? x(), n.graph;
114
+ return n ?? x("The target Subflow does not exist."), n.graph;
111
115
  }
112
116
  function C(e, t, n) {
113
117
  if (t.kind == "flow") return {
@@ -115,7 +119,7 @@ function C(e, t, n) {
115
119
  graph: n
116
120
  };
117
121
  let r = e.subflows[t.id];
118
- return r ?? x(), {
122
+ return r ?? x("The target Subflow does not exist."), {
119
123
  ...e,
120
124
  subflows: {
121
125
  ...e.subflows,
@@ -146,20 +150,20 @@ function T(e, n) {
146
150
  let r = { ...e.document }, i = { ...e.modules };
147
151
  for (let e of n) switch (e.kind) {
148
152
  case "binding.create":
149
- r.bindings[e.bindingId] != null && x(), r.bindings = {
153
+ r.bindings[e.bindingId] != null && x("A Binding with this ID already exists."), r.bindings = {
150
154
  ...r.bindings,
151
155
  [e.bindingId]: e.binding
152
156
  };
153
157
  break;
154
158
  case "binding.delete": {
155
- r.bindings[e.bindingId] ?? x();
159
+ r.bindings[e.bindingId] ?? x("The Binding does not exist.");
156
160
  let t = { ...r.bindings };
157
161
  delete t[e.bindingId], r.bindings = t;
158
162
  break;
159
163
  }
160
164
  case "binding.target.set": {
161
165
  let t = r.bindings[e.bindingId];
162
- (t == null || t.target != e.before) && x(), r.bindings = {
166
+ t ?? x("The Binding does not exist."), t.target != e.before && x("The Binding target changed before this operation was applied."), r.bindings = {
163
167
  ...r.bindings,
164
168
  [e.bindingId]: {
165
169
  ...t,
@@ -170,17 +174,17 @@ function T(e, n) {
170
174
  }
171
175
  case "graph.edge.connect": {
172
176
  let n = S(r, e.target);
173
- n.nodes[e.edge.source] ?? x();
177
+ n.nodes[e.edge.source] ?? x("The source Node does not exist.");
174
178
  let i = n.nodes[e.edge.target];
175
- (i == null || !("inputs" in i)) && x();
179
+ (i == null || !("inputs" in i)) && x("The target Node does not accept inputs.");
176
180
  let a = i.inputs[e.edge.targetHandle];
177
- t(a, e.before) || x();
181
+ t(a, e.before) || x("The target input changed before this operation was applied.");
178
182
  let o = {
179
183
  kind: "node",
180
184
  nodeId: e.edge.source,
181
185
  output: e.edge.sourceHandle
182
186
  }, s = a?.kind == "sources" ? a.sources.filter((e) => e.kind != "binding" || r.bindings[e.bindingId]?.kind != "variable") : [];
183
- s.some((e) => e.kind == "node" && e.nodeId == o.nodeId && e.output == o.output) && x();
187
+ s.some((e) => e.kind == "node" && e.nodeId == o.nodeId && e.output == o.output) && x("The Nodes are already connected.");
184
188
  let c = {
185
189
  ...i,
186
190
  inputs: {
@@ -199,11 +203,11 @@ function T(e, n) {
199
203
  }
200
204
  case "graph.edge.disconnect": {
201
205
  let n = S(r, e.target), i = n.nodes[e.edge.target];
202
- (i == null || !("inputs" in i)) && x();
206
+ (i == null || !("inputs" in i)) && x("The target Node does not accept inputs.");
203
207
  let a = i.inputs[e.edge.targetHandle];
204
- (a?.kind != "sources" || !t(a, e.before)) && x();
208
+ (a?.kind != "sources" || !t(a, e.before)) && x("The target input changed before this operation was applied.");
205
209
  let o = a.sources.filter((t) => t.kind != "node" || t.nodeId != e.edge.source || t.output != e.edge.sourceHandle);
206
- o.length == a.sources.length && x();
210
+ o.length == a.sources.length && x("The Nodes are not connected.");
207
211
  let s = { ...i.inputs };
208
212
  o.length == 0 ? delete s[e.edge.targetHandle] : s[e.edge.targetHandle] = {
209
213
  kind: "sources",
@@ -219,7 +223,7 @@ function T(e, n) {
219
223
  }
220
224
  case "graph.node.additional-inputs.set": {
221
225
  let n = S(r, e.target), i = n.nodes[e.nodeId];
222
- (i?.kind != "task" || !t(i.additionalInputs, e.before)) && x();
226
+ i?.kind != "task" && x("The Task Node does not exist."), t(i.additionalInputs, e.before) || x("The Task Node inputs changed before this operation was applied.");
223
227
  let { additionalInputs: a, ...o } = i, s = e.value == null ? o : {
224
228
  ...o,
225
229
  additionalInputs: e.value
@@ -232,7 +236,7 @@ function T(e, n) {
232
236
  }
233
237
  case "graph.node.condition.set": {
234
238
  let n = S(r, e.target), i = n.nodes[e.nodeId];
235
- i?.kind != "condition" && x(), (!t(i.cases, e.before.cases) || i.defaultOutput != e.before.defaultOutput || !t(i.input, e.before.input)) && x();
239
+ i?.kind != "condition" && x("The Condition Node does not exist."), (!t(i.cases, e.before.cases) || i.defaultOutput != e.before.defaultOutput || !t(i.input, e.before.input)) && x("The Condition Node changed before this operation was applied.");
236
240
  let { defaultOutput: a, ...o } = i, s = e.value.defaultOutput == null ? {
237
241
  ...o,
238
242
  ...e.value
@@ -248,7 +252,7 @@ function T(e, n) {
248
252
  }
249
253
  case "graph.node.create": {
250
254
  let t = S(r, e.target);
251
- (t.nodes[e.nodeId] != null || e.target.kind == "subflow" && !("inputs" in e.node)) && x(), Object.assign(r, C(r, e.target, { nodes: {
255
+ t.nodes[e.nodeId] != null && x("A Node with this ID already exists in the target graph."), e.target.kind == "subflow" && !("inputs" in e.node) && x("Trigger Nodes cannot be created inside a Subflow."), Object.assign(r, C(r, e.target, { nodes: {
252
256
  ...t.nodes,
253
257
  [e.nodeId]: e.node
254
258
  } }));
@@ -256,7 +260,7 @@ function T(e, n) {
256
260
  }
257
261
  case "graph.node.delete": {
258
262
  let t = S(r, e.target);
259
- t.nodes[e.nodeId] ?? x();
263
+ t.nodes[e.nodeId] ?? x("The Node does not exist in the target graph.");
260
264
  let n = /* @__PURE__ */ new Set([e.nodeId]), i = Object.fromEntries(Object.entries(t.nodes).flatMap(([e, t]) => n.has(e) ? [] : [[e, w(t, n)]]));
261
265
  if (Object.assign(r, C(r, e.target, { nodes: i })), e.target.kind == "subflow") {
262
266
  let t = r.subflows[e.target.id], i = t.outputs.map((e) => ({
@@ -275,7 +279,7 @@ function T(e, n) {
275
279
  }
276
280
  case "graph.node.field.set": {
277
281
  let n = S(r, e.target), i = n.nodes[e.nodeId];
278
- (i == null || !t(Reflect.get(i, e.field), e.before)) && x(), e.field == "concurrency" && e.value == null && x();
282
+ i ?? x("The Node does not exist in the target graph."), t(Reflect.get(i, e.field), e.before) || x("The Node field changed before this operation was applied."), e.field == "concurrency" && e.value == null && x("Node concurrency cannot be removed.");
279
283
  let a = { ...i };
280
284
  e.value == null ? Reflect.deleteProperty(a, e.field) : Object.assign(a, { [e.field]: e.value }), Object.assign(r, C(r, e.target, { nodes: {
281
285
  ...n.nodes,
@@ -285,7 +289,7 @@ function T(e, n) {
285
289
  }
286
290
  case "graph.node.input.set": {
287
291
  let n = S(r, e.target), i = n.nodes[e.nodeId];
288
- (i == null || !("inputs" in i) || !t(i.inputs[e.handle], e.before)) && x();
292
+ (i == null || !("inputs" in i)) && x("The Node does not accept inputs."), t(i.inputs[e.handle], e.before) || x("The Node input changed before this operation was applied.");
289
293
  let a = { ...i.inputs };
290
294
  e.value == null ? delete a[e.handle] : a[e.handle] = e.value, Object.assign(r, C(r, e.target, { nodes: {
291
295
  ...n.nodes,
@@ -298,7 +302,7 @@ function T(e, n) {
298
302
  }
299
303
  case "graph.node.task.name.set": {
300
304
  let t = S(r, e.target), n = t.nodes[e.nodeId];
301
- (n?.kind != "task" || n.task == null || n.task.name != e.before) && x();
305
+ (n?.kind != "task" || n.task == null) && x("The inline Task Node does not exist."), n.task.name != e.before && x("The inline Task name changed before this operation was applied.");
302
306
  let i = {
303
307
  ...n,
304
308
  task: {
@@ -314,10 +318,10 @@ function T(e, n) {
314
318
  }
315
319
  case "graph.node.task.ports.set": {
316
320
  let n = S(r, e.target), i = n.nodes[e.nodeId];
317
- (i?.kind != "task" || i.task == null || !t({
321
+ (i?.kind != "task" || i.task == null) && x("The inline Task Node does not exist."), t({
318
322
  inputs: i.task.inputs,
319
323
  outputs: i.task.outputs
320
- }, e.before)) && x();
324
+ }, e.before) || x("The inline Task ports changed before this operation was applied.");
321
325
  let a = {
322
326
  ...i,
323
327
  task: {
@@ -333,7 +337,7 @@ function T(e, n) {
333
337
  }
334
338
  case "graph.node.values.set": {
335
339
  let n = S(r, e.target), i = n.nodes[e.nodeId];
336
- (i?.kind != "value" || !t(i.values, e.before)) && x(), Object.assign(r, C(r, e.target, { nodes: {
340
+ i?.kind != "value" && x("The Value Node does not exist."), t(i.values, e.before) || x("The Value Node changed before this operation was applied."), Object.assign(r, C(r, e.target, { nodes: {
337
341
  ...n.nodes,
338
342
  [e.nodeId]: {
339
343
  ...i,
@@ -348,7 +352,7 @@ function T(e, n) {
348
352
  actions: i.actions,
349
353
  ...i.notification == null ? {} : { notification: i.notification },
350
354
  prompt: i.prompt
351
- }, e.before)) && x();
355
+ }, e.before)) && x("The Wait Node changed before this operation was applied.");
352
356
  let { notification: a, ...o } = i, s = e.value.notification == null ? {
353
357
  ...o,
354
358
  ...e.value
@@ -364,7 +368,7 @@ function T(e, n) {
364
368
  }
365
369
  case "graph.node.webhook.set": {
366
370
  let n = S(r, e.target), i = n.nodes[e.nodeId];
367
- (i?.kind != "webhook" || !t(i.inputsDef, e.before.inputsDef) || !t(i.options, e.before.options)) && x();
371
+ i?.kind != "webhook" && x("The Webhook Node does not exist."), (!t(i.inputsDef, e.before.inputsDef) || !t(i.options, e.before.options)) && x("The Webhook Node changed before this operation was applied.");
368
372
  let { options: a, ...o } = i, s = e.value.options == null ? {
369
373
  ...o,
370
374
  inputsDef: e.value.inputsDef
@@ -380,7 +384,7 @@ function T(e, n) {
380
384
  }
381
385
  case "graph.trigger.config.set": {
382
386
  let n = r.graph, i = n.nodes[e.nodeId];
383
- (i == null || i.kind != "integration" && i.kind != "poll" || !t(i.config[e.name], e.before)) && x();
387
+ (i == null || i.kind != "integration" && i.kind != "poll") && x("The configurable Trigger Node does not exist."), t(i.config[e.name], e.before) || x("The Trigger configuration changed before this operation was applied.");
384
388
  let a = { ...i.config };
385
389
  e.value === void 0 ? delete a[e.name] : a[e.name] = e.value, r.graph = { nodes: {
386
390
  ...n.nodes,
@@ -393,9 +397,9 @@ function T(e, n) {
393
397
  }
394
398
  case "graph.trigger.schedule.set": {
395
399
  let n = r.graph, i = n.nodes[e.nodeId];
396
- (i == null || i.kind != "cron" && i.kind != "poll") && x();
400
+ (i == null || i.kind != "cron" && i.kind != "poll") && x("The scheduled Trigger Node does not exist.");
397
401
  let a = i.kind == "cron" ? i.cronTimes : i.pollTimes;
398
- t(a, e.before) || x();
402
+ t(a, e.before) || x("The Trigger schedule changed before this operation was applied.");
399
403
  let o = i.kind == "cron" ? {
400
404
  ...i,
401
405
  cronTimes: e.value
@@ -410,14 +414,14 @@ function T(e, n) {
410
414
  break;
411
415
  }
412
416
  case "module.create":
413
- i[e.moduleId] != null && x(), i[e.moduleId] = e.module;
417
+ i[e.moduleId] != null && x("A CodeModule with this ID already exists."), i[e.moduleId] = e.module;
414
418
  break;
415
419
  case "module.delete":
416
- i[e.moduleId] ?? x(), delete i[e.moduleId];
420
+ i[e.moduleId] ?? x("The CodeModule does not exist."), delete i[e.moduleId];
417
421
  break;
418
422
  case "module.rename": {
419
423
  let t = i[e.moduleId];
420
- (t == null || t.name != e.before) && x(), i[e.moduleId] = {
424
+ t ?? x("The CodeModule does not exist."), t.name != e.before && x("The CodeModule name changed before this operation was applied."), i[e.moduleId] = {
421
425
  ...t,
422
426
  name: e.name
423
427
  };
@@ -425,7 +429,7 @@ function T(e, n) {
425
429
  }
426
430
  case "module.source.replace": {
427
431
  let n = i[e.moduleId];
428
- (n == null || n.source != e.beforeSource || !t(n.imports, e.beforeImports)) && x(), i[e.moduleId] = {
432
+ n ?? x("The CodeModule does not exist."), (n.source != e.beforeSource || !t(n.imports, e.beforeImports)) && x("The CodeModule source changed before this operation was applied."), i[e.moduleId] = {
429
433
  ...n,
430
434
  imports: e.imports,
431
435
  source: e.source
@@ -433,18 +437,18 @@ function T(e, n) {
433
437
  break;
434
438
  }
435
439
  case "subflow.create":
436
- r.subflows[e.subflowId] != null && x(), r.subflows = {
440
+ r.subflows[e.subflowId] != null && x("A Subflow with this ID already exists."), r.subflows = {
437
441
  ...r.subflows,
438
442
  [e.subflowId]: e.subflow
439
443
  };
440
444
  break;
441
445
  case "subflow.definition.set": {
442
446
  let n = r.subflows[e.subflowId];
443
- (n == null || !t({
447
+ n ?? x("The Subflow does not exist."), t({
444
448
  inputs: n.inputs,
445
449
  name: n.name,
446
450
  outputs: n.outputs
447
- }, e.before)) && x(), r.subflows = {
451
+ }, e.before) || x("The Subflow definition changed before this operation was applied."), r.subflows = {
448
452
  ...r.subflows,
449
453
  [e.subflowId]: {
450
454
  ...e.definition,
@@ -454,20 +458,20 @@ function T(e, n) {
454
458
  break;
455
459
  }
456
460
  case "subflow.delete": {
457
- r.subflows[e.subflowId] ?? x();
461
+ r.subflows[e.subflowId] ?? x("The Subflow does not exist.");
458
462
  let t = { ...r.subflows };
459
463
  delete t[e.subflowId], r.subflows = t;
460
464
  break;
461
465
  }
462
466
  case "task.create":
463
- r.tasks[e.taskId] != null && x(), r.tasks = {
467
+ r.tasks[e.taskId] != null && x("A Task with this ID already exists."), r.tasks = {
464
468
  ...r.tasks,
465
469
  [e.taskId]: e.task
466
470
  };
467
471
  break;
468
472
  case "task.connector.connection.set": {
469
473
  let t = r.tasks[e.taskId];
470
- (t == null || !("executor" in t) || t.executor.kind != "connector" || t.executor.connectionId != e.before) && x();
474
+ (t == null || !("executor" in t) || t.executor.kind != "connector") && x("The Connector Task does not exist."), t.executor.connectionId != e.before && x("The Connector Task connection changed before this operation was applied.");
471
475
  let { connectionId: n, ...i } = t.executor, a = e.value == null ? i : {
472
476
  ...i,
473
477
  connectionId: e.value
@@ -482,14 +486,14 @@ function T(e, n) {
482
486
  break;
483
487
  }
484
488
  case "task.delete": {
485
- r.tasks[e.taskId] ?? x();
489
+ r.tasks[e.taskId] ?? x("The Task does not exist.");
486
490
  let t = { ...r.tasks };
487
491
  delete t[e.taskId], r.tasks = t;
488
492
  break;
489
493
  }
490
494
  case "task.llm.mode.set": {
491
495
  let t = r.tasks[e.taskId];
492
- (t == null || !("executor" in t) || t.executor.kind != "llm" || t.executor.mode != e.before) && x(), r.tasks = {
496
+ (t == null || !("executor" in t) || t.executor.kind != "llm") && x("The LLM Task does not exist."), t.executor.mode != e.before && x("The LLM Task mode changed before this operation was applied."), r.tasks = {
493
497
  ...r.tasks,
494
498
  [e.taskId]: {
495
499
  ...t,
@@ -503,7 +507,7 @@ function T(e, n) {
503
507
  }
504
508
  case "task.name.set": {
505
509
  let t = r.tasks[e.taskId];
506
- (t == null || t.name != e.before) && x(), r.tasks = {
510
+ t ?? x("The Task does not exist."), t.name != e.before && x("The Task name changed before this operation was applied."), r.tasks = {
507
511
  ...r.tasks,
508
512
  [e.taskId]: {
509
513
  ...t,
@@ -1,7 +1,7 @@
1
1
  import { f as e } from "./dist-C46JByB-.js";
2
2
  import { s as t } from "./main-DmjVyuWr.js";
3
3
  import { n, t as r } from "./flowRunInputEditorStore-DDidwd8h.js";
4
- import { n as i } from "./flowWorkspace-CPBHm14t.js";
4
+ import { n as i } from "./flowWorkspace-DnsRkjYz.js";
5
5
  import { useEffect as a, useState as o } from "react";
6
6
  import { jsx as s } from "react/jsx-runtime";
7
7
  //#region src/workbench/browser/runtime/designer/waitNotificationInputs.tsx
@@ -1,9 +1,9 @@
1
1
  import { a as e, f as t, i as n } from "./dist-C46JByB-.js";
2
2
  import { a as r, i, s as a, t as o } from "./main-DmjVyuWr.js";
3
3
  import { Un as s, Vn as c, jt as l } from "./getPseudoElementBounds-5LArT6Xc.js";
4
- import { a as u, c as d, d as f, f as p, i as m, n as h, o as g, p as _, t as v, u as y } from "./icons-CRxvozBE.js";
5
- import { t as b } from "./workbenchSelect-Cf1zlVm9.js";
6
- import { $ as x, A as S, C as ee, D as C, E as w, F as T, G as E, H as D, I as O, J as te, M as k, N as A, O as j, P as M, Q as N, S as P, U as F, V as I, W as ne, X as re, Y as ie, Z as ae, _ as oe, a as se, at as ce, b as le, c as ue, ct as de, d as fe, dt as pe, et as me, f as he, ft as L, g as ge, h as _e, i as ve, it as ye, j as R, l as be, lt as xe, m as Se, mt as z, n as B, nt as Ce, o as we, ot as Te, p as Ee, pt as De, q as Oe, rt as ke, s as Ae, st as je, t as Me, tt as V, u as Ne, ut as Pe, v as Fe, w as Ie, x as Le, y as Re, z as ze } from "./flowChanges-BDqD_Q4G.js";
4
+ import { a as u, c as d, d as f, f as p, i as m, n as h, o as g, p as _, t as v, u as y } from "./icons-KIOgjHpD.js";
5
+ import { t as b } from "./workbenchSelect-CbXrdwxW.js";
6
+ import { $ as x, A as S, C as ee, D as C, E as w, F as T, G as E, H as D, I as O, J as te, M as k, N as A, O as j, P as M, Q as N, S as P, U as F, V as I, W as ne, X as re, Y as ie, Z as ae, _ as oe, a as se, at as ce, b as le, c as ue, ct as de, d as fe, dt as pe, et as me, f as he, ft as L, g as ge, h as _e, i as ve, it as ye, j as R, l as be, lt as xe, m as Se, mt as z, n as B, nt as Ce, o as we, ot as Te, p as Ee, pt as De, q as Oe, rt as ke, s as Ae, st as je, t as Me, tt as V, u as Ne, ut as Pe, v as Fe, w as Ie, x as Le, y as Re, z as ze } from "./flowChanges-CixKyW54.js";
7
7
  import { a as Be, i as Ve, n as He, r as Ue } from "./languages-DgJehE1g.js";
8
8
  import { Suspense as We, lazy as H, useEffect as U, useRef as Ge, useState as W } from "react";
9
9
  import { Fragment as Ke, jsx as G, jsxs as K } from "react/jsx-runtime";
@@ -91,7 +91,7 @@ function Je(e, t) {
91
91
  }
92
92
  //#endregion
93
93
  //#region src/workbench/browser/runtime/shell/resourceBrowser.tsx
94
- var Ye = H(() => import("./createResourceDialog-Cf7QpXp6.js")), Xe = Be.map((e) => ({
94
+ var Ye = H(() => import("./createResourceDialog-DNBueSYZ.js")), Xe = Be.map((e) => ({
95
95
  label: Ve[e],
96
96
  value: e
97
97
  }));
@@ -2500,9 +2500,9 @@ var Bt = class {
2500
2500
  phase: r == null ? "failed" : void 0
2501
2501
  } }), r != null;
2502
2502
  }
2503
- async moveNodes(e, t = "detail") {
2504
- let n = this.#l.value.target;
2505
- n != null && await this.#S((r) => A(r, n, e, t));
2503
+ async moveNodes(e) {
2504
+ let t = this.#l.value.target;
2505
+ t != null && await this.#S((n) => A(n, t, e));
2506
2506
  }
2507
2507
  async moveViewport(e, t = "detail") {
2508
2508
  let n = this.#l.value.target;
@@ -2864,7 +2864,7 @@ var Wt = { openExternalPage: async () => !1 }, Gt = class {
2864
2864
  return;
2865
2865
  }
2866
2866
  }
2867
- }, Kt = H(() => import("./flowWorkspace-CPBHm14t.js").then((e) => e.t));
2867
+ }, Kt = H(() => import("./flowWorkspace-DnsRkjYz.js").then((e) => e.t));
2868
2868
  function qt({ action: e, description: t, error: n, onSubmit: r, onTokenChange: i, pending: a = !1, title: o, token: s, tokenLabel: u }) {
2869
2869
  let m = s != null && u != null && i != null, h = s ?? "", _ = /* @__PURE__ */ K(Ke, { children: [
2870
2870
  /* @__PURE__ */ G("div", {
@@ -1,5 +1,5 @@
1
1
  import { $ as e, A as t, At as n, Bn as r, Dt as i, Et as a, Fn as o, G as s, I as c, Jn as l, Jt as u, K as d, Kn as f, Mn as p, Mt as m, N as h, Nn as ee, Nt as g, On as _, P as v, Pn as y, Qn as b, Rn as x, Sn as S, St as C, Tt as w, Un as T, Vt as E, Xt as D, Yt as te, Z as O, Zn as k, Zt as A, _t as j, a as M, bt as N, c as P, en as F, et as I, f as L, ft as R, gt as z, i as ne, j as re, kt as ie, l as ae, lr as oe, lt as B, m as se, n as V, nr as H, nt as U, or as ce, p as le, qn as ue, qt as de, r as fe, rn as pe, rr as W, s as me, sr as he, t as G, tn as ge, tr as K, tt as _e, u as ve, vn as ye, vt as be, x as q, xt as xe, zn as Se, zt as J } from "./getPseudoElementBounds-5LArT6Xc.js";
2
- import { s as Ce } from "./icons-CRxvozBE.js";
2
+ import { s as Ce } from "./icons-KIOgjHpD.js";
3
3
  import * as Y from "react";
4
4
  import { jsx as X, jsxs as we } from "react/jsx-runtime";
5
5
  //#region ../../node_modules/.bun/lucide-react@0.468.0+f4eacebf2041cd4f/node_modules/lucide-react/dist/esm/icons/chevron-up.js
@@ -38,9 +38,11 @@ function s(e, t) {
38
38
  async function c(e, t, n) {
39
39
  return i(e.status, t, `${n} status`), a(await e.json().catch(() => r(`${n} body: expected JSON.`)), `${n} body`);
40
40
  }
41
- async function l(e, t, n, r) {
42
- let o = await c(e, t, r);
43
- i(a(o.error, `${r} error`).code, n, `${r} error code`), i(o.version, 1, `${r} version`);
41
+ async function l(e, t, n, o, l) {
42
+ let u = await c(e, t, o), d = a(u.error, `${o} error`);
43
+ i(d.code, n, `${o} error code`);
44
+ let f = s(d.message, `${o} error message`);
45
+ l != null && !f.includes(l) && r(`${o} error message: expected ${JSON.stringify(l)} in ${JSON.stringify(f)}.`), i(u.version, 1, `${o} version`);
44
46
  }
45
47
  function u(e, t, n = {}) {
46
48
  let r = new Headers(n.headers);
@@ -199,7 +201,7 @@ var b = [
199
201
  name: "commits immutable Draft Revisions for one Flow",
200
202
  async verify(e) {
201
203
  let t = await f(e, "Draft flow", "draft-flow"), n = s(t.flowId, "Draft Flow flowId"), r = s(t.draftRevisionId, "Draft Flow revisionId"), o = await c(await m(e, n, r, "marker", "draft-change"), 200, "Change Draft"), d = h(o, "Changed Draft");
202
- i(a(o.revision, "Changed Draft revision").parentRevisionId, r, "Changed Draft parent"), i(await c(await m(e, n, r, "marker", "draft-change"), 200, "Replay Draft change"), o, "Replayed Draft change"), await l(await m(e, n, r, "another-marker", "draft-change"), 409, "flow.conflict", "Conflicting Draft change replay"), await l(await p(e, n, d, [{
204
+ i(a(o.revision, "Changed Draft revision").parentRevisionId, r, "Changed Draft parent"), i(await c(await m(e, n, r, "marker", "draft-change"), 200, "Replay Draft change"), o, "Replayed Draft change"), await l(await m(e, n, r, "another-marker", "draft-change"), 409, "flow.conflict", "Conflicting Draft change replay"), await l(await m(e, n, d, "marker"), 400, "flow.invalid", "Duplicate Draft Node", "A Node with this ID already exists"), await l(await p(e, n, d, [{
203
205
  before: [{
204
206
  handle: "ready",
205
207
  jsonSchema: { type: "boolean" },
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "@oomol-lab/open-flow",
3
- "version": "0.1.0-beta.6",
3
+ "version": "0.1.0-beta.7",
4
4
  "description": "TypeScript contracts and Browser runtime for Open Flow.",
5
5
  "license": "Apache-2.0",
6
6
  "repository": {