84 lines
2.0 KiB
Go

package domain
import "strings"
func GetNodeByID(nodes []WorkflowNode, nodeID string) *WorkflowNode {
for index := range nodes {
if nodes[index].ID == nodeID {
return &nodes[index]
}
}
return nil
}
func GetIncomingEdges(edges []WorkflowEdge, nodeID string) []WorkflowEdge {
items := make([]WorkflowEdge, 0)
for _, edge := range edges {
if edge.Target == nodeID {
items = append(items, edge)
}
}
return items
}
func GetOutgoingEdges(edges []WorkflowEdge, nodeID string) []WorkflowEdge {
items := make([]WorkflowEdge, 0)
for _, edge := range edges {
if edge.Source == nodeID {
items = append(items, edge)
}
}
return items
}
func GetStartNodeIDs(nodes []WorkflowNode, edges []WorkflowEdge) []string {
items := make([]string, 0)
for _, node := range nodes {
hasIncoming := false
for _, edge := range edges {
if edge.Target == node.ID {
hasIncoming = true
break
}
}
if !hasIncoming {
items = append(items, node.ID)
}
}
return items
}
func auditDecisionMatchesHandle(handle string, decision AuditStatus) bool {
if handle == "" {
return decision == AuditStatusApproved
}
normalized := strings.ToLower(handle)
switch decision {
case AuditStatusApproved:
return strings.Contains(normalized, "approved") || strings.Contains(normalized, "通过")
case AuditStatusRejected:
return strings.Contains(normalized, "rejected") || strings.Contains(normalized, "拒绝")
default:
return false
}
}
func GetDecisionOutgoingEdges(edges []WorkflowEdge, nodeID string, decision AuditStatus) []WorkflowEdge {
outgoing := GetOutgoingEdges(edges, nodeID)
filtered := make([]WorkflowEdge, 0)
for _, edge := range outgoing {
if auditDecisionMatchesHandle(edge.SourceHandle, decision) {
filtered = append(filtered, edge)
}
}
if len(filtered) > 0 {
return filtered
}
return outgoing
}
func NodeRequiresAudit(node WorkflowNode) bool {
label := strings.ToLower(node.Data.Label)
return node.Data.Category == "HUMAN" || strings.Contains(label, "human review") || strings.Contains(node.Data.Label, "人工审核")
}