/* ***** BEGIN LICENSE BLOCK *****
* JLargeArrays
* Copyright (C) 2013 onward University of Warsaw, ICM
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice, this
* list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
* ***** END LICENSE BLOCK ***** */
package pl.edu.icm.jlargearrays;
import java.io.IOException;
import java.util.Arrays;
import sun.misc.Cleaner;
import org.apache.commons.math3.util.FastMath;
import static pl.edu.icm.jlargearrays.LargeArray.getMaxSizeOf32bitArray;
/**
*
* An array of ints that can store up to 263 elements.
*
* @author Piotr Wendykier (p.wendykier@icm.edu.pl)
*/
public class IntLargeArray extends LargeArray
{
private static final long serialVersionUID = 86623276977976615L;
private int[] data;
/**
* Creates new instance of this class.
*
* @param length number of elements
*/
public IntLargeArray(long length)
{
this(length, true);
}
/**
* Creates new instance of this class.
*
* @param length number of elements
* @param zeroNativeMemory if true, then the native memory is zeroed.
*/
public IntLargeArray(long length, boolean zeroNativeMemory)
{
this.type = LargeArrayType.INT;
if (length < 0) {
throw new IllegalArgumentException(length + " is not a nonnegative long value");
}
this.length = length;
allocateMemory(zeroNativeMemory, 0, false);
}
/**
* Creates new instance of this class
*
* @param length number of elements
* @param initValue initialization value
*/
public IntLargeArray(long length, int initValue)
{
this(length, initValue, false);
}
/**
* Creates new instance of this class
*
* @param length number of elements
* @param initValue initialization value
* @param createConstant if true, then a constant array is created
*/
public IntLargeArray(long length, int initValue, boolean createConstant)
{
this.type = LargeArrayType.INT;
if (length < 0) {
throw new IllegalArgumentException(length + " is not a nonnegative long value");
}
this.length = length;
allocateMemory(true, initValue, createConstant);
}
/**
* Creates new instance of this class.
*
* @param data data array, this reference is used internally.
*/
public IntLargeArray(int[] data)
{
this.type = LargeArrayType.INT;
this.length = data.length;
this.data = data;
}
/**
* Returns a deep copy of this instance. (The elements themselves are copied.)
*
* @return a clone of this instance
*/
@Override
public IntLargeArray clone()
{
return (IntLargeArray) super.clone();
}
@Override
public int hashCode(float quality)
{
int fprint = 29 * super.hashCode(quality);
if (quality > 0) {
long step = (long) FastMath.ceil((1 - length) * quality + length);
for (long i = 0; i < length; i += step) {
fprint = 31 * fprint + getInt(i);
}
}
return fprint;
}
@Override
public boolean equals(Object o)
{
if (o == null || !(o instanceof LargeArray))
return false;
LargeArray la = (LargeArray) o;
boolean equal = this.type == la.type && this.length == la.length;
if (equal == false) return false;
if (this.parent != null && la.parent != null) {
if (!this.parent.equals(la.parent)) return false;
} else if (this.parent != la.parent) {
return false;
}
for (long i = 0; i < this.length; i++) {
if (this.getInt(i) != la.getInt(i)) return false;
}
return true;
}
@Override
public final Integer get(long i)
{
return getInt(i);
}
@Override
public final Integer getFromNative(long i)
{
return LargeArrayUtils.UNSAFE.getInt(ptr + this.type.sizeOf() * i);
}
@Override
public final boolean getBoolean(long i)
{
if (ptr != 0) {
return (LargeArrayUtils.UNSAFE.getInt(ptr + this.type.sizeOf() * i)) != 0;
} else if (isConstant) {
return data[0] != 0;
} else {
return data[(int) i] != 0;
}
}
@Override
public final byte getByte(long i)
{
if (ptr != 0) {
return (byte) (LargeArrayUtils.UNSAFE.getInt(ptr + this.type.sizeOf() * i));
} else if (isConstant) {
return (byte) data[0];
} else {
return (byte) data[(int) i];
}
}
@Override
public final short getUnsignedByte(long i)
{
if (ptr != 0) {
return (short) (0xFF & LargeArrayUtils.UNSAFE.getInt(ptr + this.type.sizeOf() * i));
} else if (isConstant) {
return (short) (0xFF & data[0]);
} else {
return (short) (0xFF & data[(int) i]);
}
}
@Override
public final short getShort(long i)
{
if (ptr != 0) {
return (short) (LargeArrayUtils.UNSAFE.getInt(ptr + this.type.sizeOf() * i));
} else if (isConstant) {
return (short) data[0];
} else {
return (short) data[(int) i];
}
}
@Override
public final int getInt(long i)
{
if (ptr != 0) {
return LargeArrayUtils.UNSAFE.getInt(ptr + this.type.sizeOf() * i);
} else if (isConstant) {
return data[0];
} else {
return data[(int) i];
}
}
@Override
public final long getLong(long i)
{
if (ptr != 0) {
return (long) (LargeArrayUtils.UNSAFE.getInt(ptr + this.type.sizeOf() * i));
} else if (isConstant) {
return (long) data[0];
} else {
return (long) data[(int) i];
}
}
@Override
public final float getFloat(long i)
{
if (ptr != 0) {
return (float) (LargeArrayUtils.UNSAFE.getInt(ptr + this.type.sizeOf() * i));
} else if (isConstant) {
return (float) data[0];
} else {
return (float) data[(int) i];
}
}
@Override
public final double getDouble(long i)
{
if (ptr != 0) {
return (double) (LargeArrayUtils.UNSAFE.getInt(ptr + this.type.sizeOf() * i));
} else if (isConstant) {
return (double) data[0];
} else {
return (double) data[(int) i];
}
}
@Override
public final int[] getData()
{
return data;
}
@Override
public final boolean[] getBooleanData()
{
if (length > LargeArray.LARGEST_SUBARRAY) return null;
boolean[] out = new boolean[(int) length];
if (ptr != 0) {
for (int i = 0; i < length; i++) {
int v = LargeArrayUtils.UNSAFE.getInt(ptr + this.type.sizeOf() * i);
out[i] = v != 0;
}
} else if (isConstant) {
boolean elem = data[0] != 0;
for (int i = 0; i < length; i++) {
out[i] = elem;
}
} else {
for (int i = 0; i < length; i++) {
out[i] = data[i] != 0;
}
}
return out;
}
@Override
public final boolean[] getBooleanData(boolean[] a, long startPos, long endPos, long step)
{
if (startPos < 0 || startPos >= length) {
throw new ArrayIndexOutOfBoundsException("startPos < 0 || startPos >= length");
}
if (endPos < 0 || endPos > length || endPos < startPos) {
throw new ArrayIndexOutOfBoundsException("endPos < 0 || endPos > length || endPos < startPos");
}
if (step < 1) {
throw new IllegalArgumentException("step < 1");
}
long len = (long) FastMath.ceil((endPos - startPos) / (double) step);
if (len > LargeArray.LARGEST_SUBARRAY) {
return null;
} else {
boolean[] out;
if (a != null && a.length >= len) {
out = a;
} else {
out = new boolean[(int) len];
}
int idx = 0;
if (ptr != 0) {
for (long i = startPos; i < endPos; i += step) {
int v = LargeArrayUtils.UNSAFE.getInt(ptr + this.type.sizeOf() * i);
out[idx++] = v != 0;
}
} else if (isConstant) {
for (long i = startPos; i < endPos; i += step) {
out[idx++] = data[0] != 0;
}
} else {
for (long i = startPos; i < endPos; i += step) {
int v = data[(int) i];
out[idx++] = v != 0;
}
}
return out;
}
}
@Override
public final byte[] getByteData()
{
if (length > LargeArray.LARGEST_SUBARRAY) return null;
byte[] out = new byte[(int) length];
if (ptr != 0) {
for (int i = 0; i < length; i++) {
out[i] = (byte) LargeArrayUtils.UNSAFE.getInt(ptr + this.type.sizeOf() * i);
}
} else if (isConstant) {
int elem = data[0];
for (int i = 0; i < length; i++) {
out[i] = (byte) elem;
}
} else {
for (int i = 0; i < length; i++) {
out[i] = (byte) data[i];
}
}
return out;
}
@Override
public final byte[] getByteData(byte[] a, long startPos, long endPos, long step)
{
if (startPos < 0 || startPos >= length) {
throw new ArrayIndexOutOfBoundsException("startPos < 0 || startPos >= length");
}
if (endPos < 0 || endPos > length || endPos < startPos) {
throw new ArrayIndexOutOfBoundsException("endPos < 0 || endPos > length || endPos < startPos");
}
if (step < 1) {
throw new IllegalArgumentException("step < 1");
}
long len = (long) FastMath.ceil((endPos - startPos) / (double) step);
if (len > LargeArray.LARGEST_SUBARRAY) {
return null;
} else {
byte[] out;
if (a != null && a.length >= len) {
out = a;
} else {
out = new byte[(int) len];
}
int idx = 0;
if (ptr != 0) {
for (long i = startPos; i < endPos; i += step) {
out[idx++] = (byte) LargeArrayUtils.UNSAFE.getInt(ptr + this.type.sizeOf() * i);
}
} else if (isConstant) {
for (long i = startPos; i < endPos; i += step) {
out[idx++] = (byte) data[0];
}
} else if (isConstant) {
for (long i = startPos; i < endPos; i += step) {
out[idx++] = (byte) data[0];
}
} else {
for (long i = startPos; i < endPos; i += step) {
out[idx++] = (byte) data[(int) i];
}
}
return out;
}
}
@Override
public final short[] getShortData()
{
if (length > LargeArray.LARGEST_SUBARRAY) return null;
short[] out = new short[(int) length];
if (ptr != 0) {
for (int i = 0; i < length; i++) {
out[i] = (short) LargeArrayUtils.UNSAFE.getInt(ptr + this.type.sizeOf() * i);
}
} else if (isConstant) {
int elem = data[0];
for (int i = 0; i < length; i++) {
out[i] = (short) elem;
}
} else {
for (int i = 0; i < length; i++) {
out[i] = (short) data[i];
}
}
return out;
}
@Override
public final short[] getShortData(short[] a, long startPos, long endPos, long step)
{
if (startPos < 0 || startPos >= length) {
throw new ArrayIndexOutOfBoundsException("startPos < 0 || startPos >= length");
}
if (endPos < 0 || endPos > length || endPos < startPos) {
throw new ArrayIndexOutOfBoundsException("endPos < 0 || endPos > length || endPos < startPos");
}
if (step < 1) {
throw new IllegalArgumentException("step < 1");
}
long len = (long) FastMath.ceil((endPos - startPos) / (double) step);
if (len > LargeArray.LARGEST_SUBARRAY) {
return null;
} else {
short[] out;
if (a != null && a.length >= len) {
out = a;
} else {
out = new short[(int) len];
}
int idx = 0;
if (ptr != 0) {
for (long i = startPos; i < endPos; i += step) {
out[idx++] = (short) LargeArrayUtils.UNSAFE.getInt(ptr + this.type.sizeOf() * i);
}
} else if (isConstant) {
for (long i = startPos; i < endPos; i += step) {
out[idx++] = (short) data[0];
}
} else {
for (long i = startPos; i < endPos; i += step) {
out[idx++] = (short) data[(int) i];
}
}
return out;
}
}
@Override
public final int[] getIntData()
{
if (length > LargeArray.LARGEST_SUBARRAY) return null;
int[] out = new int[(int) length];
if (ptr != 0) {
for (int i = 0; i < length; i++) {
out[i] = LargeArrayUtils.UNSAFE.getInt(ptr + this.type.sizeOf() * i);
}
} else if (isConstant) {
int elem = data[0];
for (int i = 0; i < length; i++) {
out[i] = elem;
}
} else {
System.arraycopy(data, 0, out, 0, (int) length);
}
return out;
}
@Override
public final int[] getIntData(int[] a, long startPos, long endPos, long step)
{
if (startPos < 0 || startPos >= length) {
throw new ArrayIndexOutOfBoundsException("startPos < 0 || startPos >= length");
}
if (endPos < 0 || endPos > length || endPos < startPos) {
throw new ArrayIndexOutOfBoundsException("endPos < 0 || endPos > length || endPos < startPos");
}
if (step < 1) {
throw new IllegalArgumentException("step < 1");
}
long len = (long) FastMath.ceil((endPos - startPos) / (double) step);
if (len > LargeArray.LARGEST_SUBARRAY) {
return null;
} else {
int[] out;
if (a != null && a.length >= len) {
out = a;
} else {
out = new int[(int) len];
}
int idx = 0;
if (ptr != 0) {
for (long i = startPos; i < endPos; i += step) {
out[idx++] = LargeArrayUtils.UNSAFE.getInt(ptr + this.type.sizeOf() * i);
}
} else if (isConstant) {
for (long i = startPos; i < endPos; i += step) {
out[idx++] = data[0];
}
} else {
for (long i = startPos; i < endPos; i += step) {
out[idx++] = data[(int) i];
}
}
return out;
}
}
@Override
public final long[] getLongData()
{
if (length > LargeArray.LARGEST_SUBARRAY) return null;
long[] out = new long[(int) length];
if (ptr != 0) {
for (int i = 0; i < length; i++) {
out[i] = (long) LargeArrayUtils.UNSAFE.getInt(ptr + this.type.sizeOf() * i);
}
} else if (isConstant) {
int elem = data[0];
for (int i = 0; i < length; i++) {
out[i] = (long) elem;
}
} else {
for (int i = 0; i < length; i++) {
out[i] = (long) data[i];
}
}
return out;
}
@Override
public final long[] getLongData(long[] a, long startPos, long endPos, long step)
{
if (startPos < 0 || startPos >= length) {
throw new ArrayIndexOutOfBoundsException("startPos < 0 || startPos >= length");
}
if (endPos < 0 || endPos > length || endPos < startPos) {
throw new ArrayIndexOutOfBoundsException("endPos < 0 || endPos > length || endPos < startPos");
}
if (step < 1) {
throw new IllegalArgumentException("step < 1");
}
long len = (long) FastMath.ceil((endPos - startPos) / (double) step);
if (len > LargeArray.LARGEST_SUBARRAY) {
return null;
} else {
long[] out;
if (a != null && a.length >= len) {
out = a;
} else {
out = new long[(int) len];
}
int idx = 0;
if (ptr != 0) {
for (long i = startPos; i < endPos; i += step) {
out[idx++] = (long) LargeArrayUtils.UNSAFE.getInt(ptr + this.type.sizeOf() * i);
}
} else if (isConstant) {
for (long i = startPos; i < endPos; i += step) {
out[idx++] = (long) data[0];
}
} else {
for (long i = startPos; i < endPos; i += step) {
out[idx++] = (long) data[(int) i];
}
}
return out;
}
}
@Override
public final float[] getFloatData()
{
if (length > LargeArray.LARGEST_SUBARRAY) return null;
float[] out = new float[(int) length];
if (ptr != 0) {
for (int i = 0; i < length; i++) {
out[i] = (float) LargeArrayUtils.UNSAFE.getInt(ptr + this.type.sizeOf() * i);
}
} else if (isConstant) {
float elem = (float) data[0];
for (int i = 0; i < length; i++) {
out[i] = elem;
}
} else {
for (int i = 0; i < length; i++) {
out[i] = (float) data[i];
}
}
return out;
}
@Override
public final float[] getFloatData(float[] a, long startPos, long endPos, long step)
{
if (startPos < 0 || startPos >= length) {
throw new ArrayIndexOutOfBoundsException("startPos < 0 || startPos >= length");
}
if (endPos < 0 || endPos > length || endPos < startPos) {
throw new ArrayIndexOutOfBoundsException("endPos < 0 || endPos > length || endPos < startPos");
}
if (step < 1) {
throw new IllegalArgumentException("step < 1");
}
long len = (long) FastMath.ceil((endPos - startPos) / (double) step);
if (len > LargeArray.LARGEST_SUBARRAY) {
return null;
} else {
float[] out;
if (a != null && a.length >= len) {
out = a;
} else {
out = new float[(int) len];
}
int idx = 0;
if (ptr != 0) {
for (long i = startPos; i < endPos; i += step) {
out[idx++] = (float) LargeArrayUtils.UNSAFE.getInt(ptr + this.type.sizeOf() * i);
}
} else if (isConstant) {
for (long i = startPos; i < endPos; i += step) {
out[idx++] = (float) data[0];
}
} else {
for (long i = startPos; i < endPos; i += step) {
out[idx++] = (float) data[(int) i];
}
}
return out;
}
}
@Override
public final double[] getDoubleData()
{
if (length > LargeArray.LARGEST_SUBARRAY) return null;
double[] out = new double[(int) length];
if (ptr != 0) {
for (int i = 0; i < length; i++) {
out[i] = (double) LargeArrayUtils.UNSAFE.getInt(ptr + this.type.sizeOf() * i);
}
} else if (isConstant) {
double elem = (double) data[0];
for (int i = 0; i < length; i++) {
out[i] = elem;
}
} else {
for (int i = 0; i < length; i++) {
out[i] = (double) data[i];
}
}
return out;
}
@Override
public final double[] getDoubleData(double[] a, long startPos, long endPos, long step)
{
if (startPos < 0 || startPos >= length) {
throw new ArrayIndexOutOfBoundsException("startPos < 0 || startPos >= length");
}
if (endPos < 0 || endPos > length || endPos < startPos) {
throw new ArrayIndexOutOfBoundsException("endPos < 0 || endPos > length || endPos < startPos");
}
if (step < 1) {
throw new IllegalArgumentException("step < 1");
}
long len = (long) FastMath.ceil((endPos - startPos) / (double) step);
if (len > LargeArray.LARGEST_SUBARRAY) {
return null;
} else {
double[] out;
if (a != null && a.length >= len) {
out = a;
} else {
out = new double[(int) len];
}
int idx = 0;
if (ptr != 0) {
for (long i = startPos; i < endPos; i += step) {
out[idx++] = (double) LargeArrayUtils.UNSAFE.getInt(ptr + this.type.sizeOf() * i);
}
} else if (isConstant) {
for (long i = startPos; i < endPos; i += step) {
out[idx++] = (double) data[0];
}
} else {
for (long i = startPos; i < endPos; i += step) {
out[idx++] = (double) data[(int) i];
}
}
return out;
}
}
@Override
public final void setToNative(long i, Object value)
{
LargeArrayUtils.UNSAFE.putInt(ptr + this.type.sizeOf() * i, (Integer) value);
}
@Override
public final void setBoolean(long i, boolean value)
{
if (ptr != 0) {
LargeArrayUtils.UNSAFE.putInt(ptr + this.type.sizeOf() * i, value == true ? 1 : 0);
} else {
if (isConstant) {
allocateMemory(true, getInt(0), false);
isConstant = false;
setBoolean(i, value);
} else {
data[(int) i] = value == true ? 1 : 0;
}
}
}
@Override
public final void setByte(long i, byte value)
{
if (ptr != 0) {
LargeArrayUtils.UNSAFE.putInt(ptr + this.type.sizeOf() * i, (int) value);
} else {
if (isConstant) {
allocateMemory(true, getInt(0), false);
isConstant = false;
setByte(i, value);
} else {
data[(int) i] = (int) value;
}
}
}
@Override
public final void setUnsignedByte(long i, short value)
{
setShort(i, value);
}
@Override
public final void setShort(long i, short value)
{
if (ptr != 0) {
LargeArrayUtils.UNSAFE.putInt(ptr + this.type.sizeOf() * i, (int) value);
} else {
if (isConstant) {
allocateMemory(true, getInt(0), false);
isConstant = false;
setShort(i, value);
} else {
data[(int) i] = (int) value;
}
}
}
@Override
public final void setInt(long i, int value)
{
if (ptr != 0) {
LargeArrayUtils.UNSAFE.putInt(ptr + this.type.sizeOf() * i, value);
} else {
if (isConstant) {
allocateMemory(true, getInt(0), false);
isConstant = false;
setInt(i, value);
} else {
data[(int) i] = (int) value;
}
}
}
@Override
public final void setLong(long i, long value)
{
if (ptr != 0) {
LargeArrayUtils.UNSAFE.putInt(ptr + this.type.sizeOf() * i, (int) value);
} else {
if (isConstant) {
allocateMemory(true, getInt(0), false);
isConstant = false;
setLong(i, value);
} else {
data[(int) i] = (int) value;
}
}
}
@Override
public final void setFloat(long i, float value)
{
if (ptr != 0) {
LargeArrayUtils.UNSAFE.putInt(ptr + this.type.sizeOf() * i, (int) value);
} else {
if (isConstant) {
allocateMemory(true, getInt(0), false);
isConstant = false;
setFloat(i, value);
} else {
data[(int) i] = (int) value;
}
}
}
@Override
public final void setDouble(long i, double value)
{
if (ptr != 0) {
LargeArrayUtils.UNSAFE.putInt(ptr + this.type.sizeOf() * i, (int) value);
} else {
if (isConstant) {
allocateMemory(true, getInt(0), false);
isConstant = false;
setDouble(i, value);
} else {
data[(int) i] = (int) value;
}
}
}
private void writeObject(java.io.ObjectOutputStream out) throws IOException
{
out.defaultWriteObject();
if (data == null) {
for (long i = 0; i < length; i++) {
out.writeInt(getInt(i));
}
}
}
private void readObject(java.io.ObjectInputStream in) throws IOException, ClassNotFoundException
{
in.defaultReadObject();
if (type != LargeArrayType.INT) {
throw new IllegalArgumentException("Invalid array type");
}
if (length <= 0) {
throw new IllegalArgumentException("Non-positive array length");
}
if (data == null) {
ptr = LargeArrayUtils.UNSAFE.allocateMemory(length * type.sizeOf());
Cleaner.create(this, new Deallocator(ptr, length, type.sizeOf()));
MemoryCounter.increaseCounter(length * type.sizeOf());
for (long i = 0; i < length; i++) {
setInt(i, in.readInt());
}
}
}
private void allocateMemory(boolean initializeMemory, int initValue, boolean createConstant)
{
if (createConstant) {
isConstant = true;
data = new int[]{initValue};
} else {
if (length > getMaxSizeOf32bitArray()) {
ptr = LargeArrayUtils.UNSAFE.allocateMemory(length * type.sizeOf());
if (initializeMemory) {
initializeNativeMemory(length, initValue);
}
Cleaner.create(this, new Deallocator(ptr, length, type.sizeOf()));
MemoryCounter.increaseCounter(length * type.sizeOf());
} else {
data = new int[(int) length];
if (initializeMemory && initValue != 0) {
Arrays.fill(data, initValue);
}
}
}
}
}
Ads help maintain this website.