# 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++

Home
C++
 1 Bitset 2 Class 3 Console 4 Data Structure 5 Data Type 6 Deque 7 Development 8 File 9 Function 10 Generic 11 Language 12 List 13 Map Multimap 14 Overload 15 Pointer 16 Qt 17 Queue Stack 18 Set Multiset 19 STL Algorithms Binary search 20 STL Algorithms Heap 21 STL Algorithms Helper 22 STL Algorithms Iterator 23 STL Algorithms Merge 24 STL Algorithms Min Max 25 STL Algorithms Modifying sequence operations 26 STL Algorithms Non modifying sequence operations 27 STL Algorithms Sorting 28 STL Basics 29 String 30 Valarray 31 Vector
 C++ » STL Algorithms Non modifying sequence operations » equal Screenshots
equal algorithm: a deque and the first 2 elements of a list are not equal in all corresponding positions
 ```    #include  #include  #include  #include  #include  #include  #include  using namespace std; int main() {   list driver_list;   vector vec;   deque 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  */           ```
Related examples in the same category
 1 equal algorithm: a list and the first 3 elements of a vector are equal in all corresponding positions 2 Use std::equal to compare vectors v1 and v2 for equality