/*
 * 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.condition.Condition;
import nom.bdezonia.zorbage.type.algebra.Group;
import nom.bdezonia.zorbage.type.storage.IndexedDataSource;

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

	private Find() {}

	/**
	 * 
	 * @param group
	 * @param a
	 * @param value
	 * @return
	 */
	public static <T extends Group<T,U>, U>
		long compute(T group, U value, IndexedDataSource<?,U> a)
	{
		return compute(group, value, 0, a.size(), a);
	}
	
	/**
	 * 
	 * @param group
	 * @param a
	 * @param value
	 * @param start
	 * @param count
	 * @return
	 */
	public static <T extends Group<T,U>, U>
		long compute(T group, U value, long start, long count, IndexedDataSource<?,U> a)
	{
		U tmp = group.construct();
		for (long i = 0; i < count; i++) {
			a.get(start+i, tmp);
			if (group.isEqual().call(tmp, value))
				return start + i;
		}
		return start + count;
	}
	
	public static <T extends Group<T,U>, U>
		long compute(T group, Condition<U> cond, IndexedDataSource<?,U> a)
	{
		return compute(group, cond, 0, a.size(), a);
	}
	
	/**
	 * 
	 * @param group
	 * @param a
	 * @param cond
	 * @param start
	 * @param count
	 * @return
	 */
	public static <T extends Group<T,U>, U>
		long compute(T group, Condition<U> cond, long start, long count, IndexedDataSource<?,U> a)
	{
		U tmp = group.construct();
		for (long i = 0; i < count; i++) {
			a.get(start+i, tmp);
			if (cond.isTrue(tmp))
				return start + i;
		}
		return start + count;
	}
}

@@ -1469,57 +1469,8 @@
 m;%0A%0A
-import nom.bdezonia.zorbage.condition.Condition;%0A
 impo
@@ -2310,583 +2310,6 @@
 %7D%0A%09%0A
-%09public static %3CT extends Group%3CT,U%3E, U%3E%0A%09%09long compute(T group, Condition%3CU%3E cond, IndexedDataSource%3C?,U%3E a)%0A%09%7B%0A%09%09return compute(group, cond, 0, a.size(), a);%0A%09%7D%0A%09%0A%09/**%0A%09 * %0A%09 * @param group%0A%09 * @param a%0A%09 * @param cond%0A%09 * @param start%0A%09 * @param count%0A%09 * @return%0A%09 */%0A%09public static %3CT extends Group%3CT,U%3E, U%3E%0A%09%09long compute(T group, Condition%3CU%3E cond, long start, long count, IndexedDataSource%3C?,U%3E a)%0A%09%7B%0A%09%09U tmp = group.construct();%0A%09%09for (long i = 0; i %3C count; i++) %7B%0A%09%09%09a.get(start+i, tmp);%0A%09%09%09if (cond.isTrue(tmp))%0A%09%09%09%09return start + i;%0A%09%09%7D%0A%09%09return start + count;%0A%09%7D%0A
 %7D%0A

Remove code from Find that is duplicated by FindIf