| //===----------------------------------------------------------------------===// |
| // |
| // The LLVM Compiler Infrastructure |
| // |
| // This file is dual licensed under the MIT and the University of Illinois Open |
| // Source Licenses. See LICENSE.TXT for details. |
| // |
| //===----------------------------------------------------------------------===// |
| |
| // <functional> |
| |
| // class function<R(ArgTypes...)> |
| |
| // template<class A> function(allocator_arg_t, const A&, function&&); |
| |
| #include <functional> |
| #include <cassert> |
| |
| #include "test_allocator.h" |
| |
| int new_called = 0; |
| |
| void* operator new(std::size_t s) throw(std::bad_alloc) |
| { |
| ++new_called; |
| return std::malloc(s); |
| } |
| |
| void operator delete(void* p) throw() |
| { |
| --new_called; |
| std::free(p); |
| } |
| |
| class A |
| { |
| int data_[10]; |
| public: |
| static int count; |
| |
| A() |
| { |
| ++count; |
| for (int i = 0; i < 10; ++i) |
| data_[i] = i; |
| } |
| |
| A(const A&) {++count;} |
| |
| ~A() {--count;} |
| |
| int operator()(int i) const |
| { |
| for (int j = 0; j < 10; ++j) |
| i += data_[j]; |
| return i; |
| } |
| }; |
| |
| int A::count = 0; |
| |
| int main() |
| { |
| #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES |
| assert(new_called == 0); |
| { |
| std::function<int(int)> f = A(); |
| assert(A::count == 1); |
| assert(new_called == 1); |
| assert(f.target<A>()); |
| assert(f.target<int(*)(int)>() == 0); |
| std::function<int(int)> f2(std::allocator_arg, test_allocator<A>(), std::move(f)); |
| assert(A::count == 1); |
| assert(new_called == 1); |
| assert(f2.target<A>()); |
| assert(f2.target<int(*)(int)>() == 0); |
| assert(f.target<A>() == 0); |
| assert(f.target<int(*)(int)>() == 0); |
| } |
| #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES |
| } |