>>>>> "M" == Mathieu Bouchard <matju / cam.org> writes:

M> Recently declared "dynamic" variables are faster than early dynamics,
M> but "local" (outermost) are faster. It seems strange... 

 It's normal when you see the algorithm :-)

M> Especially the idea of a linked list of variables.

 Perhaps you can manage 'dynamic' variable like 'local' variable (perl
 manage the 'my' variable like this, I think) but I'm not sure that you'll 
 really see a difference in a *real* program. 

 This will not solve the original problem, because even in this case, I
 think that ruby (as it is actually) will need to re-write the nodes if it
 find a dynamic variable after its block-scope.


Guy Decoux