(i: Iterator[_T])
| 400 | def iter(i: Iterable[_T]) -> Iterator[_T]: pass |
| 401 | @overload |
| 402 | def next(i: Iterator[_T]) -> _T: pass |
| 403 | @overload |
| 404 | def next(i: Iterator[_T], default: _T) -> _T: pass |
| 405 | def hash(o: object) -> int: ... |
no outgoing calls
searching dependent graphs…