@splunk/react-ui 5.0.0 → 5.2.0

package/Tree.js

@@ -22,24 +22,24 @@
     };
     /************************************************************************/
     /******/ // The module cache
-    /******/    var r = {};
+    /******/    var t = {};
     /******/
     /******/ // The require function
-    /******/    function n(t) {
+    /******/    function r(n) {
         /******/ // Check if module is in cache
-        /******/ var o = r[t];
+        /******/ var o = t[n];
         /******/        if (o !== undefined) {
             /******/ return o.exports;
             /******/        }
         /******/ // Create a new module (and put it into the cache)
-        /******/        var a = r[t] = {
+        /******/        var a = t[n] = {
             /******/ // no module.id needed
             /******/ // no module.loaded needed
             /******/ exports: {}
             /******/        };
         /******/
         /******/ // Execute the module function
-        /******/        e[t](a, a.exports, n);
+        /******/        e[n](a, a.exports, r);
         /******/
         /******/ // Return the exports of the module
         /******/        return a.exports;
@@ -49,27 +49,27 @@
     /******/ /* webpack/runtime/compat get default export */
     /******/    (() => {
         /******/ // getDefaultExport function for compatibility with non-harmony modules
-        /******/ n.n = e => {
-            /******/ var r = e && e.__esModule ? 
+        /******/ r.n = e => {
+            /******/ var t = e && e.__esModule ? 
             /******/ () => e["default"]
             /******/ : () => e
             /******/;
-            n.d(r, {
-                a: r
+            r.d(t, {
+                a: t
             });
-            /******/            return r;
+            /******/            return t;
             /******/        };
         /******/    })();
     /******/
     /******/ /* webpack/runtime/define property getters */
     /******/    (() => {
         /******/ // define getter functions for harmony exports
-        /******/ n.d = (e, r) => {
-            /******/ for (var t in r) {
-                /******/ if (n.o(r, t) && !n.o(e, t)) {
-                    /******/ Object.defineProperty(e, t, {
+        /******/ r.d = (e, t) => {
+            /******/ for (var n in t) {
+                /******/ if (r.o(t, n) && !r.o(e, n)) {
+                    /******/ Object.defineProperty(e, n, {
                         enumerable: true,
-                        get: r[t]
+                        get: t[n]
                     });
                     /******/                }
                 /******/            }
@@ -78,14 +78,14 @@
     /******/
     /******/ /* webpack/runtime/hasOwnProperty shorthand */
     /******/    (() => {
-        /******/ n.o = (e, r) => Object.prototype.hasOwnProperty.call(e, r)
+        /******/ r.o = (e, t) => Object.prototype.hasOwnProperty.call(e, t)
         /******/;
     })();
     /******/
     /******/ /* webpack/runtime/make namespace object */
     /******/    (() => {
         /******/ // define __esModule on exports
-        /******/ n.r = e => {
+        /******/ r.r = e => {
             /******/ if (typeof Symbol !== "undefined" && Symbol.toStringTag) {
                 /******/ Object.defineProperty(e, Symbol.toStringTag, {
                     value: "Module"
@@ -97,92 +97,173 @@
             /******/        };
         /******/    })();
     /******/
-    /************************************************************************/    var t = {};
+    /************************************************************************/    var n = {};
     // This entry need to be wrapped in an IIFE because it need to be isolated against other modules in the chunk.
         (() => {
         // ESM COMPAT FLAG
-        n.r(t);
+        r.r(n);
         // EXPORTS
-                n.d(t, {
-            TreeItem: () => /* reexport */ A,
-            default: () => /* reexport */ Z
+                r.d(n, {
+            Item: () => /* reexport */ _,
+            default: () => /* reexport */ ue
         });
         // EXTERNAL MODULE: external "react"
-                var e = n(9497);
-        var r =  n.n(e);
+                var e = r(9497);
+        var t =  r.n(e);
         // EXTERNAL MODULE: external "prop-types"
-                var o = n(23);
-        var a =  n.n(o);
+                var o = r(23);
+        var a =  r.n(o);
+        // EXTERNAL MODULE: external "styled-components"
+                var i = r(232);
+        var l =  r.n(i);
+        // EXTERNAL MODULE: external "@splunk/themes"
+                var u = r(3563);
+        // CONCATENATED MODULE: ./src/Tree/ItemStyles.ts
+        var c = l().span.withConfig({
+            displayName: "ItemStyles__StyledTreeItemContentWrapper",
+            componentId: "sc-1ig9nmy-0"
+        })([ "display:inline-block;min-height:100%;" ]);
+        var f = l().span.withConfig({
+            displayName: "ItemStyles__StyledTreeItemIndent",
+            componentId: "sc-1ig9nmy-1"
+        })([ "white-space:pre;" ]);
+        var s = l().span.withConfig({
+            displayName: "ItemStyles__StyledTreeItemContent",
+            componentId: "sc-1ig9nmy-2"
+        })([ "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 i =  (0, e.createContext)({
+        var d =  (0, e.createContext)({
             defaultIndent: true
         });
-        /* harmony default export */        const l = i;
-        // EXTERNAL MODULE: external "styled-components"
-                var u = n(232);
-        var c =  n.n(u);
-        // EXTERNAL MODULE: external "@splunk/themes"
-                var f = n(3563);
-        // CONCATENATED MODULE: ./src/Tree/TreeItemStyles.ts
-        var d = c().span.withConfig({
-            displayName: "TreeItemStyles__StyledTreeItemNode",
-            componentId: "ie7zrw-0"
-        })([ "padding:", ";&:focus{box-shadow:", ";outline:0;&:active{box-shadow:none;}}" ], f.variables.spacingXSmall, f.variables.focusShadowInset);
+        /* harmony default export */        const v = d;
         // CONCATENATED MODULE: ./src/Tree/TreeStyles.ts
-        var v = c().ul.withConfig({
+        var p = l().ul.withConfig({
             displayName: "TreeStyles__StyledUnorderedList",
             componentId: "sc-13pokwt-0"
-        })([ "", ";color:inherit;font-family:inherit;list-style:none;white-space:inherit;", ";" ], f.mixins.reset("ul"), (function(e) {
-            var r = e.$defaultIndent;
-            return r && (0, u.css)([ "padding-inline-start:", ";" ], f.variables.spacingXXXLarge);
+        })([ "", ";list-style:none;white-space:inherit;", ";" ], u.mixins.reset("ul"), (function(e) {
+            var t = e.$defaultIndent;
+            return t && (0, i.css)([ "padding-inline-start:", ";" ], u.variables.spacingXXXLarge);
         }));
-        // CONCATENATED MODULE: ./src/Tree/TreeItem.tsx
-        function s() {
-            return s = Object.assign ? Object.assign.bind() : function(e) {
-                for (var r = 1; r < arguments.length; r++) {
-                    var n = arguments[r];
-                    for (var t in n) {
-                        ({}).hasOwnProperty.call(n, t) && (e[t] = n[t]);
+        // CONCATENATED MODULE: ./src/utils/updateReactRef.ts
+        /**
+ * Updates a React ref. Callback refs and object refs (from `createRef` and `useRef`) are supported.
+ *
+ * @param ref - The React callback or object ref. Can be `null` or `undefined`.
+ * @param current - The new value of the ref.
+ */
+        function y(e, t) {
+            if (e) {
+                if (typeof e === "function") {
+                    e(t);
+                } else {
+                    // the public signature of this util uses React.Ref<T> to mirror the way React types refs.
+                    // the intention here is to signal "we will take care of setting 'current', not you".
+                    e.current = t;
+ // eslint-disable-line no-param-reassign
+                                }
+            }
+        }
+        // CONCATENATED MODULE: ./src/Tree/Item.tsx
+        function m(e) {
+            "@babel/helpers - typeof";
+            return m = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function(e) {
+                return typeof e;
+            } : function(e) {
+                return e && "function" == typeof Symbol && e.constructor === Symbol && e !== Symbol.prototype ? "symbol" : typeof e;
+            }, m(e);
+        }
+        function b() {
+            return b = Object.assign ? Object.assign.bind() : function(e) {
+                for (var t = 1; t < arguments.length; t++) {
+                    var r = arguments[t];
+                    for (var n in r) {
+                        ({}).hasOwnProperty.call(r, n) && (e[n] = r[n]);
                     }
                 }
                 return e;
-            }, s.apply(null, arguments);
+            }, b.apply(null, arguments);
+        }
+        function g(e, t) {
+            var r = Object.keys(e);
+            if (Object.getOwnPropertySymbols) {
+                var n = Object.getOwnPropertySymbols(e);
+                t && (n = n.filter((function(t) {
+                    return Object.getOwnPropertyDescriptor(e, t).enumerable;
+                }))), r.push.apply(r, n);
+            }
+            return r;
+        }
+        function h(e) {
+            for (var t = 1; t < arguments.length; t++) {
+                var r = null != arguments[t] ? arguments[t] : {};
+                t % 2 ? g(Object(r), !0).forEach((function(t) {
+                    I(e, t, r[t]);
+                })) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(r)) : g(Object(r)).forEach((function(t) {
+                    Object.defineProperty(e, t, Object.getOwnPropertyDescriptor(r, t));
+                }));
+            }
+            return e;
+        }
+        function I(e, t, r) {
+            return (t = O(t)) in e ? Object.defineProperty(e, t, {
+                value: r,
+                enumerable: !0,
+                configurable: !0,
+                writable: !0
+            }) : e[t] = r, e;
+        }
+        function O(e) {
+            var t = w(e, "string");
+            return "symbol" == m(t) ? t : t + "";
+        }
+        function w(e, t) {
+            if ("object" != m(e) || !e) return e;
+            var r = e[Symbol.toPrimitive];
+            if (void 0 !== r) {
+                var n = r.call(e, t || "default");
+                if ("object" != m(n)) return n;
+                throw new TypeError("@@toPrimitive must return a primitive value.");
+            }
+            return ("string" === t ? String : Number)(e);
         }
-        function p(e, r) {
-            return h(e) || g(e, r) || m(e, r) || y();
+        function S(e, t) {
+            return P(e) || C(e, t) || k(e, t) || j();
         }
-        function y() {
+        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 m(e, r) {
+        function k(e, t) {
             if (e) {
-                if ("string" == typeof e) return b(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) ? b(e, r) : void 0;
+                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) ? x(e, t) : void 0;
             }
         }
-        function b(e, r) {
-            (null == r || r > e.length) && (r = e.length);
-            for (var n = 0, t = Array(r); n < r; n++) {
-                t[n] = e[n];
+        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 t;
+            return n;
         }
-        function g(e, r) {
-            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;
+        function C(e, t) {
+            var r = null == e ? null : "undefined" != typeof Symbol && e[Symbol.iterator] || e["@@iterator"];
+            if (null != r) {
+                var n, o, a, i, l = [], u = !0, c = !1;
                 try {
-                    if (a = (n = n.call(e)).next, 0 === r) {
-                        if (Object(n) !== n) return;
+                    if (a = (r = r.call(e)).next, 0 === t) {
+                        if (Object(r) !== r) return;
                         u = !1;
-                    } else for (;!(u = (t = a.call(n)).done) && (l.push(t.value), l.length !== r); 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 != n["return"] && (i = n["return"](), Object(i) !== i)) return;
+                        if (!u && null != r["return"] && (i = r["return"](), Object(i) !== i)) return;
                     } finally {
                         if (c) throw o;
                     }
@@ -190,172 +271,180 @@
                 return l;
             }
         }
-        function h(e) {
+        function P(e) {
             if (Array.isArray(e)) return e;
         }
-        function w(e, r) {
+        function A(e, t) {
             if (null == e) return {};
-            var n, t, o = I(e, r);
+            var r, n, o = E(e, t);
             if (Object.getOwnPropertySymbols) {
                 var a = Object.getOwnPropertySymbols(e);
-                for (t = 0; t < a.length; t++) {
-                    n = a[t], r.includes(n) || {}.propertyIsEnumerable.call(e, n) && (o[n] = e[n]);
+                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 I(e, r) {
+        function E(e, t) {
             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];
+            var r = {};
+            for (var n in e) {
+                if ({}.hasOwnProperty.call(e, n)) {
+                    if (-1 !== t.indexOf(n)) continue;
+                    r[n] = e[n];
                 }
             }
-            return n;
+            return r;
         }
-        var S = {
+        var T = {
             id: a().string,
             children: a().node,
             content: a().node,
             customIndent: a().node,
+            elementRef: a().oneOfType([ a().func, a().object ]),
             endAdornment: a().node,
-            labelledBy: a().string,
+            expanded: a().bool,
             onFocus: a().func,
             onKeyDown: a().func,
-            onToggle: a().func,
-            open: a().bool,
-            toggle: a().node
+            onToggleSelection: a().func,
+            onToggleExpansion: a().func
         };
-        function O(n) {
-            var t = n.id, o = n.children, a = n.content, i = n.customIndent, u = n.endAdornment, c = n.labelledBy, f = n.onFocus, y = n.onKeyDown, m = n.onToggle, b = n.open, g = b === void 0 ? true : b, h = n.toggle, I = w(n, [ "id", "children", "content", "customIndent", "endAdornment", "labelledBy", "onFocus", "onKeyDown", "onToggle", "open", "toggle" ]);
-            var S = (0, e.useContext)(l), O = S.defaultIndent, A = O === void 0 ? true : O, j = S.onItemKeyDown, x = S.onItemClick, E = S.removeNode, P = S.setNode, k = S.itemPaths, T = S.focusedItemId;
-            var D = (0, e.useState)(g), C = p(D, 2), M = C[0], $ = C[1];
+        /** @public */
+        /** @public */        function D(r) {
+            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 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 _ = (0, e.useState)((k === null || k === void 0 ? void 0 : k.get("".concat(t))) === "0" ? 0 : -1), K = p(_, 2), N = K[0], F = K[1];
-            var U = (0, e.useRef)(null);
-            var q = (0, e.useRef)(null);
-            var B = e.Children.toArray(o).filter(e.isValidElement);
-            B.forEach((function(e, r) {
+                        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 U = e.Children.toArray(o).filter(e.isValidElement);
+            U.forEach((function(e, t) {
                 if (e.props.id) {
-                    if (M && P) {
-                        P("".concat(e.props.id), "".concat(k === null || k === void 0 ? void 0 : k.get("".concat(t)), "-").concat(r));
+                    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 X = function e(r, n) {
-                $(r);
-                m === null || m === void 0 ? void 0 : m(r, n);
-            };
-            var L = function e(r) {
-                x === null || x === void 0 ? void 0 : x(r, t);
-            };
-            var R = function e(r) {
-                var n;
-                r.stopPropagation();
-                U === null || U === void 0 ? void 0 : (n = U.current) === null || n === void 0 ? void 0 : n.focus();
-                f === null || f === void 0 ? void 0 : f(r);
-            };
-            var V = function e() {
-                if ((k === null || k === void 0 ? void 0 : k.get("".concat(t))) === "0") {
-                    F(0);
+            var q = (0, e.useCallback)((function(e) {
+                y(K, e);
+                y(l, e);
+            }), [ l ]);
+            var L = (0, e.useCallback)((function(e) {
+                var t;
+                var r = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};
+                // For consistency, if not provided but found in the event then add it to `data` on callback.
+                // This allows for common handling of both click and keyboard events in the consumer.
+                                var n = h({}, r);
+                if (!r.treeItemId && ((t = e.currentTarget) === null || t === void 0 ? void 0 : t.id)) {
+                    n.treeItemId = e.currentTarget.id;
                 }
-            };
+                I === null || I === void 0 ? void 0 : I(e, n);
+            }), [ I ]);
+            var X = (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();
+                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, D ]);
             (0, e.useEffect)((function() {
-                if (T === t) {
+                if (_ === n) {
                     var e;
-                    q === null || q === void 0 ? void 0 : (e = q.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, K ]);
+            var V = (0, e.useCallback)((function(e) {
+                e.stopPropagation();
+            }), []);
+            var W = (0, e.useCallback)((function(e) {
+                e.stopPropagation();
+                if (e.key === " ") {
+                    e.preventDefault();
+                    O === null || O === void 0 ? void 0 : O(e, {
+                        treeItemId: n
+                    });
+                    return;
                 }
-            }), [ T, q ]);
-            var z = function e(r) {
-                r.stopPropagation();
-            };
-            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,
                 // this allows user to tab backwards to previous item. Tab index is reset to 0 onBlur.
-                                if (r.shiftKey && r.key === "Tab" && (k === null || k === void 0 ? void 0 : k.get("".concat(t))) === "0") {
-                    F(-1);
+                                if (e.shiftKey && e.key === "Tab" && (D === null || D === void 0 ? void 0 : D.get("".concat(n))) === "0") {
+                    R(-1);
                 }
-                j === null || j === void 0 ? void 0 : j(r, t, M, B, X);
-                y === null || y === void 0 ? void 0 : y(r);
-            };
-            var G = function r() {
-                if (!h) {
-                    return undefined;
-                }
-                
-                return (0, e.cloneElement)(h, {
-                    onClick: function e(r) {
-                        var n, t;
-                        X(!M, r);
-                        L(r);
-                        (n = (t = h.props).onClick) === null || n === void 0 ? void 0 : n.call(t, r);
-                    },
-                    "aria-expanded": M
-                });
-            };
+                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 r().createElement("li", s({}, I, {
+            return t().createElement("li", b({
+                "data-test": "tree-item"
+            }, w, {
+                id: n,
                 ref: q,
                 tabIndex: N,
-                onBlur: V,
-                onFocus: R,
-                onKeyDown: H,
+                onBlur: H,
+                onFocus: B,
+                onKeyDown: W,
                 role: "treeitem",
-                "aria-labelledby": c,
-                "aria-expanded": B.length ? M : undefined
-            }), i,  r().createElement(d, {
-                ref: U,
+                "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: F,
                 tabIndex: -1,
-                onFocus: z,
-                onClick: L
-            }, a, G(), !M && u), M &&  r().createElement(r().Fragment, null,  r().createElement(v, {
+                onFocus: V,
+                onClick: X
+            }, a, !d && u)), d &&  t().createElement(t().Fragment, null,  t().createElement(p, {
                 role: "group",
-                $defaultIndent: A
+                $defaultIndent: x
             }, o), u));
         }
-        O.propTypes = S;
-        /* harmony default export */        const A = O;
+        D.propTypes = T;
+        /* harmony default export */        const _ = D;
         // CONCATENATED MODULE: ./src/Tree/treeUtils.ts
-        function j(e, r) {
-            return T(e) || k(e, r) || E(e, r) || x();
+        function $(e, t) {
+            return F(e) || K(e, t) || N(e, t) || M();
         }
-        function x() {
+        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 E(e, r) {
+        function N(e, t) {
             if (e) {
-                if ("string" == typeof e) return P(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) ? P(e, r) : void 0;
+                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) ? R(e, t) : void 0;
             }
         }
-        function P(e, r) {
-            (null == r || r > e.length) && (r = e.length);
-            for (var n = 0, t = Array(r); n < r; n++) {
-                t[n] = e[n];
+        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];
             }
-            return t;
+            return n;
         }
-        function k(e, r) {
-            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;
+        function K(e, t) {
+            var r = null == e ? null : "undefined" != typeof Symbol && e[Symbol.iterator] || e["@@iterator"];
+            if (null != r) {
+                var n, o, a, i, l = [], u = !0, c = !1;
                 try {
-                    if (a = (n = n.call(e)).next, 0 === r) {
-                        if (Object(n) !== n) return;
+                    if (a = (r = r.call(e)).next, 0 === t) {
+                        if (Object(r) !== r) return;
                         u = !1;
-                    } else for (;!(u = (t = a.call(n)).done) && (l.push(t.value), l.length !== r); 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 != n["return"] && (i = n["return"](), Object(i) !== i)) return;
+                        if (!u && null != r["return"] && (i = r["return"](), Object(i) !== i)) return;
                     } finally {
                         if (c) throw o;
                     }
@@ -363,189 +452,189 @@
                 return l;
             }
         }
-        function T(e) {
+        function F(e) {
             if (Array.isArray(e)) return e;
         }
         /**
  * A helper function to get first key in Map that matches given value
- */        function D(e, r) {
-            var n;
-            var t = Array.from(e.entries());
-            return (n = t.find((function(e) {
-                var n = j(e, 2), t = n[1];
-                return t === r;
-            }))) === null || n === void 0 ? void 0 : n[0];
+ */        function U(e, t) {
+            var r;
+            var n = Array.from(e.entries());
+            return (r = n.find((function(e) {
+                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 C(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 M(e, r) {
-            return e === null || e === void 0 ? void 0 : e.replace(/([^-]*)$/, "".concat(r + 1));
+ */        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 $(e) {
-            var r = e.split("-").pop();
-            if (!r) {
+ */        function X(e) {
+            var t = e.split("-").pop();
+            if (!t) {
                 return 0;
             }
-            return parseInt(r, 10) || 0;
+            return parseInt(t, 10) || 0;
         }
-        function _(e, r) {
-            var n = e.get(r);
-            if (!n) {
-                return r;
+        function B(e, t) {
+            var r = e.get(t);
+            if (!r) {
+                return t;
             }
-            var t = C(n);
-            return D(e, t) || r;
+            var n = q(r);
+            return U(e, n) || t;
         }
         /**
  * A helper function for getNextTreeItem
- */        function K(e, r) {
-            var n = C(r);
-            if (!n) {
-                return D(e, r);
+ */        function H(e, t) {
+            var r = q(t);
+            if (!r) {
+                return U(e, t);
             }
             // get next node in the parent level
-                        var t = $(n);
-            var o = M(n, t);
-            var a = D(e, o);
+                        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 K(e, o);
+                        return H(e, o);
         }
-        function N(e, r) {
-            var n = e.get(r);
-            if (!n) {
-                return r;
+        function V(e, t) {
+            var r = e.get(t);
+            if (!r) {
+                return t;
             }
             // case where next tree item is the first visible child
-                        var t = D(e, "".concat(n, "-0"));
-            if (t) {
-                return t;
+                        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 = $(n);
-            var a = M(n, o);
-            var i = D(e, 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 K(e, n) || r;
+                        return H(e, r) || t;
         }
         /**
  * A helper function for getPrevTreeItem
- */        function F(e, r) {
-            var n = D(e, "".concat(r, "-0"));
-            if (!n) {
-                return D(e, r);
+ */        function W(e, t) {
+            var r = U(e, "".concat(t, "-0"));
+            if (!r) {
+                return U(e, t);
             }
-            var t = D(e, r);
-            var o = "".concat(r, "-0");
+            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 (t) {
-                var a = $(o);
-                var i = M(o, a);
-                t = D(e, i);
-                if (t) {
+                        while (n) {
+                var a = X(o);
+                var i = L(o, a);
+                n = U(e, i);
+                if (n) {
                     o = i;
                 }
             }
-            return F(e, o);
+            return W(e, o);
         }
-        function U(e, r) {
-            var n = e.get(r);
-            if (!n) {
-                return r;
+        function z(e, t) {
+            var r = e.get(t);
+            if (!r) {
+                return t;
             }
-            var t = $(n);
+            var n = X(r);
             // case where current is first child of parent or root item
-                        if (t === 0) {
-                return _(e, r);
+                        if (n === 0) {
+                return B(e, t);
             }
             // case where previous tree item is or is a child of previous node in same level
-                        var o = n.replace(/[^-]+$/, "".concat(t - 1));
-            return F(e, o) || r;
+                        var o = r.replace(/[^-]+$/, "".concat(n - 1));
+            return W(e, o) || t;
         }
-        function q(e) {
-            return D(e, "0");
+        function G(e) {
+            return U(e, "0");
         }
-        function B(e) {
-            var r = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : "0";
-            var n = D(e, r);
-            var t = r;
+        function J(e) {
+            var t = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : "0";
+            var r = U(e, t);
+            var n = t;
             // find last child in current node
-                        while (n) {
-                var o = $(t);
-                n = D(e, M(t, o));
-                if (n) {
-                    t = M(t, o);
+                        while (r) {
+                var o = X(n);
+                r = U(e, L(n, o));
+                if (r) {
+                    n = L(n, o);
                 }
             }
             // check if last child has children
-                        var a = D(e, "".concat(t, "-0"));
+                        var a = U(e, "".concat(n, "-0"));
             if (!a) {
-                return D(e, t);
+                return U(e, n);
             }
             // continue to find its last child recursively
-                        t = "".concat(t, "-0");
-            return B(e, t);
+                        n = "".concat(n, "-0");
+            return J(e, n);
         }
         // CONCATENATED MODULE: ./src/Tree/Tree.tsx
-        function X() {
-            return X = Object.assign ? Object.assign.bind() : function(e) {
-                for (var r = 1; r < arguments.length; r++) {
-                    var n = arguments[r];
-                    for (var t in n) {
-                        ({}).hasOwnProperty.call(n, t) && (e[t] = n[t]);
+        function Q() {
+            return Q = Object.assign ? Object.assign.bind() : function(e) {
+                for (var t = 1; t < arguments.length; t++) {
+                    var r = arguments[t];
+                    for (var n in r) {
+                        ({}).hasOwnProperty.call(r, n) && (e[n] = r[n]);
                     }
                 }
                 return e;
-            }, X.apply(null, arguments);
+            }, Q.apply(null, arguments);
         }
-        function L(e, r) {
-            return G(e) || H(e, r) || V(e, r) || R();
+        function Y(e, t) {
+            return ne(e) || re(e, t) || ee(e, t) || Z();
         }
-        function R() {
+        function Z() {
             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 V(e, r) {
+        function ee(e, t) {
             if (e) {
-                if ("string" == typeof e) return z(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) ? z(e, r) : void 0;
+                if ("string" == typeof e) return te(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) ? te(e, t) : void 0;
             }
         }
-        function z(e, r) {
-            (null == r || r > e.length) && (r = e.length);
-            for (var n = 0, t = Array(r); n < r; n++) {
-                t[n] = e[n];
+        function te(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 t;
+            return n;
         }
-        function H(e, r) {
-            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;
+        function re(e, t) {
+            var r = null == e ? null : "undefined" != typeof Symbol && e[Symbol.iterator] || e["@@iterator"];
+            if (null != r) {
+                var n, o, a, i, l = [], u = !0, c = !1;
                 try {
-                    if (a = (n = n.call(e)).next, 0 === r) {
-                        if (Object(n) !== n) return;
+                    if (a = (r = r.call(e)).next, 0 === t) {
+                        if (Object(r) !== r) return;
                         u = !1;
-                    } else for (;!(u = (t = a.call(n)).done) && (l.push(t.value), l.length !== r); 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 != n["return"] && (i = n["return"](), Object(i) !== i)) return;
+                        if (!u && null != r["return"] && (i = r["return"](), Object(i) !== i)) return;
                     } finally {
                         if (c) throw o;
                     }
@@ -553,129 +642,143 @@
                 return l;
             }
         }
-        function G(e) {
+        function ne(e) {
             if (Array.isArray(e)) return e;
         }
-        function J(e, r) {
+        function oe(e, t) {
             if (null == e) return {};
-            var n, t, o = Q(e, r);
+            var r, n, o = ae(e, t);
             if (Object.getOwnPropertySymbols) {
                 var a = Object.getOwnPropertySymbols(e);
-                for (t = 0; t < a.length; t++) {
-                    n = a[t], r.includes(n) || {}.propertyIsEnumerable.call(e, n) && (o[n] = e[n]);
+                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 Q(e, r) {
+        function ae(e, t) {
             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];
+            var r = {};
+            for (var n in e) {
+                if ({}.hasOwnProperty.call(e, n)) {
+                    if (-1 !== t.indexOf(n)) continue;
+                    r[n] = e[n];
                 }
             }
-            return n;
+            return r;
         }
-        var W = {
+        var ie = {
             children: a().node,
-            defaultIndent: a().bool
+            defaultIndent: a().bool,
+            elementRef: a().oneOfType([ a().func, a().object ])
         };
-        function Y(n) {
-            var t = n.children, o = n.defaultIndent, a = o === void 0 ? true : o, i = J(n, [ "children", "defaultIndent" ]);
-            var u = (0, e.useState)(), c = L(u, 2), f = c[0], d = c[1];
-            var s = new Map;
-            var p = function e(r, n, t, o, a) {
-                r.stopPropagation();
-                var i = t && (o === null || o === void 0 ? void 0 : o.length);
-                switch (r.key) {
+        /**
+ * Used to present a hierarchical list.
+ */        function le(r) {
+            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], 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":
-                    r.preventDefault();
-                    d(U(s, n));
+                    e.preventDefault();
+                    s(z(d, t));
                     break;
 
                   case "ArrowDown":
-                    r.preventDefault();
-                    d(N(s, n));
+                    e.preventDefault();
+                    s(V(d, t));
                     break;
 
                   case "ArrowLeft":
-                    r.preventDefault();
-                    if (i) {
-                        a(false, r);
+                    e.preventDefault();
+                    if (a) {
+                        o(e, {
+                            treeItemId: t
+                        });
                     } else {
-                        d(_(s, n));
+                        s(B(d, t));
                     }
                     break;
 
                   case "ArrowRight":
-                    r.preventDefault();
-                    if (i) {
-                        d(N(s, n));
+                    e.preventDefault();
+                    if (a) {
+                        s(V(d, t));
                     } else {
-                        a(true, r);
+                        o(e, {
+                            treeItemId: t
+                        });
                     }
                     break;
 
                   case "Home":
-                    r.preventDefault();
-                    d(q(s));
+                    e.preventDefault();
+                    s(G(d));
                     break;
 
                   case "End":
-                    r.preventDefault();
-                    d(B(s));
+                    e.preventDefault();
+                    s(J(d));
                     break;
 
                   case "Enter":
-                    r.preventDefault();
-                    a(!i, r);
+                    e.preventDefault();
+                    o(e, {
+                        treeItemId: t
+                    });
                     break;
 
                   default:
  // do nothing
                                 }
+            }), [ d ]);
+            var m = function e(t, r) {
+                t.preventDefault();
+                s(r);
             };
-            var y = function e(r, n) {
-                r.preventDefault();
-                d(n);
-            };
-            var m = function e(r) {
-                s["delete"](r);
-            };
-            var b = function e(r, n) {
-                s.set(r, n);
-            };
-            var g = e.Children.toArray(t).filter(e.isValidElement);
-            g.forEach((function(e, r) {
-                if (e.props.id && b) {
-                    b("".concat(e.props.id), "".concat(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) {
+                    g("".concat(e.props.id), "".concat(t));
                 }
             }));
-            var h = (0, e.useMemo)((function() {
+            var I = (0, e.useMemo)((function() {
                 return {
                     defaultIndent: a,
-                    onItemKeyDown: p,
-                    onItemClick: y,
-                    removeNode: m,
-                    setNode: b,
-                    itemPaths: s,
+                    onItemKeyDown: y,
+                    onItemClick: m,
+                    removeNode: b,
+                    setNode: g,
+                    itemPaths: d,
                     focusedItemId: f
                 };
-            }), [ a, f, s, p, m, b ]);
+            }), [ a, f, d, y, b, g ]);
             
-            return r().createElement(l.Provider, {
-                value: h
-            },  r().createElement(v, X({
+            return t().createElement(v.Provider, {
+                value: I
+            },  t().createElement(p, Q({
+                "data-test": "tree",
+                ref: i,
                 role: "tree",
                 $defaultIndent: a
-            }, i), t));
+            }, l), n));
         }
-        Y.propTypes = W;
-        Y.TreeItem = A;
-        /* harmony default export */        const Z = Y;
+        le.propTypes = ie;
+        le.Item = _;
+        /* harmony default export */        const ue = le;
     }) // CONCATENATED MODULE: ./src/Tree/index.ts
     ();
-    module.exports = t;
+    module.exports = n;
     /******/})();