Home | History | Annotate | Download | only in alg.find
      1 //===----------------------------------------------------------------------===//
      2 //
      3 //                     The LLVM Compiler Infrastructure
      4 //
      5 // This file is dual licensed under the MIT and the University of Illinois Open
      6 // Source Licenses. See LICENSE.TXT for details.
      7 //
      8 //===----------------------------------------------------------------------===//
      9 
     10 // <algorithm>
     11 
     12 // template<InputIterator Iter, Predicate<auto, Iter::value_type> Pred>
     13 //   requires CopyConstructible<Pred>
     14 //   Iter
     15 //   find_if_not(Iter first, Iter last, Pred pred);
     16 
     17 #include <algorithm>
     18 #include <functional>
     19 #include <cassert>
     20 
     21 #include "test_iterators.h"
     22 
     23 struct ne {
     24 	ne (int val) : v(val) {}
     25 	bool operator () (int v2) const { return v != v2; }
     26 	int v;
     27 	};
     28 
     29 
     30 int main()
     31 {
     32     int ia[] = {0, 1, 2, 3, 4, 5};
     33     const unsigned s = sizeof(ia)/sizeof(ia[0]);
     34     input_iterator<const int*> r = std::find_if_not(input_iterator<const int*>(ia),
     35                                                     input_iterator<const int*>(ia+s),
     36                                                     ne(3));
     37     assert(*r == 3);
     38     r = std::find_if_not(input_iterator<const int*>(ia),
     39                          input_iterator<const int*>(ia+s),
     40                          ne(10));
     41     assert(r == input_iterator<const int*>(ia+s));
     42 }
     43