Advances the iterator on the next match.

At first, a local variable of typeBidirIt is constructed with the value ofmatch[0].second.

If the iterator holds a zero-length match andstart== end,*this is set to end-of-sequence iterator and the function returns.

Otherwise, if the iterator holds a zero-length match the operator invokes the following:

regex_search(start, end, match,*pregex,
             flags| regex_constants::match_not_null|
                     regex_constants::match_continuous);

If the call returnstrue, the function returns.

Otherwise the operator incrementsstart and continues as if the most recent match was not a zero-length match.

If the most recent match was not a zero-length match, the operator setsflags toflags| regex_constants::match_prev_avail and invokes the following:

regex_search(start, end, match,*pregex, flags);

If the call returnsfalse, the iterator sets*this to the end-of-sequence iterator, the function returns.

In all cases in which the call toregex_search returnstrue,match.prefix().first will be equal to the previous value ofmatch[0].second and for each index i in the range[​0​, match.size()) for whichmatch[i].matched istrue,match[i].position() will returndistance(begin, match[i].first).

This means thatmatch[i].position() gives the offset from the beginning of the target sequence, which is often not the same as the offset from the sequence passed in the call toregex_search.

It is unspecified how the implementation makes these adjustments. This means that a compiler may call an implementation-specific search function, in which case a user-defined specialization ofregex_search will not be called.

The behavior is undefined if the iterator is end-of-sequence iterator.

[edit]Parameters

(none)

[edit]Return value

• In other languages

• Deutsch
• Español
• 日本語
• Русский
• 中文