tmp/tmpvw_l9jtr/{from.md → to.md}
RENAMED
|
@@ -9,35 +9,35 @@ match any character sequence.
|
|
| 9 |
|
| 10 |
``` cpp
|
| 11 |
explicit basic_regex(const charT* p, flag_type f = regex_constants::ECMAScript);
|
| 12 |
```
|
| 13 |
|
| 14 |
-
*Requires:*
|
| 15 |
|
| 16 |
-
*Throws:* `regex_error` if
|
| 17 |
|
| 18 |
*Effects:* Constructs an object of class `basic_regex`; the object’s
|
| 19 |
internal finite state machine is constructed from the regular expression
|
| 20 |
contained in the array of `charT` of length
|
| 21 |
`char_traits<charT>::length(p)` whose first element is designated by
|
| 22 |
-
|
| 23 |
|
| 24 |
*Postconditions:* `flags()` returns `f`. `mark_count()` returns the
|
| 25 |
number of marked sub-expressions within the expression.
|
| 26 |
|
| 27 |
``` cpp
|
| 28 |
basic_regex(const charT* p, size_t len, flag_type f);
|
| 29 |
```
|
| 30 |
|
| 31 |
-
*Requires:*
|
| 32 |
|
| 33 |
-
*Throws:* `regex_error` if
|
| 34 |
|
| 35 |
*Effects:* Constructs an object of class `basic_regex`; the object’s
|
| 36 |
internal finite state machine is constructed from the regular expression
|
| 37 |
contained in the sequence of characters \[`p`, `p+len`), and interpreted
|
| 38 |
-
according the flags specified in
|
| 39 |
|
| 40 |
*Postconditions:* `flags()` returns `f`. `mark_count()` returns the
|
| 41 |
number of marked sub-expressions within the expression.
|
| 42 |
|
| 43 |
``` cpp
|
|
@@ -92,11 +92,10 @@ interpreted according to the flags specified in `f`.
|
|
| 92 |
|
| 93 |
*Postconditions:* `flags()` returns `f`. `mark_count()` returns the
|
| 94 |
number of marked sub-expressions within the expression.
|
| 95 |
|
| 96 |
``` cpp
|
| 97 |
-
basic_regex(initializer_list<charT> il,
|
| 98 |
-
flag_type f = regex_constants::ECMAScript);
|
| 99 |
```
|
| 100 |
|
| 101 |
*Effects:* Same as `basic_regex(il.begin(), il.end(), f)`.
|
| 102 |
|
|
|
|
| 9 |
|
| 10 |
``` cpp
|
| 11 |
explicit basic_regex(const charT* p, flag_type f = regex_constants::ECMAScript);
|
| 12 |
```
|
| 13 |
|
| 14 |
+
*Requires:* `p` shall not be a null pointer.
|
| 15 |
|
| 16 |
+
*Throws:* `regex_error` if `p` is not a valid regular expression.
|
| 17 |
|
| 18 |
*Effects:* Constructs an object of class `basic_regex`; the object’s
|
| 19 |
internal finite state machine is constructed from the regular expression
|
| 20 |
contained in the array of `charT` of length
|
| 21 |
`char_traits<charT>::length(p)` whose first element is designated by
|
| 22 |
+
`p`, and interpreted according to the flags `f`.
|
| 23 |
|
| 24 |
*Postconditions:* `flags()` returns `f`. `mark_count()` returns the
|
| 25 |
number of marked sub-expressions within the expression.
|
| 26 |
|
| 27 |
``` cpp
|
| 28 |
basic_regex(const charT* p, size_t len, flag_type f);
|
| 29 |
```
|
| 30 |
|
| 31 |
+
*Requires:* `p` shall not be a null pointer.
|
| 32 |
|
| 33 |
+
*Throws:* `regex_error` if `p` is not a valid regular expression.
|
| 34 |
|
| 35 |
*Effects:* Constructs an object of class `basic_regex`; the object’s
|
| 36 |
internal finite state machine is constructed from the regular expression
|
| 37 |
contained in the sequence of characters \[`p`, `p+len`), and interpreted
|
| 38 |
+
according the flags specified in `f`.
|
| 39 |
|
| 40 |
*Postconditions:* `flags()` returns `f`. `mark_count()` returns the
|
| 41 |
number of marked sub-expressions within the expression.
|
| 42 |
|
| 43 |
``` cpp
|
|
|
|
| 92 |
|
| 93 |
*Postconditions:* `flags()` returns `f`. `mark_count()` returns the
|
| 94 |
number of marked sub-expressions within the expression.
|
| 95 |
|
| 96 |
``` cpp
|
| 97 |
+
basic_regex(initializer_list<charT> il, flag_type f = regex_constants::ECMAScript);
|
|
|
|
| 98 |
```
|
| 99 |
|
| 100 |
*Effects:* Same as `basic_regex(il.begin(), il.end(), f)`.
|
| 101 |
|