lua-users home
lua-l archive

[Date Prev][Date Next][Thread Prev][Thread Next] [Date Index] [Thread Index]

> The bug is due to table rehashing might happen VERY often,
> and each rehash costs O(n), hence the quadratic time complexity.
> In a correct implementation it is wise to expect O(n) table operations done
> before the next rehash happens.

- Functionally, the behavior is exactly as expected.
- Hash tables can behave O(n) in worst-case situations.
- As you said, the manual says nothing about performance.

So, I don't see any bug here. (Of course, it would be better if we could
improve the perforance of tables.)

-- Roberto