@picked/client 0.0.1-dev.1793923852884 → 0.0.1-dev.1794198362164

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 (30) hide show
  1. package/dist/.tsbuildinfo +1 -1
  2. package/dist/{api-Cmo32tcm.cjs → api-BsITGJ5v.cjs} +1 -1
  3. package/dist/{api-DBcYlt1j.js → api-CNSa9DXg.js} +1 -1
  4. package/dist/cjs/index.js +2 -2
  5. package/dist/cjs/plugins/dynamic-experiences/index.js +1 -1
  6. package/dist/cjs/server/index.js +1 -1
  7. package/dist/esm/index.js +8 -5
  8. package/dist/esm/plugins/dynamic-experiences/index.js +2 -2
  9. package/dist/esm/server/index.js +3 -3
  10. package/dist/experience-instance-CQhrMm1w.cjs +1 -0
  11. package/dist/{experience-instance-4D6Yk-h0.js → experience-instance-IOIdP1Rd.js} +292 -222
  12. package/dist/{plugin-Bqh6SlAs.cjs → plugin--8yaR37O.cjs} +1 -1
  13. package/dist/{plugin-CswC46jl.js → plugin-DvMS5lIx.js} +5 -4
  14. package/dist/{preview-channel-CLXVoL_j.js → preview-channel-CN0-S8KE.js} +4 -2
  15. package/dist/{preview-channel-BMOEreho.cjs → preview-channel-dGugKqEl.cjs} +1 -1
  16. package/dist/{preview-unavailable-CpYizkD1.js → preview-unavailable-B6ZpF1x4.js} +1 -1
  17. package/dist/{preview-unavailable-DkPxiela.cjs → preview-unavailable-CkjvVifA.cjs} +1 -1
  18. package/dist/{provider-1GB5beBo.js → provider-Bq4dcbfQ.js} +1 -1
  19. package/dist/{provider-CyGdf6_m.cjs → provider-BxoFSGrh.cjs} +1 -1
  20. package/dist/types/entities/experience/experience.d.ts +4 -0
  21. package/dist/types/entities/experience/experience.d.ts.map +1 -1
  22. package/dist/types/entities/experience-instance/action-result.d.ts +69 -0
  23. package/dist/types/entities/experience-instance/action-result.d.ts.map +1 -0
  24. package/dist/types/entities/experience-instance/experience-instance.d.ts.map +1 -1
  25. package/dist/types/picked.d.ts +3 -1
  26. package/dist/types/picked.d.ts.map +1 -1
  27. package/dist/types/plugins/dynamic-experiences/plugin.d.ts.map +1 -1
  28. package/dist/types/preview-receiver/index.d.ts.map +1 -1
  29. package/package.json +3 -3
  30. package/dist/experience-instance-D2FAkiPx.cjs +0 -1
@@ -43,7 +43,7 @@ var v = [], y = (e, t) => {
43
43
  e !== void 0 && r.push(e);
44
44
  }
45
45
  return r;
