/*
 * 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.groups.G;
import nom.bdezonia.zorbage.procedure.Procedure2;
import nom.bdezonia.zorbage.type.algebra.Addition;
import nom.bdezonia.zorbage.type.algebra.Group;
import nom.bdezonia.zorbage.type.data.float64.real.Float64Group;
import nom.bdezonia.zorbage.type.data.float64.real.Float64Member;

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

	private static <T extends Group<T,U> & Addition<U>, U>
		void compute(T group, U result)
	{
		group.add().call(result, result, result);
	}
	
	private class OO<T extends Group<T,U> & Addition<U>, U>
		implements Procedure2<T,U>
	{
		@Override
		public void call(T group, U result) {
			
			group.add().call(result, result, result);
		}
		
	}
	
	public void test() {
		
		Float64Member result = G.DBL.construct();
		
		// THIS ?
		
		StaticAlgoRethink.compute(G.DBL, result);
		
		// OR THIS?
		
		new OO<Float64Group,Float64Member>().call(G.DBL, result);
		
		// I really don't like the second. It requires an object allocation and it requires
		// the specifying of the template parameter types.
		
		// The second has the good effect that algorithms could be passed around as procedures
		// and invoked. Imagine a class that works for any possible norm. You could pass in a
		// norm procedure and get different behavior. Otherwise you need one implementation of
		// the algorithm for each norm type you're interested in. Later edit: not entirely
		// true. A static algorithm could be passed a norm procedure as well. But note that
		// all the norm algorithms that exist when this note was entered are static algos and
		// can't be passed.
	}
}
@@ -2015,18 +2015,32 @@
 e class 
-OO
+ClassAlgoRethink
 %3CT exten
@@ -2373,18 +2373,32 @@
 %09%0A%09%09new 
-OO
+ClassAlgoRethink
 %3CFloat64

Clarify some code