gomp-20050608-branch/libstdc++-v3/testsuite/25_algorithms/equal_range/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.3 [lib.equal.range]
  20
  21 #include <algorithm>
  22 #include <utility>
  23 #include <testsuite_hooks.h>
  24 #include <testsuite_iterators.h>
  25
  26 using __gnu_test::test_container;
  27 using __gnu_test::forward_iterator_wrapper;
  28 using std::equal_range;
  29
  30 typedef test_container<int, forward_iterator_wrapper> Container;
  31 int array[] = {0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2};
  32
  33 void
  34 test1()
  35 {
  36   for(int i = 0; i < 6; ++i)
  37     for(int j = 6; j < 12; ++j)
  38       {
  39         Container con(array + i, array + j);
  40         VERIFY(equal_range(con.begin(), con.end(), 1).first.ptr ==
  41                array + std::max(i, 4));
  42         VERIFY(equal_range(con.begin(), con.end(), 1).second.ptr ==
  43                array + std::min(j, 8));
  44       }
  45 }
  46
  47 void
  48 test2()
  49 {
  50   int array[]={0, 0, 2, 2, 2};
  51   Container con(array, array + 5);
  52   VERIFY(equal_range(con.begin(), con.end(), 1).first.ptr ==
  53          array + 2);
  54   VERIFY(equal_range(con.begin(), con.end(), 1).second.ptr ==
  55          array + 2);
  56 }
  57
  58 int
  59 main()
  60 {
  61   test1();
  62   test2();
  63 }