Browse Source

关联表单

qin_s5
herenshan112 2 weeks ago
parent
commit
769a4aeb9c
  1. 38
      src/views/sysworkflow/lowcodepage/appPage/appPageForm/unitsPageFrom/attribute.vue

38
src/views/sysworkflow/lowcodepage/appPage/appPageForm/unitsPageFrom/attribute.vue

@ -16,7 +16,7 @@ import type { UploadInstance, UploadProps, UploadRawFile,ElTree } from "element-
import { ElMessage, genFileId } from "element-plus"; import { ElMessage, genFileId } from "element-plus";
import { getAssociatedFormsCurrentFieldTree, getAssociatedFormsOrgAndManTree, getCustomerFormList, getAsfasfFieldTree, getAsfasfFieldTreeOptionsValue3, getPersonByRoleId, getAllRole,getQrCodeImgInside, getAssociatedFormsRoleTree } from "@/api/javaRequest"; import { getAssociatedFormsCurrentFieldTree, getAssociatedFormsOrgAndManTree, getCustomerFormList, getAsfasfFieldTree, getAsfasfFieldTreeOptionsValue3, getPersonByRoleId, getAllRole,getQrCodeImgInside, getAssociatedFormsRoleTree } from "@/api/javaRequest";
import Draggable from "vuedraggable-es"; import Draggable from "vuedraggable-es";
import AssociatedformsForCreate from "@/widget/associatedforms/associatedFormsForCreate.vue";
// //
import MathFormula from "@/components/DesignForm/math/mathFormula.vue"; import MathFormula from "@/components/DesignForm/math/mathFormula.vue";
import { orgInfo } from "@/api/hr/org/type"; import { orgInfo } from "@/api/hr/org/type";
@ -6143,26 +6143,28 @@ function mergeAndFilterAssociatedForms(treeA, treeB) {
return cTree; return cTree;
} }
const asfsCurrentTable = computed(()=>{ const asfsCurrentTable = computed(() => {
let currentTable: any[] = [] const matchingNodes: any[] = [];
let count = 0
let result = []
xTree.value.forEach((element:any) => {
if(getAfterLastColon(element.value) == controlData.value.name){ //
currentTable.push(element) function traverse(nodes: any[]) {
count++ for (const node of nodes) {
} //
}); if (getAfterLastColon(node.value) === controlData.value.name) {
console.log("xTree.value------------------>",xTree.value) matchingNodes.push(node);
if(count>0){ }
result = currentTable[0].children //
}else{ if (node.children && node.children.length > 0) {
result = [] traverse(node.children);
}
} }
}
return result traverse(xTree.value);
})
// children
return matchingNodes.length > 0 ? matchingNodes[0].children || [] : [];
});

Loading…
Cancel
Save