UNPKG

react-carousel-query

Version:

A infinite carousel component made with react that handles the pagination for you.

113 lines (78 loc) 4.92 kB
"use strict"; require("core-js/modules/es.symbol.js"); require("core-js/modules/es.symbol.description.js"); require("core-js/modules/es.symbol.iterator.js"); require("core-js/modules/es.array.iterator.js"); require("core-js/modules/es.string.iterator.js"); require("core-js/modules/web.dom-collections.iterator.js"); require("core-js/modules/es.array.slice.js"); require("core-js/modules/es.function.name.js"); require("core-js/modules/es.array.from.js"); require("core-js/modules/es.regexp.exec.js"); Object.defineProperty(exports, "__esModule", { value: true }); exports.combineParameters = void 0; require("core-js/modules/es.object.to-string.js"); require("core-js/modules/es.array.filter.js"); require("core-js/modules/web.dom-collections.for-each.js"); require("core-js/modules/es.object.entries.js"); require("core-js/modules/es.object.keys.js"); require("core-js/modules/es.array.map.js"); var _isPlainObject = _interopRequireDefault(require("lodash/isPlainObject")); function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; } function _toConsumableArray(arr) { return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _unsupportedIterableToArray(arr) || _nonIterableSpread(); } 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 _iterableToArray(iter) { if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter); } function _arrayWithoutHoles(arr) { if (Array.isArray(arr)) return _arrayLikeToArray(arr); } function _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _unsupportedIterableToArray(arr, i) || _nonIterableRest(); } 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 _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 _iterableToArrayLimit(arr, i) { var _i = arr == null ? null : typeof Symbol !== "undefined" && arr[Symbol.iterator] || arr["@@iterator"]; if (_i == null) return; var _arr = []; var _n = true; var _d = false; var _s, _e; try { for (_i = _i.call(arr); !(_n = (_s = _i.next()).done); _n = true) { _arr.push(_s.value); if (i && _arr.length === i) break; } } catch (err) { _d = true; _e = err; } finally { try { if (!_n && _i["return"] != null) _i["return"](); } finally { if (_d) throw _e; } } return _arr; } function _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; } /** * Safely combine parameters recursively. Only copy objects when needed. * Algorithm = always overwrite the existing value UNLESS both values * are plain objects. In this case flag the key as "special" and handle * it with a heuristic. */ var combineParameters = function combineParameters() { for (var _len = arguments.length, parameterSets = new Array(_len), _key = 0; _key < _len; _key++) { parameterSets[_key] = arguments[_key]; } var mergeKeys = {}; var combined = parameterSets.filter(Boolean).reduce(function (acc, p) { Object.entries(p).forEach(function (_ref) { var _ref2 = _slicedToArray(_ref, 2), key = _ref2[0], value = _ref2[1]; var existing = acc[key]; if (Array.isArray(value) || typeof existing === 'undefined') { acc[key] = value; } else if ((0, _isPlainObject.default)(value) && (0, _isPlainObject.default)(existing)) { // do nothing, we'll handle this later mergeKeys[key] = true; } else if (typeof value !== 'undefined') { acc[key] = value; } }); return acc; }, {}); Object.keys(mergeKeys).forEach(function (key) { var mergeValues = parameterSets.filter(Boolean).map(function (p) { return p[key]; }).filter(function (value) { return typeof value !== 'undefined'; }); if (mergeValues.every(function (value) { return (0, _isPlainObject.default)(value); })) { combined[key] = combineParameters.apply(void 0, _toConsumableArray(mergeValues)); } else { combined[key] = mergeValues[mergeValues.length - 1]; } }); return combined; }; exports.combineParameters = combineParameters;