o iB @sRdZddlmZddlZddlmZddlmZmZm Z ddl m Z ddl m Z mZmZmZmZddlmZmZmZmZdd lmZmZmZdd lmZmZmZed d d Zedd d Z edd d Z!edd d Z"edd d Z#edd d Z$edd d Z%e GdddZ&e ddGdddeee fZ'edee"e!ge"fe!e"fdZ(edee'ee fe"e!ge"fee e!e"fdZ)ede)ee e!e"fe(e!e"fBee e!e"fdZ* d;d#d$Z+dd-d.Z.Gd/d0d0eZ/ed1e/d d2Z0d?d3d4Z1e Gd5d6d6ee#Z2e ddGd7d8d8eee e!e"fZ3e Gd9d:d:eee e fZ4dS)@zJoin 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@s.eZdZUdZded<ded<dZded<d S) JoinStatezOThe state of a join during graph execution associated to a particular fork run.rcurrentrdownstream_fork_stackFboolcancelled_sibling_tasksN)__name__ __module__ __qualname____doc____annotations__r#r)r)^/var/www/html/karishye-ai-python/venv/lib/python3.10/site-packages/pydantic_graph/beta/join.pyrs rF)initc@s^eZdZUdZded< ded< ded< dd d ZedddZedddZddZ dS)ReducerContextaContext 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_statestatedeps join_statecCs||_||_||_dSN)r-r.r/)selfr0r1r2r)r)r*__init__:s zReducerContext.__init__returncC|jS)zThe state of the graph run.)r-r4r)r)r*r0?zReducerContext.statecCr7)zThe deps for the graph run.)r.r8r)r)r*r1Dr9zReducerContext.depscCs d|j_dS)zCancel all sibling tasks created from the same fork. You can call this if you want your join to have early-stopping behavior. TN)r/r#r8r)r)r*cancel_sibling_tasksIs z#ReducerContext.cancel_sibling_tasksN)r0rr1rr2r)r6r)r6r) r$r%r&r'r(r5propertyr0r1r:r)r)r)r*r,(s      r,PlainReducerFunction) type_paramsContextReducerFunctionReducerFunctionr Noneinputsrr6cCsdS)z8A reducer that discards all input data and returns None.Nr)r rAr)r)r* reduce_nullerClist[T]cC|||S)z!A reducer that appends to a list.)appendrBr)r)r*reduce_list_appendj rH Iterable[T]cCrF)zA reducer that extends a list.)extendrBr)r)r*reduce_list_extendprIrL dict[K, V] Mapping[K, V]cCrF)zA reducer that updates a dict.)updaterBr)r)r*reduce_dict_updatevrIrPc@seZdZdZedddZdS) SupportsSumz5A protocol for a type that supports adding to itself.otherrr6cCdSr3r))r4rRr)r)r*__add__rDzSupportsSum.__add__N)rRrr6r)r$r%r&r'rrTr)r)r)r*rQ|srQNumericT)boundrcCs||S)zA reducer that sums numbers.r)rBr)r)r* reduce_sumsrWc@seZdZdZd dd Zd S) ReduceFirstValuezRA reducer that returns the first value it encounters, and cancels all other tasks.ctxReducerContext[object, object]r rrAr6cCs ||S)zThe reducer function.)r:)r4rYr rAr)r)r*__call__szReduceFirstValue.__call__N)rYrZr rrArr6r)r$r%r&r'r[r)r)r)r*rXsrXc@seZdZUdZded<ded<ded<ded <d ed <d d dd(ddZeddZeddZd)dd Z e d*d+d#d$Z e d,d%d$Z d*d-d'd$Z d S).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.beta.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)rcrdreducerinitial_factoryLiteral['farthest', 'closest']cCs"||_||_||_||_||_dSr3)r]r_rarcrd)r4r]rfrgrcrdr)r)r*r5s   z Join.__init__cCr7r3)r_r8r)r)r*rfz Join.reducercCr7r3)rar8r)r)r*rgrizJoin.initial_factoryrYReducerContext[StateT, DepsT]r rrArr6cCsTtt|jj}|dkrttttf|j||Stt t t ttf|j|||S)N) leninspect signaturerf parametersr r<rrr>rr)r4rYr rA n_parametersr)r)r*reduces z Join.reducer@JoinNode[StateT, DepsT]cCrSr3r)r4rAr)r)r*as_nodez Join.as_nodecCrSr3r)rsr)r)r*rtru InputT | NonecCs t||S)zCreate a step node with bound inputs. Args: inputs: The input data to bind to this step, or None Returns: A [`StepNode`][pydantic_graph.beta.step.StepNode] with this step and the bound inputs )JoinNodersr)r)r*rts ) r]rrfr^rgr`rcrbrdrh)rYrjr rrArr6rr3)rAr@r6rr)rArr6rr)rArvr6rr) r$r%r&r'r(r5r;rfrgrqr rtr)r)r)r*r\s(      r\c@s0eZdZUdZded< ded< d d d Zd S)rwaNA base node that represents a join item with bound inputs. JoinNode bridges between the v1 and v2 graph execution systems by wrapping a [`Join`][pydantic_graph.beta.join.Join] with bound inputs in a BaseNode interface. It is not meant to be run directly but rather used to indicate transitions to v2-style steps. zJoin[StateT, DepsT, Any, Any]joinrrArYGraphRunContext[StateT, DepsT]r6'BaseNode[StateT, DepsT, Any] | End[Any]cs td)a Attempt 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 used in `BaseNode` subclasses to indicate a transition to v2-style steps.)NotImplementedError)r4rYr)r)r*runs z JoinNode.runN)rYryr6rz)r$r%r&r'r(r|r)r)r)r*rws rw)r r@rArr6r@)r rErArr6rE)r rErArJr6rE)r rMrArNr6rM)r rUrArUr6rU)5r' __future__rrmabcrcollections.abcrrr dataclassesrtypingrr r r r typing_extensionsr rrrpydantic_graphrrrpydantic_graph.beta.id_typesrrrrrrrrrrrr,r<r>r?rCrHrLrPrQrUrWrXr\rwr)r)r)r*sd          (        D