bfg-common 1.4.199 → 1.4.200
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.
- package/assets/img/icons/icons-sprite-dark-1.svg +407 -407
- package/assets/img/icons/icons-sprite-dark-2.svg +343 -343
- package/assets/img/icons/icons-sprite-dark-3.svg +227 -227
- package/assets/img/icons/icons-sprite-dark-4.svg +255 -255
- package/assets/img/icons/icons-sprite-dark-5.svg +488 -488
- package/assets/img/icons/icons-sprite-dark-6.svg +83 -83
- package/assets/img/icons/icons-sprite-light-1.svg +407 -407
- package/assets/img/icons/icons-sprite-light-2.svg +343 -343
- package/assets/img/icons/icons-sprite-light-3.svg +227 -227
- package/assets/img/icons/icons-sprite-light-4.svg +255 -255
- package/assets/img/icons/icons-sprite-light-5.svg +488 -488
- package/assets/img/icons/icons-sprite-light-6.svg +83 -83
- package/assets/localization/local_be.json +10 -1
- package/assets/localization/local_en.json +10 -1
- package/assets/localization/local_hy.json +10 -1
- package/assets/localization/local_kk.json +10 -1
- package/assets/localization/local_ru.json +10 -1
- package/assets/localization/local_zh.json +10 -1
- package/components/atoms/modal/bySteps/BySteps.vue +253 -253
- package/components/atoms/stack/StackBlock.vue +185 -185
- package/components/common/browse/blocks/Title.vue +91 -91
- package/components/common/browse/blocks/info/Date.vue +21 -21
- package/components/common/context/lib/models/interfaces.ts +30 -30
- package/components/common/context/recursion/Recursion.vue +86 -86
- package/components/common/context/recursion/RecursionNew.vue +199 -199
- package/components/common/context/recursion/RecursionOld.vue +213 -213
- package/components/common/diagramMain/lib/utils/utils.ts +331 -331
- package/components/common/vm/actions/add/Add.vue +609 -609
- package/components/common/vm/actions/clone/Clone.vue +522 -522
- package/components/common/vm/actions/common/customizeHardware/virtualHardware/bus/lib/config/options.ts +20 -20
- package/components/common/vm/actions/common/customizeHardware/virtualHardware/cpu/Cpu.vue +403 -403
- package/components/common/vm/actions/common/customizeHardware/virtualHardware/cpu/Hv.vue +99 -99
- package/components/common/vm/actions/common/customizeHardware/vmoptions/bootOptions/order/Order.vue +201 -201
- package/components/common/vm/actions/common/customizeHardware/vmoptions/remoteConsoleOptions/streamingMode/StreamingMode.vue +85 -85
- package/components/common/wizards/network/add/lib/config/steps.ts +464 -464
- package/composables/productNameLocal.ts +30 -30
- package/package.json +1 -1
- package/plugins/recursion.ts +311 -311
- package/public/spice-console/lib/images/bitmap.js +203 -203
- package/store/tasks/mappers/recentTasks.ts +45 -45
|
@@ -1,30 +1,30 @@
|
|
|
1
|
-
import type { UI_I_Localization } from '~/lib/models/interfaces'
|
|
2
|
-
import type { UI_T_LanguageKey } from '~/lib/models/types'
|
|
3
|
-
|
|
4
|
-
export function productNameLocal(
|
|
5
|
-
localization: UI_I_Localization
|
|
6
|
-
): UI_I_Localization {
|
|
7
|
-
const config = useRuntimeConfig()
|
|
8
|
-
|
|
9
|
-
const productName =
|
|
10
|
-
config.public.LOCALIZATION_CODE === 'ru'
|
|
11
|
-
? config.public.PRODUCT_NAME_RU
|
|
12
|
-
: config.public.PRODUCT_NAME_EN
|
|
13
|
-
|
|
14
|
-
return replaceProductNameRecursion(localization, productName)
|
|
15
|
-
}
|
|
16
|
-
|
|
17
|
-
const replaceProductNameRecursion = (
|
|
18
|
-
localization: UI_I_Localization,
|
|
19
|
-
productName: any
|
|
20
|
-
): UI_I_Localization => {
|
|
21
|
-
for (const key of Object.keys(localization)) {
|
|
22
|
-
let item = localization[key as UI_T_LanguageKey]
|
|
23
|
-
|
|
24
|
-
for (const key2 of Object.keys(item)) {
|
|
25
|
-
item[key2] = item[key2].replaceAll('{productName}', productName)
|
|
26
|
-
}
|
|
27
|
-
}
|
|
28
|
-
|
|
29
|
-
return localization
|
|
30
|
-
}
|
|
1
|
+
import type { UI_I_Localization } from '~/lib/models/interfaces'
|
|
2
|
+
import type { UI_T_LanguageKey } from '~/lib/models/types'
|
|
3
|
+
|
|
4
|
+
export function productNameLocal(
|
|
5
|
+
localization: UI_I_Localization
|
|
6
|
+
): UI_I_Localization {
|
|
7
|
+
const config = useRuntimeConfig()
|
|
8
|
+
|
|
9
|
+
const productName =
|
|
10
|
+
config.public.LOCALIZATION_CODE === 'ru'
|
|
11
|
+
? config.public.PRODUCT_NAME_RU
|
|
12
|
+
: config.public.PRODUCT_NAME_EN
|
|
13
|
+
|
|
14
|
+
return replaceProductNameRecursion(localization, productName)
|
|
15
|
+
}
|
|
16
|
+
|
|
17
|
+
const replaceProductNameRecursion = (
|
|
18
|
+
localization: UI_I_Localization,
|
|
19
|
+
productName: any
|
|
20
|
+
): UI_I_Localization => {
|
|
21
|
+
for (const key of Object.keys(localization)) {
|
|
22
|
+
let item = localization[key as UI_T_LanguageKey]
|
|
23
|
+
|
|
24
|
+
for (const key2 of Object.keys(item)) {
|
|
25
|
+
item[key2] = item[key2].replaceAll('{productName}', productName)
|
|
26
|
+
}
|
|
27
|
+
}
|
|
28
|
+
|
|
29
|
+
return localization
|
|
30
|
+
}
|
package/package.json
CHANGED
package/plugins/recursion.ts
CHANGED
|
@@ -1,311 +1,311 @@
|
|
|
1
|
-
export default defineNuxtPlugin(() => {
|
|
2
|
-
const recursion = function () {
|
|
3
|
-
const self: any = {}
|
|
4
|
-
|
|
5
|
-
self.find = function (
|
|
6
|
-
arr: any[],
|
|
7
|
-
value: any,
|
|
8
|
-
valueProp: string,
|
|
9
|
-
itemsProp: string
|
|
10
|
-
) {
|
|
11
|
-
let result = null
|
|
12
|
-
if (!arr) {
|
|
13
|
-
return result
|
|
14
|
-
}
|
|
15
|
-
|
|
16
|
-
for (let i = 0; i < arr.length; i++) {
|
|
17
|
-
const item = arr[i]
|
|
18
|
-
if (item[valueProp] === value) {
|
|
19
|
-
result = item
|
|
20
|
-
break
|
|
21
|
-
}
|
|
22
|
-
if (item[itemsProp].length) {
|
|
23
|
-
result = self.find(item.nodes, value, valueProp, itemsProp)
|
|
24
|
-
if (result) {
|
|
25
|
-
break
|
|
26
|
-
}
|
|
27
|
-
}
|
|
28
|
-
}
|
|
29
|
-
return result
|
|
30
|
-
}
|
|
31
|
-
self.findParentNodeByType = function (
|
|
32
|
-
node: any,
|
|
33
|
-
types: string[],
|
|
34
|
-
valueProp: string,
|
|
35
|
-
parentProp: string
|
|
36
|
-
) {
|
|
37
|
-
if (!node[parentProp] || types.includes(node[valueProp])) {
|
|
38
|
-
return node
|
|
39
|
-
}
|
|
40
|
-
|
|
41
|
-
if (types.includes(node[parentProp][valueProp])) {
|
|
42
|
-
return node[parentProp]
|
|
43
|
-
}
|
|
44
|
-
|
|
45
|
-
return self.findParentNodeByType(
|
|
46
|
-
node[parentProp],
|
|
47
|
-
types,
|
|
48
|
-
valueProp,
|
|
49
|
-
parentProp
|
|
50
|
-
)
|
|
51
|
-
}
|
|
52
|
-
|
|
53
|
-
self.findAndShow = function (
|
|
54
|
-
arr: any[],
|
|
55
|
-
values: any[],
|
|
56
|
-
valueProps: string[],
|
|
57
|
-
itemsProp: string
|
|
58
|
-
): boolean {
|
|
59
|
-
if (!arr) return false
|
|
60
|
-
let res = false
|
|
61
|
-
|
|
62
|
-
for (let i = 0; i < arr.length; i++) {
|
|
63
|
-
const item: any = arr[i]
|
|
64
|
-
|
|
65
|
-
const isFind = values.every(
|
|
66
|
-
(value, index) => value === item[valueProps[index]]
|
|
67
|
-
)
|
|
68
|
-
if (isFind) {
|
|
69
|
-
item.nodesShow = !item.nodesShow // TODO сейчас хардом написано nodesShow, нужно сделать динамически
|
|
70
|
-
res = true
|
|
71
|
-
break
|
|
72
|
-
}
|
|
73
|
-
|
|
74
|
-
if (item[itemsProp]?.length) {
|
|
75
|
-
self.findAndShow(item.nodes, values, valueProps, itemsProp)
|
|
76
|
-
}
|
|
77
|
-
}
|
|
78
|
-
return res
|
|
79
|
-
}
|
|
80
|
-
|
|
81
|
-
self.toggleAll = function (
|
|
82
|
-
arr: any[],
|
|
83
|
-
valueProp: string,
|
|
84
|
-
itemsProp: string,
|
|
85
|
-
isShow: boolean
|
|
86
|
-
): void {
|
|
87
|
-
if (!arr) return
|
|
88
|
-
|
|
89
|
-
for (let i = 0; i < arr.length; i++) {
|
|
90
|
-
const item: any = arr[i]
|
|
91
|
-
|
|
92
|
-
item[valueProp] = isShow
|
|
93
|
-
|
|
94
|
-
if (item[itemsProp]?.length) {
|
|
95
|
-
self.toggleAll(item.nodes, valueProp, itemsProp, isShow)
|
|
96
|
-
}
|
|
97
|
-
}
|
|
98
|
-
}
|
|
99
|
-
|
|
100
|
-
self.findAndRemove = function (
|
|
101
|
-
arr: any[],
|
|
102
|
-
values: any[],
|
|
103
|
-
valueProps: string[],
|
|
104
|
-
itemsProp: string
|
|
105
|
-
): boolean {
|
|
106
|
-
if (!arr) return false
|
|
107
|
-
let res = false
|
|
108
|
-
|
|
109
|
-
for (let i = 0; i < arr.length; i++) {
|
|
110
|
-
const item: any = arr[i]
|
|
111
|
-
|
|
112
|
-
const isFind = values.some(
|
|
113
|
-
(value, index) => value === item[valueProps[index]]
|
|
114
|
-
)
|
|
115
|
-
if (isFind) {
|
|
116
|
-
arr.splice(i, 1)
|
|
117
|
-
i--
|
|
118
|
-
res = true
|
|
119
|
-
}
|
|
120
|
-
|
|
121
|
-
if (item[itemsProp]?.length) {
|
|
122
|
-
self.findAndRemove(item[itemsProp], values, valueProps, itemsProp)
|
|
123
|
-
}
|
|
124
|
-
}
|
|
125
|
-
return res
|
|
126
|
-
}
|
|
127
|
-
self.findAndMove = function (
|
|
128
|
-
arr: any[],
|
|
129
|
-
values: any[],
|
|
130
|
-
valueProps: string[],
|
|
131
|
-
itemsProp: string,
|
|
132
|
-
moveArr: any,
|
|
133
|
-
findIndex: string
|
|
134
|
-
) {
|
|
135
|
-
let result = null
|
|
136
|
-
if (!arr) return result
|
|
137
|
-
|
|
138
|
-
for (let i = 0; i < arr.length; i++) {
|
|
139
|
-
const item: any = arr[i]
|
|
140
|
-
|
|
141
|
-
const isFind = values.every(
|
|
142
|
-
(value, index) => value === item[valueProps[index]]
|
|
143
|
-
)
|
|
144
|
-
|
|
145
|
-
if (isFind) {
|
|
146
|
-
// Remove from the original position
|
|
147
|
-
const moveItem = arr.splice(i, 1)[0]
|
|
148
|
-
const index = moveArr[itemsProp].findLastIndex(
|
|
149
|
-
(x) => x.type === findIndex
|
|
150
|
-
)
|
|
151
|
-
moveArr[itemsProp].splice(index + 1, 0, moveItem)
|
|
152
|
-
|
|
153
|
-
result = moveItem
|
|
154
|
-
break
|
|
155
|
-
}
|
|
156
|
-
|
|
157
|
-
if (item[itemsProp]?.length) {
|
|
158
|
-
result = self.findAndMove(
|
|
159
|
-
item[itemsProp],
|
|
160
|
-
values,
|
|
161
|
-
valueProps,
|
|
162
|
-
itemsProp,
|
|
163
|
-
moveArr,
|
|
164
|
-
findIndex
|
|
165
|
-
)
|
|
166
|
-
if (result) break
|
|
167
|
-
}
|
|
168
|
-
}
|
|
169
|
-
return result
|
|
170
|
-
}
|
|
171
|
-
|
|
172
|
-
self.findAndActivate = function (
|
|
173
|
-
arr: any[],
|
|
174
|
-
values: any[],
|
|
175
|
-
valueProps: string[],
|
|
176
|
-
itemsProp: string
|
|
177
|
-
): boolean {
|
|
178
|
-
if (!arr) return false
|
|
179
|
-
let res = false
|
|
180
|
-
|
|
181
|
-
for (let i = 0; i < arr.length; i++) {
|
|
182
|
-
const item = arr[i]
|
|
183
|
-
const isActive = values.every(
|
|
184
|
-
(value, index) => value === item[valueProps[index]]
|
|
185
|
-
)
|
|
186
|
-
item.isActive = isActive
|
|
187
|
-
if (isActive) {
|
|
188
|
-
res = true
|
|
189
|
-
}
|
|
190
|
-
|
|
191
|
-
if (item[itemsProp]?.length) {
|
|
192
|
-
const isFindInChild = self.findAndActivate(
|
|
193
|
-
item.nodes,
|
|
194
|
-
values,
|
|
195
|
-
valueProps,
|
|
196
|
-
itemsProp
|
|
197
|
-
)
|
|
198
|
-
if (!res) res = isFindInChild
|
|
199
|
-
}
|
|
200
|
-
}
|
|
201
|
-
return res
|
|
202
|
-
}
|
|
203
|
-
|
|
204
|
-
// TODO изменить nodes и сделать динамичной
|
|
205
|
-
self.filtrationTreeByExpectedTypeRecursion = (
|
|
206
|
-
node: any,
|
|
207
|
-
expectedType: string | string[]
|
|
208
|
-
): any[] | null | any => {
|
|
209
|
-
if (!node.nodes.length) return { ...node }
|
|
210
|
-
|
|
211
|
-
const result = []
|
|
212
|
-
|
|
213
|
-
for (let i = 0; i < node.nodes.length; i++) {
|
|
214
|
-
const item = { ...node.nodes[i] }
|
|
215
|
-
|
|
216
|
-
// Проверка, является ли тип ожидаемым типом или массивом ожидаемых типов
|
|
217
|
-
if (
|
|
218
|
-
(typeof expectedType === 'string' && item.type === expectedType) ||
|
|
219
|
-
(Array.isArray(expectedType) && expectedType.includes(item.type))
|
|
220
|
-
) {
|
|
221
|
-
result.push(
|
|
222
|
-
self.filtrationTreeByExpectedTypeRecursion(item, expectedType)
|
|
223
|
-
)
|
|
224
|
-
} else {
|
|
225
|
-
item.nodes = []
|
|
226
|
-
}
|
|
227
|
-
}
|
|
228
|
-
node.nodes = result
|
|
229
|
-
return { ...node }
|
|
230
|
-
}
|
|
231
|
-
|
|
232
|
-
self.createAbsolutePathRecursion = (
|
|
233
|
-
node: any,
|
|
234
|
-
valueProp: string,
|
|
235
|
-
parentProp: string
|
|
236
|
-
): string => {
|
|
237
|
-
if (!node) return ''
|
|
238
|
-
|
|
239
|
-
const parentPath = self.createAbsolutePathRecursion(
|
|
240
|
-
node[parentProp],
|
|
241
|
-
valueProp,
|
|
242
|
-
parentProp
|
|
243
|
-
)
|
|
244
|
-
return (parentPath ? `${parentPath}/` : '') + node[valueProp]
|
|
245
|
-
}
|
|
246
|
-
|
|
247
|
-
self.findParentByValue = (
|
|
248
|
-
node: any,
|
|
249
|
-
value: any,
|
|
250
|
-
valueProp: string,
|
|
251
|
-
parentProp: string
|
|
252
|
-
): any | null => {
|
|
253
|
-
if (!node) return null
|
|
254
|
-
|
|
255
|
-
if (node[valueProp] === value) return node
|
|
256
|
-
const parent = node[parentProp]
|
|
257
|
-
if (parent)
|
|
258
|
-
return self.findParentByValue(parent, value, valueProp, parentProp)
|
|
259
|
-
|
|
260
|
-
return null
|
|
261
|
-
}
|
|
262
|
-
|
|
263
|
-
self.sortByProp = function (
|
|
264
|
-
arr: any[],
|
|
265
|
-
prop: string,
|
|
266
|
-
up: boolean,
|
|
267
|
-
itemsProp: string
|
|
268
|
-
): void {
|
|
269
|
-
const value: 1 | -1 = up ? 1 : -1
|
|
270
|
-
arr.sort((a, b) => {
|
|
271
|
-
const first = a[prop].toLowerCase()
|
|
272
|
-
const second = b[prop].toLowerCase()
|
|
273
|
-
return first < second ? value : first > second ? -value : 0
|
|
274
|
-
})
|
|
275
|
-
|
|
276
|
-
for (let i = 0; i < arr.length; i++) {
|
|
277
|
-
const item: any = arr[i]
|
|
278
|
-
|
|
279
|
-
if (item[itemsProp]?.length) {
|
|
280
|
-
self.sortByProp(item[itemsProp], prop, up, itemsProp)
|
|
281
|
-
}
|
|
282
|
-
}
|
|
283
|
-
}
|
|
284
|
-
|
|
285
|
-
self.calcCount = function (
|
|
286
|
-
arr: any[],
|
|
287
|
-
itemsProp: string
|
|
288
|
-
): number {
|
|
289
|
-
if (!arr) return 0
|
|
290
|
-
let res = 0
|
|
291
|
-
|
|
292
|
-
for (let i = 0; i < arr.length; i++) {
|
|
293
|
-
const item: any = arr[i]
|
|
294
|
-
res++
|
|
295
|
-
|
|
296
|
-
if (item[itemsProp]?.length) {
|
|
297
|
-
res += self.calcCount(item[itemsProp], itemsProp)
|
|
298
|
-
}
|
|
299
|
-
}
|
|
300
|
-
return res
|
|
301
|
-
}
|
|
302
|
-
|
|
303
|
-
return self
|
|
304
|
-
}.call({})
|
|
305
|
-
|
|
306
|
-
return {
|
|
307
|
-
provide: {
|
|
308
|
-
recursion,
|
|
309
|
-
},
|
|
310
|
-
}
|
|
311
|
-
})
|
|
1
|
+
export default defineNuxtPlugin(() => {
|
|
2
|
+
const recursion = function () {
|
|
3
|
+
const self: any = {}
|
|
4
|
+
|
|
5
|
+
self.find = function (
|
|
6
|
+
arr: any[],
|
|
7
|
+
value: any,
|
|
8
|
+
valueProp: string,
|
|
9
|
+
itemsProp: string
|
|
10
|
+
) {
|
|
11
|
+
let result = null
|
|
12
|
+
if (!arr) {
|
|
13
|
+
return result
|
|
14
|
+
}
|
|
15
|
+
|
|
16
|
+
for (let i = 0; i < arr.length; i++) {
|
|
17
|
+
const item = arr[i]
|
|
18
|
+
if (item[valueProp] === value) {
|
|
19
|
+
result = item
|
|
20
|
+
break
|
|
21
|
+
}
|
|
22
|
+
if (item[itemsProp].length) {
|
|
23
|
+
result = self.find(item.nodes, value, valueProp, itemsProp)
|
|
24
|
+
if (result) {
|
|
25
|
+
break
|
|
26
|
+
}
|
|
27
|
+
}
|
|
28
|
+
}
|
|
29
|
+
return result
|
|
30
|
+
}
|
|
31
|
+
self.findParentNodeByType = function (
|
|
32
|
+
node: any,
|
|
33
|
+
types: string[],
|
|
34
|
+
valueProp: string,
|
|
35
|
+
parentProp: string
|
|
36
|
+
) {
|
|
37
|
+
if (!node[parentProp] || types.includes(node[valueProp])) {
|
|
38
|
+
return node
|
|
39
|
+
}
|
|
40
|
+
|
|
41
|
+
if (types.includes(node[parentProp][valueProp])) {
|
|
42
|
+
return node[parentProp]
|
|
43
|
+
}
|
|
44
|
+
|
|
45
|
+
return self.findParentNodeByType(
|
|
46
|
+
node[parentProp],
|
|
47
|
+
types,
|
|
48
|
+
valueProp,
|
|
49
|
+
parentProp
|
|
50
|
+
)
|
|
51
|
+
}
|
|
52
|
+
|
|
53
|
+
self.findAndShow = function (
|
|
54
|
+
arr: any[],
|
|
55
|
+
values: any[],
|
|
56
|
+
valueProps: string[],
|
|
57
|
+
itemsProp: string
|
|
58
|
+
): boolean {
|
|
59
|
+
if (!arr) return false
|
|
60
|
+
let res = false
|
|
61
|
+
|
|
62
|
+
for (let i = 0; i < arr.length; i++) {
|
|
63
|
+
const item: any = arr[i]
|
|
64
|
+
|
|
65
|
+
const isFind = values.every(
|
|
66
|
+
(value, index) => value === item[valueProps[index]]
|
|
67
|
+
)
|
|
68
|
+
if (isFind) {
|
|
69
|
+
item.nodesShow = !item.nodesShow // TODO сейчас хардом написано nodesShow, нужно сделать динамически
|
|
70
|
+
res = true
|
|
71
|
+
break
|
|
72
|
+
}
|
|
73
|
+
|
|
74
|
+
if (item[itemsProp]?.length) {
|
|
75
|
+
self.findAndShow(item.nodes, values, valueProps, itemsProp)
|
|
76
|
+
}
|
|
77
|
+
}
|
|
78
|
+
return res
|
|
79
|
+
}
|
|
80
|
+
|
|
81
|
+
self.toggleAll = function (
|
|
82
|
+
arr: any[],
|
|
83
|
+
valueProp: string,
|
|
84
|
+
itemsProp: string,
|
|
85
|
+
isShow: boolean
|
|
86
|
+
): void {
|
|
87
|
+
if (!arr) return
|
|
88
|
+
|
|
89
|
+
for (let i = 0; i < arr.length; i++) {
|
|
90
|
+
const item: any = arr[i]
|
|
91
|
+
|
|
92
|
+
item[valueProp] = isShow
|
|
93
|
+
|
|
94
|
+
if (item[itemsProp]?.length) {
|
|
95
|
+
self.toggleAll(item.nodes, valueProp, itemsProp, isShow)
|
|
96
|
+
}
|
|
97
|
+
}
|
|
98
|
+
}
|
|
99
|
+
|
|
100
|
+
self.findAndRemove = function (
|
|
101
|
+
arr: any[],
|
|
102
|
+
values: any[],
|
|
103
|
+
valueProps: string[],
|
|
104
|
+
itemsProp: string
|
|
105
|
+
): boolean {
|
|
106
|
+
if (!arr) return false
|
|
107
|
+
let res = false
|
|
108
|
+
|
|
109
|
+
for (let i = 0; i < arr.length; i++) {
|
|
110
|
+
const item: any = arr[i]
|
|
111
|
+
|
|
112
|
+
const isFind = values.some(
|
|
113
|
+
(value, index) => value === item[valueProps[index]]
|
|
114
|
+
)
|
|
115
|
+
if (isFind) {
|
|
116
|
+
arr.splice(i, 1)
|
|
117
|
+
i--
|
|
118
|
+
res = true
|
|
119
|
+
}
|
|
120
|
+
|
|
121
|
+
if (item[itemsProp]?.length) {
|
|
122
|
+
self.findAndRemove(item[itemsProp], values, valueProps, itemsProp)
|
|
123
|
+
}
|
|
124
|
+
}
|
|
125
|
+
return res
|
|
126
|
+
}
|
|
127
|
+
self.findAndMove = function (
|
|
128
|
+
arr: any[],
|
|
129
|
+
values: any[],
|
|
130
|
+
valueProps: string[],
|
|
131
|
+
itemsProp: string,
|
|
132
|
+
moveArr: any,
|
|
133
|
+
findIndex: string
|
|
134
|
+
) {
|
|
135
|
+
let result = null
|
|
136
|
+
if (!arr) return result
|
|
137
|
+
|
|
138
|
+
for (let i = 0; i < arr.length; i++) {
|
|
139
|
+
const item: any = arr[i]
|
|
140
|
+
|
|
141
|
+
const isFind = values.every(
|
|
142
|
+
(value, index) => value === item[valueProps[index]]
|
|
143
|
+
)
|
|
144
|
+
|
|
145
|
+
if (isFind) {
|
|
146
|
+
// Remove from the original position
|
|
147
|
+
const moveItem = arr.splice(i, 1)[0]
|
|
148
|
+
const index = moveArr[itemsProp].findLastIndex(
|
|
149
|
+
(x) => x.type === findIndex
|
|
150
|
+
)
|
|
151
|
+
moveArr[itemsProp].splice(index + 1, 0, moveItem)
|
|
152
|
+
|
|
153
|
+
result = moveItem
|
|
154
|
+
break
|
|
155
|
+
}
|
|
156
|
+
|
|
157
|
+
if (item[itemsProp]?.length) {
|
|
158
|
+
result = self.findAndMove(
|
|
159
|
+
item[itemsProp],
|
|
160
|
+
values,
|
|
161
|
+
valueProps,
|
|
162
|
+
itemsProp,
|
|
163
|
+
moveArr,
|
|
164
|
+
findIndex
|
|
165
|
+
)
|
|
166
|
+
if (result) break
|
|
167
|
+
}
|
|
168
|
+
}
|
|
169
|
+
return result
|
|
170
|
+
}
|
|
171
|
+
|
|
172
|
+
self.findAndActivate = function (
|
|
173
|
+
arr: any[],
|
|
174
|
+
values: any[],
|
|
175
|
+
valueProps: string[],
|
|
176
|
+
itemsProp: string
|
|
177
|
+
): boolean {
|
|
178
|
+
if (!arr) return false
|
|
179
|
+
let res = false
|
|
180
|
+
|
|
181
|
+
for (let i = 0; i < arr.length; i++) {
|
|
182
|
+
const item = arr[i]
|
|
183
|
+
const isActive = values.every(
|
|
184
|
+
(value, index) => value === item[valueProps[index]]
|
|
185
|
+
)
|
|
186
|
+
item.isActive = isActive
|
|
187
|
+
if (isActive) {
|
|
188
|
+
res = true
|
|
189
|
+
}
|
|
190
|
+
|
|
191
|
+
if (item[itemsProp]?.length) {
|
|
192
|
+
const isFindInChild = self.findAndActivate(
|
|
193
|
+
item.nodes,
|
|
194
|
+
values,
|
|
195
|
+
valueProps,
|
|
196
|
+
itemsProp
|
|
197
|
+
)
|
|
198
|
+
if (!res) res = isFindInChild
|
|
199
|
+
}
|
|
200
|
+
}
|
|
201
|
+
return res
|
|
202
|
+
}
|
|
203
|
+
|
|
204
|
+
// TODO изменить nodes и сделать динамичной
|
|
205
|
+
self.filtrationTreeByExpectedTypeRecursion = (
|
|
206
|
+
node: any,
|
|
207
|
+
expectedType: string | string[]
|
|
208
|
+
): any[] | null | any => {
|
|
209
|
+
if (!node.nodes.length) return { ...node }
|
|
210
|
+
|
|
211
|
+
const result = []
|
|
212
|
+
|
|
213
|
+
for (let i = 0; i < node.nodes.length; i++) {
|
|
214
|
+
const item = { ...node.nodes[i] }
|
|
215
|
+
|
|
216
|
+
// Проверка, является ли тип ожидаемым типом или массивом ожидаемых типов
|
|
217
|
+
if (
|
|
218
|
+
(typeof expectedType === 'string' && item.type === expectedType) ||
|
|
219
|
+
(Array.isArray(expectedType) && expectedType.includes(item.type))
|
|
220
|
+
) {
|
|
221
|
+
result.push(
|
|
222
|
+
self.filtrationTreeByExpectedTypeRecursion(item, expectedType)
|
|
223
|
+
)
|
|
224
|
+
} else {
|
|
225
|
+
item.nodes = []
|
|
226
|
+
}
|
|
227
|
+
}
|
|
228
|
+
node.nodes = result
|
|
229
|
+
return { ...node }
|
|
230
|
+
}
|
|
231
|
+
|
|
232
|
+
self.createAbsolutePathRecursion = (
|
|
233
|
+
node: any,
|
|
234
|
+
valueProp: string,
|
|
235
|
+
parentProp: string
|
|
236
|
+
): string => {
|
|
237
|
+
if (!node) return ''
|
|
238
|
+
|
|
239
|
+
const parentPath = self.createAbsolutePathRecursion(
|
|
240
|
+
node[parentProp],
|
|
241
|
+
valueProp,
|
|
242
|
+
parentProp
|
|
243
|
+
)
|
|
244
|
+
return (parentPath ? `${parentPath}/` : '') + node[valueProp]
|
|
245
|
+
}
|
|
246
|
+
|
|
247
|
+
self.findParentByValue = (
|
|
248
|
+
node: any,
|
|
249
|
+
value: any,
|
|
250
|
+
valueProp: string,
|
|
251
|
+
parentProp: string
|
|
252
|
+
): any | null => {
|
|
253
|
+
if (!node) return null
|
|
254
|
+
|
|
255
|
+
if (node[valueProp] === value) return node
|
|
256
|
+
const parent = node[parentProp]
|
|
257
|
+
if (parent)
|
|
258
|
+
return self.findParentByValue(parent, value, valueProp, parentProp)
|
|
259
|
+
|
|
260
|
+
return null
|
|
261
|
+
}
|
|
262
|
+
|
|
263
|
+
self.sortByProp = function (
|
|
264
|
+
arr: any[],
|
|
265
|
+
prop: string,
|
|
266
|
+
up: boolean,
|
|
267
|
+
itemsProp: string
|
|
268
|
+
): void {
|
|
269
|
+
const value: 1 | -1 = up ? 1 : -1
|
|
270
|
+
arr.sort((a, b) => {
|
|
271
|
+
const first = a[prop].toLowerCase()
|
|
272
|
+
const second = b[prop].toLowerCase()
|
|
273
|
+
return first < second ? value : first > second ? -value : 0
|
|
274
|
+
})
|
|
275
|
+
|
|
276
|
+
for (let i = 0; i < arr.length; i++) {
|
|
277
|
+
const item: any = arr[i]
|
|
278
|
+
|
|
279
|
+
if (item[itemsProp]?.length) {
|
|
280
|
+
self.sortByProp(item[itemsProp], prop, up, itemsProp)
|
|
281
|
+
}
|
|
282
|
+
}
|
|
283
|
+
}
|
|
284
|
+
|
|
285
|
+
self.calcCount = function (
|
|
286
|
+
arr: any[],
|
|
287
|
+
itemsProp: string
|
|
288
|
+
): number {
|
|
289
|
+
if (!arr) return 0
|
|
290
|
+
let res = 0
|
|
291
|
+
|
|
292
|
+
for (let i = 0; i < arr.length; i++) {
|
|
293
|
+
const item: any = arr[i]
|
|
294
|
+
res++
|
|
295
|
+
|
|
296
|
+
if (item[itemsProp]?.length) {
|
|
297
|
+
res += self.calcCount(item[itemsProp], itemsProp)
|
|
298
|
+
}
|
|
299
|
+
}
|
|
300
|
+
return res
|
|
301
|
+
}
|
|
302
|
+
|
|
303
|
+
return self
|
|
304
|
+
}.call({})
|
|
305
|
+
|
|
306
|
+
return {
|
|
307
|
+
provide: {
|
|
308
|
+
recursion,
|
|
309
|
+
},
|
|
310
|
+
}
|
|
311
|
+
})
|