// (C) Copyright 2008-2009 SDML (www.sdml.info)
//
// Use, modification and distribution is subject to the Boost Software
// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)

// Copyright Andrew Sutton 2007
//
// Use, modification and distribution are subject to the
// Boost Software License, Version 1.0. (See accompanying file
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

#ifndef BOOST_SETS_DYNAMIC_BITSET_UNION_HPP
#define BOOST_SETS_DYNAMIC_BITSET_UNION_HPP

#include <boost/dynamic_bitset.hpp>

namespace boost {
namespace sets {

    // Compute the union of s and t and store it in result.
    template <typename B, typename A>
    inline void
    union_(const dynamic_bitset<B,A>& s,
           const dynamic_bitset<B,A>& t,
           dynamic_bitset<B,A>& result)
    { result = s | t; }

    // Return the union of s and t.
    template <typename B, typename A>
    inline dynamic_bitset<B,A>
    union_(const dynamic_bitset<B,A>& s, const dynamic_bitset<B,A>& t)
    { return s | t; }

    // Add all elements in t to the set s.
    template <typename B, typename A>
    inline void
    union_inplace(dynamic_bitset<B,A>& s, const dynamic_bitset<B,A>& t)
    { s |= t; }

} /* namespace sets */
} /* namespace boost */

#endif