/external/apache-xml/src/main/java/org/apache/xalan/templates/ |
H A D | AVT.java | 196 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/webrtc/src/modules/audio_processing/utility/ |
H A D | delay_estimator_wrapper.h | 35 // - lookahead : Amount of non-causal lookahead to use. This can 41 // A value of zero is the typical no-lookahead case. 51 int lookahead); 64 // value will be offset by the lookahead (i.e. the lookahead should be
|
H A D | delay_estimator.h | 55 int lookahead); 68 // end spectra. The value will be offset by the lookahead (i.e. the lookahead
|
H A D | delay_estimator.c | 93 int lookahead) { 95 int history_size = max_delay + lookahead; 103 if (lookahead < 0) { 123 self->near_history_size = lookahead + 1; 206 // If we apply lookahead, shift near-end binary spectrum history. Insert 91 WebRtc_CreateBinaryDelayEstimator(BinaryDelayEstimator** handle, int max_delay, int lookahead) argument
|
H A D | delay_estimator_wrapper.c | 169 int lookahead) { 195 lookahead) != 0) { 166 WebRtc_CreateDelayEstimator(void** handle, int spectrum_size, int max_delay, int lookahead) argument
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/ |
H A D | ANTLRUnbufferedCommonTreeNodeStreamState.h | 39 NSMutableArray *lookahead; variable 60 - (NSMutableArray *) lookahead;
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/ |
H A D | ANTLRUnbufferedCommonTreeNodeStreamState.h | 39 NSMutableArray *lookahead; variable 60 - (NSMutableArray *) lookahead;
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/ |
H A D | ANTLRUnbufferedCommonTreeNodeStreamState.h | 39 NSMutableArray *lookahead; variable 60 - (NSMutableArray *) lookahead;
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
H A D | ANTLRUnbufferedCommonTreeNodeStreamState.h | 39 NSMutableArray *lookahead; variable 60 - (NSMutableArray *) lookahead;
|
H A D | ANTLRUnbufferedCommonTreeNodeStream.h | 54 NSMutableArray *lookahead; variable 70 @property (retain, getter=getLookahead, setter=setLookahead:) NSMutableArray *lookahead; variable
|
/external/zlib/src/ |
H A D | deflate.c | 338 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; 897 if (strm->avail_in != 0 || s->lookahead != 0 || 931 if (s->lookahead == 0) { 1120 s->lookahead [all...] |
H A D | deflate.h | 161 uInt lookahead; /* number of valid bytes ahead in window */ member in struct:internal_state 282 /* Minimum amount of lookahead, except at the end of the input file.
|
/external/qemu/distrib/zlib-1.2.3/ |
H A D | deflate.c | 114 /* Minimum amount of lookahead, except at the end of the input file. 344 * s->lookahead stays null, so s->ins_h will be recomputed at the next 786 if (strm->avail_in != 0 || s->lookahead != 0 || 1002 s->lookahead = 0; 1021 * OUT assertion: the match length is not greater than s->lookahead. 1070 if ((uInt)nice_match > s->lookahead) nice_match = s->lookahead; 1072 Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead"); 1080 * for insufficient lookahead only occur occasionally for performance 1083 * However the length of the match is limited to the lookahead, s [all...] |
H A D | deflate.h | 158 uInt lookahead; /* number of valid bytes ahead in window */ member in struct:internal_state 272 /* Minimum amount of lookahead, except at the end of the input file.
|
/external/apache-xml/src/main/java/org/apache/xml/utils/ |
H A D | NamespaceSupport2.java | 392 private String lookahead=null; field in class:PrefixForUriEnumerator 406 if(lookahead!=null) 414 lookahead=prefix; 425 String tmp=lookahead; 426 lookahead=null;
|
/external/icu4c/common/ |
H A D | ruleiter.cpp | 73 c = lookahead(tempEscape, MAX_U_NOTATION_LEN).unescapeAt(offset); 110 UnicodeString& RuleCharacterIterator::lookahead(UnicodeString& result, int32_t maxLookAhead) const { function in class:RuleCharacterIterator
|
H A D | 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.
|
/external/icu4c/tools/genrb/ |
H A D | parse.c | 81 struct Lookahead lookahead[MAX_LOOKAHEAD + 1]; member in struct:__anon6138 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); 147 ustr_deinit(&state->lookahead[i].comment); 158 result = state->lookahead[stat [all...] |
/external/openfst/src/include/fst/ |
H A D | fstlib.h | 117 #include <fst/lookahead-filter.h> 118 #include <fst/lookahead-matcher.h>
|
/external/apache-xml/src/main/java/org/apache/xpath/compiler/ |
H A D | XPathParser.java | 290 final boolean lookahead(char c, int n) method in class:XPathParser 391 * @param n number of tokens to lookahead. Must be 397 private final boolean lookahead(String s, int n) method in class:XPathParser 404 String lookahead = (String) m_ops.m_tokenQueue.elementAt(m_queueMark + (n - 1)); 406 isToken = (lookahead != null) ? lookahead.equals(s) : (s == null); 874 if (tokenIs('!') && lookahead('=', 1)) 1444 else if (lookahead('(', 1) || (lookahead(':', 1) && lookahead('(', [all...] |
/external/antlr/antlr-3.4/runtime/Ruby/test/functional/debugging/ |
H A D | profile-mode.rb | 24 * Use ANTLRWorks to see the lookahead use (step by Location)
|
/external/harfbuzz/src/ |
H A D | harfbuzz-shaper.cpp | 708 hb_uint32 lookahead = i + 1; local 709 while (lookahead < stringLength) { 710 hb_uint32 testbrk = HB_GetWordClass(string[lookahead]); 711 if (testbrk == HB_Word_Format && HB_GetSentenceClass(string[lookahead]) != HB_Sentence_Sep) { 712 ++lookahead; 717 while (i < lookahead) 777 hb_uint32 lookahead = i + 1; local 778 while (lookahead < stringLength) { 779 hb_uint32 sbrk = HB_GetSentenceClass(string[lookahead]); 786 ++lookahead; [all...] |
/external/chromium/net/base/ |
H A D | dnssec_chain_verifier.cc | 721 // lookahead[i] is true iff the i'th DS record was empty and needs to be 723 scoped_array<bool> lookahead(new bool[num_ds]); 735 lookahead[i] = digest.empty(); 757 if (lookahead[i]) {
|
/external/zlib/src/contrib/masmx64/ |
H A D | gvmat64.asm | 256 ;;; if ((uInt)nice_match > s->lookahead) nice_match = s->lookahead;
516 ;;; if ((uInt)best_len <= s->lookahead) return (uInt)best_len;
517 ;;; return s->lookahead;
|
/external/zlib/src/contrib/masmx86/ |
H A D | match686.asm | 242 ;;; if ((uInt)nice_match > s->lookahead) nice_match = s->lookahead;
435 ;;; if ((uInt)best_len <= s->lookahead) return (uInt)best_len;
436 ;;; return s->lookahead;
|