Steve Holden holdenweb.com> writes:
> Though it would seem redundant to create multiple copies of constant
> structures. Wouldn't there be some way to optimize this to allow each
> call to access the data from the same place?
It's just copying a table of pointers, so a bare memcpy() or its hand-
Antoine Pitrou <[EMAIL PROTECTED]> writes:
> Hi,
>
> J. Sievers gmail.com> writes:
>>
>> A sequence of code such as LOAD_CONST LOAD_FAST BINARY_ADD will, in
>> CPython, push some constant onto the stack, push some local onto the
>> stack, then pop both off the stack, add them and push the result
Antoine Pitrou wrote:
> Hi,
>
> J. Sievers gmail.com> writes:
>> A sequence of code such as LOAD_CONST LOAD_FAST BINARY_ADD will, in
>> CPython, push some constant onto the stack, push some local onto the
>> stack, then pop both off the stack, add them and push the result back
>> onto the stack.
Hi,
J. Sievers gmail.com> writes:
>
> A sequence of code such as LOAD_CONST LOAD_FAST BINARY_ADD will, in
> CPython, push some constant onto the stack, push some local onto the
> stack, then pop both off the stack, add them and push the result back
> onto the stack.
> Turning this into a superi