I'm rather surprised they didn't optimize that to just iterate the hashtable directly.
You mean inline hv_iternext? The compiler will do that if appropriate. But that's unlikely since hv_iternext is quite big. It would make no sense to put a copy of that code in the function you showed.
How do you figure? It has to allocate the current size + 1.6MB of ram and initialize all of it.
No initialization is needed.
In reply to Re^12: Why does each() always re-evaluate its argument? ("for_list" )
by ikegami
in thread Why does each() always re-evaluate its argument?
by Darkwing
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |