| /external/nist-sip/java/gov/nist/javax/sip/parser/ims/ |
| PathParser.java | 87 char la = lexer.lookAhead(0);
|
| PAssociatedURIParser.java | 97 while (lexer.lookAhead(0) == ',')
|
| /external/javassist/src/main/javassist/bytecode/analysis/ |
| Analyzer.java | 140 frames[iter.lookAhead()] = firstFrame(method, maxLocals, maxStack);
195 mergeJsr(queue, frames[pos], subroutines[target], pos, lookAhead(iter, pos));
197 merge(queue, frame, lookAhead(iter, pos));
203 merge(queue, frame, lookAhead(iter, pos));
261 int next = iter.lookAhead();
268 private int lookAhead(CodeIterator iter, int pos) throws BadBytecode {
272 return iter.lookAhead();
|
| SubroutineScanner.java | 69 int old = iter.lookAhead();
|
| /external/icu/icu4c/source/i18n/ |
| collationiterator.cpp | 495 int32_t lookAhead = 1;
520 sinceMatch < lookAhead)) {
530 lookAhead -= sinceMatch - 1;
535 d, suffixes, ce32, lookAhead, c, errorCode);
547 ++lookAhead;
557 int32_t lookAhead, UChar32 c,
586 ++lookAhead;
595 // We have read and matched (lookAhead-2) code points,
607 if(lookAhead > 2) {
609 backwardNumCodePoints(lookAhead, errorCode)
[all...] |
| regexcmp.h | 75 lookAhead = -4,
|
| collationiterator.h | 281 int32_t lookAhead, UChar32 c,
|
| regexcmp.cpp | 536 // restore the original regions when failing out of a lookahead
538 // might make sense - or might not, lookahead aren't that common.
545 // 2. STATE_SAVE 4 on failure of lookahead, goto 4
585 fParenStack.push(lookAhead, *fStatus); // Frame type.
592 // Negated Lookahead. (?! stuff )
600 // 6. BACKTRACK // code in block succeeded, so neg. lookahead fails.
[all...] |
| /external/chromium_org/third_party/icu/source/i18n/ |
| regexcmp.h | 75 lookAhead = -4,
|
| regexcmp.cpp | 536 // restore the original regions when failing out of a lookahead
538 // might make sense - or might not, lookahead aren't that common.
545 // 2. STATE_SAVE 4 on failure of lookahead, goto 4
585 fParenStack.push(lookAhead, *fStatus); // Frame type.
592 // Negated Lookahead. (?! stuff )
600 // 6. BACKTRACK // code in block succeeded, so neg. lookahead fails.
[all...] |
| /external/nist-sip/java/gov/nist/javax/sip/parser/ |
| SubscriptionStateParser.java | 81 while (lexer.lookAhead(0) == ';') {
|
| /external/chromium_org/third_party/lzma_sdk/ |
| LzmaDec.c | 806 unsigned rem = p->tempBufSize, lookAhead = 0;
807 while (rem < LZMA_REQUIRED_INPUT_MAX && lookAhead < inSize)
808 p->tempBuf[rem++] = src[lookAhead++];
815 (*srcLen) += lookAhead;
828 lookAhead -= (rem - (unsigned)(p->buf - p->tempBuf));
829 (*srcLen) += lookAhead;
830 src += lookAhead;
831 inSize -= lookAhead;
|
| /external/chromium_org/third_party/ots/third_party/lzma_sdk/ |
| LzmaDec.c | 807 unsigned rem = p->tempBufSize, lookAhead = 0;
808 while (rem < LZMA_REQUIRED_INPUT_MAX && lookAhead < inSize)
809 p->tempBuf[rem++] = src[lookAhead++];
816 (*srcLen) += lookAhead;
829 lookAhead -= (rem - (unsigned)(p->buf - p->tempBuf));
830 (*srcLen) += lookAhead;
831 src += lookAhead;
832 inSize -= lookAhead;
|
| /external/lzma/C/ |
| LzmaDec.c | 806 unsigned rem = p->tempBufSize, lookAhead = 0;
807 while (rem < LZMA_REQUIRED_INPUT_MAX && lookAhead < inSize)
808 p->tempBuf[rem++] = src[lookAhead++];
815 (*srcLen) += lookAhead;
828 lookAhead -= (rem - (unsigned)(p->buf - p->tempBuf));
829 (*srcLen) += lookAhead;
830 src += lookAhead;
831 inSize -= lookAhead;
|
| /external/chromium_org/third_party/WebKit/Source/platform/text/ |
| SegmentedString.h | 207 LookAheadResult lookAhead(const String& string) { return lookAheadInline(string, true); }
|
| /external/chromium_org/third_party/icu/source/common/ |
| rbbitblb.cpp | 211 if (n->fType == RBBINode::lookAhead || n->fType == RBBINode::tag) {
212 // Lookahead marker node. It's a leaf, so no recursion on children.
253 n->fType == RBBINode::lookAhead ||
299 n->fType == RBBINode::lookAhead ||
729 // Both lookahead and non-lookahead accepting for this state.
765 fTree->findNodes(&lookAheadNodes, RBBINode::lookAhead, *fStatus);
[all...] |
| rbbiscan.cpp | 443 n = pushNewNode(RBBINode::lookAhead);
[all...] |
| /external/icu/icu4c/source/common/ |
| rbbitblb.cpp | 211 if (n->fType == RBBINode::lookAhead || n->fType == RBBINode::tag) {
212 // Lookahead marker node. It's a leaf, so no recursion on children.
253 n->fType == RBBINode::lookAhead ||
299 n->fType == RBBINode::lookAhead ||
729 // Both lookahead and non-lookahead accepting for this state.
765 fTree->findNodes(&lookAheadNodes, RBBINode::lookAhead, *fStatus);
[all...] |
| rbbiscan.cpp | 443 n = pushNewNode(RBBINode::lookAhead);
[all...] |
| /external/javassist/src/main/javassist/convert/ |
| TransformAccessArrayField.java | 132 castType = getTopType(iterator.lookAhead());
|
| /external/javassist/src/main/javassist/expr/ |
| Expr.java | 318 int endPos = oldIterator.lookAhead();
|
| ExprEditor.java | 130 while (iterator.hasNext() && iterator.lookAhead() < endPos) {
|
| /external/chromium_org/third_party/WebKit/Source/core/html/parser/ |
| HTMLTokenizer.cpp | [all...] |
| /external/javassist/src/main/javassist/bytecode/ |
| CodeIterator.java | 193 * Successive calls to <code>lookAhead()</code> return the
196 public int lookAhead() {
[all...] |
| /external/robolectric/lib/main/ |
| javassist-3.14.0-GA.jar | |
