basedpyright 1.28.3 → 1.28.4

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/traversal/breadth_first_search.pyi

@@ -1,25 +1,34 @@
 from _typeshed import Incomplete
-from collections.abc import Generator
+from collections.abc import Callable, Generator
 
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 
 @_dispatchable
 def bfs_edges(
-    G, source, reverse: bool = False, depth_limit: Incomplete | None = None, sort_neighbors: Incomplete | None = None
+    G: Graph[_Node],
+    source: _Node,
+    reverse: bool | None = False,
+    depth_limit=None,
+    sort_neighbors: Callable[..., Incomplete] | None = None,
 ) -> Generator[Incomplete, Incomplete, None]: ...
 @_dispatchable
 def bfs_tree(
-    G, source, reverse: bool = False, depth_limit: Incomplete | None = None, sort_neighbors: Incomplete | None = None
+    G: Graph[_Node],
+    source: _Node,
+    reverse: bool | None = False,
+    depth_limit=None,
+    sort_neighbors: Callable[..., Incomplete] | None = None,
 ): ...
 @_dispatchable
 def bfs_predecessors(
-    G, source, depth_limit: Incomplete | None = None, sort_neighbors: Incomplete | None = None
+    G: Graph[_Node], source: _Node, depth_limit=None, sort_neighbors: Callable[..., Incomplete] | None = None
 ) -> Generator[Incomplete, None, None]: ...
 @_dispatchable
 def bfs_successors(
-    G, source, depth_limit: Incomplete | None = None, sort_neighbors: Incomplete | None = None
+    G: Graph[_Node], source: _Node, depth_limit=None, sort_neighbors: Callable[..., Incomplete] | None = None
 ) -> Generator[Incomplete, None, None]: ...
 @_dispatchable
-def bfs_layers(G, sources) -> Generator[Incomplete, None, None]: ...
+def bfs_layers(G: Graph[_Node], sources) -> Generator[Incomplete, None, None]: ...
 @_dispatchable
-def descendants_at_distance(G, source, distance): ...
+def descendants_at_distance(G: Graph[_Node], source, distance): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/traversal/depth_first_search.pyi

@@ -1,22 +1,34 @@
 from _typeshed import Incomplete
-from collections.abc import Generator
+from collections.abc import Callable, Generator
 
 from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 
 @_dispatchable
 def dfs_edges(
-    G: Graph[_Node], source: _Node | None = None, depth_limit: int | None = None
+    G: Graph[_Node], source: _Node | None = None, depth_limit=None, *, sort_neighbors: Callable[..., Incomplete] | None = None
 ) -> Generator[tuple[_Node, _Node], None, None]: ...
 @_dispatchable
-def dfs_tree(G, source: Incomplete | None = None, depth_limit: Incomplete | None = None): ...
+def dfs_tree(
+    G: Graph[_Node], source: _Node | None = None, depth_limit=None, *, sort_neighbors: Callable[..., Incomplete] | None = None
+): ...
 @_dispatchable
-def dfs_predecessors(G, source: Incomplete | None = None, depth_limit: Incomplete | None = None): ...
+def dfs_predecessors(
+    G: Graph[_Node], source: _Node | None = None, depth_limit=None, *, sort_neighbors: Callable[..., Incomplete] | None = None
+): ...
 @_dispatchable
-def dfs_successors(G, source: Incomplete | None = None, depth_limit: Incomplete | None = None): ...
+def dfs_successors(
+    G: Graph[_Node], source: _Node | None = None, depth_limit=None, *, sort_neighbors: Callable[..., Incomplete] | None = None
+): ...
 @_dispatchable
-def dfs_postorder_nodes(G, source: Incomplete | None = None, depth_limit: Incomplete | None = None): ...
+def dfs_postorder_nodes(
+    G: Graph[_Node], source: _Node | None = None, depth_limit=None, *, sort_neighbors: Callable[..., Incomplete] | None = None
+): ...
 @_dispatchable
-def dfs_preorder_nodes(G, source: Incomplete | None = None, depth_limit: Incomplete | None = None): ...
+def dfs_preorder_nodes(
+    G: Graph[_Node], source: _Node | None = None, depth_limit=None, *, sort_neighbors: Callable[..., Incomplete] | None = None
+): ...
 @_dispatchable
