@elliemae/ds-treeview 1.57.1-rc.0 → 2.0.0-alpha.11

package/esm/utils/object-helpers.js

@@ -1,5 +1,3 @@
-import _typeof from '@babel/runtime/helpers/esm/typeof';
-
 /* eslint-disable no-sequences */
 
 /* eslint-disable no-return-assign */
@@ -7,8 +5,8 @@ import _typeof from '@babel/runtime/helpers/esm/typeof';
 /* eslint-disable no-restricted-syntax */
 
 /* eslint-disable guard-for-in */
-var unfreeze = function unfreeze(o) {
-  var oo;
+const unfreeze = o => {
+  let oo;
 
   if (o === null) {
     oo = null;
@@ -18,15 +16,15 @@ var unfreeze = function unfreeze(o) {
     oo = new Date(o);
   } else if (o instanceof Array) {
     oo = [];
-    o.forEach(function (v) {
+    o.forEach(v => {
       oo.push(v);
     });
   } else if (o instanceof String) {
     oo = String(o);
-  } else if (_typeof(o) === 'object') {
+  } else if (typeof o === 'object') {
     oo = {};
 
-    for (var property in o) {
+    for (const property in o) {
       oo[property] = o[property];
     }
   } else {
@@ -35,13 +33,6 @@ var unfreeze = function unfreeze(o) {
 
   return oo;
 };
-var filterObject = function filterObject(obj, predicate) {
-  return Object.keys(obj).filter(function (key) {
-    return predicate(obj[key]);
-  }).reduce(function (res, key) {
-    return res[key] = obj[key], res;
-  }, {});
-};
+const filterObject = (obj, predicate) => Object.keys(obj).filter(key => predicate(obj[key])).reduce((res, key) => (res[key] = obj[key], res), {});
 
 export { filterObject, unfreeze };
-//# sourceMappingURL=object-helpers.js.map

package/esm/utils/refs-helpers.js

@@ -1,14 +1,10 @@
 // allow multiple refs to be set to point to the same DOM element
-var setMultipleRefs = function setMultipleRefs() {
-  for (var _len = arguments.length, refs = new Array(_len), _key = 0; _key < _len; _key++) {
-    refs[_key] = arguments[_key];
-  }
-
-  var filteredRefs = refs.filter(Boolean);
+const setMultipleRefs = (...refs) => {
+  const filteredRefs = refs.filter(Boolean);
   if (!filteredRefs.length) return null;
   if (filteredRefs.length === 0) return filteredRefs[0];
-  return function (newRef) {
-    filteredRefs.forEach(function (refToBeUpdated) {
+  return newRef => {
+    filteredRefs.forEach(refToBeUpdated => {
       if (typeof refToBeUpdated === 'function') {
         refToBeUpdated(newRef);
       } else if (refToBeUpdated) {
@@ -19,4 +15,3 @@ var setMultipleRefs = function setMultipleRefs() {
 };
 
 export { setMultipleRefs };
-//# sourceMappingURL=refs-helpers.js.map

package/esm/utils/selectable-helper.js

@@ -1,59 +1,63 @@
 import _defineProperty from '@babel/runtime/helpers/esm/defineProperty';
 import { walkAllNodeChildren, walkParents } from './tree-helpers.js';
-import '@babel/runtime/helpers/esm/toConsumableArray';
-import 'react';
-import './string-helpers.js';
 
 function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); if (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 = arguments[i] != null ? arguments[i] : {}; if (i % 2) { ownKeys(Object(source), true).forEach(function (key) { _defineProperty(target, key, source[key]); }); } else if (Object.getOwnPropertyDescriptors) { Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)); } else { ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } } return target; }
-var getGroupCheckState = function getGroupCheckState(node) {
-  var childAllChecked = true;
-  var anyChildChecked = false;
-  walkAllNodeChildren(node, function (childNode) {
-    var isChecked = childNode.model.isChecked;
+const getGroupCheckState = node => {
+  let childAllChecked = true;
+  let anyChildChecked = false;
+  walkAllNodeChildren(node, childNode => {
+    const {
+      model: {
+        isChecked
+      }
+    } = childNode;
     if (isChecked === 'mixed' || isChecked === true) anyChildChecked = true;else childAllChecked = false;
   });
   if (childAllChecked) return true;
   if (anyChildChecked) return 'mixed';
   return false;
 };
-var selectCheckboxItemModelParentsTillRoot = function selectCheckboxItemModelParentsTillRoot(modelToCheck) {
-  var triggerTreeRerender = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : null;
-  var newSelections = {};
-  var nodePath = modelToCheck.nodePath;
-  walkParents(nodePath, function (parentNode) {
-    var nextState = getGroupCheckState(parentNode);
+const selectCheckboxItemModelParentsTillRoot = (modelToCheck, triggerTreeRerender = null) => {
+  const newSelections = {};
+  const {
+    nodePath
+  } = modelToCheck;
+  walkParents(nodePath, parentNode => {
+    const nextState = getGroupCheckState(parentNode);
     parentNode.model.isChecked = nextState;
     newSelections[parentNode.model.id] = nextState;
   });
   if (triggerTreeRerender) triggerTreeRerender();
   return newSelections;
 };
-var toggleCheckboxItem = function toggleCheckboxItem(itemToSelect) {
-  var triggerTreeRerender = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : null;
-  var _itemToSelect$node$mo = itemToSelect.node.model,
-      id = _itemToSelect$node$mo.id,
-      isChecked = _itemToSelect$node$mo.isChecked,
-      _itemToSelect$node$mo2 = _itemToSelect$node$mo.children,
-      children = _itemToSelect$node$mo2 === void 0 ? [] : _itemToSelect$node$mo2;
-  var newSelections = {}; // 'mixed' -> true -> false -> true [...->false -> true]
+const toggleCheckboxItem = (itemToSelect, triggerTreeRerender = null) => {
+  const {
+    node: {
+      model: {
+        id,
+        isChecked,
+        children = []
+      }
+    }
+  } = itemToSelect;
+  const newSelections = {}; // 'mixed' -> true -> false -> true [...->false -> true]
 
-  var nextState = isChecked === 'mixed' ? true : !isChecked;
+  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, function (childNode) {
+    walkAllNodeChildren(itemToSelect.node, childNode => {
       childNode.model.isChecked = nextState;
       newSelections[childNode.model.id] = nextState;
     });
   }
 
-  var parentsNewSelections = selectCheckboxItemModelParentsTillRoot(itemToSelect);
+  const parentsNewSelections = selectCheckboxItemModelParentsTillRoot(itemToSelect);
   if (triggerTreeRerender) triggerTreeRerender();
   return _objectSpread(_objectSpread({}, parentsNewSelections), newSelections);
 };
 
 export { getGroupCheckState, selectCheckboxItemModelParentsTillRoot, toggleCheckboxItem };
-//# sourceMappingURL=selectable-helper.js.map

package/esm/utils/string-helpers.js

@@ -1,6 +1,3 @@
-var standardizeSearchQueryString = function standardizeSearchQueryString(input) {
-  return input.trim().toLowerCase();
-};
+const standardizeSearchQueryString = input => input.trim().toLowerCase();
 
 export { standardizeSearchQueryString };
-//# sourceMappingURL=string-helpers.js.map

package/esm/utils/tree-helpers.js

@@ -1,126 +1,110 @@
-import _toConsumableArray from '@babel/runtime/helpers/esm/toConsumableArray';
+import 'core-js/modules/web.dom-collections.iterator.js';
 import { createRef } from 'react';
 import { standardizeSearchQueryString } from './string-helpers.js';
 
-var walkVisibles = function walkVisibles(node, callback) {
-  var skipRoot = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : true;
-  var highlightOnlyQuery = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : false;
-  var children = node.children,
-      model = node.model;
-  var name = model.name,
-      isExpanded = model.isExpanded,
-      childrenMatchesSearchQuery = model.childrenMatchesSearchQuery,
-      matchesSearchQuery = model.matchesSearchQuery;
-  var shouldSkipBecauseIsRoot = skipRoot && name === '__root';
-  var queryRestrictionsPassed = highlightOnlyQuery || childrenMatchesSearchQuery || matchesSearchQuery;
+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);
-  var shouldWalkChildren = children.length && isExpanded && queryRestrictionsPassed;
+  const shouldWalkChildren = children.length && isExpanded && queryRestrictionsPassed;
 
   if (shouldWalkChildren) {
-    children.forEach(function (childNode) {
+    children.forEach(childNode => {
       walkVisibles(childNode, callback, skipRoot, highlightOnlyQuery);
     });
   }
 };
-var walkParents = function walkParents(nodePath, callback) {
-  var skipRoot = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : true;
-
-  var parents = _toConsumableArray(nodePath).reverse();
-
+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.forEach(callback);
 };
-var walkAllNodeChildren = function walkAllNodeChildren(node, callback) {
-  var isFirst = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : true;
-  var _node$children = node.children,
-      children = _node$children === void 0 ? [] : _node$children;
-  var shouldWalkChildren = children.length;
+const walkAllNodeChildren = (node, callback, isFirst = true) => {
+  const {
+    children = []
+  } = node;
+  const shouldWalkChildren = children.length;
   if (!isFirst) callback(node);
 
   if (shouldWalkChildren) {
-    children.forEach(function (childNode) {
+    children.forEach(childNode => {
       walkAllNodeChildren(childNode, callback, false);
     });
   }
 };
-var getNodeById = function getNodeById(treeRoot, id) {
-  var nodes = treeRoot.all(function (node) {
-    return node.model.id === id;
-  });
+const getNodeById = (treeRoot, id) => {
+  const nodes = treeRoot.all(node => node.model.id === id);
   return nodes[0];
 };
-var cloneNode = function cloneNode(tree, node) {
-  return tree.parse(node.model);
-};
-var getItemsParentNode = function getItemsParentNode() {
-  var items = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : [];
-  var skipSameParentCheck = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;
+const cloneNode = (tree, node) => tree.parse(node.model);
+const getItemsParentNode = (items = [], skipSameParentCheck = 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]
 
-  var firstExistingItem = items.find(function (item) {
-    return !!item;
-  });
+  const firstExistingItem = items.find(item => !!item);
   if (!firstExistingItem) throw new Error("Received no items, can't retrieve parent");
-  var firstExistingItemPath = firstExistingItem.node.getPath(); // path is like [rootParent, ...[parentsNodes], currentNode]
+  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)
 
-  var directParentNode = firstExistingItemPath[firstExistingItemPath.length - 2];
+  const directParentNode = firstExistingItemPath[firstExistingItemPath.length - 2];
   return directParentNode;
 };
-var itemsShareSameParent = function itemsShareSameParent() {
-  var items = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : [];
+const itemsShareSameParent = (items = []) => {
   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]
 
-  var firstExistingItem = items.find(function (item) {
-    return !!item;
-  });
+  const firstExistingItem = items.find(item => !!item);
   if (!firstExistingItem) throw new Error("Received no items, can't retrieve parent");
-  var firstExistingItemPath = firstExistingItem.node.getPath(); // path is like [rootParent, ...[parentsNodes], currentNode]
+  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)
 
-  var directParentNode = firstExistingItemPath[firstExistingItemPath.length - 2];
-  return items.every(function (item) {
+  const directParentNode = firstExistingItemPath[firstExistingItemPath.length - 2];
+  return items.every(item => {
     // undefined nodes count as having the same parent
     if (!item) return true;
-    var itemPath = item.node.getPath();
-    var itemDirectParent = itemPath[itemPath.length - 2];
+    const itemPath = item.node.getPath();
+    const itemDirectParent = itemPath[itemPath.length - 2];
     return directParentNode === itemDirectParent;
   });
 };
-var getNodeMatchesSearchQuery = function getNodeMatchesSearchQuery(node) {
-  var searchQuery = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : '';
-  var standardizedName = standardizeSearchQueryString(node.model.name);
-  var standardizedSearchQuery = standardizeSearchQueryString(searchQuery);
+const getNodeMatchesSearchQuery = (node, searchQuery = '') => {
+  const standardizedName = standardizeSearchQueryString(node.model.name);
+  const standardizedSearchQuery = standardizeSearchQueryString(searchQuery);
   return standardizedName.includes(standardizedSearchQuery);
 };
-var getChildrenMatchesSearchQuery = function getChildrenMatchesSearchQuery(parentNode) {
-  var searchQuery = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : '';
-  var anyChildMatch = false;
-  walkAllNodeChildren(parentNode, function (node) {
+const getChildrenMatchesSearchQuery = (parentNode, searchQuery = '') => {
+  let anyChildMatch = false;
+  walkAllNodeChildren(parentNode, node => {
     if (getNodeMatchesSearchQuery(node, searchQuery)) anyChildMatch = true;
   });
   return anyChildMatch;
 };
-var enrichNodeModelInPlace = function enrichNodeModelInPlace(node) {
+const enrichNodeModelInPlace = (node, searchQuery = '', selection = null) => {
   var _node$model, _node$model$children;
 
-  var searchQuery = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : '';
-  var selection = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : null;
-  var path = node.getPath();
-  var depth = path.length - 1;
+  const path = node.getPath();
+  const depth = path.length - 1;
   node.model.nodePath = path;
   node.model.treeDepth = depth;
 
@@ -154,11 +138,10 @@ var enrichNodeModelInPlace = function enrichNodeModelInPlace(node) {
     node.model.isChecked = selection[node.model.id];
   }
 };
-var focusItem = function focusItem(item) {
+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();
 };
 
 export { cloneNode, enrichNodeModelInPlace, focusItem, getChildrenMatchesSearchQuery, getItemsParentNode, getNodeById, getNodeMatchesSearchQuery, itemsShareSameParent, walkAllNodeChildren, walkParents, walkVisibles };
-//# sourceMappingURL=tree-helpers.js.map