Difference between revisions of "cpp/regex/regex search"
m (Text replace - "BidirectionalIterator" to "BidirIt") |
(+type reqs) |
||
Line 77: | Line 77: | ||
{{param list item | e | the std::regex}} | {{param list item | e | the std::regex}} | ||
{{param list item | flags | the match flags}} | {{param list item | flags | the match flags}} | ||
+ | {{param list hreq}} | ||
+ | {{param list req concept | BidirIt | BidirectionalIterator}} | ||
+ | {{param list req concept | Alloc | Allocator}} | ||
{{param list end}} | {{param list end}} | ||
===Return value=== | ===Return value=== | ||
Returns {{c|true}} if a match exists somewhere in the target sequence, {{c|false}} otherwise. | Returns {{c|true}} if a match exists somewhere in the target sequence, {{c|false}} otherwise. |
Revision as of 06:40, 3 August 2012
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( BidirIt first, BidirIt last,
std::match_results<BidirIt,Alloc>& m,
const std::basic_regex<CharT,Traits>& e,
std::regex_constants::match_flag_type flags =
<td > (1) </td> <td > (since C++11) </td> </tr> <tr class="t-dcl ">
<td >bool regex_search( const CharT* str,
std::match_results<BidirIt,Alloc>& m,
const std::basic_regex<CharT,Traits>& e,
std::regex_constants::match_flag_type flags =
<td > (2) </td> <td > (since C++11) </td> </tr> <tr class="t-dcl ">
<td > class Alloc, class CharT, class Traits >
bool regex_search( const std::basic_string<CharT,STraits,SAlloc>& s,
std::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 > (since C++11) </td> </tr> <tr class="t-dcl ">
<td > class CharT, class Traits >
bool regex_search( BidirIt first, BidirIt last,
const std::basic_regex<CharT,Traits>& e,
std::regex_constants::match_flag_type flags =
<td > (4) </td> <td > (since C++11) </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 > (since C++11) </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 > (since C++11) </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 |
Type requirements | ||
-BidirIt must meet the requirements of LegacyBidirectionalIterator.
| ||
-Alloc must meet the requirements of Allocator.
|
Return value
Returns true if a match exists somewhere in the target sequence, false otherwise.