openatc-components 0.1.39 → 0.1.40
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/PatternStatus/PatternStatus.vue +40 -30
- package/package/kissui.min.js +1 -1
- package/package.json +1 -1
- package/src/kisscomps/components/PatternStatus/PatternStatus.vue +40 -30
- package/src/views/intersection.vue +2 -2
- package/src/views/overView.vue +1 -1
- package/src/views/schemeconfig.vue +3 -3
|
@@ -590,6 +590,7 @@ export default {
|
|
|
590
590
|
return k.id
|
|
591
591
|
})
|
|
592
592
|
})
|
|
593
|
+
let newRings = ringsequence.filter(item => item)
|
|
593
594
|
let minLength = Math.min(...ringlength)
|
|
594
595
|
let resultArrs = [] // 环1分组
|
|
595
596
|
let resultArr = [] // 环2分组
|
|
@@ -599,8 +600,10 @@ export default {
|
|
|
599
600
|
resultArrs.push([])
|
|
600
601
|
}
|
|
601
602
|
}
|
|
602
|
-
|
|
603
|
-
|
|
603
|
+
if (newRings.length > 1) {
|
|
604
|
+
for (let i = 0; i < ringsequence[1].length; i += minLength) {
|
|
605
|
+
resultArr.push(ringsequence[1].slice(i, i + minLength))
|
|
606
|
+
}
|
|
604
607
|
}
|
|
605
608
|
this.patternInfo = []
|
|
606
609
|
let currentArr = []
|
|
@@ -639,20 +642,22 @@ export default {
|
|
|
639
642
|
ring1s.push(addRing1)
|
|
640
643
|
}
|
|
641
644
|
barrierRing1.push(...ring1, ...ring1s)
|
|
642
|
-
let ring2s = [] // 环2与关系1的并集
|
|
643
|
-
for (let h = 0; h < newCurrent.length; h++) {
|
|
644
|
-
let addRing2 = [...new Set(resultArr[1])].filter(item => newCurrent[h].includes(item))
|
|
645
|
-
ring2s.push(addRing2)
|
|
646
|
-
}
|
|
647
|
-
let ring2 = [] // 环2与关系1的并集
|
|
648
|
-
for (let h = 0; h < newCurrent.length; h++) {
|
|
649
|
-
let add = [...new Set(resultArr[0])].filter(item => newCurrent[h].includes(item))
|
|
650
|
-
ring2.push(add)
|
|
651
|
-
}
|
|
652
|
-
barrierRing2.push(...ring2, ...ring2s)
|
|
653
645
|
let resultList = []
|
|
654
|
-
|
|
655
|
-
|
|
646
|
+
if (newRings.length > 1) {
|
|
647
|
+
let ring2s = [] // 环2与关系1的并集
|
|
648
|
+
for (let h = 0; h < newCurrent.length; h++) {
|
|
649
|
+
let addRing2 = [...new Set(resultArr[1])].filter(item => newCurrent[h].includes(item))
|
|
650
|
+
ring2s.push(addRing2)
|
|
651
|
+
}
|
|
652
|
+
let ring2 = [] // 环2与关系1的并集
|
|
653
|
+
for (let h = 0; h < newCurrent.length; h++) {
|
|
654
|
+
let add = [...new Set(resultArr[0])].filter(item => newCurrent[h].includes(item))
|
|
655
|
+
ring2.push(add)
|
|
656
|
+
}
|
|
657
|
+
barrierRing2.push(...ring2, ...ring2s)
|
|
658
|
+
for (let k = 0; k < barrierRing1.length; k++) {
|
|
659
|
+
resultList.push(barrierRing1[k].concat(barrierRing2[k]))
|
|
660
|
+
}
|
|
656
661
|
}
|
|
657
662
|
let resultLists = resultList.filter(item => item.length !== 0)
|
|
658
663
|
let ringArr = []
|
|
@@ -766,6 +771,7 @@ export default {
|
|
|
766
771
|
return k.id
|
|
767
772
|
})
|
|
768
773
|
})
|
|
774
|
+
let newRings = ringsequence.filter(item => item)
|
|
769
775
|
let minLength = Math.min(...ringlength)
|
|
770
776
|
let resultArrs = [] // 环1分组
|
|
771
777
|
let resultArr = [] // 环2分组
|
|
@@ -775,8 +781,10 @@ export default {
|
|
|
775
781
|
resultArrs.push([])
|
|
776
782
|
}
|
|
777
783
|
}
|
|
778
|
-
|
|
779
|
-
|
|
784
|
+
if (newRings.length > 1) {
|
|
785
|
+
for (let i = 0; i < ringsequence[1].length; i += minLength) {
|
|
786
|
+
resultArr.push(ringsequence[1].slice(i, i + minLength))
|
|
787
|
+
}
|
|
780
788
|
}
|
|
781
789
|
this.patternInfo = []
|
|
782
790
|
this.barrierList = []
|
|
@@ -816,20 +824,22 @@ export default {
|
|
|
816
824
|
ring1s.push(addRing1)
|
|
817
825
|
}
|
|
818
826
|
barrierRing1.push(...ring1, ...ring1s)
|
|
819
|
-
let ring2s = [] // 环2与关系1的并集
|
|
820
|
-
for (let h = 0; h < newCurrent.length; h++) {
|
|
821
|
-
let addRing2 = [...new Set(resultArr[1])].filter(item => newCurrent[h].includes(item))
|
|
822
|
-
ring2s.push(addRing2)
|
|
823
|
-
}
|
|
824
|
-
let ring2 = [] // 环2与关系1的并集
|
|
825
|
-
for (let h = 0; h < newCurrent.length; h++) {
|
|
826
|
-
let add = [...new Set(resultArr[0])].filter(item => newCurrent[h].includes(item))
|
|
827
|
-
ring2.push(add)
|
|
828
|
-
}
|
|
829
|
-
barrierRing2.push(...ring2, ...ring2s)
|
|
830
827
|
let resultList = []
|
|
831
|
-
|
|
832
|
-
|
|
828
|
+
if (newRings.length > 1) {
|
|
829
|
+
let ring2s = [] // 环2与关系1的并集
|
|
830
|
+
for (let h = 0; h < newCurrent.length; h++) {
|
|
831
|
+
let addRing2 = [...new Set(resultArr[1])].filter(item => newCurrent[h].includes(item))
|
|
832
|
+
ring2s.push(addRing2)
|
|
833
|
+
}
|
|
834
|
+
let ring2 = [] // 环2与关系1的并集
|
|
835
|
+
for (let h = 0; h < newCurrent.length; h++) {
|
|
836
|
+
let add = [...new Set(resultArr[0])].filter(item => newCurrent[h].includes(item))
|
|
837
|
+
ring2.push(add)
|
|
838
|
+
}
|
|
839
|
+
barrierRing2.push(...ring2, ...ring2s)
|
|
840
|
+
for (let k = 0; k < barrierRing1.length; k++) {
|
|
841
|
+
resultList.push(barrierRing1[k].concat(barrierRing2[k]))
|
|
842
|
+
}
|
|
833
843
|
}
|
|
834
844
|
let resultLists = resultList.filter(item => item.length !== 0)
|
|
835
845
|
let ringArr = []
|