summaryrefslogtreecommitdiffstats
path: root/Objects
Commit message (Collapse)AuthorAgeFilesLines
* Remove a redundant XINCREF(value). This caused the reference count ofGuido van Rossum1997-04-031-1/+0
| | | | | all locals to be upped by one when `from <module> import <whatever>' was executed.
* Several fixes reported by jim F.Guido van Rossum1997-04-021-31/+28
|
* Get rid of .conj pseudo data attribute for complex numbers.Guido van Rossum1997-04-011-5/+2
| | | | Add __members__ attribute.
* Add clear() method to dictionary objects.Guido van Rossum1997-03-212-0/+26
|
* New long_lshift, without restriction on size of shift count, by Tim Peters.Guido van Rossum1997-03-161-26/+22
| | | | This makes it possible to write 1L<<1000000, memory permitting.
* New form of PyFPE_END_PROTECT macro.Guido van Rossum1997-03-143-17/+17
|
* Add casts to CMPERROR macro to silence SunPro compiler warnings aboutGuido van Rossum1997-03-051-1/+1
| | | | integer overflow in << operator.
* Changes for Lee Busby's SIGFPE patch set.Guido van Rossum1997-02-143-10/+63
| | | | Surround various f.p. operations with PyFPE_{START,END}_PROTECT macros.
* Keep gcc -Wall happy.Guido van Rossum1997-02-141-2/+2
|
* Slight tweak: in string_hash(), if the hash hasn't been computed yet,Guido van Rossum1997-02-141-0/+5
| | | | | and if there's a pointer to an interned version of the string, use its hash and store its hash in this object, rather than recomputing it.
* Kill all local variables when the frame is deallocated (moved hereGuido van Rossum1997-02-141-1/+11
| | | | | | from ceval.c). Wrapped a long line.
* Small lookmapping nits:Guido van Rossum1997-01-292-10/+12
| | | | | | - remove bogus initialization using uninitialized i - derive initial incr from hash - copy mp->ma_table into a local variable
* Fix bug reported by Per Lindqvist: "%#06x" % 1 stuck the 0 paddingGuido van Rossum1997-01-291-1/+13
| | | | in front of the 0x, like such: "0000x1".
* Final three poly table entries corrected by Tim Peters.Guido van Rossum1997-01-292-62/+60
| | | | Reindented the whole table.
* Changed the lookup algorithm again, based on Reimer Behrends's post.Guido van Rossum1997-01-282-228/+202
| | | | | | | | | The table size is now constrained to be a power of two, and we use a variable increment based on GF(2^n)-{0} (not that I have the faintest idea what that is :-) which helps avoid the expensive '%' operation. Some of the entries in the table of polynomials have been modified according to a post by Tim Peters.
* When a recycled frame has more local+stack slots than needed,Guido van Rossum1997-01-241-2/+4
| | | | | give the extra slots to the stack rather than than forgetting about them (this reduces the number of reallocs done).
* Forget keeping track of whether a dictionary contains all internedGuido van Rossum1997-01-232-178/+110
| | | | | string keys. Just doing a pointer compare before the string compare (in fact before the hash compare!) is just as fast.
* Added PyCObject_Import.Guido van Rossum1997-01-221-18/+39
|
* Don't use static buffers internally for formatstring().Guido van Rossum1997-01-211-25/+26
|
* Bugfix: remove ref to fast before it's defined.Guido van Rossum1997-01-201-1/+1
|
* Changes that appear to give another 12% speedup.Guido van Rossum1997-01-201-87/+55
| | | | | | | | | | | | Rather than allocating a list object for the fast locals and another (extensible one) for the value stack and allocating the block stack dynamically, allocate the block stack with a fixed size (CO_MAXBLOCKS from compile.h), and stick the locals and value stack at the end of the object (this is now possible since the stack size is known beforehand). Get rid of the owner field and the nvalues argument -- it is available in the code object, like nlocals. This requires small changes in ceval.c only.
* Intern the various string objects created to speed up lookups.Guido van Rossum1997-01-181-25/+25
|
* Intern the strings "__builtins__".Guido van Rossum1997-01-181-1/+1
|
* Intern the strings created in getattr() and setattr().Guido van Rossum1997-01-181-2/+2
|
* String interning.Guido van Rossum1997-01-183-32/+285
|
* Comment out extend_stack() -- it is no longer needed.Guido van Rossum1997-01-171-0/+2
|
* Rewrote lookmapping() according to suggestions by Jyrki Alakuijala.Guido van Rossum1997-01-162-42/+142
|
* Increased buffer sizes used by hex() and oct() -- on 64-bit or 128-bitGuido van Rossum1997-01-141-2/+2
| | | | machines, the string may get longer than 20 characters!
* Changed hex() and oct() again, to never emit a '-' sign.Guido van Rossum1997-01-121-7/+2
|
* New, better hash for floating point and complexGuido van Rossum1997-01-112-6/+41
|
* Subtle change to hex/oct formatting so the largest negative numberGuido van Rossum1997-01-101-2/+2
| | | | does not receive a minus sign.
* Fix overflow test for multiply to catch some cases it missed.Guido van Rossum1997-01-061-2/+4
| | | | Added warning about dependency of float/complex hash on int hash.
* Added PyLong_FromUnsignedLong() and PyLong_AsUnsignedLong().Guido van Rossum1997-01-031-0/+56
|
* Removed all traces of accessobject.c.Guido van Rossum1996-12-252-374/+2
|
* PySequence_Index(): set exception when object is not found inBarry Warsaw1996-12-181-0/+1
| | | | | | | | | sequence, otherwise operator.indexOf([4, 3, 2, 1], 9) would raise a SystemError! Note: it might be wise to double check all these functions. I haven't done that yet.
* Better tuple hash function.Guido van Rossum1996-12-161-1/+1
|
* Change comment about MINSIZE -- 10 is optimal for Python.Guido van Rossum1996-12-161-3/+6
|
* Some more tuning of quicksort: use pointers instead of indexing.Guido van Rossum1996-12-111-54/+60
|
* Added new quicksort implementation, tailored to sorting arrays ofGuido van Rossum1996-12-101-0/+227
| | | | | | | | object pointers. Should be a bit faster than the C library's qsort(), and doesn't have the prohibition on recursion that Solaris qsort() has in the threaded version of their C library. Thanks to discussions with Tim Peters.
* Add const to error and newstring functionsGuido van Rossum1996-12-101-2/+2
|
* Fix core dump from pow(x,y,0).Guido van Rossum1996-12-061-7/+9
| | | | Make gcc -Wall happy.
* Make gcc -Wall happyGuido van Rossum1996-12-055-20/+6
|
* Fix newlongobject so it will work for 64-bit as well as 32-bit hardwareGuido van Rossum1996-12-051-12/+15
| | | | | | (although for 32-bit hardware it's a bit slower than it was). Make gcc -Wall happy.
* Experimental new implementation of dictionary comparison. ThisGuido van Rossum1996-12-052-0/+126
| | | | | | | defines that a shorter dictionary is always smaller than a longer one. For dictionaries of the same size, the smallest differing element determines the outcome (which yields the same results as before, without explicit sorting).
* Make gcc -Wall happy.Guido van Rossum1996-12-051-0/+4
|
* Better implementation of PyCObject_AsVoidPtr().Guido van Rossum1996-12-051-7/+18
|
* Yet more elaborate message for exception in __del__.Guido van Rossum1996-12-051-11/+23
| | | | Make gcc -Wall happy.
* Added missing PySequence_List.Guido van Rossum1996-12-051-15/+44
| | | | | Correct typo in error msg (expec[t]ed). Make gcc -Wall happy.
* Make Py_ReturnNullError() statis as it should be.Guido van Rossum1996-11-111-1/+1
|
* Only call sq_length in Sequence_GetItem for negative index.Guido van Rossum1996-11-091-4/+6
|
generated by cgit v0.12 at 2024-12-05 21:41:07 (GMT)