@picked/client 0.0.1-dev.1789541668638 → 0.0.1-dev.1793756239746
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/LICENSE +1 -0
- package/README.md +34 -158
- package/dist/.tsbuildinfo +1 -1
- package/dist/{api-C7q_7vxn.js → api-B5i4XuCs.js} +1 -1
- package/dist/api-DMYLC1At.cjs +1 -0
- package/dist/cjs/form/index.js +1 -1
- package/dist/cjs/index.js +2 -2
- package/dist/cjs/logic-engine.js +1 -0
- package/dist/cjs/plugins/dom-observer/index.js +1 -1
- package/dist/cjs/plugins/dynamic-experiences/index.js +1 -1
- package/dist/cjs/plugins/experience-browser-storage/index.js +1 -1
- package/dist/cjs/plugins/responses-browser-storage/index.js +1 -1
- package/dist/cjs/plugins/telemetry/index.js +1 -1
- package/dist/cjs/server/index.js +1 -1
- package/dist/cjs/storage.js +1 -0
- package/dist/dom-7g2LZCIp.cjs +1 -0
- package/dist/{dom-BqcToNL0.js → dom-v6ulxr_z.js} +1 -5
- package/dist/esm/form/index.js +5 -16
- package/dist/esm/index.js +465 -505
- package/dist/esm/logic-engine.js +208 -0
- package/dist/esm/plugins/dom-observer/index.js +1 -1
- package/dist/esm/plugins/dynamic-experiences/index.js +4 -4
- package/dist/esm/plugins/experience-browser-storage/index.js +12 -10
- package/dist/esm/plugins/responses-browser-storage/index.js +2 -6
- package/dist/esm/plugins/telemetry/index.js +26 -15
- package/dist/esm/preview/index.js +1 -2
- package/dist/esm/server/index.js +40 -36
- package/dist/esm/storage.js +1 -0
- package/dist/{experience-instance-B9S6Yf0N.js → experience-instance-4D6Yk-h0.js} +323 -260
- package/dist/experience-instance-D2FAkiPx.cjs +1 -0
- package/dist/plugin-CVLK5ZLV.cjs +1 -0
- package/dist/plugin-C_cLCzXK.js +256 -0
- package/dist/preview-channel-BMOEreho.cjs +1 -0
- package/dist/{preview-channel-CSr96XAo.js → preview-channel-CLXVoL_j.js} +2 -5
- package/dist/preview-unavailable-BAhTGDAp.cjs +1 -0
- package/dist/{version-CPKulHMH.js → preview-unavailable-OHRfSIId.js} +100 -61
- package/dist/provider-BFZgizAt.cjs +1 -0
- package/dist/provider-dD92LNPP.js +115 -0
- package/dist/{rules-logic-HesIUCu6.js → rules-logic-9hh8y_1b.js} +1 -1
- package/dist/rules-logic-VUbvWqdi.cjs +1 -0
- package/dist/types/data-source/preview-unavailable.d.ts +18 -0
- package/dist/types/data-source/preview-unavailable.d.ts.map +1 -0
- package/dist/types/data-source/provider.d.ts +5 -0
- package/dist/types/data-source/provider.d.ts.map +1 -1
- package/dist/types/data-source/request-observer.d.ts +21 -8
- package/dist/types/data-source/request-observer.d.ts.map +1 -1
- package/dist/types/entities/action/action.d.ts +94 -23
- package/dist/types/entities/action/action.d.ts.map +1 -1
- package/dist/types/entities/experience-instance/experience-instance.d.ts +14 -1
- package/dist/types/entities/experience-instance/experience-instance.d.ts.map +1 -1
- package/dist/types/exports.d.ts +1 -0
- package/dist/types/exports.d.ts.map +1 -1
- package/dist/types/index.d.ts +2 -2
- package/dist/types/index.d.ts.map +1 -1
- package/dist/types/lifecycle/rules-logic.d.ts.map +1 -1
- package/dist/types/logic-engine.d.ts +9 -0
- package/dist/types/logic-engine.d.ts.map +1 -1
- package/dist/types/picked.d.ts +38 -8
- package/dist/types/picked.d.ts.map +1 -1
- package/dist/types/plugins/dynamic-experiences/index.d.ts +1 -0
- package/dist/types/plugins/dynamic-experiences/index.d.ts.map +1 -1
- package/dist/types/plugins/dynamic-experiences/plugin.d.ts.map +1 -1
- package/dist/types/plugins/dynamic-experiences/types.d.ts +5 -2
- package/dist/types/plugins/dynamic-experiences/types.d.ts.map +1 -1
- package/dist/types/plugins/experience-browser-storage/plugin.d.ts.map +1 -1
- package/dist/types/plugins/telemetry/plugin.d.ts +2 -0
- package/dist/types/plugins/telemetry/plugin.d.ts.map +1 -1
- package/dist/types/schema-registry.d.ts +34 -0
- package/dist/types/schema-registry.d.ts.map +1 -1
- package/dist/types/server/serialize.d.ts +1 -0
- package/dist/types/server/serialize.d.ts.map +1 -1
- package/dist/types/storage.d.ts +6 -0
- package/dist/types/storage.d.ts.map +1 -0
- package/dist/types/typed-content.d.ts +14 -1
- package/dist/types/typed-content.d.ts.map +1 -1
- package/dist/types/utils/events.d.ts +4 -0
- package/dist/types/utils/events.d.ts.map +1 -1
- package/dist/types/utils/rules-logic.d.ts +3 -2
- package/dist/types/utils/rules-logic.d.ts.map +1 -1
- package/dist/types/utils/search-params.d.ts +20 -0
- package/dist/types/utils/search-params.d.ts.map +1 -1
- package/package.json +39 -13
- package/dist/api-Ctvh1qkk.cjs +0 -1
- package/dist/docs/_root.css +0 -101
- package/dist/docs/explanation/conditions-and-the-logic-engine.md +0 -94
- package/dist/docs/explanation/content-references.md +0 -99
- package/dist/docs/explanation/feature-flag-allocation.md +0 -218
- package/dist/docs/explanation/how-picked-works.md +0 -124
- package/dist/docs/explanation/how-pickedql-works.md +0 -76
- package/dist/docs/explanation/pages-and-flows.md +0 -64
- package/dist/docs/explanation/the-content-model.md +0 -87
- package/dist/docs/explanation/the-two-apis.md +0 -68
- package/dist/docs/explanation/why-server-side-rendering.md +0 -76
- package/dist/docs/explanation/workspaces-and-versions.md +0 -71
- package/dist/docs/how-to/add-a-step-field-or-action.md +0 -43
- package/dist/docs/how-to/analytics/index.md +0 -316
- package/dist/docs/how-to/archive-or-delete-a-workspace.md +0 -46
- package/dist/docs/how-to/authenticate-the-cli.md +0 -97
- package/dist/docs/how-to/authenticate-with-a-magic-link.md +0 -40
- package/dist/docs/how-to/authenticate-with-a-password.md +0 -51
- package/dist/docs/how-to/authenticate-with-an-api-key.md +0 -51
- package/dist/docs/how-to/authenticate-with-oauth.md +0 -40
- package/dist/docs/how-to/build-a-flow.md +0 -83
- package/dist/docs/how-to/connect-the-mcp-server.md +0 -38
- package/dist/docs/how-to/create-a-content-entry.md +0 -48
- package/dist/docs/how-to/create-a-project.md +0 -29
- package/dist/docs/how-to/create-an-experience.md +0 -42
- package/dist/docs/how-to/create-and-revoke-an-api-key.md +0 -42
- package/dist/docs/how-to/debug-with-the-chrome-extension.md +0 -57
- package/dist/docs/how-to/define-a-page-layout.md +0 -46
- package/dist/docs/how-to/fill-and-publish-a-page.md +0 -66
- package/dist/docs/how-to/install-the-gtm-template.md +0 -84
- package/dist/docs/how-to/install-the-sdk.md +0 -93
- package/dist/docs/how-to/install-the-vite-plugin.md +0 -69
- package/dist/docs/how-to/invite-and-remove-members.md +0 -35
- package/dist/docs/how-to/point-one-entry-at-another.md +0 -61
- package/dist/docs/how-to/preview-a-workspace.md +0 -28
- package/dist/docs/how-to/publish-a-workspace.md +0 -30
- package/dist/docs/how-to/read-a-feature-flag.md +0 -113
- package/dist/docs/how-to/read-a-referenced-entry.md +0 -109
- package/dist/docs/how-to/register-a-component.md +0 -55
- package/dist/docs/how-to/register-an-action-handler.md +0 -67
- package/dist/docs/how-to/render-a-step-form.md +0 -131
- package/dist/docs/how-to/render-an-unpublished-preview.md +0 -41
- package/dist/docs/how-to/reuse-a-section.md +0 -53
- package/dist/docs/how-to/reuse-a-step-field-or-action.md +0 -28
- package/dist/docs/how-to/roll-back-a-published-version.md +0 -26
- package/dist/docs/how-to/run-an-ab-test.md +0 -49
- package/dist/docs/how-to/run-code-on-a-form-submission.md +0 -125
- package/dist/docs/how-to/server-render-a-page.md +0 -81
- package/dist/docs/how-to/set-a-content-security-policy.md +0 -32
- package/dist/docs/how-to/set-up-mfa.md +0 -69
- package/dist/docs/how-to/switch-workspaces.md +0 -122
- package/dist/docs/how-to/upload-and-use-an-asset.mdx +0 -73
- package/dist/docs/how-to/validate-a-field.md +0 -52
- package/dist/docs/how-to/write-a-condition.md +0 -45
- package/dist/docs/how-to/write-a-predicate.md +0 -60
- package/dist/docs/index.md +0 -59
- package/dist/docs/reference/dashboard/actions.mdx +0 -53
- package/dist/docs/reference/dashboard/api-keys.mdx +0 -38
- package/dist/docs/reference/dashboard/conditions.mdx +0 -42
- package/dist/docs/reference/dashboard/content/asset-library.mdx +0 -63
- package/dist/docs/reference/dashboard/content/blocks.mdx +0 -57
- package/dist/docs/reference/dashboard/content/content-entries.mdx +0 -95
- package/dist/docs/reference/dashboard/content/models.mdx +0 -108
- package/dist/docs/reference/dashboard/content/pages.mdx +0 -61
- package/dist/docs/reference/dashboard/experiences.mdx +0 -51
- package/dist/docs/reference/dashboard/features.mdx +0 -154
- package/dist/docs/reference/dashboard/fields.mdx +0 -106
- package/dist/docs/reference/dashboard/flow-builder/canvas.mdx +0 -58
- package/dist/docs/reference/dashboard/flow-builder/condition-builder.md +0 -57
- package/dist/docs/reference/dashboard/flow-builder/keyboard-shortcuts.md +0 -72
- package/dist/docs/reference/dashboard/flow-builder/nodes.md +0 -63
- package/dist/docs/reference/dashboard/projects.mdx +0 -44
- package/dist/docs/reference/dashboard/reports.mdx +0 -43
- package/dist/docs/reference/dashboard/steps.mdx +0 -37
- package/dist/docs/reference/dashboard/team-management.md +0 -29
- package/dist/docs/reference/dashboard/workspace-versioning.mdx +0 -30
- package/dist/docs/reference/dashboard/workspaces.mdx +0 -76
- package/dist/docs/reference/delivery-api/experience-content.md +0 -152
- package/dist/docs/reference/delivery-api/index.md +0 -45
- package/dist/docs/reference/delivery-api/preview-caching-crawling.md +0 -79
- package/dist/docs/reference/delivery-api/project-config.md +0 -65
- package/dist/docs/reference/delivery-api/workspace-schema.md +0 -85
- package/dist/docs/reference/glossary.md +0 -181
- package/dist/docs/reference/management-api/authentication.md +0 -74
- package/dist/docs/reference/management-api/authorization-and-scopes.md +0 -285
- package/dist/docs/reference/management-api/error-handling.md +0 -233
- package/dist/docs/reference/management-api/pagination.md +0 -192
- package/dist/docs/reference/pickedql/data-sources.md +0 -174
- package/dist/docs/reference/pickedql/dimensions.md +0 -103
- package/dist/docs/reference/pickedql/filtering.md +0 -64
- package/dist/docs/reference/pickedql/index.md +0 -18
- package/dist/docs/reference/pickedql/schema.md +0 -172
- package/dist/docs/reference/pickedql/virtual-functions.md +0 -248
- package/dist/docs/reference/sdk/actions.md +0 -30
- package/dist/docs/reference/sdk/analytics-events.md +0 -445
- package/dist/docs/reference/sdk/conditions.md +0 -147
- package/dist/docs/reference/sdk/content-security-policy.md +0 -21
- package/dist/docs/reference/sdk/content.md +0 -213
- package/dist/docs/reference/sdk/experiences.md +0 -51
- package/dist/docs/reference/sdk/features.md +0 -256
- package/dist/docs/reference/sdk/fields.md +0 -255
- package/dist/docs/reference/sdk/index.md +0 -68
- package/dist/docs/reference/sdk/plugins/create-experience.md +0 -123
- package/dist/docs/reference/sdk/plugins/dynamic-experiences.md +0 -74
- package/dist/docs/reference/sdk/plugins/index.md +0 -29
- package/dist/docs/reference/sdk/plugins/window-object.md +0 -25
- package/dist/docs/reference/sdk/predicates.md +0 -43
- package/dist/docs/reference/sdk/ssr/index.md +0 -33
- package/dist/docs/reference/sdk/ssr/rendering-and-hydration.md +0 -103
- package/dist/docs/reference/sdk/ssr/serialize.md +0 -80
- package/dist/docs/reference/sdk/ssr/slots-and-placements.md +0 -59
- package/dist/docs/reference/sdk/steps.md +0 -86
- package/dist/docs/reference/sdk/type-generation.md +0 -196
- package/dist/docs/reference/tools/chrome-extension.md +0 -16
- package/dist/docs/reference/tools/cli.md +0 -146
- package/dist/docs/reference/tools/image-optimisation-service.md +0 -104
- package/dist/docs/reference/tools/mcp.md +0 -90
- package/dist/docs/reference/tools/vite-plugin.md +0 -163
- package/dist/docs/tutorials/first-api-call.md +0 -228
- package/dist/docs/tutorials/first-experience-in-the-dashboard.mdx +0 -143
- package/dist/docs/tutorials/first-experience.mdx +0 -254
- package/dist/docs/tutorials/first-server-rendered-page.mdx +0 -186
- package/dist/dom-DlLH3FxV.cjs +0 -1
- package/dist/experience-instance-D8rOg6We.cjs +0 -1
- package/dist/plugin-ChafFq6S.js +0 -194
- package/dist/plugin-Dn25Gffy.cjs +0 -1
- package/dist/preview-channel-Cx0e6fye.cjs +0 -1
- package/dist/provider-B8wvmeC8.js +0 -98
- package/dist/provider-BBLlQOjV.cjs +0 -1
- package/dist/rules-logic-CGZIYgAI.cjs +0 -1
- package/dist/version-CLjPfmxk.cjs +0 -1
|
@@ -1,6 +1,6 @@
|
|
|
1
|
-
import { n as e, t } from "./rules-logic-
|
|
1
|
+
import { n as e, t } from "./rules-logic-9hh8y_1b.js";
|
|
2
2
|
import "./logger-DMN6TxJJ.js";
|
|
3
|
-
import { n, o as r } from "./dom-
|
|
3
|
+
import { n, o as r } from "./dom-v6ulxr_z.js";
|
|
4
4
|
import { attach as i, combine as a, createApi as o, createDomain as s, createEffect as c, createEvent as l, sample as u, split as d } from "effector";
|
|
5
5
|
import { createFactory as f, invoke as p } from "@withease/factories";
|
|
6
6
|
//#region src/utils/nodes.ts
|
|
@@ -10,18 +10,18 @@ function m(e) {
|
|
|
10
10
|
function h(e) {
|
|
11
11
|
return e.type === "step";
|
|
12
12
|
}
|
|
13
|
-
function
|
|
13
|
+
function ee(e) {
|
|
14
14
|
return e.type === "experience";
|
|
15
15
|
}
|
|
16
|
-
function
|
|
16
|
+
function g(e) {
|
|
17
17
|
return e.type === "origin";
|
|
18
18
|
}
|
|
19
|
-
function
|
|
19
|
+
function _(e) {
|
|
20
20
|
return e.type === "action";
|
|
21
21
|
}
|
|
22
22
|
//#endregion
|
|
23
23
|
//#region src/utils/node-tree/node-adjacency.ts
|
|
24
|
-
var
|
|
24
|
+
var v = [], y = (e, t) => {
|
|
25
25
|
let n = /* @__PURE__ */ new Map();
|
|
26
26
|
for (let t of e) n.set(t.id, t);
|
|
27
27
|
let r = /* @__PURE__ */ new Map(), i = /* @__PURE__ */ new Map();
|
|
@@ -36,14 +36,14 @@ var y = [], b = (e, t) => {
|
|
|
36
36
|
outgoingEdges: r,
|
|
37
37
|
incomingEdges: i
|
|
38
38
|
};
|
|
39
|
-
},
|
|
39
|
+
}, b = (e, t) => e.outgoingEdges.get(t) ?? v, x = (e, t) => e.incomingEdges.get(t) ?? v, S = -1, C = -Infinity, w = (e, t) => Array.from({ length: e }, () => t), T = (e) => Array.from({ length: e }, () => !1), E = (e, t, n) => {
|
|
40
40
|
let r = [];
|
|
41
41
|
for (let i of e) {
|
|
42
42
|
let e = n.get(i[t]);
|
|
43
43
|
e !== void 0 && r.push(e);
|
|
44
44
|
}
|
|
45
45
|
return r;
|
|
46
|
-
},
|
|
46
|
+
}, D = (e, t) => {
|
|
47
47
|
let n = /* @__PURE__ */ new Map();
|
|
48
48
|
t.forEach((e, t) => {
|
|
49
49
|
n.set(e, t);
|
|
@@ -57,15 +57,15 @@ var y = [], b = (e, t) => {
|
|
|
57
57
|
origins: []
|
|
58
58
|
};
|
|
59
59
|
return t.forEach((t, i) => {
|
|
60
|
-
let a =
|
|
61
|
-
r.successors.push(
|
|
60
|
+
let a = b(e, t);
|
|
61
|
+
r.successors.push(E(a, "destinationNodeId", n)), r.predecessors.push(E(x(e, t), "sourceNodeId", n));
|
|
62
62
|
let o = a.length === 0;
|
|
63
63
|
r.isLeaf.push(o), o && r.leaves.push(i);
|
|
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
|
-
},
|
|
68
|
-
let r =
|
|
67
|
+
}, O = (e, t, n) => {
|
|
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;
|
|
71
71
|
for (; o < i.length;) {
|
|
@@ -73,147 +73,132 @@ var y = [], b = (e, t) => {
|
|
|
73
73
|
if (o += 1, e === void 0) continue;
|
|
74
74
|
a += 1;
|
|
75
75
|
let n = (r[e] ?? 0) + 1;
|
|
76
|
-
for (let a of t[e] ?? []) r[a] ===
|
|
76
|
+
for (let a of t[e] ?? []) r[a] === S && (r[a] = n, i.push(a));
|
|
77
77
|
}
|
|
78
78
|
return {
|
|
79
79
|
values: r,
|
|
80
80
|
visits: a
|
|
81
81
|
};
|
|
82
|
-
},
|
|
82
|
+
}, k = (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
|
-
},
|
|
87
|
+
}, te = (e, t) => {
|
|
88
88
|
let n = (e.successors[t.node] ?? [])[t.edge];
|
|
89
|
-
|
|
90
|
-
|
|
91
|
-
A(e, n);
|
|
92
|
-
return;
|
|
93
|
-
}
|
|
94
|
-
e.onStack[n] && (e.lowLinkOf[t.node] = Math.min(e.lowLinkOf[t.node] ?? 0, e.discoveryOf[n] ?? 0));
|
|
95
|
-
}
|
|
96
|
-
}, M = (e, t) => {
|
|
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
|
+
}, ne = (e, t) => {
|
|
97
91
|
e.frames.pop(), e.visits += 1;
|
|
98
|
-
let n = e.frames
|
|
92
|
+
let n = e.frames.at(-1);
|
|
99
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;
|
|
100
|
-
let r = [];
|
|
101
|
-
for (
|
|
102
|
-
let n = e.stack.pop();
|
|
103
|
-
if (n === void 0 || (e.onStack[n] = !1, e.componentOf[n] = e.members.length, r.push(n), n === t.node)) break;
|
|
104
|
-
}
|
|
94
|
+
let r = [], i = e.stack.pop();
|
|
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();
|
|
105
96
|
e.members.push(r);
|
|
106
|
-
},
|
|
97
|
+
}, re = (e, t) => {
|
|
107
98
|
let n = {
|
|
108
99
|
successors: e,
|
|
109
|
-
discoveryOf:
|
|
110
|
-
lowLinkOf:
|
|
111
|
-
onStack:
|
|
112
|
-
componentOf:
|
|
100
|
+
discoveryOf: w(t, S),
|
|
101
|
+
lowLinkOf: w(t, S),
|
|
102
|
+
onStack: T(t),
|
|
103
|
+
componentOf: w(t, S),
|
|
113
104
|
stack: [],
|
|
114
105
|
frames: [],
|
|
115
106
|
members: [],
|
|
116
107
|
counter: 0,
|
|
117
108
|
visits: 0
|
|
118
109
|
};
|
|
119
|
-
for (let r = 0; r < t; r += 1) if (n.discoveryOf[r] ===
|
|
120
|
-
let t = n.frames
|
|
110
|
+
for (let r = 0; r < t; r += 1) if (n.discoveryOf[r] === S) for (k(n, r); n.frames.length > 0;) {
|
|
111
|
+
let t = n.frames.at(-1);
|
|
121
112
|
if (!t) break;
|
|
122
|
-
t.edge < (e[t.node] ?? []).length ?
|
|
113
|
+
t.edge < (e[t.node] ?? []).length ? te(n, t) : ne(n, t);
|
|
123
114
|
}
|
|
124
115
|
return {
|
|
125
116
|
componentOf: n.componentOf,
|
|
126
117
|
members: n.members,
|
|
127
118
|
visits: n.visits
|
|
128
119
|
};
|
|
129
|
-
},
|
|
130
|
-
let r =
|
|
120
|
+
}, A = (e, t, n) => {
|
|
121
|
+
let r = C;
|
|
131
122
|
for (let i of e.adjacency[t] ?? []) {
|
|
132
|
-
let t = e.components.componentOf[i] ??
|
|
123
|
+
let t = e.components.componentOf[i] ?? S;
|
|
133
124
|
if (t === n) continue;
|
|
134
|
-
let a = e.perComponent[t] ??
|
|
135
|
-
a !==
|
|
125
|
+
let a = e.perComponent[t] ?? C;
|
|
126
|
+
a !== C && (r = Math.max(r, a + 1));
|
|
136
127
|
}
|
|
137
128
|
return r;
|
|
138
|
-
},
|
|
139
|
-
let n =
|
|
140
|
-
for (let r of e.components.members[t] ?? [])
|
|
141
|
-
if (e.isTerminus[r]) {
|
|
142
|
-
n = Math.max(n, 0);
|
|
143
|
-
continue;
|
|
144
|
-
}
|
|
145
|
-
n = Math.max(n, P(e, r, t));
|
|
146
|
-
}
|
|
129
|
+
}, j = (e, t) => {
|
|
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));
|
|
147
132
|
return n;
|
|
148
|
-
},
|
|
133
|
+
}, M = (e, t, n, r) => {
|
|
149
134
|
let i = n.members.length, a = {
|
|
150
135
|
adjacency: e,
|
|
151
136
|
isTerminus: t,
|
|
152
137
|
components: n,
|
|
153
|
-
perComponent:
|
|
138
|
+
perComponent: w(i, C)
|
|
154
139
|
}, o = 0;
|
|
155
140
|
for (let e = 0; e < i; e += 1) {
|
|
156
141
|
let t = r ? i - 1 - e : e, s = (n.members[t] ?? []).length;
|
|
157
142
|
o += s;
|
|
158
|
-
let c =
|
|
159
|
-
a.perComponent[t] = c ===
|
|
143
|
+
let c = j(a, t);
|
|
144
|
+
a.perComponent[t] = c === C ? C : c + s - 1;
|
|
160
145
|
}
|
|
161
146
|
return {
|
|
162
147
|
values: n.componentOf.map((e, n) => {
|
|
163
148
|
if (t[n]) return 0;
|
|
164
|
-
let r = a.perComponent[e] ??
|
|
165
|
-
return r ===
|
|
149
|
+
let r = a.perComponent[e] ?? C;
|
|
150
|
+
return r === C ? S : r;
|
|
166
151
|
}),
|
|
167
152
|
visits: o
|
|
168
153
|
};
|
|
169
|
-
},
|
|
154
|
+
}, N = (e, t, n) => {
|
|
170
155
|
let r = /* @__PURE__ */ new Map();
|
|
171
156
|
return e.forEach((e, i) => {
|
|
172
|
-
let a = t.values[i] ??
|
|
173
|
-
r.set(e, a ===
|
|
157
|
+
let a = t.values[i] ?? S, o = n.values[i] ?? S;
|
|
158
|
+
r.set(e, a === S ? [S, S] : [a, o]);
|
|
174
159
|
}), r;
|
|
175
|
-
},
|
|
176
|
-
let n =
|
|
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);
|
|
177
162
|
return {
|
|
178
163
|
...n,
|
|
179
|
-
stepsToLeaf:
|
|
180
|
-
stepsToOrigin:
|
|
164
|
+
stepsToLeaf: N(r, s, c),
|
|
165
|
+
stepsToOrigin: N(r, l, u),
|
|
181
166
|
nodeVisits: o.visits + s.visits + c.visits + l.visits + u.visits
|
|
182
167
|
};
|
|
183
|
-
},
|
|
184
|
-
let r = Infinity, i =
|
|
168
|
+
}, P = (e, t, n) => {
|
|
169
|
+
let r = Infinity, i = C;
|
|
185
170
|
for (let a of t) {
|
|
186
171
|
let t = e.get(a[n]);
|
|
187
|
-
|
|
172
|
+
t && t[0] !== S && (r = Math.min(r, t[0] + 1), i = Math.max(i, t[1] + 1));
|
|
188
173
|
}
|
|
189
|
-
return r === Infinity ? [
|
|
190
|
-
},
|
|
174
|
+
return r === Infinity ? [S, S] : [r, i];
|
|
175
|
+
}, ae = (e, t) => {
|
|
191
176
|
let n = e.stepsToLeaf.get(t.id);
|
|
192
177
|
if (n) return [n[0], n[1]];
|
|
193
|
-
let r =
|
|
194
|
-
return r.length === 0 ? [0, 0] :
|
|
195
|
-
},
|
|
178
|
+
let r = b(e, t.id);
|
|
179
|
+
return r.length === 0 ? [0, 0] : P(e.stepsToLeaf, r, "destinationNodeId");
|
|
180
|
+
}, oe = (e, t) => {
|
|
196
181
|
let n = e.stepsToOrigin.get(t.id);
|
|
197
|
-
return n ? [n[0], n[1]] : t.type === "origin" ? [0, 0] :
|
|
198
|
-
},
|
|
199
|
-
function
|
|
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) {
|
|
200
185
|
return typeof e == "object" && !!e && !Array.isArray(e);
|
|
201
186
|
}
|
|
202
|
-
function
|
|
187
|
+
function R(e) {
|
|
203
188
|
if (e === void 0) return null;
|
|
204
|
-
if (Array.isArray(e)) return e.map((e) =>
|
|
205
|
-
if (
|
|
189
|
+
if (Array.isArray(e)) return e.map((e) => R(e));
|
|
190
|
+
if (L(e)) {
|
|
206
191
|
let t = Object.keys(e).sort((e, t) => e.localeCompare(t)), n = {};
|
|
207
|
-
for (let r of t) n[r] =
|
|
192
|
+
for (let r of t) n[r] = R(e[r]);
|
|
208
193
|
return n;
|
|
209
194
|
}
|
|
210
195
|
return e;
|
|
211
196
|
}
|
|
212
|
-
function
|
|
213
|
-
return JSON.stringify(
|
|
197
|
+
function se(e) {
|
|
198
|
+
return JSON.stringify(R(e));
|
|
214
199
|
}
|
|
215
|
-
var
|
|
216
|
-
let e =
|
|
200
|
+
var ce = f(() => {
|
|
201
|
+
let e = I.store({}), t = o(e, {
|
|
217
202
|
set(e, t) {
|
|
218
203
|
return e[t.hash] === t.result ? e : {
|
|
219
204
|
...e,
|
|
@@ -250,96 +235,96 @@ var H = f(() => {
|
|
|
250
235
|
reset: i
|
|
251
236
|
};
|
|
252
237
|
});
|
|
253
|
-
function
|
|
254
|
-
return p(
|
|
238
|
+
function z() {
|
|
239
|
+
return p(ce);
|
|
255
240
|
}
|
|
256
|
-
async function
|
|
241
|
+
async function B(n, r, i) {
|
|
257
242
|
return r == null ? !0 : typeof r == "boolean" ? r : !e(r) || await t(n, r, i) === !0;
|
|
258
243
|
}
|
|
259
|
-
function
|
|
244
|
+
function V(e) {
|
|
260
245
|
if (typeof e == "string") return e;
|
|
261
246
|
if (Array.isArray(e) && typeof e[0] == "string") return e[0];
|
|
262
247
|
}
|
|
263
|
-
function
|
|
264
|
-
if (Array.isArray(e)) return e.some(
|
|
265
|
-
if (
|
|
266
|
-
let t =
|
|
267
|
-
return t !== void 0 && (t === "actions" || t.startsWith("actions.")) ? !0 : Object.values(e).some(
|
|
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);
|
|
268
253
|
}
|
|
269
254
|
return !1;
|
|
270
255
|
}
|
|
271
|
-
function
|
|
272
|
-
if (Array.isArray(e)) return e.flatMap(
|
|
273
|
-
if (
|
|
274
|
-
let t =
|
|
275
|
-
return [...t !== void 0 && t.startsWith(
|
|
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)];
|
|
276
261
|
}
|
|
277
262
|
return [];
|
|
278
263
|
}
|
|
279
|
-
function
|
|
280
|
-
if (
|
|
281
|
-
for (let r of
|
|
264
|
+
function W(e, t, n = /* @__PURE__ */ new Set()) {
|
|
265
|
+
if (H(e)) return !0;
|
|
266
|
+
for (let r of U(e)) {
|
|
282
267
|
if (n.has(r)) continue;
|
|
283
268
|
n.add(r);
|
|
284
269
|
let e = t[r];
|
|
285
|
-
if (e !== void 0 &&
|
|
270
|
+
if (e !== void 0 && W(e.logic, t, n)) return !0;
|
|
286
271
|
}
|
|
287
272
|
return !1;
|
|
288
273
|
}
|
|
289
|
-
async function
|
|
274
|
+
async function G(e, t, n) {
|
|
290
275
|
let r = {};
|
|
291
276
|
for (let t of e.conditions.listStore.getState()) r[t.key] = t;
|
|
292
|
-
let i =
|
|
277
|
+
let i = W(t, r), a = se(t);
|
|
293
278
|
if (!i) {
|
|
294
279
|
let t = e.conditionResults.peek(a);
|
|
295
280
|
if (t !== void 0) return t;
|
|
296
281
|
}
|
|
297
|
-
let o = await
|
|
282
|
+
let o = await B(e, t, n?.context);
|
|
298
283
|
return i || e.conditionResults.set({
|
|
299
284
|
hash: a,
|
|
300
285
|
result: o
|
|
301
286
|
}), o;
|
|
302
287
|
}
|
|
303
|
-
async function
|
|
288
|
+
async function le(e, t, n) {
|
|
304
289
|
let r = n?.context, i = [
|
|
305
290
|
n?.precondition,
|
|
306
291
|
n?.condition,
|
|
307
292
|
t.condition
|
|
308
293
|
];
|
|
309
|
-
for (let t of i) if (!await
|
|
294
|
+
for (let t of i) if (!await G(e, t, { context: r })) return !1;
|
|
310
295
|
return !0;
|
|
311
296
|
}
|
|
312
297
|
//#endregion
|
|
313
298
|
//#region src/utils/node-tree/next-reachable-step-nodes.ts
|
|
314
|
-
var
|
|
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) => {
|
|
315
300
|
let n = e.nodeById.get(t.destinationNodeId);
|
|
316
|
-
return n ?
|
|
317
|
-
})),
|
|
318
|
-
if (!e) return
|
|
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);
|
|
319
304
|
let r = n.find((t) => t.sourceNodeId === e.id);
|
|
320
305
|
return r && t.find((e) => e.id === r.destinationNodeId) || null;
|
|
321
306
|
};
|
|
322
307
|
//#endregion
|
|
323
308
|
//#region src/utils/node-tree/get-next-node-from-condition.ts
|
|
324
|
-
async function
|
|
309
|
+
async function fe(e, t, n, r) {
|
|
325
310
|
let i = e ? "true" : "false", a = r.find((e) => e.sourceHandle === i && e.sourceNodeId === t);
|
|
326
311
|
return n.find((e) => e.id === a?.destinationNodeId);
|
|
327
312
|
}
|
|
328
313
|
//#endregion
|
|
329
314
|
//#region src/utils/node-tree/get-next-node-from-action.ts
|
|
330
|
-
function
|
|
315
|
+
function pe(e, t, n, r) {
|
|
331
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);
|
|
332
317
|
return n.find((e) => e.id === o?.destinationNodeId);
|
|
333
318
|
}
|
|
334
319
|
//#endregion
|
|
335
320
|
//#region src/entities/experience-instance/experience-instance.ts
|
|
336
|
-
var
|
|
337
|
-
let
|
|
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);
|
|
338
323
|
u({
|
|
339
324
|
clock: [
|
|
340
325
|
A,
|
|
341
326
|
r.steps.listStore,
|
|
342
|
-
|
|
327
|
+
T
|
|
343
328
|
],
|
|
344
329
|
source: {
|
|
345
330
|
steps: r.steps.listStore,
|
|
@@ -349,19 +334,19 @@ var Q = s("experience-instance"), $ = f(({ client: r, experience: s, target: f,
|
|
|
349
334
|
fn: ({ steps: e, node: t }) => t && h(t) ? e.find((e) => e.id === t.stepId) ?? null : null,
|
|
350
335
|
target: j
|
|
351
336
|
});
|
|
352
|
-
let M = a(r.steps.listStore,
|
|
337
|
+
let M = a(r.steps.listStore, re, (e, t) => {
|
|
353
338
|
let n = t.at(-2);
|
|
354
339
|
if (!n || !h(n.node)) return null;
|
|
355
340
|
let r = n.node;
|
|
356
341
|
return e.find((e) => e.id === r.stepId) || null;
|
|
357
|
-
}), N = a(s.nodeTreeStore, A, (e, t) => t ?
|
|
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, {
|
|
358
343
|
open: () => !0,
|
|
359
344
|
close: () => !1,
|
|
360
345
|
toggle: (e) => !e,
|
|
361
346
|
set: (e, t) => t
|
|
362
|
-
}),
|
|
347
|
+
}), R = c(async () => {
|
|
363
348
|
r.history.back({ experienceId: s.id });
|
|
364
|
-
}),
|
|
349
|
+
}), se = i({
|
|
365
350
|
source: s.treeStore,
|
|
366
351
|
effect: async (e, t) => {
|
|
367
352
|
let n = e.nodes.find((e) => h(e) && e.stepId === t);
|
|
@@ -370,7 +355,7 @@ var Q = s("experience-instance"), $ = f(({ client: r, experience: s, target: f,
|
|
|
370
355
|
node: n
|
|
371
356
|
});
|
|
372
357
|
}
|
|
373
|
-
}),
|
|
358
|
+
}), ce = i({
|
|
374
359
|
source: s.treeStore,
|
|
375
360
|
effect: async (e, t) => {
|
|
376
361
|
let n = e.steps.find((e) => e.key === t);
|
|
@@ -381,25 +366,35 @@ var Q = s("experience-instance"), $ = f(({ client: r, experience: s, target: f,
|
|
|
381
366
|
node: i
|
|
382
367
|
});
|
|
383
368
|
}
|
|
384
|
-
}),
|
|
385
|
-
source: A,
|
|
386
|
-
effect: (e) => {}
|
|
387
|
-
}), z = i({
|
|
369
|
+
}), z = c(() => void 0), B = i({
|
|
388
370
|
source: s.treeStore,
|
|
389
|
-
effect: async ({ nodes: e }) =>
|
|
390
|
-
}),
|
|
371
|
+
effect: async ({ nodes: e }) => de(e)
|
|
372
|
+
}), V = i({
|
|
391
373
|
source: s.treeStore,
|
|
392
374
|
effect: async ({ nodes: e, edges: t }, n) => {
|
|
393
|
-
if (
|
|
375
|
+
if (g(n)) return q(n, e, t);
|
|
394
376
|
}
|
|
395
|
-
}),
|
|
377
|
+
}), H = i({
|
|
396
378
|
source: s.treeStore,
|
|
397
|
-
effect: async (
|
|
398
|
-
|
|
399
|
-
|
|
400
|
-
|
|
379
|
+
effect: async (e, n) => {
|
|
380
|
+
let { nodes: i, edges: a, conditions: o } = e, s = m(n) ? o.find((e) => e.id === n.conditionId)?.logic : void 0;
|
|
381
|
+
if (!m(n) || !s) return {
|
|
382
|
+
next: null,
|
|
383
|
+
node: n
|
|
384
|
+
};
|
|
385
|
+
try {
|
|
386
|
+
return {
|
|
387
|
+
next: await fe(!!await t(r, s), n.id, i, a) ?? null,
|
|
388
|
+
node: n
|
|
389
|
+
};
|
|
390
|
+
} catch {
|
|
391
|
+
return `${n.id}`, {
|
|
392
|
+
next: null,
|
|
393
|
+
node: n
|
|
394
|
+
};
|
|
395
|
+
}
|
|
401
396
|
}
|
|
402
|
-
}),
|
|
397
|
+
}), U = i({
|
|
403
398
|
source: {
|
|
404
399
|
tree: s.treeStore,
|
|
405
400
|
actions: r.actions.listStore,
|
|
@@ -407,55 +402,95 @@ var Q = s("experience-instance"), $ = f(({ client: r, experience: s, target: f,
|
|
|
407
402
|
},
|
|
408
403
|
effect: async ({ tree: e, actions: t, snapshot: n }, r) => {
|
|
409
404
|
let { nodes: i, edges: a } = e;
|
|
410
|
-
if (!
|
|
405
|
+
if (!_(r)) return {
|
|
406
|
+
next: null,
|
|
407
|
+
node: r
|
|
408
|
+
};
|
|
411
409
|
let o = r.actionKey;
|
|
412
|
-
if (!o) {
|
|
413
|
-
|
|
414
|
-
|
|
415
|
-
}
|
|
410
|
+
if (!o) return `${r.id}`, {
|
|
411
|
+
next: null,
|
|
412
|
+
node: r
|
|
413
|
+
};
|
|
416
414
|
let s = t.find((e) => e.key === o)?.action;
|
|
417
|
-
if (typeof s != "function") return `${o}`,
|
|
418
|
-
|
|
415
|
+
if (typeof s != "function") return `${o}`, {
|
|
416
|
+
next: pe(!1, r.id, i, a) ?? null,
|
|
417
|
+
node: r
|
|
418
|
+
};
|
|
419
|
+
let c = new AbortController(), l = A.watch((e) => {
|
|
420
|
+
e !== r && c.abort();
|
|
421
|
+
}), u = !0;
|
|
419
422
|
try {
|
|
420
423
|
`${o}`, await s({
|
|
421
424
|
...n,
|
|
422
|
-
args: []
|
|
423
|
-
|
|
425
|
+
args: [],
|
|
426
|
+
signal: c.signal
|
|
427
|
+
}, { experience: $ });
|
|
424
428
|
} catch {
|
|
425
|
-
`${o}`,
|
|
429
|
+
c.signal.aborted || `${o}`, u = !1;
|
|
430
|
+
} finally {
|
|
431
|
+
l();
|
|
426
432
|
}
|
|
427
|
-
|
|
428
|
-
|
|
433
|
+
if (c.signal.aborted) return `${o}${r.id}`, {
|
|
434
|
+
next: null,
|
|
435
|
+
node: r
|
|
436
|
+
};
|
|
437
|
+
let d = pe(u, r.id, i, a);
|
|
438
|
+
if (!d) {
|
|
429
439
|
let e = a.some((e) => e.sourceNodeId === r.id) ? "no edge for its outcome" : "no outgoing edge";
|
|
430
|
-
return `${r.id}${e}`,
|
|
440
|
+
return `${r.id}${e}`, {
|
|
441
|
+
next: null,
|
|
442
|
+
node: r
|
|
443
|
+
};
|
|
431
444
|
}
|
|
432
|
-
return `${o}${
|
|
445
|
+
return `${o}${d.id}`, {
|
|
446
|
+
next: d,
|
|
447
|
+
node: r
|
|
448
|
+
};
|
|
433
449
|
}
|
|
434
|
-
}),
|
|
435
|
-
|
|
436
|
-
|
|
450
|
+
}), W = l(), G = l(), le = J.store(null).on(W, (e, t) => t).on(G, (e, t) => e === t ? null : e);
|
|
451
|
+
u({
|
|
452
|
+
clock: [H, U],
|
|
453
|
+
target: W
|
|
454
|
+
});
|
|
455
|
+
let K = l();
|
|
456
|
+
u({
|
|
457
|
+
clock: [H.doneData, U.doneData],
|
|
458
|
+
fn: (e) => e.node,
|
|
459
|
+
target: G
|
|
460
|
+
}), u({
|
|
461
|
+
clock: [H.doneData, U.doneData],
|
|
462
|
+
source: A,
|
|
463
|
+
fn: (e, t) => e === t.node ? t.next : null,
|
|
464
|
+
target: K
|
|
465
|
+
});
|
|
466
|
+
let me = a(le, A, (e, t) => e !== null && e === t), X = me.map((e) => !e), he = c((e) => {
|
|
467
|
+
ee(e) && r.experiences.launch({ key: e.experienceKey });
|
|
468
|
+
}), Z = i({
|
|
437
469
|
source: [A, s.treeStore],
|
|
438
|
-
effect: async ([e, { nodes: t, edges: n }]) =>
|
|
439
|
-
}),
|
|
470
|
+
effect: async ([e, { nodes: t, edges: n }]) => q(e, t, n)
|
|
471
|
+
}), Q = i({
|
|
440
472
|
source: [A, s.treeStore],
|
|
441
|
-
effect: async ([e, { nodes: t, edges: n }]) =>
|
|
442
|
-
}),
|
|
443
|
-
|
|
444
|
-
|
|
445
|
-
|
|
446
|
-
|
|
447
|
-
|
|
473
|
+
effect: async ([e, { nodes: t, edges: n }]) => q(e, t, n)
|
|
474
|
+
}), ge = i({
|
|
475
|
+
source: F,
|
|
476
|
+
effect: (e, t) => {
|
|
477
|
+
e && r.history.push({
|
|
478
|
+
experienceId: s.id,
|
|
479
|
+
node: t
|
|
480
|
+
});
|
|
481
|
+
}
|
|
482
|
+
}), _e = i({
|
|
448
483
|
source: s.configStore,
|
|
449
|
-
effect: async ({ initializeOpenLogic: n }) => p?.initialiseOpen === void 0 ? e(n) ? !!await t(r, n) : n
|
|
450
|
-
}),
|
|
484
|
+
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) => {
|
|
451
486
|
if (!e) return null;
|
|
452
487
|
let n = t.find((t) => t.name === e.component.frameworkName);
|
|
453
488
|
return n ? {
|
|
454
489
|
component: e,
|
|
455
490
|
framework: n
|
|
456
491
|
} : null;
|
|
457
|
-
}, { skipVoid: !1 }),
|
|
458
|
-
source:
|
|
492
|
+
}, { skipVoid: !1 }), $, ye = i({
|
|
493
|
+
source: ve,
|
|
459
494
|
effect: (e) => {
|
|
460
495
|
if (!e) return;
|
|
461
496
|
if (!f) {
|
|
@@ -464,172 +499,185 @@ var Q = s("experience-instance"), $ = f(({ client: r, experience: s, target: f,
|
|
|
464
499
|
}
|
|
465
500
|
let t = n(f);
|
|
466
501
|
try {
|
|
467
|
-
e.framework.render(t, e.component.component, r,
|
|
502
|
+
e.framework.render(t, e.component.component, r, $);
|
|
468
503
|
} catch {}
|
|
469
504
|
}
|
|
470
505
|
});
|
|
471
|
-
|
|
506
|
+
$ = Object.freeze({
|
|
472
507
|
id: Math.random().toString(36).substring(7),
|
|
473
508
|
experienceKey: s.key,
|
|
474
509
|
experienceId: s.id,
|
|
475
510
|
experienceName: s.name,
|
|
476
511
|
configStore: s.configStore,
|
|
477
512
|
target: f,
|
|
478
|
-
componentStore:
|
|
479
|
-
componentAndFrameworkStore:
|
|
480
|
-
stateStore:
|
|
481
|
-
isOpenStore:
|
|
482
|
-
open:
|
|
483
|
-
close:
|
|
484
|
-
toggleOpen:
|
|
485
|
-
setOpen:
|
|
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,
|
|
486
521
|
treeStore: s.treeStore,
|
|
487
522
|
currentNodeStore: A,
|
|
488
523
|
currentStepStore: j,
|
|
489
524
|
previousStepStore: M,
|
|
490
525
|
nextReachableStepNodesStore: N,
|
|
491
|
-
stepsToOriginStore:
|
|
492
|
-
stepsToLeafStore:
|
|
493
|
-
goToNextStep:
|
|
494
|
-
goToPreviousStep:
|
|
495
|
-
goToStepById:
|
|
496
|
-
goToStepByKey:
|
|
497
|
-
stepsHistoryStore:
|
|
498
|
-
mountFx:
|
|
526
|
+
stepsToOriginStore: ie,
|
|
527
|
+
stepsToLeafStore: P,
|
|
528
|
+
goToNextStep: x,
|
|
529
|
+
goToPreviousStep: S,
|
|
530
|
+
goToStepById: C,
|
|
531
|
+
goToStepByKey: w,
|
|
532
|
+
stepsHistoryStore: re,
|
|
533
|
+
mountFx: ye
|
|
499
534
|
});
|
|
500
|
-
let
|
|
501
|
-
|
|
535
|
+
let be = l(), xe = l();
|
|
536
|
+
u({
|
|
502
537
|
clock: A,
|
|
503
|
-
|
|
538
|
+
filter: F,
|
|
539
|
+
target: be
|
|
504
540
|
}), u({
|
|
505
|
-
clock:
|
|
541
|
+
clock: be,
|
|
506
542
|
filter: (e) => e === null,
|
|
507
|
-
target:
|
|
543
|
+
target: B
|
|
508
544
|
}), u({
|
|
509
|
-
clock:
|
|
545
|
+
clock: be,
|
|
510
546
|
filter: (e) => e !== null,
|
|
511
|
-
target:
|
|
547
|
+
target: xe
|
|
512
548
|
}), d({
|
|
513
|
-
source:
|
|
514
|
-
match: (e) => m(e) ? "condition" : h(e) ? "step" :
|
|
549
|
+
source: xe,
|
|
550
|
+
match: (e) => m(e) ? "condition" : h(e) ? "step" : ee(e) ? "launchExperience" : g(e) ? "origin" : _(e) ? "action" : "other",
|
|
515
551
|
cases: {
|
|
516
|
-
origin:
|
|
517
|
-
condition:
|
|
518
|
-
step:
|
|
519
|
-
launchExperience:
|
|
520
|
-
action:
|
|
552
|
+
origin: V,
|
|
553
|
+
condition: H,
|
|
554
|
+
step: z,
|
|
555
|
+
launchExperience: he,
|
|
556
|
+
action: U,
|
|
521
557
|
__: l()
|
|
522
558
|
}
|
|
523
559
|
}), u({
|
|
524
560
|
clock: [
|
|
525
561
|
V.doneData,
|
|
526
562
|
B.doneData,
|
|
527
|
-
|
|
528
|
-
|
|
529
|
-
|
|
530
|
-
H.doneData
|
|
563
|
+
Q.doneData,
|
|
564
|
+
Z.doneData,
|
|
565
|
+
K
|
|
531
566
|
],
|
|
532
567
|
filter: Boolean,
|
|
533
|
-
target:
|
|
534
|
-
})
|
|
535
|
-
|
|
536
|
-
|
|
568
|
+
target: ge
|
|
569
|
+
});
|
|
570
|
+
let Se = u({
|
|
571
|
+
clock: x,
|
|
572
|
+
filter: X
|
|
573
|
+
});
|
|
574
|
+
return u({
|
|
575
|
+
clock: Se,
|
|
576
|
+
target: Q
|
|
537
577
|
}), u({
|
|
538
|
-
clock:
|
|
578
|
+
clock: Se,
|
|
539
579
|
source: j,
|
|
540
580
|
filter: Boolean,
|
|
541
|
-
target:
|
|
581
|
+
target: O.prepend((e) => ({
|
|
542
582
|
type: "step_submit",
|
|
543
583
|
step: e,
|
|
544
|
-
experience:
|
|
584
|
+
experience: $
|
|
545
585
|
}))
|
|
546
586
|
}), u({
|
|
547
|
-
clock:
|
|
587
|
+
clock: Q.done,
|
|
548
588
|
source: j,
|
|
549
589
|
filter: Boolean,
|
|
550
|
-
target:
|
|
590
|
+
target: O.prepend((e) => ({
|
|
551
591
|
type: "step_submit_success",
|
|
552
592
|
step: e,
|
|
553
|
-
experience:
|
|
593
|
+
experience: $
|
|
554
594
|
}))
|
|
555
595
|
}), u({
|
|
556
|
-
clock:
|
|
596
|
+
clock: Q.fail,
|
|
557
597
|
source: j,
|
|
558
598
|
filter: Boolean,
|
|
559
|
-
target:
|
|
599
|
+
target: O.prepend((e) => ({
|
|
560
600
|
type: "step_submit_error",
|
|
561
601
|
step: e,
|
|
562
|
-
experience:
|
|
602
|
+
experience: $
|
|
563
603
|
}))
|
|
564
|
-
}), u({
|
|
565
|
-
clock: x,
|
|
566
|
-
target: te
|
|
567
604
|
}), u({
|
|
568
605
|
clock: S,
|
|
569
|
-
target:
|
|
606
|
+
target: R
|
|
570
607
|
}), u({
|
|
571
608
|
clock: C,
|
|
572
|
-
|
|
609
|
+
filter: X,
|
|
610
|
+
target: se
|
|
611
|
+
}), u({
|
|
612
|
+
clock: w,
|
|
613
|
+
filter: X,
|
|
614
|
+
target: ce
|
|
573
615
|
}), u({
|
|
574
616
|
source: a([
|
|
575
617
|
V.pending,
|
|
576
618
|
B.pending,
|
|
577
|
-
|
|
578
|
-
|
|
579
|
-
|
|
580
|
-
H.pending
|
|
619
|
+
Q.pending,
|
|
620
|
+
Z.pending,
|
|
621
|
+
me
|
|
581
622
|
]),
|
|
582
623
|
fn: (e) => e.some(Boolean) ? "transitioning" : "ready",
|
|
583
|
-
target:
|
|
624
|
+
target: te
|
|
584
625
|
}), u({
|
|
585
|
-
clock:
|
|
626
|
+
clock: z.doneData,
|
|
586
627
|
source: j,
|
|
587
628
|
filter: Boolean,
|
|
588
|
-
target:
|
|
629
|
+
target: O.prepend((e) => ({
|
|
589
630
|
type: "step_enter",
|
|
590
631
|
step: e,
|
|
591
|
-
experience:
|
|
632
|
+
experience: $
|
|
592
633
|
}))
|
|
593
634
|
}), u({
|
|
594
|
-
clock:
|
|
595
|
-
target:
|
|
635
|
+
clock: E,
|
|
636
|
+
target: _e
|
|
596
637
|
}), u({
|
|
597
|
-
|
|
638
|
+
clock: _e.doneData,
|
|
639
|
+
filter: F,
|
|
598
640
|
fn: Boolean,
|
|
599
|
-
target:
|
|
641
|
+
target: I
|
|
600
642
|
}), u({
|
|
601
643
|
source: A,
|
|
602
|
-
clock:
|
|
603
|
-
filter: (e) => !e ||
|
|
604
|
-
target:
|
|
644
|
+
clock: b,
|
|
645
|
+
filter: (e) => !e || g(e),
|
|
646
|
+
target: Z
|
|
605
647
|
}), u({
|
|
606
|
-
source:
|
|
648
|
+
source: I,
|
|
607
649
|
filter: Boolean,
|
|
608
|
-
target:
|
|
650
|
+
target: b
|
|
609
651
|
}), u({
|
|
610
|
-
source:
|
|
652
|
+
source: I,
|
|
611
653
|
filter: Boolean,
|
|
612
|
-
target:
|
|
654
|
+
target: O.prepend(() => ({
|
|
613
655
|
type: "experience_open",
|
|
614
|
-
experience:
|
|
656
|
+
experience: $
|
|
615
657
|
}))
|
|
616
658
|
}), u({
|
|
617
|
-
source:
|
|
659
|
+
source: I,
|
|
618
660
|
filter: (e) => !e,
|
|
619
|
-
target:
|
|
661
|
+
target: O.prepend(() => ({
|
|
620
662
|
type: "experience_close",
|
|
621
|
-
experience:
|
|
663
|
+
experience: $
|
|
622
664
|
}))
|
|
623
665
|
}), u({
|
|
624
|
-
clock:
|
|
625
|
-
|
|
626
|
-
|
|
666
|
+
clock: O,
|
|
667
|
+
filter: F,
|
|
668
|
+
target: r.eventBus
|
|
669
|
+
}), v ? Y.set($, (e) => {
|
|
670
|
+
e && L.close(), D(e), e && E();
|
|
671
|
+
}) : u({
|
|
672
|
+
clock: T,
|
|
673
|
+
target: E
|
|
674
|
+
}), T(), $;
|
|
627
675
|
});
|
|
628
|
-
function
|
|
629
|
-
return p(
|
|
676
|
+
function X(e) {
|
|
677
|
+
return p(me, e);
|
|
630
678
|
}
|
|
631
|
-
var
|
|
632
|
-
let t =
|
|
679
|
+
var he = f(({ client: e }) => {
|
|
680
|
+
let t = J.store({}), n = l(), i = l(), a = l(), s = o(t, {
|
|
633
681
|
register(e, t) {
|
|
634
682
|
let n = [...e[t.experienceId] ?? []];
|
|
635
683
|
return n.push(t), {
|
|
@@ -644,7 +692,7 @@ var de = f(({ client: e }) => {
|
|
|
644
692
|
[n]: r ?? []
|
|
645
693
|
};
|
|
646
694
|
}
|
|
647
|
-
}), d = c(({ experience: t, target: n, options: r }) =>
|
|
695
|
+
}), d = c(({ experience: t, target: n, options: r }) => X({
|
|
648
696
|
client: e,
|
|
649
697
|
experience: t,
|
|
650
698
|
target: n,
|
|
@@ -683,29 +731,44 @@ var de = f(({ client: e }) => {
|
|
|
683
731
|
clock: i,
|
|
684
732
|
target: h
|
|
685
733
|
});
|
|
686
|
-
function
|
|
734
|
+
function ee(e, t, r) {
|
|
687
735
|
n({
|
|
688
736
|
experience: e,
|
|
689
737
|
target: t,
|
|
690
738
|
options: r
|
|
691
739
|
});
|
|
692
740
|
}
|
|
693
|
-
let
|
|
694
|
-
function
|
|
695
|
-
return
|
|
741
|
+
let g = t.map((e) => Object.values(e).flat());
|
|
742
|
+
function _(e) {
|
|
743
|
+
return g.map((t) => t.filter((t) => t.experienceKey === e), { skipVoid: !1 });
|
|
696
744
|
}
|
|
697
|
-
function
|
|
745
|
+
function v(e) {
|
|
698
746
|
return t.map((t) => t[e] || [], { skipVoid: !1 });
|
|
699
747
|
}
|
|
748
|
+
let y = /* @__PURE__ */ new Map();
|
|
749
|
+
function b(t) {
|
|
750
|
+
return y.has(t) || (s.register(t), e.eventBus({
|
|
751
|
+
type: "experience_initialize",
|
|
752
|
+
experience: t
|
|
753
|
+
}), Y.get(t)?.(!0)), y.set(t, !0), () => {
|
|
754
|
+
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({
|
|
756
|
+
type: "experience_unmount",
|
|
757
|
+
experience: t
|
|
758
|
+
}));
|
|
759
|
+
}));
|
|
760
|
+
};
|
|
761
|
+
}
|
|
700
762
|
return {
|
|
701
|
-
spawn:
|
|
702
|
-
|
|
703
|
-
|
|
704
|
-
|
|
763
|
+
spawn: ee,
|
|
764
|
+
adopt: b,
|
|
765
|
+
getByExperienceKey: _,
|
|
766
|
+
getByExperienceId: v,
|
|
767
|
+
listStore: g
|
|
705
768
|
};
|
|
706
769
|
});
|
|
707
|
-
function
|
|
708
|
-
return p(
|
|
770
|
+
function Z(e) {
|
|
771
|
+
return p(he, e);
|
|
709
772
|
}
|
|
710
773
|
//#endregion
|
|
711
|
-
export {
|
|
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 };
|