/**
* Copyright 2013-2016 Guoqiang Chen, Shanghai, China. All rights reserved.
*
* Author: Guoqiang Chen
* Email: subchen@gmail.com
* WebURL: https://github.com/subchen
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package jetbrick.io.buffer;
import java.util.Iterator;
import java.util.NoSuchElementException;
import java.util.RandomAccess;
/**
* Fast, fast <code>E</code> buffer with additional features.
* This buffer implementation does not store all data
* in single array, but in array of chunks.
*/
@SuppressWarnings("unchecked")
public class FastBuffer<E> implements RandomAccess, Iterable<E> {
private E[][] buffers = (E[][]) new Object[16][];
private int buffersCount;
private int currentBufferIndex = -1;
private E[] currentBuffer;
private int offset;
private int size;
private final int minChunkLen;
/**
* Creates a new <code>E</code> buffer. The buffer capacity is
* initially 1024 bytes, though its size increases if necessary.
*/
public FastBuffer() {
this.minChunkLen = 1024;
}
/**
* Creates a new <code>E</code> buffer, with a buffer capacity of
* the specified size, in bytes.
*
* @param size the initial size.
* @throws IllegalArgumentException if size is negative.
*/
public FastBuffer(int size) {
if (size < 0) {
throw new IllegalArgumentException("Invalid size: " + size);
}
this.minChunkLen = size;
}
/**
* Prepares next chunk to match new size.
* The minimal length of new chunk is <code>minChunkLen</code>.
*/
private void needNewBuffer(int newSize) {
int delta = newSize - size;
int newBufferSize = Math.max(minChunkLen, delta);
currentBufferIndex++;
currentBuffer = (E[]) new Object[newBufferSize];
offset = 0;
// add buffer
if (currentBufferIndex >= buffers.length) {
int newLen = buffers.length << 1;
E[][] newBuffers = (E[][]) new Object[newLen][];
System.arraycopy(buffers, 0, newBuffers, 0, buffers.length);
buffers = newBuffers;
}
buffers[currentBufferIndex] = currentBuffer;
buffersCount++;
}
/**
* Appends <code>E</code> array to buffer.
*/
public FastBuffer<E> append(E[] array, int off, int len) {
int end = off + len;
if ((off < 0) || (len < 0) || (end > array.length)) {
throw new IndexOutOfBoundsException();
}
if (len == 0) {
return this;
}
int newSize = size + len;
int remaining = len;
if (currentBuffer != null) {
// first try to fill current buffer
int part = Math.min(remaining, currentBuffer.length - offset);
System.arraycopy(array, end - remaining, currentBuffer, offset, part);
remaining -= part;
offset += part;
size += part;
}
if (remaining > 0) {
// still some data left
// ask for new buffer
needNewBuffer(newSize);
// then copy remaining
// but this time we are sure that it will fit
int part = Math.min(remaining, currentBuffer.length - offset);
System.arraycopy(array, end - remaining, currentBuffer, offset, part);
offset += part;
size += part;
}
return this;
}
/**
* Appends <code>E</code> array to buffer.
*/
public FastBuffer<E> append(E[] array) {
return append(array, 0, array.length);
}
/**
* Appends single <code>E</code> to buffer.
*/
public FastBuffer<E> append(E element) {
if ((currentBuffer == null) || (offset == currentBuffer.length)) {
needNewBuffer(size + 1);
}
currentBuffer[offset] = element;
offset++;
size++;
return this;
}
/**
* Appends another fast buffer to this one.
*/
public FastBuffer<E> append(FastBuffer<E> buff) {
if (buff.size == 0) {
return this;
}
for (int i = 0; i < buff.currentBufferIndex; i++) {
append(buff.buffers[i]);
}
append(buff.currentBuffer, 0, buff.offset);
return this;
}
/**
* Returns buffer size.
*/
public int size() {
return size;
}
/**
* Tests if this buffer has no elements.
*/
public boolean isEmpty() {
return size == 0;
}
/**
* Returns current index of inner <code>E</code> array chunk.
* Represents the index of last used inner array chunk.
*/
public int index() {
return currentBufferIndex;
}
/**
* Returns the offset of last used element in current inner array chunk.
*/
public int offset() {
return offset;
}
/**
* Returns <code>E</code> inner array chunk at given index.
* May be used for iterating inner chunks in fast manner.
*/
public E[] array(int index) {
return buffers[index];
}
/**
* Resets the buffer content.
*/
public void clear() {
size = 0;
offset = 0;
currentBufferIndex = -1;
currentBuffer = null;
buffersCount = 0;
}
/**
* Creates <code>E</code> array from buffered content.
*/
public E[] toArray() {
int pos = 0;
E[] array = (E[]) new Object[size];
if (currentBufferIndex == -1) {
return array;
}
for (int i = 0; i < currentBufferIndex; i++) {
int len = buffers[i].length;
System.arraycopy(buffers[i], 0, array, pos, len);
pos += len;
}
System.arraycopy(buffers[currentBufferIndex], 0, array, pos, offset);
return array;
}
/**
* Creates <code>E</code> subarray from buffered content.
*/
public E[] toArray(int start, int len) {
int remaining = len;
int pos = 0;
E[] array = (E[]) new Object[len];
if (len == 0) {
return array;
}
int i = 0;
while (start >= buffers[i].length) {
start -= buffers[i].length;
i++;
}
while (i < buffersCount) {
E[] buf = buffers[i];
int c = Math.min(buf.length - start, remaining);
System.arraycopy(buf, start, array, pos, c);
pos += c;
remaining -= c;
if (remaining == 0) {
break;
}
start = 0;
i++;
}
return array;
}
/**
* Returns <code>E</code> element at given index.
*/
public E get(int index) {
if ((index >= size) || (index < 0)) {
throw new IndexOutOfBoundsException();
}
int ndx = 0;
while (true) {
E[] b = buffers[ndx];
if (index < b.length) {
return b[index];
}
ndx++;
index -= b.length;
}
}
// @@generated
/**
* Adds element to buffer.
*/
public void add(E element) {
append(element);
}
/**
* Returns an iterator over buffer elements.
*/
@Override
public Iterator<E> iterator() {
return new Iterator<E>() {
int iteratorIndex;
int iteratorBufferIndex;
int iteratorOffset;
@Override
public boolean hasNext() {
return iteratorIndex < size;
}
@Override
public E next() {
if (iteratorIndex >= size) {
throw new NoSuchElementException();
}
E[] buf = buffers[iteratorBufferIndex];
E result = buf[iteratorOffset];
// increment
iteratorIndex++;
iteratorOffset++;
if (iteratorOffset >= buf.length) {
iteratorOffset = 0;
iteratorBufferIndex++;
}
return result;
}
@Override
public void remove() {
throw new UnsupportedOperationException();
}
};
}
}