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
|
// Copyright (C) 2013-2017 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 3, 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 COPYING3. If not see
// <http://www.gnu.org/licenses/>.
// { dg-options "-DSIMULATOR_TEST" { target simulator } }
// { dg-do run { target c++11 } }
// { dg-require-cstdint "" }
// 25.4.2 [lib.alg.nth.element]
#include <algorithm>
#include <random>
#include <testsuite_hooks.h>
#include <testsuite_iterators.h>
#include <testsuite_containergen.h>
using __gnu_test::test_container;
using __gnu_test::random_access_iterator_wrapper;
typedef test_container<int, random_access_iterator_wrapper> Container;
struct testNthElement
{
template<typename Container, typename RandomGen>
void operator()(Container con, RandomGen& rg)
{
const int size = con.end() - con.begin();
auto dist = std::uniform_int_distribution<>(0, size);
const int element = dist(rg);
std::nth_element(con.begin(), con.begin() + element, con.end());
if (element < size)
{
for (int i = 0; i < element; ++i)
VERIFY( con.val(i) <= con.val(element) );
for (int i = element + 1; i < size; ++i)
VERIFY( con.val(i) >= con.val(element) );
}
}
};
int
main()
{
__gnu_test::test_containers<Container>(testNthElement());
}
|
