tmp/tmp6xr45f0h/{from.md → to.md}
RENAMED
|
@@ -3,12 +3,11 @@
|
|
| 3 |
``` cpp
|
| 4 |
template <class BidirectionalIterator, class Allocator, class charT, class traits>
|
| 5 |
bool regex_search(BidirectionalIterator first, BidirectionalIterator last,
|
| 6 |
match_results<BidirectionalIterator, Allocator>& m,
|
| 7 |
const basic_regex<charT, traits>& e,
|
| 8 |
-
regex_constants::match_flag_type flags =
|
| 9 |
-
regex_constants::match_default);
|
| 10 |
```
|
| 11 |
|
| 12 |
*Requires:* Type `BidirectionalIterator` shall satisfy the requirements
|
| 13 |
of a Bidirectional Iterator ([[bidirectional.iterators]]).
|
| 14 |
|
|
@@ -44,59 +43,52 @@ the effects on parameter `m` are given in Table [[tab:re:alg:search]].
|
|
| 44 |
|
| 45 |
``` cpp
|
| 46 |
template <class charT, class Allocator, class traits>
|
| 47 |
bool regex_search(const charT* str, match_results<const charT*, Allocator>& m,
|
| 48 |
const basic_regex<charT, traits>& e,
|
| 49 |
-
|
| 50 |
-
regex_constants::match_default);
|
| 51 |
```
|
| 52 |
|
| 53 |
-
*Returns:*
|
| 54 |
`regex_search(str, str + char_traits<charT>::length(str), m, e, flags)`.
|
| 55 |
|
| 56 |
``` cpp
|
| 57 |
template <class ST, class SA, class Allocator, class charT, class traits>
|
| 58 |
bool regex_search(const basic_string<charT, ST, SA>& s,
|
| 59 |
-
match_results<
|
| 60 |
-
typename basic_string<charT, ST, SA>::const_iterator,
|
| 61 |
Allocator>& m,
|
| 62 |
const basic_regex<charT, traits>& e,
|
| 63 |
-
regex_constants::match_flag_type flags =
|
| 64 |
-
regex_constants::match_default);
|
| 65 |
```
|
| 66 |
|
| 67 |
-
*Returns:*
|
| 68 |
-
`regex_search(s.begin(), s.end(), m, e, flags)`.
|
| 69 |
|
| 70 |
``` cpp
|
| 71 |
template <class BidirectionalIterator, class charT, class traits>
|
| 72 |
bool regex_search(BidirectionalIterator first, BidirectionalIterator last,
|
| 73 |
const basic_regex<charT, traits>& e,
|
| 74 |
-
regex_constants::match_flag_type flags =
|
| 75 |
-
regex_constants::match_default);
|
| 76 |
```
|
| 77 |
|
| 78 |
*Effects:* Behaves “as if” by constructing an object `what` of type
|
| 79 |
-
`match_results<BidirectionalIterator>` and
|
| 80 |
`regex_search(first, last, what, e, flags)`.
|
| 81 |
|
| 82 |
``` cpp
|
| 83 |
template <class charT, class traits>
|
| 84 |
bool regex_search(const charT* str,
|
| 85 |
const basic_regex<charT, traits>& e,
|
| 86 |
-
regex_constants::match_flag_type flags =
|
| 87 |
-
regex_constants::match_default);
|
| 88 |
```
|
| 89 |
|
| 90 |
*Returns:*
|
| 91 |
-
`regex_search(str, str + char_traits<charT>::length(str), e, flags)`
|
| 92 |
|
| 93 |
``` cpp
|
| 94 |
template <class ST, class SA, class charT, class traits>
|
| 95 |
bool regex_search(const basic_string<charT, ST, SA>& s,
|
| 96 |
const basic_regex<charT, traits>& e,
|
| 97 |
-
regex_constants::match_flag_type flags =
|
| 98 |
-
regex_constants::match_default);
|
| 99 |
```
|
| 100 |
|
| 101 |
*Returns:* `regex_search(s.begin(), s.end(), e, flags)`.
|
| 102 |
|
|
|
|
| 3 |
``` cpp
|
| 4 |
template <class BidirectionalIterator, class Allocator, class charT, class traits>
|
| 5 |
bool regex_search(BidirectionalIterator first, BidirectionalIterator last,
|
| 6 |
match_results<BidirectionalIterator, Allocator>& m,
|
| 7 |
const basic_regex<charT, traits>& e,
|
| 8 |
+
regex_constants::match_flag_type flags = regex_constants::match_default);
|
|
|
|
| 9 |
```
|
| 10 |
|
| 11 |
*Requires:* Type `BidirectionalIterator` shall satisfy the requirements
|
| 12 |
of a Bidirectional Iterator ([[bidirectional.iterators]]).
|
| 13 |
|
|
|
|
| 43 |
|
| 44 |
``` cpp
|
| 45 |
template <class charT, class Allocator, class traits>
|
| 46 |
bool regex_search(const charT* str, match_results<const charT*, Allocator>& m,
|
| 47 |
const basic_regex<charT, traits>& e,
|
| 48 |
+
regex_constants::match_flag_type flags = regex_constants::match_default);
|
|
|
|
| 49 |
```
|
| 50 |
|
| 51 |
+
*Returns:*
|
| 52 |
`regex_search(str, str + char_traits<charT>::length(str), m, e, flags)`.
|
| 53 |
|
| 54 |
``` cpp
|
| 55 |
template <class ST, class SA, class Allocator, class charT, class traits>
|
| 56 |
bool regex_search(const basic_string<charT, ST, SA>& s,
|
| 57 |
+
match_results<typename basic_string<charT, ST, SA>::const_iterator,
|
|
|
|
| 58 |
Allocator>& m,
|
| 59 |
const basic_regex<charT, traits>& e,
|
| 60 |
+
regex_constants::match_flag_type flags = regex_constants::match_default);
|
|
|
|
| 61 |
```
|
| 62 |
|
| 63 |
+
*Returns:* `regex_search(s.begin(), s.end(), m, e, flags)`.
|
|
|
|
| 64 |
|
| 65 |
``` cpp
|
| 66 |
template <class BidirectionalIterator, class charT, class traits>
|
| 67 |
bool regex_search(BidirectionalIterator first, BidirectionalIterator last,
|
| 68 |
const basic_regex<charT, traits>& e,
|
| 69 |
+
regex_constants::match_flag_type flags = regex_constants::match_default);
|
|
|
|
| 70 |
```
|
| 71 |
|
| 72 |
*Effects:* Behaves “as if” by constructing an object `what` of type
|
| 73 |
+
`match_results<BidirectionalIterator>` and returning
|
| 74 |
`regex_search(first, last, what, e, flags)`.
|
| 75 |
|
| 76 |
``` cpp
|
| 77 |
template <class charT, class traits>
|
| 78 |
bool regex_search(const charT* str,
|
| 79 |
const basic_regex<charT, traits>& e,
|
| 80 |
+
regex_constants::match_flag_type flags = regex_constants::match_default);
|
|
|
|
| 81 |
```
|
| 82 |
|
| 83 |
*Returns:*
|
| 84 |
+
`regex_search(str, str + char_traits<charT>::length(str), e, flags)`.
|
| 85 |
|
| 86 |
``` cpp
|
| 87 |
template <class ST, class SA, class charT, class traits>
|
| 88 |
bool regex_search(const basic_string<charT, ST, SA>& s,
|
| 89 |
const basic_regex<charT, traits>& e,
|
| 90 |
+
regex_constants::match_flag_type flags = regex_constants::match_default);
|
|
|
|
| 91 |
```
|
| 92 |
|
| 93 |
*Returns:* `regex_search(s.begin(), s.end(), e, flags)`.
|
| 94 |
|