template<class InputIterator1, class InputIterator2> constexpr bool equal(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2); […] template<class InputIterator1, class InputIterator2, class BinaryPredicate> constexpr bool equal(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, BinaryPredicate pred); […] template<input_iterator I1, sentinel_for<I1> S1, input_iterator I2, sentinel_for<I2> S2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity> requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2> constexpr bool ranges::equal(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); template<input_range R1, input_range R2, class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity> requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2> constexpr bool ranges::equal(R1&& r1, R2&& r2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {});
[…]
-3- Complexity: If the types offirst1
,last1
,first2
, andlast2
:
(3.1) — the types of
first1
,last1
,first2
, andlast2
meet the Cpp17RandomAccessIterator requirements (24.3.5.7 [random.access.iterators]) andlast1 - first1 != last2 - first2
for the overloads in namespacestd
;(3.2) — the types of
first1
,last1
,first2
, andlast2
pairwise modelsized_sentinel_for
(24.3.4.8 [iterator.concept.sizedsentinel]) andlast1 - first1 != last2 - first2
for the first overload s in namespaceranges
,(3.3) —
R1
andR2
each modelsized_range
andranges::distance(r1) != ranges::distance(r2)
for the second overload in namespaceranges
,and
last1 - first1 != last2 - first2
, then no applications of the corresponding predicate and each projection; otherwise, […]
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