-def dfs_labeled_edges(G, source: Incomplete | None = None, depth_limit: Incomplete | None = None) -> None: ...
+def dfs_labeled_edges(
+    G: Graph[_Node], source: _Node | None = None, depth_limit=None, *, sort_neighbors: Callable[..., Incomplete] | None = None
+) -> None: ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/traversal/edgebfs.pyi

@@ -1,9 +1,8 @@
 from _typeshed import Incomplete
 from collections.abc import Generator
 
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 
 @_dispatchable
-def edge_bfs(
-    G, source: Incomplete | None = None, orientation: Incomplete | None = None
-) -> Generator[Incomplete, None, Incomplete]: ...
+def edge_bfs(G: Graph[_Node], source=None, orientation=None) -> Generator[Incomplete, None, Incomplete]: ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/traversal/edgedfs.pyi

@@ -1,9 +1,8 @@
 from _typeshed import Incomplete
 from collections.abc import Generator
 
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 
 @_dispatchable
-def edge_dfs(
-    G, source: Incomplete | None = None, orientation: Incomplete | None = None
-) -> Generator[Incomplete, None, Incomplete]: ...
+def edge_dfs(G: Graph[_Node], source=None, orientation=None) -> Generator[Incomplete, None, Incomplete]: ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/tree/branchings.pyi

@@ -2,7 +2,10 @@ from _typeshed import Incomplete
 from collections.abc import Iterator
 from dataclasses import dataclass
 
+from networkx.classes.digraph import DiGraph
+from networkx.classes.graph import _Node
 from networkx.utils.backends import _dispatchable
