bool match_(match_state<BidiIter> &state, Next const &next, mpl::true_) const
{
sub_match_impl<BidiIter> &br = state.sub_match(this->mark_number_);
if(this->max_ > br.repeat_count_)
{
++br.repeat_count_;
// loop back to the expression "pushed" in repeat_begin_matcher::match
if(next.top_match(state, this->back_))
{
return true;
}
else if(--br.repeat_count_ < this->min_)
{
return false;
}
}
// looping finished, continue matching the rest of the pattern
return next.skip_match(state);
}
bool match(match_state<BidiIter> &state, Next const &next) const
{
// prevent repeated zero-width sub-matches from causing infinite recursion
sub_match_impl<BidiIter> &br = state.sub_match(this->mark_number_);
if(br.zero_width_ && br.begin_ == state.cur_)
{
return next.skip_match(state);
}
bool old_zero_width = br.zero_width_;
br.zero_width_ = (br.begin_ == state.cur_);
if(this->match_(state, next, greedy_type()))
{
return true;
}
br.zero_width_ = old_zero_width;
return false;
}
bool match_(match_state<BidiIter> &state, Next const &next, mpl::false_) const
{
sub_match_impl<BidiIter> &br = state.sub_match(this->mark_number_);
if(this->min_ <= br.repeat_count_)
{
if(next.skip_match(state))
{
return true;
}
}
if(this->max_ > br.repeat_count_)
{
++br.repeat_count_;
if(next.top_match(state, this->back_))
{
return true;
}
--br.repeat_count_;
}
return false;
}
