old-autovect-branch/libstdc++-v3/testsuite/25_algorithms/lower_bound/1.cc

   1 // Copyright (C) 2005 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 2, 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 COPYING.  If not, write to the Free
  16 // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
  17 // USA.
  18
  19 // 25.3.3.1 [lib.lower.bound]
  20
  21 #include <algorithm>
  22 #include <testsuite_hooks.h>
  23 #include <testsuite_iterators.h>
  24
  25 using __gnu_test::test_container;
  26 using __gnu_test::forward_iterator_wrapper;
  27 using std::lower_bound;
  28
  29 typedef test_container<int, forward_iterator_wrapper> Container;
  30 int array[] = {0, 0, 0, 0, 1, 1, 1, 1};
  31
  32 void
  33 test1()
  34 {
  35   for(int i = 0; i < 5; ++i)
  36     for(int j = 4; j < 7; ++j)
  37       {
  38         Container con(array + i, array + j);
  39         VERIFY(lower_bound(con.begin(), con.end(), 1).ptr == array + 4);
  40       }
  41 }
  42
  43 int
  44 main()
  45 {
  46   test1();
  47 }