@kano/stem-daw 0.1.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (67) hide show
  1. package/README.md +253 -0
  2. package/dist/chat-actions-54Z6URC4.js +7 -0
  3. package/dist/chat-actions-54Z6URC4.js.map +1 -0
  4. package/dist/chunk-56PWIP7O.js +1029 -0
  5. package/dist/chunk-56PWIP7O.js.map +1 -0
  6. package/dist/chunk-AAVC7KUW.js +145 -0
  7. package/dist/chunk-AAVC7KUW.js.map +1 -0
  8. package/dist/chunk-KCOOE2OP.js +1764 -0
  9. package/dist/chunk-KCOOE2OP.js.map +1 -0
  10. package/dist/chunk-LO74ZJ4H.js +23923 -0
  11. package/dist/chunk-LO74ZJ4H.js.map +1 -0
  12. package/dist/chunk-OFGZURP6.js +247 -0
  13. package/dist/chunk-OFGZURP6.js.map +1 -0
  14. package/dist/chunk-OYNES5W3.js +3085 -0
  15. package/dist/chunk-OYNES5W3.js.map +1 -0
  16. package/dist/chunk-QQ5NZTHT.js +336 -0
  17. package/dist/chunk-QQ5NZTHT.js.map +1 -0
  18. package/dist/chunk-TBXCZFAY.js +13713 -0
  19. package/dist/chunk-TBXCZFAY.js.map +1 -0
  20. package/dist/chunk-U44X6QP5.js +281 -0
  21. package/dist/chunk-U44X6QP5.js.map +1 -0
  22. package/dist/chunk-UKMELGZL.js +27 -0
  23. package/dist/chunk-UKMELGZL.js.map +1 -0
  24. package/dist/components/DAWView.d.ts +19 -0
  25. package/dist/components/DAWView.js +11 -0
  26. package/dist/components/DAWView.js.map +1 -0
  27. package/dist/daw-controller-BjRWcTol.d.ts +339 -0
  28. package/dist/engine/daw-controller.d.ts +3 -0
  29. package/dist/engine/daw-controller.js +5 -0
  30. package/dist/engine/daw-controller.js.map +1 -0
  31. package/dist/engine/daw-import-stem-fm-config.d.ts +224 -0
  32. package/dist/engine/daw-import-stem-fm-config.js +7 -0
  33. package/dist/engine/daw-import-stem-fm-config.js.map +1 -0
  34. package/dist/fetchStationTracks-SKFT4V3U.js +3 -0
  35. package/dist/fetchStationTracks-SKFT4V3U.js.map +1 -0
  36. package/dist/index.d.ts +308 -0
  37. package/dist/index.js +332 -0
  38. package/dist/index.js.map +1 -0
  39. package/dist/interface-DaRj7RkY.d.ts +66 -0
  40. package/dist/interfaces-5ZlG0Y4Y.d.ts +549 -0
  41. package/dist/media-session-XTP6PP7Q.js +3 -0
  42. package/dist/media-session-XTP6PP7Q.js.map +1 -0
  43. package/dist/note-detection-PPLM7R2H.js +148 -0
  44. package/dist/note-detection-PPLM7R2H.js.map +1 -0
  45. package/dist/sampler-audio-B7MBG3YN.js +3 -0
  46. package/dist/sampler-audio-B7MBG3YN.js.map +1 -0
  47. package/dist/sampler-store-QPHANXYP.js +3 -0
  48. package/dist/sampler-store-QPHANXYP.js.map +1 -0
  49. package/dist/services/track-search-api.d.ts +152 -0
  50. package/dist/services/track-search-api.js +4 -0
  51. package/dist/services/track-search-api.js.map +1 -0
  52. package/dist/store/daw-auth-store.d.ts +31 -0
  53. package/dist/store/daw-auth-store.js +3 -0
  54. package/dist/store/daw-auth-store.js.map +1 -0
  55. package/dist/store/daw-session-store.d.ts +255 -0
  56. package/dist/store/daw-session-store.js +3 -0
  57. package/dist/store/daw-session-store.js.map +1 -0
  58. package/dist/vite/index.d.ts +46 -0
  59. package/dist/vite/index.js +94 -0
  60. package/dist/vite/index.js.map +1 -0
  61. package/dist/workers/analysis-worker.js +379 -0
  62. package/dist/workers/buffer-player-processor-202602.lavv8e32-ts.js +1 -0
  63. package/dist/workers/daw-stem-processor.js +228 -0
  64. package/dist/workers/manifest.json +10 -0
  65. package/dist/workers/phase-vocoder3.js +920 -0
  66. package/dist/workers/realtime-pitch-shift-processor.js +2 -0
  67. package/package.json +151 -0
