| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Patch #774665: Make Python LC_NUMERIC agnostic. | Martin v. Löwis | 2004-06-08 | 3 | -13/+20 |
| | | |||||
| * | whoops, I wanted that commented out by default, will add doc to Misc | Neal Norwitz | 2004-06-06 | 1 | -1/+1 |
| | | |||||
| * | SF bug 881641, make it easier to use valgrind | Neal Norwitz | 2004-06-06 | 1 | -4/+39 |
| | | |||||
| * | Reword message | Andrew M. Kuchling | 2004-06-05 | 1 | -1/+1 |
| | | |||||
| * | Fix exception wording | Andrew M. Kuchling | 2004-06-05 | 1 | -1/+1 |
| | | |||||
| * | Replaced arbitrary addend in tuple_hash with one that is known to generate | Raymond Hettinger | 2004-06-04 | 1 | -1/+9 |
| | | | | | many more prime multipliers and that performs well on collision tests. | ||||
| * | - SF #962502: Add two more methods for unicode type; width() and | Hye-Shik Chang | 2004-06-02 | 3 | -425/+563 |
| | | | | | | | | iswide() for east asian width manipulation. (Inspired by David Goodger, Reviewed by Martin v. Loewis) - Move _PyUnicode_TypeRecord.flags to the end of the struct so that no padding is added for UCS-4 builds. (Suggested by Martin v. Loewis) | ||||
| * | Patch #957398: Add public API for Generator Object/Type. | Martin v. Löwis | 2004-06-01 | 1 | -0/+129 |
| | | |||||
| * | SF bug #942952: Weakness in tuple hash | Raymond Hettinger | 2004-06-01 | 1 | -2/+3 |
| | | | | | | | | (Basic approach and test concept by Tim Peters.) * Improved the hash to reduce collisions. * Added the torture test to the test suite. | ||||
| * | Add weakref support to array.array and file objects. | Raymond Hettinger | 2004-05-31 | 1 | -2/+5 |
| | | |||||
| * | Make sets and deques weak referencable. | Raymond Hettinger | 2004-05-30 | 1 | -4/+8 |
| | | |||||
| * | Update docstring for dict.update() to match the new realities. | Walter Dörwald | 2004-05-28 | 1 | -1/+2 |
| | | |||||
| * | Remove float_compare as per | Michael W. Hudson | 2004-05-26 | 1 | -9/+1 |
| | | | | | | | [ 899109 ] 1==float('nan') which can now finally be closed, I think. | ||||
| * | SF bug #952866: "can't multiply sequence *by* non-int" | Raymond Hettinger | 2004-05-12 | 1 | -1/+1 |
| | | | | | Minor wording fix. | ||||
| * | Nits: | Raymond Hettinger | 2004-05-05 | 1 | -16/+9 |
| | | | | | | | | - Neatened the braces in PyList_New(). - Made sure "indexerr" was initialized to NULL. - Factored if blocks in PyList_Append(). - Made sure "allocated" is initialized in list_init(). | ||||
| * | SF patch #947476: Apply freelist technique to lists | Raymond Hettinger | 2004-05-05 | 1 | -4/+17 |
| | | | | | | Re-use list object bodies. Saves calls to malloc() and free() for faster list instantiation and deallocation. | ||||
| * | Two new public API functions, Py_IncRef and Py_DecRef. Useful for | Thomas Heller | 2004-04-22 | 1 | -0/+12 |
| | | | | | dynamic embedders of Python. | ||||
| * | * Add unittests for iterators that report their length | Raymond Hettinger | 2004-04-12 | 3 | -10/+29 |
| | | | | | | | * Document the differences between them * Fix corner cases covered by the unittests * Use Py_RETURN_NONE where possible for dictionaries | ||||
| * | Use Py_RETURN_NONE macro where applicable. | Raymond Hettinger | 2004-04-12 | 1 | -14/+8 |
| | | |||||
| * | Small refactoring saving one function() and eliminating some indirection. | Raymond Hettinger | 2004-04-12 | 1 | -11/+10 |
| | | | | | | * Applied app1() to listappend(). * Inlined ins() into its one remaining caller. | ||||
| * | * Specialize ins1() into app1() for appends. Saves several unnecessary | Raymond Hettinger | 2004-04-12 | 1 | -6/+36 |
| | | | | | | | steps and further improves the speed of list append. * Add guards to the list iterator length method to handle corner cases. | ||||
| * | SF Patch #926375: Remove a useless UTF-16 support code that is never | Hye-Shik Chang | 2004-04-06 | 1 | -18/+3 |
| | | | | | been used. (Suggested by Martin v. Loewis) | ||||
| * | Improve previous checkin to use a slot check instead of equivalent | Raymond Hettinger | 2004-04-05 | 1 | -1/+2 |
| | | | | | attribute name lookup. | ||||
| * | Improve accuracy of sequence and mapping checks. | Raymond Hettinger | 2004-04-04 | 1 | -2/+8 |
| | | |||||
| * | If a file is opened with an explicit buffer size >= 1, repeated | Andrew MacIntyre | 2004-04-04 | 1 | -0/+2 |
| | | | | | | | | | close() calls would attempt to free() the buffer already free()ed on the first close(). [bug introduced with patch #788249] Making sure that the buffer is free()ed in file object deallocation is a belt-n-braces bit of insurance against a memory leak. | ||||
| * | Get rid of gcc warning. | Hye-Shik Chang | 2004-03-25 | 1 | -1/+2 |
| | | |||||
| * | Correct code to advance ptr to be well-formed C. | Martin v. Löwis | 2004-03-25 | 1 | -1/+1 |
| | | |||||
| * | Ensure super() lookup of descriptor from classmethod works (SF #743627) | Phillip J. Eby | 2004-03-25 | 1 | -1/+8 |
| | | |||||
| * | 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 |
| | | | | | off a new compiler wng under MSVC6). | ||||
| * | 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 |
| | | | | | | | | | the newly created tuples, but tuples added in the freelist are now cleared in tupledealloc already (which is very cheap, because we are already Py_XDECREF'ing all elements anyway). Python should have a standard Py_ZAP macro like ZAP in pystate.c. | ||||
| * | Changed file.name to be the object passed as the 'name' argument to file() | Nicholas Bastin | 2004-03-21 | 1 | -17/+21 |
| | | | | | Fixes SF Bug #773356 | ||||
| * | 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 |
| | | | | | | NULL in case of error, but the functions are declared to return int. MSVC 6 properly complains about that. Return -1 on error instead. | ||||
| * | Limit the nesting depth of a tuple passed as the second argument to | Brett Cannon | 2004-03-20 | 1 | -9/+36 |
| | | | | | isinstance() or issubclass() to the recursion limit of the interpreter. | ||||
| * | Get rid of listextend_internal() and explain why the special case | Armin Rigo | 2004-03-20 | 1 | -51/+25 |
| | | | | | 'a.extend(a)' isn't so special anyway. | ||||
| * | 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 |
| | | | | | | | necessarily always set before used. Between Tim, Armin & me we couldn't prove GCC wrong, so we decided to fix the algorithm. This version is Armin's. | ||||
| * | PyFile_WriteObject(): some of the local variables are only used when | Fred Drake | 2004-03-19 | 1 | -0/+2 |
| | | | | | Py_USING_UNICODE is defined | ||||
| * | 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 |
| | | | | | | | This gives another 30% speedup for operations such as map(func, d.iteritems()) or list(d.iteritems()) which can both take advantage of length information when provided. | ||||
| * | Optimize dictionary iterators. | Raymond Hettinger | 2004-03-18 | 1 | -57/+202 |
| | | | | | | | | | | | | | | | | | | | * Split into three separate types that share everything except the code for iternext. Saves run time decision making and allows each iternext function to be specialized. * Inlined PyDict_Next(). In addition to saving a function call, this allows a redundant test to be eliminated and further specialization of the code for the unique needs of each iterator type. * Created a reusable result tuple for iteritems(). Saves the malloc time for tuples when the previous result was not kept by client code (this is the typical use case for iteritems). If the client code does keep the reference, then a new tuple is created. Results in a 20% to 30% speedup depending on the size and sparsity of the dictionary. | ||||
| * | Dictionary optimizations: | Raymond Hettinger | 2004-03-17 | 1 | -24/+61 |
| | | | | | | | | | | | | | * Factored constant structure references out of the inner loops for PyDict_Next(), dict_keys(), dict_values(), and dict_items(). Gave measurable speedups to each (the improvement varies depending on the sparseness of the dictionary being measured). * Added a freelist scheme styled after that for tuples. Saves around 80% of the calls to malloc and free. About 10% of the time, the previous dictionary was completely empty; in those cases, the dictionary initialization with memset() can be skipped. | ||||
| * | 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 |
| | | | | | | exact turned on. The tiny space savings wasn't worth the additional time and code. | ||||
 |
index : cpython.git | |
| https://github.com/python/cpython.git |
| summaryrefslogtreecommitdiffstats |