Difference between revisions of "cpp/algorithm/equal"
(+) |
|||
Line 3: | Line 3: | ||
{{dcl begin}} | {{dcl begin}} | ||
{{dcl header | algorithm}} | {{dcl header | algorithm}} | ||
− | {{dcl | num=1 | | + | {{dcl | since= | num= 1 |1= |
template< class InputIt1, class InputIt2 > | template< class InputIt1, class InputIt2 > | ||
bool equal( InputIt1 first1, InputIt1 last1, | bool equal( InputIt1 first1, InputIt1 last1, | ||
InputIt2 first2 ); | InputIt2 first2 ); | ||
}} | }} | ||
− | {{dcl | num=2 | | + | {{dcl | since=c++17 | num= 2 |1= |
+ | template< class ExecutionPolicy, class InputIt1, class InputIt2 > | ||
+ | bool equal( ExecutionPolicy&& policy, InputIt1 first1, InputIt1 last1, | ||
+ | InputIt2 first2 );}} | ||
+ | {{dcl | since= | num= 3 |1= | ||
template< class InputIt1, class InputIt2, class BinaryPredicate > | template< class InputIt1, class InputIt2, class BinaryPredicate > | ||
bool equal( InputIt1 first1, InputIt1 last1, | bool equal( InputIt1 first1, InputIt1 last1, | ||
InputIt2 first2, BinaryPredicate p ); | InputIt2 first2, BinaryPredicate p ); | ||
}} | }} | ||
− | {{dcl | num= | + | {{dcl | since=c++17 | num= 4 |1= |
+ | template< class ExecutionPolicy, class InputIt1, class InputIt2, class BinaryPredicate > | ||
+ | bool equal( ExecutionPolicy&& policy, InputIt1 first1, InputIt1 last1, | ||
+ | InputIt2 first2, BinaryPredicate p );}} | ||
+ | {{dcl | since=c++14 | num= 5 |1= | ||
template< class InputIt1, class InputIt2 > | template< class InputIt1, class InputIt2 > | ||
bool equal( InputIt1 first1, InputIt1 last1, | bool equal( InputIt1 first1, InputIt1 last1, | ||
InputIt2 first2, InputIt2 last2 ); | InputIt2 first2, InputIt2 last2 ); | ||
}} | }} | ||
− | {{dcl | num= | + | {{dcl | since=c++17 | num= 6 |1= |
+ | template< class ExecutionPolicy, class InputIt1, class InputIt2 > | ||
+ | bool equal( ExecutionPolicy&& policy, InputIt1 first1, InputIt1 last1, | ||
+ | InputIt2 first2, InputIt2 last2 );}} | ||
+ | {{dcl | since=c++14 | num= 7 |1= | ||
template< class InputIt1, class InputIt2, class BinaryPredicate > | template< class InputIt1, class InputIt2, class BinaryPredicate > | ||
bool equal( InputIt1 first1, InputIt1 last1, | bool equal( InputIt1 first1, InputIt1 last1, | ||
Line 24: | Line 36: | ||
BinaryPredicate p ); | BinaryPredicate p ); | ||
}} | }} | ||
+ | {{dcl | since=c++17 | num= 8 |1= | ||
+ | template< class ExecutionPolicy, class InputIt1, class InputIt2, class BinaryPredicate > | ||
+ | bool equal( ExecutionPolicy&& policy, InputIt1 first1, InputIt1 last1, | ||
+ | InputIt2 first2, InputIt2 last2, | ||
+ | BinaryPredicate p );}} | ||
{{dcl end}} | {{dcl end}} | ||
− | @1, | + | @1,3@ Returns {{c|true}} if the range {{tt|[first1, last1)}} is equal to the range {{tt|[first2, first2 + (last1 - first1))}}, and {{c|false}} otherwise |
− | @ | + | @5,7@ Returns {{c|true}} if the range {{tt|[first1, last1)}} is equal to the range {{tt|[first2, last2)}}, and {{c|false}} otherwise. |
+ | |||
+ | @2,4,6,8@ Same as {{v|1,3,5,7}}, but executed according to {{tt|policy}}. These overloads do not participate in overload resolution unless {{c|std::is_execution_policy_v<std::decay_t<ExecutionPolicy>>}} is true | ||
− | The two ranges are considered equal if, for every iterator {{tt|i}} in the range {{tt|[first1,last1)}}, {{c|*i}} equals {{c|*(first2 + (i - first1))}}. The overloads {{v|1, | + | The two ranges are considered equal if, for every iterator {{tt|i}} in the range {{tt|[first1,last1)}}, {{c|*i}} equals {{c|*(first2 + (i - first1))}}. The overloads {{v|1,2,5,6}} use {{c|operator{{==}}}} to determine if two elements are equal, whereas overloads {{v|3,4,7,8}} use the given binary predicate {{tt|p}}. |
===Parameters=== | ===Parameters=== | ||
Line 35: | Line 54: | ||
{{par | first1, last1 | the first range of the elements to compare}} | {{par | first1, last1 | the first range of the elements to compare}} | ||
{{par | first2, last2 | the second range of the elements to compare}} | {{par | first2, last2 | the second range of the elements to compare}} | ||
+ | {{par exec pol}} | ||
{{par pred2 eq | p | p1=InputIt1 | p2=InputIt2}} | {{par pred2 eq | p | p1=InputIt1 | p2=InputIt2}} | ||
{{par hreq}} | {{par hreq}} | ||
Line 42: | Line 62: | ||
===Return value=== | ===Return value=== | ||
− | @ | + | @5-8@If the length of the range {{tt|[first1, last1)}} does not equal the length of the range {{tt|[first2, last2)}}, returns {{c|false}} |
If the elements in the two ranges are equal, returns {{c|true}}. | If the elements in the two ranges are equal, returns {{c|true}}. | ||
Line 55: | Line 75: | ||
===Complexity=== | ===Complexity=== | ||
− | @1 | + | @1-4@At most {{tt|last1}} - {{tt|first1}} applications of the predicate |
− | @ | + | @5-8@At most min({{tt|last1}} - {{tt|first1}}, {{tt|last2}} - {{tt|first2}}) applications of the predicate.<br> |
− | However, if {{tt|InputIt1}} and {{tt|InputIt2}} meet the requirements of {{concept|RandomAccessIterator}} and {{c|last1 - first1 !{{=}} last2 - first2}} then no applications of the predicate | + | However, if {{tt|InputIt1}} and {{tt|InputIt2}} meet the requirements of {{concept|RandomAccessIterator}} and {{c|last1 - first1 !{{=}} last2 - first2}} then no applications of the predicate are made. |
+ | ===Exceptions=== | ||
+ | {{cpp/algorithm/parallel_exceptions_reporting_behavior|singular=no}} | ||
===Possible implementation=== | ===Possible implementation=== |
Revision as of 09:00, 21 March 2016
Defined in header <algorithm>
|
||
template< class InputIt1, class InputIt2 > bool equal( InputIt1 first1, InputIt1 last1, |
(1) | |
template< class ExecutionPolicy, class InputIt1, class InputIt2 > bool equal( ExecutionPolicy&& policy, InputIt1 first1, InputIt1 last1, |
(2) | (since C++17) |
template< class InputIt1, class InputIt2, class BinaryPredicate > bool equal( InputIt1 first1, InputIt1 last1, |
(3) | |
template< class ExecutionPolicy, class InputIt1, class InputIt2, class BinaryPredicate > bool equal( ExecutionPolicy&& policy, InputIt1 first1, InputIt1 last1, |
(4) | (since C++17) |
template< class InputIt1, class InputIt2 > bool equal( InputIt1 first1, InputIt1 last1, |
(5) | (since C++14) |
template< class ExecutionPolicy, class InputIt1, class InputIt2 > bool equal( ExecutionPolicy&& policy, InputIt1 first1, InputIt1 last1, |
(6) | (since C++17) |
template< class InputIt1, class InputIt2, class BinaryPredicate > bool equal( InputIt1 first1, InputIt1 last1, |
(7) | (since C++14) |
template< class ExecutionPolicy, class InputIt1, class InputIt2, class BinaryPredicate > bool equal( ExecutionPolicy&& policy, InputIt1 first1, InputIt1 last1, |
(8) | (since C++17) |
[first1, last1)
is equal to the range [first2, first2 + (last1 - first1))
, and false otherwise[first1, last1)
is equal to the range [first2, last2)
, and false otherwise.policy
. These overloads do not participate in overload resolution unless std::is_execution_policy_v<std::decay_t<ExecutionPolicy>> is trueThe two ranges are considered equal if, for every iterator i
in the range [first1,last1)
, *i equals *(first2 + (i - first1)). The overloads (1,2,5,6) use operator== to determine if two elements are equal, whereas overloads (3,4,7,8) use the given binary predicate p
.
Contents |
Parameters
first1, last1 | - | the first range of the elements to compare |
first2, last2 | - | the second range of the elements to compare |
policy | - | the execution policy to use. See execution policy for details. |
p | - | binary predicate which returns true if the elements should be treated as equal. The signature of the predicate function should be equivalent to the following: bool pred(const Type1 &a, const Type2 &b); While the signature does not need to have const &, the function must not modify the objects passed to it and must be able to accept all values of type (possibly const) |
Type requirements |
Return value
[first1, last1)
does not equal the length of the range [first2, last2)
, returns falseIf the elements in the two ranges are equal, returns true.
Otherwise returns false.
Notes
std::equal
should not be used to compare the ranges formed by the iterators from std::unordered_set, std::unordered_multiset, std::unordered_map, or std::unordered_multimap because the order in which the elements are stored in those containers may be different even if the two containers store the same elements.
When comparing entire containers for equality, operator==
for the corresponding container are usually preferred.
Complexity
last1
- first1
applications of the predicatelast1
- first1
, last2
- first2
) applications of the predicate.However, if
InputIt1
and InputIt2
meet the requirements of Template:concept and last1 - first1 != last2 - first2 then no applications of the predicate are made.Exceptions
The overloads with a template parameter named ExecutionPolicy
report errors as follows:
- If execution of a function invoked as part of the algorithm throws an exception and
ExecutionPolicy
is one of the standard policies, std::terminate is called. For any otherExecutionPolicy
, the behavior is implementation-defined. - If the algorithm fails to allocate memory, std::bad_alloc is thrown.
Possible implementation
First version |
---|
template<class InputIt1, class InputIt2> bool equal(InputIt1 first1, InputIt1 last1, InputIt2 first2) { for (; first1 != last1; ++first1, ++first2) { if (!(*first1 == *first2)) { return false; } } return true; } |
Second version |
template<class InputIt1, class InputIt2, class BinaryPredicate> bool equal(InputIt1 first1, InputIt1 last1, InputIt2 first2, BinaryPredicate p) { for (; first1 != last1; ++first1, ++first2) { if (!p(*first1, *first2)) { return false; } } return true; } |
Example
The following code uses equal() to test if a string is a palindrome
#include <algorithm> #include <iostream> #include <string> bool is_palindrome(const std::string& s) { return std::equal(s.begin(), s.begin() + s.size()/2, s.rbegin()); } void test(const std::string& s) { std::cout << "\"" << s << "\" " << (is_palindrome(s) ? "is" : "is not") << " a palindrome\n"; } int main() { test("radar"); test("hello"); }
Output:
"radar" is a palindrome "hello" is not a palindrome
(C++11) |
finds the first element satisfying specific criteria (function template) |
returns true if one range is lexicographically less than another (function template) | |
finds the first position where two ranges differ (function template) | |
searches for the first occurrence of a range of elements (function template) | |
(parallelism TS) |
parallelized version of std::equal (function template) |