Difference between revisions of "cpp/regex/regex search"
(fmt) |
(replace *Allocator with Alloc for brevity) |
||
Line 5: | Line 5: | ||
{{ddcl list item | num=1 | notes={{mark c++11 feature}} | 1= | {{ddcl list item | num=1 | notes={{mark c++11 feature}} | 1= | ||
template< class BidirectionalIterator, | template< class BidirectionalIterator, | ||
− | class | + | class Alloc, class CharT, class Traits > |
bool regex_search( BidirectionalIterator first, BidirectionalIterator last, | bool regex_search( BidirectionalIterator first, BidirectionalIterator last, | ||
− | std::match_results<BidirectionalIterator, | + | std::match_results<BidirectionalIterator,Alloc>& m, |
const std::basic_regex<CharT,Traits>& e, | const std::basic_regex<CharT,Traits>& e, | ||
std::regex_constants::match_flag_type flags = | std::regex_constants::match_flag_type flags = | ||
Line 13: | Line 13: | ||
}} | }} | ||
{{ddcl list item | num=2 | notes={{mark c++11 feature}} | 1= | {{ddcl list item | num=2 | notes={{mark c++11 feature}} | 1= | ||
− | template< class | + | template< class Alloc, class CharT, class Traits > |
bool regex_search( const CharT* str, | bool regex_search( const CharT* str, | ||
− | std::match_results<BidirectionalIterator, | + | std::match_results<BidirectionalIterator,Alloc>& m, |
const std::basic_regex<CharT,Traits>& e, | const std::basic_regex<CharT,Traits>& e, | ||
std::regex_constants::match_flag_type flags {{=}} | std::regex_constants::match_flag_type flags {{=}} | ||
Line 21: | Line 21: | ||
}} | }} | ||
{{ddcl list item | num=3 | notes={{mark c++11 feature}} | 1= | {{ddcl list item | num=3 | notes={{mark c++11 feature}} | 1= | ||
− | template< class STraits, class | + | template< class STraits, class SAlloc, |
− | class | + | class Alloc, class CharT, class Traits > |
− | bool regex_search( const std::basic_string<CharT,STraits, | + | bool regex_search( const std::basic_string<CharT,STraits,SAlloc>& s, |
match_results< | match_results< | ||
− | typename std::basic_string<CharT,STraits, | + | typename std::basic_string<CharT,STraits,SAlloc>::const_iterator, |
− | + | Alloc | |
>& m, | >& m, | ||
const std::basic_regex<charT, traits>& e, | const std::basic_regex<charT, traits>& e, | ||
Line 48: | Line 48: | ||
}} | }} | ||
{{ddcl list item | num=6 | notes={{mark c++11 feature}} | 1= | {{ddcl list item | num=6 | notes={{mark c++11 feature}} | 1= | ||
− | template< class STraits, class | + | template< class STraits, class SAlloc, |
class CharT, class Traits > | class CharT, class Traits > | ||
− | bool regex_search( const std::basic_string<CharT,STraits, | + | bool regex_search( const std::basic_string<CharT,STraits,SAlloc>& s, |
const std::basic_regex<CharT,Traits>& e, | const std::basic_regex<CharT,Traits>& e, | ||
std::regex_constants::match_flag_type flags = | std::regex_constants::match_flag_type flags = |
Revision as of 11:28, 27 October 2011
Template:cpp/regex/sidebar Template:ddcl list begin <tr class="t-dsc-header">
<td><regex>
<td></td> <td></td> </tr> <tr class="t-dcl ">
<td > class Alloc, class CharT, class Traits >
bool regex_search( BidirectionalIterator first, BidirectionalIterator last,
std::match_results<BidirectionalIterator,Alloc>& m,
const std::basic_regex<CharT,Traits>& e,
std::regex_constants::match_flag_type flags =
<td > (1) </td> <td > Template:mark c++11 feature </td> </tr> <tr class="t-dcl ">
<td >bool regex_search( const CharT* str,
std::match_results<BidirectionalIterator,Alloc>& m,
const std::basic_regex<CharT,Traits>& e,
std::regex_constants::match_flag_type flags =
<td > (2) </td> <td > Template:mark c++11 feature </td> </tr> <tr class="t-dcl ">
<td > class Alloc, class CharT, class Traits >
bool regex_search( const std::basic_string<CharT,STraits,SAlloc>& s,
match_results<
typename std::basic_string<CharT,STraits,SAlloc>::const_iterator,
Alloc
>& m,
const std::basic_regex<charT, traits>& e,
std::regex_constants::match_flag_type flags =
<td > (3) </td> <td > Template:mark c++11 feature </td> </tr> <tr class="t-dcl ">
<td > class CharT, class Traits >
bool regex_search( BidirectionalIterator first, BidirectionalIterator last,
const std::basic_regex<CharT,Traits>& e,
std::regex_constants::match_flag_type flags =
<td > (4) </td> <td > Template:mark c++11 feature </td> </tr> <tr class="t-dcl ">
<td >bool regex_search( const CharT* str,
const std::basic_regex<CharT,Traits>& e,
std::regex_constants::match_flag_type flags =
<td > (5) </td> <td > Template:mark c++11 feature </td> </tr> <tr class="t-dcl ">
<td > class CharT, class Traits >
bool regex_search( const std::basic_string<CharT,STraits,SAlloc>& s,
const std::basic_regex<CharT,Traits>& e,
std::regex_constants::match_flag_type flags =
<td > (6) </td> <td > Template:mark c++11 feature </td> </tr> Template:ddcl list end
1) Determines if there is a match between the regular express e
and some subsequence in the target character sequence [first,last)
. Match results are returned in m
.
2) Returns std::regex_search(str, str + std::char_traits<charT>::length(str), m, e, flags).
3) Returns std::regex_search(s.begin(), s.end(), m, e, flags).
4) The same as (1), omitting the match results.
5) Returns std::regex_search(str, str + std::char_traits<charT>::length(str), e, flags).
6) Returns std::regex_search(s.begin(), s.end(), e, flags).
Parameters
first, last | - | the target character range |
m | - | the match results |
str | - | a target character null-terminated C-style string |
s | - | a target character std::basic_string |
e | - | the std::regex |
flags | - | the match flags |
Return value
Returns Template:cpp if a match exists somewhere in the target sequence, Template:cpp otherwise.