# HG changeset patch # User Chris Cannam # Date 1433251107 -3600 # Node ID a69901aa85d26ab4eda8f34b71dfa3528ed81514 # Parent 126a60e6dc4ed4547ef425da82c02cdb045c486b Algorithm includes for std::min, etc diff -r 126a60e6dc4e -r a69901aa85d2 examples/AmplitudeFollower.cpp --- a/examples/AmplitudeFollower.cpp Wed May 20 16:51:52 2015 +0100 +++ b/examples/AmplitudeFollower.cpp Tue Jun 02 14:18:27 2015 +0100 @@ -41,6 +41,7 @@ #include #include #include +#include using std::string; using std::vector; diff -r 126a60e6dc4e -r a69901aa85d2 examples/ZeroCrossing.cpp --- a/examples/ZeroCrossing.cpp Wed May 20 16:51:52 2015 +0100 +++ b/examples/ZeroCrossing.cpp Tue Jun 02 14:18:27 2015 +0100 @@ -42,6 +42,7 @@ using std::endl; #include +#include ZeroCrossing::ZeroCrossing(float inputSampleRate) : Plugin(inputSampleRate), diff -r 126a60e6dc4e -r a69901aa85d2 vamp-sdk/FFT.h --- a/vamp-sdk/FFT.h Wed May 20 16:51:52 2015 +0100 +++ b/vamp-sdk/FFT.h Tue Jun 02 14:18:27 2015 +0100 @@ -60,6 +60,7 @@ public: /** * Calculate a forward transform of size n. + * n must be a power of 2, greater than 1. * * ri and ii must point to the real and imaginary component arrays * of the input. For real input, ii may be NULL. @@ -75,6 +76,7 @@ /** * Calculate an inverse transform of size n. + * n must be a power of 2, greater than 1. * * ri and ii must point to the real and imaginary component arrays * of the input. For real input, ii may be NULL.