Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
/* Generated by: ParserGeneratorCC: Do not edit this line. AbstractCharStream.java Version 1.1 */
/* ParserGeneratorCCOptions:SUPPORT_CLASS_VISIBILITY_PUBLIC=true */
/*
* Copyright (C) 2007-2010 Júlio Vilmar Gesser.
* Copyright (C) 2011, 2013-2016 The JavaParser Team.
* Copyright 2019 Red Hat, Inc. and/or its affiliates.
*
* This file is part of JavaParser.
*
* JavaParser can be used either under the terms of
* a) the GNU Lesser General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
* b) the terms of the Apache License
*
* You should have received a copy of both licenses in LICENCE.LGPL and
* LICENCE.APACHE. Please refer to those files for details.
*
* JavaParser is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License for more details.
*
* Modified by Red Hat, Inc.
*/
package org.drools.mvel.parser;
/**
* An implementation of interface CharStream, where the stream is assumed to
* contain only ASCII characters (without unicode processing).
*/
public
abstract class AbstractCharStream
implements CharStream
{
public static final int DEFAULT_BUF_SIZE = 4096;
static final int hexval(final char c) throws java.io.IOException {
switch(c)
{
case '0' :
return 0;
case '1' :
return 1;
case '2' :
return 2;
case '3' :
return 3;
case '4' :
return 4;
case '5' :
return 5;
case '6' :
return 6;
case '7' :
return 7;
case '8' :
return 8;
case '9' :
return 9;
case 'a' :
case 'A' :
return 10;
case 'b' :
case 'B' :
return 11;
case 'c' :
case 'C' :
return 12;
case 'd' :
case 'D' :
return 13;
case 'e' :
case 'E' :
return 14;
case 'f' :
case 'F' :
return 15;
}
// Should never come here
throw new java.io.IOException("Invalid hex char '" + c + "' provided!");
}
/** Position in buffer. */
protected int bufpos = -1;
protected int bufsize;
protected int available;
protected int tokenBegin;
protected int[] bufline;
protected int[] bufcolumn;
protected int column = 0;
protected int line = 1;
protected boolean prevCharIsCR = false;
protected boolean prevCharIsLF = false;
protected char[] buffer;
protected int maxNextCharInd = 0;
protected int inBuf = 0;
private int tabSize = 1;
protected char[] nextCharBuf;
protected int nextCharInd = -1;
private boolean trackLineColumn = true;
public void setTabSize(final int i)
{
tabSize = i;
}
public int getTabSize()
{
return tabSize;
}
protected void expandBuff(final boolean wrapAround)
{
final char[] newbuffer = new char[bufsize + 2048];
final int newbufline[] = new int[bufsize + 2048];
final int newbufcolumn[] = new int[bufsize + 2048];
try
{
if (wrapAround)
{
System.arraycopy(buffer, tokenBegin, newbuffer, 0, bufsize - tokenBegin);
System.arraycopy(buffer, 0, newbuffer, bufsize - tokenBegin, bufpos);
buffer = newbuffer;
System.arraycopy(bufline, tokenBegin, newbufline, 0, bufsize - tokenBegin);
System.arraycopy(bufline, 0, newbufline, bufsize - tokenBegin, bufpos);
bufline = newbufline;
System.arraycopy(bufcolumn, tokenBegin, newbufcolumn, 0, bufsize - tokenBegin);
System.arraycopy(bufcolumn, 0, newbufcolumn, bufsize - tokenBegin, bufpos);
bufcolumn = newbufcolumn;
bufpos += (bufsize - tokenBegin);
maxNextCharInd = bufpos;
}
else
{
System.arraycopy(buffer, tokenBegin, newbuffer, 0, bufsize - tokenBegin);
buffer = newbuffer;
System.arraycopy(bufline, tokenBegin, newbufline, 0, bufsize - tokenBegin);
bufline = newbufline;
System.arraycopy(bufcolumn, tokenBegin, newbufcolumn, 0, bufsize - tokenBegin);
bufcolumn = newbufcolumn;
bufpos -= tokenBegin;
maxNextCharInd = bufpos;
}
}
catch (final Exception ex)
{
throw new IllegalStateException(ex);
}
bufsize += 2048;
available = bufsize;
tokenBegin = 0;
}
protected abstract int streamRead(char[] buf, int offset, int len) throws java.io.IOException;
protected abstract void streamClose() throws java.io.IOException;
protected void fillBuff() throws java.io.IOException
{
if (maxNextCharInd == available)
{
if (available == bufsize)
{
if (tokenBegin > 2048)
{
bufpos = maxNextCharInd = 0;
available = tokenBegin;
}
else
if (tokenBegin < 0)
bufpos = maxNextCharInd = 0;
else
expandBuff(false);
}
else
if (available > tokenBegin)
available = bufsize;
else
if ((tokenBegin - available) < 2048)
expandBuff(true);
else
available = tokenBegin;
}
try {
final int i = streamRead(buffer, maxNextCharInd, available - maxNextCharInd);
if (i == -1)
{
streamClose();
throw new java.io.IOException();
}
maxNextCharInd += i;
return;
}
catch (final java.io.IOException e) {
--bufpos;
backup(0);
if (tokenBegin == -1)
tokenBegin = bufpos;
throw e;
}
}
public char beginToken() throws java.io.IOException
{
tokenBegin = -1;
char c = readChar();
tokenBegin = bufpos;
return c;
}
protected void updateLineColumn(char c)
{
column++;
if (prevCharIsLF)
{
prevCharIsLF = false;
column = 1;
line++;
}
else
if (prevCharIsCR)
{
prevCharIsCR = false;
if (c == '\n')
prevCharIsLF = true;
else
{
column = 1;
line++;
}
}
switch (c)
{
case '\r' :
prevCharIsCR = true;
break;
case '\n' :
prevCharIsLF = true;
break;
case '\t' :
column--;
column += (tabSize - (column % tabSize));
break;
default :
break;
}
bufline[bufpos] = line;
bufcolumn[bufpos] = column;
}
/** Read a character. */
public char readChar() throws java.io.IOException
{
if (inBuf > 0)
{
--inBuf;
if (++bufpos == bufsize)
bufpos = 0;
return buffer[bufpos];
}
++bufpos;
if (bufpos >= maxNextCharInd)
fillBuff();
char c = buffer[bufpos];
if (trackLineColumn)
updateLineColumn(c);
return c;
}
public int getBeginColumn() {
return bufcolumn[tokenBegin];
}
public int getBeginLine() {
return bufline[tokenBegin];
}
public int getEndColumn() {
return bufcolumn[bufpos];
}
public int getEndLine() {
return bufline[bufpos];
}
public void backup(final int amount) {
inBuf += amount;
bufpos -= amount;
if (bufpos < 0)
bufpos += bufsize;
}
/** Constructor. */
public AbstractCharStream(final int startline,
final int startcolumn,
final int buffersize)
{
line = startline;
column = startcolumn - 1;
bufsize = buffersize;
available = buffersize;
buffer = new char[buffersize];
bufline = new int[buffersize];
bufcolumn = new int[buffersize];
nextCharBuf = new char[4096];
}
/** Reinitialise. */
public void reInit(final int startline,
final int startcolumn,
final int buffersize)
{
line = startline;
column = startcolumn - 1;
if (buffer == null || buffersize != buffer.length)
{
bufsize = buffersize;
available = buffersize;
buffer = new char[buffersize];
bufline = new int[buffersize];
bufcolumn = new int[buffersize];
nextCharBuf = new char[4096];
}
prevCharIsCR = false;
prevCharIsLF = false;
maxNextCharInd = 0;
inBuf = 0;
tokenBegin = 0;
bufpos = -1;
nextCharInd = -1;
}
public String getImage()
{
if (bufpos >= tokenBegin) {
// from tokenBegin to bufpos
return new String(buffer, tokenBegin, bufpos - tokenBegin + 1);
}
// from tokenBegin to bufpos including wrap around
return new String(buffer, tokenBegin, bufsize - tokenBegin) +
new String(buffer, 0, bufpos + 1);
}
public char[] getSuffix(int len)
{
char[] ret = new char[len];
if ((bufpos + 1) >= len)
System.arraycopy(buffer, bufpos - len + 1, ret, 0, len);
else
{
System.arraycopy(buffer, bufsize - (len - bufpos - 1), ret, 0, len - bufpos - 1);
System.arraycopy(buffer, 0, ret, len - bufpos - 1, bufpos + 1);
}
return ret;
}
public void done()
{
nextCharBuf = null;
buffer = null;
bufline = null;
bufcolumn = null;
}
/**
* Method to adjust line and column numbers for the start of a token.
*/
public void adjustBeginLineColumn(final int nNewLine, final int newCol)
{
int start = tokenBegin;
int newLine = nNewLine;
int len;
if (bufpos >= tokenBegin)
{
len = bufpos - tokenBegin + inBuf + 1;
}
else
{
len = bufsize - tokenBegin + bufpos + 1 + inBuf;
}
int i = 0;
int j = 0;
int k = 0;
int nextColDiff = 0;
int columnDiff = 0;
// TODO disassemble meaning and split up
while (i < len && bufline[j = start % bufsize] == bufline[k = ++start % bufsize])
{
bufline[j] = newLine;
nextColDiff = columnDiff + bufcolumn[k] - bufcolumn[j];
bufcolumn[j] = newCol + columnDiff;
columnDiff = nextColDiff;
i++;
}
if (i < len)
{
bufline[j] = newLine++;
bufcolumn[j] = newCol + columnDiff;
while (i++ < len)
{
// TODO disassemble meaning and split up
if (bufline[j = start % bufsize] != bufline[++start % bufsize])
bufline[j] = newLine++;
else
bufline[j] = newLine;
}
}
line = bufline[j];
column = bufcolumn[j];
}
public void setTrackLineColumn(final boolean tlc) {
trackLineColumn = tlc;
}
public boolean isTrackLineColumn() {
return trackLineColumn;
}
}
/* ParserGeneratorCC - OriginalChecksum=bc296f34ec3ccfd0bb7cb11571fe5cdc (do not edit this line) */
