@since2006/pages 2026.4.1 → 2026.4.3

package/dist/es/packages/pages/src/app/workflow/design/editor/js/WFValidator.js

@@ -0,0 +1,557 @@
+import { NODE_TYPE_START_NODE as C, NODE_TYPE_END_NODE as F, NODE_TYPE_COMMON_NODE as D, NODE_TYPE_TRANS_NODE as L } from "./WFConstants.js";
+class G {
+  constructor(s) {
+    this.workflow = s, this.aErrorList = [], this.aLifeNodes = [], this.aEndLifeNodes = [], this.aTranLifeNodes = [], this.aPaperNodes = [];
+  }
+  check() {
+    let s = this.workflow.getStartNode();
+    if (s == null) {
+      this.aErrorList.push("流程没有起点");
+      return;
+    }
+    let u = this.workflow.getNodeRoads(s.uuid());
+    if (u != null)
+      for (let i = 0; i < u.length; i++)
+        u[i] != null && u[i].getRouteType() !== "F" && this.aErrorList.push("连接至起点的路径类别只能是电子送件");
+    let r = this.workflow.getEndNodes();
+    if (r.length === 0) {
+      this.aErrorList.push("流程没有终点");
+      return;
+    }
+    let t = this.workflow.getActivities(), e = this.workflow.getTransNodes();
+    this.aLifeNodes = [], this.aEndLifeNodes = [], this.aTranLifeNodes = [], this.aPaperNodes = [], this.aPaperNodes = this.workflow.getPaperNodes();
+    for (let i in this.aPaperNodes) {
+      let a = this.aPaperNodes[i], f = this.workflow.getNodeRoads(i);
+      if (f != null) {
+        for (let h = 0, g = f.length; h < g; h++)
+          if (f[h] != null) {
+            if (f[h].getStart() === a.uuid()) {
+              this.aErrorList.push("[" + a.getName() + "]为纸质送件，该节点不允许向外连接");
+              break;
+            }
+            if (f[h].getEnd() === a.uuid() && f[h].getRouteType() !== "F") {
+              this.aErrorList.push("[" + f[h].getName() + "]因连接至纸质送件，其路径类型只能为送件");
+              break;
+            }
+          }
+      }
+    }
+    this.analyseStart(this.workflow.getStartNode());
+    for (let i = 0; i < r.length; i++)
+      this.analyseEnd(r[i]);
+    for (let i = 0; i < e.length; i++)
+      this.analyseTrans(e[i]);
+    for (let i in t) {
+      let a = t[i], f = a.getFlowType();
+      if (f === "H" || f === "Y" || f === "I" || f === "C" || f === "D") {
+        let h = this.getInnerBranchCanReach(a);
+        for (let g in h) {
+          let E = h[g];
+          (E.getType() === C || E.getType() === F) && this.aErrorList.push("[" + a.getName() + "]不能有任何路径到达起点或终点");
+        }
+      }
+    }
+    for (let i in t) {
+      let a = t[i], f = a.getFlowType();
+      if (f === "H" || f === "Y" || f === "I" || f === "C" || f === "D") {
+        let h = this.getInnerBranchCanReachWithTrans(a), g = this.workflow.getNodeRoads(a.uuid()), E = null;
+        if (g != null) {
+          for (let w = 0, N = g.length; w < N; w++)
+            if (E = g[w], E != null && E.getEnd() === a.uuid()) {
+              let y = this.workflow.getElement(E.getStart()), p = E.getRouteType();
+              h[y.uuid()] != null ? p !== "B" && p !== "X" && p !== "Y" && this.aErrorList.push("[" + E.getName() + "]的路径类别设置错误，只能是退件给送件人或反馈至路径") : p !== "F" && this.aErrorList.push("[" + E.getName() + "]的路径类别设置错误，从内环外部连接时路径类别必须为送件");
+            }
+        }
+      }
+    }
+    let n = [], l = [];
+    for (let i in t) {
+      let a = t[i], f = a.getFlowType();
+      if (f === "H" || f === "Y" || f === "I" || f === "C" || f === "D") {
+        let h = this.getInnerBranchCanReachWithTrans(a);
+        for (let g in h) {
+          let E = h[g], w = E.getFlowType();
+          if (E.uuid() !== a.uuid() && (w === "H" || w === "Y" || w === "I" || w === "C" || w === "D")) {
+            let N = this.findNodeCanGoToTrans(E);
+            for (let y in N) {
+              let p = N[y];
+              if (p.getSpecialType() !== "Y") {
+                let k = this.findNodeCanGoToNodes(p);
+                for (let m in k) {
+                  let R = k[m].getType();
+                  (R === C || R === F) && (n[E.uuid()] = E);
+                }
+              } else {
+                let k = this.findNodeBackGoToNodes(p), m = !1;
+                for (let S in k)
+                  k[S].getSpecialType() === "X" && (m = !0);
+                m || (l[p.uuid()] = p);
+              }
+            }
+          }
+        }
+      }
+    }
+    for (let i in n)
+      this.aErrorList.push("[" + n[i].getName() + "]不合法，其属于内环当中的复数节点，其不能有到达终点的路径存在");
+    for (let i in l)
+      this.aErrorList.push("[" + l[i].getName() + "]不合法，其属于分流结束节点但并不存在可到达其的分流开始");
+    let o = [];
+    for (let i = 0; i < e.length; i++) {
+      let a = this.findTransInnerNodes(e[i]);
+      for (let f in a)
+        o[f] = a[f];
+    }
+    for (let i = 0; i < e.length; i++) {
+      let a = e[i], f = this.workflow.getNodeRoads(a.uuid());
+      if (f != null) {
+        for (let h = 0; h < f.length; h++)
+          if (f[h] != null && f[h].getStart() === a.uuid()) {
+            let g = this.workflow.getElement(f[h].getEnd());
+            o[g.uuid()] != null && this.aErrorList.push("[" + f[h].getName() + "]不合法，其所连接至的节点不能属于另一环当中的节点");
+          }
+      }
+    }
+    for (let i in t) {
+      let a = t[i], f = a.getFlowType();
+      if (f === "H" || f === "Y" || f === "C") {
+        let h = this.findNodeCanGoToTransWithBreak(a), g = 0;
+        for (let E in h)
+          g++;
+        g === 0 && this.aErrorList.push("[" + a.getName() + "]不合法，无法到达任何状态点");
+      }
+    }
+    for (let i in t) {
+      let a = t[i];
+      a != null && (this.isDeadRoad(a) && this.aErrorList.push("[" + a.getName() + "]是无效节点，从起点不能连接至该点"), this.isEndDeadRoad(a) && this.aErrorList.push("[" + a.getName() + "]是无效节点，该点不能连接至终点"));
+    }
+    let d = this.workflow.getWfXml().getRootElement(), c = d.getElementsByTagName("define")[0];
+    if (this.getFormAttribute(c, "class") == null) {
+      this.aErrorList.push("整个流程的属性还没设置，请双击[" + c.getAttribute("name") + "]进行设置");
+      return;
+    }
+    let T = this.getCommentNodeList(d);
+    for (let i = 0; i < T.length; i++)
+      this.getFormAttribute(T[i], "fcChooseUser") == null && this.aErrorList.push(T[i].getAttribute("name") + "还未进行详细设置");
+    if (!(this.aErrorList.length > 0)) {
+      for (let i = 0; i < e.length; i++)
+        this.analyseTransHuiQian(e[i]);
+      this.analyseTransLocal(e);
+      for (let i = 0; i < r.length; i++) {
+        let a = r[i].uuid(), f = this.getEndRouteList(d, a, !0);
+        for (let h = 0; h < f.length; h++) {
+          let g = this.getFormAttribute(f[h], "flowType");
+          g !== "T" && g !== "C" && g !== "D" && this.aErrorList.push(f[h].getAttribute("name") + "的路径类别必须为[废弃、归档、办结]之一");
+        }
+      }
+      for (let i = 0; i < e.length; i++) {
+        let a = e[i].uuid(), f = this.getEndRouteList(d, a, !0);
+        for (let h = 0; h < f.length; h++)
+          this.getFormAttribute(f[h], "flowType") !== "F" && this.aErrorList.push(f[h].getAttribute("name") + "的路径类别因为其连接到状态点所以必须为送件类型");
+      }
+      for (let i = 0; i < r.length; i++) {
+        let a = r[i].uuid(), f = this.getEndRouteList(d, a, !1);
+        for (let h = 0; h < f.length; h++) {
+          let g = this.getFormAttribute(f[h], "flowType");
+          g === "T" && g === "C" && g === "D" && this.aErrorList.push(f[h].getAttribute("name") + "的路径类别不能为[废弃、归档、办结]之一");
+        }
+      }
+    }
+  }
+  getCheckResult() {
+    return this.aErrorList.length === 0;
+  }
+  getErrorList() {
+    return this.aErrorList;
+  }
+  getFormAttribute(s, u) {
+    let r = s.getElementsByTagName("form-attribute");
+    for (let t = 0; t < r.length; t++) {
+      let e = r[t];
+      if (e.getAttribute("name") === u)
+        return e.textContent;
+    }
+    return null;
+  }
+  getCommentNodeList(s) {
+    let u = [], r = s.getElementsByTagName("activitys")[0].getElementsByTagName("activity");
+    for (let t = 0; t < r.length; t++) {
+      let e = r[t];
+      e.getAttribute("type") === D && u.push(e);
+    }
+    return u;
+  }
+  getEndRouteList(s, u, r) {
+    let t = [], e = s.getElementsByTagName("routes")[0].getElementsByTagName("route");
+    for (let n = 0; n < e.length; n++) {
+      let l = e[n];
+      l.getAttribute("end") === u && t.push(l);
+    }
+    return t;
+  }
+  /**
+   * 分析整张图，建立可通的节点图
+   * 找一个节点可以到的所有节点的集合
+   */
+  analyseStart(s) {
+    this.aLifeNodes[s.uuid()] = s;
+    let u = this.workflow.getNodeRoads(s.uuid());
+    if (u != null) {
+      let r = u.length;
+      for (let t = 0; t < r; t++)
+        if (u[t] != null && u[t].getStart() === s.uuid()) {
+          let e = this.workflow.getElement(u[t].getEnd());
+          if (this.aLifeNodes[e.uuid()] != null)
+            continue;
+          this.analyseStart(e);
+        }
+    }
+  }
+  /**
+   * 分析整张图，建立可通的节点图结束点的集合
+   * 找一个节点可以到的所有节点的集合
+   */
+  analyseEnd(s) {
+    this.aEndLifeNodes[s.uuid()] = s;
+    let u = this.workflow.getNodeRoads(s.uuid());
+    if (u != null) {
+      let r = u.length;
+      for (let t = 0; t < r; t++)
+        if (u[t] != null && u[t].getEnd() === s.uuid()) {
+          let e = this.workflow.getElement(u[t].getStart());
+          if (this.aEndLifeNodes[e.uuid()] != null)
+            continue;
+          this.analyseEnd(e);
+        }
+    }
+  }
+  isDeadRoad(s) {
+    return this.aLifeNodes[s.uuid()] == null;
+  }
+  /**
+   * 检查是否非法路径，如果一个节点不能到达任何一个终点就为非法
+   */
+  isEndDeadRoad(s) {
+    return !(this.aEndLifeNodes[s.uuid()] != null || this.aTranLifeNodes[s.uuid()] != null || this.aPaperNodes[s.uuid()] != null);
+  }
+  /**
+   * 检查会签送件的合法性
+   */
+  analyseTransHuiQian(s) {
+    const u = this;
+    let r = [], t = null;
+    if (l(s), t == null) {
+      this.aErrorList.push("没有任何传阅或会签或并发的节点可连接至[" + s.getName() + "]");
+      return;
+    }
+    for (let o in r) {
+      let d = r[o];
+      (d.getType() === C || d.getType() === F) && this.aErrorList.push("[" + s.getName() + "]不能有任何不经过会签或传阅或并发的路径而连接至起点或终点");
+    }
+    let e = t.getFlowType();
+    if (e === "H" || e === "C") {
+      if (this.workflow.getNodeRoadsOut(s.uuid()).length > 0) {
+        let d = e === "H" ? "会签" : "并发", c = this.getHuiQianNodesCanGoTrans(s), T = !1;
+        for (let i = 0; i < c.length; i++) {
+          let a = c[i].getFlowType();
+          if (a === "I" || a === "D") {
+            T = !0;
+            break;
+          }
+        }
+        T || this.aErrorList.push(d + "节点[" + t.getName() + "]为等待模式，其所能达到的状态点不能有外连接");
+      }
+    } else if (e === "I" || e === "D") {
+      let o = this.workflow.getNodeRoadsOut(s.uuid());
+      if (o.length === 0) {
+        let d = e === "I" ? "会签" : "并发";
+        this.aErrorList.push(d + "节点[" + t.getName() + "]为非等待模式，其所能达到的状态点必须有外连接");
+      } else {
+        let d = n(s);
+        for (let c = 0; c < o.length; c++) {
+          let T = o[c].getRouteType();
+          T !== "F" && T !== "X" && T !== "Y" && this.aErrorList.push("从状态点[" + s.getName() + "]连接出去的路径只能是送件、退回路径办理人之一");
+          let i = u.workflow.getElement(o[c].getEnd());
+          T === "F" && i.getFlowType() !== "E" && this.aErrorList.push("从状态点[" + s.getName() + "]连接出去的路径是送件时其目标节点只能是电子送件类型");
+          let a = o[c].getEnd();
+          d[a] == null && this.aErrorList.push("状态点外连接[" + o[c].getName() + `]连接不正确，请检查：
+1.状态点连接出去的路径节点必须是会签/并发外的一般节点
+2.如果是会签嵌套，那只能是父分支的节点之一
+3.节点的流向类别为电子送件`);
+        }
+      }
+    }
+    function n(o) {
+      let d = [], c = [];
+      return i(o, !1), d = [], T(o), c;
+      function T(a, f) {
+        d[a.uuid()] = a;
+        let h = u.workflow.getNodeRoads(a.uuid());
+        for (let g = 0, E = h.length; g < E; g++)
+          if (h[g] != null && h[g].getStart() === a.uuid()) {
+            let w = u.workflow.getElement(h[g].getEnd());
+            if (d[w.uuid()] != null)
+              continue;
+            let N = w.getFlowType();
+            if (N === "H" || N === "I" || N === "Y" || N === "C" || N === "D") {
+              c[w.uuid()] = w;
+              continue;
+            }
+            c[w.uuid()] = w;
+          }
+      }
+      function i(a, f) {
+        d[a.uuid()] = a;
+        let h = u.workflow.getNodeRoads(a.uuid());
+        for (let g = 0, E = h.length; g < E; g++)
+          if (h[g] != null && h[g].getEnd() === a.uuid()) {
+            let w = u.workflow.getElement(h[g].getStart());
+            if (d[w.uuid()] != null)
+              continue;
+            let N = w.getFlowType();
+            if (N === "H" || N === "I" || N === "Y" || N === "C" || N === "D")
+              if (!f)
+                i(w, !0);
+              else
+                break;
+            else
+              f && w.getFlowType() === "E" && (c[w.uuid()] = w), i(w, f);
+          }
+      }
+    }
+    function l(o) {
+      r[o.uuid()] = o;
+      let d = u.workflow.getNodeRoads(o.uuid());
+      if (d != null) {
+        for (let c = 0, T = d.length; c < T; c++)
+          if (d[c] != null && d[c].getEnd() === o.uuid()) {
+            let i = u.workflow.getElement(d[c].getStart());
+            if (r[i.uuid()] != null)
+              continue;
+            let a = i.getFlowType();
+            if (a === "H" || a === "I" || a === "Y" || a === "C" || a === "D") {
+              t = i;
+              continue;
+            } else
+              l(i);
+          }
+      }
+    }
+  }
+  /**
+   * 获得传阅或会签件所可以到达的节点集合
+   */
+  getInnerBranchCanReachWithTrans(s) {
+    const u = this;
+    let r = [];
+    return t(s), r;
+    function t(e) {
+      r[e.uuid()] = e;
+      let n = u.workflow.getNodeRoads(e.uuid());
+      if (n != null) {
+        for (let l = 0; l < n.length; l++)
+          if (n[l] != null && n[l].getStart() === e.uuid()) {
+            let o = u.workflow.getElement(n[l].getEnd());
+            if (r[o.uuid()] != null)
+              continue;
+            if (o.getType() === L) {
+              r[o.uuid()] = o;
+              continue;
+            } else
+              t(o);
+          }
+      }
+    }
+  }
+  /**
+   * 查找状态点所属于的环当中的所有节点
+   */
+  findTransInnerNodes(s) {
+    const u = this;
+    let r = [];
+    return t(s), r;
+    function t(e) {
+      r[e.uuid()] = e;
+      let n = u.workflow.getNodeRoads(e.uuid());
+      if (n != null) {
+        for (let l = 0; l < n.length; l++)
+          if (n[l] != null && n[l].getEnd() === e.uuid()) {
+            let o = u.workflow.getElement(n[l].getStart());
+            if (r[o.uuid()] != null)
+              continue;
+            let d = o.getFlowType();
+            if (d === "H" || d === "I" || d === "Y" || d === "C" || d === "D")
+              continue;
+            t(o);
+          }
+      }
+    }
+  }
+  /**
+   *查找节点可以到达的状态点
+   */
+  findNodeCanGoToTrans(s) {
+    const u = this;
+    let r = [], t = [];
+    return e(s), t;
+    function e(n) {
+      r[n.uuid()] = n;
+      let l = u.workflow.getNodeRoads(n.uuid());
+      if (l != null) {
+        for (let o = 0; o < l.length; o++)
+          if (l[o] != null && l[o].getStart() === n.uuid()) {
+            let d = u.workflow.getElement(l[o].getEnd());
+            if (r[d.uuid()] != null)
+              continue;
+            if (d.getType() === L) {
+              r[d.uuid()] = d, t[d.uuid()] = d;
+              continue;
+            } else
+              e(d);
+          }
+      }
+    }
+  }
+  /**
+   * 查找节点可以到达的状态点，如果中途遇到其它复数节点则中断，只对传阅，会签等待，并发等待中断
+   */
+  findNodeCanGoToTransWithBreak(s) {
+    const u = this;
+    let r = [], t = [];
+    return e(s), t;
+    function e(n) {
+      r[n.uuid()] = n;
+      let l = u.workflow.getNodeRoads(n.uuid());
+      if (l != null) {
+        for (let o = 0; o < l.length; o++)
+          if (l[o] != null && l[o].getStart() === n.uuid()) {
+            let d = u.workflow.getElement(l[o].getEnd());
+            if (r[d.uuid()] != null)
+              continue;
+            let c = d.getFlowType();
+            if (c === "H" || c === "Y" || c === "C")
+              continue;
+            if (d.getType() === L) {
+              r[d.uuid()] = d, t[d.uuid()] = d;
+              continue;
+            } else
+              e(d);
+          }
+      }
+    }
+  }
+  /**
+   * 获得传阅或会签件所可以到达的节点集合
+   */
+  getInnerBranchCanReach(s) {
+    const u = this;
+    let r = [];
+    return t(s), r;
+    function t(e) {
+      r[e.uuid()] = e;
+      let n = u.workflow.getNodeRoads(e.uuid());
+      if (n != null) {
+        for (let l = 0; l < n.length; l++)
+          if (n[l] != null && n[l].getStart() === e.uuid()) {
+            let o = u.workflow.getElement(n[l].getEnd());
+            if (r[o.uuid()] != null || o.getType() === L)
+              continue;
+            t(o);
+          }
+      }
+    }
+  }
+  /**
+   * 分析可连接到转换点的节点
+   */
+  analyseTrans(s, u) {
+    this.aTranLifeNodes[s.uuid()] = s;
+    let r = this.workflow.getNodeRoads(s.uuid());
+    if (r != null) {
+      for (let t = 0, e = r.length; t < e; t++)
+        if (r[t] != null && r[t].getEnd() === s.uuid()) {
+          let n = this.workflow.getElement(r[t].getStart());
+          if (this.aTranLifeNodes[n.uuid()] != null)
+            continue;
+          let l = n.getFlowType();
+          l === "Y" || l === "H" || l === "I" || l === "C" || l === "D" ? (this.aTranLifeNodes[n.uuid()] = n, u || this.analyseTrans(n, !0)) : this.analyseTrans(n, !1);
+        }
+    }
+  }
+  /**
+   * 检查状态点是否能反向连接到起点或节点，如果经过了会签传阅就中断
+   */
+  analyseTransLocal(s) {
+    let u = [], r = [];
+    for (let t = 0; t < s.length; t++) {
+      let e = s[t], n = this.workflow.getNodeRoads(e.uuid());
+      for (let l = 0; l < n.length; l++)
+        if (n[l] != null && n[l].getEnd() === e.uuid()) {
+          let o = this.workflow.getElement(n[l].getStart());
+          u[o.uuid()] != null ? r[o.uuid()] = o : u[o.uuid()] = o;
+        }
+    }
+    for (let t in r)
+      this.aErrorList.push("[" + r[t].getName() + "]不能同时连接到多个状态点");
+  }
+  /**
+   * 查找节点可以到达的状态点
+   */
+  findNodeCanGoToNodes(s) {
+    const u = this;
+    let r = [];
+    return t(s), r;
+    function t(e) {
+      r[e.uuid()] = e;
+      let n = u.workflow.getNodeRoads(e.uuid());
+      if (n != null) {
+        for (let l = 0; l < n.length; l++)
+          if (n[l] != null && n[l].getStart() === e.uuid()) {
+            let o = u.workflow.getElement(n[l].getEnd());
+            if (r[o.uuid()] != null || o.getType() === L)
+              continue;
+            t(o);
+          }
+      }
+    }
+  }
+  /**
+   * 查找节点可逆向走到的点
+   */
+  findNodeBackGoToNodes(s) {
+    const u = this;
+    let r = [];
+    return t(s), r;
+    function t(e) {
+      r[e.uuid()] = e;
+      var n = u.workflow.getNodeRoads(e.uuid());
+      if (n != null) {
+        for (var l = 0; l < n.length; l++)
+          if (n[l] != null && n[l].getEnd() === e.uuid()) {
+            let o = u.workflow.getElement(n[l].getStart());
+            if (r[o.uuid()] != null || o.getType() === L)
+              continue;
+            t(o);
+          }
+      }
+    }
+  }
+  /**
+   * 查找可以到达某个状态点的会签或传阅等节点
+   */
+  getHuiQianNodesCanGoTrans(s) {
+    let u = [], r = this.workflow.getActivities();
+    for (let t in r) {
+      let e = r[t], n = e.getFlowType();
+      if (n === "H" || n === "I" || n === "Y" || n === "C" || n === "D") {
+        let l = this.findNodeCanGoToTrans(e);
+        for (let o in l)
+          l[o].uuid() === s.uuid() && u.push(e);
+      }
+    }
+    return u;
+  }
+}
+export {
+  G as default
+};