Lines Matching refs:EatsAtLeast
2289 int ActionNode::EatsAtLeast(int still_to_find,
2294 return on_success()->EatsAtLeast(still_to_find,
2311 int AssertionNode::EatsAtLeast(int still_to_find,
2321 return on_success()->EatsAtLeast(still_to_find,
2329 // Match the behaviour of EatsAtLeast on this node.
2336 int BackReferenceNode::EatsAtLeast(int still_to_find,
2341 return on_success()->EatsAtLeast(still_to_find,
2347 int TextNode::EatsAtLeast(int still_to_find,
2355 return answer + on_success()->EatsAtLeast(still_to_find - answer,
2361 int NegativeLookaroundChoiceNode::EatsAtLeast(int still_to_find, int budget,
2367 return node->EatsAtLeast(still_to_find, budget - 1, not_at_start);
2393 node->EatsAtLeast(still_to_find, budget, not_at_start);
2401 int LoopChoiceNode::EatsAtLeast(int still_to_find,
2411 int ChoiceNode::EatsAtLeast(int still_to_find,
3069 Min(kMaxLookaheadForBoyerMoore, EatsAtLeast(kMaxLookaheadForBoyerMoore,
3962 EatsAtLeast(compiler->one_byte() ? 4 : 2, kRecursionBudget,
4132 EatsAtLeast(kMaxLookaheadForBoyerMoore,
