| /external/nist-sip/java/gov/nist/javax/sip/parser/ |
| WarningParser.java | 82 while (lexer.lookAhead(0) != '\n') {
103 if (lexer.lookAhead(0) == ':') {
122 while (lexer.lookAhead(0) == ',') {
147 if (lexer.lookAhead(0) == ':') {
|
| 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) == ';') {
|
| AcceptLanguageParser.java | 91 while (lexer.lookAhead(0) != '\n') {
94 if (lexer.lookAhead(0) != ';') {
101 while (lexer.lookAhead(0) == ';') {
122 if (lexer.lookAhead(0) == ',') {
|
| AddressParser.java | 53 if (this.lexer.lookAhead(0) == '<') {
69 if (this.lexer.lookAhead(0) == '\"') {
99 char la = lexer.lookAhead(k);
110 char la = lexer.lookAhead(k);
|
| InReplyToParser.java | 74 while (lexer.lookAhead(0) != '\n') {
80 if (lexer.lookAhead(0) == '@') {
94 while (lexer.lookAhead(0) == ',') {
102 if (lexer.lookAhead(0) == '@') {
|
| ServerParser.java | 71 if (this.lexer.lookAhead(0) == '\n')
75 while (this.lexer.lookAhead(0) != '\n'
76 && this.lexer.lookAhead(0) != '\0') {
77 if (this.lexer.lookAhead(0) == '(') {
|
| /external/stlport/stlport/stl/config/ |
| _prolog.h | 40 # pragma warning 604 10 /* must lookahead to determine... */
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/config/ |
| _prolog.h | 40 # pragma warning 604 10 /* must lookahead to determine... */
|
| /prebuilt/ndk/android-ndk-r5/sources/cxx-stl/stlport/stlport/stl/config/ |
| _prolog.h | 40 # pragma warning 604 10 /* must lookahead to determine... */
|
| /prebuilt/ndk/android-ndk-r6/sources/cxx-stl/stlport/stlport/stl/config/ |
| _prolog.h | 40 # pragma warning 604 10 /* must lookahead to determine... */
|
| /external/icu4c/tools/genrb/ |
| parse.c | 56 struct Lookahead
81 struct Lookahead lookahead[MAX_LOOKAHEAD + 1]; member in struct:__anon6257
99 /* The nature of the lookahead buffer:
101 MAX_LOOKAHEAD lookahead tokens and a slot for the current token and value.
130 state->lookahead[i].type = getNextToken(state->buffer, &state->lookahead[i].value, &state->lookahead[i].line, &state->lookahead[i].comment, status);
146 ustr_deinit(&state->lookahead[i].value)
[all...] |
| /external/icu4c/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/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
|
| /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/nist-sip/java/gov/nist/core/ |
| ParserCore.java | 61 char la = lexer.lookAhead(0);
68 if (lexer.lookAhead(0) == '\"') {
|
| HostNameParser.java | 105 char la = lexer.lookAhead(0);
148 char la = lexer.lookAhead(0);
178 if (lexer.lookAhead(0) == '[') {
271 char la = lexer.lookAhead(0);
307 " Illegal character in hostname:" + 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/zlib/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/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/src/org/antlr/runtime/ |
| CharStreamState.java | 37 /** Index into the char stream of next lookahead char */
|
| /external/guava/src/com/google/common/collect/ |
| PeekingIterator.java | 25 * An iterator that supports a one-element lookahead while iterating.
|
| /cts/tools/dasm/src/java_cup/runtime/ |
| lr_parser.java | 20 * (using the current state and the current lookahead token as indexes) to
26 * table is consulted (using the new state and current lookahead token as
236 /** The current lookahead token. */
355 * @param cur_token the current lookahead token.
367 * @param cur_token the current lookahead token.
745 * found, then we fail. Next a small number of "lookahead" or "parse
751 * to "parse ahead" though the buffered lookahead tokens. The "parse ahead"
775 /* read ahead to create lookahead we can parse multiple times */
789 if (lookahead[0].sym == EOF_sym())
804 /* do the real parse (including actions) across the lookahead */
877 protected token lookahead[]; field in class:lr_parser
[all...] |
