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

1. C++ Tutorial
2. STL Algorithms Non modifying sequence operations
3. equal

#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");

  deq.insert(deq.end(), "AAA");
  deq.insert(deq.end(), "DDDDDD");
  
  cout << (equal(deq.begin(), deq.end(),driver_list.begin()));

  return 0;
}

0