Improve stub for collections.deque (#6293)

Author: AlexWaygood

stdlib/collections/__init__.pyi

@@ -160,43 +160,45 @@ class deque(MutableSequence[_T], Generic[_T]):
     @property
     def maxlen(self) -> int | None: ...
     def __init__(self, iterable: Iterable[_T] = ..., maxlen: int | None = ...) -> None: ...
-    def append(self, x: _T) -> None: ...
-    def appendleft(self, x: _T) -> None: ...
+    def append(self, __x: _T) -> None: ...
+    def appendleft(self, __x: _T) -> None: ...
     def clear(self) -> None: ...
-    def copy(self) -> deque[_T]: ...
-    def count(self, x: _T) -> int: ...
-    def extend(self, iterable: Iterable[_T]) -> None: ...
-    def extendleft(self, iterable: Iterable[_T]) -> None: ...
-    def insert(self, i: int, x: _T) -> None: ...
-    def index(self, x: _T, start: int = ..., stop: int = ...) -> int: ...
+    def copy(self: _S) -> _S: ...
+    def count(self, __x: _T) -> int: ...
+    def extend(self, __iterable: Iterable[_T]) -> None: ...
+    def extendleft(self, __iterable: Iterable[_T]) -> None: ...
+    def insert(self, __i: int, __x: _T) -> None: ...
+    def index(self, __x: _T, __start: int = ..., __stop: int = ...) -> int: ...
     def pop(self) -> _T: ...  # type: ignore
     def popleft(self) -> _T: ...
-    def remove(self, value: _T) -> None: ...
+    def remove(self, __value: _T) -> None: ...
     def reverse(self) -> None: ...
-    def rotate(self, n: int = ...) -> None: ...
+    def rotate(self, __n: int = ...) -> None: ...
+    def __copy__(self: _S) -> _S: ...
     def __len__(self) -> int: ...
     def __iter__(self) -> Iterator[_T]: ...
     def __str__(self) -> str: ...
     # These methods of deque don't really take slices, but we need to
     # define them as taking a slice to satisfy MutableSequence.
     @overload
-    def __getitem__(self, index: int) -> _T: ...
+    def __getitem__(self, __index: int) -> _T: ...
     @overload
-    def __getitem__(self, s: slice) -> MutableSequence[_T]: ...
+    def __getitem__(self, __s: slice) -> MutableSequence[_T]: ...
     @overload
-    def __setitem__(self, i: int, x: _T) -> None: ...
+    def __setitem__(self, __i: int, __x: _T) -> None: ...
     @overload
-    def __setitem__(self, s: slice, o: Iterable[_T]) -> None: ...
+    def __setitem__(self, __s: slice, __o: Iterable[_T]) -> None: ...
     @overload
-    def __delitem__(self, i: int) -> None: ...
+    def __delitem__(self, __i: int) -> None: ...
     @overload
-    def __delitem__(self, s: slice) -> None: ...
-    def __contains__(self, o: object) -> bool: ...
+    def __delitem__(self, __s: slice) -> None: ...
+    def __contains__(self, __o: object) -> bool: ...
+    def __reduce__(self: Self) -> tuple[Type[Self], tuple[()], None, Iterator[_T]]: ...
     def __reversed__(self) -> Iterator[_T]: ...
-    def __iadd__(self: _S, iterable: Iterable[_T]) -> _S: ...
-    def __add__(self, other: deque[_T]) -> deque[_T]: ...
-    def __mul__(self, other: int) -> deque[_T]: ...
-    def __imul__(self, other: int) -> None: ...
+    def __iadd__(self: _S, __iterable: Iterable[_T]) -> _S: ...
+    def __add__(self: _S, __other: _S) -> _S: ...
+    def __mul__(self: _S, __other: int) -> _S: ...
+    def __imul__(self: _S, __other: int) -> _S: ...
 
 class Counter(Dict[_T, int], Generic[_T]):
     @overload