Add fill methods to columns

Author: awalter17

src/main/java/net/imagej/table/BoolColumn.java

@@ -35,7 +35,7 @@
 
 /**
  * Efficient implementation of {@link Column} for {@code boolean} primitives.
- * 
+ *
  * @author Alison Walter
  */
 public class BoolColumn extends BoolArray implements Column<Boolean> {
@@ -66,4 +66,31 @@ public Class<Boolean> getType() {
 		return Boolean.class;
 	}
 
+	@Override
+	public void fill(final Boolean[] values) {
+		final boolean[] prim = toPrimitive(values);
+		this.setArray(prim);
+	}
+
+	@Override
+	public void fill(final Boolean[] values, final int offset) {
+		final boolean[] prim = toPrimitive(values);
+
+		// Check if array has been initialized
+		if (this.getArray() == null) this.setArray(prim);
+		else {
+			System.arraycopy(prim, 0, this.getArray(), offset, prim.length);
+		}
+	}
+
+	// -- Helper methods --
+
+	private boolean[] toPrimitive(final Boolean[] values) {
+		final boolean[] prim = new boolean[values.length];
+		for (int i = 0; i < prim.length; i++) {
+			prim[i] = values[i].booleanValue();
+		}
+		return prim;
+	}
+
 }

src/main/java/net/imagej/table/ByteColumn.java

@@ -35,7 +35,7 @@
 
 /**
  * Efficient implementation of {@link Column} for {@code byte} primitives.
- * 
+ *
  * @author Alison Walter
  */
 public class ByteColumn extends ByteArray implements Column<Byte> {
@@ -66,4 +66,31 @@ public Class<Byte> getType() {
 		return Byte.class;
 	}
 
+	@Override
+	public void fill(final Byte[] values) {
+		final byte[] prim = toPrimitive(values);
+		this.setArray(prim);
+	}
+
+	@Override
+	public void fill(final Byte[] values, final int offset) {
+		final byte[] prim = toPrimitive(values);
+
+		// Check if array has been initialized
+		if (this.getArray() == null) this.setArray(prim);
+		else {
+			System.arraycopy(prim, 0, this.getArray(), offset, prim.length);
+		}
+	}
+
+	// -- Helper methods --
+
+	private byte[] toPrimitive(final Byte[] values) {
+		final byte[] prim = new byte[values.length];
+		for (int i = 0; i < prim.length; i++) {
+			prim[i] = values[i].byteValue();
+		}
+		return prim;
+	}
+
 }

src/main/java/net/imagej/table/CharColumn.java

@@ -35,7 +35,7 @@
 
 /**
  * Efficient implementation of {@link Column} for {@code char} primitives.
- * 
+ *
  * @author Alison Walter
  */
 public class CharColumn extends CharArray implements Column<Character> {
@@ -66,4 +66,31 @@ public Class<Character> getType() {
 		return Character.class;
 	}
 
+	@Override
+	public void fill(final Character[] values) {
+		final char[] prim = toPrimitive(values);
+		this.setArray(prim);
+	}
+
+	@Override
+	public void fill(final Character[] values, final int offset) {
+		final char[] prim = toPrimitive(values);
+
+		// Check if array has been initialized
+		if (this.getArray() == null) this.setArray(prim);
+		else {
+			System.arraycopy(prim, 0, this.getArray(), offset, prim.length);
+		}
+	}
+
+	// -- Helper methods --
+
+	private char[] toPrimitive(final Character[] values) {
+		final char[] prim = new char[values.length];
+		for (int i = 0; i < prim.length; i++) {
+			prim[i] = values[i].charValue();
+		}
+		return prim;
+	}
+
 }

src/main/java/net/imagej/table/Column.java

@@ -37,7 +37,7 @@
 
 /**
  * A column of data of a {@link Table}.
- * 
+ *
  * @author Curtis Rueden
  * @param <T> The type of data stored in the table.
  */
@@ -59,4 +59,11 @@ public interface Column<T> extends List<T>, Sizable {
 
 	/** Returns the actual type of data stored in the column. */
 	Class<T> getType();
+
+	/** Fills the column with the values in the given array. */
+	void fill(T[] values);
+
+	/** Fills the column with the values in the given array. */
+	void fill(T[] values, int offset);
+
 }

src/main/java/net/imagej/table/DefaultColumn.java

@@ -71,4 +71,14 @@ public Class<T> getType() {
 		return type;
 	}
 
+	@Override
+	public void fill(final T[] values) {
+		fill(values, 0);
+	}
+
+	@Override
+	public void fill(final T[] values, final int offset) {
+		System.arraycopy(values, 0, this.toArray(), 0, values.length);
+	}
+
 }

src/main/java/net/imagej/table/DoubleColumn.java

