diff options
| author | Tim Peters <tim.peters@gmail.com> | 2002-08-02 21:48:06 (GMT) |
|---|---|---|
| committer | Tim Peters <tim.peters@gmail.com> | 2002-08-02 21:48:06 (GMT) |
| commit | 28c25527c25babcf31e4b00dea316ca6f8612079 (patch) | |
| tree | 79ec807bc9edd9bbcf44768a5b78dd3d104ce8b3 /Lib/weakref.py | |
| parent | 940dc922c0be94c622d8e2cf1474471397073f4e (diff) | |
| download | cpython-28c25527c25babcf31e4b00dea316ca6f8612079.zip cpython-28c25527c25babcf31e4b00dea316ca6f8612079.tar.gz cpython-28c25527c25babcf31e4b00dea316ca6f8612079.tar.bz2 | |
Hmm! I thought I checked this in before! Oh well.
Added new heapify() function, which transforms an arbitrary list into a
heap in linear time; that's a fundamental tool for using heaps in real
life <wink>.
Added heapyify() test. Added a "less naive" N-best algorithm to the test
suite, and noted that this could actually go much faster (building on
heapify()) if we had max-heaps instead of min-heaps (the iterative method
is appropriate when all the data isn't known in advance, but when it is
known in advance the tradeoffs get murkier).
Diffstat (limited to 'Lib/weakref.py')
0 files changed, 0 insertions, 0 deletions