VimPlug/typeshed
1
0
Fork 0
mirror of https://github.com/davidhalter/typeshed.git synced 2026-01-23 19:41:51 +08:00
Code Issues Actions Packages Projects Releases Wiki Activity

Use lowercase set, frozenset and deque where possible (#6346)

Browse Source
This commit is contained in:
Alex Waygood
2021-11-19 23:05:45 +00:00
committed by GitHub
parent 916ca06885
commit 5c8e68f0eb
15 changed files with 77 additions and 79 deletions
Download Patch File Download Diff File Expand all files Collapse all files

46
stdlib/builtins.pyi
View File

@@ -33,7 +33,6 @@ from typing import (
BinaryIO,
ByteString,
Callable,
FrozenSet,
Generic,
Iterable,
Iterator,
@@ -45,7 +44,6 @@ from typing import (
Protocol,
Reversible,
Sequence,
Set,
Sized,
SupportsAbs,
SupportsBytes,
@@ -861,33 +859,33 @@ class set(MutableSet[_T], Generic[_T]):
def __init__(self, __iterable: Iterable[_T] = ...) -> None: ...
def add(self, __element: _T) -> None: ...
def clear(self) -> None: ...
def copy(self) -> Set[_T]: ...
def difference(self, *s: Iterable[Any]) -> Set[_T]: ...
def copy(self) -> set[_T]: ...
def difference(self, *s: Iterable[Any]) -> set[_T]: ...
def difference_update(self, *s: Iterable[Any]) -> None: ...
def discard(self, __element: _T) -> None: ...
def intersection(self, *s: Iterable[Any]) -> Set[_T]: ...
def intersection(self, *s: Iterable[Any]) -> set[_T]: ...
def intersection_update(self, *s: Iterable[Any]) -> None: ...
def isdisjoint(self, __s: Iterable[Any]) -> bool: ...
def issubset(self, __s: Iterable[Any]) -> bool: ...
def issuperset(self, __s: Iterable[Any]) -> bool: ...
def pop(self) -> _T: ...
def remove(self, __element: _T) -> None: ...
def symmetric_difference(self, __s: Iterable[_T]) -> Set[_T]: ...
def symmetric_difference(self, __s: Iterable[_T]) -> set[_T]: ...
def symmetric_difference_update(self, __s: Iterable[_T]) -> None: ...
def union(self, *s: Iterable[_S]) -> Set[_T | _S]: ...
def union(self, *s: Iterable[_S]) -> set[_T | _S]: ...
def update(self, *s: Iterable[_T]) -> None: ...
def __len__(self) -> int: ...
def __contains__(self, __o: object) -> bool: ...
def __iter__(self) -> Iterator[_T]: ...
def __str__(self) -> str: ...
def __and__(self, __s: AbstractSet[object]) -> Set[_T]: ...
def __iand__(self, __s: AbstractSet[object]) -> Set[_T]: ...
def __or__(self, __s: AbstractSet[_S]) -> Set[_T | _S]: ...
def __ior__(self, __s: AbstractSet[_S]) -> Set[_T | _S]: ...
def __sub__(self, __s: AbstractSet[_T | None]) -> Set[_T]: ...
def __isub__(self, __s: AbstractSet[_T | None]) -> Set[_T]: ...
def __xor__(self, __s: AbstractSet[_S]) -> Set[_T | _S]: ...
def __ixor__(self, __s: AbstractSet[_S]) -> Set[_T | _S]: ...
def __and__(self, __s: AbstractSet[object]) -> set[_T]: ...
def __iand__(self, __s: AbstractSet[object]) -> set[_T]: ...
def __or__(self, __s: AbstractSet[_S]) -> set[_T | _S]: ...
def __ior__(self, __s: AbstractSet[_S]) -> set[_T | _S]: ...
def __sub__(self, __s: AbstractSet[_T | None]) -> set[_T]: ...
def __isub__(self, __s: AbstractSet[_T | None]) -> set[_T]: ...
def __xor__(self, __s: AbstractSet[_S]) -> set[_T | _S]: ...
def __ixor__(self, __s: AbstractSet[_S]) -> set[_T | _S]: ...
def __le__(self, __s: AbstractSet[object]) -> bool: ...
def __lt__(self, __s: AbstractSet[object]) -> bool: ...
def __ge__(self, __s: AbstractSet[object]) -> bool: ...
@@ -898,22 +896,22 @@ class set(MutableSet[_T], Generic[_T]):
class frozenset(AbstractSet[_T_co], Generic[_T_co]):
def __init__(self, __iterable: Iterable[_T_co] = ...) -> None: ...
def copy(self) -> FrozenSet[_T_co]: ...
def difference(self, *s: Iterable[object]) -> FrozenSet[_T_co]: ...
def intersection(self, *s: Iterable[object]) -> FrozenSet[_T_co]: ...
def copy(self) -> frozenset[_T_co]: ...
def difference(self, *s: Iterable[object]) -> frozenset[_T_co]: ...
def intersection(self, *s: Iterable[object]) -> frozenset[_T_co]: ...
def isdisjoint(self, __s: Iterable[_T_co]) -> bool: ...
def issubset(self, __s: Iterable[object]) -> bool: ...
def issuperset(self, __s: Iterable[object]) -> bool: ...
def symmetric_difference(self, __s: Iterable[_T_co]) -> FrozenSet[_T_co]: ...
def union(self, *s: Iterable[_S]) -> FrozenSet[_T_co | _S]: ...
def symmetric_difference(self, __s: Iterable[_T_co]) -> frozenset[_T_co]: ...
def union(self, *s: Iterable[_S]) -> frozenset[_T_co | _S]: ...
def __len__(self) -> int: ...
def __contains__(self, __o: object) -> bool: ...
def __iter__(self) -> Iterator[_T_co]: ...
def __str__(self) -> str: ...
def __and__(self, __s: AbstractSet[_T_co]) -> FrozenSet[_T_co]: ...
def __or__(self, __s: AbstractSet[_S]) -> FrozenSet[_T_co | _S]: ...
def __sub__(self, __s: AbstractSet[_T_co]) -> FrozenSet[_T_co]: ...
def __xor__(self, __s: AbstractSet[_S]) -> FrozenSet[_T_co | _S]: ...
def __and__(self, __s: AbstractSet[_T_co]) -> frozenset[_T_co]: ...
def __or__(self, __s: AbstractSet[_S]) -> frozenset[_T_co | _S]: ...
def __sub__(self, __s: AbstractSet[_T_co]) -> frozenset[_T_co]: ...
def __xor__(self, __s: AbstractSet[_S]) -> frozenset[_T_co | _S]: ...
def __le__(self, __s: AbstractSet[object]) -> bool: ...
def __lt__(self, __s: AbstractSet[object]) -> bool: ...
def __ge__(self, __s: AbstractSet[object]) -> bool: ...