igniteui-angular-core 13.2.0 → 14.1.1

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 (81) hide show
  1. package/bundles/igniteui-angular-core.umd.js +1513 -1158
  2. package/bundles/igniteui-angular-core.umd.min.js +1 -1
  3. package/esm2015/lib/BlazorCodeGeneratingComponentRendererModuleEmitter.js +9 -9
  4. package/esm2015/lib/CanvasViewRenderer.js +1 -1
  5. package/esm2015/lib/CodeGeneratingComponentRendererCodeEmitter_combined.js +382 -314
  6. package/esm2015/lib/CodeGeneratingComponentRendererDataEmitter.js +2 -2
  7. package/esm2015/lib/CodeGeneratingComponentRendererHandlerEmitter.js +2 -2
  8. package/esm2015/lib/CodeGeneratingComponentRendererModuleEmitter.js +14 -11
  9. package/esm2015/lib/CodeGeneratingRendererResult.js +56 -44
  10. package/esm2015/lib/CodeGenerationFolderTemplate.js +41 -37
  11. package/esm2015/lib/CodeGenerationTransformer.js +19 -19
  12. package/esm2015/lib/ComponentRendererAdapter.js +3 -0
  13. package/esm2015/lib/ComponentRenderer_combined.js +178 -169
  14. package/esm2015/lib/DescriptionSerializer.js +72 -58
  15. package/esm2015/lib/DescriptionTreeAction.js +10 -9
  16. package/esm2015/lib/DescriptionTreeBuilder.js +4 -4
  17. package/esm2015/lib/DescriptionTreeNode.js +64 -36
  18. package/esm2015/lib/DescriptionTreeReconciler.js +156 -141
  19. package/esm2015/lib/DotNetCodeGeneratingComponentRendererModuleEmitter.js +24 -22
  20. package/esm2015/lib/IgcSliderBridge.js +38 -12
  21. package/esm2015/lib/NativeUIInputsFactory.js +1 -0
  22. package/esm2015/lib/NativeUISlider.js +24 -10
  23. package/esm2015/lib/StackedFragmentSeriesDescription.js +121 -121
  24. package/esm2015/lib/StackedFragmentSeriesDescriptionMetadata.js +1 -1
  25. package/esm2015/lib/TSCodeGeneratingComponentRendererModuleEmitter.js +36 -34
  26. package/esm2015/lib/TypeDescriptionPropretyTransforms.js +49 -25
  27. package/esm2015/lib/WebTreeSelectionOptionsEventArgsDescription.js +3 -3
  28. package/esm2015/lib/WebTreeSelectionOptionsEventArgsDescriptionMetadata.js +3 -1
  29. package/esm2015/lib/WebTreeSelectionOptionsEventDetailDescription.js +36 -0
  30. package/esm2015/lib/WebTreeSelectionOptionsEventDetailDescriptionMetadata.js +38 -0
  31. package/esm2015/lib/componentUtil.js +4 -1
  32. package/esm2015/public_api.js +2 -0
  33. package/esm5/lib/BlazorCodeGeneratingComponentRendererModuleEmitter.js +9 -9
  34. package/esm5/lib/CanvasViewRenderer.js +1 -1
  35. package/esm5/lib/CodeGeneratingComponentRendererCodeEmitter_combined.js +449 -363
  36. package/esm5/lib/CodeGeneratingComponentRendererDataEmitter.js +2 -2
  37. package/esm5/lib/CodeGeneratingComponentRendererHandlerEmitter.js +2 -2
  38. package/esm5/lib/CodeGeneratingComponentRendererModuleEmitter.js +18 -11
  39. package/esm5/lib/CodeGeneratingRendererResult.js +95 -66
  40. package/esm5/lib/CodeGenerationFolderTemplate.js +40 -36
  41. package/esm5/lib/CodeGenerationTransformer.js +19 -19
  42. package/esm5/lib/ComponentRendererAdapter.js +3 -0
  43. package/esm5/lib/ComponentRenderer_combined.js +184 -175
  44. package/esm5/lib/DescriptionSerializer.js +72 -58
  45. package/esm5/lib/DescriptionTreeAction.js +10 -9
  46. package/esm5/lib/DescriptionTreeBuilder.js +4 -4
  47. package/esm5/lib/DescriptionTreeNode.js +64 -36
  48. package/esm5/lib/DescriptionTreeReconciler.js +156 -141
  49. package/esm5/lib/DotNetCodeGeneratingComponentRendererModuleEmitter.js +24 -22
  50. package/esm5/lib/IgcSliderBridge.js +38 -12
  51. package/esm5/lib/NativeUIInputsFactory.js +1 -0
  52. package/esm5/lib/NativeUISlider.js +23 -5
  53. package/esm5/lib/StackedFragmentSeriesDescription.js +120 -120
  54. package/esm5/lib/StackedFragmentSeriesDescriptionMetadata.js +1 -1
  55. package/esm5/lib/TSCodeGeneratingComponentRendererModuleEmitter.js +36 -34
  56. package/esm5/lib/TypeDescriptionPropretyTransforms.js +49 -25
  57. package/esm5/lib/WebTreeSelectionOptionsEventArgsDescription.js +2 -2
  58. package/esm5/lib/WebTreeSelectionOptionsEventArgsDescriptionMetadata.js +3 -1
  59. package/esm5/lib/WebTreeSelectionOptionsEventDetailDescription.js +46 -0
  60. package/esm5/lib/WebTreeSelectionOptionsEventDetailDescriptionMetadata.js +42 -0
  61. package/esm5/lib/componentUtil.js +4 -1
  62. package/esm5/public_api.js +2 -0
  63. package/fesm2015/igniteui-angular-core.js +1385 -1085
  64. package/fesm5/igniteui-angular-core.js +1512 -1159
  65. package/lib/BlazorCodeGeneratingComponentRendererModuleEmitter.d.ts +3 -3
  66. package/lib/CodeGeneratingComponentRendererCodeEmitter_combined.d.ts +120 -114
  67. package/lib/CodeGeneratingComponentRendererModuleEmitter.d.ts +6 -5
  68. package/lib/CodeGeneratingRendererResult.d.ts +15 -12
  69. package/lib/DescriptionSerializer.d.ts +7 -6
  70. package/lib/DescriptionTreeAction.d.ts +6 -5
  71. package/lib/DescriptionTreeNode.d.ts +13 -12
  72. package/lib/DotNetCodeGeneratingComponentRendererModuleEmitter.d.ts +7 -7
  73. package/lib/IgcSliderBridge.d.ts +7 -3
  74. package/lib/NativeUISlider.d.ts +9 -6
  75. package/lib/StackedFragmentSeriesDescription.d.ts +46 -46
  76. package/lib/TSCodeGeneratingComponentRendererModuleEmitter.d.ts +7 -7
  77. package/lib/WebTreeSelectionOptionsEventArgsDescription.d.ts +3 -3
  78. package/lib/WebTreeSelectionOptionsEventDetailDescription.d.ts +17 -0
  79. package/lib/WebTreeSelectionOptionsEventDetailDescriptionMetadata.d.ts +13 -0
  80. package/package.json +4 -4
  81. package/public_api.d.ts +2 -0
