Provide a robust O(1) mechanism to check for infinite iterators
未关闭
还没有人认领这个 Issue。
3.8 (EOL)
type-feature
- 主要语言
- Python
- 星标
- 77.2k
- 派生
- 36k
- PR 合并指标
- PR 指标待抓取
描述
| BPO | 33939 |
|---|---|
| Nosy | @rhettinger, @ncoghlan, @pitrou, @embray, @serhiy-storchaka, @jdemeyer, @k7hoven, @bbayles |
Note: these values reflect the state of the issue at the time it was migrated and might not reflect the current state.
Show more details
GitHub fields:
assignee = None
closed_at = None
created_at = <Date 2018-06-22.12:48:14.537>
labels = ['type-feature', '3.8']
title = 'Provide a robust O(1) mechanism to check for infinite iterators'
updated_at = <Date 2018-09-04.01:06:44.169>
user = 'https://github.com/ncoghlan'
bugs.python.org fields:
activity = <Date 2018-09-04.01:06:44.169>
actor = 'koos.zevenhoven'
assignee = 'none'
closed = False
closed_date = None
closer = None
components = []
creation = <Date 2018-06-22.12:48:14.537>
creator = 'ncoghlan'
dependencies = []
files = []
hgrepos = []
issue_num = 33939
keywords = []
message_count = 19.0
messages = ['320229', '320232', '320234', '320235', '320237', '320239', '320241', '320297', '320323', '320350', '320352', '320554', '320567', '320568', '320580', '320581', '320589', '323666', '324548']
nosy_count = 8.0
nosy_names = ['rhettinger', 'ncoghlan', 'pitrou', 'erik.bray', 'serhiy.storchaka', 'jdemeyer', 'koos.zevenhoven', 'bbayles']
pr_nums = []
priority = 'normal'
resolution = None
stage = 'needs patch'
status = 'open'
superseder = None
type = 'enhancement'
url = 'https://bugs.python.org/issue33939'
versions = ['Python 3.8']
贡献指南
从这里开始
- 先读完整个 Issue,再读项目的贡献指南。
- 在 Issue 下留言说明你要接手 —— 这能避免两个人做同样的事。
- Fork 仓库,在一个分支上完成修改。
- 提交 Pull Request,并在描述里引用这个 Issue 编号。
调研方向
该 issue 没有列出文件、测试或入口点;先阅读链接的 BPO issue 及其包含 19 条消息的讨论。在就所需的 O(1) 机制、实现位置和验证标准达成一致之前,还不能开始工作。
由索引模型根据 Issue 内容生成。
评估
- 技术栈
- python
- 领域
- backend
- Issue 类型
- 功能
- 难度
- 5/5
- 预计耗时
- 一周以上
- 活跃度
- 停滞
- 描述清晰度
- 需要澄清
- 新手友好度
- 20/100