@salutejs/plasma-new-hope 0.340.0-canary.2324.19228888741.0 → 0.340.0-canary.2325.19232328937.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (45) hide show
  1. package/cjs/components/Combobox/ComboboxNew/Combobox.js +5 -2
  2. package/cjs/components/Combobox/ComboboxNew/Combobox.js.map +1 -1
  3. package/cjs/components/Select/ui/Target/ui/Textfield/Textfield.js +5 -2
  4. package/cjs/components/Select/ui/Target/ui/Textfield/Textfield.js.map +1 -1
  5. package/cjs/components/Tree/utils/traverseTree.js +1 -1
  6. package/cjs/components/Tree/utils/traverseTree.js.map +1 -1
  7. package/emotion/cjs/components/Combobox/ComboboxNew/Combobox.js +5 -2
  8. package/emotion/cjs/components/Select/ui/Target/ui/Textfield/Textfield.js +5 -2
  9. package/emotion/cjs/components/Tree/utils/index.js +0 -4
  10. package/emotion/cjs/components/Tree/utils/traverseTree.js +1 -1
  11. package/emotion/cjs/examples/components/Combobox/Combobox.js +0 -15
  12. package/emotion/es/components/Combobox/ComboboxNew/Combobox.js +5 -2
  13. package/emotion/es/components/Select/ui/Target/ui/Textfield/Textfield.js +5 -2
  14. package/emotion/es/components/Tree/utils/index.js +0 -1
  15. package/emotion/es/components/Tree/utils/traverseTree.js +1 -1
  16. package/emotion/es/examples/components/Combobox/Combobox.js +0 -7
  17. package/es/components/Combobox/ComboboxNew/Combobox.js +5 -2
  18. package/es/components/Combobox/ComboboxNew/Combobox.js.map +1 -1
  19. package/es/components/Select/ui/Target/ui/Textfield/Textfield.js +5 -2
  20. package/es/components/Select/ui/Target/ui/Textfield/Textfield.js.map +1 -1
  21. package/es/components/Tree/utils/traverseTree.js +1 -1
  22. package/es/components/Tree/utils/traverseTree.js.map +1 -1
  23. package/package.json +2 -2
  24. package/styled-components/cjs/components/Combobox/ComboboxNew/Combobox.js +5 -2
  25. package/styled-components/cjs/components/Select/ui/Target/ui/Textfield/Textfield.js +5 -2
  26. package/styled-components/cjs/components/Tree/utils/index.js +0 -4
  27. package/styled-components/cjs/components/Tree/utils/traverseTree.js +1 -1
  28. package/styled-components/es/components/Combobox/ComboboxNew/Combobox.js +5 -2
  29. package/styled-components/es/components/Select/ui/Target/ui/Textfield/Textfield.js +5 -2
  30. package/styled-components/es/components/Tree/utils/index.js +0 -1
  31. package/styled-components/es/components/Tree/utils/traverseTree.js +1 -1
  32. package/types/components/Combobox/ComboboxNew/Combobox.d.ts.map +1 -1
  33. package/types/components/Select/ui/Target/ui/Textfield/Textfield.d.ts.map +1 -1
  34. package/types/components/Tree/utils/index.d.ts +0 -1
  35. package/types/components/Tree/utils/index.d.ts.map +1 -1
  36. package/cjs/components/Tree/utils/deepCopy.js +0 -29
  37. package/cjs/components/Tree/utils/deepCopy.js.map +0 -1
  38. package/emotion/cjs/components/Tree/utils/deepCopy.js +0 -83
  39. package/emotion/es/components/Tree/utils/deepCopy.js +0 -73
  40. package/es/components/Tree/utils/deepCopy.js +0 -25
  41. package/es/components/Tree/utils/deepCopy.js.map +0 -1
  42. package/styled-components/cjs/components/Tree/utils/deepCopy.js +0 -83
  43. package/styled-components/es/components/Tree/utils/deepCopy.js +0 -73
  44. package/types/components/Tree/utils/deepCopy.d.ts +0 -6
  45. package/types/components/Tree/utils/deepCopy.d.ts.map +0 -1
