2
0
mirror of https://github.com/boostorg/phoenix.git synced 2026-02-15 13:22:14 +00:00
Files
phoenix/test/scope/this.cpp
Thomas Heller e9958b568b added support for recursion, added _this
[SVN r68464]
2011-01-27 08:03:25 +00:00

87 lines
1.7 KiB
C++

#include <boost/phoenix/core.hpp>
#include <boost/phoenix/scope/this.hpp>
#include <boost/phoenix/statement.hpp>
#include <boost/phoenix/operator.hpp>
template <typename T0>
void f(T0 t)
{
std::cout << t(1) << "\n";
std::cout << t(2) << "\n";
std::cout << t(3) << "\n";
std::cout << t(4) << "\n";
std::cout << t(5) << "\n";
std::cout << t(6) << "\n";
std::cout << t(7) << "\n";
}
template <typename T0>
void f_2(T0 t)
{
for(int i = 0; i < 10; ++i)
{
for(int j = 0; j < i; ++j)
{
std::cout << t(i, j) << " ";
}
std::cout << "\n";
}
}
int main()
{
using boost::phoenix::_this;
using boost::phoenix::if_;
using boost::phoenix::if_else;
using boost::phoenix::val;
using boost::phoenix::arg_names::_1;
using boost::phoenix::arg_names::_2;
int res;
f((
if_(_1 == 0)
[
std::cout << val("\n")
]
.else_
[
std::cout << _1 << " "
, _this(_1 - 1)
]
, val("")
));
f(( // fac(n) = n * fac(n-1); fac(1) = 1
if_else(
_1 <= 1
, 1
, _1 * _this(_1 - 1)
)
));
f(( // fib(n) = fib(n-1) + fib(n-2); fib(0) = 0; fib(1) = 1
if_else(
_1 == 0
, 0
, if_else(
_1 == 1
, 1
, _this(_1 - 1) + _this(_1 - 2)
)
)
));
f_2(( // bin(n, k) = bin(n-1, k-1) + bin(n-1, k); bin(n, 0) = 1; bin(0, k) = 0
if_else(
_1 == 0
, 0
, if_else(
_2 == 0
, 1
, _this(_1 - 1, _2 - 1) + _this(_1 - 1, _2)
)
)
));
}