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

[Enrico Colombini <erix@...>]

On 22/09/2014 17.58, Luiz Henrique de Figueiredo wrote:
> 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)

In theory one would also have to consider the possibility of collisions.

--
  Enrico