/*
 * 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.algorithm;

import nom.bdezonia.zorbage.type.algebra.Addition;
import nom.bdezonia.zorbage.type.algebra.Group;
import nom.bdezonia.zorbage.type.algebra.Unity;
import nom.bdezonia.zorbage.type.storage.IndexedDataSource;

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

	private Count() {}

	/**
	 * 
	 * @param group
	 * @param addGroup
	 * @param a
	 * @param value
	 * @param sum
	 */
	public static <T extends Group<T,U>, U, V extends Group<V,W> & Addition<W> & Unity<W>, W>
		void compute(T group, V addGroup, U value, IndexedDataSource<?,U> a, W sum)
	{
		compute(group, addGroup, value, 0, a.size(), a, sum);
	}
	
	/**
	 * 
	 * @param group
	 * @param addGroup
	 * @param a
	 * @param start
	 * @param count
	 * @param value
	 * @param sum
	 */
	public static <T extends Group<T,U>, U, V extends Group<V,W> & Addition<W> & Unity<W>, W>
		void compute(T group, V addGroup, U value, long start, long count, IndexedDataSource<?,U> a, W sum)
	{
		U tmp = group.construct();
		W tmpSum = addGroup.construct();
		W one = addGroup.construct();
		addGroup.unity().call(one);
		for (long i = 0; i < count; i++) {
			a.get(start+i, tmp);
			if (group.isEqual().call(tmp, value))
				addGroup.add().call(tmpSum, one, tmpSum);
		}
		addGroup.assign().call(tmpSum, sum);
	}

}

@@ -1465,16 +1465,69 @@
 rithm;%0A%0A
+import nom.bdezonia.zorbage.condition.EqualConstant;%0A
 import n
@@ -2472,315 +2472,130 @@
 %7B%0A%09%09
-U tmp = group.construct();%0A%09%09W tmpSum = addGroup.construct();%0A%09%09W one = addGroup.construct();%0A%09%09addGroup.unity().call(one);%0A%09%09for (long i = 0; i %3C count; i++) %7B%0A%09%09%09a.get(start+i, tmp);%0A%09%09%09if (group.isEqual().call(tmp, value))%0A%09%09%09%09addGroup.add().call(tmpSum
+EqualConstant%3CT, U%3E cond = new EqualConstant%3CT, U%3E(group, value);%0A%09%09CountIf.compute(group, addGroup
 , 
+c
 on
-e, tmpSum);%0A%09%09%7D%0A%09%09addGroup.assign().call(tmpSum
+d, start, count, a
 , su

Make Count algorithm call CountIf