react-native-audio-api 0.4.12-beta.1 → 0.4.12-beta.2

package/common/cpp/{jsi → audioapi/jsi}/RuntimeLifecycleMonitor.cpp

@@ -1,8 +1,4 @@
-#include "RuntimeLifecycleMonitor.h"
-
-#include <unordered_map>
-#include <unordered_set>
-#include <utility>
+#include <audioapi/jsi/RuntimeLifecycleMonitor.h>
 
 namespace audioapi {
 

package/common/cpp/{jsi → audioapi/jsi}/RuntimeLifecycleMonitor.h

@@ -2,6 +2,9 @@
 
 #include <jsi/jsi.h>
 #include <memory>
+#include <unordered_map>
+#include <unordered_set>
+#include <utility>
 
 namespace audioapi {
 

package/common/cpp/{libs → audioapi/libs}/dsp/delay.h

@@ -1,4 +1,4 @@
-#include "./common.h"
+#include <audioapi/libs/dsp/common.h>
 
 #ifndef SIGNALSMITH_DSP_DELAY_H
 #define SIGNALSMITH_DSP_DELAY_H
@@ -9,14 +9,14 @@
 #include <type_traits>
 
 #include <complex>
-#include "./fft.h"
-#include "./windows.h"
+#include <audioapi/libs/dsp/fft.h>
+#include <audioapi/libs/dsp/windows.h>
 
 namespace signalsmith {
 namespace delay {
 	/**	@defgroup Delay Delay utilities
 		@brief Standalone templated classes for delays
-		
+
 		You can set up a `Buffer` or `MultiBuffer`, and get interpolated samples using a `Reader` (separately on each channel in the multi-channel case) - or you can use `Delay`/`MultiDelay` which include their own buffers.
 
 		Interpolation quality is chosen using a template class, from @ref Interpolators.
@@ -26,13 +26,13 @@ namespace delay {
 	*/
 
 	/** @brief Single-channel delay buffer
- 
+
 		Access is used with `buffer[]`, relative to the internal read/write position ("head").  This head is moved using `++buffer` (or `buffer += n`), such that `buffer[1] == (buffer + 1)[0]` in a similar way iterators/pointers.
-		
+
 		Operations like `buffer - 10` or `buffer++` return a View, which holds a fixed position in the buffer (based on the read/write position at the time).
-		
+
 		The capacity includes both positive and negative indices.  For example, a capacity of 100 would support using any of the ranges:
-		
+
 		* `buffer[-99]` to buffer[0]`
 		* `buffer[-50]` to buffer[49]`
 		* `buffer[0]` to buffer[99]`
@@ -81,7 +81,7 @@ namespace delay {
 				bufferIndex = other.bufferIndex;
 				return *this;
 			}
-			
+
 			CSample & operator[](int offset) {
 				return buffer->buffer[(bufferIndex + (unsigned)offset)&buffer->bufferMask];
 			}
@@ -113,7 +113,7 @@ namespace delay {
 		};
 		using MutableView = View<false>;
 		using ConstView = View<true>;
-		
+
 		MutableView view(int offset=0) {
 			return MutableView(*this, offset);
 		}
@@ -145,7 +145,7 @@ namespace delay {
 				data[i] = (*this)[i];
 			}
 		}
-		
+
 		Buffer & operator ++() {
 			++bufferIndex;
 			return *this;
@@ -190,7 +190,7 @@ namespace delay {
 	/** @brief Multi-channel delay buffer
 
 		This behaves similarly to the single-channel `Buffer`, with the following differences:
-		
+
 		* `buffer[c]` returns a view for a single channel, which behaves like the single-channel `Buffer::View`.
 		* The constructor and `.resize()` take an additional first `channel` argument.
 	*/
@@ -223,7 +223,7 @@ namespace delay {
 		public:
 			Stride(CChannel view, int channels, int stride) : view(view), channels(channels), stride(stride) {}
 			Stride(const Stride &other) : view(other.view), channels(other.channels), stride(other.stride) {}
-			
+
 			CSample & operator[](int channel) {
 				return view[channel*stride];
 			}
@@ -255,7 +255,7 @@ namespace delay {
 				return *this;
 			}
 		};
-		
+
 		Stride<false> at(int offset) {
 			return {buffer.view(offset), channels, stride};
 		}
@@ -271,7 +271,7 @@ namespace delay {
 			int channels, stride;
 		public:
 			View(CChannel view, int channels, int stride) : view(view), channels(channels), stride(stride) {}
-			
+
 			CChannel operator[](int channel) {
 				return view + channel*stride;
 			}
@@ -305,7 +305,7 @@ namespace delay {
 		ConstChannel operator[](int channel) const {
 			return buffer + channel*stride;
 		}
-		
+
 		MultiBuffer & operator ++() {
 			++buffer;
 			return *this;
@@ -341,7 +341,7 @@ namespace delay {
 			return ConstView(buffer - i, channels, stride);
 		}
 	};
-	
+
 	/** \defgroup Interpolators Interpolators
 		\ingroup Delay
 		@{ */
@@ -351,7 +351,7 @@ namespace delay {
 	struct InterpolatorNearest {
 		static constexpr int inputLength = 1;
 		static constexpr Sample latency = -0.5; // Because we're truncating, which rounds down too often
-	
+
 		template<class Data>
 		static Sample fractional(const Data &data, Sample) {
 			return data[0];
@@ -363,7 +363,7 @@ namespace delay {
 	struct InterpolatorLinear {
 		static constexpr int inputLength = 2;
 		static constexpr int latency = 0;
-	
+
 		template<class Data>
 		static Sample fractional(const Data &data, Sample fractional) {
 			Sample a = data[0], b = data[1];
@@ -376,7 +376,7 @@ namespace delay {
 	struct InterpolatorCubic {
 		static constexpr int inputLength = 4;
 		static constexpr int latency = 1;
-	
+
 		template<class Data>
 		static Sample fractional(const Data &data, Sample fractional) {
 			// Cubic interpolation
@@ -477,7 +477,7 @@ namespace delay {
 
 		int subSampleSteps;
 		std::vector<Sample> coefficients;
-		
+
 		InterpolatorKaiserSincN() : InterpolatorKaiserSincN(0.5 - 0.45/std::sqrt(n)) {}
 		InterpolatorKaiserSincN(double passFreq) : InterpolatorKaiserSincN(passFreq, 1 - passFreq) {}
 		InterpolatorKaiserSincN(double passFreq, double stopFreq) {
@@ -488,7 +488,7 @@ namespace delay {
 
 			double centreIndex = n*subSampleSteps*0.5, scaleFactor = 1.0/subSampleSteps;
 			std::vector<Sample> windowedSinc(subSampleSteps*n + 1);
-			
+
 			::signalsmith::windows::Kaiser::withBandwidth(kaiserBandwidth, false).fill(windowedSinc, windowedSinc.size());
 
 			for (size_t i = 0; i < windowedSinc.size(); ++i) {
@@ -502,7 +502,7 @@ namespace delay {
 					windowedSinc[i] *= std::sin(p)/p;
 				}
 			}
-			
+
 			if (minimumPhase) {
 				signalsmith::fft::FFT<Sample> fft(windowedSinc.size()*2, 1);
 				windowedSinc.resize(fft.size(), 0);
@@ -534,7 +534,7 @@ namespace delay {
 					windowedSinc[i] = cepstrum[i].real()*scaling;
 				}
 			}
-			
+
 			// Re-order into FIR fractional-delay blocks
 			coefficients.resize(n*(subSampleSteps + 1));
 			for (int k = 0; k <= subSampleSteps; ++k) {
@@ -543,7 +543,7 @@ namespace delay {
 				}
 			}
 		}
-		
+
 		template<class Data>
 		Sample fractional(const Data &data, Sample fractional) const {
 			Sample subSampleDelay = fractional*subSampleSteps;
@@ -551,7 +551,7 @@ namespace delay {
 			if (lowIndex >= subSampleSteps) lowIndex = subSampleSteps - 1;
 			Sample subSampleFractional = subSampleDelay - lowIndex;
 			int highIndex = lowIndex + 1;
-			
+
 			Sample sumLow = 0, sumHigh = 0;
 			const Sample *coeffLow = coefficients.data() + lowIndex*n;
 			const Sample *coeffHigh = coefficients.data() + highIndex*n;
@@ -577,9 +577,9 @@ namespace delay {
 	template<typename Sample>
 	using InterpolatorKaiserSinc4Min = InterpolatorKaiserSincN<Sample, 4, true>;
 	///  @}
-	
+
 	/** @brief A delay-line reader which uses an external buffer
- 
+
 		This is useful if you have multiple delay-lines reading from the same buffer.
 	*/
 	template<class Sample, template<typename> class Interpolator=InterpolatorLinear>
@@ -589,12 +589,12 @@ namespace delay {
 		Reader () {}
 		/// Pass in a configured interpolator
 		Reader (const Interpolator<Sample> &interpolator) : Super(interpolator) {}
-	
+
 		template<typename Buffer>
 		Sample read(const Buffer &buffer, Sample delaySamples) const {
 			int startIndex = delaySamples;
 			Sample remainder = delaySamples - startIndex;
-			
+
 			// Delay buffers use negative indices, but interpolators use positive ones
 			using View = decltype(buffer - startIndex);
 			struct Flipped {
@@ -618,14 +618,14 @@ namespace delay {
 		Delay(int capacity=0) : buffer(1 + capacity + Super::inputLength) {}
 		/// Pass in a configured interpolator
 		Delay(const Interpolator<Sample> &interp, int capacity=0) : Super(interp), buffer(1 + capacity + Super::inputLength) {}
-		
+
 		void reset(Sample value=Sample()) {
 			buffer.reset(value);
 		}
 		void resize(int minCapacity, Sample value=Sample()) {
 			buffer.resize(minCapacity + Super::inputLength, value);
 		}
-		
+
 		/** Read a sample from `delaySamples` >= 0 in the past.
 		The interpolator may add its own latency on top of this (see `Delay::latency`).  The default interpolation (linear) has 0 latency.
 		*/
@@ -658,14 +658,14 @@ namespace delay {
 			channels = nChannels;
 			multiBuffer.resize(channels, capacity + Super::inputLength, value);
 		}
-		
+
 		/// A single-channel delay-line view, similar to a `const Delay`
 		struct ChannelView {
 			static constexpr Sample latency = Super::latency;
 
 			const Super &reader;
 			typename MultiBuffer<Sample>::ConstChannel channel;
-			
+
 			Sample read(Sample delaySamples) const {
 				return reader.read(channel, delaySamples);
 			}
@@ -679,7 +679,7 @@ namespace delay {
 			Super &reader;
 			typename MultiBuffer<Sample>::ConstView view;
 			Sample delaySamples;
-			
+
 			// Calculate samples on-the-fly
 			Sample operator [](int c) const {
 				return reader.read(view[c], delaySamples);

package/common/cpp/{libs → audioapi/libs}/dsp/fft.h

@@ -1,9 +1,9 @@
-#include "./common.h"
+#include <audioapi/libs/dsp/common.h>
 
 #ifndef SIGNALSMITH_FFT_V5
 #define SIGNALSMITH_FFT_V5
 
-#include "./perf.h"
+#include <audioapi/libs/dsp/perf.h>
 
 #include <vector>
 #include <complex>
@@ -80,7 +80,7 @@ namespace signalsmith { namespace fft {
 		using complex = std::complex<V>;
 		size_t _size;
 		std::vector<complex> workingVector;
-		
+
 		enum class StepType {
 			generic, step2, step3, step4
 		};
@@ -95,13 +95,13 @@ namespace signalsmith { namespace fft {
 		std::vector<size_t> factors;
 		std::vector<Step> plan;
 		std::vector<complex> twiddleVector;
-		
+
 		struct PermutationPair {size_t from, to;};
 		std::vector<PermutationPair> permutation;
-		
+
 		void addPlanSteps(size_t factorIndex, size_t start, size_t length, size_t repeats) {
 			if (factorIndex >= factors.size()) return;
-			
+
 			size_t factor = factors[factorIndex];
 			if (factorIndex + 1 < factors.size()) {
 				if (factors[factorIndex] == 2 && factors[factorIndex + 1] == 2) {
@@ -163,7 +163,7 @@ namespace signalsmith { namespace fft {
 			twiddleVector.resize(0);
 			addPlanSteps(0, 0, _size, 1);
 			twiddleVector.shrink_to_fit();
-			
+
 			permutation.resize(0);
 			permutation.reserve(_size);
 			permutation.push_back(PermutationPair{0, 0});
@@ -202,7 +202,7 @@ namespace signalsmith { namespace fft {
 
 			for (size_t outerRepeat = 0; outerRepeat < step.outerRepeats; ++outerRepeat) {
 				RandomAccessIterator data = origData;
-				
+
 				const complex *twiddles = twiddleVector.data() + step.twiddleIndex;
 				const size_t factor = step.factor;
 				for (size_t repeat = 0; repeat < step.innerRepeats; ++repeat) {
@@ -234,7 +234,7 @@ namespace signalsmith { namespace fft {
 				for (RandomAccessIterator data = origData; data < origData + stride; ++data) {
 					complex A = data[0];
 					complex B = _fft_impl::complexMul<inverse>(data[stride], twiddles[1]);
-					
+
 					data[0] = A + B;
 					data[stride] = A - B;
 					twiddles += 2;
@@ -248,14 +248,14 @@ namespace signalsmith { namespace fft {
 			constexpr complex factor3 = {-0.5, inverse ? 0.8660254037844386 : -0.8660254037844386};
 			const size_t stride = step.innerRepeats;
 			const complex *origTwiddles = twiddleVector.data() + step.twiddleIndex;
-			
+
 			for (size_t outerRepeat = 0; outerRepeat < step.outerRepeats; ++outerRepeat) {
 				const complex* twiddles = origTwiddles;
 				for (RandomAccessIterator data = origData; data < origData + stride; ++data) {
 					complex A = data[0];
 					complex B = _fft_impl::complexMul<inverse>(data[stride], twiddles[1]);
 					complex C = _fft_impl::complexMul<inverse>(data[stride*2], twiddles[2]);
-					
+
 					complex realSum = A + (B + C)*factor3.real();
 					complex imagSum = (B - C)*factor3.imag();
 
@@ -273,7 +273,7 @@ namespace signalsmith { namespace fft {
 		SIGNALSMITH_INLINE void fftStep4(RandomAccessIterator &&origData, const Step &step) {
 			const size_t stride = step.innerRepeats;
 			const complex *origTwiddles = twiddleVector.data() + step.twiddleIndex;
-			
+
 			for (size_t outerRepeat = 0; outerRepeat < step.outerRepeats; ++outerRepeat) {
 				const complex* twiddles = origTwiddles;
 				for (RandomAccessIterator data = origData; data < origData + stride; ++data) {
@@ -295,7 +295,7 @@ namespace signalsmith { namespace fft {
 				origData += 4*stride;
 			}
 		}
-		
+
 		template<typename InputIterator, typename OutputIterator>
 		void permute(InputIterator input, OutputIterator data) {
 			for (auto pair : permutation) {
@@ -306,7 +306,7 @@ namespace signalsmith { namespace fft {
 		template<bool inverse, typename InputIterator, typename OutputIterator>
 		void run(InputIterator &&input, OutputIterator &&data) {
 			permute(input, data);
-			
+
 			for (const Step &step : plan) {
 				switch (step.type) {
 					case StepType::generic:
@@ -441,7 +441,7 @@ namespace signalsmith { namespace fft {
 					modifiedRotations[i] = {std::cos(rotPhase), std::sin(rotPhase)};
 				}
 			}
-			
+
 			return complexFft.setSize(size/2);
 		}
 		size_t setFastSizeAbove(size_t size) {
@@ -464,16 +464,16 @@ namespace signalsmith { namespace fft {
 					complexBuffer1[i] = {input[2*i], input[2*i + 1]};
 				}
 			}
-			
+
 			complexFft.fft(complexBuffer1.data(), complexBuffer2.data());
-			
+
 			if (!modified) output[0] = {
 				complexBuffer2[0].real() + complexBuffer2[0].imag(),
 				complexBuffer2[0].real() - complexBuffer2[0].imag()
 			};
 			for (size_t i = modified ? 0 : 1; i <= hSize/2; ++i) {
 				size_t conjI = modified ? (hSize  - 1 - i) : (hSize - i);
-				
+
 				complex odd = (complexBuffer2[i] + conj(complexBuffer2[conjI]))*(V)0.5;
 				complex evenI = (complexBuffer2[i] - conj(complexBuffer2[conjI]))*(V)0.5;
 				complex evenRotMinusI = _fft_impl::complexMul<false>(evenI, twiddlesMinusI[i]);
@@ -497,13 +497,13 @@ namespace signalsmith { namespace fft {
 				complex odd = v + conj(v2);
 				complex evenRotMinusI = v - conj(v2);
 				complex evenI = _fft_impl::complexMul<true>(evenRotMinusI, twiddlesMinusI[i]);
-				
+
 				complexBuffer1[i] = odd + evenI;
 				complexBuffer1[conjI] = conj(odd - evenI);
 			}
-			
+
 			complexFft.ifft(complexBuffer1.data(), complexBuffer2.data());
-			
+
 			for (size_t i = 0; i < hSize; ++i) {
 				complex v = complexBuffer2[i];
 				if (modified) v = _fft_impl::complexMul<true>(v, modifiedRotations[i]);

package/common/cpp/{libs → audioapi/libs}/dsp/perf.h

@@ -1,4 +1,4 @@
-#include "./common.h"
+#include <audioapi/libs/dsp/common.h>
 
 #ifndef SIGNALSMITH_DSP_PERF_H
 #define SIGNALSMITH_DSP_PERF_H
@@ -15,11 +15,11 @@ namespace signalsmith {
 namespace perf {
 	/**	@defgroup Performance Performance helpers
 		@brief Nothing serious, just some `#defines` and helpers
-		
+
 		@{
 		@file
 	*/
-		
+
 	/// *Really* insist that a function/method is inlined (mostly for performance in DEBUG builds)
 	#ifndef SIGNALSMITH_INLINE
 	#ifdef __GNUC__