org.vesalainen.parser.util.ByteInput Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of lpg Show documentation
Show all versions of lpg Show documentation
Java Lookahead Parser Generator. Generator produces LALR(k) parsers. Grammar
rules are entered using annotations. Rule annotation can be attached to reducer
method, which keeps rule and it's action together.
The newest version!
/*
* Copyright (C) 2014 Timo Vesalainen
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see
{
protected byte[] array;
protected ByteInput(int size, boolean direct, EnumSet features)
{
super(features);
this.size = size;
if (direct)
{
this.buffer1 = ByteBuffer.allocateDirect(size);
}
else
{
this.buffer1 = ByteBuffer.allocate(size);
}
this.buffer2 = buffer1.duplicate();
this.array1 = new ByteBuffer[] {buffer1};
this.array2 = new ByteBuffer[] {buffer1, buffer2};
if (buffer1.hasArray())
{
this.array = buffer1.array();
}
}
protected ByteInput(byte[] array, EnumSet features)
{
super(features);
this.size = array.length;
this.buffer1 = ByteBuffer.wrap(array);
this.buffer2 = buffer1.duplicate();
this.array1 = new ByteBuffer[] {buffer1};
this.array2 = new ByteBuffer[] {buffer1, buffer2};
this.array = buffer1.array();
this.end = array.length;
}
protected ByteInput(ByteBuffer buffer, EnumSet features)
{
super(features);
this.size = buffer.limit();
this.buffer1 = buffer.duplicate();
this.buffer2 = buffer1.duplicate();
this.array1 = new ByteBuffer[] {buffer1};
this.array2 = new ByteBuffer[] {buffer1, buffer2};
if (buffer1.hasArray())
{
this.array = buffer1.array();
}
this.cursor = buffer.position();
this.end = buffer.limit();
}
@Override
protected int get(int index)
{
return buffer1.get(index % size) & 0xff;
}
@Override
protected void set(int index, int value)
{
buffer1.put(index % size, (byte) value);
}
@Override
public void write(int start, int length, Writer writer) throws IOException
{
throw new UnsupportedOperationException("Not supported yet."); //To change body of generated methods, choose Tools | Templates.
}
@Override
public void write(Writer writer) throws IOException
{
throw new UnsupportedOperationException("Not supported yet."); //To change body of generated methods, choose Tools | Templates.
}
@Override
public void reuse(CharSequence text)
{
throw new UnsupportedOperationException("Not supported yet."); //To change body of generated methods, choose Tools | Templates.
}
@Override
public byte[] getArray()
{
return array;
}
/**
* Returns string from buffer
* @param start Start of input
* @param length Length of input
* @return
*/
@Override
public String getString(int start, int length)
{
if (array != null)
{
int ps = start % size;
int es = (start+length) % size;
if (ps < es)
{
return new String(array, ps, length, StandardCharsets.US_ASCII);
}
else
{
StringBuilder sb = new StringBuilder();
sb.append(new String(array, ps, size-ps, StandardCharsets.US_ASCII));
sb.append(new String(array, 0, es, StandardCharsets.US_ASCII));
return sb.toString();
}
}
else
{
StringBuilder sb = new StringBuilder();
for (int ii=0;ii= size - (end-cursor))
{
throw new IOException(Arrays.toString(text)+" doesn't fit in the buffer");
}
if (cursor != end)
{
makeRoom(ln);
}
if (array != null)
{
int cms = cursor % size;
if (size - cms < text.length)
{
System.arraycopy(text, 0, array, cms, size - cms);
System.arraycopy(text, size - cms, array, 0, text.length - (size - cms));
}
else
{
System.arraycopy(text, 0, array, cms, text.length);
}
}
else
{
for (int ii=0;ii= size - (end-cursor))
{
throw new IOException(text+" doesn't fit in the buffer");
}
if (cursor != end)
{
makeRoom(ln);
}
for (int ii=0;ii= cms)
{
spaceAtEndOfBuffer = size - ems;
}
int needToWrap = Math.min(ln - spaceAtEndOfBuffer, size - cms);
if (needToWrap > 0)
{
src = size - spaceAtEndOfBuffer - needToWrap;
dst = ln-needToWrap - spaceAtEndOfBuffer;
len = needToWrap;
System.arraycopy(array, src, array, dst, len);
}
src = cms;
if (ems < cms)
{
len = (size - cms) - needToWrap;
}
else
{
len = (ems - cms) - needToWrap;
}
dst = Math.min(cms + ln, size-1);
System.arraycopy(array, src, array, dst, len);
}
else
{
int len = end-cursor;
for (int ii=0;ii