2.cc: New.

2006-08-28  Paolo Carlini  <pcarlini@suse.de>
	    Roger Sayle  <roger@eyesopen.com>

	* testsuite/25_algorithms/nth_element/2.cc: New.

Co-Authored-By: Roger Sayle <roger@eyesopen.com>

From-SVN: r116508
This commit is contained in:
Paolo Carlini 2006-08-28 13:26:22 +00:00 committed by Paolo Carlini
parent 8d8e3aa02c
commit da8c0ebea2
2 changed files with 80 additions and 0 deletions

View File

@ -1,3 +1,8 @@
2006-08-28 Paolo Carlini <pcarlini@suse.de>
Roger Sayle <roger@eyesopen.com>
* testsuite/25_algorithms/nth_element/2.cc: New.
2006-08-27 Paolo Carlini <pcarlini@suse.de>
PR libstdc++/28830

View File

@ -0,0 +1,75 @@
// Copyright (C) 2006 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 2, or (at your option)
// any later version.
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
// You should have received a copy of the GNU General Public License along
// with this library; see the file COPYING. If not, write to the Free
// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
// USA.
// 25.3.2 [lib.alg.nth.element]
#include <vector>
#include <algorithm>
#include <testsuite_hooks.h>
void
test_set(std::vector<int>& v, int size)
{
v.clear();
for (int i = 0; i < size; i += 4)
{
v.push_back(i / 2);
v.push_back((size - 2) - (i / 2));
}
for (int i = 1; i < size; i += 2)
v.push_back(i);
}
void
do_test01(int size)
{
bool test __attribute__((unused)) = true;
std::vector<int> v, s;
for (int j = 0; j < size; ++j)
{
test_set(v, size);
s = v;
std::sort(s.begin(), s.end());
std::nth_element(v.begin(), v.begin() + j, v.end());
VERIFY( v[j] == s[j] );
for (int i = 0; i < j; ++i)
VERIFY( !(v[j] < v[i]) );
for (int i = j; i < v.size(); ++i)
VERIFY( !(v[i] < v[j]) );
}
}
void
test01()
{
for (int size = 4; size <= 1 << 10; size <<= 1)
do_test01(size);
}
int main()
{
test01();
return 0;
}