Optimize dag

This commit is contained in:
break60 2020-08-06 09:38:39 +08:00
parent 43eb39767a
commit 21eaf51e1b
4 changed files with 9 additions and 9 deletions

View File

@ -118,8 +118,8 @@ Dag.prototype.toolbarEvent = function ({ item, code, is }) {
Dag.prototype.backfill = function (arg) {
if (arg) {
let locationsValue = store.state.dag.locations
const locationsValue1 = store.state.dag.locations
const locationsValue2 = store.state.dag.locations
const locationsValue1 = _.cloneDeep(store.state.dag.locations)
const locationsValue2 = _.cloneDeep(store.state.dag.locations)
const arr = []
for (const i in locationsValue1) {
const objs = {}

View File

@ -522,9 +522,9 @@
} else {
rearList = []
}
let targetarr = $(`#${id}`).attr('data-targetarr')
if (targetarr) {
let nodearr = targetarr.split(',')
let target = $(`#${id}`).attr('data-targetarr')
if (target) {
let nodearr = target.split(',')
nodearr.forEach(v => {
let nodeobj = {}
nodeobj.value = $(`#${v}`).find('.name-p').text()

View File

@ -687,14 +687,14 @@ JSP.prototype.saveStore = function () {
JSP.prototype.handleEvent = function () {
this.JspInstance.bind('beforeDrop', function (info) {
const sourceId = info.sourceId//
const targetId = info.targetId//
let sourceId = info['sourceId']//
let targetId = info['targetId']//
/**
* Recursive search for nodes
*/
let recursiveVal
const recursiveTargetarr = (arr, targetId) => {
for (const i in arr) {
for (let i in arr) {
if (arr[i] === targetId) {
recursiveVal = targetId
} else {

View File

@ -32,7 +32,7 @@ const rtTargetarrArr = (id) => {
*/
const saveTargetarr = (valId, domId) => {
let $target = $(`#${domId}`)
let targetStr = $target.attr('data-targetarr') ? $target.attr('data-targetarr') + `,${valId}` : `${valId}`
let targetStr = $target.attr('data-targetarr') ? $target.attr('data-targetarr') + `,${valId}` : `${valId}`;
$target.attr('data-targetarr', targetStr)
}