If you find it difficult to find a set implementation, it will probably be very difficult for you to understand what you are reading when you eventually find it. STL is well known as one of the most complex bits of C ++ code to understand, and this is especially true for the more complex container classes that it provides (std :: find is actually quite easy to compare).
Instead, maybe an easier task is to look at the code for an example written for use by ordinary people, rather than the incomprehensible code found in the most common STL implementations. This looks promising , and compares pretty well to what std::set really does.
source share