"jv} &SrSSKJr SSKrSSKrSSKJrJr SSK J r J r J r J r JrJr SSKJrJrJrJrJr SSKJrJrJr SSKJr SS KJrJrJrJ r J!r!J"r"J#r#J$r$J%r%J&r& SS K'J(r(J)r)J*r*J+r+J,r, SS K-J.r. SS K/J0r0J1r1 SS K2J3r3J4r4J5r5J6r6 SSK7J8r8J9r9 SSK:J;r;Jr>J?r?J@r@ SSKAJBrBJCrC SSKDJErEJFrFJGrG SSKHJIrIJJrJ SSKKJLrLJMrMJNrNJOrOJPrPJQrQJRrRJSrSJTrT SSKUJVrVJWrWJXrXJYrYJZrZ SSK[J\r\J]r]J^r^ SSK_J`r`JaraJbrbJcrc SSKdJereJfrf SSKgJhrhJiriJjrjJkrkJlrlJmrmJnrnJoroJprp SSKqJrrrJsrsJtrtJuruJvrvJwrw SSKxJyryJzrzJ{r{ \RS:aSSK}J~r~ O\~r~\5"SSS9r\5"S SS9r\5"S!SS9r\5"S"SS9r\5"S#SS9r\5"S$\B\\\4SS%9r\5"S&SS9r\5"S'SS9r\5"S(SS9r\5"S)SS9r\"S*S+9"S,S-\\55r\"S.S/55r\"S0S155r\"S*S29"S3S4\\\\\455r\"S5S655r\"S7S8\55r"S9S:\\\\45r\"S;S<55r\"S=S>55r\"S?S@\\\\455rSZSAjrS[SBjr\SC5r\"S*S+9"SDSE\\\\\455rS\SFjrS]SGjrS]SHjrS^SIjrS_SJjrS`SKjrSaSLjrSbSMjrScSNjrSOr\ SPr\ SQr\"SRSS55r\"STSU55rSdSWjr\"SXSV55rSeSYjrg)faBuilder-based graph API: builder, graph runner, and mermaid rendering. This module is the canonical home for the builder-based graph API: [`GraphBuilder`][pydantic_graph.GraphBuilder] for declaratively constructing executable graphs, [`Graph`][pydantic_graph.Graph] and [`GraphRun`][pydantic_graph.GraphRun] for executing them, and the mermaid rendering helpers used by `Graph.render()`. The same public symbols are re-exported from `pydantic_graph` directly. ) annotationsN)Counter defaultdict)AsyncGenerator AsyncIterable AsyncIteratorCallableIterableSequence)AbstractContextManagerAsyncExitStack ExitStackasynccontextmanagercontextmanager) dataclassfieldreplace)NoneType) TYPE_CHECKINGAnyGenericLiteral TypeGuardcastget_args get_originget_type_hintsoverload)BrokenResourceError CancelScopeClosedResourceErrorcreate_memory_object_streamcreate_task_group) TaskGroup)MemoryObjectReceiveStreamMemoryObjectSendStream)Never TypeAliasTypeTypeVar assert_never)_utils exceptions)UNSET AbstractSpanUnsetget_traceparentinfer_obj_name logfire_span)BaseNodeEnd)DecisionDecisionBranchDecisionBranchBuilder)GraphBuildingErrorGraphValidationError) ForkID ForkStack ForkStackItemJoinIDNodeID NodeRunIDTaskIDgenerate_placeholder_node_idreplace_placeholder_id)JoinJoinNode JoinStateReducerContextReducerFunction)EndNodeFork StartNode)AnyDestinationNodeAnyNodeDestinationNode SourceNode) ParentForkParentForkFinder) BroadcastMarkerDestinationMarkerEdgePathEdgePathBuilder LabelMarker MapMarkerPath PathBuilderTransformMarker)NodeStepStep StepContext StepFunctionStepNodeStreamFunction)TypeOrTypeExpressionget_callable_nameunpack_type_expression) )BaseExceptionGroupStateTT)infer_varianceDepsTInputTOutputTSourceT SourceNodeT)boundrg SourceOutputT GraphInputT GraphOutputTTFinitcD\rSrSr%SrS\S'S Sjr\S Sj5rSr g) EndMarkergzA marker indicating the end of graph execution with a final value. EndMarker is used internally to signal that the graph has completed execution and carries the final output value. Type Parameters: OutputT: The type of the final output value rj_valuecXlgNrwselfvalues Y/home/mande/repo/quber/.venv/lib/python3.13/site-packages/pydantic_graph/graph_builder.py__init__EndMarker.__init__us cUR$ryrzr|s r~r}EndMarker.valueys {{rrzN)r}rj)returnrj) __name__ __module__ __qualname____firstlineno____doc____annotations__rpropertyr}__static_attributes__rr~rurugs* O:rruc$\rSrSr%SrS\S'Srg) ErrorMarker~a2A marker indicating that a graph node raised an exception. Yielded by the graph iterator instead of raising immediately, allowing the caller to recover by sending new tasks via `GraphRun.next()` or `GraphRun.override_next()`. If the caller does not override, the error is re-raised on the next iteration. BaseExceptionerrorrNrrrrrrrrrr~rr~s +rrc<\rSrSr%SrS\S'S\S'S\S'S rg ) JoinItemzAn item representing data flowing into a join operation. JoinItem carries input data from a parallel execution path to a join node, along with metadata about which execution 'fork' it originated from. r=join_idrinputsr; fork_stackrNrrrr~rrs" O9 K0Krrreprcv^\rSrSr%SrS\S'S\S'S\S'S \S 'S \S 'S \S'S\S'S\S'S\S'S\S'S$SjrS%SjrSSSSSS.S&SjjrSSSSSS.S&Sjjr \ SSSSSS.S'Sjj5r SSS.S(S jjr S)U4S!jjr S)S"jrS#rU=r$)*GraphaA complete graph definition ready for execution. The Graph class represents a complete workflow graph with typed inputs, outputs, state, and dependencies. It contains all nodes, edges, and metadata needed for execution. 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 str | Nonenamez type[StateT] state_typez type[DepsT] deps_typez type[InputT] input_typez type[OutputT] output_typeboolauto_instrumentdict[NodeID, AnyNode]nodesdict[NodeID, list[Path]]edges_by_source dict[JoinID, ParentFork[NodeID]] parent_forksdict[JoinID, set[JoinID]]intermediate_join_nodesc`URRU5nUc[SUS35eU$)zGet the parent fork information for a join node. Args: join_id: The ID of the join node Returns: The parent fork information for the join Raises: RuntimeError: If the join ID is not found or has no parent fork Node zE is not a join node or did not have a dominating fork (this is a bug))rget RuntimeError)r|rresults r~get_parent_forkGraph.get_parent_forks9""&&w/ >wi/tuv v rcTURR5H nX;dM g g)a$Check if a join is 'final' (has no downstream joins with the same parent fork). A join is non-final if it appears as an intermediate node for another join with the same parent fork. Args: join_id: The ID of the join node Returns: True if the join is final, False if it's non-final FT)rvalues)r|rintermediate_joinss r~ is_final_joinGraph.is_final_joins-#'">">"E"E"G ,#HrNTstatedepsrspan infer_namec# U(a URc[USS9nUbX`lURXX4SS9IShvN nSnURU5IShvN nMN#N![aR [ U[ 5(dS5e[[ [U5RssSSS5IShvN $f=f!,IShvN (df  g=f7f)aExecute the graph and return the final output. This is the main entry point for graph execution. It runs the graph to completion and returns the final output value. Args: state: The graph state instance deps: The dependencies instance inputs: The input data for the graph span: Optional span for tracing/instrumentation infer_name: Whether to infer the graph name from the calling frame. Returns: The final output from the graph execution NdepthFrz'Graph run should end with an EndMarker.) rr1iternextStopAsyncIteration isinstancerurrjr}) r|rrrrr inferred_name graph_runevents r~run Graph.runs0 $))+*4q9M() 995FZ_9``dmEA"+.."77E a8)A%eY77b9bb7 ' 2E:@@@a``Aa``s}=C A#C CA'A%A'!C#C %A''AC.C/ C ;B><C CCC C CC c U(a URc[USS9nUbX`l[R"UR XX4SS95$)asSynchronously execute the graph and return the final output. This is a convenience wrapper around [`run`][pydantic_graph.graph_builder.Graph.run] that runs the coroutine on the current event loop via `loop.run_until_complete(...)`. As such, it cannot be called from inside async code or when an event loop is already running. Args: state: The graph state instance deps: The dependencies instance inputs: The input data for the graph span: Optional span for tracing/instrumentation infer_name: Whether to infer the graph name from the calling frame. Returns: The final output from the graph execution rrFr)rr1r+run_until_completer)r|rrrrrrs r~run_syncGraph.run_syncsI2 $))+*4q9M() ((QWot)uvvrc # U(a URc[USS9nUbX`l[5nSnUc9UR(a'SUR3n UR [ XS95nOUR U5nUcSO [ U5n [[[[4"UUUUU S9IShvN n U 7v SSS5IShvN SSS5 gN"N!,IShvN (df  N$=f!,(df  g=f7f)aCreate an iterator for step-by-step graph execution. This method allows for more fine-grained control over graph execution, enabling inspection of intermediate states and results. Args: state: The graph state instance deps: The dependencies instance inputs: The input data for the graph span: Optional span for tracing/instrumentation infer_name: Whether to infer the graph name from the calling frame. Yields: A GraphRun instance that can be iterated for step-by-step execution Nrcrz run graph )graph)rrrr traceparent) rr1rr enter_contextr2r0GraphRunrfrhrj) r|rrrrrrstack entered_span span_namerrs r~r Graph.iter8s2 $))+*4q9M() [E04L|''#-TYYK 8I#(#6#6|I7Z#[L$2248 "."6$OL[TU]5nUSSSUSUS3$)N )super__repr__)r| super_repr __class__s r~rGraph.__repr__ws3W%' Sb/""TF"Z^,<==rc"UR5$)zyReturn a Mermaid diagram representation of the graph. Returns: A string containing the Mermaid diagram of the graph )rrs r~__str__ Graph.__str__|s {{}r)r)rr=rzParentFork[NodeID])rr=rr) rrfrrhrrir+AbstractContextManager[AbstractSpan] | Nonerrrrj) rrfrrhrrirrrrrz0AsyncGenerator[GraphRun[StateT, DepsT, OutputT]])rrrStateDiagramDirection | Nonerstrrr)rrrrrrrrrrrrrrrr __classcell__)rs@r~rrs  M&'%&@  5--/22566K "*<@'A'A 'A  'A : 'A'A 'AX<@ww w  w : ww w><@0 0  0  0 : 0 0  :0 0 d-1\` n> rrcH\rSrSr%SrS\S'S\S'\"SS9rS \S 'S rg ) GraphTaskRequestizA request to run a task representing the execution of a node in the graph. GraphTaskRequest encapsulates all the information needed to execute a specific node, including its inputs and the fork context it's executing within. r>node_idrrFrr;rrN) rrrrrrrrrrrr~rrs- O( K&!u-J -rrcF\rSrSr%Sr\"SS9rS\S'\S Sj5r Sr g ) GraphTaskia A task representing the execution of a node in the graph. GraphTask encapsulates all the information needed to execute a specific node, including its inputs and the fork context it's executing within, and has a unique ID to identify the task within the graph run. Frr@task_idc[U[5(aU$[URURURU"55$ry)rrrrr)request get_task_ids r~ from_requestGraphTask.from_requests7 gy ) )N'..':L:Lkm\\rrN)rrrCallable[[], TaskID]rr) rrrrrrrr staticmethodrrrrr~rrs/'GV'*]]rrc \rSrSrSrSSjrSrSSjr\S5r \ SSj5r \ SSj5r S S .SS jjr SS jr SS jr SSSjjrS SjrS Sjr\S!Sj5r\S"Sj5rS#SjrS$SjrSrg)%ria>A single execution instance of a graph. GraphRun manages the execution state for a single run of a graph, including task scheduling, fork/join coordination, and result tracking. Type Parameters: StateT: The type of the graph state DepsT: The type of the dependencies OutputT: The type of the output data cXlX lX0lX@l0UlSUlSUlSUl[[RUR5S54n[[RXFUR5S9Ul[5Ul["[$[&[(4"URURURUR URUR5UlUR*R-UR5UlXPl[35Ulg)zInitialize a graph run. Args: graph: The graph to execute state: The graph state instance deps: The dependencies instance inputs: The input data for the graph traceparent: Optional trace parent for instrumentation Nr)rrrr)rrrr_active_reducers_next _next_task_id_next_node_run_idr<rJid_get_next_node_run_idr_get_next_task_id _first_taskr#_iterator_task_group_GraphIteratorrfrhrj_iterator_instance iter_graph _iterator_GraphRun__traceparentr _async_exit_stack)r|rrrrrinitial_fork_stacks r~rGraphRun.__init__s$ ' ' ( %KM2TX ,!")6y||TE_E_Eacd)e(g$LLX\XnXnXp %6$7!"01G"H JJ JJ II  % %  & &  " " # 00;;D  # # 8 8 > > @..'') ) )  # # 6 6 < < >  # # 8 8 > > @..'') ) )s5C&A6A%C&.A4/C&6A&C#CC##C&cgryrr|requireds r~ _traceparentGraphRun._traceparentsGJrcgryrrs r~r'r(s#&rT)r&cnURcU(a[R"S5eUR$)a Get the trace parent for instrumentation. Args: required: Whether to raise an error if no traceparent exists Returns: The traceparent string, or None if not required and not set Raises: GraphRuntimeError: If required is True and no traceparent exists z&No span was created for this graph run)rr,GraphRuntimeErrorr%s r~r'r(s0    %(../WX X!!!rcU$)zIReturn self as an async iterator. Returns: Self for async iteration rrs r~ __aiter__GraphRun.__aiter__s  rcX# URc#[UR5IShvN UlO2URRUR5IShvN Ul[ UR[ 5(aURR eUR$N}NL7f)zGet the next item in the async iteration. Returns: The next execution result from the graph Raises: Exception: If a node raised an error and the caller has not recovered via `override_next()`. N)ranextr asendrrrrs r~ __anext__GraphRun.__anext__ sv :: $T^^44DJ#~~33DJJ??DJ djj+ . .**"" "zz5?s"&B*B&2B*B(A B*(B*Nc# URc[U5IShvN UbURU5 [U5IShvN $N+N7f)a>Advance the graph execution by one step. This method allows for sending a value to the iterator, which is useful for resuming iteration or overriding intermediate results. Args: value: Optional value to send to the iterator Returns: The next execution result: either an EndMarker, or sequence of GraphTasks N)rr0 _set_nextr{s r~r GraphRun.next4sI :: +     NN5 !4[   !s!AA &AA A Ac&URU5 g)aOverride the next pending step, allowing the graph to continue after an `End` or error. This is used by hook systems (like `after_node_run` or `on_node_run_error`) to redirect the graph to a new node when the current step produced an `End` result or raised an error, or to signal early completion by passing an `EndMarker`. Must only be called between iterations (not while an iteration is in flight). Args: value: New task requests to execute next, or an `EndMarker` to signal completion. N)r5r{s r~ override_nextGraphRun.override_nextJs urc[U[5(aXlgUVs/sH"n[R X R 5PM$ snUlgs snfry)rrurrrr)r|r}gtrs r~r5GraphRun._set_nextXsA eY ' 'JY^_Y^RU)006L6LMY^_DJ_s)AcBUR=(d UR/$)zoGet the next task(s) to be executed. Returns: The next execution item, or the initial task if none is set )rrrs r~ next_taskGraphRun.next_task^szz/d..//rcn[UR[5(aURR$g)zyGet the final output if the graph has completed. Returns: The output value if execution is complete, None otherwise N)rrrur}rs r~outputGraphRun.outputgs( djj) , ,::## #rc`[SUR35nU=RS- slU$Nztask:)r@rr|next_ids r~rGraphRun._get_next_task_idrs05!3!3 456 arc`[SUR35nU=RS- slU$rD)r?rrFs r~rGraphRun._get_next_node_run_idws0eD$:$:#;<= !#r) __traceparentrrrr r r rrrrrrr) rz%Graph[StateT, DepsT, InputT, OutputT]rrfrrhrrirr)rrrrrr)r&zLiteral[False]rrr)r&rrr)rz7AsyncIterator[EndMarker[OutputT] | Sequence[GraphTask]])r(EndMarker[OutputT] | Sequence[GraphTask]ry)r}z6EndMarker[OutputT] | Sequence[GraphTaskRequest] | NonerrL)r}z/Sequence[GraphTaskRequest] | EndMarker[OutputT]rNone)rz6EndMarker[OutputT] | ErrorMarker | Sequence[GraphTask])rzOutputT | None)rr@)rr?)rrrrrrrrrrrr'r-r2rr8r5rr>rArrrrrr~rrs 62462 62  62  62 62p J**JJ &&/3" *OS!K! 1!, ` 00 rrc*\rSrSr%S\S'S\S'Srg)_GraphTaskAsyncIterablei}z"AsyncIterable[Sequence[GraphTask]]iterabler;rrN)rrrrrrrrr~rOrO}s00rrOcF\rSrSr%S\S'S\S'SrS\S'S rS \S 'S rg ) _GraphTaskResultirsourcez/EndMarker[Any] | Sequence[GraphTask] | JoinItemrTrsource_is_finishedNzBaseException | Nonerr)rrrrrrTrrrrr~rRrRs$  ;;##"&E &rrRc\rSrSr%S\S'S\S'S\S'S\S 'S \S 'S \S '\"SS9rS\S'\"SS9rS\S'\"SS9rS\S'\"SS9r S\S'\"SS9r S\S'Sr S,Sjr S-Sjr S.SjrS/SjrS0SjrS1S jrS2S!jrS3S"jrS4S#jrS5S$jrS6S%jrS7S&jrS8S'jrS9S(jrS:S)jrS*rg+);r iz"Graph[StateT, DepsT, Any, OutputT]rrfrrhrr$ task_groupzCallable[[], NodeRunID]get_next_node_run_idrget_next_task_idFrrzdict[TaskID, CancelScope] cancel_scopeszdict[TaskID, GraphTask] active_tasksz)dict[tuple[JoinID, NodeRunID], JoinState]active_reducersz(MemoryObjectSendStream[_GraphTaskResult]rz+MemoryObjectReceiveStream[_GraphTaskResult]r!cz0Ul0Ul0Ul[["5uUlUlSUlg)NrE)rYrZr[r"rRrr!rrs r~ __post_init___GraphIterator.__post_init__s;!=XYi=j=l:!:!"rc # URIShvN XRUR'URU/5 URIShvN UR(dUR (Ga URShvN nUR b:[UR 57vn[U[5(a UR eO;[UR[5(a URnOUR7vn[U[5(aURURR5IShvN UR(a$URRR!5 SSS5IShvN SSS5IShvN g[U[5(GaoUnUR"R%UR&5R(nUR+UR&UR,5upgUR"R.UR&n[U[05(d SU35eUR R3UR&U45n U c5UR55n [7X5=oR UR&U4'[9UR:UR<U S9n UR?XR@URB5U l U RD(aURGXV5IShvN O8[U[5(aeUHn XRU R'M [IURRK55n /nURMURU 5HupUR ROX45n UR"R.Un[U[05(d SU35eURQXR@U RR5nURUU5 M U(a2UHn XRU R'M URU5 [U[V5(a[UR[V5(adUVs1sHnURiM nnURH8nURU;dMURUR5IShvN M: URU5 URX(a-URURR5IShvN UR(aGM UR (Ga[IUR R[55GHuupn SnUR"R\R3U[_55nUR"R%U5nUHnUR R[5HuunnnUU:XdMSnSnU RRH+nUR(UR(:XdMUR`n O URRH+nUR(UR(:XdMUR`n O U(dMU(dMUU:XdMSn O U(dM O U(aGM5UR ROX45 UR"R.Un[U[05(d SU35eURQXR@U RR5nU7vn[U[5(aFURRR!5 SSS5IShvN SSS5IShvN g[U[5(aeUHn XRU R'M UVs1sHnURiM nnUH8nURU;dMURUR5IShvN M: URU5 GM UR(aGMUR (aGM SSS5IShvN SSS5IShvN [eS5eGNGNaGN,GNkGN(GNGNs snfGNGNv GNbGN4GN's snfNNO!,IShvN (df  Nd=f![ba8 URRR!5 SSS5IShvN gf=fN!,IShvN (df  N=f7f)NzExpected a `Join` but got )rr join_stateFTzpGraph run completed, but no result was produced. This is either a bug in the graph or a bug in the graph runner.)3rrZr_handle_execution_requestr!r[rrrrrru _finish_taskrSrV cancel_scopecancelrrrfork_id_resolve_join_fork_runrrrCrinitial_factoryrErFrrreducecurrentrcancelled_sibling_tasks_cancel_sibling_taskslistr_get_completed_fork_runspop_handle_non_fork_edgesdownstream_fork_stackextendr rTitemsrset node_run_id GeneratorExitr)r| first_task task_resultmaybe_overridden_resultrparent_fork_id fork_run_idrp join_noder`ricontextnew_tasktasks_by_id_values join_tasksr new_taskst new_task_ids should_skiprjoin_parent_forkintermediate_join_id other_join_id_other_join_statejoin_parent_fork_run_idother_parent_fork_run_idfsis r~r _GraphIterator.iter_graphs ***^ 8B!!*"4"45.. |< 444++t/C/C/C151J1JL&+*00<ALKL]L]@^:^ 7#-.E{#S#S*5*;*;$;$T",K,>,>!I!I:E:L:L 7@K@R@R:R 7)*A9MM'+&7&7 8J8J8R8R&S S S#'#4#4$(OO$@$@$G$G$I &-54+**<",,CX!N!N)@151K1KFNN1[1c1cEIE`E`$*NNF4E4EF" B -1JJ,<,5E5EgOaOacicpcp5q 2#-#E#E*.*D*D^*a$a$a+56M{+[+[ ['[0GHJR$5$5h6F6F$G1H26d6G6G6N6N6P1Q.: >z J)*A8LL#-k.@.@(#K#KG^3_G^!AIIG^L3_-8-?-?+,99L+H262C2CAII2N,N,N.@!% > >?V W*==&*&7&7 8J8J8R8R&S S S#'#4#4#4 %/// GK4K_K_KeKeKgFh B 6 .3 59ZZ5W5W5[5[\cehej5k 248::3M3Mg3V 0B 05/Qm0(3{(-7=O:$/$, $ 4 4 8 8%,$:!"-1JJ,<, >?V WAGii+++t/C/C/C54+*B ~  C+5L& !T%5+`%b44`-O!TQ2K5+l0\ )Ki5444l! ,,335+**z {+***seb1ee:c=b4c=0c#c b7 cCc#b: :c# c=b=c= e%c&e+E?c#*c +Fc#.c c#'c#c Ac#c c#1B6c#++c#7c#c#.c#7c#? c#Cc# c= c!c=% e0c1e6d??eee e eec# URRUS5nUbUR5 URRUS5 g7fry)rYrnrdrZ)r|rscopes r~rb_GraphIterator._finish_taskKsB""&&w5   LLN gt,sA AcUHnX RUR'M UH)nURRURU5 M+ gry)rZrrV start_soon_run_tracked_task)r|rr}s r~ra(_GraphIterator._handle_execution_requestRsDH2:  h.. / H OO & &t'='=x H rc *# [5nX RUR'URU5IShvN n[U[5(aDURShvN nUR R [XS55IShvN M8UR R [X55IShvN SSS5 gN![aWnUR R [U/US95IShvN O![[4a Of=fSnASSS5 gSnAff=fNN UR R [U/55IShvN NN![[4a Nf=f!,(df  g=f7f)N)rF) r rYr _run_taskrrsendrRrr!rrOrP)r|t_rrexcrs r~r _GraphIterator._run_tracked_taskXsW ]e-2  rzz * #~~b11 f&=>>+1??ci"55::;KB[`;abbb11667G7STTT']2  11667GBVY7Z[[[+-@A] cb,;11667GB7OPPPT')<=  )]s FFCCC!E,"D:&D6'D:*)E,D8-E,E*E,F FC D3'D DD  D. DD.DD.!F% F.D33F6D:8E,:)E,#E&$E,)F*E,,E?<F>E??F F Fc # URnURnURnURnURnUR R Un[U[[-5(aURXuU5$[U[5(a[5nUR R(a2SUR3n UR[!XRUS95 ["[$[&[(4"X#US9n UR+U 5IShvN n SSS5 [U[,5(aUR/W U5$URUW U5$[U[05(a [3XEU5$[U[45(aUR7XuU5$[U[85(a [;U5$[=U5 gN!,(df  N=f7f)Nz run node )rnoderrr)rrrrrrrrrJrI _handle_edgesr[rrrrr2r\rfrhrcallrZ _handle_noderCrr5_handle_decisionrHrur*) r|taskrrrrrrrr step_contextrAs r~r_GraphIterator._run_taskvs yy,,__ zz( dI, - -%%dJ? ? d # #::--#,DGG9 5I'' YVZ([\*65#+=>U^de #yy66$))((<<))$ CC d # #GZ8 8 h ' '((zB B g & &V$ $  7s2B#G2%A?G!$G%G!)B6G2G!! G/+G2cURHnURnUb U"U5nOU[UR5nU[[ 1;aSnO-[ U5[LaU[U5;nO [X'5nU(dMyURURX#5s $ [SUSUS35e![an[SUS35UeSnAff=f)NTzDecision branch source z is not a valid type.zNo branch matched inputs z for decision node .)branchesmatchesrbrSrobjectrrrr TypeErrorr _handle_pathpath) r|decisionrrbranch match_tester inputs_match branch_sourcees r~r_GraphIterator._handle_decisions''F!>>L'+F3 6v}} E  S&M1#'L .'9#)Xm-D#DLr'1&'H |((fII%((6vh>QRZQ[[\]^^ %r*-D]OSh+ijpqqrs2 B88 CCCc,[U[5(a:[URRUR X R 55/$[U[5(a+[URRUR U5$[U[5(a;[UR5n[URXUR 55/$[U[5(a[UR5$[!U5 gry)rr^rsteprrrXrDrjoinr3rZrr4rudatar*)r| next_noder node_steps r~r_GraphIterator._handle_nodes i * *inn//1A1A:OdOdOfgh h  8 , ,INN--y/?/?L L  8 , , !4!45IillI4CXCXCZ[\ \  3 ' 'Y^^, ,  #rc>URRU5Rn[USSS25HYupEURU:XdMURR U5(aUS[ U5U- nOUnUR U4s $ [S5e)zgDetermine which parent fork run a join item belongs to, and the fork stack its output should run under.NrzParent fork run not found)rrre enumeraterlenrtr)r|rrryixrps r~rf%_GraphIterator._resolve_join_fork_runs33G<DDj2./DAyyN*::++G44-77LZ19L,M)-7)}}&;;;0677rcF/n[UR5VVs0sHupEURU_M nnnURR 5HFupxUR U5n U cMUR X'U5(dM4URXx45 MH U$s snnfry)rrrtr[keysr_is_fork_run_completedappend) r|rrZcompleted_fork_runsrrfork_run_indicesrrzfork_run_indexs r~rm'_GraphIterator._get_completed_fork_runss ?A=Fq||=TU=T61COOQ.=TU$($8$8$=$=$? G-11+>N%**<+NN#**G+AB%@#"VsBc:UR(d/$URSn[U[[-5(aS5e[U[5(a&[ UR X#UR55/$[U[5(aJUR[URURUS95nURURX#5$[U[5(aURURX#5$[!U5 g)Nrz@These markers should be removed from paths during graph buildingr)rrrrVrQrRrdestination_idrXrY transformr\rrr next_pathrUr*)r|rrritems r~r_GraphIterator._handle_pathszzIzz!}dI$?@@ N @ d- . .d116tG\G\G^_` ` o . .^^KdjjtyyY_$`aF$$T^^VH H k * *$$T^^VH H  rct[U[5(aURXU5$URXU5$ry)rrI_handle_fork_edgesro)r|rrrs r~r_GraphIterator._handle_edgess7 dD ! !**4D D..tZH HrcURRRUR/5n[ U5S:XdeUR USX#5$)NrEr)rrrrrr)r|rrredgess r~ro%_GraphIterator._handle_non_fork_edgessI **..tww;5zQ  q6>>rc @^^^^^^TRRRTR/5m[ T5S:Xd9[ T[ 5(aTR(aTTR45e/nTR5mTR(Ga8TR=nbTRRUn[ U[5(deT[TRTS54-nTRXW5upTRRXX4[!UR#5U 55 [%T5(aI['T5H8upTR)TSU T[TRTU 54-5n XL- nM: U$[+T5(aSUUUUUU4Sjjn [-U "5T5$[/ST<35e['T5H4upUTR)UTT[TRTU54-5- nM6 U$)NrErc ># SnTShvN nTRTSUT[TRTU54-5nU7v US- nMDN? g7f)NrrE)rr<r) thread_index input_item item_tasksrrrrrtr|s r~handle_async_iterable@_GraphIterator._handle_fork_edges..handle_async_iterable*s`#$L,2*j%)%6%6!!Hj* dggWbdp@q?s2s& )($) *Fs%AAA A >>!))wBV CW   DsA=cL# [["5nURR5HLupEURH7nUR U:Xa$UR U:XaURU5 MHM9 MN UHnURU5IShvN M gN 7fry) rsr@rZrrrrertaddrb)r|ryrttask_ids_to_cancelrrrs r~rk$_GraphIterator._cancel_sibling_tasksHs []++113JG <<>1d6F6F+6U&**73 %4*G##G, , ,* ,sBB$B" B$)rr[rZrYr!rN)rvrrz~AsyncGenerator[EndMarker[OutputT] | ErrorMarker | Sequence[GraphTask], EndMarker[OutputT] | ErrorMarker | Sequence[GraphTask]])rr@rrM)rSequence[GraphTask]rrM)rr)rrrzMEndMarker[OutputT] | Sequence[GraphTask] | _GraphTaskAsyncIterable | JoinItem)rzDecision[StateT, DepsT, Any]rrrr;rr)rz'BaseNode[StateT, DepsT, Any] | End[Any]rr;rz3Sequence[GraphTask] | JoinItem | EndMarker[OutputT])rr=rr;rztuple[NodeRunID, ForkStack])rrrZIterable[GraphTask]rzlist[tuple[JoinID, NodeRunID]])rrWrrrr;rr)rrLrrrr;r-Sequence[GraphTask] | _GraphTaskAsyncIterable)rrLrrrr;rr)rzFork[Any, Any]rrrr;rr)rrrr=rzr?rr)ryr:rtr?)rrrrrrrYrZr[rr!r]r rbrarrrrrfrmrrrorrrkrrrr~r r s -- M K11**/4%/@M,@,1u,=L)=AFEARO>RCHeCT@THMSXHYEY#h #h  h T-I <%% W%N_4_>A_OX_ _2$:$$ = $"8 # #*# ( #&$II%(I6?I 6I? 1"1,/1=F1 61f  -rr c"[U[5$ry)rr rs r~rrUs a ""rc"[U[5$ry)rrrs r~rrYs a ''rc## [(aSv gSv g![a*nURSnURcSUlUeSnAff=f7f)Nr)rrer, __cause__)r exceptions r~rr]sL }   !  QI""*&* #O  s$AA A %AA  Ac\rSrSr%SrS\S'S\S'S\S'S \S 'S \S 'S \S'S\S'S\S'S\S'\"S\\\ \ 4\ 4S9r \"S\ \\ \ 4\ 4S9rS\\\\SS.SSj5r\SSS.S?Sjj5r\SSS.S@S jj5rSASSS.SBS!jjjr\SSS.SCS"jj5r\SSS.SDS#jj5r\SASSS.SES$jjj5rSASSS.SES%jjjr\SSS&S'.SFS(jj5r\SSS&S'.SGS)jj5r\\SSS&S*.SHS+jjrSIS,jrSS-.SJS.jjrSSSSS/.SKS0jjrSLS1jrSSS2.SMS3jjrSS4.SNS5jjrSS4.SOS6jjrSPS7jr SQS8jr!SRS9jr"SSSTS:jjr#S;r$g)U GraphBuilderiraA builder for constructing executable graph definitions. GraphBuilder provides a fluent interface for defining nodes, edges, and routing in a graph workflow. It supports typed state, dependencies, and input/output validation. Type Parameters: StateT: The type of the graph state DepsT: The type of the dependencies GraphInputT: The type of the graph input data GraphOutputT: The type of the graph output data rrTypeOrTypeExpression[StateT]rTypeOrTypeExpression[DepsT]r!TypeOrTypeExpression[GraphInputT]r"TypeOrTypeExpression[GraphOutputT]rrrr_nodesr_edges_by_sourceint_decision_indexSource) type_params DestinationNT)rrrrrrcXlX lX0lX@lXPlX`l0Ul[[5Ul SUl [["5Ul [["5Ulg)aInitialize a graph builder. Args: name: Optional name for the graph, if not provided the name will be inferred from the calling frame on the first call to a graph method. state_type: The type of the graph state deps_type: The type of the dependencies input_type: The type of the graph input data output_type: The type of the graph output data auto_instrument: Whether to automatically create instrumentation spans rEN)rrrrrrrrrlrrrJro _start_noderHrp _end_node)r|rrrrrrs r~rGraphBuilder.__init__s_( $"$&. +D 1 $[13 .0rcUR$)zeGet the start node for the graph. Returns: The start node that receives the initial graph input )rrs r~ start_nodeGraphBuilder.start_nodesrcUR$)z`Get the end node for the graph. Returns: The end node that produces the final graph output )rrs r~end_nodeGraphBuilder.end_nodes~~r)rlabelcgryrr|rr s r~rGraphBuilder.steps jmrcgryrr|rrr s r~rrs03rc^^^UcSUUU4SjjnU$T=(d [U5m[[[[[ 4"[ T5UTS9nU$)aDCreate a step from a step function. This method can be used as a decorator or called directly to create a step node from an async function. Args: call: The step function to wrap node_id: Optional ID for the node label: Optional human-readable label Returns: Either a Step instance or a decorator function c&>TRUTTS9$Nrrr )rfuncr rr|s r~ decorator$GraphBuilder.step..decoratorsyydG5yIIr)rrr )r,StepFunction[StateT, DepsT, InputT, OutputT]r$Step[StateT, DepsT, InputT, OutputT])rar[rfrhrirjr>)r|rrr rrs` `` r~rrsf. < JB J5 J J  4.t4FE6723vgTY^_ rcgryrr s r~streamGraphBuilder.stream s rcgryrrs r~rrs?Brcgryrrs r~rrs rc^^^^TcSUUU4SjjnU$SU4SjjnT=(d [T5mTRUTTS9$)ahCreate a step from an async iterator (which functions like a "stream"). This method can be used as a decorator or called directly to create a step node from an async function. Args: call: The step function to wrap node_id: Optional ID for the node label: Optional human-readable label Returns: Either a Step instance or a decorator function c&>TRUTTS9$r)rrs r~r&GraphBuilder.stream..decoratorFs{{gU{KKrc># T"U5$7fryr)ctxrs r~wrapper$GraphBuilder.stream..wrapperNs9 s r)r.StreamFunction[StateT, DepsT, InputT, OutputT]r3Step[StateT, DepsT, InputT, AsyncIterable[OutputT]])r$z"StepContext[StateT, DepsT, InputT])rar)r|rrr rr%s```` r~rr*s\4 < LD LD L L   4.t4yygweyDDrfarthest)rrypreferred_parent_forkcgryr)r|reducerinitialrryr*s r~rGraphBuilder.joinU03rcgryr)r|r,rgrryr*s r~rr._r/r)r-rgrryr*c ^U[LaU4Sjn[[[[[ 4"[ [U=(d [[U5555U[[/[ 4U5Ub[U5US9$SUS9$)Nc>T$ryr)r-sr~#GraphBuilder.join..usgr)rr,rgryr*) r-rCrfrhrirjr=r>rArarr r:)r|r,r-rgrryr*s ` r~rr.js e #-OFE6723fW`(DEVW^E_(`ab "g+!6H5C5O6.1"7   VZ"7   rc^^ ^ ^ ^ SU U4Sjjm SU U U U U4Sjjm [["5m /m UHnURHFnTRU5 TRUR R UR5 MH URH nT "U5 M T "UR5 M T Hn[U[5(a[U[5(aM/[R"[R"55n[!UR"USS9nUSnTR%XX5nUbTR'U5 MM g![(a Mf=f) zAdd one or more edge paths to the graph. This method processes edge paths and automatically creates any necessary fork nodes for broadcasts and maps. Args: *edges: The edge paths to add to the graph c>URHn[U[5(ad[[[4"UR SSS9nTR U5 URHnT"[/URQS95 M M|[U[5(a@[[[4"UR SURS9nTR U5 M[U[5(dMM g)zRProcess a path and create necessary fork nodes. Args: p: The path to process FNrrrrrT) rrrrQrIrre _insert_nodepathsrWrVrrR)prnew_noderrr|s r~r&GraphBuilder.add.._handle_paths dO44#CH~e`deH%%h/ $ $T $** %>?!+i00#CH~d_c_v_vwH%%h/&788 rcJ>[U5T;agTR[U55 TRU5 TRU5 [ U[ 5(aAUR H0nT"UR5 URH nT"U5 M M2 ggry) rrrr9rr5rr destinations)drd2_handle_destination_noderdestination_idsr?r|s r~rB2GraphBuilder.add.._handle_destination_nodes!u'   1 &    "   a !X&&jjF -$11042)'rTlocalnsinclude_extrasrN)r;rW)r@rK)rsrsourcesr9rrrrr?rr[rZr+get_parent_namespaceinspect currentframerr_edge_from_return_hintrKeyError) r|redge source_nodedestination_node destinationparent_namespace type_hints return_hintrBrrCr?s ` @@@@r~rGraphBuilder.adds;  $ 5 5c(*13 D#|| !!+.%%knn5<rA)r|rhrs r~rGraphBuilder.decisions%6'"U-I*-UVacjnoor)rc[[S55n[[[[ 4"U/SS9n[ [[[4"/S9n[XAX%S9$)zCreate a decision branch matcher. Args: source: The type or type expression to match against matches: Optional custom matching function Returns: A DecisionBranchBuilder for constructing the branch match_decisionNrjrd)rrSrrf) r>rAr5rfrhr'rXrkr7)r|rSrrrnew_path_builders r~matchGraphBuilder.matchsT"56FGHFE501WrPTU&vug'=>RP$hwvvrch[U5n[[UR5/S9n[ XXC/S9$)a7Create a decision branch for `BaseNode` subclasses. This is similar to `match()` but specifically designed for matching against `BaseNode` types. Args: source: The `BaseNode` subclass to match against matches: Optional custom matching function Returns: A `DecisionBranch` for the `BaseNode` type r8)rSrrr?)rZrWrRrr6)r|rSrrrs r~ match_nodeGraphBuilder.match_nodes5",TWW567V4V\]]rcb[R"[R"55n[ UR USS9nUSn[U5nURXd5nU(d[R"SUS35eU$![ a n[R"SUS35UeSnAff=f)aCreate an edge path from a `BaseNode` class. This method integrates a `BaseNode` subclass into the builder graph by analyzing its `run` return type hints and creating appropriate edges. Args: node_type: The `BaseNode` subclass to integrate Returns: An `EdgePath` representing the node and its connections Raises: GraphSetupError: If the node type is missing required type hints TrErrz2 is missing a return type hint on its `run` methodN) r+rIrJrKrrrMr,GraphSetupErrorrZrL)r| node_typerRrSrTrrrNs r~rGraphBuilder.node2s$"66w7K7K7MN#IMM;K\`a  $X.K  "**4=,,uYK?q-rs s  ,, {"TU  sB B.B))B.cTURRUR5nUcXRUR'g[U[5(a/[U[5(aUR UR LagX!La[ SUR<SUSU35eg)zInsert a node into the graph, checking for ID conflicts. Args: node: The node to insert Raises: ValueError: If a different node with the same ID already exists Nz%All nodes must have unique node IDs. z was the ID for z and )rrrrrZrvr8)r|rexistings r~r9GraphBuilder._insert_nodeVs;;??477+  #'KK ( + + 40J0JxOaOaeiesesOs   !$7{BRS[R\\abfagh "rc/n[R"U5nUGHn[R"U5upV[U5=(d UnU[LaUR UR 5 MVU[La[R"SUS35eU[Lak[[[[[[4S-[!SU5S55nUc[R"SUS35eUR U5 MU["Lal[[$[[[[4S-[!SU5S55n U c[R"SUS35eUR U 5 GMb[&R("U5(dGM[+U[5(dGMUR [-U55 GM [/U5[/U5:agUR1U5n [/U5S:XaU R3US 5$UR55n UH6n U R7UR9[:5R3U 55n M8 U R3U 5$) aCreate edges from a return type hint. This method analyzes return type hints from step functions or node methods to automatically create appropriate edges in the graph. Args: node: The source node return_hint: The return type hint to analyze Returns: An EdgePath if edges can be inferred, None otherwise Raises: GraphSetupError: If the return type hint is invalid or incomplete rz return type hint includes a plain `BaseNode`. Edge inference requires each possible returned `BaseNode` subclass to be listed explicitly.Nc3T# UHn[U[5(dMUv M g7fry)rr[.0as r~ 6GraphBuilder._edge_from_return_hint..H[Jq$4G!![( (z return type hint includes a `StepNode` without a `Step` annotation. When returning `my_step.as_node()`, use `Annotated[StepNode[StateT, DepsT], my_step]` as the return type hint.c3T# UHn[U[5(dMUv M g7fry)rrCr}s r~rrrrz return type hint includes a `JoinNode` without a `Join` annotation. When returning `my_join.as_node()`, use `Annotated[JoinNode[StateT, DepsT], my_join]` as the return type hint.rEr)r+get_union_argsunpack_annotatedrr4rr r3r,rur^rr[rfrhrrrDrCrJisclass issubclassrZrrWrXrrror) r|rrTr? union_args return_typerreturn_type_originrrrNrrQs r~rL#GraphBuilder._edge_from_return_hintis9$24 **;7 %K'-'>'>{'K $K!+K!8!GK !S(##DMM2#x/ 00D6"rr$x/S01D8H[H$O<$44v&II##D)#x/S01D8H[H$O<$44v&II##D)!344DVX`9a9a##H[$9:C&F | s: .~~d# |  !77<?+ +}}H+ #??4::h+?+B+B;+OP ,778$ $rc URnURn[X#5up#[X#5up#[ X#5up#U(a [ X#5 [ X#5n[X$5n[[[[[4"UR[UR5[UR 5[UR"5[UR$5UUUUUR&S9 $)aBuild the final executable graph from the accumulated nodes and edges. This method performs validation, normalization, and analysis of the graph structure to create a complete, executable graph instance. Args: validate_graph_structure: whether to perform validation of the graph structure See the docstring of _validate_graph_structure below for more details. Returns: A complete Graph instance ready for execution Raises: ValueError: If the graph structure is invalid (e.g., join without parent fork) ) rrrrrrrrrr)rr_replace_placeholder_node_ids_flatten_paths_normalize_forks_validate_graph_structure_collect_dominating_forks _compute_intermediate_join_nodesrrfrhrorprrbrrrrr)r|validate_graph_structurerrrrs r~buildGraphBuilder.builds  //!>u!V!/!G!1%!I # %e =0H "B5"WVUK=>-doo>,T^^<-doo>.t/?/?@+%$; 00  r) rrrrrrrrrrr) rrrrrrrrrrrr)rzStartNode[GraphInputT])rzEndNode[GraphOutputT])rrr rrz^Callable[[StepFunction[StateT, DepsT, InputT, OutputT]], Step[StateT, DepsT, InputT, OutputT]])rrrrr rrrry)rz3StepFunction[StateT, DepsT, InputT, OutputT] | Nonerrr rrzStep[StateT, DepsT, InputT, OutputT] | Callable[[StepFunction[StateT, DepsT, InputT, OutputT]], Step[StateT, DepsT, InputT, OutputT]])rrr rrzoCallable[[StreamFunction[StateT, DepsT, InputT, OutputT]], Step[StateT, DepsT, InputT, AsyncIterable[OutputT]]])rr'rrr rrr()rz5StreamFunction[StateT, DepsT, InputT, OutputT] | Nonerrr rrzStep[StateT, DepsT, InputT, AsyncIterable[OutputT]] | Callable[[StreamFunction[StateT, DepsT, InputT, OutputT]], Step[StateT, DepsT, InputT, AsyncIterable[OutputT]]]) r,/ReducerFunction[StateT, DepsT, InputT, OutputT]r-rjrrryrr*Literal['farthest', 'closest']r$Join[StateT, DepsT, InputT, OutputT]) r,rrgzCallable[[], OutputT]rrryrr*rrr)r,rr-zOutputT | UnsetrgzCallable[[], OutputT] | Unsetrrryrr*rrr)rEdgePath[StateT, DepsT]rrM)rSz Source[T]rQDestination[T]r rrrM)rSzSource[Iterable[T]]r`rr\rr]rrez ForkID | Nonerz JoinID | NonerrM)rHzSource[SourceOutputT]rz-EdgePathBuilder[StateT, DepsT, SourceOutputT])rhrrrrzDecision[StateT, DepsT, Never])rSzTypeOrTypeExpression[SourceT]rCallable[[Any], bool] | Nonerz=DecisionBranchBuilder[StateT, DepsT, SourceT, SourceT, Never])rSztype[SourceNodeT]rrrzDecisionBranch[SourceNodeT])rvz+type[BaseNode[StateT, DepsT, GraphOutputT]]rr)rrLrrM)rzSourceNode[StateT, DepsT, Any]rTzTypeOrTypeExpression[Any]rzEdgePath[StateT, DepsT] | None)T)rrrz/Graph[StateT, DepsT, GraphInputT, GraphOutputT])%rrrrrrr(rNrfrhrjrrMrirrrrrr rrrrr-rrZrarWrrorrrr9rLrrrrr~rrrs  M,,&**'11+33,@ !!2..4: 8Zw0F%GV]U_ `F vuf?T/UdjclmK  3;198@:B $"1"11 "1 / "1 6 "18"1"1J  # mm m h mm  # 3:3 3  3 . 33EI$# $A$ $  $ i$L#          # B<B B  B = BBGK  #  C           GK)E# )EC)E )E  )E )EV #%)@J3@3 3  3 # 3 >3 .33 #%)@J3@3/ 3  3 # 3 >3 .33$)9>"%)@J @ !  7    #  >  . ,@#D_c *$%)%)!%,0%#%% " % # %%*% %>  .2 p 15 w-w. w G w415 ^!^. ^ % ^*!>! !!H&C%2C%AZC% 'C%L& & rrc^Sn[5mS U4SjjnUR5HnUH nU"U5 M M UR5H?n[U[5(dMURHnU"UR 5 M MA UR [R/5nU(d[SU-5e[RT;a[SU-5e/n UR5Hup[U[5(aMX;=(a [X5S:n [U[5(a!U =(d [UR5S:n U (aMvU RU 5 M U (a[SU S3U-5e[R1n [R/n U (GaZU R5nUR U/5HunURHbn[U[5(dMUR U ;dM,U R#UR 5 U RUR 5 Md Mw UR U5n[U[5(aURHnUR RHbn[U[5(dMUR U ;dM,U R#UR 5 U RUR 5 Md M U (aGMZUV s/sH oU ;dM U PM nn U(a[SUS3U-5eg s sn f) aValidate the graph structure for common issues. This function raises an error if any of the following criteria are not met: 1. There are edges from the start node 2. There are edges to the end node 3. No non-End node is a dead end (no outgoing edges) 4. The end node is reachable from the start node 5. All nodes are reachable from the start node Note 1: Under some circumstances it may be reasonable to build a graph that violates one or more of the above conditions. We may eventually add support for more granular control over validation, but today, if you want to build a graph that violates any of these assumptions you need to pass `validate_graph_structure=False` to the call to `GraphBuilder.build`. Note 2: Some of the earlier items in the above list are redundant with the later items. I've included the earlier items in the list as a reminder to ourselves if/when we add more granular validation because you might want to check the earlier items but not the later items, as described in Note 1. Args: nodes: The nodes in the graph edges_by_source: The edges by source node Raises: GraphBuildingError: If any of the aforementioned structural issues are found. z If this is intentional, you can suppress this error by passing `validate_graph_structure=False` to the call to `GraphBuilder.build`.c>URH5n[U[5(dMTRUR5 M7 gry)rrrrRrr)rrall_destinationss r~_collect_destinations_from_pathB_validate_graph_structure.._collect_destinations_from_paths3JJD$ 122 $$T%8%89rz+The graph has no edges from the start node.z'The graph has no edges to the end node.rz,The following nodes have no outgoing edges: rz;The following nodes are not reachable from the start node: N)rrWrrM)rsrrr5rrrrJrr9rHrrrrrnrRrr)rrhow_to_suppressrr:rrr start_edgesdead_end_nodesr has_edges reachableto_visit current_idr current_nodeunreachable_nodesrs @r~rrs:^O%(E: !'')D +D 1*   dH % %--/ <( "%%illB7K "#PSb#bcczz))"#L#^__$&N  dG $ $ .T37O3PST3T  dH % %!;S%7!%;Iy  ! !' *'"%QR`Qaab#cfu#uvv(ll^I ~H \\^ $'' B7D d$566**);! d&9&9: (;(;< #8yy, lH - -&//"KK--D!$(9::..i?%MM$*=*=>$OOD,?,?@ .0 (*16RW 9QR"IJ[I\\] ^ap p  Ss & M3McP^TR5n[[5n/nSU4SjjnUR5HXn[ U[ 5(dMUR H.nU"UR5upXlURU 5 M0 MZ UR5H upU Hn URX45 M M" U(aIUR5upU"U 5upX:RU5 URU 5 U(aMIU[U54$)Nc>[UR5GH%up[U[5(a|URT;dS5e[ [ URSU5[UR5/-5n[ URUS-S5nX2RU4/4s $[U[5(dMURT;dS5e[ [ URSU5[UR5/-5nX2RVs/sHoRRU4PM sn4s $ U/4$s snf)Nz?This should have been added to the node during GraphBuilder.addrE) rrrrrVrerWrlrRrQr:)rrrupstream downstreamr;rs r~_split_at_first_fork,_flatten_paths.._split_at_first_forkNs ,GA$ **||u,o.oo,TZZ^ 48I$,,8W7X XY!$**QUW"56 <<"rrWrR) rrrrrrrrnew_forks r~rrps I*,I"$O(- $ 01 dD ! !$++#4i   !Q i S>VFdggYo3N,O%PY^swx!)(++ $,=hkk,J+K LM !2(++)6  rcp^[U5n[R1n[[5m[U5nUHnUnUR U5n[ U[5(aURUR5 SU4Sjjn[ U[5(a(URHn U"U RU5 M MUR U/5H n U"X5 M M [UUUTS9n UR5Vs/sHn[ U[5(dMUPM n n0n U H|nU RURUR UR"S:HS9nUc6[%X5R'5n[)SUSUR<S35eXUR'M~ U $s snf) aFind the dominating fork for each join node in the graph. This function analyzes the graph structure to find the parent fork that dominates each join node, which is necessary for proper synchronization during graph execution. Args: graph_nodes: All nodes in the graph graph_edges_by_source: Edges organized by source node Returns: A mapping from join IDs to their parent fork information Raises: ValueError: If any join node lacks a dominating fork c>URH8n[U[5(dMTURUR5 g g)zProcess a path and collect edges and fork information. Args: path: The path to process last_source_id: The current source node ID N)rrrrRrr)rlast_source_idrrs r~r/_collect_dominating_forks.._handle_paths? d$566.)001D1DE #r)r start_idsfork_idsrclosest)ryprefer_closestaA node in the graph is missing a dominating fork. For every Join J in the graph, there must be a Fork F between the StartNode and J satisfying: * Every path from the StartNode to J passes through F * There are no cycles in the graph including J that don't pass through F. In this case, F is called a "dominating fork" for J. This is used to determine when all tasks upstream of this Join are complete and we can proceed with execution. Mermaid diagram: z Join z4 in this graph has no dominating fork in this graph.)rrWrr>)rsrJrrrlrrrIrr5rrrPrrCfind_parent_forkryr*rrr8) graph_nodesgraph_edges_by_sourcerrrrworking_source_idrrrrfinderjoinsdominating_forksrdominating_forkrendered_mermaid_graphrs @r~rrs&  E'll^I(3D(9E NH %y) dD ! ! LL !  dH % %--V[[*;<(.11)R@T-A5: F*002 M2djt6LT2E M9; 11 GGD$7$7HbHbfoHo2   "%8%\%c%c%e "$ * gg[D &H I I%4!'* / Ns F3%F3c0nUR5Hpup4[["5nURHEnUR U5n[ U[ 5(dM+UR[U55 MG XRU'Mr U$)a;Compute which joins have other joins as intermediate nodes. A join J1 is an intermediate node of join J2 if J1 appears in J2's intermediate_nodes (as computed relative to J2's parent fork). This information is used to determine: 1. Which joins are "final" (have no other joins in their intermediate_nodes) 2. When selecting which reducer to proceed with when there are no active tasks Args: nodes: All nodes in the graph parent_forks: Parent fork information for each join Returns: A mapping from each join to the set of joins that are intermediate to it )rrrsr=rrrrCr)rrrrrrintermediate_node_idintermediate_nodes r~rrs&:< , 2 2 4 []$/$B$B % *> ? +T22"&&v.B'CD %C ,>(!5 #"rc \[U5nUR5VVs0sH up4URX35[XB5_M" nnnUR5VVVs0sH1upgURXf5UVs/sHn[ X5PM sn_M3 n nnnXY4$s snnfs snfs snnnfry)$_build_placeholder_node_id_remappingrrr_update_node_with_id_remapping_update_path_with_id_remapping) rrnode_id_remappingrrreplaced_nodesrSr:r;replaced_edges_by_sources r~rrs)rcounter remappingrreplaced_node_idcounts r~rrsx clnG&(I::<1':  & ,3,E,II!E#UQY'7&8%$ATde   rc >[U[5(a-URURUR5UlU$[U[5(a6[ URURUR55UlU$[U[ 5(aw[URURUR55UlURb4[ URURUR55UlU$[U[5(aiURURUR5UlURVs/sH!n[U[URU5S9PM# snUl U$s snf)N)r)rr[rrrCr=rIr:rr5rrrr)rrrs r~rr,sH $#''9 K D$  *..tww@A K D$  *..tww@A  " " .&,->-B-B4CZCZ\`\s\s-t&uD # K D( # ##''9-- ' F!? M^!_ `'   K  s((FcURGH6n[U[5(adURnUb[ UR X355Ul[ UR URUR55UlM}[U[5(aa[ UR URUR55UlURVs/sHn[XA5PM snUl M[U[5(dGM UR URUR5Ul GM9 U$s snfry) rrrrVrr=rr:rerQr:rrRr)rrrrr;s r~rrBs  dI & &!%!8!8 !-*01B1F1FGY1n*o'!"3"7"7 dll"STDL o . .!"3"7"7 dll"STDLX\XbXbcXbST8NXbcDJ / 0 0"3"7"78K8KTM`M`"aD  Kds!E z fill:#fdff32)TBLRRLBT) broadcastr_rstartendrrcB\rSrSr%SrS\S'S\S'S\S'S\S 'S rg ) MermaidNodeiezA mermaid node.rrNodeKindkindrr rhrNrrrr~rres G N  rrc8\rSrSr%SrS\S'S\S'S\S'Srg ) MermaidEdgeiozA mermaid edge.rstart_idend_idrr rNrrrr~rrosM K rr MermaidGraphc ^/n[[5mS U4SjjnUR5HupESnSn[U[5(aSnO[U[ 5(aSnO[U[ 5(aSnURnOr[U[5(aSnOZ[U[5(aUR(aSOSnO/[U[5(aS nURnO [U5 [UWXgS 9n URU 5 M UR5HupU H n U"X5 M M UR!5HJn[U[5(dMUR"H n U"U R$UR&5 M" ML [)UVs/sHnTR+UR&/5PM! sn[[,"55n[/X.5$s snf) zBuild a mermaid graph.c:>SnURHn[U[[-5(aS5e[U[5(aUR nMI[U[ 5(dM`TUR[XRU55 M g)Nz-These should be removed during Graph building) rrrrVrQrUr rRrrr)rr working_labelrrs r~_collect_edges+build_mermaid_graph.._collect_edgessy$( JJD!$ O(CDD uFu uD$ ,, $ D"344/66{>SfSfhu7vw rNrrrrr_rr)rrr rh)rrWrr>rrM)rrlrrrrJrHr[r rCrIrr5rhr*rrrrrrsumrrr)rrrrrrr rhrrOkvrrrrs @r~rrxs "E4?4EOx%**,   dI & &D g & &D d # #DJJE d # #D d # # KK5[D h ' 'D99D  !W4uP  [!--0&++-D 4 #.""$ dH % %--v{{DGG4(% #QV#WQVO$7$7$DQV#WY]^iYjYlmE  %%$Xs+&G4ch\rSrSr%SrS\S'S\S'SrS\S 'SrS \S 'SSS jjrS r g)rizA mermaid graph.list[MermaidNode]rlist[MermaidEdge]rNrrrrc/nU(aSSU3S/nURS5 UbURSU35 [URUR5upVUGHUn/nURS:XdURS:XaGOURS:XaDSUR 3n UR (aU S UR 3- n URU 5 OURS :XaS UR S 3/nOURS :XdURS:XaS UR S3/nOtURS:XaOS UR S3/nUR(a,URSUR SURS35 O[UR5 URU5 GMX URS5 UHn U R[R :XaSO U Rn U R[R :XaSO U Rn SU SU 3n U R (aU(aU S U R 3- n URU 5 M SRU5$)Nz---ztitle: zstateDiagram-v2z direction rrrz z: rz state z <>rr_z <>rz <>z note right of z z end notez[*]z --> r)r_topological_sortrrrrr rhr*rqrrJrrHr)r|rr edge_labelslinesrrr node_lineslinerNrender_start_id render_end_id edge_lines r~rMermaidGraph.renders  geW-u5E &'  LL< {3 4(TZZ@ D$&JyyG#tyyE'9f$DGG9~::b --D!!$'f$ ( ;< k)TYY%-? ( ;< j( ( => 99%%(8  {R^&_`TYY' LL $),  RD'+}} 'De$--O%)[[GJJ%>EDKKM_-U=/BIzzkr$**.. LL #yyrr)NNT)rrrrrr) rrrrrrrrrrrrr~rrsW  E:.2I+237  / // /  / / rc^ [[5nUH*nX#RRUR5 M, 0m [ R S4/nST [ R 'U(aLURS5upVX%H(nUT ;dM US-T U'URXvS-45 M* U(aML[UU 4SjS9n[UU 4SjS9n X4$)zSort nodes and edges in a logical topological order. Uses BFS from the start node to assign depths, then sorts: - Nodes by their distance from start - Edges by the distance of their source and target nodes rrEcf>TRUR[S55UR4$Ninf)rrfloat)ndepthss r~r3#_topological_sort.. s$ 144u0NPQPTPT/Ur)keyc>TRUR[S55TRUR[S55URUR4$r)rrrr)rr s r~r3r  sB JJqzz5< 0 JJqxxu . JJ HH  r) rrlrrrrJrrnsorted) rr adjacencyrNqueuerrrG sorted_nodes sorted_edgesr s @r~rrs'2$&7I-- '' 4 F%.\\1$5#6EF9<< 1 )Gf$"'!)w gqy12* %%%UVL  L  %%r)rrrzTypeGuard[Iterable[Any]])rrrzTypeGuard[AsyncIterable[Any]])rrrrrrM)rrrrrz6tuple[dict[NodeID, AnyNode], dict[NodeID, list[Path]]])rrrrrr)rrrrrr)rrrr)rrrdict[NodeID, NodeID])rrLrrrrL)rrWrrrrW)rrrrrr)rrrrrz+tuple[list[MermaidNode], list[MermaidEdge]])r __future__r _annotationsrJsys collectionsrrcollections.abcrrrr r r contextlibr r rrr dataclassesrrrtypesrtypingrrrrrrrrrranyiorr r!r"r# anyio.abcr$anyio.streams.memoryr%r&typing_extensionsr'r(r)r*pydantic_graphr+r,pydantic_graph._utilsr-r.r/r0r1r2pydantic_graph.basenoder3r4pydantic_graph.decisionr5r6r7pydantic_graph.exceptionsr8r9pydantic_graph.id_typesr:r;r<r=r>r?r@rArBpydantic_graph.joinrCrDrErFrGpydantic_graph.noderHrIrJpydantic_graph.node_typesrKrLrMrNpydantic_graph.parent_forksrOrPpydantic_graph.pathsrQrRrSrTrUrVrWrXrYpydantic_graph.steprZr[r\r]r^r_pydantic_graph.utilr`rarb version_infoexceptiongrouprerfrhrirjrkrlrnrorprqrurrrrrrrOrRr rrrrrrrrrrrrrDEFAULT_HIGHLIGHT_CSSStateDiagramDirectionrrrrrrrrr~r2sH3 ,ffmm11   xwRII-kk1SSN   [Z88^^D   dc__gG+ $ /$-+ $ /% )D 1& )D 1m8CcM+BSWX = mD9 ~d;  C%   ,  , ,  , LL L" dGFE672 3ddN  ( ] ] ]&Lwvug-.L^    '' ' F-WVUG34F- F-R#(( b  765+|CDb  b  Jk k -k  k \'& '&)A'&;'&T# # )A# ;# LS&S?WS%Sl# #0P##D 4",&'4 67 Q R    3&&3&?W3&3&l 8 8  8 v*& *&%6*&0*&r