/*
 * Zorbage: an algebraic data hierarchy for use in numeric processing.
 *
 * Copyright (C) 2016-2020 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.datasource;

import nom.bdezonia.zorbage.misc.BigList;
import nom.bdezonia.zorbage.type.algebra.Algebra;
import nom.bdezonia.zorbage.type.ctor.StorageConstruction;

/**
 * 
 * @author Barry DeZonia
 *
 */
public class BigListDataSource<T extends Algebra<T,U>,U>
	implements IndexedDataSource<U>
{
	public static long MAX_ITEMS = BigList.MAX_ITEMS;
	
	private final T algebra;
	private final long size;
	private final BigList<U> data;
	
	public BigListDataSource(T algebra, long numItems) {
		this.algebra = algebra;
		this.size = numItems;
		this.data = new BigList<U>(numItems);
		for (long i = 0; i < numItems; i++) {
			this.data.set(i, algebra.construct());
		}
	}

	@Override
	public BigListDataSource<T,U> duplicate() {
		BigListDataSource<T,U> ds = new BigListDataSource<T,U>(algebra, size);
		for (long i = 0; i < size; i++) {
			U v = this.data.get(i);
			ds.set(i, v);
		}
		return ds;
	}

	@Override
	public void set(long index, U value) {
		U v = data.get(index);
		algebra.assign().call(value, v);
	}

	@Override
	public void get(long index, U value) {
		U v = data.get(index);
		algebra.assign().call(v, value);
	}

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

	@Override
	public StorageConstruction storageType() {
		return StorageConstruction.MEM_ARRAY;
	}
}

@@ -1833,34 +1833,8 @@
 ra;%0A
-%09private final long size;%0A
 %09pri
@@ -1947,32 +1947,8 @@
 ra;%0A
-%09%09this.size = numItems;%0A
 %09%09th
@@ -2069,35 +2069,24 @@
 ));%0A%09%09%7D%0A%09%7D%0A%0A
-%09@Override%0A
 %09public BigL
@@ -2102,196 +2102,205 @@
 urce
-%3CT,U%3E duplicate() %7B%0A%09%09BigListDataSource%3CT,U%3E ds = new BigListDataSource%3CT,U%3E(algebra, size);%0A%09%09for (long i = 0; i %3C size; i++) %7B%0A%09%09%09U v = this.data.get(i);%0A%09%09%09ds.set(i, v);%0A%09%09%7D%0A%09%09return ds
+(T alg, BigList%3CU%3E list) %7B%0A%09%09this.algebra = alg;%0A%09%09this.data = list;%0A%09%7D%0A%0A%09@Override%0A%09public BigListDataSource%3CT,U%3E duplicate() %7B%0A%09%09// shallow copy%0A%09%09return new BigListDataSource%3CT,U%3E(algebra, data)
 ;%0A%09%7D
@@ -2573,20 +2573,27 @@
 %09return 
+data.
 size
+()
 ;%0A%09%7D%0A%0A%09@

Reorganize BigListDataSource: shallow copies, don't cache size