?? alg2.c
字號:
#include <algorithm>
#include <vector>
#include <iostream.h>
#include <assert.h>
class TwiceOver {
public:
bool operator() ( int val1, int val2 )
{
return val1 == val2/2 ? true : false;
}
};
int main()
{
int ia[] = { 1, 4, 4, 8 };
vector< int, allocator > vec( ia, ia+4 );
int *piter;
vector< int, allocator >::iterator iter;
// piter points to ia[1]
piter = adjacent_find( ia, ia+4 );
assert( *piter = ia[ 1 ] );
// iter points to vec[2]
iter = adjacent_find( vec.begin(), vec.end(), TwiceOver() );
assert( *iter = vec[ 2 ] );
// reach here: everything ok
cout << "ok: adjacent-find() succeeded!\n";
return 0;
}
?? 快捷鍵說明
復制代碼
Ctrl + C
搜索代碼
Ctrl + F
全屏模式
F11
切換主題
Ctrl + Shift + D
顯示快捷鍵
?
增大字號
Ctrl + =
減小字號
Ctrl + -