@@ -302,15 +302,15 @@ class Sequence(_Collection[_T_co], Reversible[_T_co], Generic[_T_co]):
302
302
@abstractmethod
303
303
def __getitem__ (self , s : slice ) -> Sequence [_T_co ]: ...
304
304
# Mixin methods
305
- def index (self , x : Any , start : int = ..., end : int = ...) -> int : ...
306
- def count (self , x : Any ) -> int : ...
305
+ def index (self , value : Any , start : int = ..., stop : int = ...) -> int : ...
306
+ def count (self , value : Any ) -> int : ...
307
307
def __contains__ (self , x : object ) -> bool : ...
308
308
def __iter__ (self ) -> Iterator [_T_co ]: ...
309
309
def __reversed__ (self ) -> Iterator [_T_co ]: ...
310
310
311
311
class MutableSequence (Sequence [_T ], Generic [_T ]):
312
312
@abstractmethod
313
- def insert (self , index : int , object : _T ) -> None : ...
313
+ def insert (self , index : int , value : _T ) -> None : ...
314
314
@overload
315
315
@abstractmethod
316
316
def __getitem__ (self , i : int ) -> _T : ...
@@ -330,12 +330,12 @@ class MutableSequence(Sequence[_T], Generic[_T]):
330
330
@abstractmethod
331
331
def __delitem__ (self , i : slice ) -> None : ...
332
332
# Mixin methods
333
- def append (self , object : _T ) -> None : ...
333
+ def append (self , value : _T ) -> None : ...
334
334
def clear (self ) -> None : ...
335
- def extend (self , iterable : Iterable [_T ]) -> None : ...
335
+ def extend (self , values : Iterable [_T ]) -> None : ...
336
336
def reverse (self ) -> None : ...
337
337
def pop (self , index : int = ...) -> _T : ...
338
- def remove (self , object : _T ) -> None : ...
338
+ def remove (self , value : _T ) -> None : ...
339
339
def __iadd__ (self , x : Iterable [_T ]) -> MutableSequence [_T ]: ...
340
340
341
341
class AbstractSet (_Collection [_T_co ], Generic [_T_co ]):
@@ -350,17 +350,17 @@ class AbstractSet(_Collection[_T_co], Generic[_T_co]):
350
350
def __or__ (self , s : AbstractSet [_T ]) -> AbstractSet [Union [_T_co , _T ]]: ...
351
351
def __sub__ (self , s : AbstractSet [Any ]) -> AbstractSet [_T_co ]: ...
352
352
def __xor__ (self , s : AbstractSet [_T ]) -> AbstractSet [Union [_T_co , _T ]]: ...
353
- def isdisjoint (self , s : Iterable [Any ]) -> bool : ...
353
+ def isdisjoint (self , other : Iterable [Any ]) -> bool : ...
354
354
355
355
class MutableSet (AbstractSet [_T ], Generic [_T ]):
356
356
@abstractmethod
357
- def add (self , x : _T ) -> None : ...
357
+ def add (self , value : _T ) -> None : ...
358
358
@abstractmethod
359
- def discard (self , x : _T ) -> None : ...
359
+ def discard (self , value : _T ) -> None : ...
360
360
# Mixin methods
361
361
def clear (self ) -> None : ...
362
362
def pop (self ) -> _T : ...
363
- def remove (self , element : _T ) -> None : ...
363
+ def remove (self , value : _T ) -> None : ...
364
364
def __ior__ (self , s : AbstractSet [_S ]) -> MutableSet [Union [_T , _S ]]: ...
365
365
def __iand__ (self , s : AbstractSet [Any ]) -> MutableSet [_T ]: ...
366
366
def __ixor__ (self , s : AbstractSet [_S ]) -> MutableSet [Union [_T , _S ]]: ...
@@ -432,9 +432,9 @@ class Mapping(_Collection[_KT], Generic[_KT, _VT_co]):
432
432
...
433
433
# Mixin methods
434
434
@overload
435
- def get (self , k : _KT ) -> Optional [_VT_co ]: ...
435
+ def get (self , key : _KT ) -> Optional [_VT_co ]: ...
436
436
@overload
437
- def get (self , k : _KT , default : Union [_VT_co , _T ]) -> Union [_VT_co , _T ]: ...
437
+ def get (self , key : _KT , default : Union [_VT_co , _T ]) -> Union [_VT_co , _T ]: ...
438
438
def items (self ) -> AbstractSet [Tuple [_KT , _VT_co ]]: ...
439
439
def keys (self ) -> AbstractSet [_KT ]: ...
440
440
def values (self ) -> ValuesView [_VT_co ]: ...
@@ -448,11 +448,11 @@ class MutableMapping(Mapping[_KT, _VT], Generic[_KT, _VT]):
448
448
449
449
def clear (self ) -> None : ...
450
450
@overload
451
- def pop (self , k : _KT ) -> _VT : ...
451
+ def pop (self , key : _KT ) -> _VT : ...
452
452
@overload
453
- def pop (self , k : _KT , default : Union [_VT , _T ] = ...) -> Union [_VT , _T ]: ...
453
+ def pop (self , key : _KT , default : Union [_VT , _T ] = ...) -> Union [_VT , _T ]: ...
454
454
def popitem (self ) -> Tuple [_KT , _VT ]: ...
455
- def setdefault (self , k : _KT , default : _VT = ...) -> _VT : ...
455
+ def setdefault (self , key : _KT , default : _VT = ...) -> _VT : ...
456
456
# 'update' used to take a Union, but using overloading is better.
457
457
# The second overloaded type here is a bit too general, because
458
458
# Mapping[Tuple[_KT, _VT], W] is a subclass of Iterable[Tuple[_KT, _VT]],
0 commit comments