This. For the OP’s use case, replacing std::unordered_set<T> with CAtlMap<T,bool...

		Const-me on Jan 8, 2020 \| parent \| context \| favorite \| on: Finding unique items: hash vs. sort This. For the OP’s use case, replacing std::unordered_set<T> with CAtlMap<T,bool> improves the hashtable method performance by a factor of ~4, consistent over different input sizes.