[Python-Dev] collections.sortedtree (original) (raw)

Guido van Rossum guido at python.org
Wed Mar 26 22:42:07 CET 2014

I haven't felt it, heapq feels natural to me for this use case. :-)

I'm aware of the issue of frequent cancelled timers, but chose to wait and see rather than preemptively fix it (only so many hours in a day). IIRC pyftplib has a clever cleanup algorithm that we can easily add if that usage pattern becomes popular.

On Wed, Mar 26, 2014 at 2:36 PM, Marko Rauhamaa <marko at pacujo.net> wrote:

Guido van Rossum <guido at python.org>:

> Actually, the first step is publish it on PyPI, the second is to get a > fair number of happy users there. The bar for getting something > included into the stdlib is pretty high -- you need to demonstrate > that there is a need and that having it as a 3rd party module is a > problem. I hear you about the process. About the need part, I'm wondering if you haven't felt it in implementing the timers for asyncio. I have had that need in several network programming projects and have ended up using my AVL tree implementation (C and Python). Well, time will tell if frequent canceled timers end up piling up the heap queue.

Marko

-- --Guido van Rossum (python.org/~guido) -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://mail.python.org/pipermail/python-dev/attachments/20140326/d2c64f41/attachment.html>

More information about the Python-Dev mailing list