Implement the find_end() in C++

[Garrett]

Hello, I am the student of the Bsc-IT. I had learned the C++ language in first year of Bsc-IT. I can know about the functions in C++ language. I have to submit the assignment on the find_end() function. So, I would like to know about the find_end() function. I would also like to know how can I Implement the find_end() function in C++ language. If there is anyone who can have the solution on the find_end() functions then reply me!!!

[MindSpace]

PROGRAM :

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
bool myfunction (int p, int q) 
{
  return (p==q);
}
int main ()
 {
  int mint[] = {1,2,3,4,5,1,2,3,4,5};
  vector<int> mvctr (mint,mint+10);
  vector<int>::iterator t;
  int mtch1[] = {1,2,3};
  t = find_end (mvctr.begin(), mvctr.end(), mtch1, mtch1+3);
  if (t!=mvctr.end())
    cout << "match1 last found at position " << int(t-mvctr.begin()) << endl;
  int mtch2[] = {4,5,1};
  t = find_end (mvctr.begin(), mvctr.end(), mtch2, mtch2+3, mfnctn);
  if (t!=mvctr.end())
    cout << "match2 last found at position " << int(t-mvctr.begin()) << endl;
  return 0;
}

Output :

Match found at position 5
Match found at position 3

[Modifier]

The find_end() function can be used to find last sub sequence in a given range. The following can be the general syntax of the find_end() function in the C++ language :

template <class FrwrdItrtr1, class FrwrdItrtr2>
   FrwrdItrtr1 find_end ( FrwrdItrtr1 fst1, FrwrdItrtr1 lst1,
                               FrwrdItrtr2 fst2, FrwrdItrtr2 lst2 );

[Praetor]

I suggest you to go through very carefully to the following code lines that can demonstrates you the implementation of the find_end() function in the C++ language :

#include <algorithm>  
#include <functional> 
#include <iostream>   
#include <list>        
int main()
{
  char* t = "exec.exe";
  char* sufx = "exe";
  const int M = strlen(t);
  const int Nsuf = strlen(sufx);
  char* locat = find_end(t, t + M,
                            sufx, sufx + Nsuf);
  if (locat != t + M) 
{
    cout << "Found a match for " << sufx << " within " << t << endl;
    cout << t << endl;
    int j;
    for (j = 0; j < (locat - t); ++j)
      cout << ' ';
    for (j = 0; j < Nsuf; ++j)
      cout << '^';
    cout << endl;
  }
  else
    cout << "No match for " << sufx << " within " << t << endl;
}

[Katty]

Hi, How's your Day!!! In a given sequence, [start1,finish1) the last occurrence of a sub-sequence that can be indicated by the [start2, finish2), can be find by using the function find_end(). If no match can be found by an iterator that can be pointing to the first element of the sub-sequence that can be found or finish1 can be returned by the find_end() function algorithm in C++ language.

[kelfro]

The following can be the parameters of the find_end() function in the C++ language :
1. fst2, lst2 : These parameters can be used for to searched Forward iterators to the final and starting positions of the sequence that can be searched for. The range used can be [fst2,lst2).
2. fst1, lst1 : These parameters can be used for to searched Forward iterators to the final and starting positions of the sequence that can be searched. The range used can be [fst1,lst1).