@splunk/react-ui 5.0.0-beta.5 → 5.0.0-rc.2

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (52) hide show
  1. package/ButtonSimple.js +92 -168
  2. package/{CHANGELOG.v5.mdx → CHANGELOG.v5.md} +43 -0
  3. package/Calendar.js +148 -151
  4. package/Card.js +139 -139
  5. package/Code.js +197 -167
  6. package/CollapsiblePanel.js +172 -164
  7. package/Color.js +584 -506
  8. package/ComboBox.js +51 -51
  9. package/ControlGroup.js +132 -127
  10. package/Date.js +137 -150
  11. package/Dropdown.js +97 -96
  12. package/DualListbox.js +468 -469
  13. package/FetchOptions.d.ts +2 -2
  14. package/FormRows.js +158 -157
  15. package/JSONTree.js +354 -360
  16. package/{MIGRATION.mdx → MIGRATION.md} +13 -43
  17. package/{MIGRATION.v5.mdx → MIGRATION.v5.md} +67 -1
  18. package/Markdown.js +3 -4
  19. package/Menu.js +194 -195
  20. package/Modal.js +18 -18
  21. package/ModalLayer.js +171 -217
  22. package/Multiselect.js +785 -778
  23. package/Number.js +103 -102
  24. package/Popover.js +48 -46
  25. package/RadioBar.js +144 -146
  26. package/Resize.js +149 -151
  27. package/ResultsMenu.js +112 -114
  28. package/Search.js +49 -49
  29. package/Select.js +455 -457
  30. package/Slider.js +328 -331
  31. package/Switch.js +251 -178
  32. package/TabBar.js +277 -280
  33. package/Table.js +1212 -1178
  34. package/Text.js +45 -46
  35. package/Tooltip.js +192 -189
  36. package/Tree.js +177 -188
  37. package/package.json +10 -9
  38. package/types/src/Code/Code.d.ts +1 -1
  39. package/types/src/Color/Color.d.ts +2 -2
  40. package/types/src/ControlGroup/ControlGroup.d.ts +1 -2
  41. package/types/src/Dropdown/Dropdown.d.ts +5 -2
  42. package/types/src/Layer/Layer.d.ts +2 -1
  43. package/types/src/Layer/index.d.ts +1 -0
  44. package/types/src/ModalLayer/ModalLayer.d.ts +16 -21
  45. package/types/src/Number/Number.d.ts +1 -1
  46. package/types/src/Popover/Popover.d.ts +5 -2
  47. package/types/src/Table/HeadCell.d.ts +6 -1
  48. package/types/src/Table/HeadInner.d.ts +3 -1
  49. package/types/src/Tooltip/Tooltip.d.ts +7 -7
  50. package/types/src/fixtures/useFetchOptions.d.ts +33 -0
  51. package/useRovingFocus.js +20 -23
  52. package/types/src/fixtures/FetchOptions.d.ts +0 -76
package/Tree.js CHANGED
@@ -6,10 +6,6 @@
6
6
  /***/ e => {
7
7
  e.exports = require("@splunk/themes");
8
8
  /***/ },
9
- /***/ 5295:
10
- /***/ e => {
11
- e.exports = require("@splunk/ui-utils/keyboard");
12
- /***/ },
13
9
  /***/ 23:
