"Victor A. Wagner Jr." <vawjr@rudbek.com> writes:
Absent that oddity, I suspect that you could rather easily overload some global operators to handle what you want using any of std::set, std::bitset, or boost::dynamic_bitset (the backwardness of the comparison operators would still bother me, though).
ADL looks into the namespace of the set first, so it will probably never work for generic code.
Hmmmm, maybe I should look more closely at the "unordered collections" (hash_set) proposal further and see if that correctly manages the set concept.
It doesn't, for your definition of "correct." The right way to do this, IMO, is with wrapper types: math::set<std::string> or whatever. -- Dave Abrahams Boost Consulting www.boost-consulting.com