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

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