| 244 | class function: pass |
| 245 | |
| 246 | class list(Generic[_T], Sequence[_T], Iterable[_T]): |
| 247 | def __init__(self, i: Optional[Iterable[_T]] = None) -> None: pass |
| 248 | @overload |
| 249 | def __getitem__(self, i: int) -> _T: ... |
| 250 | @overload |
| 251 | def __getitem__(self, s: slice) -> List[_T]: ... |
| 252 | def __setitem__(self, i: int, o: _T) -> None: pass |
| 253 | def __delitem__(self, i: int) -> None: pass |
| 254 | def __mul__(self, i: int) -> List[_T]: pass |
| 255 | def __rmul__(self, i: int) -> List[_T]: pass |
| 256 | def __imul__(self, i: int) -> List[_T]: ... |
| 257 | def __iter__(self) -> Iterator[_T]: pass |
| 258 | def __len__(self) -> int: pass |
| 259 | def __contains__(self, item: object) -> int: ... |
| 260 | @overload |
| 261 | def __add__(self, value: List[_T], /) -> List[_T]: ... |
| 262 | @overload |
| 263 | def __add__(self, value: List[_S], /) -> List[_S | _T]: ... |
| 264 | def __iadd__(self, value: Iterable[_T], /) -> List[_T]: ... # type: ignore[misc] |
| 265 | def append(self, x: _T) -> None: pass |
| 266 | def pop(self, i: int = -1) -> _T: pass |
| 267 | def count(self, x: _T) -> int: pass |
| 268 | def extend(self, l: Iterable[_T]) -> None: pass |
| 269 | def insert(self, i: int, x: _T) -> None: pass |
| 270 | def sort(self) -> None: pass |
| 271 | def reverse(self) -> None: pass |
| 272 | def remove(self, o: _T) -> None: pass |
| 273 | def index(self, o: _T) -> int: pass |
| 274 | def clear(self) -> None: pass |
| 275 | def copy(self) -> List[_T]: pass |
| 276 | |
| 277 | class dict(Mapping[_K, _V]): |
| 278 | @overload |
no outgoing calls
searching dependent graphs…