4 ms·
I’m curious what you mean. Surely there’s the overhead of unpredictable memory access?
by olivia-banks 1y ago
I’m curious what you mean. Surely there’s the overhead of unpredictable memory access?
- deredede 1y agoNot GP but bump allocation (OCaml's GC uses a bump allocator into the young heap) mitigates this somewhat, list nodes tend to be allocated near each other. It is worse than the guaranteed contiguous access patterns of a vector, but it's not completely scattered either.