46
- }, D = (e, t) => {
46
+ }, te = (e, t) => {
47
47
  let n = /* @__PURE__ */ new Map();
48
48
  t.forEach((e, t) => {
49
49
  n.set(e, t);
@@ -64,7 +64,7 @@ var v = [], y = (e, t) => {
64
64
  let s = e.nodeById.get(t)?.type === "origin";
65
65
  r.isOrigin.push(s), s && r.origins.push(i);
66
66
  }), r;
67
- }, O = (e, t, n) => {
67
+ }, D = (e, t, n) => {
68
68
  let r = w(n, S), i = [...e];
69
69
  for (let t of e) r[t] = 0;
70
70
  let a = 0, o = 0;
@@ -79,22 +79,22 @@ var v = [], y = (e, t) => {
79
79
  values: r,
80
80
  visits: a
81
81
  };
82
- }, k = (e, t) => {
82
+ }, O = (e, t) => {
83
83
  e.discoveryOf[t] = e.counter, e.lowLinkOf[t] = e.counter, e.counter += 1, e.stack.push(t), e.onStack[t] = !0, e.frames.push({
84
84
  node: t,
85
85
  edge: 0
86
86
  }), e.visits += 1;
87
- }, te = (e, t) => {
88
- let n = (e.successors[t.node] ?? [])[t.edge];
89
- t.edge += 1, n !== void 0 && (e.discoveryOf[n] === S ? k(e, n) : e.onStack[n] && (e.lowLinkOf[t.node] = Math.min(e.lowLinkOf[t.node] ?? 0, e.discoveryOf[n] ?? 0)));
90
87
  }, ne = (e, t) => {
88
+ let n = (e.successors[t.node] ?? [])[t.edge];
89
+ t.edge += 1, n !== void 0 && (e.discoveryOf[n] === S ? O(e, n) : e.onStack[n] && (e.lowLinkOf[t.node] = Math.min(e.lowLinkOf[t.node] ?? 0, e.discoveryOf[n] ?? 0)));
90
+ }, re = (e, t) => {
91
91
  e.frames.pop(), e.visits += 1;
92
92
  let n = e.frames.at(-1);
93
93
  if (n && (e.lowLinkOf[n.node] = Math.min(e.lowLinkOf[n.node] ?? 0, e.lowLinkOf[t.node] ?? 0)), e.lowLinkOf[t.node] !== e.discoveryOf[t.node]) return;
94
94
  let r = [], i = e.stack.pop();
95
95
  for (; i !== void 0 && (e.onStack[i] = !1, e.componentOf[i] = e.members.length, r.push(i), i !== t.node);) i = e.stack.pop();
96
96
  e.members.push(r);
97
- }, re = (e, t) => {
97
+ }, ie = (e, t) => {
98
98
  let n = {
99
99
  successors: e,
100
100
  discoveryOf: w(t, S),
@@ -107,17 +107,17 @@ var v = [], y = (e, t) => {
107
107
  counter: 0,
108
108
  visits: 0
109
109
  };
110
- for (let r = 0; r < t; r += 1) if (n.discoveryOf[r] === S) for (k(n, r); n.frames.length > 0;) {
110
+ for (let r = 0; r < t; r += 1) if (n.discoveryOf[r] === S) for (O(n, r); n.frames.length > 0;) {
111
111
  let t = n.frames.at(-1);
112
112
  if (!t) break;
113
- t.edge < (e[t.node] ?? []).length ? te(n, t) : ne(n, t);
113
+ t.edge < (e[t.node] ?? []).length ? ne(n, t) : re(n, t);
114
114
  }
115
115
  return {
116
116
  componentOf: n.componentOf,
117
117
  members: n.members,
118
118
  visits: n.visits
119
119
  };
120
- }, A = (e, t, n) => {
120
+ }, k = (e, t, n) => {
121
121
  let r = C;
122
122
  for (let i of e.adjacency[t] ?? []) {
123
123
  let t = e.components.componentOf[i] ?? S;
@@ -126,11 +126,11 @@ var v = [], y = (e, t) => {
126
126
  a !== C && (r = Math.max(r, a + 1));
127
127
  }
128
128
  return r;
129
- }, j = (e, t) => {
129
+ }, A = (e, t) => {
130
130
  let n = C;
131
- for (let r of e.components.members[t] ?? []) n = e.isTerminus[r] ? Math.max(n, 0) : Math.max(n, A(e, r, t));
131
+ for (let r of e.components.members[t] ?? []) n = e.isTerminus[r] ? Math.max(n, 0) : Math.max(n, k(e, r, t));
132
132
  return n;
133
- }, M = (e, t, n, r) => {
133
+ }, j = (e, t, n, r) => {
134
134
  let i = n.members.length, a = {
135
135
  adjacency: e,
136
136
  isTerminus: t,
@@ -140,7 +140,7 @@ var v = [], y = (e, t) => {
140
140
  for (let e = 0; e < i; e += 1) {
141
141
  let t = r ? i - 1 - e : e, s = (n.members[t] ?? []).length;
142
142
  o += s;
143
- let c = j(a, t);
143
+ let c = A(a, t);
144
144
  a.perComponent[t] = c === C ? C : c + s - 1;
145
145
  }
146
146
  return {
@@ -151,54 +151,54 @@ var v = [], y = (e, t) => {
151
151
  }),
152
152
  visits: o
153
153
  };
154
- }, N = (e, t, n) => {
154
+ }, M = (e, t, n) => {
155
155
  let r = /* @__PURE__ */ new Map();
156
156
  return e.forEach((e, i) => {
157
157
  let a = t.values[i] ?? S, o = n.values[i] ?? S;
158
158
  r.set(e, a === S ? [S, S] : [a, o]);
159
159
  }), r;
160
- }, ie = (e, t) => {
161
- let n = y(e, t), r = [...n.nodeById.keys()], i = r.length, a = D(n, r), o = re(a.successors, i), s = O(a.leaves, a.predecessors, i), c = M(a.successors, a.isLeaf, o, !1), l = O(a.origins, a.successors, i), u = M(a.predecessors, a.isOrigin, o, !0);
160
+ }, ae = (e, t) => {
161
+ let n = y(e, t), r = [...n.nodeById.keys()], i = r.length, a = te(n, r), o = ie(a.successors, i), s = D(a.leaves, a.predecessors, i), c = j(a.successors, a.isLeaf, o, !1), l = D(a.origins, a.successors, i), u = j(a.predecessors, a.isOrigin, o, !0);
162
162
  return {
163
163
  ...n,
164
- stepsToLeaf: N(r, s, c),
165
- stepsToOrigin: N(r, l, u),
164
+ stepsToLeaf: M(r, s, c),
165
+ stepsToOrigin: M(r, l, u),
166
166
  nodeVisits: o.visits + s.visits + c.visits + l.visits + u.visits
167
167
  };
168
- }, P = (e, t, n) => {
168
+ }, N = (e, t, n) => {
169
169
  let r = Infinity, i = C;
170
170
  for (let a of t) {
171
171
  let t = e.get(a[n]);
172
172
  t && t[0] !== S && (r = Math.min(r, t[0] + 1), i = Math.max(i, t[1] + 1));
173
173
  }
174
174
  return r === Infinity ? [S, S] : [r, i];
175
- }, ae = (e, t) => {
175
+ }, oe = (e, t) => {
176
176
  let n = e.stepsToLeaf.get(t.id);
177
177
  if (n) return [n[0], n[1]];
178
178
  let r = b(e, t.id);
179
- return r.length === 0 ? [0, 0] : P(e.stepsToLeaf, r, "destinationNodeId");
180
- }, oe = (e, t) => {
179
+ return r.length === 0 ? [0, 0] : N(e.stepsToLeaf, r, "destinationNodeId");
180
+ }, se = (e, t) => {
181
181
  let n = e.stepsToOrigin.get(t.id);
182
- return n ? [n[0], n[1]] : t.type === "origin" ? [0, 0] : P(e.stepsToOrigin, x(e, t.id), "sourceNodeId");
183
- }, F = "conditions.", I = s("condition-results");
184
- function L(e) {
182
+ return n ? [n[0], n[1]] : t.type === "origin" ? [0, 0] : N(e.stepsToOrigin, x(e, t.id), "sourceNodeId");
183
+ }, P = "conditions.", F = s("condition-results");
184
+ function I(e) {
185
185
  return typeof e == "object" && !!e && !Array.isArray(e);
186
186
  }
187
- function R(e) {
187
+ function L(e) {
188
188
  if (e === void 0) return null;
189
- if (Array.isArray(e)) return e.map((e) => R(e));
190
- if (L(e)) {
189
+ if (Array.isArray(e)) return e.map((e) => L(e));
190
+ if (I(e)) {
191
191
  let t = Object.keys(e).sort((e, t) => e.localeCompare(t)), n = {};
192
- for (let r of t) n[r] = R(e[r]);
192
+ for (let r of t) n[r] = L(e[r]);
193
193
  return n;
194
194
  }
195
195
  return e;
196
196
  }
197
- function se(e) {
198
- return JSON.stringify(R(e));
197
+ function ce(e) {
198
+ return JSON.stringify(L(e));
199
199
  }
200
- var ce = f(() => {
201
- let e = I.store({}), t = o(e, {
200
+ var le = f(() => {
201
+ let e = F.store({}), t = o(e, {
202
202
  set(e, t) {
203
203
  return e[t.hash] === t.result ? e : {
204
204
  ...e,
@@ -235,118 +235,179 @@ var ce = f(() => {
235
235
  reset: i
236
236
  };
237
237
  });
238
- function z() {
239
- return p(ce);
238
+ function ue() {
239
+ return p(le);
240
240
  }
241
- async function B(n, r, i) {
241
+ async function R(n, r, i) {
242
242
  return r == null ? !0 : typeof r == "boolean" ? r : !e(r) || await t(n, r, i) === !0;
243
243
  }
244
- function V(e) {
244
+ function z(e) {
245
245
  if (typeof e == "string") return e;
246
246
  if (Array.isArray(e) && typeof e[0] == "string") return e[0];
247
247
  }
248
- function H(e) {
249
- if (Array.isArray(e)) return e.some(H);
250
- if (L(e)) {
251
- let t = V(e.var);
252
- return t !== void 0 && (t === "actions" || t.startsWith("actions.")) ? !0 : Object.values(e).some(H);
248
+ function B(e) {
249
+ if (Array.isArray(e)) return e.some(B);
250
+ if (I(e)) {
251
+ let t = z(e.var);
252
+ return t !== void 0 && (t === "actions" || t.startsWith("actions.")) ? !0 : Object.values(e).some(B);
253
253
  }
254
254
  return !1;
255
255
  }
256
- function U(e) {
257
- if (Array.isArray(e)) return e.flatMap(U);
258
- if (L(e)) {
259
- let t = V(e.var);
260
- return [...t !== void 0 && t.startsWith(F) ? [t.slice(11)] : [], ...Object.values(e).flatMap(U)];
256
+ function V(e) {
257
+ if (Array.isArray(e)) return e.flatMap(V);
258
+ if (I(e)) {
259
+ let t = z(e.var);
260
+ return [...t !== void 0 && t.startsWith(P) ? [t.slice(11)] : [], ...Object.values(e).flatMap(V)];
261
261
  }
262
262
  return [];
263
263
  }
264
- function W(e, t, n = /* @__PURE__ */ new Set()) {
265
- if (H(e)) return !0;
266
- for (let r of U(e)) {
264
+ function H(e, t, n = /* @__PURE__ */ new Set()) {
265
+ if (B(e)) return !0;
266
+ for (let r of V(e)) {
267
267
  if (n.has(r)) continue;
268
268
  n.add(r);
269
269
  let e = t[r];
270
- if (e !== void 0 && W(e.logic, t, n)) return !0;
270
+ if (e !== void 0 && H(e.logic, t, n)) return !0;
271
271
  }
272
272
  return !1;
273
273
  }
274
- async function G(e, t, n) {
274
+ async function U(e, t, n) {
275
275
  let r = {};
276
276
  for (let t of e.conditions.listStore.getState()) r[t.key] = t;
277
- let i = W(t, r), a = se(t);
277
+ let i = H(t, r), a = ce(t);
278
278
  if (!i) {
279
279
  let t = e.conditionResults.peek(a);
280
280
  if (t !== void 0) return t;
281
281
  }
282
- let o = await B(e, t, n?.context);
282
+ let o = await R(e, t, n?.context);
283
283
  return i || e.conditionResults.set({
284
284
  hash: a,
285
285
  result: o
286
286
  }), o;
287
287
  }
288
- async function le(e, t, n) {
288
+ async function de(e, t, n) {
289
289
  let r = n?.context, i = [
290
290
  n?.precondition,
291
291
  n?.condition,
292
292
  t.condition
293
293
  ];
294
- for (let t of i) if (!await G(e, t, { context: r })) return !1;
294
+ for (let t of i) if (!await U(e, t, { context: r })) return !1;
295
295
  return !0;
296
296
  }
297
297
  //#endregion
298
298
  //#region src/utils/node-tree/next-reachable-step-nodes.ts
299
- var K = (e, t, n, r) => r.has(t.id) ? [] : (r.add(t.id), h(t) && !n ? [t] : b(e, t.id).flatMap((t) => {
299
+ var W = (e, t, n, r) => r.has(t.id) ? [] : (r.add(t.id), h(t) && !n ? [t] : b(e, t.id).flatMap((t) => {
300
300
  let n = e.nodeById.get(t.destinationNodeId);
301
- return n ? K(e, n, !1, r) : [];
302
- })), ue = (e, t) => K(e, t, !0, /* @__PURE__ */ new Set()), de = (e) => e.find((e) => e.type === "origin") || null, q = (e, t, n) => {
303
- if (!e) return de(t);
301
+ return n ? W(e, n, !1, r) : [];
302
+ })), fe = (e, t) => W(e, t, !0, /* @__PURE__ */ new Set()), pe = (e) => e.find((e) => e.type === "origin") || null, me = (e, t, n) => {
303
+ if (!e) return pe(t);
304
304
  let r = n.find((t) => t.sourceNodeId === e.id);
305
305
  return r && t.find((e) => e.id === r.destinationNodeId) || null;
306
306
  };
307
307
  //#endregion
308
308
  //#region src/utils/node-tree/get-next-node-from-condition.ts
309
- async function fe(e, t, n, r) {
309
+ async function he(e, t, n, r) {
310
310
  let i = e ? "true" : "false", a = r.find((e) => e.sourceHandle === i && e.sourceNodeId === t);
311
311
  return n.find((e) => e.id === a?.destinationNodeId);
312
312
  }
313
313
  //#endregion
314
314
  //#region src/utils/node-tree/get-next-node-from-action.ts
315
- function pe(e, t, n, r) {
315
+ function ge(e, t, n, r) {
316
316
  let i = r.filter((e) => e.sourceNodeId === t), a = e ? "true" : "false", o = i.find((e) => e.sourceHandle === a) ?? i.find((e) => e.sourceHandle == null);
317
317
  return n.find((e) => e.id === o?.destinationNodeId);
318
318
  }
319
319
  //#endregion
320
+ //#region src/entities/experience-instance/action-result.ts
321
+ function G(e, t) {
322
+ if (typeof e != "object" || !e) return;
323
+ let n = Reflect.get(e, t);
324
+ return typeof n == "string" ? n : void 0;
325
+ }
326
+ function K(e) {
327
+ return {
328
+ code: G(e, "code") ?? G(e, "name") ?? "ERROR",
329
+ message: G(e, "message") ?? String(e)
330
+ };
331
+ }
332
+ function q(e) {
333
+ return e === null ? !0 : Array.isArray(e) ? e.every(q) : typeof e == "object" ? Object.values(e).every(q) : typeof e == "string" || typeof e == "number" || typeof e == "boolean";
334
+ }
335
+ function J(e) {
336
+ try {
337
+ return JSON.stringify(e);
338
+ } catch {
339
+ return;
340
+ }
341
+ }
342
+ function Y(e, t) {
343
+ if (t == null) return null;
344
+ switch (e) {
345
+ case "object": {
346
+ let e = J(t);
347
+ if (e === void 0) return;
348
+ let n = JSON.parse(e);
349
+ return q(n) ? n : void 0;
350
+ }
351
+ case "text": return typeof t == "string" ? t : J(t);
352
+ case "number": return typeof t == "number" && Number.isFinite(t) ? t : void 0;
353
+ case "boolean": return !!t;
354
+ }
355
+ }
356
+ function _e(e, t) {
357
+ if (t == null) return null;
358
+ if (!e.multiple) return Y(e.type, t);
359
+ let n = Array.isArray(t) ? t : [t], r = [];
360
+ for (let t of n) {
361
+ let n = Y(e.type, t);
362
+ if (n === void 0) return;
363
+ r.push(n);
364
+ }
365
+ return r;
366
+ }
367
+ function ve(e, t, n) {
368
+ let [r, i] = n.succeeded ? [e.successFieldKey, e.failureFieldKey] : [e.failureFieldKey, e.successFieldKey], a = {}, o = (n) => {
369
+ let r = t.find((e) => e.key === n);
370
+ return r || `${e.id}${n}`, r;
371
+ };
372
+ i !== void 0 && o(i) && (a[i] = null);
373
+ let s = r === void 0 ? void 0 : o(r);
374
+ if (r !== void 0 && s) {
375
+ let t = _e(s, n.succeeded ? n.value : K(n.error));
376
+ t === void 0 && `${e.id}${r}`, a[r] = t ?? null;
377
+ }
378
+ return a;
379
+ }
380
+ //#endregion
320
381
  //#region src/entities/experience-instance/experience-instance.ts
321
- var J = s("experience-instance"), Y = /* @__PURE__ */ new WeakMap(), me = f(({ client: r, experience: s, target: f, options: p, deferOpen: v, slotOpen: y }) => {
322
- let b = l(), x = l(), S = l(), C = l(), w = l(), T = l(), E = l(), D = l(), O = l(), k = s.componentStore, te = J.store("transitioning"), ne = r.history.entriesStore.map((e) => e.filter((e) => e.experienceId === s.id)), re = ne.map((e) => e.filter((e) => h(e.node))), A = ne.map((e) => e.at(-1)?.node || null), j = J.store(null);
382
+ var X = s("experience-instance"), Z = /* @__PURE__ */ new WeakMap(), ye = f(({ client: r, experience: s, target: f, options: p, deferOpen: v, slotOpen: y }) => {
383
+ let b = l(), x = l(), S = l(), C = l(), w = l(), T = l(), E = l(), te = l(), D = l(), O = s.componentStore, ne = X.store("transitioning"), re = r.history.entriesStore.map((e) => e.filter((e) => e.experienceId === s.id)), ie = re.map((e) => e.filter((e) => h(e.node))), k = re.map((e) => e.at(-1)?.node || null), A = X.store(null);
323
384
  u({
324
385
  clock: [
325
- A,
386
+ k,
326
387
  r.steps.listStore,
327
388
  T
328
389
  ],
329
390
  source: {
330
391
  steps: r.steps.listStore,
331
- node: A
392
+ node: k
332
393
  },
333
394
  filter: ({ node: e }) => e !== null && h(e),
334
395
  fn: ({ steps: e, node: t }) => t && h(t) ? e.find((e) => e.id === t.stepId) ?? null : null,
335
- target: j
396
+ target: A
336
397
  });
337
- let M = a(r.steps.listStore, re, (e, t) => {
398
+ let j = a(r.steps.listStore, ie, (e, t) => {
338
399
  let n = t.at(-2);
339
400
  if (!n || !h(n.node)) return null;
340
401
  let r = n.node;
341
402
  return e.find((e) => e.id === r.stepId) || null;
342
- }), N = a(s.nodeTreeStore, A, (e, t) => t ? ue(e, t) : []), ie = a(s.nodeTreeStore, A, (e, t) => t ? oe(e, t) : [-1, -1]), P = a(s.nodeTreeStore, A, (e, t) => t ? ae(e, t) : [-1, -1]), F = J.store(!v).on(D, (e, t) => t), I = J.store(!1), L = o(I, {
403
+ }), M = a(s.nodeTreeStore, k, (e, t) => t ? fe(e, t) : []), ae = a(s.nodeTreeStore, k, (e, t) => t ? se(e, t) : [-1, -1]), N = a(s.nodeTreeStore, k, (e, t) => t ? oe(e, t) : [-1, -1]), P = X.store(!v).on(te, (e, t) => t), F = X.store(!1), I = o(F, {
343
404
  open: () => !0,
344
405
  close: () => !1,
345
406
  toggle: (e) => !e,
346
407
  set: (e, t) => t
347
- }), R = c(async () => {
408
+ }), L = c(async () => {
348
409
  r.history.back({ experienceId: s.id });
349
- }), se = i({
410
+ }), ce = i({
350
411
  source: s.treeStore,
351
412
  effect: async (e, t) => {
352
413
  let n = e.nodes.find((e) => h(e) && e.stepId === t);
@@ -355,7 +416,7 @@ var J = s("experience-instance"), Y = /* @__PURE__ */ new WeakMap(), me = f(({ c
355
416
  node: n
356
417
  });
357
418
  }
358
- }), ce = i({
419
+ }), le = i({
359
420
  source: s.treeStore,
360
421
  effect: async (e, t) => {
361
422
  let n = e.steps.find((e) => e.key === t);
@@ -366,15 +427,15 @@ var J = s("experience-instance"), Y = /* @__PURE__ */ new WeakMap(), me = f(({ c
366
427
  node: i
367
428
  });
368
429
  }
369
- }), z = c(() => void 0), B = i({
430
+ }), ue = c(() => void 0), R = i({
370
431
  source: s.treeStore,
371
- effect: async ({ nodes: e }) => de(e)
372
- }), V = i({
432
+ effect: async ({ nodes: e }) => pe(e)
433
+ }), z = i({
373
434
  source: s.treeStore,
374
435
  effect: async ({ nodes: e, edges: t }, n) => {
375
- if (g(n)) return q(n, e, t);
436
+ if (g(n)) return me(n, e, t);
376
437
  }
377
- }), H = i({
438
+ }), B = i({
378
439
  source: s.treeStore,
379
440
  effect: async (e, n) => {
380
441
  let { nodes: i, edges: a, conditions: o } = e, s = m(n) ? o.find((e) => e.id === n.conditionId)?.logic : void 0;
@@ -384,7 +445,7 @@ var J = s("experience-instance"), Y = /* @__PURE__ */ new WeakMap(), me = f(({ c
384
445
  };
385
446
  try {
386
447
  return {
387
- next: await fe(!!await t(r, s), n.id, i, a) ?? null,
448
+ next: await he(!!await t(r, s), n.id, i, a) ?? null,
388
449
  node: n
389
450
  };
390
451
  } catch {
@@ -394,103 +455,112 @@ var J = s("experience-instance"), Y = /* @__PURE__ */ new WeakMap(), me = f(({ c
394
455
  };
395
456
  }
396
457
  }
397
- }), U = i({
458
+ }), V = i({
398
459
  source: {
399
460
  tree: s.treeStore,
400
461
  actions: r.actions.listStore,
462
+ fields: r.fields.listStore,
401
463
  snapshot: r.stateSnapshotStore
402
464
  },
403
- effect: async ({ tree: e, actions: t, snapshot: n }, r) => {
404
- let { nodes: i, edges: a } = e;
405
- if (!_(r)) return {
465
+ effect: async ({ tree: e, actions: t, fields: n, snapshot: i }, a) => {
466
+ let { nodes: o, edges: s } = e;
467
+ if (!_(a)) return {
406
468
  next: null,
407
- node: r
469
+ node: a
408
470
  };
409
- let o = r.actionKey;
410
- if (!o) return `${r.id}`, {
471
+ let c = a.actionKey;
472
+ if (!c) return `${a.id}`, {
411
473
  next: null,
412
- node: r
474
+ node: a
413
475
  };
414
- let s = t.find((e) => e.key === o)?.action;
415
- if (typeof s != "function") return `${o}`, {
416
- next: pe(!1, r.id, i, a) ?? null,
417
- node: r
476
+ let l = t.find((e) => e.key === c)?.action;
477
+ if (typeof l != "function") return `${c}`, {
478
+ next: ge(!1, a.id, o, s) ?? null,
479
+ node: a
418
480
  };
419
- let c = new AbortController(), l = A.watch((e) => {
420
- e !== r && c.abort();
421
- }), u = !0;
481
+ let u = new AbortController(), d = k.watch((e) => {
482
+ e !== a && u.abort();
483
+ }), f;
422
484
  try {
423
- `${o}`, await s({
424
- ...n,
425
- args: [],
426
- signal: c.signal
427
- }, { experience: $ });
428
- } catch {
429
- c.signal.aborted || `${o}`, u = !1;
485
+ `${c}`, f = {
486
+ succeeded: !0,
487
+ value: await l({
488
+ ...i,
489
+ args: [],
490
+ signal: u.signal
491
+ }, { experience: $ })
492
+ };
493
+ } catch (e) {
494
+ u.signal.aborted || `${c}`, f = {
495
+ succeeded: !1,
496
+ error: e
497
+ };
430
498
  } finally {
431
- l();
499
+ d();
432
500
  }
433
- if (c.signal.aborted) return `${o}${r.id}`, {
501
+ if (u.signal.aborted) return `${c}${a.id}`, {
434
502
  next: null,
435
- node: r
503
+ node: a
436
504
  };
437
- let d = pe(u, r.id, i, a);
438
- if (!d) {
439
- let e = a.some((e) => e.sourceNodeId === r.id) ? "no edge for its outcome" : "no outgoing edge";
440
- return `${r.id}${e}`, {
505
+ let p = ve(a, n, f);
506
+ Object.keys(p).length > 0 && r.responses.register(p);
507
+ let { succeeded: m } = f, h = ge(m, a.id, o, s);
508
+ if (!h) {
509
+ let e = s.some((e) => e.sourceNodeId === a.id) ? "no edge for its outcome" : "no outgoing edge";
510
+ return `${a.id}${e}`, {
441
511
  next: null,
442
- node: r
512
+ node: a
443
513
  };
444
514
  }
445
- return `${o}${d.id}`, {
446
- next: d,
447
- node: r
515
+ return `${c}${h.id}`, {
516
+ next: h,
517
+ node: a
448
518
  };
449
519
  }
450
- }), W = l(), G = l(), le = J.store(null).on(W, (e, t) => t).on(G, (e, t) => e === t ? null : e);
520
+ }), H = l(), U = l(), de = X.store(null).on(H, (e, t) => t).on(U, (e, t) => e === t ? null : e);
451
521
  u({
452
- clock: [H, U],
453
- target: W
522
+ clock: [B, V],
523
+ target: H
454
524
  });
455
- let K = l();
525
+ let W = l();
456
526
  u({
457
- clock: [H.doneData, U.doneData],
527
+ clock: [B.doneData, V.doneData],
458
528
  fn: (e) => e.node,
459
- target: G
529
+ target: U
460
530
  }), u({
461
- clock: [H.doneData, U.doneData],
462
- source: A,
531
+ clock: [B.doneData, V.doneData],
532
+ source: k,
463
533
  fn: (e, t) => e === t.node ? t.next : null,
464
- target: K
534
+ target: W
465
535
  });
466
- let me = a(le, A, (e, t) => e !== null && e === t), X = me.map((e) => !e), he = c((e) => {
536
+ let G = a(de, k, (e, t) => e !== null && e === t), K = G.map((e) => !e), q = c((e) => {
467
537
  ee(e) && r.experiences.launch({ key: e.experienceKey });
468
- }), Z = i({
469
- source: [A, s.treeStore],
470
- effect: async ([e, { nodes: t, edges: n }]) => q(e, t, n)
471
- }), Q = i({
472
- source: [A, s.treeStore],
473
- effect: async ([e, { nodes: t, edges: n }]) => q(e, t, n)
474
- }), ge = i({
475
- source: F,
538
+ }), J = i({
539
+ source: [k, s.treeStore],
540
+ effect: async ([e, { nodes: t, edges: n }]) => me(e, t, n)
541
+ }), Y = i({
542
+ source: [k, s.treeStore],
543
+ effect: async ([e, { nodes: t, edges: n }]) => me(e, t, n)
544
+ }), _e = i({
545
+ source: P,
476
546
  effect: (e, t) => {
477
547
  e && r.history.push({
478
548
  experienceId: s.id,
479
549
  node: t
480
550
  });
481
551
  }
482
- }), _e = i({
552
+ }), ye = i({
483
553
  source: s.configStore,
484
554
  effect: async ({ initializeOpenLogic: n }) => p?.initialiseOpen === void 0 ? n == null ? y === "rendered" : e(n) ? !!await t(r, n) : n : p.initialiseOpen
485
- }), ve = a(k, r.frameworks.listStore, (e, t) => {
555
+ }), Q = a(O, r.frameworks.listStore, (e, t) => {
486
556
  if (!e) return null;
487
557
  let n = t.find((t) => t.name === e.component.frameworkName);
488
558
  return n ? {
489
559
  component: e,
490
560
  framework: n
491
561
  } : null;
492
- }, { skipVoid: !1 }), $, ye = i({
493
- source: ve,
562
+ }, { skipVoid: !1 }), $, be = i({
563
+ source: Q,
494
564
  effect: (e) => {
495
565
  if (!e) return;
496
566
  if (!f) {
@@ -510,174 +580,174 @@ var J = s("experience-instance"), Y = /* @__PURE__ */ new WeakMap(), me = f(({ c
510
580
  experienceName: s.name,
511
581
  configStore: s.configStore,
512
582
  target: f,
513
- componentStore: k,
514
- componentAndFrameworkStore: ve,
515
- stateStore: te,
516
- isOpenStore: I,
517
- open: L.open,
518
- close: L.close,
519
- toggleOpen: L.toggle,
520
- setOpen: L.set,
583
+ componentStore: O,
584
+ componentAndFrameworkStore: Q,
585
+ stateStore: ne,
586
+ isOpenStore: F,
587
+ open: I.open,
588
+ close: I.close,
589
+ toggleOpen: I.toggle,
590
+ setOpen: I.set,
521
591
  treeStore: s.treeStore,
522
- currentNodeStore: A,
523
- currentStepStore: j,
524
- previousStepStore: M,
525
- nextReachableStepNodesStore: N,
526
- stepsToOriginStore: ie,
527
- stepsToLeafStore: P,
592
+ currentNodeStore: k,
593
+ currentStepStore: A,
594
+ previousStepStore: j,
595
+ nextReachableStepNodesStore: M,
596
+ stepsToOriginStore: ae,
597
+ stepsToLeafStore: N,
528
598
  goToNextStep: x,
529
599
  goToPreviousStep: S,
530
600
  goToStepById: C,
531
601
  goToStepByKey: w,
532
- stepsHistoryStore: re,
533
- mountFx: ye
602
+ stepsHistoryStore: ie,
603
+ mountFx: be
534
604
  });
535
- let be = l(), xe = l();
605
+ let xe = l(), Se = l();
536
606
  u({
537
- clock: A,
538
- filter: F,
539
- target: be
607
+ clock: k,
608
+ filter: P,
609
+ target: xe
540
610
  }), u({
541
- clock: be,
611
+ clock: xe,
542
612
  filter: (e) => e === null,
543
- target: B
613
+ target: R
544
614
  }), u({
545
- clock: be,
615
+ clock: xe,
546
616
  filter: (e) => e !== null,
547
- target: xe
617
+ target: Se
548
618
  }), d({
549
- source: xe,
619
+ source: Se,
550
620
  match: (e) => m(e) ? "condition" : h(e) ? "step" : ee(e) ? "launchExperience" : g(e) ? "origin" : _(e) ? "action" : "other",
551
621
  cases: {
552
- origin: V,
553
- condition: H,
554
- step: z,
555
- launchExperience: he,
556
- action: U,
622
+ origin: z,
623
+ condition: B,
624
+ step: ue,
625
+ launchExperience: q,
626
+ action: V,
557
627
  __: l()
558
628
  }
559
629
  }), u({
560
630
  clock: [
561
- V.doneData,
562
- B.doneData,
563
- Q.doneData,
564
- Z.doneData,
565
- K
631
+ z.doneData,
632
+ R.doneData,
633
+ Y.doneData,
634
+ J.doneData,
635
+ W
566
636
  ],
567
637
  filter: Boolean,
568
- target: ge
638
+ target: _e
569
639
  });
570
- let Se = u({
640
+ let Ce = u({
571
641
  clock: x,
572
- filter: X
642
+ filter: K
573
643
  });
574
644
  return u({
575
- clock: Se,
576
- target: Q
645
+ clock: Ce,
646
+ target: Y
577
647
  }), u({
578
- clock: Se,
579
- source: j,
648
+ clock: Ce,
649
+ source: A,
580
650
  filter: Boolean,
581
- target: O.prepend((e) => ({
651
+ target: D.prepend((e) => ({
582
652
  type: "step_submit",
583
653
  step: e,
584
654
  experience: $
585
655
  }))
586
656
  }), u({
587
- clock: Q.done,
588
- source: j,
657
+ clock: Y.done,
658
+ source: A,
589
659
  filter: Boolean,
590
- target: O.prepend((e) => ({
660
+ target: D.prepend((e) => ({
591
661
  type: "step_submit_success",
592
662
  step: e,
593
663
  experience: $
594
664
  }))
595
665
  }), u({
596
- clock: Q.fail,
597
- source: j,
666
+ clock: Y.fail,
667
+ source: A,
598
668
  filter: Boolean,
599
- target: O.prepend((e) => ({
669
+ target: D.prepend((e) => ({
600
670
  type: "step_submit_error",
601
671
  step: e,
602
672
  experience: $
603
673
  }))
604
674
  }), u({
605
675
  clock: S,
606
- target: R
676
+ target: L
607
677
  }), u({
608
678
  clock: C,
609
- filter: X,
610
- target: se
679
+ filter: K,
680
+ target: ce
611
681
  }), u({
612
682
  clock: w,
613
- filter: X,
614
- target: ce
683
+ filter: K,
684
+ target: le
615
685
  }), u({
616
686
  source: a([
617
- V.pending,
618
- B.pending,
619
- Q.pending,
620
- Z.pending,
621
- me
687
+ z.pending,
688
+ R.pending,
689
+ Y.pending,
690
+ J.pending,
691
+ G
622
692
  ]),
623
693
  fn: (e) => e.some(Boolean) ? "transitioning" : "ready",
624
- target: te
694
+ target: ne
625
695
  }), u({
626
- clock: z.doneData,
627
- source: j,
696
+ clock: ue.doneData,
697
+ source: A,
628
698
  filter: Boolean,
629
- target: O.prepend((e) => ({
699
+ target: D.prepend((e) => ({
630
700
  type: "step_enter",
631
701
  step: e,
632
702
  experience: $
633
703
  }))
634
704
  }), u({
635
705
  clock: E,
636
- target: _e
706
+ target: ye
637
707
  }), u({
638
- clock: _e.doneData,
639
- filter: F,
708
+ clock: ye.doneData,
709
+ filter: P,
640
710
  fn: Boolean,
641
- target: I
711
+ target: F
642
712
  }), u({
643
- source: A,
713
+ source: k,
644
714
  clock: b,
645
715
  filter: (e) => !e || g(e),
646
- target: Z
716
+ target: J
647
717
  }), u({
648
- source: I,
718
+ source: F,
649
719
  filter: Boolean,
650
720
  target: b
651
721
  }), u({
652
- source: I,
722
+ source: F,
653
723
  filter: Boolean,
654
- target: O.prepend(() => ({
724
+ target: D.prepend(() => ({
655
725
  type: "experience_open",
656
726
  experience: $
657
727
  }))
658
728
  }), u({
659
- source: I,
729
+ source: F,
660
730
  filter: (e) => !e,
661
- target: O.prepend(() => ({
731
+ target: D.prepend(() => ({
662
732
  type: "experience_close",
663
733
  experience: $
664
734
  }))
665
735
  }), u({
666
- clock: O,
667
- filter: F,
736
+ clock: D,
737
+ filter: P,
668
738
  target: r.eventBus
669
- }), v ? Y.set($, (e) => {
670
- e && L.close(), D(e), e && E();
739
+ }), v ? Z.set($, (e) => {
740
+ e && I.close(), te(e), e && E();
671
741
  }) : u({
672
742
  clock: T,
673
743
  target: E
674
744
  }), T(), $;
675
745
  });
676
- function X(e) {
677
- return p(me, e);
746
+ function Q(e) {
747
+ return p(ye, e);
678
748
  }
679
- var he = f(({ client: e }) => {
680
- let t = J.store({}), n = l(), i = l(), a = l(), s = o(t, {
749
+ var $ = f(({ client: e }) => {
750
+ let t = X.store({}), n = l(), i = l(), a = l(), s = o(t, {
681
751
  register(e, t) {
682
752
  let n = [...e[t.experienceId] ?? []];
683
753
  return n.push(t), {
@@ -692,7 +762,7 @@ var he = f(({ client: e }) => {
692
762
  [n]: r ?? []
693
763
  };
694
764
  }
695
- }), d = c(({ experience: t, target: n, options: r }) => X({
765
+ }), d = c(({ experience: t, target: n, options: r }) => Q({
696
766
  client: e,
697
767
  experience: t,
698
768
  target: n,
@@ -750,9 +820,9 @@ var he = f(({ client: e }) => {
750
820
  return y.has(t) || (s.register(t), e.eventBus({
751
821
  type: "experience_initialize",
752
822
  experience: t
753
- }), Y.get(t)?.(!0)), y.set(t, !0), () => {
823
+ }), Z.get(t)?.(!0)), y.set(t, !0), () => {
754
824
  y.has(t) && (y.set(t, !1), queueMicrotask(() => {
755
- y.get(t) === !1 && (y.delete(t), Y.get(t)?.(!1), s.unregister(t), e.eventBus({
825
+ y.get(t) === !1 && (y.delete(t), Z.get(t)?.(!1), s.unregister(t), e.eventBus({
756
826
  type: "experience_unmount",
757
827
  experience: t
758
828
  }));
@@ -767,8 +837,8 @@ var he = f(({ client: e }) => {
767
837
  listStore: g
768
838
  };
769
839
  });
770
- function Z(e) {
771
- return p(he, e);
840
+ function be(e) {
841
+ return p($, e);
772
842
  }
773
843
  //#endregion
774
- export { se as a, W as c, h as d, G as i, ie as l, Z as n, le as o, z as r, H as s, X as t, m as u };
844
+ export { ce as a, H as c, h as d, U as i, ae as l, be as n, de as o, ue as r, B as s, Q as t, m as u };