Sebastien Brisard 08ca1e7a0a Refactoring following the promotion of embedded class o.a.c.m.transform.FastFourierTransformer.RootsOfUnity to standalone class o.a.c.m.complex.RootsOfUnity
- computeOmega(int n) now computes exp(2 * pi * i * k / n), k = 0, ..., n - 1, instead of exp(-2 * pi * i * k / n) (which was more natural for FFT).
- isForward() does not mean anything outside the FFT context. It has been renamed isCounterClockwise(), which refers to the way the roots of unity are ordered.
See MATH-677.

git-svn-id: https://svn.apache.org/repos/asf/commons/proper/math/trunk@1238179 13f79535-47bb-0310-9956-ffa450edef68
2012-01-31 07:01:03 +00:00
2010-04-02 01:53:38 +00:00
2010-03-29 00:10:10 +00:00
2010-07-26 21:47:32 +00:00
2012-01-19 22:29:08 +00:00
2010-03-26 00:27:33 +00:00
2011-12-01 21:20:47 +00:00
Languages
Java 99.3%
R 0.5%