Demonstrate find() and find_if() in vector : Vector Utility « Data Structure « C++






Demonstrate find() and find_if() in vector

Demonstrate find() and find_if() in vector

#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
using namespace std;

bool iscomma(char ch) {
  if(ch == ',') 
     return true;
  return false;
}

int main()
{
  vector<char> vectorObject;
  vector<char>::iterator p;
  char str[] = "One, Two, Three, Four, Five, Six";
  int i;

  for(i = 0; i < strlen(str); i++)
    vectorObject.push_back(str[ i ]);

  cout << "Contents of vectorObject: ";
  for(i = 0; i < vectorObject.size(); i++)
    cout << vectorObject[ i ];
  cout << endl;

  
  p = find(vectorObject.begin(), vectorObject.end(), 'T');          // find the first T
  cout << "Sequence beginning with T: ";
  while(p != vectorObject.end())
    cout << *p++;
  cout << endl;

  p = find_if(vectorObject.begin(), vectorObject.end(), iscomma);   // find first comma
  cout << "After find first comma: ";
  while(p != vectorObject.end())
    cout << *p++;
  cout << endl;

  return 0;
}

           
       








Related examples in the same category

1.Demonstrate inner_product() in vectorDemonstrate inner_product() in vector
2.Demonstrate partial_sum() in vectorDemonstrate partial_sum() in vector
3.set_union, set_difference, set_symmetric_difference, set_intersection
4.Use a unary function object to determine even/odd.Use a unary function object to determine even/odd.
5.Demonstrate count_if and not1 in vectorDemonstrate count_if and not1 in vector
6.Another way to sort a sequence into descending order.Another way to sort a sequence into descending order.
7.Use a function adaptor in vectorUse a function adaptor in vector
8.Demonstrate insert_iterator in a vectorDemonstrate insert_iterator in a vector
9.Insert one vector into another using an insert iteratorInsert one vector into another using an insert iterator
10.Demonstrate back_insert_iterator in vectorDemonstrate back_insert_iterator in vector
11.Demonstrate front_insert_iterator in vectorDemonstrate front_insert_iterator in vector
12.Find minimum and maximum inside a vectorFind minimum and maximum inside a vector
13.Use for_each() in vectorUse for_each() in vector
14.Use the logical_not unary function object in vectorUse the logical_not unary function object in vector
15.Sorting a vector into descending order in vectorSorting a vector into descending order in vector
16.Using copy() in VectorUsing copy() in Vector
17.Using swap_ranges() in VectorUsing swap_ranges() in Vector
18.Exchange elements from two different types of containers.Exchange elements from two different types of containers.
19.Demonstrate search() in vectorDemonstrate search() in vector
20.Demonstrate mismatch() in vectorDemonstrate mismatch() in vector
21.Demonstrating sort() in vectorDemonstrating sort() in vector
22.Demonstrating partial_sort() in vectorDemonstrating partial_sort() in vector
23.Demonstrate binary_search() in vectorDemonstrate binary_search() in vector
24.Demonstrate lower_bound() in vectorDemonstrate lower_bound() in vector
25.Demonstrating remove() and replace() in vectorDemonstrating remove() and replace() in vector
26.Demonstrating unique() in vectorDemonstrating unique() in vector
27.Transforming a sequence in vectorTransforming a sequence in vector
28.Generating a sequence in vectorGenerating a sequence in vector
29.Rotate a sequence in vectorRotate a sequence in vector
30.Right-rotate a sequence in vectorRight-rotate a sequence in vector
31.Demonstrate random_shuffle() in vectorDemonstrate random_shuffle() in vector
32.Merge two sequences Merge two sequences
33.A vector may allocate more memory than it currently needs. A vector may allocate more memory than it currently needs.