flow like the river
This commit is contained in:
root
commit
013fe673f3
42435 changed files with 5764238 additions and 0 deletions
23
VISUALIZACION/node_modules/index-array-by/dist/index-array-by.d.ts
generated
vendored
Executable file
23
VISUALIZACION/node_modules/index-array-by/dist/index-array-by.d.ts
generated
vendored
Executable file
|
|
@ -0,0 +1,23 @@
|
|||
type ListItem = any;
|
||||
|
||||
type KeyAccessor = string | ((listItem: ListItem) => string);
|
||||
|
||||
type ReducerFn = (items: ListItem[]) => any;
|
||||
|
||||
interface NestedResult {
|
||||
[key: string]: NestedResult | ListItem | ListItem[];
|
||||
}
|
||||
|
||||
type FlatResult = {
|
||||
keys: string[];
|
||||
vals: ListItem | ListItem[]
|
||||
}[];
|
||||
|
||||
declare function indexBy(
|
||||
list: ListItem[],
|
||||
keyAccessors: KeyAccessor | KeyAccessor[],
|
||||
multiItem?: boolean | ReducerFn,
|
||||
flattenKeys?: boolean
|
||||
): NestedResult | FlatResult;
|
||||
|
||||
export { indexBy as default };
|
||||
205
VISUALIZACION/node_modules/index-array-by/dist/index-array-by.js
generated
vendored
Executable file
205
VISUALIZACION/node_modules/index-array-by/dist/index-array-by.js
generated
vendored
Executable file
|
|
@ -0,0 +1,205 @@
|
|||
// Version 1.4.1 index-array-by - https://github.com/vasturiano/index-array-by
|
||||
(function (global, factory) {
|
||||
typeof exports === 'object' && typeof module !== 'undefined' ? module.exports = factory() :
|
||||
typeof define === 'function' && define.amd ? define(factory) :
|
||||
(global = typeof globalThis !== 'undefined' ? globalThis : global || self, global.indexBy = factory());
|
||||
})(this, (function () { 'use strict';
|
||||
|
||||
function _iterableToArrayLimit(arr, i) {
|
||||
var _i = null == arr ? null : "undefined" != typeof Symbol && arr[Symbol.iterator] || arr["@@iterator"];
|
||||
if (null != _i) {
|
||||
var _s,
|
||||
_e,
|
||||
_x,
|
||||
_r,
|
||||
_arr = [],
|
||||
_n = !0,
|
||||
_d = !1;
|
||||
try {
|
||||
if (_x = (_i = _i.call(arr)).next, 0 === i) {
|
||||
if (Object(_i) !== _i) return;
|
||||
_n = !1;
|
||||
} else for (; !(_n = (_s = _x.call(_i)).done) && (_arr.push(_s.value), _arr.length !== i); _n = !0);
|
||||
} catch (err) {
|
||||
_d = !0, _e = err;
|
||||
} finally {
|
||||
try {
|
||||
if (!_n && null != _i.return && (_r = _i.return(), Object(_r) !== _r)) return;
|
||||
} finally {
|
||||
if (_d) throw _e;
|
||||
}
|
||||
}
|
||||
return _arr;
|
||||
}
|
||||
}
|
||||
function _objectWithoutPropertiesLoose(source, excluded) {
|
||||
if (source == null) return {};
|
||||
var target = {};
|
||||
var sourceKeys = Object.keys(source);
|
||||
var key, i;
|
||||
for (i = 0; i < sourceKeys.length; i++) {
|
||||
key = sourceKeys[i];
|
||||
if (excluded.indexOf(key) >= 0) continue;
|
||||
target[key] = source[key];
|
||||
}
|
||||
return target;
|
||||
}
|
||||
function _objectWithoutProperties(source, excluded) {
|
||||
if (source == null) return {};
|
||||
var target = _objectWithoutPropertiesLoose(source, excluded);
|
||||
var key, i;
|
||||
if (Object.getOwnPropertySymbols) {
|
||||
var sourceSymbolKeys = Object.getOwnPropertySymbols(source);
|
||||
for (i = 0; i < sourceSymbolKeys.length; i++) {
|
||||
key = sourceSymbolKeys[i];
|
||||
if (excluded.indexOf(key) >= 0) continue;
|
||||
if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue;
|
||||
target[key] = source[key];
|
||||
}
|
||||
}
|
||||
return target;
|
||||
}
|
||||
function _slicedToArray(arr, i) {
|
||||
return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _unsupportedIterableToArray(arr, i) || _nonIterableRest();
|
||||
}
|
||||
function _toConsumableArray(arr) {
|
||||
return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _unsupportedIterableToArray(arr) || _nonIterableSpread();
|
||||
}
|
||||
function _arrayWithoutHoles(arr) {
|
||||
if (Array.isArray(arr)) return _arrayLikeToArray(arr);
|
||||
}
|
||||
function _arrayWithHoles(arr) {
|
||||
if (Array.isArray(arr)) return arr;
|
||||
}
|
||||
function _iterableToArray(iter) {
|
||||
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
||||
}
|
||||
function _unsupportedIterableToArray(o, minLen) {
|
||||
if (!o) return;
|
||||
if (typeof o === "string") return _arrayLikeToArray(o, minLen);
|
||||
var n = Object.prototype.toString.call(o).slice(8, -1);
|
||||
if (n === "Object" && o.constructor) n = o.constructor.name;
|
||||
if (n === "Map" || n === "Set") return Array.from(o);
|
||||
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen);
|
||||
}
|
||||
function _arrayLikeToArray(arr, len) {
|
||||
if (len == null || len > arr.length) len = arr.length;
|
||||
for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i];
|
||||
return arr2;
|
||||
}
|
||||
function _nonIterableSpread() {
|
||||
throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
||||
}
|
||||
function _nonIterableRest() {
|
||||
throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
||||
}
|
||||
function _toPrimitive(input, hint) {
|
||||
if (typeof input !== "object" || input === null) return input;
|
||||
var prim = input[Symbol.toPrimitive];
|
||||
if (prim !== undefined) {
|
||||
var res = prim.call(input, hint || "default");
|
||||
if (typeof res !== "object") return res;
|
||||
throw new TypeError("@@toPrimitive must return a primitive value.");
|
||||
}
|
||||
return (hint === "string" ? String : Number)(input);
|
||||
}
|
||||
function _toPropertyKey(arg) {
|
||||
var key = _toPrimitive(arg, "string");
|
||||
return typeof key === "symbol" ? key : String(key);
|
||||
}
|
||||
|
||||
var index = (function () {
|
||||
var list = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : [];
|
||||
var keyAccessors = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : [];
|
||||
var multiItem = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : true;
|
||||
var flattenKeys = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : false;
|
||||
var keys = (keyAccessors instanceof Array ? keyAccessors.length ? keyAccessors : [undefined] : [keyAccessors]).map(function (key) {
|
||||
return {
|
||||
keyAccessor: key,
|
||||
isProp: !(key instanceof Function)
|
||||
};
|
||||
});
|
||||
var indexedResult = list.reduce(function (res, item) {
|
||||
var iterObj = res;
|
||||
var itemVal = item;
|
||||
keys.forEach(function (_ref, idx) {
|
||||
var keyAccessor = _ref.keyAccessor,
|
||||
isProp = _ref.isProp;
|
||||
var key;
|
||||
if (isProp) {
|
||||
var _itemVal = itemVal,
|
||||
propVal = _itemVal[keyAccessor],
|
||||
rest = _objectWithoutProperties(_itemVal, [keyAccessor].map(_toPropertyKey));
|
||||
key = propVal;
|
||||
itemVal = rest;
|
||||
} else {
|
||||
key = keyAccessor(itemVal, idx);
|
||||
}
|
||||
if (idx + 1 < keys.length) {
|
||||
if (!iterObj.hasOwnProperty(key)) {
|
||||
iterObj[key] = {};
|
||||
}
|
||||
iterObj = iterObj[key];
|
||||
} else {
|
||||
// Leaf key
|
||||
if (multiItem) {
|
||||
if (!iterObj.hasOwnProperty(key)) {
|
||||
iterObj[key] = [];
|
||||
}
|
||||
iterObj[key].push(itemVal);
|
||||
} else {
|
||||
iterObj[key] = itemVal;
|
||||
}
|
||||
}
|
||||
});
|
||||
return res;
|
||||
}, {});
|
||||
if (multiItem instanceof Function) {
|
||||
// Reduce leaf multiple values
|
||||
(function reduce(node) {
|
||||
var level = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 1;
|
||||
if (level === keys.length) {
|
||||
Object.keys(node).forEach(function (k) {
|
||||
return node[k] = multiItem(node[k]);
|
||||
});
|
||||
} else {
|
||||
Object.values(node).forEach(function (child) {
|
||||
return reduce(child, level + 1);
|
||||
});
|
||||
}
|
||||
})(indexedResult); // IIFE
|
||||
}
|
||||
|
||||
var result = indexedResult;
|
||||
if (flattenKeys) {
|
||||
// flatten into array
|
||||
result = [];
|
||||
(function flatten(node) {
|
||||
var accKeys = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : [];
|
||||
if (accKeys.length === keys.length) {
|
||||
result.push({
|
||||
keys: accKeys,
|
||||
vals: node
|
||||
});
|
||||
} else {
|
||||
Object.entries(node).forEach(function (_ref2) {
|
||||
var _ref3 = _slicedToArray(_ref2, 2),
|
||||
key = _ref3[0],
|
||||
val = _ref3[1];
|
||||
return flatten(val, [].concat(_toConsumableArray(accKeys), [key]));
|
||||
});
|
||||
}
|
||||
})(indexedResult); //IIFE
|
||||
|
||||
if (keyAccessors instanceof Array && keyAccessors.length === 0 && result.length === 1) {
|
||||
// clear keys if there's no key accessors (single result)
|
||||
result[0].keys = [];
|
||||
}
|
||||
}
|
||||
return result;
|
||||
});
|
||||
|
||||
return index;
|
||||
|
||||
}));
|
||||
//# sourceMappingURL=index-array-by.js.map
|
||||
1
VISUALIZACION/node_modules/index-array-by/dist/index-array-by.js.map
generated
vendored
Executable file
1
VISUALIZACION/node_modules/index-array-by/dist/index-array-by.js.map
generated
vendored
Executable file
File diff suppressed because one or more lines are too long
2
VISUALIZACION/node_modules/index-array-by/dist/index-array-by.min.js
generated
vendored
Executable file
2
VISUALIZACION/node_modules/index-array-by/dist/index-array-by.min.js
generated
vendored
Executable file
|
|
@ -0,0 +1,2 @@
|
|||
// Version 1.4.1 index-array-by - https://github.com/vasturiano/index-array-by
|
||||
!function(t,r){"object"==typeof exports&&"undefined"!=typeof module?module.exports=r():"function"==typeof define&&define.amd?define(r):(t="undefined"!=typeof globalThis?globalThis:t||self).indexBy=r()}(this,(function(){"use strict";function t(t,r){if(null==t)return{};var e,n,o=function(t,r){if(null==t)return{};var e,n,o={},i=Object.keys(t);for(n=0;n<i.length;n++)e=i[n],r.indexOf(e)>=0||(o[e]=t[e]);return o}(t,r);if(Object.getOwnPropertySymbols){var i=Object.getOwnPropertySymbols(t);for(n=0;n<i.length;n++)e=i[n],r.indexOf(e)>=0||Object.prototype.propertyIsEnumerable.call(t,e)&&(o[e]=t[e])}return o}function r(t,r){return function(t){if(Array.isArray(t))return t}(t)||function(t,r){var e=null==t?null:"undefined"!=typeof Symbol&&t[Symbol.iterator]||t["@@iterator"];if(null!=e){var n,o,i,u,a=[],l=!0,f=!1;try{if(i=(e=e.call(t)).next,0===r){if(Object(e)!==e)return;l=!1}else for(;!(l=(n=i.call(e)).done)&&(a.push(n.value),a.length!==r);l=!0);}catch(t){f=!0,o=t}finally{try{if(!l&&null!=e.return&&(u=e.return(),Object(u)!==u))return}finally{if(f)throw o}}return a}}(t,r)||n(t,r)||function(){throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}()}function e(t){return function(t){if(Array.isArray(t))return o(t)}(t)||function(t){if("undefined"!=typeof Symbol&&null!=t[Symbol.iterator]||null!=t["@@iterator"])return Array.from(t)}(t)||n(t)||function(){throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}()}function n(t,r){if(t){if("string"==typeof t)return o(t,r);var e=Object.prototype.toString.call(t).slice(8,-1);return"Object"===e&&t.constructor&&(e=t.constructor.name),"Map"===e||"Set"===e?Array.from(t):"Arguments"===e||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(e)?o(t,r):void 0}}function o(t,r){(null==r||r>t.length)&&(r=t.length);for(var e=0,n=new Array(r);e<r;e++)n[e]=t[e];return n}function i(t){var r=function(t,r){if("object"!=typeof t||null===t)return t;var e=t[Symbol.toPrimitive];if(void 0!==e){var n=e.call(t,r||"default");if("object"!=typeof n)return n;throw new TypeError("@@toPrimitive must return a primitive value.")}return("string"===r?String:Number)(t)}(t,"string");return"symbol"==typeof r?r:String(r)}return function(){var n=arguments.length>0&&void 0!==arguments[0]?arguments[0]:[],o=arguments.length>1&&void 0!==arguments[1]?arguments[1]:[],u=!(arguments.length>2&&void 0!==arguments[2])||arguments[2],a=arguments.length>3&&void 0!==arguments[3]&&arguments[3],l=(o instanceof Array?o.length?o:[void 0]:[o]).map((function(t){return{keyAccessor:t,isProp:!(t instanceof Function)}})),f=n.reduce((function(r,e){var n=r,o=e;return l.forEach((function(r,e){var a,f=r.keyAccessor;if(r.isProp){var c=o,s=c[f],y=t(c,[f].map(i));a=s,o=y}else a=f(o,e);e+1<l.length?(n.hasOwnProperty(a)||(n[a]={}),n=n[a]):u?(n.hasOwnProperty(a)||(n[a]=[]),n[a].push(o)):n[a]=o})),r}),{});u instanceof Function&&function t(r){var e=arguments.length>1&&void 0!==arguments[1]?arguments[1]:1;e===l.length?Object.keys(r).forEach((function(t){return r[t]=u(r[t])})):Object.values(r).forEach((function(r){return t(r,e+1)}))}(f);var c=f;return a&&(c=[],function t(n){var o=arguments.length>1&&void 0!==arguments[1]?arguments[1]:[];o.length===l.length?c.push({keys:o,vals:n}):Object.entries(n).forEach((function(n){var i=r(n,2),u=i[0],a=i[1];return t(a,[].concat(e(o),[u]))}))}(f),o instanceof Array&&0===o.length&&1===c.length&&(c[0].keys=[])),c}}));
|
||||
195
VISUALIZACION/node_modules/index-array-by/dist/index-array-by.mjs
generated
vendored
Executable file
195
VISUALIZACION/node_modules/index-array-by/dist/index-array-by.mjs
generated
vendored
Executable file
|
|
@ -0,0 +1,195 @@
|
|||
function _iterableToArrayLimit(arr, i) {
|
||||
var _i = null == arr ? null : "undefined" != typeof Symbol && arr[Symbol.iterator] || arr["@@iterator"];
|
||||
if (null != _i) {
|
||||
var _s,
|
||||
_e,
|
||||
_x,
|
||||
_r,
|
||||
_arr = [],
|
||||
_n = !0,
|
||||
_d = !1;
|
||||
try {
|
||||
if (_x = (_i = _i.call(arr)).next, 0 === i) {
|
||||
if (Object(_i) !== _i) return;
|
||||
_n = !1;
|
||||
} else for (; !(_n = (_s = _x.call(_i)).done) && (_arr.push(_s.value), _arr.length !== i); _n = !0);
|
||||
} catch (err) {
|
||||
_d = !0, _e = err;
|
||||
} finally {
|
||||
try {
|
||||
if (!_n && null != _i.return && (_r = _i.return(), Object(_r) !== _r)) return;
|
||||
} finally {
|
||||
if (_d) throw _e;
|
||||
}
|
||||
}
|
||||
return _arr;
|
||||
}
|
||||
}
|
||||
function _objectWithoutPropertiesLoose(source, excluded) {
|
||||
if (source == null) return {};
|
||||
var target = {};
|
||||
var sourceKeys = Object.keys(source);
|
||||
var key, i;
|
||||
for (i = 0; i < sourceKeys.length; i++) {
|
||||
key = sourceKeys[i];
|
||||
if (excluded.indexOf(key) >= 0) continue;
|
||||
target[key] = source[key];
|
||||
}
|
||||
return target;
|
||||
}
|
||||
function _objectWithoutProperties(source, excluded) {
|
||||
if (source == null) return {};
|
||||
var target = _objectWithoutPropertiesLoose(source, excluded);
|
||||
var key, i;
|
||||
if (Object.getOwnPropertySymbols) {
|
||||
var sourceSymbolKeys = Object.getOwnPropertySymbols(source);
|
||||
for (i = 0; i < sourceSymbolKeys.length; i++) {
|
||||
key = sourceSymbolKeys[i];
|
||||
if (excluded.indexOf(key) >= 0) continue;
|
||||
if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue;
|
||||
target[key] = source[key];
|
||||
}
|
||||
}
|
||||
return target;
|
||||
}
|
||||
function _slicedToArray(arr, i) {
|
||||
return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _unsupportedIterableToArray(arr, i) || _nonIterableRest();
|
||||
}
|
||||
function _toConsumableArray(arr) {
|
||||
return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _unsupportedIterableToArray(arr) || _nonIterableSpread();
|
||||
}
|
||||
function _arrayWithoutHoles(arr) {
|
||||
if (Array.isArray(arr)) return _arrayLikeToArray(arr);
|
||||
}
|
||||
function _arrayWithHoles(arr) {
|
||||
if (Array.isArray(arr)) return arr;
|
||||
}
|
||||
function _iterableToArray(iter) {
|
||||
if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
|
||||
}
|
||||
function _unsupportedIterableToArray(o, minLen) {
|
||||
if (!o) return;
|
||||
if (typeof o === "string") return _arrayLikeToArray(o, minLen);
|
||||
var n = Object.prototype.toString.call(o).slice(8, -1);
|
||||
if (n === "Object" && o.constructor) n = o.constructor.name;
|
||||
if (n === "Map" || n === "Set") return Array.from(o);
|
||||
if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen);
|
||||
}
|
||||
function _arrayLikeToArray(arr, len) {
|
||||
if (len == null || len > arr.length) len = arr.length;
|
||||
for (var i = 0, arr2 = new Array(len); i < len; i++) arr2[i] = arr[i];
|
||||
return arr2;
|
||||
}
|
||||
function _nonIterableSpread() {
|
||||
throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
||||
}
|
||||
function _nonIterableRest() {
|
||||
throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
|
||||
}
|
||||
function _toPrimitive(input, hint) {
|
||||
if (typeof input !== "object" || input === null) return input;
|
||||
var prim = input[Symbol.toPrimitive];
|
||||
if (prim !== undefined) {
|
||||
var res = prim.call(input, hint || "default");
|
||||
if (typeof res !== "object") return res;
|
||||
throw new TypeError("@@toPrimitive must return a primitive value.");
|
||||
}
|
||||
return (hint === "string" ? String : Number)(input);
|
||||
}
|
||||
function _toPropertyKey(arg) {
|
||||
var key = _toPrimitive(arg, "string");
|
||||
return typeof key === "symbol" ? key : String(key);
|
||||
}
|
||||
|
||||
var index = (function () {
|
||||
var list = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : [];
|
||||
var keyAccessors = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : [];
|
||||
var multiItem = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : true;
|
||||
var flattenKeys = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : false;
|
||||
var keys = (keyAccessors instanceof Array ? keyAccessors.length ? keyAccessors : [undefined] : [keyAccessors]).map(function (key) {
|
||||
return {
|
||||
keyAccessor: key,
|
||||
isProp: !(key instanceof Function)
|
||||
};
|
||||
});
|
||||
var indexedResult = list.reduce(function (res, item) {
|
||||
var iterObj = res;
|
||||
var itemVal = item;
|
||||
keys.forEach(function (_ref, idx) {
|
||||
var keyAccessor = _ref.keyAccessor,
|
||||
isProp = _ref.isProp;
|
||||
var key;
|
||||
if (isProp) {
|
||||
var _itemVal = itemVal,
|
||||
propVal = _itemVal[keyAccessor],
|
||||
rest = _objectWithoutProperties(_itemVal, [keyAccessor].map(_toPropertyKey));
|
||||
key = propVal;
|
||||
itemVal = rest;
|
||||
} else {
|
||||
key = keyAccessor(itemVal, idx);
|
||||
}
|
||||
if (idx + 1 < keys.length) {
|
||||
if (!iterObj.hasOwnProperty(key)) {
|
||||
iterObj[key] = {};
|
||||
}
|
||||
iterObj = iterObj[key];
|
||||
} else {
|
||||
// Leaf key
|
||||
if (multiItem) {
|
||||
if (!iterObj.hasOwnProperty(key)) {
|
||||
iterObj[key] = [];
|
||||
}
|
||||
iterObj[key].push(itemVal);
|
||||
} else {
|
||||
iterObj[key] = itemVal;
|
||||
}
|
||||
}
|
||||
});
|
||||
return res;
|
||||
}, {});
|
||||
if (multiItem instanceof Function) {
|
||||
// Reduce leaf multiple values
|
||||
(function reduce(node) {
|
||||
var level = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 1;
|
||||
if (level === keys.length) {
|
||||
Object.keys(node).forEach(function (k) {
|
||||
return node[k] = multiItem(node[k]);
|
||||
});
|
||||
} else {
|
||||
Object.values(node).forEach(function (child) {
|
||||
return reduce(child, level + 1);
|
||||
});
|
||||
}
|
||||
})(indexedResult); // IIFE
|
||||
}
|
||||
|
||||
var result = indexedResult;
|
||||
if (flattenKeys) {
|
||||
// flatten into array
|
||||
result = [];
|
||||
(function flatten(node) {
|
||||
var accKeys = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : [];
|
||||
if (accKeys.length === keys.length) {
|
||||
result.push({
|
||||
keys: accKeys,
|
||||
vals: node
|
||||
});
|
||||
} else {
|
||||
Object.entries(node).forEach(function (_ref2) {
|
||||
var _ref3 = _slicedToArray(_ref2, 2),
|
||||
key = _ref3[0],
|
||||
val = _ref3[1];
|
||||
return flatten(val, [].concat(_toConsumableArray(accKeys), [key]));
|
||||
});
|
||||
}
|
||||
})(indexedResult); //IIFE
|
||||
|
||||
if (keyAccessors instanceof Array && keyAccessors.length === 0 && result.length === 1) {
|
||||
// clear keys if there's no key accessors (single result)
|
||||
result[0].keys = [];
|
||||
}
|
||||
}
|
||||
return result;
|
||||
});
|
||||
|
||||
export { index as default };
|
||||
Loading…
Add table
Add a link
Reference in a new issue