Home
C++ Tutorial
Language Basics
Data Types
Operators statements
Array
Development
Exceptions
Function
Structure
Class
Operator Overloading
Pointer
File Stream
template
STL Introduction
string
vector
list
bitset
set multiset
valarray
queue stack
deque
map multimap
STL Algorithms Modifying sequence operations
STL Algorithms Non modifying sequence operations
STL Algorithms Binary search
STL Algorithms Sorting
STL Algorithms Merge
STL Algorithms Min Max
STL Algorithms Iterator
STL Algorithms Heap
STL Algorithms Helper
equal « STL Algorithms Non modifying sequence operations « C++ Tutorial
C++ Tutorial
STL Algorithms Non modifying sequence operations
equal
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