/*
 * 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.type.algebra.Addition;
import nom.bdezonia.zorbage.type.algebra.Algebra;
import nom.bdezonia.zorbage.type.algebra.Invertible;
import nom.bdezonia.zorbage.type.algebra.Multiplication;
import nom.bdezonia.zorbage.type.algebra.Ordered;
import nom.bdezonia.zorbage.type.algebra.Unity;
import nom.bdezonia.zorbage.type.storage.datasource.IndexedDataSource;

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

	private Variance() {}
	
	/**
	 * 
	 * @param alg
	 * @param storage
	 * @param result
	 */
	public static <T extends Algebra<T,U> & Addition<U> & Multiplication<U> & Unity<U> &
								Invertible<U> & Ordered<U>, U>
		void compute(T alg, IndexedDataSource<U> storage, U result)
	{
		long storageSize = storage.size();
		if (storageSize == 0 || storageSize == 1) {
			alg.zero().call(result);
			return;
		}
		U avg = alg.construct();
		U sum = alg.construct();
		U count = alg.construct();
		U one = alg.construct();
		alg.unity().call(one);
		Mean.compute(alg, storage, avg);
		SumSquareCount.compute(alg, storage, avg, sum, count);
		if (alg.isZero().equals(count)) {
			alg.zero().call(result);
		}
		else {
			alg.subtract().call(count, one, count);
			alg.divide().call(sum, count, result);
		}
	}
}

@@ -2550,86 +2550,8 @@
 t);%0A
-%09%09if (alg.isZero().equals(count)) %7B%0A%09%09%09alg.zero().call(result);%0A%09%09%7D%0A%09%09else %7B%0A%09
 %09%09al
@@ -2590,17 +2590,16 @@
 unt);%0A%09%09
-%09
 alg.divi
@@ -2629,17 +2629,13 @@
 esult);%0A
-%09%09%7D%0A
 %09%7D%0A%7D%0A

Undo my last changes: they were unnecessary.