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

   1 // Copyright (C) 2005-2018 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.1.4 [lib.alg.find.first.of]
  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
  27 typedef test_container<int, forward_iterator_wrapper> Container;
  28
  29 using std::find_first_of;
  30
  31 void
  32 test1()
  33 {
  34   int array[] = {0};
  35   Container con1(array, array);
  36   Container con2(array, array + 1);
  37   VERIFY(find_first_of(con1.begin(), con1.end(), con1.begin(), con1.end()).ptr == array);
  38   VERIFY(find_first_of(con1.begin(), con1.end(), con2.begin(), con2.end()).ptr == array);
  39   VERIFY(find_first_of(con2.begin(), con2.end(), con1.begin(), con1.end()).ptr == array + 1);
  40 }
  41
  42 void
  43 test2()
  44 {
  45   int array1[] = {1 ,2, 3, 4, 5, 6};
  46   int array2[] = {3, 4, 9};
  47   Container con1(array1, array1 + 6);
  48   Container con2(array2, array2 + 3);
  49   VERIFY(find_first_of(con1.begin(), con1.end(), con2.begin(), con2.end()).ptr == array1 + 2);
  50 }
  51
  52 int
  53 main()
  54 {
  55   test1();
  56   test2();
  57 }