@reltio/components 1.4.1314 → 1.4.1316

package/cjs/components/ReactSortableTree/react-sortable-tree.js

@@ -27,7 +27,11 @@ var __assign = (this && this.__assign) || function () {
 };
 var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
     if (k2 === undefined) k2 = k;
-    Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
 }) : (function(o, m, k, k2) {
     if (k2 === undefined) k2 = k;
     o[k2] = m[k];
@@ -98,7 +102,7 @@ var ReactSortableTree = /** @class */ (function (_super) {
         var _a = mergeTheme(props), dndType = _a.dndType, nodeContentRenderer = _a.nodeContentRenderer, treeNodeRenderer = _a.treeNodeRenderer, isVirtualized = _a.isVirtualized, slideRegionSize = _a.slideRegionSize;
         _this.dndManager = new dnd_manager_1.default(_this);
         // Wrapping classes for use with react-dnd
-        _this.treeId = "rst__" + treeIdCounter;
+        _this.treeId = "rst__".concat(treeIdCounter);
         treeIdCounter += 1;
         _this.dndType = dndType || _this.treeId;
         _this.nodeContentRenderer = _this.dndManager.wrapSource(nodeContentRenderer);
@@ -107,8 +111,8 @@ var ReactSortableTree = /** @class */ (function (_super) {
         // Prepare scroll-on-drag options for this list
         if (isVirtualized) {
             _this.scrollZoneVirtualList = (frontend_collective_react_dnd_scrollzone_1.createScrollingComponent || frontend_collective_react_dnd_scrollzone_1.default)(react_virtualized_1.List);
-            _this.vStrength = frontend_collective_react_dnd_scrollzone_1.createVerticalStrength(slideRegionSize);
-            _this.hStrength = frontend_collective_react_dnd_scrollzone_1.createHorizontalStrength(slideRegionSize);
+            _this.vStrength = (0, frontend_collective_react_dnd_scrollzone_1.createVerticalStrength)(slideRegionSize);
+            _this.hStrength = (0, frontend_collective_react_dnd_scrollzone_1.createHorizontalStrength)(slideRegionSize);
         }
         _this.state = {
             draggingTreeData: null,
@@ -151,7 +155,7 @@ var ReactSortableTree = /** @class */ (function (_super) {
     ReactSortableTree.getDerivedStateFromProps = function (nextProps, prevState) {
         var instanceProps = prevState.instanceProps;
         var newState = {};
-        if (!ramda_1.equals(instanceProps.searchQuery, nextProps.searchQuery)) {
+        if (!(0, ramda_1.equals)(instanceProps.searchQuery, nextProps.searchQuery)) {
             Object.assign(newState, ReactSortableTree.search(nextProps, prevState, true, true, false));
         }
         else if (instanceProps.searchFocusOffset !== nextProps.searchFocusOffset) {
@@ -175,9 +179,9 @@ var ReactSortableTree = /** @class */ (function (_super) {
             }
         }
         if (this.state.dragging) {
-            var isTreeDataEqual = ramda_1.equals(this.props.treeData, prevProps.treeData);
+            var isTreeDataEqual = (0, ramda_1.equals)(this.props.treeData, prevProps.treeData);
             if (!isTreeDataEqual) {
-                var draggingTreeData_1 = tree_data_utils_1.removeNode({
+                var draggingTreeData_1 = (0, tree_data_utils_1.removeNode)({
                     treeData: this.props.treeData,
                     path: prevState.draggedPath,
                     getNodeKey: this.props.getNodeKey
@@ -188,7 +192,7 @@ var ReactSortableTree = /** @class */ (function (_super) {
                         draggingTreeData: draggingExpandedPaths.reduce(function (treeData, path) {
                             var newTree;
                             try {
-                                newTree = tree_data_utils_1.changeNodeAtPath({
+                                newTree = (0, tree_data_utils_1.changeNodeAtPath)({
                                     treeData: treeData,
                                     path: path,
                                     newNode: function (_a) {
@@ -207,7 +211,7 @@ var ReactSortableTree = /** @class */ (function (_super) {
                 });
             }
             else if (this.state.draggingTreeData && prevState.draggingTreeData !== this.state.draggingTreeData) {
-                tree_data_utils_1.walk({
+                (0, tree_data_utils_1.walk)({
                     treeData: this.state.draggingTreeData,
                     getNodeKey: this.props.getNodeKey,
                     callback: function (_a) {
@@ -225,7 +229,7 @@ var ReactSortableTree = /** @class */ (function (_super) {
             }
         }
         else if (this.props.treeData !== prevProps.treeData) {
-            var isTreeDataEqual = ramda_1.equals(this.props.treeData, prevProps.treeData);
+            var isTreeDataEqual = (0, ramda_1.equals)(this.props.treeData, prevProps.treeData);
             var _a = this.state, ignoreOneTreeUpdate = _a.ignoreOneTreeUpdate, instanceProps = _a.instanceProps;
             var newState = {};
             if (!isTreeDataEqual) {
@@ -252,7 +256,7 @@ var ReactSortableTree = /** @class */ (function (_super) {
         this.clearMonitorSubscription();
     };
     ReactSortableTree.prototype.getRows = function (treeData) {
-        return memoized_tree_data_utils_1.memoizedGetFlatDataFromTree({
+        return (0, memoized_tree_data_utils_1.memoizedGetFlatDataFromTree)({
             ignoreCollapsed: true,
             getNodeKey: this.props.getNodeKey,
             treeData: treeData
@@ -270,7 +274,7 @@ var ReactSortableTree = /** @class */ (function (_super) {
     ReactSortableTree.prototype.toggleChildrenVisibility = function (_a) {
         var targetNode = _a.node, path = _a.path;
         var instanceProps = this.state.instanceProps;
-        var treeData = tree_data_utils_1.changeNodeAtPath({
+        var treeData = (0, tree_data_utils_1.changeNodeAtPath)({
             treeData: instanceProps.treeData,
             path: path,
             newNode: function (_a) {
@@ -290,7 +294,7 @@ var ReactSortableTree = /** @class */ (function (_super) {
     ReactSortableTree.prototype.moveNode = function (_a) {
         var _this = this;
         var node = _a.node, prevPath = _a.path, prevTreeIndex = _a.treeIndex, depth = _a.depth, minimumTreeIndex = _a.minimumTreeIndex;
-        var _b = tree_data_utils_1.insertNode({
+        var _b = (0, tree_data_utils_1.insertNode)({
             treeData: this.state.draggingTreeData,
             newNode: node,
             depth: depth,
@@ -333,10 +337,10 @@ var ReactSortableTree = /** @class */ (function (_super) {
         }
         var newState = {};
         // if onlyExpandSearchedNodes collapse the tree and search
-        var _a = tree_data_utils_1.find({
+        var _a = (0, tree_data_utils_1.find)({
             getNodeKey: getNodeKey,
             treeData: onlyExpandSearchedNodes
-                ? tree_data_utils_1.toggleExpandedForAll({
+                ? (0, tree_data_utils_1.toggleExpandedForAll)({
                     treeData: instanceProps.treeData,
                     expanded: false
                 })
@@ -367,7 +371,7 @@ var ReactSortableTree = /** @class */ (function (_super) {
         var _this = this;
         var path = _a.path;
         this.setState(function (prevState) {
-            var _a = tree_data_utils_1.removeNode({
+            var _a = (0, tree_data_utils_1.removeNode)({
                 treeData: prevState.instanceProps.treeData,
                 path: path,
                 getNodeKey: _this.props.getNodeKey
@@ -395,7 +399,7 @@ var ReactSortableTree = /** @class */ (function (_super) {
             // Fall back to the tree data if something is being dragged in from
             //  an external element
             var newDraggingTreeData = draggingTreeData || instanceProps.treeData;
-            var addedResult = memoized_tree_data_utils_1.memoizedInsertNode({
+            var addedResult = (0, memoized_tree_data_utils_1.memoizedInsertNode)({
                 treeData: newDraggingTreeData,
                 newNode: draggedNode,
                 depth: draggedDepth,
@@ -406,12 +410,12 @@ var ReactSortableTree = /** @class */ (function (_super) {
             var rows = _this.getRows(addedResult.treeData);
             var expandedParentPath = rows[addedResult.treeIndex].path;
             var nodePath = expandedParentPath.slice(0, -1);
-            var newDraggingExpandedPaths = ramda_1.pipe(ramda_1.when(ramda_1.always(ramda_1.gt(nodePath.length, 0)), ramda_1.append(nodePath)), ramda_1.uniqWith(ramda_1.eqBy(String)))(draggingExpandedPaths);
+            var newDraggingExpandedPaths = (0, ramda_1.pipe)((0, ramda_1.when)((0, ramda_1.always)((0, ramda_1.gt)(nodePath.length, 0)), (0, ramda_1.append)(nodePath)), (0, ramda_1.uniqWith)((0, ramda_1.eqBy)(String)))(draggingExpandedPaths);
             return {
                 draggedNode: draggedNode,
                 draggedDepth: draggedDepth,
                 draggedMinimumTreeIndex: draggedMinimumTreeIndex,
-                draggingTreeData: tree_data_utils_1.changeNodeAtPath({
+                draggingTreeData: (0, tree_data_utils_1.changeNodeAtPath)({
                     treeData: newDraggingTreeData,
                     path: nodePath,
                     newNode: function (_a) {
@@ -459,7 +463,7 @@ var ReactSortableTree = /** @class */ (function (_super) {
             // If copying is enabled, a drop outside leaves behind a copy in the
             //  source tree
             if (shouldCopy) {
-                treeData = tree_data_utils_1.changeNodeAtPath({
+                treeData = (0, tree_data_utils_1.changeNodeAtPath)({
                     treeData: instanceProps.treeData,
                     path: path,
                     newNode: function (_a) {
@@ -495,7 +499,7 @@ var ReactSortableTree = /** @class */ (function (_super) {
     // Load any children in the tree that are given by a function
     // calls the onChange callback on the new treeData
     ReactSortableTree.loadLazyChildren = function (props) {
-        tree_data_utils_1.walk({
+        (0, tree_data_utils_1.walk)({
             treeData: props.treeData,
             getNodeKey: props.getNodeKey,
             callback: function (_a) {
@@ -511,7 +515,7 @@ var ReactSortableTree = /** @class */ (function (_super) {
                         treeIndex: treeIndex,
                         // Provide a helper to append the new data when it is received
                         done: function (childrenArray) {
-                            return props.onChange(tree_data_utils_1.changeNodeAtPath({
+                            return props.onChange((0, tree_data_utils_1.changeNodeAtPath)({
                                 treeData: props.treeData,
                                 path: path,
                                 newNode: function (_a) {
@@ -570,7 +574,7 @@ var ReactSortableTree = /** @class */ (function (_super) {
         var swapFrom = null;
         var swapLength = null;
         if (draggedNode && draggedMinimumTreeIndex !== null) {
-            var addedResult = memoized_tree_data_utils_1.memoizedInsertNode({
+            var addedResult = (0, memoized_tree_data_utils_1.memoizedInsertNode)({
                 treeData: treeData,
                 newNode: draggedNode,
                 depth: draggedDepth,
@@ -580,8 +584,8 @@ var ReactSortableTree = /** @class */ (function (_super) {
             });
             var swapTo = draggedMinimumTreeIndex;
             swapFrom = addedResult.treeIndex;
-            swapLength = 1 + memoized_tree_data_utils_1.memoizedGetDescendantCount({ node: draggedNode });
-            rows = generic_utils_1.slideRows(this.getRows(addedResult.treeData), swapFrom, swapTo, swapLength);
+            swapLength = 1 + (0, memoized_tree_data_utils_1.memoizedGetDescendantCount)({ node: draggedNode });
+            rows = (0, generic_utils_1.slideRows)(this.getRows(addedResult.treeData), swapFrom, swapTo, swapLength);
         }
         else {
             rows = this.getRows(treeData);
@@ -658,7 +662,7 @@ var ReactSortableTree = /** @class */ (function (_super) {
                 });
             });
         }
-        return (react_1.default.createElement("div", { className: classnames_1.default('rst__tree', className, rowDirectionClass), style: containerStyle }, list));
+        return (react_1.default.createElement("div", { className: (0, classnames_1.default)('rst__tree', className, rowDirectionClass), style: containerStyle }, list));
     };
     return ReactSortableTree;
 }(react_1.Component));
@@ -797,8 +801,8 @@ ReactSortableTree.defaultProps = {
     onLazyLoadChildren: function () { },
     ignoreTreeChanges: false
 };
-react_lifecycles_compat_1.polyfill(ReactSortableTree);
-var StyledReactSortableTree = styles_1.withStyles(reactSortableTreeStyles_1.styles)(ReactSortableTree);
+(0, react_lifecycles_compat_1.polyfill)(ReactSortableTree);
+var StyledReactSortableTree = (0, styles_1.withStyles)(reactSortableTreeStyles_1.styles)(ReactSortableTree);
 var SortableTreeWithoutDndContext = function (props) { return (react_1.default.createElement(react_dnd_1.DndContext.Consumer, null, function (_a) {
     var dragDropManager = _a.dragDropManager;
     return dragDropManager === undefined ? null : (react_1.default.createElement(StyledReactSortableTree, __assign({}, props, { dragDropManager: dragDropManager })));

package/cjs/components/ReactSortableTree/tree-node.d.ts

@@ -40,7 +40,7 @@ declare namespace TreeNode {
         export const scaffoldBlockPxWidth: PropTypes.Validator<number>;
         export const lowerSiblingCounts: PropTypes.Validator<number[]>;
         export const listIndex: PropTypes.Validator<number>;
-        export const children: PropTypes.Validator<PropTypes.ReactNodeLike>;
+        export const children: PropTypes.Validator<NonNullable<PropTypes.ReactNodeLike>>;
         export const connectDropTarget: PropTypes.Validator<(...args: any[]) => any>;
         export const isOver: PropTypes.Validator<boolean>;
         const canDrop_1: PropTypes.Requireable<boolean>;
@@ -48,8 +48,8 @@ declare namespace TreeNode {
         const draggedNode_1: PropTypes.Requireable<PropTypes.InferProps<{}>>;
         export { draggedNode_1 as draggedNode };
         export const getPrevRow: PropTypes.Validator<(...args: any[]) => any>;
-        export const node: PropTypes.Validator<PropTypes.InferProps<{}>>;
-        export const path: PropTypes.Validator<(string | number)[]>;
+        export const node: PropTypes.Validator<NonNullable<PropTypes.InferProps<{}>>>;
+        export const path: PropTypes.Validator<NonNullable<string | number>[]>;
         const rowDirection_1: PropTypes.Requireable<string>;
         export { rowDirection_1 as rowDirection };
     }

package/cjs/components/ReactSortableTree/tree-node.js

@@ -12,7 +12,11 @@ var __assign = (this && this.__assign) || function () {
 };
 var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
     if (k2 === undefined) k2 = k;
-    Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
 }) : (function(o, m, k, k2) {
     if (k2 === undefined) k2 = k;
     o[k2] = m[k];
@@ -57,7 +61,7 @@ var TreeNode = function (_a) {
     path = _a.path, // Delete from otherProps
     /* eslint-enable */
     rowDirection = _a.rowDirection, otherProps = __rest(_a, ["children", "listIndex", "swapFrom", "swapLength", "swapDepth", "scaffoldBlockPxWidth", "lowerSiblingCounts", "connectDropTarget", "isOver", "draggedNode", "canDrop", "treeIndex", "treeId", "getPrevRow", "node", "path", "rowDirection"]);
-    treeNodeStyle_1.useStyles();
+    (0, treeNodeStyle_1.useStyles)();
     var rowDirectionClass = rowDirection === 'rtl' ? 'rst__rtl' : null;
     // Construct the scaffold representing the structure of the tree
     var scaffoldBlockCount = lowerSiblingCounts.length;
@@ -112,7 +116,7 @@ var TreeNode = function (_a) {
             // +-----+
             lineClass = 'rst__lineHalfVerticalTop rst__lineHalfHorizontalRight';
         }
-        scaffold.push(react_1.default.createElement("div", { key: "pre_" + (1 + i), style: { width: scaffoldBlockPxWidth }, className: classnames_1.default('rst__lineBlock', lineClass, rowDirectionClass) }));
+        scaffold.push(react_1.default.createElement("div", { key: "pre_".concat(1 + i), style: { width: scaffoldBlockPxWidth }, className: (0, classnames_1.default)('rst__lineBlock', lineClass, rowDirectionClass) }));
         if (treeIndex !== listIndex && i === swapDepth) {
             // This row has been shifted, and is at the depth of
             // the line pointing to the new destination
@@ -146,7 +150,7 @@ var TreeNode = function (_a) {
             }
             scaffold.push(react_1.default.createElement("div", { 
                 // eslint-disable-next-line react/no-array-index-key
-                key: i, style: style_1, className: classnames_1.default('rst__absoluteLineBlock', highlightLineClass, rowDirectionClass) }));
+                key: i, style: style_1, className: (0, classnames_1.default)('rst__absoluteLineBlock', highlightLineClass, rowDirectionClass) }));
         }
     });
     var style;
@@ -157,10 +161,10 @@ var TreeNode = function (_a) {
         // Default ltr
         style = { left: scaffoldBlockPxWidth * scaffoldBlockCount };
     }
-    return connectDropTarget(react_1.default.createElement("div", __assign({}, otherProps, { className: classnames_1.default('rst__node', rowDirectionClass) }),
+    return connectDropTarget(react_1.default.createElement("div", __assign({}, otherProps, { className: (0, classnames_1.default)('rst__node', rowDirectionClass) }),
         scaffold,
         react_1.default.createElement("div", { className: "rst__nodeContent", style: style }, react_1.Children.map(children, function (child) {
-            return react_1.cloneElement(child, {
+            return (0, react_1.cloneElement)(child, {
                 isOver: isOver,
                 canDrop: canDrop,
                 draggedNode: draggedNode

package/cjs/components/ReactSortableTree/tree-placeholder.d.ts

@@ -2,6 +2,7 @@ export default TreePlaceholder;
 declare class TreePlaceholder extends React.Component<any, any, any> {
     constructor(props: any);
     constructor(props: any, context: any);
+    render(): any;
 }
 declare namespace TreePlaceholder {
     namespace defaultProps {
@@ -9,7 +10,7 @@ declare namespace TreePlaceholder {
         const draggedNode: any;
     }
     namespace propTypes {
-        export const children: PropTypes.Validator<PropTypes.ReactNodeLike>;
+        export const children: PropTypes.Validator<NonNullable<PropTypes.ReactNodeLike>>;
         export const connectDropTarget: PropTypes.Validator<(...args: any[]) => any>;
         export const isOver: PropTypes.Validator<boolean>;
         const canDrop_1: PropTypes.Requireable<boolean>;

package/cjs/components/ReactSortableTree/tree-placeholder.js

@@ -27,7 +27,11 @@ var __assign = (this && this.__assign) || function () {
 };
 var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
     if (k2 === undefined) k2 = k;
-    Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
 }) : (function(o, m, k, k2) {
     if (k2 === undefined) k2 = k;
     o[k2] = m[k];
@@ -71,7 +75,7 @@ var TreePlaceholder = /** @class */ (function (_super) {
         // eslint-disable-next-line @typescript-eslint/no-unused-vars
         var _a = this.props, children = _a.children, connectDropTarget = _a.connectDropTarget, treeId = _a.treeId, drop = _a.drop, otherProps = __rest(_a, ["children", "connectDropTarget", "treeId", "drop"]);
         return connectDropTarget(react_1.default.createElement("div", null, react_1.Children.map(children, function (child) {
-            return react_1.cloneElement(child, __assign({}, otherProps));
+            return (0, react_1.cloneElement)(child, __assign({}, otherProps));
         })));
     };
     return TreePlaceholder;

package/cjs/components/ReactSortableTree/treeNodeStyle.js

@@ -2,7 +2,7 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.useStyles = void 0;
 var styles_1 = require("@material-ui/core/styles");
-exports.useStyles = styles_1.makeStyles(function () { return ({
+exports.useStyles = (0, styles_1.makeStyles)(function () { return ({
     '@global .rst__node': {
         minWidth: '100%',
         whiteSpace: 'nowrap',

package/cjs/components/ReactSortableTree/utils/dnd-manager.d.ts

@@ -13,7 +13,7 @@ export default class DndManager {
     get maxDepth(): any;
     resetDragVariables(): void;
     lastDropTargetNode: any;
-    lastDropTargetDepth: number;
+    lastDropTargetDepth: any;
     hoverProps: {
         dropTargetProps: any;
         monitor: any;

package/cjs/components/ReactSortableTree/utils/dnd-manager.js

@@ -143,7 +143,7 @@ var DndManager = /** @class */ (function () {
             // Ignore the tree depth of the source, if it had any to begin with
             dragSourceInitialDepth = 0;
             if (component) {
-                var relativePosition = react_dom_1.findDOMNode(component).getBoundingClientRect(); // eslint-disable-line react/no-find-dom-node
+                var relativePosition = (0, react_dom_1.findDOMNode)(component).getBoundingClientRect(); // eslint-disable-line react/no-find-dom-node
                 var leftShift = monitor.getSourceClientOffset().x - relativePosition.left;
                 blocksOffset = Math.round(leftShift / dropTargetProps.scaffoldBlockPxWidth);
             }
@@ -160,7 +160,7 @@ var DndManager = /** @class */ (function () {
         // If a maxDepth is defined, constrain the target depth
         if (typeof this.maxDepth !== 'undefined' && this.maxDepth !== null) {
             var draggedNode = monitor.getItem().node;
-            var draggedChildDepth = tree_data_utils_1.getDepth(draggedNode);
+            var draggedChildDepth = (0, tree_data_utils_1.getDepth)(draggedNode);
             targetDepth = Math.max(0, Math.min(targetDepth, this.maxDepth - draggedChildDepth - 1));
         }
         return targetDepth;
@@ -180,7 +180,7 @@ var DndManager = /** @class */ (function () {
             aboveNodeId: aboveNode.nodeId !== undefined ? aboveNode.nodeId : aboveNode,
             blocksOffset: blocksOffset
         };
-        if (ramda_1.equals(this.lastCanDropProps, newCanDropProps)) {
+        if ((0, ramda_1.equals)(this.lastCanDropProps, newCanDropProps)) {
             return this.lastCanDropResult;
         }
         this.lastCanDropProps = newCanDropProps;
@@ -192,7 +192,7 @@ var DndManager = /** @class */ (function () {
         }
         if (typeof this.customCanDrop === 'function') {
             var node = monitor.getItem().node;
-            var addedResult = memoized_tree_data_utils_1.memoizedInsertNode({
+            var addedResult = (0, memoized_tree_data_utils_1.memoizedInsertNode)({
                 treeData: this.treeData,
                 newNode: node,
                 depth: targetDepth,
@@ -246,7 +246,7 @@ var DndManager = /** @class */ (function () {
                 didDrop: monitor.didDrop()
             };
         }
-        return react_dnd_1.DragSource(this.dndType, nodeDragSource, nodeDragSourcePropInjection)(el);
+        return (0, react_dnd_1.DragSource)(this.dndType, nodeDragSource, nodeDragSourcePropInjection)(el);
     };
     DndManager.prototype.wrapTarget = function (el) {
         var _this = this;
@@ -291,7 +291,7 @@ var DndManager = /** @class */ (function () {
                 draggedNode: dragged ? dragged.node : null
             };
         }
-        return react_dnd_1.DropTarget(this.dndType, nodeDropTarget, nodeDropTargetPropInjection)(el);
+        return (0, react_dnd_1.DropTarget)(this.dndType, nodeDropTarget, nodeDropTargetPropInjection)(el);
     };
     DndManager.prototype.wrapPlaceholder = function (el) {
         var _this = this;
@@ -319,7 +319,7 @@ var DndManager = /** @class */ (function () {
                 draggedNode: dragged ? dragged.node : null
             };
         }
-        return react_dnd_1.DropTarget(this.dndType, placeholderDropTarget, placeholderPropInjection)(el);
+        return (0, react_dnd_1.DropTarget)(this.dndType, placeholderDropTarget, placeholderPropInjection)(el);
     };
     return DndManager;
 }());

package/cjs/components/ReactSortableTree/utils/generic-utils.js

@@ -1,15 +1,19 @@
 "use strict";
 /* eslint-disable import/prefer-default-export */
-var __spreadArray = (this && this.__spreadArray) || function (to, from) {
-    for (var i = 0, il = from.length, j = to.length; i < il; i++, j++)
-        to[j] = from[i];
-    return to;
+var __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {
+    if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
+        if (ar || !(i in from)) {
+            if (!ar) ar = Array.prototype.slice.call(from, 0, i);
+            ar[i] = from[i];
+        }
+    }
+    return to.concat(ar || Array.prototype.slice.call(from));
 };
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.slideRows = void 0;
 function slideRows(rows, fromIndex, toIndex, count) {
     if (count === void 0) { count = 1; }
-    var rowsWithoutMoved = __spreadArray(__spreadArray([], rows.slice(0, fromIndex)), rows.slice(fromIndex + count));
-    return __spreadArray(__spreadArray(__spreadArray([], rowsWithoutMoved.slice(0, toIndex)), rows.slice(fromIndex, fromIndex + count)), rowsWithoutMoved.slice(toIndex));
+    var rowsWithoutMoved = __spreadArray(__spreadArray([], rows.slice(0, fromIndex), true), rows.slice(fromIndex + count), true);
+    return __spreadArray(__spreadArray(__spreadArray([], rowsWithoutMoved.slice(0, toIndex), true), rows.slice(fromIndex, fromIndex + count), true), rowsWithoutMoved.slice(toIndex), true);
 }
 exports.slideRows = slideRows;

package/cjs/components/ReactSortableTree/utils/tree-data-utils.js

@@ -10,10 +10,14 @@ var __assign = (this && this.__assign) || function () {
     };
     return __assign.apply(this, arguments);
 };
-var __spreadArray = (this && this.__spreadArray) || function (to, from) {
-    for (var i = 0, il = from.length, j = to.length; i < il; i++, j++)
-        to[j] = from[i];
-    return to;
+var __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {
+    if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
+        if (ar || !(i in from)) {
+            if (!ar) ar = Array.prototype.slice.call(from, 0, i);
+            ar[i] = from[i];
+        }
+    }
+    return to.concat(ar || Array.prototype.slice.call(from));
 };
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.find = exports.getDepth = exports.isDescendant = exports.getTreeFromFlatData = exports.getFlatDataFromTree = exports.insertNode = exports.addNodeUnderParent = exports.getNodeAtPath = exports.removeNode = exports.removeNodeAtPath = exports.changeNodeAtPath = exports.RESULT_MISS_ERROR_MESSAGE = exports.toggleExpandedForAll = exports.map = exports.walk = exports.getVisibleNodeInfoAtIndex = exports.getVisibleNodeCount = exports.getDescendantCount = void 0;
@@ -24,7 +28,7 @@ exports.find = exports.getDepth = exports.isDescendant = exports.getTreeFromFlat
 function getNodeDataAtTreeIndexOrNextIndex(_a) {
     var targetIndex = _a.targetIndex, node = _a.node, currentIndex = _a.currentIndex, getNodeKey = _a.getNodeKey, _b = _a.path, path = _b === void 0 ? [] : _b, _c = _a.lowerSiblingCounts, lowerSiblingCounts = _c === void 0 ? [] : _c, _d = _a.ignoreCollapsed, ignoreCollapsed = _d === void 0 ? true : _d, _e = _a.isPseudoRoot, isPseudoRoot = _e === void 0 ? false : _e;
     // The pseudo-root is not considered in the path
-    var selfPath = !isPseudoRoot ? __spreadArray(__spreadArray([], path), [getNodeKey({ node: node, treeIndex: currentIndex })]) : [];
+    var selfPath = !isPseudoRoot ? __spreadArray(__spreadArray([], path, true), [getNodeKey({ node: node, treeIndex: currentIndex })], false) : [];
     // Return target node when found
     if (currentIndex === targetIndex) {
         return {
@@ -48,7 +52,7 @@ function getNodeDataAtTreeIndexOrNextIndex(_a) {
             targetIndex: targetIndex,
             node: node.children[i],
             currentIndex: childIndex,
-            lowerSiblingCounts: __spreadArray(__spreadArray([], lowerSiblingCounts), [childCount - i - 1]),
+            lowerSiblingCounts: __spreadArray(__spreadArray([], lowerSiblingCounts, true), [childCount - i - 1], false),
             path: selfPath
         });
         if (result.node) {
@@ -92,7 +96,7 @@ exports.getDescendantCount = getDescendantCount;
 function walkDescendants(_a) {
     var callback = _a.callback, getNodeKey = _a.getNodeKey, ignoreCollapsed = _a.ignoreCollapsed, _b = _a.isPseudoRoot, isPseudoRoot = _b === void 0 ? false : _b, node = _a.node, _c = _a.parentNode, parentNode = _c === void 0 ? null : _c, currentIndex = _a.currentIndex, _d = _a.path, path = _d === void 0 ? [] : _d, _e = _a.lowerSiblingCounts, lowerSiblingCounts = _e === void 0 ? [] : _e;
     // The pseudo-root is not considered in the path
-    var selfPath = isPseudoRoot ? [] : __spreadArray(__spreadArray([], path), [getNodeKey({ node: node, treeIndex: currentIndex })]);
+    var selfPath = isPseudoRoot ? [] : __spreadArray(__spreadArray([], path, true), [getNodeKey({ node: node, treeIndex: currentIndex })], false);
     var selfInfo = isPseudoRoot
         ? null
         : {
@@ -125,7 +129,7 @@ function walkDescendants(_a) {
                 node: node.children[i],
                 parentNode: isPseudoRoot ? null : node,
                 currentIndex: childIndex + 1,
-                lowerSiblingCounts: __spreadArray(__spreadArray([], lowerSiblingCounts), [childCount - i - 1]),
+                lowerSiblingCounts: __spreadArray(__spreadArray([], lowerSiblingCounts, true), [childCount - i - 1], false),
                 path: selfPath
             });
             // Cut walk short if the callback returned false
@@ -159,7 +163,7 @@ function mapDescendants(_a) {
     var callback = _a.callback, getNodeKey = _a.getNodeKey, ignoreCollapsed = _a.ignoreCollapsed, _b = _a.isPseudoRoot, isPseudoRoot = _b === void 0 ? false : _b, node = _a.node, _c = _a.parentNode, parentNode = _c === void 0 ? null : _c, currentIndex = _a.currentIndex, _d = _a.path, path = _d === void 0 ? [] : _d, _e = _a.lowerSiblingCounts, lowerSiblingCounts = _e === void 0 ? [] : _e;
     var nextNode = __assign({}, node);
     // The pseudo-root is not considered in the path
-    var selfPath = isPseudoRoot ? [] : __spreadArray(__spreadArray([], path), [getNodeKey({ node: nextNode, treeIndex: currentIndex })]);
+    var selfPath = isPseudoRoot ? [] : __spreadArray(__spreadArray([], path, true), [getNodeKey({ node: nextNode, treeIndex: currentIndex })], false);
     var selfInfo = {
         node: nextNode,
         parentNode: parentNode,
@@ -186,7 +190,7 @@ function mapDescendants(_a) {
                 node: child,
                 parentNode: isPseudoRoot ? null : nextNode,
                 currentIndex: childIndex + 1,
-                lowerSiblingCounts: __spreadArray(__spreadArray([], lowerSiblingCounts), [childCount - i - 1]),
+                lowerSiblingCounts: __spreadArray(__spreadArray([], lowerSiblingCounts, true), [childCount - i - 1], false),
                 path: selfPath
             });
             childIndex = mapResult.treeIndex;
@@ -372,11 +376,11 @@ function changeNodeAtPath(_a) {
                 if (result_1) {
                     // If the result was truthy (in this case, an object),
                     //  pass it to the next level of recursion up
-                    return __assign(__assign({}, node), { children: __spreadArray(__spreadArray(__spreadArray([], node.children.slice(0, i)), [result_1]), node.children.slice(i + 1)) });
+                    return __assign(__assign({}, node), { children: __spreadArray(__spreadArray(__spreadArray([], node.children.slice(0, i), true), [result_1], false), node.children.slice(i + 1), true) });
                 }
                 // If the result was falsy (returned from the newNode function), then
                 //  delete the node from the array.
-                return __assign(__assign({}, node), { children: __spreadArray(__spreadArray([], node.children.slice(0, i)), node.children.slice(i + 1)) });
+                return __assign(__assign({}, node), { children: __spreadArray(__spreadArray([], node.children.slice(0, i), true), node.children.slice(i + 1), true) });
             }
             nextTreeIndex += 1 + getDescendantCount({ node: node.children[i], ignoreCollapsed: ignoreCollapsed });
         }
@@ -505,11 +509,11 @@ function addNodeUnderParent(_a) {
     if (parentKey === null) {
         return addAsFirstChild
             ? {
-                treeData: __spreadArray([newNode], (treeData || [])),
+                treeData: __spreadArray([newNode], (treeData || []), true),
                 treeIndex: 0
             }
             : {
-                treeData: __spreadArray(__spreadArray([], (treeData || [])), [newNode]),
+                treeData: __spreadArray(__spreadArray([], (treeData || []), true), [newNode], false),
                 treeIndex: (treeData || []).length
             };
     }
@@ -544,7 +548,7 @@ function addNodeUnderParent(_a) {
                 nextTreeIndex += 1 + getDescendantCount({ node: parentNode.children[i], ignoreCollapsed: ignoreCollapsed });
             }
             insertedTreeIndex = nextTreeIndex;
-            var children = addAsFirstChild ? __spreadArray([newNode], parentNode.children) : __spreadArray(__spreadArray([], parentNode.children), [newNode]);
+            var children = addAsFirstChild ? __spreadArray([newNode], parentNode.children, true) : __spreadArray(__spreadArray([], parentNode.children, true), [newNode], false);
             return __assign(__assign({}, parentNode), { children: children });
         }
     });
@@ -559,7 +563,7 @@ function addNodeUnderParent(_a) {
 exports.addNodeUnderParent = addNodeUnderParent;
 function addNodeAtDepthAndIndex(_a) {
     var targetDepth = _a.targetDepth, minimumTreeIndex = _a.minimumTreeIndex, newNode = _a.newNode, ignoreCollapsed = _a.ignoreCollapsed, expandParent = _a.expandParent, _b = _a.isPseudoRoot, isPseudoRoot = _b === void 0 ? false : _b, isLastChild = _a.isLastChild, node = _a.node, currentIndex = _a.currentIndex, currentDepth = _a.currentDepth, getNodeKey = _a.getNodeKey, _c = _a.path, path = _c === void 0 ? [] : _c;
-    var selfPath = function (n) { return (isPseudoRoot ? [] : __spreadArray(__spreadArray([], path), [getNodeKey({ node: n, treeIndex: currentIndex })])); };
+    var selfPath = function (n) { return (isPseudoRoot ? [] : __spreadArray(__spreadArray([], path, true), [getNodeKey({ node: n, treeIndex: currentIndex })], false)); };
     // If the current position is the only possible place to add, add it
     if (currentIndex >= minimumTreeIndex - 1 || (isLastChild && !(node.children && node.children.length))) {
         if (typeof node.children === 'function') {
@@ -567,7 +571,7 @@ function addNodeAtDepthAndIndex(_a) {
         }
         else {
             var extraNodeProps = expandParent ? { expanded: true } : {};
-            var nextNode_1 = __assign(__assign(__assign({}, node), extraNodeProps), { children: node.children ? __spreadArray([newNode], node.children) : [newNode] });
+            var nextNode_1 = __assign(__assign(__assign({}, node), extraNodeProps), { children: node.children ? __spreadArray([newNode], node.children, true) : [newNode] });
             return {
                 node: nextNode_1,
                 nextIndex: currentIndex + 2,
@@ -614,7 +618,7 @@ function addNodeAtDepthAndIndex(_a) {
             insertIndex = node.children.length;
         }
         // Insert the newNode at the insertIndex
-        var nextNode_2 = __assign(__assign({}, node), { children: __spreadArray(__spreadArray(__spreadArray([], node.children.slice(0, insertIndex)), [newNode]), node.children.slice(insertIndex)) });
+        var nextNode_2 = __assign(__assign({}, node), { children: __spreadArray(__spreadArray(__spreadArray([], node.children.slice(0, insertIndex), true), [newNode], false), node.children.slice(insertIndex), true) });
         // Return node with successful insert result
         return {
             node: nextNode_2,
@@ -668,7 +672,7 @@ function addNodeAtDepthAndIndex(_a) {
     };
     if (insertedTreeIndex !== null) {
         result.insertedTreeIndex = insertedTreeIndex;
-        result.parentPath = __spreadArray(__spreadArray([], selfPath(nextNode)), pathFragment);
+        result.parentPath = __spreadArray(__spreadArray([], selfPath(nextNode), true), pathFragment, true);
         result.parentNode = parentNode;
     }
     return result;
@@ -720,7 +724,7 @@ function insertNode(_a) {
     return {
         treeData: insertResult.node.children,
         treeIndex: treeIndex,
-        path: __spreadArray(__spreadArray([], insertResult.parentPath), [getNodeKey({ node: newNode, treeIndex: treeIndex })]),
+        path: __spreadArray(__spreadArray([], insertResult.parentPath, true), [getNodeKey({ node: newNode, treeIndex: treeIndex })], false),
         parentNode: insertResult.parentNode
     };
 }
@@ -853,7 +857,7 @@ function find(_a) {
         var isSelfMatch = false;
         var hasFocusMatch = false;
         // The pseudo-root is not considered in the path
-        var selfPath = isPseudoRoot ? [] : __spreadArray(__spreadArray([], path), [getNodeKey({ node: node, treeIndex: currentIndex })]);
+        var selfPath = isPseudoRoot ? [] : __spreadArray(__spreadArray([], path, true), [getNodeKey({ node: node, treeIndex: currentIndex })], false);
         var extraInfo = isPseudoRoot
             ? null
             : {
@@ -898,7 +902,7 @@ function find(_a) {
                     childIndex += 1;
                 }
                 if (mapResult.matches.length > 0 || mapResult.hasFocusMatch) {
-                    matches = __spreadArray(__spreadArray([], matches), mapResult.matches);
+                    matches = __spreadArray(__spreadArray([], matches, true), mapResult.matches, true);
                     if (mapResult.hasFocusMatch) {
                         hasFocusMatch = true;
                     }
@@ -919,7 +923,7 @@ function find(_a) {
         // Add this node to the matches if it fits the search criteria.
         // This is performed at the last minute so newNode can be sent in its final form.
         if (isSelfMatch) {
-            matches = __spreadArray([__assign(__assign({}, extraInfo), { node: newNode })], matches);
+            matches = __spreadArray([__assign(__assign({}, extraInfo), { node: newNode })], matches, true);
         }
         return {
             node: matches.length > 0 ? newNode : node,