tmp/tmp7x9jc9gy/{from.md → to.md}
RENAMED
|
@@ -16,11 +16,12 @@ returns `true` only if:
|
|
| 16 |
- `m1.prefix() == m2.prefix()`,
|
| 17 |
- `m1.size() == m2.size() && equal(m1.begin(), m1.end(), m2.begin())`,
|
| 18 |
and
|
| 19 |
- `m1.suffix() == m2.suffix()`.
|
| 20 |
|
| 21 |
-
The algorithm `equal` is defined in
|
|
|
|
| 22 |
|
| 23 |
``` cpp
|
| 24 |
template <class BidirectionalIterator, class Allocator>
|
| 25 |
bool operator!=(const match_results<BidirectionalIterator, Allocator>& m1,
|
| 26 |
const match_results<BidirectionalIterator, Allocator>& m2);
|
|
|
|
| 16 |
- `m1.prefix() == m2.prefix()`,
|
| 17 |
- `m1.size() == m2.size() && equal(m1.begin(), m1.end(), m2.begin())`,
|
| 18 |
and
|
| 19 |
- `m1.suffix() == m2.suffix()`.
|
| 20 |
|
| 21 |
+
[*Note 1*: The algorithm `equal` is defined in
|
| 22 |
+
Clause [[algorithms]]. — *end note*]
|
| 23 |
|
| 24 |
``` cpp
|
| 25 |
template <class BidirectionalIterator, class Allocator>
|
| 26 |
bool operator!=(const match_results<BidirectionalIterator, Allocator>& m1,
|
| 27 |
const match_results<BidirectionalIterator, Allocator>& m2);
|