Searched refs:min_match (Results 1 – 4 of 4) sorted by relevance
2608 virtual int min_match() = 0;2634 virtual int min_match() OVERRIDE { return min_match_; } in min_match() function2655 virtual int min_match() OVERRIDE { return min_match_; } in min_match() function2683 virtual int min_match() OVERRIDE { return 0; } in min_match() function2728 virtual int min_match() OVERRIDE { return 1; } in min_match() function2765 virtual int min_match() OVERRIDE { return data_.length(); } in min_match() function2784 virtual int min_match() OVERRIDE { return length_; } in min_match() function2805 min_match_(min * body->min_match()), in RegExpQuantifier()2826 virtual int min_match() OVERRIDE { return min_match_; } in min_match() function2861 virtual int min_match() OVERRIDE { return body_->min_match(); } in min_match() function[all …]
961 min_match_ = first_alternative->min_match(); in RegExpDisjunction()965 min_match_ = Min(min_match_, alternative->min_match()); in RegExpDisjunction()986 int node_min_match = node->min_match(); in RegExpAlternative()
4937 bool body_can_be_empty = (body->min_match() == 0); in ToNode()4996 LoopChoiceNode* center = new(zone) LoopChoiceNode(body->min_match() == 0, in ToNode()6156 (data->tree->min_match() > 0) in Compile()
125 int min_match; member139 int min_match = result.tree->min_match(); in CheckMinMaxMatch() local141 MinMaxPair pair = { min_match, max_match }; in CheckMinMaxMatch()150 CHECK_EQ(min, min_max.min_match); \