// Copyright (C) 2013-2015 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 // . // { dg-options "-std=gnu++11" } // { dg-options "-std=gnu++11 -DSIMULATOR_TEST" { target simulator } } // { dg-require-cstdint "" } // 25.4.1.4 [lib.alg.partial.sort.copy] #include #include #include #include #include #include using __gnu_test::test_container; using __gnu_test::random_access_iterator_wrapper; typedef test_container Container; struct testPartialSortCopy { template void operator()(Container con, RandomGen& rg) { bool test __attribute__((unused)) = true; const int size = con.end() - con.begin(); auto dist = std::uniform_int_distribution<>(0, size); const int element = dist(rg); std::vector outvec(element + 1); // add +1 to avoid empty issues Container out(outvec.data(), outvec.data() + element); std::partial_sort_copy(con.begin(), con.end(), out.begin(), out.begin() + element); VERIFY( std::is_sorted(out.begin(), out.begin() + element) ); std::sort(con.begin(), con.end()); for (int i = 0; i < element; ++i) VERIFY( con.val(i) == out.val(i) ); } }; int main() { __gnu_test::test_containers(testPartialSortCopy()); }