openatc-components 0.4.32 → 0.4.34
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/package/kisscomps/components/OptimizeKanban/index.js +2 -0
- package/package/kisscomps/components/OptimizeKanban/index.vue +369 -0
- package/package/kisscomps/components/PatternStatus/PatternStatus.vue +21 -2
- package/package/kissui.min.js +1 -1
- package/package.json +1 -1
- package/src/kisscomps/components/PatternStatus/PatternStatus.vue +21 -2
- package/src/node_modules/.package_versions.json +1 -0
package/package.json
CHANGED
|
@@ -1185,6 +1185,7 @@ export default {
|
|
|
1185
1185
|
let minLength = Math.min(...ringlength)
|
|
1186
1186
|
let resultArrs = [] // 环1分组
|
|
1187
1187
|
let resultArr = [] // 环2分组
|
|
1188
|
+
let resultArrThree = [] // 环3分组
|
|
1188
1189
|
for (let j = 0; j < ringsequence[0].length; j += minLength) {
|
|
1189
1190
|
resultArrs.push(ringsequence[0].slice(j, j + minLength))
|
|
1190
1191
|
if (ringsequence[0].length === minLength) {
|
|
@@ -1195,6 +1196,11 @@ export default {
|
|
|
1195
1196
|
for (let i = 0; i < ringsequence[1].length; i += minLength) {
|
|
1196
1197
|
resultArr.push(ringsequence[1].slice(i, i + minLength))
|
|
1197
1198
|
}
|
|
1199
|
+
if (ringsequence[2]) {
|
|
1200
|
+
for (let k = 0; k < ringsequence[2].length; k += minLength) {
|
|
1201
|
+
resultArrThree.push(ringsequence[2].slice(k, k + minLength))
|
|
1202
|
+
}
|
|
1203
|
+
}
|
|
1198
1204
|
}
|
|
1199
1205
|
this.patternInfo = []
|
|
1200
1206
|
this.barrierList = []
|
|
@@ -1220,9 +1226,10 @@ export default {
|
|
|
1220
1226
|
}
|
|
1221
1227
|
if (currentArr.length !== 0) {
|
|
1222
1228
|
let newCurrent = this.tranform(currentArr)
|
|
1223
|
-
//
|
|
1229
|
+
// 取每个环与环关系的并集
|
|
1224
1230
|
let barrierRing1 = []
|
|
1225
1231
|
let barrierRing2 = []
|
|
1232
|
+
let barrierRing3 = []
|
|
1226
1233
|
let ring1 = [] // 环1与关系1的并集
|
|
1227
1234
|
for (let h = 0; h < newCurrent.length; h++) {
|
|
1228
1235
|
let adds = [...new Set(resultArrs[0])].filter(item => newCurrent[h].includes(item))
|
|
@@ -1247,8 +1254,20 @@ export default {
|
|
|
1247
1254
|
ring2.push(add)
|
|
1248
1255
|
}
|
|
1249
1256
|
barrierRing2.push(...ring2, ...ring2s)
|
|
1257
|
+
// 环3
|
|
1258
|
+
let ring3s = [] // 环3与关系1的并集
|
|
1259
|
+
for (let h = 0; h < newCurrent.length; h++) {
|
|
1260
|
+
let addRing2 = [...new Set(resultArrThree[1])].filter(item => newCurrent[h].includes(item))
|
|
1261
|
+
ring3s.push(addRing2)
|
|
1262
|
+
}
|
|
1263
|
+
let ring3 = [] // 环3与关系1的并集
|
|
1264
|
+
for (let h = 0; h < newCurrent.length; h++) {
|
|
1265
|
+
let add = [...new Set(resultArrThree[0])].filter(item => newCurrent[h].includes(item))
|
|
1266
|
+
ring3.push(add)
|
|
1267
|
+
}
|
|
1268
|
+
barrierRing3.push(...ring3, ...ring3s)
|
|
1250
1269
|
for (let k = 0; k < barrierRing1.length; k++) {
|
|
1251
|
-
resultList.push(barrierRing1[k].concat(barrierRing2[k]))
|
|
1270
|
+
resultList.push(barrierRing1[k].concat(barrierRing2[k]).concat(barrierRing3[k]))
|
|
1252
1271
|
}
|
|
1253
1272
|
}
|
|
1254
1273
|
let resultLists = resultList.filter(item => item.length !== 0)
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{}
|