Re: How can I deep-compare 2 Lua tables, which may or may not have tables as keys?

[Luiz Henrique de Figueiredo <lhf@...>]

> >Using a message digest for the table contents (ordered keys + values)
> >would probably work just fine. I can't see how to avoid ordering the
> >keys, though.
> 
> I guess it would create less garbage and would certainly use less memory 
> than serialization; do you think it could also be faster, in pure Lua? 
> (just idle curiosity)

Only testing can tell. However, since there are bindings for C code that
computes message digests, you might as well use that.