aboutsummaryrefslogtreecommitdiff
path: root/node_modules/fbjs/lib/flattenArray.js
diff options
context:
space:
mode:
authorFlorian Dold <florian.dold@gmail.com>2018-09-20 02:56:13 +0200
committerFlorian Dold <florian.dold@gmail.com>2018-09-20 02:56:13 +0200
commitbbff7403fbf46f9ad92240ac213df8d30ef31b64 (patch)
treec58400ec5124da1c7d56b01aea83309f80a56c3b /node_modules/fbjs/lib/flattenArray.js
parent003fb34971cf63466184351b4db5f7c67df4f444 (diff)
update packages
Diffstat (limited to 'node_modules/fbjs/lib/flattenArray.js')
-rw-r--r--node_modules/fbjs/lib/flattenArray.js46
1 files changed, 0 insertions, 46 deletions
diff --git a/node_modules/fbjs/lib/flattenArray.js b/node_modules/fbjs/lib/flattenArray.js
deleted file mode 100644
index 9c1705826..000000000
--- a/node_modules/fbjs/lib/flattenArray.js
+++ /dev/null
@@ -1,46 +0,0 @@
-"use strict";
-
-/**
- * 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.
- *
- * @typechecks
- *
- */
-
-/**
- * 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) {
- var result = [];
- flatten(array, result);
- return result;
-}
-
-function flatten(array, result) {
- var length = array.length;
- var ii = 0;
-
- while (length--) {
- var current = array[ii++];
- if (Array.isArray(current)) {
- flatten(current, result);
- } else {
- result.push(current);
- }
- }
-}
-
-module.exports = flattenArray; \ No newline at end of file