@elliemae/ds-treeview 2.2.0-alpha.1 → 2.2.0-alpha.2

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

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../src/utils/selectable-helper.tsx", "../../../../../scripts/build/transpile/react-shim.js"],
+  "sourcesContent": ["/* 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", "import * as React from 'react';\nexport { React };\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;ACAA,YAAuB;ADCvB,0BAAiD;AAG1C,MAAM,qBAAqB,CAAC,SAAmC;AACpE,MAAI,kBAAkB;AACtB,MAAI,kBAAkB;AACtB,+CAAoB,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,uCAAY,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,iDAAoB,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/cjs/utils/string-helpers.js

@@ -1,7 +1,35 @@
-'use strict';
-
-Object.defineProperty(exports, '__esModule', { value: true });
-
-const standardizeSearchQueryString = input => input.trim().toLowerCase();
-
-exports.standardizeSearchQueryString = standardizeSearchQueryString;
+var __create = Object.create;
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __getProtoOf = Object.getPrototypeOf;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __markAsModule = (target) => __defProp(target, "__esModule", { value: true });
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __reExport = (target, module2, copyDefault, desc) => {
+  if (module2 && typeof module2 === "object" || typeof module2 === "function") {
+    for (let key of __getOwnPropNames(module2))
+      if (!__hasOwnProp.call(target, key) && (copyDefault || key !== "default"))
+        __defProp(target, key, { get: () => module2[key], enumerable: !(desc = __getOwnPropDesc(module2, key)) || desc.enumerable });
+  }
+  return target;
+};
+var __toESM = (module2, isNodeMode) => {
+  return __reExport(__markAsModule(__defProp(module2 != null ? __create(__getProtoOf(module2)) : {}, "default", !isNodeMode && module2 && module2.__esModule ? { get: () => module2.default, enumerable: true } : { value: module2, enumerable: true })), module2);
+};
+var __toCommonJS = /* @__PURE__ */ ((cache) => {
+  return (module2, temp) => {
+    return cache && cache.get(module2) || (temp = __reExport(__markAsModule({}), module2, 1), cache && cache.set(module2, temp), temp);
+  };
+})(typeof WeakMap !== "undefined" ? /* @__PURE__ */ new WeakMap() : 0);
+var string_helpers_exports = {};
+__export(string_helpers_exports, {
+  standardizeSearchQueryString: () => standardizeSearchQueryString
+});
+var React = __toESM(require("react"));
+const standardizeSearchQueryString = (input) => input.trim().toLowerCase();
+module.exports = __toCommonJS(string_helpers_exports);
+//# sourceMappingURL=string-helpers.js.map

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

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

package/cjs/utils/tree-helpers.js

@@ -1,194 +1,164 @@
-'use strict';
-
-Object.defineProperty(exports, '__esModule', { value: true });
-
-require('core-js/modules/esnext.async-iterator.for-each.js');
-require('core-js/modules/esnext.iterator.constructor.js');
-require('core-js/modules/esnext.iterator.for-each.js');
-require('core-js/modules/web.dom-collections.iterator.js');
-require('core-js/modules/esnext.async-iterator.find.js');
-require('core-js/modules/esnext.iterator.find.js');
-require('core-js/modules/esnext.async-iterator.every.js');
-require('core-js/modules/esnext.iterator.every.js');
-var React = require('react');
-var stringHelpers = require('./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';
+var __create = Object.create;
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __getProtoOf = Object.getPrototypeOf;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __markAsModule = (target) => __defProp(target, "__esModule", { value: true });
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __reExport = (target, module2, copyDefault, desc) => {
+  if (module2 && typeof module2 === "object" || typeof module2 === "function") {
+    for (let key of __getOwnPropNames(module2))
+      if (!__hasOwnProp.call(target, key) && (copyDefault || key !== "default"))
+        __defProp(target, key, { get: () => module2[key], enumerable: !(desc = __getOwnPropDesc(module2, key)) || desc.enumerable });
+  }
+  return target;
+};
+var __toESM = (module2, isNodeMode) => {
+  return __reExport(__markAsModule(__defProp(module2 != null ? __create(__getProtoOf(module2)) : {}, "default", !isNodeMode && module2 && module2.__esModule ? { get: () => module2.default, enumerable: true } : { value: module2, enumerable: true })), module2);
+};
+var __toCommonJS = /* @__PURE__ */ ((cache) => {
+  return (module2, temp) => {
+    return cache && cache.get(module2) || (temp = __reExport(__markAsModule({}), module2, 1), cache && cache.set(module2, temp), temp);
+  };
+})(typeof WeakMap !== "undefined" ? /* @__PURE__ */ new WeakMap() : 0);
+var tree_helpers_exports = {};
+__export(tree_helpers_exports, {
+  cloneNode: () => cloneNode,
+  enrichNodeModelInPlace: () => enrichNodeModelInPlace,
+  focusItem: () => focusItem,
+  getChildrenMatchesSearchQuery: () => getChildrenMatchesSearchQuery,
+  getItemsParentNode: () => getItemsParentNode,
+  getNodeById: () => getNodeById,
+  getNodeMatchesSearchQuery: () => getNodeMatchesSearchQuery,
+  itemsShareSameParent: () => itemsShareSameParent,
+  walkAllNodeChildren: () => walkAllNodeChildren,
+  walkParents: () => walkParents,
+  walkVisibles: () => walkVisibles
+});
+var React = __toESM(require("react"));
+var import_react = __toESM(require("react"));
+var import_string_helpers = __toESM(require("./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 standardizedName = stringHelpers.standardizeSearchQueryString(node.model.name);
-  const standardizedSearchQuery = stringHelpers.standardizeSearchQueryString(searchQuery);
+const getNodeMatchesSearchQuery = (node, searchQuery = "") => {
+  const standardizedName = (0, import_string_helpers.standardizeSearchQueryString)(node.model.name);
+  const standardizedSearchQuery = (0, import_string_helpers.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__*/React.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 = (0, import_react.createRef)();
+  }
+  if (typeof node.model.isGroup !== "boolean" && node.model?.children?.length > 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();
 };
-
-exports.cloneNode = cloneNode;
-exports.enrichNodeModelInPlace = enrichNodeModelInPlace;
-exports.focusItem = focusItem;
-exports.getChildrenMatchesSearchQuery = getChildrenMatchesSearchQuery;
-exports.getItemsParentNode = getItemsParentNode;
-exports.getNodeById = getNodeById;
-exports.getNodeMatchesSearchQuery = getNodeMatchesSearchQuery;
-exports.itemsShareSameParent = itemsShareSameParent;
-exports.walkAllNodeChildren = walkAllNodeChildren;
-exports.walkParents = walkParents;
-exports.walkVisibles = walkVisibles;
+module.exports = __toCommonJS(tree_helpers_exports);
+//# sourceMappingURL=tree-helpers.js.map

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

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../src/utils/tree-helpers.tsx", "../../../../../scripts/build/transpile/react-shim.js"],
+  "sourcesContent": ["/* 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) {\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", "import * as React from 'react';\nexport { React };\n"],
+  "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;ACAA,YAAuB;ADIvB,mBAA0B;AAE1B,4BAA6C;AAGtC,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,wDAA6B,KAAK,MAAM;AACjE,QAAM,0BAA0B,wDAA6B;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,aAAa,KAAK,OAAO,UAAU,SAAS,GAAG;AAC/E,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;",
+  "names": []
+}