15 |
--------------------------------------------------------------------------------
/mooSpace_teensy/mooSpace.h:
--------------------------------------------------------------------------------
1 | /************************************************************************
2 | FAUST Architecture File
3 | Copyright (C) 2019-2020 GRAME, Centre National de Creation Musicale
4 | ---------------------------------------------------------------------
5 | This Architecture section is free software; you can redistribute it
6 | and/or modify it under the terms of the GNU General Public License
7 | as published by the Free Software Foundation; either version 3 of
8 | the License, or (at your option) any later version.
9 |
10 | This program is distributed in the hope that it will be useful,
11 | but WITHOUT ANY WARRANTY; without even the implied warranty of
12 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 | GNU General Public License for more details.
14 |
15 | You should have received a copy of the GNU General Public License
16 | along with this program; If not, see .
17 |
18 | EXCEPTION : As a special exception, you may create a larger work
19 | that contains this FAUST architecture section and distribute
20 | that work under terms of your choice, so long as this FAUST
21 | architecture section is not modified.
22 |
23 | ************************************************************************/
24 |
25 | #ifndef faust_mooSpace_h_
26 | #define faust_mooSpace_h_
27 |
28 | #include
29 |
30 | #include "Arduino.h"
31 | #include "AudioStream.h"
32 | #include "Audio.h"
33 |
34 | class dsp;
35 | class MapUI;
36 | class MidiUI;
37 | #if MIDICTRL
38 | class teensy_midi;
39 | #endif
40 |
41 | class mooSpace : public AudioStream
42 | {
43 | public:
44 |
45 | mooSpace();
46 | ~mooSpace();
47 |
48 | virtual void update(void);
49 |
50 | void setParamValue(const std::string& path, float value);
51 | float getParamValue(const std::string& path);
52 |
53 | private:
54 |
55 | template
56 | void updateImp(void);
57 |
58 | float** fInChannel;
59 | float** fOutChannel;
60 | MapUI* fUI;
61 | #if MIDICTRL
62 | teensy_midi* fMIDIHandler;
63 | MidiUI* fMIDIInterface;
64 | #endif
65 | dsp* fDSP;
66 | };
67 |
68 | #endif
69 |
--------------------------------------------------------------------------------
/mooSpace_teensy/mooSpace_teensy.ino:
--------------------------------------------------------------------------------
1 | #include
2 | #include
3 | #include"mooSpace.h"
4 | //#include"filter_table.h"
5 | #include "Smoothed.h"
6 |
7 | #define upper_switch 4
8 | #define lower_switch 5
9 | #define shift_button 3
10 | #define footswitch 2
11 | #define blue_led 30
12 | #define red_led 32
13 |
14 | const float max_adc_value = 998.0;
15 |
16 | elapsedMillis elapsed_time;
17 |
18 | unsigned int led_time = 100;
19 |
20 | DMAMEM mooSpace mooSpace;
21 | AudioInputI2S in;
22 | AudioOutputI2S out;
23 | AudioControlSGTL5000 audioShield;
24 |
25 | AudioConnection patchCord0(in, 0, mooSpace, 0);
26 | AudioConnection patchCord1(in, 1, mooSpace, 1);
27 | AudioConnection patchCord2(mooSpace, 0, out, 0);
28 | AudioConnection patchCord3(mooSpace, 1, out, 1);
29 |
30 | const int knob_pin[5] = {A0, A1, A2, A3, A8};
31 |
32 | Smoothed current_knob[5];
33 | uint16_t last_main[5];
34 | uint16_t last_shift[5];
35 |
36 | int curr_button = 0;
37 | int prev_button = 0;
38 | int page = 0;
39 |
40 | int main_checked = 0;
41 | int shift_checked = 0;
42 |
43 |
44 | const char* param[] = {
45 | "smear",
46 | "decay",
47 | "drag",
48 | "push",
49 | "mix",
50 | "modulate",
51 | "lag",
52 | "High Cut",
53 | "Low Cut",
54 | "colour"
55 | };
56 |
57 | float smear; // modulation of input diffusion
58 | float decay; // feedback of reverberation network
59 | float drag; // modulation of reverberation network
60 | float push; // amount of cubical distortion
61 | float mix; // mix between dry and wet sound
62 | float move; // random modlation of allpass-delaytimes
63 | uint16_t lag; // input delay
64 | uint16_t lpf; // highcut
65 | uint16_t hpf; // lowcut
66 | float colour; // dampening in reverberation network
67 | uint8_t reverse; // activate reverse delay
68 |
69 | /*
70 | void set_smear(uint16_t adc_reading) {
71 | mooSpace.setParamValue(param[0], adc_reading / max_adc_value);
72 | }
73 |
74 | void set_decay(uint16_t adc_reading) {
75 | mooSpace.setParamValue(param[1], adc_reading / max_adc_value);
76 | }
77 |
78 | void set_drag(uint16_t adc_reading) {
79 | mooSpace.setParamValue(param[2], adc_reading / max_adc_value);
80 | }
81 |
82 | void set_push(uint16_t adc_reading) {
83 | mooSpace.setParamValue(param[3], adc_reading / max_adc_value);
84 | }
85 |
86 | void set_mix(uint16_t adc_reading) {
87 | mooSpace.setParamValue(param[4], adc_reading / max_adc_value);
88 | }
89 |
90 | void set_move(uint16_t adc_reading) {
91 | mooSpace.setParamValue(param[5], adc_reading);
92 | }
93 |
94 | void set_lag(uint16_t adc_reading) {
95 | mooSpace.setParamValue(param[6], adc_reading / max_adc_value);
96 | }
97 |
98 | void set_lpf(uint16_t adc_reading) {
99 | mooSpace.setParamValue(param[7], adc_reading / max_adc_value);
100 | }
101 |
102 | void set_hpf(uint16_t adc_reading) {
103 | mooSpace.setParamValue(param[8], adc_reading / max_adc_value);
104 | }
105 |
106 | void set_colour(uint16_t adc_reading) {
107 | mooSpace.setParamValue(param[9], adc_reading / max_adc_value);
108 | }*/
109 |
110 |
111 |
112 | void setup() {
113 | Serial.begin(9600);
114 | AudioMemory(100);
115 | //mooSpace.setDevice(0, 0);
116 | //mooSpace.start();
117 |
118 | //analogReadAveraging(16);
119 |
120 | audioShield.enable();
121 | audioShield.lineInLevel(0);
122 | audioShield.lineOutLevel(14);
123 | audioShield.adcHighPassFilterEnable();
124 | audioShield.inputSelect(AUDIO_INPUT_LINEIN);
125 | audioShield.volume(0.7);
126 | /* audioShield.surroundSoundEnable();
127 | audioShield.surroundSound(5);*/
128 |
129 | // Start ADC Smoothing
130 | for (int i = 0; i < 5; i++) {
131 | current_knob[i].begin(SMOOTHED_EXPONENTIAL, 4);
132 | }
133 |
134 | // define pin pages
135 | pinMode(footswitch, INPUT_PULLUP);
136 | pinMode(shift_button, INPUT_PULLUP);
137 | pinMode(upper_switch, INPUT_PULLUP);
138 | pinMode(lower_switch, INPUT_PULLUP);
139 | pinMode(red_led, OUTPUT);
140 | pinMode(blue_led, OUTPUT);
141 | digitalWrite(red_led, HIGH);
142 | digitalWrite(blue_led, LOW);
143 |
144 |
145 | }
146 |
147 | void main_page(int i) {
148 |
149 | //if (digitalRead(lower_switch) == LOW) mooSpace.setParamValue("reverse", 1);
150 |
151 | if (current_knob[i].get() != last_main[i]) {
152 | elapsed_time = 0;
153 | digitalWrite(red_led, LOW);
154 | mooSpace.setParamValue(param[i], current_knob[i].get() / max_adc_value);
155 | /*switch (i) {
156 | case 0:
157 | set_smear(current_knob[i].get());
158 | break;
159 |
160 | case 1:
161 | set_decay(current_knob[i].get());
162 | break;
163 |
164 | case 2:
165 | set_drag(current_knob[i].get());
166 | break;
167 |
168 | case 3:
169 | set_push(current_knob[i].get());
170 | break;
171 |
172 | case 4:
173 | set_mix(current_knob[i].get());
174 | break;
175 | }*/
176 | last_main[i] = current_knob[i].get();
177 | }
178 | if (elapsed_time > led_time) digitalWrite(red_led, HIGH);
179 | }
180 |
181 | void shift_page(int i) {
182 |
183 | if (current_knob[i].get() != last_shift[i]) {
184 | elapsed_time = 0;
185 | digitalWrite(blue_led, LOW);
186 | mooSpace.setParamValue(param[i+5], current_knob[i].get() / max_adc_value);
187 | /*switch (i) {
188 | case 0:
189 | set_move(current_knob[i].get());
190 | break;
191 |
192 | case 1:
193 | set_lag(current_knob[i].get());
194 | break;
195 |
196 | case 2:
197 | set_lpf(current_knob[i].get());
198 | break;
199 |
200 | case 3:
201 | set_hpf(current_knob[i].get());
202 | break;
203 |
204 | case 4:
205 | set_colour(current_knob[i].get());
206 | break;
207 | }*/
208 | last_shift[i] = current_knob[i].get();
209 | }
210 | if (elapsed_time > led_time) digitalWrite(blue_led, HIGH);
211 | }
212 |
213 | void serialprint(int i) {
214 | Serial.print(page);
215 | Serial.print("\t");
216 | Serial.print(i);
217 | Serial.print("\t");
218 | Serial.println(current_knob[i].get());
219 | }
220 |
221 | void check_page() {
222 | curr_button = !(digitalRead(shift_button));
223 |
224 | if (prev_button == LOW && curr_button == HIGH) {
225 | if (page == 0) {
226 | page = 1;
227 | for (int i = 0 ; i < 5 ; i++) {
228 | last_main[i] = current_knob[i].get();
229 | }
230 | digitalWrite(blue_led, HIGH);
231 | digitalWrite(red_led, LOW);
232 | main_checked = 0;
233 | }
234 | else if (page == 1) {
235 | page = 0;
236 | for (int i = 0 ; i < 5 ; i++) {
237 | last_shift[i] = current_knob[i].get();
238 | }
239 | digitalWrite(red_led, HIGH);
240 | digitalWrite(blue_led, LOW);
241 | shift_checked = 0;
242 | }
243 | }
244 |
245 | if (main_checked == 0) {
246 | for (int i = 0 ; i < 5 ; i++) {
247 | last_shift[i] = current_knob[i].get();
248 | }
249 | main_checked = 1;
250 | }
251 | else if (shift_checked == 0) {
252 | for (int i = 0 ; i < 5 ; i++) {
253 | last_main[i] = current_knob[i].get();
254 | }
255 | shift_checked = 1;
256 | }
257 |
258 | prev_button = curr_button;
259 | }
260 |
261 |
262 | void loop() {
263 | //read knob positions
264 | for (int i = 0 ; i < 5 ; i++) {
265 | current_knob[i].add(analogRead(knob_pin[i]));
266 | }
267 |
268 | check_page();
269 |
270 | for (int i = 0 ; i < 5 ; i++) {
271 | if (page == 0 ) main_page(i);
272 | else if (page == 1) shift_page(i);
273 | }
274 | }
275 |
--------------------------------------------------------------------------------
/mooSpace_faust.dsp:
--------------------------------------------------------------------------------
1 | declare name "mooSpace";
2 | declare description "variable space reverberation audio effect";
3 | declare author "Arev Imer (arev.imer@students.fhnw.ch)";
4 | declare copyright "Arev";
5 | declare version "0.1";
6 |
7 | import("stdfaust.lib");
8 |
9 | MAX_DIFF = 9.5;
10 | MAX_LATE = 5;
11 | MAX_MOD = 150;
12 | MAX_LAG = 2^14-2;
13 |
14 | diff_mult = hslider("smear", 0.5, 0, 1, 0.001) * MAX_DIFF : si.smoo;
15 | late_diff = hslider("drag", 0.5, 0, 1, 0.001) * MAX_LATE : si.smoo;
16 |
17 | mod = hslider("modulate", 0.02, 0, 1, 0.001) * MAX_MOD : si.smoo * rand
18 | with {
19 | rand = (0.5 * (1 + no.lfnoiseN(3,5)));
20 | sine = (2*os.lf_sawpos(2)) * ma.PI : (sin + 1)*0.5;
21 | };
22 |
23 | decay = hslider("decay", 0.3, 0, 1., 0.001) : sqrt;
24 |
25 | predelay = hslider("lag", 0, 0, 1, 0.001) * (MAX_LAG - 1) : si.smoo;
26 | damp = hslider("colour", 0.1, 0, 1, 0.01) : si.smoo;
27 | //dtime = hslider("reverse", 200, 0, 1000, 0.1) : si.smoo : _ * 88.2 ;
28 | ducktime = 0.2 * (dtime / 2);
29 |
30 | dist_amt = hslider("push", 0, 0, 1, 0.01) : si.smoo;
31 | highcut = hslider("High Cut", 1, 0, 1, 0.01) <: * : _ * 14980 : _ + 20 : si.smoo;
32 | lowcut = hslider("Low Cut", 0, 0, 1, 0.01) <: * : _ * 4980 : _ + 20 : si.smoo;
33 | rev_mix = hslider("mix", 0.5, 0, 1, 0.01) : si.smoo;
34 |
35 |
36 | reverse = checkbox("reverse");
37 |
38 |
39 | // Parameters
40 |
41 | i_diff_1 = 0.75;
42 | i_diff_2 = 0.625;
43 |
44 | d_diff_1 = 0.7;
45 | d_diff_2 = 0.5;
46 |
47 |
48 | dt_idl_1 = 142;
49 | dt_idl_2 = 107;
50 | dt_idl_3 = 379;
51 | dt_idl_4 = 277;
52 |
53 | dt_fbd_l1 = 151;
54 | dt_fbd_l2 = 101;
55 | dt_fbd_l3 = 367;
56 | dt_fbd_l4 = 281;
57 |
58 | dt_fbd_r1 = 149;
59 | dt_fbd_r2 = 113;
60 | dt_fbd_r3 = 397;
61 | dt_fbd_r4 = 283;
62 |
63 | dt_late_l1 = 672;
64 | dt_late_l2 = 1800;
65 | dt_late_r1 = 908;
66 | dt_late_r2 = 2656;
67 |
68 | rev_dt_1 = 4453;
69 | rev_dt_2 = 3720;
70 | rev_dt_3 = 4217;
71 | rev_dt_4 = 3163;
72 |
73 |
74 | // Functions
75 |
76 | swap = _,_ <: !,_,_,!;
77 |
78 | clip(lower, upper, x) = min(upper,max(x,lower));
79 |
80 | mixer(mix, dry_l, wet_l, dry_r, wet_r) = sel(mix, dry_l, wet_l), sel(mix, dry_r, wet_r)
81 | with {
82 | sel(mix, dry, wet) = (1-mix) * dry + mix * wet;
83 | };
84 |
85 |
86 | allpass(dmax, dt, coeff) =
87 | (+ <: de.fdelay5(dmax, dt-1),*(coeff)) ~ *(-coeff) : mem,_ : + ;
88 |
89 |
90 | bandwidth(x) = _ * x : + ~ (mem * (1 - x));
91 | damping(x) = _ * (1 - x) : + ~ (mem * x);
92 |
93 |
94 | input_diff =
95 | allpass(MAX_DIFF * dt_idl_1, diff_mult * dt_idl_1+mod, i_diff_1) :
96 | allpass(MAX_DIFF * dt_idl_2, diff_mult * dt_idl_2+mod, i_diff_1) :
97 | allpass(MAX_DIFF * dt_idl_3, diff_mult * dt_idl_3+mod, i_diff_2) :
98 | allpass(MAX_DIFF * dt_idl_4, diff_mult * dt_idl_4+mod, i_diff_2) :
99 | _;
100 |
101 | feedback_diff_l =
102 | allpass(MAX_DIFF * dt_fbd_l1, diff_mult * dt_fbd_l1+mod, i_diff_1) :
103 | allpass(MAX_DIFF * dt_fbd_l2, diff_mult * dt_fbd_l2+mod, i_diff_1) :
104 | allpass(MAX_DIFF * dt_fbd_l3, diff_mult * dt_fbd_l3+mod, i_diff_2) :
105 | allpass(MAX_DIFF * dt_fbd_l4, diff_mult * dt_fbd_l4+mod, i_diff_2) :
106 | _;
107 |
108 | feedback_diff_r =
109 | allpass(MAX_DIFF * dt_fbd_r1, diff_mult * dt_fbd_r1+mod, i_diff_1) :
110 | allpass(MAX_DIFF * dt_fbd_r2, diff_mult * dt_fbd_r2+mod, i_diff_1) :
111 | allpass(MAX_DIFF * dt_fbd_r3, diff_mult * dt_fbd_r3+mod, i_diff_2) :
112 | allpass(MAX_DIFF * dt_fbd_r4, diff_mult * dt_fbd_r4+mod, i_diff_2) :
113 | _;
114 |
115 |
116 | multi_tap_allpass_l(dt, coeff) =
117 |
118 | (+ <: de.fdelay5(MAX_LATE * dt + MAX_MOD, late_diff * dt - 1 + mod), * (coeff), de.fdelay5(MAX_LATE * dt + MAX_MOD, late_diff*(dt/9.63)),de.fdelay5(MAX_LATE * dt + MAX_MOD, late_diff*(dt/1.46)))
119 | ~(* (-coeff), !, !, !) : mem, _, _, _ : +(_, _), _, _;
120 |
121 |
122 | multi_tap_allpass_r(dt, coeff) =
123 |
124 | (+ <: de.fdelay5(MAX_LATE * dt + MAX_MOD, late_diff * dt - 1 + mod), * (coeff), de.fdelay5(MAX_LATE * dt + MAX_MOD, late_diff*(dt/7.93)),de.fdelay5(MAX_LATE * dt + MAX_MOD, late_diff*(dt/1.39)))
125 | ~(* (-coeff), !, !, !) : mem, _, _, _ : +(_, _), _, _;
126 |
127 |
128 | left_side =
129 |
130 | _ * (decay), _ : + : co.compressor_mono(5, -6, 0.5, 1) :
131 | allpass(MAX_LATE * dt_late_l1 + MAX_MOD, late_diff * dt_late_l1 + mod, -d_diff_1)
132 |
133 | <: de.fdelay5(rev_dt_1, rev_dt_1),
134 | de.fdelay(rev_dt_1, (rev_dt_1/2.23)), // node24_30[1990] -> L-
135 | de.fdelay(rev_dt_1, late_diff * (rev_dt_1/12.61)), // node24_30[353] -> R+
136 | de.fdelay(rev_dt_1, (rev_dt_1/1.23)) : // node24_30[3627] -> R+
137 |
138 | damping(damp), _, _+_ :
139 |
140 | decay * _, _, _ :
141 |
142 |
143 | (multi_tap_allpass_l(dt_late_l2, d_diff_2), _, _) <: // node31_33[187] -> L-, node31_33[1228] -> R-
144 | de.fdelay(rev_dt_2, rev_dt_2), _, _, _, _,
145 | de.fdelay(rev_dt_2, (rev_dt_2/1.39)), !, !, !, !, // node33_39[2673] -> R+
146 | de.fdelay(rev_dt_2, (rev_dt_2/3.49)), !, !, !, ! : // node33_39[1066] -> L-
147 |
148 | _ * decay , _/*Lmult-*/,/*Rmult-*/ swap/*Lprev-*/, _/*Rsum+*/, _/*R+*/, _/*L-*/ :
149 | _, _, _, 0.6*((-1* _) + _ + _), _ :
150 | _, _, _, swap :
151 | _, 0.6*((-1* _) - _ - _), _; // 2nd GOING TO LEFT OUT / 3rd GOING TO RIGHT OUT
152 |
153 |
154 | right_side =
155 |
156 | _ * (decay), _ : + : co.compressor_mono(5, -6, 0.5, 1) :
157 | allpass(MAX_LATE * dt_late_r1 + MAX_MOD, late_diff * dt_late_r1 + mod, -d_diff_1)
158 |
159 | <: de.fdelay(rev_dt_3, rev_dt_3),
160 | de.fdelay(rev_dt_3, (rev_dt_3/2.0)), // node48_54[2111] -> R-
161 | de.fdelay(rev_dt_3, late_diff * (rev_dt_3/15.85)), // node48_54[266] -> L+
162 | de.fdelay(rev_dt_3, (rev_dt_3/1.42)) : // node48_54[2974]-> L+
163 |
164 | damping(damp), _, _ + _ :
165 |
166 | decay * _, _, _ :
167 |
168 | (multi_tap_allpass_r(dt_late_r2, d_diff_2), _, _) <: // node55_59[335] -> R-, node55_59[1913] -> L-
169 | de.fdelay(rev_dt_4, rev_dt_4), _, _, _, _,
170 | de.fdelay(rev_dt_4, late_diff * (rev_dt_4/26.14)), !, !, !, !, // node59_63[121] -> L-
171 | de.fdelay(rev_dt_4, (rev_dt_4 / 1.58)), !, !, !, !: // node59_63[1996] -> R+
172 |
173 | _ * decay , _/*Rmult-*/,/*Lmult-*/swap/*Rprev-*/, _/*Lsum*/, _/*L-*/, _/*R+*/ :
174 | _, _, _, 0.6*((-1* _) + _ - _), _ :
175 | _, _, _, swap :
176 | _, 0.6*((-1* _) - _ + _), _ : // 2nd GOING TO RIGHT OUT / 3rd GOING TO LEFT OUT
177 | _, swap; // 2nd GOING TO LEFT OUT / 3rd GOING TO RIGHT OUT
178 |
179 |
180 |
181 | // reversedelay(delMax,phase,speed) = grooveduck * de.fdelay5(88200, del) with {
182 | // sin_window = (del/delMax) * ma.PI : sin;
183 | // grooveduck = del > (dtime - ducktime) : 1 - _ : ba.ramp(ducktime) ;
184 | // delOffset = delMax * max(0,min(0.999999,phase)); // starting point in delay line
185 | // del = ((speed * os.lf_rawsaw(delMax/speed)) + delOffset) % (delMax-1);
186 | // };
187 |
188 | // input_proc = 0.5 * _, 0.5 * _ :> _ :
189 | // ef.cubicnl(dist_amt,0) :
190 | // de.fdelay(MAX_LAG, predelay) :
191 | // fi.lowpass(3,highcut) :
192 | // fi.highpass(3,lowcut) :
193 | // input_diff <: _,_;
194 |
195 | input_proc = + : _ * 0.5 :
196 | de.fdelay(MAX_LAG, predelay) :
197 | fi.lowpass(3,highcut) :
198 | fi.highpass(3,lowcut) : input_diff <: _,_;
199 |
200 | //(_ + _) * 0.5 : ef.cubicnl(dist_amt,0) : de.fdelay(8820, dt*44.1) : bandwidth(bw) : _;
201 |
202 |
203 | process = _ ,_ : par(i,2,ef.cubicnl(dist_amt,0))
204 |
205 | <: // split L/R to dry and wet
206 |
207 | (_, // left ch dry
208 |
209 | (input_proc) // left/right to 2 ch
210 |
211 | , _) : // right ch dry
212 |
213 | (_, // left ch dry
214 |
215 | (_, // 1st in left_side
216 |
217 | swap, // swap 3 & 2 that feedback goes to 1st in on right_side
218 |
219 | _ : // 2nd in right_side
220 |
221 | (left_side, right_side):
222 |
223 | _, _, swap, _, _ : _, swap, _, _, _) ~ (swap : feedback_diff_l, feedback_diff_r /*: co.compressor_stereo(5, -6, 0.5, 1)*/)),
224 |
225 | _ : // right ch dry
226 |
227 | _, !, !, _, swap, _, _ :
228 |
229 | _, (_ ,_ :> _), (_, _ :> _), _ : _, _, swap :mixer(rev_mix): co.limiter_1176_R4_stereo;
--------------------------------------------------------------------------------
/old/mooSpace_MEMORY_OVERFLOW.dsp:
--------------------------------------------------------------------------------
1 | declare name "mooSpace";
2 | declare description "variable space reverberation audio effect";
3 | declare author "Arev Imer (arev.imer@students.fhnw.ch)";
4 | declare copyright "Arev";
5 | declare version "0.1";
6 |
7 | import("stdfaust.lib");
8 |
9 | // stuff:
10 | // "cascading": allpass, _ : _, +(_,_)
11 | // _ <:(//wet split
12 | // (feeder1,//left branch
13 | // feeder2)//right branch
14 | // ~(*(10), *(10)))
15 |
16 | // Controls
17 |
18 | // input_level = vbargraph("h:mooSpace/h:Levels/[0]in", -60, 0) ;
19 | // output_level = vbargraph("h:mooSpace/h:Levels/[1]out", -60, 0);
20 | // clipping_led = vbargraph("h:mooSpace/h:Levels/[2]clip[style:led]", -6, 0);
21 |
22 |
23 | diff_mult = hslider("smear", 1, 0.001, 25, 0.001) : si.smooth(0.999);
24 | late_diff = hslider("drag", 1, 0.001, 10, 0.001) : si.smooth(0.999);
25 | decay = hslider("decay", 0.5, 0.001, 0.999, 0.001);
26 |
27 | predelay = hslider("lag", 0.1, 0.1, 256, 1) : si.smoo;
28 | reson = hslider("bump", 1, 0.5, 1.33, 0.0001) : si.smoo;
29 | damp = hslider("colour", 0.2, 0.001, 1, 0.001);
30 | mod = hslider("modulate", 0.2, 0, 1, 0.01) : _ * ((no.lfnoiseN(3, 10) + 1)/2) :_* 50 : ba.ramp(1000);
31 | rev_mix = hslider("mix", 0.5, 0, 1, 0.01) : si.smoo;
32 | dist_amt = hslider("push", 0, 0, 1, 0.01) : si.smoo;
33 | dtime = hslider("reverse", 200, 0, 1000, 0.1) : si.smoo : _ * 88.2 ;
34 | ducktime = 0.2 * (dtime/2);
35 |
36 | highcut = hslider("High Cut", 15000, 20, 15000, 0.01) : si.smoo;
37 | lowcut = hslider("Low Cut", 20, 20, 5000, 0.01) : si.smoo;
38 |
39 |
40 | reverse = checkbox("reverse");
41 |
42 |
43 | // Parameters
44 |
45 | bwidth = 0.9995;
46 |
47 |
48 | i_diff_1 = 0.75;
49 | i_diff_2 = 0.625;
50 |
51 | d_diff_1 = 0.7;
52 | d_diff_2 = 0.6;
53 |
54 |
55 | dt_idl_1 = 142;
56 | dt_idl_2 = 107;
57 | dt_idl_3 = 379;
58 | dt_idl_4 = 277;
59 |
60 | dt_idr_1 = 151;
61 | dt_idr_2 = 101;
62 | dt_idr_3 = 367;
63 | dt_idr_4 = 281;
64 |
65 | dt_fbd_1 = 149;
66 | dt_fbd_2 = 113;
67 | dt_fbd_3 = 397;
68 | dt_fbd_4 = 283;
69 |
70 |
71 | dt_late_l1 = 672;
72 | dt_late_l2 = 1800;
73 | dt_late_r1 = 908;
74 | dt_late_r2 = 2656;
75 |
76 |
77 | rev_dt_1 = 4453;
78 | rev_dt_2 = 3720;
79 | rev_dt_3 = 4217;
80 | rev_dt_4 = 3163;
81 |
82 |
83 | // Functions
84 |
85 | swap = _,_ <: !,_,_,!;
86 |
87 |
88 | mixer(mix, dry_l, wet_l, dry_r, wet_r) = sel(mix, dry_l, wet_l), sel(mix, dry_r, wet_r)
89 | with {
90 | sel(mix, dry, wet) = (1-mix) * dry + mix * wet;
91 | };
92 |
93 |
94 | allpass(dmax, dt, coeff) =
95 | (+ <: de.fdelay2(dmax, dt-1),*(coeff)) ~ *(-coeff) : mem,_ : + ;
96 |
97 |
98 | bandwidth(x) = _ * x : + ~ (mem * (1 - x));
99 |
100 |
101 | damping(x) = _ * (1 - x) : + ~ (mem * x);
102 |
103 |
104 | input_proc(dt, bw) =
105 |
106 | (_ + _) * 0.5 : ef.cubicnl(dist_amt,0) : de.fdelay(8820, dt*44.1) : bandwidth(bw) : _;
107 |
108 |
109 | input_diff_l =
110 | fi.allpass_fcomb(26*dt_idl_1, diff_mult*dt_idl_1+mod, i_diff_1) :
111 | fi.allpass_fcomb(26*dt_idl_2, diff_mult*dt_idl_2-mod, i_diff_1) :
112 | fi.allpass_fcomb(26*dt_idl_3, diff_mult*dt_idl_3+mod, i_diff_2) :
113 | fi.allpass_fcomb(26*dt_idl_4, diff_mult*dt_idl_4-mod, i_diff_2) :
114 | _;
115 |
116 | input_diff_r =
117 | fi.allpass_fcomb(26*dt_idr_1, diff_mult*dt_idr_1+mod, i_diff_1) :
118 | fi.allpass_fcomb(26*dt_idr_2, diff_mult*dt_idr_2-mod, i_diff_1) :
119 | fi.allpass_fcomb(26*dt_idr_3, diff_mult*dt_idr_3+mod, i_diff_2) :
120 | fi.allpass_fcomb(26*dt_idr_4, diff_mult*dt_idr_4-mod, i_diff_2) :
121 | _;
122 |
123 | feedback_diff =
124 | allpass(26*dt_fbd_1, diff_mult*dt_fbd_1+mod, i_diff_1) :
125 | allpass(26*dt_fbd_2, diff_mult*dt_fbd_2-mod, i_diff_1) :
126 | allpass(26*dt_fbd_3, diff_mult*dt_fbd_3+mod, i_diff_2) :
127 | allpass(26*dt_fbd_4, diff_mult*dt_fbd_4-mod, i_diff_2) :
128 | _;
129 |
130 |
131 | //////// OLD BRANCH PROCESSING ////////
132 | // left_side =
133 | // _*0.5+_*0.3 : allpass(10*dt_late_l1, dt_late_l1, -d_diff_1)
134 | // <: de.fdelay2(5 * rev_dt_1, rev_dt_1), _ : damping(damp), _ : decay * _, _ :
135 | // allpass(10*dt_late_l2, dt_late_l2, d_diff_2) , _ :
136 | // de.fdelay2(5 * rev_dt_2, rev_dt_2), _ : _ * decay , _;
137 |
138 | // right_side =
139 | // _*0.5+_*0.3 : allpass(10*dt_late_r1, dt_late_r1, -d_diff_1)
140 | // <: de.fdelay2(5 * rev_dt_3, rev_dt_3), _ : damping(damp), _ : decay * _, _ :
141 | // allpass(10*dt_late_r2, dt_late_r2, d_diff_2) , _ :
142 | // de.fdelay2(5 * rev_dt_4, rev_dt_4), _ : _ * decay , _;
143 |
144 | multi_tap_allpass_l(dt, coeff) =
145 |
146 | (+ <: de.fdelay2(10*dt+50, late_diff*dt-1+mod), * (coeff), de.fdelay2(1.04*dt, late_diff*dt/9.63),de.fdelay2(6.85*dt, late_diff*dt/1.46))
147 | ~(* (-coeff), !, !, !) : mem, _, _, _ : +(_, _), _, _;
148 |
149 |
150 | multi_tap_allpass_r(dt, coeff) =
151 |
152 | (+ <: de.fdelay2(10*dt+50, late_diff*dt-1+mod), * (coeff), de.fdelay2(1.27*dt, late_diff*dt/7.93),de.fdelay2(7.2*dt, late_diff*dt/1.39))
153 | ~(* (-coeff), !, !, !) : mem, _, _, _ : +(_, _), _, _;
154 |
155 |
156 | left_side =
157 |
158 | _ * (decay), _ : + : fi.allpass_fcomb(10*dt_late_l1, dt_late_l1, -d_diff_1)
159 |
160 | <: de.fdelay2(5 * rev_dt_1, rev_dt_1),
161 | de.fdelay2(2.24 * rev_dt_1, rev_dt_1/2.23), // node24_30[1990] -> L-
162 | de.fdelay2(0.4 * rev_dt_1, rev_dt_1/12.61), // node24_30[353] -> R+
163 | de.fdelay2(4.1 * rev_dt_1, rev_dt_1/1.23) : // node24_30[3627] -> R+
164 |
165 | damping(damp), _, _+_ :
166 |
167 | decay * _, _, _ :
168 |
169 |
170 | (multi_tap_allpass_l(dt_late_l2, d_diff_2), _, _) <: // node31_33[187] -> L-, node31_33[1228] -> R-
171 | de.fdelay2(5 * rev_dt_2+50, rev_dt_2+mod), _, _, _, _,
172 | de.fdelay2(3.6 * rev_dt_2, rev_dt_2/1.39), !, !, !, !, // node33_39[2673] -> R+
173 | de.fdelay2(1.44 * rev_dt_2, rev_dt_2/3.49), !, !, !, ! : // node33_39[1066] -> L-
174 |
175 | _ * decay , _/*Lmult-*/,/*Rmult-*/ swap/*Lprev-*/, _/*Rsum+*/, _/*R+*/, _/*L-*/ :
176 | _, _, _, 0.6*((-1* _) + _ + _), _ :
177 | _, _, _, swap :
178 | _, 0.6*((-1* _) - _ - _), _; // 2nd GOING TO LEFT OUT / 3rd GOING TO RIGHT OUT
179 |
180 |
181 | right_side =
182 |
183 | _ * (decay), _ : + : fi.allpass_fcomb(10*dt_late_r1, dt_late_r1, -d_diff_1)
184 |
185 | <: de.fdelay2(5 * rev_dt_3, rev_dt_3),
186 | de.fdelay2(2.5 * rev_dt_3, rev_dt_3/2.0), // node48_54[2111] -> R-
187 | de.fdelay2(0.32 * rev_dt_3, rev_dt_3/15.85), // node48_54[266] -> L+
188 | de.fdelay2(3.53 * rev_dt_3, rev_dt_3/1.42) : // node48_54[2974]-> L+
189 |
190 | damping(damp), _, _ + _ :
191 |
192 | decay * _, _, _ :
193 |
194 | (multi_tap_allpass_r(dt_late_r2, d_diff_2), _, _) <: // node55_59[335] -> R-, node55_59[1913] -> L-
195 | de.fdelay2(5 * rev_dt_4+50, rev_dt_4+mod), _, _, _, _,
196 | de.fdelay2(0.2 * rev_dt_4, rev_dt_4/26.14), !, !, !, !, // node59_63[121] -> L-
197 | de.fdelay2(3.17 * rev_dt_4, rev_dt_4/1.58), !, !, !, !: // node59_63[1996] -> R+
198 |
199 | _ * decay , _/*Rmult-*/,/*Lmult-*/swap/*Rprev-*/, _/*Lsum*/, _/*L-*/, _/*R+*/ :
200 | _, _, _, 0.6*((-1* _) + _ - _), _ :
201 | _, _, _, swap :
202 | _, 0.6*((-1* _) - _ + _), _ : // 2nd GOING TO RIGHT OUT / 3rd GOING TO LEFT OUT
203 | _, swap; // 2nd GOING TO LEFT OUT / 3rd GOING TO RIGHT OUT
204 |
205 |
206 |
207 | reversedelay(delMax,phase,speed) = grooveduck * de.fdelay2(88200, del) with {
208 | sin_window = (del/delMax) * ma.PI : sin;
209 | grooveduck = del > (dtime - ducktime) : 1 - _ : ba.ramp(ducktime) ;
210 | delOffset = delMax * max(0,min(0.999999,phase)); // starting point in delay line
211 | del = ((speed * os.lf_rawsaw(delMax/speed)) + delOffset) % (delMax-1);
212 | };
213 |
214 |
215 | process = _ ,_
216 | //<: _, swap, _ : _, _, +/2 : _, attach(_, an.amp_follower(0.1) : ba.linear2db : input_level)
217 |
218 | <: // split L/R to dry and wet
219 |
220 | (_, // left ch dry
221 |
222 | (/*input_proc(predelay, bwidth)*/ /*ba.bypass2(1-reverse,par(i,2, reversedelay(dtime, 0, 2))) : */par(i,2,ef.cubicnl(dist_amt,0) : de.fdelay(11290, predelay*44.1) : fi.lowpass(3,highcut) : fi.highpass(3,lowcut)) : input_diff_l, input_diff_r /*<: _, _*/) // sum l/r in input_proc, split summed & processed left/right to 2 ch
223 |
224 | , _) : // right ch dry
225 |
226 | (_, // left ch dry
227 |
228 | (_, // 1st in left_side
229 |
230 | swap, // swap 3 & 2 that feedback goes to 1st in on right_side
231 |
232 | _ : // 2nd in right_side
233 |
234 | (left_side, right_side):
235 |
236 | _, _, swap, _, _ : _, swap, _, _, _) ~ (swap : par(i, 2, feedback_diff): co.compressor_stereo(5, -6, 1, 3))),
237 |
238 | _ : // right ch dry
239 |
240 | _, !, !, _, swap, _, _ :
241 |
242 | _, (_ ,_ :> _), (_, _ :> _), _ : _, _, swap :mixer(rev_mix): co.limiter_1176_R4_stereo; /*<: _, swap, _ : _, _, +/2 : _, attach(_, (abs : an.amp_follower(0.1) : ba.linear2db : clipping_led : output_level));*/
--------------------------------------------------------------------------------
/LICENSE:
--------------------------------------------------------------------------------
1 | GNU GENERAL PUBLIC LICENSE
2 | Version 3, 29 June 2007
3 |
4 | Copyright (C) 2007 Free Software Foundation, Inc.
5 | Everyone is permitted to copy and distribute verbatim copies
6 | of this license document, but changing it is not allowed.
7 |
8 | Preamble
9 |
10 | The GNU General Public License is a free, copyleft license for
11 | software and other kinds of works.
12 |
13 | The licenses for most software and other practical works are designed
14 | to take away your freedom to share and change the works. By contrast,
15 | the GNU General Public License is intended to guarantee your freedom to
16 | share and change all versions of a program--to make sure it remains free
17 | software for all its users. We, the Free Software Foundation, use the
18 | GNU General Public License for most of our software; it applies also to
19 | any other work released this way by its authors. You can apply it to
20 | your programs, too.
21 |
22 | When we speak of free software, we are referring to freedom, not
23 | price. Our General Public Licenses are designed to make sure that you
24 | have the freedom to distribute copies of free software (and charge for
25 | them if you wish), that you receive source code or can get it if you
26 | want it, that you can change the software or use pieces of it in new
27 | free programs, and that you know you can do these things.
28 |
29 | To protect your rights, we need to prevent others from denying you
30 | these rights or asking you to surrender the rights. Therefore, you have
31 | certain responsibilities if you distribute copies of the software, or if
32 | you modify it: responsibilities to respect the freedom of others.
33 |
34 | For example, if you distribute copies of such a program, whether
35 | gratis or for a fee, you must pass on to the recipients the same
36 | freedoms that you received. You must make sure that they, too, receive
37 | or can get the source code. And you must show them these terms so they
38 | know their rights.
39 |
40 | Developers that use the GNU GPL protect your rights with two steps:
41 | (1) assert copyright on the software, and (2) offer you this License
42 | giving you legal permission to copy, distribute and/or modify it.
43 |
44 | For the developers' and authors' protection, the GPL clearly explains
45 | that there is no warranty for this free software. For both users' and
46 | authors' sake, the GPL requires that modified versions be marked as
47 | changed, so that their problems will not be attributed erroneously to
48 | authors of previous versions.
49 |
50 | Some devices are designed to deny users access to install or run
51 | modified versions of the software inside them, although the manufacturer
52 | can do so. This is fundamentally incompatible with the aim of
53 | protecting users' freedom to change the software. The systematic
54 | pattern of such abuse occurs in the area of products for individuals to
55 | use, which is precisely where it is most unacceptable. Therefore, we
56 | have designed this version of the GPL to prohibit the practice for those
57 | products. If such problems arise substantially in other domains, we
58 | stand ready to extend this provision to those domains in future versions
59 | of the GPL, as needed to protect the freedom of users.
60 |
61 | Finally, every program is threatened constantly by software patents.
62 | States should not allow patents to restrict development and use of
63 | software on general-purpose computers, but in those that do, we wish to
64 | avoid the special danger that patents applied to a free program could
65 | make it effectively proprietary. To prevent this, the GPL assures that
66 | patents cannot be used to render the program non-free.
67 |
68 | The precise terms and conditions for copying, distribution and
69 | modification follow.
70 |
71 | TERMS AND CONDITIONS
72 |
73 | 0. Definitions.
74 |
75 | "This License" refers to version 3 of the GNU General Public License.
76 |
77 | "Copyright" also means copyright-like laws that apply to other kinds of
78 | works, such as semiconductor masks.
79 |
80 | "The Program" refers to any copyrightable work licensed under this
81 | License. Each licensee is addressed as "you". "Licensees" and
82 | "recipients" may be individuals or organizations.
83 |
84 | To "modify" a work means to copy from or adapt all or part of the work
85 | in a fashion requiring copyright permission, other than the making of an
86 | exact copy. The resulting work is called a "modified version" of the
87 | earlier work or a work "based on" the earlier work.
88 |
89 | A "covered work" means either the unmodified Program or a work based
90 | on the Program.
91 |
92 | To "propagate" a work means to do anything with it that, without
93 | permission, would make you directly or secondarily liable for
94 | infringement under applicable copyright law, except executing it on a
95 | computer or modifying a private copy. Propagation includes copying,
96 | distribution (with or without modification), making available to the
97 | public, and in some countries other activities as well.
98 |
99 | To "convey" a work means any kind of propagation that enables other
100 | parties to make or receive copies. Mere interaction with a user through
101 | a computer network, with no transfer of a copy, is not conveying.
102 |
103 | An interactive user interface displays "Appropriate Legal Notices"
104 | to the extent that it includes a convenient and prominently visible
105 | feature that (1) displays an appropriate copyright notice, and (2)
106 | tells the user that there is no warranty for the work (except to the
107 | extent that warranties are provided), that licensees may convey the
108 | work under this License, and how to view a copy of this License. If
109 | the interface presents a list of user commands or options, such as a
110 | menu, a prominent item in the list meets this criterion.
111 |
112 | 1. Source Code.
113 |
114 | The "source code" for a work means the preferred form of the work
115 | for making modifications to it. "Object code" means any non-source
116 | form of a work.
117 |
118 | A "Standard Interface" means an interface that either is an official
119 | standard defined by a recognized standards body, or, in the case of
120 | interfaces specified for a particular programming language, one that
121 | is widely used among developers working in that language.
122 |
123 | The "System Libraries" of an executable work include anything, other
124 | than the work as a whole, that (a) is included in the normal form of
125 | packaging a Major Component, but which is not part of that Major
126 | Component, and (b) serves only to enable use of the work with that
127 | Major Component, or to implement a Standard Interface for which an
128 | implementation is available to the public in source code form. A
129 | "Major Component", in this context, means a major essential component
130 | (kernel, window system, and so on) of the specific operating system
131 | (if any) on which the executable work runs, or a compiler used to
132 | produce the work, or an object code interpreter used to run it.
133 |
134 | The "Corresponding Source" for a work in object code form means all
135 | the source code needed to generate, install, and (for an executable
136 | work) run the object code and to modify the work, including scripts to
137 | control those activities. However, it does not include the work's
138 | System Libraries, or general-purpose tools or generally available free
139 | programs which are used unmodified in performing those activities but
140 | which are not part of the work. For example, Corresponding Source
141 | includes interface definition files associated with source files for
142 | the work, and the source code for shared libraries and dynamically
143 | linked subprograms that the work is specifically designed to require,
144 | such as by intimate data communication or control flow between those
145 | subprograms and other parts of the work.
146 |
147 | The Corresponding Source need not include anything that users
148 | can regenerate automatically from other parts of the Corresponding
149 | Source.
150 |
151 | The Corresponding Source for a work in source code form is that
152 | same work.
153 |
154 | 2. Basic Permissions.
155 |
156 | All rights granted under this License are granted for the term of
157 | copyright on the Program, and are irrevocable provided the stated
158 | conditions are met. This License explicitly affirms your unlimited
159 | permission to run the unmodified Program. The output from running a
160 | covered work is covered by this License only if the output, given its
161 | content, constitutes a covered work. This License acknowledges your
162 | rights of fair use or other equivalent, as provided by copyright law.
163 |
164 | You may make, run and propagate covered works that you do not
165 | convey, without conditions so long as your license otherwise remains
166 | in force. You may convey covered works to others for the sole purpose
167 | of having them make modifications exclusively for you, or provide you
168 | with facilities for running those works, provided that you comply with
169 | the terms of this License in conveying all material for which you do
170 | not control copyright. Those thus making or running the covered works
171 | for you must do so exclusively on your behalf, under your direction
172 | and control, on terms that prohibit them from making any copies of
173 | your copyrighted material outside their relationship with you.
174 |
175 | Conveying under any other circumstances is permitted solely under
176 | the conditions stated below. Sublicensing is not allowed; section 10
177 | makes it unnecessary.
178 |
179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
180 |
181 | No covered work shall be deemed part of an effective technological
182 | measure under any applicable law fulfilling obligations under article
183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or
184 | similar laws prohibiting or restricting circumvention of such
185 | measures.
186 |
187 | When you convey a covered work, you waive any legal power to forbid
188 | circumvention of technological measures to the extent such circumvention
189 | is effected by exercising rights under this License with respect to
190 | the covered work, and you disclaim any intention to limit operation or
191 | modification of the work as a means of enforcing, against the work's
192 | users, your or third parties' legal rights to forbid circumvention of
193 | technological measures.
194 |
195 | 4. Conveying Verbatim Copies.
196 |
197 | You may convey verbatim copies of the Program's source code as you
198 | receive it, in any medium, provided that you conspicuously and
199 | appropriately publish on each copy an appropriate copyright notice;
200 | keep intact all notices stating that this License and any
201 | non-permissive terms added in accord with section 7 apply to the code;
202 | keep intact all notices of the absence of any warranty; and give all
203 | recipients a copy of this License along with the Program.
204 |
205 | You may charge any price or no price for each copy that you convey,
206 | and you may offer support or warranty protection for a fee.
207 |
208 | 5. Conveying Modified Source Versions.
209 |
210 | You may convey a work based on the Program, or the modifications to
211 | produce it from the Program, in the form of source code under the
212 | terms of section 4, provided that you also meet all of these conditions:
213 |
214 | a) The work must carry prominent notices stating that you modified
215 | it, and giving a relevant date.
216 |
217 | b) The work must carry prominent notices stating that it is
218 | released under this License and any conditions added under section
219 | 7. This requirement modifies the requirement in section 4 to
220 | "keep intact all notices".
221 |
222 | c) You must license the entire work, as a whole, under this
223 | License to anyone who comes into possession of a copy. This
224 | License will therefore apply, along with any applicable section 7
225 | additional terms, to the whole of the work, and all its parts,
226 | regardless of how they are packaged. This License gives no
227 | permission to license the work in any other way, but it does not
228 | invalidate such permission if you have separately received it.
229 |
230 | d) If the work has interactive user interfaces, each must display
231 | Appropriate Legal Notices; however, if the Program has interactive
232 | interfaces that do not display Appropriate Legal Notices, your
233 | work need not make them do so.
234 |
235 | A compilation of a covered work with other separate and independent
236 | works, which are not by their nature extensions of the covered work,
237 | and which are not combined with it such as to form a larger program,
238 | in or on a volume of a storage or distribution medium, is called an
239 | "aggregate" if the compilation and its resulting copyright are not
240 | used to limit the access or legal rights of the compilation's users
241 | beyond what the individual works permit. Inclusion of a covered work
242 | in an aggregate does not cause this License to apply to the other
243 | parts of the aggregate.
244 |
245 | 6. Conveying Non-Source Forms.
246 |
247 | You may convey a covered work in object code form under the terms
248 | of sections 4 and 5, provided that you also convey the
249 | machine-readable Corresponding Source under the terms of this License,
250 | in one of these ways:
251 |
252 | a) Convey the object code in, or embodied in, a physical product
253 | (including a physical distribution medium), accompanied by the
254 | Corresponding Source fixed on a durable physical medium
255 | customarily used for software interchange.
256 |
257 | b) Convey the object code in, or embodied in, a physical product
258 | (including a physical distribution medium), accompanied by a
259 | written offer, valid for at least three years and valid for as
260 | long as you offer spare parts or customer support for that product
261 | model, to give anyone who possesses the object code either (1) a
262 | copy of the Corresponding Source for all the software in the
263 | product that is covered by this License, on a durable physical
264 | medium customarily used for software interchange, for a price no
265 | more than your reasonable cost of physically performing this
266 | conveying of source, or (2) access to copy the
267 | Corresponding Source from a network server at no charge.
268 |
269 | c) Convey individual copies of the object code with a copy of the
270 | written offer to provide the Corresponding Source. This
271 | alternative is allowed only occasionally and noncommercially, and
272 | only if you received the object code with such an offer, in accord
273 | with subsection 6b.
274 |
275 | d) Convey the object code by offering access from a designated
276 | place (gratis or for a charge), and offer equivalent access to the
277 | Corresponding Source in the same way through the same place at no
278 | further charge. You need not require recipients to copy the
279 | Corresponding Source along with the object code. If the place to
280 | copy the object code is a network server, the Corresponding Source
281 | may be on a different server (operated by you or a third party)
282 | that supports equivalent copying facilities, provided you maintain
283 | clear directions next to the object code saying where to find the
284 | Corresponding Source. Regardless of what server hosts the
285 | Corresponding Source, you remain obligated to ensure that it is
286 | available for as long as needed to satisfy these requirements.
287 |
288 | e) Convey the object code using peer-to-peer transmission, provided
289 | you inform other peers where the object code and Corresponding
290 | Source of the work are being offered to the general public at no
291 | charge under subsection 6d.
292 |
293 | A separable portion of the object code, whose source code is excluded
294 | from the Corresponding Source as a System Library, need not be
295 | included in conveying the object code work.
296 |
297 | A "User Product" is either (1) a "consumer product", which means any
298 | tangible personal property which is normally used for personal, family,
299 | or household purposes, or (2) anything designed or sold for incorporation
300 | into a dwelling. In determining whether a product is a consumer product,
301 | doubtful cases shall be resolved in favor of coverage. For a particular
302 | product received by a particular user, "normally used" refers to a
303 | typical or common use of that class of product, regardless of the status
304 | of the particular user or of the way in which the particular user
305 | actually uses, or expects or is expected to use, the product. A product
306 | is a consumer product regardless of whether the product has substantial
307 | commercial, industrial or non-consumer uses, unless such uses represent
308 | the only significant mode of use of the product.
309 |
310 | "Installation Information" for a User Product means any methods,
311 | procedures, authorization keys, or other information required to install
312 | and execute modified versions of a covered work in that User Product from
313 | a modified version of its Corresponding Source. The information must
314 | suffice to ensure that the continued functioning of the modified object
315 | code is in no case prevented or interfered with solely because
316 | modification has been made.
317 |
318 | If you convey an object code work under this section in, or with, or
319 | specifically for use in, a User Product, and the conveying occurs as
320 | part of a transaction in which the right of possession and use of the
321 | User Product is transferred to the recipient in perpetuity or for a
322 | fixed term (regardless of how the transaction is characterized), the
323 | Corresponding Source conveyed under this section must be accompanied
324 | by the Installation Information. But this requirement does not apply
325 | if neither you nor any third party retains the ability to install
326 | modified object code on the User Product (for example, the work has
327 | been installed in ROM).
328 |
329 | The requirement to provide Installation Information does not include a
330 | requirement to continue to provide support service, warranty, or updates
331 | for a work that has been modified or installed by the recipient, or for
332 | the User Product in which it has been modified or installed. Access to a
333 | network may be denied when the modification itself materially and
334 | adversely affects the operation of the network or violates the rules and
335 | protocols for communication across the network.
336 |
337 | Corresponding Source conveyed, and Installation Information provided,
338 | in accord with this section must be in a format that is publicly
339 | documented (and with an implementation available to the public in
340 | source code form), and must require no special password or key for
341 | unpacking, reading or copying.
342 |
343 | 7. Additional Terms.
344 |
345 | "Additional permissions" are terms that supplement the terms of this
346 | License by making exceptions from one or more of its conditions.
347 | Additional permissions that are applicable to the entire Program shall
348 | be treated as though they were included in this License, to the extent
349 | that they are valid under applicable law. If additional permissions
350 | apply only to part of the Program, that part may be used separately
351 | under those permissions, but the entire Program remains governed by
352 | this License without regard to the additional permissions.
353 |
354 | When you convey a copy of a covered work, you may at your option
355 | remove any additional permissions from that copy, or from any part of
356 | it. (Additional permissions may be written to require their own
357 | removal in certain cases when you modify the work.) You may place
358 | additional permissions on material, added by you to a covered work,
359 | for which you have or can give appropriate copyright permission.
360 |
361 | Notwithstanding any other provision of this License, for material you
362 | add to a covered work, you may (if authorized by the copyright holders of
363 | that material) supplement the terms of this License with terms:
364 |
365 | a) Disclaiming warranty or limiting liability differently from the
366 | terms of sections 15 and 16 of this License; or
367 |
368 | b) Requiring preservation of specified reasonable legal notices or
369 | author attributions in that material or in the Appropriate Legal
370 | Notices displayed by works containing it; or
371 |
372 | c) Prohibiting misrepresentation of the origin of that material, or
373 | requiring that modified versions of such material be marked in
374 | reasonable ways as different from the original version; or
375 |
376 | d) Limiting the use for publicity purposes of names of licensors or
377 | authors of the material; or
378 |
379 | e) Declining to grant rights under trademark law for use of some
380 | trade names, trademarks, or service marks; or
381 |
382 | f) Requiring indemnification of licensors and authors of that
383 | material by anyone who conveys the material (or modified versions of
384 | it) with contractual assumptions of liability to the recipient, for
385 | any liability that these contractual assumptions directly impose on
386 | those licensors and authors.
387 |
388 | All other non-permissive additional terms are considered "further
389 | restrictions" within the meaning of section 10. If the Program as you
390 | received it, or any part of it, contains a notice stating that it is
391 | governed by this License along with a term that is a further
392 | restriction, you may remove that term. If a license document contains
393 | a further restriction but permits relicensing or conveying under this
394 | License, you may add to a covered work material governed by the terms
395 | of that license document, provided that the further restriction does
396 | not survive such relicensing or conveying.
397 |
398 | If you add terms to a covered work in accord with this section, you
399 | must place, in the relevant source files, a statement of the
400 | additional terms that apply to those files, or a notice indicating
401 | where to find the applicable terms.
402 |
403 | Additional terms, permissive or non-permissive, may be stated in the
404 | form of a separately written license, or stated as exceptions;
405 | the above requirements apply either way.
406 |
407 | 8. Termination.
408 |
409 | You may not propagate or modify a covered work except as expressly
410 | provided under this License. Any attempt otherwise to propagate or
411 | modify it is void, and will automatically terminate your rights under
412 | this License (including any patent licenses granted under the third
413 | paragraph of section 11).
414 |
415 | However, if you cease all violation of this License, then your
416 | license from a particular copyright holder is reinstated (a)
417 | provisionally, unless and until the copyright holder explicitly and
418 | finally terminates your license, and (b) permanently, if the copyright
419 | holder fails to notify you of the violation by some reasonable means
420 | prior to 60 days after the cessation.
421 |
422 | Moreover, your license from a particular copyright holder is
423 | reinstated permanently if the copyright holder notifies you of the
424 | violation by some reasonable means, this is the first time you have
425 | received notice of violation of this License (for any work) from that
426 | copyright holder, and you cure the violation prior to 30 days after
427 | your receipt of the notice.
428 |
429 | Termination of your rights under this section does not terminate the
430 | licenses of parties who have received copies or rights from you under
431 | this License. If your rights have been terminated and not permanently
432 | reinstated, you do not qualify to receive new licenses for the same
433 | material under section 10.
434 |
435 | 9. Acceptance Not Required for Having Copies.
436 |
437 | You are not required to accept this License in order to receive or
438 | run a copy of the Program. Ancillary propagation of a covered work
439 | occurring solely as a consequence of using peer-to-peer transmission
440 | to receive a copy likewise does not require acceptance. However,
441 | nothing other than this License grants you permission to propagate or
442 | modify any covered work. These actions infringe copyright if you do
443 | not accept this License. Therefore, by modifying or propagating a
444 | covered work, you indicate your acceptance of this License to do so.
445 |
446 | 10. Automatic Licensing of Downstream Recipients.
447 |
448 | Each time you convey a covered work, the recipient automatically
449 | receives a license from the original licensors, to run, modify and
450 | propagate that work, subject to this License. You are not responsible
451 | for enforcing compliance by third parties with this License.
452 |
453 | An "entity transaction" is a transaction transferring control of an
454 | organization, or substantially all assets of one, or subdividing an
455 | organization, or merging organizations. If propagation of a covered
456 | work results from an entity transaction, each party to that
457 | transaction who receives a copy of the work also receives whatever
458 | licenses to the work the party's predecessor in interest had or could
459 | give under the previous paragraph, plus a right to possession of the
460 | Corresponding Source of the work from the predecessor in interest, if
461 | the predecessor has it or can get it with reasonable efforts.
462 |
463 | You may not impose any further restrictions on the exercise of the
464 | rights granted or affirmed under this License. For example, you may
465 | not impose a license fee, royalty, or other charge for exercise of
466 | rights granted under this License, and you may not initiate litigation
467 | (including a cross-claim or counterclaim in a lawsuit) alleging that
468 | any patent claim is infringed by making, using, selling, offering for
469 | sale, or importing the Program or any portion of it.
470 |
471 | 11. Patents.
472 |
473 | A "contributor" is a copyright holder who authorizes use under this
474 | License of the Program or a work on which the Program is based. The
475 | work thus licensed is called the contributor's "contributor version".
476 |
477 | A contributor's "essential patent claims" are all patent claims
478 | owned or controlled by the contributor, whether already acquired or
479 | hereafter acquired, that would be infringed by some manner, permitted
480 | by this License, of making, using, or selling its contributor version,
481 | but do not include claims that would be infringed only as a
482 | consequence of further modification of the contributor version. For
483 | purposes of this definition, "control" includes the right to grant
484 | patent sublicenses in a manner consistent with the requirements of
485 | this License.
486 |
487 | Each contributor grants you a non-exclusive, worldwide, royalty-free
488 | patent license under the contributor's essential patent claims, to
489 | make, use, sell, offer for sale, import and otherwise run, modify and
490 | propagate the contents of its contributor version.
491 |
492 | In the following three paragraphs, a "patent license" is any express
493 | agreement or commitment, however denominated, not to enforce a patent
494 | (such as an express permission to practice a patent or covenant not to
495 | sue for patent infringement). To "grant" such a patent license to a
496 | party means to make such an agreement or commitment not to enforce a
497 | patent against the party.
498 |
499 | If you convey a covered work, knowingly relying on a patent license,
500 | and the Corresponding Source of the work is not available for anyone
501 | to copy, free of charge and under the terms of this License, through a
502 | publicly available network server or other readily accessible means,
503 | then you must either (1) cause the Corresponding Source to be so
504 | available, or (2) arrange to deprive yourself of the benefit of the
505 | patent license for this particular work, or (3) arrange, in a manner
506 | consistent with the requirements of this License, to extend the patent
507 | license to downstream recipients. "Knowingly relying" means you have
508 | actual knowledge that, but for the patent license, your conveying the
509 | covered work in a country, or your recipient's use of the covered work
510 | in a country, would infringe one or more identifiable patents in that
511 | country that you have reason to believe are valid.
512 |
513 | If, pursuant to or in connection with a single transaction or
514 | arrangement, you convey, or propagate by procuring conveyance of, a
515 | covered work, and grant a patent license to some of the parties
516 | receiving the covered work authorizing them to use, propagate, modify
517 | or convey a specific copy of the covered work, then the patent license
518 | you grant is automatically extended to all recipients of the covered
519 | work and works based on it.
520 |
521 | A patent license is "discriminatory" if it does not include within
522 | the scope of its coverage, prohibits the exercise of, or is
523 | conditioned on the non-exercise of one or more of the rights that are
524 | specifically granted under this License. You may not convey a covered
525 | work if you are a party to an arrangement with a third party that is
526 | in the business of distributing software, under which you make payment
527 | to the third party based on the extent of your activity of conveying
528 | the work, and under which the third party grants, to any of the
529 | parties who would receive the covered work from you, a discriminatory
530 | patent license (a) in connection with copies of the covered work
531 | conveyed by you (or copies made from those copies), or (b) primarily
532 | for and in connection with specific products or compilations that
533 | contain the covered work, unless you entered into that arrangement,
534 | or that patent license was granted, prior to 28 March 2007.
535 |
536 | Nothing in this License shall be construed as excluding or limiting
537 | any implied license or other defenses to infringement that may
538 | otherwise be available to you under applicable patent law.
539 |
540 | 12. No Surrender of Others' Freedom.
541 |
542 | If conditions are imposed on you (whether by court order, agreement or
543 | otherwise) that contradict the conditions of this License, they do not
544 | excuse you from the conditions of this License. If you cannot convey a
545 | covered work so as to satisfy simultaneously your obligations under this
546 | License and any other pertinent obligations, then as a consequence you may
547 | not convey it at all. For example, if you agree to terms that obligate you
548 | to collect a royalty for further conveying from those to whom you convey
549 | the Program, the only way you could satisfy both those terms and this
550 | License would be to refrain entirely from conveying the Program.
551 |
552 | 13. Use with the GNU Affero General Public License.
553 |
554 | Notwithstanding any other provision of this License, you have
555 | permission to link or combine any covered work with a work licensed
556 | under version 3 of the GNU Affero General Public License into a single
557 | combined work, and to convey the resulting work. The terms of this
558 | License will continue to apply to the part which is the covered work,
559 | but the special requirements of the GNU Affero General Public License,
560 | section 13, concerning interaction through a network will apply to the
561 | combination as such.
562 |
563 | 14. Revised Versions of this License.
564 |
565 | The Free Software Foundation may publish revised and/or new versions of
566 | the GNU General Public License from time to time. Such new versions will
567 | be similar in spirit to the present version, but may differ in detail to
568 | address new problems or concerns.
569 |
570 | Each version is given a distinguishing version number. If the
571 | Program specifies that a certain numbered version of the GNU General
572 | Public License "or any later version" applies to it, you have the
573 | option of following the terms and conditions either of that numbered
574 | version or of any later version published by the Free Software
575 | Foundation. If the Program does not specify a version number of the
576 | GNU General Public License, you may choose any version ever published
577 | by the Free Software Foundation.
578 |
579 | If the Program specifies that a proxy can decide which future
580 | versions of the GNU General Public License can be used, that proxy's
581 | public statement of acceptance of a version permanently authorizes you
582 | to choose that version for the Program.
583 |
584 | Later license versions may give you additional or different
585 | permissions. However, no additional obligations are imposed on any
586 | author or copyright holder as a result of your choosing to follow a
587 | later version.
588 |
589 | 15. Disclaimer of Warranty.
590 |
591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
599 |
600 | 16. Limitation of Liability.
601 |
602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
610 | SUCH DAMAGES.
611 |
612 | 17. Interpretation of Sections 15 and 16.
613 |
614 | If the disclaimer of warranty and limitation of liability provided
615 | above cannot be given local legal effect according to their terms,
616 | reviewing courts shall apply local law that most closely approximates
617 | an absolute waiver of all civil liability in connection with the
618 | Program, unless a warranty or assumption of liability accompanies a
619 | copy of the Program in return for a fee.
620 |
621 | END OF TERMS AND CONDITIONS
622 |
623 | How to Apply These Terms to Your New Programs
624 |
625 | If you develop a new program, and you want it to be of the greatest
626 | possible use to the public, the best way to achieve this is to make it
627 | free software which everyone can redistribute and change under these terms.
628 |
629 | To do so, attach the following notices to the program. It is safest
630 | to attach them to the start of each source file to most effectively
631 | state the exclusion of warranty; and each file should have at least
632 | the "copyright" line and a pointer to where the full notice is found.
633 |
634 |
635 | Copyright (C)
636 |
637 | This program is free software: you can redistribute it and/or modify
638 | it under the terms of the GNU General Public License as published by
639 | the Free Software Foundation, either version 3 of the License, or
640 | (at your option) any later version.
641 |
642 | This program is distributed in the hope that it will be useful,
643 | but WITHOUT ANY WARRANTY; without even the implied warranty of
644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
645 | GNU General Public License for more details.
646 |
647 | You should have received a copy of the GNU General Public License
648 | along with this program. If not, see .
649 |
650 | Also add information on how to contact you by electronic and paper mail.
651 |
652 | If the program does terminal interaction, make it output a short
653 | notice like this when it starts in an interactive mode:
654 |
655 | Copyright (C)
656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
657 | This is free software, and you are welcome to redistribute it
658 | under certain conditions; type `show c' for details.
659 |
660 | The hypothetical commands `show w' and `show c' should show the appropriate
661 | parts of the General Public License. Of course, your program's commands
662 | might be different; for a GUI interface, you would use an "about box".
663 |
664 | You should also get your employer (if you work as a programmer) or school,
665 | if any, to sign a "copyright disclaimer" for the program, if necessary.
666 | For more information on this, and how to apply and follow the GNU GPL, see
667 | .
668 |
669 | The GNU General Public License does not permit incorporating your program
670 | into proprietary programs. If your program is a subroutine library, you
671 | may consider it more useful to permit linking proprietary applications with
672 | the library. If this is what you want to do, use the GNU Lesser General
673 | Public License instead of this License. But first, please read
674 | .
675 |
--------------------------------------------------------------------------------
/media/process.svg:
--------------------------------------------------------------------------------
1 |
2 |
432 |
--------------------------------------------------------------------------------
| 
|
13 |
14 |