@elliemae/ds-treeview 2.2.1 → 2.3.0-alpha.4

package/esm/utils/keyboard-helpers.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../../scripts/build/transpile/react-shim.js", "../../../src/utils/keyboard-helpers.tsx"],
+  "sourcesContent": ["import * as React from 'react';\nexport { React };\n", "/* eslint-disable max-params */\n/* eslint-disable max-lines */\n/* eslint-disable max-statements */\n/* eslint-disable complexity */\nimport { useCallback, useContext, useEffect } from 'react';\nimport TreeViewContext from '../TreeViewContext';\nimport { focusItem } from './tree-helpers';\nimport { toggleExpandAllHelper, toggleItemExpand } from './group-expands-helpers';\nimport type { DSTreeviewT } from '../react-desc-prop-types';\nimport type { DSTreeviewInternalsT } from '../sharedTypes';\nimport { SortableItemContextType } from '../hoc/SortableItemContext';\n\n// 9 tab\n// 13 enter\n// 32 space\n// 37 left arrow\n// 38 up arrow\n// 39 right arrow\n// 40 down arrow\n// 35 end\n// 36 home\n\n// 56 number 8\n// 106 (NumPad) *\n\nexport const useOnItemKeyDown = (item: DSTreeviewT.Item, draggableProps: SortableItemContextType['draggableProps']) => {\n  const ctx = useContext(TreeViewContext);\n  const {\n    props: { onItemFocus },\n    triggerTreeRerender,\n    visibleItems,\n    setFocusedItem,\n    setSelectedItem,\n    setLatestToggledItem,\n    updateUserExpandedState,\n    virtualListHelpers: { scrollToIndex },\n  } = ctx;\n  const { isGroup, isExpanded } = item;\n  const onItemFocusCurry = useCallback(\n    (newFocusItem: DSTreeviewT.Item) =>\n      onItemFocus({\n        itemIndex: newFocusItem.virtualIndex as number,\n        scrollToItem: (opts = { align: 'start' }) => scrollToIndex(newFocusItem.virtualIndex as number, opts),\n        item: newFocusItem,\n      }),\n    [onItemFocus, scrollToIndex],\n  );\n\n  const onItemKeyDown = useCallback(\n    (e: React.KeyboardEvent<HTMLLIElement>) => {\n      const { keyCode } = e;\n      if (!(draggableProps && draggableProps.active)) {\n        if (keyCode !== 9) e.preventDefault(); // allow tab/shift+tab\n        if ((keyCode === 13 || keyCode === 32) && (e.target as HTMLElement).tagName === 'LI') {\n          setSelectedItem(item);\n        }\n\n        if (keyCode === 37) {\n          if (isGroup && isExpanded) {\n            toggleItemExpand(item, triggerTreeRerender, updateUserExpandedState, scrollToIndex);\n            setLatestToggledItem(item);\n          }\n        }\n        if (keyCode === 39) {\n          if (isGroup && !isExpanded) {\n            toggleItemExpand(item, triggerTreeRerender, updateUserExpandedState, scrollToIndex);\n            setLatestToggledItem(item);\n          }\n        }\n\n        const { virtualIndex } = item;\n        if (typeof virtualIndex === 'number') {\n          const lastItemIndex = visibleItems.length - 1;\n          if (keyCode === 38) {\n            const isLoopedFocus = virtualIndex === 0;\n            const newFocusIndex = isLoopedFocus ? lastItemIndex : virtualIndex - 1;\n            const newFocusItem = visibleItems[newFocusIndex];\n            scrollToIndex(newFocusIndex);\n            if (isLoopedFocus) {\n              // when looping the list from start to end we need to wait a bit before focusing\n              setTimeout(() => {\n                setFocusedItem(newFocusItem);\n                focusItem(newFocusItem);\n                onItemFocusCurry(newFocusItem);\n              }, 300);\n            } else {\n              setFocusedItem(newFocusItem);\n              onItemFocusCurry(newFocusItem);\n              focusItem(newFocusItem);\n            }\n          }\n          if (keyCode === 40) {\n            const isLoopedFocus = virtualIndex === lastItemIndex;\n            const newFocusIndex = isLoopedFocus ? 0 : virtualIndex + 1;\n            const newFocusItem = visibleItems[newFocusIndex];\n            scrollToIndex(newFocusIndex);\n            if (isLoopedFocus) {\n              // when looping the list from start to end we need to wait a bit before focusing\n              setTimeout(() => {\n                setFocusedItem(newFocusItem);\n                onItemFocusCurry(newFocusItem);\n                focusItem(newFocusItem);\n              }, 300);\n            } else {\n              setFocusedItem(newFocusItem);\n              onItemFocusCurry(newFocusItem);\n              focusItem(newFocusItem);\n            }\n          }\n          if (keyCode === 35) {\n            if (virtualIndex !== lastItemIndex) {\n              const newFocusItem = visibleItems[lastItemIndex];\n              scrollToIndex(lastItemIndex);\n              setTimeout(() => {\n                setFocusedItem(newFocusItem);\n                onItemFocusCurry(newFocusItem);\n                focusItem(newFocusItem);\n              }, 300);\n            }\n          }\n          if (keyCode === 36) {\n            if (virtualIndex !== 0) {\n              const newFocusItem = visibleItems[0];\n              scrollToIndex(0);\n              setTimeout(() => {\n                setFocusedItem(newFocusItem);\n                onItemFocusCurry(newFocusItem);\n                focusItem(newFocusItem);\n              }, 300);\n            }\n          }\n        }\n      }\n    },\n    [\n      draggableProps,\n      setSelectedItem,\n      item,\n      isGroup,\n      isExpanded,\n      triggerTreeRerender,\n      updateUserExpandedState,\n      scrollToIndex,\n      setLatestToggledItem,\n      visibleItems,\n      setFocusedItem,\n      onItemFocusCurry,\n    ],\n  );\n\n  return onItemKeyDown;\n};\n\nexport const useGlobalKeyboardListener = (func: (e: KeyboardEvent) => void) => {\n  useEffect(() => {\n    document.addEventListener('keydown', func);\n    return () => document.removeEventListener('keydown', func);\n  }, [func]);\n};\n\nexport const useGlobalToggleAllExpandShortcut = (\n  treeRoot: DSTreeviewT.Item['node'],\n  triggerTreeRerender: () => void,\n  setLatestToggledItem: DSTreeviewInternalsT.CTX['setLatestToggledItem'],\n  updateUserExpandedState: DSTreeviewInternalsT.CTX['updateUserExpandedState'],\n) => {\n  const memoizedToggleAllKeyboardShortcut = useCallback(\n    (e: KeyboardEvent) => {\n      const { shiftKey, keyCode } = e;\n      if (shiftKey && keyCode === 56) {\n        toggleExpandAllHelper('toggle', treeRoot, triggerTreeRerender, setLatestToggledItem, updateUserExpandedState);\n      }\n    },\n    [setLatestToggledItem, treeRoot, triggerTreeRerender, updateUserExpandedState],\n  );\n\n  return useGlobalKeyboardListener(memoizedToggleAllKeyboardShortcut);\n};\n"],
+  "mappings": "AAAA;ACIA;AACA;AACA;AACA;AAkBO,MAAM,mBAAmB,CAAC,MAAwB,mBAA8D;AACrH,QAAM,MAAM,WAAW;AACvB,QAAM;AAAA,IACJ,OAAO,EAAE;AAAA,IACT;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,oBAAoB,EAAE;AAAA,MACpB;AACJ,QAAM,EAAE,SAAS,eAAe;AAChC,QAAM,mBAAmB,YACvB,CAAC,iBACC,YAAY;AAAA,IACV,WAAW,aAAa;AAAA,IACxB,cAAc,CAAC,OAAO,EAAE,OAAO,cAAc,cAAc,aAAa,cAAwB;AAAA,IAChG,MAAM;AAAA,MAEV,CAAC,aAAa;AAGhB,QAAM,gBAAgB,YACpB,CAAC,MAA0C;AACzC,UAAM,EAAE,YAAY;AACpB,QAAI,CAAE,mBAAkB,eAAe,SAAS;AAC9C,UAAI,YAAY;AAAG,UAAE;AACrB,UAAK,aAAY,MAAM,YAAY,OAAQ,EAAE,OAAuB,YAAY,MAAM;AACpF,wBAAgB;AAAA;AAGlB,UAAI,YAAY,IAAI;AAClB,YAAI,WAAW,YAAY;AACzB,2BAAiB,MAAM,qBAAqB,yBAAyB;AACrE,+BAAqB;AAAA;AAAA;AAGzB,UAAI,YAAY,IAAI;AAClB,YAAI,WAAW,CAAC,YAAY;AAC1B,2BAAiB,MAAM,qBAAqB,yBAAyB;AACrE,+BAAqB;AAAA;AAAA;AAIzB,YAAM,EAAE,iBAAiB;AACzB,UAAI,OAAO,iBAAiB,UAAU;AACpC,cAAM,gBAAgB,aAAa,SAAS;AAC5C,YAAI,YAAY,IAAI;AAClB,gBAAM,gBAAgB,iBAAiB;AACvC,gBAAM,gBAAgB,gBAAgB,gBAAgB,eAAe;AACrE,gBAAM,eAAe,aAAa;AAClC,wBAAc;AACd,cAAI,eAAe;AAEjB,uBAAW,MAAM;AACf,6BAAe;AACf,wBAAU;AACV,+BAAiB;AAAA,eAChB;AAAA,iBACE;AACL,2BAAe;AACf,6BAAiB;AACjB,sBAAU;AAAA;AAAA;AAGd,YAAI,YAAY,IAAI;AAClB,gBAAM,gBAAgB,iBAAiB;AACvC,gBAAM,gBAAgB,gBAAgB,IAAI,eAAe;AACzD,gBAAM,eAAe,aAAa;AAClC,wBAAc;AACd,cAAI,eAAe;AAEjB,uBAAW,MAAM;AACf,6BAAe;AACf,+BAAiB;AACjB,wBAAU;AAAA,eACT;AAAA,iBACE;AACL,2BAAe;AACf,6BAAiB;AACjB,sBAAU;AAAA;AAAA;AAGd,YAAI,YAAY,IAAI;AAClB,cAAI,iBAAiB,eAAe;AAClC,kBAAM,eAAe,aAAa;AAClC,0BAAc;AACd,uBAAW,MAAM;AACf,6BAAe;AACf,+BAAiB;AACjB,wBAAU;AAAA,eACT;AAAA;AAAA;AAGP,YAAI,YAAY,IAAI;AAClB,cAAI,iBAAiB,GAAG;AACtB,kBAAM,eAAe,aAAa;AAClC,0BAAc;AACd,uBAAW,MAAM;AACf,6BAAe;AACf,+BAAiB;AACjB,wBAAU;AAAA,eACT;AAAA;AAAA;AAAA;AAAA;AAAA,KAMb;AAAA,IACE;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA;AAIJ,SAAO;AAAA;AAGF,MAAM,4BAA4B,CAAC,SAAqC;AAC7E,YAAU,MAAM;AACd,aAAS,iBAAiB,WAAW;AACrC,WAAO,MAAM,SAAS,oBAAoB,WAAW;AAAA,KACpD,CAAC;AAAA;AAGC,MAAM,mCAAmC,CAC9C,UACA,qBACA,sBACA,4BACG;AACH,QAAM,oCAAoC,YACxC,CAAC,MAAqB;AACpB,UAAM,EAAE,UAAU,YAAY;AAC9B,QAAI,YAAY,YAAY,IAAI;AAC9B,4BAAsB,UAAU,UAAU,qBAAqB,sBAAsB;AAAA;AAAA,KAGzF,CAAC,sBAAsB,UAAU,qBAAqB;AAGxD,SAAO,0BAA0B;AAAA;",
+  "names": []
+}

