Implement LWG-3865 Sorting a range of pairs#3476
Implement LWG-3865 Sorting a range of pairs#3476StephanTLavavej merged 5 commits intomicrosoft:mainfrom
pairs#3476Conversation
|
libc++ test has // Needed by do_forwarding_test() since it compares pairs of different types.
template <class T1, class T2, class U1, class U2>
inline bool operator==(const std::pair<T1, T2>& lhs, const std::pair<U1, U2>& rhs) {
return lhs.first == rhs.first && lhs.second == rhs.second;
}and because of that we get
|
|
I feel comfortable unmarking decision needed; given that it'd be pretty difficult to get broken by these changes, I'm totally willing to treat this as a DR. |
|
I'm mirroring this to the MSVC-internal repo - please notify me if any further changes are pushed. |
|
Thanks for implementing this significant usability improvement - one of my top annoyances from C++98! 😻 🎉 ✨ |
Fixes #3419