old-autovect-branch/libstdc++-v3/testsuite/25_algorithms/min_element/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.7 [lib.alg.min.max]
  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::min_element;
  28
  29 typedef test_container<int, forward_iterator_wrapper> Container;
  30
  31 void
  32 test1()
  33 {
  34   // Note: The standard is unclear on what should happen in this case.
  35   // This seems the only really sensible behaviour, and what is done.
  36   int array[] = {0};
  37   Container con(array, array);
  38   VERIFY(min_element(con.begin(), con.end()).ptr == array);
  39 }
  40
  41 void
  42 test2()
  43 {
  44   int array[] = {0};
  45   Container con(array, array + 1);
  46   VERIFY(min_element(con.begin(), con.end()).ptr == array);
  47 }
  48
  49 void
  50 test3()
  51 {
  52   int array[] = {0, 3};
  53   Container con(array, array + 2);
  54   VERIFY(min_element(con.begin(), con.end()).ptr == array);
  55 }
  56
  57 void
  58 test4()
  59 {
  60   int array[] = {6, 3, 0, 2, 6, 4, 0};
  61   Container con(array, array + 7);
  62   VERIFY(min_element(con.begin(), con.end()).ptr == array + 2);
  63 }
  64
  65 int main()
  66 {
  67   test1();
  68   test2();
  69   test3();
  70   test4();
  71 }