public int moveIndex(int index) { return ts.moveIndex(index); }
public int moveIndex(int index) { return ts.moveIndex(index); }
private void go() { tokenSeq.moveIndex(index); tokenSeq.moveNext(); }
private void go() { tokenSeq.moveIndex(index); tokenSeq.moveNext(); }
private void rollback(int index, int col, Diff diff) { tokens.moveIndex(index); tokens.moveNext(); if (diff == null) { diffs.clear(); } else { while (!diffs.isEmpty() && diffs.getFirst() != diff) diffs.removeFirst(); } this.col = col; if (index < lastBlankLinesTokenIndex) { lastBlankLinesTokenIndex = -1; } }
@Override() public int getInsertPos(int index) { if (!initialized) initialize(); int tokenIndex = matrix[index][2]; // cannot do any decision about the position - probably first // element is inserted, no information is available. Call has // to decide. if (tokenIndex == -1) return -1; seq.moveIndex(tokenIndex); seq.moveNext(); int off = goAfterLastNewLine(seq); return off; }
private int toOff(int tokenIndex) { if (tokenIndex == -1) { return -1; } tokenSequence.moveIndex(tokenIndex); tokenSequence.moveNext(); return tokenSequence.offset(); }
public int[] getPositions(int index) { if (!initialized) initialize(); int begin = getInsertPos(index); if (matrix[index][4] != -1) { seq.moveIndex(matrix[index][4]); seq.moveNext(); } int end = goAfterFirstNewLine(seq); return new int [] { begin, end }; }
protected int go(TokenItem t) { TokenSequence<FortranTokenId> tokenSeq = t.getTokenSequence(); int aIndex = tokenSeq.index(); tokenSeq.moveIndex(t.index()); tokenSeq.moveNext(); return aIndex; }
protected int go(TokenItem t) { TokenSequence<TokenId> tokenSeq = t.getTokenSequence(); int aIndex = tokenSeq.index(); tokenSeq.moveIndex(t.index()); tokenSeq.moveNext(); return aIndex; }
/*package local*/ Token<FortranTokenId> lookPrevious(int i){ int index = ts.index(); try { while(i-- > 0) { if (!ts.movePrevious()){ return null; } } return ts.token(); } finally { ts.moveIndex(index); ts.moveNext(); } }
/*package local*/ Token<CppTokenId> lookPrevious(int i){ int index = ts.index(); try { while(i-- > 0) { if (!ts.movePrevious()){ return null; } } return ts.token(); } finally { ts.moveIndex(index); ts.moveNext(); } }
/*package local*/ Token<FortranTokenId> lookNext(int i){ int index = ts.index(); try { while(i-- > 0) { if (!ts.moveNext()){ return null; } } return ts.token(); } finally { ts.moveIndex(index); ts.moveNext(); } }
/*package local*/ Token<CppTokenId> lookNext(int i){ int index = ts.index(); try { while(i-- > 0) { if (!ts.moveNext()){ return null; } } return ts.token(); } finally { ts.moveIndex(index); ts.moveNext(); } }
/*package local*/ Token<FortranTokenId> lookNextImportant(){ int index = ts.index(); try { while(ts.moveNext()){ switch (ts.token().id()) { case WHITESPACE: case NEW_LINE: case LINE_COMMENT_FIXED: case LINE_COMMENT_FREE: case PREPROCESSOR_DIRECTIVE: break; default: return ts.token(); } } return null; } finally { ts.moveIndex(index); ts.moveNext(); } }
/*package local*/ Token<FortranTokenId> lookNextLineImportant(){ int index = ts.index(); try { while(ts.moveNext()){ switch (ts.token().id()) { case LINE_COMMENT_FIXED: case LINE_COMMENT_FREE: case PREPROCESSOR_DIRECTIVE: case NEW_LINE: return null; case WHITESPACE: break; default: return ts.token(); } } return null; } finally { ts.moveIndex(index); ts.moveNext(); } }
/*package local*/ Token<FortranTokenId> lookPreviousLineImportant(){ int index = ts.index(); try { while(ts.movePrevious()){ switch (ts.token().id()) { case LINE_COMMENT_FIXED: case LINE_COMMENT_FREE: case PREPROCESSOR_DIRECTIVE: case NEW_LINE: return null; case WHITESPACE: break; default: return ts.token(); } } return null; } finally { ts.moveIndex(index); ts.moveNext(); } }
/*package local*/ Token<CppTokenId> lookNextImportant(){ int index = ts.index(); try { while(ts.moveNext()){ switch (ts.token().id()) { case WHITESPACE: case ESCAPED_WHITESPACE: case NEW_LINE: case LINE_COMMENT: case BLOCK_COMMENT: case DOXYGEN_COMMENT: case DOXYGEN_LINE_COMMENT: case PREPROCESSOR_DIRECTIVE: break; default: return ts.token(); } } return null; } finally { ts.moveIndex(index); ts.moveNext(); } }
public TreeNode getChildAt (int index) { ts.moveIndex (index); ts.moveNext (); TokenSequence ts2 = ts.embedded (); if (ts2 != null) return new TSNode (this, ts2, ts.token (), ts.offset (), ts.index ()); return new TNode (this, ts.token (), getMimeType (), index, ts.offset ()); }
/*package local*/ Token<FortranTokenId> findOpenParenToken(int parenDepth) { int index = ts.index(); try { while(true) { if (!ts.movePrevious()){ return null; } if (ts.token().id() == LPAREN){ parenDepth--; if (parenDepth == 0){ return lookPreviousImportant(); } } else if (ts.token().id() == RPAREN){ parenDepth++; } } } finally { ts.moveIndex(index); ts.moveNext(); } }