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