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

uk.ac.rdg.resc.edal.util.RLongArray Maven / Gradle / Ivy

The newest version!
/*******************************************************************************
 * Copyright (c) 2011 The University of Reading
 * 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.
 * 3. Neither the name of the University of Reading, nor the names of the
 *    authors or contributors may be used to endorse or promote products
 *    derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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.
 *******************************************************************************/

package uk.ac.rdg.resc.edal.util;

/**
 * 

* A resizeable array of signed long integers. Data are stored in an array of * primitive longs. *

*

* Instances of this class are not thread safe. *

* * @author Jon Blower */ public final class RLongArray extends RArray { /** The maximum value that can be stored in this array */ public static final long MAX_VALUE = Long.MAX_VALUE; /** The minimum value that can be stored in this array */ public static final long MIN_VALUE = Long.MIN_VALUE; /** * Creates an array in which the initial capacity is set the same as the * chunk size. */ public RLongArray(int chunkSize) { this(chunkSize, chunkSize); } /** * Creates an array with the given initial capacity and chunk size. * * @param initialCapacity * The number of elements in the storage array * @param chunkSize * The number of storage elements that will be added each time * the storage array grows. */ public RLongArray(int initialCapacity, int chunkSize) { super(initialCapacity, chunkSize); } @Override protected long[] makeStorage(int capacity) { return new long[capacity]; } /** * Returns the ith element of the array. * * @param i * The index of the element to return. * @return the ith element of the array. * @throws ArrayIndexOutOfBoundsException * if {@code i >= size()} */ @Override public long getLong(int i) { return this.getStorage()[i]; } @Override public int getInt(int i) { long val = getLong(i); if (val > Integer.MAX_VALUE || val < Integer.MIN_VALUE) { throw new ArithmeticException(val + " cannot be represented as a 4-byte integer"); } return (int) val; } private long[] getStorage() { return (long[]) this.storage; } @Override protected int getStorageLength() { return this.getStorage().length; } @Override protected void setElement(int index, long value) { this.getStorage()[index] = value; } @Override public void swapElements(int i1, int i2) { long[] arr = this.getStorage(); long temp = arr[i1]; arr[i1] = arr[i2]; arr[i2] = temp; } @Override protected long getMinValue() { return MIN_VALUE; } @Override protected long getMaxValue() { return MAX_VALUE; } }




© 2015 - 2025 Weber Informatics LLC | Privacy Policy