kopia lustrzana https://github.com/jameshball/osci-render
Implement highly experimental frequency detection
James Ball
rodzic
943f275214
commit
ce6616f398
|
|
@ -14,6 +14,7 @@ import xt.audio.Structs.XtMix;
|
|||
import xt.audio.Structs.XtStreamParams;
|
||||
|
||||
import java.io.*;
|
||||
import java.util.ArrayList;
|
||||
import java.util.HashMap;
|
||||
import java.util.Map;
|
||||
import java.util.concurrent.ArrayBlockingQueue;
|
||||
|
|
@ -25,6 +26,8 @@ import sh.ball.shapes.Vector2;
|
|||
import javax.sound.sampled.AudioFormat;
|
||||
import javax.sound.sampled.AudioInputStream;
|
||||
import java.util.List;
|
||||
import java.util.concurrent.Semaphore;
|
||||
import java.util.concurrent.locks.ReentrantLock;
|
||||
|
||||
public class AudioPlayer implements Renderer<List<Shape>, AudioInputStream> {
|
||||
|
||||
|
|
@ -37,6 +40,8 @@ public class AudioPlayer implements Renderer<List<Shape>, AudioInputStream> {
|
|||
private final XtFormat format;
|
||||
private final BlockingQueue<List<Shape>> frameQueue = new ArrayBlockingQueue<>(BUFFER_SIZE);
|
||||
private final Map<Object, Effect> effects = new HashMap<>();
|
||||
private final ReentrantLock lock = new ReentrantLock();
|
||||
private final List<Listener> listeners = new ArrayList<>();
|
||||
|
||||
private ByteArrayOutputStream outputStream;
|
||||
private boolean recording = false;
|
||||
|
|
@ -58,6 +63,7 @@ public class AudioPlayer implements Renderer<List<Shape>, AudioInputStream> {
|
|||
private int render(XtStream stream, XtBuffer buffer, Object user) throws InterruptedException {
|
||||
XtSafeBuffer safe = XtSafeBuffer.get(stream);
|
||||
safe.lock(buffer);
|
||||
lock.lock();
|
||||
float[] output = (float[]) safe.getOutput();
|
||||
|
||||
for (int f = 0; f < buffer.frames; f++) {
|
||||
|
|
@ -73,9 +79,7 @@ public class AudioPlayer implements Renderer<List<Shape>, AudioInputStream> {
|
|||
output[f * format.channels.outputs] = leftChannel;
|
||||
output[f * format.channels.outputs + 1] = rightChannel;
|
||||
|
||||
if (recording) {
|
||||
writeVector(leftChannel, rightChannel);
|
||||
}
|
||||
writeChannels(leftChannel, rightChannel);
|
||||
|
||||
audioFramesDrawn++;
|
||||
|
||||
|
|
@ -90,17 +94,33 @@ public class AudioPlayer implements Renderer<List<Shape>, AudioInputStream> {
|
|||
}
|
||||
}
|
||||
safe.unlock(buffer);
|
||||
lock.unlock();
|
||||
return 0;
|
||||
}
|
||||
|
||||
private void writeVector(float leftChannel, float rightChannel) {
|
||||
private void writeChannels(float leftChannel, float rightChannel) {
|
||||
int left = (int)(leftChannel * Short.MAX_VALUE);
|
||||
int right = (int)(rightChannel * Short.MAX_VALUE);
|
||||
|
||||
outputStream.write((byte) left);
|
||||
outputStream.write((byte)(left >> 8));
|
||||
outputStream.write((byte) right);
|
||||
outputStream.write((byte)(right >> 8));
|
||||
byte b0 = (byte) left;
|
||||
byte b1 = (byte)(left >> 8);
|
||||
byte b2 = (byte) right;
|
||||
byte b3 = (byte)(right >> 8);
|
||||
|
||||
if (recording) {
|
||||
outputStream.write(b0);
|
||||
outputStream.write(b1);
|
||||
outputStream.write(b2);
|
||||
outputStream.write(b3);
|
||||
}
|
||||
|
||||
for (Listener listener : listeners) {
|
||||
listener.write(b0);
|
||||
listener.write(b1);
|
||||
listener.write(b2);
|
||||
listener.write(b3);
|
||||
listener.notifyIfFull();
|
||||
}
|
||||
|
||||
framesRecorded++;
|
||||
}
|
||||
|
|
@ -194,6 +214,24 @@ public class AudioPlayer implements Renderer<List<Shape>, AudioInputStream> {
|
|||
effects.remove(identifier);
|
||||
}
|
||||
|
||||
@Override
|
||||
public void read(byte[] buffer) throws InterruptedException {
|
||||
Listener listener = new Listener(buffer);
|
||||
try {
|
||||
lock.lock();
|
||||
listeners.add(listener);
|
||||
} finally {
|
||||
lock.unlock();
|
||||
}
|
||||
listener.waitUntilFull();
|
||||
try {
|
||||
lock.lock();
|
||||
listeners.remove(listener);
|
||||
} finally {
|
||||
lock.unlock();
|
||||
}
|
||||
}
|
||||
|
||||
@Override
|
||||
public void startRecord() {
|
||||
outputStream = new ByteArrayOutputStream();
|
||||
|
|
@ -211,4 +249,32 @@ public class AudioPlayer implements Renderer<List<Shape>, AudioInputStream> {
|
|||
|
||||
return new AudioInputStream(new ByteArrayInputStream(input), audioFormat, framesRecorded);
|
||||
}
|
||||
|
||||
private static class Listener {
|
||||
private final byte[] buffer;
|
||||
private final Semaphore sema;
|
||||
|
||||
private int offset;
|
||||
|
||||
private Listener(byte[] buffer) {
|
||||
this.buffer = buffer;
|
||||
this.sema = new Semaphore(0);
|
||||
}
|
||||
|
||||
private void waitUntilFull() throws InterruptedException {
|
||||
sema.acquire();
|
||||
}
|
||||
|
||||
private void notifyIfFull() {
|
||||
if (offset >= buffer.length) {
|
||||
sema.release();
|
||||
}
|
||||
}
|
||||
|
||||
private void write(byte b) {
|
||||
if (offset < buffer.length) {
|
||||
buffer[offset++] = b;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
|
|
|||
|
|
@ -0,0 +1,105 @@
|
|||
package sh.ball.audio;
|
||||
|
||||
import sh.ball.audio.fft.FFTFactory;
|
||||
import sh.ball.audio.fft.Transform;
|
||||
|
||||
import java.util.ArrayList;
|
||||
import java.util.List;
|
||||
|
||||
public class FrequencyAnalyser<S, T> implements Runnable {
|
||||
|
||||
private static final float NORMALIZATION_FACTOR_2_BYTES = Short.MAX_VALUE + 1.0f;
|
||||
|
||||
private final Renderer<S, T> renderer;
|
||||
private final List<FrequencyListener> listeners = new ArrayList<>();
|
||||
private final int frameSize;
|
||||
private final int sampleRate;
|
||||
|
||||
public FrequencyAnalyser(Renderer<S, T> renderer, int frameSize, int sampleRate) {
|
||||
this.renderer = renderer;
|
||||
this.frameSize = frameSize;
|
||||
this.sampleRate = sampleRate;
|
||||
}
|
||||
|
||||
public void addListener(FrequencyListener listener) {
|
||||
listeners.add(listener);
|
||||
}
|
||||
|
||||
private void notifyListeners(double frequency) {
|
||||
for (FrequencyListener listener : listeners) {
|
||||
listener.updateFrequency(frequency);
|
||||
}
|
||||
}
|
||||
|
||||
// Adapted from https://stackoverflow.com/questions/53997426/java-how-to-get-current-frequency-of-audio-input
|
||||
@Override
|
||||
public void run() {
|
||||
final byte[] buf = new byte[2 << 16]; // <--- increase this for higher frequency resolution
|
||||
final int numberOfSamples = (buf.length / 2) / frameSize;
|
||||
Transform fft = FFTFactory.getInstance().create(numberOfSamples);
|
||||
|
||||
int frequencyBin = sampleRate / (numberOfSamples / 2);
|
||||
|
||||
while (true) {
|
||||
try {
|
||||
renderer.read(buf);
|
||||
} catch (InterruptedException e) {
|
||||
e.printStackTrace();
|
||||
}
|
||||
// the stream represents each sample as two bytes -> decode
|
||||
final float[] samples = decode(buf);
|
||||
final float[][] transformed = fft.transform(samples);
|
||||
final float[] realPart = transformed[0];
|
||||
final float[] imaginaryPart = transformed[1];
|
||||
final double[] magnitudes = toMagnitudes(realPart, imaginaryPart);
|
||||
|
||||
int maxIndex = 0;
|
||||
double max = Double.NEGATIVE_INFINITY;
|
||||
for (int i = 1; i < magnitudes.length / 2; i++) {
|
||||
if (i * frequencyBin < 20 || i * frequencyBin > 20000) {
|
||||
continue;
|
||||
}
|
||||
if (magnitudes[i] > max) {
|
||||
maxIndex = i;
|
||||
max = magnitudes[i];
|
||||
}
|
||||
}
|
||||
|
||||
System.out.println((maxIndex + 1) * frequencyBin * 1.05);
|
||||
}
|
||||
}
|
||||
|
||||
private float[] decode(final byte[] buf) {
|
||||
final float[] fbuf = new float[(buf.length / 2) / frameSize];
|
||||
int byteNum = 0;
|
||||
int i = 0;
|
||||
for (int pos = 0; pos < buf.length; pos += frameSize) {
|
||||
if (byteNum < 2) {
|
||||
int sample = byteToIntLittleEndian(buf, pos, frameSize);
|
||||
// normalize to [0,1] (not strictly necessary, but makes things easier)
|
||||
fbuf[i] = sample / NORMALIZATION_FACTOR_2_BYTES;
|
||||
i++;
|
||||
}
|
||||
byteNum++;
|
||||
byteNum %= 4;
|
||||
}
|
||||
return fbuf;
|
||||
}
|
||||
|
||||
private double[] toMagnitudes(final float[] realPart, final float[] imaginaryPart) {
|
||||
final double[] powers = new double[realPart.length / 2];
|
||||
for (int i = 0; i < powers.length; i++) {
|
||||
powers[i] = Math.sqrt(realPart[i] * realPart[i] + imaginaryPart[i] * imaginaryPart[i]);
|
||||
}
|
||||
return powers;
|
||||
}
|
||||
|
||||
private static int byteToIntLittleEndian(final byte[] buf, final int offset, final int bytesPerSample) {
|
||||
int sample = 0;
|
||||
for (int byteIndex = 0; byteIndex < bytesPerSample; byteIndex++) {
|
||||
final int aByte = buf[offset + byteIndex] & 0xff;
|
||||
sample += aByte << 8 * (byteIndex);
|
||||
}
|
||||
return sample;
|
||||
}
|
||||
}
|
||||
|
|
@ -0,0 +1,6 @@
|
|||
package sh.ball.audio;
|
||||
|
||||
public interface FrequencyListener {
|
||||
|
||||
void updateFrequency(double frequency);
|
||||
}
|
||||
|
|
@ -14,6 +14,8 @@ public interface Renderer<S, T> extends Runnable {
|
|||
|
||||
void removeEffect(Object identifier);
|
||||
|
||||
void read(byte[] buffer) throws InterruptedException;
|
||||
|
||||
void startRecord();
|
||||
|
||||
T stopRecord();
|
||||
|
|
|
|||
|
|
@ -0,0 +1,279 @@
|
|||
/*
|
||||
* =================================================
|
||||
* Copyright 2011 tagtraum industries incorporated
|
||||
* All rights reserved.
|
||||
* =================================================
|
||||
*/
|
||||
|
||||
// FROM: https://github.com/hendriks73/jipes/blob/master/src/main/java/com/tagtraum/jipes/math/FFTFactory.java
|
||||
// LICENSE: https://github.com/hendriks73/jipes/blob/master/LICENSE.txt
|
||||
// GNU LESSER GENERAL PUBLIC LICENSE Version 2.1, February 1999
|
||||
|
||||
package sh.ball.audio.fft;
|
||||
|
||||
/**
|
||||
* <p>Factory for FFTransforms. Using the factory allows for sliding-in a faster, perhaps
|
||||
* native implementation (like it's done in <a href="http://www.beatunes.com/">beaTunes</a>).
|
||||
* </p>
|
||||
* <p>In order to use a factory other than the default factory, you need to specify
|
||||
* its classname with the system property <code>com.tagtraum.jipes.math.FFTFactory</code>.
|
||||
* I.e.
|
||||
* <xmp>-Dcom.tagtraum.jipes.math.FFTFactory=YOUR.CLASSNAME.HERE</xmp>
|
||||
* <p>
|
||||
*
|
||||
* @author <a href="mailto:hs@tagtraum.com">Hendrik Schreiber</a>
|
||||
*/
|
||||
public abstract class FFTFactory {
|
||||
|
||||
public static final String FACTORYCLASS_PROPERTY_NAME = FFTFactory.class.getName();
|
||||
private static FFTFactory instance;
|
||||
|
||||
protected FFTFactory() {
|
||||
}
|
||||
|
||||
/**
|
||||
* Creates a factory for FFT Transform objects.
|
||||
*
|
||||
* @return factory instance
|
||||
*/
|
||||
public synchronized static FFTFactory getInstance() {
|
||||
if (instance == null) {
|
||||
final String factoryClassname = System.getProperty(FACTORYCLASS_PROPERTY_NAME);
|
||||
if (factoryClassname != null) {
|
||||
try {
|
||||
instance = (FFTFactory) Class.forName(factoryClassname, true, Thread.currentThread().getContextClassLoader()).newInstance();
|
||||
} catch (Exception e) {
|
||||
e.printStackTrace();
|
||||
}
|
||||
}
|
||||
if (instance == null) {
|
||||
// fall back to built-in factory
|
||||
instance = new JavaFFTFactory();
|
||||
}
|
||||
}
|
||||
return instance;
|
||||
}
|
||||
|
||||
/**
|
||||
* Creates an instance of the fast Fourier transform (FFT).
|
||||
* By specifying the number of samples implementations can pre-create lookup tables to speed
|
||||
* up the actual transform.
|
||||
*
|
||||
* @param numberOfSamples number of samples the FFT instance should be able to process
|
||||
* @return FFT instance
|
||||
*/
|
||||
public abstract Transform create(int numberOfSamples);
|
||||
|
||||
/**
|
||||
* Default implementation for a Java FFT factory.
|
||||
*/
|
||||
private static class JavaFFTFactory extends FFTFactory {
|
||||
|
||||
private JavaFFT last;
|
||||
|
||||
@Override
|
||||
public synchronized Transform create(final int numberOfSamples) {
|
||||
if (last != null && last.numberOfSamples == numberOfSamples) return last;
|
||||
last = new JavaFFT(numberOfSamples);
|
||||
return last;
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* Default implementation for a Java FFT.
|
||||
*/
|
||||
private static class JavaFFT implements Transform {
|
||||
|
||||
private static final int MAX_FAST_BITS = 16;
|
||||
private static final int[][] FFT_BIT_TABLE = new int[MAX_FAST_BITS][];
|
||||
private final int numberOfSamples;
|
||||
private final int[] reverseIndices;
|
||||
private float[] frequencies;
|
||||
|
||||
static {
|
||||
int len = 2;
|
||||
for (int b = 1; b <= MAX_FAST_BITS; b++) {
|
||||
FFT_BIT_TABLE[b - 1] = new int[len];
|
||||
for (int i = 0; i < len; i++) {
|
||||
FFT_BIT_TABLE[b - 1][i] = reverseBits(i, b);
|
||||
}
|
||||
len <<= 1;
|
||||
}
|
||||
}
|
||||
|
||||
private JavaFFT(final int numberOfSamples) {
|
||||
if (!isPowerOfTwo(numberOfSamples)) throw new IllegalArgumentException("N is not a power of 2");
|
||||
if (numberOfSamples <=0) throw new IllegalArgumentException("N must be greater than 0");
|
||||
this.numberOfSamples = numberOfSamples;
|
||||
final int numberOfBits = getNumberOfNeededBits(numberOfSamples);
|
||||
this.reverseIndices = new int[numberOfSamples];
|
||||
for (int i = 0; i < numberOfSamples; i++) {
|
||||
final int j = fastReverseBits(i, numberOfBits);
|
||||
this.reverseIndices[i] = j;
|
||||
}
|
||||
this.frequencies = new float[numberOfSamples];
|
||||
for (int index=0; index<numberOfSamples; index++) {
|
||||
if (index <= numberOfSamples / 2) {
|
||||
this.frequencies[index] = index / numberOfSamples;
|
||||
} else {
|
||||
this.frequencies[index] = -((numberOfSamples - index) / (float) numberOfSamples);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
public float[][] inverseTransform(final float[] real, final float[] imaginary) throws UnsupportedOperationException {
|
||||
final float[][] out = new float[2][real.length];
|
||||
transform(true, real, imaginary, out[0], out[1]);
|
||||
return out;
|
||||
}
|
||||
|
||||
public float[][] transform(final float[] real) throws UnsupportedOperationException {
|
||||
final float[][] out = new float[3][real.length];
|
||||
transform(false, real, null, out[0], out[1]);
|
||||
out[2] = frequencies.clone();
|
||||
return out;
|
||||
}
|
||||
|
||||
public float[][] transform(final float[] real, final float[] imaginary) throws UnsupportedOperationException {
|
||||
final float[][] out = new float[3][real.length];
|
||||
transform(false, real, imaginary, out[0], out[1]);
|
||||
out[2] = frequencies.clone();
|
||||
return out;
|
||||
}
|
||||
|
||||
/**
|
||||
* Actual fast Fourier transform implementation.
|
||||
*
|
||||
* @param inverse inverse or not
|
||||
* @param realIn real portion input
|
||||
* @param imaginaryIn imaginary in
|
||||
* @param realOut real out
|
||||
* @param imaginaryOut imaginary out
|
||||
*/
|
||||
public void transform(final boolean inverse,
|
||||
final float[] realIn,
|
||||
final float[] imaginaryIn,
|
||||
final float[] realOut,
|
||||
final float[] imaginaryOut) {
|
||||
if (realIn.length != numberOfSamples) {
|
||||
throw new IllegalArgumentException("Number of samples must be " + numberOfSamples + " for this instance of JavaFFT");
|
||||
}
|
||||
|
||||
for (int i = 0; i < numberOfSamples; i++) {
|
||||
realOut[this.reverseIndices[i]] = realIn[i];
|
||||
}
|
||||
if (imaginaryIn != null) {
|
||||
for (int i = 0; i < numberOfSamples; i++) {
|
||||
imaginaryOut[this.reverseIndices[i]] = imaginaryIn[i];
|
||||
}
|
||||
}
|
||||
|
||||
int blockEnd = 1;
|
||||
final double angleNumerator;
|
||||
if (inverse) angleNumerator = -2.0 * Math.PI;
|
||||
else angleNumerator = 2.0 * Math.PI;
|
||||
for (int blockSize = 2; blockSize <= numberOfSamples; blockSize <<= 1) {
|
||||
final double deltaAngle = angleNumerator / (float) blockSize;
|
||||
final double sm2 = (-Math.sin(-2 * deltaAngle));
|
||||
final double sm1 = (-Math.sin(-deltaAngle));
|
||||
final double cm2 = (Math.cos(-2 * deltaAngle));
|
||||
final double cm1 = (Math.cos(-deltaAngle));
|
||||
final double w = 2 * cm1;
|
||||
double ar1;
|
||||
double ai1;
|
||||
double ar2;
|
||||
double ai2;
|
||||
|
||||
for (int i = 0; i < numberOfSamples; i += blockSize) {
|
||||
ar2 = cm2;
|
||||
ar1 = cm1;
|
||||
|
||||
ai2 = sm2;
|
||||
ai1 = sm1;
|
||||
|
||||
for (int j = i, n = 0; n < blockEnd; j++, n++) {
|
||||
final double ar0 = w * ar1 - ar2;
|
||||
ar2 = ar1;
|
||||
ar1 = ar0;
|
||||
|
||||
final double ai0 = w * ai1 - ai2;
|
||||
ai2 = ai1;
|
||||
ai1 = ai0;
|
||||
|
||||
final int k = j + blockEnd;
|
||||
/* temp real, temp imaginary */
|
||||
final double tr = ar0 * realOut[k] - ai0 * imaginaryOut[k];
|
||||
final double ti = ar0 * imaginaryOut[k] + ai0 * realOut[k];
|
||||
|
||||
realOut[k] = (float) (realOut[j] - tr);
|
||||
imaginaryOut[k] = (float)(imaginaryOut[j] - ti);
|
||||
|
||||
realOut[j] += tr;
|
||||
imaginaryOut[j] += ti;
|
||||
}
|
||||
}
|
||||
|
||||
blockEnd = blockSize;
|
||||
}
|
||||
|
||||
// normalize, if inverse transform
|
||||
if (inverse) {
|
||||
for (int i = 0; i < numberOfSamples; i++) {
|
||||
realOut[i] /= (float) numberOfSamples;
|
||||
imaginaryOut[i] /= (float) numberOfSamples;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
private static int getNumberOfNeededBits(final int powerOfTwo) {
|
||||
for (int i = 0; true; i++) {
|
||||
final int j = powerOfTwo & 1 << i;
|
||||
if (j != 0) return i;
|
||||
}
|
||||
}
|
||||
|
||||
private static int reverseBits(final int index, final int numberOfBits) {
|
||||
int ind = index;
|
||||
int rev = 0;
|
||||
for (int i = 0; i < numberOfBits; i++) {
|
||||
rev = rev << 1 | ind & 1;
|
||||
ind >>= 1;
|
||||
}
|
||||
return rev;
|
||||
}
|
||||
|
||||
private static int fastReverseBits(final int index, final int numberOfBits) {
|
||||
if (numberOfBits <= MAX_FAST_BITS)
|
||||
return FFT_BIT_TABLE[numberOfBits - 1][index];
|
||||
else
|
||||
return reverseBits(index, numberOfBits);
|
||||
}
|
||||
|
||||
private static boolean isPowerOfTwo(final int number) {
|
||||
return (number & (number - 1)) == 0;
|
||||
}
|
||||
|
||||
@Override
|
||||
public boolean equals(final Object o) {
|
||||
if (this == o) return true;
|
||||
if (o == null || getClass() != o.getClass()) return false;
|
||||
final JavaFFT javaFFT = (JavaFFT) o;
|
||||
if (numberOfSamples != javaFFT.numberOfSamples) return false;
|
||||
return true;
|
||||
}
|
||||
|
||||
@Override
|
||||
public int hashCode() {
|
||||
return numberOfSamples;
|
||||
}
|
||||
|
||||
@Override
|
||||
public String toString() {
|
||||
return "JavaFFT{" +
|
||||
"N=" + numberOfSamples +
|
||||
'}';
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
}
|
||||
|
|
@ -0,0 +1,502 @@
|
|||
GNU LESSER GENERAL PUBLIC LICENSE
|
||||
Version 2.1, February 1999
|
||||
|
||||
Copyright (C) 1991, 1999 Free Software Foundation, Inc.
|
||||
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
Everyone is permitted to copy and distribute verbatim copies
|
||||
of this license document, but changing it is not allowed.
|
||||
|
||||
[This is the first released version of the Lesser GPL. It also counts
|
||||
as the successor of the GNU Library Public License, version 2, hence
|
||||
the version number 2.1.]
|
||||
|
||||
Preamble
|
||||
|
||||
The licenses for most software are designed to take away your
|
||||
freedom to share and change it. By contrast, the GNU General Public
|
||||
Licenses are intended to guarantee your freedom to share and change
|
||||
free software--to make sure the software is free for all its users.
|
||||
|
||||
This license, the Lesser General Public License, applies to some
|
||||
specially designated software packages--typically libraries--of the
|
||||
Free Software Foundation and other authors who decide to use it. You
|
||||
can use it too, but we suggest you first think carefully about whether
|
||||
this license or the ordinary General Public License is the better
|
||||
strategy to use in any particular case, based on the explanations below.
|
||||
|
||||
When we speak of free software, we are referring to freedom of use,
|
||||
not price. Our General Public Licenses are designed to make sure that
|
||||
you have the freedom to distribute copies of free software (and charge
|
||||
for this service if you wish); that you receive source code or can get
|
||||
it if you want it; that you can change the software and use pieces of
|
||||
it in new free programs; and that you are informed that you can do
|
||||
these things.
|
||||
|
||||
To protect your rights, we need to make restrictions that forbid
|
||||
distributors to deny you these rights or to ask you to surrender these
|
||||
rights. These restrictions translate to certain responsibilities for
|
||||
you if you distribute copies of the library or if you modify it.
|
||||
|
||||
For example, if you distribute copies of the library, whether gratis
|
||||
or for a fee, you must give the recipients all the rights that we gave
|
||||
you. You must make sure that they, too, receive or can get the source
|
||||
code. If you link other code with the library, you must provide
|
||||
complete object files to the recipients, so that they can relink them
|
||||
with the library after making changes to the library and recompiling
|
||||
it. And you must show them these terms so they know their rights.
|
||||
|
||||
We protect your rights with a two-step method: (1) we copyright the
|
||||
library, and (2) we offer you this license, which gives you legal
|
||||
permission to copy, distribute and/or modify the library.
|
||||
|
||||
To protect each distributor, we want to make it very clear that
|
||||
there is no warranty for the free library. Also, if the library is
|
||||
modified by someone else and passed on, the recipients should know
|
||||
that what they have is not the original version, so that the original
|
||||
author's reputation will not be affected by problems that might be
|
||||
introduced by others.
|
||||
|
||||
Finally, software patents pose a constant threat to the existence of
|
||||
any free program. We wish to make sure that a company cannot
|
||||
effectively restrict the users of a free program by obtaining a
|
||||
restrictive license from a patent holder. Therefore, we insist that
|
||||
any patent license obtained for a version of the library must be
|
||||
consistent with the full freedom of use specified in this license.
|
||||
|
||||
Most GNU software, including some libraries, is covered by the
|
||||
ordinary GNU General Public License. This license, the GNU Lesser
|
||||
General Public License, applies to certain designated libraries, and
|
||||
is quite different from the ordinary General Public License. We use
|
||||
this license for certain libraries in order to permit linking those
|
||||
libraries into non-free programs.
|
||||
|
||||
When a program is linked with a library, whether statically or using
|
||||
a shared library, the combination of the two is legally speaking a
|
||||
combined work, a derivative of the original library. The ordinary
|
||||
General Public License therefore permits such linking only if the
|
||||
entire combination fits its criteria of freedom. The Lesser General
|
||||
Public License permits more lax criteria for linking other code with
|
||||
the library.
|
||||
|
||||
We call this license the "Lesser" General Public License because it
|
||||
does Less to protect the user's freedom than the ordinary General
|
||||
Public License. It also provides other free software developers Less
|
||||
of an advantage over competing non-free programs. These disadvantages
|
||||
are the reason we use the ordinary General Public License for many
|
||||
libraries. However, the Lesser license provides advantages in certain
|
||||
special circumstances.
|
||||
|
||||
For example, on rare occasions, there may be a special need to
|
||||
encourage the widest possible use of a certain library, so that it becomes
|
||||
a de-facto standard. To achieve this, non-free programs must be
|
||||
allowed to use the library. A more frequent case is that a free
|
||||
library does the same job as widely used non-free libraries. In this
|
||||
case, there is little to gain by limiting the free library to free
|
||||
software only, so we use the Lesser General Public License.
|
||||
|
||||
In other cases, permission to use a particular library in non-free
|
||||
programs enables a greater number of people to use a large body of
|
||||
free software. For example, permission to use the GNU C Library in
|
||||
non-free programs enables many more people to use the whole GNU
|
||||
operating system, as well as its variant, the GNU/Linux operating
|
||||
system.
|
||||
|
||||
Although the Lesser General Public License is Less protective of the
|
||||
users' freedom, it does ensure that the user of a program that is
|
||||
linked with the Library has the freedom and the wherewithal to run
|
||||
that program using a modified version of the Library.
|
||||
|
||||
The precise terms and conditions for copying, distribution and
|
||||
modification follow. Pay close attention to the difference between a
|
||||
"work based on the library" and a "work that uses the library". The
|
||||
former contains code derived from the library, whereas the latter must
|
||||
be combined with the library in order to run.
|
||||
|
||||
GNU LESSER GENERAL PUBLIC LICENSE
|
||||
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
|
||||
|
||||
0. This License Agreement applies to any software library or other
|
||||
program which contains a notice placed by the copyright holder or
|
||||
other authorized party saying it may be distributed under the terms of
|
||||
this Lesser General Public License (also called "this License").
|
||||
Each licensee is addressed as "you".
|
||||
|
||||
A "library" means a collection of software functions and/or data
|
||||
prepared so as to be conveniently linked with application programs
|
||||
(which use some of those functions and data) to form executables.
|
||||
|
||||
The "Library", below, refers to any such software library or work
|
||||
which has been distributed under these terms. A "work based on the
|
||||
Library" means either the Library or any derivative work under
|
||||
copyright law: that is to say, a work containing the Library or a
|
||||
portion of it, either verbatim or with modifications and/or translated
|
||||
straightforwardly into another language. (Hereinafter, translation is
|
||||
included without limitation in the term "modification".)
|
||||
|
||||
"Source code" for a work means the preferred form of the work for
|
||||
making modifications to it. For a library, complete source code means
|
||||
all the source code for all modules it contains, plus any associated
|
||||
interface definition files, plus the scripts used to control compilation
|
||||
and installation of the library.
|
||||
|
||||
Activities other than copying, distribution and modification are not
|
||||
covered by this License; they are outside its scope. The act of
|
||||
running a program using the Library is not restricted, and output from
|
||||
such a program is covered only if its contents constitute a work based
|
||||
on the Library (independent of the use of the Library in a tool for
|
||||
writing it). Whether that is true depends on what the Library does
|
||||
and what the program that uses the Library does.
|
||||
|
||||
1. You may copy and distribute verbatim copies of the Library's
|
||||
complete source code as you receive it, in any medium, provided that
|
||||
you conspicuously and appropriately publish on each copy an
|
||||
appropriate copyright notice and disclaimer of warranty; keep intact
|
||||
all the notices that refer to this License and to the absence of any
|
||||
warranty; and distribute a copy of this License along with the
|
||||
Library.
|
||||
|
||||
You may charge a fee for the physical act of transferring a copy,
|
||||
and you may at your option offer warranty protection in exchange for a
|
||||
fee.
|
||||
|
||||
2. You may modify your copy or copies of the Library or any portion
|
||||
of it, thus forming a work based on the Library, and copy and
|
||||
distribute such modifications or work under the terms of Section 1
|
||||
above, provided that you also meet all of these conditions:
|
||||
|
||||
a) The modified work must itself be a software library.
|
||||
|
||||
b) You must cause the files modified to carry prominent notices
|
||||
stating that you changed the files and the date of any change.
|
||||
|
||||
c) You must cause the whole of the work to be licensed at no
|
||||
charge to all third parties under the terms of this License.
|
||||
|
||||
d) If a facility in the modified Library refers to a function or a
|
||||
table of data to be supplied by an application program that uses
|
||||
the facility, other than as an argument passed when the facility
|
||||
is invoked, then you must make a good faith effort to ensure that,
|
||||
in the event an application does not supply such function or
|
||||
table, the facility still operates, and performs whatever part of
|
||||
its purpose remains meaningful.
|
||||
|
||||
(For example, a function in a library to compute square roots has
|
||||
a purpose that is entirely well-defined independent of the
|
||||
application. Therefore, Subsection 2d requires that any
|
||||
application-supplied function or table used by this function must
|
||||
be optional: if the application does not supply it, the square
|
||||
root function must still compute square roots.)
|
||||
|
||||
These requirements apply to the modified work as a whole. If
|
||||
identifiable sections of that work are not derived from the Library,
|
||||
and can be reasonably considered independent and separate works in
|
||||
themselves, then this License, and its terms, do not apply to those
|
||||
sections when you distribute them as separate works. But when you
|
||||
distribute the same sections as part of a whole which is a work based
|
||||
on the Library, the distribution of the whole must be on the terms of
|
||||
this License, whose permissions for other licensees extend to the
|
||||
entire whole, and thus to each and every part regardless of who wrote
|
||||
it.
|
||||
|
||||
Thus, it is not the intent of this section to claim rights or contest
|
||||
your rights to work written entirely by you; rather, the intent is to
|
||||
exercise the right to control the distribution of derivative or
|
||||
collective works based on the Library.
|
||||
|
||||
In addition, mere aggregation of another work not based on the Library
|
||||
with the Library (or with a work based on the Library) on a volume of
|
||||
a storage or distribution medium does not bring the other work under
|
||||
the scope of this License.
|
||||
|
||||
3. You may opt to apply the terms of the ordinary GNU General Public
|
||||
License instead of this License to a given copy of the Library. To do
|
||||
this, you must alter all the notices that refer to this License, so
|
||||
that they refer to the ordinary GNU General Public License, version 2,
|
||||
instead of to this License. (If a newer version than version 2 of the
|
||||
ordinary GNU General Public License has appeared, then you can specify
|
||||
that version instead if you wish.) Do not make any other change in
|
||||
these notices.
|
||||
|
||||
Once this change is made in a given copy, it is irreversible for
|
||||
that copy, so the ordinary GNU General Public License applies to all
|
||||
subsequent copies and derivative works made from that copy.
|
||||
|
||||
This option is useful when you wish to copy part of the code of
|
||||
the Library into a program that is not a library.
|
||||
|
||||
4. You may copy and distribute the Library (or a portion or
|
||||
derivative of it, under Section 2) in object code or executable form
|
||||
under the terms of Sections 1 and 2 above provided that you accompany
|
||||
it with the complete corresponding machine-readable source code, which
|
||||
must be distributed under the terms of Sections 1 and 2 above on a
|
||||
medium customarily used for software interchange.
|
||||
|
||||
If distribution of object code is made by offering access to copy
|
||||
from a designated place, then offering equivalent access to copy the
|
||||
source code from the same place satisfies the requirement to
|
||||
distribute the source code, even though third parties are not
|
||||
compelled to copy the source along with the object code.
|
||||
|
||||
5. A program that contains no derivative of any portion of the
|
||||
Library, but is designed to work with the Library by being compiled or
|
||||
linked with it, is called a "work that uses the Library". Such a
|
||||
work, in isolation, is not a derivative work of the Library, and
|
||||
therefore falls outside the scope of this License.
|
||||
|
||||
However, linking a "work that uses the Library" with the Library
|
||||
creates an executable that is a derivative of the Library (because it
|
||||
contains portions of the Library), rather than a "work that uses the
|
||||
library". The executable is therefore covered by this License.
|
||||
Section 6 states terms for distribution of such executables.
|
||||
|
||||
When a "work that uses the Library" uses material from a header file
|
||||
that is part of the Library, the object code for the work may be a
|
||||
derivative work of the Library even though the source code is not.
|
||||
Whether this is true is especially significant if the work can be
|
||||
linked without the Library, or if the work is itself a library. The
|
||||
threshold for this to be true is not precisely defined by law.
|
||||
|
||||
If such an object file uses only numerical parameters, data
|
||||
structure layouts and accessors, and small macros and small inline
|
||||
functions (ten lines or less in length), then the use of the object
|
||||
file is unrestricted, regardless of whether it is legally a derivative
|
||||
work. (Executables containing this object code plus portions of the
|
||||
Library will still fall under Section 6.)
|
||||
|
||||
Otherwise, if the work is a derivative of the Library, you may
|
||||
distribute the object code for the work under the terms of Section 6.
|
||||
Any executables containing that work also fall under Section 6,
|
||||
whether or not they are linked directly with the Library itself.
|
||||
|
||||
6. As an exception to the Sections above, you may also combine or
|
||||
link a "work that uses the Library" with the Library to produce a
|
||||
work containing portions of the Library, and distribute that work
|
||||
under terms of your choice, provided that the terms permit
|
||||
modification of the work for the customer's own use and reverse
|
||||
engineering for debugging such modifications.
|
||||
|
||||
You must give prominent notice with each copy of the work that the
|
||||
Library is used in it and that the Library and its use are covered by
|
||||
this License. You must supply a copy of this License. If the work
|
||||
during execution displays copyright notices, you must include the
|
||||
copyright notice for the Library among them, as well as a reference
|
||||
directing the user to the copy of this License. Also, you must do one
|
||||
of these things:
|
||||
|
||||
a) Accompany the work with the complete corresponding
|
||||
machine-readable source code for the Library including whatever
|
||||
changes were used in the work (which must be distributed under
|
||||
Sections 1 and 2 above); and, if the work is an executable linked
|
||||
with the Library, with the complete machine-readable "work that
|
||||
uses the Library", as object code and/or source code, so that the
|
||||
user can modify the Library and then relink to produce a modified
|
||||
executable containing the modified Library. (It is understood
|
||||
that the user who changes the contents of definitions files in the
|
||||
Library will not necessarily be able to recompile the application
|
||||
to use the modified definitions.)
|
||||
|
||||
b) Use a suitable shared library mechanism for linking with the
|
||||
Library. A suitable mechanism is one that (1) uses at run time a
|
||||
copy of the library already present on the user's computer system,
|
||||
rather than copying library functions into the executable, and (2)
|
||||
will operate properly with a modified version of the library, if
|
||||
the user installs one, as long as the modified version is
|
||||
interface-compatible with the version that the work was made with.
|
||||
|
||||
c) Accompany the work with a written offer, valid for at
|
||||
least three years, to give the same user the materials
|
||||
specified in Subsection 6a, above, for a charge no more
|
||||
than the cost of performing this distribution.
|
||||
|
||||
d) If distribution of the work is made by offering access to copy
|
||||
from a designated place, offer equivalent access to copy the above
|
||||
specified materials from the same place.
|
||||
|
||||
e) Verify that the user has already received a copy of these
|
||||
materials or that you have already sent this user a copy.
|
||||
|
||||
For an executable, the required form of the "work that uses the
|
||||
Library" must include any data and utility programs needed for
|
||||
reproducing the executable from it. However, as a special exception,
|
||||
the materials to be distributed need not include anything that is
|
||||
normally distributed (in either source or binary form) with the major
|
||||
components (compiler, kernel, and so on) of the operating system on
|
||||
which the executable runs, unless that component itself accompanies
|
||||
the executable.
|
||||
|
||||
It may happen that this requirement contradicts the license
|
||||
restrictions of other proprietary libraries that do not normally
|
||||
accompany the operating system. Such a contradiction means you cannot
|
||||
use both them and the Library together in an executable that you
|
||||
distribute.
|
||||
|
||||
7. You may place library facilities that are a work based on the
|
||||
Library side-by-side in a single library together with other library
|
||||
facilities not covered by this License, and distribute such a combined
|
||||
library, provided that the separate distribution of the work based on
|
||||
the Library and of the other library facilities is otherwise
|
||||
permitted, and provided that you do these two things:
|
||||
|
||||
a) Accompany the combined library with a copy of the same work
|
||||
based on the Library, uncombined with any other library
|
||||
facilities. This must be distributed under the terms of the
|
||||
Sections above.
|
||||
|
||||
b) Give prominent notice with the combined library of the fact
|
||||
that part of it is a work based on the Library, and explaining
|
||||
where to find the accompanying uncombined form of the same work.
|
||||
|
||||
8. You may not copy, modify, sublicense, link with, or distribute
|
||||
the Library except as expressly provided under this License. Any
|
||||
attempt otherwise to copy, modify, sublicense, link with, or
|
||||
distribute the Library is void, and will automatically terminate your
|
||||
rights under this License. However, parties who have received copies,
|
||||
or rights, from you under this License will not have their licenses
|
||||
terminated so long as such parties remain in full compliance.
|
||||
|
||||
9. You are not required to accept this License, since you have not
|
||||
signed it. However, nothing else grants you permission to modify or
|
||||
distribute the Library or its derivative works. These actions are
|
||||
prohibited by law if you do not accept this License. Therefore, by
|
||||
modifying or distributing the Library (or any work based on the
|
||||
Library), you indicate your acceptance of this License to do so, and
|
||||
all its terms and conditions for copying, distributing or modifying
|
||||
the Library or works based on it.
|
||||
|
||||
10. Each time you redistribute the Library (or any work based on the
|
||||
Library), the recipient automatically receives a license from the
|
||||
original licensor to copy, distribute, link with or modify the Library
|
||||
subject to these terms and conditions. You may not impose any further
|
||||
restrictions on the recipients' exercise of the rights granted herein.
|
||||
You are not responsible for enforcing compliance by third parties with
|
||||
this License.
|
||||
|
||||
11. If, as a consequence of a court judgment or allegation of patent
|
||||
infringement or for any other reason (not limited to patent issues),
|
||||
conditions are imposed on you (whether by court order, agreement or
|
||||
otherwise) that contradict the conditions of this License, they do not
|
||||
excuse you from the conditions of this License. If you cannot
|
||||
distribute so as to satisfy simultaneously your obligations under this
|
||||
License and any other pertinent obligations, then as a consequence you
|
||||
may not distribute the Library at all. For example, if a patent
|
||||
license would not permit royalty-free redistribution of the Library by
|
||||
all those who receive copies directly or indirectly through you, then
|
||||
the only way you could satisfy both it and this License would be to
|
||||
refrain entirely from distribution of the Library.
|
||||
|
||||
If any portion of this section is held invalid or unenforceable under any
|
||||
particular circumstance, the balance of the section is intended to apply,
|
||||
and the section as a whole is intended to apply in other circumstances.
|
||||
|
||||
It is not the purpose of this section to induce you to infringe any
|
||||
patents or other property right claims or to contest validity of any
|
||||
such claims; this section has the sole purpose of protecting the
|
||||
integrity of the free software distribution system which is
|
||||
implemented by public license practices. Many people have made
|
||||
generous contributions to the wide range of software distributed
|
||||
through that system in reliance on consistent application of that
|
||||
system; it is up to the author/donor to decide if he or she is willing
|
||||
to distribute software through any other system and a licensee cannot
|
||||
impose that choice.
|
||||
|
||||
This section is intended to make thoroughly clear what is believed to
|
||||
be a consequence of the rest of this License.
|
||||
|
||||
12. If the distribution and/or use of the Library is restricted in
|
||||
certain countries either by patents or by copyrighted interfaces, the
|
||||
original copyright holder who places the Library under this License may add
|
||||
an explicit geographical distribution limitation excluding those countries,
|
||||
so that distribution is permitted only in or among countries not thus
|
||||
excluded. In such case, this License incorporates the limitation as if
|
||||
written in the body of this License.
|
||||
|
||||
13. The Free Software Foundation may publish revised and/or new
|
||||
versions of the Lesser General Public License from time to time.
|
||||
Such new versions will be similar in spirit to the present version,
|
||||
but may differ in detail to address new problems or concerns.
|
||||
|
||||
Each version is given a distinguishing version number. If the Library
|
||||
specifies a version number of this License which applies to it and
|
||||
"any later version", you have the option of following the terms and
|
||||
conditions either of that version or of any later version published by
|
||||
the Free Software Foundation. If the Library does not specify a
|
||||
license version number, you may choose any version ever published by
|
||||
the Free Software Foundation.
|
||||
|
||||
14. If you wish to incorporate parts of the Library into other free
|
||||
programs whose distribution conditions are incompatible with these,
|
||||
write to the author to ask for permission. For software which is
|
||||
copyrighted by the Free Software Foundation, write to the Free
|
||||
Software Foundation; we sometimes make exceptions for this. Our
|
||||
decision will be guided by the two goals of preserving the free status
|
||||
of all derivatives of our free software and of promoting the sharing
|
||||
and reuse of software generally.
|
||||
|
||||
NO WARRANTY
|
||||
|
||||
15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO
|
||||
WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW.
|
||||
EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR
|
||||
OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY
|
||||
KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE
|
||||
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
||||
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE
|
||||
LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME
|
||||
THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
|
||||
|
||||
16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN
|
||||
WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY
|
||||
AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU
|
||||
FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR
|
||||
CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE
|
||||
LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING
|
||||
RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A
|
||||
FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF
|
||||
SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
|
||||
DAMAGES.
|
||||
|
||||
END OF TERMS AND CONDITIONS
|
||||
|
||||
How to Apply These Terms to Your New Libraries
|
||||
|
||||
If you develop a new library, and you want it to be of the greatest
|
||||
possible use to the public, we recommend making it free software that
|
||||
everyone can redistribute and change. You can do so by permitting
|
||||
redistribution under these terms (or, alternatively, under the terms of the
|
||||
ordinary General Public License).
|
||||
|
||||
To apply these terms, attach the following notices to the library. It is
|
||||
safest to attach them to the start of each source file to most effectively
|
||||
convey the exclusion of warranty; and each file should have at least the
|
||||
"copyright" line and a pointer to where the full notice is found.
|
||||
|
||||
<one line to give the library's name and a brief idea of what it does.>
|
||||
Copyright (C) <year> <name of author>
|
||||
|
||||
This library is free software; you can redistribute it and/or
|
||||
modify it under the terms of the GNU Lesser General Public
|
||||
License as published by the Free Software Foundation; either
|
||||
version 2.1 of the License, or (at your option) any later version.
|
||||
|
||||
This library is distributed in the hope that it will be useful,
|
||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
||||
Lesser General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU Lesser General Public
|
||||
License along with this library; if not, write to the Free Software
|
||||
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
|
||||
Also add information on how to contact you by electronic and paper mail.
|
||||
|
||||
You should also get your employer (if you work as a programmer) or your
|
||||
school, if any, to sign a "copyright disclaimer" for the library, if
|
||||
necessary. Here is a sample; alter the names:
|
||||
|
||||
Yoyodyne, Inc., hereby disclaims all copyright interest in the
|
||||
library `Frob' (a library for tweaking knobs) written by James Random Hacker.
|
||||
|
||||
<signature of Ty Coon>, 1 April 1990
|
||||
Ty Coon, President of Vice
|
||||
|
||||
That's all there is to it!
|
||||
|
|
@ -0,0 +1,60 @@
|
|||
/*
|
||||
* =================================================
|
||||
* Copyright 2011 tagtraum industries incorporated
|
||||
* All rights reserved.
|
||||
* =================================================
|
||||
*/
|
||||
|
||||
// FROM: https://github.com/hendriks73/jipes/blob/master/src/main/java/com/tagtraum/jipes/math/Transform.java
|
||||
// LICENSE: https://github.com/hendriks73/jipes/blob/master/LICENSE.txt
|
||||
// GNU LESSER GENERAL PUBLIC LICENSE Version 2.1, February 1999
|
||||
|
||||
package sh.ball.audio.fft;
|
||||
|
||||
/**
|
||||
* Transform that can be obtained for example through a {@link FFTFactory}.
|
||||
* <p/>
|
||||
* The forward transform is typically from the time domain to the frequency domain,
|
||||
* the inverse the other way around. Note that not all methods of this interface are necessarily implemented
|
||||
* by its implementing classes. Unsupported methods throw {@link UnsupportedOperationException}s.
|
||||
* <p/>
|
||||
* Date: 1/15/11
|
||||
* Time: 8:03 PM
|
||||
*
|
||||
* @author <a href="mailto:hs@tagtraum.com">Hendrik Schreiber</a>
|
||||
*/
|
||||
public interface Transform {
|
||||
|
||||
/**
|
||||
* Performs transform on real values.
|
||||
*
|
||||
* @param real input array of real numbers
|
||||
* @return array with the real and the imaginary part of the transform, the third float array contains
|
||||
* the normalized frequencies, i.e. 1.0 is equal to the sample rate of the input
|
||||
* @throws UnsupportedOperationException should the implementation not support this operation
|
||||
*/
|
||||
public float[][] transform(float[] real) throws UnsupportedOperationException;
|
||||
|
||||
/**
|
||||
* Performs a complex transform.
|
||||
*
|
||||
* @param real input array of floats
|
||||
* @param imaginary input array of floats
|
||||
* @return array with the real and the imaginary part of the transform, the third float array contains
|
||||
* the normalized frequencies, i.e. 1.0 is equal to the sample rate of the input
|
||||
* @throws UnsupportedOperationException should the implementation not support this operation
|
||||
*/
|
||||
public float[][] transform(float[] real, float[] imaginary) throws UnsupportedOperationException;
|
||||
|
||||
|
||||
/**
|
||||
* Performs an inverse transform.
|
||||
*
|
||||
* @param real input array of floats
|
||||
* @param imaginary input array of floats
|
||||
* @return array with the real and the imaginary part of the transform
|
||||
* @throws UnsupportedOperationException should the implementation not support this operation
|
||||
*/
|
||||
public float[][] inverseTransform(float[] real, float[] imaginary) throws UnsupportedOperationException;
|
||||
|
||||
}
|
||||
|
|
@ -1,6 +1,8 @@
|
|||
package sh.ball.gui;
|
||||
|
||||
import javafx.scene.control.*;
|
||||
import sh.ball.audio.FrequencyAnalyser;
|
||||
import sh.ball.audio.FrequencyListener;
|
||||
import sh.ball.audio.Renderer;
|
||||
import sh.ball.audio.effect.Effect;
|
||||
import sh.ball.audio.effect.EffectType;
|
||||
|
|
@ -42,7 +44,7 @@ import sh.ball.parser.ParserFactory;
|
|||
import sh.ball.shapes.Shape;
|
||||
import sh.ball.shapes.Vector2;
|
||||
|
||||
public class Controller implements Initializable {
|
||||
public class Controller implements Initializable, FrequencyListener {
|
||||
|
||||
private static final int SAMPLE_RATE = 192000;
|
||||
private static final InputStream DEFAULT_OBJ = Controller.class.getResourceAsStream("/models/cube.obj");
|
||||
|
|
@ -220,6 +222,7 @@ public class Controller implements Initializable {
|
|||
|
||||
executor.submit(producer);
|
||||
new Thread(renderer).start();
|
||||
new Thread(new FrequencyAnalyser<>(renderer, 2, SAMPLE_RATE)).start();
|
||||
}
|
||||
|
||||
private void toggleRecord() {
|
||||
|
|
@ -338,4 +341,9 @@ public class Controller implements Initializable {
|
|||
protected void setObjRotate(Vector3 vector) {
|
||||
producer.setFrameSettings(ObjSettingsFactory.rotation(vector));
|
||||
}
|
||||
|
||||
@Override
|
||||
public void updateFrequency(double frequency) {
|
||||
|
||||
}
|
||||
}
|
||||
|
|
|
|||
Ładowanie…
Reference in New Issue