Lines Matching refs:EatsAtLeast
2301 int ActionNode::EatsAtLeast(int still_to_find,
2306 return on_success()->EatsAtLeast(still_to_find,
2325 int AssertionNode::EatsAtLeast(int still_to_find,
2335 return on_success()->EatsAtLeast(still_to_find,
2345 // Match the behaviour of EatsAtLeast on this node.
2352 int BackReferenceNode::EatsAtLeast(int still_to_find,
2356 return on_success()->EatsAtLeast(still_to_find,
2362 int TextNode::EatsAtLeast(int still_to_find,
2369 return answer + on_success()->EatsAtLeast(still_to_find - answer,
2375 int NegativeLookaheadChoiceNode::EatsAtLeast(int still_to_find,
2382 return node->EatsAtLeast(still_to_find, budget - 1, not_at_start);
2410 node->EatsAtLeast(still_to_find, budget, not_at_start);
2418 int LoopChoiceNode::EatsAtLeast(int still_to_find,
2428 int ChoiceNode::EatsAtLeast(int still_to_find,
3074 Min(kMaxLookaheadForBoyerMoore, EatsAtLeast(kMaxLookaheadForBoyerMoore,
4008 EatsAtLeast(kMaxLookaheadForBoyerMoore,
4030 EatsAtLeast(compiler->ascii() ? 4 : 2, kRecursionBudget, not_at_start);