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

import nom.bdezonia.zorbage.procedure.Procedure1;
import nom.bdezonia.zorbage.type.algebra.Algebra;
import nom.bdezonia.zorbage.type.storage.IndexedDataSource;

/**
 * 
 * @author Barry DeZonia
 *
 */
public class Fill {

	// do not instantiate
	
	private Fill() {}
	
	/**
	 * 
	 * @param algebra
	 * @param storage
	 * @param value
	 */
	public static <T extends Algebra<T,U>,U>
		void compute(T algebra, U value, IndexedDataSource<U> storage)
	{
		long size = storage.size();
		for (long i = 0; i < size; i++) {
			storage.set(i, value);
		}
	}
	
	/**
	 * 
	 * @param algebra
	 * @param storage
	 * @param proc
	 */
	public static <T extends Algebra<T,U>,U>
		void compute(T algebra, Procedure1<U> proc, IndexedDataSource<U> storage)
	{
		U tmp = algebra.construct();
		long size = storage.size();
		for (long i = 0; i < size; i++) {
			proc.call(tmp);
			storage.set(i, tmp);
		}
	}

}

@@ -2210,149 +2210,58 @@
 %7B%0A%09%09
-U tmp = algebra.construct();%0A%09%09long size = storage.size();%0A%09%09for (long i = 0; i %3C size; i++) %7B%0A%09%09%09proc.call(tmp);%0A%09%09%09storage.set(i, tmp);%0A%09%09%7D
+InplaceTransform1.compute(algebra, proc, storage);
 %0A%09%7D%0A

Eat my own dog food in the Fill algorithm