mirror of
https://github.com/davidhalter/typeshed.git
synced 2025-12-08 04:54:47 +08:00
96c9abb058
* Always use `_typeshed.Self`, where applicable * Revert changes to `google-cloud-ndb` (ambiguous) * Remove empty line added by script * Revert changes to `stubs/python-dateutil/dateutil/relativedelta.pyi` * Manually add a few more that the script missed * Improve `filelock` annotation Source code here:79ec7b2826/src/filelock/_api.py (L207)* Improve `opentracing/scope` annotation Source code here:3e1d357a34/opentracing/scope.py (L71)* Improve `redis/client` stub Source code here:15f315a496/redis/client.py (L1217)* Improve `redis/lock` annotation Source code here:15f315a496/redis/lock.py (L155)* Improve `requests/models` annotation Source code here:d718e75383/requests/models.py (L653)
48 lines
2.3 KiB
Python
48 lines
2.3 KiB
Python
import sys
|
|
from _typeshed import Self
|
|
from typing import Any, Generic, Iterable, Iterator, MutableSet, TypeVar
|
|
|
|
if sys.version_info >= (3, 9):
|
|
from types import GenericAlias
|
|
|
|
_S = TypeVar("_S")
|
|
_T = TypeVar("_T")
|
|
|
|
class WeakSet(MutableSet[_T], Generic[_T]):
|
|
def __init__(self, data: Iterable[_T] | None = ...) -> None: ...
|
|
def add(self, item: _T) -> None: ...
|
|
def clear(self) -> None: ...
|
|
def discard(self, item: _T) -> None: ...
|
|
def copy(self: Self) -> Self: ...
|
|
def pop(self) -> _T: ...
|
|
def remove(self, item: _T) -> None: ...
|
|
def update(self, other: Iterable[_T]) -> None: ...
|
|
def __contains__(self, item: object) -> bool: ...
|
|
def __len__(self) -> int: ...
|
|
def __iter__(self) -> Iterator[_T]: ...
|
|
def __ior__(self, other: Iterable[_S]) -> WeakSet[_S | _T]: ...
|
|
def difference(self: Self, other: Iterable[_T]) -> Self: ...
|
|
def __sub__(self: Self, other: Iterable[_T]) -> Self: ...
|
|
def difference_update(self, other: Iterable[_T]) -> None: ...
|
|
def __isub__(self: Self, other: Iterable[_T]) -> Self: ...
|
|
def intersection(self: Self, other: Iterable[_T]) -> Self: ...
|
|
def __and__(self: Self, other: Iterable[_T]) -> Self: ...
|
|
def intersection_update(self, other: Iterable[_T]) -> None: ...
|
|
def __iand__(self: Self, other: Iterable[_T]) -> Self: ...
|
|
def issubset(self, other: Iterable[_T]) -> bool: ...
|
|
def __le__(self, other: Iterable[_T]) -> bool: ...
|
|
def __lt__(self, other: Iterable[_T]) -> bool: ...
|
|
def issuperset(self, other: Iterable[_T]) -> bool: ...
|
|
def __ge__(self, other: Iterable[_T]) -> bool: ...
|
|
def __gt__(self, other: Iterable[_T]) -> bool: ...
|
|
def __eq__(self, other: object) -> bool: ...
|
|
def symmetric_difference(self, other: Iterable[_S]) -> WeakSet[_S | _T]: ...
|
|
def __xor__(self, other: Iterable[_S]) -> WeakSet[_S | _T]: ...
|
|
def symmetric_difference_update(self, other: Iterable[Any]) -> None: ...
|
|
def __ixor__(self, other: Iterable[_S]) -> WeakSet[_S | _T]: ...
|
|
def union(self, other: Iterable[_S]) -> WeakSet[_S | _T]: ...
|
|
def __or__(self, other: Iterable[_S]) -> WeakSet[_S | _T]: ...
|
|
def isdisjoint(self, other: Iterable[_T]) -> bool: ...
|
|
if sys.version_info >= (3, 9):
|
|
def __class_getitem__(cls, item: Any) -> GenericAlias: ...
|