This app provides monitoring and information features for the common freifunk user and the technical stuff of a freifunk community.
Code base is taken from a TUM Practical Course project and added here to see if Freifunk Altdorf can use it.
https://www.freifunk-altdorf.de
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
45 lines
1.1 KiB
45 lines
1.1 KiB
/** |
|
* Copyright (c) 2013-present, Facebook, Inc. |
|
* |
|
* This source code is licensed under the MIT license found in the |
|
* LICENSE file in the root directory of this source tree. |
|
* |
|
* @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; |