std::regex_match
| Defined in header <regex>
|
||
| template< class BidirIt, class Alloc, class CharT, class Traits > |
(1) | (since C++11) |
| template< class BidirIt, class CharT, class Traits > |
(2) | (since C++11) |
| template< class CharT, class Alloc, class Traits > bool regex_match( const CharT* str, |
(3) | (since C++11) |
| template< class STraits, class SAlloc, class Alloc, class CharT, class Traits > |
(4) | (since C++11) |
| template< class CharT, class Traits > bool regex_match( const CharT* str, |
(5) | (since C++11) |
| template< class STraits, class SAlloc, class CharT, class Traits > |
(6) | (since C++11) |
1) Determines if there is a match between the regular expression e and the entire target character sequence [first,last), taking into account the effect of flags. Match results are returned in m.
2) Behaves as (1) above, omitting the match results.
3) Returns std::regex_match(str, str + std::char_traits<charT>::length(str), m, e, flags).
4) Returns std::regex_match(s.begin(), s.end(), m, e, flags).
5) Returns std::regex_match(str, str + std::char_traits<charT>::length(str), e, flags).
6) Returns std::regex_match(s.begin(), s.end(), e, flags).
Contents |
[edit] Parameters
| first, last | - | the target character range to apply the regex to, given as iterators |
| m | - | the match results |
| str | - | the target string, given as a null-terminated C-style string |
| s | - | the target string, given as a std::basic_string |
| e | - | the regular expression |
| flags | - | flags used to determine how the match will be performed |
| Type requirements | ||
-BidirIt must meet the requirements of BidirectionalIterator.
| ||
[edit] Return value
Returns true if a match exists, false otherwise. In either case, the object m is updated, as follows:
If the match does not exist:
| m.ready() == true | |
| m.empty() == true | |
| m.size() == 0 |
If the match exists:
| m.ready() | true |
| m.empty() | false |
| m.size() | number of subexpressions plus 1, that is, 1+e.mark_count() |
| m.prefix().first | first
|
| m.prefix().second | first
|
| m.prefix().matched | false (the match prefix is empty) |
| m.suffix().first | last
|
| m.suffix().second | last
|
| m.suffix().matched | false (the match suffix is empty) |
| m[0].first | first
|
| m[0].second | last
|
| m[0].matched | true (the entire sequence is matched) |
| m[n].first | the start of the sequence that matched sub-expression n, or last if the subexpression did not participate in the match
|
| m[n].second | the end of the sequence that matched sub-expression n, or last if the subexpression did not participate in the match
|
| m[n].matched | true if sub-expression n participated in the match, false otherwise |
[edit] Example
#include <iostream> #include <string> #include <regex> int main() { std::string fnames[] = {"foo.txt", "bar.txt", "zoidberg"}; std::regex txt_regex("[a-z]+\\.txt"); for (const auto &fname : fnames) { std::cout << fname << ": " << std::regex_match(fname, txt_regex) << '\n'; } }
Output:
foo.txt: 1 bar.txt: 1 zoidberg: 0
[edit] See also
| (C++11) |
regular expression object (class template) |
| (C++11) |
identifies one regular expression match, including all sub-expression matches (class template) |