URL
https://opencores.org/ocsvn/openrisc_2011-10-31/openrisc_2011-10-31/trunk
Subversion Repositories openrisc_2011-10-31
[/] [openrisc/] [tags/] [gnu-src/] [gcc-4.5.1/] [gcc-4.5.1-or32-1.0rc3/] [libstdc++-v3/] [testsuite/] [25_algorithms/] [upper_bound/] [2.cc] - Rev 424
Go to most recent revision | Compare with Previous | Blame | View Log
// Copyright (C) 2001, 2009 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.3 [lib.alg.binary.search] Binary search algorithms. #include <algorithm> #include <testsuite_hooks.h> bool test __attribute__((unused)) = true; const int A[] = {1, 2, 3, 3, 3, 5, 8}; const int C[] = {8, 5, 3, 3, 3, 2, 1}; const int N = sizeof(A) / sizeof(int); // A comparison, equalivalent to std::greater<int> without the // dependency on <functional>. struct gt { bool operator()(const int& x, const int& y) const { return x > y; } }; // Each test performs general-case, bookend, not-found condition, // and predicate functional checks. // 25.3.3.2 upper_bound, with and without comparison predicate void test02() { using std::upper_bound; const int first = A[0]; const int last = A[N - 1]; const int* p = upper_bound(A, A + N, 3); VERIFY(p == A + 5); const int* q = upper_bound(A, A + N, first); VERIFY(q == A + 1); const int* r = upper_bound(A, A + N, last); VERIFY(r == A + N); const int* s = upper_bound(A, A + N, 4); VERIFY(s == A + 5); const int* t = upper_bound(C, C + N, 3, gt()); VERIFY(t == C + 5); const int* u = upper_bound(C, C + N, first, gt()); VERIFY(u == C + N); const int* v = upper_bound(C, C + N, last, gt()); VERIFY(v == C + 1); const int* w = upper_bound(C, C + N, 4, gt()); VERIFY(w == C + 2); } int main() { test02(); return 0; }
Go to most recent revision | Compare with Previous | Blame | View Log