Searched refs:next_count (Results 1 – 4 of 4) sorted by relevance
332 …repeater_count<BidiIterator> r(rep->state_id, &next_count, position, this->recursion_stack.size() … in match_rep()338 next_count->check_null_repeat(position, rep->max); in match_rep()353 if(next_count->get_count() < rep->min) in match_rep()359 ++(*next_count); in match_rep()369 if((next_count->get_count() < rep->max) && take_first) in match_rep()374 ++(*next_count); in match_rep()405 if((next_count->get_count() < rep->max) && take_first) in match_rep()408 ++(*next_count); in match_rep()922 recursion_stack.back().repeater_stack = next_count; in match_recursion()927 repeater_count<BidiIterator>* saved = next_count; in match_recursion()[all …]
623 || (next_count->get_id() != rep->state_id)) in match_rep()627 push_repeater_count(rep->state_id, &next_count); in match_rep()634 next_count->check_null_repeat(position, rep->max); in match_rep()636 if(next_count->get_count() < rep->min) in match_rep()642 ++(*next_count); in match_rep()653 if((next_count->get_count() < rep->max) && take_first) in match_rep()661 ++(*next_count); in match_rep()677 if((next_count->get_count() < rep->max) && take_first) in match_rep()685 if((next_count->get_count() < rep->max) && take_first) in match_rep()688 ++(*next_count); in match_rep()[all …]
391 m_independent(false), next_count(&rep_obj), rep_obj(&next_count) in perl_matcher()513 repeater_count<BidiIterator>* next_count; member in boost::BOOST_REGEX_DETAIL_NS::perl_matcher
637 int *prev_count, int *next_count) in alloc_blocks() argument664 *next_count = (*limit)->limit; in alloc_blocks()