Worth noting that SO comment calls out that the linked line points to the code as it was in 2013 and that there have been changes since then: > The link into t

Worth noting that SO comment calls out that the linked line points to the code as it was in 2013 and that there have been changes since then: > The link into the V8 source code above is pretty old (2013), so I tried to find the modern equivalent. I didn't find a hard limit, but found several heuristics that decide between table lookups and tree (binary search) lookups (ia32, x86). When I plug in my numbers I don't quite get a borderline case where I found it, so I'm not sure this is the actual cause or whether there's another optimization not being triggered elsewhere.