@salutejs/plasma-new-hope 0.339.0-canary.2286.18557548158.0 → 0.339.0-canary.2288.18653805742.0

package/emotion/cjs/components/Tree/utils/traverseTree.js

@@ -9,13 +9,15 @@ Object.defineProperty(exports, "traverseTree", {
     }
 });
 var _dedupe = /*#__PURE__*/ _interop_require_default(require("classnames/dedupe"));
-var _utils = require("../../../utils");
 var _Treetokens = require("../Tree.tokens");
 function _array_like_to_array(arr, len) {
     if (len == null || len > arr.length) len = arr.length;
     for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
     return arr2;
 }
+function _array_with_holes(arr) {
+    if (Array.isArray(arr)) return arr;
+}
 function _array_without_holes(arr) {
     if (Array.isArray(arr)) return _array_like_to_array(arr);
 }
@@ -27,12 +29,46 @@ function _interop_require_default(obj) {
 function _iterable_to_array(iter) {
     if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
 }
+function _iterable_to_array_limit(arr, i) {
+    var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
+    if (_i == null) return;
+    var _arr = [];
+    var _n = true;
+    var _d = false;
+    var _s, _e;
+    try {
+        for(_i = _i.call(arr); !(_n = (_s = _i.next()).done); _n = true){
+            _arr.push(_s.value);
+            if (i && _arr.length === i) break;
+        }
+    } catch (err) {
+        _d = true;
+        _e = err;
+    } finally{
+        try {
+            if (!_n && _i["return"] != null) _i["return"]();
+        } finally{
+            if (_d) throw _e;
+        }
+    }
+    return _arr;
+}
+function _non_iterable_rest() {
+    throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
+}
 function _non_iterable_spread() {
     throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
 }
+function _sliced_to_array(arr, i) {
+    return _array_with_holes(arr) || _iterable_to_array_limit(arr, i) || _unsupported_iterable_to_array(arr, i) || _non_iterable_rest();
+}
 function _to_consumable_array(arr) {
     return _array_without_holes(arr) || _iterable_to_array(arr) || _unsupported_iterable_to_array(arr) || _non_iterable_spread();
 }
+function _type_of(obj) {
+    "@swc/helpers - typeof";
+    return obj && typeof Symbol !== "undefined" && obj.constructor === Symbol ? "symbol" : typeof obj;
+}
 function _unsupported_iterable_to_array(o, minLen) {
     if (!o) return;
     if (typeof o === "string") return _array_like_to_array(o, minLen);
@@ -41,6 +77,28 @@ function _unsupported_iterable_to_array(o, minLen) {
     if (n === "Map" || n === "Set") return Array.from(n);
     if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array(o, minLen);
 }
+// Blazing-fast хелпер для глубокого копирования объектов.
+// Ссылки на функции (React-компоненты) сохраняются.
+var deepCopy = function(obj) {
+    if (obj === null || (typeof obj === "undefined" ? "undefined" : _type_of(obj)) !== 'object') {
+        return obj;
+    }
+    if (Array.isArray(obj)) {
+        return obj.map(function(item) {
+            return deepCopy(item);
+        });
+    }
+    if (obj.$$typeof === Symbol.for('react.element') || obj.$$typeof === Symbol.for('react.fragment') || _type_of(obj === null || obj === void 0 ? void 0 : obj.$$typeof) === 'symbol') {
+        return obj;
+    }
+    return Object.fromEntries(Object.entries(obj).map(function(param) {
+        var _param = _sliced_to_array(param, 2), key = _param[0], value = _param[1];
+        return [
+            key,
+            deepCopy(value)
+        ];
+    }));
+};
 // Поиск в глубину для обхода узлов дерева.
 var dfs = function(node, selectedKeys, rootParentsSelected, parents) {
     var _node_children, _parents_filter_;
@@ -87,7 +145,7 @@ var getRootParentsSelectedChildren = function(node, selectedKeysSet) {
 };
 var traverseTree = function(items, selectedKeys) {
     var selectedKeysSet = new Set(selectedKeys);
-    var copyItems = (0, _utils.deepCopy)(items);
+    var copyItems = deepCopy(items);
     var rootParentsSelected = getRootParentsSelectedChildren({
         key: 'root',
         children: copyItems