pydantic-graph 1.23.0__tar.gz → 1.27.0__tar.gz

{pydantic_graph-1.23.0 → pydantic_graph-1.27.0}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: pydantic-graph
-Version: 1.23.0
+Version: 1.27.0
 Summary: Graph and state machine library
 Project-URL: Homepage, https://ai.pydantic.dev/graph/tree/main/pydantic_graph
 Project-URL: Source, https://github.com/pydantic/pydantic-ai

{pydantic_graph-1.23.0 → pydantic_graph-1.27.0}/pydantic_graph/beta/graph.py

@@ -562,7 +562,7 @@ class _GraphIterator(Generic[StateT, DepsT, OutputT]):
         self.iter_stream_sender, self.iter_stream_receiver = create_memory_object_stream[_GraphTaskResult]()
         self._next_node_run_id = 1
 
-    async def iter_graph(  # noqa C901
+    async def iter_graph(  # noqa: C901
         self, first_task: GraphTask
     ) -> AsyncGenerator[EndMarker[OutputT] | Sequence[GraphTask], EndMarker[OutputT] | Sequence[GraphTask]]:
         async with self.iter_stream_sender:

{pydantic_graph-1.23.0 → pydantic_graph-1.27.0}/pydantic_graph/beta/graph_builder.py

@@ -318,7 +318,7 @@ class GraphBuilder(Generic[StateT, DepsT, GraphInputT, GraphOutputT]):
         preferred_parent_fork: Literal['farthest', 'closest'] = 'farthest',
     ) -> Join[StateT, DepsT, InputT, OutputT]:
         if initial_factory is UNSET:
-            initial_factory = lambda: initial  # pyright: ignore[reportAssignmentType]  # noqa E731
+            initial_factory = lambda: initial  # pyright: ignore[reportAssignmentType]  # noqa: E731
 
         return Join[StateT, DepsT, InputT, OutputT](
             id=JoinID(NodeID(node_id or generate_placeholder_node_id(get_callable_name(reducer)))),
@@ -329,7 +329,7 @@ class GraphBuilder(Generic[StateT, DepsT, GraphInputT, GraphOutputT]):
         )
 
     # Edge building
-    def add(self, *edges: EdgePath[StateT, DepsT]) -> None:  # noqa C901
+    def add(self, *edges: EdgePath[StateT, DepsT]) -> None:  # noqa: C901
         """Add one or more edge paths to the graph.
 
         This method processes edge paths and automatically creates any necessary
@@ -674,7 +674,7 @@ class GraphBuilder(Generic[StateT, DepsT, GraphInputT, GraphOutputT]):
         )
 
 
-def _validate_graph_structure(  # noqa C901
+def _validate_graph_structure(  # noqa: C901
     nodes: dict[NodeID, AnyNode],
     edges_by_source: dict[NodeID, list[Path]],
 ) -> None:

{pydantic_graph-1.23.0 → pydantic_graph-1.27.0}/pydantic_graph/beta/mermaid.py

@@ -49,7 +49,7 @@ class MermaidEdge:
     label: str | None
 
 
-def build_mermaid_graph(  # noqa C901
+def build_mermaid_graph(  # noqa: C901
     graph_nodes: dict[NodeID, AnyNode], graph_edges_by_source: dict[NodeID, list[Path]]
 ) -> MermaidGraph:
     """Build a mermaid graph."""