igniteui-angular-core 14.1.0 → 14.1.2

package/esm2015/lib/DescriptionTreeReconciler.js

@@ -23,13 +23,13 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
                 let e = b._inner[d];
                 switch (e.a) {
                     case 0:
-                        if (typeCast(DescriptionTreeNode.$, e.g) !== null) {
-                            let f = e.g.f;
+                        if (typeCast(DescriptionTreeNode.$, e.h) !== null) {
+                            let f = e.h.g;
                             c.a.add_1(f);
                         }
-                        e.b.m(e.i, e.f);
-                        if (typeCast(DescriptionTreeNode.$, e.f) !== null) {
-                            let g = e.f.f;
+                        e.c.o(e.j, e.g, e.d);
+                        if (typeCast(DescriptionTreeNode.$, e.g) !== null) {
+                            let g = e.g.g;
                             if (c.a.contains(g)) {
                                 c.a.remove(g);
                             }
@@ -37,23 +37,23 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
                         }
                         break;
                     case 1:
-                        if (typeCast(DescriptionTreeNode.$, e.g) !== null) {
-                            let h = e.g.f;
+                        if (typeCast(DescriptionTreeNode.$, e.h) !== null) {
+                            let h = e.h.g;
                             c.a.add_1(h);
                         }
-                        e.b.l(e.i);
+                        e.c.m(e.j);
                         break;
                     case 3:
                         {
-                            let i = e.b.a(e.i).b;
-                            let j = i[e.e];
+                            let i = e.c.a(e.j).b;
+                            let j = i[e.f];
                             if (typeCast(DescriptionTreeNode.$, j) !== null) {
-                                let k = j.f;
+                                let k = j.g;
                                 c.a.add_1(k);
                             }
-                            i[e.e] = e.f;
-                            if (typeCast(DescriptionTreeNode.$, e.f) !== null) {
-                                let l = e.f.f;
+                            i[e.f] = e.g;
+                            if (typeCast(DescriptionTreeNode.$, e.g) !== null) {
+                                let l = e.g.g;
                                 if (c.a.contains(l)) {
                                     c.a.remove(l);
                                 }
@@ -63,44 +63,44 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
                         break;
                     case 4:
                         {
-                            let m = e.b.a(e.i).b;
-                            let n = m[e.e];
+                            let m = e.c.a(e.j).b;
+                            let n = m[e.f];
                             if (typeCast(DescriptionTreeNode.$, n) !== null) {
-                                let o = n.f;
+                                let o = n.g;
                                 c.a.add_1(o);
                             }
                             let p = new Array(m.length - 1);
                             let q = 0;
                             for (let r = 0; r < m.length; r++) {
-                                if (r != e.e) {
+                                if (r != e.f) {
                                     p[q] = m[r];
                                     q++;
                                 }
                             }
-                            e.b.m(e.i, p);
+                            e.c.n(e.j, p);
                         }
                         break;
                     case 2:
                         {
-                            if (e.b == null && a == null) {
+                            if (e.c == null && a == null) {
                                 c.d.add(e);
                             }
                             else {
-                                let s = e.b.a(e.i).b;
+                                let s = e.c.a(e.j).b;
                                 let t = new Array(s.length + 1);
                                 let u = 0;
                                 for (let v = 0; v < t.length; v++) {
-                                    if (v == e.d) {
-                                        t[v] = e.f;
+                                    if (v == e.e) {
+                                        t[v] = e.g;
                                     }
                                     else {
                                         t[v] = s[u];
                                         u++;
                                     }
                                 }
-                                e.b.m(e.i, t);
-                                if (typeCast(DescriptionTreeNode.$, e.f) !== null) {
-                                    let w = e.f.f;
+                                e.c.n(e.j, t);
+                                if (typeCast(DescriptionTreeNode.$, e.g) !== null) {
+                                    let w = e.g.g;
                                     if (c.a.contains(w)) {
                                         c.a.remove(w);
                                     }
@@ -111,15 +111,15 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
                         break;
                     case 5:
                         {
-                            let x = e.b.a(e.i).b;
+                            let x = e.c.a(e.j).b;
                             for (let y = 0; y < x.length; y++) {
                                 let z = x[y];
                                 if (typeCast(DescriptionTreeNode.$, z) !== null) {
-                                    let aa = z.f;
+                                    let aa = z.g;
                                     c.a.add_1(aa);
                                 }
                             }
-                            e.b.m(e.i, []);
+                            e.c.n(e.j, []);
                         }
                         break;
                 }
@@ -134,31 +134,31 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
             if (a != null && b == null) {
                 let e = new DescriptionTreeAction();
                 e.a = 4;
-                e.e = 0;
-                e.g = a;
-                e.c = null;
-                e.i = null;
+                e.f = 0;
+                e.h = a;
+                e.d = null;
+                e.j = null;
                 d.add(e);
                 return d;
             }
             if (a == null && b != null) {
                 let f = new DescriptionTreeAction();
                 f.a = 2;
-                f.e = 0;
-                f.f = b;
-                f.c = null;
-                f.i = null;
+                f.f = 0;
+                f.g = b;
+                f.d = null;
+                f.j = null;
                 d.add(f);
                 return d;
             }
-            if (b.h != a.h) {
+            if (b.i != a.i) {
                 let g = new DescriptionTreeAction();
                 g.a = 3;
-                g.e = 0;
-                g.g = a;
-                g.f = b;
-                g.c = null;
-                g.i = null;
+                g.f = 0;
+                g.h = a;
+                g.g = b;
+                g.d = null;
+                g.j = null;
                 d.add(g);
                 return d;
             }
@@ -166,7 +166,7 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
             return d;
         }
         static g(a, b, c, d) {
-            c.f = b.f;
+            c.g = b.g;
             let e = DescriptionTreeReconciler.e(b);
             let f = DescriptionTreeReconciler.e(c);
             let g = new List$1(DescriptionPropertyValue.$, 0);
@@ -174,14 +174,14 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
             let i = new List$1(DescriptionPropertyValue.$, 0);
             for (let j = 0; j < e.count; j++) {
                 let k = e._inner[j];
-                if (c.b(k.c)) {
+                if (c.c(k.c)) {
                     if (!Base.equalsStatic(k, c.a(k.c))) {
                         let l = c.a(k.c);
                         if (typeCast(DescriptionTreeNode.$, k.b) !== null && typeCast(DescriptionTreeNode.$, l.b) !== null) {
                             let m = k.b;
                             let n = l.b;
-                            if (m.h == n.h) {
-                                if ((!m.b("Name") && !n.b("Name")) || (m.b("Name") && n.b("Name") && (m.a("Name").b == n.a("Name").b))) {
+                            if (m.i == n.i) {
+                                if ((!m.c("Name") && !n.c("Name")) || (m.c("Name") && n.c("Name") && (m.a("Name").b == n.a("Name").b))) {
                                     DescriptionTreeReconciler.g(a, m, n, d);
                                 }
                                 else {
@@ -205,29 +205,31 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
             }
             for (let o = 0; o < f.count; o++) {
                 let p = f._inner[o];
-                if (!b.b(p.c)) {
+                if (!b.c(p.c)) {
                     h.add(p);
                 }
             }
             for (let q = 0; q < g.count; q++) {
                 let r = g._inner[q];
                 let s = new DescriptionTreeAction();
-                s.b = b;
+                s.c = b;
+                s.b = c;
                 s.a = 1;
-                s.i = r.c;
-                s.c = r.a;
-                s.g = r.b;
+                s.j = r.c;
+                s.d = r.a;
+                s.h = r.b;
                 a.add(s);
             }
             for (let t = 0; t < h.count; t++) {
                 let u = h._inner[t];
                 let v = new DescriptionTreeAction();
-                v.b = b;
+                v.c = b;
+                v.b = c;
                 v.a = 0;
-                v.i = u.c;
-                v.c = u.a;
-                v.f = u.b;
-                v.g = null;
+                v.j = u.c;
+                v.d = u.a;
+                v.g = u.b;
+                v.h = null;
                 a.add(v);
             }
             for (let w = 0; w < i.count; w++) {
@@ -236,12 +238,13 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
                 let z = x.b;
                 if (!Base.equalsStatic(z, y)) {
                     let aa = new DescriptionTreeAction();
-                    aa.b = b;
+                    aa.c = b;
+                    aa.b = c;
                     aa.a = 0;
-                    aa.i = x.c;
-                    aa.c = x.a;
-                    aa.f = x.b;
-                    aa.g = b.a(x.c).b;
+                    aa.j = x.c;
+                    aa.d = x.a;
+                    aa.g = x.b;
+                    aa.h = b.a(x.c).b;
                     a.add(aa);
                 }
             }
@@ -252,7 +255,7 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
             let af = new List$1(DescriptionPropertyValue.$, 0);
             for (let ag = 0; ag < ab.count; ag++) {
                 let ah = ab._inner[ag];
-                if (c.b(ah.c)) {
+                if (c.c(ah.c)) {
                     if (!DescriptionTreeReconciler.b(ah.b, c.a(ah.c).b)) {
                         af.add(c.a(ah.c));
                     }
@@ -265,33 +268,35 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
                             if (typeCast(DescriptionTreeNode.$, al) !== null && typeCast(DescriptionTreeNode.$, am) !== null) {
                                 let an = al;
                                 let ao = am;
-                                if (an.h == ao.h) {
+                                if (an.i == ao.i) {
                                     DescriptionTreeReconciler.g(a, an, ao, d);
                                 }
                                 else {
                                     let ap = new DescriptionTreeAction();
-                                    ap.i = ah.c;
-                                    ap.c = ah.a;
-                                    ap.b = b;
+                                    ap.j = ah.c;
+                                    ap.d = ah.a;
+                                    ap.c = b;
+                                    ap.b = c;
                                     ap.a = 3;
+                                    ap.f = ak;
                                     ap.e = ak;
-                                    ap.d = ak;
-                                    ap.g = an;
-                                    ap.f = ao;
+                                    ap.h = an;
+                                    ap.g = ao;
                                     a.add(ap);
                                 }
                             }
                             else {
                                 if (!Base.equalsStatic(al, am)) {
                                     let aq = new DescriptionTreeAction();
-                                    aq.i = ah.c;
-                                    aq.c = ah.a;
-                                    aq.b = b;
+                                    aq.j = ah.c;
+                                    aq.d = ah.a;
+                                    aq.c = b;
+                                    aq.b = c;
                                     aq.a = 3;
+                                    aq.f = ak;
                                     aq.e = ak;
-                                    aq.d = ak;
-                                    aq.g = al;
-                                    aq.f = am;
+                                    aq.h = al;
+                                    aq.g = am;
                                     a.add(aq);
                                 }
                             }
@@ -306,29 +311,31 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
             }
             for (let ar = 0; ar < ac.count; ar++) {
                 let as = ac._inner[ar];
-                if (!b.b(as.c)) {
+                if (!b.c(as.c)) {
                     ae.add(as);
                 }
             }
             for (let at = 0; at < ad.count; at++) {
                 let au = ad._inner[at];
                 let av = new DescriptionTreeAction();
-                av.b = b;
-                av.i = au.c;
-                av.c = au.a;
+                av.c = b;
+                av.b = c;
+                av.j = au.c;
+                av.d = au.a;
                 av.a = 5;
-                av.g = au.b;
+                av.h = au.b;
                 a.add(av);
             }
             for (let aw = 0; aw < ae.count; aw++) {
                 let ax = ae._inner[aw];
                 let ay = new DescriptionTreeAction();
-                ay.b = b;
-                ay.i = ax.c;
-                ay.c = ax.a;
+                ay.c = b;
+                ay.b = c;
+                ay.j = ax.c;
+                ay.d = ax.a;
                 ay.a = 0;
-                ay.g = null;
-                ay.f = ax.b;
+                ay.h = null;
+                ay.g = ax.b;
                 a.add(ay);
             }
             for (let az = 0; az < af.count; az++) {
@@ -339,7 +346,7 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
             if (a == null) {
                 return "UNKOWN";
             }
-            if (!a.b("Type")) {
+            if (!a.c("Type")) {
                 return "UNKOWN";
             }
             return a.a("Type").b;
@@ -351,10 +358,10 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
             if (h.length > 0) {
                 if (typeCast(DescriptionTreeNode.$, h[0]) !== null) {
                     let j = h[0];
-                    if (j.b("Name") && j.a("Name") != null) {
+                    if (j.c("Name") && j.a("Name") != null) {
                         g = true;
                     }
-                    if (j.b("RefType") && j.a("RefType").b == "uuid") {
+                    if (j.c("RefType") && j.a("RefType").b == "uuid") {
                         g = true;
                     }
                 }
@@ -362,10 +369,10 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
             if (i.length > 0) {
                 if (typeCast(DescriptionTreeNode.$, i[0]) !== null) {
                     let k = i[0];
-                    if (k.b("Name") && k.a("Name") != null) {
+                    if (k.c("Name") && k.a("Name") != null) {
                         g = true;
                     }
-                    if (k.b("RefType") && k.a("RefType").b == "uuid") {
+                    if (k.c("RefType") && k.a("RefType").b == "uuid") {
                         g = true;
                     }
                 }
@@ -380,7 +387,7 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
                     let r = new DescriptionTreeReconciler_TreeModeData();
                     r.a = h[q];
                     r.d = q;
-                    r.f = r.a.b("Name") ? r.a.a("Name").b : r.a.b("RefType") ? r.a.a("Value").b : null;
+                    r.f = r.a.c("Name") ? r.a.a("Name").b : r.a.c("RefType") ? r.a.a("Value").b : null;
                     if (r.f == null) {
                         r.f = "BADKEY_" + p.toString();
                         p++;
@@ -392,7 +399,7 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
                     let t = new DescriptionTreeReconciler_TreeModeData();
                     t.a = i[s];
                     t.d = s;
-                    t.f = t.a.b("Name") ? t.a.a("Name").b : t.a.b("RefType") ? t.a.a("Value").b : null;
+                    t.f = t.a.c("Name") ? t.a.a("Name").b : t.a.c("RefType") ? t.a.a("Value").b : null;
                     if (t.f == null) {
                         t.f = "BADKEY_" + p.toString();
                         p++;
@@ -419,12 +426,13 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
                     let z = m._inner[y];
                     if (z.c) {
                         let aa = new DescriptionTreeAction();
-                        aa.i = e.c;
-                        aa.b = b;
-                        aa.c = e.a;
-                        aa.e = z.d;
+                        aa.j = e.c;
+                        aa.c = b;
+                        aa.b = c;
+                        aa.d = e.a;
+                        aa.f = z.d;
                         aa.a = 4;
-                        aa.g = z.a;
+                        aa.h = z.a;
                         a.add(aa);
                         for (let ab = y + 1; ab < m.count; ab++) {
                             let ac = m._inner[ab];
@@ -436,12 +444,13 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
                     let ae = o._inner[ad];
                     if (ae.b) {
                         let af = new DescriptionTreeAction();
-                        af.i = e.c;
-                        af.b = b;
-                        af.c = e.a;
-                        af.d = ad;
+                        af.j = e.c;
+                        af.c = b;
+                        af.b = c;
+                        af.d = e.a;
+                        af.e = ad;
                         af.a = 2;
-                        af.f = i[ad];
+                        af.g = i[ad];
                         a.add(af);
                         for (let ag = 0; ag < m.count; ag++) {
                             let ah = m._inner[ag];
@@ -457,12 +466,13 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
                             continue;
                         }
                         let aj = new DescriptionTreeAction();
-                        aj.i = e.c;
-                        aj.b = b;
-                        aj.c = e.a;
-                        aj.e = ai.d;
+                        aj.j = e.c;
+                        aj.c = b;
+                        aj.b = c;
+                        aj.d = e.a;
+                        aj.f = ai.d;
                         aj.a = 4;
-                        aj.g = ai.a;
+                        aj.h = ai.a;
                         a.add(aj);
                         for (let ak = 0; ak < m.count; ak++) {
                             let al = m._inner[ak];
@@ -471,12 +481,13 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
                             }
                         }
                         aj = new DescriptionTreeAction();
-                        aj.i = e.c;
-                        aj.b = b;
-                        aj.c = e.a;
-                        aj.d = ai.e;
+                        aj.j = e.c;
+                        aj.c = b;
+                        aj.b = c;
+                        aj.d = e.a;
+                        aj.e = ai.e;
                         aj.a = 2;
-                        aj.f = ai.a;
+                        aj.g = ai.a;
                         a.add(aj);
                         ai.d = ai.e;
                         for (let am = 0; am < m.count; am++) {
@@ -494,22 +505,24 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
                 for (let ap = 0; ap < ao; ap++) {
                     if (ap >= h.length) {
                         let aq = new DescriptionTreeAction();
-                        aq.i = e.c;
-                        aq.b = b;
-                        aq.c = e.a;
-                        aq.d = ap;
+                        aq.j = e.c;
+                        aq.c = b;
+                        aq.b = c;
+                        aq.d = e.a;
+                        aq.e = ap;
                         aq.a = 2;
-                        aq.f = i[ap];
+                        aq.g = i[ap];
                         a.add(aq);
                     }
                     else if (ap >= i.length) {
                         let ar = new DescriptionTreeAction();
-                        ar.i = e.c;
-                        ar.b = b;
-                        ar.c = e.a;
-                        ar.e = i.length;
+                        ar.j = e.c;
+                        ar.c = b;
+                        ar.b = c;
+                        ar.d = e.a;
+                        ar.f = i.length;
                         ar.a = 4;
-                        ar.g = h[ap];
+                        ar.h = h[ap];
                         a.add(ar);
                     }
                     else {
@@ -518,31 +531,33 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
                         if (typeCast(DescriptionTreeNode.$, as) !== null && typeCast(DescriptionTreeNode.$, at) !== null) {
                             let au = as;
                             let av = at;
-                            if (au.h == av.h) {
+                            if (au.i == av.i) {
                                 DescriptionTreeReconciler.g(a, au, av, f);
                             }
                             else {
                                 let aw = new DescriptionTreeAction();
-                                aw.i = e.c;
-                                aw.b = b;
-                                aw.c = e.a;
-                                aw.e = ap;
+                                aw.j = e.c;
+                                aw.c = b;
+                                aw.b = c;
+                                aw.d = e.a;
+                                aw.f = ap;
                                 aw.a = 3;
-                                aw.g = h[ap];
-                                aw.f = i[ap];
+                                aw.h = h[ap];
+                                aw.g = i[ap];
                                 a.add(aw);
                             }
                         }
                         else {
                             if (!Base.equalsStatic(as, at)) {
                                 let ax = new DescriptionTreeAction();
-                                ax.i = e.c;
-                                ax.b = b;
-                                ax.c = e.a;
-                                ax.e = ap;
+                                ax.j = e.c;
+                                ax.c = b;
+                                ax.b = c;
+                                ax.d = e.a;
+                                ax.f = ap;
                                 ax.a = 3;
-                                ax.g = h[ap];
-                                ax.f = i[ap];
+                                ax.h = h[ap];
+                                ax.g = i[ap];
                                 a.add(ax);
                             }
                         }
@@ -574,11 +589,11 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
                 if (typeCast(DescriptionTreeNode.$, f) !== null) {
                     let h = f;
                     let i = g;
-                    if (h.h != i.h) {
+                    if (h.i != i.i) {
                         return false;
                     }
-                    let j = h.b("Name") ? h.a("Name").b : null;
-                    let k = i.b("Name") ? i.a("Name").b : null;
+                    let j = h.c("Name") ? h.a("Name").b : null;
+                    let k = i.c("Name") ? i.a("Name").b : null;
                     if (!Base.equalsStatic(j, k)) {
                         return false;
                     }
@@ -593,7 +608,7 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
         }
         static e(a) {
             let b = new List$1(DescriptionPropertyValue.$, 0);
-            let c = a.e();
+            let c = a.f();
             for (let d = 0; d < c.count; d++) {
                 let e = c._inner[d];
                 if (e.a != null && e.a.knownType != 10 && e.a.knownType != 9) {
@@ -604,7 +619,7 @@ export let DescriptionTreeReconciler = /*@__PURE__*/ (() => {
         }
         static d(a) {
             let b = new List$1(DescriptionPropertyValue.$, 0);
-            let c = a.e();
+            let c = a.f();
             for (let d = 0; d < c.count; d++) {
                 let e = c._inner[d];
                 if (e.a != null && (e.a.knownType == 10 || e.a.knownType == 9)) {

package/esm2015/lib/DetrendedPriceOscillatorIndicatorDescription.js

@@ -13,16 +13,16 @@ export let DetrendedPriceOscillatorIndicatorDescription = /*@__PURE__*/ (() => {
     class DetrendedPriceOscillatorIndicatorDescription extends StrategyBasedIndicatorDescription {
         constructor() {
             super();
-            this.d9 = 0;
+            this.eb = 0;
         }
         get_type() {
             return "DetrendedPriceOscillatorIndicator";
         }
         get period() {
-            return this.d9;
+            return this.eb;
         }
         set period(a) {
-            this.d9 = a;
+            this.eb = a;
             this.e("Period");
         }
     }

package/esm2015/lib/DivBridge.js

@@ -39,7 +39,7 @@ export let DivBridge = /*@__PURE__*/ (() => {
                     let f = a.getChildAt(e);
                     f.remove();
                 }
-                a.append(b.u);
+                a.append(b.v);
             }
         }
         setValue(a, b, c) {