/*
 * 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.type.data.float64.complex.ComplexFloat64Member;

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

	// do not instantiate
	
	private ComplexRootOfUnity() {}
	
	/**
	 * Compute a root of unity given the order m and suborder n.
	 * @param m Order of the root. The m'th root of unity.
	 * @param n Suborder of the root. 1 <= n <= m.
	 * @param root Output value.
	 */
	public static
		void compute(int m, int n, ComplexFloat64Member root)
	{
		if (n < 0 || m < 0)
			throw new IllegalArgumentException("negative argument exception");
		if (n < 1 || n > m)
			throw new IllegalArgumentException("n outside bounds of [1,m]: n = "+n+" m = "+m);
		ComplexFloat64Member e = G.CDBL.construct();
		ComplexFloat64Member power = G.CDBL.construct();
		ComplexFloat64Member two = G.CDBL.construct();
		ComplexFloat64Member I = G.CDBL.construct();
		ComplexFloat64Member M = G.CDBL.construct();
		ComplexFloat64Member N = G.CDBL.construct();
		two.setR(2);
		I.setI(1);
		M.setR(m);
		N.setR(n);
		G.CDBL.E(e);
		G.CDBL.PI(power);
		G.CDBL.multiply(power, two, power);
		G.CDBL.multiply(power, I, power);
		G.CDBL.divide(power, M, power);
		G.CDBL.multiply(power, N, power);
		G.CDBL.pow(e, power, root);
	}
}

@@ -2009,17 +2009,17 @@
 n %3C 
-0
+1
  %7C%7C m %3C 
 0)%0A%09
@@ -2014,17 +2014,17 @@
  %7C%7C m %3C 
-0
+1
 )%0A%09%09%09thr
@@ -2060,35 +2060,34 @@
 on(%22
-negative argument exception
+arguments must be positive
 %22);%0A
@@ -2098,17 +2098,8 @@
  (n 
-%3C 1 %7C%7C n 
 %3E m)

Fix edge case testing for complex root of unity code