| /external/chromium/testing/gtest/xcode/Scripts/ |
| versiongenerate.py | 72 # brackets(e.g. "[1.0.1]") between "AC_INIT(" and ")". Do not be greedy
73 # (*? is the non-greedy flag) since that would pull in everything between
|
| /external/libvpx/libvpx/third_party/googletest/src/xcode/Scripts/ |
| versiongenerate.py | 72 # brackets(e.g. "[1.0.1]") between "AC_INIT(" and ")". Do not be greedy
73 # (*? is the non-greedy flag) since that would pull in everything between
|
| /external/llvm/test/CodeGen/X86/ |
| 2008-09-18-inline-asm-2.ll | 3 ; RUN: llc < %s -march=x86 -regalloc=greedy | FileCheck %s
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/ |
| AccordionControl.java | 193 * @param greedy if true, grow vertically as much as possible
199 boolean greedy, boolean wrapChildren, Set<String> expand) {
263 greedy ? SWT.FILL : SWT.TOP, false, greedy, 1, 1);
|
| /external/llvm/test/CodeGen/ARM/ |
| crash-greedy.ll | 1 ; RUN: llc < %s -regalloc=greedy -mcpu=cortex-a8 -relocation-model=pic -disable-fp-elim -verify-machineinstrs | FileCheck %s
3 ; ARM tests that crash or fail with the greedy register allocator.
|
| lsr-unfolded-offset.ll | 1 ; RUN: llc -regalloc=greedy < %s | FileCheck %s
|
| /external/v8/src/ia32/ |
| regexp-macro-assembler-ia32.h | 65 // A "greedy loop" is a loop that is both greedy and with a simple
|
| /external/webkit/Source/JavaScriptCore/tests/mozilla/ecma_3/RegExp/ |
| 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/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
| TestCharDFAConversion.java | 234 "CMT : '/*' ( options {greedy=false;} : . )* '*/' ;");
246 "SLCMT : '//' ( options {greedy=false;} : . )* '\n' ;");
268 "SLCMT : '//' ( options {greedy=false;} : . )+ '\n' ;");
298 "DUH : (options {greedy=false;}:'x'|'y')* 'xy' ;");
325 "STRING : '\"' (options {greedy=false;}: '\\\\\"' | .)* '\"' ;\n"
339 "DUH : (options {greedy=false;}:'x')+ ;"); // loop never matched
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/fuzzy/ |
| Fuzzy.m | 213 // Fuzzy.g:10:2: ( 'return' ( options {greedy=false; } : . )* ';' ) // ruleBlockSingleAlt
214 // Fuzzy.g:10:4: 'return' ( options {greedy=false; } : . )* ';' // alt
1166 // Fuzzy.g:38:5: ( '/*' ( options {greedy=false; } : . )* '*/' ) // ruleBlockSingleAlt
1167 // Fuzzy.g:38:9: '/*' ( options {greedy=false; } : . )* '*/' // alt
1245 // Fuzzy.g:43:5: ( '//' ( options {greedy=false; } : . )* '\\n' ) // ruleBlockSingleAlt
1246 // Fuzzy.g:43:9: '//' ( options {greedy=false; } : . )* '\\n' // alt
[all...] |
| /external/antlr/antlr-3.4/gunit/src/main/antlr3/org/antlr/gunit/ |
| gUnit.g | 276 ( options {greedy=false;}
305 ( options {greedy=false; k=3;}
|
| /external/antlr/antlr-3.4/runtime/Python/tests/ |
| t055templates.py | 353 COMMENT: '/*' (options {greedy=false;} : .)* '*/' {$channel = HIDDEN;} ;
430 COMMENT: '/*' (options {greedy=false;} : .)* '*/' {$channel = HIDDEN;} ;
|
| /external/antlr/antlr-3.4/runtime/Ruby/test/functional/template-output/ |
| template-output.rb | 300 COMMENT: '/*' (options {greedy=false;} : .)* '*/' {$channel = HIDDEN;} ;
361 COMMENT: '/*' (options {greedy=false;} : .)* '*/' {$channel = HIDDEN;} ;
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
| DFAOptimizer.java | 80 * NOTE 1. Greedy loops cannot be optimized in this way. For example,
81 * "(greedy=false:'x'|.)* '\n'". You specifically need the exit branch
|
| /external/ceres-solver/internal/ceres/ |
| graph_algorithms.h | 72 // Given a undirected graph G(V,E), the algorithm is a greedy BFS
171 // We get around both of these problems by using a greedy, degree
|
| /external/regex-re2/re2/ |
| bitstate.cc | 202 if (ip->greedy(prog_)) {
209 // out is the match - non-greedy
|
| /external/v8/src/arm/ |
| regexp-macro-assembler-arm.h | 66 // A "greedy loop" is a loop that is both greedy and with a simple
|
| /external/v8/src/mips/ |
| regexp-macro-assembler-mips.h | 68 // A "greedy loop" is a loop that is both greedy and with a simple
|
| /external/v8/src/x64/ |
| regexp-macro-assembler-x64.h | 62 // A "greedy loop" is a loop that is both greedy and with a simple
|
| /external/antlr/antlr-3.4/runtime/Ruby/test/functional/parser/ |
| backtracking.rb | 226 : '/*' ( options {greedy=false;} : . )* '*/' {$channel=HIDDEN;}
|
| /external/webkit/Source/WebKit/qt/Api/ |
| DerivedSources.pro | 88 # Qt's QRegExp does not support inline non-greedy matching,
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/fuzzy/output1/ |
| Fuzzy.m | 471 // /usr/local/ANTLR3-ObjC2.0-Runtime/Framework/examples/fuzzy/Fuzzy.g:10:2: ( 'return' ( options {greedy=false; } : . )* ';' ) // ruleBlockSingleAlt
472 // /usr/local/ANTLR3-ObjC2.0-Runtime/Framework/examples/fuzzy/Fuzzy.g:10:4: 'return' ( options {greedy=false; } : . )* ';' // alt
[all...] |
| /external/webkit/Source/JavaScriptCore/yarr/ |
| YarrInterpreter.cpp | 52 uintptr_t begin; // Not really needed for greedy quantifiers.
717 // the same anyway! (We don't pre-check for greedy or non-greedy matches.)
767 // Since this is greedy / zero minimum a failed is also accepted as a match!
907 // Rules for backtracking differ depending on whether this is greedy or non-greedy.
909 // Greedy matches never should try just adding more - you should already have done
[all...] |
| YarrPattern.cpp | 254 // In case of greedy matching the next character checking is unnecessary therefore we just store
606 void quantifyAtom(unsigned min, unsigned max, bool greedy)
632 term.quantify(max, greedy ? QuantifierGreedy : QuantifierNonGreedy);
639 m_alternative->lastTerm().quantify((max == quantifyInfinite) ? max : max - min, greedy ? QuantifierGreedy : QuantifierNonGreedy);
767 // * where the parens are non-capturing, and quantified unbounded greedy (*).
[all...] |
