The C++ function std::algorithm::equal() tests whether two sets of element are equal or not. Size of the both set need not to be equal. It uses operator== for comparison.
DeclarationFollowing is the declaration for std::algorithm::equal() function form std::algorithm header.
C++98template <class InputIterator1, class InputIterator2> bool equal(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2);Parameters
first1 − Input iterator to the initial position of the first sequence.
last1 − Input iterator to the final position of the first sequence.
first2 − Input iterator to the initial position of the second sequence.
Returns true if all the element in the range of first1 to last1 are equal to those of the range starting at first2 otherwise it returns false.
ExceptionsThrows exception if either element comparison (or predicate) or an operation on an iterator throws exception.
Please note that invalid parameters cause undefined behavior.
Time complexityLinear in the distance between first to last.
ExampleThe following example shows the usage of std::algorithm::equal() function.
#include <iostream> #include <vector> #include <algorithm> using namespace std; int main(void) { vector<int> v1 = {1, 2, 3}; vector<int> v2 = {1, 2, 4, 4, 5}; bool result; result = equal(v1.begin(), v1.end(), v2.begin()); if (result == false) cout << "Vector range is not equal." << endl; v2[2] = 3; result = equal(v1.begin(), v1.end(), v2.begin()); if (result == true) cout << "Vector range is equal." << endl; return 0; }
Let us compile and run the above program, this will produce the following result −
Vector range is not equal. Vector range is equal.
algorithm.htm
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4