package/esm2015/lib/DescriptionTreeReconciler.js CHANGED
@@ -23,13 +23,13 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
23
23
  let e = b._inner[d];
24
24
  switch (e.a) {
25
25
  case 0:
26
- if (typeCast(DescriptionTreeNode.$, e.g) !== null) {
27
- let f = e.g.f;
26
+ if (typeCast(DescriptionTreeNode.$, e.h) !== null) {
27
+ let f = e.h.g;
28
28
  c.a.add_1(f);
29
29
  }
30
- e.b.m(e.i, e.f);
31
- if (typeCast(DescriptionTreeNode.$, e.f) !== null) {
32
- let g = e.f.f;
30
+ e.c.o(e.j, e.g, e.d);
31
+ if (typeCast(DescriptionTreeNode.$, e.g) !== null) {
32
+ let g = e.g.g;
33
33
  if (c.a.contains(g)) {
34
34
  c.a.remove(g);
35
35
  }
@@ -37,23 +37,23 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
37
37
  }
38
38
  break;
39
39
  case 1:
40
- if (typeCast(DescriptionTreeNode.$, e.g) !== null) {
41
- let h = e.g.f;
40
+ if (typeCast(DescriptionTreeNode.$, e.h) !== null) {
41
+ let h = e.h.g;
42
42
  c.a.add_1(h);
43
43
  }
44
- e.b.l(e.i);
44
+ e.c.m(e.j);
45
45
  break;
46
46
  case 3:
47
47
  {
48
- let i = e.b.a(e.i).b;
49
- let j = i[e.e];
48
+ let i = e.c.a(e.j).b;
49
+ let j = i[e.f];
50
50
  if (typeCast(DescriptionTreeNode.$, j) !== null) {
51
- let k = j.f;
51
+ let k = j.g;
52
52
  c.a.add_1(k);
53
53
  }
54
- i[e.e] = e.f;
55
- if (typeCast(DescriptionTreeNode.$, e.f) !== null) {
56
- let l = e.f.f;
54
+ i[e.f] = e.g;
55
+ if (typeCast(DescriptionTreeNode.$, e.g) !== null) {
56
+ let l = e.g.g;
57
57
  if (c.a.contains(l)) {
58
58
  c.a.remove(l);
59
59
  }
@@ -63,44 +63,44 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
63
63
  break;
64
64
  case 4:
65
65
  {
66
- let m = e.b.a(e.i).b;
67
- let n = m[e.e];
66
+ let m = e.c.a(e.j).b;
67
+ let n = m[e.f];
68
68
  if (typeCast(DescriptionTreeNode.$, n) !== null) {
69
- let o = n.f;
69
+ let o = n.g;
70
70
  c.a.add_1(o);
71
71
  }
72
72
  let p = new Array(m.length - 1);
73
73
  let q = 0;
74
74
  for (let r = 0; r < m.length; r++) {
75
- if (r != e.e) {
75
+ if (r != e.f) {
76
76
  p[q] = m[r];
77
77
  q++;
78
78
  }
79
79
  }
80
- e.b.m(e.i, p);
80
+ e.c.n(e.j, p);
81
81
  }
82
82
  break;
83
83
  case 2:
84
84
  {
85
- if (e.b == null && a == null) {
85
+ if (e.c == null && a == null) {
86
86
  c.d.add(e);
87
87
  }
88
88
  else {
89
- let s = e.b.a(e.i).b;
89
+ let s = e.c.a(e.j).b;
90
90
  let t = new Array(s.length + 1);
91
91
  let u = 0;
92
92
  for (let v = 0; v < t.length; v++) {
93
- if (v == e.d) {
94
- t[v] = e.f;
93
+ if (v == e.e) {
94
+ t[v] = e.g;
95
95
  }
96
96
  else {
97
97
  t[v] = s[u];
98
98
  u++;
99
99
  }
100
100
  }
101
- e.b.m(e.i, t);
102
- if (typeCast(DescriptionTreeNode.$, e.f) !== null) {
103
- let w = e.f.f;
101
+ e.c.n(e.j, t);
102
+ if (typeCast(DescriptionTreeNode.$, e.g) !== null) {
103
+ let w = e.g.g;
104
104
  if (c.a.contains(w)) {
105
105
  c.a.remove(w);
106
106
  }
@@ -111,15 +111,15 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
111
111
  break;
112
112
  case 5:
113
113
  {
114
- let x = e.b.a(e.i).b;
114
+ let x = e.c.a(e.j).b;
115
115
  for (let y = 0; y < x.length; y++) {
116
116
  let z = x[y];
117
117
  if (typeCast(DescriptionTreeNode.$, z) !== null) {
118
- let aa = z.f;
118
+ let aa = z.g;
119
119
  c.a.add_1(aa);
120
120
  }
121
121
  }
122
- e.b.m(e.i, []);
122
+ e.c.n(e.j, []);
123
123
  }
124
124
  break;
125
125
  }
@@ -134,31 +134,31 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
134
134
  if (a != null && b == null) {
135
135
  let e = new DescriptionTreeAction();
136
136
  e.a = 4;
137
- e.e = 0;
138
- e.g = a;
139
- e.c = null;
140
- e.i = null;
137
+ e.f = 0;
138
+ e.h = a;
139
+ e.d = null;
140
+ e.j = null;
141
141
  d.add(e);
142
142
  return d;
143
143
  }
144
144
  if (a == null && b != null) {
145
145
  let f = new DescriptionTreeAction();
146
146
  f.a = 2;
147
- f.e = 0;
148
- f.f = b;
149
- f.c = null;
150
- f.i = null;
147
+ f.f = 0;
148
+ f.g = b;
149
+ f.d = null;
150
+ f.j = null;
151
151
  d.add(f);
152
152
  return d;
153
153
  }
154
- if (b.h != a.h) {
154
+ if (b.i != a.i) {
155
155
  let g = new DescriptionTreeAction();
156
156
  g.a = 3;
157
- g.e = 0;
158
- g.g = a;
159
- g.f = b;
160
- g.c = null;
161
- g.i = null;
157
+ g.f = 0;
158
+ g.h = a;
159
+ g.g = b;
160
+ g.d = null;
161
+ g.j = null;
162
162
  d.add(g);
163
163
  return d;
164
164
  }
@@ -166,7 +166,7 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
166
166
  return d;
167
167
  }
168
168
  static g(a, b, c, d) {
169
- c.f = b.f;
169
+ c.g = b.g;
170
170
  let e = DescriptionTreeReconciler.e(b);
171
171
  let f = DescriptionTreeReconciler.e(c);
172
172
  let g = new List$1(DescriptionPropertyValue.$, 0);
@@ -174,14 +174,14 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
174
174
  let i = new List$1(DescriptionPropertyValue.$, 0);
175
175
  for (let j = 0; j < e.count; j++) {
176
176
  let k = e._inner[j];
177
- if (c.b(k.c)) {
177
+ if (c.c(k.c)) {
178
178
  if (!Base.equalsStatic(k, c.a(k.c))) {
179
179
  let l = c.a(k.c);
180
180
  if (typeCast(DescriptionTreeNode.$, k.b) !== null && typeCast(DescriptionTreeNode.$, l.b) !== null) {
181
181
  let m = k.b;
182
182
  let n = l.b;
183
- if (m.h == n.h) {
184
- if ((!m.b("Name") && !n.b("Name")) || (m.b("Name") && n.b("Name") && (m.a("Name").b == n.a("Name").b))) {
183
+ if (m.i == n.i) {
184
+ if ((!m.c("Name") && !n.c("Name")) || (m.c("Name") && n.c("Name") && (m.a("Name").b == n.a("Name").b))) {
185
185
  DescriptionTreeReconciler.g(a, m, n, d);
186
186
  }
187
187
  else {
@@ -205,29 +205,31 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
205
205
  }
206
206
  for (let o = 0; o < f.count; o++) {
207
207
  let p = f._inner[o];
208
- if (!b.b(p.c)) {
208
+ if (!b.c(p.c)) {
209
209
  h.add(p);
210
210
  }
211
211
  }
212
212
  for (let q = 0; q < g.count; q++) {
213
213
  let r = g._inner[q];
214
214
  let s = new DescriptionTreeAction();
215
- s.b = b;
215
+ s.c = b;
216
+ s.b = c;
216
217
  s.a = 1;
217
- s.i = r.c;
218
- s.c = r.a;
219
- s.g = r.b;
218
+ s.j = r.c;
219
+ s.d = r.a;
220
+ s.h = r.b;
220
221
  a.add(s);
221
222
  }
222
223
  for (let t = 0; t < h.count; t++) {
223
224
  let u = h._inner[t];
224
225
  let v = new DescriptionTreeAction();
225
- v.b = b;
226
+ v.c = b;
227
+ v.b = c;
226
228
  v.a = 0;
227
- v.i = u.c;
228
- v.c = u.a;
229
- v.f = u.b;
230
- v.g = null;
229
+ v.j = u.c;
230
+ v.d = u.a;
231
+ v.g = u.b;
232
+ v.h = null;
231
233
  a.add(v);
232
234
  }
233
235
  for (let w = 0; w < i.count; w++) {
@@ -236,12 +238,13 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
236
238
  let z = x.b;
237
239
  if (!Base.equalsStatic(z, y)) {
238
240
  let aa = new DescriptionTreeAction();
239
- aa.b = b;
241
+ aa.c = b;
242
+ aa.b = c;
240
243
  aa.a = 0;
241
- aa.i = x.c;
242
- aa.c = x.a;
243
- aa.f = x.b;
244
- aa.g = b.a(x.c).b;
244
+ aa.j = x.c;
245
+ aa.d = x.a;
246
+ aa.g = x.b;
247
+ aa.h = b.a(x.c).b;
245
248
  a.add(aa);
246
249
  }
247
250
  }
@@ -252,7 +255,7 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
252
255
  let af = new List$1(DescriptionPropertyValue.$, 0);
253
256
  for (let ag = 0; ag < ab.count; ag++) {
254
257
  let ah = ab._inner[ag];
255
- if (c.b(ah.c)) {
258
+ if (c.c(ah.c)) {
256
259
  if (!DescriptionTreeReconciler.b(ah.b, c.a(ah.c).b)) {
257
260
  af.add(c.a(ah.c));
258
261
  }
@@ -265,33 +268,35 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
265
268
  if (typeCast(DescriptionTreeNode.$, al) !== null && typeCast(DescriptionTreeNode.$, am) !== null) {
266
269
  let an = al;
267
270
  let ao = am;
268
- if (an.h == ao.h) {
271
+ if (an.i == ao.i) {
269
272
  DescriptionTreeReconciler.g(a, an, ao, d);
270
273
  }
271
274
  else {
272
275
  let ap = new DescriptionTreeAction();
273
- ap.i = ah.c;
274
- ap.c = ah.a;
275
- ap.b = b;
276
+ ap.j = ah.c;
277
+ ap.d = ah.a;
278
+ ap.c = b;
279
+ ap.b = c;
276
280
  ap.a = 3;
281
+ ap.f = ak;
277
282
  ap.e = ak;
278
- ap.d = ak;
279
- ap.g = an;
280
- ap.f = ao;
283
+ ap.h = an;
284
+ ap.g = ao;
281
285
  a.add(ap);
282
286
  }
283
287
  }
284
288
  else {
285
289
  if (!Base.equalsStatic(al, am)) {
286
290
  let aq = new DescriptionTreeAction();
287
- aq.i = ah.c;
288
- aq.c = ah.a;
289
- aq.b = b;
291
+ aq.j = ah.c;
292
+ aq.d = ah.a;
293
+ aq.c = b;
294
+ aq.b = c;
290
295
  aq.a = 3;
296
+ aq.f = ak;
291
297
  aq.e = ak;
292
- aq.d = ak;
293
- aq.g = al;
294
- aq.f = am;
298
+ aq.h = al;
299
+ aq.g = am;
295
300
  a.add(aq);
296
301
  }
297
302
  }
@@ -306,29 +311,31 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
306
311
  }
307
312
  for (let ar = 0; ar < ac.count; ar++) {
308
313
  let as = ac._inner[ar];
309
- if (!b.b(as.c)) {
314
+ if (!b.c(as.c)) {
310
315
  ae.add(as);
311
316
  }
312
317
  }
313
318
  for (let at = 0; at < ad.count; at++) {
314
319
  let au = ad._inner[at];
315
320
  let av = new DescriptionTreeAction();
316
- av.b = b;
317
- av.i = au.c;
318
- av.c = au.a;
321
+ av.c = b;
322
+ av.b = c;
323
+ av.j = au.c;
324
+ av.d = au.a;
319
325
  av.a = 5;
320
- av.g = au.b;
326
+ av.h = au.b;
321
327
  a.add(av);
322
328
  }
323
329
  for (let aw = 0; aw < ae.count; aw++) {
324
330
  let ax = ae._inner[aw];
325
331
  let ay = new DescriptionTreeAction();
326
- ay.b = b;
327
- ay.i = ax.c;
328
- ay.c = ax.a;
332
+ ay.c = b;
333
+ ay.b = c;
334
+ ay.j = ax.c;
335
+ ay.d = ax.a;
329
336
  ay.a = 0;
330
- ay.g = null;
331
- ay.f = ax.b;
337
+ ay.h = null;
338
+ ay.g = ax.b;
332
339
  a.add(ay);
333
340
  }
334
341
  for (let az = 0; az < af.count; az++) {
@@ -339,7 +346,7 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
339
346
  if (a == null) {
340
347
  return "UNKOWN";
341
348
  }
342
- if (!a.b("Type")) {
349
+ if (!a.c("Type")) {
343
350
  return "UNKOWN";
344
351
  }
345
352
  return a.a("Type").b;
@@ -351,10 +358,10 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
351
358
  if (h.length > 0) {
352
359
  if (typeCast(DescriptionTreeNode.$, h[0]) !== null) {
353
360
  let j = h[0];
354
- if (j.b("Name") && j.a("Name") != null) {
361
+ if (j.c("Name") && j.a("Name") != null) {
355
362
  g = true;
356
363
  }
357
- if (j.b("RefType") && j.a("RefType").b == "uuid") {
364
+ if (j.c("RefType") && j.a("RefType").b == "uuid") {
358
365
  g = true;
359
366
  }
360
367
  }
@@ -362,10 +369,10 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
362
369
  if (i.length > 0) {
363
370
  if (typeCast(DescriptionTreeNode.$, i[0]) !== null) {
364
371
  let k = i[0];
365
- if (k.b("Name") && k.a("Name") != null) {
372
+ if (k.c("Name") && k.a("Name") != null) {
366
373
  g = true;
367
374
  }
368
- if (k.b("RefType") && k.a("RefType").b == "uuid") {
375
+ if (k.c("RefType") && k.a("RefType").b == "uuid") {
369
376
  g = true;
370
377
  }
371
378
  }
@@ -380,7 +387,7 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
380
387
  let r = new DescriptionTreeReconciler_TreeModeData();
381
388
  r.a = h[q];
382
389
  r.d = q;
383
- r.f = r.a.b("Name") ? r.a.a("Name").b : r.a.b("RefType") ? r.a.a("Value").b : null;
390
+ r.f = r.a.c("Name") ? r.a.a("Name").b : r.a.c("RefType") ? r.a.a("Value").b : null;
384
391
  if (r.f == null) {
385
392
  r.f = "BADKEY_" + p.toString();
386
393
  p++;
@@ -392,7 +399,7 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
392
399
  let t = new DescriptionTreeReconciler_TreeModeData();
393
400
  t.a = i[s];
394
401
  t.d = s;
395
- t.f = t.a.b("Name") ? t.a.a("Name").b : t.a.b("RefType") ? t.a.a("Value").b : null;
402
+ t.f = t.a.c("Name") ? t.a.a("Name").b : t.a.c("RefType") ? t.a.a("Value").b : null;
396
403
  if (t.f == null) {
397
404
  t.f = "BADKEY_" + p.toString();
398
405
  p++;
@@ -419,12 +426,13 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
419
426
  let z = m._inner[y];
420
427
  if (z.c) {
421
428
  let aa = new DescriptionTreeAction();
422
- aa.i = e.c;
423
- aa.b = b;
424
- aa.c = e.a;
425
- aa.e = z.d;
429
+ aa.j = e.c;
430
+ aa.c = b;
431
+ aa.b = c;
432
+ aa.d = e.a;
433
+ aa.f = z.d;
426
434
  aa.a = 4;
427
- aa.g = z.a;
435
+ aa.h = z.a;
428
436
  a.add(aa);
429
437
  for (let ab = y + 1; ab < m.count; ab++) {
430
438
  let ac = m._inner[ab];
@@ -436,12 +444,13 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
436
444
  let ae = o._inner[ad];
437
445
  if (ae.b) {
438
446
  let af = new DescriptionTreeAction();
439
- af.i = e.c;
440
- af.b = b;
441
- af.c = e.a;
442
- af.d = ad;
447
+ af.j = e.c;
448
+ af.c = b;
449
+ af.b = c;
450
+ af.d = e.a;
451
+ af.e = ad;
443
452
  af.a = 2;
444
- af.f = i[ad];
453
+ af.g = i[ad];
445
454
  a.add(af);
446
455
  for (let ag = 0; ag < m.count; ag++) {
447
456
  let ah = m._inner[ag];
@@ -457,12 +466,13 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
457
466
  continue;
458
467
  }
459
468
  let aj = new DescriptionTreeAction();
460
- aj.i = e.c;
461
- aj.b = b;
462
- aj.c = e.a;
463
- aj.e = ai.d;
469
+ aj.j = e.c;
470
+ aj.c = b;
471
+ aj.b = c;
472
+ aj.d = e.a;
473
+ aj.f = ai.d;
464
474
  aj.a = 4;
465
- aj.g = ai.a;
475
+ aj.h = ai.a;
466
476
  a.add(aj);
467
477
  for (let ak = 0; ak < m.count; ak++) {
468
478
  let al = m._inner[ak];
@@ -471,12 +481,13 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
471
481
  }
472
482
  }
473
483
  aj = new DescriptionTreeAction();
474
- aj.i = e.c;
475
- aj.b = b;
476
- aj.c = e.a;
477
- aj.d = ai.e;
484
+ aj.j = e.c;
485
+ aj.c = b;
486
+ aj.b = c;
487
+ aj.d = e.a;
488
+ aj.e = ai.e;
478
489
  aj.a = 2;
479
- aj.f = ai.a;
490
+ aj.g = ai.a;
480
491
  a.add(aj);
481
492
  ai.d = ai.e;
482
493
  for (let am = 0; am < m.count; am++) {
@@ -494,22 +505,24 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
494
505
  for (let ap = 0; ap < ao; ap++) {
495
506
  if (ap >= h.length) {
496
507
  let aq = new DescriptionTreeAction();
497
- aq.i = e.c;
498
- aq.b = b;
499
- aq.c = e.a;
500
- aq.d = ap;
508
+ aq.j = e.c;
509
+ aq.c = b;
510
+ aq.b = c;
511
+ aq.d = e.a;
512
+ aq.e = ap;
501
513
  aq.a = 2;
502
- aq.f = i[ap];
514
+ aq.g = i[ap];
503
515
  a.add(aq);
504
516
  }
505
517
  else if (ap >= i.length) {
506
518
  let ar = new DescriptionTreeAction();
507
- ar.i = e.c;
508
- ar.b = b;
509
- ar.c = e.a;
510
- ar.e = i.length;
519
+ ar.j = e.c;
520
+ ar.c = b;
521
+ ar.b = c;
522
+ ar.d = e.a;
523
+ ar.f = i.length;
511
524
  ar.a = 4;
512
- ar.g = h[ap];
525
+ ar.h = h[ap];
513
526
  a.add(ar);
514
527
  }
515
528
  else {
@@ -518,31 +531,33 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
518
531
  if (typeCast(DescriptionTreeNode.$, as) !== null && typeCast(DescriptionTreeNode.$, at) !== null) {
519
532
  let au = as;
520
533
  let av = at;
521
- if (au.h == av.h) {
534
+ if (au.i == av.i) {
522
535
  DescriptionTreeReconciler.g(a, au, av, f);
523
536
  }
524
537
  else {
525
538
  let aw = new DescriptionTreeAction();
526
- aw.i = e.c;
527
- aw.b = b;
528
- aw.c = e.a;
529
- aw.e = ap;
539
+ aw.j = e.c;
540
+ aw.c = b;
541
+ aw.b = c;
542
+ aw.d = e.a;
543
+ aw.f = ap;
530
544
  aw.a = 3;
531
- aw.g = h[ap];
532
- aw.f = i[ap];
545
+ aw.h = h[ap];
546
+ aw.g = i[ap];
533
547
  a.add(aw);
534
548
  }
535
549
  }
536
550
  else {
537
551
  if (!Base.equalsStatic(as, at)) {
538
552
  let ax = new DescriptionTreeAction();
539
- ax.i = e.c;
540
- ax.b = b;
541
- ax.c = e.a;
542
- ax.e = ap;
553
+ ax.j = e.c;
554
+ ax.c = b;
555
+ ax.b = c;
556
+ ax.d = e.a;
557
+ ax.f = ap;
543
558
  ax.a = 3;
544
- ax.g = h[ap];
545
- ax.f = i[ap];
559
+ ax.h = h[ap];
560
+ ax.g = i[ap];
546
561
  a.add(ax);
547
562
  }
548
563
  }
@@ -574,11 +589,11 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
574
589
  if (typeCast(DescriptionTreeNode.$, f) !== null) {
575
590
  let h = f;
576
591
  let i = g;
577
- if (h.h != i.h) {
592
+ if (h.i != i.i) {
578
593
  return false;
579
594
  }
580
- let j = h.b("Name") ? h.a("Name").b : null;
581
- let k = i.b("Name") ? i.a("Name").b : null;
595
+ let j = h.c("Name") ? h.a("Name").b : null;
596
+ let k = i.c("Name") ? i.a("Name").b : null;
582
597
  if (!Base.equalsStatic(j, k)) {
583
598
  return false;
584
599
  }
@@ -593,7 +608,7 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
593
608
  }
594
609
  static e(a) {
595
610
  let b = new List$1(DescriptionPropertyValue.$, 0);
596
- let c = a.e();
611
+ let c = a.f();
597
612
  for (let d = 0; d < c.count; d++) {
598
613
  let e = c._inner[d];
599
614
  if (e.a != null && e.a.knownType != 10 && e.a.knownType != 9) {
@@ -604,7 +619,7 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
604
619
  }
605
620
  static d(a) {
606
621
  let b = new List$1(DescriptionPropertyValue.$, 0);
607
- let c = a.e();
622
+ let c = a.f();
608
623
  for (let d = 0; d < c.count; d++) {
609
624
  let e = c._inner[d];
610
625
  if (e.a != null && (e.a.knownType == 10 || e.a.knownType == 9)) {