http://pierovggsterf4w5xplynqtl56srftc242l3g2xloqlty6nv7372xuyd.onion
After the changes, this involved a heterogeneous comparison , i.e., a comparison of different types. The trivial way to do this is a linear search, e.g., with std::find and a lambda or a range-based for . However, this seemed a frequent case to me, and I was curious to see if there was a way to still take advantage of the optimized algorithms provided by the containers.