Spaces:
Sleeping
Sleeping
File size: 7,136 Bytes
99caad5 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 | """Allowlisted operation types and deterministic acyclic graph compilation."""
import copy
from .models import RuntimeError
KINDS={
"start":"开始","context":"理解来文","knowledge":"知识检索","llm":"生成文稿",
"review":"规则复核","approval":"人工确认","tool":"工具调用",
"notification":"发送通知","transform":"文本处理","skill":"生成技能","pdf":"PDF 生成","end":"输出"}
DEFAULT_OPERATIONS=[
("op-start","开始","start",{}),("op-context","理解来文","context",{}),
("op-knowledge","知识检索","knowledge",{"top_k":3}),
("op-draft","公文起草","llm",{"prompt":"按通知格式起草;缺失事实标记待确认。"}),
("op-review","公文复核","review",{}),("op-approval","人工确认","approval",{}),
("op-save","保存文稿","tool",{"tool_id":"save-demo-document"}),
("op-notify","完成通知","notification",{}),("op-text","文本处理","transform",{"template":"{{request}}"}),
("op-pdf","PDF 生成","pdf",{}),("op-end","输出","end",{})]
def seed_graph():
ids=["start","understand","retrieve","draft","review","approval","save","notify","end"]
ops=["op-start","op-context","op-knowledge","op-draft","op-review","op-approval","op-save","op-notify","op-end"]
return {"nodes":[{"id":n,"operation_id":op,"label":name,"x":80+(i%3 if i//3%2==0 else 2-i%3)*315,"y":80+i//3*180,"config":{}}
for i,(n,op,name) in enumerate(zip(ids,ops,["开始","理解来文","检索依据","起草文稿","审核校对","人工确认","保存文稿","发送通知","结束"]))],
"edges":[{"source":a,"target":b} for a,b in zip(ids,ids[1:])]}
def clean_config(kind, config):
if not isinstance(config,dict):raise RuntimeError(422,"INVALID_CONFIG","节点配置必须是对象。")
allowed={"prompt","template","top_k","base_ids","tool_id","program_id","program_code","program_hash","input_from"}
if set(config)-allowed:raise RuntimeError(422,"INVALID_CONFIG","不支持的配置字段。")
c=copy.deepcopy(config)
for k in ("prompt","template"):
if k in c and (not isinstance(c[k],str) or len(c[k])>4000):
raise RuntimeError(422,"INVALID_CONFIG","提示词或模板需为 4000 字以内文本。")
if "top_k" in c and (type(c["top_k"]) is not int or not 1<=c["top_k"]<=10):
raise RuntimeError(422,"INVALID_CONFIG","检索条数为 1–10。")
if "base_ids" in c and (not isinstance(c["base_ids"],list) or len(c["base_ids"])>10 or any(not isinstance(x,str) for x in c["base_ids"])):
raise RuntimeError(422,"INVALID_CONFIG","知识库关联格式错误。")
if 'program_code' in c:
from CollaborationService.interpreter import PureProgram,ProgramError
import hashlib
try:PureProgram(c['program_code'])
except ProgramError as e:raise RuntimeError(422,'INVALID_PROGRAM',str(e))
if c.get('program_hash')!=hashlib.sha256(c['program_code'].encode()).hexdigest():raise RuntimeError(422,'PROGRAM_HASH_MISMATCH','技能代码校验失败。')
if 'input_from' in c and (not isinstance(c['input_from'],str) or len(c['input_from'])>80):raise RuntimeError(422,'INVALID_INPUT_BINDING','输入来源不符合约束。')
if kind=="tool" and c.get("tool_id","save-demo-document")!="save-demo-document":
raise RuntimeError(422,"TOOL_UNAVAILABLE","本版只开放保存演示文稿工具。")
return c
def compile_graph(graph, operations, allowed_bases):
issues=[];nodes=graph.get("nodes",[]);edges=graph.get("edges",[])
def fail(message,node=None):issues.append({"node_id":node,"message":message})
if not 2<=len(nodes)<=40:fail("画布需要 2–40 个节点。")
if len(edges)>120:fail("连线最多 120 条。")
ids=[n["id"] for n in nodes]
if len(ids)!=len(set(ids)):fail("节点 ID 重复。")
lookup={n["id"]:n for n in nodes};incoming={i:[] for i in ids};outgoing={i:[] for i in ids}
resolved={}
for n in nodes:
op=operations.get(n["operation_id"])
if not op:fail("原子操作已删除或不存在。",n["id"]);continue
try:
cfg=clean_config(op["kind"],{**op.get("config",{}),**n.get("config",{})})
if any(b not in allowed_bases for b in cfg.get("base_ids",[])):fail("关联了不可用知识库。",n["id"])
resolved[n["id"]]={**copy.deepcopy(n),"operation":copy.deepcopy(op),"config":cfg}
except RuntimeError as exc:fail(exc.message,n["id"])
seen=set()
for e in edges:
a,b=e["source"],e["target"]
if a not in lookup or b not in lookup:fail("连线引用了不存在的节点。");continue
if (a,b) in seen:fail("连线重复。",b);continue
seen.add((a,b));incoming[b].append(a);outgoing[a].append(b)
kinds={i:n["operation"]["kind"] for i,n in resolved.items()}
starts=[i for i,k in kinds.items() if k=="start"];ends=[i for i,k in kinds.items() if k=="end"]
if len(starts)!=1 or len(ends)!=1:fail("需要且只能有一个开始和一个结束节点。")
if sum(k=="llm" for k in kinds.values())>1:fail("PC 文稿流程最多一个生成文稿节点。")
if sum(k=="approval" for k in kinds.values())>1:fail("PC 文稿流程最多一个人工确认节点。")
degree={i:len(incoming[i]) for i in ids};queue=[i for i in ids if degree[i]==0];order=[]
while queue:
i=queue.pop(0);order.append(i)
for target in outgoing[i]:
degree[target]-=1
if degree[target]==0:queue.append(target)
if len(order)!=len(ids):fail("画布包含循环,不能发布。")
if len(starts)==len(ends)==1:
start,end=starts[0],ends[0]
if incoming[start] or outgoing[end]:fail("开始不能有入边,结束不能有出边。")
def reach(root,adj):
visited=set();todo=[root]
while todo:
i=todo.pop()
if i not in visited:visited.add(i);todo.extend(adj[i])
return visited
for i in set(ids)-reach(start,outgoing):fail("节点未从开始连接。",i)
for i in set(ids)-reach(end,incoming):fail("节点无法到达结束。",i)
for ident,node in resolved.items():
source=node["config"].get("input_from")
if source and source not in incoming.get(ident,[]):fail("输入必须引用直接上游节点,并先建立连线。",ident)
# Require every path to approval to contain generation, and every tool path to have approval.
generated={};approved={}
for i in order:
parents=incoming[i];k=kinds.get(i)
g=bool(parents) and all(generated.get(p,False) for p in parents)
a=bool(parents) and all(approved.get(p,False) for p in parents)
if k=="approval" and not g:fail("人工确认的所有路径必须先生成文稿。",i)
if k=="tool" and not a:fail("工具调用的所有路径必须经过人工确认。",i)
generated[i]=g or k=="llm"
approved[i]=(a or k=="approval") and k!="llm"
return {"valid":not issues,"issues":issues,"order":order,"nodes":resolved}
|