| Commit message (Expand) | Author | Age | Files | Lines |
|---|
| * | Intern __name__. | Martin v. Löwis | 2004-03-23 | 1 | -1/+9 |
|
|
| * | Restored revision 2.87. | Armin Rigo | 2004-03-21 | 1 | -12/+5 |
|
|
| * | PyTuple_New(): vrbl i no longer referenced, so removed it (which kills | Tim Peters | 2004-03-21 | 1 | -1/+1 |
|
|
| * | This is the fastest I could get on Intel GCC. I kept the memset() in to clear | Armin Rigo | 2004-03-21 | 1 | -4/+11 |
|
|
| * | Changed file.name to be the object passed as the 'name' argument to file() | Nicholas Bastin | 2004-03-21 | 1 | -17/+21 |
|
|
| * | Fix typo in comment. | Raymond Hettinger | 2004-03-21 | 1 | -1/+1 |
|
|
| * | Add identity shortcut to PyObject_RichCompareBool. | Raymond Hettinger | 2004-03-21 | 1 | -1/+11 |
|
|
| * | recursive_isinstance(), recursive_issubclass(): New code here returned | Tim Peters | 2004-03-21 | 1 | -2/+2 |
|
|
| * | Limit the nesting depth of a tuple passed as the second argument to | Brett Cannon | 2004-03-20 | 1 | -9/+36 |
|
|
| * | Get rid of listextend_internal() and explain why the special case | Armin Rigo | 2004-03-20 | 1 | -51/+25 |
|
|
| * | memset() hunt continuing. This is a net win. | Armin Rigo | 2004-03-20 | 1 | -1/+3 |
|
|
| * | memset() with small memory sizes just kill us. | Armin Rigo | 2004-03-20 | 1 | -2/+4 |
|
|
| * | GCC was complaining that 'value' in dictiter_iternextvalue() wasn't | Guido van Rossum | 2004-03-20 | 1 | -5/+6 |
|
|
| * | PyFile_WriteObject(): some of the local variables are only used when | Fred Drake | 2004-03-19 | 1 | -0/+2 |
|
|
| * | Factor out a double lookup. | Raymond Hettinger | 2004-03-19 | 1 | -2/+1 |
|
|
| * | Make iterators length transparent where possible. | Raymond Hettinger | 2004-03-18 | 3 | -3/+42 |
|
|
| * | Make the new dictionary iterators transparent with respect to length. | Raymond Hettinger | 2004-03-18 | 1 | -4/+20 |
|
|
| * | Optimize dictionary iterators. | Raymond Hettinger | 2004-03-18 | 1 | -57/+202 |
|
|
| * | Dictionary optimizations: | Raymond Hettinger | 2004-03-17 | 1 | -24/+61 |
|
|
| * | Add missing decref | Raymond Hettinger | 2004-03-17 | 1 | -0/+1 |
|
|
| * | Fix typos and add some elaborations | Raymond Hettinger | 2004-03-15 | 1 | -4/+9 |
|
|
| * | Revert last change. Found an application that was worse off with resize | Raymond Hettinger | 2004-03-15 | 1 | -13/+10 |
|
|
| * | Eliminate an unnecessary test on a common code path. | Raymond Hettinger | 2004-03-15 | 1 | -3/+1 |
|
|
| * | 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 | 2 | -54/+12 |
|
|
| * | list_inplace_concat() is now expressed in terms of list_extend() which | Raymond Hettinger | 2004-03-11 | 1 | -14/+13 |
|
|
| * | Make buffer objects based on mutable objects (like array) safe. | Neil Schemenauer | 2004-03-11 | 1 | -82/+149 |
|
|
| * | Document one of the many problems with the buffer object. | Neil Schemenauer | 2004-03-11 | 1 | -2/+9 |
|
|
| * | Rename static functions, they should not have the _Py prefix. | Neil Schemenauer | 2004-03-11 | 1 | -11/+10 |
|
|
| * | 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 | 3 | -26/+56 |
|
|
| * | Eliminate the double reverse option. It's only use case | Raymond Hettinger | 2004-03-10 | 1 | -13/+1 |
|
|
| * | Optimize inner loops for subscript, repeat, and concat. | Raymond Hettinger | 2004-03-09 | 2 | -36/+59 |
|
|
| * | Optimize slice assignments. | Raymond Hettinger | 2004-03-09 | 1 | -16/+17 |
|
|
| * | The copy module now handles sets directly. The __copy__ methods are no | Raymond Hettinger | 2004-03-08 | 1 | -4/+0 |
|
|
| * | Optimize tuple_slice() and make further improvements to list_slice() | Raymond Hettinger | 2004-03-08 | 2 | -18/+25 |
|
|
| * | Small optimizations for list_slice() and list_extend_internal(). | Raymond Hettinger | 2004-03-08 | 1 | -9/+20 |
|
|
| * | Factor out code common to PyDict_Copy() and PyDict_Merge(). | Raymond Hettinger | 2004-03-08 | 1 | -20/+6 |
|
|
| * | SF #904720: dict.update should take a 2-tuple sequence like dict.__init_ | Raymond Hettinger | 2004-03-04 | 1 | -18/+24 |
|
|
| * | Oops, didn't mean to commit the removal of float_compare! | Michael W. Hudson | 2004-02-26 | 1 | -1/+1 |
|
|
| * | Pass a variable that actually exists to PyFPE_END_PROTECT in | Michael W. Hudson | 2004-02-26 | 1 | -2/+2 |
|
|
| * | "Fix" (for certain configurations of the planets, including | Michael W. Hudson | 2004-02-19 | 1 | -1/+35 |
|
|
| * | Keep the list.pop() optimization while restoring the many possibility | Raymond Hettinger | 2004-02-19 | 1 | -4/+2 |
|
|
| * | Oops. Return -1 to distinguish error from empty dict. | Jeremy Hylton | 2004-02-17 | 1 | -1/+1 |
|
|
| * | 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 |
|
|