+from numpy.random import RandomState
 
 __all__ = [
     "branching_weight",
@@ -15,24 +18,26 @@ __all__ = [
 ]
 
 @_dispatchable
-def branching_weight(G, attr: str = "weight", default: float = 1): ...
+def branching_weight(G: DiGraph[_Node], attr: str = "weight", default: float = 1): ...
 @_dispatchable
-def greedy_branching(G, attr: str = "weight", default: float = 1, kind: str = "max", seed: Incomplete | None = None): ...
+def greedy_branching(
+    G: DiGraph[_Node], attr: str = "weight", default: float = 1, kind: str = "max", seed: int | RandomState | None = None
+): ...
 @_dispatchable
 def maximum_branching(
-    G, attr: str = "weight", default: float = 1, preserve_attrs: bool = False, partition: Incomplete | None = None
+    G: DiGraph[_Node], attr: str = "weight", default: float = 1, preserve_attrs: bool = False, partition: str | None = None
 ): ...
 @_dispatchable
 def minimum_branching(
-    G, attr: str = "weight", default: float = 1, preserve_attrs: bool = False, partition: Incomplete | None = None
+    G: DiGraph[_Node], attr: str = "weight", default: float = 1, preserve_attrs: bool = False, partition: str | None = None
 ): ...
 @_dispatchable
 def maximum_spanning_arborescence(
-    G, attr: str = "weight", default: float = 1, preserve_attrs: bool = False, partition: Incomplete | None = None
+    G: DiGraph[_Node], attr: str = "weight", default: float = 1, preserve_attrs: bool = False, partition: str | None = None
 ): ...
 @_dispatchable
 def minimum_spanning_arborescence(
-    G, attr: str = "weight", default: float = 1, preserve_attrs: bool = False, partition: Incomplete | None = None
+    G: DiGraph[_Node], attr: str = "weight", default: float = 1, preserve_attrs: bool = False, partition: str | None = None
 ): ...
 
 class ArborescenceIterator:
@@ -47,7 +52,9 @@ class ArborescenceIterator:
     method: Incomplete
     partition_key: str
     init_partition: Incomplete
+
     def __init__(self, G, weight: str = "weight", minimum: bool = True, init_partition: Incomplete | None = None) -> None: ...
     partition_queue: Incomplete
+
     def __iter__(self) -> Iterator[Incomplete]: ...
     def __next__(self): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/tree/coding.pyi

@@ -1,13 +1,17 @@
+from _typeshed import Incomplete
+from collections.abc import Iterable
+
+from networkx.classes.graph import Graph, _Node
 from networkx.exception import NetworkXException
 from networkx.utils.backends import _dispatchable
 
 class NotATree(NetworkXException): ...
 
 @_dispatchable
-def to_nested_tuple(T, root, canonical_form: bool = False): ...
+def to_nested_tuple(T: Graph[_Node], root: _Node, canonical_form: bool = False): ...
 @_dispatchable
-def from_nested_tuple(sequence, sensible_relabeling: bool = False): ...
+def from_nested_tuple(sequence: tuple[Incomplete], sensible_relabeling: bool = False): ...
 @_dispatchable
-def to_prufer_sequence(T): ...
+def to_prufer_sequence(T: Graph[_Node]): ...
 @_dispatchable
-def from_prufer_sequence(sequence): ...
+def from_prufer_sequence(sequence: Iterable[Incomplete]): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/tree/mst.pyi

@@ -3,7 +3,9 @@ from collections.abc import Iterator
 from dataclasses import dataclass
 from enum import Enum
 
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
+from numpy.random import RandomState
 
 class EdgePartition(Enum):
     OPEN = 0
@@ -12,22 +14,34 @@ class EdgePartition(Enum):
 
 @_dispatchable
 def minimum_spanning_edges(
-    G, algorithm: str = "kruskal", weight: str = "weight", keys: bool = True, data: bool = True, ignore_nan: bool = False
+    G: Graph[_Node],
+    algorithm: str = "kruskal",
+    weight: str = "weight",
+    keys: bool = True,
+    data: bool | None = True,
+    ignore_nan: bool = False,
 ): ...
 @_dispatchable
 def maximum_spanning_edges(
-    G, algorithm: str = "kruskal", weight: str = "weight", keys: bool = True, data: bool = True, ignore_nan: bool = False
+    G: Graph[_Node],
+    algorithm: str = "kruskal",
+    weight: str = "weight",
+    keys: bool = True,
+    data: bool | None = True,
+    ignore_nan: bool = False,
 ): ...
 @_dispatchable
-def minimum_spanning_tree(G, weight: str = "weight", algorithm: str = "kruskal", ignore_nan: bool = False): ...
+def minimum_spanning_tree(G: Graph[_Node], weight: str = "weight", algorithm: str = "kruskal", ignore_nan: bool = False): ...
 @_dispatchable
 def partition_spanning_tree(
-    G, minimum: bool = True, weight: str = "weight", partition: str = "partition", ignore_nan: bool = False
+    G: Graph[_Node], minimum: bool = True, weight: str = "weight", partition: str = "partition", ignore_nan: bool = False
 ): ...
 @_dispatchable
-def maximum_spanning_tree(G, weight: str = "weight", algorithm: str = "kruskal", ignore_nan: bool = False): ...
+def maximum_spanning_tree(G: Graph[_Node], weight: str = "weight", algorithm: str = "kruskal", ignore_nan: bool = False): ...
 @_dispatchable
-def random_spanning_tree(G, weight: Incomplete | None = None, *, multiplicative: bool = True, seed: Incomplete | None = None): ...
+def random_spanning_tree(
+    G: Graph[_Node], weight: str | None = None, *, multiplicative=True, seed: int | RandomState | None = None
+): ...
 
 class SpanningTreeIterator:
     @dataclass
@@ -40,7 +54,9 @@ class SpanningTreeIterator:
     minimum: Incomplete
     ignore_nan: Incomplete
     partition_key: str
+
     def __init__(self, G, weight: str = "weight", minimum: bool = True, ignore_nan: bool = False) -> None: ...
     partition_queue: Incomplete
+
     def __iter__(self) -> Iterator[Incomplete]: ...
     def __next__(self): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/tree/operations.pyi

@@ -1,6 +1,7 @@
 from _typeshed import Incomplete
+from collections.abc import Iterable
 
 from networkx.utils.backends import _dispatchable
 
 @_dispatchable
-def join_trees(rooted_trees, label_attribute: Incomplete | None = None): ...
+def join_trees(rooted_trees: Iterable[Incomplete], *, label_attribute: str | None = None, first_label: int | None = 0): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/tree/recognition.pyi

@@ -1,10 +1,12 @@
+from networkx.classes.digraph import DiGraph
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 
 @_dispatchable
-def is_arborescence(G): ...
+def is_arborescence(G: Graph[_Node]): ...
 @_dispatchable
-def is_branching(G): ...
+def is_branching(G: DiGraph[_Node]): ...
 @_dispatchable
-def is_forest(G): ...
+def is_forest(G: Graph[_Node]): ...
 @_dispatchable
-def is_tree(G): ...
+def is_tree(G: Graph[_Node]): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/triads.pyi

@@ -1,19 +1,22 @@
 from _typeshed import Incomplete
-from collections.abc import Generator
+from collections.abc import Generator, Iterable
 
+from networkx.classes.digraph import DiGraph
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
+from numpy.random import RandomState
 
 @_dispatchable
-def triadic_census(G, nodelist: Incomplete | None = None): ...
+def triadic_census(G: DiGraph[_Node], nodelist: Iterable[Incomplete] | None = None): ...
 @_dispatchable
-def is_triad(G): ...
+def is_triad(G: Graph[_Node]): ...
 @_dispatchable
-def all_triplets(G): ...
+def all_triplets(G: DiGraph[_Node]): ...
 @_dispatchable
-def all_triads(G) -> Generator[Incomplete, None, None]: ...
+def all_triads(G: DiGraph[_Node]) -> Generator[Incomplete, None, None]: ...
 @_dispatchable
-def triads_by_type(G): ...
+def triads_by_type(G: DiGraph[_Node]): ...
 @_dispatchable
-def triad_type(G): ...
+def triad_type(G: DiGraph[_Node]): ...
 @_dispatchable
-def random_triad(G, seed: Incomplete | None = None): ...
+def random_triad(G: DiGraph[_Node], seed: int | RandomState | None = None): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/vitality.pyi

@@ -1,8 +1,9 @@
 from _typeshed import Incomplete
 
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 
 @_dispatchable
 def closeness_vitality(
-    G, node: Incomplete | None = None, weight: Incomplete | None = None, wiener_index: Incomplete | None = None
+    G: Graph[_Node], node: Incomplete | None = None, weight: str | None = None, wiener_index: float | None = None
 ): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/voronoi.pyi

@@ -1,4 +1,13 @@
+from _typeshed import Incomplete, SupportsGetItem
+from collections.abc import Callable
+from typing import Any
+
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 
 @_dispatchable
-def voronoi_cells(G, center_nodes, weight: str = "weight"): ...
+def voronoi_cells(
+    G: Graph[_Node],
+    center_nodes: set[Incomplete],
+    weight: str | Callable[[Any, Any, SupportsGetItem[str, Any]], float | None] | None = "weight",
+): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/walks.pyi

@@ -0,0 +1,5 @@
+from networkx.classes.graph import Graph, _Node
+from networkx.utils.backends import _dispatchable
+
+@_dispatchable
+def number_of_walks(G: Graph[_Node], walk_length: int): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/algorithms/wiener.pyi

@@ -1,6 +1,5 @@
-from _typeshed import Incomplete
-
+from networkx.classes.graph import Graph, _Node
 from networkx.utils.backends import _dispatchable
 
 @_dispatchable
-def wiener_index(G, weight: Incomplete | None = None): ...
+def wiener_index(G: Graph[_Node], weight: str | None = None): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/classes/coreviews.pyi

@@ -7,11 +7,13 @@ _U = TypeVar("_U")
 _V = TypeVar("_V")
 
 class AtlasView(Mapping[_T, dict[_U, _V]]):
+    def __getstate__(self) -> dict[str, Mapping[_T, dict[_U, _V]]]: ...
+    def __setstate__(self, state: dict[str, Mapping[_T, dict[_U, _V]]]) -> None: ...
     def __init__(self, d: Mapping[_T, dict[_U, _V]]) -> None: ...
     def __len__(self) -> int: ...
     def __iter__(self) -> Iterator[_T]: ...
     def __getitem__(self, key: _T) -> dict[_U, _V]: ...
-    def copy(self) -> Self: ...
+    def copy(self) -> dict[_T, dict[_U, _V]]: ...
 
 class AdjacencyView(AtlasView[_T, _U, _V]): ...
 class MultiAdjacencyView(AdjacencyView[_T, _U, _V]): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/classes/graph.pyi

@@ -45,11 +45,11 @@ class Graph(Collection[_Node]):
     def name(self) -> str: ...
     @name.setter
     def name(self, s: str) -> None: ...
-    def __getitem__(self, n: _Node) -> AtlasView[_Node, _Node, dict[str, Incomplete]]: ...
+    def __getitem__(self, n: _Node) -> AtlasView[_Node, str, Any]: ...
     def __iter__(self) -> Iterator[_Node]: ...
     def __contains__(self, n: object) -> bool: ...
     def __len__(self) -> int: ...
-    def add_node(self, node_for_adding: _Node, **attr) -> None: ...
+    def add_node(self, node_for_adding: _Node, **attr: Any) -> None: ...  # attr: Set or change node attributes using key=value
     def add_nodes_from(self, nodes_for_adding: Iterable[_NodePlus[_Node]], **attr) -> None: ...
     def remove_node(self, n: _Node) -> None: ...
     def remove_nodes_from(self, nodes: Iterable[_Node]) -> None: ...
@@ -58,7 +58,8 @@ class Graph(Collection[_Node]):
     def number_of_nodes(self) -> int: ...
     def order(self) -> int: ...
     def has_node(self, n: _Node) -> bool: ...
-    def add_edge(self, u_of_edge: _Node, v_of_edge: _Node, **attr) -> None: ...
+    # attr: Edge data (or labels or objects) can be assigned using keyword arguments
+    def add_edge(self, u_of_edge: _Node, v_of_edge: _Node, **attr: Any) -> None: ...
     def add_edges_from(self, ebunch_to_add: Iterable[_EdgePlus[_Node]], **attr) -> None: ...
     def add_weighted_edges_from(
         self, ebunch_to_add: Iterable[tuple[_Node, _Node, Incomplete]], weight: str = "weight", **attr

package/dist/typeshed-fallback/stubs/networkx/networkx/classes/multidigraph.pyi

@@ -13,6 +13,8 @@ class MultiDiGraph(MultiGraph[_Node], DiGraph[_Node]):
     @cached_property
     def pred(self) -> MultiAdjacencyView[_Node, _Node, dict[str, Incomplete]]: ...
     @cached_property
+    def edges(self) -> OutMultiEdgeView[_Node]: ...
+    @cached_property
     def out_edges(self) -> OutMultiEdgeView[_Node]: ...
     @cached_property
     def in_edges(self) -> OutMultiEdgeView[_Node]: ...

package/dist/typeshed-fallback/stubs/networkx/networkx/classes/multigraph.pyi

@@ -5,6 +5,7 @@ from typing_extensions import TypeAlias
 from networkx.classes.coreviews import MultiAdjacencyView
 from networkx.classes.graph import Graph, _Node
 from networkx.classes.multidigraph import MultiDiGraph
+from networkx.classes.reportviews import OutMultiEdgeView
 
 _MultiEdge: TypeAlias = tuple[_Node, _Node, int]  # noqa: Y047
 
@@ -23,3 +24,5 @@ class MultiGraph(Graph[_Node]):
     def to_directed(self, as_view: bool = False) -> MultiDiGraph[_Node]: ...
     def to_undirected(self, as_view: bool = False) -> MultiGraph[_Node]: ...
     def number_of_edges(self, u: _Node | None = None, v: _Node | None = None) -> int: ...
+    @cached_property
+    def edges(self) -> OutMultiEdgeView[_Node]: ...

package/dist/typeshed-fallback/stubs/networkx/networkx/classes/reportviews.pyi

@@ -110,36 +110,66 @@ class EdgeView(OutEdgeView[_Node]): ...
 class InEdgeView(OutEdgeView[_Node]): ...
 
 class OutMultiEdgeView(OutEdgeView[_Node]):
+    def __iter__(self) -> Iterator[tuple[_Node, _Node, Incomplete]]: ...  # type: ignore[override]
+    def __getitem__(self, e: tuple[_Node, _Node, Incomplete]) -> dict[str, Any]: ...  # type: ignore[override]
     @overload  # type: ignore[override]  # Has an additional `keys` keyword argument
-    def __call__(
+    def __call__(  # type: ignore[overload-overlap]
         self, nbunch: None = None, data: Literal[False] = False, *, default: Unused = None, keys: Literal[True]
     ) -> Self: ...
     @overload
     def __call__(
-        self, nbunch: _NBunch[_Node], data: Literal[True], *, default: None = None, keys: bool = False
-    ) -> OutMultiEdgeDataView[_Node, tuple[_Node, _Node, dict[str, Incomplete]]]: ...
+        self, nbunch: _NBunch[_Node] = None, data: Literal[False] = False, *, default: None = None, keys: Literal[False] = False
+    ) -> OutMultiEdgeDataView[_Node, tuple[_Node, _Node]]: ...
+    @overload
+    def __call__(
+        self, nbunch: _Node | Iterable[_Node], data: Literal[False] = False, *, default: None = None, keys: Literal[True]
+    ) -> OutMultiEdgeDataView[_Node, tuple[_Node, _Node, Incomplete]]: ...
+    @overload
+    def __call__(
+        self, nbunch: _NBunch[_Node] = None, *, data: Literal[True], default: None = None, keys: Literal[True]
+    ) -> OutMultiEdgeDataView[_Node, tuple[_Node, _Node, Incomplete, dict[str, Incomplete]]]: ...
+    @overload
+    def __call__(
+        self, nbunch: _NBunch[_Node], data: Literal[True], *, default: None = None, keys: Literal[True]
+    ) -> OutMultiEdgeDataView[_Node, tuple[_Node, _Node, Incomplete, dict[str, Incomplete]]]: ...
     @overload
     def __call__(
-        self, nbunch: _NBunch[_Node] = None, *, data: Literal[True], default: None = None, keys: bool = False
+        self, nbunch: _NBunch[_Node] = None, *, data: Literal[True], default: None = None, keys: Literal[False] = False
     ) -> OutMultiEdgeDataView[_Node, tuple[_Node, _Node, dict[str, Incomplete]]]: ...
     @overload
     def __call__(
-        self, nbunch: _NBunch[_Node], data: str, *, default: _U | None = None, keys: bool = False
+        self, nbunch: _NBunch[_Node], data: str, *, default: _U | None = None, keys: Literal[False] = False
     ) -> OutMultiEdgeDataView[_Node, tuple[_Node, _Node, _U]]: ...
     @overload
     def __call__(
-        self, nbunch: _NBunch[_Node] = None, *, data: str, default: _U | None = None, keys: bool = False
+        self, nbunch: _NBunch[_Node] = None, *, data: str, default: _U | None = None, keys: Literal[True]
+    ) -> OutMultiEdgeDataView[_Node, tuple[_Node, _Node, Incomplete, _U]]: ...
+    @overload
+    def __call__(
+        self, nbunch: _NBunch[_Node] = None, *, data: str, default: _U | None = None, keys: Literal[False] = False
     ) -> OutMultiEdgeDataView[_Node, tuple[_Node, _Node, _U]]: ...
+    @overload  # type: ignore[override]
+    def data(self, data: Literal[False], default: Unused = None, nbunch: None = None, *, keys: Literal[True]) -> Self: ...
     @overload
-    def data(self, data: Literal[False], default: Unused = None, nbunch: None = None, keys: Literal[False] = False) -> Self: ...
+    def data(
+        self, data: Literal[False], default: None = None, nbunch: _NBunch[_Node] = None, keys: Literal[False] = False
+    ) -> OutMultiEdgeDataView[_Node, tuple[_Node, _Node]]: ...
     @overload
     def data(
-        self, data: Literal[True] = True, default: None = None, nbunch: _NBunch[_Node] = None, keys: bool = False
+        self, data: Literal[True] = True, default: None = None, nbunch: _NBunch[_Node] = None, keys: Literal[False] = False
     ) -> OutMultiEdgeDataView[_Node, tuple[_Node, _Node, dict[str, Incomplete]]]: ...
     @overload
     def data(
-        self, data: str, default: _U | None = None, nbunch: _NBunch[_Node] = None, keys: bool = False
+        self, data: Literal[True] = True, default: None = None, nbunch: _NBunch[_Node] = None, *, keys: Literal[True]
+    ) -> OutMultiEdgeDataView[_Node, tuple[_Node, _Node, Incomplete, dict[str, Incomplete]]]: ...
+    @overload
+    def data(
+        self, data: str, default: _U | None = None, nbunch: _NBunch[_Node] = None, keys: Literal[False] = False
     ) -> OutMultiEdgeDataView[_Node, tuple[_Node, _Node, _U]]: ...
+    @overload
+    def data(
+        self, data: str, default: _U | None = None, nbunch: _NBunch[_Node] = None, *, keys: Literal[True]
+    ) -> OutMultiEdgeDataView[_Node, tuple[_Node, _Node, Incomplete, _U]]: ...
 
 class MultiEdgeView(OutMultiEdgeView[_Node]): ...
 class InMultiEdgeView(OutMultiEdgeView[_Node]): ...

package/dist/typeshed-fallback/stubs/networkx/networkx/generators/__init__.pyi

@@ -8,6 +8,7 @@ from networkx.generators.duplication import *
 from networkx.generators.ego import *
 from networkx.generators.expanders import *
 from networkx.generators.geometric import *
+from networkx.generators.harary_graph import *
 from networkx.generators.internet_as_graphs import *
 from networkx.generators.intersection import *
 from networkx.generators.interval_graph import *
@@ -23,5 +24,6 @@ from networkx.generators.social import *
 from networkx.generators.spectral_graph_forge import *
 from networkx.generators.stochastic import *
 from networkx.generators.sudoku import *
+from networkx.generators.time_series import *
 from networkx.generators.trees import *
 from networkx.generators.triads import *

package/dist/typeshed-fallback/stubs/networkx/networkx/generators/time_series.pyi

@@ -0,0 +1,4 @@
+from networkx.utils.backends import _dispatchable
+
+@_dispatchable
+def visibility_graph(series): ...

package/dist/typeshed-fallback/stubs/passlib/passlib/hosts.pyi

@@ -1,3 +1,4 @@
+import sys
 from typing import Any
 
 from passlib.context import CryptContext
@@ -8,4 +9,5 @@ freebsd_context: Any
 openbsd_context: Any
 netbsd_context: Any
 # Only exists if crypt is present
-host_context: CryptContext
+if sys.version_info < (3, 13):
+    host_context: CryptContext

package/dist/typeshed-fallback/stubs/peewee/peewee.pyi

@@ -190,11 +190,11 @@ class Table(_HashableSource, BaseTable):  # type: ignore[misc]
         schema: str | None = None,
         alias: Incomplete | None = ...,
         _model: Incomplete | None = ...,
-        _database: Incomplete | None = ...,
+        _database: Incomplete | None = None,
     ) -> None: ...
     def clone(self): ...
-    def bind(self, database: Incomplete | None = ...): ...
-    def bind_ctx(self, database: Incomplete | None = ...): ...
+    def bind(self, database: Incomplete | None = None): ...
+    def bind_ctx(self, database: Incomplete | None = None): ...
     def select(self, *columns): ...
     def insert(self, insert: Incomplete | None = ..., columns: Incomplete | None = ..., **kwargs): ...
     def replace(self, insert: Incomplete | None = ..., columns: Incomplete | None = ..., **kwargs): ...
@@ -517,8 +517,8 @@ class OnConflict(Node):
 
 class BaseQuery(Node):
     default_row_type: Incomplete
-    def __init__(self, _database: Incomplete | None = ..., **kwargs) -> None: ...
-    def bind(self, database: Incomplete | None = ...): ...
+    def __init__(self, _database: Incomplete | None = None, **kwargs) -> None: ...
+    def bind(self, database: Incomplete | None = None): ...
     def clone(self): ...
     def dicts(self, as_dict: bool = ...) -> Self: ...
     def tuples(self, as_tuple: bool = ...) -> Self: ...
@@ -526,8 +526,8 @@ class BaseQuery(Node):
     def objects(self, constructor: Incomplete | None = ...) -> Self: ...
     def __sql__(self, ctx) -> None: ...
     def sql(self): ...
-    def execute(self, database): ...
-    def iterator(self, database: Incomplete | None = ...): ...
+    def execute(self, database: Incomplete | None = None): ...
+    def iterator(self, database: Incomplete | None = None): ...
     def __iter__(self): ...
     def __getitem__(self, value): ...
     def __len__(self) -> int: ...
@@ -571,20 +571,20 @@ class SelectQuery(Query):
     def select_from(self, *columns): ...
 
 class SelectBase(_HashableSource, Source, SelectQuery):  # type: ignore[misc]
-    def peek(self, database, n: int = ...): ...
-    def first(self, database, n: int = ...): ...
-    def scalar(self, database, as_tuple: bool = ..., as_dict: bool = ...): ...
-    def scalars(self, database) -> Generator[Incomplete, None, None]: ...
-    def count(self, database, clear_limit: bool = ...): ...
-    def exists(self, database): ...
-    def get(self, database): ...
+    def peek(self, database: Incomplete | None = None, n: int = ...): ...
+    def first(self, database: Incomplete | None = None, n: int = ...): ...
+    def scalar(self, database: Incomplete | None = None, as_tuple: bool = ..., as_dict: bool = ...): ...
+    def scalars(self, database: Incomplete | None = None) -> Generator[Incomplete, None, None]: ...
+    def count(self, database: Incomplete | None = None, clear_limit: bool = ...): ...
+    def exists(self, database: Incomplete | None = None): ...
+    def get(self, database: Incomplete | None = None): ...
 
 class CompoundSelectQuery(SelectBase):
     lhs: Incomplete
     op: Incomplete
     rhs: Incomplete
     def __init__(self, lhs, op, rhs) -> None: ...
-    def exists(self, database): ...
+    def exists(self, database: Incomplete | None = None): ...
     def __sql__(self, ctx): ...
 
 class Select(SelectBase):
@@ -1495,7 +1495,7 @@ class _SortedFieldList:
 class SchemaManager:
     model: Incomplete
     context_options: Incomplete
-    def __init__(self, model, database: Incomplete | None = ..., **context_options) -> None: ...
+    def __init__(self, model, database: Incomplete | None = None, **context_options) -> None: ...
     @property
     def database(self): ...
     @database.setter
@@ -1546,7 +1546,7 @@ class Metadata:
     def __init__(
         self,
         model,
-        database: Incomplete | None = ...,
+        database: Incomplete | None = None,
         table_name: Incomplete | None = ...,
         indexes: Incomplete | None = ...,
         primary_key: Incomplete | None = ...,
@@ -1744,8 +1744,8 @@ class BaseModelSelect(_ModelQueryHelper):
     __sub__: Incomplete
     def __iter__(self): ...
     def prefetch(self, *subqueries): ...
-    def get(self, database: Incomplete | None = ...): ...
-    def get_or_none(self, database: Incomplete | None = ...): ...
+    def get(self, database: Incomplete | None = None): ...
+    def get_or_none(self, database: Incomplete | None = None): ...
     def group_by(self, *columns) -> Self: ...
 
 class ModelCompoundSelectQuery(BaseModelSelect, CompoundSelectQuery):  # type: ignore[misc]

package/dist/typeshed-fallback/stubs/protobuf/google/protobuf/descriptor.pyi

@@ -156,6 +156,12 @@ class FieldDescriptor(DescriptorBase):
     cpp_type: Any
     @property
     def label(self): ...
+    @property
+    def camelcase_name(self) -> str: ...
+    @property
+    def has_presence(self) -> bool: ...
+    @property
+    def is_packed(self) -> bool: ...
     has_default_value: Any
     default_value: Any
     containing_type: Any