summaryrefslogtreecommitdiff
path: root/Lib/test/test_heapq.py
Commit message (Expand)AuthorAgeFilesLines
* Fix stability of heapq's nlargest() and nsmallest().Raymond Hettinger2007-01-041-12/+12
* Add key= argument to heapq.nsmallest() and heapq.nlargest().Raymond Hettinger2004-12-021-1/+7
* Fix argument order in pure python version of nsmallest() and nlargest().Raymond Hettinger2004-11-291-2/+5
* Plug a leak and beef-up test coverage.Raymond Hettinger2004-09-281-0/+149
* Whitespace normalization.Tim Peters2004-07-081-1/+0
* Exercise some error conditionsNeal Norwitz2004-07-081-0/+10
* Reverse argument order for nsmallest() and nlargest().Raymond Hettinger2004-06-151-4/+4
* Install C version of heapq.nsmallest().Raymond Hettinger2004-06-131-6/+19
* Improve the memory performance and speed of heapq.nsmallest() by usingRaymond Hettinger2004-06-121-0/+1
* Convert test_heapq.py to unittests.Raymond Hettinger2004-06-101-86/+90
* SF patch #969791: Add nlargest() and nsmallest() to heapq.Raymond Hettinger2004-06-101-1/+10
* Add another test which exercises the whole suite with aRaymond Hettinger2002-12-071-0/+14
* Added new heapreplace(heap, item) function, to pop (and return) theTim Peters2002-08-031-3/+2
* Minor fiddling, including a simple class to implement a heap iteratorTim Peters2002-08-031-5/+18
* Hmm! I thought I checked this in before! Oh well.Tim Peters2002-08-021-1/+19
* check_invariant(): Use the same child->parent "formula" used by heapq.py.Tim Peters2002-08-021-2/+2
* Don't use true division where int division was intended. For that matter,Tim Peters2002-08-021-1/+1
* Adding the heap queue algorithm, per discussion in python-dev lastGuido van Rossum2002-08-021-0/+48