Difference between revisions of "cpp/regex/regex search"
(Created page.) |
(Added remaining function signatures.) |
||
Line 21: | Line 21: | ||
> bool regex_search( const CharT* str, | > bool regex_search( const CharT* str, | ||
std::match_results<BidirectionalIterator,Allocator>& m, | std::match_results<BidirectionalIterator,Allocator>& m, | ||
+ | const std::basic_regex<CharT,Traits>& e, | ||
+ | std::regex_constants::match_flag_type flags {{=}} std::regex_constants::match_default ); | ||
+ | }} | ||
+ | {{ddcl list item | num=3 | 1= | ||
+ | template< | ||
+ | class ST, | ||
+ | class SA, | ||
+ | class Allocator, | ||
+ | class CharT, | ||
+ | class Traits | ||
+ | > bool regex_search( const basic_string<charT, ST, SA>& s, | ||
+ | match_results<typename basic_string<charT, ST, SA>::const_iterator, Allocator>& m, | ||
+ | const basic_regex<charT, traits>& e, | ||
+ | regex_constants::match_flag_type flags {{=}} regex_constants::match_default ); | ||
+ | }} | ||
+ | {{ddcl list item | num=4 | 1= | ||
+ | template< | ||
+ | class BidirectionalIterator, | ||
+ | class CharT, | ||
+ | class Traits | ||
+ | > bool regex_search( BidirectionalIterator first, BidirectionalIterator last, | ||
+ | const basic_regex<charT, traits>& e, | ||
+ | regex_constants::match_flag_type flags {{=}} regex_constants::match_default ); | ||
+ | }} | ||
+ | {{ddcl list item | num=5 | 1= | ||
+ | template< | ||
+ | class CharT, | ||
+ | class Traits | ||
+ | > bool regex_search( const CharT* str, | ||
+ | const basic_regex<charT, traits>& e, | ||
+ | regex_constants::match_flag_type flags {{=}} regex_constants::match_default ); | ||
+ | }} | ||
+ | {{ddcl list item | num=6 | 1= | ||
+ | template< | ||
+ | class ST, | ||
+ | class SA, | ||
+ | class CharT, | ||
+ | class Traits | ||
+ | > bool regex_search( const basic_string<charT, ST, SA>& 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_default ); | std::regex_constants::match_flag_type flags = std::regex_constants::match_default ); | ||
Line 26: | Line 65: | ||
{{ddcl list end}} | {{ddcl list end}} | ||
− | {{ | + | 1) Determines if there is a match between the regular express {{tt|e}} and some subsequence in the target character sequence {{tt|[first,last)}}. Match results are returned in {{tt|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=== | ||
+ | {{param list begin}} | ||
+ | {{param list item | first, last | the target character range}} | ||
+ | {{param list item | m | the match results}} | ||
+ | {{param list item | str | a target character null-terminated C-style string}} | ||
+ | {{param list item | s | a target character std::basic_string}} | ||
+ | {{param list item | e | the std::regex}} | ||
+ | {{param list item | flags | the match flags}} | ||
+ | {{param list end}} | ||
+ | |||
+ | ===Return value=== | ||
+ | Returns {{cpp|true}} if a match exists somewhere in the target sequence, {{cpp|false}} otherwise. |
Revision as of 15:24, 26 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 BidirectionalIterator,
class Allocator,
class CharT,
class Traits
> bool regex_search( BidirectionalIterator first, BidirectionalIterator last,
std::match_results<BidirectionalIterator,Allocator>& m,
const std::basic_regex<CharT,Traits>& e,
<td > (1) </td> <td class="t-dcl-nopad"> </td> </tr> <tr class="t-dcl ">
<td > class Allocator,
class CharT,
class Traits
> bool regex_search( const CharT* str,
std::match_results<BidirectionalIterator,Allocator>& m,
const std::basic_regex<CharT,Traits>& e,
<td > (2) </td> <td class="t-dcl-nopad"> </td> </tr> <tr class="t-dcl ">
<td > class ST,
class SA,
class Allocator,
class CharT,
class Traits
> bool regex_search( const basic_string<charT, ST, SA>& s,
match_results<typename basic_string<charT, ST, SA>::const_iterator, Allocator>& m,
const basic_regex<charT, traits>& e,
<td > (3) </td> <td class="t-dcl-nopad"> </td> </tr> <tr class="t-dcl ">
<td > class BidirectionalIterator,
class CharT,
class Traits
> bool regex_search( BidirectionalIterator first, BidirectionalIterator last,
const basic_regex<charT, traits>& e,
<td > (4) </td> <td class="t-dcl-nopad"> </td> </tr> <tr class="t-dcl ">
<td > class CharT,
class Traits
> bool regex_search( const CharT* str,
const basic_regex<charT, traits>& e,
<td > (5) </td> <td class="t-dcl-nopad"> </td> </tr> <tr class="t-dcl ">
<td > class ST,
class SA,
class CharT,
class Traits
> bool regex_search( const basic_string<charT, ST, SA>& s,
const std::basic_regex<CharT,Traits>& e,
<td > (6) </td> <td class="t-dcl-nopad"> </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.