blob: e7c242c2776088dd619387c513a5c329447eb448 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
|
// Copyright (C) 2009-2012 Lorenzo Caminiti
// Distributed under the Boost Software License, Version 1.0
// (see accompanying file LICENSE_1_0.txt or a copy at
// http://www.boost.org/LICENSE_1_0.txt)
// Home at http://www.boost.org/libs/local_function
#include <boost/local_function.hpp>
#include <boost/typeof/typeof.hpp>
#include BOOST_TYPEOF_INCREMENT_REGISTRATION_GROUP()
#include <boost/detail/lightweight_test.hpp>
#include <algorithm>
#include <vector>
struct calculator;
BOOST_TYPEOF_REGISTER_TYPE(calculator) // Register before `bind this_` below.
struct calculator {
std::vector<int> results;
void factorials(const std::vector<int>& nums) {
int BOOST_LOCAL_FUNCTION( (bind this_) (int num)
(bool recursion)(default false) ) {
int result = 0;
if(num <= 0) result = 1;
else result = num * factorial(num - 1, true);
if(!recursion) this_->results.push_back(result);
return result;
} BOOST_LOCAL_FUNCTION_NAME(recursive factorial)
std::for_each(nums.begin(), nums.end(), factorial);
}
};
int main(void) {
std::vector<int> v(3);
v[0] = 1; v[1] = 3; v[2] = 4;
calculator calc;
calc.factorials(v);
BOOST_TEST(calc.results[0] == 1);
BOOST_TEST(calc.results[1] == 6);
BOOST_TEST(calc.results[2] == 24);
return boost::report_errors();
}
|
