std::regex_search

 

C++

Language

Standard library headers

Concepts

Utilities library

Strings library

Containers library

Algorithms library

Iterators library

Numerics library

Input/output library

Localizations library

Regular expressions library (C++11)

Atomic operations library (C++11)

Thread support library (C++11)

 

Regular expressions library

Classes

basic_regex (C++11)

sub_match (C++11)

match_results (C++11)

Algorithms

regex_match (C++11)

regex_search (C++11)

regex_replace (C++11)

Iterators

regex_iterator (C++11)

regex_token_iterator (C++11)

Exceptions

regex_error (C++11)

Traits

regex_traits (C++11)

Constants

syntax_option_type (C++11)

match_flag_type (C++11)

error_type (C++11)

 

Defined in header <regex>
template< class BidirIt,           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 =                        std::regex_constants::match_default );	(1)	(since C++11)
template< class Alloc, class CharT, class Traits > 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 =                        std::regex_constants::match_default );	(2)	(since C++11)
template< class STraits, class SAlloc,           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 =                        std::regex_constants::match_default );	(3)	(since C++11)
template< class BidirIt,           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 =                        std::regex_constants::match_default );	(4)	(since C++11)
template< class CharT, class Traits > bool regex_search( const CharT* str,                    const std::basic_regex<CharT,Traits>& e,                    std::regex_constants::match_flag_type flags =                        std::regex_constants::match_default );	(5)	(since C++11)
template< class STraits, class SAlloc,           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 =                        std::regex_constants::match_default );	(6)	(since C++11)

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).

Note that regex_search can successfully match any subsequence of the given sequence, whereas std::regex_match will only return true if the regular expression matches the entire sequence.

Parameters

first, last	-	the target character range
m	-	the match results
str	-	a target null-terminated C-style string
s	-	a target std::basic_string
e	-	the std::regex that should be applied to the target
flags	-	std::regex_constants::match_flag_type governing search behavior
Type requirements
- BidirIt must meet the requirements of BidirectionalIterator.
- Alloc must meet the requirements of Allocator.

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	m[0].first
m.prefix().matched	m.prefix().first != m.prefix().second
m.suffix().first	m[0].second
m.suffix().second	last
m.suffix().matched	m.suffix().first != m.suffix().second
m[0].first	the start of the matching sequence
m[0].second	the end of the matching sequence
m[0].matched	true if a match was found, false otherwise
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

Example

run this code

#include <iostream>
#include <string>
#include <regex>
 
int main()
{
    std::string lines[] = {"Roses are #ff0000",
                           "violets are #0000ff",
                           "all of my base are belong to you"};
 
    std::regex color_regex("#([a-f0-9]{2})"
                            "([a-f0-9]{2})"
                            "([a-f0-9]{2})");
 
    for (const auto &line : lines) {
        std::cout << line << ": " 
                  << std::regex_search(line, color_regex) << '\n';
    }   
 
    std::smatch color_match;
    for (const auto &line : lines) {
        std::regex_search(line, color_match, color_regex);
        std::cout << "matches for '" << line << "'\n";
        for (size_t i = 0; i < color_match.size(); ++i) {
            std::ssub_match sub_match = color_match[i];
            std::string sub_match_str = sub_match.str();
            std::cout << i << ": " << sub_match_str << '\n';
        }   
    }   
}

Output:

Roses are #ff0000: 1
violets are #0000ff: 1
all of my base are belong to you: 0
matches for 'Roses are #ff0000'
0: #ff0000
1: ff
2: 00
3: 00
matches for 'violets are #0000ff'
0: #0000ff
1: 00
2: 00
3: ff
matches for 'all of my base are belong to you'

See also

basic_regex (C++11)	regular expression object (class template)
match_results (C++11)	identifies one regular expression match, including all sub-expression matches (class template)
regex_match (C++11)	attempts to match a regular expression to an entire character sequence (function template)