[Cython] Visitors and compiling Cython in Cython

[Stefan Behnel]

Hi,

Dag Sverre Seljebotn wrote:
> Stefan Behnel wrote:
>> You could use lazy initialisation. Just look up a node type in the dict
>> (which is fast) and if it's not in there yet, walk it's base types (adding
>> each one to the dict) until there is one that already is in the dict, which
>> then determines the result for the lookup and for the newly added base types.
> 
> Sure, sure, that's already being done and in fact you'll see that 
> *exact* procedure in my patch! :-)

Obviously. :)


> The issue Gary has is indeed with raw 
> dict lookup performance. (Consider that this will be between 10 and 50 
> times to every single node in the tree of a file.)

Unless you annotate a parse tree with all its transformers in one traversal step.

Stefan