Searched refs:lookahead (Results 1 - 25 of 94) sorted by relevance

1234

/external/bison/src/
H A Dielr.h43 symbol_number lookahead, state ***predecessors,
/external/apache-xml/src/main/java/org/apache/xalan/templates/
H A DAVT.java196 String lookahead = null; // next token
201 if (lookahead != null)
203 t = lookahead;
204 lookahead = null;
228 lookahead = tokenizer.nextToken();
230 if (lookahead.equals("{"))
234 buffer.append(lookahead);
236 lookahead = null;
242 else if(lookahead.equals("\"") || lookahead
[all...]
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/
H A DANTLRUnbufferedCommonTreeNodeStreamState.h39 NSMutableArray *lookahead; variable
60 - (NSMutableArray *) lookahead;
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/
H A DANTLRUnbufferedCommonTreeNodeStreamState.h39 NSMutableArray *lookahead; variable
60 - (NSMutableArray *) lookahead;
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/
H A DANTLRUnbufferedCommonTreeNodeStreamState.h39 NSMutableArray *lookahead; variable
60 - (NSMutableArray *) lookahead;
/external/antlr/antlr-3.4/runtime/ObjC/Framework/
H A DANTLRUnbufferedCommonTreeNodeStreamState.h39 NSMutableArray *lookahead; variable
60 - (NSMutableArray *) lookahead;
/external/ply/ply/ply/
H A Dyacc.py350 lookahead = None # Current lookahead symbol
351 lookaheadstack = [] # Stack of lookahead symbols
403 # Get the next symbol on the input. If a lookahead symbol
413 if not lookahead:
415 lookahead = get_token() # Get the next token
417 lookahead = lookaheadstack.pop()
418 if not lookahead:
419 lookahead = YaccSymbol()
420 lookahead
[all...]
/external/libmojo/third_party/ply/
H A Dyacc.py283 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
[all...]
/external/pdfium/third_party/zlib_v128/
H A Ddeflate.c337 if (wrap == 2 || (wrap == 1 && s->status != INIT_STATE) || s->lookahead)
363 while (s->lookahead >= MIN_MATCH) {
365 n = s->lookahead - (MIN_MATCH-1);
375 s->lookahead = MIN_MATCH-1;
378 s->strstart += s->lookahead;
380 s->insert = s->lookahead;
381 s->lookahead = 0;
898 if (strm->avail_in != 0 || s->lookahead != 0 ||
932 if (s->lookahead == 0) {
1121 s->lookahead
[all...]
/external/python/cpython2/Modules/zlib/
H A Ddeflate.c338 if (wrap == 2 || (wrap == 1 && s->status != INIT_STATE) || s->lookahead)
364 while (s->lookahead >= MIN_MATCH) {
366 n = s->lookahead - (MIN_MATCH-1);
376 s->lookahead = MIN_MATCH-1;
379 s->strstart += s->lookahead;
381 s->insert = s->lookahead;
382 s->lookahead = 0;
899 if (strm->avail_in != 0 || s->lookahead != 0 ||
933 if (s->lookahead == 0) {
1122 s->lookahead
[all...]
/external/zlib/src/
H A Ddeflate.c338 if (wrap == 2 || (wrap == 1 && s->status != INIT_STATE) || s->lookahead)
364 while (s->lookahead >= MIN_MATCH) {
366 n = s->lookahead - (MIN_MATCH-1);
376 s->lookahead = MIN_MATCH-1;
379 s->strstart += s->lookahead;
381 s->insert = s->lookahead;
382 s->lookahead = 0;
899 if (strm->avail_in != 0 || s->lookahead != 0 ||
933 if (s->lookahead == 0) {
1122 s->lookahead
[all...]
/external/owasp/sanitizer/src/main/org/owasp/html/
H A DHtmlLexer.java222 private final LinkedList<HtmlToken> lookahead = Lists.newLinkedList(); field in class:HtmlLexer
224 if (!lookahead.isEmpty()) {
225 return lookahead.remove();
234 while (lookahead.size() <= i && splitter.hasNext()) {
235 lookahead.add(splitter.next());
237 return lookahead.size() > i ? lookahead.get(i) : null;
241 lookahead.addFirst(token);
/external/python/cpython2/Tools/scripts/
H A Dfixdiv.py321 self.lookahead = []
324 while len(self.lookahead) < self.window and not self.eoflookahead:
329 self.lookahead.append(line)
332 if not self.lookahead:
334 line = self.lookahead.pop(0)
341 lookend = self.lineno + len(self.lookahead)
345 return self.lookahead[index - self.lineno]
/external/syslinux/com32/lib/zlib/
H A Ddeflate.c340 * s->lookahead stays null, so s->ins_h will be recomputed at the next
816 if (strm->avail_in != 0 || s->lookahead != 0 ||
850 if (s->lookahead == 0) {
1038 s->lookahead = 0;
1057 * OUT assertion: the match length is not greater than s->lookahead.
1106 if ((uInt)nice_match > s->lookahead) nice_match = s->lookahead;
1108 Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
1116 * for insufficient lookahead only occur occasionally for performance
1119 * However the length of the match is limited to the lookahead, s
[all...]
/external/webrtc/webrtc/modules/audio_processing/utility/
H A Ddelay_estimator_wrapper.h89 // - max_lookahead : Maximum amount of non-causal lookahead allowed. The
90 // actual amount of lookahead used can be controlled by
91 // WebRtc_set_lookahead(...). The default |lookahead| is
96 // Using lookahead can detect cases in which a near-end
102 // A value of zero is the typical no-lookahead case.
107 // [-|lookahead|,... ,|history_size|-|lookahead|)
149 // Sets the amount of |lookahead| to use. Valid values are [0, max_lookahead]
155 // - lookahead : The amount of lookahead t
[all...]
H A Ddelay_estimator_wrapper.c353 int WebRtc_set_lookahead(void* handle, int lookahead) { argument
357 if ((lookahead > self->binary_handle->near_history_size - 1) ||
358 (lookahead < 0)) {
361 self->binary_handle->lookahead = lookahead;
362 return self->binary_handle->lookahead;
369 return self->binary_handle->lookahead;
H A Ddelay_estimator.c419 self->lookahead = max_lookahead;
504 int lookahead = 0; local
506 lookahead = self->lookahead;
507 self->lookahead -= delay_shift;
508 if (self->lookahead < 0) {
509 self->lookahead = 0;
511 if (self->lookahead > self->near_history_size - 1) {
512 self->lookahead = self->near_history_size - 1;
514 return lookahead
[all...]
/external/apache-xml/src/main/java/org/apache/xml/utils/
H A DNamespaceSupport2.java392 private String lookahead=null; field in class:PrefixForUriEnumerator
406 if(lookahead!=null)
414 lookahead=prefix;
425 String tmp=lookahead;
426 lookahead=null;
/external/lzma/C/
H A D7zDec.c149 size_t lookahead = (1 << 18); local
150 if (lookahead > inSize)
151 lookahead = (size_t)inSize;
152 res = inStream->Look(inStream, &inBuf, &lookahead);
157 SizeT inProcessed = (SizeT)lookahead, dicPos = state.dicPos;
160 lookahead -= inProcessed;
211 size_t lookahead = (1 << 18); local
212 if (lookahead > inSize)
213 lookahead = (size_t)inSize;
214 res = inStream->Look(inStream, &inBuf, &lookahead);
[all...]
/external/harfbuzz_ng/src/
H A Dhb-ot-layout-gsubgpos-private.hh906 const USHORT lookahead[],
915 skippy_iter.set_match_func (match_func, match_data, lookahead);
1572 const USHORT lookahead[],
1584 lookaheadCount, lookahead,
1596 const USHORT lookahead[],
1608 lookaheadCount, lookahead,
1620 const USHORT lookahead[] HB_UNUSED,
1637 const USHORT lookahead[],
1652 lookaheadCount, lookahead,
1667 const ArrayOf<USHORT> &lookahead local
904 match_lookahead(hb_apply_context_t *c, unsigned int count, const USHORT lookahead[], match_func_t match_func, const void *match_data, unsigned int offset) argument
1566 chain_context_closure_lookup(hb_closure_context_t *c, unsigned int backtrackCount, const USHORT backtrack[], unsigned int inputCount, const USHORT input[], unsigned int lookaheadCount, const USHORT lookahead[], unsigned int lookupCount, const LookupRecord lookupRecord[], ChainContextClosureLookupContext &lookup_context) argument
1590 chain_context_collect_glyphs_lookup(hb_collect_glyphs_context_t *c, unsigned int backtrackCount, const USHORT backtrack[], unsigned int inputCount, const USHORT input[], unsigned int lookaheadCount, const USHORT lookahead[], unsigned int lookupCount, const LookupRecord lookupRecord[], ChainContextCollectGlyphsLookupContext &lookup_context) argument
1631 chain_context_apply_lookup(hb_apply_context_t *c, unsigned int backtrackCount, const USHORT backtrack[], unsigned int inputCount, const USHORT input[], unsigned int lookaheadCount, const USHORT lookahead[], unsigned int lookupCount, const LookupRecord lookupRecord[], ChainContextApplyLookupContext &lookup_context) argument
1681 const ArrayOf<USHORT> &lookahead = StructAfter<ArrayOf<USHORT> > (input); local
1695 const ArrayOf<USHORT> &lookahead = StructAfter<ArrayOf<USHORT> > (input); local
1708 const ArrayOf<USHORT> &lookahead = StructAfter<ArrayOf<USHORT> > (input); local
1723 const ArrayOf<USHORT> &lookahead = StructAfter<ArrayOf<USHORT> > (input); local
2022 const OffsetArrayOf<Coverage> &lookahead = StructAfter<OffsetArrayOf<Coverage> > (input); local
2043 const OffsetArrayOf<Coverage> &lookahead = StructAfter<OffsetArrayOf<Coverage> > (input); local
2062 const OffsetArrayOf<Coverage> &lookahead = StructAfter<OffsetArrayOf<Coverage> > (input); local
2089 const OffsetArrayOf<Coverage> &lookahead = StructAfter<OffsetArrayOf<Coverage> > (input); local
2109 const OffsetArrayOf<Coverage> &lookahead = StructAfter<OffsetArrayOf<Coverage> > (input); local
[all...]
/external/icu/icu4c/source/common/
H A Druleiter.cpp76 c = lookahead(tempEscape, MAX_U_NOTATION_LEN).unescapeAt(offset);
113 UnicodeString& RuleCharacterIterator::lookahead(UnicodeString& result, int32_t maxLookAhead) const { function in class:RuleCharacterIterator
H A Druleiter.h171 * options. This is useful in conjunction with the lookahead() method.
185 * sequence of calls is to call skipIgnored(), then call lookahead(), then
186 * parse the string returned by lookahead(), then call jumpahead() to
193 UnicodeString& lookahead(UnicodeString& result, int32_t maxLookAhead = -1) const;
197 * This is useful in conjunction with the lookahead() method.
/external/mesa3d/bin/
H A Dperf-annotate-jit73 def lookahead(self): member in class:LineParser
142 if self.eof() or not self.lookahead().startswith('#'):
146 # read lookahead
186 while self.lookahead():
191 if self.lookahead() == '':
/external/skia/third_party/lua/src/
H A Dllex.h56 Token lookahead; /* look ahead token */ member in struct:LexState
/external/syslinux/com32/lua/src/
H A Dllex.h56 Token lookahead; /* look ahead token */ member in struct:LexState

Completed in 3840 milliseconds

1234