1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
|
/**
* Copyright (c) 2013-present, Facebook, Inc.
* All rights reserved.
*
* This source code is licensed under the BSD-style license found in the
* LICENSE file in the root directory of this source tree. An additional grant
* of patent rights can be found in the PATENTS file in the same directory.
*
* @providesModule flattenArray
* @typechecks
* @flow
*/
/**
* Returns a flattened array that represents the DFS traversal of the supplied
* input array. For example:
*
* var deep = ["a", ["b", "c"], "d", {"e": [1, 2]}, [["f"], "g"]];
* var flat = flattenArray(deep);
* console.log(flat);
* > ["a", "b", "c", "d", {"e": [1, 2]}, "f", "g"];
*
* @see https://github.com/jonschlinkert/arr-flatten
* @copyright 2014-2015 Jon Schlinkert
* @license MIT
*/
function flattenArray(array: Array<any>): Array<any> {
const result = [];
flatten(array, result);
return result;
}
function flatten(array: Array<any>, result: Array<any>): void {
let length = array.length;
let ii = 0;
while (length--) {
const current = array[ii++];
if (Array.isArray(current)) {
flatten(current, result);
} else {
result.push(current);
}
}
}
module.exports = flattenArray;
|
