/
adjfind1.cpp
54 lines (46 loc) · 1.62 KB
/
adjfind1.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
/* The following code example is taken from the book
* "The C++ Standard Library - A Tutorial and Reference"
* by Nicolai M. Josuttis, Addison-Wesley, 1999
*
* (C) Copyright Nicolai M. Josuttis 1999.
* Permission to copy, use, modify, sell and distribute this software
* is granted provided this copyright notice appears in all copies.
* This software is provided "as is" without express or implied
* warranty, and with no claim as to its suitability for any purpose.
*/
#include "algostuff.hpp"
using namespace std;
// return whether the second object has double the value of the first
bool doubled (int elem1, int elem2)
{
return elem1 * 2 == elem2;
}
int main()
{
vector<int> coll;
coll.push_back(1);
coll.push_back(3);
coll.push_back(2);
coll.push_back(4);
coll.push_back(5);
coll.push_back(5);
coll.push_back(0);
PRINT_ELEMENTS(coll,"coll: ");
// search first two elements with equal value
vector<int>::iterator pos;
pos = adjacent_find (coll.begin(), coll.end());
if (pos != coll.end()) {
cout << "first two elements with equal value have position "
<< distance(coll.begin(),pos) + 1
<< endl;
}
// search first two elements for which the second has double the value of the first
pos = adjacent_find (coll.begin(), coll.end(), // range
doubled); // criterion
if (pos != coll.end()) {
cout << "first two elements with second value twice the "
<< "first have pos. "
<< distance(coll.begin(),pos) + 1
<< endl;
}
}