@@ -0,0 +1,920 @@
1
+ (function(){function r(e,n,t){function o(i,f){if(!n[i]){if(!e[i]){var c="function"==typeof require&&require;if(!f&&c)return c(i,!0);if(u)return u(i,!0);var a=new Error("Cannot find module '"+i+"'");throw a.code="MODULE_NOT_FOUND",a}var p=n[i]={exports:{}};e[i][0].call(p.exports,function(r){var n=e[i][1][r];return o(n||r)},p,p.exports,r,e,n,t)}return n[i].exports}for(var u="function"==typeof require&&require,i=0;i<t.length;i++)o(t[i]);return o}return r})()({1:[function(require,module,exports){
2
+ 'use strict';
3
+
4
+ function FFT(size) {
5
+ this.size = size | 0;
6
+ if (this.size <= 1 || (this.size & (this.size - 1)) !== 0)
7
+ throw new Error('FFT size must be a power of two and bigger than 1');
8
+
9
+ this._csize = size << 1;
10
+
11
+ // NOTE: Use of `var` is intentional for old V8 versions
12
+ var table = new Array(this.size * 2);
13
+ for (var i = 0; i < table.length; i += 2) {
14
+ const angle = Math.PI * i / this.size;
15
+ table[i] = Math.cos(angle);
16
+ table[i + 1] = -Math.sin(angle);
17
+ }
18
+ this.table = table;
19
+
20
+ // Find size's power of two
21
+ var power = 0;
22
+ for (var t = 1; this.size > t; t <<= 1)
23
+ power++;
24
+
25
+ // Calculate initial step's width:
26
+ // * If we are full radix-4 - it is 2x smaller to give inital len=8
27
+ // * Otherwise it is the same as `power` to give len=4
28
+ this._width = power % 2 === 0 ? power - 1 : power;
29
+
30
+ // Pre-compute bit-reversal patterns
31
+ this._bitrev = new Array(1 << this._width);
32
+ for (var j = 0; j < this._bitrev.length; j++) {
33
+ this._bitrev[j] = 0;
34
+ for (var shift = 0; shift < this._width; shift += 2) {
35
+ var revShift = this._width - shift - 2;
36
+ this._bitrev[j] |= ((j >>> shift) & 3) << revShift;
37
+ }
38
+ }
39
+
40
+ this._out = null;
41
+ this._data = null;
42
+ this._inv = 0;
43
+ }
44
+ module.exports = FFT;
45
+
46
+ FFT.prototype.fromComplexArray = function fromComplexArray(complex, storage) {
47
+ var res = storage || new Array(complex.length >>> 1);
48
+ for (var i = 0; i < complex.length; i += 2)
49
+ res[i >>> 1] = complex[i];
50
+ return res;
51
+ };
52
+
53
+ FFT.prototype.createComplexArray = function createComplexArray() {
54
+ const res = new Array(this._csize);
55
+ for (var i = 0; i < res.length; i++)
56
+ res[i] = 0;
57
+ return res;
58
+ };
59
+
60
+ FFT.prototype.toComplexArray = function toComplexArray(input, storage) {
61
+ var res = storage || this.createComplexArray();
62
+ for (var i = 0; i < res.length; i += 2) {
63
+ res[i] = input[i >>> 1];
64
+ res[i + 1] = 0;
65
+ }
66
+ return res;
67
+ };
68
+
69
+ FFT.prototype.completeSpectrum = function completeSpectrum(spectrum) {
70
+ var size = this._csize;
71
+ var half = size >>> 1;
72
+ for (var i = 2; i < half; i += 2) {
73
+ spectrum[size - i] = spectrum[i];
74
+ spectrum[size - i + 1] = -spectrum[i + 1];
75
+ }
76
+ };
77
+
78
+ FFT.prototype.transform = function transform(out, data) {
79
+ if (out === data)
80
+ throw new Error('Input and output buffers must be different');
81
+
82
+ this._out = out;
83
+ this._data = data;
84
+ this._inv = 0;
85
+ this._transform4();
86
+ this._out = null;
87
+ this._data = null;
88
+ };
89
+
90
+ FFT.prototype.realTransform = function realTransform(out, data) {
91
+ if (out === data)
92
+ throw new Error('Input and output buffers must be different');
93
+
94
+ this._out = out;
95
+ this._data = data;
96
+ this._inv = 0;
97
+ this._realTransform4();
98
+ this._out = null;
99
+ this._data = null;
100
+ };
101
+
102
+ FFT.prototype.inverseTransform = function inverseTransform(out, data) {
103
+ if (out === data)
104
+ throw new Error('Input and output buffers must be different');
105
+
106
+ this._out = out;
107
+ this._data = data;
108
+ this._inv = 1;
109
+ this._transform4();
110
+ for (var i = 0; i < out.length; i++)
111
+ out[i] /= this.size;
112
+ this._out = null;
113
+ this._data = null;
114
+ };
115
+
116
+ // radix-4 implementation
117
+ //
118
+ // NOTE: Uses of `var` are intentional for older V8 version that do not
119
+ // support both `let compound assignments` and `const phi`
120
+ FFT.prototype._transform4 = function _transform4() {
121
+ var out = this._out;
122
+ var size = this._csize;
123
+
124
+ // Initial step (permute and transform)
125
+ var width = this._width;
126
+ var step = 1 << width;
127
+ var len = (size / step) << 1;
128
+
129
+ var outOff;
130
+ var t;
131
+ var bitrev = this._bitrev;
132
+ if (len === 4) {
133
+ for (outOff = 0, t = 0; outOff < size; outOff += len, t++) {
134
+ const off = bitrev[t];
135
+ this._singleTransform2(outOff, off, step);
136
+ }
137
+ } else {
138
+ // len === 8
139
+ for (outOff = 0, t = 0; outOff < size; outOff += len, t++) {
140
+ const off = bitrev[t];
141
+ this._singleTransform4(outOff, off, step);
142
+ }
143
+ }
144
+
145
+ // Loop through steps in decreasing order
146
+ var inv = this._inv ? -1 : 1;
147
+ var table = this.table;
148
+ for (step >>= 2; step >= 2; step >>= 2) {
149
+ len = (size / step) << 1;
150
+ var quarterLen = len >>> 2;
151
+
152
+ // Loop through offsets in the data
153
+ for (outOff = 0; outOff < size; outOff += len) {
154
+ // Full case
155
+ var limit = outOff + quarterLen;
156
+ for (var i = outOff, k = 0; i < limit; i += 2, k += step) {
157
+ const A = i;
158
+ const B = A + quarterLen;
159
+ const C = B + quarterLen;
160
+ const D = C + quarterLen;
161
+
162
+ // Original values
163
+ const Ar = out[A];
164
+ const Ai = out[A + 1];
165
+ const Br = out[B];
166
+ const Bi = out[B + 1];
167
+ const Cr = out[C];
168
+ const Ci = out[C + 1];
169
+ const Dr = out[D];
170
+ const Di = out[D + 1];
171
+
172
+ // Middle values
173
+ const MAr = Ar;
174
+ const MAi = Ai;
175
+
176
+ const tableBr = table[k];
177
+ const tableBi = inv * table[k + 1];
178
+ const MBr = Br * tableBr - Bi * tableBi;
179
+ const MBi = Br * tableBi + Bi * tableBr;
180
+
181
+ const tableCr = table[2 * k];
182
+ const tableCi = inv * table[2 * k + 1];
183
+ const MCr = Cr * tableCr - Ci * tableCi;
184
+ const MCi = Cr * tableCi + Ci * tableCr;
185
+
186
+ const tableDr = table[3 * k];
187
+ const tableDi = inv * table[3 * k + 1];
188
+ const MDr = Dr * tableDr - Di * tableDi;
189
+ const MDi = Dr * tableDi + Di * tableDr;
190
+
191
+ // Pre-Final values
192
+ const T0r = MAr + MCr;
193
+ const T0i = MAi + MCi;
194
+ const T1r = MAr - MCr;
195
+ const T1i = MAi - MCi;
196
+ const T2r = MBr + MDr;
197
+ const T2i = MBi + MDi;
198
+ const T3r = inv * (MBr - MDr);
199
+ const T3i = inv * (MBi - MDi);
200
+
201
+ // Final values
202
+ const FAr = T0r + T2r;
203
+ const FAi = T0i + T2i;
204
+
205
+ const FCr = T0r - T2r;
206
+ const FCi = T0i - T2i;
207
+
208
+ const FBr = T1r + T3i;
209
+ const FBi = T1i - T3r;
210
+
211
+ const FDr = T1r - T3i;
212
+ const FDi = T1i + T3r;
213
+
214
+ out[A] = FAr;
215
+ out[A + 1] = FAi;
216
+ out[B] = FBr;
217
+ out[B + 1] = FBi;
218
+ out[C] = FCr;
219
+ out[C + 1] = FCi;
220
+ out[D] = FDr;
221
+ out[D + 1] = FDi;
222
+ }
223
+ }
224
+ }
225
+ };
226
+
227
+ // radix-2 implementation
228
+ //
229
+ // NOTE: Only called for len=4
230
+ FFT.prototype._singleTransform2 = function _singleTransform2(outOff, off,
231
+ step) {
232
+ const out = this._out;
233
+ const data = this._data;
234
+
235
+ const evenR = data[off];
236
+ const evenI = data[off + 1];
237
+ const oddR = data[off + step];
238
+ const oddI = data[off + step + 1];
239
+
240
+ const leftR = evenR + oddR;
241
+ const leftI = evenI + oddI;
242
+ const rightR = evenR - oddR;
243
+ const rightI = evenI - oddI;
244
+
245
+ out[outOff] = leftR;
246
+ out[outOff + 1] = leftI;
247
+ out[outOff + 2] = rightR;
248
+ out[outOff + 3] = rightI;
249
+ };
250
+
251
+ // radix-4
252
+ //
253
+ // NOTE: Only called for len=8
254
+ FFT.prototype._singleTransform4 = function _singleTransform4(outOff, off,
255
+ step) {
256
+ const out = this._out;
257
+ const data = this._data;
258
+ const inv = this._inv ? -1 : 1;
259
+ const step2 = step * 2;
260
+ const step3 = step * 3;
261
+
262
+ // Original values
263
+ const Ar = data[off];
264
+ const Ai = data[off + 1];
265
+ const Br = data[off + step];
266
+ const Bi = data[off + step + 1];
267
+ const Cr = data[off + step2];
268
+ const Ci = data[off + step2 + 1];
269
+ const Dr = data[off + step3];
270
+ const Di = data[off + step3 + 1];
271
+
272
+ // Pre-Final values
273
+ const T0r = Ar + Cr;
274
+ const T0i = Ai + Ci;
275
+ const T1r = Ar - Cr;
276
+ const T1i = Ai - Ci;
277
+ const T2r = Br + Dr;
278
+ const T2i = Bi + Di;
279
+ const T3r = inv * (Br - Dr);
280
+ const T3i = inv * (Bi - Di);
281
+
282
+ // Final values
283
+ const FAr = T0r + T2r;
284
+ const FAi = T0i + T2i;
285
+
286
+ const FBr = T1r + T3i;
287
+ const FBi = T1i - T3r;
288
+
289
+ const FCr = T0r - T2r;
290
+ const FCi = T0i - T2i;
291
+
292
+ const FDr = T1r - T3i;
293
+ const FDi = T1i + T3r;
294
+
295
+ out[outOff] = FAr;
296
+ out[outOff + 1] = FAi;
297
+ out[outOff + 2] = FBr;
298
+ out[outOff + 3] = FBi;
299
+ out[outOff + 4] = FCr;
300
+ out[outOff + 5] = FCi;
301
+ out[outOff + 6] = FDr;
302
+ out[outOff + 7] = FDi;
303
+ };
304
+
305
+ // Real input radix-4 implementation
306
+ FFT.prototype._realTransform4 = function _realTransform4() {
307
+ var out = this._out;
308
+ var size = this._csize;
309
+
310
+ // Initial step (permute and transform)
311
+ var width = this._width;
312
+ var step = 1 << width;
313
+ var len = (size / step) << 1;
314
+
315
+ var outOff;
316
+ var t;
317
+ var bitrev = this._bitrev;
318
+ if (len === 4) {
319
+ for (outOff = 0, t = 0; outOff < size; outOff += len, t++) {
320
+ const off = bitrev[t];
321
+ this._singleRealTransform2(outOff, off >>> 1, step >>> 1);
322
+ }
323
+ } else {
324
+ // len === 8
325
+ for (outOff = 0, t = 0; outOff < size; outOff += len, t++) {
326
+ const off = bitrev[t];
327
+ this._singleRealTransform4(outOff, off >>> 1, step >>> 1);
328
+ }
329
+ }
330
+
331
+ // Loop through steps in decreasing order
332
+ var inv = this._inv ? -1 : 1;
333
+ var table = this.table;
334
+ for (step >>= 2; step >= 2; step >>= 2) {
335
+ len = (size / step) << 1;
336
+ var halfLen = len >>> 1;
337
+ var quarterLen = halfLen >>> 1;
338
+ var hquarterLen = quarterLen >>> 1;
339
+
340
+ // Loop through offsets in the data
341
+ for (outOff = 0; outOff < size; outOff += len) {
342
+ for (var i = 0, k = 0; i <= hquarterLen; i += 2, k += step) {
343
+ var A = outOff + i;
344
+ var B = A + quarterLen;
345
+ var C = B + quarterLen;
346
+ var D = C + quarterLen;
347
+
348
+ // Original values
349
+ var Ar = out[A];
350
+ var Ai = out[A + 1];
351
+ var Br = out[B];
352
+ var Bi = out[B + 1];
353
+ var Cr = out[C];
354
+ var Ci = out[C + 1];
355
+ var Dr = out[D];
356
+ var Di = out[D + 1];
357
+
358
+ // Middle values
359
+ var MAr = Ar;
360
+ var MAi = Ai;
361
+
362
+ var tableBr = table[k];
363
+ var tableBi = inv * table[k + 1];
364
+ var MBr = Br * tableBr - Bi * tableBi;
365
+ var MBi = Br * tableBi + Bi * tableBr;
366
+
367
+ var tableCr = table[2 * k];
368
+ var tableCi = inv * table[2 * k + 1];
369
+ var MCr = Cr * tableCr - Ci * tableCi;
370
+ var MCi = Cr * tableCi + Ci * tableCr;
371
+
372
+ var tableDr = table[3 * k];
373
+ var tableDi = inv * table[3 * k + 1];
374
+ var MDr = Dr * tableDr - Di * tableDi;
375
+ var MDi = Dr * tableDi + Di * tableDr;
376
+
377
+ // Pre-Final values
378
+ var T0r = MAr + MCr;
379
+ var T0i = MAi + MCi;
380
+ var T1r = MAr - MCr;
381
+ var T1i = MAi - MCi;
382
+ var T2r = MBr + MDr;
383
+ var T2i = MBi + MDi;
384
+ var T3r = inv * (MBr - MDr);
385
+ var T3i = inv * (MBi - MDi);
386
+
387
+ // Final values
388
+ var FAr = T0r + T2r;
389
+ var FAi = T0i + T2i;
390
+
391
+ var FBr = T1r + T3i;
392
+ var FBi = T1i - T3r;
393
+
394
+ out[A] = FAr;
395
+ out[A + 1] = FAi;
396
+ out[B] = FBr;
397
+ out[B + 1] = FBi;
398
+
399
+ // Output final middle point
400
+ if (i === 0) {
401
+ var FCr = T0r - T2r;
402
+ var FCi = T0i - T2i;
403
+ out[C] = FCr;
404
+ out[C + 1] = FCi;
405
+ continue;
406
+ }
407
+
408
+ // Do not overwrite ourselves
409
+ if (i === hquarterLen)
410
+ continue;
411
+
412
+ // In the flipped case:
413
+ // MAi = -MAi
414
+ // MBr=-MBi, MBi=-MBr
415
+ // MCr=-MCr
416
+ // MDr=MDi, MDi=MDr
417
+ var ST0r = T1r;
418
+ var ST0i = -T1i;
419
+ var ST1r = T0r;
420
+ var ST1i = -T0i;
421
+ var ST2r = -inv * T3i;
422
+ var ST2i = -inv * T3r;
423
+ var ST3r = -inv * T2i;
424
+ var ST3i = -inv * T2r;
425
+
426
+ var SFAr = ST0r + ST2r;
427
+ var SFAi = ST0i + ST2i;
428
+
429
+ var SFBr = ST1r + ST3i;
430
+ var SFBi = ST1i - ST3r;
431
+
432
+ var SA = outOff + quarterLen - i;
433
+ var SB = outOff + halfLen - i;
434
+
435
+ out[SA] = SFAr;
436
+ out[SA + 1] = SFAi;
437
+ out[SB] = SFBr;
438
+ out[SB + 1] = SFBi;
439
+ }
440
+ }
441
+ }
442
+ };
443
+
444
+ // radix-2 implementation
445
+ //
446
+ // NOTE: Only called for len=4
447
+ FFT.prototype._singleRealTransform2 = function _singleRealTransform2(outOff,
448
+ off,
449
+ step) {
450
+ const out = this._out;
451
+ const data = this._data;
452
+
453
+ const evenR = data[off];
454
+ const oddR = data[off + step];
455
+
456
+ const leftR = evenR + oddR;
457
+ const rightR = evenR - oddR;
458
+
459
+ out[outOff] = leftR;
460
+ out[outOff + 1] = 0;
461
+ out[outOff + 2] = rightR;
462
+ out[outOff + 3] = 0;
463
+ };
464
+
465
+ // radix-4
466
+ //
467
+ // NOTE: Only called for len=8
468
+ FFT.prototype._singleRealTransform4 = function _singleRealTransform4(outOff,
469
+ off,
470
+ step) {
471
+ const out = this._out;
472
+ const data = this._data;
473
+ const inv = this._inv ? -1 : 1;
474
+ const step2 = step * 2;
475
+ const step3 = step * 3;
476
+
477
+ // Original values
478
+ const Ar = data[off];
479
+ const Br = data[off + step];
480
+ const Cr = data[off + step2];
481
+ const Dr = data[off + step3];
482
+
483
+ // Pre-Final values
484
+ const T0r = Ar + Cr;
485
+ const T1r = Ar - Cr;
486
+ const T2r = Br + Dr;
487
+ const T3r = inv * (Br - Dr);
488
+
489
+ // Final values
490
+ const FAr = T0r + T2r;
491
+
492
+ const FBr = T1r;
493
+ const FBi = -T3r;
494
+
495
+ const FCr = T0r - T2r;
496
+
497
+ const FDr = T1r;
498
+ const FDi = T3r;
499
+
500
+ out[outOff] = FAr;
501
+ out[outOff + 1] = 0;
502
+ out[outOff + 2] = FBr;
503
+ out[outOff + 3] = FBi;
504
+ out[outOff + 4] = FCr;
505
+ out[outOff + 5] = 0;
506
+ out[outOff + 6] = FDr;
507
+ out[outOff + 7] = FDi;
508
+ };
509
+
510
+ },{}],2:[function(require,module,exports){
511
+ "use strict";
512
+
513
+ const WEBAUDIO_BLOCK_SIZE = 128;
514
+
515
+
516
+ /** Overlap-Add Node */
517
+ class OLAProcessor extends AudioWorkletProcessor {
518
+ constructor(options) {
519
+ super(options);
520
+
521
+ this.keepReturnTrue = true;
522
+ this.processNow = false;
523
+
524
+ this.nbInputs = options.numberOfInputs;
525
+ this.nbOutputs = options.numberOfOutputs;
526
+
527
+ this.blockSize = options.processorOptions.blockSize;
528
+ // TODO for now, the only support hop size is the size of a web audio block
529
+ this.hopSize = WEBAUDIO_BLOCK_SIZE;
530
+
531
+ this.nbOverlaps = this.blockSize / this.hopSize;
532
+
533
+ this.lastSilencedHopCount = 0;
534
+ this.nbOverlaps2x = this.nbOverlaps * 2;
535
+ this.fakeEmptyInputs = [new Array(2).fill(new Float32Array(WEBAUDIO_BLOCK_SIZE))];
536
+
537
+
538
+ // pre-allocate input buffers (will be reallocated if needed)
539
+ this.inputBuffers = new Array(this.nbInputs);
540
+ this.inputBuffersHead = new Array(this.nbInputs);
541
+ this.inputBuffersToSend = new Array(this.nbInputs);
542
+ // assume 2 channels per input
543
+ for (var i = 0; i < this.nbInputs; i++) {
544
+ this.allocateInputChannels(i, 2);
545
+ }
546
+ // pre-allocate input buffers (will be reallocated if needed)
547
+ this.outputBuffers = new Array(this.nbOutputs);
548
+ this.outputBuffersToRetrieve = new Array(this.nbOutputs);
549
+ // assume 2 channels per output
550
+ for (var i = 0; i < this.nbOutputs; i++) {
551
+ this.allocateOutputChannels(i, 2);
552
+ }
553
+
554
+ this.port.onmessage = (e) => this.keepReturnTrue = false;
555
+ }
556
+
557
+ /** Handles dynamic reallocation of input/output channels buffer
558
+ (channel numbers may vary during lifecycle) **/
559
+ reallocateChannelsIfNeeded(inputs, outputs, force) {
560
+ for (var i = 0; i < this.nbInputs; i++) {
561
+ let nbChannels = inputs[i].length;
562
+ if (force || (nbChannels != this.inputBuffers[i].length)) {
563
+ this.allocateInputChannels(i, nbChannels);
564
+ //console.log("reallocateChannelsIfNeeded");
565
+ }
566
+ }
567
+
568
+ for (var i = 0; i < this.nbOutputs; i++) {
569
+ let nbChannels = outputs[i].length;
570
+ if (force || (nbChannels != this.outputBuffers[i].length)) {
571
+ this.allocateOutputChannels(i, nbChannels);
572
+ //console.log("reallocateChannelsIfNeeded");
573
+ }
574
+ }
575
+ }
576
+
577
+ allocateInputChannels(inputIndex, nbChannels) {
578
+ // allocate input buffers
579
+ // console.log("allocateInputChannels");
580
+
581
+ this.inputBuffers[inputIndex] = new Array(nbChannels);
582
+ for (var i = 0; i < nbChannels; i++) {
583
+ this.inputBuffers[inputIndex][i] = new Float32Array(this.blockSize + WEBAUDIO_BLOCK_SIZE);
584
+ this.inputBuffers[inputIndex][i].fill(0);
585
+ }
586
+
587
+ // allocate input buffers to send and head pointers to copy from
588
+ // (cannot directly send a pointer/subarray because input may be modified)
589
+ this.inputBuffersHead[inputIndex] = new Array(nbChannels);
590
+ this.inputBuffersToSend[inputIndex] = new Array(nbChannels);
591
+ for (var i = 0; i < nbChannels; i++) {
592
+ this.inputBuffersHead[inputIndex][i] = this.inputBuffers[inputIndex][i] .subarray(0, this.blockSize);
593
+ this.inputBuffersToSend[inputIndex][i] = new Float32Array(this.blockSize);
594
+ }
595
+ }
596
+
597
+ allocateOutputChannels(outputIndex, nbChannels) {
598
+ // allocate output buffers
599
+ this.outputBuffers[outputIndex] = new Array(nbChannels);
600
+ for (var i = 0; i < nbChannels; i++) {
601
+ this.outputBuffers[outputIndex][i] = new Float32Array(this.blockSize);
602
+ this.outputBuffers[outputIndex][i].fill(0);
603
+ }
604
+
605
+ // allocate output buffers to retrieve
606
+ // (cannot send a pointer/subarray because new output has to be add to existing output)
607
+ this.outputBuffersToRetrieve[outputIndex] = new Array(nbChannels);
608
+ for (var i = 0; i < nbChannels; i++) {
609
+ this.outputBuffersToRetrieve[outputIndex][i] = new Float32Array(this.blockSize);
610
+ this.outputBuffersToRetrieve[outputIndex][i].fill(0);
611
+ }
612
+ }
613
+
614
+ checkForNotSilence(value) {
615
+ return value !== 0
616
+ }
617
+
618
+ /** Read next web audio block to input buffers **/
619
+ readInputs(inputs) {
620
+ // when playback is paused, we may stop receiving new samples
621
+ /* if (inputs[0].length && inputs[0][0].length == 0) {
622
+ for (var i = 0; i < this.nbInputs; i++) {
623
+ for (var j = 0; j < this.inputBuffers[i].length; j++) {
624
+ this.inputBuffers[i][j].fill(0, this.blockSize);
625
+ }
626
+ }
627
+ return;
628
+ } */
629
+
630
+ for (var i = 0; i < this.nbInputs; i++) {
631
+ for (var j = 0; j < this.inputBuffers[i].length; j++) {
632
+ let webAudioBlock = inputs[i][j];
633
+ this.inputBuffers[i][j]?.set(webAudioBlock, this.blockSize);
634
+ }
635
+ }
636
+ }
637
+
638
+ /** Shift left content of input buffers to receive new web audio block **/
639
+ shiftInputBuffers() {
640
+ for (var i = 0; i < this.nbInputs; i++) {
641
+ for (var j = 0; j < this.inputBuffers[i].length; j++) {
642
+ this.inputBuffers[i][j].copyWithin(0, WEBAUDIO_BLOCK_SIZE);
643
+ }
644
+ }
645
+ }
646
+
647
+ /** Copy contents of input buffers to buffer actually sent to process **/
648
+ prepareInputBuffersToSend() {
649
+ for (var i = 0; i < this.nbInputs; i++) {
650
+ for (var j = 0; j < this.inputBuffers[i].length; j++) {
651
+ this.inputBuffersToSend[i][j].set(this.inputBuffersHead[i][j]);
652
+ }
653
+ }
654
+ }
655
+
656
+ /** Add contents of output buffers just processed to output buffers **/
657
+ handleOutputBuffersToRetrieve() {
658
+ for (var i = 0; i < this.nbOutputs; i++) {
659
+ for (var j = 0; j < this.outputBuffers[i].length; j++) {
660
+ for (var k = 0; k < this.blockSize; k++) {
661
+ this.outputBuffers[i][j][k] += this.outputBuffersToRetrieve[i][j][k] / this.nbOverlaps;
662
+ }
663
+ }
664
+ }
665
+ }
666
+
667
+ /** Write next web audio block from output buffers **/
668
+ writeOutputs(outputs) {
669
+ for (var i = 0; i < this.nbInputs; i++) {
670
+ for (var j = 0; j < this.inputBuffers[i].length; j++) {
671
+ let webAudioBlock = this.outputBuffers[i][j].subarray(0, WEBAUDIO_BLOCK_SIZE);
672
+ outputs[i][j]?.set(webAudioBlock);
673
+ }
674
+ }
675
+ }
676
+
677
+ /** Shift left content of output buffers to receive new web audio block **/
678
+ shiftOutputBuffers() {
679
+ for (var i = 0; i < this.nbOutputs; i++) {
680
+ for (var j = 0; j < this.outputBuffers[i].length; j++) {
681
+ this.outputBuffers[i][j].copyWithin(0, WEBAUDIO_BLOCK_SIZE);
682
+ this.outputBuffers[i][j].subarray(this.blockSize - WEBAUDIO_BLOCK_SIZE).fill(0);
683
+ }
684
+ }
685
+ }
686
+
687
+ process(inputs, outputs, params) {
688
+ //console.log(inputs[0].length ? "active" : "inactive");
689
+ //this.reallocateChannelsIfNeeded(inputs, outputs);
690
+ //if (inputs[0][0].some(this.checkForNotSilence) || inputs[0][1].some(this.checkForNotSilence))
691
+ if (inputs[0].length < 2) {
692
+ //DUE TO CHROME BUG/INCONSISTENCY, WHEN INACTIVE SILENT NODE IS CONNECTED, inputs[0] IS EITHER EMPTY OR CONTAINS 1 CHANNEL OF SILENT AUDIO DATA, REQUIRES SPECIAL HANDLING
693
+ //if (inputs[0][0].some(this.checkForNotSilence)) console.warn("single channel not silence exception!");
694
+ if (this.lastSilencedHopCount < this.nbOverlaps2x) {
695
+ //ALLOW nbOverlaps2x BLOCKS OF SILENCE TO COME THROUGH TO ACCOMODATE LATENCY TAIL
696
+ this.lastSilencedHopCount++;
697
+ inputs = this.fakeEmptyInputs;
698
+ this.processNow = true;
699
+ } else {
700
+ //console.warn("skipping processing");
701
+ if (this.lastSilencedHopCount === this.nbOverlaps2x) {
702
+ this.lastSilencedHopCount++;
703
+ this.reallocateChannelsIfNeeded(this.fakeEmptyInputs, outputs, true);
704
+ //console.warn("reallocateChannels");
705
+ }
706
+ this.processNow = false; //ENABLES SKIPPING UNNEEDED PROCESSING OF SILENT INPUT
707
+ }
708
+ } else {
709
+ if (this.lastSilencedHopCount) {
710
+ this.lastSilencedHopCount = 0;
711
+ //this.reallocateChannelsIfNeeded(inputs, outputs, true);
712
+ //console.warn("reallocateChannels");
713
+ }
714
+ this.processNow = true;
715
+ }
716
+ if (this.processNow) {
717
+ this.readInputs(inputs)
718
+ this.shiftInputBuffers();
719
+ this.prepareInputBuffersToSend();
720
+ this.processOLA(this.inputBuffersToSend, this.outputBuffersToRetrieve, params);
721
+ this.handleOutputBuffersToRetrieve();
722
+ this.writeOutputs(outputs);
723
+ this.shiftOutputBuffers();
724
+ }
725
+ return this.keepReturnTrue;
726
+ }
727
+
728
+ /* processOLA(inputs, outputs, params) {
729
+ console.assert(false, "Not overriden");
730
+ } */
731
+ }
732
+
733
+ module.exports = OLAProcessor;
734
+
735
+ },{}],3:[function(require,module,exports){
736
+ "use strict";
737
+
738
+ const OLAProcessor = require('./ola-processor.js');
739
+ const FFT = require('fft.js');
740
+
741
+ const DEFAULT_BUFFERED_BLOCK_SIZE = 2048;
742
+
743
+ function genHannWindow(length) {
744
+ let win = new Float32Array(length);
745
+ for (var i = 0; i < length; i++) {
746
+ win[i] = 0.5 * (1 - Math.cos(2 * Math.PI * i / length));
747
+ }
748
+ return win;
749
+ }
750
+
751
+ class PhaseVocoderProcessor extends OLAProcessor {
752
+ static get parameterDescriptors() {
753
+ return [{
754
+ name: 'pitchFactor',
755
+ defaultValue: 1.0,
756
+ automationRate: 'k-rate'
757
+ }/* ,
758
+ {
759
+ name: 'pitchCents',
760
+ defaultValue: 0.0,
761
+ automationRate: 'k-rate'
762
+ } */];
763
+ }
764
+
765
+ constructor(options) {
766
+ (options.processorOptions ??= {}).blockSize ??= DEFAULT_BUFFERED_BLOCK_SIZE;
767
+ super(options);
768
+
769
+ //this.port.onmessage = (e) => console.log(e, this);
770
+
771
+ this.fftSize = this.blockSize;
772
+ this.timeCursor = 0;
773
+
774
+ this.hannWindow = genHannWindow(this.blockSize);
775
+
776
+ // prepare FFT and pre-allocate buffers
777
+ this.fft = new FFT(this.fftSize);
778
+ this.freqComplexBuffer = this.fft.createComplexArray();
779
+ this.freqComplexBufferShifted = this.fft.createComplexArray();
780
+ this.timeComplexBuffer = this.fft.createComplexArray();
781
+ this.magnitudes = new Float32Array(this.fftSize / 2 + 1);
782
+ this.peakIndexes = new Int32Array(this.magnitudes.length);
783
+ this.nbPeaks = 0;
784
+ }
785
+
786
+ processOLA(inputs, outputs, parameters) {
787
+ // k-rate automation, param arrays only have single value
788
+ const pitchFactor = parameters.pitchFactor[0]/* || Math.pow(2, (parameters.pitchCents[0]/12)) */;
789
+
790
+ for (var i = 0; i < this.nbInputs; i++) {
791
+ for (var j = 0; j < inputs[i].length; j++) {
792
+ // big assumption here: output is symetric to input
793
+ var input = inputs[i][j];
794
+ var output = outputs[i][j];
795
+
796
+ this.applyHannWindow(input);
797
+
798
+ this.fft.realTransform(this.freqComplexBuffer, input);
799
+
800
+ this.computeMagnitudes();
801
+ this.findPeaks();
802
+ this.shiftPeaks(pitchFactor);
803
+
804
+ this.fft.completeSpectrum(this.freqComplexBufferShifted);
805
+ this.fft.inverseTransform(this.timeComplexBuffer, this.freqComplexBufferShifted);
806
+ this.fft.fromComplexArray(this.timeComplexBuffer, output);
807
+
808
+ this.applyHannWindow(output);
809
+ }
810
+ }
811
+
812
+ this.timeCursor += this.hopSize;
813
+ }
814
+
815
+ /** Apply Hann window in-place */
816
+ applyHannWindow(input) {
817
+ for (var i = 0; i < this.blockSize; i++) {
818
+ input[i] = input[i] * this.hannWindow[i];
819
+ }
820
+ }
821
+
822
+ /** Compute squared magnitudes for peak finding **/
823
+ computeMagnitudes() {
824
+ var i = 0, j = 0;
825
+ while (i < this.magnitudes.length) {
826
+ let real = this.freqComplexBuffer[j];
827
+ let imag = this.freqComplexBuffer[j + 1];
828
+ // no need to sqrt for peak finding
829
+ this.magnitudes[i] = real ** 2 + imag ** 2;
830
+ i+=1;
831
+ j+=2;
832
+ }
833
+ }
834
+
835
+ /** Find peaks in spectrum magnitudes **/
836
+ findPeaks() {
837
+ this.nbPeaks = 0;
838
+ var i = 2;
839
+ let end = this.magnitudes.length - 2;
840
+
841
+ while (i < end) {
842
+ let mag = this.magnitudes[i];
843
+
844
+ if (this.magnitudes[i - 1] >= mag || this.magnitudes[i - 2] >= mag) {
845
+ i++;
846
+ continue;
847
+ }
848
+ if (this.magnitudes[i + 1] >= mag || this.magnitudes[i + 2] >= mag) {
849
+ i++;
850
+ continue;
851
+ }
852
+
853
+ this.peakIndexes[this.nbPeaks] = i;
854
+ this.nbPeaks++;
855
+ i += 2;
856
+ }
857
+ }
858
+
859
+ /** Shift peaks and regions of influence by pitchFactor into new specturm */
860
+ shiftPeaks(pitchFactor) {
861
+ // zero-fill new spectrum
862
+ this.freqComplexBufferShifted.fill(0);
863
+
864
+ for (var i = 0; i < this.nbPeaks; i++) {
865
+ let peakIndex = this.peakIndexes[i];
866
+ let peakIndexShifted = Math.round(peakIndex * pitchFactor);
867
+
868
+ if (peakIndexShifted > this.magnitudes.length) {
869
+ break;
870
+ }
871
+
872
+ // find region of influence
873
+ var startIndex = 0;
874
+ var endIndex = this.fftSize;
875
+ if (i > 0) {
876
+ let peakIndexBefore = this.peakIndexes[i - 1];
877
+ startIndex = peakIndex - Math.floor((peakIndex - peakIndexBefore) / 2);
878
+ }
879
+ if (i < this.nbPeaks - 1) {
880
+ let peakIndexAfter = this.peakIndexes[i + 1];
881
+ endIndex = peakIndex + Math.ceil((peakIndexAfter - peakIndex) / 2);
882
+ }
883
+
884
+ // shift whole region of influence around peak to shifted peak
885
+ let startOffset = startIndex - peakIndex;
886
+ let endOffset = endIndex - peakIndex;
887
+ for (var j = startOffset; j < endOffset; j++) {
888
+ let binIndex = peakIndex + j;
889
+ let binIndexShifted = peakIndexShifted + j;
890
+
891
+ if (binIndexShifted >= this.magnitudes.length) {
892
+ break;
893
+ }
894
+
895
+ // apply phase correction
896
+ let omegaDelta = 2 * Math.PI * (binIndexShifted - binIndex) / this.fftSize;
897
+ let phaseShiftReal = Math.cos(omegaDelta * this.timeCursor);
898
+ let phaseShiftImag = Math.sin(omegaDelta * this.timeCursor);
899
+
900
+ let indexReal = binIndex * 2;
901
+ let indexImag = indexReal + 1;
902
+ let valueReal = this.freqComplexBuffer[indexReal];
903
+ let valueImag = this.freqComplexBuffer[indexImag];
904
+
905
+ let valueShiftedReal = valueReal * phaseShiftReal - valueImag * phaseShiftImag;
906
+ let valueShiftedImag = valueReal * phaseShiftImag + valueImag * phaseShiftReal;
907
+
908
+ let indexShiftedReal = binIndexShifted * 2;
909
+ let indexShiftedImag = indexShiftedReal + 1;
910
+ this.freqComplexBufferShifted[indexShiftedReal] += valueShiftedReal;
911
+ this.freqComplexBufferShifted[indexShiftedImag] += valueShiftedImag;
912
+ }
913
+ }
914
+ }
915
+ }
916
+
917
+ registerProcessor("phase-vocoder-processor", PhaseVocoderProcessor);
918
+
919
+
920
+ },{"./ola-processor.js":2,"fft.js":1}]},{},[3]);