boost::xpressive::regex_match — 检查正则表达式是否从头到尾匹配序列。
// In header: <boost/xpressive/regex_algorithms.hpp> template<typename BidiIter> bool regex_match(BidiIter begin, BidiIter end, match_results< BidiIter > & what, basic_regex< BidiIter > const & re, regex_constants::match_flag_type flags = regex_constants::match_default); template<typename BidiIter> bool regex_match(BidiIter begin, BidiIter end, basic_regex< BidiIter > const & re, regex_constants::match_flag_type flags = regex_constants::match_default); template<typename Char> bool regex_match(Char * begin, match_results< Char * > & what, basic_regex< Char * > const & re, regex_constants::match_flag_type flags = regex_constants::match_default); template<typename BidiRange, typename BidiIter> bool regex_match(BidiRange & rng, match_results< BidiIter > & what, basic_regex< BidiIter > const & re, regex_constants::match_flag_type flags = regex_constants::match_default, unspecified = 0); template<typename BidiRange, typename BidiIter> bool regex_match(BidiRange const & rng, match_results< BidiIter > & what, basic_regex< BidiIter > const & re, regex_constants::match_flag_type flags = regex_constants::match_default, unspecified = 0); template<typename Char> bool regex_match(Char * begin, basic_regex< Char * > const & re, regex_constants::match_flag_type flags = regex_constants::match_default); template<typename BidiRange, typename BidiIter> bool regex_match(BidiRange & rng, basic_regex< BidiIter > const & re, regex_constants::match_flag_type flags = regex_constants::match_default, unspecified = 0); template<typename BidiRange, typename BidiIter> bool regex_match(BidiRange const & rng, basic_regex< BidiIter > const & re, regex_constants::match_flag_type flags = regex_constants::match_default, unspecified = 0);
确定正则表达式 re
是否与序列 [begin, end)
的全部内容完全匹配。
参数 |
|
||||||||||
要求 |
类型 |
||||||||||
要求 |
|
||||||||||
返回值 |
如果找到匹配项,则返回 |
||||||||||
抛出 |
regex_error 在堆栈耗尽时 |