1 //===----------------------------------------------------------------------===// 2 // 3 // The LLVM Compiler Infrastructure 4 // 5 // This file is dual licensed under the MIT and the University of Illinois Open 6 // Source Licenses. See LICENSE.TXT for details. 7 // 8 //===----------------------------------------------------------------------===// 9 10 // <algorithm> 11 12 // template<class T, StrictWeakOrder<auto, T> Compare> 13 // requires !SameType<T, Compare> && CopyConstructible<Compare> 14 // pair<const T&, const T&> 15 // minmax(const T& a, const T& b, Compare comp); 16 17 #include <algorithm> 18 #include <functional> 19 #include <cassert> 20 21 template <class T, class C> 22 void 23 test(const T& a, const T& b, C c, const T& x, const T& y) 24 { 25 std::pair<const T&, const T&> p = std::minmax(a, b, c); 26 assert(&p.first == &x); 27 assert(&p.second == &y); 28 } 29 30 int main() 31 { 32 { 33 int x = 0; 34 int y = 0; 35 test(x, y, std::greater<int>(), x, y); 36 test(y, x, std::greater<int>(), y, x); 37 } 38 { 39 int x = 0; 40 int y = 1; 41 test(x, y, std::greater<int>(), y, x); 42 test(y, x, std::greater<int>(), y, x); 43 } 44 { 45 int x = 1; 46 int y = 0; 47 test(x, y, std::greater<int>(), x, y); 48 test(y, x, std::greater<int>(), x, y); 49 } 50 } 51
