"j SrSSKJr SSKrSSKJr SSKJrJrJ r SSK J r SSK J r JrJrJrJr SSKJrJrJrJr SS KJrJrJr SS KJrJrJr \"S S S 9r\"SS S 9r \"SS S 9r!\"SS S 9r"\"SS S 9r#\"SS S 9r$\"SS S 9r%\ "SS55r&\ "SS9"SS\\\ 455r'\"S\\"\!/\"4\!\"4S9r(\"S\\'\\ 4\"\!/\"4\\ \!\"4S9r)\"S\)\\ \!\"4\(\!\"4-\\ \!\"4S9r*S-Sjr+S.Sjr,S/S jr-S0S!jr."S"S#\5r/\"S$\/S S%9r0S1S&jr1\ "S'S(\\#55r2\ "SS9"S)S*\\\ \!\"455r3\ "S+S,\\\ \ 455r4g)2zJoin operations and reducers for graph execution. This module provides the core components for joining parallel execution paths in a graph, including various reducer types that aggregate data from multiple sources into a single output. ) annotationsN)abstractmethod)CallableIterableMapping) dataclass)AnyGenericLiteralcastoverload)ProtocolSelf TypeAliasTypeTypeVar)BaseNodeEndGraphRunContext)ForkID ForkStackJoinIDStateTT)infer_varianceDepsTInputTOutputTTKVc<\rSrSr%SrS\S'S\S'SrS\S 'S rg ) JoinStatezOThe state of a join during graph execution associated to a particular fork run.r currentrdownstream_fork_stackFboolcancelled_sibling_tasksN)__name__ __module__ __qualname____firstlineno____doc____annotations__r&__static_attributes__r'P/home/mande/repo/quber/.venv/lib/python3.13/site-packages/pydantic_graph/join.pyr!r!sY L$$$)T)r/r!F)initcv\rSrSr%SrS\S'S\S'S\S'SS jr\SS j5r\SS j5r S r S r g)ReducerContext(zContext information passed to reducer functions during graph execution. The reducer context provides access to the current graph state and dependencies. Type Parameters: StateT: The type of the graph state DepsT: The type of the dependencies r_stater_depsr! _join_statec(XlX lX0lgN)r5r6r7)selfstatedeps join_states r0__init__ReducerContext.__init__:s  %r/cUR$)zThe state of the graph run.)r5r:s r0r;ReducerContext.state?s{{r/cUR$)zThe deps for the graph run.)r6rAs r0r<ReducerContext.depsDszzr/c&SURlg)zCancel all sibling tasks created from the same fork. You can call this if you want your join to have early-stopping behavior. TN)r7r&rAs r0cancel_sibling_tasks#ReducerContext.cancel_sibling_tasksIs 480r/)r6r7r5N)r;rr<rr=r!)returnr)rHr) r(r)r*r+r,r-r>propertyr;r<rFr.r'r/r0r3r3(sT N" L41& 8r/r3PlainReducerFunction) type_paramsContextReducerFunctionReducerFunctioncg)z8A reducer that discards all input data and returns None.Nr'r#inputss r0 reduce_nullrQes r/c(URU5 U$)z!A reducer that appends to a list.)appendrOs r0reduce_list_appendrTj NN6 Nr/c(URU5 U$)zA reducer that extends a list.)extendrOs r0reduce_list_extendrXprUr/c(URU5 U$)zA reducer that updates a dict.)updaterOs r0reduce_dict_updater[vrUr/c,\rSrSrSr\SSj5rSrg) SupportsSum|z5A protocol for a type that supports adding to itself.cgr9r')r:others r0__add__SupportsSum.__add__s r/r'N)r`rrHr)r(r)r*r+r,rrar.r'r/r0r]r]|s?  r/r]NumericT)boundrc X-$)zA reducer that sums numbers.r'rOs r0 reduce_sumrfs  r/c"\rSrSrSrSSjrSrg)ReduceFirstValuezRA reducer that returns the first value it encounters, and cancels all other tasks.c&UR5 U$)zThe reducer function.)rF)r:ctxr#rPs r0__call__ReduceFirstValue.__call__s   " r/r'N)rkzReducerContext[object, object]r#rrPrrHr)r(r)r*r+r,rlr.r'r/r0rhrhs \r/rhc\rSrSr%SrS\S'S\S'S\S'S \S 'S \S 'S SS.SSjjr\S5r\S5r SSjr \ SSSjj5r \ SSj5r SSSjjr Sr g )JoinaA join operation that synchronizes and aggregates parallel execution paths. A join defines how to combine outputs from multiple parallel execution paths using a [`ReducerFunction`][pydantic_graph.join.ReducerFunction]. It specifies which fork it joins (if any) and manages the initialization of reducers. Type Parameters: StateT: The type of the graph state DepsT: The type of the dependencies InputT: The type of input data to join OutputT: The type of the final joined output rid/ReducerFunction[StateT, DepsT, InputT, OutputT]_reducerCallable[[], OutputT]_initial_factory ForkID | Noneparent_fork_idzLiteral['closest', 'farthest']preferred_parent_forkNfarthest)rwrxc@XlX lX0lX@lXPlgr9)rqrsrurwrx)r:rqreducerinitial_factoryrwrxs r0r> Join.__init__s  /,%:"r/cUR$r9)rsrAs r0r{ Join.reducers }}r/cUR$r9)rurAs r0r|Join.initial_factorys$$$r/c>[[R"UR5R5nUS:Xa-[ [ [[4UR5"X#5$[ [[[[[4UR5"XU5$)N) leninspect signaturer{ parametersr rJrrrLrr)r:rkr#rP n_parameterss r0reduce Join.reducesu7,,T\\:EEF 1 ,VW_=t||LW] ].vufg/MNPTP\P\]^alrs sr/cgr9r'r:rPs r0as_node Join.as_nodesGJr/cgr9r'rs r0rrsBEr/c[X5$)zCreate a join node with bound inputs. Args: inputs: The input data to bind to this join, or None Returns: A [`JoinNode`][pydantic_graph.join.JoinNode] with this join and the bound inputs )JoinNoders r0rrs%%r/)rursrqrwrx) rqrr{rrr|rtrwrvrxzLiteral['farthest', 'closest'])rkzReducerContext[StateT, DepsT]r#rrPrrHrr9)rPNonerHJoinNode[StateT, DepsT])rPrrHr)rPz InputT | NonerHr)r(r)r*r+r,r-r>rIr{r|rr rr.r'r/r0roros  J==++!!99)-@J ;  ;A ; / ; & ; > ;%%tJJ EE & &r/roc<\rSrSr%SrS\S'S\S'S SjrSrg ) raA `BaseNode` that represents a builder join with bound inputs. `JoinNode` lets a [`BaseNode`][pydantic_graph.BaseNode] subclass hand off to a builder [`Join`][pydantic_graph.join.Join] by wrapping the join together with the value it should receive as `inputs`. It is not meant to be run directly; returning a `JoinNode` from a `BaseNode.run` method tells the graph builder which join to invoke next. zJoin[StateT, DepsT, Any, Any]joinr rPc # [S5e7f)zAttempt to run the join node. Args: ctx: The graph execution context Returns: The result of step execution Raises: NotImplementedError: Always raised as StepNode is not meant to be run directly z`JoinNode` is not meant to be run directly, it is meant to be returned from a `BaseNode` subclass to indicate a transition to a builder join.)NotImplementedError)r:rks r0run JoinNode.runs" \  s r'N)rkzGraphRunContext[StateT, DepsT]rHz'BaseNode[StateT, DepsT, Any] | End[Any])r(r)r*r+r,r-rr.r'r/r0rrs (' K( r/r)r#rrPr rHr)r#list[T]rPrrHr)r#rrPz Iterable[T]rHr)r# dict[K, V]rPz Mapping[K, V]rHr)r#rcrPrcrHrc)5r, __future__rrabcrcollections.abcrrr dataclassesrtypingr r r r r typing_extensionsrrrrpydantic_graphrrrpydantic_graph.id_typesrrrrrrrrrrr!r3rJrLrMrQrTrXr[r]rcrfrhrorr'r/r0rs #77!88DD99== $ /- $ / )D 1 C% C% C% ** * %8WVU]+%8%8P% gv  '(! ' nVU]+Wf =w FG0  65&'9:=QRXZaRa=bb0       (  :[ F  wqz  A&765&'1 2A&A&H  xs*+   r/