4 ms·
I believe most of the most efficient hash table impls in cpp use open addressing (swisstables and similar). The ones in std:: don't mostly because of pointer st
by joshuamorton 3y ago
I believe most of the most efficient hash table impls in cpp use open addressing (swisstables and similar). The ones in std:: don't mostly because of pointer stability.
- deaddodo 3y agoThus the: > (but definitely in use out there) Additionally, I didn't say they were less efficient. I said they require more logical complexity and upfront storage to be efficient.