@splunk/react-ui 4.38.0 → 4.39.0

package/Tree.js

@@ -29,21 +29,21 @@
     /******/    var r = {};
     /******/
     /******/ // The require function
-    /******/    function t(n) {
+    /******/    function n(t) {
         /******/ // Check if module is in cache
-        /******/ var o = r[n];
+        /******/ var o = r[t];
         /******/        if (o !== undefined) {
             /******/ return o.exports;
             /******/        }
         /******/ // Create a new module (and put it into the cache)
-        /******/        var a = r[n] = {
+        /******/        var a = r[t] = {
             /******/ // no module.id needed
             /******/ // no module.loaded needed
             /******/ exports: {}
             /******/        };
         /******/
         /******/ // Execute the module function
-        /******/        e[n](a, a.exports, t);
+        /******/        e[t](a, a.exports, n);
         /******/
         /******/ // Return the exports of the module
         /******/        return a.exports;
@@ -53,12 +53,12 @@
     /******/ /* webpack/runtime/compat get default export */
     /******/    (() => {
         /******/ // getDefaultExport function for compatibility with non-harmony modules
-        /******/ t.n = e => {
+        /******/ n.n = e => {
             /******/ var r = e && e.__esModule ? 
             /******/ () => e["default"]
             /******/ : () => e
             /******/;
-            t.d(r, {
+            n.d(r, {
                 a: r
             });
             /******/            return r;
@@ -68,12 +68,12 @@
     /******/ /* webpack/runtime/define property getters */
     /******/    (() => {
         /******/ // define getter functions for harmony exports
-        /******/ t.d = (e, r) => {
-            /******/ for (var n in r) {
-                /******/ if (t.o(r, n) && !t.o(e, n)) {
-                    /******/ Object.defineProperty(e, n, {
+        /******/ n.d = (e, r) => {
+            /******/ for (var t in r) {
+                /******/ if (n.o(r, t) && !n.o(e, t)) {
+                    /******/ Object.defineProperty(e, t, {
                         enumerable: true,
-                        get: r[n]
+                        get: r[t]
                     });
                     /******/                }
                 /******/            }
@@ -82,14 +82,14 @@
     /******/
     /******/ /* webpack/runtime/hasOwnProperty shorthand */
     /******/    (() => {
-        /******/ t.o = (e, r) => Object.prototype.hasOwnProperty.call(e, r)
+        /******/ n.o = (e, r) => Object.prototype.hasOwnProperty.call(e, r)
         /******/;
     })();
     /******/
     /******/ /* webpack/runtime/make namespace object */
     /******/    (() => {
         /******/ // define __esModule on exports
-        /******/ t.r = e => {
+        /******/ n.r = e => {
             /******/ if (typeof Symbol !== "undefined" && Symbol.toStringTag) {
                 /******/ Object.defineProperty(e, Symbol.toStringTag, {
                     value: "Module"
@@ -101,65 +101,62 @@
             /******/        };
         /******/    })();
     /******/
-    /************************************************************************/    var n = {};
+    /************************************************************************/    var t = {};
     // This entry need to be wrapped in an IIFE because it need to be isolated against other modules in the chunk.
         (() => {
         // ESM COMPAT FLAG
-        t.r(n);
+        n.r(t);
         // EXPORTS
-                t.d(n, {
-            TreeItem: () => /* reexport */ A,
+                n.d(t, {
+            TreeItem: () => /* reexport */ x,
             default: () => /* reexport */ re
         });
         // EXTERNAL MODULE: external "react"
-                var e = t(9497);
-        var r =  t.n(e);
+                var e = n(9497);
+        var r =  n.n(e);
         // EXTERNAL MODULE: external "prop-types"
-                var o = t(23);
-        var a =  t.n(o);
+                var o = n(23);
+        var a =  n.n(o);
         // EXTERNAL MODULE: external "@splunk/ui-utils/keyboard"
-                var i = t(5295);
+                var i = n(5295);
         // CONCATENATED MODULE: ./src/Tree/TreeContext.tsx
-        var u =  (0, e.createContext)({
+        var l =  (0, e.createContext)({
             defaultIndent: true
         });
-        /* harmony default export */        const l = u;
+        /* harmony default export */        const u = l;
         // EXTERNAL MODULE: external "styled-components"
-                var f = t(232);
-        var c =  t.n(f);
+                var c = n(232);
+        var f =  n.n(c);
         // EXTERNAL MODULE: external "@splunk/themes"
-                var d = t(3563);
+                var d = n(3563);
         // CONCATENATED MODULE: ./src/Tree/TreeItemStyles.ts
-        var v = c().span.withConfig({
+        var v = f().span.withConfig({
             displayName: "TreeItemStyles__StyledTreeItemContent",
             componentId: "ie7zrw-0"
         })([ "font-family:inherit;" ]);
-        var s = c().span.withConfig({
+        var s = f().span.withConfig({
             displayName: "TreeItemStyles__StyledTreeItemNode",
             componentId: "ie7zrw-1"
         })([ "&:focus{box-shadow:", ";outline:0;&:active{box-shadow:none;}}" ], d.variables.focusShadow);
         // CONCATENATED MODULE: ./src/Tree/TreeStyles.ts
-        var p = c().ul.withConfig({
+        var p = f().ul.withConfig({
             displayName: "TreeStyles__StyledUnorderedList",
             componentId: "sc-13pokwt-0"
         })([ "", ";font-family:inherit;list-style:none;white-space:inherit;", ";" ], d.mixins.reset("ul"), (function(e) {
             var r = e.$defaultIndent;
-            return r && (0, f.css)([ "padding-left:", ";" ], d.variables.spacingXXXLarge);
+            return r && (0, c.css)([ "padding-left:", ";" ], d.variables.spacingXXXLarge);
         }));
         // CONCATENATED MODULE: ./src/Tree/TreeItem.tsx
         function y() {
-            y = Object.assign || function(e) {
+            return y = Object.assign ? Object.assign.bind() : function(e) {
                 for (var r = 1; r < arguments.length; r++) {
-                    var t = arguments[r];
-                    for (var n in t) {
-                        if (Object.prototype.hasOwnProperty.call(t, n)) {
-                            e[n] = t[n];
-                        }
+                    var n = arguments[r];
+                    for (var t in n) {
+                        ({}).hasOwnProperty.call(n, t) && (e[t] = n[t]);
                     }
                 }
                 return e;
-            };
-            return y.apply(this, arguments);
+            }, y.apply(null, arguments);
         }
         function m(e, r) {
             return w(e) || I(e, r) || g(e, r) || b();
@@ -168,72 +165,65 @@
             throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
         }
         function g(e, r) {
-            if (!e) return;
-            if (typeof e === "string") return h(e, r);
-            var t = Object.prototype.toString.call(e).slice(8, -1);
-            if (t === "Object" && e.constructor) t = e.constructor.name;
-            if (t === "Map" || t === "Set") return Array.from(e);
-            if (t === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t)) return h(e, r);
+            if (e) {
+                if ("string" == typeof e) return h(e, r);
+                var n = {}.toString.call(e).slice(8, -1);
+                return "Object" === n && e.constructor && (n = e.constructor.name), "Map" === n || "Set" === n ? Array.from(e) : "Arguments" === n || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n) ? h(e, r) : void 0;
+            }
         }
         function h(e, r) {
-            if (r == null || r > e.length) r = e.length;
-            for (var t = 0, n = new Array(r); t < r; t++) {
-                n[t] = e[t];
+            (null == r || r > e.length) && (r = e.length);
+            for (var n = 0, t = Array(r); n < r; n++) {
+                t[n] = e[n];
             }
-            return n;
+            return t;
         }
         function I(e, r) {
-            if (typeof Symbol === "undefined" || !(Symbol.iterator in Object(e))) return;
-            var t = [];
-            var n = true;
-            var o = false;
-            var a = undefined;
-            try {
-                for (var i = e[Symbol.iterator](), u; !(n = (u = i.next()).done); n = true) {
-                    t.push(u.value);
-                    if (r && t.length === r) break;
-                }
-            } catch (e) {
-                o = true;
-                a = e;
-            } finally {
+            var n = null == e ? null : "undefined" != typeof Symbol && e[Symbol.iterator] || e["@@iterator"];
+            if (null != n) {
+                var t, o, a, i, l = [], u = !0, c = !1;
                 try {
-                    if (!n && i["return"] != null) i["return"]();
+                    if (a = (n = n.call(e)).next, 0 === r) {
+                        if (Object(n) !== n) return;
+                        u = !1;
+                    } else for (;!(u = (t = a.call(n)).done) && (l.push(t.value), l.length !== r); u = !0) {
+                    }
+                } catch (e) {
+                    c = !0, o = e;
                 } finally {
-                    if (o) throw a;
+                    try {
+                        if (!u && null != n["return"] && (i = n["return"](), Object(i) !== i)) return;
+                    } finally {
+                        if (c) throw o;
+                    }
                 }
+                return l;
             }
-            return t;
         }
         function w(e) {
             if (Array.isArray(e)) return e;
         }
         function S(e, r) {
-            if (e == null) return {};
-            var t = O(e, r);
-            var n, o;
+            if (null == e) return {};
+            var n, t, o = O(e, r);
             if (Object.getOwnPropertySymbols) {
                 var a = Object.getOwnPropertySymbols(e);
-                for (o = 0; o < a.length; o++) {
-                    n = a[o];
-                    if (r.indexOf(n) >= 0) continue;
-                    if (!Object.prototype.propertyIsEnumerable.call(e, n)) continue;
-                    t[n] = e[n];
+                for (t = 0; t < a.length; t++) {
+                    n = a[t], r.includes(n) || {}.propertyIsEnumerable.call(e, n) && (o[n] = e[n]);
                 }
             }
-            return t;
+            return o;
         }
         function O(e, r) {
-            if (e == null) return {};
-            var t = {};
-            var n = Object.keys(e);
-            var o, a;
-            for (a = 0; a < n.length; a++) {
-                o = n[a];
-                if (r.indexOf(o) >= 0) continue;
-                t[o] = e[o];
+            if (null == e) return {};
+            var n = {};
+            for (var t in e) {
+                if ({}.hasOwnProperty.call(e, t)) {
+                    if (r.includes(t)) continue;
+                    n[t] = e[t];
+                }
             }
-            return t;
+            return n;
         }
         var j = {
             id: a().string,
@@ -248,44 +238,44 @@
             open: a().bool,
             toggle: a().node
         };
-        function x(t) {
-            var n = t.id, o = t.children, a = t.content, i = t.customIndent, u = t.endAdornment, f = t.labelledBy, c = t.onFocus, d = t.onKeyDown, b = t.onToggle, g = t.open, h = g === void 0 ? true : g, I = t.toggle, w = S(t, [ "id", "children", "content", "customIndent", "endAdornment", "labelledBy", "onFocus", "onKeyDown", "onToggle", "open", "toggle" ]);
-            var O = (0, e.useContext)(l), j = O.defaultIndent, x = j === void 0 ? true : j, A = O.onItemKeyDown, k = O.onItemClick, E = O.removeNode, T = O.setNode, P = O.itemPaths, C = O.focusedItemId;
-            var D = (0, e.useState)(h), _ = m(D, 2), N = _[0], $ = _[1];
+        function A(n) {
+            var t = n.id, o = n.children, a = n.content, i = n.customIndent, l = n.endAdornment, c = n.labelledBy, f = n.onFocus, d = n.onKeyDown, b = n.onToggle, g = n.open, h = g === void 0 ? true : g, I = n.toggle, w = S(n, [ "id", "children", "content", "customIndent", "endAdornment", "labelledBy", "onFocus", "onKeyDown", "onToggle", "open", "toggle" ]);
+            var O = (0, e.useContext)(u), j = O.defaultIndent, A = j === void 0 ? true : j, x = O.onItemKeyDown, E = O.onItemClick, P = O.removeNode, T = O.setNode, k = O.itemPaths, C = O.focusedItemId;
+            var D = (0, e.useState)(h), _ = m(D, 2), M = _[0], N = _[1];
  // make first tree item tabbable
-                        var K = (0, e.useState)((P === null || P === void 0 ? void 0 : P.get("".concat(n))) === "0" ? 0 : -1), M = m(K, 2), F = M[0], q = M[1];
+                        var $ = (0, e.useState)((k === null || k === void 0 ? void 0 : k.get("".concat(t))) === "0" ? 0 : -1), K = m($, 2), F = K[0], q = K[1];
             var B = (0, e.useRef)(null);
             var U = (0, e.useRef)(null);
             var X = e.Children.toArray(o).filter(e.isValidElement);
             X.forEach((function(e, r) {
                 if (e.props.id) {
-                    if (N && T) {
-                        T("".concat(e.props.id), "".concat(P === null || P === void 0 ? void 0 : P.get("".concat(n)), "-").concat(r));
-                    } else if (E) {
-                        E(e.props.id);
+                    if (M && T) {
+                        T("".concat(e.props.id), "".concat(k === null || k === void 0 ? void 0 : k.get("".concat(t)), "-").concat(r));
+                    } else if (P) {
+                        P(e.props.id);
                     }
                 }
             }));
-            var z = function e(r, t) {
-                $(r);
-                b === null || b === void 0 ? void 0 : b(r, t);
+            var z = function e(r, n) {
+                N(r);
+                b === null || b === void 0 ? void 0 : b(r, n);
             };
             var L = function e(r) {
-                k === null || k === void 0 ? void 0 : k(r, n);
+                E === null || E === void 0 ? void 0 : E(r, t);
             };
             var R = function e(r) {
-                var t;
+                var n;
                 r.stopPropagation();
-                B === null || B === void 0 ? void 0 : (t = B.current) === null || t === void 0 ? void 0 : t.focus();
-                c === null || c === void 0 ? void 0 : c(r);
+                B === null || B === void 0 ? void 0 : (n = B.current) === null || n === void 0 ? void 0 : n.focus();
+                f === null || f === void 0 ? void 0 : f(r);
             };
             var V = function e() {
-                if ((P === null || P === void 0 ? void 0 : P.get("".concat(n))) === "0") {
+                if ((k === null || k === void 0 ? void 0 : k.get("".concat(t))) === "0") {
                     q(0);
                 }
             };
             (0, e.useEffect)((function() {
-                if (C === n) {
+                if (C === t) {
                     var e;
                     U === null || U === void 0 ? void 0 : (e = U.current) === null || e === void 0 ? void 0 : e.focus();
                 }
@@ -295,12 +285,12 @@
             };
             var H = function e(r) {
                 r.stopPropagation();
- // Used to ensure first item in Tree is tab navigable, i.e. in JSONTree when focus is manually set to the root item,
+                // Used to ensure first item in Tree is tab navigable, i.e. in JSONTree when focus is manually set to the root item,
                 // this allows user to tab backwards to previous item. Tab index is reset to 0 onBlur.
-                                if (r.shiftKey && r.key === "Tab" && (P === null || P === void 0 ? void 0 : P.get("".concat(n))) === "0") {
+                                if (r.shiftKey && r.key === "Tab" && (k === null || k === void 0 ? void 0 : k.get("".concat(t))) === "0") {
                     q(-1);
                 }
-                A === null || A === void 0 ? void 0 : A(r, n, N, X, z);
+                x === null || x === void 0 ? void 0 : x(r, t, M, X, z);
                 d === null || d === void 0 ? void 0 : d(r);
             };
             var J = function r() {
@@ -310,12 +300,12 @@
                 
                 return (0, e.cloneElement)(I, {
                     onClick: function e(r) {
-                        var t, n;
-                        z(!N, r);
+                        var n, t;
+                        z(!M, r);
                         L(r);
-                        (t = (n = I.props).onClick) === null || t === void 0 ? void 0 : t.call(n, r);
+                        (n = (t = I.props).onClick) === null || n === void 0 ? void 0 : n.call(t, r);
                     },
-                    "aria-expanded": N
+                    "aria-expanded": M
                 });
             };
             
@@ -326,64 +316,62 @@
                 onFocus: R,
                 onKeyDown: H,
                 role: "treeitem",
-                "aria-labelledby": f,
-                "aria-expanded": X.length ? N : undefined
+                "aria-labelledby": c,
+                "aria-expanded": X.length ? M : undefined
             }), i,  r().createElement(s, {
                 ref: B,
                 tabIndex: -1,
                 onFocus: G,
                 onClick: L
-            },  r().createElement(v, null, a), J(), !N && u), N &&  r().createElement(r().Fragment, null,  r().createElement(p, {
+            },  r().createElement(v, null, a), J(), !M && l), M &&  r().createElement(r().Fragment, null,  r().createElement(p, {
                 role: "group",
-                $defaultIndent: x
-            }, o), u));
+                $defaultIndent: A
+            }, o), l));
         }
-        x.propTypes = j;
-        /* harmony default export */        const A = x;
+        A.propTypes = j;
+        /* harmony default export */        const x = A;
         // CONCATENATED MODULE: ./src/Tree/treeUtils.ts
-        function k(e, r) {
-            return D(e) || C(e, r) || T(e, r) || E();
+        function E(e, r) {
+            return D(e) || C(e, r) || T(e, r) || P();
         }
-        function E() {
+        function P() {
             throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
         }
         function T(e, r) {
-            if (!e) return;
-            if (typeof e === "string") return P(e, r);
-            var t = Object.prototype.toString.call(e).slice(8, -1);
-            if (t === "Object" && e.constructor) t = e.constructor.name;
-            if (t === "Map" || t === "Set") return Array.from(e);
-            if (t === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t)) return P(e, r);
-        }
-        function P(e, r) {
-            if (r == null || r > e.length) r = e.length;
-            for (var t = 0, n = new Array(r); t < r; t++) {
-                n[t] = e[t];
+            if (e) {
+                if ("string" == typeof e) return k(e, r);
+                var n = {}.toString.call(e).slice(8, -1);
+                return "Object" === n && e.constructor && (n = e.constructor.name), "Map" === n || "Set" === n ? Array.from(e) : "Arguments" === n || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n) ? k(e, r) : void 0;
             }
-            return n;
+        }
+        function k(e, r) {
+            (null == r || r > e.length) && (r = e.length);
+            for (var n = 0, t = Array(r); n < r; n++) {
+                t[n] = e[n];
+            }
+            return t;
         }
         function C(e, r) {
-            if (typeof Symbol === "undefined" || !(Symbol.iterator in Object(e))) return;
-            var t = [];
-            var n = true;
-            var o = false;
-            var a = undefined;
-            try {
-                for (var i = e[Symbol.iterator](), u; !(n = (u = i.next()).done); n = true) {
-                    t.push(u.value);
-                    if (r && t.length === r) break;
-                }
-            } catch (e) {
-                o = true;
-                a = e;
-            } finally {
+            var n = null == e ? null : "undefined" != typeof Symbol && e[Symbol.iterator] || e["@@iterator"];
+            if (null != n) {
+                var t, o, a, i, l = [], u = !0, c = !1;
                 try {
-                    if (!n && i["return"] != null) i["return"]();
+                    if (a = (n = n.call(e)).next, 0 === r) {
+                        if (Object(n) !== n) return;
+                        u = !1;
+                    } else for (;!(u = (t = a.call(n)).done) && (l.push(t.value), l.length !== r); u = !0) {
+                    }
+                } catch (e) {
+                    c = !0, o = e;
                 } finally {
-                    if (o) throw a;
+                    try {
+                        if (!u && null != n["return"] && (i = n["return"](), Object(i) !== i)) return;
+                    } finally {
+                        if (c) throw o;
+                    }
                 }
+                return l;
             }
-            return t;
         }
         function D(e) {
             if (Array.isArray(e)) return e;
@@ -391,110 +379,110 @@
         /**
  * A helper function to get first key in Map that matches given value
  */        function _(e, r) {
-            var t;
-            var n = Array.from(e.entries());
-            return (t = n.find((function(e) {
-                var t = k(e, 2), n = t[1];
-                return n === r;
-            }))) === null || t === void 0 ? void 0 : t[0];
+            var n;
+            var t = Array.from(e.entries());
+            return (n = t.find((function(e) {
+                var n = E(e, 2), t = n[1];
+                return t === r;
+            }))) === null || n === void 0 ? void 0 : n[0];
         }
         /**
  * A helper function to get parent path of current item path
- */        function N(e) {
+ */        function M(e) {
             // remove last index number of the current item path string to get parent
             return e.split("-").slice(0, -1).join("-");
         }
         /**
  * A helper function to get next path of current item path in same level
- */        function $(e, r) {
+ */        function N(e, r) {
             return e === null || e === void 0 ? void 0 : e.replace(/([^-]*)$/, "".concat(r + 1));
         }
         /**
  * A helper function to get the last index number of an item path string
- */        function K(e) {
+ */        function $(e) {
             var r = e.split("-").pop();
             if (!r) {
                 return 0;
             }
             return parseInt(r, 10) || 0;
         }
-        function M(e, r) {
-            var t = e.get(r);
-            if (!t) {
+        function K(e, r) {
+            var n = e.get(r);
+            if (!n) {
                 return r;
             }
-            var n = N(t);
-            return _(e, n) || r;
+            var t = M(n);
+            return _(e, t) || r;
         }
         /**
  * A helper function for getNextTreeItem
  */        function F(e, r) {
-            var t = N(r);
-            if (!t) {
+            var n = M(r);
+            if (!n) {
                 return _(e, r);
             }
- // get next node in the parent level
-                        var n = K(t);
-            var o = $(t, n);
+            // get next node in the parent level
+                        var t = $(n);
+            var o = N(n, t);
             var a = _(e, o);
             if (a) {
                 return a;
             }
- // continue getting parents until find next node or reach root
+            // continue getting parents until find next node or reach root
                         return F(e, o);
         }
         function q(e, r) {
-            var t = e.get(r);
-            if (!t) {
+            var n = e.get(r);
+            if (!n) {
                 return r;
             }
- // case where next tree item is the first visible child
-                        var n = _(e, "".concat(t, "-0"));
-            if (n) {
-                return n;
+            // case where next tree item is the first visible child
+                        var t = _(e, "".concat(n, "-0"));
+            if (t) {
+                return t;
             }
- // case where next tree item is the next node in the same level
-                        var o = K(t);
-            var a = $(t, o);
+            // case where next tree item is the next node in the same level
+                        var o = $(n);
+            var a = N(n, o);
             var i = _(e, a);
             if (i) {
                 return i;
             }
- // case where next tree item is a higher level or does not exist
-                        return F(e, t) || r;
+            // case where next tree item is a higher level or does not exist
+                        return F(e, n) || r;
         }
         /**
  * A helper function for getPrevTreeItem
  */        function B(e, r) {
-            var t = _(e, "".concat(r, "-0"));
-            if (!t) {
+            var n = _(e, "".concat(r, "-0"));
+            if (!n) {
                 return _(e, r);
             }
-            var n = _(e, r);
+            var t = _(e, r);
             var o = "".concat(r, "-0");
- // get the last child in current node, and continue to find its children recursively
-                        while (n) {
-                var a = K(o);
-                var i = $(o, a);
-                n = _(e, i);
-                if (n) {
+            // get the last child in current node, and continue to find its children recursively
+                        while (t) {
+                var a = $(o);
+                var i = N(o, a);
+                t = _(e, i);
+                if (t) {
                     o = i;
                 }
             }
             return B(e, o);
         }
         function U(e, r) {
-            var t = e.get(r);
-            if (!t) {
+            var n = e.get(r);
+            if (!n) {
                 return r;
             }
-            var n = K(t);
- // case where current is first child of parent or root item
-                        if (n === 0) {
-                return M(e, r);
+            var t = $(n);
+            // case where current is first child of parent or root item
+                        if (t === 0) {
+                return K(e, r);
             }
- // case where previous tree item is or is a child of previous node in same level
-                        var o = t.replace(/[^-]+$/, "".concat(n - 1));
+            // case where previous tree item is or is a child of previous node in same level
+                        var o = n.replace(/[^-]+$/, "".concat(t - 1));
             return B(e, o) || r;
         }
         function X(e) {
@@ -502,39 +490,36 @@
         }
         function z(e) {
             var r = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : "0";
-            var t = _(e, r);
-            var n = r;
- // find last child in current node
-                        while (t) {
-                var o = K(n);
-                t = _(e, $(n, o));
-                if (t) {
-                    n = $(n, o);
+            var n = _(e, r);
+            var t = r;
+            // find last child in current node
+                        while (n) {
+                var o = $(t);
+                n = _(e, N(t, o));
+                if (n) {
+                    t = N(t, o);
                 }
             }
- // check if last child has children
-                        var a = _(e, "".concat(n, "-0"));
+            // check if last child has children
+                        var a = _(e, "".concat(t, "-0"));
             if (!a) {
-                return _(e, n);
+                return _(e, t);
             }
- // continue to find its last child recursively
-                        n = "".concat(n, "-0");
-            return z(e, n);
+            // continue to find its last child recursively
+                        t = "".concat(t, "-0");
+            return z(e, t);
         }
         // CONCATENATED MODULE: ./src/Tree/Tree.tsx
         function L() {
-            L = Object.assign || function(e) {
+            return L = Object.assign ? Object.assign.bind() : function(e) {
                 for (var r = 1; r < arguments.length; r++) {
-                    var t = arguments[r];
-                    for (var n in t) {
-                        if (Object.prototype.hasOwnProperty.call(t, n)) {
-                            e[n] = t[n];
-                        }
+                    var n = arguments[r];
+                    for (var t in n) {
+                        ({}).hasOwnProperty.call(n, t) && (e[t] = n[t]);
                     }
                 }
                 return e;
-            };
-            return L.apply(this, arguments);
+            }, L.apply(null, arguments);
         }
         function R(e, r) {
             return Q(e) || J(e, r) || G(e, r) || V();
@@ -543,108 +528,101 @@
             throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
         }
         function G(e, r) {
-            if (!e) return;
-            if (typeof e === "string") return H(e, r);
-            var t = Object.prototype.toString.call(e).slice(8, -1);
-            if (t === "Object" && e.constructor) t = e.constructor.name;
-            if (t === "Map" || t === "Set") return Array.from(e);
-            if (t === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t)) return H(e, r);
+            if (e) {
+                if ("string" == typeof e) return H(e, r);
+                var n = {}.toString.call(e).slice(8, -1);
+                return "Object" === n && e.constructor && (n = e.constructor.name), "Map" === n || "Set" === n ? Array.from(e) : "Arguments" === n || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n) ? H(e, r) : void 0;
+            }
         }
         function H(e, r) {
-            if (r == null || r > e.length) r = e.length;
-            for (var t = 0, n = new Array(r); t < r; t++) {
-                n[t] = e[t];
+            (null == r || r > e.length) && (r = e.length);
+            for (var n = 0, t = Array(r); n < r; n++) {
+                t[n] = e[n];
             }
-            return n;
+            return t;
         }
         function J(e, r) {
-            if (typeof Symbol === "undefined" || !(Symbol.iterator in Object(e))) return;
-            var t = [];
-            var n = true;
-            var o = false;
-            var a = undefined;
-            try {
-                for (var i = e[Symbol.iterator](), u; !(n = (u = i.next()).done); n = true) {
-                    t.push(u.value);
-                    if (r && t.length === r) break;
-                }
-            } catch (e) {
-                o = true;
-                a = e;
-            } finally {
+            var n = null == e ? null : "undefined" != typeof Symbol && e[Symbol.iterator] || e["@@iterator"];
+            if (null != n) {
+                var t, o, a, i, l = [], u = !0, c = !1;
                 try {
-                    if (!n && i["return"] != null) i["return"]();
+                    if (a = (n = n.call(e)).next, 0 === r) {
+                        if (Object(n) !== n) return;
+                        u = !1;
+                    } else for (;!(u = (t = a.call(n)).done) && (l.push(t.value), l.length !== r); u = !0) {
+                    }
+                } catch (e) {
+                    c = !0, o = e;
                 } finally {
-                    if (o) throw a;
+                    try {
+                        if (!u && null != n["return"] && (i = n["return"](), Object(i) !== i)) return;
+                    } finally {
+                        if (c) throw o;
+                    }
                 }
+                return l;
             }
-            return t;
         }
         function Q(e) {
             if (Array.isArray(e)) return e;
         }
         function W(e, r) {
-            if (e == null) return {};
-            var t = Y(e, r);
-            var n, o;
+            if (null == e) return {};
+            var n, t, o = Y(e, r);
             if (Object.getOwnPropertySymbols) {
                 var a = Object.getOwnPropertySymbols(e);
-                for (o = 0; o < a.length; o++) {
-                    n = a[o];
-                    if (r.indexOf(n) >= 0) continue;
-                    if (!Object.prototype.propertyIsEnumerable.call(e, n)) continue;
-                    t[n] = e[n];
+                for (t = 0; t < a.length; t++) {
+                    n = a[t], r.includes(n) || {}.propertyIsEnumerable.call(e, n) && (o[n] = e[n]);
                 }
             }
-            return t;
+            return o;
         }
         function Y(e, r) {
-            if (e == null) return {};
-            var t = {};
-            var n = Object.keys(e);
-            var o, a;
-            for (a = 0; a < n.length; a++) {
-                o = n[a];
-                if (r.indexOf(o) >= 0) continue;
-                t[o] = e[o];
+            if (null == e) return {};
+            var n = {};
+            for (var t in e) {
+                if ({}.hasOwnProperty.call(e, t)) {
+                    if (r.includes(t)) continue;
+                    n[t] = e[t];
+                }
             }
-            return t;
+            return n;
         }
         var Z = {
             children: a().node,
             defaultIndent: a().bool
         };
-        function ee(t) {
-            var n = t.children, o = t.defaultIndent, a = o === void 0 ? true : o, u = W(t, [ "children", "defaultIndent" ]);
-            var f = (0, e.useState)(), c = R(f, 2), d = c[0], v = c[1];
+        function ee(n) {
+            var t = n.children, o = n.defaultIndent, a = o === void 0 ? true : o, l = W(n, [ "children", "defaultIndent" ]);
+            var c = (0, e.useState)(), f = R(c, 2), d = f[0], v = f[1];
             var s = new Map;
-            var y = function e(r, t, n, o, a) {
-                var u = (0, i.keycode)(r.nativeEvent);
+            var y = function e(r, n, t, o, a) {
+                var l = (0, i.keycode)(r.nativeEvent);
                 r.stopPropagation();
-                switch (u) {
+                switch (l) {
                   case "up":
                     r.preventDefault();
-                    v(U(s, t));
+                    v(U(s, n));
                     break;
 
                   case "down":
                     r.preventDefault();
-                    v(q(s, t));
+                    v(q(s, n));
                     break;
 
                   case "left":
                     r.preventDefault();
-                    if (n && (o === null || o === void 0 ? void 0 : o.length)) {
+                    if (t && (o === null || o === void 0 ? void 0 : o.length)) {
                         a(false, r);
                     } else {
-                        v(M(s, t));
+                        v(K(s, n));
                     }
                     break;
 
                   case "right":
                     r.preventDefault();
-                    if (n && (o === null || o === void 0 ? void 0 : o.length)) {
-                        v(q(s, t));
+                    if (t && (o === null || o === void 0 ? void 0 : o.length)) {
+                        v(q(s, n));
                     } else {
                         a(true, r);
                     }
@@ -664,25 +642,24 @@
  // do nothing
                                 }
             };
-            var m = function e(r, t) {
+            var m = function e(r, n) {
                 r.preventDefault();
-                v(t);
+                v(n);
             };
             var b = function e(r) {
                 s["delete"](r);
             };
-            var g = function e(r, t) {
-                s.set(r, t);
+            var g = function e(r, n) {
+                s.set(r, n);
             };
-            var h = e.Children.toArray(n).filter(e.isValidElement);
+            var h = e.Children.toArray(t).filter(e.isValidElement);
             h.forEach((function(e, r) {
                 if (e.props.id && g) {
                     g("".concat(e.props.id), "".concat(r));
                 }
             }));
-            
-            return r().createElement(l.Provider, {
-                value: {
+            var I = (0, e.useMemo)((function() {
+                return {
                     defaultIndent: a,
                     onItemKeyDown: y,
                     onItemClick: m,
@@ -690,16 +667,20 @@
                     setNode: g,
                     itemPaths: s,
                     focusedItemId: d
-                }
+                };
+            }), [ a, d, s, y, b, g ]);
+            
+            return r().createElement(u.Provider, {
+                value: I
             },  r().createElement(p, L({
                 role: "tree",
                 $defaultIndent: a
-            }, u), n));
+            }, l), t));
         }
         ee.propTypes = Z;
-        ee.TreeItem = A;
+        ee.TreeItem = x;
         /* harmony default export */        const re = ee;
     }) // CONCATENATED MODULE: ./src/Tree/index.ts
     ();
-    module.exports = n;
+    module.exports = t;
     /******/})();