VimPlug/typeshed
1
0
Fork 0
mirror of https://github.com/davidhalter/typeshed.git synced 2026-08-03 14:38:28 +08:00
Code Issues Actions Packages Projects Releases Wiki Activity

Update most test/lint dependencies (#15582)

Browse Source
This commit is contained in:
renovate[bot]
2026-04-01 17:54:51 +02:00
committed by GitHub
parent 8ffc43610f
commit 8b31f2639e
142 changed files with 310 additions and 357 deletions
Download Patch File Download Diff File Expand all files Collapse all files
stubs/Authlib/authlib/integrations/httpx_client/oauth1_client.pyi
+1 -1
View File
@@ -12,7 +12,7 @@ _Request: TypeAlias = Incomplete # actual type is httpx.Request
# Inherits from httpx.Auth
class OAuth1Auth(ClientAuth):
requires_request_body: bool
def auth_flow(self, request: _Request) -> Generator[_Request, _Response, None]: ...
def auth_flow(self, request: _Request) -> Generator[_Request, _Response]: ...
# Inherits from httpx.AsyncClient
class AsyncOAuth1Client(_OAuth1Client):
stubs/Authlib/authlib/integrations/httpx_client/oauth2_client.pyi
+2 -2
View File
@@ -16,12 +16,12 @@ _Request: TypeAlias = Incomplete # actual type is httpx.Request
# Inherits from httpx.Auth
class OAuth2Auth(TokenAuth):
requires_request_body: bool
def auth_flow(self, request: _Request) -> Generator[_Request, _Response, None]: ...
def auth_flow(self, request: _Request) -> Generator[_Request, _Response]: ...
# Inherits from httpx.Auth
class OAuth2ClientAuth(ClientAuth):
requires_request_body: bool
def auth_flow(self, request: _Request) -> Generator[_Request, _Response, None]: ...
def auth_flow(self, request: _Request) -> Generator[_Request, _Response]: ...
# Inherits from httpx.AsyncClient
class AsyncOAuth2Client(_OAuth2Client):
stubs/JACK-Client/jack/__init__.pyi
+1 -1
View File
@@ -237,7 +237,7 @@ class OwnMidiPort(MidiPort, OwnPort):
def max_event_size(self) -> int: ...
@property
def lost_midi_events(self) -> int: ...
def incoming_midi_events(self) -> Generator[tuple[int, _CBufferType], None, None]: ...
def incoming_midi_events(self) -> Generator[tuple[int, _CBufferType]]: ...
def clear_buffer(self) -> None: ...
def write_midi_event(self, time: int, event: bytes | Sequence[int] | _CBufferType) -> None: ...
def reserve_midi_event(self, time: int, size: int) -> _CBufferType: ...
stubs/PyScreeze/pyscreeze/__init__.pyi
+4 -4
View File
@@ -108,7 +108,7 @@ def locateAllOnScreen(
region: tuple[int, int, int, int] | None = None,
step: int = 1,
confidence: ConvertibleToFloat = 0.999,
) -> Generator[Box, None, None]: ...
) -> Generator[Box]: ...
# _locateAll_pillow
@overload
@@ -120,7 +120,7 @@ def locateAllOnScreen(
region: tuple[int, int, int, int] | None = None,
step: int = 1,
confidence: None = None,
) -> Generator[Box, None, None]: ...
) -> Generator[Box]: ...
# _locateAll_opencv
@overload
@@ -202,7 +202,7 @@ def locateAll(
region: tuple[int, int, int, int] | None = None,
step: int = 1,
confidence: ConvertibleToFloat = 0.999,
) -> Generator[Box, None, None]: ...
) -> Generator[Box]: ...
# _locateAll_pillow
@overload
@@ -214,4 +214,4 @@ def locateAll(
region: tuple[int, int, int, int] | None = None,
step: int = 1,
confidence: None = None,
) -> Generator[Box, None, None]: ...
) -> Generator[Box]: ...
stubs/WebOb/webob/request.pyi
+1 -1
View File
@@ -203,7 +203,7 @@ class LegacyRequest(BaseRequest):
def uscript_name(self) -> str: ...
@uscript_name.setter
def uscript_name(self, value: str) -> None: ...
@property # type:ignore[override]
@property # type: ignore[override]
def upath_info(self) -> str: ...
@upath_info.setter
def upath_info(self, value: str) -> None: ...
stubs/antlr4-python3-runtime/antlr4/ParserRuleContext.pyi
+1 -1
View File
@@ -32,7 +32,7 @@ class ParserRuleContext(RuleContext):
def getChild(self, i: int, ttype: type[_GenericType] | None = None) -> _GenericType | None: ...
def getChildren(
self, predicate: Callable[[ParseTree | TerminalNode], bool] | None = None
) -> Generator[ParseTree | TerminalNode, None, None]: ...
) -> Generator[ParseTree | TerminalNode]: ...
def getToken(self, ttype: int, i: int) -> TerminalNode | None: ...
def getTokens(self, ttype: int) -> list[TerminalNode]: ...
def getTypedRuleContext(self, ctxType: type[_ParserRuleContextT], i: int) -> _ParserRuleContextT | None: ...
stubs/antlr4-python3-runtime/antlr4/RuleContext.pyi
+1 -1
View File
@@ -25,7 +25,7 @@ class RuleContext(RuleNode):
def setAltNumber(self, altNumber: int) -> None: ...
def getChild(self, i: int) -> Any: ...
def getChildCount(self) -> int: ...
def getChildren(self) -> Generator[Any, None, None]: ...
def getChildren(self) -> Generator[Any]: ...
def accept(self, visitor: ParseTreeVisitor) -> None: ...
def toStringTree(self, ruleNames: list[str] | None = None, recog: Recognizer | None = None) -> str: ...
def toString(self, ruleNames: list[str], stop: RuleContext) -> str: ...
stubs/bleach/bleach/html5lib_shim.pyi
+2 -2
View File
@@ -62,8 +62,8 @@ class BleachHTMLParser(HTMLParser):
class BleachHTMLSerializer(HTMLSerializer):
escape_rcdata: bool
def escape_base_amp(self, stoken: str) -> Generator[str, None, None]: ...
def serialize(self, treewalker: TreeWalker, encoding: str | None = None) -> Generator[str, None, None]: ... # type: ignore[override]
def escape_base_amp(self, stoken: str) -> Generator[str]: ...
def serialize(self, treewalker: TreeWalker, encoding: str | None = None) -> Generator[str]: ... # type: ignore[override]
def convert_entity(value: str) -> str | None: ...
def convert_entities(text: str) -> str: ...
stubs/boltons/boltons/cacheutils.pyi
+2 -2
View File
@@ -125,9 +125,9 @@ class ThresholdCounter(Generic[_T]):
def __contains__(self, key: _T) -> bool: ...
def iterkeys(self) -> Iterator[_T]: ...
def keys(self) -> list[_T]: ...
def itervalues(self) -> Generator[int, None, None]: ...
def itervalues(self) -> Generator[int]: ...
def values(self) -> list[int]: ...
def iteritems(self) -> Generator[tuple[_T, int], None, None]: ...
def iteritems(self) -> Generator[tuple[_T, int]]: ...
def items(self) -> list[tuple[_T, int]]: ...
def get(self, key: _T, default: int = 0) -> int: ...
def update(self, iterable: Iterable[_T] | Mapping[_T, int], **kwargs: Iterable[_T] | Mapping[_T, int]) -> None: ...
stubs/boltons/boltons/dictutils.pyi
+6 -6
View File
@@ -22,9 +22,9 @@ class OrderedMultiDict(dict[_KT, _VT]):
def getlist(self, k: _KT, default: list[_VT] = ...) -> list[_VT]: ...
def inverted(self) -> Self: ...
def items(self, multi: bool = False) -> list[tuple[_KT, _VT]]: ... # type: ignore[override]
def iteritems(self, multi: bool = False) -> Generator[tuple[_KT, _VT], None, None]: ...
def iterkeys(self, multi: bool = False) -> Generator[_KT, None, None]: ...
def itervalues(self, multi: bool = False) -> Generator[_VT, None, None]: ...
def iteritems(self, multi: bool = False) -> Generator[tuple[_KT, _VT]]: ...
def iterkeys(self, multi: bool = False) -> Generator[_KT]: ...
def itervalues(self, multi: bool = False) -> Generator[_VT]: ...
def keys(self, multi: bool = False) -> list[_KT]: ... # type: ignore[override]
def pop(self, k: _KT, default: _VT = ...) -> _VT: ... # type: ignore[override]
def popall(self, k: _KT, default: _VT = ...) -> list[_VT]: ...
@@ -47,8 +47,8 @@ OMD: TypeAlias = OrderedMultiDict[_KT, _VT]
MultiDict: TypeAlias = OrderedMultiDict[_KT, _VT]
class FastIterOrderedMultiDict(OrderedMultiDict[_KT, _VT]): # undocumented
def iteritems(self, multi: bool = False) -> Generator[tuple[_KT, _VT], None, None]: ...
def iterkeys(self, multi: bool = False) -> Generator[_KT, None, None]: ...
def iteritems(self, multi: bool = False) -> Generator[tuple[_KT, _VT]]: ...
def iterkeys(self, multi: bool = False) -> Generator[_KT]: ...
class OneToOne(dict[_KT, _VT]):
__slots__ = ("inv",)
@@ -77,7 +77,7 @@ class ManyToMany(dict[_KT, frozenset[_VT]]):
def __setitem__(self, key: _KT, vals: Iterable[_VT]) -> None: ...
def add(self, key: _KT, val: _VT) -> None: ...
def get(self, key: _KT, default: frozenset[_VT] = ...) -> frozenset[_VT]: ... # type: ignore[override]
def iteritems(self) -> Generator[tuple[_KT, _VT], None, None]: ...
def iteritems(self) -> Generator[tuple[_KT, _VT]]: ...
def keys(self): ...
def remove(self, key: _KT, val: _VT) -> None: ...
def replace(self, key: _KT, newkey: _KT) -> None: ...
stubs/boltons/boltons/fileutils.pyi
+1 -1
View File
@@ -51,7 +51,7 @@ def iter_find_files(
ignored: str | Iterable[str] | None = None,
include_dirs: bool = False,
max_depth: int | None = None,
) -> Generator[str, None, None]: ...
) -> Generator[str]: ...
@overload
def copy_tree(
src: _StrPathT, dst: _StrPathT, symlinks: bool = False, ignore: Callable[[_StrPathT, list[str]], Iterable[str]] | None = None
stubs/boltons/boltons/iterutils.pyi
+6 -6
View File
@@ -7,24 +7,24 @@ def is_collection(obj) -> bool: ...
def split(src, sep=None, maxsplit=None): ...
def split_iter(src, sep=None, maxsplit=None) -> Generator[Incomplete, None, Incomplete]: ...
def lstrip(iterable, strip_value=None): ...
def lstrip_iter(iterable, strip_value=None) -> Generator[Incomplete, None, None]: ...
def lstrip_iter(iterable, strip_value=None) -> Generator[Incomplete]: ...
def rstrip(iterable, strip_value=None): ...
def rstrip_iter(iterable, strip_value=None) -> Generator[Incomplete, None, None]: ...
def rstrip_iter(iterable, strip_value=None) -> Generator[Incomplete]: ...
def strip(iterable, strip_value=None): ...
def strip_iter(iterable, strip_value=None): ...
def chunked(src, size, count=None, **kw): ...
def chunked_iter(src, size, **kw) -> Generator[Incomplete, None, Incomplete]: ...
def chunk_ranges(
input_size: int, chunk_size: int, input_offset: int = 0, overlap_size: int = 0, align: bool = False
) -> Generator[tuple[int, int], None, None]: ...
) -> Generator[tuple[int, int]]: ...
def pairwise(src, end=...): ...
def pairwise_iter(src, end=...): ...
def windowed(src, size, fill=...): ...
def windowed_iter(src, size, fill=...): ...
def xfrange(stop, start=None, step: float = 1.0) -> Generator[Incomplete, None, None]: ...
def xfrange(stop, start=None, step: float = 1.0) -> Generator[Incomplete]: ...
def frange(stop, start=None, step: float = 1.0): ...
def backoff(start, stop, count=None, factor: float = 2.0, jitter: bool = False): ...
def backoff_iter(start, stop, count=None, factor: float = 2.0, jitter: bool = False) -> Generator[Incomplete, None, None]: ...
def backoff_iter(start, stop, count=None, factor: float = 2.0, jitter: bool = False) -> Generator[Incomplete]: ...
def bucketize(src, key=..., value_transform=None, key_filter=None): ...
def partition(src, key=...): ...
def unique(src, key=None): ...
@@ -32,7 +32,7 @@ def unique_iter(src, key=None) -> Generator[Incomplete, None, Incomplete]: ...
def redundant(src, key=None, groups: bool = False): ...
def one(src, default=None, key=None): ...
def first(iterable, default=None, key=None): ...
def flatten_iter(iterable) -> Generator[Incomplete, None, None]: ...
def flatten_iter(iterable) -> Generator[Incomplete]: ...
def flatten(iterable): ...
def same(iterable, ref=...): ...
def default_visit(path, key, value): ...
stubs/boltons/boltons/jsonutils.pyi
+3 -5
View File
@@ -5,13 +5,11 @@ from typing_extensions import Self
@overload
def reverse_iter_lines(
file_obj: IO[bytes], blocksize: int = 4096, preseek: bool = True, encoding: None = None
) -> Generator[bytes, None, None]: ...
) -> Generator[bytes]: ...
@overload
def reverse_iter_lines(
file_obj: IO[str], blocksize: int = 4096, preseek: bool = True, *, encoding: str
) -> Generator[str, None, None]: ...
def reverse_iter_lines(file_obj: IO[str], blocksize: int = 4096, preseek: bool = True, *, encoding: str) -> Generator[str]: ...
@overload
def reverse_iter_lines(file_obj: IO[str], blocksize: int, preseek: bool, encoding: str) -> Generator[str, None, None]: ...
def reverse_iter_lines(file_obj: IO[str], blocksize: int, preseek: bool, encoding: str) -> Generator[str]: ...
class JSONLIterator:
ignore_errors: bool
stubs/boltons/boltons/setutils.pyi
+3 -3
View File
@@ -17,7 +17,7 @@ class IndexedSet(MutableSet[Any]):
def __len__(self) -> int: ...
def __contains__(self, item: Any) -> bool: ...
def __iter__(self) -> Iterator[Any]: ...
def __reversed__(self) -> Generator[Any, None, None]: ...
def __reversed__(self) -> Generator[Any]: ...
@classmethod
def from_iterable(cls, it: Iterable[Any]) -> Self: ...
def add(self, item: Any) -> None: ...
@@ -28,9 +28,9 @@ class IndexedSet(MutableSet[Any]):
def issubset(self, other: Collection[Any]) -> bool: ...
def issuperset(self, other: Collection[Any]) -> bool: ...
def union(self, *others: Iterable[Any]) -> Self: ...
def iter_intersection(self, *others: Container[Any]) -> Generator[Any, None, None]: ...
def iter_intersection(self, *others: Container[Any]) -> Generator[Any]: ...
def intersection(self, *others: Container[Any]) -> Self: ...
def iter_difference(self, *others: Iterable[Any]) -> Generator[Any, None, None]: ...
def iter_difference(self, *others: Iterable[Any]) -> Generator[Any]: ...
def difference(self, *others: Iterable[Any]) -> Self: ...
def symmetric_difference(self, *others: Container[Any]) -> Self: ...
# __or__ = union
stubs/boltons/boltons/strutils.pyi
+1 -1
View File
@@ -42,7 +42,7 @@ class HTMLTextExtractor(HTMLParser):
def html2text(html: str) -> str: ...
def gunzip_bytes(bytestring: ReadableBuffer) -> bytes: ...
def gzip_bytes(bytestring: ReadableBuffer, level: int = 6) -> int: ...
def iter_splitlines(text: str) -> Generator[str, None, None]: ...
def iter_splitlines(text: str) -> Generator[str]: ...
def indent(text: str, margin: str, newline: str = "\n", key: Callable[[str], bool] = ...) -> str: ...
def is_uuid(obj, version: int = 4) -> bool: ...
def escape_shell_args(args: Iterable[str], sep: str = " ", style: Literal["cmd", "sh"] | None = None) -> str: ...
stubs/boltons/boltons/timeutils.pyi
+1 -1
View File
@@ -14,7 +14,7 @@ def decimal_relative_time(
) -> tuple[float, str]: ...
def relative_time(d: datetime, other: datetime | None = None, ndigits: int = 0) -> str: ...
def strpdate(string: str, format: str) -> date: ...
def daterange(start: date, stop: date, step: int = 1, inclusive: bool = False) -> Generator[date, None, None]: ...
def daterange(start: date, stop: date, step: int = 1, inclusive: bool = False) -> Generator[date]: ...
ZERO: timedelta
HOUR: timedelta
stubs/braintree/braintree/paginated_collection.pyi
+1 -1
View File
@@ -4,5 +4,5 @@ from collections.abc import Generator
class PaginatedCollection:
def __init__(self, method) -> None: ...
@property
def items(self) -> Generator[Incomplete, None, None]: ...
def items(self) -> Generator[Incomplete]: ...
def __iter__(self): ...
stubs/braintree/braintree/resource_collection.pyi
+1 -1
View File
@@ -8,7 +8,7 @@ class ResourceCollection:
@property
def first(self): ...
@property
def items(self) -> Generator[Incomplete, None, None]: ...
def items(self) -> Generator[Incomplete]: ...
@property
def ids(self): ...
def __iter__(self): ...
stubs/cffi/cffi/model.pyi
+2 -2
View File
@@ -124,8 +124,8 @@ class StructOrUnion(StructOrUnionOrEnum):
fldbitsize: Incomplete
fldquals: Incomplete
def __init__(self, name, fldnames, fldtypes, fldbitsize, fldquals=None) -> None: ...
def anonymous_struct_fields(self) -> Generator[StructOrUnion, None, None]: ...
def enumfields(self, expand_anonymous_struct_union: bool = True) -> Generator[Incomplete, None, None]: ...
def anonymous_struct_fields(self) -> Generator[StructOrUnion]: ...
def enumfields(self, expand_anonymous_struct_union: bool = True) -> Generator[Incomplete]: ...
def force_flatten(self) -> None: ...
def get_cached_btype(self, ffi, finishlist, can_delay: bool = False): ...
def finish_backend_type(self, ffi, finishlist) -> None: ...
stubs/console-menu/consolemenu/menu_component.pyi
+6 -6
View File
@@ -24,7 +24,7 @@ class MenuComponent:
def border_style(self) -> MenuBorderStyle: ...
def calculate_border_width(self) -> int: ...
def calculate_content_width(self) -> int: ...
def generate(self) -> Generator[str, None, None]: ...
def generate(self) -> Generator[str]: ...
def inner_horizontals(self) -> str: ...
def inner_horizontal_border(self) -> str: ...
def outer_horizontals(self) -> str: ...
@@ -48,7 +48,7 @@ class MenuHeader(MenuComponent):
subtitle_align: str = "left",
show_bottom_border: bool = False,
) -> None: ...
def generate(self) -> Generator[str, None, None]: ...
def generate(self) -> Generator[str]: ...
class MenuTextSection(MenuComponent):
text: str
@@ -64,7 +64,7 @@ class MenuTextSection(MenuComponent):
show_top_border: bool = False,
show_bottom_border: bool = False,
) -> None: ...
def generate(self) -> Generator[str, None, None]: ...
def generate(self) -> Generator[str]: ...
class MenuItemsSection(MenuComponent):
items_align: str
@@ -85,10 +85,10 @@ class MenuItemsSection(MenuComponent):
def items_with_top_border(self) -> list[str]: ...
def show_item_bottom_border(self, item_text: str, flag: bool) -> None: ...
def show_item_top_border(self, item_text: str, flag: bool) -> None: ...
def generate(self) -> Generator[str, None, None]: ...
def generate(self) -> Generator[str]: ...
class MenuFooter(MenuComponent):
def generate(self) -> Generator[str, None, None]: ...
def generate(self) -> Generator[str]: ...
class MenuPrompt(MenuComponent):
def __init__(self, menu_style: MenuStyle, max_dimension: Dimension | None = None, prompt_string: str = ">>") -> None: ...
@@ -96,4 +96,4 @@ class MenuPrompt(MenuComponent):
def prompt(self) -> str: ...
@prompt.setter
def prompt(self, prompt: str) -> None: ...
def generate(self) -> Generator[str, None, None]: ...
def generate(self) -> Generator[str]: ...
stubs/croniter/croniter/croniter.pyi
+3 -3
View File
@@ -287,7 +287,7 @@ def croniter_range(
_croniter: type[croniter] | None = None,
second_at_beginning: bool = False,
expand_from_start_time: bool = False,
) -> Generator[_R2_co, None, None]: ...
) -> Generator[_R2_co]: ...
@overload
def croniter_range(
start: float,
@@ -299,7 +299,7 @@ def croniter_range(
_croniter: type[croniter] | None = None,
second_at_beginning: bool = False,
expand_from_start_time: bool = False,
) -> Generator[float, None, None]: ...
) -> Generator[float]: ...
@overload
def croniter_range(
start: datetime.datetime,
@@ -311,7 +311,7 @@ def croniter_range(
_croniter: type[croniter] | None = None,
second_at_beginning: bool = False,
expand_from_start_time: bool = False,
) -> Generator[datetime.datetime, None, None]: ...
) -> Generator[datetime.datetime]: ...
class HashExpander:
cron: croniter
stubs/dirhash/dirhash/__init__.pyi
+1 -1
View File
@@ -71,7 +71,7 @@ class Filter:
def match_patterns(self) -> tuple[str, ...]: ...
def include(self, recursion_path: _RecursionPath) -> bool: ...
def match_file(self, filepath: str | PathLike[str]) -> bool: ...
def __call__(self, paths: Iterable[_RP]) -> Generator[_RP, None, None]: ...
def __call__(self, paths: Iterable[_RP]) -> Generator[_RP]: ...
def get_match_patterns(
match: Iterable[str] | None = None,
stubs/docker/docker/api/build.pyi
+1 -1
View File
@@ -47,7 +47,7 @@ class BuildApiMixin:
platform: str | None = None,
isolation: str | None = None,
use_config_proxy: bool = True,
) -> Generator[Any, None, None]: ...
) -> Generator[Any]: ...
def prune_builds(
self, filters: _Filers | None = None, keep_storage: int | None = None, all: bool | None = None
) -> dict[str, Any]: ...
stubs/docker/docker/models/configs.pyi
+1 -1
View File
@@ -8,6 +8,6 @@ class Config(Model):
class ConfigCollection(Collection[Config]):
model: type[Config]
def create(self, **kwargs) -> Config: ... # type:ignore[override]
def create(self, **kwargs) -> Config: ... # type: ignore[override]
def get(self, config_id: str) -> Config: ...
def list(self, **kwargs) -> list[Config]: ...
stubs/docker/docker/models/containers.pyi
+1 -1
View File
@@ -345,7 +345,7 @@ class ContainerCollection(Collection[Container]):
working_dir: str | None = None,
) -> Container: ...
@override
def create( # type:ignore[override]
def create( # type: ignore[override]
self,
image: str | Image,
command: str | list[str] | None = None,
stubs/docker/docker/models/networks.pyi
+2 -2
View File
@@ -16,7 +16,7 @@ class Network(Model):
class NetworkCollection(Collection[Network]):
model: type[Network]
def create( # type:ignore[override]
def create( # type: ignore[override]
self,
name: str,
driver: str | None = None,
@@ -32,6 +32,6 @@ class NetworkCollection(Collection[Network]):
) -> Network: ...
def get(
self, network_id: str, verbose: bool | None = None, scope: Literal["local", "global", "swarm"] | None = None
) -> Network: ... # type:ignore[override]
) -> Network: ... # type: ignore[override]
def list(self, *args, **kwargs) -> list[Network]: ...
def prune(self, filters: dict[str, Any] | None = None) -> dict[str, Any]: ...
stubs/docker/docker/models/plugins.pyi
+3 -3
View File
@@ -14,14 +14,14 @@ class Plugin(Model):
def configure(self, options: dict[str, Any]) -> None: ...
def disable(self, force: bool = False) -> None: ...
def enable(self, timeout: int = 0) -> None: ...
def push(self) -> Generator[dict[str, Any], None, None]: ...
def push(self) -> Generator[dict[str, Any]]: ...
def remove(self, force: bool = False) -> bool: ...
def upgrade(self, remote: str | None = None) -> Generator[dict[str, Any], None, None]: ...
def upgrade(self, remote: str | None = None) -> Generator[dict[str, Any]]: ...
class PluginCollection(Collection[Plugin]):
model: type[Plugin]
@override
def create(self, name, plugin_data_dir, gzip: bool = False): ... # type:ignore[override]
def create(self, name, plugin_data_dir, gzip: bool = False): ... # type: ignore[override]
@override
def get(self, name): ...
def install(self, remote_name, local_name=None): ...
stubs/docker/docker/models/services.pyi
+1 -1
View File
@@ -15,7 +15,7 @@ class Service(Model):
class ServiceCollection(Collection[Service]):
model: type[Service]
def create(self, image, command=None, **kwargs): ... # type:ignore[override]
def create(self, image, command=None, **kwargs): ... # type: ignore[override]
def get(self, service_id, insert_defaults=None): ...
def list(self, **kwargs): ...
stubs/docker/docker/models/volumes.pyi
+1 -1
View File
@@ -10,7 +10,7 @@ class Volume(Model):
class VolumeCollection(Collection[Volume]):
model: type[Volume]
def create(self, name: str | None = None, **kwargs) -> Volume: ... # type:ignore[override]
def create(self, name: str | None = None, **kwargs) -> Volume: ... # type: ignore[override]
def get(self, volume_id: str) -> Volume: ...
def list(self, **kwargs) -> list[Volume]: ...
def prune(self, filters: dict[str, Any] | None = None) -> dict[str, Any]: ...
stubs/docker/docker/transport/sshconn.pyi
+5 -5
View File
@@ -15,11 +15,11 @@ class SSHSocket(socket.socket):
user: str | None
proc: subprocess.Popen[bytes] | None
def __init__(self, host: str) -> None: ...
def connect(self, **kwargs) -> None: ... # type:ignore[override]
def sendall(self, data) -> None: ... # type:ignore[override]
def send(self, data): ... # type:ignore[override]
def recv(self, n): ... # type:ignore[override]
def makefile(self, mode): ... # type:ignore[override]
def connect(self, **kwargs) -> None: ... # type: ignore[override]
def sendall(self, data) -> None: ... # type: ignore[override]
def send(self, data): ... # type: ignore[override]
def recv(self, n): ... # type: ignore[override]
def makefile(self, mode): ... # type: ignore[override]
def close(self) -> None: ...
class SSHConnection(urllib3.connection.HTTPConnection):
stubs/flake8-rst-docstrings/flake8_rst_docstrings.pyi
+1 -1
View File
@@ -31,4 +31,4 @@ class reStructuredTextChecker:
def add_options(cls, parser: Any) -> None: ...
@classmethod
def parse_options(cls, options: Namespace) -> None: ...
def run(self) -> Generator[tuple[int, int, str, type[reStructuredTextChecker]], None, None]: ...
def run(self) -> Generator[tuple[int, int, str, type[reStructuredTextChecker]]]: ...
stubs/flake8-simplify/flake8_simplify/__init__.pyi
+1 -1
View File
@@ -26,6 +26,6 @@ class Plugin:
name: ClassVar[str]
version: ClassVar[str]
def __init__(self, tree: ast.AST) -> None: ...
def run(self) -> Generator[tuple[int, int, str, type[Any]], None, None]: ...
def run(self) -> Generator[tuple[int, int, str, type[Any]]]: ...
def add_meta(root: ast.AST, level: int = 0) -> None: ...
stubs/flake8/flake8/discover_files.pyi
+1 -1
View File
@@ -5,4 +5,4 @@ LOG: Logger
def expand_paths(
*, paths: Sequence[str], stdin_display_name: str, filename_patterns: Sequence[str], exclude: Sequence[str]
) -> Generator[str, None, None]: ...
) -> Generator[str]: ...
stubs/flake8/flake8/plugins/finder.pyi
+1 -1
View File
@@ -31,7 +31,7 @@ class Plugins(NamedTuple):
checkers: Checkers
reporters: dict[str, LoadedPlugin]
disabled: list[LoadedPlugin]
def all_plugins(self) -> Generator[LoadedPlugin, None, None]: ...
def all_plugins(self) -> Generator[LoadedPlugin]: ...
def versions_str(self) -> str: ...
class PluginOptions(NamedTuple):
stubs/flake8/flake8/plugins/pycodestyle.pyi
+2 -2
View File
@@ -19,7 +19,7 @@ def pycodestyle_logical(
previous_unindented_logical_line: Any,
tokens: Any,
verbose: Any,
) -> Generator[tuple[int, str], None, None]: ...
) -> Generator[tuple[int, str]]: ...
def pycodestyle_physical(
indent_char: Any,
line_number: Any,
@@ -29,4 +29,4 @@ def pycodestyle_physical(
noqa: Any,
physical_line: Any,
total_lines: Any,
) -> Generator[tuple[int, str], None, None]: ...
) -> Generator[tuple[int, str]]: ...
stubs/flake8/flake8/plugins/pyflakes.pyi
+1 -1
View File
@@ -18,4 +18,4 @@ class FlakesChecker(Checker):
def add_options(cls, parser: OptionManager) -> None: ...
@classmethod
def parse_options(cls, options: Namespace) -> None: ...
def run(self) -> Generator[tuple[int, int, str, type[Any]], None, None]: ...
def run(self) -> Generator[tuple[int, int, str, type[Any]]]: ...
stubs/flake8/flake8/processor.pyi
+2 -2
View File
@@ -45,7 +45,7 @@ class FileProcessor:
def file_tokens(self) -> list[TokenInfo]: ...
def tstring_start(self, lineno: int) -> None: ...
def fstring_start(self, lineno: int) -> None: ...
def multiline_string(self, token: TokenInfo) -> Generator[str, None, None]: ...
def multiline_string(self, token: TokenInfo) -> Generator[str]: ...
def reset_blank_before(self) -> None: ...
def delete_first_token(self) -> None: ...
def visited_new_blank_line(self) -> None: ...
@@ -56,7 +56,7 @@ class FileProcessor:
def build_ast(self) -> AST: ...
def build_logical_line(self) -> tuple[str, str, _LogicalMapping]: ...
def keyword_arguments_for(self, parameters: dict[str, bool], arguments: dict[str, Any]) -> dict[str, Any]: ...
def generate_tokens(self) -> Generator[TokenInfo, None, None]: ...
def generate_tokens(self) -> Generator[TokenInfo]: ...
def noqa_line_for(self, line_number: int) -> str | None: ...
def next_line(self) -> str: ...
def read_lines(self) -> list[str]: ...
stubs/flake8/flake8/statistics.pyi
+1 -1
View File
@@ -7,7 +7,7 @@ class Statistics:
def __init__(self) -> None: ...
def error_codes(self) -> list[str]: ...
def record(self, error: Violation) -> None: ...
def statistics_for(self, prefix: str, filename: str | None = None) -> Generator[Statistic, None, None]: ...
def statistics_for(self, prefix: str, filename: str | None = None) -> Generator[Statistic]: ...
class Key(NamedTuple):
filename: str
stubs/flake8/flake8/style_guide.pyi
+3 -3
View File
@@ -41,8 +41,8 @@ class StyleGuideManager:
default_style_guide: Incomplete
style_guide_for: Incomplete
def __init__(self, options: argparse.Namespace, formatter: BaseFormatter, decider: DecisionEngine | None = None) -> None: ...
def populate_style_guides_with(self, options: argparse.Namespace) -> Generator[StyleGuide, None, None]: ...
def processing_file(self, filename: str) -> Generator[StyleGuide, None, None]: ...
def populate_style_guides_with(self, options: argparse.Namespace) -> Generator[StyleGuide]: ...
def processing_file(self, filename: str) -> Generator[StyleGuide]: ...
def handle_error(
self, code: str, filename: str, line_number: int, column_number: int, text: str, physical_line: str | None = None
) -> int: ...
@@ -62,7 +62,7 @@ class StyleGuide:
decider: DecisionEngine | None = None,
) -> None: ...
def copy(self, filename: str | None = None, extend_ignore_with: Sequence[str] | None = None) -> StyleGuide: ...
def processing_file(self, filename: str) -> Generator[StyleGuide, None, None]: ...
def processing_file(self, filename: str) -> Generator[StyleGuide]: ...
def applies_to(self, filename: str) -> bool: ...
def should_report_error(self, code: str) -> Decision: ...
def handle_error(
stubs/fpdf2/fpdf/encryption.pyi
+1 -1
View File
@@ -22,7 +22,7 @@ class _SupportsGetItem(Protocol[_T_co]):
class ARC4:
MOD: ClassVar[int]
def KSA(self, key: _Key) -> list[int]: ...
def PRGA(self, S: _SupportsGetItem[int]) -> Generator[int, None, None]: ...
def PRGA(self, S: _SupportsGetItem[int]) -> Generator[int]: ...
def encrypt(self, key: _Key, text: Iterable[int]) -> list[int]: ...
class CryptFilter:
stubs/fpdf2/fpdf/fonts.pyi
+1 -1
View File
@@ -171,7 +171,7 @@ class SubsetMap:
font: TTFFont
def __init__(self, font: TTFFont) -> None: ...
def __len__(self) -> int: ...
def items(self) -> Generator[Incomplete, None, None]: ...
def items(self) -> Generator[Incomplete]: ...
def pick(self, unicode: int): ...
def pick_glyph(self, glyph): ...
def get_glyph(self, glyph=None, unicode=None, glyph_name=None, glyph_width=None) -> Glyph: ...
stubs/google-cloud-ndb/google/cloud/ndb/_cache.pyi
+4 -4
View File
@@ -33,12 +33,12 @@ class _GlobalCacheSetBatch(_GlobalCacheBatch):
def done_callback(self, cache_call) -> None: ...
def add(self, key, value): ...
def make_call(self): ...
def future_info(self, key, value): ... # type:ignore[override]
def future_info(self, key, value): ... # type: ignore[override]
class _GlobalCacheSetIfNotExistsBatch(_GlobalCacheSetBatch):
def add(self, key, value): ...
def make_call(self): ...
def future_info(self, key, value): ... # type:ignore[override]
def future_info(self, key, value): ... # type: ignore[override]
global_delete: Incomplete
@@ -54,7 +54,7 @@ global_watch: Incomplete
class _GlobalCacheWatchBatch(_GlobalCacheDeleteBatch):
def make_call(self): ...
def future_info(self, key, value): ... # type:ignore[override]
def future_info(self, key, value): ... # type: ignore[override]
def global_unwatch(key): ...
@@ -66,7 +66,7 @@ global_compare_and_swap: Incomplete
class _GlobalCacheCompareAndSwapBatch(_GlobalCacheSetBatch):
def make_call(self): ...
def future_info(self, key, value): ... # type:ignore[override]
def future_info(self, key, value): ... # type: ignore[override]
def is_locked_value(value): ...
def global_cache_key(key): ...
stubs/gunicorn/gunicorn/http/body.pyi
+1 -1
View File
@@ -7,7 +7,7 @@ from gunicorn.http.unreader import Unreader
class ChunkedReader:
req: Request
parser: Generator[bytes, None, None] | None
parser: Generator[bytes] | None
buf: io.BytesIO
def __init__(self, req: Request, unreader: Unreader) -> None: ...
stubs/httplib2/httplib2/__init__.pyi
+2 -2
View File
@@ -102,11 +102,11 @@ class Credentials:
def __init__(self) -> None: ...
def add(self, name, password, domain: str = "") -> None: ...
def clear(self) -> None: ...
def iter(self, domain) -> Generator[tuple[str, str], None, None]: ...
def iter(self, domain) -> Generator[tuple[str, str]]: ...
class KeyCerts(Credentials):
def add(self, key, cert, domain, password) -> None: ... # type: ignore[override]
def iter(self, domain) -> Generator[tuple[str, str, str], None, None]: ... # type: ignore[override]
def iter(self, domain) -> Generator[tuple[str, str, str]]: ... # type: ignore[override]
class AllHosts: ...
stubs/keyboard/keyboard/__init__.pyi
+1 -1
View File
@@ -90,7 +90,7 @@ def get_hotkey_name(names: Iterable[str] | None = None) -> str: ...
def read_event(suppress: bool = False) -> KeyboardEvent: ...
def read_key(suppress: bool = False) -> _Key: ...
def read_hotkey(suppress: bool = True) -> str: ...
def get_typed_strings(events: Iterable[KeyboardEvent], allow_backspace: bool = True) -> Generator[str, None, None]: ...
def get_typed_strings(events: Iterable[KeyboardEvent], allow_backspace: bool = True) -> Generator[str]: ...
def start_recording(
recorded_events_queue: Queue[KeyboardEvent] | None = None,
) -> tuple[Queue[KeyboardEvent], Callable[[], None]]: ...
stubs/networkx/networkx/algorithms/assortativity/pairs.pyi
+2 -4
View File
@@ -7,10 +7,8 @@ from networkx.utils.backends import _dispatchable
__all__ = ["node_attribute_xy", "node_degree_xy"]
@_dispatchable
def node_attribute_xy(
G: Graph[_Node], attribute, nodes: Iterable[Incomplete] | None = None
) -> Generator[Incomplete, None, None]: ...
def node_attribute_xy(G: Graph[_Node], attribute, nodes: Iterable[Incomplete] | None = None) -> Generator[Incomplete]: ...
@_dispatchable
def node_degree_xy(
G: Graph[_Node], x: str = "out", y: str = "in", weight: str | None = None, nodes: Iterable[Incomplete] | None = None
) -> Generator[Incomplete, None, None]: ...
) -> Generator[Incomplete]: ...
stubs/networkx/networkx/algorithms/boundary.pyi
+11 -11
View File
@@ -16,7 +16,7 @@ def edge_boundary(
data=False,
keys: bool = False,
default=None,
) -> Generator[tuple[_Node, _Node], None, None]: ...
) -> Generator[tuple[_Node, _Node]]: ...
@overload
def edge_boundary(
G: Graph[_Node],
@@ -25,7 +25,7 @@ def edge_boundary(
data=False,
keys: bool = False,
default=None,
) -> Generator[tuple[_Node, _Node, dict[str, Incomplete]], None, None]: ...
) -> Generator[tuple[_Node, _Node, dict[str, Incomplete]]]: ...
@overload
def edge_boundary(
G: Graph[_Node],
@@ -34,7 +34,7 @@ def edge_boundary(
data=False,
keys: bool = False,
default=None,
) -> Generator[tuple[_Node, _Node, dict[str, Incomplete]], None, None]: ...
) -> Generator[tuple[_Node, _Node, dict[str, Incomplete]]]: ...
@overload
def edge_boundary(
G: Graph[_Node],
@@ -43,7 +43,7 @@ def edge_boundary(
data=False,
keys: bool = False,
default: _U | None = None,
) -> Generator[tuple[_Node, _Node, dict[str, _U]], None, None]: ...
) -> Generator[tuple[_Node, _Node, dict[str, _U]]]: ...
@overload
def edge_boundary(
G: Graph[_Node],
@@ -52,7 +52,7 @@ def edge_boundary(
data=False,
keys: bool = False,
default: _U | None = None,
) -> Generator[tuple[_Node, _Node, dict[str, _U]], None, None]: ...
) -> Generator[tuple[_Node, _Node, dict[str, _U]]]: ...
@overload
def edge_boundary(
G: Graph[_Node],
@@ -61,7 +61,7 @@ def edge_boundary(
data=False,
keys: bool = False,
default=None,
) -> Generator[tuple[_Node, _Node, int], None, None]: ...
) -> Generator[tuple[_Node, _Node, int]]: ...
@overload
def edge_boundary(
G: Graph[_Node],
@@ -70,7 +70,7 @@ def edge_boundary(
data=False,
keys: bool = False,
default=None,
) -> Generator[tuple[_Node, _Node, int], None, None]: ...
) -> Generator[tuple[_Node, _Node, int]]: ...
@overload
def edge_boundary(
G: Graph[_Node],
@@ -79,7 +79,7 @@ def edge_boundary(
data=False,
keys: bool = False,
default=None,
) -> Generator[tuple[_Node, _Node, int, dict[str, Incomplete]], None, None]: ...
) -> Generator[tuple[_Node, _Node, int, dict[str, Incomplete]]]: ...
@overload
def edge_boundary(
G: Graph[_Node],
@@ -88,7 +88,7 @@ def edge_boundary(
data=False,
keys: bool = False,
default=None,
) -> Generator[tuple[_Node, _Node, int, dict[str, Incomplete]], None, None]: ...
) -> Generator[tuple[_Node, _Node, int, dict[str, Incomplete]]]: ...
@overload
def edge_boundary(
G: Graph[_Node],
@@ -97,7 +97,7 @@ def edge_boundary(
data=False,
keys: bool = False,
default: _U | None = None,
) -> Generator[tuple[_Node, _Node, int, dict[str, _U]], None, None]: ...
) -> Generator[tuple[_Node, _Node, int, dict[str, _U]]]: ...
@overload
def edge_boundary(
G: Graph[_Node],
@@ -106,6 +106,6 @@ def edge_boundary(
data=False,
keys: bool = False,
default: _U | None = None,
) -> Generator[tuple[_Node, _Node, int, dict[str, _U]], None, None]: ...
) -> Generator[tuple[_Node, _Node, int, dict[str, _U]]]: ...
@_dispatchable
def node_boundary(G: Graph[_Node], nbunch1: Iterable[Incomplete], nbunch2: Iterable[Incomplete] | None = None) -> set[_Node]: ...
stubs/networkx/networkx/algorithms/bridges.pyi
+3 -7
View File
@@ -7,14 +7,10 @@ from networkx.utils.backends import _dispatchable
__all__ = ["bridges", "has_bridges", "local_bridges"]
@_dispatchable
def bridges(G: Graph[_Node], root: _Node | None = None) -> Generator[_Node, None, None]: ...
def bridges(G: Graph[_Node], root: _Node | None = None) -> Generator[_Node]: ...
@_dispatchable
def has_bridges(G: Graph[_Node], root: _Node | None = None) -> bool: ...
@overload
def local_bridges(
G: Graph[_Node], with_span: bool = True, weight: str | None = None
) -> Generator[tuple[_Node, _Node], None, None]: ...
def local_bridges(G: Graph[_Node], with_span: bool = True, weight: str | None = None) -> Generator[tuple[_Node, _Node]]: ...
@overload
def local_bridges(
G: Graph[_Node], with_span: bool = True, weight: str | None = None
) -> Generator[tuple[_Node, _Node, int], None, None]: ...
def local_bridges(G: Graph[_Node], with_span: bool = True, weight: str | None = None) -> Generator[tuple[_Node, _Node, int]]: ...
stubs/networkx/networkx/algorithms/centrality/flow_matrix.pyi
+1 -1
View File
@@ -5,7 +5,7 @@ from networkx.classes.graph import Graph, _Node
from networkx.utils.backends import _dispatchable
@_dispatchable
def flow_matrix_row(G: Graph[_Node], weight=None, dtype=..., solver: str = "lu") -> Generator[Incomplete, None, None]: ...
def flow_matrix_row(G: Graph[_Node], weight=None, dtype=..., solver: str = "lu") -> Generator[Incomplete]: ...
class InverseLaplacian:
dtype: Incomplete
stubs/networkx/networkx/algorithms/chains.pyi
+1 -1
View File
@@ -6,4 +6,4 @@ from networkx.utils.backends import _dispatchable
__all__ = ["chain_decomposition"]
@_dispatchable
def chain_decomposition(G: Graph[_Node], root: _Node | None = None) -> Generator[list[tuple[_Node, _Node]], None, None]: ...
def chain_decomposition(G: Graph[_Node], root: _Node | None = None) -> Generator[list[tuple[_Node, _Node]]]: ...
stubs/networkx/networkx/algorithms/chordal.pyi
+1 -1
View File
@@ -22,7 +22,7 @@ def is_chordal(G: Graph[_Node]) -> bool: ...
@_dispatchable
def find_induced_nodes(G: Graph[_Node], s: _Node, t: _Node, treewidth_bound: float = sys.maxsize) -> set[_Node]: ...
@_dispatchable
def chordal_graph_cliques(G: Graph[_Node]) -> Generator[frozenset[_Node], None, None]: ...
def chordal_graph_cliques(G: Graph[_Node]) -> Generator[frozenset[_Node]]: ...
@_dispatchable
def chordal_graph_treewidth(G: Graph[_Node]) -> int: ...
@_dispatchable
stubs/networkx/networkx/algorithms/clique.pyi
+2 -2
View File
@@ -17,9 +17,9 @@ __all__ = [
]
@_dispatchable
def enumerate_all_cliques(G: Graph[_Node]) -> Generator[list[_Node], None, None]: ...
def enumerate_all_cliques(G: Graph[_Node]) -> Generator[list[_Node]]: ...
@_dispatchable
def find_cliques(G: Graph[_Node], nodes: Iterable[Incomplete] | None = None) -> Generator[list[_Node], None, None]: ...
def find_cliques(G: Graph[_Node], nodes: Iterable[Incomplete] | None = None) -> Generator[list[_Node]]: ...
@_dispatchable
def find_cliques_recursive(G: Graph[_Node], nodes: Iterable[Incomplete] | None = None) -> Iterator[list[_Node]]: ...
@_dispatchable
stubs/networkx/networkx/algorithms/coloring/greedy_coloring.pyi
+2 -4
View File
@@ -24,15 +24,13 @@ def strategy_random_sequential(G: Graph[_Node], colors: Unused, seed=None): ...
@_dispatchable
def strategy_smallest_last(G: Graph[_Node], colors: Unused): ...
@_dispatchable
def strategy_independent_set(G: Graph[_Node], colors: Unused) -> Generator[Incomplete, Incomplete, None]: ...
def strategy_independent_set(G: Graph[_Node], colors: Unused) -> Generator[Incomplete, Incomplete]: ...
@_dispatchable
def strategy_connected_sequential_bfs(G: Graph[_Node], colors): ...
@_dispatchable
def strategy_connected_sequential_dfs(G: Graph[_Node], colors): ...
@_dispatchable
def strategy_connected_sequential(
G: Graph[_Node], colors: Unused, traversal: str = "bfs"
) -> Generator[Incomplete, None, None]: ...
def strategy_connected_sequential(G: Graph[_Node], colors: Unused, traversal: str = "bfs") -> Generator[Incomplete]: ...
@_dispatchable
def strategy_saturation_largest_first(G: Graph[_Node], colors) -> Generator[Incomplete, None, Incomplete]: ...
stubs/networkx/networkx/algorithms/community/kclique.pyi
+1 -1
View File
@@ -7,4 +7,4 @@ from networkx.utils.backends import _dispatchable
__all__ = ["k_clique_communities"]
@_dispatchable
def k_clique_communities(G: Graph[_Node], k: int, cliques=None) -> Generator[Incomplete, None, None]: ...
def k_clique_communities(G: Graph[_Node], k: int, cliques=None) -> Generator[Incomplete]: ...
stubs/networkx/networkx/algorithms/community/label_propagation.pyi
+1 -1
View File
@@ -13,6 +13,6 @@ def fast_label_propagation_communities(G: Graph[_Node], *, weight=None, seed=Non
@_dispatchable
def asyn_lpa_communities(
G: Graph[_Node], weight: str | None = None, seed: int | RandomState | None = None
) -> Generator[Incomplete, Incomplete, None]: ...
) -> Generator[Incomplete, Incomplete]: ...
@_dispatchable
def label_propagation_communities(G: Graph[_Node]) -> dict_values[Incomplete, set[Incomplete]]: ...
stubs/networkx/networkx/algorithms/community/louvain.pyi
+1 -1
View File
@@ -23,4 +23,4 @@ def louvain_partitions(
resolution: float | None = 1,
threshold: float | None = 1e-07,
seed: int | RandomState | None = None,
) -> Generator[list[set[Incomplete]], None, None]: ...
) -> Generator[list[set[Incomplete]]]: ...
stubs/networkx/networkx/algorithms/connectivity/disjoint_paths.pyi
+2 -2
View File
@@ -18,7 +18,7 @@ def edge_disjoint_paths(
cutoff: int | None = None,
auxiliary: DiGraph[_Node] | None = None,
residual: DiGraph[_Node] | None = None,
) -> Generator[Incomplete, None, None]: ...
) -> Generator[Incomplete]: ...
@_dispatchable
def node_disjoint_paths(
G: Graph[_Node],
@@ -28,4 +28,4 @@ def node_disjoint_paths(
cutoff: int | None = None,
auxiliary: DiGraph[_Node] | None = None,
residual: DiGraph[_Node] | None = None,
) -> Generator[Incomplete, None, None]: ...
) -> Generator[Incomplete]: ...
stubs/networkx/networkx/algorithms/connectivity/edge_augmentation.pyi
+1 -1
View File
@@ -18,7 +18,7 @@ def k_edge_augmentation(
avail: set[tuple[int, int]] | set[tuple[int, int, float]] | SupportsGetItem[tuple[int, int], float] | None = None,
weight: str | None = None,
partial: bool = False,
) -> Generator[tuple[_Node, _Node], None, None]: ...
) -> Generator[tuple[_Node, _Node]]: ...
@_dispatchable
def partial_k_edge_augmentation(G: Graph[_Node], k, avail, weight: str | None = None): ...
@_dispatchable
stubs/networkx/networkx/algorithms/connectivity/edge_kcomponents.pyi
+3 -3
View File
@@ -11,7 +11,7 @@ def k_edge_components(G: Graph[_Node], k: int): ...
@_dispatchable
def k_edge_subgraphs(G: Graph[_Node], k: int): ...
@_dispatchable
def bridge_components(G: Graph[_Node]) -> Generator[Incomplete, Incomplete, None]: ...
def bridge_components(G: Graph[_Node]) -> Generator[Incomplete, Incomplete]: ...
class EdgeComponentAuxGraph:
A: Incomplete
@@ -19,8 +19,8 @@ class EdgeComponentAuxGraph:
@classmethod
def construct(cls, G: Graph[_Node]): ...
def k_edge_components(self, k: int) -> Generator[Incomplete, Incomplete, None]: ...
def k_edge_subgraphs(self, k: int) -> Generator[Incomplete, Incomplete, None]: ...
def k_edge_components(self, k: int) -> Generator[Incomplete, Incomplete]: ...
def k_edge_subgraphs(self, k: int) -> Generator[Incomplete, Incomplete]: ...
@_dispatchable
def general_k_edge_subgraphs(G: Graph[_Node], k): ...
stubs/networkx/networkx/algorithms/connectivity/kcutsets.pyi
+1 -1
View File
@@ -11,4 +11,4 @@ default_flow_func = edmonds_karp
@_dispatchable
def all_node_cuts(
G: Graph[_Node], k: int | None = None, flow_func: Callable[..., Incomplete] | None = None
) -> Generator[Incomplete, None, None]: ...
) -> Generator[Incomplete]: ...
stubs/networkx/networkx/algorithms/dag.pyi
+5 -7
View File
@@ -30,15 +30,13 @@ def ancestors(G: Graph[_Node], source) -> set[_Node]: ...
@_dispatchable
def is_directed_acyclic_graph(G: Graph[_Node]) -> bool: ...
@_dispatchable
def topological_generations(G: DiGraph[_Node]) -> Generator[list[_Node], None, None]: ...
def topological_generations(G: DiGraph[_Node]) -> Generator[list[_Node]]: ...
@_dispatchable
def topological_sort(G: DiGraph[_Node]) -> Generator[_Node, None, None]: ...
def topological_sort(G: DiGraph[_Node]) -> Generator[_Node]: ...
@_dispatchable
def lexicographical_topological_sort(
G: DiGraph[_Node], key: Callable[..., Incomplete] | None = None
) -> Generator[_Node, None, None]: ...
def lexicographical_topological_sort(G: DiGraph[_Node], key: Callable[..., Incomplete] | None = None) -> Generator[_Node]: ...
@_dispatchable
def all_topological_sorts(G: DiGraph[_Node]) -> Generator[list[_Node], None, None]: ...
def all_topological_sorts(G: DiGraph[_Node]) -> Generator[list[_Node]]: ...
@_dispatchable
def is_aperiodic(G: DiGraph[_Node]) -> bool: ...
@_dispatchable
@@ -48,7 +46,7 @@ def transitive_closure_dag(G: DiGraph[_Node], topo_order: Iterable[Incomplete] |
@_dispatchable
def transitive_reduction(G: DiGraph[_Node]) -> DiGraph[_Node]: ...
@_dispatchable
def antichains(G: DiGraph[_Node], topo_order: Iterable[Incomplete] | None = None) -> Generator[list[_Node], None, None]: ...
def antichains(G: DiGraph[_Node], topo_order: Iterable[Incomplete] | None = None) -> Generator[list[_Node]]: ...
@_dispatchable
def dag_longest_path(
G: DiGraph[_Node],
stubs/networkx/networkx/algorithms/euler.pyi
+2 -4
View File
@@ -11,12 +11,10 @@ def is_eulerian(G: Graph[_Node]) -> bool: ...
@_dispatchable
def is_semieulerian(G: Graph[_Node]) -> bool: ...
@_dispatchable
def eulerian_circuit(
G: Graph[_Node], source: _Node | None = None, keys: bool = False
) -> Generator[Incomplete, Incomplete, None]: ...
def eulerian_circuit(G: Graph[_Node], source: _Node | None = None, keys: bool = False) -> Generator[Incomplete, Incomplete]: ...
@_dispatchable
def has_eulerian_path(G: Graph[_Node], source: _Node | None = None) -> bool: ...
@_dispatchable
def eulerian_path(G: Graph[_Node], source=None, keys: bool = False) -> Generator[Incomplete, Incomplete, None]: ...
def eulerian_path(G: Graph[_Node], source=None, keys: bool = False) -> Generator[Incomplete, Incomplete]: ...
@_dispatchable
def eulerize(G: Graph[_Node]): ...
stubs/networkx/networkx/algorithms/flow/networksimplex.pyi
+2 -2
View File
@@ -34,13 +34,13 @@ class _DataEssentialsAndFunctions:
def trace_path(self, p, w): ...
def find_cycle(self, i, p, q): ...
def augment_flow(self, Wn, We, f) -> None: ...
def trace_subtree(self, p) -> Generator[Incomplete, None, None]: ...
def trace_subtree(self, p) -> Generator[Incomplete]: ...
def remove_edge(self, s, t) -> None: ...
def make_root(self, q) -> None: ...
def add_edge(self, i, p, q) -> None: ...
def update_potentials(self, i, p, q) -> None: ...
def reduced_cost(self, i): ...
def find_entering_edges(self) -> Generator[Incomplete, None, None]: ...
def find_entering_edges(self) -> Generator[Incomplete]: ...
def residual_capacity(self, i, p): ...
def find_leaving_edge(self, Wn, We): ...
stubs/networkx/networkx/algorithms/isomorphism/ismags.pyi
+2 -2
View File
@@ -24,9 +24,9 @@ class ISMAGS:
def __init__(self, graph, subgraph, node_match=None, edge_match=None, cache=None) -> None: ...
def create_aligned_partitions(self, thing_matcher, sg_things, g_things): ...
def find_isomorphisms(self, symmetry: bool = True) -> Generator[Incomplete, Incomplete, Incomplete]: ...
def largest_common_subgraph(self, symmetry: bool = True) -> Generator[Incomplete, Incomplete, None]: ...
def largest_common_subgraph(self, symmetry: bool = True) -> Generator[Incomplete, Incomplete]: ...
def analyze_subgraph_symmetry(self) -> dict[Hashable, set[Hashable]]: ...
def is_isomorphic(self, symmetry: bool = False) -> bool: ...
def subgraph_is_isomorphic(self, symmetry: bool = False) -> bool: ...
def isomorphisms_iter(self, symmetry: bool = True) -> Generator[Incomplete, Incomplete, None]: ...
def isomorphisms_iter(self, symmetry: bool = True) -> Generator[Incomplete, Incomplete]: ...
def subgraph_isomorphisms_iter(self, symmetry: bool = True): ...
stubs/networkx/networkx/algorithms/isomorphism/isomorphvf2.pyi
+6 -6
View File
@@ -14,7 +14,7 @@ class GraphMatcher:
def __init__(self, G1, G2) -> None: ...
def reset_recursion_limit(self) -> None: ...
def candidate_pairs_iter(self) -> Generator[Incomplete, None, None]: ...
def candidate_pairs_iter(self) -> Generator[Incomplete]: ...
core_1: Incomplete
core_2: Incomplete
inout_1: Incomplete
@@ -24,18 +24,18 @@ class GraphMatcher:
def initialize(self) -> None: ...
def is_isomorphic(self) -> bool: ...
def isomorphisms_iter(self) -> Generator[Incomplete, Incomplete, None]: ...
def match(self) -> Generator[Incomplete, Incomplete, None]: ...
def isomorphisms_iter(self) -> Generator[Incomplete, Incomplete]: ...
def match(self) -> Generator[Incomplete, Incomplete]: ...
def semantic_feasibility(self, G1_node, G2_node): ...
def subgraph_is_isomorphic(self): ...
def subgraph_is_monomorphic(self): ...
def subgraph_isomorphisms_iter(self) -> Generator[Incomplete, Incomplete, None]: ...
def subgraph_monomorphisms_iter(self) -> Generator[Incomplete, Incomplete, None]: ...
def subgraph_isomorphisms_iter(self) -> Generator[Incomplete, Incomplete]: ...
def subgraph_monomorphisms_iter(self) -> Generator[Incomplete, Incomplete]: ...
def syntactic_feasibility(self, G1_node, G2_node): ...
class DiGraphMatcher(GraphMatcher):
def __init__(self, G1, G2) -> None: ...
def candidate_pairs_iter(self) -> Generator[Incomplete, None, None]: ...
def candidate_pairs_iter(self) -> Generator[Incomplete]: ...
core_1: Incomplete
core_2: Incomplete
in_1: Incomplete
stubs/networkx/networkx/algorithms/lowest_common_ancestors.pyi
+1 -3
View File
@@ -12,6 +12,4 @@ def all_pairs_lowest_common_ancestor(G: DiGraph[_Node], pairs=None): ...
@_dispatchable
def lowest_common_ancestor(G: DiGraph[_Node], node1, node2, default=None): ...
@_dispatchable
def tree_all_pairs_lowest_common_ancestor(
G: DiGraph[_Node], root: _Node | None = None, pairs=None
) -> Generator[Incomplete, None, None]: ...
def tree_all_pairs_lowest_common_ancestor(G: DiGraph[_Node], root: _Node | None = None, pairs=None) -> Generator[Incomplete]: ...
stubs/networkx/networkx/algorithms/planarity.pyi
+1 -1
View File
@@ -95,7 +95,7 @@ class LRPlanarity:
class PlanarEmbedding(DiGraph[_Node]):
def get_data(self) -> dict[_Node, list[_Node]]: ...
def set_data(self, data: Mapping[_Node, Reversible[_Node]]) -> None: ...
def neighbors_cw_order(self, v: _Node) -> Generator[_Node, None, None]: ...
def neighbors_cw_order(self, v: _Node) -> Generator[_Node]: ...
def add_half_edge(self, start_node: _Node, end_node: _Node, *, cw: _Node | None = None, ccw: _Node | None = None): ...
def check_structure(self) -> None: ...
def add_half_edge_ccw(self, start_node: _Node, end_node: _Node, reference_neighbor: _Node) -> None: ...
stubs/networkx/networkx/algorithms/shortest_paths/unweighted.pyi
+1 -1
View File
@@ -20,7 +20,7 @@ def single_source_shortest_path_length(G: Graph[_Node], source: _Node, cutoff: i
@_dispatchable
def single_target_shortest_path_length(G: Graph[_Node], target: _Node, cutoff: int | None = None): ...
@_dispatchable
def all_pairs_shortest_path_length(G: Graph[_Node], cutoff: int | None = None) -> Generator[Incomplete, None, None]: ...
def all_pairs_shortest_path_length(G: Graph[_Node], cutoff: int | None = None) -> Generator[Incomplete]: ...
@_dispatchable
def bidirectional_shortest_path(G: Graph[_Node], source: _Node, target: _Node) -> list[Incomplete]: ...
@_dispatchable
stubs/networkx/networkx/algorithms/similarity.pyi
+1 -1
View File
@@ -59,7 +59,7 @@ def optimize_graph_edit_distance(
edge_del_cost: Callable[..., Incomplete] | None = None,
edge_ins_cost: Callable[..., Incomplete] | None = None,
upper_bound: float | None = None,
) -> Generator[Incomplete, None, None]: ...
) -> Generator[Incomplete]: ...
@_dispatchable
def optimize_edit_paths(
G1: Graph[_Node],
stubs/networkx/networkx/algorithms/simple_paths.pyi
+1 -1
View File
@@ -23,7 +23,7 @@ def shortest_simple_paths(
source: _Node,
target: _Node,
weight: str | Callable[[Any, Any, SupportsGetItem[str, Any]], float | None] | None = None,
) -> Generator[list[_Node], None, None]: ...
) -> Generator[list[_Node]]: ...
class PathBuffer:
paths: Incomplete
stubs/networkx/networkx/algorithms/triads.pyi
+1 -1
View File
@@ -18,7 +18,7 @@ def triadic_census(G: DiGraph[_Node], nodelist: Collection[_Node] | None = None)
@_dispatchable
def is_triad(G: Graph[_Node]) -> bool: ...
@_dispatchable
def all_triads(G: DiGraph[_Node]) -> Generator[Incomplete, None, None]: ...
def all_triads(G: DiGraph[_Node]) -> Generator[Incomplete]: ...
@_dispatchable
def triads_by_type(G: DiGraph[_Node]) -> defaultdict[Incomplete, list[Incomplete]]: ...
@_dispatchable
stubs/networkx/networkx/classes/function.pyi
+11 -11
View File
@@ -130,44 +130,44 @@ def get_edge_attributes(G: Graph[_Node], name: str, default=None) -> dict[tuple[
@_dispatchable
def remove_edge_attributes(G: Graph[_Node], *attr_names, ebunch=None) -> None: ...
def all_neighbors(graph: Graph[_Node], node: _Node) -> Iterator[_Node]: ...
def non_neighbors(graph: Graph[_Node], node: _Node) -> Generator[_Node, None, None]: ...
def non_edges(graph: Graph[_Node]) -> Generator[tuple[_Node, _Node], None, None]: ...
def common_neighbors(G: Graph[_Node], u: _Node, v: _Node) -> Generator[_Node, None, None]: ...
def non_neighbors(graph: Graph[_Node], node: _Node) -> Generator[_Node]: ...
def non_edges(graph: Graph[_Node]) -> Generator[tuple[_Node, _Node]]: ...
def common_neighbors(G: Graph[_Node], u: _Node, v: _Node) -> Generator[_Node]: ...
@_dispatchable
def is_weighted(G: Graph[_Node], edge: tuple[_Node, _Node] | None = None, weight: str = "weight") -> bool: ...
@_dispatchable
def is_negatively_weighted(G: Graph[_Node], edge: tuple[_Node, _Node] | None = None, weight: str = "weight") -> bool: ...
@_dispatchable
def is_empty(G: Graph[Hashable]) -> bool: ...
def nodes_with_selfloops(G: Graph[_Node]) -> Generator[_Node, None, None]: ...
def nodes_with_selfloops(G: Graph[_Node]) -> Generator[_Node]: ...
@overload
def selfloop_edges(
G: Graph[_Node], data: Literal[False] = False, keys: Literal[False] = False, default=None
) -> Generator[tuple[_Node, _Node], None, None]: ...
) -> Generator[tuple[_Node, _Node]]: ...
@overload
def selfloop_edges(
G: Graph[_Node], data: Literal[True], keys: Literal[False] = False, default=None
) -> Generator[tuple[_Node, _Node, dict[str, Incomplete]], None, None]: ...
) -> Generator[tuple[_Node, _Node, dict[str, Incomplete]]]: ...
@overload
def selfloop_edges(
G: Graph[_Node], data: str, keys: Literal[False] = False, default: _U | None = None
) -> Generator[tuple[_Node, _Node, _U], None, None]: ...
) -> Generator[tuple[_Node, _Node, _U]]: ...
@overload
def selfloop_edges(
G: Graph[_Node], data: Literal[False], keys: Literal[True], default=None
) -> Generator[tuple[_Node, _Node, int], None, None]: ...
) -> Generator[tuple[_Node, _Node, int]]: ...
@overload
def selfloop_edges(
G: Graph[_Node], data: Literal[False] = False, *, keys: Literal[True], default=None
) -> Generator[tuple[_Node, _Node, int], None, None]: ...
) -> Generator[tuple[_Node, _Node, int]]: ...
@overload
def selfloop_edges(
G: Graph[_Node], data: Literal[True], keys: Literal[True], default=None
) -> Generator[tuple[_Node, _Node, int, dict[str, Incomplete]], None, None]: ...
) -> Generator[tuple[_Node, _Node, int, dict[str, Incomplete]]]: ...
@overload
def selfloop_edges(
G: Graph[_Node], data: str, keys: Literal[True], default: _U | None = None
) -> Generator[tuple[_Node, _Node, int, _U], None, None]: ...
) -> Generator[tuple[_Node, _Node, int, _U]]: ...
@_dispatchable
def number_of_selfloops(G: Graph[Hashable]) -> int: ...
def is_path(G: Graph[_Node], path: Iterable[Incomplete]) -> bool: ...
stubs/networkx/networkx/readwrite/adjlist.pyi
+1 -1
View File
@@ -5,7 +5,7 @@ from networkx.utils.backends import _dispatchable
__all__ = ["generate_adjlist", "write_adjlist", "parse_adjlist", "read_adjlist"]
def generate_adjlist(G: Graph[_Node], delimiter: str = " ") -> Generator[str, None, None]: ...
def generate_adjlist(G: Graph[_Node], delimiter: str = " ") -> Generator[str]: ...
def write_adjlist(G: Graph[_Node], path, comments: str = "#", delimiter: str = " ", encoding: str = "utf-8") -> None: ...
@_dispatchable
def parse_adjlist(lines, comments: str = "#", delimiter=None, create_using=None, nodetype=None): ...
stubs/networkx/networkx/readwrite/edgelist.pyi
+1 -1
View File
@@ -13,7 +13,7 @@ __all__ = [
"write_weighted_edgelist",
]
def generate_edgelist(G: Graph[_Node], delimiter: str = " ", data: bool = True) -> Generator[Incomplete, None, None]: ...
def generate_edgelist(G: Graph[_Node], delimiter: str = " ", data: bool = True) -> Generator[Incomplete]: ...
def write_edgelist(
G: Graph[_Node], path, comments: str = "#", delimiter: str = " ", data: bool = True, encoding: str = "utf-8"
) -> None: ...
stubs/networkx/networkx/readwrite/gexf.pyi
+1 -1
View File
@@ -10,7 +10,7 @@ __all__ = ["write_gexf", "read_gexf", "relabel_gexf_graph", "generate_gexf"]
def write_gexf(G: Graph[_Node], path, encoding: str = "utf-8", prettyprint: bool = True, version: str = "1.2draft") -> None: ...
def generate_gexf(
G: Graph[_Node], encoding: str = "utf-8", prettyprint: bool = True, version: str = "1.2draft"
) -> Generator[Incomplete, Incomplete, None]: ...
) -> Generator[Incomplete, Incomplete]: ...
@_dispatchable
def read_gexf(path, node_type=None, relabel: bool = False, version: str = "1.2draft"): ...
stubs/networkx/networkx/readwrite/gml.pyi
+1 -1
View File
@@ -37,5 +37,5 @@ LIST_START_VALUE: Final = "_networkx_list_start"
def parse_gml_lines(lines, label, destringizer): ...
def literal_stringizer(value) -> str: ...
def generate_gml(G: Graph[_Node], stringizer=None) -> Generator[Incomplete, Incomplete, None]: ...
def generate_gml(G: Graph[_Node], stringizer=None) -> Generator[Incomplete, Incomplete]: ...
def write_gml(G: Graph[_Node], path, stringizer=None) -> None: ...
stubs/networkx/networkx/readwrite/graphml.pyi
+2 -2
View File
@@ -36,7 +36,7 @@ def write_graphml_lxml(
): ...
def generate_graphml(
G: Graph[_Node], encoding: str = "utf-8", prettyprint: bool = True, named_key_ids: bool = False, edge_id_from_attribute=None
) -> Generator[Incomplete, Incomplete, None]: ...
) -> Generator[Incomplete, Incomplete]: ...
@_dispatchable
def read_graphml(path, node_type=..., edge_key_type=..., force_multigraph: bool = False): ...
@_dispatchable
@@ -121,7 +121,7 @@ class GraphMLReader(GraphML):
edge_ids: Incomplete
def __init__(self, node_type=..., edge_key_type=..., force_multigraph: bool = False) -> None: ...
xml: Incomplete
def __call__(self, path=None, string=None) -> Generator[Incomplete, None, None]: ...
def __call__(self, path=None, string=None) -> Generator[Incomplete]: ...
def make_graph(self, graph_xml, graphml_keys, defaults, G=None): ...
def add_node(self, G: Graph[_Node], node_xml, graphml_keys, defaults) -> None: ...
def add_edge(self, G: Graph[_Node], edge_element, graphml_keys) -> None: ...
stubs/networkx/networkx/readwrite/multiline_adjlist.pyi
+1 -1
View File
@@ -5,7 +5,7 @@ from networkx.utils.backends import _dispatchable
__all__ = ["generate_multiline_adjlist", "write_multiline_adjlist", "parse_multiline_adjlist", "read_multiline_adjlist"]
def generate_multiline_adjlist(G: Graph[_Node], delimiter: str = " ") -> Generator[str, None, None]: ...
def generate_multiline_adjlist(G: Graph[_Node], delimiter: str = " ") -> Generator[str]: ...
def write_multiline_adjlist(G: Graph[_Node], path, delimiter=" ", comments="#", encoding="utf-8") -> None: ...
@_dispatchable
def parse_multiline_adjlist(lines, comments: str = "#", delimiter=None, create_using=None, nodetype=None, edgetype=None): ...
stubs/networkx/networkx/readwrite/pajek.pyi
+1 -1
View File
@@ -6,7 +6,7 @@ from networkx.utils.backends import _dispatchable
__all__ = ["read_pajek", "parse_pajek", "generate_pajek", "write_pajek"]
def generate_pajek(G: Graph[_Node]) -> Generator[Incomplete, None, None]: ...
def generate_pajek(G: Graph[_Node]) -> Generator[Incomplete]: ...
def write_pajek(G: Graph[_Node], path, encoding: str = "UTF-8") -> None: ...
@_dispatchable
def read_pajek(path, encoding: str = "UTF-8"): ...
stubs/networkx/networkx/utils/rcm.pyi
+1 -1
View File
@@ -5,7 +5,7 @@ from networkx.classes.graph import Graph, _Node
__all__ = ["cuthill_mckee_ordering", "reverse_cuthill_mckee_ordering"]
def cuthill_mckee_ordering(G: Graph[_Node], heuristic=None) -> Generator[Incomplete, Incomplete, None]: ...
def cuthill_mckee_ordering(G: Graph[_Node], heuristic=None) -> Generator[Incomplete, Incomplete]: ...
def reverse_cuthill_mckee_ordering(G: Graph[_Node], heuristic=None): ...
def connected_cuthill_mckee_ordering(G: Graph[_Node], heuristic=None): ...
def pseudo_peripheral_node(G: Graph[_Node]): ...
stubs/openpyxl/openpyxl/chart/reference.pyi
+2 -2
View File
@@ -42,9 +42,9 @@ class Reference(Strict):
def __len__(self) -> int: ...
def __eq__(self, other: object) -> bool: ...
@property
def rows(self) -> Generator[Reference, None, None]: ...
def rows(self) -> Generator[Reference]: ...
@property
def cols(self) -> Generator[Reference, None, None]: ...
def cols(self) -> Generator[Reference]: ...
def pop(self): ...
@property
def sheetname(self) -> str: ...
stubs/openpyxl/openpyxl/comments/comment_sheet.pyi
+1 -1
View File
@@ -116,7 +116,7 @@ class CommentSheet(Serialisable):
def __init__(self, authors: AuthorList, commentList=None, extLst: Unused = None) -> None: ...
def to_tree(self) -> Element: ... # type: ignore[override]
@property
def comments(self) -> Generator[tuple[str, Comment], None, None]: ...
def comments(self) -> Generator[tuple[str, Comment]]: ...
@classmethod
def from_comments(cls, comments): ...
def write_shapes(self, vml=None): ...
stubs/openpyxl/openpyxl/descriptors/sequence.pyi
+3 -5
View File
@@ -32,9 +32,7 @@ class Sequence(Descriptor[_ContainerT]):
container: type # internal container type, defaults to `list`
# seq must be an instance of any of the declared `seq_types`.
def __set__(self, instance: Serialisable | Strict, seq: Any) -> None: ...
def to_tree(
self, tagname: str | None, obj: Iterable[object], namespace: str | None = None
) -> Generator[Element, None, None]: ...
def to_tree(self, tagname: str | None, obj: Iterable[object], namespace: str | None = None) -> Generator[Element]: ...
# `_T` is the type of the elements in the sequence.
class UniqueSequence(Sequence[set[_T]]):
@@ -46,7 +44,7 @@ class ValueSequence(Sequence[_ContainerT]):
attribute: str
def to_tree(
self, tagname: str, obj: Iterable[object], namespace: str | None = None # type: ignore[override]
) -> Generator[Element, None, None]: ...
) -> Generator[Element]: ...
def from_tree(self, node: _HasGet[_T]) -> _T: ...
@type_check_only
@@ -68,7 +66,7 @@ class MultiSequence(Sequence[list[_T]]):
def __set__(self, instance: Serialisable | Strict, seq: tuple[_T, ...] | list[_T]) -> None: ...
def to_tree(
self, tagname: Unused, obj: Iterable[_SupportsToTree], namespace: str | None = None # type: ignore[override]
) -> Generator[Element, None, None]: ...
) -> Generator[Element]: ...
class MultiSequencePart(Alias):
expected_type: type[Incomplete]
stubs/openpyxl/openpyxl/packaging/manifest.pyi
+1 -1
View File
@@ -37,5 +37,5 @@ class Manifest(Serialisable):
def to_tree(self) -> Element: ... # type: ignore[override]
def __contains__(self, content_type: str) -> bool: ...
def find(self, content_type): ...
def findall(self, content_type) -> Generator[Incomplete, None, None]: ...
def findall(self, content_type) -> Generator[Incomplete]: ...
def append(self, obj) -> None: ...
stubs/openpyxl/openpyxl/packaging/relationship.pyi
+1 -1
View File
@@ -34,7 +34,7 @@ class Relationship(Serialisable):
class RelationshipList(ElementList[Relationship]):
expected_type: type[Relationship]
def find(self, content_type: str) -> Generator[Relationship, None, None]: ...
def find(self, content_type: str) -> Generator[Relationship]: ...
def get(self, key: str) -> Relationship: ...
def to_dict(self) -> dict[Incomplete, Relationship]: ...
stubs/openpyxl/openpyxl/reader/workbook.pyi
+1 -1
View File
@@ -18,7 +18,7 @@ class WorkbookParser:
# Errors if "parse" is never called.
caches: list[PivotCache]
def parse(self) -> None: ...
def find_sheets(self) -> Generator[tuple[ChildSheet, Relationship], None, None]: ...
def find_sheets(self) -> Generator[tuple[ChildSheet, Relationship]]: ...
def assign_names(self) -> None: ...
@property
def pivot_caches(self) -> dict[int, CacheDefinition]: ...
stubs/openpyxl/openpyxl/utils/cell.pyi
+2 -2
View File
@@ -20,8 +20,8 @@ def absolute_coordinate(coord_string: str) -> str: ...
def get_column_letter(col_idx: int) -> str: ...
def column_index_from_string(col: str) -> int: ...
def range_boundaries(range_string: str) -> _RangeBoundariesTuple: ...
def rows_from_range(range_string: str) -> Generator[tuple[str, ...], None, None]: ...
def cols_from_range(range_string: str) -> Generator[tuple[str, ...], None, None]: ...
def rows_from_range(range_string: str) -> Generator[tuple[str, ...]]: ...
def cols_from_range(range_string: str) -> Generator[tuple[str, ...]]: ...
def coordinate_to_tuple(coordinate: str) -> tuple[int, int]: ...
def range_to_tuple(range_string: str) -> tuple[str, _RangeBoundariesTuple]: ...
def quote_sheetname(sheetname: str) -> str: ...
stubs/openpyxl/openpyxl/utils/dataframe.pyi
+2 -2
View File
@@ -1,5 +1,5 @@
from _typeshed import Incomplete
from collections.abc import Generator
def dataframe_to_rows(df, index: bool = True, header: bool = True) -> Generator[Incomplete, None, None]: ...
def expand_index(index, header: bool = False) -> Generator[Incomplete, None, None]: ...
def dataframe_to_rows(df, index: bool = True, header: bool = True) -> Generator[Incomplete]: ...
def expand_index(index, header: bool = False) -> Generator[Incomplete]: ...
stubs/openpyxl/openpyxl/workbook/defined_name.pyi
+1 -1
View File
@@ -53,7 +53,7 @@ class DefinedName(Serialisable):
@property
def type(self) -> _TokenTypesNotOperand | _TokenOperandSubtypes: ...
@property
def destinations(self) -> Generator[tuple[str, str], None, None]: ...
def destinations(self) -> Generator[tuple[str, str]]: ...
@property
def is_reserved(self) -> str | None: ...
@property
stubs/openpyxl/openpyxl/worksheet/_read_only.pyi
+2 -2
View File
@@ -15,11 +15,11 @@ class ReadOnlyWorksheet:
# Same as Worksheet.values
# https://github.com/python/mypy/issues/6700
@property
def values(self) -> Generator[tuple[_CellGetValue, ...], None, None]: ...
def values(self) -> Generator[tuple[_CellGetValue, ...]]: ...
# Same as Worksheet.rows
# https://github.com/python/mypy/issues/6700
@property
def rows(self) -> Generator[tuple[_CellOrMergedCell, ...], None, None]: ...
def rows(self) -> Generator[tuple[_CellOrMergedCell, ...]]: ...
__getitem__ = Worksheet.__getitem__
__iter__ = Worksheet.__iter__
parent: Workbook
stubs/openpyxl/openpyxl/worksheet/_reader.pyi
+1 -1
View File
@@ -84,7 +84,7 @@ class WorkSheetParser:
timedelta_formats: Container[int] = ...,
rich_text: bool = False,
) -> None: ...
def parse(self) -> Generator[Incomplete, None, None]: ...
def parse(self) -> Generator[Incomplete]: ...
def parse_dimensions(self) -> _RangeBoundariesTuple | None: ...
def parse_cell(self, element) -> dict[str, _AnyCellValue]: ...
def parse_formula(self, element): ...
stubs/openpyxl/openpyxl/worksheet/_writer.pyi
+2 -2
View File
@@ -24,7 +24,7 @@ def create_temporary_file(suffix: str = "") -> str: ...
class WorksheetWriter:
ws: Worksheet | WriteOnlyWorksheet
out: _OutType
xf: Generator[Incomplete | None, Incomplete, None]
xf: Generator[Incomplete | None, Incomplete]
def __init__(self, ws: Worksheet | WriteOnlyWorksheet, out: _OutType | None = None) -> None: ...
def write_properties(self) -> None: ...
def write_dimensions(self) -> None: ...
@@ -51,7 +51,7 @@ class WorksheetWriter:
def write_drawings(self) -> None: ...
def write_legacy(self) -> None: ...
def write_tables(self) -> None: ...
def get_stream(self) -> Generator[Incomplete | None, bool | None, None]: ...
def get_stream(self) -> Generator[Incomplete | None, bool | None]: ...
def write_tail(self) -> None: ...
def write(self) -> None: ...
def close(self) -> None: ...
stubs/openpyxl/openpyxl/worksheet/cell_range.pyi
+2 -2
View File
@@ -53,9 +53,9 @@ class CellRange(Serialisable):
@property
def coord(self) -> str: ...
@property
def rows(self) -> Generator[list[tuple[int, int]], None, None]: ...
def rows(self) -> Generator[list[tuple[int, int]]]: ...
@property
def cols(self) -> Generator[list[tuple[int, int]], None, None]: ...
def cols(self) -> Generator[list[tuple[int, int]]]: ...
@property
def cells(self) -> product[tuple[int, int]]: ...
def __copy__(self): ...
stubs/openpyxl/openpyxl/worksheet/worksheet.pyi
+12 -12
View File
@@ -119,7 +119,7 @@ class Worksheet(_WorkbookChild):
@overload
def iter_rows(
self, min_row: int | None, max_row: int | None, min_col: int | None, max_col: int | None, values_only: Literal[True]
) -> Generator[tuple[_CellGetValue, ...], None, None]: ...
) -> Generator[tuple[_CellGetValue, ...]]: ...
@overload
def iter_rows(
self,
@@ -129,7 +129,7 @@ class Worksheet(_WorkbookChild):
max_col: int | None = None,
*,
values_only: Literal[True],
) -> Generator[tuple[_CellGetValue, ...], None, None]: ...
) -> Generator[tuple[_CellGetValue, ...]]: ...
@overload
def iter_rows(
self,
@@ -138,11 +138,11 @@ class Worksheet(_WorkbookChild):
min_col: int | None = None,
max_col: int | None = None,
values_only: Literal[False] = False,
) -> Generator[tuple[_CellOrMergedCell, ...], None, None]: ...
) -> Generator[tuple[_CellOrMergedCell, ...]]: ...
@overload
def iter_rows(
self, min_row: int | None, max_row: int | None, min_col: int | None, max_col: int | None, values_only: bool
) -> Generator[tuple[_CellOrMergedCell, ...], None, None] | Generator[tuple[_CellGetValue, ...], None, None]: ...
) -> Generator[tuple[_CellOrMergedCell, ...]] | Generator[tuple[_CellGetValue, ...]]: ...
@overload
def iter_rows(
self,
@@ -152,15 +152,15 @@ class Worksheet(_WorkbookChild):
max_col: int | None = None,
*,
values_only: bool,
) -> Generator[tuple[_CellOrMergedCell, ...], None, None] | Generator[tuple[_CellGetValue, ...], None, None]: ...
) -> Generator[tuple[_CellOrMergedCell, ...]] | Generator[tuple[_CellGetValue, ...]]: ...
@property
def rows(self) -> Generator[tuple[_CellOrMergedCell, ...], None, None]: ...
def rows(self) -> Generator[tuple[_CellOrMergedCell, ...]]: ...
@property
def values(self) -> Generator[tuple[_CellGetValue, ...]]: ...
@overload
def iter_cols(
self, min_col: int | None, max_col: int | None, min_row: int | None, max_row: int | None, values_only: Literal[True]
) -> Generator[tuple[_CellGetValue, ...], None, None]: ...
) -> Generator[tuple[_CellGetValue, ...]]: ...
@overload
def iter_cols(
self,
@@ -170,7 +170,7 @@ class Worksheet(_WorkbookChild):
max_row: int | None = None,
*,
values_only: Literal[True],
) -> Generator[tuple[_CellGetValue, ...], None, None]: ...
) -> Generator[tuple[_CellGetValue, ...]]: ...
@overload
def iter_cols(
self,
@@ -179,11 +179,11 @@ class Worksheet(_WorkbookChild):
min_row: int | None = None,
max_row: int | None = None,
values_only: Literal[False] = False,
) -> Generator[tuple[_CellOrMergedCell, ...], None, None]: ...
) -> Generator[tuple[_CellOrMergedCell, ...]]: ...
@overload
def iter_cols(
self, min_col: int | None, max_col: int | None, min_row: int | None, max_row: int | None, values_only: bool
) -> Generator[tuple[_CellOrMergedCell, ...], None, None] | Generator[tuple[_CellGetValue, ...], None, None]: ...
) -> Generator[tuple[_CellOrMergedCell, ...]] | Generator[tuple[_CellGetValue, ...]]: ...
@overload
def iter_cols(
self,
@@ -193,9 +193,9 @@ class Worksheet(_WorkbookChild):
max_row: int | None = None,
*,
values_only: bool,
) -> Generator[tuple[_CellOrMergedCell, ...], None, None] | Generator[tuple[_CellGetValue, ...], None, None]: ...
) -> Generator[tuple[_CellOrMergedCell, ...]] | Generator[tuple[_CellGetValue, ...]]: ...
@property
def columns(self) -> Generator[tuple[_CellOrMergedCell, ...], None, None]: ...
def columns(self) -> Generator[tuple[_CellOrMergedCell, ...]]: ...
@property
def column_groups(self) -> list[str]: ...
def set_printer_settings(
stubs/peewee/peewee.pyi
+5 -7
View File
@@ -44,7 +44,7 @@ CSQ_PARENTHESES_NEVER: Final = 0
CSQ_PARENTHESES_ALWAYS: Final = 1
CSQ_PARENTHESES_UNNESTED: Final = 2
def chunked(it, n) -> Generator[Incomplete, None, None]: ...
def chunked(it, n) -> Generator[Incomplete]: ...
class _callable_context_manager:
def __call__(self, fn): ...
@@ -573,7 +573,7 @@ class SelectBase(_HashableSource, Source, SelectQuery): # type: ignore[misc]
def peek(self, database=None, n: int = 1): ...
def first(self, database=None, n: int = 1): ...
def scalar(self, database=None, as_tuple: bool = False, as_dict: bool = False): ...
def scalars(self, database=None) -> Generator[Incomplete, None, None]: ...
def scalars(self, database=None) -> Generator[Incomplete]: ...
def count(self, database=None, clear_limit: bool = False): ...
def exists(self, database=None) -> bool: ...
def get(self, database=None): ...
@@ -818,7 +818,7 @@ class Database(_callable_context_manager):
def begin(self) -> None: ...
def commit(self) -> None: ...
def rollback(self) -> None: ...
def batch_commit(self, it, n) -> Generator[Incomplete, None, None]: ...
def batch_commit(self, it, n) -> Generator[Incomplete]: ...
def table_exists(self, table_name, schema: str | None = None) -> bool: ...
def get_tables(self, schema: str | None = None) -> list[str]: ...
def get_indexes(self, table, schema: str | None = None) -> list[IndexMetadata]: ...
@@ -1057,7 +1057,7 @@ class CursorWrapper:
def initialize(self) -> None: ...
def iterate(self, cache: bool = True): ...
def process_row(self, row): ...
def iterator(self) -> Generator[Incomplete, None, None]: ...
def iterator(self) -> Generator[Incomplete]: ...
def fill_cache(self, n: int = 0) -> None: ...
class DictCursorWrapper(CursorWrapper):
@@ -1666,9 +1666,7 @@ class Model(metaclass=ModelBase):
def dirty_fields(self) -> list[Incomplete]: ...
@property
def dirty_field_names(self) -> list[Incomplete]: ...
def dependencies(
self, search_nullable: bool = True, exclude_null_children: bool = False
) -> Generator[Incomplete, None, None]: ...
def dependencies(self, search_nullable: bool = True, exclude_null_children: bool = False) -> Generator[Incomplete]: ...
def delete_instance(self, recursive: bool = False, delete_nullable: bool = False): ...
def __hash__(self) -> int: ...
def __eq__(self, other) -> Expression | bool: ... # type: ignore[override]
stubs/pika/pika/adapters/blocking_connection.pyi
+1 -1
View File
@@ -196,7 +196,7 @@ class BlockingChannel:
def stop_consuming(self, consumer_tag=None) -> None: ...
def consume(
self, queue, auto_ack: bool = False, exclusive: bool = False, arguments=None, inactivity_timeout=None
) -> Generator[Incomplete, None, None]: ...
) -> Generator[Incomplete]: ...
def get_waiting_message_count(self): ...
def cancel(self): ...
def basic_ack(self, delivery_tag: int = 0, multiple: bool = False) -> None: ...
stubs/psutil/psutil/_pswindows.pyi
+6 -6
View File
@@ -46,12 +46,12 @@ if sys.platform == "win32":
# These noqas workaround https://github.com/astral-sh/ruff/issues/10874
class Priority(enum.IntEnum):
ABOVE_NORMAL_PRIORITY_CLASS = _psutil_windows.ABOVE_NORMAL_PRIORITY_CLASS # noqa: F811
BELOW_NORMAL_PRIORITY_CLASS = _psutil_windows.BELOW_NORMAL_PRIORITY_CLASS # noqa: F811
HIGH_PRIORITY_CLASS = _psutil_windows.HIGH_PRIORITY_CLASS # noqa: F811
IDLE_PRIORITY_CLASS = _psutil_windows.IDLE_PRIORITY_CLASS # noqa: F811
NORMAL_PRIORITY_CLASS = _psutil_windows.NORMAL_PRIORITY_CLASS # noqa: F811
REALTIME_PRIORITY_CLASS = _psutil_windows.REALTIME_PRIORITY_CLASS # noqa: F811
ABOVE_NORMAL_PRIORITY_CLASS = _psutil_windows.ABOVE_NORMAL_PRIORITY_CLASS
BELOW_NORMAL_PRIORITY_CLASS = _psutil_windows.BELOW_NORMAL_PRIORITY_CLASS
HIGH_PRIORITY_CLASS = _psutil_windows.HIGH_PRIORITY_CLASS
IDLE_PRIORITY_CLASS = _psutil_windows.IDLE_PRIORITY_CLASS
NORMAL_PRIORITY_CLASS = _psutil_windows.NORMAL_PRIORITY_CLASS
REALTIME_PRIORITY_CLASS = _psutil_windows.REALTIME_PRIORITY_CLASS
class IOPriority(enum.IntEnum):
IOPRIO_VERYLOW = 0
stubs/pyasn1/pyasn1/codec/streaming.pyi
+3 -3
View File
@@ -16,6 +16,6 @@ class CachingStreamWrapper(io.IOBase):
def tell(self): ...
def asSeekableStream(substrate): ...
def isEndOfStream(substrate) -> Generator[Incomplete, None, None]: ...
def peekIntoStream(substrate, size: int = -1) -> Generator[Incomplete, None, None]: ...
def readFromStream(substrate, size: int = -1, context=None) -> Generator[Incomplete, None, None]: ...
def isEndOfStream(substrate) -> Generator[Incomplete]: ...
def peekIntoStream(substrate, size: int = -1) -> Generator[Incomplete]: ...
def readFromStream(substrate, size: int = -1, context=None) -> Generator[Incomplete]: ...
stubs/pyasn1/pyasn1/type/namedval.pyi
+1 -1
View File
@@ -18,7 +18,7 @@ class NamedValues:
def __iter__(self): ...
def values(self): ...
def keys(self): ...
def items(self) -> Generator[Incomplete, None, None]: ...
def items(self) -> Generator[Incomplete]: ...
def __add__(self, namedValues): ...
def clone(self, *args, **kwargs): ...
def getName(self, value): ...
stubs/pyasn1/pyasn1/type/univ.pyi
+5 -5
View File
@@ -303,9 +303,9 @@ class SequenceAndSetBase(base.ConstructedAsn1Type):
def __contains__(self, key) -> bool: ...
def __len__(self) -> int: ...
def __iter__(self): ...
def values(self) -> Generator[Incomplete, None, None]: ...
def values(self) -> Generator[Incomplete]: ...
def keys(self): ...
def items(self) -> Generator[Incomplete, None, None]: ...
def items(self) -> Generator[Incomplete]: ...
def update(self, *iterValue, **mappingValue) -> None: ...
def clear(self): ...
def reset(self): ...
@@ -371,9 +371,9 @@ class Choice(Set):
def __len__(self) -> int: ...
def __contains__(self, key) -> bool: ...
def __iter__(self): ...
def values(self) -> Generator[Incomplete, None, None]: ...
def keys(self) -> Generator[Incomplete, None, None]: ...
def items(self) -> Generator[Incomplete, None, None]: ...
def values(self) -> Generator[Incomplete]: ...
def keys(self) -> Generator[Incomplete]: ...
def items(self) -> Generator[Incomplete]: ...
def checkConsistency(self) -> None: ...
def getComponentByPosition(self, idx, default=..., instantiate: bool = True): ...
def setComponentByPosition(

Some files were not shown because too many files have changed in this diff Show More