Arnaud Delobelle added the comment:
This reads a lot better. Perhaps change
(with name and object in separate positions)
to something like
(with name just below object on the stack)
--
___
Python tracker
<http://bugs.python.
Arnaud Delobelle added the comment:
Yes, you are correct. Reading this again, I don't think I should have used the
word "pushed" as it sounds like the effect of the opcode is to push stuff onto
the stack, whereas I was only trying to describe what is on the stack just
befor
New submission from Arnaud Delobelle :
The description of the opcode MAKE_FUNCTION in the dis module document is out
of date. It still describes the 2.X version of the opcode:
"""
MAKE_FUNCTION(argc)
Pushes a new function object on the stack. TOS is the code associated with the
New submission from Arnaud Delobelle :
The pprint function in the python 3.1 pprint module fails when
printing a dictionary containing more than one item and with one item
being a user-defined type. It seems pprint tries to sort the keys but
fails, (maybe because calling __lt__ on a user
Arnaud Delobelle added the comment:
Terry: I agree that augmented assignement should be described better in the
language reference. I guess that would warrant opening another issue?
However I tend to think that the term "in-place operation" is a good one.
BTW:
- the referenc
New submission from Arnaud Delobelle :
More detailed explanation of how in place operators work, and how they are
related to the operator module iadd, isub, ... functions.
Submitted following this message on python-list:
http://mail.python.org/pipermail/python-list/2010-August/1254243.html
Arnaud Delobelle <[EMAIL PROTECTED]> added the comment:
I must have diffed my patch against the wrong revision then, because I
haven't seen it. I had finished it last thursday, but have had a very
hectic few days and only found a few minutes to send it this evening.
Something mus
New submission from Arnaud Delobelle <[EMAIL PROTECTED]>:
The patch allows the following syntax for s set/frozenset:
* s.union(a, b, c,...)
* s.update(a, b, c,...)
* s.intersection(a, b, c,...)
* s.intersection_update(a, b, c,...)
By extension:
* set.union(a, b, c,...) # provided a is
