Re: Memory woes

[Wim Couwenberg <w.couwenberg@...>]

> 4.  There *is* a way to create uncollectable cycles in Lua: if (k, v)
> is a key value pair in a weak valued table and v refers (directly or
> indirectly) back to k then that pair will never be removed from the
> table, even if v is the *only* reference to k.

Correction: this holds for *weak keyed tables* and not (as stated) for
*weak valued tables*.  Sorry.

--
Wim