@@ -1,83 +0,0 @@
1
- /**
2
- * Функция глубокого копирования дерева элементов.
3
- * Копируются лишь объекты из массива children.
4
- */ "use strict";
5
- Object.defineProperty(exports, "__esModule", {
6
- value: true
7
- });
8
- Object.defineProperty(exports, "deepCopy", {
9
- enumerable: true,
10
- get: function() {
11
- return deepCopy;
12
- }
13
- });
14
- function _array_like_to_array(arr, len) {
15
- if (len == null || len > arr.length) len = arr.length;
16
- for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
17
- return arr2;
18
- }
19
- function _array_with_holes(arr) {
20
- if (Array.isArray(arr)) return arr;
21
- }
22
- function _iterable_to_array_limit(arr, i) {
23
- var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
24
- if (_i == null) return;
25
- var _arr = [];
26
- var _n = true;
27
- var _d = false;
28
- var _s, _e;
29
- try {
30
- for(_i = _i.call(arr); !(_n = (_s = _i.next()).done); _n = true){
31
- _arr.push(_s.value);
32
- if (i && _arr.length === i) break;
33
- }
34
- } catch (err) {
35
- _d = true;
36
- _e = err;
37
- } finally{
38
- try {
39
- if (!_n && _i["return"] != null) _i["return"]();
40
- } finally{
41
- if (_d) throw _e;
42
- }
43
- }
44
- return _arr;
45
- }
46
- function _non_iterable_rest() {
47
- throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
48
- }
49
- function _sliced_to_array(arr, i) {
50
- return _array_with_holes(arr) || _iterable_to_array_limit(arr, i) || _unsupported_iterable_to_array(arr, i) || _non_iterable_rest();
51
- }
52
- function _type_of(obj) {
53
- "@swc/helpers - typeof";
54
- return obj && typeof Symbol !== "undefined" && obj.constructor === Symbol ? "symbol" : typeof obj;
55
- }
56
- function _unsupported_iterable_to_array(o, minLen) {
57
- if (!o) return;
58
- if (typeof o === "string") return _array_like_to_array(o, minLen);
59
- var n = Object.prototype.toString.call(o).slice(8, -1);
60
- if (n === "Object" && o.constructor) n = o.constructor.name;
61
- if (n === "Map" || n === "Set") return Array.from(n);
62
- if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array(o, minLen);
63
- }
64
- var deepCopy = function(obj) {
65
- if (obj === null || (typeof obj === "undefined" ? "undefined" : _type_of(obj)) !== 'object') {
66
- return obj;
67
- }
68
- if (Array.isArray(obj)) {
69
- return obj.map(function(item) {
70
- return deepCopy(item);
71
- });
72
- }
73
- return Object.fromEntries(Object.entries(obj).map(function(param) {
74
- var _param = _sliced_to_array(param, 2), key = _param[0], value = _param[1];
75
- return key === 'children' ? [
76
- key,
77
- deepCopy(value)
78
- ] : [
79
- key,
80
- value
81
- ];
82
- }));
83
- };
@@ -1,73 +0,0 @@
1
- /**
2
- * Функция глубокого копирования дерева элементов.
3
- * Копируются лишь объекты из массива children.
4
- */ function _array_like_to_array(arr, len) {
5
- if (len == null || len > arr.length) len = arr.length;
6
- for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
7
- return arr2;
8
- }
9
- function _array_with_holes(arr) {
10
- if (Array.isArray(arr)) return arr;
11
- }
12
- function _iterable_to_array_limit(arr, i) {
13
- var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
14
- if (_i == null) return;
15
- var _arr = [];
16
- var _n = true;
17
- var _d = false;
18
- var _s, _e;
19
- try {
20
- for(_i = _i.call(arr); !(_n = (_s = _i.next()).done); _n = true){
21
- _arr.push(_s.value);
22
- if (i && _arr.length === i) break;
23
- }
24
- } catch (err) {
25
- _d = true;
26
- _e = err;
27
- } finally{
28
- try {
29
- if (!_n && _i["return"] != null) _i["return"]();
30
- } finally{
31
- if (_d) throw _e;
32
- }
33
- }
34
- return _arr;
35
- }
36
- function _non_iterable_rest() {
37
- throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
38
- }
39
- function _sliced_to_array(arr, i) {
40
- return _array_with_holes(arr) || _iterable_to_array_limit(arr, i) || _unsupported_iterable_to_array(arr, i) || _non_iterable_rest();
41
- }
42
- function _type_of(obj) {
43
- "@swc/helpers - typeof";
44
- return obj && typeof Symbol !== "undefined" && obj.constructor === Symbol ? "symbol" : typeof obj;
45
- }
46
- function _unsupported_iterable_to_array(o, minLen) {
47
- if (!o) return;
48
- if (typeof o === "string") return _array_like_to_array(o, minLen);
49
- var n = Object.prototype.toString.call(o).slice(8, -1);
50
- if (n === "Object" && o.constructor) n = o.constructor.name;
51
- if (n === "Map" || n === "Set") return Array.from(n);
52
- if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array(o, minLen);
53
- }
54
- export var deepCopy = function(obj) {
55
- if (obj === null || (typeof obj === "undefined" ? "undefined" : _type_of(obj)) !== 'object') {
56
- return obj;
57
- }
58
- if (Array.isArray(obj)) {
59
- return obj.map(function(item) {
60
- return deepCopy(item);
61
- });
62
- }
63
- return Object.fromEntries(Object.entries(obj).map(function(param) {
64
- var _param = _sliced_to_array(param, 2), key = _param[0], value = _param[1];
65
- return key === 'children' ? [
66
- key,
67
- deepCopy(value)
68
- ] : [
69
- key,
70
- value
71
- ];
72
- }));
73
- };
@@ -1,25 +0,0 @@
1
- import { typeof as _typeof, slicedToArray as _slicedToArray } from '../../../_virtual/_rollupPluginBabelHelpers.js';
2
-
3
- /**
4
- * Функция глубокого копирования дерева элементов.
5
- * Копируются лишь объекты из массива children.
6
- */
7
- var deepCopy = function deepCopy(obj) {
8
- if (obj === null || _typeof(obj) !== 'object') {
9
- return obj;
10
- }
11
- if (Array.isArray(obj)) {
12
- return obj.map(function (item) {
13
- return deepCopy(item);
14
- });
15
- }
16
- return Object.fromEntries(Object.entries(obj).map(function (_ref) {
17
- var _ref2 = _slicedToArray(_ref, 2),
18
- key = _ref2[0],
19
- value = _ref2[1];
20
- return key === 'children' ? [key, deepCopy(value)] : [key, value];
21
- }));
22
- };
23
-
24
- export { deepCopy };
25
- //# sourceMappingURL=deepCopy.js.map
@@ -1 +0,0 @@
1
- {"version":3,"file":"deepCopy.js","sources":["../../../../src/components/Tree/utils/deepCopy.ts"],"sourcesContent":["/**\n * Функция глубокого копирования дерева элементов.\n * Копируются лишь объекты из массива children.\n */\nexport const deepCopy = <T>(obj: T): T => {\n if (obj === null || typeof obj !== 'object') {\n return obj;\n }\n\n if (Array.isArray(obj)) {\n return (obj.map((item) => deepCopy(item)) as unknown) as T;\n }\n\n return Object.fromEntries(\n Object.entries(obj).map(([key, value]) => (key === 'children' ? [key, deepCopy(value)] : [key, value])),\n ) as T;\n};\n"],"names":["deepCopy","obj","_typeof","Array","isArray","map","item","Object","fromEntries","entries","_ref","_ref2","_slicedToArray","key","value"],"mappings":";;AAAA;AACA;AACA;AACA;IACaA,QAAQ,GAAG,SAAXA,QAAQA,CAAOC,GAAM,EAAQ;EACtC,IAAIA,GAAG,KAAK,IAAI,IAAIC,OAAA,CAAOD,GAAG,CAAK,KAAA,QAAQ,EAAE;AACzC,IAAA,OAAOA,GAAG,CAAA;AACd,GAAA;AAEA,EAAA,IAAIE,KAAK,CAACC,OAAO,CAACH,GAAG,CAAC,EAAE;AACpB,IAAA,OAAQA,GAAG,CAACI,GAAG,CAAC,UAACC,IAAI,EAAA;MAAA,OAAKN,QAAQ,CAACM,IAAI,CAAC,CAAA;KAAC,CAAA,CAAA;AAC7C,GAAA;AAEA,EAAA,OAAOC,MAAM,CAACC,WAAW,CACrBD,MAAM,CAACE,OAAO,CAACR,GAAG,CAAC,CAACI,GAAG,CAAC,UAAAK,IAAA,EAAA;AAAA,IAAA,IAAAC,KAAA,GAAAC,cAAA,CAAAF,IAAA,EAAA,CAAA,CAAA;AAAEG,MAAAA,GAAG,GAAAF,KAAA,CAAA,CAAA,CAAA;AAAEG,MAAAA,KAAK,GAAAH,KAAA,CAAA,CAAA,CAAA,CAAA;AAAA,IAAA,OAAOE,GAAG,KAAK,UAAU,GAAG,CAACA,GAAG,EAAEb,QAAQ,CAACc,KAAK,CAAC,CAAC,GAAG,CAACD,GAAG,EAAEC,KAAK,CAAC,CAAA;AAAA,GAAC,CAC1G,CAAC,CAAA;AACL;;;;"}
@@ -1,83 +0,0 @@
1
- /**
2
- * Функция глубокого копирования дерева элементов.
3
- * Копируются лишь объекты из массива children.
4
- */ "use strict";
5
- Object.defineProperty(exports, "__esModule", {
6
- value: true
7
- });
8
- Object.defineProperty(exports, "deepCopy", {
9
- enumerable: true,
10
- get: function() {
11
- return deepCopy;
12
- }
13
- });
14
- function _array_like_to_array(arr, len) {
15
- if (len == null || len > arr.length) len = arr.length;
16
- for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
17
- return arr2;
18
- }
19
- function _array_with_holes(arr) {
20
- if (Array.isArray(arr)) return arr;
21
- }
22
- function _iterable_to_array_limit(arr, i) {
23
- var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
24
- if (_i == null) return;
25
- var _arr = [];
26
- var _n = true;
27
- var _d = false;
28
- var _s, _e;
29
- try {
30
- for(_i = _i.call(arr); !(_n = (_s = _i.next()).done); _n = true){
31
- _arr.push(_s.value);
32
- if (i && _arr.length === i) break;
33
- }
34
- } catch (err) {
35
- _d = true;
36
- _e = err;
37
- } finally{
38
- try {
39
- if (!_n && _i["return"] != null) _i["return"]();
40
- } finally{
41
- if (_d) throw _e;
42
- }
43
- }
44
- return _arr;
45
- }
46
- function _non_iterable_rest() {
47
- throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
48
- }
49
- function _sliced_to_array(arr, i) {
50
- return _array_with_holes(arr) || _iterable_to_array_limit(arr, i) || _unsupported_iterable_to_array(arr, i) || _non_iterable_rest();
51
- }
52
- function _type_of(obj) {
53
- "@swc/helpers - typeof";
54
- return obj && typeof Symbol !== "undefined" && obj.constructor === Symbol ? "symbol" : typeof obj;
55
- }
56
- function _unsupported_iterable_to_array(o, minLen) {
57
- if (!o) return;
58
- if (typeof o === "string") return _array_like_to_array(o, minLen);
59
- var n = Object.prototype.toString.call(o).slice(8, -1);
60
- if (n === "Object" && o.constructor) n = o.constructor.name;
61
- if (n === "Map" || n === "Set") return Array.from(n);
62
- if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array(o, minLen);
63
- }
64
- var deepCopy = function(obj) {
65
- if (obj === null || (typeof obj === "undefined" ? "undefined" : _type_of(obj)) !== 'object') {
66
- return obj;
67
- }
68
- if (Array.isArray(obj)) {
69
- return obj.map(function(item) {
70
- return deepCopy(item);
71
- });
72
- }
73
- return Object.fromEntries(Object.entries(obj).map(function(param) {
74
- var _param = _sliced_to_array(param, 2), key = _param[0], value = _param[1];
75
- return key === 'children' ? [
76
- key,
77
- deepCopy(value)
78
- ] : [
79
- key,
80
- value
81
- ];
82
- }));
83
- };
@@ -1,73 +0,0 @@
1
- /**
2
- * Функция глубокого копирования дерева элементов.
3
- * Копируются лишь объекты из массива children.
4
- */ function _array_like_to_array(arr, len) {
5
- if (len == null || len > arr.length) len = arr.length;
6
- for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
7
- return arr2;
8
- }
9
- function _array_with_holes(arr) {
10
- if (Array.isArray(arr)) return arr;
11
- }
12
- function _iterable_to_array_limit(arr, i) {
13
- var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"];
14
- if (_i == null) return;
15
- var _arr = [];
16
- var _n = true;
17
- var _d = false;
18
- var _s, _e;
19
- try {
20
- for(_i = _i.call(arr); !(_n = (_s = _i.next()).done); _n = true){
21
- _arr.push(_s.value);
22
- if (i && _arr.length === i) break;
23
- }
24
- } catch (err) {
25
- _d = true;
26
- _e = err;
27
- } finally{
28
- try {
29
- if (!_n && _i["return"] != null) _i["return"]();
30
- } finally{
31
- if (_d) throw _e;
32
- }
33
- }
34
- return _arr;
35
- }
36
- function _non_iterable_rest() {
37
- throw new TypeError("Invalid attempt to destructure non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
38
- }
39
- function _sliced_to_array(arr, i) {
40
- return _array_with_holes(arr) || _iterable_to_array_limit(arr, i) || _unsupported_iterable_to_array(arr, i) || _non_iterable_rest();
41
- }
42
- function _type_of(obj) {
43
- "@swc/helpers - typeof";
44
- return obj && typeof Symbol !== "undefined" && obj.constructor === Symbol ? "symbol" : typeof obj;
45
- }
46
- function _unsupported_iterable_to_array(o, minLen) {
47
- if (!o) return;
48
- if (typeof o === "string") return _array_like_to_array(o, minLen);
49
- var n = Object.prototype.toString.call(o).slice(8, -1);
50
- if (n === "Object" && o.constructor) n = o.constructor.name;
51
- if (n === "Map" || n === "Set") return Array.from(n);
52
- if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array(o, minLen);
53
- }
54
- export var deepCopy = function(obj) {
55
- if (obj === null || (typeof obj === "undefined" ? "undefined" : _type_of(obj)) !== 'object') {
56
- return obj;
57
- }
58
- if (Array.isArray(obj)) {
59
- return obj.map(function(item) {
60
- return deepCopy(item);
61
- });
62
- }
63
- return Object.fromEntries(Object.entries(obj).map(function(param) {
64
- var _param = _sliced_to_array(param, 2), key = _param[0], value = _param[1];
65
- return key === 'children' ? [
66
- key,
67
- deepCopy(value)
68
- ] : [
69
- key,
70
- value
71
- ];
72
- }));
73
- };
@@ -1,6 +0,0 @@
1
- /**
2
- * Функция глубокого копирования дерева элементов.
3
- * Копируются лишь объекты из массива children.
4
- */
5
- export declare const deepCopy: <T>(obj: T) => T;
6
- //# sourceMappingURL=deepCopy.d.ts.map
@@ -1 +0,0 @@
1
- {"version":3,"file":"deepCopy.d.ts","sourceRoot":"","sources":["../../../../src/components/Tree/utils/deepCopy.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,eAAO,MAAM,QAAQ,GAAI,CAAC,OAAO,CAAC,KAAG,CAYpC,CAAC"}