package/esm/utils/object-helpers.js

@@ -1,64 +1,47 @@
-import 'core-js/modules/esnext.async-iterator.for-each.js';
-import 'core-js/modules/esnext.iterator.constructor.js';
-import 'core-js/modules/esnext.iterator.for-each.js';
-import 'core-js/modules/esnext.async-iterator.reduce.js';
-import 'core-js/modules/esnext.iterator.reduce.js';
-
-/* eslint-disable no-sequences */
-
-/* eslint-disable no-return-assign */
-
-/* eslint-disable no-restricted-syntax */
-
-/* eslint-disable guard-for-in */
+import * as React from "react";
 function isObjectADate(o) {
-  var _o$constructor;
-
-  return (o === null || o === void 0 ? void 0 : (_o$constructor = o.constructor) === null || _o$constructor === void 0 ? void 0 : _o$constructor.name) === 'Date';
+  return o?.constructor?.name === "Date";
 }
-
 function isObjectAnArray(o) {
   return Array.isArray(o);
 }
-
 function isObjectAString(o) {
-  return typeof o === 'object';
+  return typeof o === "object";
 }
-
-const unfreeze = o => {
+const unfreeze = (o) => {
   let oo;
-
   if (o === null) {
     oo = null;
-  } else if (o === undefined) {
-    oo = undefined;
+  } else if (o === void 0) {
+    oo = void 0;
   } else if (isObjectADate(o)) {
     oo = new Date(o);
   } else if (isObjectAnArray(o)) {
     oo = [];
-    o.forEach(v => {
+    o.forEach((v) => {
       oo.push(v);
     });
   } else if (isObjectAString(o)) {
     oo = String(o);
   } else if (isObjectAString(o)) {
     oo = {};
-
     for (const property in o) {
       oo[property] = o[property];
     }
   } else {
     oo = o;
   }
-
   return oo;
 };
-// eslint-disable-next-line @typescript-eslint/no-explicit-any
 function filterObject(obj, predicate) {
   return Object.keys(obj).reduce((res, key) => {
-    if (predicate(obj[key])) res[key] = obj[key];
+    if (predicate(obj[key]))
+      res[key] = obj[key];
     return res;
   }, {});
 }
-
-export { filterObject, unfreeze };
+export {
+  filterObject,
+  unfreeze
+};
+//# sourceMappingURL=object-helpers.js.map

package/esm/utils/object-helpers.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../../scripts/build/transpile/react-shim.js", "../../../src/utils/object-helpers.tsx"],
+  "sourcesContent": ["import * as React from 'react';\nexport { React };\n", "/* eslint-disable no-sequences */\n/* eslint-disable no-return-assign */\n/* eslint-disable no-restricted-syntax */\n/* eslint-disable guard-for-in */\n\nfunction isObjectADate(o: string | number | unknown[] | Date | null | undefined | Record<string, unknown>): o is Date {\n  return o?.constructor?.name === 'Date';\n}\nfunction isObjectAnArray(\n  o: string | number | unknown[] | Date | null | undefined | Record<string, unknown>,\n): o is unknown[] {\n  return Array.isArray(o);\n}\nfunction isObjectAString(\n  o: string | number | unknown[] | Date | null | undefined | Record<string, unknown>,\n): o is Record<string, unknown> {\n  return typeof o === 'object';\n}\n\nexport const unfreeze = (o: string | number | unknown[] | Date | null | undefined | Record<string, unknown>) => {\n  let oo: string | number | unknown[] | Date | null | undefined | Record<string, unknown>;\n  if (o === null) {\n    oo = null;\n  } else if (o === undefined) {\n    oo = undefined;\n  } else if (isObjectADate(o)) {\n    oo = new Date(o);\n  } else if (isObjectAnArray(o)) {\n    oo = [];\n    o.forEach((v) => {\n      (oo as unknown[]).push(v);\n    });\n  } else if (isObjectAString(o)) {\n    oo = String(o);\n  } else if (isObjectAString(o)) {\n    oo = {};\n    for (const property in o) {\n      oo[property] = o[property];\n    }\n  } else {\n    oo = o;\n  }\n  return oo;\n};\n\ntype GenericItemT<T = unknown> = { [key: string]: T };\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\nexport function filterObject<T = unknown>(obj: GenericItemT<T>, predicate: (val: T) => boolean) {\n  return Object.keys(obj).reduce<GenericItemT<T>>((res, key) => {\n    if (predicate(obj[key])) res[key] = obj[key];\n    return res;\n  }, {} as GenericItemT<T>);\n}\n"],
+  "mappings": "AAAA;ACKA,uBAAuB,GAA+F;AACpH,SAAO,GAAG,aAAa,SAAS;AAAA;AAElC,yBACE,GACgB;AAChB,SAAO,MAAM,QAAQ;AAAA;AAEvB,yBACE,GAC8B;AAC9B,SAAO,OAAO,MAAM;AAAA;AAGf,MAAM,WAAW,CAAC,MAAuF;AAC9G,MAAI;AACJ,MAAI,MAAM,MAAM;AACd,SAAK;AAAA,aACI,MAAM,QAAW;AAC1B,SAAK;AAAA,aACI,cAAc,IAAI;AAC3B,SAAK,IAAI,KAAK;AAAA,aACL,gBAAgB,IAAI;AAC7B,SAAK;AACL,MAAE,QAAQ,CAAC,MAAM;AACf,MAAC,GAAiB,KAAK;AAAA;AAAA,aAEhB,gBAAgB,IAAI;AAC7B,SAAK,OAAO;AAAA,aACH,gBAAgB,IAAI;AAC7B,SAAK;AACL,eAAW,YAAY,GAAG;AACxB,SAAG,YAAY,EAAE;AAAA;AAAA,SAEd;AACL,SAAK;AAAA;AAEP,SAAO;AAAA;AAKF,sBAAmC,KAAsB,WAAgC;AAC9F,SAAO,OAAO,KAAK,KAAK,OAAwB,CAAC,KAAK,QAAQ;AAC5D,QAAI,UAAU,IAAI;AAAO,UAAI,OAAO,IAAI;AACxC,WAAO;AAAA,KACN;AAAA;",
+  "names": []
+}

package/esm/utils/refs-helpers.js

@@ -1,21 +1,15 @@
-import 'core-js/modules/esnext.async-iterator.filter.js';
-import 'core-js/modules/esnext.iterator.constructor.js';
-import 'core-js/modules/esnext.iterator.filter.js';
-import 'core-js/modules/esnext.async-iterator.for-each.js';
-import 'core-js/modules/esnext.iterator.for-each.js';
-
-// allow multiple refs to be set to point to the same DOM element
-const setMultipleRefs = function () {
-  for (var _len = arguments.length, refs = new Array(_len), _key = 0; _key < _len; _key++) {
-    refs[_key] = arguments[_key];
-  }
-
+import * as React from "react";
+const setMultipleRefs = (...refs) => {
   const filteredRefs = refs.filter(Boolean);
-  if (!filteredRefs.length) return () => {};
-  if (filteredRefs.length === 0) return () => {};
-  return newRef => {
-    filteredRefs.forEach(refToBeUpdated => {
-      if (typeof refToBeUpdated === 'function') {
+  if (!filteredRefs.length)
+    return () => {
+    };
+  if (filteredRefs.length === 0)
+    return () => {
+    };
+  return (newRef) => {
+    filteredRefs.forEach((refToBeUpdated) => {
+      if (typeof refToBeUpdated === "function") {
         refToBeUpdated(newRef);
       } else if (refToBeUpdated) {
         refToBeUpdated.current = newRef;
@@ -23,5 +17,7 @@ const setMultipleRefs = function () {
     });
   };
 };
-
-export { setMultipleRefs };
+export {
+  setMultipleRefs
+};
+//# sourceMappingURL=refs-helpers.js.map

package/esm/utils/refs-helpers.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../../scripts/build/transpile/react-shim.js", "../../../src/utils/refs-helpers.tsx"],
+  "sourcesContent": ["import * as React from 'react';\nexport { React };\n", "// allow multiple refs to be set to point to the same DOM element\ntype GenericMergeableRef = null | undefined | React.MutableRefObject<unknown> | ((ref: HTMLElement) => void) | false;\nexport const setMultipleRefs = (...refs: GenericMergeableRef[]): ((ref: HTMLElement) => void) => {\n  const filteredRefs = refs.filter(Boolean);\n  if (!filteredRefs.length) return () => {};\n  if (filteredRefs.length === 0) return () => {};\n\n  return (newRef) => {\n    filteredRefs.forEach((refToBeUpdated) => {\n      if (typeof refToBeUpdated === 'function') {\n        refToBeUpdated(newRef);\n      } else if (refToBeUpdated) {\n        refToBeUpdated.current = newRef;\n      }\n    });\n  };\n};\n"],
+  "mappings": "AAAA;ACEO,MAAM,kBAAkB,IAAI,SAA8D;AAC/F,QAAM,eAAe,KAAK,OAAO;AACjC,MAAI,CAAC,aAAa;AAAQ,WAAO,MAAM;AAAA;AACvC,MAAI,aAAa,WAAW;AAAG,WAAO,MAAM;AAAA;AAE5C,SAAO,CAAC,WAAW;AACjB,iBAAa,QAAQ,CAAC,mBAAmB;AACvC,UAAI,OAAO,mBAAmB,YAAY;AACxC,uBAAe;AAAA,iBACN,gBAAgB;AACzB,uBAAe,UAAU;AAAA;AAAA;AAAA;AAAA;",
+  "names": []
+}

package/esm/utils/selectable-helper.js

@@ -1,70 +1,59 @@
-import 'core-js/modules/esnext.async-iterator.filter.js';
-import 'core-js/modules/esnext.iterator.constructor.js';
-import 'core-js/modules/esnext.iterator.filter.js';
-import 'core-js/modules/esnext.async-iterator.for-each.js';
-import 'core-js/modules/esnext.iterator.for-each.js';
-import _defineProperty from '@babel/runtime/helpers/esm/defineProperty';
-import { walkAllNodeChildren, walkParents } from './tree-helpers.js';
-
-function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }
-
-function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { _defineProperty(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }
-const getGroupCheckState = node => {
+import * as React from "react";
+import { walkParents, walkAllNodeChildren } from "./tree-helpers";
+const getGroupCheckState = (node) => {
   let childAllChecked = true;
   let anyChildChecked = false;
-  walkAllNodeChildren(node, childNode => {
+  walkAllNodeChildren(node, (childNode) => {
     const {
-      model: {
-        isChecked
-      }
+      model: { isChecked }
     } = childNode;
-    if (isChecked === 'mixed' || isChecked === true) anyChildChecked = true;else childAllChecked = false;
+    if (isChecked === "mixed" || isChecked === true)
+      anyChildChecked = true;
+    else
+      childAllChecked = false;
   });
-  if (childAllChecked) return true;
-  if (anyChildChecked) return 'mixed';
+  if (childAllChecked)
+    return true;
+  if (anyChildChecked)
+    return "mixed";
   return false;
 };
-const selectCheckboxItemModelParentsTillRoot = function (modelToCheck) {
-  let triggerTreeRerender = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : null;
+const selectCheckboxItemModelParentsTillRoot = (modelToCheck, triggerTreeRerender = null) => {
   const newSelections = {};
-  const {
-    nodePath
-  } = modelToCheck;
-  walkParents(nodePath, parentNode => {
+  const { nodePath } = modelToCheck;
+  walkParents(nodePath, (parentNode) => {
     const nextState = getGroupCheckState(parentNode);
     parentNode.model.isChecked = nextState;
     newSelections[parentNode.model.id] = nextState;
   });
-  if (triggerTreeRerender) triggerTreeRerender();
+  if (triggerTreeRerender)
+    triggerTreeRerender();
   return newSelections;
 };
-const toggleCheckboxItem = function (itemToSelect) {
-  let triggerTreeRerender = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : null;
+const toggleCheckboxItem = (itemToSelect, triggerTreeRerender = null) => {
   const {
     node: {
-      model: {
-        id,
-        isChecked,
-        children = []
-      }
+      model: { id, isChecked, children = [] }
     }
   } = itemToSelect;
-  const newSelections = {}; // 'mixed' -> true -> false -> true [...->false -> true]
-
-  const nextState = isChecked === 'mixed' ? true : !isChecked;
+  const newSelections = {};
+  const nextState = isChecked === "mixed" ? true : !isChecked;
   itemToSelect.node.model.isChecked = nextState;
   newSelections[id] = nextState;
-
   if (children.length > 0 && (nextState === true || nextState === false)) {
-    walkAllNodeChildren(itemToSelect.node, childNode => {
+    walkAllNodeChildren(itemToSelect.node, (childNode) => {
       childNode.model.isChecked = nextState;
       newSelections[childNode.model.id] = nextState;
     });
   }
-
   const parentsNewSelections = selectCheckboxItemModelParentsTillRoot(itemToSelect);
-  if (triggerTreeRerender) triggerTreeRerender();
-  return _objectSpread(_objectSpread({}, parentsNewSelections), newSelections);
+  if (triggerTreeRerender)
+    triggerTreeRerender();
+  return { ...parentsNewSelections, ...newSelections };
+};
+export {
+  getGroupCheckState,
+  selectCheckboxItemModelParentsTillRoot,
+  toggleCheckboxItem
 };
-
-export { getGroupCheckState, selectCheckboxItemModelParentsTillRoot, toggleCheckboxItem };
+//# sourceMappingURL=selectable-helper.js.map

package/esm/utils/selectable-helper.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../../scripts/build/transpile/react-shim.js", "../../../src/utils/selectable-helper.tsx"],
+  "sourcesContent": ["import * as React from 'react';\nexport { React };\n", "/* eslint-disable max-params */\nimport { walkParents, walkAllNodeChildren } from './tree-helpers';\nimport type { DSTreeviewT } from '../react-desc-prop-types';\n\nexport const getGroupCheckState = (node: DSTreeviewT.Item['node']) => {\n  let childAllChecked = true;\n  let anyChildChecked = false;\n  walkAllNodeChildren(node, (childNode) => {\n    const {\n      model: { isChecked },\n    } = childNode;\n    if (isChecked === 'mixed' || isChecked === true) anyChildChecked = true;\n    else childAllChecked = false;\n  });\n\n  if (childAllChecked) return true;\n  if (anyChildChecked) return 'mixed';\n  return false;\n};\n\nexport const selectCheckboxItemModelParentsTillRoot = (\n  modelToCheck: DSTreeviewT.Item,\n  triggerTreeRerender: (() => void) | null = null,\n) => {\n  const newSelections: DSTreeviewT.SelectionItems = {};\n  const { nodePath } = modelToCheck;\n  walkParents(nodePath, (parentNode) => {\n    const nextState = getGroupCheckState(parentNode);\n    parentNode.model.isChecked = nextState;\n    newSelections[parentNode.model.id] = nextState;\n  });\n  if (triggerTreeRerender) triggerTreeRerender();\n  return newSelections;\n};\n\nexport const toggleCheckboxItem = (itemToSelect: DSTreeviewT.Item, triggerTreeRerender: (() => void) | null = null) => {\n  const {\n    node: {\n      model: { id, isChecked, children = [] },\n    },\n  } = itemToSelect;\n\n  const newSelections: DSTreeviewT.SelectionItems = {};\n  // 'mixed' -> true -> false -> true [...->false -> true]\n  const nextState = isChecked === 'mixed' ? true : !isChecked;\n  itemToSelect.node.model.isChecked = nextState;\n  newSelections[id] = nextState;\n\n  if (children.length > 0 && (nextState === true || nextState === false)) {\n    walkAllNodeChildren(itemToSelect.node, (childNode) => {\n      childNode.model.isChecked = nextState;\n      newSelections[childNode.model.id] = nextState;\n    });\n  }\n\n  const parentsNewSelections = selectCheckboxItemModelParentsTillRoot(itemToSelect);\n\n  if (triggerTreeRerender) triggerTreeRerender();\n  return { ...parentsNewSelections, ...newSelections };\n};\n"],
+  "mappings": "AAAA;ACCA;AAGO,MAAM,qBAAqB,CAAC,SAAmC;AACpE,MAAI,kBAAkB;AACtB,MAAI,kBAAkB;AACtB,sBAAoB,MAAM,CAAC,cAAc;AACvC,UAAM;AAAA,MACJ,OAAO,EAAE;AAAA,QACP;AACJ,QAAI,cAAc,WAAW,cAAc;AAAM,wBAAkB;AAAA;AAC9D,wBAAkB;AAAA;AAGzB,MAAI;AAAiB,WAAO;AAC5B,MAAI;AAAiB,WAAO;AAC5B,SAAO;AAAA;AAGF,MAAM,yCAAyC,CACpD,cACA,sBAA2C,SACxC;AACH,QAAM,gBAA4C;AAClD,QAAM,EAAE,aAAa;AACrB,cAAY,UAAU,CAAC,eAAe;AACpC,UAAM,YAAY,mBAAmB;AACrC,eAAW,MAAM,YAAY;AAC7B,kBAAc,WAAW,MAAM,MAAM;AAAA;AAEvC,MAAI;AAAqB;AACzB,SAAO;AAAA;AAGF,MAAM,qBAAqB,CAAC,cAAgC,sBAA2C,SAAS;AACrH,QAAM;AAAA,IACJ,MAAM;AAAA,MACJ,OAAO,EAAE,IAAI,WAAW,WAAW;AAAA;AAAA,MAEnC;AAEJ,QAAM,gBAA4C;AAElD,QAAM,YAAY,cAAc,UAAU,OAAO,CAAC;AAClD,eAAa,KAAK,MAAM,YAAY;AACpC,gBAAc,MAAM;AAEpB,MAAI,SAAS,SAAS,KAAM,eAAc,QAAQ,cAAc,QAAQ;AACtE,wBAAoB,aAAa,MAAM,CAAC,cAAc;AACpD,gBAAU,MAAM,YAAY;AAC5B,oBAAc,UAAU,MAAM,MAAM;AAAA;AAAA;AAIxC,QAAM,uBAAuB,uCAAuC;AAEpE,MAAI;AAAqB;AACzB,SAAO,KAAK,yBAAyB;AAAA;",
+  "names": []
+}

package/esm/utils/string-helpers.js

@@ -1,3 +1,6 @@
-const standardizeSearchQueryString = input => input.trim().toLowerCase();
-
-export { standardizeSearchQueryString };
+import * as React from "react";
+const standardizeSearchQueryString = (input) => input.trim().toLowerCase();
+export {
+  standardizeSearchQueryString
+};
+//# sourceMappingURL=string-helpers.js.map

package/esm/utils/string-helpers.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../../scripts/build/transpile/react-shim.js", "../../../src/utils/string-helpers.tsx"],
+  "sourcesContent": ["import * as React from 'react';\nexport { React };\n", "export const standardizeSearchQueryString = (input: string) => input.trim().toLowerCase();\n"],
+  "mappings": "AAAA;ACAO,MAAM,+BAA+B,CAAC,UAAkB,MAAM,OAAO;",
+  "names": []
+}

package/esm/utils/tree-helpers.js

@@ -1,180 +1,155 @@
-import 'core-js/modules/esnext.async-iterator.for-each.js';
-import 'core-js/modules/esnext.iterator.constructor.js';
-import 'core-js/modules/esnext.iterator.for-each.js';
-import 'core-js/modules/web.dom-collections.iterator.js';
-import 'core-js/modules/esnext.async-iterator.find.js';
-import 'core-js/modules/esnext.iterator.find.js';
-import 'core-js/modules/esnext.async-iterator.every.js';
-import 'core-js/modules/esnext.iterator.every.js';
-import { createRef } from 'react';
-import { standardizeSearchQueryString } from './string-helpers.js';
-
-const walkVisibles = function (node, callback) {
-  let skipRoot = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : true;
-  let highlightOnlyQuery = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : false;
-  const {
-    children,
-    model
-  } = node;
-  const {
-    name,
-    isExpanded,
-    childrenMatchesSearchQuery,
-    matchesSearchQuery
-  } = model;
-  const shouldSkipBecauseIsRoot = skipRoot && name === '__root';
+import * as React from "react";
+import { createRef } from "react";
+import { standardizeSearchQueryString } from "./string-helpers";
+const walkVisibles = (node, callback, skipRoot = true, highlightOnlyQuery = false) => {
+  const { children, model } = node;
+  const { name, isExpanded, childrenMatchesSearchQuery, matchesSearchQuery } = model;
+  const shouldSkipBecauseIsRoot = skipRoot && name === "__root";
   const queryRestrictionsPassed = !!(highlightOnlyQuery || childrenMatchesSearchQuery || matchesSearchQuery);
-  if (!shouldSkipBecauseIsRoot && queryRestrictionsPassed) callback(node);
+  if (!shouldSkipBecauseIsRoot && queryRestrictionsPassed)
+    callback(node);
   const shouldWalkChildren = !!(children.length > 0 && isExpanded && queryRestrictionsPassed);
-
   if (shouldWalkChildren) {
-    children.forEach(childNode => {
+    children.forEach((childNode) => {
       walkVisibles(childNode, callback, skipRoot, highlightOnlyQuery);
     });
   }
 };
-const walkParents = function (nodePath, callback) {
-  let skipRoot = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : true;
+const walkParents = (nodePath, callback, skipRoot = true) => {
   const parents = [...nodePath].reverse();
-  parents.shift(); // remove current node from the parents array
-
-  if (skipRoot) parents.pop(); // remove the root from the parents if skipping root
-
+  parents.shift();
+  if (skipRoot)
+    parents.pop();
   parents.forEach(callback);
 };
-const walkAllNodeChildren = function (node, callback) {
-  let isFirst = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : true;
-  const {
-    children = []
-  } = node;
+const walkAllNodeChildren = (node, callback, isFirst = true) => {
+  const { children = [] } = node;
   const shouldWalkChildren = children.length;
-  if (!isFirst) callback(node);
-
+  if (!isFirst)
+    callback(node);
   if (shouldWalkChildren) {
-    children.forEach(childNode => {
+    children.forEach((childNode) => {
       walkAllNodeChildren(childNode, callback, false);
     });
   }
 };
 const getNodeById = (treeRoot, id) => {
-  const nodes = treeRoot.all(node => node.model.id === id);
+  const nodes = treeRoot.all((node) => node.model.id === id);
   return nodes[0];
 };
 const cloneNode = (tree, node) => tree.parse(node.model);
-const itemsShareSameParent = function () {
-  let items = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : [];
-  if (items.length === 0) throw new Error('Received empty items for comparison');
-  if (items.length === 1) return true; // when moving in first position we receive [undefined,...{items}]
-  // when moving in last position we receive [...{items}, undefined]
-
-  const firstExistingItem = items.find(item => !!item);
-  if (!firstExistingItem) throw new Error("Received no items, can't retrieve parent");
-  const firstExistingItemPath = firstExistingItem.node.getPath(); // path is like [rootParent, ...[parentsNodes], currentNode]
-  // length -1 is the current-node
-  // length -2 is the parent-node
-  // root node is not printed and is always present so minimum path length is 2 (root + currentNode)
-
+const itemsShareSameParent = (items = []) => {
+  if (items.length === 0)
+    throw new Error("Received empty items for comparison");
+  if (items.length === 1)
+    return true;
+  const firstExistingItem = items.find((item) => !!item);
+  if (!firstExistingItem)
+    throw new Error("Received no items, can't retrieve parent");
+  const firstExistingItemPath = firstExistingItem.node.getPath();
   const directParentNode = firstExistingItemPath[firstExistingItemPath.length - 2];
-  return items.every(item => {
-    // undefined nodes count as having the same parent
-    if (!item) return true;
+  return items.every((item) => {
+    if (!item)
+      return true;
     const itemPath = item.node.getPath();
     const itemDirectParent = itemPath[itemPath.length - 2];
     return directParentNode === itemDirectParent;
   });
 };
-const getItemsParentNode = function () {
-  let items = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : [];
-  let skipSameParentCheck = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;
-  if (items.length === 0) throw new Error("Received empty items, can't retrieve parent"); // in case we already know the items compared shares the same parent
-
-  if (!skipSameParentCheck) if (!itemsShareSameParent(items)) // if we don't know (default, we don't) check if they share the parent
-    throw new Error("Received items don't share the same parent, can't retrieve parent"); // when moving in first position we receive [undefined,...{items}]
-  // when moving in last position we receive [...{items}, undefined]
-
-  const firstExistingItem = items.find(item => !!item);
-  if (!firstExistingItem) throw new Error("Received no items, can't retrieve parent");
-  const firstExistingItemPath = firstExistingItem.node.getPath(); // path is like [rootParent, ...[parentsNodes], currentNode]
-  // length -1 is the current-node
-  // length -2 is the parent-node
-  // root node is not printed and is always present so minimum path length is 2 (root + currentNode)
-
+const getItemsParentNode = (items = [], skipSameParentCheck = false) => {
+  if (items.length === 0)
+    throw new Error("Received empty items, can't retrieve parent");
+  if (!skipSameParentCheck) {
+    if (!itemsShareSameParent(items))
+      throw new Error("Received items don't share the same parent, can't retrieve parent");
+  }
+  const firstExistingItem = items.find((item) => !!item);
+  if (!firstExistingItem)
+    throw new Error("Received no items, can't retrieve parent");
+  const firstExistingItemPath = firstExistingItem.node.getPath();
   const directParentNode = firstExistingItemPath[firstExistingItemPath.length - 2];
   return directParentNode;
 };
-const getNodeMatchesSearchQuery = function (node) {
-  let searchQuery = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : '';
+const getNodeMatchesSearchQuery = (node, searchQuery = "") => {
   const standardizedName = standardizeSearchQueryString(node.model.name);
   const standardizedSearchQuery = standardizeSearchQueryString(searchQuery);
   return standardizedName.includes(standardizedSearchQuery);
 };
-const getChildrenMatchesSearchQuery = function (parentNode) {
-  let searchQuery = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : '';
+const getChildrenMatchesSearchQuery = (parentNode, searchQuery = "") => {
   let anyChildMatch = false;
-  walkAllNodeChildren(parentNode, node => {
-    if (getNodeMatchesSearchQuery(node, searchQuery)) anyChildMatch = true;
+  walkAllNodeChildren(parentNode, (node) => {
+    if (getNodeMatchesSearchQuery(node, searchQuery))
+      anyChildMatch = true;
   });
   return anyChildMatch;
 };
-/**
- * Mutate in place a node from tree-model normalizing object properties like "isGroup" even if user didn't specify it explicitly,
- * after execution the node will have "nodePath" "treeDepth" "nodeItemRef" "isGroup" "isExpanded"
- * (optionally, based on the provided arguments) "matchesSearchQuery" "childrenMatchesSearchQuery" "isChecked"
- *
- * @param {Object} node - node (based on 'tree-model' lib) that you wish to mutate with extra props
- * @param {string} [searchQuery=''] - optional string used to parse "matchesSearchQuery"/"childrenMatchesSearchQuery" properties
- * @param {Object} [selection=null] - optional selection hashmap used to parse "isChecked" properties
- * @param {Object} [expanded=null] - optional expanded hashmap used to parse "isExpanded" properties
- */
-
-const enrichNodeModelInPlace = function (node) {
-  var _node$model, _node$model$children;
-
-  let searchQuery = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : '';
-  let selection = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : null;
-  let expanded = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : null;
+const enrichNodeModelInPlace = (node, searchQuery = "", selection = null, expanded = null) => {
   const path = node.getPath();
   const depth = path.length - 1;
   node.model.nodePath = path;
   node.model.treeDepth = depth;
-
   if (!node.model.nodeItemRef) {
-    node.model.nodeItemRef = /*#__PURE__*/createRef();
-  } // if a node has children but was not marked as isGroup, force-mark as group
-  // this is useful to avoid having to always check both the flag and the children.length...
-
-
-  if (typeof node.model.isGroup !== 'boolean' && ((_node$model = node.model) === null || _node$model === void 0 ? void 0 : (_node$model$children = _node$model.children) === null || _node$model$children === void 0 ? void 0 : _node$model$children.length) > 0) {
+    node.model.nodeItemRef = createRef();
+  }
+  if (typeof node.model.isGroup !== "boolean" && (node.model?.children?.length ?? 0) > 0) {
     node.model.isGroup = true;
   }
-
-  if (node.model.isGroup && node.model.id !== '__ds_tree_root') {
-    if (expanded) node.model.isExpanded = !!expanded[node.model.id];else if (typeof node.model.isExpanded !== 'boolean') {
+  if (node.model.isGroup && node.model.id !== "__ds_tree_root") {
+    if (expanded)
+      node.model.isExpanded = !!expanded[node.model.id];
+    else if (typeof node.model.isExpanded !== "boolean") {
       node.model.isExpanded = false;
     }
   }
-
   node.model.matchesSearchQuery = true;
   node.model.childrenMatchesSearchQuery = false;
   const partiallyEnrichedNode = node;
-
   if (searchQuery) {
     partiallyEnrichedNode.model.matchesSearchQuery = getNodeMatchesSearchQuery(partiallyEnrichedNode, searchQuery);
-
     if (partiallyEnrichedNode.model.isGroup === true) {
       partiallyEnrichedNode.model.childrenMatchesSearchQuery = getChildrenMatchesSearchQuery(partiallyEnrichedNode, searchQuery);
-      if (partiallyEnrichedNode.model.childrenMatchesSearchQuery) partiallyEnrichedNode.model.isExpanded = true;
+      if (partiallyEnrichedNode.model.childrenMatchesSearchQuery)
+        partiallyEnrichedNode.model.isExpanded = true;
     }
   }
-
   if (selection && selection[partiallyEnrichedNode.model.id]) {
     partiallyEnrichedNode.model.isChecked = selection[partiallyEnrichedNode.model.id];
   }
 };
-const focusItem = item => {
-  var _item$nodeItemRef, _item$nodeItemRef$cur;
-
-  item === null || item === void 0 ? void 0 : (_item$nodeItemRef = item.nodeItemRef) === null || _item$nodeItemRef === void 0 ? void 0 : (_item$nodeItemRef$cur = _item$nodeItemRef.current) === null || _item$nodeItemRef$cur === void 0 ? void 0 : _item$nodeItemRef$cur.focus();
+const focusItem = (item) => {
+  item?.nodeItemRef?.current?.focus();
+};
+const flattenTreeForDnD = (data, shouldDescend = () => true) => {
+  const flattenedTree = [];
+  let index = 0;
+  const doit = (node, depth = 0, parentId = null) => {
+    flattenedTree.push({
+      uid: node.id.toString(),
+      depth,
+      realIndex: index,
+      childrenCount: node.children?.length ?? 0,
+      parentId: parentId !== null ? parentId.toString() : null,
+      original: node
+    });
+    index += 1;
+    if (shouldDescend(node))
+      node.children?.forEach((child) => doit(child, depth + 1, node.id.toString()));
+  };
+  data.forEach((datum) => doit(datum));
+  return flattenedTree;
+};
+export {
+  cloneNode,
+  enrichNodeModelInPlace,
+  flattenTreeForDnD,
+  focusItem,
+  getChildrenMatchesSearchQuery,
+  getItemsParentNode,
+  getNodeById,
+  getNodeMatchesSearchQuery,
+  itemsShareSameParent,
+  walkAllNodeChildren,
+  walkParents,
+  walkVisibles
 };
-
-export { cloneNode, enrichNodeModelInPlace, focusItem, getChildrenMatchesSearchQuery, getItemsParentNode, getNodeById, getNodeMatchesSearchQuery, itemsShareSameParent, walkAllNodeChildren, walkParents, walkVisibles };
+//# sourceMappingURL=tree-helpers.js.map

package/esm/utils/tree-helpers.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../../../scripts/build/transpile/react-shim.js", "../../../src/utils/tree-helpers.tsx"],
+  "sourcesContent": ["import * as React from 'react';\nexport { React };\n", "/* eslint-disable max-statements */\n/* eslint-disable max-params */\n/* eslint-disable complexity */\n/* eslint-disable max-lines */\nimport { createRef } from 'react';\nimport type TreeModel from 'tree-model';\nimport { standardizeSearchQueryString } from './string-helpers';\nimport type { DSTreeviewT } from '../react-desc-prop-types';\n\nexport const walkVisibles = (\n  node: DSTreeviewT.Item['node'],\n  callback: (node: DSTreeviewT.Item['node']) => void,\n  skipRoot = true,\n  highlightOnlyQuery = false,\n) => {\n  const { children, model } = node;\n  const { name, isExpanded, childrenMatchesSearchQuery, matchesSearchQuery } = model;\n\n  const shouldSkipBecauseIsRoot = skipRoot && name === '__root';\n  const queryRestrictionsPassed = !!(highlightOnlyQuery || childrenMatchesSearchQuery || matchesSearchQuery);\n\n  if (!shouldSkipBecauseIsRoot && queryRestrictionsPassed) callback(node);\n\n  const shouldWalkChildren = !!(children.length > 0 && isExpanded && queryRestrictionsPassed);\n  if (shouldWalkChildren) {\n    children.forEach((childNode) => {\n      walkVisibles(childNode, callback, skipRoot, highlightOnlyQuery);\n    });\n  }\n};\n\nexport const walkParents = (\n  nodePath: DSTreeviewT.Item['nodePath'],\n  callback: (currParent: DSTreeviewT.Item['node']) => void,\n  skipRoot = true,\n) => {\n  const parents = [...nodePath].reverse();\n  parents.shift(); // remove current node from the parents array\n  if (skipRoot) parents.pop(); // remove the root from the parents if skipping root\n  parents.forEach(callback);\n};\n\ntype RecursiveCallbackT = (childNode: DSTreeviewT.Item['node'], cb?: RecursiveCallbackT, isFirst?: boolean) => void;\nexport const walkAllNodeChildren = (node: DSTreeviewT.Item['node'], callback: RecursiveCallbackT, isFirst = true) => {\n  const { children = [] } = node;\n  const shouldWalkChildren = children.length;\n\n  if (!isFirst) callback(node);\n\n  if (shouldWalkChildren) {\n    children.forEach((childNode) => {\n      walkAllNodeChildren(childNode, callback, false);\n    });\n  }\n};\n\nexport const getNodeById = (treeRoot: DSTreeviewT.Item['node'], id: DSTreeviewT.StringOrNum) => {\n  const nodes = treeRoot.all((node) => (node as unknown as DSTreeviewT.Item).model.id === id);\n  return nodes[0];\n};\n\nexport const cloneNode = (tree: TreeModel, node: DSTreeviewT.Item) => tree.parse(node.model);\n\nexport const itemsShareSameParent = (items: DSTreeviewT.Item[] = []) => {\n  if (items.length === 0) throw new Error('Received empty items for comparison');\n  if (items.length === 1) return true;\n\n  // when moving in first position we receive [undefined,...{items}]\n  // when moving in last position we receive [...{items}, undefined]\n  const firstExistingItem = items.find((item) => !!item);\n  if (!firstExistingItem) throw new Error(\"Received no items, can't retrieve parent\");\n\n  const firstExistingItemPath = firstExistingItem.node.getPath();\n  // path is like [rootParent, ...[parentsNodes], currentNode]\n  // length -1 is the current-node\n  // length -2 is the parent-node\n  // root node is not printed and is always present so minimum path length is 2 (root + currentNode)\n  const directParentNode = firstExistingItemPath[firstExistingItemPath.length - 2];\n\n  return items.every((item) => {\n    // undefined nodes count as having the same parent\n    if (!item) return true;\n    const itemPath = item.node.getPath();\n    const itemDirectParent = itemPath[itemPath.length - 2];\n    return directParentNode === itemDirectParent;\n  });\n};\n\nexport const getItemsParentNode = (items: DSTreeviewT.Item[] = [], skipSameParentCheck = false) => {\n  if (items.length === 0) throw new Error(\"Received empty items, can't retrieve parent\");\n\n  // in case we already know the items compared shares the same parent\n  if (!skipSameParentCheck)\n    if (!itemsShareSameParent(items))\n      // if we don't know (default, we don't) check if they share the parent\n      throw new Error(\"Received items don't share the same parent, can't retrieve parent\");\n\n  // when moving in first position we receive [undefined,...{items}]\n  // when moving in last position we receive [...{items}, undefined]\n  const firstExistingItem = items.find((item) => !!item);\n  if (!firstExistingItem) throw new Error(\"Received no items, can't retrieve parent\");\n\n  const firstExistingItemPath = firstExistingItem.node.getPath();\n  // path is like [rootParent, ...[parentsNodes], currentNode]\n  // length -1 is the current-node\n  // length -2 is the parent-node\n  // root node is not printed and is always present so minimum path length is 2 (root + currentNode)\n  const directParentNode = firstExistingItemPath[firstExistingItemPath.length - 2];\n  return directParentNode as unknown as DSTreeviewT.Item['node'];\n};\n\nexport const getNodeMatchesSearchQuery = (node: DSTreeviewT.Item['node'], searchQuery = '') => {\n  const standardizedName = standardizeSearchQueryString(node.model.name);\n  const standardizedSearchQuery = standardizeSearchQueryString(searchQuery);\n  return standardizedName.includes(standardizedSearchQuery);\n};\n\nexport const getChildrenMatchesSearchQuery = (parentNode: DSTreeviewT.Item['node'], searchQuery = '') => {\n  let anyChildMatch = false;\n  walkAllNodeChildren(parentNode, (node) => {\n    if (getNodeMatchesSearchQuery(node, searchQuery)) anyChildMatch = true;\n  });\n  return anyChildMatch;\n};\n\n/**\n * Mutate in place a node from tree-model normalizing object properties like \"isGroup\" even if user didn't specify it explicitly,\n * after execution the node will have \"nodePath\" \"treeDepth\" \"nodeItemRef\" \"isGroup\" \"isExpanded\"\n * (optionally, based on the provided arguments) \"matchesSearchQuery\" \"childrenMatchesSearchQuery\" \"isChecked\"\n *\n * @param {Object} node - node (based on 'tree-model' lib) that you wish to mutate with extra props\n * @param {string} [searchQuery=''] - optional string used to parse \"matchesSearchQuery\"/\"childrenMatchesSearchQuery\" properties\n * @param {Object} [selection=null] - optional selection hashmap used to parse \"isChecked\" properties\n * @param {Object} [expanded=null] - optional expanded hashmap used to parse \"isExpanded\" properties\n */\nexport const enrichNodeModelInPlace = (\n  node: TreeModel.Node<DSTreeviewT.SimpleItem>,\n  searchQuery = '',\n  selection: DSTreeviewT.SelectionItems | null = null,\n  expanded: DSTreeviewT.ExpandedItems | null = null,\n) => {\n  const path = node.getPath();\n  const depth = path.length - 1;\n  node.model.nodePath = path;\n  node.model.treeDepth = depth;\n\n  if (!node.model.nodeItemRef) {\n    node.model.nodeItemRef = createRef();\n  }\n\n  // if a node has children but was not marked as isGroup, force-mark as group\n  // this is useful to avoid having to always check both the flag and the children.length...\n  if (typeof node.model.isGroup !== 'boolean' && (node.model?.children?.length ?? 0) > 0) {\n    node.model.isGroup = true;\n  }\n\n  if (node.model.isGroup && node.model.id !== '__ds_tree_root') {\n    if (expanded) node.model.isExpanded = !!expanded[node.model.id];\n    else if (typeof node.model.isExpanded !== 'boolean') {\n      node.model.isExpanded = false;\n    }\n  }\n\n  node.model.matchesSearchQuery = true;\n  node.model.childrenMatchesSearchQuery = false;\n  const partiallyEnrichedNode = node as unknown as TreeModel.Node<DSTreeviewT.Item>;\n  if (searchQuery) {\n    partiallyEnrichedNode.model.matchesSearchQuery = getNodeMatchesSearchQuery(partiallyEnrichedNode, searchQuery);\n\n    if (partiallyEnrichedNode.model.isGroup === true) {\n      partiallyEnrichedNode.model.childrenMatchesSearchQuery = getChildrenMatchesSearchQuery(\n        partiallyEnrichedNode,\n        searchQuery,\n      );\n      if (partiallyEnrichedNode.model.childrenMatchesSearchQuery) partiallyEnrichedNode.model.isExpanded = true;\n    }\n  }\n  if (selection && selection[partiallyEnrichedNode.model.id]) {\n    partiallyEnrichedNode.model.isChecked = selection[partiallyEnrichedNode.model.id];\n  }\n};\n\nexport const focusItem = (item: DSTreeviewT.Item | null) => {\n  item?.nodeItemRef?.current?.focus();\n};\n\nexport const flattenTreeForDnD = (\n  data: DSTreeviewT.SimpleItem[],\n  shouldDescend: (datum: DSTreeviewT.SimpleItem) => boolean = () => true,\n) => {\n  const flattenedTree: DSTreeviewT.DndItem[] = [];\n  let index = 0;\n  const doit = (node: DSTreeviewT.SimpleItem, depth = 0, parentId: DSTreeviewT.StringOrNum | null = null) => {\n    flattenedTree.push({\n      uid: node.id.toString(),\n      depth,\n      realIndex: index,\n      childrenCount: node.children?.length ?? 0,\n      parentId: parentId !== null ? parentId.toString() : null,\n      original: node,\n    });\n    index += 1;\n    if (shouldDescend(node)) node.children?.forEach((child) => doit(child, depth + 1, node.id.toString()));\n  };\n\n  data.forEach((datum) => doit(datum));\n  return flattenedTree;\n};\n"],
+  "mappings": "AAAA;ACIA;AAEA;AAGO,MAAM,eAAe,CAC1B,MACA,UACA,WAAW,MACX,qBAAqB,UAClB;AACH,QAAM,EAAE,UAAU,UAAU;AAC5B,QAAM,EAAE,MAAM,YAAY,4BAA4B,uBAAuB;AAE7E,QAAM,0BAA0B,YAAY,SAAS;AACrD,QAAM,0BAA0B,CAAC,CAAE,uBAAsB,8BAA8B;AAEvF,MAAI,CAAC,2BAA2B;AAAyB,aAAS;AAElE,QAAM,qBAAqB,CAAC,CAAE,UAAS,SAAS,KAAK,cAAc;AACnE,MAAI,oBAAoB;AACtB,aAAS,QAAQ,CAAC,cAAc;AAC9B,mBAAa,WAAW,UAAU,UAAU;AAAA;AAAA;AAAA;AAK3C,MAAM,cAAc,CACzB,UACA,UACA,WAAW,SACR;AACH,QAAM,UAAU,CAAC,GAAG,UAAU;AAC9B,UAAQ;AACR,MAAI;AAAU,YAAQ;AACtB,UAAQ,QAAQ;AAAA;AAIX,MAAM,sBAAsB,CAAC,MAAgC,UAA8B,UAAU,SAAS;AACnH,QAAM,EAAE,WAAW,OAAO;AAC1B,QAAM,qBAAqB,SAAS;AAEpC,MAAI,CAAC;AAAS,aAAS;AAEvB,MAAI,oBAAoB;AACtB,aAAS,QAAQ,CAAC,cAAc;AAC9B,0BAAoB,WAAW,UAAU;AAAA;AAAA;AAAA;AAKxC,MAAM,cAAc,CAAC,UAAoC,OAAgC;AAC9F,QAAM,QAAQ,SAAS,IAAI,CAAC,SAAU,KAAqC,MAAM,OAAO;AACxF,SAAO,MAAM;AAAA;AAGR,MAAM,YAAY,CAAC,MAAiB,SAA2B,KAAK,MAAM,KAAK;AAE/E,MAAM,uBAAuB,CAAC,QAA4B,OAAO;AACtE,MAAI,MAAM,WAAW;AAAG,UAAM,IAAI,MAAM;AACxC,MAAI,MAAM,WAAW;AAAG,WAAO;AAI/B,QAAM,oBAAoB,MAAM,KAAK,CAAC,SAAS,CAAC,CAAC;AACjD,MAAI,CAAC;AAAmB,UAAM,IAAI,MAAM;AAExC,QAAM,wBAAwB,kBAAkB,KAAK;AAKrD,QAAM,mBAAmB,sBAAsB,sBAAsB,SAAS;AAE9E,SAAO,MAAM,MAAM,CAAC,SAAS;AAE3B,QAAI,CAAC;AAAM,aAAO;AAClB,UAAM,WAAW,KAAK,KAAK;AAC3B,UAAM,mBAAmB,SAAS,SAAS,SAAS;AACpD,WAAO,qBAAqB;AAAA;AAAA;AAIzB,MAAM,qBAAqB,CAAC,QAA4B,IAAI,sBAAsB,UAAU;AACjG,MAAI,MAAM,WAAW;AAAG,UAAM,IAAI,MAAM;AAGxC,MAAI,CAAC;AACH,QAAI,CAAC,qBAAqB;AAExB,YAAM,IAAI,MAAM;AAAA;AAIpB,QAAM,oBAAoB,MAAM,KAAK,CAAC,SAAS,CAAC,CAAC;AACjD,MAAI,CAAC;AAAmB,UAAM,IAAI,MAAM;AAExC,QAAM,wBAAwB,kBAAkB,KAAK;AAKrD,QAAM,mBAAmB,sBAAsB,sBAAsB,SAAS;AAC9E,SAAO;AAAA;AAGF,MAAM,4BAA4B,CAAC,MAAgC,cAAc,OAAO;AAC7F,QAAM,mBAAmB,6BAA6B,KAAK,MAAM;AACjE,QAAM,0BAA0B,6BAA6B;AAC7D,SAAO,iBAAiB,SAAS;AAAA;AAG5B,MAAM,gCAAgC,CAAC,YAAsC,cAAc,OAAO;AACvG,MAAI,gBAAgB;AACpB,sBAAoB,YAAY,CAAC,SAAS;AACxC,QAAI,0BAA0B,MAAM;AAAc,sBAAgB;AAAA;AAEpE,SAAO;AAAA;AAaF,MAAM,yBAAyB,CACpC,MACA,cAAc,IACd,YAA+C,MAC/C,WAA6C,SAC1C;AACH,QAAM,OAAO,KAAK;AAClB,QAAM,QAAQ,KAAK,SAAS;AAC5B,OAAK,MAAM,WAAW;AACtB,OAAK,MAAM,YAAY;AAEvB,MAAI,CAAC,KAAK,MAAM,aAAa;AAC3B,SAAK,MAAM,cAAc;AAAA;AAK3B,MAAI,OAAO,KAAK,MAAM,YAAY,aAAc,MAAK,OAAO,UAAU,UAAU,KAAK,GAAG;AACtF,SAAK,MAAM,UAAU;AAAA;AAGvB,MAAI,KAAK,MAAM,WAAW,KAAK,MAAM,OAAO,kBAAkB;AAC5D,QAAI;AAAU,WAAK,MAAM,aAAa,CAAC,CAAC,SAAS,KAAK,MAAM;AAAA,aACnD,OAAO,KAAK,MAAM,eAAe,WAAW;AACnD,WAAK,MAAM,aAAa;AAAA;AAAA;AAI5B,OAAK,MAAM,qBAAqB;AAChC,OAAK,MAAM,6BAA6B;AACxC,QAAM,wBAAwB;AAC9B,MAAI,aAAa;AACf,0BAAsB,MAAM,qBAAqB,0BAA0B,uBAAuB;AAElG,QAAI,sBAAsB,MAAM,YAAY,MAAM;AAChD,4BAAsB,MAAM,6BAA6B,8BACvD,uBACA;AAEF,UAAI,sBAAsB,MAAM;AAA4B,8BAAsB,MAAM,aAAa;AAAA;AAAA;AAGzG,MAAI,aAAa,UAAU,sBAAsB,MAAM,KAAK;AAC1D,0BAAsB,MAAM,YAAY,UAAU,sBAAsB,MAAM;AAAA;AAAA;AAI3E,MAAM,YAAY,CAAC,SAAkC;AAC1D,QAAM,aAAa,SAAS;AAAA;AAGvB,MAAM,oBAAoB,CAC/B,MACA,gBAA4D,MAAM,SAC/D;AACH,QAAM,gBAAuC;AAC7C,MAAI,QAAQ;AACZ,QAAM,OAAO,CAAC,MAA8B,QAAQ,GAAG,WAA2C,SAAS;AACzG,kBAAc,KAAK;AAAA,MACjB,KAAK,KAAK,GAAG;AAAA,MACb;AAAA,MACA,WAAW;AAAA,MACX,eAAe,KAAK,UAAU,UAAU;AAAA,MACxC,UAAU,aAAa,OAAO,SAAS,aAAa;AAAA,MACpD,UAAU;AAAA;AAEZ,aAAS;AACT,QAAI,cAAc;AAAO,WAAK,UAAU,QAAQ,CAAC,UAAU,KAAK,OAAO,QAAQ,GAAG,KAAK,GAAG;AAAA;AAG5F,OAAK,QAAQ,CAAC,UAAU,KAAK;AAC7B,SAAO;AAAA;",
+  "names": []
+}