Item 79: Choosing the right data structure is critical. Is memset too slow? Consider memunordered_set instead, to avoid the red-black tree in favor of hashing. See also memmap for key/value, mempriority_queue, memstack, etc. (thanks @jfbastien) #cplusplus #cpp #affectivecpp

@AffectiveCpp @jfbastien Use memvector for everything.

@AffectiveCpp @jfbastien Is a memset still bad when we consider large reallocation to resize the structure? Or hashing is still the best solution anyway?

@AffectiveCpp @jfbastien memunset is a faster version when you have to zero data

@AffectiveCpp @jfbastien memset in C is quite fast 🤪