1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
|
/* Copyright (c) 2003-2004 Tim Blechmann. */
/* For information on usage and redistribution, and for a DISCLAIMER OF ALL */
/* WARRANTIES, see the file, "COPYING" in this distribution. */
/* */
/* */
/* fftgrsort divides the incoming fft signal into single grains and sorts the */
/* samples in every grain */
/* */
/* fftgrsort uses the flext C++ layer for Max/MSP and PD externals. */
/* get it at http://www.parasitaere-kapazitaeten.de/PD/ext */
/* thanks to Thomas Grill */
/* */
/* */
/* */
/* This program is free software; you can redistribute it and/or */
/* modify it under the terms of the GNU General Public License */
/* as published by the Free Software Foundation; either version 2 */
/* of the License, or (at your option) any later version. */
/* */
/* See file LICENSE for further informations on licensing terms. */
/* */
/* This program 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 General Public License for more details. */
/* */
/* You should have received a copy of the GNU General Public License */
/* along with this program; if not, write to the Free Software */
/* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
/* */
/* Based on PureData by Miller Puckette and others. */
/* */
/* */
/* */
/* coded while listening to: William Parker: Posium Pendasem */
/* Rowe/Lehn/Schmickler: Rabbit Run */
/* Derek Bailey: Ballads */
/* */
#include <flext.h>
#include <algorithm>
#if !defined(FLEXT_VERSION) || (FLEXT_VERSION < 401)
#error upgrade your flext version!!!!!!
#endif
class fftgrsort: public flext_dsp
{
FLEXT_HEADER(fftgrsort,flext_dsp);
public: // constructor
fftgrsort(int);
protected:
virtual void m_signal (int n, float *const *in, float *const *out);
void set_grains(t_int);
void set_offset(t_int);
void set_reverse();
private:
FLEXT_CALLBACK_1(set_grains,t_int)
FLEXT_CALLBACK_1(set_offset,t_int)
FLEXT_CALLBACK(set_reverse)
t_int grains;
t_int grainsize;
t_int offset;
t_int bs; //blocksize
t_int bs1; //bs+1
t_sample * data; //array with data
t_sample * d1; //1. element in array with data
t_sample * dend; //1 element after the last element
bool reverse;
};
FLEXT_LIB_DSP_1("fftgrsort~",fftgrsort,int)
fftgrsort::fftgrsort(int arg):
grains(1),offset(0),reverse(0)
{
bs=arg/2;
grainsize=bs;
bs1=bs+1;
post("blocksize: %i",bs);
data = new t_sample[bs+1];
data[0]=0;
d1=data+1;
dend=data+bs+1;
AddInSignal();
AddOutSignal();
FLEXT_ADDMETHOD_I(0,"grains",set_grains);
FLEXT_ADDMETHOD_I(0,"offset",set_offset);
FLEXT_ADDMETHOD_(0,"reverse",set_reverse);
}
void fftgrsort::m_signal(int n, t_float * const *in, t_float *const *out)
{
t_sample * ins = in[0];
t_sample * outs = out[0];
if (offset>0)
{
CopySamples(d1+bs-offset,ins,offset);
CopySamples(d1,ins+offset,bs-offset);
}
else if (offset<0)
{
CopySamples(d1-offset,ins,bs+offset);
CopySamples(d1,ins+bs+offset,-offset);
}
else
CopySamples(data,ins,bs1);
//grains
int counter=1;
while (counter!=grains)
{
std::sort(d1+grainsize*(counter-1),d1+grainsize*counter);
if (reverse)
std::reverse(d1+grainsize*(counter-1),d1+grainsize*counter);
++counter;
}
std::sort(d1+grainsize*(counter-1),dend);
if (reverse)
std::reverse(d1+grainsize*(counter-1),dend);
CopySamples(outs,data,bs1);
}
void fftgrsort::set_offset(t_int o)
{
if (o-bs<0 && o+bs>0)
{
offset=-o;
// post("offset %i",o);
}
else
post("offset out of range!");
}
void fftgrsort::set_grains(t_int g)
{
if ( (g > 0) )
{
grains=g;
grainsize=(bs)/grains;
}
}
void fftgrsort::set_reverse()
{
reverse=!reverse;
}
|
