/*
 * 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.Algebra;
import nom.bdezonia.zorbage.type.storage.IndexedDataSource;

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

	private Find() {}

	/**
	 * 
	 * @param algebra
	 * @param a
	 * @param value
	 * @return
	 */
	public static <T extends Algebra<T,U>, U>
		long compute(T algebra, U value, IndexedDataSource<U> a)
	{
		U tmp = algebra.construct();
		for (long i = 0; i < a.size(); i++) {
			a.get(i, tmp);
			if (algebra.isEqual().call(tmp, value))
				return i;
		}
		return a.size();
	}
	
}

@@ -1838,16 +1838,310 @@
 %3E a)%0A%09%7B%0A
+%09%09return compute(algebra, value, 0, a.size(), a);%0A%09%7D%0A%09%0A%09/**%0A%09 * %0A%09 * @param algebra%0A%09 * @param a%0A%09 * @param value%0A%09 * @param start%0A%09 * @param count%0A%09 * @return%0A%09 */%0A%09public static %3CT extends Algebra%3CT,U%3E, U%3E%0A%09%09long compute(T algebra, U value, long start, long count, IndexedDataSource%3CU%3E a)%0A%09%7B%0A
 %09%09U tmp 
@@ -2186,24 +2186,21 @@
  0; i %3C 
-a.size()
+count
 ; i++) %7B
@@ -2209,16 +2209,22 @@
 %09%09a.get(
+start+
 i, tmp);
@@ -2277,16 +2277,24 @@
 %09%09return
+ start +
  i;%0A%09%09%7D%0A
@@ -2302,24 +2302,29 @@
 %09return 
-a.size()
+start + count
 ;%0A%09%7D%0A%09%0A%7D

Undo some changes to Find algorithm