find an element in a list : find « STL Algorithms Non modifying sequence operations « C++






find an element in a list

  
 

//erase an element in a list
//Combine erase and remove to remove a found element

#include <iostream>
#include <string>
#include <list>
#include <algorithm>
#include <functional>

using namespace std;

int main( ) {

   list<string> lstStr;

   lstStr.push_back("A");
   lstStr.push_back("B");
   lstStr.push_back("C");
   lstStr.push_back("D");
   lstStr.push_back("E");

   list<string>::iterator p;

   p = find(lstStr.begin( ), lstStr.end( ), "C");
   p = lstStr.erase(p);
   lstStr.erase(remove(lstStr.begin( ), lstStr.end( ), "D"),lstStr.end( ));
}

        
    
  








Related examples in the same category

1.Use find to search an element in a container
2.Find the maximum element in a range in a list
3.Locate first occurrence of a value in a vector
4.Using find with normal iteration
5.Demonstrating generic find algorithm with an array
6.Generic find algorithm: use find function to find an element in an array
7.Use find algorithm to find an element in a list
8.Use istream_iterator and find
9.Generic find algorithm with input iterators associated with io streams
10.Use assert to check the find method
11.find and display v in lowest 20th percentile
12.find and display v in highest 20th percentile
13.find and display sorted v in lowest 20th percentile
14.find and display sorted v in highest 20th percentile