/*
 * 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 static org.junit.Assert.assertEquals;
import static org.junit.Assert.fail;

import org.junit.Test;

import nom.bdezonia.zorbage.algebras.G;
import nom.bdezonia.zorbage.function.Function2;
import nom.bdezonia.zorbage.procedure.Procedure2;
import nom.bdezonia.zorbage.type.data.float64.real.Float64Member;

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

	@Test
	public void test() {
		Float64Member firstGuess = G.DBL.construct("1");
		Float64Member result = G.DBL.construct();
		
		if (FindFixedPoint.compute(G.DBL, cos, closeEnough, firstGuess, 50, result) >= 0) {
			assertEquals(0.73908, result.v(), 0.00001);
		}
		else
			fail();
	}
	
	// TODO: make more general? Procedure3<algebra<t,u>,u,u>?
	
	private Procedure2<Float64Member, Float64Member> cos = new Procedure2<Float64Member, Float64Member>() {
		
		@Override
		public void call(Float64Member a, Float64Member b) {
			b.setV(Math.cos(a.v()));
		}
	};
	
	private Function2<Boolean, Float64Member, Float64Member> closeEnough = new Function2<Boolean, Float64Member, Float64Member>() {
		
		@Override
		public Boolean call(Float64Member a, Float64Member b) {
			return Math.abs(a.v()-b.v()) < 0.00001;
		}
	};
}

@@ -2015,19 +2015,27 @@
 (G.DBL, 
+G.DBL.
 cos
+()
 , closeE
@@ -2146,287 +2146,13 @@
 ();%0A
+
 %09%7D%0A%09%0A
-%09// TODO: make more general? Procedure3%3Calgebra%3Ct,u%3E,u,u%3E?%0A%09%0A%09private Procedure2%3CFloat64Member, Float64Member%3E cos = new Procedure2%3CFloat64Member, Float64Member%3E() %7B%0A%09%09%0A%09%09@Override%0A%09%09public void call(Float64Member a, Float64Member b) %7B%0A%09%09%09b.setV(Math.cos(a.v()));%0A%09%09%7D%0A%09%7D;%0A%09%0A
 %09pri

Simplify the find fixed point test code