| /external/v8/test/mjsunit/regress/ |
| regress-176.js | 41 "non-zero length match with greedy ? in (?:)");
44 "non-zero length match with non-greedy ? in (?:), o forces backtrack");
47 "non-zero length match with non-greedy ? in (?:), zero length match causes backtrack");
|
| /external/webkit/JavaScriptCore/tests/mozilla/ecma_3/RegExp/ |
| regress-105972.js | 48 * The * operator is greedy, but *? is non-greedy: it will stop
64 * the string, so the non-greedy operator *? doesn't try to...
79 * the match will stop because the operator *? is non-greedy.
96 * the match will not stop since * is greedy. The match will
|
| regress-191479.js | 113 * Let's take all 7 sections above and make each quantifer non-greedy.
116 * the quantifier, but makes it non-greedy, which affects the results -
|
| regress-87231.js | 35 * greedy matching: it should match 0 times instead of 1. This allows
|
| /external/protobuf/gtest/xcode/Scripts/ |
| versiongenerate.py | 43 # brackets(e.g. "[1.0.1]") between "AC_INIT(" and ")". Do not be greedy
44 # (*? is the non-greedy flag) since that would pull in everything between
|
| /external/webkit/JavaScriptCore/wrec/ |
| WRECParser.cpp | 87 case Quantifier::Greedy: {
114 return Quantifier(Quantifier::Greedy, 0, 1);
118 return Quantifier(Quantifier::Greedy, 0);
122 return Quantifier(Quantifier::Greedy, 1);
156 return Quantifier(Quantifier::Greedy, min, max);
168 if ((q.type == Quantifier::Greedy) && (peek() == '?')) {
186 case Quantifier::Greedy: {
215 case Quantifier::Greedy:
|
| Quantifier.h | 41 Greedy,
|
| WRECGenerator.cpp | 138 ASSERT(quantifierType == Quantifier::Greedy || quantifierType == Quantifier::NonGreedy);
139 if (quantifierType == Quantifier::Greedy)
|
| /libcore/luni/src/main/java/java/util/regex/ |
| Pattern.java | 117 * <p>Quantifiers are "greedy" by default, meaning that they will match the longest possible input
118 * sequence. There are also non-greedy quantifiers that match the shortest possible input sequence.
119 * They're same as the greedy ones but with a trailing {@code ?}:
121 * <tr> <td> *? </td> <td>Zero or more (non-greedy).</td> </tr>
122 * <tr> <td> ?? </td> <td>Zero or one (non-greedy).</td> </tr>
123 * <tr> <td> +? </td> <td>One or more (non-greedy).</td> </tr>
124 * <tr> <td> {<i>n</i>}? </td> <td>Exactly <i>n</i> (non-greedy).</td> </tr>
125 * <tr> <td> {<i>n,</i>}? </td> <td>At least <i>n</i> (non-greedy).</td> </tr>
126 * <tr> <td> {<i>n</i>,<i>m</i>}? </td> <td>At least <i>n</i> but not more than <i>m</i> (non-greedy).</td> </tr>
129 * backtracking. They're same as the greedy ones but with a trailing {@code +}
[all...] |
| /external/v8/test/mjsunit/ |
| greedy.js | 28 // Flags: --gc-greedy
|
| /external/v8/src/ia32/ |
| regexp-macro-assembler-ia32.h | 62 // A "greedy loop" is a loop that is both greedy and with a simple
|
| /external/v8/src/arm/ |
| regexp-macro-assembler-arm.h | 63 // A "greedy loop" is a loop that is both greedy and with a simple
|
| /external/v8/src/x64/ |
| regexp-macro-assembler-x64.h | 56 // A "greedy loop" is a loop that is both greedy and with a simple
|
| /external/webkit/WebKit/qt/Api/ |
| DerivedSources.pro | 77 # Qt's QRegExp does not support inline non-greedy matching,
|
| /external/webkit/JavaScriptCore/yarr/ |
| RegexParser.h | 506 * Helper for parseTokens(); checks for parse errors and non-greedy quantifiers.
803 * void quantifyAtom(unsigned min, unsigned max, bool greedy);
|
| RegexCompiler.cpp | 522 void quantifyAtom(unsigned min, unsigned max, bool greedy)
548 term.quantify(max, greedy ? QuantifierGreedy : QuantifierNonGreedy);
555 m_alternative->lastTerm().quantify((max == UINT_MAX) ? max : max - min, greedy ? QuantifierGreedy : QuantifierNonGreedy);
|
| RegexInterpreter.cpp | 53 uintptr_t begin; // Not really needed for greedy quantifiers.
841 // Rules for backtracking differ depending on whether this is greedy or non-greedy.
843 // Greedy matches never should try just adding more - you should already have done
848 // Non-greedy, we've already done the one less case, so don't match on popping.
[all...] |
| /external/qemu/slirp/ |
| if.c | 158 * but gets too greedy... hence it'll be downgraded from fastq to batchq.
|
| /external/qemu/slirp-android/ |
| if.c | 158 * but gets too greedy... hence it'll be downgraded from fastq to batchq.
|
| /external/chromium/base/third_party/symbolize/ |
| demangle.cc | 407 // We'll mark "Less greedy than" for these cases in the code
476 // Less greedy than <unscoped-template-name> <template-args>.
908 // Less greedy than <template-template-param> <template-args>.
[all...] |
| /external/libvpx/examples/includes/ASCIIMathPHP-2.0/ |
| ASCIIMathPHP-2.0.class.php | 41 * -- Changed the algorithm for parsing expressions so that it matches the longest string possible (greedy)
1057 * Gets the largest symbol in the expression (greedy). Changed from non-greedy 26-Apr-2006
[all...] |
| /external/chromium/third_party/icu/source/i18n/ |
| regeximp.h | 91 URX_CTR_INIT_NG = 26, // 2 kinds, normal and non-greedy.
|
| /external/icu4c/i18n/ |
| regeximp.h | 91 URX_CTR_INIT_NG = 26, // 2 kinds, normal and non-greedy.
|
| /frameworks/base/media/libstagefright/codecs/aacenc/src/ |
| dyn_bits.c | 208 sectioning Stage 2:greedy merge algorithm, merge connected sections with
|
| /external/bluetooth/glib/docs/reference/glib/tmpl/ |
| gregex.sgml | 172 quantifiers so that they are not greedy by default, but become greedy
|
