Hacker News new | past | comments | ask | show | jobs | submit login

Wait, how does that work?



Think

    uint64_t buffer[1<<32];
and your “pointers” are indexes to that array:

    (void*)(buffer+index)


If some subset of pointers has a guaranteed alignment of 2^N bytes, then the least significant N bits are always zero, and don't need to be stored explicitly (only restored when dereferencing the pointer)




Join us for AI Startup School this June 16-17 in San Francisco!

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

Search: