org.scijava.util.LongArray Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of scijava-common Show documentation
Show all versions of scijava-common Show documentation
SciJava Common is a shared library for SciJava software. It provides a plugin framework, with an extensible mechanism for service discovery, backed by its own annotation processor, so that plugins can be loaded dynamically. It is used by downstream projects in the SciJava ecosystem, such as ImageJ and SCIFIO.
/*
* #%L
* SciJava Common shared library for SciJava software.
* %%
* Copyright (C) 2009 - 2017 Board of Regents of the University of
* Wisconsin-Madison, Broad Institute of MIT and Harvard, and Max Planck
* Institute of Molecular Cell Biology and Genetics.
* %%
* 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 HOLDERS 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.
* #L%
*/
package org.scijava.util;
import java.util.Collection;
/**
* An extensible array of {@code long} elements.
*
* @author Johannes Schindelin
* @author Curtis Rueden
*/
public class LongArray extends AbstractPrimitiveArray {
/** The backing array. */
private long[] array;
/**
* Constructs an extensible array of longs, backed by a fixed-size array.
*/
public LongArray() {
super(Long.TYPE);
}
/**
* Constructs an extensible array of longs, backed by a fixed-size array.
*
* @param size the initial size
*/
public LongArray(final int size) {
super(Long.TYPE, size);
}
/**
* Constructs an extensible array of longs, backed by the given fixed-size
* array.
*
* @param array the array to wrap
*/
public LongArray(final long[] array) {
super(Long.TYPE, array);
}
// -- LongArray methods --
public void addValue(final long value) {
addValue(size(), value);
}
public boolean removeValue(final long value) {
final int index = indexOf(value);
if (index < 0) return false;
delete(index, 1);
return true;
}
public long getValue(final int index) {
checkBounds(index);
return array[index];
}
public long setValue(final int index, final long value) {
checkBounds(index);
final long oldValue = getValue(index);
array[index] = value;
return oldValue;
}
public void addValue(final int index, final long value) {
insert(index, 1);
array[index] = value;
}
public int indexOf(final long value) {
for (int i = 0; i < size(); i++) {
if (array[i] == value) return i;
}
return -1;
}
public int lastIndexOf(final long value) {
for (int i = size() - 1; i >= 0; i--) {
if (array[i] == value) return i;
}
return -1;
}
public boolean contains(final long value) {
return indexOf(value) >= 0;
}
// -- PrimitiveArray methods --
@Override
public long[] getArray() {
return array;
}
@Override
public void setArray(final long[] array) {
if (array.length < size()) {
throw new IllegalArgumentException("Array too small");
}
this.array = array;
}
// -- List methods --
@Override
public Long get(final int index) {
return getValue(index);
}
@Override
public Long set(final int index, final Long element) {
return setValue(index, element == null ? defaultValue() : element);
}
@Override
public void add(final int index, final Long element) {
addValue(index, element);
}
// NB: Overridden for performance.
@Override
public int indexOf(final Object o) {
if (!(o instanceof Long)) return -1;
final long value = (Long) o;
return indexOf(value);
}
// NB: Overridden for performance.
@Override
public int lastIndexOf(final Object o) {
if (!(o instanceof Long)) return -1;
final long value = (Long) o;
return lastIndexOf(value);
}
// -- Collection methods --
// NB: Overridden for performance.
@Override
public boolean contains(final Object o) {
if (!(o instanceof Long)) return false;
final long value = (Long) o;
return contains(value);
}
// NB: Overridden for performance.
@Override
public boolean remove(final Object o) {
if (!(o instanceof Long)) return false;
final long value = (Long) o;
return removeValue(value);
}
// NB: Overridden for performance.
@Override
public boolean containsAll(final Collection c) {
for (final Object o : c) {
if (!(o instanceof Long)) return false;
final long value = (Long) o;
if (indexOf(value) < 0) return false;
}
return true;
}
// NB: Overridden for performance.
@Override
public boolean addAll(final int index, final Collection c) {
if (c.size() == 0) return false;
insert(index, c.size());
int i = index;
for (final long e : c) {
setValue(i++, e);
}
return true;
}
// NB: Overridden for performance.
@Override
public boolean removeAll(final Collection c) {
boolean changed = false;
for (final Object o : c) {
if (!(o instanceof Long)) continue;
final long value = (Long) o;
final boolean result = removeValue(value);
if (result) changed = true;
}
return changed;
}
@Override
public Long defaultValue() {
return 0L;
}
}