Chris@16: // (C) Copyright Jeremy Siek 2001.
Chris@16: // Distributed under the Boost Software License, Version 1.0. (See
Chris@16: // accompanying file LICENSE_1_0.txt or copy at
Chris@16: // http://www.boost.org/LICENSE_1_0.txt)
Chris@16: 
Chris@16: #ifndef BOOST_SET_ADAPTOR_HPP
Chris@16: #define BOOST_SET_ADAPTOR_HPP
Chris@16: 
Chris@16: #include <set>
Chris@16: #include <boost/unordered_set.hpp>
Chris@16: 
Chris@16: namespace boost {
Chris@16: 
Chris@16:     template <class K, class C, class A, class T>
Chris@16:     bool set_contains(const std::set<K,C,A>& s, const T& x) {
Chris@16:       return s.find(x) != s.end();
Chris@16:     }
Chris@16:     
Chris@16:     template <class K, class H, class C, class A, class T>
Chris@16:     bool set_contains(const boost::unordered_set<K,H,C,A>& s, const T& x) {
Chris@16:       return s.find(x) != s.end();
Chris@16:     }
Chris@16:     
Chris@16:     template <class K, class C, class A>
Chris@16:     bool set_equal(const std::set<K,C,A>& x,
Chris@16:                    const std::set<K,C,A>& y)
Chris@16:     {
Chris@16:       return x == y;
Chris@16:     }
Chris@16: 
Chris@16:     // Not the same as lexicographical_compare_3way applied to std::set.
Chris@16:     // this is equivalent semantically to bitset::operator<()
Chris@16:     template <class K, class C, class A>
Chris@16:     int set_lex_order(const std::set<K,C,A>& x,
Chris@16:                       const std::set<K,C,A>& y)
Chris@16:     {
Chris@16:       typename std::set<K,C,A>::iterator
Chris@16:         xi = x.begin(), yi = y.begin(), xend = x.end(), yend = y.end();
Chris@16:       for (; xi != xend && yi != yend; ++xi, ++yi) {
Chris@16:         if (*xi < *yi)
Chris@16:           return 1;
Chris@16:         else if (*yi < *xi)
Chris@16:           return -1;
Chris@16:       }
Chris@16:       if (xi == xend)
Chris@16:         return (yi == yend) ? 0 : -1;
Chris@16:       else
Chris@16:         return 1;
Chris@16:     }
Chris@16: 
Chris@16:     template <class K, class C, class A>
Chris@16:     void set_clear(std::set<K,C,A>& x) {
Chris@16:       x.clear();
Chris@16:     }
Chris@16: 
Chris@16:     template <class K, class C, class A>
Chris@16:     bool set_empty(const std::set<K,C,A>& x) {
Chris@16:       return x.empty();
Chris@16:     }
Chris@16: 
Chris@16:     template <class K, class C, class A, class T>
Chris@16:     void set_insert(std::set<K,C,A>& x, const T& a) {
Chris@16:       x.insert(a);
Chris@16:     }
Chris@16: 
Chris@16:     template <class K, class C, class A, class T>
Chris@16:     void set_remove(std::set<K,C,A>& x, const T& a) {
Chris@16:       x.erase(a);
Chris@16:     }
Chris@16:     
Chris@16:     template <class K, class C, class A>
Chris@16:     void set_intersect(const std::set<K,C,A>& x,
Chris@16:                        const std::set<K,C,A>& y,
Chris@16:                        std::set<K,C,A>& z)
Chris@16:     {
Chris@16:       z.clear();
Chris@16:       std::set_intersection(x.begin(), x.end(),
Chris@16:                             y.begin(), y.end(),
Chris@16:                             std::inserter(z));
Chris@16:     }
Chris@16: 
Chris@16:     template <class K, class C, class A>
Chris@16:     void set_union(const std::set<K,C,A>& x,
Chris@16:                    const std::set<K,C,A>& y,
Chris@16:                    std::set<K,C,A>& z)
Chris@16:     {
Chris@16:       z.clear();
Chris@16:       std::set_union(x.begin(), x.end(),
Chris@16:                      y.begin(), y.end(),
Chris@16:                      std::inserter(z));
Chris@16:     }
Chris@16: 
Chris@16:     template <class K, class C, class A>
Chris@16:     void set_difference(const std::set<K,C,A>& x,
Chris@16:                         const std::set<K,C,A>& y,
Chris@16:                         std::set<K,C,A>& z)
Chris@16:     {
Chris@16:       z.clear();
Chris@16:       std::set_difference(x.begin(), x.end(),
Chris@16:                           y.begin(), y.end(),
Chris@16:                           std::inserter(z, z.begin()));
Chris@16:     }
Chris@16: 
Chris@16:     template <class K, class C, class A>
Chris@16:     bool set_subset(const std::set<K,C,A>& x,
Chris@16:                     const std::set<K,C,A>& y)
Chris@16:     {
Chris@16:       return std::includes(x.begin(), x.end(), y.begin(), y.end());
Chris@16:     }
Chris@16: 
Chris@16:     // Shit, can't implement this without knowing the size of the
Chris@16:     // universe.
Chris@16:     template <class K, class C, class A>
Chris@16:     void set_compliment(const std::set<K,C,A>& /*x*/,
Chris@16:                         std::set<K,C,A>& z)
Chris@16:     {
Chris@16:       z.clear();
Chris@16:       
Chris@16:     }
Chris@16:     
Chris@16: } // namespace boost    
Chris@16: 
Chris@16: #endif // BOOST_SET_ADAPTOR_HPP