diff options
| author | Dimitry Andric <dim@FreeBSD.org> | 2015-09-06 18:46:46 +0000 | 
|---|---|---|
| committer | Dimitry Andric <dim@FreeBSD.org> | 2015-09-06 18:46:46 +0000 | 
| commit | 61b9a7258a7693d7f3674a5a1daf7b036ff1d382 (patch) | |
| tree | ec41ed70ffca97240e76f9a78bb2dedba28f310c /test/std/utilities/function.objects/func.wrap/func.wrap.func/func.wrap.func.alg/swap.pass.cpp | |
| parent | f857581820d15e410e9945d2fcd5f7163be25a96 (diff) | |
Notes
Diffstat (limited to 'test/std/utilities/function.objects/func.wrap/func.wrap.func/func.wrap.func.alg/swap.pass.cpp')
| -rw-r--r-- | test/std/utilities/function.objects/func.wrap/func.wrap.func/func.wrap.func.alg/swap.pass.cpp | 123 | 
1 files changed, 123 insertions, 0 deletions
diff --git a/test/std/utilities/function.objects/func.wrap/func.wrap.func/func.wrap.func.alg/swap.pass.cpp b/test/std/utilities/function.objects/func.wrap/func.wrap.func/func.wrap.func.alg/swap.pass.cpp new file mode 100644 index 000000000000..58192c928d58 --- /dev/null +++ b/test/std/utilities/function.objects/func.wrap/func.wrap.func/func.wrap.func.alg/swap.pass.cpp @@ -0,0 +1,123 @@ +//===----------------------------------------------------------------------===// +// +//                     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 <MoveConstructible  R, MoveConstructible ... ArgTypes> +//   void swap(function<R(ArgTypes...)>&, function<R(ArgTypes...)>&); + + +#include <functional> +#include <cstdlib> +#include <cassert> + +#include "count_new.hpp" + +class A +{ +    int data_[10]; +public: +    static int count; + +    explicit A(int j) +    { +        ++count; +        data_[0] = j; +    } + +    A(const A& a) +    { +        ++count; +        for (int i = 0; i < 10; ++i) +            data_[i] = a.data_[i]; +    } + +    ~A() {--count;} + +    int operator()(int i) const +    { +        for (int j = 0; j < 10; ++j) +            i += data_[j]; +        return i; +    } + +    int id() const {return data_[0];} +}; + +int A::count = 0; + +int g(int) {return 0;} +int h(int) {return 1;} + +int main() +{ +    assert(globalMemCounter.checkOutstandingNewEq(0)); +    { +    std::function<int(int)> f1 = A(1); +    std::function<int(int)> f2 = A(2); +    assert(A::count == 2); +    assert(globalMemCounter.checkOutstandingNewEq(2)); +    assert(f1.target<A>()->id() == 1); +    assert(f2.target<A>()->id() == 2); +    swap(f1, f2); +    assert(A::count == 2); +    assert(globalMemCounter.checkOutstandingNewEq(2)); +    assert(f1.target<A>()->id() == 2); +    assert(f2.target<A>()->id() == 1); +    } +    assert(A::count == 0); +    assert(globalMemCounter.checkOutstandingNewEq(0)); +    { +    std::function<int(int)> f1 = A(1); +    std::function<int(int)> f2 = g; +    assert(A::count == 1); +    assert(globalMemCounter.checkOutstandingNewEq(1)); +    assert(f1.target<A>()->id() == 1); +    assert(*f2.target<int(*)(int)>() == g); +    swap(f1, f2); +    assert(A::count == 1); +    assert(globalMemCounter.checkOutstandingNewEq(1)); +    assert(*f1.target<int(*)(int)>() == g); +    assert(f2.target<A>()->id() == 1); +    } +    assert(A::count == 0); +    assert(globalMemCounter.checkOutstandingNewEq(0)); +    { +    std::function<int(int)> f1 = g; +    std::function<int(int)> f2 = A(1); +    assert(A::count == 1); +    assert(globalMemCounter.checkOutstandingNewEq(1)); +    assert(*f1.target<int(*)(int)>() == g); +    assert(f2.target<A>()->id() == 1); +    swap(f1, f2); +    assert(A::count == 1); +    assert(globalMemCounter.checkOutstandingNewEq(1)); +    assert(f1.target<A>()->id() == 1); +    assert(*f2.target<int(*)(int)>() == g); +    } +    assert(A::count == 0); +    assert(globalMemCounter.checkOutstandingNewEq(0)); +    { +    std::function<int(int)> f1 = g; +    std::function<int(int)> f2 = h; +    assert(A::count == 0); +    assert(globalMemCounter.checkOutstandingNewEq(0)); +    assert(*f1.target<int(*)(int)>() == g); +    assert(*f2.target<int(*)(int)>() == h); +    swap(f1, f2); +    assert(A::count == 0); +    assert(globalMemCounter.checkOutstandingNewEq(0)); +    assert(*f1.target<int(*)(int)>() == h); +    assert(*f2.target<int(*)(int)>() == g); +    } +    assert(A::count == 0); +    assert(globalMemCounter.checkOutstandingNewEq(0)); +}  | 
