@webiny/website-builder-sdk 0.0.0-unstable.6f45466a1d → 0.0.0-unstable.7be00a75a9

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 (175) hide show
  1. package/BindingsApi.js +29 -36
  2. package/BindingsApi.js.map +1 -1
  3. package/BindingsProcessor.js +34 -43
  4. package/BindingsProcessor.js.map +1 -1
  5. package/BindingsProcessor.test.js +82 -78
  6. package/BindingsProcessor.test.js.map +1 -1
  7. package/BindingsResolver.js +92 -122
  8. package/BindingsResolver.js.map +1 -1
  9. package/BindingsResolver.test.js +399 -363
  10. package/BindingsResolver.test.js.map +1 -1
  11. package/ComponentInputTraverser.js +28 -49
  12. package/ComponentInputTraverser.js.map +1 -1
  13. package/ComponentManifestToAstConverter.js +20 -21
  14. package/ComponentManifestToAstConverter.js.map +1 -1
  15. package/ComponentRegistry.js +33 -22
  16. package/ComponentRegistry.js.map +1 -1
  17. package/ComponentResolver.js +25 -29
  18. package/ComponentResolver.js.map +1 -1
  19. package/ConstraintEvaluator.d.ts +36 -0
  20. package/ConstraintEvaluator.js +288 -0
  21. package/ConstraintEvaluator.js.map +1 -0
  22. package/ConstraintEvaluator.test.d.ts +1 -0
  23. package/ConstraintEvaluator.test.js +1634 -0
  24. package/ConstraintEvaluator.test.js.map +1 -0
  25. package/ContentSdk.d.ts +3 -3
  26. package/ContentSdk.js +83 -90
  27. package/ContentSdk.js.map +1 -1
  28. package/DocumentStore.js +47 -59
  29. package/DocumentStore.js.map +1 -1
  30. package/DocumentStoreManager.js +17 -16
  31. package/DocumentStoreManager.js.map +1 -1
  32. package/EditingSdk.d.ts +2 -2
  33. package/EditingSdk.js +87 -121
  34. package/EditingSdk.js.map +1 -1
  35. package/ElementFactory.d.ts +2 -3
  36. package/ElementFactory.js +125 -164
  37. package/ElementFactory.js.map +1 -1
  38. package/ElementFactory.test.d.ts +1 -0
  39. package/ElementFactory.test.js +251 -0
  40. package/ElementFactory.test.js.map +1 -0
  41. package/Environment.js +18 -19
  42. package/Environment.js.map +1 -1
  43. package/FunctionConverter.js +8 -7
  44. package/FunctionConverter.js.map +1 -1
  45. package/HashObject.js +11 -12
  46. package/HashObject.js.map +1 -1
  47. package/HotkeyManager.js +41 -48
  48. package/HotkeyManager.js.map +1 -1
  49. package/IBindingsUpdater.js +0 -3
  50. package/IRedirects.js +0 -3
  51. package/InheritanceProcessor.js +99 -139
  52. package/InheritanceProcessor.js.map +1 -1
  53. package/InheritanceProcessor.test.js +178 -179
  54. package/InheritanceProcessor.test.js.map +1 -1
  55. package/InheritedValueResolver.js +15 -20
  56. package/InheritedValueResolver.js.map +1 -1
  57. package/InputBindingsProcessor.js +187 -289
  58. package/InputBindingsProcessor.js.map +1 -1
  59. package/InputsBindingsProcessor.test.js +334 -314
  60. package/InputsBindingsProcessor.test.js.map +1 -1
  61. package/InputsUpdater.d.ts +1 -1
  62. package/InputsUpdater.js +23 -26
  63. package/InputsUpdater.js.map +1 -1
  64. package/LiveSdk.d.ts +2 -2
  65. package/LiveSdk.js +12 -13
  66. package/LiveSdk.js.map +1 -1
  67. package/Logger.js +9 -8
  68. package/Logger.js.map +1 -1
  69. package/MouseTracker.js +77 -83
  70. package/MouseTracker.js.map +1 -1
  71. package/NullSdk.d.ts +4 -3
  72. package/NullSdk.js +22 -14
  73. package/NullSdk.js.map +1 -1
  74. package/PreviewDocument.js +27 -30
  75. package/PreviewDocument.js.map +1 -1
  76. package/PreviewSdk.d.ts +2 -2
  77. package/PreviewSdk.js +16 -17
  78. package/PreviewSdk.js.map +1 -1
  79. package/PreviewViewport.js +51 -63
  80. package/PreviewViewport.js.map +1 -1
  81. package/ResizeObserver.js +24 -31
  82. package/ResizeObserver.js.map +1 -1
  83. package/StylesBindingsProcessor.js +40 -79
  84. package/StylesBindingsProcessor.js.map +1 -1
  85. package/StylesUpdater.d.ts +1 -1
  86. package/StylesUpdater.js +20 -25
  87. package/StylesUpdater.js.map +1 -1
  88. package/Theme.js +29 -25
  89. package/Theme.js.map +1 -1
  90. package/ViewportManager.js +89 -101
  91. package/ViewportManager.js.map +1 -1
  92. package/constants.d.ts +1 -0
  93. package/constants.js +7 -5
  94. package/constants.js.map +1 -1
  95. package/createElement.js +5 -6
  96. package/createElement.js.map +1 -1
  97. package/createInput.js +85 -143
  98. package/createInput.js.map +1 -1
  99. package/createTheme.js +2 -3
  100. package/createTheme.js.map +1 -1
  101. package/dataProviders/ApiClient.js +40 -49
  102. package/dataProviders/ApiClient.js.map +1 -1
  103. package/dataProviders/DefaultDataProvider.d.ts +2 -2
  104. package/dataProviders/DefaultDataProvider.js +55 -44
  105. package/dataProviders/DefaultDataProvider.js.map +1 -1
  106. package/dataProviders/GET_PAGE_BY_ID.d.ts +1 -1
  107. package/dataProviders/GET_PAGE_BY_ID.js +3 -1
  108. package/dataProviders/GET_PAGE_BY_ID.js.map +1 -1
  109. package/dataProviders/GET_PAGE_BY_PATH.d.ts +1 -1
  110. package/dataProviders/GET_PAGE_BY_PATH.js +3 -1
  111. package/dataProviders/GET_PAGE_BY_PATH.js.map +1 -1
  112. package/dataProviders/LIST_PUBLISHED_PAGES.d.ts +1 -1
  113. package/dataProviders/LIST_PUBLISHED_PAGES.js +16 -5
  114. package/dataProviders/LIST_PUBLISHED_PAGES.js.map +1 -1
  115. package/dataProviders/NullDataProvider.d.ts +12 -4
  116. package/dataProviders/NullDataProvider.js +21 -13
  117. package/dataProviders/NullDataProvider.js.map +1 -1
  118. package/dataProviders/RedirectsProvider.js +24 -27
  119. package/dataProviders/RedirectsProvider.js.map +1 -1
  120. package/defaultBreakpoints.js +23 -22
  121. package/defaultBreakpoints.js.map +1 -1
  122. package/documentOperations/$addElementReferenceToParent.d.ts +1 -1
  123. package/documentOperations/$addElementReferenceToParent.js +30 -26
  124. package/documentOperations/$addElementReferenceToParent.js.map +1 -1
  125. package/documentOperations/AddElement.js +8 -7
  126. package/documentOperations/AddElement.js.map +1 -1
  127. package/documentOperations/AddToParent.d.ts +2 -2
  128. package/documentOperations/AddToParent.js +14 -13
  129. package/documentOperations/AddToParent.js.map +1 -1
  130. package/documentOperations/IDocumentOperation.js +0 -3
  131. package/documentOperations/RemoveElement.js +10 -7
  132. package/documentOperations/RemoveElement.js.map +1 -1
  133. package/documentOperations/SetGlobalInputBinding.js +23 -22
  134. package/documentOperations/SetGlobalInputBinding.js.map +1 -1
  135. package/documentOperations/SetGlobalStyleBinding.js +23 -23
  136. package/documentOperations/SetGlobalStyleBinding.js.map +1 -1
  137. package/documentOperations/SetInputBindingOverride.js +30 -29
  138. package/documentOperations/SetInputBindingOverride.js.map +1 -1
  139. package/documentOperations/SetStyleBindingOverride.js +30 -31
  140. package/documentOperations/SetStyleBindingOverride.js.map +1 -1
  141. package/documentOperations/index.js +9 -8
  142. package/documentOperations/index.js.map +1 -1
  143. package/findMatchingAstNode.js +11 -13
  144. package/findMatchingAstNode.js.map +1 -1
  145. package/generateElementId.js +2 -2
  146. package/generateElementId.js.map +1 -1
  147. package/headersProvider.js +4 -3
  148. package/headersProvider.js.map +1 -1
  149. package/index.d.ts +1 -0
  150. package/index.js +1 -2
  151. package/jsonPatch.js +5 -9
  152. package/jsonPatch.js.map +1 -1
  153. package/messages.js +12 -11
  154. package/messages.js.map +1 -1
  155. package/messenger/MessageOrigin.js +12 -11
  156. package/messenger/MessageOrigin.js.map +1 -1
  157. package/messenger/Messenger.js +58 -71
  158. package/messenger/Messenger.js.map +1 -1
  159. package/messenger/index.js +0 -2
  160. package/package.json +16 -16
  161. package/registerComponentGroup.js +5 -6
  162. package/registerComponentGroup.js.map +1 -1
  163. package/types/ShorthandCssProperties.js +0 -3
  164. package/types/WebsiteBuilderTheme.d.ts +7 -0
  165. package/types/WebsiteBuilderTheme.js +0 -3
  166. package/types.d.ts +173 -11
  167. package/types.js +0 -3
  168. package/IBindingsUpdater.js.map +0 -1
  169. package/IRedirects.js.map +0 -1
  170. package/documentOperations/IDocumentOperation.js.map +0 -1
  171. package/index.js.map +0 -1
  172. package/messenger/index.js.map +0 -1
  173. package/types/ShorthandCssProperties.js.map +0 -1
  174. package/types/WebsiteBuilderTheme.js.map +0 -1
  175. package/types.js.map +0 -1
@@ -1,306 +1,204 @@
1
- import deepEqual from "deep-equal";
1
+ import deep_equal from "deep-equal";
2
2
  import set from "lodash/set.js";
3
3
  import { InheritedValueResolver } from "./InheritedValueResolver.js";
4
4
  import { DocumentOperations } from "./documentOperations/index.js";
5
5
  import { InputsUpdater } from "./InputsUpdater.js";
6
6
  import { generateElementId } from "./generateElementId.js";
