title: Should I use std::set or std::unordered_set for a set of pointers?
body: <p>I have a set of pointers. In the first step, I insert data pointers, and in the second step, I iterate over the whole set and do something with the elements. The order is not important, I just need to avoid duplicates, which works fine with pointer comparison.</p>
  
  <p>My question is, whether it might be advantageous to use an unordered set for the same purpose. Is insertion faster for an unordered set?</p>