// alg_find.cpp
// compile with: /EHsc
#include <list>
#include <algorithm>
#include <iostream>

int main() 
{
    using namespace std;
  
    list<int> L;
    list<int>::iterator Iter;
    list<int>::iterator result;
  
    L.push_back(40);
    L.push_back(20);
    L.push_back(10);
    L.push_back(30);
    L.push_back(10);
  
    cout << "L = ( " ;
    for (Iter=L.begin(); Iter!=L.end(); Iter++) // Iter<L.end() causes compilation error
        cout << *Iter << " ";
//    int i;
//    for (i=0; i<L.size(); i++)
//        cout << L[i] << " ";   // [] is an undefined operator
    cout << ")" << endl;
  
    result = L.begin();
    while (1)
    {
        result = find(result, L.end(), 10);
        if  (result == L.end())
        {
            cout << "There is no more 10 in list L." << endl;
            break;
        }
        else 
        {
            cout << "There is a 10 in list L";
            if (++result != L.end())
                cout << " and it is followed by a " << *result << ".";
            cout << endl;
        }
    }
}