/*
 * Zorbage: an Algebraic data hierarchy for use in numeric processing.
 *
 * Copyright (C) 2016-2018 Barry DeZonia
 * 
 * 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.
 */
package nom.bdezonia.zorbage.type.storage;

import nom.bdezonia.zorbage.type.algebra.Algebra;

/**
 * 
 * @author Barry DeZonia
 *
 * @param <T>
 * @param <U>
 */
public class PaddedIndexedDataSource<T extends Algebra<T,U>,U>
	implements IndexedDataSource<PaddedIndexedDataSource<T,U>, U>
{
	final private T Algebra;
	final private IndexedDataSource<?,U> storage;
	final private U zero;
	
	public PaddedIndexedDataSource(T Algebra, IndexedDataSource<?,U> storage) {
		this.Algebra = Algebra;
		this.storage = storage;
		this.zero = Algebra.construct();
	}

	@Override
	public PaddedIndexedDataSource<T, U> duplicate() {
		IndexedDataSource<?,U> otherStorage = storage.duplicate();
		return new PaddedIndexedDataSource<T,U>(Algebra, otherStorage);
	}

	@Override
	public void set(long index, U value) {
		if (index < 0 || index >= storage.size()) {
			if (Algebra.isNotEqual().call(zero, value))
				throw new IllegalArgumentException("Cannot set out of bounds value as nonzero");
		}
		else {
			storage.set(index, value);
		}
	}

	@Override
	public void get(long index, U value) {
		if (index < 0 || index >= storage.size()) {
			Algebra.assign().call(zero, value);
		}
		else {
			storage.get(index, value);
		}
	}

	@Override
	public long size() {
		return storage.size();
	}
}

@@ -1732,17 +1732,17 @@
 ivate T 
-A
+a
 lgebra;%0A
@@ -1847,17 +1847,17 @@
 ource(T 
-A
+a
 lgebra, 
@@ -1897,17 +1897,17 @@
 %0A%09%09this.
-A
+a
 lgebra =
@@ -1907,17 +1907,17 @@
 gebra = 
-A
+a
 lgebra;%0A
@@ -1956,17 +1956,17 @@
 .zero = 
-A
+a
 lgebra.c
@@ -2050,66 +2050,23 @@
 %7B%0A%09%09
-IndexedDataSource%3C?,U%3E otherStorage = storage.duplicate();
+// shallow copy
 %0A%09%09r
@@ -2108,17 +2108,17 @@
 ,U%3E(
-A
+a
 lgebra, 
 othe
@@ -2117,14 +2117,9 @@
 ra, 
-otherS
+s
 tora
@@ -2231,17 +2231,17 @@
 %0A%09%09%09if (
-A
+a
 lgebra.i
@@ -2507,17 +2507,17 @@
 )) %7B%0A%09%09%09
-A
+a
 lgebra.a

Make sure paddedstorage class does a shallow copy of data