14
10
  /***/ e => {
15
11
  e.exports = require("prop-types");
@@ -108,8 +104,8 @@
108
104
  n.r(t);
109
105
  // EXPORTS
110
106
  n.d(t, {
111
- TreeItem: () => /* reexport */ x,
112
- default: () => /* reexport */ re
107
+ TreeItem: () => /* reexport */ A,
108
+ default: () => /* reexport */ Z
113
109
  });
114
110
  // EXTERNAL MODULE: external "react"
115
111
  var e = n(9497);
@@ -117,38 +113,32 @@
117
113
  // EXTERNAL MODULE: external "prop-types"
118
114
  var o = n(23);
119
115
  var a = n.n(o);
120
- // EXTERNAL MODULE: external "@splunk/ui-utils/keyboard"
121
- var i = n(5295);
122
116
  // CONCATENATED MODULE: ./src/Tree/TreeContext.tsx
123
- var l = (0, e.createContext)({
117
+ var i = (0, e.createContext)({
124
118
  defaultIndent: true
125
119
  });
126
- /* harmony default export */ const u = l;
120
+ /* harmony default export */ const l = i;
127
121
  // EXTERNAL MODULE: external "styled-components"
128
- var c = n(232);
129
- var f = n.n(c);
122
+ var u = n(232);
123
+ var c = n.n(u);
130
124
  // EXTERNAL MODULE: external "@splunk/themes"
131
- var d = n(3563);
125
+ var f = n(3563);
132
126
  // CONCATENATED MODULE: ./src/Tree/TreeItemStyles.ts
133
- var v = f().span.withConfig({
134
- displayName: "TreeItemStyles__StyledTreeItemContent",
135
- componentId: "ie7zrw-0"
136
- })([ "font-family:inherit;" ]);
137
- var s = f().span.withConfig({
127
+ var d = c().span.withConfig({
138
128
  displayName: "TreeItemStyles__StyledTreeItemNode",
139
- componentId: "ie7zrw-1"
140
- })([ "&:focus{box-shadow:", ";outline:0;&:active{box-shadow:none;}}" ], d.variables.focusShadow);
129
+ componentId: "ie7zrw-0"
130
+ })([ "padding:", ";&:focus{box-shadow:", ";outline:0;&:active{box-shadow:none;}}" ], f.variables.spacingXSmall, f.variables.focusShadowInset);
141
131
  // CONCATENATED MODULE: ./src/Tree/TreeStyles.ts
142
- var p = f().ul.withConfig({
132
+ var v = c().ul.withConfig({
143
133
  displayName: "TreeStyles__StyledUnorderedList",
144
134
  componentId: "sc-13pokwt-0"
145
- })([ "", ";color:inherit;font-family:inherit;list-style:none;white-space:inherit;", ";" ], d.mixins.reset("ul"), (function(e) {
135
+ })([ "", ";color:inherit;font-family:inherit;list-style:none;white-space:inherit;", ";" ], f.mixins.reset("ul"), (function(e) {
146
136
  var r = e.$defaultIndent;
147
- return r && (0, c.css)([ "padding-inline-start:", ";" ], d.variables.spacingXXXLarge);
137
+ return r && (0, u.css)([ "padding-inline-start:", ";" ], f.variables.spacingXXXLarge);
148
138
  }));
149
139
  // CONCATENATED MODULE: ./src/Tree/TreeItem.tsx
150
- function y() {
151
- return y = Object.assign ? Object.assign.bind() : function(e) {
140
+ function s() {
141
+ return s = Object.assign ? Object.assign.bind() : function(e) {
152
142
  for (var r = 1; r < arguments.length; r++) {
153
143
  var n = arguments[r];
154
144
  for (var t in n) {
@@ -156,29 +146,29 @@
156
146
  }
157
147
  }
158
148
  return e;
159
- }, y.apply(null, arguments);
149
+ }, s.apply(null, arguments);
160
150
  }
161
- function m(e, r) {
162
- return w(e) || I(e, r) || g(e, r) || b();
151
+ function p(e, r) {
152
+ return h(e) || g(e, r) || m(e, r) || y();
163
153
  }
164
- function b() {
154
+ function y() {
165
155
  throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
166
156
  }
167
- function g(e, r) {
157
+ function m(e, r) {
168
158
  if (e) {
169
- if ("string" == typeof e) return h(e, r);
159
+ if ("string" == typeof e) return b(e, r);
170
160
  var n = {}.toString.call(e).slice(8, -1);
171
- 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;
161
+ 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;
172
162
  }
173
163
  }
174
- function h(e, r) {
164
+ function b(e, r) {
175
165
  (null == r || r > e.length) && (r = e.length);
176
166
  for (var n = 0, t = Array(r); n < r; n++) {
177
167
  t[n] = e[n];
178
168
  }
179
169
  return t;
180
170
  }
181
- function I(e, r) {
171
+ function g(e, r) {
182
172
  var n = null == e ? null : "undefined" != typeof Symbol && e[Symbol.iterator] || e["@@iterator"];
183
173
  if (null != n) {
184
174
  var t, o, a, i, l = [], u = !0, c = !1;
@@ -200,12 +190,12 @@
200
190
  return l;
201
191
  }
202
192
  }
203
- function w(e) {
193
+ function h(e) {
204
194
  if (Array.isArray(e)) return e;
205
195
  }
206
- function S(e, r) {
196
+ function w(e, r) {
207
197
  if (null == e) return {};
208
- var n, t, o = O(e, r);
198
+ var n, t, o = I(e, r);
209
199
  if (Object.getOwnPropertySymbols) {
210
200
  var a = Object.getOwnPropertySymbols(e);
211
201
  for (t = 0; t < a.length; t++) {
@@ -214,7 +204,7 @@
214
204
  }
215
205
  return o;
216
206
  }
217
- function O(e, r) {
207
+ function I(e, r) {
218
208
  if (null == e) return {};
219
209
  var n = {};
220
210
  for (var t in e) {
@@ -225,7 +215,7 @@
225
215
  }
226
216
  return n;
227
217
  }
228
- var j = {
218
+ var S = {
229
219
  id: a().string,
230
220
  children: a().node,
231
221
  content: a().node,
@@ -238,120 +228,120 @@
238
228
  open: a().bool,
239
229
  toggle: a().node
240
230
  };
241
- function A(n) {
242
- 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" ]);
243
- var O = (0, e.useContext)(u), j = O.defaultIndent, A = j === void 0 ? true : j, x = O.onItemKeyDown, E = O.onItemClick, P = O.removeNode, k = O.setNode, T = O.itemPaths, C = O.focusedItemId;
244
- var D = (0, e.useState)(h), _ = m(D, 2), M = _[0], N = _[1];
231
+ function O(n) {
232
+ 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" ]);
233
+ 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;
234
+ var D = (0, e.useState)(g), C = p(D, 2), M = C[0], $ = C[1];
245
235
  // make first tree item tabbable
246
- var $ = (0, e.useState)((T === null || T === void 0 ? void 0 : T.get("".concat(t))) === "0" ? 0 : -1), K = m($, 2), F = K[0], q = K[1];
247
- var B = (0, e.useRef)(null);
236
+ 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];
248
237
  var U = (0, e.useRef)(null);
249
- var X = e.Children.toArray(o).filter(e.isValidElement);
250
- X.forEach((function(e, r) {
238
+ var q = (0, e.useRef)(null);
239
+ var B = e.Children.toArray(o).filter(e.isValidElement);
240
+ B.forEach((function(e, r) {
251
241
  if (e.props.id) {
252
- if (M && k) {
253
- k("".concat(e.props.id), "".concat(T === null || T === void 0 ? void 0 : T.get("".concat(t)), "-").concat(r));
254
- } else if (P) {
255
- P(e.props.id);
242
+ if (M && P) {
243
+ P("".concat(e.props.id), "".concat(k === null || k === void 0 ? void 0 : k.get("".concat(t)), "-").concat(r));
244
+ } else if (E) {
245
+ E(e.props.id);
256
246
  }
257
247
  }
258
248
  }));
259
- var z = function e(r, n) {
260
- N(r);
261
- b === null || b === void 0 ? void 0 : b(r, n);
249
+ var X = function e(r, n) {
250
+ $(r);
251
+ m === null || m === void 0 ? void 0 : m(r, n);
262
252
  };
263
253
  var L = function e(r) {
264
- E === null || E === void 0 ? void 0 : E(r, t);
254
+ x === null || x === void 0 ? void 0 : x(r, t);
265
255
  };
266
256
  var R = function e(r) {
267
257
  var n;
268
258
  r.stopPropagation();
269
- B === null || B === void 0 ? void 0 : (n = B.current) === null || n === void 0 ? void 0 : n.focus();
259
+ U === null || U === void 0 ? void 0 : (n = U.current) === null || n === void 0 ? void 0 : n.focus();
270
260
  f === null || f === void 0 ? void 0 : f(r);
271
261
  };
272
262
  var V = function e() {
273
- if ((T === null || T === void 0 ? void 0 : T.get("".concat(t))) === "0") {
274
- q(0);
263
+ if ((k === null || k === void 0 ? void 0 : k.get("".concat(t))) === "0") {
264
+ F(0);
275
265
  }
276
266
  };
277
267
  (0, e.useEffect)((function() {
278
- if (C === t) {
268
+ if (T === t) {
279
269
  var e;
280
- U === null || U === void 0 ? void 0 : (e = U.current) === null || e === void 0 ? void 0 : e.focus();
270
+ q === null || q === void 0 ? void 0 : (e = q.current) === null || e === void 0 ? void 0 : e.focus();
281
271
  }
282
- }), [ C, U ]);
283
- var G = function e(r) {
272
+ }), [ T, q ]);
273
+ var z = function e(r) {
284
274
  r.stopPropagation();
285
275
  };
286
276
  var H = function e(r) {
287
277
  r.stopPropagation();
288
278
  // Used to ensure first item in Tree is tab navigable, i.e. in JSONTree when focus is manually set to the root item,
289
279
  // this allows user to tab backwards to previous item. Tab index is reset to 0 onBlur.
290
- if (r.shiftKey && r.key === "Tab" && (T === null || T === void 0 ? void 0 : T.get("".concat(t))) === "0") {
291
- q(-1);
280
+ if (r.shiftKey && r.key === "Tab" && (k === null || k === void 0 ? void 0 : k.get("".concat(t))) === "0") {
281
+ F(-1);
292
282
  }
293
- x === null || x === void 0 ? void 0 : x(r, t, M, X, z);
294
- d === null || d === void 0 ? void 0 : d(r);
283
+ j === null || j === void 0 ? void 0 : j(r, t, M, B, X);
284
+ y === null || y === void 0 ? void 0 : y(r);
295
285
  };
296
- var J = function r() {
297
- if (!I) {
286
+ var G = function r() {
287
+ if (!h) {
298
288
  return undefined;
299
289
  }
300
290
 
301
- return (0, e.cloneElement)(I, {
291
+ return (0, e.cloneElement)(h, {
302
292
  onClick: function e(r) {
303
293
  var n, t;
304
- z(!M, r);
294
+ X(!M, r);
305
295
  L(r);
306
- (n = (t = I.props).onClick) === null || n === void 0 ? void 0 : n.call(t, r);
296
+ (n = (t = h.props).onClick) === null || n === void 0 ? void 0 : n.call(t, r);
307
297
  },
308
298
  "aria-expanded": M
309
299
  });
310
300
  };
311
301
 
312
- return r().createElement("li", y({}, w, {
313
- ref: U,
314
- tabIndex: F,
302
+ return r().createElement("li", s({}, I, {
303
+ ref: q,
304
+ tabIndex: N,
315
305
  onBlur: V,
316
306
  onFocus: R,
317
307
  onKeyDown: H,
318
308
  role: "treeitem",
319
309
  "aria-labelledby": c,
320
- "aria-expanded": X.length ? M : undefined
321
- }), i, r().createElement(s, {
322
- ref: B,
310
+ "aria-expanded": B.length ? M : undefined
311
+ }), i, r().createElement(d, {
312
+ ref: U,
323
313
  tabIndex: -1,
324
- onFocus: G,
314
+ onFocus: z,
325
315
  onClick: L
326
- }, r().createElement(v, null, a), J(), !M && l), M && r().createElement(r().Fragment, null, r().createElement(p, {
316
+ }, a, G(), !M && u), M && r().createElement(r().Fragment, null, r().createElement(v, {
327
317
  role: "group",
328
318
  $defaultIndent: A
329
- }, o), l));
319
+ }, o), u));
330
320
  }
331
- A.propTypes = j;
332
- /* harmony default export */ const x = A;
321
+ O.propTypes = S;
322
+ /* harmony default export */ const A = O;
333
323
  // CONCATENATED MODULE: ./src/Tree/treeUtils.ts
334
- function E(e, r) {
335
- return D(e) || C(e, r) || k(e, r) || P();
324
+ function j(e, r) {
325
+ return T(e) || k(e, r) || E(e, r) || x();
336
326
  }
337
- function P() {
327
+ function x() {
338
328
  throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
339
329
  }
340
- function k(e, r) {
330
+ function E(e, r) {
341
331
  if (e) {
342
- if ("string" == typeof e) return T(e, r);
332
+ if ("string" == typeof e) return P(e, r);
343
333
  var n = {}.toString.call(e).slice(8, -1);
344
- 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) ? T(e, r) : void 0;
334
+ 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;
345
335
  }
346
336
  }
347
- function T(e, r) {
337
+ function P(e, r) {
348
338
  (null == r || r > e.length) && (r = e.length);
349
339
  for (var n = 0, t = Array(r); n < r; n++) {
350
340
  t[n] = e[n];
351
341
  }
352
342
  return t;
353
343
  }
354
- function C(e, r) {
344
+ function k(e, r) {
355
345
  var n = null == e ? null : "undefined" != typeof Symbol && e[Symbol.iterator] || e["@@iterator"];
356
346
  if (null != n) {
357
347
  var t, o, a, i, l = [], u = !0, c = !1;
@@ -373,28 +363,28 @@
373
363
  return l;
374
364
  }
375
365
  }
376
- function D(e) {
366
+ function T(e) {
377
367
  if (Array.isArray(e)) return e;
378
368
  }
379
369
  /**
380
370
  * A helper function to get first key in Map that matches given value
381
- */ function _(e, r) {
371
+ */ function D(e, r) {
382
372
  var n;
383
373
  var t = Array.from(e.entries());
384
374
  return (n = t.find((function(e) {
385
- var n = E(e, 2), t = n[1];
375
+ var n = j(e, 2), t = n[1];
386
376
  return t === r;
387
377
  }))) === null || n === void 0 ? void 0 : n[0];
388
378
  }
389
379
  /**
390
380
  * A helper function to get parent path of current item path
391
- */ function M(e) {
381
+ */ function C(e) {
392
382
  // remove last index number of the current item path string to get parent
393
383
  return e.split("-").slice(0, -1).join("-");
394
384
  }
395
385
  /**
396
386
  * A helper function to get next path of current item path in same level
397
- */ function N(e, r) {
387
+ */ function M(e, r) {
398
388
  return e === null || e === void 0 ? void 0 : e.replace(/([^-]*)$/, "".concat(r + 1));
399
389
  }
400
390
  /**
@@ -406,70 +396,70 @@
406
396
  }
407
397
  return parseInt(r, 10) || 0;
408
398
  }
409
- function K(e, r) {
399
+ function _(e, r) {
410
400
  var n = e.get(r);
411
401
  if (!n) {
412
402
  return r;
413
403
  }
414
- var t = M(n);
415
- return _(e, t) || r;
404
+ var t = C(n);
405
+ return D(e, t) || r;
416
406
  }
417
407
  /**
418
408
  * A helper function for getNextTreeItem
419
- */ function F(e, r) {
420
- var n = M(r);
409
+ */ function K(e, r) {
410
+ var n = C(r);
421
411
  if (!n) {
422
- return _(e, r);
412
+ return D(e, r);
423
413
  }
424
414
  // get next node in the parent level
425
415
  var t = $(n);
426
- var o = N(n, t);
427
- var a = _(e, o);
416
+ var o = M(n, t);
417
+ var a = D(e, o);
428
418
  if (a) {
429
419
  return a;
430
420
  }
431
421
  // continue getting parents until find next node or reach root
432
- return F(e, o);
422
+ return K(e, o);
433
423
  }
434
- function q(e, r) {
424
+ function N(e, r) {
435
425
  var n = e.get(r);
436
426
  if (!n) {
437
427
  return r;
438
428
  }
439
429
  // case where next tree item is the first visible child
440
- var t = _(e, "".concat(n, "-0"));
430
+ var t = D(e, "".concat(n, "-0"));
441
431
  if (t) {
442
432
  return t;
443
433
  }
444
434
  // case where next tree item is the next node in the same level
445
435
  var o = $(n);
446
- var a = N(n, o);
447
- var i = _(e, a);
436
+ var a = M(n, o);
437
+ var i = D(e, a);
448
438
  if (i) {
449
439
  return i;
450
440
  }
451
441
  // case where next tree item is a higher level or does not exist
452
- return F(e, n) || r;
442
+ return K(e, n) || r;
453
443
  }
454
444
  /**
455
445
  * A helper function for getPrevTreeItem
456
- */ function B(e, r) {
457
- var n = _(e, "".concat(r, "-0"));
446
+ */ function F(e, r) {
447
+ var n = D(e, "".concat(r, "-0"));
458
448
  if (!n) {
459
- return _(e, r);
449
+ return D(e, r);
460
450
  }
461
- var t = _(e, r);
451
+ var t = D(e, r);
462
452
  var o = "".concat(r, "-0");
463
453
  // get the last child in current node, and continue to find its children recursively
464
454
  while (t) {
465
455
  var a = $(o);
466
- var i = N(o, a);
467
- t = _(e, i);
456
+ var i = M(o, a);
457
+ t = D(e, i);
468
458
  if (t) {
469
459
  o = i;
470
460
  }
471
461
  }
472
- return B(e, o);
462
+ return F(e, o);
473
463
  }
474
464
  function U(e, r) {
475
465
  var n = e.get(r);
@@ -479,39 +469,39 @@
479
469
  var t = $(n);
480
470
  // case where current is first child of parent or root item
481
471
  if (t === 0) {
482
- return K(e, r);
472
+ return _(e, r);
483
473
  }
484
474
  // case where previous tree item is or is a child of previous node in same level
485
475
  var o = n.replace(/[^-]+$/, "".concat(t - 1));
486
- return B(e, o) || r;
476
+ return F(e, o) || r;
487
477
  }
488
- function X(e) {
489
- return _(e, "0");
478
+ function q(e) {
479
+ return D(e, "0");
490
480
  }
491
- function z(e) {
481
+ function B(e) {
492
482
  var r = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : "0";
493
- var n = _(e, r);
483
+ var n = D(e, r);
494
484
  var t = r;
495
485
  // find last child in current node
496
486
  while (n) {
497
487
  var o = $(t);
498
- n = _(e, N(t, o));
488
+ n = D(e, M(t, o));
499
489
  if (n) {
500
- t = N(t, o);
490
+ t = M(t, o);
501
491
  }
502
492
  }
503
493
  // check if last child has children
504
- var a = _(e, "".concat(t, "-0"));
494
+ var a = D(e, "".concat(t, "-0"));
505
495
  if (!a) {
506
- return _(e, t);
496
+ return D(e, t);
507
497
  }
508
498
  // continue to find its last child recursively
509
499
  t = "".concat(t, "-0");
510
- return z(e, t);
500
+ return B(e, t);
511
501
  }
512
502
  // CONCATENATED MODULE: ./src/Tree/Tree.tsx
513
- function L() {
514
- return L = Object.assign ? Object.assign.bind() : function(e) {
503
+ function X() {
504
+ return X = Object.assign ? Object.assign.bind() : function(e) {
515
505
  for (var r = 1; r < arguments.length; r++) {
516
506
  var n = arguments[r];
517
507
  for (var t in n) {
@@ -519,29 +509,29 @@
519
509
  }
520
510
  }
521
511
  return e;
522
- }, L.apply(null, arguments);
512
+ }, X.apply(null, arguments);
523
513
  }
524
- function R(e, r) {
525
- return Q(e) || J(e, r) || G(e, r) || V();
514
+ function L(e, r) {
515
+ return G(e) || H(e, r) || V(e, r) || R();
526
516
  }
527
- function V() {
517
+ function R() {
528
518
  throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
529
519
  }
530
- function G(e, r) {
520
+ function V(e, r) {
531
521
  if (e) {
532
- if ("string" == typeof e) return H(e, r);
522
+ if ("string" == typeof e) return z(e, r);
533
523
  var n = {}.toString.call(e).slice(8, -1);
534
- 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;
524
+ 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;
535
525
  }
536
526
  }
537
- function H(e, r) {
527
+ function z(e, r) {
538
528
  (null == r || r > e.length) && (r = e.length);
539
529
  for (var n = 0, t = Array(r); n < r; n++) {
540
530
  t[n] = e[n];
541
531
  }
542
532
  return t;
543
533
  }
544
- function J(e, r) {
534
+ function H(e, r) {
545
535
  var n = null == e ? null : "undefined" != typeof Symbol && e[Symbol.iterator] || e["@@iterator"];
546
536
  if (null != n) {
547
537
  var t, o, a, i, l = [], u = !0, c = !1;
@@ -563,12 +553,12 @@
563
553
  return l;
564
554
  }
565
555
  }
566
- function Q(e) {
556
+ function G(e) {
567
557
  if (Array.isArray(e)) return e;
568
558
  }
569
- function W(e, r) {
559
+ function J(e, r) {
570
560
  if (null == e) return {};
571
- var n, t, o = Y(e, r);
561
+ var n, t, o = Q(e, r);
572
562
  if (Object.getOwnPropertySymbols) {
573
563
  var a = Object.getOwnPropertySymbols(e);
574
564
  for (t = 0; t < a.length; t++) {
@@ -577,7 +567,7 @@
577
567
  }
578
568
  return o;
579
569
  }
580
- function Y(e, r) {
570
+ function Q(e, r) {
581
571
  if (null == e) return {};
582
572
  var n = {};
583
573
  for (var t in e) {
@@ -588,104 +578,103 @@
588
578
  }
589
579
  return n;
590
580
  }
591
- var Z = {
581
+ var W = {
592
582
  children: a().node,
593
583
  defaultIndent: a().bool
594
584
  };
595
- function ee(n) {
596
- var t = n.children, o = n.defaultIndent, a = o === void 0 ? true : o, l = W(n, [ "children", "defaultIndent" ]);
597
- var c = (0, e.useState)(), f = R(c, 2), d = f[0], v = f[1];
585
+ function Y(n) {
586
+ var t = n.children, o = n.defaultIndent, a = o === void 0 ? true : o, i = J(n, [ "children", "defaultIndent" ]);
587
+ var u = (0, e.useState)(), c = L(u, 2), f = c[0], d = c[1];
598
588
  var s = new Map;
599
- var y = function e(r, n, t, o, a) {
589
+ var p = function e(r, n, t, o, a) {
600
590
  r.stopPropagation();
601
- var l = (0, i.keycode)(r.nativeEvent);
602
- var u = t && (o === null || o === void 0 ? void 0 : o.length);
603
- switch (l) {
604
- case "up":
591
+ var i = t && (o === null || o === void 0 ? void 0 : o.length);
592
+ switch (r.key) {
593
+ case "ArrowUp":
605
594
  r.preventDefault();
606
- v(U(s, n));
595
+ d(U(s, n));
607
596
  break;
608
597
 
609
- case "down":
598
+ case "ArrowDown":
610
599
  r.preventDefault();
611
- v(q(s, n));
600
+ d(N(s, n));
612
601
  break;
613
602
 
614
- case "left":
603
+ case "ArrowLeft":
615
604
  r.preventDefault();
616
- if (u) {
605
+ if (i) {
617
606
  a(false, r);
618
607
  } else {
619
- v(K(s, n));
608
+ d(_(s, n));
620
609
  }
621
610
  break;
622
611
 
623
- case "right":
612
+ case "ArrowRight":
624
613
  r.preventDefault();
625
- if (u) {
626
- v(q(s, n));
614
+ if (i) {
615
+ d(N(s, n));
627
616
  } else {
628
617
  a(true, r);
629
618
  }
630
619
  break;
631
620
 
632
- case "home":
621
+ case "Home":
633
622
  r.preventDefault();
634
- v(X(s));
623
+ d(q(s));
635
624
  break;
636
625
 
637
- case "end":
626
+ case "End":
638
627
  r.preventDefault();
639
- v(z(s));
628
+ d(B(s));
640
629
  break;
641
630
 
642
- case "enter":
631
+ case "Enter":
643
632
  r.preventDefault();
644
- a(!u, r);
633
+ a(!i, r);
645
634
  break;
646
635
 
647
636
  default:
648
637
  // do nothing
649
638
  }
650
639
  };
651
- var m = function e(r, n) {
640
+ var y = function e(r, n) {
652
641
  r.preventDefault();
653
- v(n);
642
+ d(n);
654
643
  };
655
- var b = function e(r) {
644
+ var m = function e(r) {
656
645
  s["delete"](r);
657
646
  };
658
- var g = function e(r, n) {
647
+ var b = function e(r, n) {
659
648
  s.set(r, n);
660
649
  };
661
- var h = e.Children.toArray(t).filter(e.isValidElement);
662
- h.forEach((function(e, r) {
663
- if (e.props.id && g) {
664
- g("".concat(e.props.id), "".concat(r));
650
+ var g = e.Children.toArray(t).filter(e.isValidElement);
651
+ g.forEach((function(e, r) {
652
+ if (e.props.id && b) {
653
+ b("".concat(e.props.id), "".concat(r));
665
654
  }
666
655
  }));
667
- var I = (0, e.useMemo)((function() {
656
+ var h = (0, e.useMemo)((function() {
668
657
  return {
669
658
  defaultIndent: a,
670
- onItemKeyDown: y,
671
- onItemClick: m,
672
- removeNode: b,
673
- setNode: g,
659
+ onItemKeyDown: p,
660
+ onItemClick: y,
661
+ removeNode: m,
662
+ setNode: b,
674
663
  itemPaths: s,
675
- focusedItemId: d
664
+ focusedItemId: f
676
665
  };
677
- }), [ a, d, s, y, b, g ]);
666
+ }), [ a, f, s, p, m, b ]);
678
667
 
679
- return r().createElement(u.Provider, {
680
- value: I
681
- }, r().createElement(p, L({
668
+ return r().createElement(l.Provider, {
669
+ value: h
670
+ }, r().createElement(v, X({
682
671
  role: "tree",
683
672
  $defaultIndent: a
684
- }, l), t));
673
+ }, i), t));
685
674
  }
686
- ee.propTypes = Z;
687
- ee.TreeItem = x;
688
- /* harmony default export */ const re = ee;
675
+ Y.propTypes = W;
676
+ Y.TreeItem = A;
677
+ /* harmony default export */ const Z = Y;
689
678
  }) // CONCATENATED MODULE: ./src/Tree/index.ts
690
679
  ();
691
680
  module.exports = t;