2 ms·
The hash map I'm used to in C uses intrusive lists so it's pretty much allocation free. Would they fit the bill?
by rixed 3y ago
The hash map I'm used to in C uses intrusive lists so it's pretty much allocation free. Would they fit the bill?
- vanderZwan 3y ago"Pretty much" is great in most contexts, but in this one I think GP is pretty darn strict about having absolutely zero dynamic allocations
- rixed 3y agoBy "pretty much", I meant that the bucket lists are already allocation free thanks to intrusive lists; of course the hash table itself can uses allocation when it's resized, or not, depending on user choice. It's trivial to preallocate it or use an arena or whatever, since it's just a flat array.