| Commit message (Expand) | Author | Age | Files | Lines |
|---|
| * | Get rid of listextend_internal() and explain why the special case | Armin Rigo | 2004-03-20 | 1 | -51/+25 |
|
|
| * | Make iterators length transparent where possible. | Raymond Hettinger | 2004-03-18 | 1 | -1/+14 |
|
|
| * | Revert last change. Found an application that was worse off with resize | Raymond Hettinger | 2004-03-15 | 1 | -13/+10 |
|
|
| * | list_resize() now has an "exact" option for bypassing the overallocation | Raymond Hettinger | 2004-03-14 | 1 | -10/+13 |
|
|
| * | Make PySequence_Fast_ITEMS public. (Thanks Skip.) | Raymond Hettinger | 2004-03-12 | 1 | -3/+3 |
|
|
| * | * Eliminate duplicate call to PyObject_Size(). | Raymond Hettinger | 2004-03-12 | 1 | -3/+3 |
|
|
| * | Use a new macro, PySequence_Fast_ITEMS to factor out code common to | Raymond Hettinger | 2004-03-12 | 1 | -16/+3 |
|
|
| * | Now that list.extend() is at the root of many list operations, it becomes | Raymond Hettinger | 2004-03-11 | 1 | -3/+9 |
|
|
| * | Eliminate a big block of duplicate code in PySequence_List() by | Raymond Hettinger | 2004-03-11 | 1 | -0/+6 |
|
|
| * | list_inplace_concat() is now expressed in terms of list_extend() which | Raymond Hettinger | 2004-03-11 | 1 | -14/+13 |
|
|
| * | Use memcpy() instead of memmove() when the buffers are known to be distinct. | Raymond Hettinger | 2004-03-10 | 1 | -2/+2 |
|
|
| * | Tidied up the implementations of reversed (including the custom ones | Raymond Hettinger | 2004-03-10 | 1 | -9/+23 |
|
|
| * | Optimize inner loops for subscript, repeat, and concat. | Raymond Hettinger | 2004-03-09 | 1 | -27/+39 |
|
|
| * | Optimize slice assignments. | Raymond Hettinger | 2004-03-09 | 1 | -16/+17 |
|
|
| * | Optimize tuple_slice() and make further improvements to list_slice() | Raymond Hettinger | 2004-03-08 | 1 | -14/+16 |
|
|
| * | Small optimizations for list_slice() and list_extend_internal(). | Raymond Hettinger | 2004-03-08 | 1 | -9/+20 |
|
|
| * | Keep the list.pop() optimization while restoring the many possibility | Raymond Hettinger | 2004-02-19 | 1 | -4/+2 |
|
|
| * | Double the speed of list.pop() which was spending most of its time parsing | Raymond Hettinger | 2004-02-17 | 1 | -2/+11 |
|
|
| * | Refactor list_extend() and list_fill() for gains in code size, memory | Raymond Hettinger | 2004-02-15 | 1 | -84/+71 |
|
|
| * | Fine tune the speed/space trade-off for overallocating small lists. | Raymond Hettinger | 2004-02-14 | 1 | -8/+3 |
|
|
| * | Fix missing return value. Spotted by Neal Norwitz | Raymond Hettinger | 2004-02-14 | 1 | -0/+1 |
|
|
| * | Optimize list.pop() for the common special case of popping off the end. | Raymond Hettinger | 2004-02-13 | 1 | -0/+5 |
|
|
| * | * Optimized list appends and pops by making fewer calls the underlying system | Raymond Hettinger | 2004-02-13 | 1 | -89/+68 |
|
|
| * | Revert change accidentally checked in as part of a whitespace normalization | Tim Peters | 2004-01-18 | 1 | -9/+5 |
|
|
| * | Whitespace normalization. | Tim Peters | 2004-01-18 | 1 | -5/+9 |
|
|
| * | Apply tuple/list pre-sizing optimization to a broader class of objects. | Raymond Hettinger | 2004-01-04 | 1 | -8/+4 |
|
|
| * | complete backout of listobject.c v2.171 | Andrew MacIntyre | 2003-12-28 | 1 | -4/+0 |
|
|
| * | Revert previous two checkins to repair test failure. | Jeremy Hylton | 2003-12-26 | 1 | -24/+6 |
|
|
| * | use the correct macro to access list size | Andrew MacIntyre | 2003-12-26 | 1 | -1/+1 |
|
|
| * | Performance of list([]) in 2.3 came up in a thread on comp.lang.python, | Andrew MacIntyre | 2003-12-25 | 1 | -6/+28 |
|
|
| * | Guido grants a Christmas wish: | Raymond Hettinger | 2003-12-17 | 1 | -37/+0 |
|
|
| * | * Added a new method flag, METH_COEXIST. | Raymond Hettinger | 2003-12-13 | 1 | -0/+5 |
|
|
| * | Fix memory error treatment correctly. Going to dsu_fail causes | Hye-Shik Chang | 2003-12-10 | 1 | -1/+1 |
|
|
| * | Fixes and tests for various "holding pointers when arbitrary Python code | Michael W. Hudson | 2003-12-04 | 1 | -35/+46 |
|
|
| * | Make sure the list.sort's decorate step unwinds itself before returning | Raymond Hettinger | 2003-11-28 | 1 | -2/+9 |
|
|
| * | Improve the reverse list iterator to free memory as soon as the iterator | Raymond Hettinger | 2003-11-08 | 1 | -1/+4 |
|
|
| * | Minor code fixup. Make sure that len reflects the current list size. | Raymond Hettinger | 2003-11-08 | 1 | -0/+1 |
|
|
| * | Optimize reversed(list) using a custom iterator. | Raymond Hettinger | 2003-11-07 | 1 | -2/+96 |
|
|
| * | Fix compiler warning about possible use of n without assignment. | Jeremy Hylton | 2003-11-03 | 1 | -5/+6 |
|
|
| * | Add list.sorted() classmethod. | Raymond Hettinger | 2003-10-29 | 1 | -0/+37 |
|
|
| * | Fix typo found by Neal Norwitz. | Raymond Hettinger | 2003-10-16 | 1 | -1/+1 |
|
|
| * | * list.sort() now supports three keyword arguments: cmp, key, and reverse. | Raymond Hettinger | 2003-10-16 | 1 | -5/+228 |
|
|
| * | My last fix left n used unitialized in tha a==b case. | Michael W. Hudson | 2003-08-15 | 1 | -1/+1 |
|
|
| * | Fix reference leak noted in test_types: | Michael W. Hudson | 2003-08-14 | 1 | -9/+9 |
|
|
| * | Use _PyEval_SliceIndex to handle list.index() calls with | Walter Dörwald | 2003-06-17 | 1 | -1/+3 |
|
|
| * | Fix sloppy index() implementation: | Guido van Rossum | 2003-06-17 | 1 | -2/+12 |
|
|
| * | SF #754014: list.index() should accept optional start, end arguments | Raymond Hettinger | 2003-06-17 | 1 | -5/+10 |
|
|
| * | SF bug #604716: faster [None]*n or []*n | Raymond Hettinger | 2003-05-21 | 1 | -0/+12 |
|
|
| * | SF bug #730296: Unexpected Changes in list Iterator | Raymond Hettinger | 2003-05-07 | 1 | -2/+0 |
|
|
| * | Patch #708604: Check more function results. Will backport to 2.2. | Martin v. Löwis | 2003-05-03 | 1 | -1/+8 |
|
|
