libstdc++-v3/testsuite/25_algorithms/upper_bound/1.cc

   1 // Copyright (C) 2005-2024 Free Software Foundation, Inc.
   2 //
   3 // This file is part of the GNU ISO C++ Library.  This library is free
   4 // software; you can redistribute it and/or modify it under the
   5 // terms of the GNU General Public License as published by the
   6 // Free Software Foundation; either version 3, or (at your option)
   7 // any later version.
   8
   9 // This library is distributed in the hope that it will be useful,
  10 // but WITHOUT ANY WARRANTY; without even the implied warranty of
  11 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  12 // GNU General Public License for more details.
  13
  14 // You should have received a copy of the GNU General Public License along
  15 // with this library; see the file COPYING3.  If not see
  16 // <http://www.gnu.org/licenses/>.
  17
  18 // 25.3.3.2 [lib.upper.bound]
  19
  20 #include <algorithm>
  21 #include <testsuite_hooks.h>
  22 #include <testsuite_iterators.h>
  23
  24 using __gnu_test::test_container;
  25 using __gnu_test::forward_iterator_wrapper;
  26 using std::upper_bound;
  27
  28 typedef test_container<int, forward_iterator_wrapper> Container;
  29 int array[] = {0, 0, 0, 0, 1, 1, 1, 1};
  30
  31 void
  32 test1()
  33 {
  34   for(int i = 0; i < 5; ++i)
  35     for(int j = 4; j < 7; ++j)
  36       {
  37         Container con(array + i, array + j);
  38         VERIFY(upper_bound(con.begin(), con.end(), 0).ptr == array + 4);
  39       }
  40 }
  41
  42 int
  43 main()
  44 {
  45   test1();
  46 }