2 ms·
Yes! I work on a dynamic compiler (also known as a JIT) for Ruby that will for example represent small hash maps as a single allocation of a linear consecutive
by chrisseaton 10y ago
Yes! I work on a dynamic compiler (also known as a JIT) for Ruby that will for example represent small hash maps as a single allocation of a linear consecutive set of keys and values. This helps further optimisations such as escape analysis, scalar replacement and loop unrolling, which in turn improve the effectiveness of inline caching and then inlining, splitting and specialisation. So after all that it can have quite an impact, beyond simply being more cache friendly.