STL algorithm算法find_if_not(20)
来源:互联网 发布:php base64解码 乱码 编辑:程序博客网 时间:2024/05/16 11:48
原文地址:http://www.cplusplus.com/reference/algorithm/find_if_not/
function template
<algorithm>
std::find_if_not
template <class InputIterator, class UnaryPredicate> InputIterator find_if_not (InputIterator first, InputIterator last, UnaryPredicate pred);
Find element in range (negative condition)
Returns an iterator to the first element in the range [first,last)
for which pred returns false
. If no such element is found, the function returns last.跟find_if刚好相反,返回第一个不符合要求的元素的迭代器。如果没有匹配的,则返回last.
例子:
#include <iostream>#include <vector>#include <array>#include <algorithm>using namespace std;void findifnot(){ vector<int> v1{100,200,300,400,155,300}; array<int,3> ai{4,8,3}; cout<<"v1="; for(int &i:v1) cout<<i<<" "; cout<<endl; cout<<endl<<"auto it=find_if_not(v1.begin(),v1.end(),[](int i){return i%100==0;);"<<endl; auto it=find_if_not(v1.begin(),v1.end(),[](int i){return i%100==0;}); cout<<"*(it-1)="<<*(it-1)<<endl; cout<<"*it="<<*it<<endl; cout<<"*(it+1)="<<*(it+1)<<endl; cout<<"ai="; for(int &i:ai) cout<<i<<" "; cout<<endl<<"auto it2=find_first_of_not(ai.begin(),ai.end(),[](int i){return i%2==0;);"<<endl; auto it2=find_if_not(ai.begin(),ai.end(),[](int i){return i%2==0;}); cout<<"*(it2-1)="<<*(it2-1)<<endl; cout<<"*it2="<<*it2<<endl; cout<<"*(it2+1)="<<*(it2+1)<<endl;}运行截图:
The behavior of this function template is equivalent to:
123456789
template<class InputIterator, class UnaryPredicate> InputIterator find_if_not (InputIterator first, InputIterator last, UnaryPredicate pred){ while (first!=last) { if (!pred(*first)) return first; ++first; } return last;}
Parameters
- first, last
- Input iterators to the initial and final positions in a sequence. The range used is
[first,last)
, which contains all the elements between first and last, including the element pointed by first but not the element pointed by last.
要匹配的范围。 - pred
- Unary function that accepts an element in the range as argument and returns a value convertible to
bool
. The value returned indicates whether the element is considered a match in the context of this function.
The function shall not modify its argument.
This can either be a function pointer or a function object.
一个接受一个参数并返回一个bool值的一元函数。
Return value
An iterator to the first element in the range for which pred returnsfalse
.If pred is
true
for all elements, the function returns last.返回第一个不符合要求的元素的迭代器。如果没有匹配的,则返回last.
Example
1234567891011121314
// find_if_not example#include <iostream> // std::cout#include <algorithm> // std::find_if_not#include <array> // std::arrayint main () { std::array<int,5> foo = {1,2,3,4,5}; std::array<int,5>::iterator it = std::find_if_not (foo.begin(), foo.end(), [](int i){return i%2;} ); std::cout << "The first even value is " << *it << '\n'; return 0;}
Edit & Run
Output:
The first even value is 2
Complexity
Up to linear in the distance between first and last: Calls pred for each element until a mismatch is found.Data races
Some (or all) of the objects in the range[first,last)
are accessed (once at most).Exceptions
Throws if either pred or an operation on an iterator throws.Note that invalid parameters cause undefined behavior.
——————————————————————————————————————————————————————————————————
//写的错误或者不好的地方请多多指导,可以在下面留言或者点击左上方邮件地址给我发邮件,指出我的错误以及不足,以便我修改,更好的分享给大家,谢谢。
转载请注明出处:http://blog.csdn.net/qq844352155
author:天下无双
Email:coderguang@gmail.com
2014-9-13
于GDUT
——————————————————————————————————————————————————————————————————
0 0
- STL algorithm算法find_if_not(20)
- STL algorithm算法集合
- 【STL】algorithm算法介绍
- STL算法find,find_if,find_if_not,sort,fill,for_each,count,adjacent_find,random_shuffle,prev_permutation
- STL algorithm算法binary_search(5)
- STL algorithm算法copy(6)
- STL algorithm算法copy_backward(7)
- STL algorithm算法copy_if(8)
- STL algorithm算法copy_n(9)
- STL algorithm算法count(10)
- STL algorithm算法count_if(11)
- STL algorithm算法equal(12)
- STL algorithm算法equal_range(13)
- STL algorithm算法fill(14)
- STL algorithm算法find_end(17)
- STL algorithm算法find_first_of(18)
- STL algorithm算法find_if(19)
- STL algorithm算法includes(23)
- VC6.0 MFC 串口通信 AT命令
- LeetCode OJ - Flatten Binary Tree to Linked List
- Hdu 1571 下沙小面的(1) [模拟]
- 操作系统的主要功能
- 大数加法(瑕疵)
- STL algorithm算法find_if_not(20)
- Oracle创建之路->创建表空间、创建临时表空间、创建用户、授权
- 交互式shell和非交互式shell、登录shell和非登录shell的区别
- PHP开发环境及开发环境搭建
- KMP算法初步
- 堆内存
- 大数阶乘
- vsftp 配置
- 汇编语言--王爽--实验9 子程序