o i>@sdZddlmZddlZddlmZmZmZmZddl m Z ddl m Z m Z mZmZddlmZmZmZmZddlmZdd lmZmZmZmZdd lmZmZdd lm Z ed d dZ!edd dZ"edd dZ#edd dZ$edZ%e r~ddl&m'Z'm(Z(m)Z)Gdddee!e"e$e#fZ*e GdddZ+e GdddZ,e GdddZ-e GdddZ.e GdddZ/ed e+e,Be-Be.Be/BZ0 e Gd!d"d"Z1e Gd#d$d$ee!e"e#fZ2e d%d&Gd'd(d(ee!e"fZ3Gd)d*d*ee!e"e#fZ4dS)+aPath and edge definition for graph navigation. This module provides the building blocks for defining paths through a graph, including transformations, maps, broadcasts, and routing to destinations. Paths enable complex data flow patterns in graph execution. ) annotationsN) AsyncIterableCallableIterableSequence) dataclass) TYPE_CHECKINGAnyGeneric get_origin)ProtocolSelf TypeAliasTypeTypeVar)BaseNode)ForkIDJoinIDNodeIDgenerate_placeholder_node_id)NodeStep StepContext)GraphBuildingErrorStateTT)infer_varianceDepsTOutputTInputTT)AnyDestinationNodeDestinationNode SourceNodec@seZdZdZd ddZdS) TransformFunctiona$Protocol for step functions that can be executed in the graph. Transform functions are sync callables that receive a step context and return a result. This protocol enables serialization and deserialization of step calls similar to how evaluators work. This is very similar to a StepFunction, but must be sync instead of async. Type Parameters: StateT: The type of the graph state DepsT: The type of the dependencies InputT: The type of the input data OutputT: The type of the output data ctx"StepContext[StateT, DepsT, InputT]returnrcCst)zExecute the step function with the given context. Args: ctx: The step context containing state, dependencies, and inputs Returns: An awaitable that resolves to the step's output )NotImplementedError)selfr"r'_/var/www/html/karishye-ai-python/venv/lib/python3.10/site-packages/pydantic_graph/beta/paths.py__call__0s zTransformFunction.__call__N)r"r#r$r)__name__ __module__ __qualname____doc__r)r'r'r'r(r! sr!c@eZdZUdZded<dS)TransformMarkerzA marker indicating a data transformation step in a path. Transform markers wrap step functions that modify data as it flows through the graph path. z%TransformFunction[Any, Any, Any, Any] transformNr*r+r,r-__annotations__r'r'r'r(r/< r/c@$eZdZUdZded< ded<dS) MapMarkerzA marker indicating that iterable data should be map across parallel paths. Spread markers take iterable input and create parallel execution paths for each item in the iterable. rfork_id JoinID | Nonedownstream_join_idNr1r'r'r'r(r5Hs r5c@r4)BroadcastMarkerzA marker indicating that data should be broadcast to multiple parallel paths. Broadcast markers create multiple parallel execution paths, sending the same input data to each path. Sequence[Path]pathsrr6Nr1r'r'r'r(r9Vs r9c@r.) LabelMarkerzA marker providing a human-readable label for a path segment. Label markers are used for debugging, visualization, and documentation purposes to provide meaningful names for path segments. strlabelNr1r'r'r'r(r<er3r<c@r.)DestinationMarkerzA marker indicating the target destination node for a path. Destination markers specify where data should be routed at the end of a path execution. rdestination_idNr1r'r'r'r(r?qr3r?PathItemc@s8eZdZUdZded< ed ddZed dd Zd S) PathzA sequence of path items defining data flow through the graph. Paths represent the route that data takes through the graph, including transformations, forks, and routing decisions. zlist[PathItem]itemsr$"BroadcastMarker | MapMarker | NonecCs*t|jD] }t|ttBr|SqdS)zGet the most recent fork or map marker in this path. Returns: The last BroadcastMarker or MapMarker in the path, or None if no forks exist N)reversedrC isinstancer9r5)r&itemr'r'r( last_forks zPath.last_forkcCst|jddS)zCreate a new path with the first item removed. Returns: A new Path with all items except the first one N)rBrCr&r'r'r( next_pathszPath.next_pathN)r$rD)r$rB)r*r+r,r-r2propertyrHrKr'r'r'r(rBs   rBc@sbeZdZUdZded< ddd#d dZddd$ddZd%ddZdddd&ddZd'd!d"Z dS)( PathBuilderarA builder for constructing paths with method chaining. PathBuilder provides a fluent interface for creating paths by chaining operations like transforms, maps, and routing to destinations. Type Parameters: StateT: The type of the graph state DepsT: The type of the dependencies OutputT: The type of the current data in the path zSequence[PathItem] working_itemsNr6 destination'DestinationNode[StateT, DepsT, OutputT]extra_destinationsr6 str | Noner$rBcGsP|rtdd|f|Dtt|ptdd}nt|j}tg|j|dS)aRoute the path to one or more destination nodes. Args: destination: The primary destination node *extra_destinations: Additional destination nodes (creates a broadcast) fork_id: Optional ID for the fork created when multiple destinations are specified Returns: A complete Path ending at the specified destination(s) cSsg|] }tt|jgdqS)rC)rBr?id.0dr'r'r( sz"PathBuilder.to.. broadcastr;r6rT)r9rrrr?rUrBrN)r&rPr6rR next_itemr'r'r(tos zPathBuilder.toforksr:cCs0t|tt|p tdd}tg|j|dS)a8Create a fork that broadcasts data to multiple parallel paths. Args: forks: The sequence of paths to run in parallel fork_id: Optional ID for the fork, defaults to a generated value Returns: A complete Path that forks to the specified parallel paths rZr[rT)r9rrrrBrN)r&r^r6r\r'r'r(rZs zPathBuilder.broadcastfunc,TransformFunction[StateT, DepsT, OutputT, T]PathBuilder[StateT, DepsT, T]cC&t|}ttttfg|j|dS)zAdd a transformation step to the path. Args: func: The step function that will transform the data Returns: A new PathBuilder with the transformation added rN)r/rMrrrrN)r&r_r\r'r'r(r0 zPathBuilder.transformr6r8r&VPathBuilder[StateT, DepsT, Iterable[T]] | PathBuilder[StateT, DepsT, AsyncIterable[T]]r8cCsJttt|ptd|durt|ndd}ttttfg|j |dS)aSpread iterable data across parallel execution paths. This method can only be called when the current output type is iterable. It creates parallel paths for each item in the iterable. Args: fork_id: Optional ID for the fork, defaults to a generated value downstream_join_id: Optional ID of a downstream join node which is involved when mapping empty iterables Returns: A new PathBuilder that operates on individual items from the iterable mapNrerc) r5rrrrrMrrrrN)r&r6r8r\r'r'r(rgs zPathBuilder.mapr>r=#PathBuilder[StateT, DepsT, OutputT]cCrb)zAdd a human-readable label to this point in the path. Args: label: The label to add for documentation/debugging purposes Returns: A new PathBuilder with the label added rc)r<rMrrrrN)r&r>r\r'r'r(r>rdzPathBuilder.label)rPrQrRrQr6rSr$rB)r^r:r6rSr$rB)r_r`r$ra)r&rfr6rSr8rSr$ra)r>r=r$rh) r*r+r,r-r2r]rZr0rgr>r'r'r'r(rMs   rMF)initc@sHeZdZUdZded< ded< ded< dd d Zedd d ZdS)EdgePathzA complete edge connecting source nodes to destinations via a path. EdgePath represents a complete connection in the graph, specifying the source nodes, the path that data follows, and the destination nodes. (Sequence[SourceNode[StateT, DepsT, Any]]_sourcesrBpathlist[AnyDestinationNode] destinationssourcescCs||_||_||_dSN)rlrmro)r&rprmror'r'r(__init__s zEdgePath.__init__r$cCs|jSrq)rlrJr'r'r(rp"szEdgePath.sourcesN)rprkrmrBrorn)r$rk)r*r+r,r-r2rrrLrpr'r'r'r(rj s  rjc@s`eZdZdZd(ddZdd d)ddZdd d*ddZdddd+ddZd,d!d"Zd-d&d'Z dS).EdgePathBuilderaA builder for constructing complete edge paths with method chaining. EdgePathBuilder combines source nodes with path building capabilities to create complete edge definitions. It cannot use dataclass due to type variance issues. Type Parameters: StateT: The type of the graph state DepsT: The type of the dependencies OutputT: The type of the current data in the path rprk path_builderrhcCs||_||_dS)zInitialize an edge path builder. Args: sources: The source nodes for this edge path path_builder: The path builder for defining the data flow N)rp _path_builder)r&rprtr'r'r(rr4s zEdgePathBuilder.__init__NrOrPLDestinationNode[StateT, DepsT, OutputT] | type[BaseNode[StateT, DepsT, Any]]rRr6rSr$EdgePath[StateT, DepsT]cGsft|p|}tdd|D}dd|g|RD}t|j|jj|dg|ddRd|i|d S) aComplete the edge path by routing to destination nodes. Args: destination: Either a destination node or a function that generates edge paths *extra_destinations: Additional destination nodes (creates a broadcast) fork_id: Optional ID for the fork created when multiple destinations are specified Returns: A complete EdgePath connecting sources to destinations css|] }t|p |VqdSrq)r rVr'r'r( Tsz%EdgePathBuilder.to..cSs"g|] }t|r t|n|qSr')inspectisclassrrVr'r'r(rYUs"z&EdgePathBuilder.to..rrINr6rprmro)r tuplerjrprur])r&rPr6rRror'r'r(r]@s $zEdgePathBuilder.to get_forks3Callable[[Self], Sequence[EdgePath[StateT, DepsT]]]cCsX||}dd|D}|std|d|jj||d}dd|D}t|j||dS)aSBroadcast this EdgePathBuilder into multiple destinations. Args: get_forks: The callback that will return a sequence of EdgePaths to broadcast to. fork_id: Optional node ID to use for the resulting broadcast fork. Returns: A completed EdgePath with the specified destinations. cSsg|]}t|jjqSr')rBrmrC)rWxr'r'r(rYisz-EdgePathBuilder.broadcast..z The call to z4 returned no branches, but must return at least one.rOcSsg|] }|jD]}|qqSr')ro)rWeprXr'r'r(rYmsr{)rrurZrjrp)r&r}r6new_edge_paths new_pathsrmror'r'r(rZ\s zEdgePathBuilder.broadcastrer&^EdgePathBuilder[StateT, DepsT, Iterable[T]] | EdgePathBuilder[StateT, DepsT, AsyncIterable[T]]r8r7!EdgePathBuilder[StateT, DepsT, T]cCs0t|jdkr tdt|j|jj||ddS)awSpread iterable data across parallel execution paths. Args: fork_id: Optional ID for the fork, defaults to a generated value downstream_join_id: Optional ID of a downstream join node which is involved when mapping empty iterables Returns: A new EdgePathBuilder that operates on individual items from the iterable rIzMap is not currently supported with multiple source nodes. You can work around this by just creating a separate edge for each source.rerprt)lenrpr%rsrurg)r&r6r8r'r'r(rgtszEdgePathBuilder.mapr_r`cCt|j|j|dS)zAdd a transformation step to the edge path. Args: func: The step function that will transform the data Returns: A new EdgePathBuilder with the transformation added r)rsrprur0)r&r_r'r'r(r0 zEdgePathBuilder.transformr>r='EdgePathBuilder[StateT, DepsT, OutputT]cCr)zAdd a human-readable label to this point in the edge path. Args: label: The label to add for documentation/debugging purposes Returns: A new EdgePathBuilder with the label added r)rsrprur>)r&r>r'r'r(r>rzEdgePathBuilder.label)rprkrtrh)rPrvrRrvr6rSr$rw)r}r~r6rSr$rw)r&rr6rSr8r7r$r)r_r`r$r)r>r=r$r) r*r+r,r-rrr]rZrgr0r>r'r'r'r(rs's   rs)5r- __future__rrycollections.abcrrrr dataclassesrtypingrr r r typing_extensionsr r rrpydantic_graphrpydantic_graph.beta.id_typesrrrrpydantic_graph.beta.steprrpydantic_graph.exceptionsrrrrrrpydantic_graph.beta.node_typesrrr r!r/r5r9r<r?rArBrMrjrsr'r'r'r(sL             i