Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.python > #102324
| From | "Sven R. Kunze" <srkunze@mail.de> |
|---|---|
| Newsgroups | comp.lang.python |
| Subject | Heap Implementation |
| Date | 2016-01-30 23:47 +0100 |
| Message-ID | <mailman.148.1454194055.2338.python-list@python.org> (permalink) |
Hi again, as the topic of the old thread actually was fully discussed, I dare to open a new one. I finally managed to finish my heap implementation. You can find it at https://pypi.python.org/pypi/xheap + https://github.com/srkunze/xheap. I described my motivations and design decisions at http://srkunze.blogspot.com/2016/01/fast-object-oriented-heap-implementation.html @Cem You've been worried about a C implementation. I can assure you that I did not intend to rewrite the incredibly fast and well-tested heapq implementation. I just re-used it. I would really be grateful for your feedback as you have first-hand experience with heaps. @srinivas You might want to have a look at the removal implementation. Do you think it would be wiser/faster to switch for the sweeping approach? I plan to publish some benchmarks to compare heapq and xheap. @all What's the best/standardized tool in Python to perform benchmarking? Right now, I use a self-made combo of unittest.TestCase and time.time + proper formatting. Best, Sven PS: fixing some weird typos and added missing part.
Back to comp.lang.python | Previous | Next — Next in thread | Find similar | Unroll thread
Heap Implementation "Sven R. Kunze" <srkunze@mail.de> - 2016-01-30 23:47 +0100
Re: Heap Implementation Steven D'Aprano <steve+comp.lang.python@pearwood.info> - 2016-01-31 12:48 +1100
Re: Heap Implementation "Sven R. Kunze" <srkunze@mail.de> - 2016-02-01 20:32 +0100
Re: Heap Implementation Steven D'Aprano <steve+comp.lang.python@pearwood.info> - 2016-02-02 16:38 +1100
Re: Heap Implementation Oscar Benjamin <oscar.j.benjamin@gmail.com> - 2016-02-02 14:53 +0000
csiph-web