All Downloads are FREE. Search and download functionalities are using the official Maven repository.

pl.edu.icm.jlargearrays.UnsignedByteLargeArray Maven / Gradle / Ivy

There is a newer version: 1.6
Show newest version
/* ***** 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 sun.misc.Cleaner;
import org.apache.commons.math3.util.FastMath;

/**
 *
 * An array of unsigned bytes [0, 255] that can store up to 263 elements.
 *
 * @author Piotr Wendykier ([email protected])
 */
public class UnsignedByteLargeArray extends LargeArray
{

    private static final long serialVersionUID = 3135411647495793832L;
    private byte[] data;

    /**
     * Creates new instance of this class.
     *
     * @param length number of elements
     */
    public UnsignedByteLargeArray(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 UnsignedByteLargeArray(long length, boolean zeroNativeMemory)
    {
        this.type = LargeArrayType.UNSIGNED_BYTE;
        this.sizeof = 1;
        if (length <= 0) {
            throw new IllegalArgumentException(length + " is not a positive long value");
        }
        this.length = length;
        if (length > getMaxSizeOf32bitArray()) {
            this.ptr = LargeArrayUtils.UNSAFE.allocateMemory(this.length * this.sizeof);
            if (zeroNativeMemory) {
                zeroNativeMemory(length);
            }
            Cleaner.create(this, new Deallocator(this.ptr, this.length, this.sizeof));
            MemoryCounter.increaseCounter(this.length * this.sizeof);
        } else {
            data = new byte[(int) length];
        }
    }

    /**
     * Creates a constant array.
     * 

* @param length number of elements * @param constantValue value */ public UnsignedByteLargeArray(long length, short constantValue) { this.type = LargeArrayType.UNSIGNED_BYTE; this.sizeof = 1; if (length <= 0) { throw new IllegalArgumentException(length + " is not a positive long value"); } this.length = length; this.isConstant = true; if (constantValue < 0 || constantValue > 255) { throw new IllegalArgumentException("The value cannot be smaller than 0 or greater than 255"); } this.data = new byte[]{(byte) constantValue}; } /** * Creates new instance of this class. * * @param data data array, this reference is used internally. */ public UnsignedByteLargeArray(byte[] data) { this.type = LargeArrayType.UNSIGNED_BYTE; this.sizeof = 1; this.length = data.length; this.data = data; } /** * Creates new instance of this class. * * @param data data array, this reference is not used internally. */ public UnsignedByteLargeArray(short[] data) { this.type = LargeArrayType.UNSIGNED_BYTE; this.sizeof = 1; this.length = data.length; this.data = new byte[data.length]; for (int i = 0; i < this.length; i++) { short elem = data[i]; if (elem < 0 || elem > 255) { throw new IllegalArgumentException("The value cannot be smaller than 0 or greater than 255"); } this.data[i] = (byte) elem; } } /** * Returns a deep copy of this instance. (The elements themselves are copied.) * * @return a clone of this instance */ @Override public UnsignedByteLargeArray clone() { if (isConstant) { return new UnsignedByteLargeArray(length, getByte(0)); } else { UnsignedByteLargeArray v = new UnsignedByteLargeArray(length, false); LargeArrayUtils.arraycopy(this, 0, v, 0, length); return v; } } @Override public boolean equals(Object o) { if (super.equals(o)) { UnsignedByteLargeArray la = (UnsignedByteLargeArray) o; return this.data == la.data; } return false; } @Override public int hashCode() { return 29 * super.hashCode() + (this.data != null ? this.data.hashCode() : 0); } @Override public final Short get(long i) { return getUnsignedByte(i); } @Override public final Byte getFromNative(long i) { return LargeArrayUtils.UNSAFE.getByte(ptr + i); } @Override public final boolean getBoolean(long i) { if (ptr != 0) { return (LargeArrayUtils.UNSAFE.getByte(ptr + 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 LargeArrayUtils.UNSAFE.getByte(ptr + i); } else if (isConstant) { return data[0]; } else { return data[(int) i]; } } @Override public final short getUnsignedByte(long i) { if (ptr != 0) { return (short) (0xFF & LargeArrayUtils.UNSAFE.getByte(ptr + i)); } else if (isConstant) { return (short) (0xFF & data[0]); } else { return (short) (0xFF & data[(int) i]); } } @Override public final short getShort(long i) { return getUnsignedByte(i); } @Override public final int getInt(long i) { if (ptr != 0) { return (int) (0xFF & LargeArrayUtils.UNSAFE.getByte(ptr + i)); } else if (isConstant) { return (int) (0xFF & data[0]); } else { return (int) (0xFF & data[(int) i]); } } @Override public final long getLong(long i) { if (ptr != 0) { return (long) (0xFF & LargeArrayUtils.UNSAFE.getByte(ptr + i)); } else if (isConstant) { return (long) (0xFF & data[0]); } else { return (long) (0xFF & data[(int) i]); } } @Override public final float getFloat(long i) { if (ptr != 0) { return (float) (0xFF & LargeArrayUtils.UNSAFE.getByte(ptr + i)); } else if (isConstant) { return (float) (0xFF & data[0]); } else { return (float) (0xFF & data[(int) i]); } } @Override public final double getDouble(long i) { if (ptr != 0) { return (double) (0xFF & LargeArrayUtils.UNSAFE.getByte(ptr + i)); } else if (isConstant) { return (double) (0xFF & data[0]); } else { return (double) (0xFF & data[(int) i]); } } @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) { byte v = LargeArrayUtils.UNSAFE.getByte(ptr + i); out[idx++] = v != 0; } } else if (isConstant) { boolean elem = data[0] != 0; for (long i = startPos; i < endPos; i += step) { out[idx++] = elem; } } else { for (long i = startPos; i < endPos; i += step) { byte v = data[(int) i]; out[idx++] = v != 0; } } return out; } } @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++) { byte v = LargeArrayUtils.UNSAFE.getByte(ptr + 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 byte[] getData() { return data; } @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] = LargeArrayUtils.UNSAFE.getByte(ptr + i); } } else if (isConstant) { byte 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 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++] = LargeArrayUtils.UNSAFE.getByte(ptr + 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 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] = LargeArrayUtils.UNSAFE.getByte(ptr + i); } } else if (isConstant) { short elem = data[0]; for (int i = 0; i < length; i++) { out[i] = elem; } } else { for (int i = 0; i < length; i++) { out[i] = 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) (0xFF & LargeArrayUtils.UNSAFE.getByte(ptr + i)); } } else if (isConstant) { for (long i = startPos; i < endPos; i += step) { out[idx++] = (short) (0xFF & data[0]); } } else { for (long i = startPos; i < endPos; i += step) { out[idx++] = (short) (0xFF & 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.getByte(ptr + i); } } else if (isConstant) { byte elem = data[0]; for (int i = 0; i < length; i++) { out[i] = elem; } } else { for (int i = 0; i < length; i++) { out[i] = data[i]; } } 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++] = (int) (0xFF & LargeArrayUtils.UNSAFE.getByte(ptr + i)); } } else if (isConstant) { for (long i = startPos; i < endPos; i += step) { out[idx++] = (int) (0xFF & data[0]); } } else { for (long i = startPos; i < endPos; i += step) { out[idx++] = (int) (0xFF & 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] = LargeArrayUtils.UNSAFE.getByte(ptr + i); } } else if (isConstant) { byte elem = data[0]; for (int i = 0; i < length; i++) { out[i] = elem; } } else { for (int i = 0; i < length; i++) { out[i] = 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) (0xFF & LargeArrayUtils.UNSAFE.getByte(ptr + i)); } } else if (isConstant) { for (long i = startPos; i < endPos; i += step) { out[idx++] = (long) (0xFF & data[0]); } } else { for (long i = startPos; i < endPos; i += step) { out[idx++] = (long) (0xFF & 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] = LargeArrayUtils.UNSAFE.getByte(ptr + i); } } else if (isConstant) { byte elem = data[0]; for (int i = 0; i < length; i++) { out[i] = elem; } } else { for (int i = 0; i < length; i++) { out[i] = 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) (0xFF & LargeArrayUtils.UNSAFE.getByte(ptr + i)); } } else if (isConstant) { for (long i = startPos; i < endPos; i += step) { out[idx++] = (float) (0xFF & data[0]); } } else { for (long i = startPos; i < endPos; i += step) { out[idx++] = (float) (0xFF & 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] = LargeArrayUtils.UNSAFE.getByte(ptr + i); } } else if (isConstant) { byte elem = data[0]; for (int i = 0; i < length; i++) { out[i] = elem; } } else { for (int i = 0; i < length; i++) { out[i] = 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) (0xFF & LargeArrayUtils.UNSAFE.getByte(ptr + i)); } } else if (isConstant) { for (long i = startPos; i < endPos; i += step) { out[idx++] = (double) (0xFF & data[0]); } } else { for (long i = startPos; i < endPos; i += step) { out[idx++] = (double) (0xFF & data[(int) i]); } } return out; } } @Override public final void setToNative(long i, Object value) { LargeArrayUtils.UNSAFE.putByte(ptr + i, (Byte) value); } @Override public final void setBoolean(long i, boolean value) { if (ptr != 0) { LargeArrayUtils.UNSAFE.putByte(ptr + i, value == true ? (byte) 1 : (byte) 0); } else { if (isConstant) { throw new IllegalAccessError("Constant arrays cannot be modified."); } data[(int) i] = value == true ? (byte) 1 : (byte) 0; } } @Override public final void setByte(long i, byte value) { if (ptr != 0) { LargeArrayUtils.UNSAFE.putByte(ptr + i, value); } else { if (isConstant) { throw new IllegalAccessError("Constant arrays cannot be modified."); } data[(int) i] = value; } } @Override public final void setUnsignedByte(long i, short value) { if (value < 0 || value > 255) { throw new IllegalArgumentException("The value cannot be smaller than 0 or greater than 255"); } if (ptr != 0) { LargeArrayUtils.UNSAFE.putByte(ptr + i, (byte) value); } else { if (isConstant) { throw new IllegalAccessError("Constant arrays cannot be modified."); } data[(int) i] = (byte) value; } } @Override public final void setShort(long i, short value) { if (ptr != 0) { LargeArrayUtils.UNSAFE.putByte(ptr + i, (byte) (0xFF & value)); } else { if (isConstant) { throw new IllegalAccessError("Constant arrays cannot be modified."); } data[(int) i] = (byte) (0xFF & value); } } @Override public final void setInt(long i, int value) { if (ptr != 0) { LargeArrayUtils.UNSAFE.putByte(ptr + i, (byte) (0xFF & value)); } else { if (isConstant) { throw new IllegalAccessError("Constant arrays cannot be modified."); } data[(int) i] = (byte) (0xFF & value); } } @Override public final void setLong(long i, long value) { if (ptr != 0) { LargeArrayUtils.UNSAFE.putByte(ptr + i, (byte) (0xFF & value)); } else { if (isConstant) { throw new IllegalAccessError("Constant arrays cannot be modified."); } data[(int) i] = (byte) (0xFF & value); } } @Override public final void setFloat(long i, float value) { if (ptr != 0) { LargeArrayUtils.UNSAFE.putByte(ptr + i, (byte) (0xFF & (int) value)); } else { if (isConstant) { throw new IllegalAccessError("Constant arrays cannot be modified."); } data[(int) i] = (byte) (0xFF & (int) value); } } @Override public final void setDouble(long i, double value) { if (ptr != 0) { LargeArrayUtils.UNSAFE.putByte(ptr + i, (byte) (0xFF & (long) value)); } else { if (isConstant) { throw new IllegalAccessError("Constant arrays cannot be modified."); } data[(int) i] = (byte) (0xFF & (long) value); } } }





© 2015 - 2024 Weber Informatics LLC | Privacy Policy