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

2019-08-22 Thread Raymond Hettinger
Raymond Hettinger added the comment: It looks like deque.index() now has a fast searcher. -- resolution: -> out of date stage: patch review -> resolved status: open -> closed ___ Python tracker

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

2018-08-01 Thread Seonggi Kim
Seonggi Kim added the comment: I thing so too, it's my fault. -- ___ Python tracker ___ ___ Python-bugs-list mailing list Unsubscri

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

2018-08-01 Thread ksg97031
Change by ksg97031 : -- keywords: +patch pull_requests: +8117 stage: -> patch review ___ Python tracker ___ ___ Python-bugs-list ma

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

2018-08-01 Thread Raymond Hettinger
Raymond Hettinger added the comment: Why are we getting multiple tracker items opening and closing for this at the same time? Something odd is happening. Please don't close the tracker and change user ids in the middle of a conversation: https://bugs.python.org/issue34298 https://bug

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

2018-08-01 Thread Ronald Oussoren
Ronald Oussoren added the comment: That's ok, I hadn't expected that you'd sign the CLA before being asked to do so :-) Good luck. -- ___ Python tracker ___

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

2018-08-01 Thread Seonggi Kim
Seonggi Kim added the comment: Sorry, I'm waiting for permit CLA signing. I will request PR after CLA was signed. -- nosy: +hacksg ___ Python tracker ___ _

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

2018-08-01 Thread Ronald Oussoren
Ronald Oussoren added the comment: I'm not sure what your proposal is. Do you have a patch that increases the performance of collections.deque in some cases? If so please share that patch, preferably as a pull request on GitHub (see for an explanat

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

2018-07-31 Thread ksg97031
New submission from ksg97031 : Source base : heads/master:b75d7e2435, Aug 1 2018, 10:32:28 $ cat 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.index(30, 1, s