summaryrefslogtreecommitdiffstats
path: root/Objects/listobject.c
Commit message (Expand)AuthorAgeFilesLines
...
* Performance of list([]) in 2.3 came up in a thread on comp.lang.python,Andrew MacIntyre2003-12-251-6/+28
* Guido grants a Christmas wish:Raymond Hettinger2003-12-171-37/+0
* * Added a new method flag, METH_COEXIST.Raymond Hettinger2003-12-131-0/+5
* Fix memory error treatment correctly. Going to dsu_fail causesHye-Shik Chang2003-12-101-1/+1
* Fixes and tests for various "holding pointers when arbitrary Python codeMichael W. Hudson2003-12-041-35/+46
* Make sure the list.sort's decorate step unwinds itself before returningRaymond Hettinger2003-11-281-2/+9
* Improve the reverse list iterator to free memory as soon as the iteratorRaymond Hettinger2003-11-081-1/+4
* Minor code fixup. Make sure that len reflects the current list size.Raymond Hettinger2003-11-081-0/+1
* Optimize reversed(list) using a custom iterator.Raymond Hettinger2003-11-071-2/+96
* Fix compiler warning about possible use of n without assignment.Jeremy Hylton2003-11-031-5/+6
* Add list.sorted() classmethod.Raymond Hettinger2003-10-291-0/+37
* Fix typo found by Neal Norwitz.Raymond Hettinger2003-10-161-1/+1
* * list.sort() now supports three keyword arguments: cmp, key, and reverse.Raymond Hettinger2003-10-161-5/+228
* My last fix left n used unitialized in tha a==b case.Michael W. Hudson2003-08-151-1/+1
* Fix reference leak noted in test_types:Michael W. Hudson2003-08-141-9/+9
* Use _PyEval_SliceIndex to handle list.index() calls withWalter Dörwald2003-06-171-1/+3
* Fix sloppy index() implementation:Guido van Rossum2003-06-171-2/+12
* SF #754014: list.index() should accept optional start, end argumentsRaymond Hettinger2003-06-171-5/+10
* SF bug #604716: faster [None]*n or []*nRaymond Hettinger2003-05-211-0/+12
* SF bug #730296: Unexpected Changes in list IteratorRaymond Hettinger2003-05-071-2/+0
* Patch #708604: Check more function results. Will backport to 2.2.Martin v. Löwis2003-05-031-1/+8
* Squashed new compiler wngs about trying to compare pointers toTim Peters2003-04-241-1/+1
* SF bug 665835: filter() treatment of str and tuple inconsistentRaymond Hettinger2003-04-241-0/+2
* - list.insert(i, x) now interprets negative i as it would beGuido van Rossum2003-04-141-2/+5
* Renamed PyObject_GenericGetIter to PyObject_SelfIterRaymond Hettinger2003-03-171-1/+1
* Created PyObject_GenericGetIter().Raymond Hettinger2003-03-171-9/+1
* Allow list sort's comparison function to explicitly be None. See SF patchSkip Montanaro2003-01-021-1/+4
* SF patch #659536: Use PyArg_UnpackTuple where possible.Raymond Hettinger2002-12-291-1/+1
* SF Bug 645777: list.extend() works with any iterable and is no longerRaymond Hettinger2002-12-291-1/+1
* The final tweaks before closingMichael W. Hudson2002-12-051-20/+23
* SF patch 637176: list.sort crasherTim Peters2002-11-121-96/+29
* Use PyOS_snprintf() instead of sprintf and wrap the long lineNeal Norwitz2002-11-051-2/+4
* This is Alex Martelli's patchMichael W. Hudson2002-11-051-9/+12
* Darn! Don't divide by zero. Bad fix. :-)Guido van Rossum2002-10-111-1/+1
* Add checks for size overflow on list*n, list+list, tuple+tuple.Guido van Rossum2002-10-111-0/+4
* PyObject_RichCompareBool() already returns -1, 0, or 1, so return its valueNeal Norwitz2002-09-051-5/+1
* Micro-optimization for list_contains. Factored double if testRaymond Hettinger2002-09-051-8/+7
* 1. Combined the base and length arrays into a single array of structs.Tim Peters2002-08-101-30/+54
* PyList_Reverse(): This was leaking a reference to Py_None on every call.Tim Peters2002-08-081-1/+4
* Sped the usual case for sorting by calling PyObject_RichCompareBoolTim Peters2002-08-041-10/+18
* SF bug 590366: Small typo in listsort:ParseTupleTim Peters2002-08-031-1/+1
* Replaced samplesort with a stable, adaptive mergesort.Tim Peters2002-08-011-406/+772
* Fix forMichael W. Hudson2002-07-291-3/+8
* Patch #574867: Correct list.extend docstring.Martin v. Löwis2002-07-281-1/+1
* More sort cleanup: Moved the special cases from samplesortslice intoTim Peters2002-07-191-65/+73
* binarysort() cleanup: Documented the key invariants, explained why theyTim Peters2002-07-191-2/+13
* listreverse(): Don't call the new reverse_slice unless the listTim Peters2002-07-191-1/+2
* Cleanup yielding a small speed boost: before rich comparisons wereTim Peters2002-07-191-50/+32
* Trimmed trailing whitespace.Tim Peters2002-07-191-22/+22
* Cleanup: Define one internal utility for reversing a list slice, andTim Peters2002-07-191-28/+20