|
1118 | 1118 | \pnum\effects If \tcode{typeid(use_facet<collate<charT>>)
|
1119 | 1119 | == typeid(collate_byname<charT>)}
|
1120 | 1120 | and the form of the sort key returned
|
1121 |
| -by \tcode{collate_byname<charT> \colcol transform(first, last)} is known and |
| 1121 | +by \tcode{collate_byname<charT>::transform(first, last)} is known and |
1122 | 1122 | can be converted into a primary sort key then returns that key,
|
1123 | 1123 | otherwise returns an empty string.
|
1124 | 1124 | \end{itemdescr}
|
|
3640 | 3640 | \pnum
|
3641 | 3641 | \indexlibrary{\idxcode{match_prev_avail}}%
|
3642 | 3642 | If the most recent match was not a zero-length match, the operator sets
|
3643 |
| -\tcode{flags} to \tcode{flags | regex_constants \colcol match_prev_avail} and |
| 3643 | +\tcode{flags} to \tcode{flags | regex_constants::match_prev_avail} and |
3644 | 3644 | calls \tcode{regex_search(start, end, match, *pregex, flags)}. If the call returns
|
3645 | 3645 | \tcode{false} the iterator sets \tcode{*this} to the end-of-sequence iterator. The
|
3646 | 3646 | iterator then returns \tcode{*this}.
|
|
4163 | 4163 | \item During matching of a regular expression finite state machine
|
4164 | 4164 | against a sequence of characters, comparison of a collating element
|
4165 | 4165 | range \tcode{c1-c2} against a character \tcode{c} is
|
4166 |
| -conducted as follows: if \tcode{flags() \& regex_constants \colcol |
4167 |
| -collate} is false then the character \tcode{c} is matched if \tcode{c1 |
| 4166 | +conducted as follows: if \tcode{flags() \& regex_constants::collate} |
| 4167 | +is false then the character \tcode{c} is matched if \tcode{c1 |
4168 | 4168 | <= c \&\& c <= c2}, otherwise \tcode{c} is matched in
|
4169 | 4169 | accordance with the following algorithm:
|
4170 | 4170 |
|
|
0 commit comments