git
/
gcc
mirror of git://gcc.gnu.org/git/gcc.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

re PR libstdc++/40600 (pair& operator=(pair&& __p) doesn't work without inlining) 

2009-06-30  Paolo Carlini  <paolo.carlini@oracle.com>

	PR libstdc++/40600
	* testsuite/25_algorithms/minmax/2.cc: Fix consistently with
	std::minmax return type.
	* testsuite/25_algorithms/minmax/3.cc: Likewise.

From-SVN: r149094
This commit is contained in:
Paolo Carlini 2009-06-30 12:09:57 +00:00 committed by Paolo Carlini
parent d8dc68cb63
commit a0560e75a7
3 changed files with 19 additions and 12 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
libstdc++-v3/ChangeLog
View File

@ -1,3 +1,10 @@
2009-06-30 Paolo Carlini <paolo.carlini@oracle.com>
PR libstdc++/40600
* testsuite/25_algorithms/minmax/2.cc: Fix consistently with
std::minmax return type.
* testsuite/25_algorithms/minmax/3.cc: Likewise.
2009-06-30 Paolo Carlini <paolo.carlini@oracle.com> 2009-06-30 Paolo Carlini <paolo.carlini@oracle.com>
PR libstdc++/40511 PR libstdc++/40511

12
libstdc++-v3/testsuite/25_algorithms/minmax/2.cc
View File

@ -27,9 +27,9 @@ void test01()
{ {
bool test __attribute__((unused)) = true; bool test __attribute__((unused)) = true;
std::pair<const int&, const int&> z = std::minmax({1, 2, 3}); std::pair<int, int> z = std::minmax({1, 2, 3});
std::pair<const int&, const int&> w = std::minmax({4, 3, 5, 4}); std::pair<int, int> w = std::minmax({4, 3, 5, 4});
std::pair<const int&, const int&> y = std::minmax({4, 5, 3, 7, 3}); std::pair<int, int> y = std::minmax({4, 5, 3, 7, 3});
VERIFY( z.first == 1 ); VERIFY( z.first == 1 );
VERIFY( z.second == 3 ); VERIFY( z.second == 3 );
VERIFY( w.first == 3 ); VERIFY( w.first == 3 );
@ -37,13 +37,13 @@ void test01()
VERIFY( y.first == 3 ); VERIFY( y.first == 3 );
VERIFY( y.second == 7 ); VERIFY( y.second == 7 );
std::pair<const int&, const int&> zc = std::pair<int, int> zc =
std::minmax({1, 2, 3}, std::greater<int>()); std::minmax({1, 2, 3}, std::greater<int>());
std::pair<const int&, const int&> wc = std::pair<int, int> wc =
std::minmax({4, 3, 5, 4}, std::greater<int>()); std::minmax({4, 3, 5, 4}, std::greater<int>());
std::pair<const int&, const int&> yc = std::pair<int, int> yc =
std::minmax({4, 5, 3, 7, 3}, std::greater<int>()); std::minmax({4, 5, 3, 7, 3}, std::greater<int>());
VERIFY( zc.first == 3 ); VERIFY( zc.first == 3 );

2
libstdc++-v3/testsuite/25_algorithms/minmax/3.cc
View File

@ -41,7 +41,7 @@ void test01()
{ {
bool test __attribute__((unused)) = true; bool test __attribute__((unused)) = true;
std::pair<const int&, const int&> z = std::minmax({1, 2, 3, 4, 5, 6, 7, 8}, std::pair<int, int> z = std::minmax({1, 2, 3, 4, 5, 6, 7, 8},
compare_counter()); compare_counter());
// If N is the number of arguments in the minmax function call, // If N is the number of arguments in the minmax function call,