Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

I’m curious what you mean. Surely there’s the overhead of unpredictable memory access?


Not 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.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: