equal algorithm: a list and the first 3 elements of a vector are equal in all corresponding positions : equal « STL Algorithms Non modifying sequence operations « C++ Tutorial






#include <iostream>
#include <cassert>
#include <algorithm>
#include <string>
#include <list>
#include <deque>
#include <vector>
using namespace std;

int main()
{
  list<string> driver_list;
  vector<string> vec;
  deque<string> deq;

  driver_list.insert(driver_list.end(), "AAA");
  driver_list.insert(driver_list.end(), "BBBB");
  driver_list.insert(driver_list.end(), "CCCCC");

  vec.insert(vec.end(), "AAA");
  vec.insert(vec.end(), "BBBB");
  vec.insert(vec.end(), "CCCCC");
  vec.insert(vec.end(), "DDDDDD");

  cout<< (equal(driver_list.begin(), driver_list.end(),vec.begin()));

  return 0;
}
1








25.6.equal
25.6.1.equal algorithm: a deque and the first 2 elements of a list are not equal in all corresponding positions
25.6.2.equal algorithm: a list and the first 3 elements of a vector are equal in all corresponding positions
25.6.3.Use std::equal to compare vectors v1 and v2 for equality