| /external/chromium_org/third_party/icu/source/common/ |
| ruleiter.h | 170 * options. This is useful in conjunction with the lookahead() method.
184 * sequence of calls is to call skipIgnored(), then call lookahead(), then
185 * parse the string returned by lookahead(), then call jumpahead() to
192 UnicodeString& lookahead(UnicodeString& result, int32_t maxLookAhead = -1) const;
196 * This is useful in conjunction with the lookahead() method.
|
| ruleiter.cpp | 74 c = lookahead(tempEscape, MAX_U_NOTATION_LEN).unescapeAt(offset);
111 UnicodeString& RuleCharacterIterator::lookahead(UnicodeString& result, int32_t maxLookAhead) const { function in class:RuleCharacterIterator
|
| /external/chromium_org/v8/test/mjsunit/ |
| regexp-capture-3.js | 176 NoHang(/(?!(((.*)*)*x)?)foo/); // Negative lookahead is filtered.
177 NoHang(/(?!(((.*)*)*x))?/); // Continuation branch of negative lookahead.
178 NoHang(/(?=(((.*)*)*x)?)foo/); // Positive lookahead is filtered.
179 NoHang(/(?=(((.*)*)*x))?/); // Continuation branch of positive lookahead.
180 NoHang(/(?=?)(((.*)*)*x)/); // Positive lookahead also prunes continuation.
|
| /external/icu4c/common/ |
| ruleiter.h | 169 * options. This is useful in conjunction with the lookahead() method.
183 * sequence of calls is to call skipIgnored(), then call lookahead(), then
184 * parse the string returned by lookahead(), then call jumpahead() to
191 UnicodeString& lookahead(UnicodeString& result, int32_t maxLookAhead = -1) const;
195 * This is useful in conjunction with the lookahead() method.
|
| ruleiter.cpp | 74 c = lookahead(tempEscape, MAX_U_NOTATION_LEN).unescapeAt(offset);
111 UnicodeString& RuleCharacterIterator::lookahead(UnicodeString& result, int32_t maxLookAhead) const { function in class:RuleCharacterIterator
|
| /external/jpeg/ |
| jdhuff.h | 24 #define HUFF_LOOKAHEAD 8 /* # of bits of lookahead */
39 /* Lookahead tables: indexed by the next HUFF_LOOKAHEAD bits of
164 * We use a lookahead table to process codes of up to HUFF_LOOKAHEAD bits
171 * for a lookahead. In that case, we do it the hard way.
172 * 2. If the lookahead table contains no entry, the next code must be
|
| /external/nist-sip/java/gov/nist/javax/sip/parser/ |
| AcceptEncodingParser.java | 94 if (lexer.lookAhead(0) == '\n') {
98 while (lexer.lookAhead(0) != '\n') {
100 if (lexer.lookAhead(0) != ';') {
107 while (lexer.lookAhead(0) == ';') {
128 if (lexer.lookAhead(0) == ',') {
|
| RetryAfterParser.java | 88 if (lexer.lookAhead(0) == '(') {
94 while (lexer.lookAhead(0) == ';') {
|
| /external/qemu/distrib/jpeg-6b/ |
| jdhuff.h | 24 #define HUFF_LOOKAHEAD 8 /* # of bits of lookahead */
39 /* Lookahead tables: indexed by the next HUFF_LOOKAHEAD bits of
164 * We use a lookahead table to process codes of up to HUFF_LOOKAHEAD bits
171 * for a lookahead. In that case, we do it the hard way.
172 * 2. If the lookahead table contains no entry, the next code must be
|
| /external/chromium_org/third_party/ply/ |
| yacc.py | 283 lookahead = None # Current lookahead symbol
284 lookaheadstack = [ ] # Stack of lookahead symbols
332 # Get the next symbol on the input. If a lookahead symbol
341 if not lookahead:
343 lookahead = get_token() # Get the next token
345 lookahead = lookaheadstack.pop()
346 if not lookahead:
347 lookahead = YaccSymbol()
348 lookahead.type = "$end
[all...] |
| /cts/tools/dasm/src/java_cup/ |
| lalr_state.java | 196 /** Propagate lookahead sets through the constructed viable prefix
198 in the creation of another such that its lookahead is included in the
200 to the lookahead of one item to be included in other items that it
236 * the beginning and EOF as expected lookahead). Then for each state
291 /* build item with dot at front of start production and EOF lookahead */
294 itm.lookahead().add(terminal.EOF);
407 /* propagate complete lookahead sets throughout the states */
415 /** Propagate lookahead sets out of this state. This recursively
470 /* if its completed (dot at end) then reduce under the lookahead */
475 /* consider each lookahead symbol *
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Debug/ |
| Tracer.cs | 64 Console.Out.WriteLine("> " + grammarFileName + " " + ruleName + " lookahead(1)=" + GetInputSymbol(1));
75 Console.Out.WriteLine("< " + grammarFileName + " " + ruleName + " lookahead(1)=" + GetInputSymbol(1));
|
| /external/chromium_org/net/websockets/ |
| websocket_extension_parser.cc | 65 if (Lookahead('\"')) {
123 bool WebSocketExtensionParser::Lookahead(char c) {
|
| /external/chromium_org/third_party/lzma_sdk/ |
| 7zStream.c | 134 void LookToRead_CreateVTable(CLookToRead *p, int lookahead)
136 p->s.Look = lookahead ?
|
| /external/chromium_org/third_party/yasm/source/patched-yasm/libyasm/tests/ |
| opt-gvmat64.asm | 112 ; Lookahead : ignore
148 %define Lookahead [ rcx + dsLookahead] ; 0ffffffffh on infozip
218 ;;; if ((uInt)nice_match > s->lookahead) nice_match = s->lookahead;
226 mov r10d, Lookahead
475 ;;; if ((uInt)best_len <= s->lookahead) return (uInt)best_len;
476 ;;; return s->lookahead;
482 mov eax, Lookahead
|
| /external/clang/include/clang/AST/ |
| CommentParser.h | 54 /// Current lookahead token. We can safely assume that all tokens are from
58 /// A stack of additional lookahead tokens.
|
| /external/lzma/C/ |
| 7zStream.c | 134 void LookToRead_CreateVTable(CLookToRead *p, int lookahead)
136 p->s.Look = lookahead ?
|
| /external/nist-sip/java/gov/nist/core/ |
| ParserCore.java | 61 char la = lexer.lookAhead(0);
68 if (lexer.lookAhead(0) == '\"') {
|
| /external/nist-sip/java/gov/nist/javax/sip/parser/ims/ |
| PMediaAuthorizationParser.java | 88 while (lexer.lookAhead(0) != '\n')
100 if (lexer.lookAhead(0) == ',')
|
| PrivacyParser.java | 86 while (lexer.lookAhead(0) != '\n') {
99 while (lexer.lookAhead(0) == ';')
|
| /external/webrtc/src/modules/audio_coding/codecs/isac/main/source/ |
| filterbanks.c | 50 the input signal, and part of the signal in the input 'lookahead buffer'.
55 and lookahead samples from the previous encoding
80 lookahead sample buffers are updated for the next
147 /* now backwards filter the samples in the lookahead buffer. The samples were
155 /* write the lookahead samples for the next encoding iteration. Every other
157 lookahead length. Exported in the prefiltdata structure. */
228 /* Lookahead LP and HP signals */
231 Also, the input contains some samples that are lookahead samples. The high pass
|
| /external/zlib/src/contrib/gcc_gvmat64/ |
| gvmat64.S | 134 printf("#define dsLookahead %u\n",(int)(((char*)&(s->lookahead))-((char*)s)));
162 #define Lookahead [ rcx + dsLookahead] //; 0ffffffffh on infozip
238 //;;; if ((uInt)nice_match > s->lookahead) nice_match = s->lookahead;
244 mov r10d, Lookahead
541 //;;; if ((uInt)best_len <= s->lookahead) return (uInt)best_len;
542 //;;; return s->lookahead;
545 mov eax, Lookahead
|
| /external/zlib/src/contrib/masmx64/ |
| gvmat64.asm | 150 ; Lookahead : ignore
186 Lookahead equ [ rcx + dsLookahead] ; 0ffffffffh on infozip
256 ;;; if ((uInt)nice_match > s->lookahead) nice_match = s->lookahead;
264 mov r10d, Lookahead
516 ;;; if ((uInt)best_len <= s->lookahead) return (uInt)best_len;
517 ;;; return s->lookahead;
523 mov eax, Lookahead
|
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/ |
| CharStreamState.java | 37 /** Index into the char stream of next lookahead char */
|
| /external/antlr/antlr-3.4/runtime/JavaScript/tests/functional/ |
| t018llstar.g | 24 * Use ANTLRWorks to see the lookahead use (step by Location)
|
