King_DuckZ/Sprout
1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout synced 2025-08-03 12:49:50 +00:00
Code Issues Releases Wiki Activity

modify namespace result_of -> results

Browse source 
support C++14 type_traits
This commit is contained in:
bolero-MURAKAMI 2013-11-20 22:04:11 +09:00
parent d386893a74
commit bf0c7021cf
350 changed files with 2628 additions and 1912 deletions
Download patch file Download diff file Expand all files Collapse all files

50
sprout/weed/attr_cnv/bitwise_or.hpp
View file

@ -24,7 +24,7 @@
#include <sprout/weed/detail/is_elem_and_unused.hpp>
#include <sprout/weed/detail/is_unused_and_elem.hpp>
#include <sprout/weed/detail/is_both_unused.hpp>
#include <sprout/weed/attr_cnv/result_of/bitwise_or.hpp>
#include <sprout/weed/attr_cnv/results/bitwise_or.hpp>
namespace sprout {
namespace weed {
@ -36,9 +36,9 @@ namespace sprout {
template<typename T, typename U, typename X>
inline SPROUT_CONSTEXPR typename std::enable_if<
sprout::weed::detail::is_same_container<T, U>::value,
typename sprout::weed::attr_cnv::result_of::bitwise_or<T, U>::type
typename sprout::weed::attr_cnv::results::bitwise_or<T, U>::type
>::type bitwise_or(X const& x) {
typedef typename sprout::weed::attr_cnv::result_of::bitwise_or<T, U>::type type;
typedef typename sprout::weed::attr_cnv::results::bitwise_or<T, U>::type type;
return sprout::fixed::realign_to<type>(x);
}
// container<V, N> | V -> container<V, N ? N : 1>
@ -46,18 +46,18 @@ namespace sprout {
inline SPROUT_CONSTEXPR typename std::enable_if<
sprout::weed::detail::is_container_and_elem<T, U>::value
&& sprout::weed::traits::is_container<X>::value,
typename sprout::weed::attr_cnv::result_of::bitwise_or<T, U>::type
typename sprout::weed::attr_cnv::results::bitwise_or<T, U>::type
>::type bitwise_or(X const& x) {
typedef typename sprout::weed::attr_cnv::result_of::bitwise_or<T, U>::type type;
typedef typename sprout::weed::attr_cnv::results::bitwise_or<T, U>::type type;
return sprout::fixed::realign_to<type>(x);
}
template<typename T, typename U, typename X>
inline SPROUT_CONSTEXPR typename std::enable_if<
sprout::weed::detail::is_container_and_elem<T, U>::value
&& !sprout::weed::traits::is_container<X>::value,
typename sprout::weed::attr_cnv::result_of::bitwise_or<T, U>::type
typename sprout::weed::attr_cnv::results::bitwise_or<T, U>::type
>::type bitwise_or(X const& x) {
typedef typename sprout::weed::attr_cnv::result_of::bitwise_or<T, U>::type type;
typedef typename sprout::weed::attr_cnv::results::bitwise_or<T, U>::type type;
return sprout::make<type>(x);
}
// V | container<V, N> -> container<V, N ? N : 1>
@ -65,34 +65,34 @@ namespace sprout {
inline SPROUT_CONSTEXPR typename std::enable_if<
sprout::weed::detail::is_elem_and_container<T, U>::value
&& sprout::weed::traits::is_container<X>::value,
typename sprout::weed::attr_cnv::result_of::bitwise_or<T, U>::type
typename sprout::weed::attr_cnv::results::bitwise_or<T, U>::type
>::type bitwise_or(X const& x) {
typedef typename sprout::weed::attr_cnv::result_of::bitwise_or<T, U>::type type;
typedef typename sprout::weed::attr_cnv::results::bitwise_or<T, U>::type type;
return sprout::fixed::realign_to<type>(x);
}
template<typename T, typename U, typename X>
inline SPROUT_CONSTEXPR typename std::enable_if<
sprout::weed::detail::is_elem_and_container<T, U>::value
&& !sprout::weed::traits::is_container<X>::value,
typename sprout::weed::attr_cnv::result_of::bitwise_or<T, U>::type
typename sprout::weed::attr_cnv::results::bitwise_or<T, U>::type
>::type bitwise_or(X const& x) {
typedef typename sprout::weed::attr_cnv::result_of::bitwise_or<T, U>::type type;
typedef typename sprout::weed::attr_cnv::results::bitwise_or<T, U>::type type;
return sprout::make<type>(x);
}
// tuple<Vs...> | tuple<Ws...> -> tuple<max(Vs..., Ws...)>
template<typename T, typename U, typename X>
inline SPROUT_CONSTEXPR typename std::enable_if<
sprout::weed::detail::is_both_tuple<T, U>::value,
typename sprout::weed::attr_cnv::result_of::bitwise_or<T, U>::type
typename sprout::weed::attr_cnv::results::bitwise_or<T, U>::type
>::type bitwise_or(X const& x) {
typedef typename sprout::weed::attr_cnv::result_of::bitwise_or<T, U>::type type;
typedef typename sprout::weed::attr_cnv::results::bitwise_or<T, U>::type type;
return sprout::tuples::copy(type(), x);
}
// V | V -> V
template<typename T, typename U, typename X>
inline SPROUT_CONSTEXPR typename std::enable_if<
sprout::weed::detail::is_same_elem<T, U>::value,
typename sprout::weed::attr_cnv::result_of::bitwise_or<T, U>::type
typename sprout::weed::attr_cnv::results::bitwise_or<T, U>::type
>::type bitwise_or(X const& x) {
return x;
}
@ -100,27 +100,27 @@ namespace sprout {
template<typename T, typename U, typename X>
inline SPROUT_CONSTEXPR typename std::enable_if<
sprout::weed::detail::is_different_elem<T, U>::value,
typename sprout::weed::attr_cnv::result_of::bitwise_or<T, U>::type
typename sprout::weed::attr_cnv::results::bitwise_or<T, U>::type
>::type bitwise_or(X const& x) {
return typename sprout::weed::attr_cnv::result_of::bitwise_or<T, U>::type(x);
return typename sprout::weed::attr_cnv::results::bitwise_or<T, U>::type(x);
}
// V | unused -> container<V, 1>
template<typename T, typename U, typename X>
inline SPROUT_CONSTEXPR typename std::enable_if<
sprout::weed::detail::is_elem_and_unused<T, U>::value
&& !sprout::weed::traits::is_unused<X>::value,
typename sprout::weed::attr_cnv::result_of::bitwise_or<T, U>::type
typename sprout::weed::attr_cnv::results::bitwise_or<T, U>::type
>::type bitwise_or(X const& x) {
typedef typename sprout::weed::attr_cnv::result_of::bitwise_or<T, U>::type type;
typedef typename sprout::weed::attr_cnv::results::bitwise_or<T, U>::type type;
return sprout::make<type>(x);
}
template<typename T, typename U, typename X>
inline SPROUT_CONSTEXPR typename std::enable_if<
sprout::weed::detail::is_elem_and_unused<T, U>::value
&& sprout::weed::traits::is_unused<X>::value,
typename sprout::weed::attr_cnv::result_of::bitwise_or<T, U>::type
typename sprout::weed::attr_cnv::results::bitwise_or<T, U>::type
>::type bitwise_or(X const&) {
typedef typename sprout::weed::attr_cnv::result_of::bitwise_or<T, U>::type type;
typedef typename sprout::weed::attr_cnv::results::bitwise_or<T, U>::type type;
return sprout::make<type>();
}
// unused | V -> container<V, 1>
@ -128,25 +128,25 @@ namespace sprout {
inline SPROUT_CONSTEXPR typename std::enable_if<
sprout::weed::detail::is_unused_and_elem<T, U>::value
&& !sprout::weed::traits::is_unused<X>::value,
typename sprout::weed::attr_cnv::result_of::bitwise_or<T, U>::type
typename sprout::weed::attr_cnv::results::bitwise_or<T, U>::type
>::type bitwise_or(X const& x) {
typedef typename sprout::weed::attr_cnv::result_of::bitwise_or<T, U>::type type;
typedef typename sprout::weed::attr_cnv::results::bitwise_or<T, U>::type type;
return sprout::make<type>(x);
}
template<typename T, typename U, typename X>
inline SPROUT_CONSTEXPR typename std::enable_if<
sprout::weed::detail::is_unused_and_elem<T, U>::value
&& sprout::weed::traits::is_unused<X>::value,
typename sprout::weed::attr_cnv::result_of::bitwise_or<T, U>::type
typename sprout::weed::attr_cnv::results::bitwise_or<T, U>::type
>::type bitwise_or(X const&) {
typedef typename sprout::weed::attr_cnv::result_of::bitwise_or<T, U>::type type;
typedef typename sprout::weed::attr_cnv::results::bitwise_or<T, U>::type type;
return sprout::make<type>();
}
// unused | unused -> unused
template<typename T, typename U, typename X>
inline SPROUT_CONSTEXPR typename std::enable_if<
sprout::weed::detail::is_both_unused<T, U>::value,
typename sprout::weed::attr_cnv::result_of::bitwise_or<T, U>::type
typename sprout::weed::attr_cnv::results::bitwise_or<T, U>::type
>::type bitwise_or(X const&) {
return sprout::weed::unused();
}