tmp/tmpfup2r8v5/{from.md → to.md}
RENAMED
|
@@ -25,25 +25,25 @@ that `m.size()` returns `0` and `m.empty()` returns `true`. Otherwise
|
|
| 25 |
the effects on parameter `m` are given in Table [[tab:re:alg:match]].
|
| 26 |
|
| 27 |
**Table: Effects of `regex_match` algorithm** <a id="tab:re:alg:match">[tab:re:alg:match]</a>
|
| 28 |
|
| 29 |
| Element | Value |
|
| 30 |
-
| -------------------- | ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
|
| 31 |
| `m.size()` | `1 + e.mark_count()` |
|
| 32 |
| `m.empty()` | false |
|
| 33 |
| `m.prefix().first` | first |
|
| 34 |
| `m.prefix().second` | first |
|
| 35 |
| `m.prefix().matched` | false |
|
| 36 |
| `m.suffix().first` | last |
|
| 37 |
| `m.suffix().second` | last |
|
| 38 |
| `m.suffix().matched` | false |
|
| 39 |
| `m[0].first` | first |
|
| 40 |
| `m[0].second` | last |
|
| 41 |
-
| `m[0].matched` | `true`
|
| 42 |
-
| `m[n].first` | For all integers `n < m.size()`, the start of the sequence that matched sub-expression `n`. Alternatively, if sub-expression `n` did not participate in the match, then `last`. |
|
| 43 |
-
| `m[n].second` | For all integers `n < m.size()`, the end of the sequence that matched sub-expression `n`. Alternatively, if sub-expression `n` did not participate in the match, then `last`. |
|
| 44 |
-
| `m[n].matched` | For all integers `n < m.size()`, `true` if sub-expression `n` participated in the match, `false` otherwise. |
|
| 45 |
|
| 46 |
``` cpp
|
| 47 |
template <class BidirectionalIterator, class charT, class traits>
|
| 48 |
bool regex_match(BidirectionalIterator first, BidirectionalIterator last,
|
| 49 |
const basic_regex<charT, traits>& e,
|
|
|
|
| 25 |
the effects on parameter `m` are given in Table [[tab:re:alg:match]].
|
| 26 |
|
| 27 |
**Table: Effects of `regex_match` algorithm** <a id="tab:re:alg:match">[tab:re:alg:match]</a>
|
| 28 |
|
| 29 |
| Element | Value |
|
| 30 |
+
| -------------------- | ----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
|
| 31 |
| `m.size()` | `1 + e.mark_count()` |
|
| 32 |
| `m.empty()` | false |
|
| 33 |
| `m.prefix().first` | first |
|
| 34 |
| `m.prefix().second` | first |
|
| 35 |
| `m.prefix().matched` | false |
|
| 36 |
| `m.suffix().first` | last |
|
| 37 |
| `m.suffix().second` | last |
|
| 38 |
| `m.suffix().matched` | false |
|
| 39 |
| `m[0].first` | first |
|
| 40 |
| `m[0].second` | last |
|
| 41 |
+
| `m[0].matched` | `true` |
|
| 42 |
+
| `m[n].first` | For all integers `0 < n < m.size()`, the start of the sequence that matched sub-expression `n`. Alternatively, if sub-expression `n` did not participate in the match, then `last`. |
|
| 43 |
+
| `m[n].second` | For all integers `0 < n < m.size()`, the end of the sequence that matched sub-expression `n`. Alternatively, if sub-expression `n` did not participate in the match, then `last`. |
|
| 44 |
+
| `m[n].matched` | For all integers `0 < n < m.size()`, `true` if sub-expression `n` participated in the match, `false` otherwise. |
|
| 45 |
|
| 46 |
``` cpp
|
| 47 |
template <class BidirectionalIterator, class charT, class traits>
|
| 48 |
bool regex_match(BidirectionalIterator first, BidirectionalIterator last,
|
| 49 |
const basic_regex<charT, traits>& e,
|