@@ -35,7 +35,7 @@
 
 /**
  * Efficient implementation of {@link Column} for {@code double} primitives.
- * 
+ *
  * @author Curtis Rueden
  */
 public class DoubleColumn extends DoubleArray implements Column<Double> {
@@ -66,4 +66,31 @@ public Class<Double> getType() {
 		return Double.class;
 	}
 
+	@Override
+	public void fill(final Double[] values) {
+		final double[] prim = toPrimitive(values);
+		this.setArray(prim);
+	}
+
+	@Override
+	public void fill(final Double[] values, final int offset) {
+		final double[] prim = toPrimitive(values);
+
+		// Check if array has been initialized
+		if (this.getArray() == null) this.setArray(prim);
+		else {
+			System.arraycopy(prim, 0, this.getArray(), offset, prim.length);
+		}
+	}
+
+	// -- Helper methods --
+
+	private double[] toPrimitive(final Double[] values) {
+		final double[] prim = new double[values.length];
+		for (int i = 0; i < prim.length; i++) {
+			prim[i] = values[i].doubleValue();
+		}
+		return prim;
+	}
+
 }

src/main/java/net/imagej/table/FloatColumn.java

@@ -35,7 +35,7 @@
 
 /**
  * Efficient implementation of {@link Column} for {@code float} primitives.
- * 
+ *
  * @author Alison Walter
  */
 public class FloatColumn extends FloatArray implements Column<Float> {
@@ -66,4 +66,31 @@ public Class<Float> getType() {
 		return Float.class;
 	}
 
+	@Override
+	public void fill(final Float[] values) {
+		final float[] prim = toPrimitive(values);
+		this.setArray(prim);
+	}
+
+	@Override
+	public void fill(final Float[] values, final int offset) {
+		final float[] prim = toPrimitive(values);
+
+		// Check if array has been initialized
+		if (this.getArray() == null) this.setArray(prim);
+		else {
+			System.arraycopy(prim, 0, this.getArray(), offset, prim.length);
+		}
+	}
+
+	// -- Helper methods --
+
+	private float[] toPrimitive(final Float[] values) {
+		final float[] prim = new float[values.length];
+		for (int i = 0; i < prim.length; i++) {
+			prim[i] = values[i].floatValue();
+		}
+		return prim;
+	}
+
 }

src/main/java/net/imagej/table/IntColumn.java

@@ -35,7 +35,7 @@
 
 /**
  * Efficient implementation of {@link Column} for {@code int} primitives.
- * 
+ *
  * @author Alison Walter
  */
 public class IntColumn extends IntArray implements Column<Integer> {
@@ -66,4 +66,31 @@ public Class<Integer> getType() {
 		return Integer.class;
 	}
 
+	@Override
+	public void fill(final Integer[] values) {
+		final int[] prim = toPrimitive(values);
+		this.setArray(prim);
+	}
+
+	@Override
+	public void fill(final Integer[] values, final int offset) {
+		final int[] prim = toPrimitive(values);
+
+		// Check if array has been initialized
+		if (this.getArray() == null) this.setArray(prim);
+		else {
+			System.arraycopy(prim, 0, this.getArray(), offset, prim.length);
+		}
+	}
+
+	// -- Helper methods --
+
+	private int[] toPrimitive(final Integer[] values) {
+		final int[] prim = new int[values.length];
+		for (int i = 0; i < prim.length; i++) {
+			prim[i] = values[i].intValue();
+		}
+		return prim;
+	}
+
 }

src/main/java/net/imagej/table/LongColumn.java

@@ -35,7 +35,7 @@
 
 /**
  * Efficient implementation of {@link Column} for {@code long} primitives.
- * 
+ *
  * @author Alison Walter
  */
 public class LongColumn extends LongArray implements Column<Long> {
@@ -66,4 +66,31 @@ public Class<Long> getType() {
 		return Long.class;
 	}
 
+	@Override
+	public void fill(final Long[] values) {
+		final long[] prim = toPrimitive(values);
+		this.setArray(prim);
+	}
+
+	@Override
+	public void fill(final Long[] values, final int offset) {
+		final long[] prim = toPrimitive(values);
+
+		// Check if array has been initialized
+		if (this.getArray() == null) this.setArray(prim);
+		else {
+			System.arraycopy(prim, 0, this.getArray(), offset, prim.length);
+		}
+	}
+
+	// -- Helper methods --
+
+	private long[] toPrimitive(final Long[] values) {
+		final long[] prim = new long[values.length];
+		for (int i = 0; i < prim.length; i++) {
+			prim[i] = values[i].longValue();
+		}
+		return prim;
+	}
+
 }

src/main/java/net/imagej/table/ShortColumn.java

@@ -35,7 +35,7 @@
 
 /**
  * Efficient implementation of {@link Column} for {@code short} primitives.
- * 
+ *
  * @author Alison Walter
  */
 public class ShortColumn extends ShortArray implements Column<Short> {
@@ -66,4 +66,31 @@ public Class<Short> getType() {
 		return Short.class;
 	}
 
+	@Override
+	public void fill(final Short[] values) {
+		final short[] prim = toPrimitive(values);
+		this.setArray(prim);
+	}
+
+	@Override
+	public void fill(final Short[] values, final int offset) {
+		final short[] prim = toPrimitive(values);
+
+		// Check if array has been initialized
+		if (this.getArray() == null) this.setArray(prim);
+		else {
+			System.arraycopy(prim, 0, this.getArray(), offset, prim.length);
+		}
+	}
+
+	// -- Helper methods --
+
+	private short[] toPrimitive(final Short[] values) {
+		final short[] prim = new short[values.length];
+		for (int i = 0; i < prim.length; i++) {
+			prim[i] = values[i].shortValue();
+		}
+		return prim;
+	}
+
 }