"use strict"; exports.__esModule = true; exports["default"] = void 0; var _ramda = require("ramda"); var _isNotNil = _interopRequireDefault(require("./isNotNil")); var _isNonEmptyArray = _interopRequireDefault(require("./isNonEmptyArray")); var _stubUndefined = _interopRequireDefault(require("./stubUndefined")); 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 _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 _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 _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; } /** * Can be used as a way to compose multiple invokers together to form polymorphic functions, * or functions that exhibit different behaviors based on their argument(s). * Consumes dispatching functions and keep trying to invoke each in turn, until a non-nil value is returned. * * Accepts a list of dispatching functions and returns a new function. * When invoked, this new function is applied to some arguments, * each dispatching function is applied to those same arguments until one of the * dispatching functions returns a non-nil value. * * @func dispatch * @memberOf RA * @since {@link https://char0n.github.io/ramda-adjunct/2.6.0|v2.6.0} * @category Function * @sig [((a, b, ...) -> x1), ((a, b, ...) -> x2), ...] -> x1 | x2 | ... * @param {!Array} functions A list of functions * @return {*|undefined} Returns the first not-nil value, or undefined if either an empty list is provided or none of the dispatching functions returns a non-nil value * @see {@link RA.isNotNil} * @example * * // returns first non-nil value * const stubNil = () => null; * const stubUndefined = () => undefined; * const addOne = v => v + 1; * const addTwo = v => v + 2; * * RA.dispatch([stubNil, stubUndefined, addOne, addTwo])(1); //=> 2 * * // acts as a switch * const fnSwitch = RA.dispatch([ * R.ifElse(RA.isString, s => `${s}-join`, RA.stubUndefined), * R.ifElse(RA.isNumber, n => n + 1, RA.stubUndefined), * R.ifElse(RA.isDate, R.T, RA.stubUndefined), * ]); * fnSwitch(1); //=> 2 */ var byArity = (0, _ramda.comparator)(function (a, b) { return a.length > b.length; }); var getMaxArity = (0, _ramda.pipe)((0, _ramda.sort)(byArity), _ramda.head, (0, _ramda.prop)('length')); var iteratorFn = (0, _ramda.curry)(function (args, accumulator, fn) { var result = fn.apply(void 0, _toConsumableArray(args)); return (0, _isNotNil["default"])(result) ? (0, _ramda.reduced)(result) : accumulator; }); var dispatchImpl = function dispatchImpl(functions) { var arity = getMaxArity(functions); return (0, _ramda.curryN)(arity, function () { for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) { args[_key] = arguments[_key]; } return (0, _ramda.reduce)(iteratorFn(args), undefined, functions); }); }; var dispatch = (0, _ramda.ifElse)(_isNonEmptyArray["default"], dispatchImpl, _stubUndefined["default"]); var _default = dispatch; exports["default"] = _default;