From d9c287d4336721d773c8a4c01588f0b7c8be984d Mon Sep 17 00:00:00 2001
From: Thomas Grill <xovo@users.sourceforge.net>
Date: Thu, 16 Jan 2003 04:36:48 +0000
Subject:  ""

svn path=/trunk/; revision=340
---
 externals/grill/fftease/src/scrape~.cpp | 158 ++++++++++++++++++++++++++++++++
 1 file changed, 158 insertions(+)
 create mode 100644 externals/grill/fftease/src/scrape~.cpp

(limited to 'externals/grill/fftease/src/scrape~.cpp')

diff --git a/externals/grill/fftease/src/scrape~.cpp b/externals/grill/fftease/src/scrape~.cpp
new file mode 100644
index 00000000..6d63ed6b
--- /dev/null
+++ b/externals/grill/fftease/src/scrape~.cpp
@@ -0,0 +1,158 @@
+/*
+
+FFTease - A set of Live Spectral Processors
+Originally written by Eric Lyon and Christopher Penrose for the Max/MSP platform
+
+Copyright (c)Thomas Grill (xovo@gmx.net)
+For information on usage and redistribution, and for a DISCLAIMER OF ALL
+WARRANTIES, see the file, "license.txt," in this distribution.  
+
+*/
+
+#include "main.h"
+#include <stdlib.h>
+
+class scrape:
+	public fftease
+{
+	FLEXT_HEADER_S(scrape,fftease,setup)
+	
+public:
+	scrape(I argc,const t_atom *argv);
+
+protected:
+
+	virtual V Transform(I n,S *const *in);
+
+	F _thresh1,_thresh2;
+	F _knee,_cutoff;
+	F *_threshfunc;
+
+	V UpdThrFun();
+
+private:
+	virtual V Set();
+	virtual V Clear();
+	virtual V Delete();
+
+	static V setup(t_classid c);
+
+	V ms_knee(F knee) { _knee = knee; UpdThrFun(); }
+	V ms_cutoff(F cutoff) { _cutoff = cutoff; UpdThrFun(); }
+
+	FLEXT_ATTRGET_F(_knee)
+	FLEXT_CALLSET_F(ms_knee)
+	FLEXT_ATTRGET_F(_cutoff)
+	FLEXT_CALLSET_F(ms_cutoff)
+};
+
+FLEXT_LIB_DSP_V("fftease, scrape~",scrape)
+
+
+V scrape::setup(t_classid c)
+{
+	FLEXT_CADDATTR_VAR(c,"knee",_knee,ms_knee);
+	FLEXT_CADDATTR_VAR(c,"cutoff",_cutoff,ms_cutoff);
+}
+
+
+scrape::scrape(I argc,const t_atom *argv):
+	fftease(4,F_WINDOW|F_BITSHUFFLE|F_CRES),
+	_thresh1(.0001),_thresh2(.09),
+	_knee(1000),_cutoff(4000)
+
+{
+	/* parse and set object's options given */
+	if(argc >= 1) {
+		if(CanbeFloat(argv[0]))
+			_knee = GetAFloat(argv[0]);
+		else
+			post("%s - Knee must be a float value - set to %f",thisName(),_knee);
+	}
+	if(argc >= 2) {
+		if(CanbeFloat(argv[0])) {
+			F c = GetAFloat(argv[0]);
+			if(c > 0) _cutoff = c;
+			else
+				post("%s - Cutoff must be > 0 - set to %f",thisName(),_cutoff);
+		}
+		else
+			post("%s - Cutoff must be a float value - set to %f",thisName(),_cutoff);
+	}
+
+	AddInSignal("Messages and input signal");
+	AddInSignal("Multiplier signal");
+	AddOutSignal("Transformed signal");
+}
+
+V scrape::Clear()
+{
+	fftease::Clear();
+	_threshfunc = NULL;
+}
+
+V scrape::Delete() 
+{
+	fftease::Delete();
+	if(_threshfunc) delete[] _threshfunc;
+}
+
+V scrape::Set() 
+{
+	fftease::Set();
+
+	const I _N2 = Blocksize()*Mult()/2; 
+	_threshfunc = new F[_N2];
+	UpdThrFun();
+}
+
+V scrape::UpdThrFun() 
+{
+	const I _N = Blocksize()*Mult(),_N2 = _N/2; 
+	const F funda = Samplerate()/(_N*2);
+
+	F curfreq = funda;
+	for(I i = 0; i < _N2; i++ ) {
+		if( curfreq  < _knee )
+			_threshfunc[i] = 0;
+		else if( curfreq >= _knee && curfreq < _cutoff ) {
+			F m = (_knee - curfreq) / (_cutoff - _knee) ;
+			_threshfunc[i] = (1-m) * _thresh1 + m * _thresh2 ;
+		} else
+			_threshfunc[i] = _thresh2;
+
+		curfreq += funda ;
+	}
+}
+
+
+V scrape::Transform(I _N2,S *const *in)
+{
+	const F fmult = *in[0];
+
+	I i;
+	F maxamp = 1.;
+
+	for( i = 0; i <= _N2; i++ ) {
+		const I amp = i*2;
+		if( maxamp < _channel1[amp] ) maxamp = _channel1[amp];
+	}
+
+	for ( i = 0; i <= _N2; i++ ) {
+		const I real = i*2,imag = real+1;
+
+		F a = ( i == _N2 ? _buffer1[1] : _buffer1[real] );
+		F b = ( i == 0 || i == _N2 ? 0. : _buffer1[imag] );
+
+		_channel1[real] = hypot( a, b );
+		if ( _channel1[real] < _threshfunc[i] * maxamp ) _channel1[real] *= fmult;
+		_channel1[imag] = -atan2( b, a );
+	}
+
+	for ( i = 0; i <= _N2; i++ ) {
+		const I real = i*2, imag = real+1;
+		_buffer1[real] = _channel1[real] * cos( _channel1[imag] );
+		if( i != _N2 ) _buffer1[imag] = -_channel1[real] * sin( _channel1[imag] );
+	}
+}
+
-- 
cgit v1.2.1