2
0
mirror of https://github.com/boostorg/yap.git synced 2026-01-22 18:02:12 +00:00
Files
yap/example/vector.cpp
2016-12-07 20:01:24 -06:00

129 lines
4.2 KiB
C++

#include "expression.hpp"
#include <vector>
#include <iostream>
struct take_nth
{
template <typename T>
auto operator() (boost::proto17::terminal_tag, std::vector<T> const & vec)
{ return boost::proto17::make_terminal(std::move(vec[n])); }
std::size_t n;
};
template <typename T>
using vector_terminal = boost::proto17::expression<
boost::proto17::expr_kind::terminal,
boost::hana::tuple<std::vector<T>>
>;
struct equal_sizes_impl
{
template <typename T>
auto operator() (vector_terminal<T> const & expr)
{
auto const expr_size = boost::proto17::value(expr).size();
if (expr_size != size)
value = false;
return expr;
}
std::size_t const size;
bool value;
};
template <typename Expr>
bool equal_sizes (std::size_t size, Expr const & expr)
{
equal_sizes_impl impl{size, true};
boost::proto17::transform(expr, impl);
return impl.value;
}
template <typename T, typename Expr>
std::vector<T> & assign (std::vector<T> & vec, Expr const & e)
{
decltype(auto) expr = boost::proto17::as_expr(e);
assert(equal_sizes(vec.size(), expr));
for (std::size_t i = 0, size = vec.size(); i < size; ++i) {
vec[i] = boost::proto17::evaluate(boost::proto17::transform(expr, take_nth{i}));
}
return vec;
}
template <typename T, typename Expr>
std::vector<T> & operator+= (std::vector<T> & vec, Expr const & e)
{
decltype(auto) expr = boost::proto17::as_expr(e);
assert(equal_sizes(vec.size(), expr));
for (std::size_t i = 0, size = vec.size(); i < size; ++i) {
vec[i] += boost::proto17::evaluate(boost::proto17::transform(expr, take_nth{i}));
}
return vec;
}
template <typename T>
struct is_vector : std::false_type {};
template <typename T, typename A>
struct is_vector<std::vector<T, A>> : std::true_type {};
BOOST_PROTO17_USER_UDT_ANY_BINARY_OPERATOR(negate, boost::proto17::expression, is_vector); // -
BOOST_PROTO17_USER_UDT_ANY_BINARY_OPERATOR(multiplies, boost::proto17::expression, is_vector); // *
BOOST_PROTO17_USER_UDT_ANY_BINARY_OPERATOR(divides, boost::proto17::expression, is_vector); // /
BOOST_PROTO17_USER_UDT_ANY_BINARY_OPERATOR(modulus, boost::proto17::expression, is_vector); // %
BOOST_PROTO17_USER_UDT_ANY_BINARY_OPERATOR(plus, boost::proto17::expression, is_vector); // +
BOOST_PROTO17_USER_UDT_ANY_BINARY_OPERATOR(minus, boost::proto17::expression, is_vector); // -
BOOST_PROTO17_USER_UDT_ANY_BINARY_OPERATOR(less, boost::proto17::expression, is_vector); // <
BOOST_PROTO17_USER_UDT_ANY_BINARY_OPERATOR(greater, boost::proto17::expression, is_vector); // >
BOOST_PROTO17_USER_UDT_ANY_BINARY_OPERATOR(less_equal, boost::proto17::expression, is_vector); // <=
BOOST_PROTO17_USER_UDT_ANY_BINARY_OPERATOR(greater_equal, boost::proto17::expression, is_vector); // >=
BOOST_PROTO17_USER_UDT_ANY_BINARY_OPERATOR(equal_to, boost::proto17::expression, is_vector); // ==
BOOST_PROTO17_USER_UDT_ANY_BINARY_OPERATOR(not_equal_to, boost::proto17::expression, is_vector); // !=
BOOST_PROTO17_USER_UDT_ANY_BINARY_OPERATOR(logical_or, boost::proto17::expression, is_vector); // ||
BOOST_PROTO17_USER_UDT_ANY_BINARY_OPERATOR(logical_and, boost::proto17::expression, is_vector); // &&
BOOST_PROTO17_USER_UDT_ANY_BINARY_OPERATOR(bitwise_and, boost::proto17::expression, is_vector); // &
BOOST_PROTO17_USER_UDT_ANY_BINARY_OPERATOR(bitwise_or, boost::proto17::expression, is_vector); // |
BOOST_PROTO17_USER_UDT_ANY_BINARY_OPERATOR(bitwise_xor, boost::proto17::expression, is_vector); // ^
int main()
{
int i;
int const n = 10;
std::vector<int> a,b,c,d;
std::vector<double> e(n);
for (i = 0; i < n; ++i)
{
a.push_back(i);
b.push_back(2*i);
c.push_back(3*i);
d.push_back(i);
}
assign(b, 2);
assign(d, a + b * c);
if_else(d < 30, b, c);
a += if_else(d < 30, b, c);
assign(e, c);
e += e - 4 / (c + 1);
for (i = 0; i < n; ++i)
{
std::cout
<< " a(" << i << ") = " << a[i]
<< " b(" << i << ") = " << b[i]
<< " c(" << i << ") = " << c[i]
<< " d(" << i << ") = " << d[i]
<< " e(" << i << ") = " << e[i]
<< std::endl;
}
return 0;
}