Searched refs:still_to_find (Results 1 - 2 of 2) sorted by relevance
/external/v8/src/regexp/ |
H A D | jsregexp.h | 444 // succeed. If we have found at least 'still_to_find' characters that 450 virtual int EatsAtLeast(int still_to_find, int budget, bool not_at_start) = 0; 613 virtual int EatsAtLeast(int still_to_find, int budget, bool not_at_start); 689 virtual int EatsAtLeast(int still_to_find, int budget, bool not_at_start); 754 virtual int EatsAtLeast(int still_to_find, int budget, bool not_at_start); 788 virtual int EatsAtLeast(int still_to_find, 813 virtual int EatsAtLeast(int still_to_find, argument 907 virtual int EatsAtLeast(int still_to_find, int budget, bool not_at_start); 908 int EatsAtLeastHelper(int still_to_find, 979 virtual int EatsAtLeast(int still_to_find, in [all...] |
H A D | jsregexp.cc | 2284 int ActionNode::EatsAtLeast(int still_to_find, argument 2289 return on_success()->EatsAtLeast(still_to_find, 2306 int AssertionNode::EatsAtLeast(int still_to_find, argument 2312 // implies false. So lets just return the max answer (still_to_find) since 2315 if (assertion_type() == AT_START && not_at_start) return still_to_find; 2316 return on_success()->EatsAtLeast(still_to_find, 2331 int BackReferenceNode::EatsAtLeast(int still_to_find, argument 2336 return on_success()->EatsAtLeast(still_to_find, 2342 int TextNode::EatsAtLeast(int still_to_find, argument 2347 if (answer >= still_to_find) retur 2356 EatsAtLeast(int still_to_find, int budget, bool not_at_start) argument 2376 EatsAtLeastHelper(int still_to_find, int budget, RegExpNode* ignore_this_node, bool not_at_start) argument 2396 EatsAtLeast(int still_to_find, int budget, bool not_at_start) argument 2406 EatsAtLeast(int still_to_find, int budget, bool not_at_start) argument [all...] |
Completed in 175 milliseconds