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

It's not just memory savings, it's also about CPU cache. A frequently accessed tree/graph-like data structure can fit into L2/L3 cache so much easier if it uses 32-bit offsets instead of pointers.
 help



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

Search: