Mathematical Models to Analyze Lua Hybrid Tables and Why They Need a Fix

Abstract

Lua (Ierusalimschy et al., 1996) is a well-known scripting language, popular among many programmers, most notably in the gaming industry. Remarkably, the only data-structuring mechanism in Lua are associative arrays, called tables. With Lua 5.0, the reference implementation of Lua introduced hybrid tables to implement tables using both a hashmap and a dynamically growing array combined together: the values associated with integer keys are stored in the array part, when suitable, everything else is stored in the hashmap. All this is transparent to the user, who gets a unique simple interface to handle tables. In this paper we carry out a theoretical analysis of the performance of Lua's tables, by considering various worst-case and probabilistic scenarios. In particular, we uncover some problematic situations for the simple probabilistic model where we add a new key with some fixed probability $p>\frac{1}{2}$ and delete a key with probability $1-p$: the cost of performing T such operations is proved to be $\Omega (T\log T)$ with high probability, where linear complexity is expected instead.

Long version of https://doi.org/10.1007/978-3-031-22105-7_34