@splunk/react-ui 5.1.0 → 5.2.0

package/Tree.js

@@ -32,17 +32,17 @@
             /******/ return o.exports;
             /******/        }
         /******/ // Create a new module (and put it into the cache)
-        /******/        var i = t[n] = {
+        /******/        var a = t[n] = {
             /******/ // no module.id needed
             /******/ // no module.loaded needed
             /******/ exports: {}
             /******/        };
         /******/
         /******/ // Execute the module function
-        /******/        e[n](i, i.exports, r);
+        /******/        e[n](a, a.exports, r);
         /******/
         /******/ // Return the exports of the module
-        /******/        return i.exports;
+        /******/        return a.exports;
         /******/    }
     /******/
     /************************************************************************/
@@ -112,10 +112,10 @@
         var t =  r.n(e);
         // EXTERNAL MODULE: external "prop-types"
                 var o = r(23);
-        var i =  r.n(o);
+        var a =  r.n(o);
         // EXTERNAL MODULE: external "styled-components"
-                var a = r(232);
-        var l =  r.n(a);
+                var i = r(232);
+        var l =  r.n(i);
         // EXTERNAL MODULE: external "@splunk/themes"
                 var u = r(3563);
         // CONCATENATED MODULE: ./src/Tree/ItemStyles.ts
@@ -127,22 +127,25 @@
             displayName: "ItemStyles__StyledTreeItemIndent",
             componentId: "sc-1ig9nmy-1"
         })([ "white-space:pre;" ]);
-        var d = l().span.withConfig({
+        var s = l().span.withConfig({
             displayName: "ItemStyles__StyledTreeItemContent",
             componentId: "sc-1ig9nmy-2"
-        })([ "min-height:100%;&:focus{outline:3px solid ", ";outline-offset:1px;&:active{outline:none;}}&:hover{background-color:", ";cursor:pointer;}" ], u.variables.focusColor, u.variables.actionColorBackgroundSecondaryHover);
+        })([ "display:", ";min-height:100%;&:focus{outline:3px solid ", ";outline-offset:1px;&:active{outline:none;}}&:hover{background-color:", ";cursor:pointer;}" ], (function(e) {
+            var t = e.$hasCustomIndent;
+            return t ? "inline" : "inline-block";
+        }), u.variables.focusColor, u.variables.actionColorBackgroundSecondaryHover);
         // CONCATENATED MODULE: ./src/Tree/TreeContext.tsx
