williamr@2: //=======================================================================
williamr@2: // Copyright 2002 Indiana University.
williamr@2: // Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek
williamr@2: //
williamr@2: // Distributed under the Boost Software License, Version 1.0. (See
williamr@2: // accompanying file LICENSE_1_0.txt or copy at
williamr@2: // http://www.boost.org/LICENSE_1_0.txt)
williamr@2: //=======================================================================
williamr@2: 
williamr@2: #ifndef BOOST_BITSET_ADAPTOR_HPP
williamr@2: #define BOOST_BITSET_ADAPTOR_HPP
williamr@2: 
williamr@2:     template <class T, class Derived>
williamr@2:     struct bitset_adaptor {
williamr@2:       Derived& derived() { return static_cast<Derived&>(*this); }
williamr@2:       const Derived& derived() const { 
williamr@2:         return static_cast<const Derived&>(*this); 
williamr@2:       }
williamr@2:     };
williamr@2: 
williamr@2:     template <class T, class D, class V>
williamr@2:     bool set_contains(const bitset_adaptor<T,D>& s, const V& x) {
williamr@2:       return s.derived().test(x);
williamr@2:     }
williamr@2:     
williamr@2:     template <class T, class D>
williamr@2:     bool set_equal(const bitset_adaptor<T,D>& x,
williamr@2:                    const bitset_adaptor<T,D>& y) {
williamr@2:       return x.derived() == y.derived();
williamr@2:     }
williamr@2: 
williamr@2:     template <class T, class D>
williamr@2:     int set_lex_order(const bitset_adaptor<T,D>& x,
williamr@2:                       const bitset_adaptor<T,D>& y) {
williamr@2:       return compare_3way(x.derived(), y.derived());
williamr@2:     }
williamr@2: 
williamr@2:     template <class T, class D>
williamr@2:     void set_clear(bitset_adaptor<T,D>& x) {
williamr@2:       x.derived().reset();
williamr@2:     }
williamr@2: 
williamr@2:     template <class T, class D>
williamr@2:     bool set_empty(const bitset_adaptor<T,D>& x) {
williamr@2:       return x.derived().none();
williamr@2:     }
williamr@2: 
williamr@2:     template <class T, class D, class V>
williamr@2:     void set_insert(bitset_adaptor<T,D>& x, const V& a) {
williamr@2:       x.derived().set(a);
williamr@2:     }
williamr@2: 
williamr@2:     template <class T, class D, class V>
williamr@2:     void set_remove(bitset_adaptor<T,D>& x, const V& a) {
williamr@2:       x.derived().set(a, false);
williamr@2:     }
williamr@2:     
williamr@2:     template <class T, class D>    
williamr@2:     void set_intersect(const bitset_adaptor<T,D>& x,
williamr@2:                        const bitset_adaptor<T,D>& y,
williamr@2:                        bitset_adaptor<T,D>& z)
williamr@2:     {
williamr@2:       z.derived() = x.derived() & y.derived();
williamr@2:     }
williamr@2: 
williamr@2:     template <class T, class D>    
williamr@2:     void set_union(const bitset_adaptor<T,D>& x,
williamr@2:                    const bitset_adaptor<T,D>& y,
williamr@2:                    bitset_adaptor<T,D>& z)
williamr@2:     {
williamr@2:       z.derived() = x.derived() | y.derived();
williamr@2:     }
williamr@2: 
williamr@2:     template <class T, class D>    
williamr@2:     void set_difference(const bitset_adaptor<T,D>& x,
williamr@2:                         const bitset_adaptor<T,D>& y,
williamr@2:                         bitset_adaptor<T,D>& z)
williamr@2:     {
williamr@2:       z.derived() = x.derived() - y.derived();
williamr@2:     }
williamr@2: 
williamr@2:     template <class T, class D>    
williamr@2:     void set_compliment(const bitset_adaptor<T,D>& x,
williamr@2:                         bitset_adaptor<T,D>& z)
williamr@2:     {
williamr@2:       z.derived() = x.derived();
williamr@2:       z.derived().flip();
williamr@2:     }
williamr@2:     
williamr@2: #endif // BOOST_BITSET_ADAPTOR_HPP