tmp/tmpi5011af2/{from.md → to.md}
RENAMED
|
@@ -57,11 +57,11 @@ the sequences yields the same result as the comparison of the first
|
|
| 57 |
corresponding pair of elements that are not equivalent.
|
| 58 |
|
| 59 |
[*Example 1*:
|
| 60 |
|
| 61 |
`ranges::lexicographical_compare(I1, S1, I2, S2, Comp, Proj1, Proj2)`
|
| 62 |
-
|
| 63 |
|
| 64 |
``` cpp
|
| 65 |
for ( ; first1 != last1 && first2 != last2 ; ++first1, (void) ++first2) {
|
| 66 |
if (invoke(comp, invoke(proj1, *first1), invoke(proj2, *first2))) return true;
|
| 67 |
if (invoke(comp, invoke(proj2, *first2), invoke(proj1, *first1))) return false;
|
|
|
|
| 57 |
corresponding pair of elements that are not equivalent.
|
| 58 |
|
| 59 |
[*Example 1*:
|
| 60 |
|
| 61 |
`ranges::lexicographical_compare(I1, S1, I2, S2, Comp, Proj1, Proj2)`
|
| 62 |
+
can be implemented as:
|
| 63 |
|
| 64 |
``` cpp
|
| 65 |
for ( ; first1 != last1 && first2 != last2 ; ++first1, (void) ++first2) {
|
| 66 |
if (invoke(comp, invoke(proj1, *first1), invoke(proj2, *first2))) return true;
|
| 67 |
if (invoke(comp, invoke(proj2, *first2), invoke(proj1, *first1))) return false;
|