A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from https://mail.python.org/pipermail/python-dev/2002-June/025904.html below:

[Python-Dev] Priority queue (binary heap) python code

[Python-Dev] Priority queue (binary heap) python code [Python-Dev] Priority queue (binary heap) python codeMartin v. Loewis martin@v.loewis.de
25 Jun 2002 09:15:12 +0200
"Kevin O'Connor" <kevin@koconnor.net> writes:

> Any chance something like this could make it into the standard python
> library?  It would save a lot of time for lazy people like myself.  :-)

I think this deserves a library PEP. I would also recommend to have a
separate heap and priority queue API, to avoid the kind of confusion
that Skip ran into. Something like the C++ STL API might be
appropriate: the heap functions take a comparator function, on top of
which you offer both heapsort and priority queues.

The technical issues set aside, the main purpose of a library PEP is
to record a commitment from the author to maintain the module, with
the option of removing the module if the author runs away, and nobody
takes over.

Regards,
Martin




RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4