| /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/vogar/src/vogar/monitor/ |
| InterleavedReader.java | 71 // Double the lookahead size. This is a safety measure in the presence of
72 // new lines, where the line feed character is being skipped. The lookahead
|
| /external/webrtc/webrtc/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)
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/LL-star/ |
| simplec.g | 17 * Use ANTLRWorks to see the lookahead use (step by Location)
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/fuzzy/ |
| Fuzzy.g | 63 * ever match since k=1 lookahead in the QID loop of '.' will make it loop.
|
| /external/antlr/antlr-3.4/runtime/Python/tests/ |
| t018llstar.g | 25 * Use ANTLRWorks to see the lookahead use (step by Location)
|
| /external/bison/ |
| AUTHORS | 16 IELR and LAC (Lookahead Correction) support (Bison 2.5, 2011).
|
| /external/bison/src/ |
| conflicts.h | 1 /* Find and resolve or report lookahead conflicts for bison,
|
| ielr.h | 43 symbol_number lookahead, state ***predecessors,
|
| AnnotationList.c | 263 lookahead set. Thus, it can't contribute to inadequacies,
266 successor of the start state's kernel item, the lookahead
304 predecessor item's lookahead set. */
460 lookahead. */
491 /* Otherwise, add the kernel items whose lookahead sets
493 lookahead set. */
503 /* The lookahead token has to come from somewhere. */
611 fprintf (stderr, " as lookahead, rule number %d",
659 * - \c lookaheads describes the lookahead sets on the kernel items of some
661 * - <tt>lookaheads = NULL</tt> only if the lookahead set on every kerne
[all...] |
| graphviz.c | 103 /* If no lookahead tokens were valid transitions, this reduction is
119 /* (The lookahead tokens have been added to the beginning of the
184 /* Build the lookahead tokens lists, one for enabled transitions and one
|
| main.c | 117 /* Add lookahead sets to parser states. Except when LALR(1) is
123 lookahead is not enough to disambiguate the parsing. In file
180 /* Lookahead tokens are no longer needed. */
|
| /external/harfbuzz_ng/src/ |
| hb-ot-layout-gsub-table.hh | 913 const OffsetArrayOf<Coverage> &lookahead = StructAfter<OffsetArrayOf<Coverage> > (backtrack); local
922 count = lookahead.len;
924 if (!(this+lookahead[i]).intersects (c->glyphs))
927 const ArrayOf<GlyphID> &substitute = StructAfter<ArrayOf<GlyphID> > (lookahead);
939 const OffsetArrayOf<Coverage> &lookahead = StructAfter<OffsetArrayOf<Coverage> > (backtrack); local
949 count = lookahead.len;
951 (this+lookahead[i]).add_coverage (c->after);
953 const ArrayOf<GlyphID> &substitute = StructAfter<ArrayOf<GlyphID> > (lookahead);
979 const OffsetArrayOf<Coverage> &lookahead = StructAfter<OffsetArrayOf<Coverage> > (backtrack); local
980 const ArrayOf<GlyphID> &substitute = StructAfter<ArrayOf<GlyphID> > (lookahead);
1005 const OffsetArrayOf<Coverage> &lookahead = StructAfter<OffsetArrayOf<Coverage> > (backtrack); local
[all...] |
| /external/libvpx/libvpx/test/ |
| altref_test.cc | 17 // lookahead range: [kLookAheadMin, kLookAheadMax).
|
| /external/nist-sip/java/gov/nist/javax/sip/parser/ |
| 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/webrtc/webrtc/modules/audio_processing/utility/ |
| delay_estimator.h | 57 // For dynamically changing the lookahead when using SoftReset...().
58 int lookahead; member in struct:__anon26591
198 // the lookahead (i.e. the lookahead should be subtracted from the returned
|
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/test/ |
| altref_test.cc | 17 // lookahead range: [kLookAheadMin, kLookAheadMax).
|
