com.ximpleware.FastLongBuffer Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of vtd-xml Show documentation
Show all versions of vtd-xml Show documentation
XimpleWare's VTD-XML is, far and away, the industry's most advanced and powerful XML processing model for SOA and Cloud Computing
/*
* Copyright (C) 2002-2015 XimpleWare, [email protected]
*
* 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 2 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, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
/*VTD-XML is protected by US patent 7133857, 7260652, an 7761459*/
/*All licenses to any parties in litigation with XimpleWare have been expressly terminated. No new license, and no renewal of any revoked license,
* is granted to those parties as a result of re-downloading software from this or any other website*/
package com.ximpleware;
import java.lang.IndexOutOfBoundsException;
import java.lang.NullPointerException;
import java.lang.IllegalArgumentException;
import java.util.ArrayList;
/**
* A fast, unsynchronized, chunk-based long buffer for storing LCs and VTD.
* Creation date: (7/17/03 6:07:46 PM)
*/
public class FastLongBuffer implements ILongBuffer {
/* bufferArrayList is a resizable array list of int buffers
*
*/
private arrayList bufferArrayList;
/**
* Total capacity of the IntBuffer
*/
private int capacity;
/**
* Page size of the incremental growth of the Int Buffer
*/
private int pageSize;
/**
* Total number of integers in the IntBuffer
*/
protected int size;
private int exp;
private int r;
/**
* FastLongBuffer constructor comment.
*/
public FastLongBuffer() {
size = 0;
capacity = 0;
pageSize = 1024;
exp = 10;
r = 1023;
bufferArrayList = new arrayList();
}
/**
* Construct a FastLongBuffer instance with specified page size
* @param e int (so that pageSize = (1<>exp),//+(((size&r)==0)? 0:1),
bufferArrayList.size - 1);
lastBuffer = (long[]) bufferArrayList.oa[lastBufferIndex];
}
if ((this.size + long_array.length) < this.capacity) {
//get the last buffer from the bufferListArray
//obtain the starting offset in that buffer to which the data is to be copied
//update length
if (this.size + long_array.length< ((lastBufferIndex+1)<> exp;
int z;
for (z=1;z<=k;z++){
System.arraycopy(long_array,offset,(long[]) bufferArrayList.oa[lastBufferIndex+z], 0, pageSize);
offset += pageSize;
}
// copy the last part
System.arraycopy(long_array,offset,(long[]) bufferArrayList.oa[lastBufferIndex+z], 0, l & r);
}
size += long_array.length;
return;
} else // new buffers needed
{
// compute the number of additional buffers needed
// int n =
// ((int) ((long_array.length + size) / pageSize))
// + (((long_array.length + size) % pageSize) > 0 ? 1 : 0)
// - (int) (capacity / pageSize);
int n =
((long_array.length + size) >> exp)
+ (((long_array.length + size)&r) > 0 ? 1 : 0)
- (capacity >> exp);
// create these buffers
// add to bufferArrayList
//System.arraycopy(long_array, 0, lastBuffer, size % pageSize, capacity - size);
System.arraycopy(long_array, 0, lastBuffer, size & r, capacity - size);
for (int i = 0; i < n; i++) {
long[] newBuffer = new long[pageSize];
if (i < n - 1) {
// full copy
System.arraycopy(
long_array,
pageSize * i + capacity - size,
newBuffer,
0,
pageSize);
} else {
// last page
System.arraycopy(
long_array,
pageSize * i + capacity - size,
newBuffer,
0,
long_array.length+ size - pageSize*i - capacity);
}
bufferArrayList.add(newBuffer);
}
// update length
size += long_array.length;
// update capacity
capacity += n * pageSize;
// update
}
}
/**
* Append an integer to the end of this array buffer
* @param i long
*/
public final void append(long i) {
//long[] lastBuffer;
//int lastBufferIndex;
/*if (bufferArrayList.size == 0) {
lastBuffer = new long[pageSize];
bufferArrayList.add(lastBuffer);
capacity = pageSize;
} else {
lastBufferIndex = Math.min((size>>exp),//+(((size&r)==0)? 0:1),
bufferArrayList.size - 1);
lastBuffer = (long[]) bufferArrayList.oa[lastBufferIndex];
//lastBuffer = (long[]) bufferArrayList.get(bufferArrayList.size() - 1);
}*/
if (this.size < this.capacity) {
//get the last buffer from the bufferListArray
//obtain the starting offset in that buffer to which the data is to be copied
//update length
//System.arraycopy(long_array, 0, lastBuffer, size % pageSize, long_array.length);
//lastBuffer[size % pageSize] = i;
((long[]) bufferArrayList.oa[size >> exp])[size & r] = i;
//((long[])bufferArrayList.oa[bufferArrayList.size-1])[size & r] = i;
size += 1;
} else // new buffers needed
{
long[] newBuffer = new long[pageSize];
size++;
capacity += pageSize;
bufferArrayList.add(newBuffer);
newBuffer[0] = i;
}
}
/**
* Get the capacity of the buffer.
* @return int
*/
public final int getCapacity() {
return capacity;
}
/**
* Return a selected chuck of long buffer as a long array.
* @return long[]
* @param startingOffset int
* @param len int
*/
public long[] getLongArray(int startingOffset, int len) {
if (size <= 0 || startingOffset < 0) {
throw (new IllegalArgumentException());
}
if ((startingOffset + len) > size) {
throw (new IndexOutOfBoundsException());
}
long[] result = new long[len]; // allocate result array
int first_index = (startingOffset >> exp);
int last_index = ((startingOffset + len) >>exp);
//if ((startingOffset + len) % pageSize == 0) {
if (((startingOffset + len) & r) == 0) {
last_index--;
}
if (first_index == last_index) {
// to see if there is a need to go across buffer boundry
System.arraycopy(
(long[]) (bufferArrayList.oa[first_index]),
// startingOffset % pageSize,
startingOffset & r,
result,
0,
len);
} else {
int long_array_offset = 0;
for (int i = first_index; i <= last_index; i++) {
long[] currentChunk = (long[]) bufferArrayList.oa[i];
if (i == first_index) // first section
{
System.arraycopy(
currentChunk,
// startingOffset % pageSize,
startingOffset & r,
result,
0,
// pageSize - (startingOffset % r));
pageSize - (startingOffset & r));
long_array_offset += pageSize - (startingOffset & r);
} else if (i == last_index) // last sections
{
System.arraycopy(
currentChunk,
0,
result,
long_array_offset,
len - long_array_offset);
} else {
System.arraycopy(currentChunk, 0, result, long_array_offset, pageSize);
long_array_offset += pageSize;
}
}
}
return result;
}
/**
* Get the buffer page size.
* @return int
*/
public final int getPageSize() {
return pageSize;
}
/**
* Get the long val at given index value.
* @return long
* @param index int
*/
public final long longAt(int index) {
/*if (index >= size) {
throw new IndexOutOfBoundsException();
}*/
int pageNum = (index >> exp);
// int offset = index % r;
int offset = index &r;
return ((long[]) bufferArrayList.oa[pageNum])[offset];
}
/**
* Get the lower 32 bit of the integer at the given index.
* @return int
* @param index int
*/
public final int lower32At(int index) {
/*if ( index > size) {
throw new IndexOutOfBoundsException();
}*/
int pageNum = (index >> exp);
// int offset = index % pageSize;
int offset = index & r;
return (int) ((long[]) bufferArrayList.oa[pageNum])[offset];
}
/**
* Modify the value at the index to a new val.
* @param index int
* @param newValue long
*/
public final void modifyEntry(int index, long newValue) {
/*if ( index > size + 1) {
throw new IndexOutOfBoundsException();
}*/
//((long[]) bufferArrayList.get((int) (index / pageSize)))[index % pageSize] =
((long[]) bufferArrayList.oa[index >> exp])[index & r] =
newValue;
}
/**
* Get the total number of longs in the buffer.
* @return int
*/
public final int size() {
return size;
}
/**
* Convert all longs into a long array.
* @return long[]
*/
public long[] toLongArray() {
if (size > 0) {
int s = size;
long[] resultArray = new long[size];
//copy all the content int into the resultArray
int array_offset = 0;
for (int i = 0; s>0; i++) {
System.arraycopy(
(long[]) bufferArrayList.oa[i],
0,
resultArray,
array_offset,
(s>exp)<= size) {
throw new IndexOutOfBoundsException();
}*/
int pageNum = (index >>exp);
int offset = index & r;
return (int)
((((long[]) bufferArrayList.oa[pageNum])[offset] & (0xffffffffL << 32)) >> 32);
}
/**
* set teh size of long buffer to zero, capacity
* untouched so long buffer can be reused without
* any unnecessary and additional allocation
*
*/
public final void clear(){
size = 0;
}
/**
* Set the size of FastLongBuffer to newSz if newSz is less than the
* capacity, otherwise return false
* @param newSz
* @return status of resize
*
*/
public final boolean resize(int newSz){
if (newSz <= capacity && newSz >=0){
size = newSz;
return true;
}
else
return false;
}
}