gz ddlmZddlmZmZddlmZmZddl m Z ddl m Z m Z mZmZmZmZddlmZmZddlmZmZe rdd lmZn ed d Zd Zeddd Z eddeZ edd dZ eGddeeefZGddeeeeefZeGddeeZ eGddZ!eGddeeeefZ"y )) annotations)ABCabstractmethod) dataclass is_dataclass)cache) TYPE_CHECKINGAnyClassVarGeneric get_originget_type_hints)NeverTypeVar)_utils exceptions)StateTrN)default)GraphRunContextBaseNodeEndEdgeNodeDefDepsTRunEndTT) covariantr NodeRunEndTr)r contravariantc(eZdZUdZded< ded<y)rzContext for a graph.rstaterdepsN__name__ __module__ __qualname____doc____annotations__I/var/www/openai/venv/lib/python3.12/site-packages/pydantic_graph/nodes.pyrrs M! K%r*rcteZdZUdZdZded< ed dZee d dZ ed dZ ed dZ y )rzBase class for a node.FzClassVar[bool]docstring_notesc Kyw)aBRun the node. This is an abstract method that must be implemented by subclasses. !!! note "Return types used at runtime" The return type of this method are read by `pydantic_graph` at runtime and used to define which nodes can be called next in the graph. This is displayed in [mermaid diagrams](mermaid.md) and enforced when running the graph. Args: ctx: The graph context. Returns: The next node to run or [`End`][pydantic_graph.nodes.End] to signal the end of the graph. Nr))selfctxs r+runz BaseNode.run0s " sc|jS)zGet the ID of the node.)r$)clss r+get_idzBaseNode.get_idCs||r*c|jsy|j}|r+t|r |j|jdrd}|rddl}|j |}|S)aGet a note about the node to render on mermaid charts. By default, this returns a note only if [`docstring_notes`][pydantic_graph.nodes.BaseNode.docstring_notes] is `True`. You can override this method to customise the node notes. N(r)r-r'r startswithr$inspectcleandoc)r3 docstringr8s r+get_notezBaseNode.get_noteIs]""KK c*y/C/Cs||nTUDV/WI  ((3Ir*cTt|j|d} |d}i}d}d}t j |D]}t j|\}} td| Dtd} t|xs|} | tur| }Q| turd}\t| tr| ||j<tjd |t||j|j!|||S#t$r}tjd|d|d}~wwxYw) zGet the node definition.T)localnsinclude_extrasreturnzNode z2 is missing a return type hint on its `run` methodNFc3BK|]}t|ts|yw)N) isinstancer).0as r+ z(BaseNode.get_node_def..ksGKq:a3FKszInvalid return type: )rr1KeyErrorrGraphSetupErrorrget_union_argsunpack_annotatednextrr rr issubclassr4rr;) r3local_ns type_hints return_hintenext_node_edgesend_edgereturns_base_node return_typeredgereturn_type_origins r+ get_node_defzBaseNode.get_node_def]s9$CGGXdS  u$X.K,. $"'!00=K'-'>'>{'K $KGKGdTD!+K!8!GK !S(#x/$(!.98< 2 2 45 003H 1VWW>  JJL LLN      ) u,,uSE9k-lmst t usC?? D'D""D'N)r0zGraphRunContext[StateT, DepsT]r?z/BaseNode[StateT, DepsT, Any] | End[NodeRunEndT])r?str)r? str | None)rKzdict[str, Any] | Noner?z#NodeDef[StateT, DepsT, NodeRunEndT]) r$r%r&r'r-r(rr1 classmethodrr4r;rUr)r*r+rr%sl &+O^+  $  &    r*rceZdZUdZded<y)rz:Type to return from a node to signal the end of the graph.rdataNr#r)r*r+rrs D M(r*rceZdZUdZded<y)rz2Annotation to apply a label to an edge in a graph.rWlabelNr#r)r*r+rrs< r*rcXeZdZUdZded< ded< ded< ded < d ed < d ed <y)raDefinition of a node. This is a primarily internal representation of a node; in general, it shouldn't be necessary to use it directly. Used by [`Graph`][pydantic_graph.graph.Graph] to store information about a node, and when generating mermaid graphs. z*type[BaseNode[StateT, DepsT, NodeRunEndT]]noderVnode_idrWnotezdict[str, Edge]rOz Edge | NonerPboolrQNr#r)r*r+rrs> 54% L :$$3cbr*r)# __future__r _annotationsabcrr dataclassesrr functoolsrtypingr r r r r rtyping_extensionsrrrrr!r__all__rrrrrrrrr)r*r+rks 2#/TT,  Xt ,F J )tT :emtUC gT:= &gfem,& &Y sGFE;67Y x )'' ) )   cgfe[01c cr*