Re: lua runtime operations with unbounded complexity

[hollyrosella@...]

Oops, not general table lookup, but interning recreated copies of those strings.

Holly

On 01/07/2012 at 5:23 PM, hollyrosella@hushmail.com wrote:
> For most people, the number of operations for a table lookup from those strings would be O(length of string)