[Inada Naoki ]
> I just meant the performance of the next(iter(D)) is the most critical part
> when you implement orderdset on top of the current dict and use it as a queue.
Which is a good point. I added a lot more, though, because Wes didn't
even mention queues in his question:
[Wes Turner ]
On Sat, Dec 21, 2019 at 3:17 AM Tim Peters wrote:
>
> [Wes Turner ]
> >> How slow and space-inefficient would it be to just implement the set
> >> methods
> >> on top of dict?
>
> [Inada Naoki ]
> > Speed: Dict doesn't cache the position of the first item. Calling
> > next(iter(D)) repeatedly i
ACTIVITY SUMMARY (2019-12-13 - 2019-12-20)
Python tracker at https://bugs.python.org/
To view or respond to any of the issues listed below, click on the issue.
Do NOT respond to this message.
Issues counts and deltas:
open7200 (+26)
closed 43662 (+45)
total 50862 (+71)
Open issues w
[Wes Turner ]
>> How slow and space-inefficient would it be to just implement the set methods
>> on top of dict?
[Inada Naoki ]
> Speed: Dict doesn't cache the position of the first item. Calling
> next(iter(D)) repeatedly is O(N) in worst case.
> ...
See also Raymond's (only) message in this t
Got it. Thanks
On Fri, Dec 20, 2019, 2:34 AM Inada Naoki wrote:
> On Fri, Dec 20, 2019 at 4:15 PM Wes Turner wrote:
> >
> > How slow and space-inefficient would it be to just implement the set
> methods on top of dict?
>
> Speed: Dict doesn't cache the position of the first item. Calling
> ne
On Thu, Dec 19, 2019 at 9:57 PM Tim Peters wrote:
> > It's not obvious to me that insertion order is even the most obvious or
> > most commonly relevant sort order. I'm sure it is for Larry's program,
> but
> > often a work queue might want some other order. Very often queues
> > might instead,
On Fri, Dec 20 2019, Victor Stinner wrote:
Hi Victor,
> If we add the following function, does it solve your use case?
>
> void
> _PyErr_GetExcInfo(PyThreadState *tstate,
> PyObject **p_type, PyObject **p_value, PyObject
> **p_traceback)
Yes, it would.
>> In order to retrieve