7
- /**
8
- * Handles deep-to-flat and flat-to-deep conversion of input bindings,
9
- * with breakpoint inheritance awareness.
10
- */
11
- export class InputsBindingsProcessor {
12
- constructor(elementId, inputsAst, breakpoints, rawBindings, elementFactory) {
13
- this.elementId = elementId;
14
- this.inputsAst = inputsAst;
15
- this.breakpoints = breakpoints;
16
- this.rawBindings = rawBindings;
17
- this.elementFactory = elementFactory;
18
- this.elementReferences = this.getElementReferences(rawBindings.inputs);
19
- }
20
-
21
- /**
22
- * Converts flat input bindings into deep inputs object (removes `.static` wrappers).
23
- */
24
- toDeepInputs(flat) {
25
- const result = {};
26
-
27
- // Assigns a value to a nested path within the result object, creating arrays/objects as needed.
28
- const assignValue = (path, value) => {
29
- let current = result;
30
- for (let i = 0; i < path.length - 1; i++) {
31
- const key = path[i];
32
- const nextKey = path[i + 1];
33
- const isNextIndex = typeof nextKey === "number";
34
- if (typeof key === "number") {
35
- if (!Array.isArray(current)) {
36
- throw new Error("Expected array in path assignment.");
37
- }
38
- while (current.length <= key) {
39
- current.push(isNextIndex ? [] : {});
40
- }
41
- if (typeof current[key] !== "object") {
42
- current[key] = isNextIndex ? [] : {};
43
- }
44
- current = current[key];
45
- } else {
46
- if (!(key in current) || typeof current[key] !== "object") {
47
- current[key] = isNextIndex ? [] : {};
48
- }
49
- current = current[key];
50
- }
51
- }
52
- current[path[path.length - 1]] = value;
53
- };
54
-
55
- // Recursively walks the AST and assigns values from flat bindings to the nested result.
56
- const walk = (nodes, prefix) => {
57
- for (const node of nodes) {
58
- const pathParts = [...prefix, node.name];
59
- const flatKey = pathParts.join("/");
60
- const entry = flat[flatKey];
61
- const staticValue = entry?.static;
62
- if (node.children.length > 0) {
63
- if (node.list) {
64
- const pattern = new RegExp(`^${flatKey}\\/(\\d+)\\/`);
65
- const indexes = Object.keys(flat).reduce((acc, key) => {
66
- const match = key.match(pattern);
67
- if (match) {
68
- acc.push(parseInt(match[1], 10));
69
- }
70
- return acc;
71
- }, []);
72
- const uniqueIndexes = Array.from(new Set(indexes)).sort((a, b) => a - b);
73
- for (const i of uniqueIndexes) {
74
- walk(node.children, [...prefix, `${node.name}/${i}`]);
75
- }
76
- } else {
77
- walk(node.children, pathParts);
78
- }
79
- } else if (staticValue !== undefined) {
80
- const path = pathParts.reduce((acc, part) => {
81
- const match = part.match(/(.*?)\/(\d+)/);
82
- if (match) {
83
- acc.push(match[1], Number(match[2]));
84
- } else {
85
- acc.push(part);
86
- }
87
- return acc;
88
- }, []);
89
- assignValue(path, staticValue);
90
- }
91
- }
92
- };
93
- walk(this.inputsAst, []);
94
- return result;
95
- }
96
-
97
- /**
98
- * Flattens deep inputs object into flat bindings with `.static` wrappers,
99
- * skipping overrides that match inherited parent breakpoint values.
100
- */
101
- createUpdate(inputs, breakpoint) {
102
- const operations = [];
103
- const originalInputs = this.rawBindings.inputs ?? {};
104
- const rebuilt = {
105
- inputs: {},
106
- overrides: {}
107
- };
108
-
109
- // Clone existing overrides if present, to avoid losing breakpoint overrides
110
- if (this.rawBindings.overrides) {
111
- for (const [bp, overrides] of Object.entries(this.rawBindings.overrides)) {
112
- if (overrides.inputs) {
113
- set(rebuilt, `overrides.${bp}.inputs`, structuredClone(this.rawBindings.overrides[bp].inputs));
114
- }
115
- }
7
+ class InputsBindingsProcessor {
8
+ constructor(elementId, inputsAst, breakpoints, rawBindings, elementFactory){
9
+ this.elementId = elementId;
10
+ this.inputsAst = inputsAst;
11
+ this.breakpoints = breakpoints;
12
+ this.rawBindings = rawBindings;
13
+ this.elementFactory = elementFactory;
14
+ this.elementReferences = this.getElementReferences(rawBindings.inputs);
116
15
  }
117
-
118
- // Set to track which flat binding paths we've processed during traversal
119
- const seenPaths = new Set();
120
- const valueResolver = new InheritedValueResolver(this.breakpoints, bp => {
121
- if (this.isBaseBreakpoint(bp)) {
122
- return this.rawBindings.inputs;
123
- }
124
- return this.rawBindings.overrides?.[bp]?.inputs;
125
- });
126
-
127
- // Extracts a nested value from an object based on a flat string path.
128
- // Supports array indexes like 'rows/0/columns/1/children'.
129
- const getValue = (obj, path) => {
130
- const segments = path.split("/");
131
- const keys = segments.flatMap(segment => {
132
- return segment.split(".").map(part => {
133
- return /^\d+$/.test(part) ? parseInt(part, 10) : part;
134
- });
135
- });
136
- return keys.reduce((acc, key) => acc ? acc[key] : undefined, obj);
137
- };
138
-
139
- // Recursively traverses the AST nodes, comparing new input values with original bindings.
140
- // Collects changed values into 'rebuilt' and generates operations for new elements.
141
- const compareAndCollect = (nodes, prefix) => {
142
- for (const node of nodes) {
143
- const pathParts = [...prefix, node.name];
144
- const flatKey = pathParts.join("/");
145
-
146
- // Mark this path as seen
147
- seenPaths.add(flatKey);
148
- if (node.children.length) {
149
- if (node.list) {
150
- // For list nodes, process each indexed item separately
151
- const list = getValue(inputs, flatKey);
152
- if (Array.isArray(list)) {
153
- for (let i = 0; i < list.length; i++) {
154
- // Recurse with indexed path like 'rows[0]', 'rows[1]'
155
- compareAndCollect(node.children, [...pathParts.slice(0, -1), `${node.name}/${i}`]);
156
- }
157
- }
158
- } else {
159
- // For single object nodes, recurse normally
160
- compareAndCollect(node.children, pathParts);
161
- }
162
- } else {
163
- // Leaf node (primitive or slot) processing
164
-
165
- // Get current new value from deep inputs
166
- const newValue = getValue(inputs, flatKey);
167
-
168
- // Get original binding entry for this path
169
- const originalEntry = originalInputs[flatKey];
170
-
171
- // Skip if newValue is undefined and no original entry
172
- if (newValue === undefined && !originalEntry) {
173
- continue;
174
- }
175
- if (typeof newValue === "object" && newValue?.action === "CreateElement") {
176
- // Handle CreateElement action by generating element and operations
177
- const newElement = this.elementFactory.createElementFromComponent({
178
- componentName: newValue.params.component,
179
- parentId: this.elementId,
180
- slot: flatKey,
181
- index: -1,
182
- bindings: newValue.params
183
- });
184
- const createdId = newElement.element.id;
185
-
186
- // Assign or generate a stable unique id for the binding
187
- const existingId = originalEntry?.id;
188
- const idToUse = existingId ?? generateElementId();
189
-
190
- // Build binding for the new element id(s)
191
- const binding = {
192
- static: node.list ? [createdId] : createdId,
193
- type: node.type,
194
- list: node.list,
195
- id: idToUse
196
- };
197
- if (node.input?.responsive && !this.isBaseBreakpoint(breakpoint)) {
198
- const inheritedValue = valueResolver.getInheritedValue(flatKey, breakpoint);
199
- if (binding.static === undefined) {
200
- // Unset override
201
- if (rebuilt.overrides[breakpoint]?.inputs?.[flatKey]) {
202
- delete rebuilt.overrides[breakpoint].inputs[flatKey];
203
- }
204
- } else if (inheritedValue === undefined || !deepEqual(inheritedValue, binding.static)) {
205
- if (!rebuilt.overrides[breakpoint]) {
206
- rebuilt.overrides[breakpoint] = {
207
- inputs: {}
208
- };
209
- }
210
- rebuilt.overrides[breakpoint].inputs[flatKey] = binding;
211
- } else {
212
- if (rebuilt.overrides[breakpoint]?.inputs?.[flatKey]) {
213
- delete rebuilt.overrides[breakpoint].inputs[flatKey];
16
+ toDeepInputs(flat) {
17
+ const result = {};
18
+ const assignValue = (path, value)=>{
19
+ let current = result;
20
+ for(let i = 0; i < path.length - 1; i++){
21
+ const key = path[i];
22
+ const nextKey = path[i + 1];
23
+ const isNextIndex = "number" == typeof nextKey;
24
+ if ("number" == typeof key) {
25
+ if (!Array.isArray(current)) throw new Error("Expected array in path assignment.");
26
+ while(current.length <= key)current.push(isNextIndex ? [] : {});
27
+ if ("object" != typeof current[key]) current[key] = isNextIndex ? [] : {};
28
+ current = current[key];
29
+ } else {
30
+ if (!(key in current) || "object" != typeof current[key]) current[key] = isNextIndex ? [] : {};
31
+ current = current[key];
214
32
  }
215
- }
216
- if (originalEntry) {
217
- rebuilt.inputs[flatKey] = originalEntry;
218
- }
219
- } else {
220
- // Normal case: update base inputs
221
- rebuilt.inputs[flatKey] = binding;
222
33
  }
223
-
224
- // Add generated operations for this element creation
225
- operations.push(...newElement.operations);
226
- } else {
227
- // Normal value update
228
- const isResponsive = node.input?.responsive && !this.isBaseBreakpoint(breakpoint);
229
-
230
- // Assign or generate a stable unique id for the binding
231
- const existingId = originalEntry?.id;
232
- const idToUse = existingId ?? generateElementId();
233
-
234
- // Merge existing original entry data with updated static value
235
- const binding = {
236
- ...(originalEntry ?? {}),
237
- static: newValue,
238
- type: node.type,
239
- list: node.list,
240
- id: idToUse
241
- };
242
- if (isResponsive) {
243
- const inheritedValue = valueResolver.getInheritedValue(flatKey, breakpoint);
244
- if (binding.static === undefined) {
245
- // Unset override
246
- if (rebuilt.overrides[breakpoint]?.inputs?.[flatKey]) {
247
- delete rebuilt.overrides[breakpoint].inputs[flatKey];
248
- }
249
- } else if (inheritedValue === undefined || !deepEqual(inheritedValue, binding.static)) {
250
- if (!rebuilt.overrides[breakpoint]) {
251
- rebuilt.overrides[breakpoint] = {
252
- inputs: {}
253
- };
34
+ current[path[path.length - 1]] = value;
35
+ };
36
+ const walk = (nodes, prefix)=>{
37
+ for (const node of nodes){
38
+ const pathParts = [
39
+ ...prefix,
40
+ node.name
41
+ ];
42
+ const flatKey = pathParts.join("/");
43
+ const entry = flat[flatKey];
44
+ const staticValue = entry?.static;
45
+ if (node.children.length > 0) if (node.list) {
46
+ const pattern = new RegExp(`^${flatKey}\\/(\\d+)\\/`);
47
+ const indexes = Object.keys(flat).reduce((acc, key)=>{
48
+ const match = key.match(pattern);
49
+ if (match) acc.push(parseInt(match[1], 10));
50
+ return acc;
51
+ }, []);
52
+ const uniqueIndexes = Array.from(new Set(indexes)).sort((a, b)=>a - b);
53
+ for (const i of uniqueIndexes)walk(node.children, [
54
+ ...prefix,
55
+ `${node.name}/${i}`
56
+ ]);
57
+ } else walk(node.children, pathParts);
58
+ else if (void 0 !== staticValue) {
59
+ const path = pathParts.reduce((acc, part)=>{
60
+ const match = part.match(/(.*?)\/(\d+)/);
61
+ if (match) acc.push(match[1], Number(match[2]));
62
+ else acc.push(part);
63
+ return acc;
64
+ }, []);
65
+ assignValue(path, staticValue);
254
66
  }
255
- rebuilt.overrides[breakpoint].inputs[flatKey] = binding;
256
- } else {
257
- if (rebuilt.overrides[breakpoint]?.inputs?.[flatKey]) {
258
- delete rebuilt.overrides[breakpoint].inputs[flatKey];
259
- }
260
- }
261
- if (originalEntry) {
262
- rebuilt.inputs[flatKey] = originalEntry;
263
- }
264
- } else {
265
- // Base binding update
266
- rebuilt.inputs[flatKey] = binding;
267
67
  }
268
- }
68
+ };
69
+ walk(this.inputsAst, []);
70
+ return result;
71
+ }
72
+ createUpdate(inputs, breakpoint) {
73
+ const operations = [];
74
+ const originalInputs = this.rawBindings.inputs ?? {};
75
+ const rebuilt = {
76
+ inputs: {},
77
+ overrides: {}
78
+ };
79
+ if (this.rawBindings.overrides) {
80
+ for (const [bp, overrides] of Object.entries(this.rawBindings.overrides))if (overrides.inputs) set(rebuilt, `overrides.${bp}.inputs`, structuredClone(this.rawBindings.overrides[bp].inputs));
269
81
  }
270
- }
271
- };
272
-
273
- // Start the AST traversal and collection.
274
- compareAndCollect(this.inputsAst, []);
275
-
276
- // Identify elements referenced in slots that were removed since last state,
277
- // and queue their removal.
278
- const usedSlotIds = this.getElementReferences(rebuilt.inputs);
279
- for (const id of this.elementReferences) {
280
- if (!usedSlotIds.has(id)) {
281
- operations.push(new DocumentOperations.RemoveElement(id));
282
- }
82
+ const seenPaths = new Set();
83
+ const valueResolver = new InheritedValueResolver(this.breakpoints, (bp)=>{
84
+ if (this.isBaseBreakpoint(bp)) return this.rawBindings.inputs;
85
+ return this.rawBindings.overrides?.[bp]?.inputs;
86
+ });
87
+ const getValue = (obj, path)=>{
88
+ const segments = path.split("/");
89
+ const keys = segments.flatMap((segment)=>segment.split(".").map((part)=>/^\d+$/.test(part) ? parseInt(part, 10) : part));
90
+ return keys.reduce((acc, key)=>acc ? acc[key] : void 0, obj);
91
+ };
92
+ const compareAndCollect = (nodes, prefix)=>{
93
+ for (const node of nodes){
94
+ const pathParts = [
95
+ ...prefix,
96
+ node.name
97
+ ];
98
+ const flatKey = pathParts.join("/");
99
+ seenPaths.add(flatKey);
100
+ if (node.children.length) if (node.list) {
101
+ const list = getValue(inputs, flatKey);
102
+ if (Array.isArray(list)) for(let i = 0; i < list.length; i++)compareAndCollect(node.children, [
103
+ ...pathParts.slice(0, -1),
104
+ `${node.name}/${i}`
105
+ ]);
106
+ } else compareAndCollect(node.children, pathParts);
107
+ else {
108
+ let newValue = getValue(inputs, flatKey);
109
+ const originalEntry = originalInputs[flatKey];
110
+ if (void 0 === newValue && !originalEntry) continue;
111
+ if (node.list && Array.isArray(newValue)) newValue = newValue.map((item)=>{
112
+ if ("object" == typeof item && null !== item && "CreateElement" === item.action) {
113
+ const newElement = this.elementFactory.createElementFromComponent({
114
+ componentName: item.params.component,
115
+ parentId: this.elementId,
116
+ slot: flatKey,
117
+ bindings: item.params
118
+ });
119
+ operations.push(...newElement.operations.filter((op)=>!(op instanceof DocumentOperations.AddToParent)));
120
+ return newElement.element.id;
121
+ }
122
+ return item;
123
+ });
124
+ if (Array.isArray(newValue) || "object" != typeof newValue || newValue?.action !== "CreateElement") {
125
+ const isResponsive = node.input?.responsive && !this.isBaseBreakpoint(breakpoint);
126
+ const existingId = originalEntry?.id;
127
+ const idToUse = existingId ?? generateElementId();
128
+ const binding = {
129
+ ...originalEntry ?? {},
130
+ static: newValue,
131
+ type: node.type,
132
+ list: node.list,
133
+ id: idToUse
134
+ };
135
+ if (isResponsive) {
136
+ const inheritedValue = valueResolver.getInheritedValue(flatKey, breakpoint);
137
+ if (void 0 === binding.static) {
138
+ if (rebuilt.overrides[breakpoint]?.inputs?.[flatKey]) delete rebuilt.overrides[breakpoint].inputs[flatKey];
139
+ } else if (void 0 !== inheritedValue && deep_equal(inheritedValue, binding.static)) {
140
+ if (rebuilt.overrides[breakpoint]?.inputs?.[flatKey]) delete rebuilt.overrides[breakpoint].inputs[flatKey];
141
+ } else {
142
+ if (!rebuilt.overrides[breakpoint]) rebuilt.overrides[breakpoint] = {
143
+ inputs: {}
144
+ };
145
+ rebuilt.overrides[breakpoint].inputs[flatKey] = binding;
146
+ }
147
+ if (originalEntry) rebuilt.inputs[flatKey] = originalEntry;
148
+ } else rebuilt.inputs[flatKey] = binding;
149
+ } else {
150
+ const newElement = this.elementFactory.createElementFromComponent({
151
+ componentName: newValue.params.component,
152
+ parentId: this.elementId,
153
+ slot: flatKey,
154
+ index: -1,
155
+ bindings: newValue.params
156
+ });
157
+ const createdId = newElement.element.id;
158
+ const existingId = originalEntry?.id;
159
+ const idToUse = existingId ?? generateElementId();
160
+ const binding = {
161
+ static: createdId,
162
+ type: node.type,
163
+ list: node.list,
164
+ id: idToUse
165
+ };
166
+ if (node.input?.responsive && !this.isBaseBreakpoint(breakpoint)) {
167
+ const inheritedValue = valueResolver.getInheritedValue(flatKey, breakpoint);
168
+ if (void 0 === binding.static) {
169
+ if (rebuilt.overrides[breakpoint]?.inputs?.[flatKey]) delete rebuilt.overrides[breakpoint].inputs[flatKey];
170
+ } else if (void 0 !== inheritedValue && deep_equal(inheritedValue, binding.static)) {
171
+ if (rebuilt.overrides[breakpoint]?.inputs?.[flatKey]) delete rebuilt.overrides[breakpoint].inputs[flatKey];
172
+ } else {
173
+ if (!rebuilt.overrides[breakpoint]) rebuilt.overrides[breakpoint] = {
174
+ inputs: {}
175
+ };
176
+ rebuilt.overrides[breakpoint].inputs[flatKey] = binding;
177
+ }
178
+ if (originalEntry) rebuilt.inputs[flatKey] = originalEntry;
179
+ } else rebuilt.inputs[flatKey] = binding;
180
+ operations.push(...newElement.operations.filter((op)=>!(op instanceof DocumentOperations.AddToParent)));
181
+ }
182
+ }
183
+ }
184
+ };
185
+ compareAndCollect(this.inputsAst, []);
186
+ const usedSlotIds = this.getElementReferences(rebuilt.inputs);
187
+ for (const id of this.elementReferences)if (!usedSlotIds.has(id)) operations.push(new DocumentOperations.RemoveElement(id));
188
+ return new InputsUpdater(this.elementId, rebuilt, operations);
283
189
  }
284
- return new InputsUpdater(this.elementId, rebuilt, operations);
285
- }
286
-
287
- // Returns a set of element IDs referenced in slot bindings within the provided inputs.
288
- getElementReferences(inputs = {}) {
289
- const references = new Set();
290
- for (const [, binding] of Object.entries(inputs)) {
291
- if (binding.type === "slot") {
292
- if (Array.isArray(binding.static)) {
293
- (binding.static ?? []).forEach(id => references.add(id));
294
- } else if (typeof binding.static === "string") {
295
- references.add(binding.static);
190
+ getElementReferences(inputs = {}) {
191
+ const references = new Set();
192
+ for (const [, binding] of Object.entries(inputs))if ("slot" === binding.type) {
193
+ if (Array.isArray(binding.static)) (binding.static ?? []).forEach((id)=>references.add(id));
194
+ else if ("string" == typeof binding.static) references.add(binding.static);
296
195
  }
297
- }
196
+ return references;
197
+ }
198
+ isBaseBreakpoint(name) {
199
+ return 0 === this.breakpoints.indexOf(name);
298
200
  }
299
- return references;
300
- }
301
- isBaseBreakpoint(name) {
302
- return this.breakpoints.indexOf(name) === 0;
303
- }
304
201
  }
202
+ export { InputsBindingsProcessor };
305
203
 
306
204
  //# sourceMappingURL=InputBindingsProcessor.js.map
@@ -1 +1 @@
1
- {"version":3,"names":["deepEqual","set","InheritedValueResolver","DocumentOperations","InputsUpdater","generateElementId","InputsBindingsProcessor","constructor","elementId","inputsAst","breakpoints","rawBindings","elementFactory","elementReferences","getElementReferences","inputs","toDeepInputs","flat","result","assignValue","path","value","current","i","length","key","nextKey","isNextIndex","Array","isArray","Error","push","walk","nodes","prefix","node","pathParts","name","flatKey","join","entry","staticValue","static","children","list","pattern","RegExp","indexes","Object","keys","reduce","acc","match","parseInt","uniqueIndexes","from","Set","sort","a","b","undefined","part","Number","createUpdate","breakpoint","operations","originalInputs","rebuilt","overrides","bp","entries","structuredClone","seenPaths","valueResolver","isBaseBreakpoint","getValue","obj","segments","split","flatMap","segment","map","test","compareAndCollect","add","slice","newValue","originalEntry","action","newElement","createElementFromComponent","componentName","params","component","parentId","slot","index","bindings","createdId","element","id","existingId","idToUse","binding","type","input","responsive","inheritedValue","getInheritedValue","isResponsive","usedSlotIds","has","RemoveElement","references","forEach","indexOf"],"sources":["InputBindingsProcessor.ts"],"sourcesContent":["import deepEqual from \"deep-equal\";\nimport set from \"lodash/set.js\";\nimport type { DocumentElementBindings, DocumentElementInputBindings } from \"~/types.js\";\nimport { InheritedValueResolver } from \"~/InheritedValueResolver.js\";\nimport type { InputAstNode } from \"~/ComponentManifestToAstConverter.js\";\nimport { DocumentOperations, type IDocumentOperation } from \"~/documentOperations/index.js\";\nimport type { ElementFactory } from \"~/ElementFactory.js\";\nimport { InputsUpdater } from \"~/InputsUpdater.js\";\nimport { generateElementId } from \"./generateElementId.js\";\ntype DeepBindings = Record<string, any>;\n\nexport type ElementInputsBindings = {\n inputs: DocumentElementInputBindings;\n overrides: {\n [breakpoint: string]: {\n inputs: DocumentElementInputBindings;\n };\n };\n};\n\n/**\n * Handles deep-to-flat and flat-to-deep conversion of input bindings,\n * with breakpoint inheritance awareness.\n */\nexport class InputsBindingsProcessor {\n private breakpoints: string[];\n private rawBindings: DocumentElementBindings;\n private elementFactory: ElementFactory;\n private elementId: string;\n private inputsAst: InputAstNode[];\n private elementReferences: Set<string>;\n\n constructor(\n elementId: string,\n inputsAst: InputAstNode[],\n breakpoints: string[],\n rawBindings: DocumentElementBindings,\n elementFactory: ElementFactory\n ) {\n this.elementId = elementId;\n this.inputsAst = inputsAst;\n this.breakpoints = breakpoints;\n this.rawBindings = rawBindings;\n this.elementFactory = elementFactory;\n this.elementReferences = this.getElementReferences(rawBindings.inputs);\n }\n\n /**\n * Converts flat input bindings into deep inputs object (removes `.static` wrappers).\n */\n public toDeepInputs(flat: NonNullable<DocumentElementBindings[\"inputs\"]>): DeepBindings {\n const result: DeepBindings = {};\n\n // Assigns a value to a nested path within the result object, creating arrays/objects as needed.\n const assignValue = (path: (string | number)[], value: any) => {\n let current = result;\n for (let i = 0; i < path.length - 1; i++) {\n const key = path[i];\n const nextKey = path[i + 1];\n const isNextIndex = typeof nextKey === \"number\";\n\n if (typeof key === \"number\") {\n if (!Array.isArray(current)) {\n throw new Error(\"Expected array in path assignment.\");\n }\n while (current.length <= key) {\n current.push(isNextIndex ? [] : {});\n }\n if (typeof current[key] !== \"object\") {\n current[key] = isNextIndex ? [] : {};\n }\n current = current[key];\n } else {\n if (!(key in current) || typeof current[key] !== \"object\") {\n current[key] = isNextIndex ? [] : {};\n }\n current = current[key];\n }\n }\n current[path[path.length - 1]] = value;\n };\n\n // Recursively walks the AST and assigns values from flat bindings to the nested result.\n const walk = (nodes: InputAstNode[], prefix: string[]) => {\n for (const node of nodes) {\n const pathParts = [...prefix, node.name];\n const flatKey = pathParts.join(\"/\");\n const entry = flat[flatKey];\n const staticValue = entry?.static;\n\n if (node.children.length > 0) {\n if (node.list) {\n const pattern = new RegExp(`^${flatKey}\\\\/(\\\\d+)\\\\/`);\n const indexes = Object.keys(flat).reduce((acc: number[], key) => {\n const match = key.match(pattern);\n if (match) {\n acc.push(parseInt(match[1], 10));\n }\n return acc;\n }, []);\n\n const uniqueIndexes = Array.from(new Set(indexes)).sort((a, b) => a - b);\n\n for (const i of uniqueIndexes) {\n walk(node.children, [...prefix, `${node.name}/${i}`]);\n }\n } else {\n walk(node.children, pathParts);\n }\n } else if (staticValue !== undefined) {\n const path = pathParts.reduce<(string | number)[]>((acc, part) => {\n const match = part.match(/(.*?)\\/(\\d+)/);\n if (match) {\n acc.push(match[1], Number(match[2]));\n } else {\n acc.push(part);\n }\n return acc;\n }, []);\n assignValue(path, staticValue);\n }\n }\n };\n\n walk(this.inputsAst, []);\n return result;\n }\n\n /**\n * Flattens deep inputs object into flat bindings with `.static` wrappers,\n * skipping overrides that match inherited parent breakpoint values.\n */\n public createUpdate(inputs: DeepBindings, breakpoint: string) {\n const operations: IDocumentOperation[] = [];\n const originalInputs = this.rawBindings.inputs ?? {};\n\n const rebuilt: ElementInputsBindings = { inputs: {}, overrides: {} };\n\n // Clone existing overrides if present, to avoid losing breakpoint overrides\n if (this.rawBindings.overrides) {\n for (const [bp, overrides] of Object.entries(this.rawBindings.overrides)) {\n if (overrides.inputs) {\n set(\n rebuilt,\n `overrides.${bp}.inputs`,\n structuredClone(this.rawBindings.overrides[bp].inputs)\n );\n }\n }\n }\n\n // Set to track which flat binding paths we've processed during traversal\n const seenPaths = new Set<string>();\n const valueResolver = new InheritedValueResolver(this.breakpoints, bp => {\n if (this.isBaseBreakpoint(bp)) {\n return this.rawBindings.inputs;\n }\n return this.rawBindings.overrides?.[bp]?.inputs;\n });\n\n // Extracts a nested value from an object based on a flat string path.\n // Supports array indexes like 'rows/0/columns/1/children'.\n const getValue = (obj: any, path: string): any => {\n const segments = path.split(\"/\");\n const keys = segments.flatMap(segment => {\n return segment.split(\".\").map(part => {\n return /^\\d+$/.test(part) ? parseInt(part, 10) : part;\n });\n });\n return keys.reduce((acc, key) => (acc ? acc[key] : undefined), obj);\n };\n\n // Recursively traverses the AST nodes, comparing new input values with original bindings.\n // Collects changed values into 'rebuilt' and generates operations for new elements.\n const compareAndCollect = (nodes: InputAstNode[], prefix: string[]) => {\n for (const node of nodes) {\n const pathParts = [...prefix, node.name];\n const flatKey = pathParts.join(\"/\");\n\n // Mark this path as seen\n seenPaths.add(flatKey);\n\n if (node.children.length) {\n if (node.list) {\n // For list nodes, process each indexed item separately\n const list = getValue(inputs, flatKey);\n if (Array.isArray(list)) {\n for (let i = 0; i < list.length; i++) {\n // Recurse with indexed path like 'rows[0]', 'rows[1]'\n compareAndCollect(node.children, [\n ...pathParts.slice(0, -1),\n `${node.name}/${i}`\n ]);\n }\n }\n } else {\n // For single object nodes, recurse normally\n compareAndCollect(node.children, pathParts);\n }\n } else {\n // Leaf node (primitive or slot) processing\n\n // Get current new value from deep inputs\n const newValue = getValue(inputs, flatKey);\n\n // Get original binding entry for this path\n const originalEntry = originalInputs[flatKey];\n\n // Skip if newValue is undefined and no original entry\n if (newValue === undefined && !originalEntry) {\n continue;\n }\n\n if (typeof newValue === \"object\" && newValue?.action === \"CreateElement\") {\n // Handle CreateElement action by generating element and operations\n const newElement = this.elementFactory.createElementFromComponent({\n componentName: newValue.params.component,\n parentId: this.elementId,\n slot: flatKey,\n index: -1,\n bindings: newValue.params\n });\n\n const createdId = newElement.element.id;\n\n // Assign or generate a stable unique id for the binding\n const existingId = originalEntry?.id;\n const idToUse = existingId ?? generateElementId();\n\n // Build binding for the new element id(s)\n const binding = {\n static: node.list ? [createdId] : createdId,\n type: node.type,\n list: node.list,\n id: idToUse\n };\n\n if (node.input?.responsive && !this.isBaseBreakpoint(breakpoint)) {\n const inheritedValue = valueResolver.getInheritedValue(\n flatKey,\n breakpoint\n );\n\n if (binding.static === undefined) {\n // Unset override\n if (rebuilt.overrides[breakpoint]?.inputs?.[flatKey]) {\n delete rebuilt.overrides[breakpoint].inputs[flatKey];\n }\n } else if (\n inheritedValue === undefined ||\n !deepEqual(inheritedValue, binding.static)\n ) {\n if (!rebuilt.overrides[breakpoint]) {\n rebuilt.overrides[breakpoint] = { inputs: {} };\n }\n rebuilt.overrides[breakpoint].inputs[flatKey] = binding;\n } else {\n if (rebuilt.overrides[breakpoint]?.inputs?.[flatKey]) {\n delete rebuilt.overrides[breakpoint].inputs[flatKey];\n }\n }\n\n if (originalEntry) {\n rebuilt.inputs[flatKey] = originalEntry;\n }\n } else {\n // Normal case: update base inputs\n rebuilt.inputs[flatKey] = binding;\n }\n\n // Add generated operations for this element creation\n operations.push(...newElement.operations);\n } else {\n // Normal value update\n const isResponsive =\n node.input?.responsive && !this.isBaseBreakpoint(breakpoint);\n\n // Assign or generate a stable unique id for the binding\n const existingId = originalEntry?.id;\n const idToUse = existingId ?? generateElementId();\n\n // Merge existing original entry data with updated static value\n const binding = {\n ...(originalEntry ?? {}),\n static: newValue,\n type: node.type,\n list: node.list,\n id: idToUse\n };\n\n if (isResponsive) {\n const inheritedValue = valueResolver.getInheritedValue(\n flatKey,\n breakpoint\n );\n\n if (binding.static === undefined) {\n // Unset override\n if (rebuilt.overrides[breakpoint]?.inputs?.[flatKey]) {\n delete rebuilt.overrides[breakpoint].inputs[flatKey];\n }\n } else if (\n inheritedValue === undefined ||\n !deepEqual(inheritedValue, binding.static)\n ) {\n if (!rebuilt.overrides[breakpoint]) {\n rebuilt.overrides[breakpoint] = { inputs: {} };\n }\n rebuilt.overrides[breakpoint].inputs[flatKey] = binding;\n } else {\n if (rebuilt.overrides[breakpoint]?.inputs?.[flatKey]) {\n delete rebuilt.overrides[breakpoint].inputs[flatKey];\n }\n }\n\n if (originalEntry) {\n rebuilt.inputs[flatKey] = originalEntry;\n }\n } else {\n // Base binding update\n rebuilt.inputs[flatKey] = binding;\n }\n }\n }\n }\n };\n\n // Start the AST traversal and collection.\n compareAndCollect(this.inputsAst, []);\n\n // Identify elements referenced in slots that were removed since last state,\n // and queue their removal.\n const usedSlotIds = this.getElementReferences(rebuilt.inputs);\n for (const id of this.elementReferences) {\n if (!usedSlotIds.has(id)) {\n operations.push(new DocumentOperations.RemoveElement(id));\n }\n }\n\n return new InputsUpdater(this.elementId, rebuilt, operations);\n }\n\n // Returns a set of element IDs referenced in slot bindings within the provided inputs.\n private getElementReferences(inputs: DocumentElementBindings[\"inputs\"] = {}) {\n const references = new Set<string>();\n\n for (const [, binding] of Object.entries(inputs)) {\n if (binding.type === \"slot\") {\n if (Array.isArray(binding.static)) {\n ((binding.static ?? []) as string[]).forEach(id => references.add(id));\n } else if (typeof binding.static === \"string\") {\n references.add(binding.static);\n }\n }\n }\n\n return references;\n }\n\n private isBaseBreakpoint(name: string): boolean {\n return this.breakpoints.indexOf(name) === 0;\n }\n}\n"],"mappings":"AAAA,OAAOA,SAAS,MAAM,YAAY;AAClC,OAAOC,GAAG,MAAM,eAAe;AAE/B,SAASC,sBAAsB;AAE/B,SAASC,kBAAkB;AAE3B,SAASC,aAAa;AACtB,SAASC,iBAAiB;AAY1B;AACA;AACA;AACA;AACA,OAAO,MAAMC,uBAAuB,CAAC;EAQjCC,WAAWA,CACPC,SAAiB,EACjBC,SAAyB,EACzBC,WAAqB,EACrBC,WAAoC,EACpCC,cAA8B,EAChC;IACE,IAAI,CAACJ,SAAS,GAAGA,SAAS;IAC1B,IAAI,CAACC,SAAS,GAAGA,SAAS;IAC1B,IAAI,CAACC,WAAW,GAAGA,WAAW;IAC9B,IAAI,CAACC,WAAW,GAAGA,WAAW;IAC9B,IAAI,CAACC,cAAc,GAAGA,cAAc;IACpC,IAAI,CAACC,iBAAiB,GAAG,IAAI,CAACC,oBAAoB,CAACH,WAAW,CAACI,MAAM,CAAC;EAC1E;;EAEA;AACJ;AACA;EACWC,YAAYA,CAACC,IAAoD,EAAgB;IACpF,MAAMC,MAAoB,GAAG,CAAC,CAAC;;IAE/B;IACA,MAAMC,WAAW,GAAGA,CAACC,IAAyB,EAAEC,KAAU,KAAK;MAC3D,IAAIC,OAAO,GAAGJ,MAAM;MACpB,KAAK,IAAIK,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGH,IAAI,CAACI,MAAM,GAAG,CAAC,EAAED,CAAC,EAAE,EAAE;QACtC,MAAME,GAAG,GAAGL,IAAI,CAACG,CAAC,CAAC;QACnB,MAAMG,OAAO,GAAGN,IAAI,CAACG,CAAC,GAAG,CAAC,CAAC;QAC3B,MAAMI,WAAW,GAAG,OAAOD,OAAO,KAAK,QAAQ;QAE/C,IAAI,OAAOD,GAAG,KAAK,QAAQ,EAAE;UACzB,IAAI,CAACG,KAAK,CAACC,OAAO,CAACP,OAAO,CAAC,EAAE;YACzB,MAAM,IAAIQ,KAAK,CAAC,oCAAoC,CAAC;UACzD;UACA,OAAOR,OAAO,CAACE,MAAM,IAAIC,GAAG,EAAE;YAC1BH,OAAO,CAACS,IAAI,CAACJ,WAAW,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;UACvC;UACA,IAAI,OAAOL,OAAO,CAACG,GAAG,CAAC,KAAK,QAAQ,EAAE;YAClCH,OAAO,CAACG,GAAG,CAAC,GAAGE,WAAW,GAAG,EAAE,GAAG,CAAC,CAAC;UACxC;UACAL,OAAO,GAAGA,OAAO,CAACG,GAAG,CAAC;QAC1B,CAAC,MAAM;UACH,IAAI,EAAEA,GAAG,IAAIH,OAAO,CAAC,IAAI,OAAOA,OAAO,CAACG,GAAG,CAAC,KAAK,QAAQ,EAAE;YACvDH,OAAO,CAACG,GAAG,CAAC,GAAGE,WAAW,GAAG,EAAE,GAAG,CAAC,CAAC;UACxC;UACAL,OAAO,GAAGA,OAAO,CAACG,GAAG,CAAC;QAC1B;MACJ;MACAH,OAAO,CAACF,IAAI,CAACA,IAAI,CAACI,MAAM,GAAG,CAAC,CAAC,CAAC,GAAGH,KAAK;IAC1C,CAAC;;IAED;IACA,MAAMW,IAAI,GAAGA,CAACC,KAAqB,EAAEC,MAAgB,KAAK;MACtD,KAAK,MAAMC,IAAI,IAAIF,KAAK,EAAE;QACtB,MAAMG,SAAS,GAAG,CAAC,GAAGF,MAAM,EAAEC,IAAI,CAACE,IAAI,CAAC;QACxC,MAAMC,OAAO,GAAGF,SAAS,CAACG,IAAI,CAAC,GAAG,CAAC;QACnC,MAAMC,KAAK,GAAGvB,IAAI,CAACqB,OAAO,CAAC;QAC3B,MAAMG,WAAW,GAAGD,KAAK,EAAEE,MAAM;QAEjC,IAAIP,IAAI,CAACQ,QAAQ,CAACnB,MAAM,GAAG,CAAC,EAAE;UAC1B,IAAIW,IAAI,CAACS,IAAI,EAAE;YACX,MAAMC,OAAO,GAAG,IAAIC,MAAM,CAAC,IAAIR,OAAO,cAAc,CAAC;YACrD,MAAMS,OAAO,GAAGC,MAAM,CAACC,IAAI,CAAChC,IAAI,CAAC,CAACiC,MAAM,CAAC,CAACC,GAAa,EAAE1B,GAAG,KAAK;cAC7D,MAAM2B,KAAK,GAAG3B,GAAG,CAAC2B,KAAK,CAACP,OAAO,CAAC;cAChC,IAAIO,KAAK,EAAE;gBACPD,GAAG,CAACpB,IAAI,CAACsB,QAAQ,CAACD,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;cACpC;cACA,OAAOD,GAAG;YACd,CAAC,EAAE,EAAE,CAAC;YAEN,MAAMG,aAAa,GAAG1B,KAAK,CAAC2B,IAAI,CAAC,IAAIC,GAAG,CAACT,OAAO,CAAC,CAAC,CAACU,IAAI,CAAC,CAACC,CAAC,EAAEC,CAAC,KAAKD,CAAC,GAAGC,CAAC,CAAC;YAExE,KAAK,MAAMpC,CAAC,IAAI+B,aAAa,EAAE;cAC3BtB,IAAI,CAACG,IAAI,CAACQ,QAAQ,EAAE,CAAC,GAAGT,MAAM,EAAE,GAAGC,IAAI,CAACE,IAAI,IAAId,CAAC,EAAE,CAAC,CAAC;YACzD;UACJ,CAAC,MAAM;YACHS,IAAI,CAACG,IAAI,CAACQ,QAAQ,EAAEP,SAAS,CAAC;UAClC;QACJ,CAAC,MAAM,IAAIK,WAAW,KAAKmB,SAAS,EAAE;UAClC,MAAMxC,IAAI,GAAGgB,SAAS,CAACc,MAAM,CAAsB,CAACC,GAAG,EAAEU,IAAI,KAAK;YAC9D,MAAMT,KAAK,GAAGS,IAAI,CAACT,KAAK,CAAC,cAAc,CAAC;YACxC,IAAIA,KAAK,EAAE;cACPD,GAAG,CAACpB,IAAI,CAACqB,KAAK,CAAC,CAAC,CAAC,EAAEU,MAAM,CAACV,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YACxC,CAAC,MAAM;cACHD,GAAG,CAACpB,IAAI,CAAC8B,IAAI,CAAC;YAClB;YACA,OAAOV,GAAG;UACd,CAAC,EAAE,EAAE,CAAC;UACNhC,WAAW,CAACC,IAAI,EAAEqB,WAAW,CAAC;QAClC;MACJ;IACJ,CAAC;IAEDT,IAAI,CAAC,IAAI,CAACvB,SAAS,EAAE,EAAE,CAAC;IACxB,OAAOS,MAAM;EACjB;;EAEA;AACJ;AACA;AACA;EACW6C,YAAYA,CAAChD,MAAoB,EAAEiD,UAAkB,EAAE;IAC1D,MAAMC,UAAgC,GAAG,EAAE;IAC3C,MAAMC,cAAc,GAAG,IAAI,CAACvD,WAAW,CAACI,MAAM,IAAI,CAAC,CAAC;IAEpD,MAAMoD,OAA8B,GAAG;MAAEpD,MAAM,EAAE,CAAC,CAAC;MAAEqD,SAAS,EAAE,CAAC;IAAE,CAAC;;IAEpE;IACA,IAAI,IAAI,CAACzD,WAAW,CAACyD,SAAS,EAAE;MAC5B,KAAK,MAAM,CAACC,EAAE,EAAED,SAAS,CAAC,IAAIpB,MAAM,CAACsB,OAAO,CAAC,IAAI,CAAC3D,WAAW,CAACyD,SAAS,CAAC,EAAE;QACtE,IAAIA,SAAS,CAACrD,MAAM,EAAE;UAClBd,GAAG,CACCkE,OAAO,EACP,aAAaE,EAAE,SAAS,EACxBE,eAAe,CAAC,IAAI,CAAC5D,WAAW,CAACyD,SAAS,CAACC,EAAE,CAAC,CAACtD,MAAM,CACzD,CAAC;QACL;MACJ;IACJ;;IAEA;IACA,MAAMyD,SAAS,GAAG,IAAIhB,GAAG,CAAS,CAAC;IACnC,MAAMiB,aAAa,GAAG,IAAIvE,sBAAsB,CAAC,IAAI,CAACQ,WAAW,EAAE2D,EAAE,IAAI;MACrE,IAAI,IAAI,CAACK,gBAAgB,CAACL,EAAE,CAAC,EAAE;QAC3B,OAAO,IAAI,CAAC1D,WAAW,CAACI,MAAM;MAClC;MACA,OAAO,IAAI,CAACJ,WAAW,CAACyD,SAAS,GAAGC,EAAE,CAAC,EAAEtD,MAAM;IACnD,CAAC,CAAC;;IAEF;IACA;IACA,MAAM4D,QAAQ,GAAGA,CAACC,GAAQ,EAAExD,IAAY,KAAU;MAC9C,MAAMyD,QAAQ,GAAGzD,IAAI,CAAC0D,KAAK,CAAC,GAAG,CAAC;MAChC,MAAM7B,IAAI,GAAG4B,QAAQ,CAACE,OAAO,CAACC,OAAO,IAAI;QACrC,OAAOA,OAAO,CAACF,KAAK,CAAC,GAAG,CAAC,CAACG,GAAG,CAACpB,IAAI,IAAI;UAClC,OAAO,OAAO,CAACqB,IAAI,CAACrB,IAAI,CAAC,GAAGR,QAAQ,CAACQ,IAAI,EAAE,EAAE,CAAC,GAAGA,IAAI;QACzD,CAAC,CAAC;MACN,CAAC,CAAC;MACF,OAAOZ,IAAI,CAACC,MAAM,CAAC,CAACC,GAAG,EAAE1B,GAAG,KAAM0B,GAAG,GAAGA,GAAG,CAAC1B,GAAG,CAAC,GAAGmC,SAAU,EAAEgB,GAAG,CAAC;IACvE,CAAC;;IAED;IACA;IACA,MAAMO,iBAAiB,GAAGA,CAAClD,KAAqB,EAAEC,MAAgB,KAAK;MACnE,KAAK,MAAMC,IAAI,IAAIF,KAAK,EAAE;QACtB,MAAMG,SAAS,GAAG,CAAC,GAAGF,MAAM,EAAEC,IAAI,CAACE,IAAI,CAAC;QACxC,MAAMC,OAAO,GAAGF,SAAS,CAACG,IAAI,CAAC,GAAG,CAAC;;QAEnC;QACAiC,SAAS,CAACY,GAAG,CAAC9C,OAAO,CAAC;QAEtB,IAAIH,IAAI,CAACQ,QAAQ,CAACnB,MAAM,EAAE;UACtB,IAAIW,IAAI,CAACS,IAAI,EAAE;YACX;YACA,MAAMA,IAAI,GAAG+B,QAAQ,CAAC5D,MAAM,EAAEuB,OAAO,CAAC;YACtC,IAAIV,KAAK,CAACC,OAAO,CAACe,IAAI,CAAC,EAAE;cACrB,KAAK,IAAIrB,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGqB,IAAI,CAACpB,MAAM,EAAED,CAAC,EAAE,EAAE;gBAClC;gBACA4D,iBAAiB,CAAChD,IAAI,CAACQ,QAAQ,EAAE,CAC7B,GAAGP,SAAS,CAACiD,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EACzB,GAAGlD,IAAI,CAACE,IAAI,IAAId,CAAC,EAAE,CACtB,CAAC;cACN;YACJ;UACJ,CAAC,MAAM;YACH;YACA4D,iBAAiB,CAAChD,IAAI,CAACQ,QAAQ,EAAEP,SAAS,CAAC;UAC/C;QACJ,CAAC,MAAM;UACH;;UAEA;UACA,MAAMkD,QAAQ,GAAGX,QAAQ,CAAC5D,MAAM,EAAEuB,OAAO,CAAC;;UAE1C;UACA,MAAMiD,aAAa,GAAGrB,cAAc,CAAC5B,OAAO,CAAC;;UAE7C;UACA,IAAIgD,QAAQ,KAAK1B,SAAS,IAAI,CAAC2B,aAAa,EAAE;YAC1C;UACJ;UAEA,IAAI,OAAOD,QAAQ,KAAK,QAAQ,IAAIA,QAAQ,EAAEE,MAAM,KAAK,eAAe,EAAE;YACtE;YACA,MAAMC,UAAU,GAAG,IAAI,CAAC7E,cAAc,CAAC8E,0BAA0B,CAAC;cAC9DC,aAAa,EAAEL,QAAQ,CAACM,MAAM,CAACC,SAAS;cACxCC,QAAQ,EAAE,IAAI,CAACtF,SAAS;cACxBuF,IAAI,EAAEzD,OAAO;cACb0D,KAAK,EAAE,CAAC,CAAC;cACTC,QAAQ,EAAEX,QAAQ,CAACM;YACvB,CAAC,CAAC;YAEF,MAAMM,SAAS,GAAGT,UAAU,CAACU,OAAO,CAACC,EAAE;;YAEvC;YACA,MAAMC,UAAU,GAAGd,aAAa,EAAEa,EAAE;YACpC,MAAME,OAAO,GAAGD,UAAU,IAAIhG,iBAAiB,CAAC,CAAC;;YAEjD;YACA,MAAMkG,OAAO,GAAG;cACZ7D,MAAM,EAAEP,IAAI,CAACS,IAAI,GAAG,CAACsD,SAAS,CAAC,GAAGA,SAAS;cAC3CM,IAAI,EAAErE,IAAI,CAACqE,IAAI;cACf5D,IAAI,EAAET,IAAI,CAACS,IAAI;cACfwD,EAAE,EAAEE;YACR,CAAC;YAED,IAAInE,IAAI,CAACsE,KAAK,EAAEC,UAAU,IAAI,CAAC,IAAI,CAAChC,gBAAgB,CAACV,UAAU,CAAC,EAAE;cAC9D,MAAM2C,cAAc,GAAGlC,aAAa,CAACmC,iBAAiB,CAClDtE,OAAO,EACP0B,UACJ,CAAC;cAED,IAAIuC,OAAO,CAAC7D,MAAM,KAAKkB,SAAS,EAAE;gBAC9B;gBACA,IAAIO,OAAO,CAACC,SAAS,CAACJ,UAAU,CAAC,EAAEjD,MAAM,GAAGuB,OAAO,CAAC,EAAE;kBAClD,OAAO6B,OAAO,CAACC,SAAS,CAACJ,UAAU,CAAC,CAACjD,MAAM,CAACuB,OAAO,CAAC;gBACxD;cACJ,CAAC,MAAM,IACHqE,cAAc,KAAK/C,SAAS,IAC5B,CAAC5D,SAAS,CAAC2G,cAAc,EAAEJ,OAAO,CAAC7D,MAAM,CAAC,EAC5C;gBACE,IAAI,CAACyB,OAAO,CAACC,SAAS,CAACJ,UAAU,CAAC,EAAE;kBAChCG,OAAO,CAACC,SAAS,CAACJ,UAAU,CAAC,GAAG;oBAAEjD,MAAM,EAAE,CAAC;kBAAE,CAAC;gBAClD;gBACAoD,OAAO,CAACC,SAAS,CAACJ,UAAU,CAAC,CAACjD,MAAM,CAACuB,OAAO,CAAC,GAAGiE,OAAO;cAC3D,CAAC,MAAM;gBACH,IAAIpC,OAAO,CAACC,SAAS,CAACJ,UAAU,CAAC,EAAEjD,MAAM,GAAGuB,OAAO,CAAC,EAAE;kBAClD,OAAO6B,OAAO,CAACC,SAAS,CAACJ,UAAU,CAAC,CAACjD,MAAM,CAACuB,OAAO,CAAC;gBACxD;cACJ;cAEA,IAAIiD,aAAa,EAAE;gBACfpB,OAAO,CAACpD,MAAM,CAACuB,OAAO,CAAC,GAAGiD,aAAa;cAC3C;YACJ,CAAC,MAAM;cACH;cACApB,OAAO,CAACpD,MAAM,CAACuB,OAAO,CAAC,GAAGiE,OAAO;YACrC;;YAEA;YACAtC,UAAU,CAAClC,IAAI,CAAC,GAAG0D,UAAU,CAACxB,UAAU,CAAC;UAC7C,CAAC,MAAM;YACH;YACA,MAAM4C,YAAY,GACd1E,IAAI,CAACsE,KAAK,EAAEC,UAAU,IAAI,CAAC,IAAI,CAAChC,gBAAgB,CAACV,UAAU,CAAC;;YAEhE;YACA,MAAMqC,UAAU,GAAGd,aAAa,EAAEa,EAAE;YACpC,MAAME,OAAO,GAAGD,UAAU,IAAIhG,iBAAiB,CAAC,CAAC;;YAEjD;YACA,MAAMkG,OAAO,GAAG;cACZ,IAAIhB,aAAa,IAAI,CAAC,CAAC,CAAC;cACxB7C,MAAM,EAAE4C,QAAQ;cAChBkB,IAAI,EAAErE,IAAI,CAACqE,IAAI;cACf5D,IAAI,EAAET,IAAI,CAACS,IAAI;cACfwD,EAAE,EAAEE;YACR,CAAC;YAED,IAAIO,YAAY,EAAE;cACd,MAAMF,cAAc,GAAGlC,aAAa,CAACmC,iBAAiB,CAClDtE,OAAO,EACP0B,UACJ,CAAC;cAED,IAAIuC,OAAO,CAAC7D,MAAM,KAAKkB,SAAS,EAAE;gBAC9B;gBACA,IAAIO,OAAO,CAACC,SAAS,CAACJ,UAAU,CAAC,EAAEjD,MAAM,GAAGuB,OAAO,CAAC,EAAE;kBAClD,OAAO6B,OAAO,CAACC,SAAS,CAACJ,UAAU,CAAC,CAACjD,MAAM,CAACuB,OAAO,CAAC;gBACxD;cACJ,CAAC,MAAM,IACHqE,cAAc,KAAK/C,SAAS,IAC5B,CAAC5D,SAAS,CAAC2G,cAAc,EAAEJ,OAAO,CAAC7D,MAAM,CAAC,EAC5C;gBACE,IAAI,CAACyB,OAAO,CAACC,SAAS,CAACJ,UAAU,CAAC,EAAE;kBAChCG,OAAO,CAACC,SAAS,CAACJ,UAAU,CAAC,GAAG;oBAAEjD,MAAM,EAAE,CAAC;kBAAE,CAAC;gBAClD;gBACAoD,OAAO,CAACC,SAAS,CAACJ,UAAU,CAAC,CAACjD,MAAM,CAACuB,OAAO,CAAC,GAAGiE,OAAO;cAC3D,CAAC,MAAM;gBACH,IAAIpC,OAAO,CAACC,SAAS,CAACJ,UAAU,CAAC,EAAEjD,MAAM,GAAGuB,OAAO,CAAC,EAAE;kBAClD,OAAO6B,OAAO,CAACC,SAAS,CAACJ,UAAU,CAAC,CAACjD,MAAM,CAACuB,OAAO,CAAC;gBACxD;cACJ;cAEA,IAAIiD,aAAa,EAAE;gBACfpB,OAAO,CAACpD,MAAM,CAACuB,OAAO,CAAC,GAAGiD,aAAa;cAC3C;YACJ,CAAC,MAAM;cACH;cACApB,OAAO,CAACpD,MAAM,CAACuB,OAAO,CAAC,GAAGiE,OAAO;YACrC;UACJ;QACJ;MACJ;IACJ,CAAC;;IAED;IACApB,iBAAiB,CAAC,IAAI,CAAC1E,SAAS,EAAE,EAAE,CAAC;;IAErC;IACA;IACA,MAAMqG,WAAW,GAAG,IAAI,CAAChG,oBAAoB,CAACqD,OAAO,CAACpD,MAAM,CAAC;IAC7D,KAAK,MAAMqF,EAAE,IAAI,IAAI,CAACvF,iBAAiB,EAAE;MACrC,IAAI,CAACiG,WAAW,CAACC,GAAG,CAACX,EAAE,CAAC,EAAE;QACtBnC,UAAU,CAAClC,IAAI,CAAC,IAAI5B,kBAAkB,CAAC6G,aAAa,CAACZ,EAAE,CAAC,CAAC;MAC7D;IACJ;IAEA,OAAO,IAAIhG,aAAa,CAAC,IAAI,CAACI,SAAS,EAAE2D,OAAO,EAAEF,UAAU,CAAC;EACjE;;EAEA;EACQnD,oBAAoBA,CAACC,MAAyC,GAAG,CAAC,CAAC,EAAE;IACzE,MAAMkG,UAAU,GAAG,IAAIzD,GAAG,CAAS,CAAC;IAEpC,KAAK,MAAM,GAAG+C,OAAO,CAAC,IAAIvD,MAAM,CAACsB,OAAO,CAACvD,MAAM,CAAC,EAAE;MAC9C,IAAIwF,OAAO,CAACC,IAAI,KAAK,MAAM,EAAE;QACzB,IAAI5E,KAAK,CAACC,OAAO,CAAC0E,OAAO,CAAC7D,MAAM,CAAC,EAAE;UAC/B,CAAE6D,OAAO,CAAC7D,MAAM,IAAI,EAAE,EAAewE,OAAO,CAACd,EAAE,IAAIa,UAAU,CAAC7B,GAAG,CAACgB,EAAE,CAAC,CAAC;QAC1E,CAAC,MAAM,IAAI,OAAOG,OAAO,CAAC7D,MAAM,KAAK,QAAQ,EAAE;UAC3CuE,UAAU,CAAC7B,GAAG,CAACmB,OAAO,CAAC7D,MAAM,CAAC;QAClC;MACJ;IACJ;IAEA,OAAOuE,UAAU;EACrB;EAEQvC,gBAAgBA,CAACrC,IAAY,EAAW;IAC5C,OAAO,IAAI,CAAC3B,WAAW,CAACyG,OAAO,CAAC9E,IAAI,CAAC,KAAK,CAAC;EAC/C;AACJ","ignoreList":[]}
1
+ {"version":3,"file":"InputBindingsProcessor.js","sources":["../src/InputBindingsProcessor.ts"],"sourcesContent":["import deepEqual from \"deep-equal\";\nimport set from \"lodash/set.js\";\nimport type { DocumentElementBindings, DocumentElementInputBindings } from \"~/types.js\";\nimport { InheritedValueResolver } from \"~/InheritedValueResolver.js\";\nimport type { InputAstNode } from \"~/ComponentManifestToAstConverter.js\";\nimport { DocumentOperations, type IDocumentOperation } from \"~/documentOperations/index.js\";\nimport type { ElementFactory } from \"~/ElementFactory.js\";\nimport { InputsUpdater } from \"~/InputsUpdater.js\";\nimport { generateElementId } from \"./generateElementId.js\";\ntype DeepBindings = Record<string, any>;\n\nexport type ElementInputsBindings = {\n inputs: DocumentElementInputBindings;\n overrides: {\n [breakpoint: string]: {\n inputs: DocumentElementInputBindings;\n };\n };\n};\n\n/**\n * Handles deep-to-flat and flat-to-deep conversion of input bindings,\n * with breakpoint inheritance awareness.\n */\nexport class InputsBindingsProcessor {\n private breakpoints: string[];\n private rawBindings: DocumentElementBindings;\n private elementFactory: ElementFactory;\n private elementId: string;\n private inputsAst: InputAstNode[];\n private elementReferences: Set<string>;\n\n constructor(\n elementId: string,\n inputsAst: InputAstNode[],\n breakpoints: string[],\n rawBindings: DocumentElementBindings,\n elementFactory: ElementFactory\n ) {\n this.elementId = elementId;\n this.inputsAst = inputsAst;\n this.breakpoints = breakpoints;\n this.rawBindings = rawBindings;\n this.elementFactory = elementFactory;\n this.elementReferences = this.getElementReferences(rawBindings.inputs);\n }\n\n /**\n * Converts flat input bindings into deep inputs object (removes `.static` wrappers).\n */\n public toDeepInputs(flat: NonNullable<DocumentElementBindings[\"inputs\"]>): DeepBindings {\n const result: DeepBindings = {};\n\n // Assigns a value to a nested path within the result object, creating arrays/objects as needed.\n const assignValue = (path: (string | number)[], value: any) => {\n let current = result;\n for (let i = 0; i < path.length - 1; i++) {\n const key = path[i];\n const nextKey = path[i + 1];\n const isNextIndex = typeof nextKey === \"number\";\n\n if (typeof key === \"number\") {\n if (!Array.isArray(current)) {\n throw new Error(\"Expected array in path assignment.\");\n }\n while (current.length <= key) {\n current.push(isNextIndex ? [] : {});\n }\n if (typeof current[key] !== \"object\") {\n current[key] = isNextIndex ? [] : {};\n }\n current = current[key];\n } else {\n if (!(key in current) || typeof current[key] !== \"object\") {\n current[key] = isNextIndex ? [] : {};\n }\n current = current[key];\n }\n }\n current[path[path.length - 1]] = value;\n };\n\n // Recursively walks the AST and assigns values from flat bindings to the nested result.\n const walk = (nodes: InputAstNode[], prefix: string[]) => {\n for (const node of nodes) {\n const pathParts = [...prefix, node.name];\n const flatKey = pathParts.join(\"/\");\n const entry = flat[flatKey];\n const staticValue = entry?.static;\n\n if (node.children.length > 0) {\n if (node.list) {\n const pattern = new RegExp(`^${flatKey}\\\\/(\\\\d+)\\\\/`);\n const indexes = Object.keys(flat).reduce((acc: number[], key) => {\n const match = key.match(pattern);\n if (match) {\n acc.push(parseInt(match[1], 10));\n }\n return acc;\n }, []);\n\n const uniqueIndexes = Array.from(new Set(indexes)).sort((a, b) => a - b);\n\n for (const i of uniqueIndexes) {\n walk(node.children, [...prefix, `${node.name}/${i}`]);\n }\n } else {\n walk(node.children, pathParts);\n }\n } else if (staticValue !== undefined) {\n const path = pathParts.reduce<(string | number)[]>((acc, part) => {\n const match = part.match(/(.*?)\\/(\\d+)/);\n if (match) {\n acc.push(match[1], Number(match[2]));\n } else {\n acc.push(part);\n }\n return acc;\n }, []);\n assignValue(path, staticValue);\n }\n }\n };\n\n walk(this.inputsAst, []);\n return result;\n }\n\n /**\n * Flattens deep inputs object into flat bindings with `.static` wrappers,\n * skipping overrides that match inherited parent breakpoint values.\n */\n public createUpdate(inputs: DeepBindings, breakpoint: string) {\n const operations: IDocumentOperation[] = [];\n const originalInputs = this.rawBindings.inputs ?? {};\n\n const rebuilt: ElementInputsBindings = { inputs: {}, overrides: {} };\n\n // Clone existing overrides if present, to avoid losing breakpoint overrides\n if (this.rawBindings.overrides) {\n for (const [bp, overrides] of Object.entries(this.rawBindings.overrides)) {\n if (overrides.inputs) {\n set(\n rebuilt,\n `overrides.${bp}.inputs`,\n structuredClone(this.rawBindings.overrides[bp].inputs)\n );\n }\n }\n }\n\n // Set to track which flat binding paths we've processed during traversal\n const seenPaths = new Set<string>();\n const valueResolver = new InheritedValueResolver(this.breakpoints, bp => {\n if (this.isBaseBreakpoint(bp)) {\n return this.rawBindings.inputs;\n }\n return this.rawBindings.overrides?.[bp]?.inputs;\n });\n\n // Extracts a nested value from an object based on a flat string path.\n // Supports array indexes like 'rows/0/columns/1/children'.\n const getValue = (obj: any, path: string): any => {\n const segments = path.split(\"/\");\n const keys = segments.flatMap(segment => {\n return segment.split(\".\").map(part => {\n return /^\\d+$/.test(part) ? parseInt(part, 10) : part;\n });\n });\n return keys.reduce((acc, key) => (acc ? acc[key] : undefined), obj);\n };\n\n // Recursively traverses the AST nodes, comparing new input values with original bindings.\n // Collects changed values into 'rebuilt' and generates operations for new elements.\n const compareAndCollect = (nodes: InputAstNode[], prefix: string[]) => {\n for (const node of nodes) {\n const pathParts = [...prefix, node.name];\n const flatKey = pathParts.join(\"/\");\n\n // Mark this path as seen\n seenPaths.add(flatKey);\n\n if (node.children.length) {\n if (node.list) {\n // For list nodes, process each indexed item separately\n const list = getValue(inputs, flatKey);\n if (Array.isArray(list)) {\n for (let i = 0; i < list.length; i++) {\n // Recurse with indexed path like 'rows[0]', 'rows[1]'\n compareAndCollect(node.children, [\n ...pathParts.slice(0, -1),\n `${node.name}/${i}`\n ]);\n }\n }\n } else {\n // For single object nodes, recurse normally\n compareAndCollect(node.children, pathParts);\n }\n } else {\n // Leaf node (primitive or slot) processing\n\n // Get current new value from deep inputs\n let newValue = getValue(inputs, flatKey);\n\n // Get original binding entry for this path\n const originalEntry = originalInputs[flatKey];\n\n // Skip if newValue is undefined and no original entry\n if (newValue === undefined && !originalEntry) {\n continue;\n }\n\n // For list slots, process CreateElement items within the array.\n if (node.list && Array.isArray(newValue)) {\n newValue = newValue.map(item => {\n if (\n typeof item === \"object\" &&\n item !== null &&\n item.action === \"CreateElement\"\n ) {\n const newElement = this.elementFactory.createElementFromComponent({\n componentName: item.params.component,\n parentId: this.elementId,\n slot: flatKey,\n bindings: item.params\n });\n // Skip AddToParent — this processor manages the binding array.\n operations.push(\n ...newElement.operations.filter(\n op => !(op instanceof DocumentOperations.AddToParent)\n )\n );\n return newElement.element.id;\n }\n return item;\n });\n }\n\n if (\n !Array.isArray(newValue) &&\n typeof newValue === \"object\" &&\n newValue?.action === \"CreateElement\"\n ) {\n // Handle single (non-list) CreateElement action\n const newElement = this.elementFactory.createElementFromComponent({\n componentName: newValue.params.component,\n parentId: this.elementId,\n slot: flatKey,\n index: -1,\n bindings: newValue.params\n });\n\n const createdId = newElement.element.id;\n\n // Assign or generate a stable unique id for the binding\n const existingId = originalEntry?.id;\n const idToUse = existingId ?? generateElementId();\n\n // Build binding for the new element id(s)\n const binding = {\n static: createdId,\n type: node.type,\n list: node.list,\n id: idToUse\n };\n\n if (node.input?.responsive && !this.isBaseBreakpoint(breakpoint)) {\n const inheritedValue = valueResolver.getInheritedValue(\n flatKey,\n breakpoint\n );\n\n if (binding.static === undefined) {\n // Unset override\n if (rebuilt.overrides[breakpoint]?.inputs?.[flatKey]) {\n delete rebuilt.overrides[breakpoint].inputs[flatKey];\n }\n } else if (\n inheritedValue === undefined ||\n !deepEqual(inheritedValue, binding.static)\n ) {\n if (!rebuilt.overrides[breakpoint]) {\n rebuilt.overrides[breakpoint] = { inputs: {} };\n }\n rebuilt.overrides[breakpoint].inputs[flatKey] = binding;\n } else {\n if (rebuilt.overrides[breakpoint]?.inputs?.[flatKey]) {\n delete rebuilt.overrides[breakpoint].inputs[flatKey];\n }\n }\n\n if (originalEntry) {\n rebuilt.inputs[flatKey] = originalEntry;\n }\n } else {\n // Normal case: update base inputs\n rebuilt.inputs[flatKey] = binding;\n }\n\n // Skip AddToParent — this processor manages the binding directly.\n operations.push(\n ...newElement.operations.filter(\n op => !(op instanceof DocumentOperations.AddToParent)\n )\n );\n } else {\n // Normal value update\n const isResponsive =\n node.input?.responsive && !this.isBaseBreakpoint(breakpoint);\n\n // Assign or generate a stable unique id for the binding\n const existingId = originalEntry?.id;\n const idToUse = existingId ?? generateElementId();\n\n // Merge existing original entry data with updated static value\n const binding = {\n ...(originalEntry ?? {}),\n static: newValue,\n type: node.type,\n list: node.list,\n id: idToUse\n };\n\n if (isResponsive) {\n const inheritedValue = valueResolver.getInheritedValue(\n flatKey,\n breakpoint\n );\n\n if (binding.static === undefined) {\n // Unset override\n if (rebuilt.overrides[breakpoint]?.inputs?.[flatKey]) {\n delete rebuilt.overrides[breakpoint].inputs[flatKey];\n }\n } else if (\n inheritedValue === undefined ||\n !deepEqual(inheritedValue, binding.static)\n ) {\n if (!rebuilt.overrides[breakpoint]) {\n rebuilt.overrides[breakpoint] = { inputs: {} };\n }\n rebuilt.overrides[breakpoint].inputs[flatKey] = binding;\n } else {\n if (rebuilt.overrides[breakpoint]?.inputs?.[flatKey]) {\n delete rebuilt.overrides[breakpoint].inputs[flatKey];\n }\n }\n\n if (originalEntry) {\n rebuilt.inputs[flatKey] = originalEntry;\n }\n } else {\n // Base binding update\n rebuilt.inputs[flatKey] = binding;\n }\n }\n }\n }\n };\n\n // Start the AST traversal and collection.\n compareAndCollect(this.inputsAst, []);\n\n // Identify elements referenced in slots that were removed since last state,\n // and queue their removal.\n const usedSlotIds = this.getElementReferences(rebuilt.inputs);\n for (const id of this.elementReferences) {\n if (!usedSlotIds.has(id)) {\n operations.push(new DocumentOperations.RemoveElement(id));\n }\n }\n\n return new InputsUpdater(this.elementId, rebuilt, operations);\n }\n\n // Returns a set of element IDs referenced in slot bindings within the provided inputs.\n private getElementReferences(inputs: DocumentElementBindings[\"inputs\"] = {}) {\n const references = new Set<string>();\n\n for (const [, binding] of Object.entries(inputs)) {\n if (binding.type === \"slot\") {\n if (Array.isArray(binding.static)) {\n ((binding.static ?? []) as string[]).forEach(id => references.add(id));\n } else if (typeof binding.static === \"string\") {\n references.add(binding.static);\n }\n }\n }\n\n return references;\n }\n\n private isBaseBreakpoint(name: string): boolean {\n return this.breakpoints.indexOf(name) === 0;\n }\n}\n"],"names":["InputsBindingsProcessor","elementId","inputsAst","breakpoints","rawBindings","elementFactory","flat","result","assignValue","path","value","current","i","key","nextKey","isNextIndex","Array","Error","walk","nodes","prefix","node","pathParts","flatKey","entry","staticValue","pattern","RegExp","indexes","Object","acc","match","parseInt","uniqueIndexes","Set","a","b","undefined","part","Number","inputs","breakpoint","operations","originalInputs","rebuilt","bp","overrides","set","structuredClone","seenPaths","valueResolver","InheritedValueResolver","getValue","obj","segments","keys","segment","compareAndCollect","list","newValue","originalEntry","item","newElement","op","DocumentOperations","isResponsive","existingId","idToUse","generateElementId","binding","inheritedValue","deepEqual","createdId","usedSlotIds","id","InputsUpdater","references","name"],"mappings":";;;;;;AAwBO,MAAMA;IAQT,YACIC,SAAiB,EACjBC,SAAyB,EACzBC,WAAqB,EACrBC,WAAoC,EACpCC,cAA8B,CAChC;QACE,IAAI,CAAC,SAAS,GAAGJ;QACjB,IAAI,CAAC,SAAS,GAAGC;QACjB,IAAI,CAAC,WAAW,GAAGC;QACnB,IAAI,CAAC,WAAW,GAAGC;QACnB,IAAI,CAAC,cAAc,GAAGC;QACtB,IAAI,CAAC,iBAAiB,GAAG,IAAI,CAAC,oBAAoB,CAACD,YAAY,MAAM;IACzE;IAKO,aAAaE,IAAoD,EAAgB;QACpF,MAAMC,SAAuB,CAAC;QAG9B,MAAMC,cAAc,CAACC,MAA2BC;YAC5C,IAAIC,UAAUJ;YACd,IAAK,IAAIK,IAAI,GAAGA,IAAIH,KAAK,MAAM,GAAG,GAAGG,IAAK;gBACtC,MAAMC,MAAMJ,IAAI,CAACG,EAAE;gBACnB,MAAME,UAAUL,IAAI,CAACG,IAAI,EAAE;gBAC3B,MAAMG,cAAc,AAAmB,YAAnB,OAAOD;gBAE3B,IAAI,AAAe,YAAf,OAAOD,KAAkB;oBACzB,IAAI,CAACG,MAAM,OAAO,CAACL,UACf,MAAM,IAAIM,MAAM;oBAEpB,MAAON,QAAQ,MAAM,IAAIE,IACrBF,QAAQ,IAAI,CAACI,cAAc,EAAE,GAAG,CAAC;oBAErC,IAAI,AAAwB,YAAxB,OAAOJ,OAAO,CAACE,IAAI,EACnBF,OAAO,CAACE,IAAI,GAAGE,cAAc,EAAE,GAAG,CAAC;oBAEvCJ,UAAUA,OAAO,CAACE,IAAI;gBAC1B,OAAO;oBACH,IAAI,CAAEA,CAAAA,OAAOF,OAAM,KAAM,AAAwB,YAAxB,OAAOA,OAAO,CAACE,IAAI,EACxCF,OAAO,CAACE,IAAI,GAAGE,cAAc,EAAE,GAAG,CAAC;oBAEvCJ,UAAUA,OAAO,CAACE,IAAI;gBAC1B;YACJ;YACAF,OAAO,CAACF,IAAI,CAACA,KAAK,MAAM,GAAG,EAAE,CAAC,GAAGC;QACrC;QAGA,MAAMQ,OAAO,CAACC,OAAuBC;YACjC,KAAK,MAAMC,QAAQF,MAAO;gBACtB,MAAMG,YAAY;uBAAIF;oBAAQC,KAAK,IAAI;iBAAC;gBACxC,MAAME,UAAUD,UAAU,IAAI,CAAC;gBAC/B,MAAME,QAAQlB,IAAI,CAACiB,QAAQ;gBAC3B,MAAME,cAAcD,OAAO;gBAE3B,IAAIH,KAAK,QAAQ,CAAC,MAAM,GAAG,GACvB,IAAIA,KAAK,IAAI,EAAE;oBACX,MAAMK,UAAU,IAAIC,OAAO,CAAC,CAAC,EAAEJ,QAAQ,YAAY,CAAC;oBACpD,MAAMK,UAAUC,OAAO,IAAI,CAACvB,MAAM,MAAM,CAAC,CAACwB,KAAejB;wBACrD,MAAMkB,QAAQlB,IAAI,KAAK,CAACa;wBACxB,IAAIK,OACAD,IAAI,IAAI,CAACE,SAASD,KAAK,CAAC,EAAE,EAAE;wBAEhC,OAAOD;oBACX,GAAG,EAAE;oBAEL,MAAMG,gBAAgBjB,MAAM,IAAI,CAAC,IAAIkB,IAAIN,UAAU,IAAI,CAAC,CAACO,GAAGC,IAAMD,IAAIC;oBAEtE,KAAK,MAAMxB,KAAKqB,cACZf,KAAKG,KAAK,QAAQ,EAAE;2BAAID;wBAAQ,GAAGC,KAAK,IAAI,CAAC,CAAC,EAAET,GAAG;qBAAC;gBAE5D,OACIM,KAAKG,KAAK,QAAQ,EAAEC;qBAErB,IAAIG,AAAgBY,WAAhBZ,aAA2B;oBAClC,MAAMhB,OAAOa,UAAU,MAAM,CAAsB,CAACQ,KAAKQ;wBACrD,MAAMP,QAAQO,KAAK,KAAK,CAAC;wBACzB,IAAIP,OACAD,IAAI,IAAI,CAACC,KAAK,CAAC,EAAE,EAAEQ,OAAOR,KAAK,CAAC,EAAE;6BAElCD,IAAI,IAAI,CAACQ;wBAEb,OAAOR;oBACX,GAAG,EAAE;oBACLtB,YAAYC,MAAMgB;gBACtB;YACJ;QACJ;QAEAP,KAAK,IAAI,CAAC,SAAS,EAAE,EAAE;QACvB,OAAOX;IACX;IAMO,aAAaiC,MAAoB,EAAEC,UAAkB,EAAE;QAC1D,MAAMC,aAAmC,EAAE;QAC3C,MAAMC,iBAAiB,IAAI,CAAC,WAAW,CAAC,MAAM,IAAI,CAAC;QAEnD,MAAMC,UAAiC;YAAE,QAAQ,CAAC;YAAG,WAAW,CAAC;QAAE;QAGnE,IAAI,IAAI,CAAC,WAAW,CAAC,SAAS,EAC1B;YAAA,KAAK,MAAM,CAACC,IAAIC,UAAU,IAAIjB,OAAO,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,SAAS,EACnE,IAAIiB,UAAU,MAAM,EAChBC,IACIH,SACA,CAAC,UAAU,EAAEC,GAAG,OAAO,CAAC,EACxBG,gBAAgB,IAAI,CAAC,WAAW,CAAC,SAAS,CAACH,GAAG,CAAC,MAAM;QAGjE;QAIJ,MAAMI,YAAY,IAAIf;QACtB,MAAMgB,gBAAgB,IAAIC,uBAAuB,IAAI,CAAC,WAAW,EAAEN,CAAAA;YAC/D,IAAI,IAAI,CAAC,gBAAgB,CAACA,KACtB,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM;YAElC,OAAO,IAAI,CAAC,WAAW,CAAC,SAAS,EAAE,CAACA,GAAG,EAAE;QAC7C;QAIA,MAAMO,WAAW,CAACC,KAAU5C;YACxB,MAAM6C,WAAW7C,KAAK,KAAK,CAAC;YAC5B,MAAM8C,OAAOD,SAAS,OAAO,CAACE,CAAAA,UACnBA,QAAQ,KAAK,CAAC,KAAK,GAAG,CAAClB,CAAAA,OACnB,QAAQ,IAAI,CAACA,QAAQN,SAASM,MAAM,MAAMA;YAGzD,OAAOiB,KAAK,MAAM,CAAC,CAACzB,KAAKjB,MAASiB,MAAMA,GAAG,CAACjB,IAAI,GAAGwB,QAAYgB;QACnE;QAIA,MAAMI,oBAAoB,CAACtC,OAAuBC;YAC9C,KAAK,MAAMC,QAAQF,MAAO;gBACtB,MAAMG,YAAY;uBAAIF;oBAAQC,KAAK,IAAI;iBAAC;gBACxC,MAAME,UAAUD,UAAU,IAAI,CAAC;gBAG/B2B,UAAU,GAAG,CAAC1B;gBAEd,IAAIF,KAAK,QAAQ,CAAC,MAAM,EACpB,IAAIA,KAAK,IAAI,EAAE;oBAEX,MAAMqC,OAAON,SAASZ,QAAQjB;oBAC9B,IAAIP,MAAM,OAAO,CAAC0C,OACd,IAAK,IAAI9C,IAAI,GAAGA,IAAI8C,KAAK,MAAM,EAAE9C,IAE7B6C,kBAAkBpC,KAAK,QAAQ,EAAE;2BAC1BC,UAAU,KAAK,CAAC,GAAG;wBACtB,GAAGD,KAAK,IAAI,CAAC,CAAC,EAAET,GAAG;qBACtB;gBAGb,OAEI6C,kBAAkBpC,KAAK,QAAQ,EAAEC;qBAElC;oBAIH,IAAIqC,WAAWP,SAASZ,QAAQjB;oBAGhC,MAAMqC,gBAAgBjB,cAAc,CAACpB,QAAQ;oBAG7C,IAAIoC,AAAatB,WAAbsB,YAA0B,CAACC,eAC3B;oBAIJ,IAAIvC,KAAK,IAAI,IAAIL,MAAM,OAAO,CAAC2C,WAC3BA,WAAWA,SAAS,GAAG,CAACE,CAAAA;wBACpB,IACI,AAAgB,YAAhB,OAAOA,QACPA,AAAS,SAATA,QACAA,AAAgB,oBAAhBA,KAAK,MAAM,EACb;4BACE,MAAMC,aAAa,IAAI,CAAC,cAAc,CAAC,0BAA0B,CAAC;gCAC9D,eAAeD,KAAK,MAAM,CAAC,SAAS;gCACpC,UAAU,IAAI,CAAC,SAAS;gCACxB,MAAMtC;gCACN,UAAUsC,KAAK,MAAM;4BACzB;4BAEAnB,WAAW,IAAI,IACRoB,WAAW,UAAU,CAAC,MAAM,CAC3BC,CAAAA,KAAM,CAAEA,CAAAA,cAAcC,mBAAmB,WAAU;4BAG3D,OAAOF,WAAW,OAAO,CAAC,EAAE;wBAChC;wBACA,OAAOD;oBACX;oBAGJ,IACI,AAAC7C,MAAM,OAAO,CAAC2C,aACf,AAAoB,YAApB,OAAOA,YACPA,UAAU,WAAW,iBAgElB;wBAEH,MAAMM,eACF5C,KAAK,KAAK,EAAE,cAAc,CAAC,IAAI,CAAC,gBAAgB,CAACoB;wBAGrD,MAAMyB,aAAaN,eAAe;wBAClC,MAAMO,UAAUD,cAAcE;wBAG9B,MAAMC,UAAU;4BACZ,GAAIT,iBAAiB,CAAC,CAAC;4BACvB,QAAQD;4BACR,MAAMtC,KAAK,IAAI;4BACf,MAAMA,KAAK,IAAI;4BACf,IAAI8C;wBACR;wBAEA,IAAIF,cAAc;4BACd,MAAMK,iBAAiBpB,cAAc,iBAAiB,CAClD3B,SACAkB;4BAGJ,IAAI4B,AAAmBhC,WAAnBgC,QAAQ,MAAM,EAEd;gCAAA,IAAIzB,QAAQ,SAAS,CAACH,WAAW,EAAE,QAAQ,CAAClB,QAAQ,EAChD,OAAOqB,QAAQ,SAAS,CAACH,WAAW,CAAC,MAAM,CAAClB,QAAQ;4BACxD,OACG,IACH+C,AAAmBjC,WAAnBiC,kBACCC,WAAUD,gBAAgBD,QAAQ,MAAM,GAOzC;gCAAA,IAAIzB,QAAQ,SAAS,CAACH,WAAW,EAAE,QAAQ,CAAClB,QAAQ,EAChD,OAAOqB,QAAQ,SAAS,CAACH,WAAW,CAAC,MAAM,CAAClB,QAAQ;4BACxD,OARF;gCACE,IAAI,CAACqB,QAAQ,SAAS,CAACH,WAAW,EAC9BG,QAAQ,SAAS,CAACH,WAAW,GAAG;oCAAE,QAAQ,CAAC;gCAAE;gCAEjDG,QAAQ,SAAS,CAACH,WAAW,CAAC,MAAM,CAAClB,QAAQ,GAAG8C;4BACpD;4BAMA,IAAIT,eACAhB,QAAQ,MAAM,CAACrB,QAAQ,GAAGqC;wBAElC,OAEIhB,QAAQ,MAAM,CAACrB,QAAQ,GAAG8C;oBAElC,OAjHE;wBAEE,MAAMP,aAAa,IAAI,CAAC,cAAc,CAAC,0BAA0B,CAAC;4BAC9D,eAAeH,SAAS,MAAM,CAAC,SAAS;4BACxC,UAAU,IAAI,CAAC,SAAS;4BACxB,MAAMpC;4BACN,OAAO;4BACP,UAAUoC,SAAS,MAAM;wBAC7B;wBAEA,MAAMa,YAAYV,WAAW,OAAO,CAAC,EAAE;wBAGvC,MAAMI,aAAaN,eAAe;wBAClC,MAAMO,UAAUD,cAAcE;wBAG9B,MAAMC,UAAU;4BACZ,QAAQG;4BACR,MAAMnD,KAAK,IAAI;4BACf,MAAMA,KAAK,IAAI;4BACf,IAAI8C;wBACR;wBAEA,IAAI9C,KAAK,KAAK,EAAE,cAAc,CAAC,IAAI,CAAC,gBAAgB,CAACoB,aAAa;4BAC9D,MAAM6B,iBAAiBpB,cAAc,iBAAiB,CAClD3B,SACAkB;4BAGJ,IAAI4B,AAAmBhC,WAAnBgC,QAAQ,MAAM,EAEd;gCAAA,IAAIzB,QAAQ,SAAS,CAACH,WAAW,EAAE,QAAQ,CAAClB,QAAQ,EAChD,OAAOqB,QAAQ,SAAS,CAACH,WAAW,CAAC,MAAM,CAAClB,QAAQ;4BACxD,OACG,IACH+C,AAAmBjC,WAAnBiC,kBACCC,WAAUD,gBAAgBD,QAAQ,MAAM,GAOzC;gCAAA,IAAIzB,QAAQ,SAAS,CAACH,WAAW,EAAE,QAAQ,CAAClB,QAAQ,EAChD,OAAOqB,QAAQ,SAAS,CAACH,WAAW,CAAC,MAAM,CAAClB,QAAQ;4BACxD,OARF;gCACE,IAAI,CAACqB,QAAQ,SAAS,CAACH,WAAW,EAC9BG,QAAQ,SAAS,CAACH,WAAW,GAAG;oCAAE,QAAQ,CAAC;gCAAE;gCAEjDG,QAAQ,SAAS,CAACH,WAAW,CAAC,MAAM,CAAClB,QAAQ,GAAG8C;4BACpD;4BAMA,IAAIT,eACAhB,QAAQ,MAAM,CAACrB,QAAQ,GAAGqC;wBAElC,OAEIhB,QAAQ,MAAM,CAACrB,QAAQ,GAAG8C;wBAI9B3B,WAAW,IAAI,IACRoB,WAAW,UAAU,CAAC,MAAM,CAC3BC,CAAAA,KAAM,CAAEA,CAAAA,cAAcC,mBAAmB,WAAU;oBAG/D;gBAmDJ;YACJ;QACJ;QAGAP,kBAAkB,IAAI,CAAC,SAAS,EAAE,EAAE;QAIpC,MAAMgB,cAAc,IAAI,CAAC,oBAAoB,CAAC7B,QAAQ,MAAM;QAC5D,KAAK,MAAM8B,MAAM,IAAI,CAAC,iBAAiB,CACnC,IAAI,CAACD,YAAY,GAAG,CAACC,KACjBhC,WAAW,IAAI,CAAC,IAAIsB,mBAAmB,aAAa,CAACU;QAI7D,OAAO,IAAIC,cAAc,IAAI,CAAC,SAAS,EAAE/B,SAASF;IACtD;IAGQ,qBAAqBF,SAA4C,CAAC,CAAC,EAAE;QACzE,MAAMoC,aAAa,IAAI1C;QAEvB,KAAK,MAAM,GAAGmC,QAAQ,IAAIxC,OAAO,OAAO,CAACW,QACrC,IAAI6B,AAAiB,WAAjBA,QAAQ,IAAI,EACZ;YAAA,IAAIrD,MAAM,OAAO,CAACqD,QAAQ,MAAM,GAC1BA,AAAAA,CAAAA,QAAQ,MAAM,IAAI,EAAC,EAAgB,OAAO,CAACK,CAAAA,KAAME,WAAW,GAAG,CAACF;iBAC/D,IAAI,AAA0B,YAA1B,OAAOL,QAAQ,MAAM,EAC5BO,WAAW,GAAG,CAACP,QAAQ,MAAM;QACjC;QAIR,OAAOO;IACX;IAEQ,iBAAiBC,IAAY,EAAW;QAC5C,OAAO,AAAmC,MAAnC,IAAI,CAAC,WAAW,CAAC,OAAO,CAACA;IACpC;AACJ"}