modernize-use-transparent-functors.cpp
3.32 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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
// RUN: %check_clang_tidy -std=c++14-or-later %s modernize-use-transparent-functors %t
namespace std {
template<class T>
struct remove_reference;
template <class T>
constexpr T &&forward(typename std::remove_reference<T>::type &t);
template <class T>
constexpr T &&forward(typename std::remove_reference<T>::type &&t);
template <typename T = void>
struct plus {
constexpr T operator()(const T &Lhs, const T &Rhs) const;
};
template <>
struct plus<void> {
template <typename T, typename U>
constexpr auto operator()(T &&Lhs, U &&Rhs) const ->
decltype(forward<T>(Lhs) + forward<U>(Rhs));
};
template <typename T = void>
struct less {
constexpr bool operator()(const T &Lhs, const T &Rhs) const;
};
template <>
struct less<void> {
template <typename T, typename U>
constexpr bool operator()(T &&Lhs, U &&Rhs) const;
};
template <typename T = void>
struct logical_not {
constexpr bool operator()(const T &Arg) const;
};
template <>
struct logical_not<void> {
template <typename T>
constexpr bool operator()(T &&Arg) const;
};
template <typename T>
class allocator;
template <
class Key,
class Compare = std::less<>,
class Allocator = std::allocator<Key>>
class set {};
template <
class Key,
class Compare = std::less<Key>,
class Allocator = std::allocator<Key>>
class set2 {};
template <class InputIt, class UnaryPredicate>
InputIt find_if(InputIt first, InputIt last,
UnaryPredicate p);
template <class RandomIt, class Compare>
void sort(RandomIt first, RandomIt last, Compare comp);
class iterator {};
class string {};
}
int main() {
using std::set;
using std::less;
std::set<int, std::less<int>> s;
// CHECK-MESSAGES: :[[@LINE-1]]:17: warning: prefer transparent functors 'less<>' [modernize-use-transparent-functors]
// CHECK-FIXES: {{^}} std::set<int, std::less<>> s;{{$}}
set<int, std::less<int>> s2;
// CHECK-MESSAGES: :[[@LINE-1]]:12: warning: prefer transparent functors
// CHECK-FIXES: {{^}} set<int, std::less<>> s2;{{$}}
set<int, less<int>> s3;
// CHECK-MESSAGES: :[[@LINE-1]]:12: warning: prefer transparent functors
// CHECK-FIXES: {{^}} set<int, less<>> s3;{{$}}
std::set<int, std::less<>> s4;
std::set<char *, std::less<std::string>> s5;
std::set<set<int, less<int>>, std::less<>> s6;
// CHECK-MESSAGES: :[[@LINE-1]]:21: warning: prefer transparent functors
// CHECK-FIXES: {{^}} std::set<set<int, less<>>, std::less<>> s6;{{$}}
std::iterator begin, end;
sort(begin, end, std::less<int>());
// CHECK-MESSAGES: :[[@LINE-1]]:20: warning: prefer transparent functors
std::sort(begin, end, std::less<>());
find_if(begin, end, std::logical_not<bool>());
// CHECK-MESSAGES: :[[@LINE-1]]:23: warning: prefer transparent functors
std::find_if(begin, end, std::logical_not<>());
using my_set = std::set<int, std::less<int>>;
// CHECK-MESSAGES: :[[@LINE-1]]:32: warning: prefer transparent functors
// CHECK-FIXES: {{^}} using my_set = std::set<int, std::less<>>;{{$}}
using my_set2 = std::set<char*, std::less<std::string>>;
using my_less = std::less<std::string>;
find_if(begin, end, my_less());
// CHECK-MESSAGES: :[[@LINE-1]]:23: warning: prefer transparent functors
std::set2<int> control;
}
struct ImplicitTypeLoc : std::set2<std::less<int>> {
// CHECK-MESSAGES: :[[@LINE-1]]:36: warning: prefer transparent functors
ImplicitTypeLoc() {}
};