[issue34298] Avoid inefficient way to find start point in deque.index

Seonggi Kim added the comment: Request PR again : https://bugs.python.org/issue34302 -- stage: patch review -> resolved status: open -> closed ___ Python tracker ___ _

[issue34298] Avoid inefficient way to find start point in deque.index

Seonggi Kim added the comment: Base commit : Python 3.8.0a0 (heads/master:b75d7e2435, Aug 1 2018, 10:32:28) $ test.py import timeit queue_setup = ''' from collections import deque q = deque() start = 10**5 stop = start + 500 for i in range(0, stop): q.append(i) ''' code = ''' index = q.

[issue34298] Avoid inefficient way to find start point in deque.index

New submission from Raymond Hettinger : Please run some timings to show whether the improvement is significant. Also, please sign a CLA. -- components: +Library (Lib) -Extension Modules nosy: +rhettinger versions: -Python 2.7, Python 3.4, Python 3.5, Python 3.6, Python 3.7 _

[issue34298] Avoid inefficient way to find start point in deque.index

Change by Seonggi Kim : -- keywords: +patch pull_requests: +8098 stage: -> patch review ___ Python tracker ___ ___ Python-bugs-list

[issue34298] Avoid inefficient way to find start point in deque.index

Change by Seonggi Kim : -- components: Extension Modules nosy: hacksg priority: normal severity: normal status: open title: Avoid inefficient way to find start point in deque.index type: enhancement versions: Python 2.7, Python 3.4, Python 3.5, Python 3.6, Python 3.7, Python 3.8 __