Using Other Search functions

#include <iostream>
#include <vector>
#include <iterator>
#include <functional>
#include <algorithm>
using namespace std;

template<class Container, class Iterator>
void ShowElement(Container& c, Iterator& itor);

int main()
{
    typedef vector<int>::iterator VectorInterator;
    vector<int>    intValueVector(10);
    intValueVector[0] = 0;
    intValueVector[1] = 1;
    intValueVector[2] = 1;
    intValueVector[3] = 2;
    intValueVector[4] = 3;
    intValueVector[5] = 4;
    intValueVector[6] = 1;
    intValueVector[7] = 2;
    intValueVector[8] = 3;
    intValueVector[9] = 5;

    vector<int>    intValueVector2(3);
    intValueVector2[0] = 1;
    intValueVector2[1] = 2;
    intValueVector2[2] = 3;

    VectorInterator    first1 = intValueVector.begin();
    VectorInterator    last1  = intValueVector.end();
    VectorInterator    first2 = intValueVector2.begin();
    VectorInterator    last2  = intValueVector2.end();

    VectorInterator    retItor = find_first_of(first1, last1, first2, last2);
    cout << "find_first_of(first1, last1, first2, last2) = ";
    ShowElement(intValueVector, retItor);
    cout << "\n";

    retItor = search(first1, last1, first2, last2);
    cout << "search(first1, last1, first2, last2) = ";
    ShowElement(intValueVector, retItor);
    cout << "\n";

    retItor = find_end(first1, last1, first2, last2);
    cout << "find_end(first1, last1, first2, last2) = ";
    ShowElement(intValueVector, retItor);
    cout << "\n";
    return 0;
}

template<class Container, class Iterator>
void ShowElement(Container& c, Iterator& itor)
{
    if (itor != c.end())
    {
        if (itor != c.begin())
            cout << *itor << "\tthe previous element is " << *(itor - 1);
        else
            cout << "first";
    }
    else
        cout << "last";
}

Related examples in the same category

1.	Perform an in-place merge for two vectors
2.	Matching Elements Using the equals and mismatch Operations
3.	Creating and Resizing Vectors
4.	Demonstrate count and count_if.
5.	Demonstrate remove_copy in Vector
6.	Access a vector using an iterator.
7.	Demonstrate insert and erase.
8.	Store a class object in a vector.
9.	Demonstrate allocator's max_size() fucntion in vector
10.	Demonstrate count() in vector
11.	Demonstrate count_if().
12.	Demonstrate reverse in vector
13.	Demonstrate insert_iterator in vector
14.	Demonstrate adjacent_difference() in vector
15.	Demonstrate inner_product() in vector
16.	Demonstrate partial_sum() in Vector
17.	Storing Class Objects with overloaded operators in a Vector
18.	Vector Init Array
19.	Use istream_iterator with the copy algorithm
20.	Demonstrate remove_copy and replace_copy.
21.	Vector: Insert Erase Sort
22.	Demonstrate accumulate() in vector
23.	end() in vector
24.	Use pop_back() and empty().
25.	Access the elements of a vector through an iterator.
26.	The basic operation of a vector: size, push_back,
27.	Accessing a Vector Through an Iterator
28.	Use istream_iterator to read various data types
29.	Create permutations based on vector
30.	Work with heaps: make_heap from vector
31.	Demonstrating the four ways that vectors can be created.
32.	Vector Capacity vs size
33.	Using clear()

Using Other Search functions : Vector « Data Structure « C++

Related examples in the same category