| 275 | def copy(self) -> List[_T]: pass |
| 276 | |
| 277 | class dict(Mapping[_K, _V]): |
| 278 | @overload |
| 279 | def __init__(self, **kwargs: _K) -> None: ... |
| 280 | @overload |
| 281 | def __init__(self, map: Mapping[_K, _V], **kwargs: _V) -> None: ... |
| 282 | @overload |
| 283 | def __init__(self, iterable: Iterable[Tuple[_K, _V]], **kwargs: _V) -> None: ... |
| 284 | def __getitem__(self, key: _K) -> _V: pass |
| 285 | def __setitem__(self, k: _K, v: _V) -> None: pass |
| 286 | def __delitem__(self, k: _K) -> None: pass |
| 287 | def __contains__(self, item: object) -> int: pass |
| 288 | def __iter__(self) -> Iterator[_K]: pass |
| 289 | def __len__(self) -> int: pass |
| 290 | @overload |
| 291 | def update(self, __m: Mapping[_K, _V], **kwargs: _V) -> None: pass |
| 292 | @overload |
| 293 | def update(self, __m: Iterable[Tuple[_K, _V]], **kwargs: _V) -> None: ... |
| 294 | @overload |
| 295 | def update(self, **kwargs: _V) -> None: ... |
| 296 | def pop(self, x: int) -> _K: pass |
| 297 | def keys(self) -> Iterable[_K]: pass |
| 298 | def values(self) -> Iterable[_V]: pass |
| 299 | def items(self) -> Iterable[Tuple[_K, _V]]: pass |
| 300 | def clear(self) -> None: pass |
| 301 | def copy(self) -> Dict[_K, _V]: pass |
| 302 | def setdefault(self, key: _K, val: _V = ...) -> _V: pass |
| 303 | |
| 304 | class set(Generic[_T]): |
| 305 | def __init__(self, i: Optional[Iterable[_T]] = None) -> None: pass |
no outgoing calls
searching dependent graphs…