ref_2.pass.cpp
1.31 KB
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
49
50
51
52
53
54
55
56
57
58
//===----------------------------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
// <functional>
// reference_wrapper
// template <ObjectType T> reference_wrapper<T> ref(reference_wrapper<T>t);
#include <functional>
#include <cassert>
#include "counting_predicates.h"
#include "test_macros.h"
bool is5 ( int i ) { return i == 5; }
template <typename T>
bool call_pred ( T pred ) { return pred(5); }
namespace adl {
struct A {};
void ref(A) {}
}
int main(int, char**)
{
{
int i = 0;
std::reference_wrapper<int> r1 = std::ref(i);
std::reference_wrapper<int> r2 = std::ref(r1);
assert(&r2.get() == &i);
}
{
adl::A a;
std::reference_wrapper<adl::A> a1 = std::ref(a);
std::reference_wrapper<adl::A> a2 = std::ref(a1);
assert(&a2.get() == &a);
}
{
unary_counting_predicate<bool(*)(int), int> cp(is5);
assert(!cp(6));
assert(cp.count() == 1);
assert(call_pred(cp));
assert(cp.count() == 1);
assert(call_pred(std::ref(cp)));
assert(cp.count() == 2);
}
return 0;
}