2013-08-08 09:54:33 +00:00
|
|
|
/*=============================================================================
|
2014-01-08 07:48:12 +00:00
|
|
|
Copyright (c) 2011-2014 Bolero MURAKAMI
|
2013-08-08 09:54:33 +00:00
|
|
|
https://github.com/bolero-MURAKAMI/Sprout
|
|
|
|
|
|
|
|
Distributed under 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)
|
|
|
|
=============================================================================*/
|
2012-06-20 16:40:38 +00:00
|
|
|
#ifndef SPROUT_BITSET_BITSET_HPP
|
|
|
|
#define SPROUT_BITSET_BITSET_HPP
|
|
|
|
|
|
|
|
#include <climits>
|
|
|
|
#include <string>
|
|
|
|
#include <stdexcept>
|
2013-03-21 11:00:42 +00:00
|
|
|
#include <type_traits>
|
2012-06-20 16:40:38 +00:00
|
|
|
#include <sprout/config.hpp>
|
2014-04-30 07:30:26 +00:00
|
|
|
#include <sprout/workaround/std/cstddef.hpp>
|
2013-11-22 12:11:08 +00:00
|
|
|
#include <sprout/detail/sizeof.hpp>
|
2012-06-20 16:40:38 +00:00
|
|
|
#include <sprout/container/traits.hpp>
|
|
|
|
#include <sprout/iterator/index_iterator.hpp>
|
2013-02-04 14:10:24 +00:00
|
|
|
#include <sprout/functional/hash.hpp>
|
2013-01-11 19:08:44 +00:00
|
|
|
#include <sprout/algorithm/all_of.hpp>
|
|
|
|
#include <sprout/algorithm/any_of.hpp>
|
|
|
|
#include <sprout/algorithm/find_if.hpp>
|
|
|
|
#include <sprout/algorithm/equal.hpp>
|
2012-06-20 16:40:38 +00:00
|
|
|
#include <sprout/algorithm/fixed/transform.hpp>
|
|
|
|
#include <sprout/algorithm/fixed/fill.hpp>
|
2013-11-12 11:44:27 +00:00
|
|
|
#include <sprout/algorithm/cxx14/copy.hpp>
|
|
|
|
#include <sprout/algorithm/cxx14/move.hpp>
|
2013-10-31 09:57:41 +00:00
|
|
|
#include <sprout/algorithm/cxx14/fill.hpp>
|
2013-01-11 19:08:44 +00:00
|
|
|
#include <sprout/numeric/accumulate.hpp>
|
2012-06-20 16:40:38 +00:00
|
|
|
#include <sprout/operation/fixed/set.hpp>
|
|
|
|
#include <sprout/utility/forward.hpp>
|
2013-11-12 11:44:27 +00:00
|
|
|
#include <sprout/utility/move.hpp>
|
2012-06-22 13:56:25 +00:00
|
|
|
#include <sprout/bit/operation.hpp>
|
2012-11-15 09:36:55 +00:00
|
|
|
#include <sprout/math/comparison.hpp>
|
2012-06-20 16:40:38 +00:00
|
|
|
#include HDR_FUNCTIONAL_SSCRISK_CEL_OR_SPROUT
|
|
|
|
|
|
|
|
namespace sprout {
|
|
|
|
namespace detail {
|
|
|
|
struct base_bitset_from_words_construct_tag {};
|
|
|
|
|
|
|
|
template<std::size_t N>
|
|
|
|
class base_bitset {
|
|
|
|
public:
|
|
|
|
typedef unsigned long word_type;
|
|
|
|
typedef word_type value_type;
|
2013-02-18 17:49:10 +00:00
|
|
|
typedef sprout::index_iterator<base_bitset&, true> iterator;
|
|
|
|
typedef sprout::index_iterator<base_bitset const&, true> const_iterator;
|
2012-06-20 16:40:38 +00:00
|
|
|
typedef value_type& reference;
|
|
|
|
typedef value_type const& const_reference;
|
|
|
|
typedef std::size_t size_type;
|
|
|
|
typedef std::ptrdiff_t difference_type;
|
|
|
|
SPROUT_STATIC_CONSTEXPR std::size_t static_size = N;
|
|
|
|
public:
|
|
|
|
struct are_all_pred {
|
|
|
|
public:
|
|
|
|
SPROUT_CONSTEXPR bool
|
|
|
|
operator()(word_type t) const SPROUT_NOEXCEPT {
|
|
|
|
return t == ~static_cast<word_type>(0);
|
|
|
|
}
|
|
|
|
};
|
|
|
|
struct is_any_pred {
|
|
|
|
public:
|
|
|
|
SPROUT_CONSTEXPR bool
|
|
|
|
operator()(word_type t) const SPROUT_NOEXCEPT {
|
|
|
|
return t != static_cast<word_type>(0);
|
|
|
|
}
|
|
|
|
};
|
|
|
|
struct to_ulong_pred {
|
|
|
|
public:
|
|
|
|
SPROUT_CONSTEXPR bool
|
|
|
|
operator()(word_type t) const SPROUT_NOEXCEPT {
|
|
|
|
return t != 0;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
struct count_op {
|
|
|
|
public:
|
|
|
|
SPROUT_CONSTEXPR std::size_t
|
|
|
|
operator()(std::size_t lhs, std::size_t rhs) const SPROUT_NOEXCEPT {
|
2012-06-22 13:56:25 +00:00
|
|
|
return lhs + sprout::popcount(rhs);
|
2012-06-20 16:40:38 +00:00
|
|
|
}
|
|
|
|
};
|
|
|
|
public:
|
|
|
|
static SPROUT_CONSTEXPR std::size_t
|
|
|
|
whichword(std::size_t pos) SPROUT_NOEXCEPT {
|
2013-03-21 13:11:40 +00:00
|
|
|
return pos / (CHAR_BIT * sprout::detail::sizeof_<unsigned long>::value);
|
2012-06-20 16:40:38 +00:00
|
|
|
}
|
|
|
|
static SPROUT_CONSTEXPR std::size_t
|
|
|
|
whichbyte(std::size_t pos) SPROUT_NOEXCEPT {
|
2013-03-21 13:11:40 +00:00
|
|
|
return (pos % (CHAR_BIT * sprout::detail::sizeof_<unsigned long>::value)) / CHAR_BIT;
|
2012-06-20 16:40:38 +00:00
|
|
|
}
|
|
|
|
static SPROUT_CONSTEXPR std::size_t
|
|
|
|
whichbit(std::size_t pos) SPROUT_NOEXCEPT {
|
2013-03-21 13:11:40 +00:00
|
|
|
return pos % (CHAR_BIT * sprout::detail::sizeof_<unsigned long>::value);
|
2012-06-20 16:40:38 +00:00
|
|
|
}
|
|
|
|
static SPROUT_CONSTEXPR word_type
|
|
|
|
maskbit(std::size_t pos) SPROUT_NOEXCEPT {
|
|
|
|
return (static_cast<word_type>(1)) << whichbit(pos);
|
|
|
|
}
|
|
|
|
private:
|
|
|
|
word_type w_[N];
|
|
|
|
private:
|
|
|
|
SPROUT_CONSTEXPR std::size_t
|
|
|
|
find_first_impl(
|
|
|
|
std::size_t not_found, const_iterator first, const_iterator last,
|
|
|
|
std::size_t i = 0
|
|
|
|
) const SPROUT_NOEXCEPT
|
|
|
|
{
|
|
|
|
return first == last ? not_found
|
|
|
|
: *first != static_cast<word_type>(0)
|
2013-03-21 13:11:40 +00:00
|
|
|
? i * (CHAR_BIT * sprout::detail::sizeof_<unsigned long>::value) + sprout::ctz(*first)
|
2012-06-20 16:40:38 +00:00
|
|
|
: find_first_impl(not_found, first + 1, last, i + 1)
|
|
|
|
;
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR std::size_t
|
|
|
|
find_next_impl_2(
|
|
|
|
std::size_t not_found, const_iterator first, const_iterator last,
|
|
|
|
std::size_t i
|
|
|
|
) const SPROUT_NOEXCEPT
|
|
|
|
{
|
|
|
|
return first == last ? not_found
|
|
|
|
: *first != static_cast<word_type>(0)
|
2013-03-21 13:11:40 +00:00
|
|
|
? i * (CHAR_BIT * sprout::detail::sizeof_<unsigned long>::value) + sprout::ctz(*first)
|
2012-06-20 16:40:38 +00:00
|
|
|
: find_next_impl_2(not_found, first + 1, last)
|
|
|
|
;
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR std::size_t
|
|
|
|
find_next_impl_1(std::size_t not_found, std::size_t i, word_type thisword) const SPROUT_NOEXCEPT {
|
|
|
|
return thisword != static_cast<word_type>(0)
|
2013-03-21 13:11:40 +00:00
|
|
|
? i * (CHAR_BIT * sprout::detail::sizeof_<unsigned long>::value) + sprout::ctz(thisword)
|
2012-06-20 16:40:38 +00:00
|
|
|
: find_next_impl_2(not_found, begin() + (i + 1), end(), i + 1)
|
|
|
|
;
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR std::size_t
|
|
|
|
find_next_impl(std::size_t prev, std::size_t not_found, std::size_t i) const SPROUT_NOEXCEPT {
|
|
|
|
return find_next_impl_1(not_found, i, w_[i] & ~static_cast<word_type>(0) << whichbit(prev));
|
|
|
|
}
|
|
|
|
template<sprout::index_t... Indexes>
|
|
|
|
SPROUT_CONSTEXPR base_bitset<N>
|
|
|
|
do_left_shift_impl_2(
|
|
|
|
std::size_t wshift, std::size_t offset, std::size_t sub_offset,
|
|
|
|
sprout::index_tuple<Indexes...>
|
|
|
|
) const SPROUT_NOEXCEPT
|
|
|
|
{
|
|
|
|
return base_bitset(
|
|
|
|
sprout::detail::base_bitset_from_words_construct_tag(),
|
2012-11-15 09:36:55 +00:00
|
|
|
(sprout::math::greater(Indexes, wshift)
|
2012-06-20 16:40:38 +00:00
|
|
|
? (w_[Indexes - wshift] << offset) | (w_[Indexes - wshift - 1] >> sub_offset)
|
|
|
|
: Indexes == wshift ? w_[0] << offset
|
|
|
|
: static_cast<word_type>(0)
|
|
|
|
)...
|
|
|
|
);
|
|
|
|
}
|
|
|
|
template<sprout::index_t... Indexes>
|
|
|
|
SPROUT_CONSTEXPR base_bitset<N>
|
|
|
|
do_left_shift_impl_1(
|
2013-07-22 13:00:09 +00:00
|
|
|
std::size_t wshift, std::size_t,
|
2012-06-20 16:40:38 +00:00
|
|
|
sprout::index_tuple<Indexes...>
|
|
|
|
) const SPROUT_NOEXCEPT
|
|
|
|
{
|
|
|
|
return base_bitset(
|
|
|
|
sprout::detail::base_bitset_from_words_construct_tag(),
|
2012-11-15 09:36:55 +00:00
|
|
|
(sprout::math::greater_equal(Indexes, wshift) ? w_[Indexes - wshift]
|
2012-06-20 16:40:38 +00:00
|
|
|
: static_cast<word_type>(0)
|
|
|
|
)...
|
|
|
|
);
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR base_bitset<N>
|
|
|
|
do_left_shift_impl(std::size_t wshift, std::size_t offset) const SPROUT_NOEXCEPT {
|
|
|
|
return offset == 0
|
|
|
|
? do_left_shift_impl_1(
|
|
|
|
wshift, offset,
|
2013-03-31 06:14:10 +00:00
|
|
|
sprout::make_index_tuple<N>::make()
|
2012-06-20 16:40:38 +00:00
|
|
|
)
|
|
|
|
: do_left_shift_impl_2(
|
2013-03-21 13:11:40 +00:00
|
|
|
wshift, offset, (CHAR_BIT * sprout::detail::sizeof_<unsigned long>::value) - offset,
|
2013-03-31 06:14:10 +00:00
|
|
|
sprout::make_index_tuple<N>::make()
|
2012-06-20 16:40:38 +00:00
|
|
|
)
|
|
|
|
;
|
|
|
|
}
|
|
|
|
template<sprout::index_t... Indexes>
|
|
|
|
SPROUT_CONSTEXPR base_bitset<N>
|
|
|
|
do_right_shift_impl_2(
|
|
|
|
std::size_t wshift, std::size_t offset, std::size_t limit, std::size_t sub_offset,
|
|
|
|
sprout::index_tuple<Indexes...>
|
|
|
|
) const SPROUT_NOEXCEPT
|
|
|
|
{
|
|
|
|
return base_bitset(
|
|
|
|
sprout::detail::base_bitset_from_words_construct_tag(),
|
2012-11-15 09:36:55 +00:00
|
|
|
(sprout::math::less(Indexes, limit)
|
2012-06-20 16:40:38 +00:00
|
|
|
? (w_[Indexes + wshift] >> offset) | (w_[Indexes + wshift + 1] << sub_offset)
|
|
|
|
: Indexes == limit ? w_[N-1] >> offset
|
|
|
|
: static_cast<word_type>(0)
|
|
|
|
)...
|
|
|
|
);
|
|
|
|
}
|
|
|
|
template<sprout::index_t... Indexes>
|
|
|
|
SPROUT_CONSTEXPR base_bitset<N>
|
|
|
|
do_right_shift_impl_1(
|
2013-07-22 13:00:09 +00:00
|
|
|
std::size_t wshift, std::size_t, std::size_t limit,
|
2012-06-20 16:40:38 +00:00
|
|
|
sprout::index_tuple<Indexes...>
|
|
|
|
) const SPROUT_NOEXCEPT
|
|
|
|
{
|
|
|
|
return base_bitset(
|
|
|
|
sprout::detail::base_bitset_from_words_construct_tag(),
|
2012-11-15 09:36:55 +00:00
|
|
|
(sprout::math::less_equal(Indexes, limit) ? w_[Indexes + wshift]
|
2012-06-20 16:40:38 +00:00
|
|
|
: static_cast<word_type>(0)
|
|
|
|
)...
|
|
|
|
)
|
|
|
|
;
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR base_bitset<N>
|
|
|
|
do_right_shift_impl(std::size_t wshift, std::size_t offset, std::size_t limit) const SPROUT_NOEXCEPT {
|
|
|
|
return offset == 0
|
|
|
|
? do_right_shift_impl_1(
|
|
|
|
wshift, offset, limit,
|
2013-03-31 06:14:10 +00:00
|
|
|
sprout::make_index_tuple<N>::make()
|
2012-06-20 16:40:38 +00:00
|
|
|
)
|
|
|
|
: do_right_shift_impl_2(
|
2013-03-21 13:11:40 +00:00
|
|
|
wshift, offset, limit, (CHAR_BIT * sprout::detail::sizeof_<unsigned long>::value) - offset,
|
2013-03-31 06:14:10 +00:00
|
|
|
sprout::make_index_tuple<N>::make()
|
2012-06-20 16:40:38 +00:00
|
|
|
)
|
|
|
|
;
|
|
|
|
}
|
|
|
|
public:
|
|
|
|
SPROUT_CONSTEXPR base_bitset() SPROUT_NOEXCEPT
|
|
|
|
: w_()
|
|
|
|
{}
|
2013-11-12 11:44:27 +00:00
|
|
|
base_bitset(base_bitset<N> const&) = default;
|
2012-06-20 16:40:38 +00:00
|
|
|
SPROUT_CONSTEXPR base_bitset(unsigned long long val) SPROUT_NOEXCEPT
|
2013-03-21 13:11:40 +00:00
|
|
|
: w_{word_type(val), word_type(val >> (CHAR_BIT * sprout::detail::sizeof_<unsigned long>::value))}
|
2012-06-20 16:40:38 +00:00
|
|
|
{}
|
|
|
|
template<typename... Words>
|
|
|
|
SPROUT_CONSTEXPR base_bitset(sprout::detail::base_bitset_from_words_construct_tag, Words... words)
|
|
|
|
: w_{words...}
|
|
|
|
{}
|
2013-11-12 11:44:27 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR base_bitset<N>& operator=(base_bitset<N> const& rhs) {
|
|
|
|
sprout::copy(rhs.w_ + 0, rhs.w_ + N, w_ + 0);
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
SPROUT_CXX14_CONSTEXPR base_bitset<N>& operator=(base_bitset<N>&& rhs) {
|
|
|
|
sprout::move(rhs.w_ + 0, rhs.w_ + N, w_ + 0);
|
|
|
|
return *this;
|
|
|
|
}
|
2012-06-20 16:40:38 +00:00
|
|
|
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR void
|
2012-06-20 16:40:38 +00:00
|
|
|
setword(std::size_t pos, word_type word) SPROUT_NOEXCEPT {
|
|
|
|
w_[whichword(pos)] = word;
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR base_bitset<N>
|
|
|
|
setword(std::size_t pos, word_type word) const SPROUT_NOEXCEPT {
|
|
|
|
return sprout::fixed::set(*this, whichword(pos), word);
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR base_bitset<N>
|
|
|
|
hiword(word_type word) const SPROUT_NOEXCEPT {
|
|
|
|
return sprout::fixed::set(*this, N - 1, word);
|
|
|
|
}
|
|
|
|
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR word_type&
|
2012-06-20 16:40:38 +00:00
|
|
|
getword(std::size_t pos) SPROUT_NOEXCEPT {
|
|
|
|
return w_[whichword(pos)];
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR word_type
|
|
|
|
getword(std::size_t pos) const SPROUT_NOEXCEPT {
|
|
|
|
return w_[whichword(pos)];
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR word_type const*
|
|
|
|
getdata() const SPROUT_NOEXCEPT {
|
|
|
|
return w_;
|
|
|
|
}
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR word_type&
|
2012-06-20 16:40:38 +00:00
|
|
|
hiword() SPROUT_NOEXCEPT {
|
|
|
|
return w_[N - 1];
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR word_type
|
|
|
|
hiword() const SPROUT_NOEXCEPT {
|
|
|
|
return w_[N - 1];
|
|
|
|
}
|
|
|
|
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR void
|
2012-06-20 16:40:38 +00:00
|
|
|
do_and(base_bitset<N> const& x) SPROUT_NOEXCEPT {
|
|
|
|
for (std::size_t i = 0; i < N; i++) {
|
|
|
|
w_[i] &= x.w_[i];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR base_bitset<N>
|
|
|
|
do_and(base_bitset<N> const& x) const SPROUT_NOEXCEPT {
|
|
|
|
return sprout::fixed::transform(
|
|
|
|
begin(), end(), x.begin(), *this, NS_SSCRISK_CEL_OR_SPROUT::bit_and<word_type>()
|
|
|
|
);
|
|
|
|
}
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR void
|
2012-06-20 16:40:38 +00:00
|
|
|
do_or(base_bitset<N> const& x) SPROUT_NOEXCEPT {
|
|
|
|
for (std::size_t i = 0; i < N; i++) {
|
|
|
|
w_[i] |= x.w_[i];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR base_bitset<N>
|
|
|
|
do_or(base_bitset<N> const& x) const SPROUT_NOEXCEPT {
|
|
|
|
return sprout::fixed::transform(
|
|
|
|
begin(), end(), x.begin(), *this, NS_SSCRISK_CEL_OR_SPROUT::bit_or<word_type>()
|
|
|
|
);
|
|
|
|
}
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR void
|
2012-06-20 16:40:38 +00:00
|
|
|
do_xor(base_bitset<N> const& x) SPROUT_NOEXCEPT {
|
|
|
|
for (std::size_t i = 0; i < N; i++) {
|
|
|
|
w_[i] ^= x.w_[i];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR base_bitset<N>
|
|
|
|
do_xor(base_bitset<N> const& x) const SPROUT_NOEXCEPT {
|
|
|
|
return sprout::fixed::transform(
|
|
|
|
begin(), end(), x.begin(), *this, NS_SSCRISK_CEL_OR_SPROUT::bit_xor<word_type>()
|
|
|
|
);
|
|
|
|
}
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR void
|
2012-06-20 16:40:38 +00:00
|
|
|
do_left_shift(std::size_t shift) SPROUT_NOEXCEPT {
|
|
|
|
if (shift != 0) {
|
2013-03-21 13:11:40 +00:00
|
|
|
std::size_t const wshift = shift / (CHAR_BIT * sprout::detail::sizeof_<unsigned long>::value);
|
|
|
|
std::size_t const offset = shift % (CHAR_BIT * sprout::detail::sizeof_<unsigned long>::value);
|
2012-06-20 16:40:38 +00:00
|
|
|
if (offset == 0) {
|
|
|
|
for (std::size_t n = N - 1; n >= wshift; --n) {
|
|
|
|
w_[n] = w_[n - wshift];
|
|
|
|
}
|
|
|
|
} else {
|
2013-03-21 13:11:40 +00:00
|
|
|
std::size_t const sub_offset = (CHAR_BIT * sprout::detail::sizeof_<unsigned long>::value) - offset;
|
2012-06-20 16:40:38 +00:00
|
|
|
for (std::size_t n = N - 1; n > wshift; --n) {
|
|
|
|
w_[n] = (w_[n - wshift] << offset) | (w_[n - wshift - 1] >> sub_offset);
|
|
|
|
}
|
|
|
|
w_[wshift] = w_[0] << offset;
|
|
|
|
}
|
2013-10-31 09:57:41 +00:00
|
|
|
sprout::fill(w_ + 0, w_ + wshift, static_cast<word_type>(0));
|
2012-06-20 16:40:38 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR base_bitset<N>
|
|
|
|
do_left_shift(std::size_t shift) const SPROUT_NOEXCEPT {
|
|
|
|
return shift != 0 ? do_left_shift_impl(
|
2013-03-21 13:11:40 +00:00
|
|
|
shift / (CHAR_BIT * sprout::detail::sizeof_<unsigned long>::value),
|
|
|
|
shift % (CHAR_BIT * sprout::detail::sizeof_<unsigned long>::value)
|
2012-06-20 16:40:38 +00:00
|
|
|
)
|
|
|
|
: *this
|
|
|
|
;
|
|
|
|
}
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR void
|
2012-06-20 16:40:38 +00:00
|
|
|
do_right_shift(std::size_t shift) SPROUT_NOEXCEPT {
|
2013-11-02 09:28:18 +00:00
|
|
|
if (shift != 0) {
|
2013-03-21 13:11:40 +00:00
|
|
|
std::size_t const wshift = shift / (CHAR_BIT * sprout::detail::sizeof_<unsigned long>::value);
|
|
|
|
std::size_t const offset = shift % (CHAR_BIT * sprout::detail::sizeof_<unsigned long>::value);
|
2012-06-20 16:40:38 +00:00
|
|
|
std::size_t const limit = N - wshift - 1;
|
|
|
|
if (offset == 0) {
|
|
|
|
for (std::size_t n = 0; n <= limit; ++n) {
|
|
|
|
w_[n] = w_[n + wshift];
|
|
|
|
}
|
|
|
|
} else {
|
2013-03-21 13:11:40 +00:00
|
|
|
std::size_t const sub_offset = (CHAR_BIT * sprout::detail::sizeof_<unsigned long>::value) - offset;
|
2012-06-20 16:40:38 +00:00
|
|
|
for (std::size_t n = 0; n < limit; ++n) {
|
|
|
|
w_[n] = (w_[n + wshift] >> offset) | (w_[n + wshift + 1] << sub_offset);
|
|
|
|
}
|
|
|
|
w_[limit] = w_[N-1] >> offset;
|
|
|
|
}
|
2013-10-31 09:57:41 +00:00
|
|
|
sprout::fill(w_ + limit + 1, w_ + N, static_cast<word_type>(0));
|
2012-06-20 16:40:38 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR base_bitset<N>
|
|
|
|
do_right_shift(std::size_t shift) const SPROUT_NOEXCEPT {
|
|
|
|
return shift != 0 ? do_right_shift_impl(
|
2013-03-21 13:11:40 +00:00
|
|
|
shift / (CHAR_BIT * sprout::detail::sizeof_<unsigned long>::value),
|
|
|
|
shift % (CHAR_BIT * sprout::detail::sizeof_<unsigned long>::value),
|
|
|
|
N - shift / (CHAR_BIT * sprout::detail::sizeof_<unsigned long>::value) - 1
|
2012-06-20 16:40:38 +00:00
|
|
|
)
|
|
|
|
: *this
|
|
|
|
;
|
|
|
|
}
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR void
|
2012-06-20 16:40:38 +00:00
|
|
|
do_flip() SPROUT_NOEXCEPT {
|
|
|
|
for (std::size_t i = 0; i < N; i++) {
|
|
|
|
w_[i] = ~w_[i];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR base_bitset<N>
|
|
|
|
do_flip() const SPROUT_NOEXCEPT {
|
|
|
|
return sprout::fixed::transform(
|
|
|
|
begin(), end(), *this, NS_SSCRISK_CEL_OR_SPROUT::bit_not<word_type>()
|
|
|
|
);
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR base_bitset<N>
|
|
|
|
do_set() const SPROUT_NOEXCEPT {
|
|
|
|
return sprout::fixed::fill(*this, ~static_cast<word_type>(0));
|
|
|
|
}
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR void
|
2012-06-20 16:40:38 +00:00
|
|
|
do_set() SPROUT_NOEXCEPT {
|
|
|
|
for (std::size_t i = 0; i < N; i++) {
|
|
|
|
w_[i] = ~static_cast<word_type>(0);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR base_bitset<N>
|
|
|
|
do_reset() const SPROUT_NOEXCEPT {
|
|
|
|
return base_bitset();
|
|
|
|
}
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR void
|
2012-06-20 16:40:38 +00:00
|
|
|
do_reset() SPROUT_NOEXCEPT {
|
2013-10-31 09:57:41 +00:00
|
|
|
sprout::fill(w_ + 0, w_ + N, static_cast<word_type>(0));
|
2012-06-20 16:40:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
SPROUT_CONSTEXPR bool
|
|
|
|
is_equal(base_bitset<N> const& x) const SPROUT_NOEXCEPT {
|
2013-01-11 19:08:44 +00:00
|
|
|
return sprout::equal(begin(), end(), x.begin());
|
2012-06-20 16:40:38 +00:00
|
|
|
}
|
|
|
|
template<std::size_t N2>
|
|
|
|
SPROUT_CONSTEXPR bool
|
|
|
|
are_all() const SPROUT_NOEXCEPT {
|
2013-01-11 19:08:44 +00:00
|
|
|
return sprout::all_of(begin(), end() - 1, are_all_pred())
|
2013-03-21 13:11:40 +00:00
|
|
|
&& hiword() == (~static_cast<word_type>(0) >> (N * (CHAR_BIT * sprout::detail::sizeof_<unsigned long>::value) - N2))
|
2012-06-20 16:40:38 +00:00
|
|
|
;
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR bool
|
|
|
|
is_any() const SPROUT_NOEXCEPT {
|
2013-01-11 19:08:44 +00:00
|
|
|
return sprout::any_of(begin(), end(), is_any_pred());
|
2012-06-20 16:40:38 +00:00
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR std::size_t
|
|
|
|
do_count() const SPROUT_NOEXCEPT {
|
2013-01-11 19:08:44 +00:00
|
|
|
return sprout::accumulate(begin(), end(), static_cast<std::size_t>(0), count_op());
|
2012-06-20 16:40:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
SPROUT_CONSTEXPR unsigned long
|
|
|
|
do_to_ulong() const {
|
2013-01-11 19:08:44 +00:00
|
|
|
return sprout::find_if(begin() + 1, end(), to_ulong_pred()) != end()
|
2012-06-20 16:40:38 +00:00
|
|
|
? throw std::overflow_error("base_bitset::do_to_ulong")
|
|
|
|
: w_[0]
|
|
|
|
;
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR unsigned long long
|
|
|
|
do_to_ullong() const {
|
2013-01-11 19:08:44 +00:00
|
|
|
return sprout::find_if(
|
2013-03-21 13:11:40 +00:00
|
|
|
sprout::detail::sizeof_<unsigned long long>::value > sprout::detail::sizeof_<unsigned long>::value ? begin() + 2
|
2012-06-20 16:40:38 +00:00
|
|
|
: begin() + 1
|
|
|
|
,
|
|
|
|
end(),
|
|
|
|
to_ulong_pred()
|
|
|
|
) != end()
|
|
|
|
? throw std::overflow_error("base_bitset::to_ullong")
|
2013-03-21 13:11:40 +00:00
|
|
|
: sprout::detail::sizeof_<unsigned long long>::value > sprout::detail::sizeof_<unsigned long>::value
|
2012-06-20 16:40:38 +00:00
|
|
|
? w_[0] + (static_cast<unsigned long long>(w_[1]) << (CHAR_BIT * sizeof(unsigned long)))
|
|
|
|
: w_[0]
|
|
|
|
;
|
|
|
|
}
|
|
|
|
|
|
|
|
SPROUT_CONSTEXPR std::size_t
|
|
|
|
find_first(std::size_t not_found) const SPROUT_NOEXCEPT {
|
|
|
|
return find_first_impl(not_found, begin(), end());
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR std::size_t
|
|
|
|
find_next(std::size_t prev, std::size_t not_found) const SPROUT_NOEXCEPT {
|
2013-03-21 13:11:40 +00:00
|
|
|
return prev + 1 >= N * (CHAR_BIT * sprout::detail::sizeof_<unsigned long>::value) ? not_found
|
2012-06-20 16:40:38 +00:00
|
|
|
: find_next_impl(prev + 1, not_found, whichword(prev + 1));
|
|
|
|
;
|
|
|
|
}
|
|
|
|
|
|
|
|
SPROUT_CONSTEXPR std::size_t do_to_hash() const {
|
2013-02-04 14:48:18 +00:00
|
|
|
return sprout::hash_range(*this);
|
2012-06-20 16:40:38 +00:00
|
|
|
}
|
|
|
|
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR word_type& operator[](std::size_t i) {
|
2012-06-20 16:40:38 +00:00
|
|
|
return w_[i];
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR word_type const& operator[](std::size_t i) const {
|
|
|
|
return w_[i];
|
|
|
|
}
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR iterator begin() SPROUT_NOEXCEPT {
|
2012-06-20 16:40:38 +00:00
|
|
|
return iterator(*this, 0);
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR const_iterator begin() const SPROUT_NOEXCEPT {
|
|
|
|
return const_iterator(*this, 0);
|
|
|
|
}
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR iterator end() SPROUT_NOEXCEPT {
|
2012-06-20 16:40:38 +00:00
|
|
|
return iterator(*this, N);
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR const_iterator end() const SPROUT_NOEXCEPT {
|
|
|
|
return const_iterator(*this, N);
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
template<>
|
|
|
|
class base_bitset<1> {
|
|
|
|
public:
|
|
|
|
typedef unsigned long word_type;
|
|
|
|
private:
|
|
|
|
word_type w_;
|
|
|
|
public:
|
|
|
|
static SPROUT_CONSTEXPR std::size_t
|
|
|
|
whichword(std::size_t pos) SPROUT_NOEXCEPT {
|
2013-03-21 13:11:40 +00:00
|
|
|
return pos / (CHAR_BIT * sprout::detail::sizeof_<unsigned long>::value);
|
2012-06-20 16:40:38 +00:00
|
|
|
}
|
|
|
|
static SPROUT_CONSTEXPR std::size_t
|
|
|
|
whichbyte(std::size_t pos) SPROUT_NOEXCEPT {
|
2013-03-21 13:11:40 +00:00
|
|
|
return (pos % (CHAR_BIT * sprout::detail::sizeof_<unsigned long>::value)) / CHAR_BIT;
|
2012-06-20 16:40:38 +00:00
|
|
|
}
|
|
|
|
static SPROUT_CONSTEXPR std::size_t
|
|
|
|
whichbit(std::size_t pos) SPROUT_NOEXCEPT {
|
2013-03-21 13:11:40 +00:00
|
|
|
return pos % (CHAR_BIT * sprout::detail::sizeof_<unsigned long>::value);
|
2012-06-20 16:40:38 +00:00
|
|
|
}
|
|
|
|
static SPROUT_CONSTEXPR word_type
|
|
|
|
maskbit(std::size_t pos) SPROUT_NOEXCEPT {
|
|
|
|
return (static_cast<word_type>(1)) << whichbit(pos);
|
|
|
|
}
|
|
|
|
private:
|
|
|
|
SPROUT_CONSTEXPR std::size_t
|
|
|
|
find_next_impl(std::size_t prev, std::size_t not_found, word_type x) const SPROUT_NOEXCEPT {
|
2012-06-22 13:56:25 +00:00
|
|
|
return x != 0 ? sprout::ctz(x) + prev
|
2012-06-20 16:40:38 +00:00
|
|
|
: not_found
|
|
|
|
;
|
|
|
|
}
|
|
|
|
public:
|
|
|
|
SPROUT_CONSTEXPR base_bitset() SPROUT_NOEXCEPT
|
|
|
|
: w_(0)
|
|
|
|
{}
|
2013-11-12 11:44:27 +00:00
|
|
|
base_bitset(base_bitset<1> const&) = default;
|
2012-06-20 16:40:38 +00:00
|
|
|
SPROUT_CONSTEXPR base_bitset(unsigned long long val) SPROUT_NOEXCEPT
|
|
|
|
: w_(val)
|
|
|
|
{}
|
|
|
|
SPROUT_CONSTEXPR base_bitset(sprout::detail::base_bitset_from_words_construct_tag, word_type word)
|
|
|
|
: w_(word)
|
|
|
|
{}
|
2013-11-12 11:44:27 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR base_bitset<1>& operator=(base_bitset<1> const& rhs) {
|
|
|
|
w_ = rhs.w_;
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
SPROUT_CXX14_CONSTEXPR base_bitset<1>& operator=(base_bitset<1>&& rhs) {
|
|
|
|
w_ = sprout::move(rhs.w_);
|
|
|
|
return *this;
|
|
|
|
}
|
2012-06-20 16:40:38 +00:00
|
|
|
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR void
|
2012-06-20 16:40:38 +00:00
|
|
|
setword(std::size_t, word_type word) SPROUT_NOEXCEPT {
|
|
|
|
w_ = word;
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR base_bitset<1>
|
|
|
|
setword(std::size_t, word_type word) const SPROUT_NOEXCEPT {
|
|
|
|
return base_bitset(sprout::detail::base_bitset_from_words_construct_tag(), word);
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR base_bitset<1>
|
|
|
|
hiword(word_type word) const SPROUT_NOEXCEPT {
|
|
|
|
return base_bitset(sprout::detail::base_bitset_from_words_construct_tag(), word);
|
|
|
|
}
|
|
|
|
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR word_type&
|
2012-06-20 16:40:38 +00:00
|
|
|
getword(std::size_t) SPROUT_NOEXCEPT {
|
|
|
|
return w_;
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR word_type
|
|
|
|
getword(std::size_t) const SPROUT_NOEXCEPT {
|
|
|
|
return w_;
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR word_type const*
|
|
|
|
getdata() const SPROUT_NOEXCEPT {
|
|
|
|
return &w_;
|
|
|
|
}
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR word_type&
|
2012-06-20 16:40:38 +00:00
|
|
|
hiword() SPROUT_NOEXCEPT {
|
|
|
|
return w_;
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR word_type
|
|
|
|
hiword() const SPROUT_NOEXCEPT {
|
|
|
|
return w_;
|
|
|
|
}
|
|
|
|
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR void
|
2012-06-20 16:40:38 +00:00
|
|
|
do_and(base_bitset<1> const& x) SPROUT_NOEXCEPT {
|
|
|
|
w_ &= x.w_;
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR base_bitset<1>
|
|
|
|
do_and(base_bitset<1> const& x) const SPROUT_NOEXCEPT {
|
|
|
|
return base_bitset<1>(w_ & x.w_);
|
|
|
|
}
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR void
|
2012-06-20 16:40:38 +00:00
|
|
|
do_or(base_bitset<1> const& x) SPROUT_NOEXCEPT {
|
|
|
|
w_ |= x.w_;
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR base_bitset<1>
|
|
|
|
do_or(base_bitset<1> const& x) const SPROUT_NOEXCEPT {
|
|
|
|
return base_bitset<1>(w_ | x.w_);
|
|
|
|
}
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR void
|
2012-06-20 16:40:38 +00:00
|
|
|
do_xor(base_bitset<1> const& x) SPROUT_NOEXCEPT {
|
|
|
|
w_ ^= x.w_;
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR base_bitset<1>
|
|
|
|
do_xor(base_bitset<1> const& x) const SPROUT_NOEXCEPT {
|
|
|
|
return base_bitset<1>(w_ ^ x.w_);
|
|
|
|
}
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR void
|
2012-06-20 16:40:38 +00:00
|
|
|
do_left_shift(std::size_t shift) SPROUT_NOEXCEPT {
|
|
|
|
w_ <<= shift;
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR base_bitset<1>
|
|
|
|
do_left_shift(base_bitset<1> const& x) const SPROUT_NOEXCEPT {
|
|
|
|
return base_bitset<1>(w_ << x.w_);
|
|
|
|
}
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR void
|
2012-06-20 16:40:38 +00:00
|
|
|
do_right_shift(std::size_t shift) SPROUT_NOEXCEPT {
|
|
|
|
w_ >>= shift;
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR base_bitset<1>
|
|
|
|
do_right_shift(base_bitset<1> const& x) const SPROUT_NOEXCEPT {
|
|
|
|
return base_bitset<1>(w_ >> x.w_);
|
|
|
|
}
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR void
|
2012-06-20 16:40:38 +00:00
|
|
|
do_flip() SPROUT_NOEXCEPT {
|
|
|
|
w_ = ~w_;
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR base_bitset<1>
|
|
|
|
do_flip() const SPROUT_NOEXCEPT {
|
|
|
|
return base_bitset<1>(~w_);
|
|
|
|
}
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR void
|
2012-06-20 16:40:38 +00:00
|
|
|
do_set() SPROUT_NOEXCEPT {
|
|
|
|
w_ = ~static_cast<word_type>(0);
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR base_bitset<1>
|
|
|
|
do_set() const SPROUT_NOEXCEPT {
|
|
|
|
return base_bitset<1>(~static_cast<word_type>(0));
|
|
|
|
}
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR void
|
2012-06-20 16:40:38 +00:00
|
|
|
do_reset() SPROUT_NOEXCEPT {
|
|
|
|
w_ = 0;
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR base_bitset<1>
|
|
|
|
do_reset() const SPROUT_NOEXCEPT {
|
|
|
|
return base_bitset<1>(0);
|
|
|
|
}
|
|
|
|
|
|
|
|
SPROUT_CONSTEXPR bool
|
|
|
|
is_equal(base_bitset<1> const& x) const SPROUT_NOEXCEPT {
|
|
|
|
return w_ == x.w_;
|
|
|
|
}
|
|
|
|
template<std::size_t N2>
|
|
|
|
SPROUT_CONSTEXPR bool
|
|
|
|
are_all() const SPROUT_NOEXCEPT {
|
|
|
|
return w_ == ~static_cast<word_type>(0) >> ((CHAR_BIT * sizeof(unsigned long)) - N2);
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR bool
|
|
|
|
is_any() const SPROUT_NOEXCEPT {
|
|
|
|
return w_ != 0;
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR std::size_t
|
|
|
|
do_count() const SPROUT_NOEXCEPT {
|
2012-06-22 13:56:25 +00:00
|
|
|
return sprout::popcount(w_);
|
2012-06-20 16:40:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
SPROUT_CONSTEXPR unsigned long
|
|
|
|
do_to_ulong() const SPROUT_NOEXCEPT {
|
|
|
|
return w_;
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR unsigned long long
|
|
|
|
do_to_ullong() const SPROUT_NOEXCEPT {
|
|
|
|
return w_;
|
|
|
|
}
|
|
|
|
|
|
|
|
SPROUT_CONSTEXPR std::size_t
|
|
|
|
find_first(std::size_t not_found) const SPROUT_NOEXCEPT {
|
2012-06-22 13:56:25 +00:00
|
|
|
return w_ != 0 ? sprout::ctz(w_)
|
2012-06-20 16:40:38 +00:00
|
|
|
: not_found
|
|
|
|
;
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR std::size_t
|
|
|
|
find_next(std::size_t prev, std::size_t not_found) const SPROUT_NOEXCEPT {
|
2013-03-21 13:11:40 +00:00
|
|
|
return prev + 1 >= static_cast<std::size_t>(CHAR_BIT * sprout::detail::sizeof_<unsigned long>::value) ? not_found
|
2012-06-20 16:40:38 +00:00
|
|
|
: find_next_impl(prev + 1, not_found, w_ >> (prev + 1))
|
|
|
|
;
|
|
|
|
}
|
|
|
|
|
|
|
|
SPROUT_CONSTEXPR std::size_t do_to_hash() const {
|
2013-02-04 14:10:24 +00:00
|
|
|
return sprout::to_hash(w_);
|
2012-06-20 16:40:38 +00:00
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
template<>
|
|
|
|
class base_bitset<0> {
|
|
|
|
public:
|
|
|
|
typedef unsigned long word_type;
|
|
|
|
public:
|
|
|
|
static SPROUT_CONSTEXPR std::size_t
|
|
|
|
whichword(std::size_t pos) SPROUT_NOEXCEPT {
|
2013-03-21 13:11:40 +00:00
|
|
|
return pos / (CHAR_BIT * sprout::detail::sizeof_<unsigned long>::value);
|
2012-06-20 16:40:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static SPROUT_CONSTEXPR std::size_t
|
|
|
|
whichbyte(std::size_t pos) SPROUT_NOEXCEPT {
|
2013-03-21 13:11:40 +00:00
|
|
|
return (pos % (CHAR_BIT * sprout::detail::sizeof_<unsigned long>::value)) / CHAR_BIT;
|
2012-06-20 16:40:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static SPROUT_CONSTEXPR std::size_t
|
|
|
|
whichbit(std::size_t pos) SPROUT_NOEXCEPT {
|
2013-03-21 13:11:40 +00:00
|
|
|
return pos % (CHAR_BIT * sprout::detail::sizeof_<unsigned long>::value);
|
2012-06-20 16:40:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static SPROUT_CONSTEXPR word_type
|
|
|
|
maskbit(std::size_t pos) SPROUT_NOEXCEPT {
|
|
|
|
return (static_cast<word_type>(1)) << whichbit(pos);
|
|
|
|
}
|
|
|
|
public:
|
|
|
|
SPROUT_CONSTEXPR base_bitset() SPROUT_NOEXCEPT {}
|
2013-11-12 11:44:27 +00:00
|
|
|
base_bitset(base_bitset<0> const&) = default;
|
2012-06-20 16:40:38 +00:00
|
|
|
SPROUT_CONSTEXPR base_bitset(unsigned long long) SPROUT_NOEXCEPT {}
|
|
|
|
SPROUT_CONSTEXPR base_bitset(sprout::detail::base_bitset_from_words_construct_tag) {}
|
2013-11-20 13:04:11 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR base_bitset<0>& operator=(base_bitset<0> const&) SPROUT_NOEXCEPT {
|
2013-11-12 11:44:27 +00:00
|
|
|
return *this;
|
|
|
|
}
|
2013-11-20 13:04:11 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR base_bitset<0>& operator=(base_bitset<0>&&) SPROUT_NOEXCEPT {
|
2013-11-12 11:44:27 +00:00
|
|
|
return *this;
|
|
|
|
}
|
2012-06-20 16:40:38 +00:00
|
|
|
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR void
|
2012-06-20 16:40:38 +00:00
|
|
|
setword(std::size_t, word_type) SPROUT_NOEXCEPT {}
|
|
|
|
SPROUT_CONSTEXPR base_bitset<0>
|
|
|
|
setword(std::size_t, word_type) const SPROUT_NOEXCEPT {
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR base_bitset<0>
|
|
|
|
hiword(word_type) const SPROUT_NOEXCEPT {
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
2013-11-11 01:32:10 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR word_type
|
2013-11-11 01:13:01 +00:00
|
|
|
getword(std::size_t, bool c = false) SPROUT_NOEXCEPT {
|
2013-11-11 01:32:10 +00:00
|
|
|
return !c ? 0
|
2013-11-12 11:44:27 +00:00
|
|
|
: throw std::out_of_range("base_bitset::getword")
|
2013-11-11 01:13:01 +00:00
|
|
|
;
|
2012-06-20 16:40:38 +00:00
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR word_type
|
2013-07-22 13:00:09 +00:00
|
|
|
getword(std::size_t) const SPROUT_NOEXCEPT {
|
2012-06-20 16:40:38 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR word_type
|
|
|
|
hiword() const SPROUT_NOEXCEPT {
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR void
|
2012-06-20 16:40:38 +00:00
|
|
|
do_and(base_bitset<0> const&) SPROUT_NOEXCEPT {}
|
|
|
|
SPROUT_CONSTEXPR base_bitset<0>
|
|
|
|
do_and(base_bitset<0> const&) const SPROUT_NOEXCEPT {
|
|
|
|
return *this;
|
|
|
|
}
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR void
|
2012-06-20 16:40:38 +00:00
|
|
|
do_or(base_bitset<0> const&) SPROUT_NOEXCEPT {}
|
|
|
|
SPROUT_CONSTEXPR base_bitset<0>
|
|
|
|
do_or(base_bitset<0> const&) const SPROUT_NOEXCEPT {
|
|
|
|
return *this;
|
|
|
|
}
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR void
|
2012-06-20 16:40:38 +00:00
|
|
|
do_xor(base_bitset<0> const&) SPROUT_NOEXCEPT {}
|
|
|
|
SPROUT_CONSTEXPR base_bitset<0>
|
|
|
|
do_xor(base_bitset<0> const&) const SPROUT_NOEXCEPT {
|
|
|
|
return *this;
|
|
|
|
}
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR void
|
2012-06-20 16:40:38 +00:00
|
|
|
do_left_shift(std::size_t) SPROUT_NOEXCEPT {}
|
|
|
|
SPROUT_CONSTEXPR base_bitset<0>
|
|
|
|
do_left_shift(base_bitset<0> const&) const SPROUT_NOEXCEPT {
|
|
|
|
return *this;
|
|
|
|
}
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR void
|
2012-06-20 16:40:38 +00:00
|
|
|
do_right_shift(std::size_t) SPROUT_NOEXCEPT {}
|
|
|
|
SPROUT_CONSTEXPR base_bitset<0>
|
|
|
|
do_right_shift(base_bitset<0> const&) const SPROUT_NOEXCEPT {
|
|
|
|
return *this;
|
|
|
|
}
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR void
|
2012-06-20 16:40:38 +00:00
|
|
|
do_flip() SPROUT_NOEXCEPT {}
|
|
|
|
SPROUT_CONSTEXPR base_bitset<0>
|
|
|
|
do_flip() const SPROUT_NOEXCEPT {
|
|
|
|
return *this;
|
|
|
|
}
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR void
|
2012-06-20 16:40:38 +00:00
|
|
|
do_set() SPROUT_NOEXCEPT {}
|
|
|
|
SPROUT_CONSTEXPR base_bitset<0>
|
|
|
|
do_set() const SPROUT_NOEXCEPT {
|
|
|
|
return base_bitset<0>();
|
|
|
|
}
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR void
|
2012-06-20 16:40:38 +00:00
|
|
|
do_reset() SPROUT_NOEXCEPT {}
|
|
|
|
SPROUT_CONSTEXPR base_bitset<0>
|
|
|
|
do_reset() const SPROUT_NOEXCEPT {
|
|
|
|
return base_bitset<0>();
|
|
|
|
}
|
|
|
|
|
|
|
|
SPROUT_CONSTEXPR bool
|
|
|
|
is_equal(base_bitset<0> const&) const SPROUT_NOEXCEPT {
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
template<std::size_t N2>
|
|
|
|
SPROUT_CONSTEXPR bool
|
|
|
|
are_all() const SPROUT_NOEXCEPT {
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR bool
|
|
|
|
is_any() const SPROUT_NOEXCEPT {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR std::size_t
|
|
|
|
do_count() const SPROUT_NOEXCEPT {
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
SPROUT_CONSTEXPR unsigned long
|
|
|
|
do_to_ulong() const SPROUT_NOEXCEPT {
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR unsigned long long
|
|
|
|
do_to_ullong() const SPROUT_NOEXCEPT {
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
SPROUT_CONSTEXPR std::size_t
|
|
|
|
find_first(std::size_t) const SPROUT_NOEXCEPT {
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR std::size_t
|
|
|
|
find_next(std::size_t, std::size_t) const SPROUT_NOEXCEPT {
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
SPROUT_CONSTEXPR std::size_t do_to_hash() const {
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
template<std::size_t Extrabits>
|
|
|
|
struct sanitize {
|
|
|
|
public:
|
|
|
|
typedef unsigned long word_type;
|
|
|
|
public:
|
2013-10-28 00:01:19 +00:00
|
|
|
static SPROUT_CXX14_CONSTEXPR void
|
2012-06-20 16:40:38 +00:00
|
|
|
do_sanitize(word_type& val) SPROUT_NOEXCEPT {
|
|
|
|
val &= ~(~static_cast<word_type>(0) << Extrabits);
|
|
|
|
}
|
|
|
|
static SPROUT_CONSTEXPR word_type
|
|
|
|
do_sanitize_c(word_type val) SPROUT_NOEXCEPT {
|
|
|
|
return val & ~(~static_cast<word_type>(0) << Extrabits);
|
|
|
|
}
|
|
|
|
};
|
|
|
|
template<>
|
|
|
|
struct sanitize<0> {
|
|
|
|
public:
|
|
|
|
typedef unsigned long word_type;
|
|
|
|
public:
|
2013-10-28 00:01:19 +00:00
|
|
|
static SPROUT_CXX14_CONSTEXPR void
|
2012-06-20 16:40:38 +00:00
|
|
|
do_sanitize(word_type) SPROUT_NOEXCEPT {}
|
|
|
|
static SPROUT_CONSTEXPR word_type
|
|
|
|
do_sanitize_c(word_type val) SPROUT_NOEXCEPT {
|
|
|
|
return val;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2013-03-21 13:11:40 +00:00
|
|
|
template<std::size_t N2, bool = (N2 < (CHAR_BIT * sprout::detail::sizeof_<unsigned long long>::value))>
|
2012-06-20 16:40:38 +00:00
|
|
|
struct sanitize_val {
|
|
|
|
public:
|
|
|
|
static SPROUT_CONSTEXPR unsigned long long
|
|
|
|
do_sanitize_val(unsigned long long val) {
|
|
|
|
return val;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
template<std::size_t N2>
|
|
|
|
struct sanitize_val<N2, true> {
|
|
|
|
public:
|
|
|
|
static SPROUT_CONSTEXPR unsigned long long
|
|
|
|
do_sanitize_val(unsigned long long val) {
|
|
|
|
return val & ~((~static_cast<unsigned long long>(0)) << N2);
|
|
|
|
}
|
|
|
|
};
|
|
|
|
} // namespace detail
|
|
|
|
|
|
|
|
template<std::size_t N>
|
|
|
|
struct container_construct_traits<sprout::detail::base_bitset<N> > {
|
|
|
|
public:
|
|
|
|
typedef sprout::detail::base_bitset<N> copied_type;
|
|
|
|
public:
|
|
|
|
template<typename Cont>
|
|
|
|
static SPROUT_CONSTEXPR copied_type deep_copy(Cont&& cont) {
|
2014-02-22 07:32:51 +00:00
|
|
|
return SPROUT_FORWARD(Cont, cont);
|
2012-06-20 16:40:38 +00:00
|
|
|
}
|
|
|
|
template<typename... Args>
|
|
|
|
static SPROUT_CONSTEXPR copied_type make(Args&&... args) {
|
|
|
|
return copied_type(sprout::detail::base_bitset_from_words_construct_tag(), args...);
|
|
|
|
}
|
|
|
|
template<typename Cont, typename... Args>
|
|
|
|
static SPROUT_CONSTEXPR copied_type remake(
|
2013-07-22 13:00:09 +00:00
|
|
|
Cont&&,
|
|
|
|
typename sprout::container_traits<sprout::detail::base_bitset<N> >::difference_type,
|
2012-06-20 16:40:38 +00:00
|
|
|
Args&&... args
|
|
|
|
)
|
|
|
|
{
|
|
|
|
return make(args...);
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
template<std::size_t N>
|
|
|
|
class bitset;
|
|
|
|
|
|
|
|
template<std::size_t N>
|
|
|
|
inline SPROUT_CONSTEXPR bitset<N>
|
|
|
|
operator&(sprout::bitset<N> const& lhs, sprout::bitset<N> const& rhs) SPROUT_NOEXCEPT;
|
|
|
|
template<std::size_t N>
|
|
|
|
inline SPROUT_CONSTEXPR bitset<N>
|
|
|
|
operator|(sprout::bitset<N> const& lhs, sprout::bitset<N> const& rhs) SPROUT_NOEXCEPT;
|
|
|
|
template<std::size_t N>
|
|
|
|
inline SPROUT_CONSTEXPR bitset<N>
|
|
|
|
operator^(sprout::bitset<N> const& lhs, sprout::bitset<N> const& rhs) SPROUT_NOEXCEPT;
|
|
|
|
template<typename Char, typename Traits, std::size_t N>
|
2013-11-02 09:28:18 +00:00
|
|
|
inline SPROUT_NON_CONSTEXPR std::basic_istream<Char, Traits>&
|
2012-06-20 16:40:38 +00:00
|
|
|
operator>>(std::basic_istream<Char, Traits>& lhs, sprout::bitset<N>& rhs);
|
|
|
|
template<typename Char, typename Traits, std::size_t N>
|
2013-11-02 09:28:18 +00:00
|
|
|
inline SPROUT_NON_CONSTEXPR std::basic_ostream<Char, Traits>&
|
2012-06-20 16:40:38 +00:00
|
|
|
operator<<(std::basic_ostream<Char, Traits>& lhs, sprout::bitset<N> const& rhs);
|
|
|
|
|
|
|
|
template<std::size_t N>
|
|
|
|
inline SPROUT_CONSTEXPR std::size_t
|
|
|
|
hash_value(sprout::bitset<N> const& v);
|
|
|
|
|
|
|
|
//
|
|
|
|
// bitset
|
|
|
|
//
|
|
|
|
template<std::size_t N>
|
|
|
|
class bitset
|
|
|
|
: private sprout::detail::base_bitset<
|
2013-03-21 13:11:40 +00:00
|
|
|
N / (CHAR_BIT * sprout::detail::sizeof_<unsigned long>::value) + (N % (CHAR_BIT * sprout::detail::sizeof_<unsigned long>::value) == 0 ? 0 : 1)
|
2012-06-20 16:40:38 +00:00
|
|
|
>
|
|
|
|
{
|
|
|
|
private:
|
|
|
|
typedef sprout::detail::base_bitset<
|
2013-03-21 13:11:40 +00:00
|
|
|
N / (CHAR_BIT * sprout::detail::sizeof_<unsigned long>::value) + (N % (CHAR_BIT * sprout::detail::sizeof_<unsigned long>::value) == 0 ? 0 : 1)
|
2012-06-20 16:40:38 +00:00
|
|
|
> base_type;
|
|
|
|
typedef unsigned long word_type;
|
|
|
|
public:
|
|
|
|
class reference {
|
|
|
|
friend class bitset;
|
|
|
|
private:
|
|
|
|
word_type* wp_;
|
|
|
|
std::size_t bpos_;
|
|
|
|
private:
|
2012-12-17 14:10:23 +00:00
|
|
|
reference() SPROUT_DELETED_FUNCTION_DECL
|
2012-06-20 16:40:38 +00:00
|
|
|
public:
|
|
|
|
SPROUT_CONSTEXPR reference(bitset& b, std::size_t pos) SPROUT_NOEXCEPT
|
|
|
|
: wp_(&b.getword(pos))
|
|
|
|
, bpos_(base_type::whichbit(pos))
|
|
|
|
{}
|
|
|
|
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR reference&
|
2012-06-20 16:40:38 +00:00
|
|
|
operator=(bool x) SPROUT_NOEXCEPT {
|
|
|
|
if (x) {
|
|
|
|
*wp_ |= base_type::maskbit(bpos_);
|
|
|
|
} else {
|
|
|
|
*wp_ &= ~base_type::maskbit(bpos_);
|
|
|
|
}
|
|
|
|
return *this;
|
|
|
|
}
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR reference&
|
2012-06-20 16:40:38 +00:00
|
|
|
operator=(const reference& j) SPROUT_NOEXCEPT {
|
|
|
|
if ((*(j.wp_) & base_type::maskbit(j.bpos_))) {
|
|
|
|
*wp_ |= base_type::maskbit(bpos_);
|
|
|
|
} else {
|
|
|
|
*wp_ &= ~base_type::maskbit(bpos_);
|
|
|
|
}
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
SPROUT_CONSTEXPR bool
|
|
|
|
operator~() const SPROUT_NOEXCEPT {
|
|
|
|
return (*wp_ & base_type::maskbit(bpos_)) == 0;
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR
|
|
|
|
operator bool() const SPROUT_NOEXCEPT {
|
|
|
|
return (*wp_ & base_type::maskbit(bpos_)) != 0;
|
|
|
|
}
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR reference&
|
2012-06-20 16:40:38 +00:00
|
|
|
flip() SPROUT_NOEXCEPT {
|
|
|
|
*wp_ ^= base_type::maskbit(bpos_);
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
friend class reference;
|
|
|
|
private:
|
|
|
|
explicit SPROUT_CONSTEXPR bitset(base_type const& base) SPROUT_NOEXCEPT
|
|
|
|
: base_type(base)
|
|
|
|
{}
|
|
|
|
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR void
|
2012-06-20 16:40:38 +00:00
|
|
|
do_sanitize() SPROUT_NOEXCEPT {
|
2013-03-21 13:11:40 +00:00
|
|
|
typedef sprout::detail::sanitize<N % (CHAR_BIT * sprout::detail::sizeof_<unsigned long>::value)> sanitize_type;
|
2012-06-20 16:40:38 +00:00
|
|
|
sanitize_type::do_sanitize(this->hiword());
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR bitset<N>
|
|
|
|
do_sanitize() const SPROUT_NOEXCEPT {
|
2013-03-21 13:11:40 +00:00
|
|
|
typedef sprout::detail::sanitize<N % (CHAR_BIT * sprout::detail::sizeof_<unsigned long>::value)> sanitize_type;
|
2013-03-22 05:24:19 +00:00
|
|
|
return bitset(this->hiword(sanitize_type::do_sanitize_c(this->hiword())));
|
2012-06-20 16:40:38 +00:00
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR bitset<N>
|
|
|
|
do_sanitize_c() const SPROUT_NOEXCEPT {
|
|
|
|
return do_sanitize();
|
|
|
|
}
|
|
|
|
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR bitset<N>&
|
2012-06-20 16:40:38 +00:00
|
|
|
unchecked_set(std::size_t pos) SPROUT_NOEXCEPT {
|
|
|
|
this->getword(pos) |= base_type::maskbit(pos);
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR bitset<N>
|
|
|
|
unchecked_set(std::size_t pos) const SPROUT_NOEXCEPT {
|
|
|
|
return bitset(this->setword(pos, this->getword(pos) | base_type::maskbit(pos)));
|
|
|
|
}
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR bitset<N>&
|
2012-06-20 16:40:38 +00:00
|
|
|
unchecked_set(std::size_t pos, int val) SPROUT_NOEXCEPT {
|
|
|
|
if (val) {
|
|
|
|
this->getword(pos) |= base_type::maskbit(pos);
|
|
|
|
} else {
|
|
|
|
this->getword(pos) &= ~base_type::maskbit(pos);
|
|
|
|
}
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR bitset<N>
|
|
|
|
unchecked_set(std::size_t pos, int val) const SPROUT_NOEXCEPT {
|
|
|
|
return val ? bitset(this->setword(pos, this->getword(pos) | base_type::maskbit(pos)))
|
|
|
|
: bitset(this->setword(pos, this->getword(pos) & ~base_type::maskbit(pos)))
|
|
|
|
;
|
|
|
|
}
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR bitset<N>&
|
2012-06-20 16:40:38 +00:00
|
|
|
unchecked_reset(std::size_t pos) SPROUT_NOEXCEPT {
|
|
|
|
this->getword(pos) &= ~base_type::maskbit(pos);
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR bitset<N>
|
|
|
|
unchecked_reset(std::size_t pos) const SPROUT_NOEXCEPT {
|
|
|
|
return bitset<N>(this->setword(pos, this->getword(pos) & ~base_type::maskbit(pos)));
|
|
|
|
}
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR bitset<N>&
|
2012-06-20 16:40:38 +00:00
|
|
|
unchecked_flip(std::size_t pos) SPROUT_NOEXCEPT {
|
|
|
|
this->getword(pos) ^= base_type::maskbit(pos);
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR bitset<N>
|
|
|
|
unchecked_flip(std::size_t pos) const SPROUT_NOEXCEPT {
|
|
|
|
return bitset<N>(this->setword(pos, this->getword(pos) ^ base_type::maskbit(pos)));
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR bool
|
|
|
|
unchecked_test(std::size_t pos) const SPROUT_NOEXCEPT {
|
|
|
|
return (this->getword(pos) & base_type::maskbit(pos)) != static_cast<word_type>(0);
|
|
|
|
}
|
|
|
|
|
|
|
|
template<typename Char, typename Traits>
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR void
|
2013-11-04 09:50:48 +00:00
|
|
|
copy_from_ptr(Char const* s, std::size_t len, std::size_t pos, std::size_t n, Char zero, Char one) {
|
2012-06-20 16:40:38 +00:00
|
|
|
reset();
|
|
|
|
std::size_t const nbits = std::min(N, std::min(n, len - pos));
|
|
|
|
for (std::size_t i = nbits; i > 0; --i) {
|
|
|
|
Char const c = s[pos + nbits - i];
|
|
|
|
if (Traits::eq(c, zero)) {
|
|
|
|
} else if (Traits::eq(c, one)) {
|
|
|
|
unchecked_set(i - 1);
|
|
|
|
} else {
|
|
|
|
throw std::invalid_argument("bitset::copy_from_ptr");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
template<typename Char, typename Traits, typename Alloc>
|
2013-11-02 09:28:18 +00:00
|
|
|
SPROUT_NON_CONSTEXPR void
|
2012-06-20 16:40:38 +00:00
|
|
|
copy_from_string(
|
|
|
|
std::basic_string<Char, Traits, Alloc> const& s,
|
|
|
|
std::size_t pos, std::size_t n, Char zero, Char one
|
|
|
|
)
|
|
|
|
{
|
|
|
|
copy_from_ptr<Char, Traits>(s.data(), s.size(), pos, n, zero, one);
|
|
|
|
}
|
|
|
|
template<typename Char, typename Traits, typename Alloc>
|
2013-11-02 09:28:18 +00:00
|
|
|
SPROUT_NON_CONSTEXPR void
|
2012-06-20 16:40:38 +00:00
|
|
|
copy_to_string(std::basic_string<Char, Traits, Alloc>& s, Char zero, Char one) const {
|
|
|
|
s.assign(N, zero);
|
|
|
|
for (std::size_t i = N; i > 0; --i) {
|
|
|
|
if (unchecked_test(i - 1)) {
|
|
|
|
Traits::assign(s[N - i], one);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
template<typename Char, typename Traits, typename Alloc>
|
2013-11-02 09:28:18 +00:00
|
|
|
SPROUT_NON_CONSTEXPR void
|
2012-06-20 16:40:38 +00:00
|
|
|
copy_from_string(std::basic_string<Char, Traits, Alloc> const& s, std::size_t pos, std::size_t n) {
|
|
|
|
copy_from_string(s, pos, n, Char('0'), Char('1'));
|
|
|
|
}
|
|
|
|
template<typename Char, typename Traits, typename Alloc>
|
2013-11-02 09:28:18 +00:00
|
|
|
SPROUT_NON_CONSTEXPR void
|
2012-10-13 03:49:23 +00:00
|
|
|
copy_to_string(std::basic_string<Char, Traits, Alloc>& s) const {
|
2012-06-20 16:40:38 +00:00
|
|
|
copy_to_string(s, Char('0'), Char('1'));
|
|
|
|
}
|
|
|
|
|
|
|
|
SPROUT_CONSTEXPR std::size_t to_hash() const {
|
|
|
|
return this->do_to_hash();
|
|
|
|
}
|
|
|
|
public:
|
|
|
|
// 20.5.1 constructors:
|
2013-11-12 11:44:27 +00:00
|
|
|
SPROUT_CONSTEXPR bitset() SPROUT_NOEXCEPT
|
|
|
|
: base_type()
|
|
|
|
{}
|
|
|
|
bitset(bitset<N> const&) = default;
|
2012-06-20 16:40:38 +00:00
|
|
|
SPROUT_CONSTEXPR bitset(unsigned long long val) SPROUT_NOEXCEPT
|
|
|
|
: base_type(sprout::detail::sanitize_val<N>::do_sanitize_val(val))
|
|
|
|
{}
|
|
|
|
template<typename Char, typename Traits, typename Alloc>
|
2013-11-02 09:28:18 +00:00
|
|
|
explicit SPROUT_NON_CONSTEXPR bitset(std::basic_string<Char, Traits, Alloc> const& s, std::size_t position = 0)
|
2012-06-20 16:40:38 +00:00
|
|
|
: base_type()
|
|
|
|
{
|
|
|
|
if (position > s.size()) {
|
|
|
|
throw std::out_of_range("bitset::bitset initial position not valid");
|
|
|
|
}
|
|
|
|
copy_from_string(s, position, std::basic_string<Char, Traits, Alloc>::npos, Char('0'), Char('1'));
|
|
|
|
}
|
|
|
|
template<typename Char, typename Traits, typename Alloc>
|
2013-11-02 09:28:18 +00:00
|
|
|
SPROUT_NON_CONSTEXPR bitset(std::basic_string<Char, Traits, Alloc> const& s, std::size_t position, std::size_t n)
|
2012-06-20 16:40:38 +00:00
|
|
|
: base_type()
|
|
|
|
{
|
|
|
|
if (position > s.size()) {
|
|
|
|
throw std::out_of_range("bitset::bitset initial position not valid");
|
|
|
|
}
|
|
|
|
copy_from_string(s, position, n, Char('0'), Char('1'));
|
|
|
|
}
|
|
|
|
|
|
|
|
template<typename Char, typename Traits, typename Alloc>
|
2013-11-02 09:28:18 +00:00
|
|
|
SPROUT_NON_CONSTEXPR bitset(
|
2012-06-20 16:40:38 +00:00
|
|
|
std::basic_string<Char, Traits, Alloc> const& s, std::size_t position, std::size_t n,
|
|
|
|
Char zero, Char one = Char('1')
|
|
|
|
)
|
|
|
|
: base_type()
|
|
|
|
{
|
|
|
|
if (position > s.size()) {
|
|
|
|
throw std::out_of_range("bitset::bitset initial position not valid");
|
|
|
|
}
|
|
|
|
copy_from_string(s, position, n, zero, one);
|
|
|
|
}
|
|
|
|
template<typename Char>
|
2013-11-02 09:28:18 +00:00
|
|
|
explicit SPROUT_NON_CONSTEXPR bitset(
|
2012-06-20 16:40:38 +00:00
|
|
|
Char const* str, typename std::basic_string<Char>::std::size_type n = std::basic_string<Char>::npos,
|
|
|
|
Char zero = Char('0'), Char one = Char('1')
|
|
|
|
)
|
|
|
|
: base_type()
|
|
|
|
{
|
|
|
|
if (!str) {
|
|
|
|
throw std::out_of_range("bitset::bitset");
|
|
|
|
}
|
|
|
|
if (n == std::basic_string<Char>::npos) {
|
|
|
|
n = std::char_traits<Char>::length(str);
|
|
|
|
}
|
|
|
|
copy_from_ptr<Char, std::char_traits<Char>>(str, n, 0, n, zero, one);
|
|
|
|
}
|
|
|
|
// 20.5.2 bitset operations:
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR bitset<N>&
|
2013-11-12 11:44:27 +00:00
|
|
|
operator=(bitset<N> const& rhs) {
|
|
|
|
base_type::operator=(rhs);
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
SPROUT_CXX14_CONSTEXPR bitset<N>&
|
|
|
|
operator=(bitset<N>&& rhs) {
|
|
|
|
base_type::operator=(sprout::move(rhs));
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
SPROUT_CXX14_CONSTEXPR bitset<N>&
|
2012-06-20 16:40:38 +00:00
|
|
|
operator&=(bitset<N> const& rhs) SPROUT_NOEXCEPT {
|
|
|
|
this->do_and(rhs);
|
|
|
|
return *this;
|
|
|
|
}
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR bitset<N>&
|
2012-06-20 16:40:38 +00:00
|
|
|
operator|=(bitset<N> const& rhs) SPROUT_NOEXCEPT {
|
|
|
|
this->do_or(rhs);
|
|
|
|
return *this;
|
|
|
|
}
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR bitset<N>&
|
2012-06-20 16:40:38 +00:00
|
|
|
operator^=(bitset<N> const& rhs) SPROUT_NOEXCEPT {
|
|
|
|
this->do_xor(rhs);
|
|
|
|
return *this;
|
|
|
|
}
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR bitset<N>&
|
2012-06-20 16:40:38 +00:00
|
|
|
operator<<=(std::size_t position) SPROUT_NOEXCEPT {
|
|
|
|
if (position < N) {
|
|
|
|
this->do_left_shift(position);
|
|
|
|
this->do_sanitize();
|
|
|
|
} else {
|
|
|
|
this->do_reset();
|
|
|
|
}
|
|
|
|
return *this;
|
|
|
|
}
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR bitset<N>&
|
2012-06-20 16:40:38 +00:00
|
|
|
operator>>=(std::size_t position) SPROUT_NOEXCEPT {
|
|
|
|
if (position < N) {
|
|
|
|
this->do_right_shift(position);
|
|
|
|
this->do_sanitize();
|
|
|
|
} else {
|
|
|
|
this->do_reset();
|
|
|
|
}
|
|
|
|
return *this;
|
|
|
|
}
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR bitset<N>&
|
2012-06-20 16:40:38 +00:00
|
|
|
set() SPROUT_NOEXCEPT {
|
|
|
|
this->do_set();
|
|
|
|
this->do_sanitize();
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR bitset<N>
|
|
|
|
set() const SPROUT_NOEXCEPT {
|
|
|
|
return bitset(this->do_set()).do_sanitize_c();
|
|
|
|
}
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR bitset<N>&
|
2012-06-20 16:40:38 +00:00
|
|
|
set(std::size_t position, bool val = true) {
|
|
|
|
if (position >= N) {
|
|
|
|
throw std::out_of_range("bitset::set");
|
|
|
|
}
|
|
|
|
return unchecked_set(position, val);
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR bitset<N>
|
|
|
|
set(std::size_t position, bool val = true) const {
|
|
|
|
return position >= N ? throw std::out_of_range("bitset::set")
|
|
|
|
: unchecked_set(position, val)
|
|
|
|
;
|
|
|
|
}
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR bitset<N>&
|
2012-06-20 16:40:38 +00:00
|
|
|
reset() SPROUT_NOEXCEPT {
|
|
|
|
this->do_reset();
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR bitset<N>
|
|
|
|
reset() const SPROUT_NOEXCEPT {
|
|
|
|
return bitset(this->do_reset());
|
|
|
|
}
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR bitset<N>&
|
2012-06-20 16:40:38 +00:00
|
|
|
reset(std::size_t position) {
|
|
|
|
if (position >= N) {
|
|
|
|
throw std::out_of_range("bitset::reset");
|
|
|
|
}
|
|
|
|
return unchecked_reset(position);
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR bitset<N>
|
|
|
|
reset(std::size_t position) const {
|
|
|
|
return position >= N ? throw std::out_of_range("bitset::reset")
|
|
|
|
: unchecked_reset(position)
|
|
|
|
;
|
|
|
|
}
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR bitset<N>&
|
2012-06-20 16:40:38 +00:00
|
|
|
flip() SPROUT_NOEXCEPT {
|
|
|
|
this->do_flip();
|
|
|
|
this->do_sanitize();
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR bitset<N>
|
|
|
|
flip() const SPROUT_NOEXCEPT {
|
|
|
|
return bitset(this->do_flip()).do_sanitize_c();
|
|
|
|
}
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR bitset<N>&
|
2012-06-20 16:40:38 +00:00
|
|
|
flip(std::size_t position) {
|
|
|
|
if (position >= N) {
|
|
|
|
throw std::out_of_range("bitset::flip");
|
|
|
|
}
|
|
|
|
return unchecked_flip(position);
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR bitset<N>
|
|
|
|
flip(std::size_t position) const {
|
|
|
|
return position >= N ? throw std::out_of_range("bitset::flip")
|
|
|
|
: unchecked_flip(position)
|
|
|
|
;
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR bitset<N>
|
|
|
|
operator~() const SPROUT_NOEXCEPT {
|
|
|
|
return flip();
|
|
|
|
}
|
|
|
|
|
|
|
|
// element access:
|
2013-10-28 00:01:19 +00:00
|
|
|
SPROUT_CXX14_CONSTEXPR reference
|
2012-06-20 16:40:38 +00:00
|
|
|
operator[](std::size_t position) {
|
|
|
|
return reference(*this, position);
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR bool
|
|
|
|
operator[](std::size_t position) const {
|
|
|
|
return unchecked_test(position);
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR unsigned long
|
|
|
|
to_ulong() const {
|
|
|
|
return this->do_to_ulong();
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR unsigned long long
|
|
|
|
to_ullong() const {
|
|
|
|
return this->do_to_ullong();
|
|
|
|
}
|
|
|
|
template<typename Char, typename Traits, typename Alloc>
|
2013-11-02 09:28:18 +00:00
|
|
|
SPROUT_NON_CONSTEXPR std::basic_string<Char, Traits, Alloc>
|
2012-06-20 16:40:38 +00:00
|
|
|
to_string() const {
|
|
|
|
std::basic_string<Char, Traits, Alloc> result;
|
|
|
|
copy_to_string(result, Char('0'), Char('1'));
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
template<typename Char, typename Traits, typename Alloc>
|
2013-11-02 09:28:18 +00:00
|
|
|
SPROUT_NON_CONSTEXPR std::basic_string<Char, Traits, Alloc>
|
2012-06-20 16:40:38 +00:00
|
|
|
to_string(Char zero, Char one = Char('1')) const {
|
|
|
|
std::basic_string<Char, Traits, Alloc> result;
|
|
|
|
copy_to_string(result, zero, one);
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
template<typename Char, typename Traits>
|
2013-11-02 09:28:18 +00:00
|
|
|
SPROUT_NON_CONSTEXPR std::basic_string<Char, Traits, std::allocator<Char> >
|
2012-06-20 16:40:38 +00:00
|
|
|
to_string() const {
|
|
|
|
return to_string<Char, Traits, std::allocator<Char> >();
|
|
|
|
}
|
|
|
|
template<typename Char, typename Traits>
|
2013-11-02 09:28:18 +00:00
|
|
|
SPROUT_NON_CONSTEXPR std::basic_string<Char, Traits, std::allocator<Char> >
|
2012-06-20 16:40:38 +00:00
|
|
|
to_string(Char zero, Char one = Char('1')) const {
|
|
|
|
return to_string<Char, Traits, std::allocator<Char> >(zero, one);
|
|
|
|
}
|
2014-01-27 10:09:00 +00:00
|
|
|
template<typename Char>
|
2013-11-02 09:28:18 +00:00
|
|
|
SPROUT_NON_CONSTEXPR std::basic_string<Char, std::char_traits<Char>, std::allocator<Char> >
|
2012-06-20 16:40:38 +00:00
|
|
|
to_string() const {
|
|
|
|
return to_string<Char, std::char_traits<Char>, std::allocator<Char> >();
|
|
|
|
}
|
2014-01-27 10:09:00 +00:00
|
|
|
template<typename Char>
|
2013-11-02 09:28:18 +00:00
|
|
|
SPROUT_NON_CONSTEXPR std::basic_string<Char, std::char_traits<Char>, std::allocator<Char> >
|
2012-06-20 16:40:38 +00:00
|
|
|
to_string(Char zero, Char one = Char('1')) const {
|
|
|
|
return to_string<Char, std::char_traits<Char>, std::allocator<Char> >(zero, one);
|
|
|
|
}
|
2013-11-02 09:28:18 +00:00
|
|
|
SPROUT_NON_CONSTEXPR std::basic_string<char, std::char_traits<char>, std::allocator<char> >
|
2012-06-20 16:40:38 +00:00
|
|
|
to_string() const {
|
|
|
|
return to_string<char, std::char_traits<char>, std::allocator<char> >();
|
|
|
|
}
|
2013-11-02 09:28:18 +00:00
|
|
|
SPROUT_NON_CONSTEXPR std::basic_string<char, std::char_traits<char>, std::allocator<char> >
|
2012-06-20 16:40:38 +00:00
|
|
|
to_string(char zero, char one = '1') const {
|
|
|
|
return to_string<char, std::char_traits<char>, std::allocator<char> >(zero, one);
|
|
|
|
}
|
|
|
|
|
|
|
|
SPROUT_CONSTEXPR std::size_t
|
|
|
|
count() const SPROUT_NOEXCEPT {
|
|
|
|
return this->do_count();
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR std::size_t
|
|
|
|
size() const SPROUT_NOEXCEPT {
|
|
|
|
return N;
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR bool
|
|
|
|
operator==(bitset<N> const& rhs) const SPROUT_NOEXCEPT {
|
|
|
|
return this->is_equal(rhs);
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR bool
|
|
|
|
operator!=(bitset<N> const& rhs) const SPROUT_NOEXCEPT {
|
|
|
|
return !this->is_equal(rhs);
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR bool
|
|
|
|
test(std::size_t position) const {
|
|
|
|
return position >= N ? throw std::out_of_range("bitset::test")
|
|
|
|
: unchecked_test(position)
|
|
|
|
;
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR bool
|
|
|
|
all() const SPROUT_NOEXCEPT {
|
|
|
|
return this->template are_all<N>();
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR bool
|
|
|
|
any() const SPROUT_NOEXCEPT {
|
|
|
|
return this->is_any();
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR bool
|
|
|
|
none() const SPROUT_NOEXCEPT {
|
|
|
|
return !this->is_any();
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR bitset<N>
|
|
|
|
operator<<(std::size_t position) const SPROUT_NOEXCEPT {
|
|
|
|
return position < N
|
|
|
|
? bitset(this->do_left_shift(position)).do_sanitize_c()
|
|
|
|
: bitset(this->do_reset())
|
|
|
|
;
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR bitset<N>
|
|
|
|
operator>>(std::size_t position) const SPROUT_NOEXCEPT {
|
|
|
|
return position < N
|
|
|
|
? bitset(this->do_right_shift(position)).do_sanitize_c()
|
|
|
|
: bitset(this->do_reset())
|
|
|
|
;
|
|
|
|
}
|
|
|
|
|
|
|
|
SPROUT_CONSTEXPR std::size_t
|
|
|
|
find_first() const SPROUT_NOEXCEPT {
|
|
|
|
return this->find_first(N);
|
|
|
|
}
|
|
|
|
SPROUT_CONSTEXPR std::size_t
|
|
|
|
find_next(std::size_t prev) const SPROUT_NOEXCEPT {
|
|
|
|
return this->find_next(prev, N);
|
|
|
|
}
|
|
|
|
|
|
|
|
public:
|
|
|
|
template<std::size_t M>
|
|
|
|
friend SPROUT_CONSTEXPR sprout::bitset<M>
|
|
|
|
sprout::operator&(sprout::bitset<M> const& lhs, sprout::bitset<M> const& rhs) SPROUT_NOEXCEPT;
|
|
|
|
template<std::size_t M>
|
|
|
|
friend SPROUT_CONSTEXPR sprout::bitset<M>
|
|
|
|
sprout::operator|(sprout::bitset<M> const& lhs, sprout::bitset<M> const& rhs) SPROUT_NOEXCEPT;
|
|
|
|
template<std::size_t M>
|
|
|
|
friend SPROUT_CONSTEXPR sprout::bitset<M>
|
|
|
|
sprout::operator^(sprout::bitset<M> const& lhs, sprout::bitset<M> const& rhs) SPROUT_NOEXCEPT;
|
|
|
|
template<typename Char, typename Traits, std::size_t M>
|
2013-11-02 09:28:18 +00:00
|
|
|
friend SPROUT_NON_CONSTEXPR std::basic_istream<Char, Traits>&
|
2012-06-20 16:40:38 +00:00
|
|
|
sprout::operator>>(std::basic_istream<Char, Traits>& lhs, sprout::bitset<M>& rhs);
|
|
|
|
template<typename Char, typename Traits, std::size_t M>
|
2013-11-02 09:28:18 +00:00
|
|
|
friend SPROUT_NON_CONSTEXPR std::basic_ostream<Char, Traits>&
|
2012-06-20 16:40:38 +00:00
|
|
|
sprout::operator<<(std::basic_ostream<Char, Traits>& lhs, sprout::bitset<M> const& rhs);
|
|
|
|
|
|
|
|
template<std::size_t M>
|
|
|
|
friend SPROUT_CONSTEXPR std::size_t
|
|
|
|
hash_value(sprout::bitset<M> const& v);
|
|
|
|
};
|
|
|
|
} // namespace sprout
|
|
|
|
|
|
|
|
#endif // #ifndef SPROUT_BITSET_BITSET_HPP
|