-        var s =  (0, e.createContext)({
+        var d =  (0, e.createContext)({
             defaultIndent: true
         });
-        /* harmony default export */        const v = s;
+        /* harmony default export */        const v = d;
         // CONCATENATED MODULE: ./src/Tree/TreeStyles.ts
         var p = l().ul.withConfig({
             displayName: "TreeStyles__StyledUnorderedList",
             componentId: "sc-13pokwt-0"
-        })([ "", ";color:inherit;font-family:inherit;list-style:none;white-space:inherit;", ";" ], u.mixins.reset("ul"), (function(e) {
+        })([ "", ";list-style:none;white-space:inherit;", ";" ], u.mixins.reset("ul"), (function(e) {
             var t = e.$defaultIndent;
-            return t && (0, a.css)([ "padding-inline-start:", ";" ], u.variables.spacingXXXLarge);
+            return t && (0, i.css)([ "padding-inline-start:", ";" ], u.variables.spacingXXXLarge);
         }));
         // CONCATENATED MODULE: ./src/utils/updateReactRef.ts
         /**
@@ -227,40 +230,40 @@
             return ("string" === t ? String : Number)(e);
         }
         function S(e, t) {
-            return x(e) || k(e, t) || P(e, t) || j();
+            return P(e) || C(e, t) || k(e, t) || j();
         }
         function j() {
             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 P(e, t) {
+        function k(e, t) {
             if (e) {
-                if ("string" == typeof e) return A(e, t);
+                if ("string" == typeof e) return x(e, t);
                 var r = {}.toString.call(e).slice(8, -1);
-                return "Object" === r && e.constructor && (r = e.constructor.name), "Map" === r || "Set" === r ? Array.from(e) : "Arguments" === r || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(r) ? A(e, t) : void 0;
+                return "Object" === r && e.constructor && (r = e.constructor.name), "Map" === r || "Set" === r ? Array.from(e) : "Arguments" === r || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(r) ? x(e, t) : void 0;
             }
         }
-        function A(e, t) {
+        function x(e, t) {
             (null == t || t > e.length) && (t = e.length);
             for (var r = 0, n = Array(t); r < t; r++) {
                 n[r] = e[r];
             }
             return n;
         }
-        function k(e, t) {
+        function C(e, t) {
             var r = null == e ? null : "undefined" != typeof Symbol && e[Symbol.iterator] || e["@@iterator"];
             if (null != r) {
-                var n, o, i, a, l = [], u = !0, c = !1;
+                var n, o, a, i, l = [], u = !0, c = !1;
                 try {
-                    if (i = (r = r.call(e)).next, 0 === t) {
+                    if (a = (r = r.call(e)).next, 0 === t) {
                         if (Object(r) !== r) return;
                         u = !1;
-                    } else for (;!(u = (n = i.call(r)).done) && (l.push(n.value), l.length !== t); u = !0) {
+                    } else for (;!(u = (n = a.call(r)).done) && (l.push(n.value), l.length !== t); u = !0) {
                     }
                 } catch (e) {
                     c = !0, o = e;
                 } finally {
                     try {
-                        if (!u && null != r["return"] && (a = r["return"](), Object(a) !== a)) return;
+                        if (!u && null != r["return"] && (i = r["return"](), Object(i) !== i)) return;
                     } finally {
                         if (c) throw o;
                     }
@@ -268,66 +271,65 @@
                 return l;
             }
         }
-        function x(e) {
+        function P(e) {
             if (Array.isArray(e)) return e;
         }
-        function E(e, t) {
+        function A(e, t) {
             if (null == e) return {};
-            var r, n, o = C(e, t);
+            var r, n, o = E(e, t);
             if (Object.getOwnPropertySymbols) {
-                var i = Object.getOwnPropertySymbols(e);
-                for (n = 0; n < i.length; n++) {
-                    r = i[n], t.includes(r) || {}.propertyIsEnumerable.call(e, r) && (o[r] = e[r]);
+                var a = Object.getOwnPropertySymbols(e);
+                for (n = 0; n < a.length; n++) {
+                    r = a[n], -1 === t.indexOf(r) && {}.propertyIsEnumerable.call(e, r) && (o[r] = e[r]);
                 }
             }
             return o;
         }
-        function C(e, t) {
+        function E(e, t) {
             if (null == e) return {};
             var r = {};
             for (var n in e) {
                 if ({}.hasOwnProperty.call(e, n)) {
-                    if (t.includes(n)) continue;
+                    if (-1 !== t.indexOf(n)) continue;
                     r[n] = e[n];
                 }
             }
             return r;
         }
         var T = {
-            id: i().string,
-            children: i().node,
-            content: i().node,
-            customIndent: i().node,
-            elementRef: i().oneOfType([ i().func, i().object ]),
-            endAdornment: i().node,
-            expanded: i().bool,
-            labelledBy: i().string,
-            onFocus: i().func,
-            onKeyDown: i().func,
-            onToggleSelection: i().func,
-            onToggleExpansion: i().func
+            id: a().string,
+            children: a().node,
+            content: a().node,
+            customIndent: a().node,
+            elementRef: a().oneOfType([ a().func, a().object ]),
+            endAdornment: a().node,
+            expanded: a().bool,
+            onFocus: a().func,
+            onKeyDown: a().func,
+            onToggleSelection: a().func,
+            onToggleExpansion: a().func
         };
         /** @public */
         /** @public */        function D(r) {
-            var n = r.id, o = r.children, i = r.content, a = r.customIndent, l = r.elementRef, u = r.endAdornment, s = r.expanded, m = r.labelledBy, g = r.onFocus, I = r.onKeyDown, O = r.onToggleExpansion, w = r.onToggleSelection, j = E(r, [ "id", "children", "content", "customIndent", "elementRef", "endAdornment", "expanded", "labelledBy", "onFocus", "onKeyDown", "onToggleExpansion", "onToggleSelection" ]);
+            var n = r.id, o = r.children, a = r.content, i = r.customIndent, l = r.elementRef, u = r.endAdornment, d = r.expanded, m = r.onFocus, g = r.onKeyDown, I = r.onToggleExpansion, O = r.onToggleSelection, w = A(r, [ "id", "children", "content", "customIndent", "elementRef", "endAdornment", "expanded", "onFocus", "onKeyDown", "onToggleExpansion", "onToggleSelection" ]);
             // @docs-props-type TreeItemPropsBase
-                        var P = (0, e.useContext)(v), A = P.defaultIndent, k = A === void 0 ? true : A, x = P.onItemKeyDown, C = P.onItemClick, T = P.removeNode, D = P.setNode, _ = P.itemPaths, N = P.focusedItemId;
+                        var j = (0, e.useContext)(v), k = j.defaultIndent, x = k === void 0 ? true : k, C = j.onItemKeyDown, P = j.onItemClick, E = j.removeNode, T = j.setNode, D = j.itemPaths, _ = j.focusedItemId;
  // make first tree item tabbable
-                        var R = (0, e.useState)((_ === null || _ === void 0 ? void 0 : _.get("".concat(n))) === "0" ? 0 : -1), M = S(R, 2), $ = M[0], K = M[1];
+                        var $ = (0, e.useState)((D === null || D === void 0 ? void 0 : D.get("".concat(n))) === "0" ? 0 : -1), M = S($, 2), N = M[0], R = M[1];
+            var K = (0, e.useRef)(null);
             var F = (0, e.useRef)(null);
-            var B = (0, e.useRef)(null);
             var U = e.Children.toArray(o).filter(e.isValidElement);
             U.forEach((function(e, t) {
                 if (e.props.id) {
-                    if (s && D) {
-                        D("".concat(e.props.id), "".concat(_ === null || _ === void 0 ? void 0 : _.get("".concat(n)), "-").concat(t));
-                    } else if (T) {
-                        T(e.props.id);
+                    if (d && T) {
+                        T("".concat(e.props.id), "".concat(D === null || D === void 0 ? void 0 : D.get("".concat(n)), "-").concat(t));
+                    } else if (E) {
+                        E(e.props.id);
                     }
                 }
             }));
             var q = (0, e.useCallback)((function(e) {
-                y(F, e);
+                y(K, e);
                 y(l, e);
             }), [ l ]);
             var L = (0, e.useCallback)((function(e) {
@@ -339,88 +341,89 @@
                 if (!r.treeItemId && ((t = e.currentTarget) === null || t === void 0 ? void 0 : t.id)) {
                     n.treeItemId = e.currentTarget.id;
                 }
-                O === null || O === void 0 ? void 0 : O(e, n);
-            }), [ O ]);
+                I === null || I === void 0 ? void 0 : I(e, n);
+            }), [ I ]);
             var X = (0, e.useCallback)((function(e) {
-                C === null || C === void 0 ? void 0 : C(e, n);
-            }), [ n, C ]);
-            var H = (0, e.useCallback)((function(e) {
+                P === null || P === void 0 ? void 0 : P(e, n);
+            }), [ n, P ]);
+            var B = (0, e.useCallback)((function(e) {
                 var t;
                 e.stopPropagation();
-                B === null || B === void 0 ? void 0 : (t = B.current) === null || t === void 0 ? void 0 : t.focus();
-                g === null || g === void 0 ? void 0 : g(e);
-            }), [ g ]);
-            var V = (0, e.useCallback)((function() {
-                if ((_ === null || _ === void 0 ? void 0 : _.get("".concat(n))) === "0") {
-                    K(0);
+                F === null || F === void 0 ? void 0 : (t = F.current) === null || t === void 0 ? void 0 : t.focus();
+                m === null || m === void 0 ? void 0 : m(e);
+            }), [ m ]);
+            var H = (0, e.useCallback)((function() {
+                if ((D === null || D === void 0 ? void 0 : D.get("".concat(n))) === "0") {
+                    R(0);
                 }
-            }), [ n, _ ]);
+            }), [ n, D ]);
             (0, e.useEffect)((function() {
-                if (N === n) {
+                if (_ === n) {
                     var e;
-                    F === null || F === void 0 ? void 0 : (e = F.current) === null || e === void 0 ? void 0 : e.focus();
+                    K === null || K === void 0 ? void 0 : (e = K.current) === null || e === void 0 ? void 0 : e.focus();
                 }
-            }), [ N, n, F ]);
-            var W = (0, e.useCallback)((function(e) {
+            }), [ _, n, K ]);
+            var V = (0, e.useCallback)((function(e) {
                 e.stopPropagation();
             }), []);
-            var z = (0, e.useCallback)((function(e) {
+            var W = (0, e.useCallback)((function(e) {
                 e.stopPropagation();
                 if (e.key === " ") {
-                    w === null || w === void 0 ? void 0 : w(e, {
+                    e.preventDefault();
+                    O === null || O === void 0 ? void 0 : O(e, {
                         treeItemId: n
                     });
                     return;
                 }
                 // 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 (e.shiftKey && e.key === "Tab" && (_ === null || _ === void 0 ? void 0 : _.get("".concat(n))) === "0") {
-                    K(-1);
+                                if (e.shiftKey && e.key === "Tab" && (D === null || D === void 0 ? void 0 : D.get("".concat(n))) === "0") {
+                    R(-1);
                 }
-                x === null || x === void 0 ? void 0 : x(e, n, s, U, L);
-                I === null || I === void 0 ? void 0 : I(e);
-            }), [ U, s, L, n, _, x, I, w ]);
+                C === null || C === void 0 ? void 0 : C(e, n, d, U, L);
+                g === null || g === void 0 ? void 0 : g(e);
+            }), [ U, d, L, n, D, C, g, O ]);
             
             return t().createElement("li", b({
                 "data-test": "tree-item"
-            }, j, {
+            }, w, {
                 id: n,
                 ref: q,
-                tabIndex: $,
-                onBlur: V,
-                onFocus: H,
-                onKeyDown: z,
+                tabIndex: N,
+                onBlur: H,
+                onFocus: B,
+                onKeyDown: W,
                 role: "treeitem",
-                "aria-labelledby": m,
-                "aria-expanded": U.length ? s || "false" : undefined
-            }),  t().createElement(c, null,  t().createElement(f, null, a),  t().createElement(d, {
+                "aria-expanded": U.length ? d || "false" : undefined
+            }),  t().createElement(c, null,  t().createElement(f, null, i),  t().createElement(s, {
+                $hasCustomIndent: !!i,
                 "data-test": "tree-item-content",
-                ref: B,
+                ref: F,
                 tabIndex: -1,
-                onFocus: W,
+                onFocus: V,
                 onClick: X
-            }, i, !s && u)), s &&  t().createElement(t().Fragment, null,  t().createElement(p, {
+            }, a, !d && u)), d &&  t().createElement(t().Fragment, null,  t().createElement(p, {
                 role: "group",
-                $defaultIndent: k
+                $defaultIndent: x
             }, o), u));
         }
         D.propTypes = T;
         /* harmony default export */        const _ = D;
         // CONCATENATED MODULE: ./src/Tree/treeUtils.ts
-        function N(e, t) {
-            return F(e) || K(e, t) || M(e, t) || R();
+        function $(e, t) {
+            return F(e) || K(e, t) || N(e, t) || M();
         }
-        function R() {
+        function M() {
             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 M(e, t) {
+        function N(e, t) {
             if (e) {
-                if ("string" == typeof e) return $(e, t);
+                if ("string" == typeof e) return R(e, t);
                 var r = {}.toString.call(e).slice(8, -1);
-                return "Object" === r && e.constructor && (r = e.constructor.name), "Map" === r || "Set" === r ? Array.from(e) : "Arguments" === r || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(r) ? $(e, t) : void 0;
+                return "Object" === r && e.constructor && (r = e.constructor.name), "Map" === r || "Set" === r ? Array.from(e) : "Arguments" === r || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(r) ? R(e, t) : void 0;
             }
         }
-        function $(e, t) {
+        function R(e, t) {
             (null == t || t > e.length) && (t = e.length);
             for (var r = 0, n = Array(t); r < t; r++) {
                 n[r] = e[r];
@@ -430,18 +433,18 @@
         function K(e, t) {
             var r = null == e ? null : "undefined" != typeof Symbol && e[Symbol.iterator] || e["@@iterator"];
             if (null != r) {
-                var n, o, i, a, l = [], u = !0, c = !1;
+                var n, o, a, i, l = [], u = !0, c = !1;
                 try {
-                    if (i = (r = r.call(e)).next, 0 === t) {
+                    if (a = (r = r.call(e)).next, 0 === t) {
                         if (Object(r) !== r) return;
                         u = !1;
-                    } else for (;!(u = (n = i.call(r)).done) && (l.push(n.value), l.length !== t); u = !0) {
+                    } else for (;!(u = (n = a.call(r)).done) && (l.push(n.value), l.length !== t); u = !0) {
                     }
                 } catch (e) {
                     c = !0, o = e;
                 } finally {
                     try {
-                        if (!u && null != r["return"] && (a = r["return"](), Object(a) !== a)) return;
+                        if (!u && null != r["return"] && (i = r["return"](), Object(i) !== i)) return;
                     } finally {
                         if (c) throw o;
                     }
@@ -454,55 +457,55 @@
         }
         /**
  * A helper function to get first key in Map that matches given value
- */        function B(e, t) {
+ */        function U(e, t) {
             var r;
             var n = Array.from(e.entries());
             return (r = n.find((function(e) {
-                var r = N(e, 2), n = r[1];
+                var r = $(e, 2), n = r[1];
                 return n === t;
             }))) === null || r === void 0 ? void 0 : r[0];
         }
         /**
  * A helper function to get parent path of current item path
- */        function U(e) {
+ */        function q(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 q(e, t) {
+ */        function L(e, t) {
             return e === null || e === void 0 ? void 0 : e.replace(/([^-]*)$/, "".concat(t + 1));
         }
         /**
  * A helper function to get the last index number of an item path string
- */        function L(e) {
+ */        function X(e) {
             var t = e.split("-").pop();
             if (!t) {
                 return 0;
             }
             return parseInt(t, 10) || 0;
         }
-        function X(e, t) {
+        function B(e, t) {
             var r = e.get(t);
             if (!r) {
                 return t;
             }
-            var n = U(r);
-            return B(e, n) || t;
+            var n = q(r);
+            return U(e, n) || t;
         }
         /**
  * A helper function for getNextTreeItem
  */        function H(e, t) {
-            var r = U(t);
+            var r = q(t);
             if (!r) {
-                return B(e, t);
+                return U(e, t);
             }
             // get next node in the parent level
-                        var n = L(r);
-            var o = q(r, n);
-            var i = B(e, o);
-            if (i) {
-                return i;
+                        var n = X(r);
+            var o = L(r, n);
+            var a = U(e, o);
+            if (a) {
+                return a;
             }
             // continue getting parents until find next node or reach root
                         return H(e, o);
@@ -513,16 +516,16 @@
                 return t;
             }
             // case where next tree item is the first visible child
-                        var n = B(e, "".concat(r, "-0"));
+                        var n = U(e, "".concat(r, "-0"));
             if (n) {
                 return n;
             }
             // case where next tree item is the next node in the same level
-                        var o = L(r);
-            var i = q(r, o);
-            var a = B(e, i);
-            if (a) {
-                return a;
+                        var o = X(r);
+            var a = L(r, o);
+            var i = U(e, a);
+            if (i) {
+                return i;
             }
             // case where next tree item is a higher level or does not exist
                         return H(e, r) || t;
@@ -530,19 +533,19 @@
         /**
  * A helper function for getPrevTreeItem
  */        function W(e, t) {
-            var r = B(e, "".concat(t, "-0"));
+            var r = U(e, "".concat(t, "-0"));
             if (!r) {
-                return B(e, t);
+                return U(e, t);
             }
-            var n = B(e, t);
+            var n = U(e, t);
             var o = "".concat(t, "-0");
             // get the last child in current node, and continue to find its children recursively
                         while (n) {
-                var i = L(o);
-                var a = q(o, i);
-                n = B(e, a);
+                var a = X(o);
+                var i = L(o, a);
+                n = U(e, i);
                 if (n) {
-                    o = a;
+                    o = i;
                 }
             }
             return W(e, o);
@@ -552,34 +555,34 @@
             if (!r) {
                 return t;
             }
-            var n = L(r);
+            var n = X(r);
             // case where current is first child of parent or root item
                         if (n === 0) {
-                return X(e, t);
+                return B(e, t);
             }
             // case where previous tree item is or is a child of previous node in same level
                         var o = r.replace(/[^-]+$/, "".concat(n - 1));
             return W(e, o) || t;
         }
         function G(e) {
-            return B(e, "0");
+            return U(e, "0");
         }
         function J(e) {
             var t = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : "0";
-            var r = B(e, t);
+            var r = U(e, t);
             var n = t;
             // find last child in current node
                         while (r) {
-                var o = L(n);
-                r = B(e, q(n, o));
+                var o = X(n);
+                r = U(e, L(n, o));
                 if (r) {
-                    n = q(n, o);
+                    n = L(n, o);
                 }
             }
             // check if last child has children
-                        var i = B(e, "".concat(n, "-0"));
-            if (!i) {
-                return B(e, n);
+                        var a = U(e, "".concat(n, "-0"));
+            if (!a) {
+                return U(e, n);
             }
             // continue to find its last child recursively
                         n = "".concat(n, "-0");
@@ -620,18 +623,18 @@
         function re(e, t) {
             var r = null == e ? null : "undefined" != typeof Symbol && e[Symbol.iterator] || e["@@iterator"];
             if (null != r) {
-                var n, o, i, a, l = [], u = !0, c = !1;
+                var n, o, a, i, l = [], u = !0, c = !1;
                 try {
-                    if (i = (r = r.call(e)).next, 0 === t) {
+                    if (a = (r = r.call(e)).next, 0 === t) {
                         if (Object(r) !== r) return;
                         u = !1;
-                    } else for (;!(u = (n = i.call(r)).done) && (l.push(n.value), l.length !== t); u = !0) {
+                    } else for (;!(u = (n = a.call(r)).done) && (l.push(n.value), l.length !== t); u = !0) {
                     }
                 } catch (e) {
                     c = !0, o = e;
                 } finally {
                     try {
-                        if (!u && null != r["return"] && (a = r["return"](), Object(a) !== a)) return;
+                        if (!u && null != r["return"] && (i = r["return"](), Object(i) !== i)) return;
                     } finally {
                         if (c) throw o;
                     }
@@ -644,105 +647,107 @@
         }
         function oe(e, t) {
             if (null == e) return {};
-            var r, n, o = ie(e, t);
+            var r, n, o = ae(e, t);
             if (Object.getOwnPropertySymbols) {
-                var i = Object.getOwnPropertySymbols(e);
-                for (n = 0; n < i.length; n++) {
-                    r = i[n], t.includes(r) || {}.propertyIsEnumerable.call(e, r) && (o[r] = e[r]);
+                var a = Object.getOwnPropertySymbols(e);
+                for (n = 0; n < a.length; n++) {
+                    r = a[n], -1 === t.indexOf(r) && {}.propertyIsEnumerable.call(e, r) && (o[r] = e[r]);
                 }
             }
             return o;
         }
-        function ie(e, t) {
+        function ae(e, t) {
             if (null == e) return {};
             var r = {};
             for (var n in e) {
                 if ({}.hasOwnProperty.call(e, n)) {
-                    if (t.includes(n)) continue;
+                    if (-1 !== t.indexOf(n)) continue;
                     r[n] = e[n];
                 }
             }
             return r;
         }
-        var ae = {
-            children: i().node,
-            defaultIndent: i().bool,
-            elementRef: i().oneOfType([ i().func, i().object ])
+        var ie = {
+            children: a().node,
+            defaultIndent: a().bool,
+            elementRef: a().oneOfType([ a().func, a().object ])
         };
         /**
  * Used to present a hierarchical list.
  */        function le(r) {
-            var n = r.children, o = r.defaultIndent, i = o === void 0 ? true : o, a = r.elementRef, l = oe(r, [ "children", "defaultIndent", "elementRef" ]);
+            var n = r.children, o = r.defaultIndent, a = o === void 0 ? true : o, i = r.elementRef, l = oe(r, [ "children", "defaultIndent", "elementRef" ]);
             // @docs-props-type TreePropsBase
-                        var u = (0, e.useState)(), c = Y(u, 2), f = c[0], d = c[1];
-            var s = new Map;
-            var y = function e(t, r, n, o, i) {
-                t.stopPropagation();
-                var a = n && (o === null || o === void 0 ? void 0 : o.length);
-                switch (t.key) {
+                        var u = (0, e.useState)(), c = Y(u, 2), f = c[0], s = c[1];
+            var d = (0, e.useMemo)((function() {
+                return new Map;
+            }), []);
+            var y = (0, e.useCallback)((function(e, t, r, n, o) {
+                e.stopPropagation();
+                var a = r && (n === null || n === void 0 ? void 0 : n.length);
+                switch (e.key) {
                   case "ArrowUp":
-                    t.preventDefault();
-                    d(z(s, r));
+                    e.preventDefault();
+                    s(z(d, t));
                     break;
 
                   case "ArrowDown":
-                    t.preventDefault();
-                    d(V(s, r));
+                    e.preventDefault();
+                    s(V(d, t));
                     break;
 
                   case "ArrowLeft":
-                    t.preventDefault();
+                    e.preventDefault();
                     if (a) {
-                        i(t, {
-                            treeItemId: r
+                        o(e, {
+                            treeItemId: t
                         });
                     } else {
-                        d(X(s, r));
+                        s(B(d, t));
                     }
                     break;
 
                   case "ArrowRight":
-                    t.preventDefault();
+                    e.preventDefault();
                     if (a) {
-                        d(V(s, r));
+                        s(V(d, t));
                     } else {
-                        i(t, {
-                            treeItemId: r
+                        o(e, {
+                            treeItemId: t
                         });
                     }
                     break;
 
                   case "Home":
-                    t.preventDefault();
-                    d(G(s));
+                    e.preventDefault();
+                    s(G(d));
                     break;
 
                   case "End":
-                    t.preventDefault();
-                    d(J(s));
+                    e.preventDefault();
+                    s(J(d));
                     break;
 
                   case "Enter":
-                    t.preventDefault();
-                    i(t, {
-                        treeItemId: r
+                    e.preventDefault();
+                    o(e, {
+                        treeItemId: t
                     });
                     break;
 
                   default:
  // do nothing
                                 }
-            };
+            }), [ d ]);
             var m = function e(t, r) {
                 t.preventDefault();
-                d(r);
-            };
-            var b = function e(t) {
-                s["delete"](t);
-            };
-            var g = function e(t, r) {
-                s.set(t, r);
+                s(r);
             };
+            var b = (0, e.useCallback)((function(e) {
+                d["delete"](e);
+            }), [ d ]);
+            var g = (0, e.useCallback)((function(e, t) {
+                d.set(e, t);
+            }), [ d ]);
             var h = e.Children.toArray(n).filter(e.isValidElement);
             h.forEach((function(e, t) {
                 if (e.props.id && g) {
@@ -751,26 +756,26 @@
             }));
             var I = (0, e.useMemo)((function() {
                 return {
-                    defaultIndent: i,
+                    defaultIndent: a,
                     onItemKeyDown: y,
                     onItemClick: m,
                     removeNode: b,
                     setNode: g,
-                    itemPaths: s,
+                    itemPaths: d,
                     focusedItemId: f
                 };
-            }), [ i, f, s, y, b, g ]);
+            }), [ a, f, d, y, b, g ]);
             
             return t().createElement(v.Provider, {
                 value: I
             },  t().createElement(p, Q({
                 "data-test": "tree",
-                ref: a,
+                ref: i,
                 role: "tree",
-                $defaultIndent: i
+                $defaultIndent: a
             }, l), n));
         }
-        le.propTypes = ae;
+        le.propTypes = ie;
         le.Item = _;
         /* harmony default export */        const ue = le;
     }) // CONCATENATED MODULE: ./src/Tree/index.ts