mirror of
https://github.com/autc04/Retro68.git
synced 2024-07-26 23:30:13 +00:00
52 lines
1.5 KiB
C++
52 lines
1.5 KiB
C++
// { dg-options "-std=gnu++0x" }
|
|
|
|
// 2007-10-14 Paolo Carlini <pcarlini@suse.de>
|
|
//
|
|
// Copyright (C) 2007-2014 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/>.
|
|
|
|
// 25.3.6 Heap operations [lib.alg.heap.operations]
|
|
|
|
#include <algorithm>
|
|
#include <functional>
|
|
#include <testsuite_hooks.h>
|
|
|
|
int A[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
|
|
int B[] = {9, 8, 7, 6, 5, 4, 3, 2, 1, 0};
|
|
const int N = sizeof(A) / sizeof(int);
|
|
|
|
void
|
|
test01()
|
|
{
|
|
bool test __attribute__((unused)) = true;
|
|
|
|
for (int i = 0; i <= N; ++i)
|
|
{
|
|
VERIFY( A + i == std::is_sorted_until(A, A + i) );
|
|
VERIFY( A + i == std::is_sorted_until(A, A + i, std::less<int>()) );
|
|
VERIFY( B + i == std::is_sorted_until(B, B + i, std::greater<int>()) );
|
|
VERIFY( B + (i < 2 ? i : 1) == std::is_sorted_until(B, B + i) );
|
|
}
|
|
}
|
|
|
|
int
|
|
main()
|
|
{
|
|
test01();
|
|
return 0;
|
|
}
|