Very interesting. Where in the source were you looking?
pp_aassign in pp_hot.c. The ops (as seen in -MO=Concise) are found in pp_*.c. Prefix pp_ to the name seen in -MO=Concise and that's the name of the function that implements them.
It seems that different cases are handled quite differently
I don't know why you say that. The only difference I see is accounted for by the fact that post-increment (and post-decrement) return a copy of the variables original value. (They can't return the variable they are incrementing or decrementing because it no longer has the right value.)
This defies any simple explanation of cached lists generated at compile time
I don't know how you can say that. You haven't tested cached lists at all. You never use the same list twice.
In reply to Re^4: list assignment and undef
by ikegami
in thread list assignment and undef
by ig
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |