1
|
|
|
/* |
2
|
|
|
* Copyright (c) 2017-2019 Rafael da Silva Rocha. |
3
|
|
|
* |
4
|
|
|
* Permission is hereby granted, free of charge, to any person obtaining |
5
|
|
|
* a copy of this software and associated documentation files (the |
6
|
|
|
* "Software"), to deal in the Software without restriction, including |
7
|
|
|
* without limitation the rights to use, copy, modify, merge, publish, |
8
|
|
|
* distribute, sublicense, and/or sell copies of the Software, and to |
9
|
|
|
* permit persons to whom the Software is furnished to do so, subject to |
10
|
|
|
* the following conditions: |
11
|
|
|
* |
12
|
|
|
* The above copyright notice and this permission notice shall be |
13
|
|
|
* included in all copies or substantial portions of the Software. |
14
|
|
|
* |
15
|
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, |
16
|
|
|
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF |
17
|
|
|
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND |
18
|
|
|
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE |
19
|
|
|
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION |
20
|
|
|
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION |
21
|
|
|
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. |
22
|
|
|
* |
23
|
|
|
*/ |
24
|
|
|
|
25
|
|
|
/** |
26
|
|
|
* @fileoverview The interleave function. |
27
|
|
|
* @see https://github.com/rochars/wavefile |
28
|
|
|
*/ |
29
|
|
|
|
30
|
|
|
/** |
31
|
|
|
* Interleave de-interleaved samples. |
32
|
|
|
* @param {!Array<number>|!Array<!Array<number>>|!TypedArray} samples |
33
|
|
|
* The samples. |
34
|
|
|
* @return {!Array<number>|!Array<!Array<number>>|!TypedArray} |
35
|
|
|
*/ |
36
|
|
|
export default function interleave(samples) { |
37
|
|
|
if (samples.length > 0) { |
38
|
|
|
if (samples[0].constructor === Array) { |
39
|
|
|
/** @type {!Array<number>} */ |
40
|
|
|
let finalSamples = []; |
41
|
|
|
for (let i = 0, len = samples[0].length; i < len; i++) { |
42
|
|
|
for (let j = 0, subLen = samples.length; j < subLen; j++) { |
43
|
|
|
finalSamples.push(samples[j][i]); |
44
|
|
|
} |
45
|
|
|
} |
46
|
|
|
samples = finalSamples; |
47
|
|
|
} |
48
|
|
|
} |
49
|
|
|
return samples; |
50
|
|
|
} |
51
|
|
|
|