ramda-adjunct 3.3.0 → 4.0.0

package/lib/mergeProp.js

@@ -2,13 +2,9 @@
 
 exports.__esModule = true;
 exports["default"] = void 0;
-
 var _ramda = require("ramda");
-
 var _mergePath = _interopRequireDefault(require("./mergePath"));
-
 function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "default": obj }; }
-
 /**
  * Create a new object with the own properties of the object under the `p`
  * merged with the own properties of the provided `source`.
@@ -33,7 +29,7 @@ function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "d
  * ); //=> { outer: { foo: 3, bar: 4 } };
  */
 var mergeProp = (0, _ramda.curry)(function (p, subj, obj) {
-  return (0, _mergePath["default"])((0, _ramda.of)(p), subj, obj);
+  return (0, _mergePath["default"])((0, _ramda.of)(Array, p), subj, obj);
 });
 var _default = mergeProp;
 exports["default"] = _default;

package/lib/mergeProps.js

@@ -2,9 +2,7 @@
 
 exports.__esModule = true;
 exports["default"] = void 0;
-
 var _ramda = require("ramda");
-
 /**
  * Functional equivalent of merging object properties with object spread operator.
  *

package/lib/move.js

@@ -2,9 +2,7 @@
 
 exports.__esModule = true;
 exports["default"] = void 0;
-
 var _ramda = require("ramda");
-
 /**
  * Returns a new list with the item at the position `fromIdx` moved to the position `toIdx`. If the
  * `toIdx` is out of the `list` range, the item will be placed at the last position of the `list`.

package/lib/nand.js

@@ -2,9 +2,7 @@
 
 exports.__esModule = true;
 exports["default"] = void 0;
-
 var _ramda = require("ramda");
-
 /**
  * Returns false if both arguments are truthy; true otherwise.
  *
@@ -28,6 +26,5 @@ var _ramda = require("ramda");
  * RA.nand(0, 0); //=> true
  */
 var nand = (0, _ramda.complement)(_ramda.and); // eslint-disable-line ramda/complement-simplification
-
 var _default = nand;
 exports["default"] = _default;

package/lib/neither.js

@@ -2,11 +2,8 @@
 
 exports.__esModule = true;
 exports["default"] = void 0;
-
 var _ramda = require("ramda");
-
 /* eslint-disable max-len */
-
 /**
  * A function which calls the two provided functions and returns the complement of `||`ing the
  * results.
@@ -38,7 +35,6 @@ var _ramda = require("ramda");
  * f(11); //=> false
  * f(9); //=> true
  */
-
 /* eslint-enable max-len */
 var neither = (0, _ramda.curry)((0, _ramda.compose)(_ramda.complement, _ramda.either));
 var _default = neither;

package/lib/noneP.js

@@ -2,17 +2,11 @@
 
 exports.__esModule = true;
 exports["default"] = void 0;
-
 var _ramda = require("ramda");
-
 var _allP = _interopRequireDefault(require("./allP"));
-
 var _rejectP = _interopRequireDefault(require("./rejectP"));
-
 var _resolveP = _interopRequireDefault(require("./resolveP"));
-
 function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "default": obj }; }
-
 /**
  * Returns a Promise that is resolved with an array of reasons when all of the provided Promises reject, or rejected when any Promise is resolved.
  * This pattern is like allP, but fulfillments and rejections are transposed - rejections become the fulfillment values and vice versa.

package/lib/nonePass.js

@@ -2,9 +2,7 @@
 
 exports.__esModule = true;
 exports["default"] = void 0;
-
 var _ramda = require("ramda");
-
 /**
  * Takes a list of predicates and returns a predicate that returns true for a given list of
  * arguments if none of the provided predicates are satisfied by those arguments. It is the

package/lib/noop.js

@@ -2,13 +2,9 @@
 
 exports.__esModule = true;
 exports["default"] = void 0;
-
 var _ramda = require("ramda");
-
 var _stubUndefined = _interopRequireDefault(require("./stubUndefined"));
-
 function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "default": obj }; }
-
 /**
  * A function that performs no operations.
  *

package/lib/nor.js

@@ -2,9 +2,7 @@
 
 exports.__esModule = true;
 exports["default"] = void 0;
-
 var _ramda = require("ramda");
-
 /**
  * Returns true if both arguments are falsy; false otherwise.
  *
@@ -29,6 +27,5 @@ var _ramda = require("ramda");
  * RA.nor(0, 0); //=> true
  */
 var nor = (0, _ramda.complement)(_ramda.or); // eslint-disable-line ramda/complement-simplification
-
 var _default = nor;
 exports["default"] = _default;

package/lib/notAllPass.js

@@ -2,9 +2,7 @@
 
 exports.__esModule = true;
 exports["default"] = void 0;
-
 var _ramda = require("ramda");
-
 /**
  * Takes a list of predicates and returns a predicate that returns true for a given list of
  * arguments if one or more of the provided predicates is not satisfied by those arguments. It is

package/lib/notAllUnique.js

@@ -2,13 +2,9 @@
 
 exports.__esModule = true;
 exports["default"] = void 0;
-
 var _ramda = require("ramda");
-
 var _allUnique = _interopRequireDefault(require("./allUnique"));
-
 function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "default": obj }; }
-
 /**
  * Returns true if at least one item of the list is repeated. `R.equals` is used to determine equality.
  *

package/lib/notBoth.js

@@ -2,11 +2,8 @@
 
 exports.__esModule = true;
 exports["default"] = void 0;
-
 var _ramda = require("ramda");
-
 /* eslint-disable max-len */
-
 /**
  * A function which calls the two provided functions and returns the complement of `&&`ing the
  * results.
@@ -38,7 +35,6 @@ var _ramda = require("ramda");
  * f(11); //=> true
  * f(9); //=> true
  */
-
 /* eslint-enable max-len */
 var notBoth = (0, _ramda.curry)((0, _ramda.compose)(_ramda.complement, _ramda.both));
 var _default = notBoth;

package/lib/notEqual.js

@@ -2,9 +2,7 @@
 
 exports.__esModule = true;
 exports["default"] = void 0;
-
 var _ramda = require("ramda");
-
 /**
  * Returns `true` if its arguments are not equivalent, `false` otherwise. Handles
  * cyclical data structures.

package/lib/omitBy.js

@@ -2,11 +2,8 @@
 
 exports.__esModule = true;
 exports["default"] = void 0;
-
 var _ramda = require("ramda");
-
 /* eslint-disable max-len */
-
 /**
  * Returns a partial copy of an object containing only the keys
  * that don't satisfy the supplied predicate.
@@ -25,7 +22,6 @@ var _ramda = require("ramda");
  * const isLowerCase = (val, key) => key.toLowerCase() === key;
  * RA.omitBy(isLowerCase, {a: 1, b: 2, A: 3, B: 4}); //=> {A: 3, B: 4}
  */
-
 /* eslint-enable max-len */
 var omitBy = (0, _ramda.useWith)(_ramda.pickBy, [_ramda.complement, _ramda.identity]);
 var _default = omitBy;

package/lib/omitIndexes.js

@@ -2,14 +2,13 @@
 
 exports.__esModule = true;
 exports["default"] = void 0;
-
 var _ramda = require("ramda");
-
 // helpers
 var rejectIndexed = (0, _ramda.addIndex)(_ramda.reject);
 var containsIndex = (0, _ramda.curry)(function (indexes, val, index) {
   return (0, _ramda.includes)(index, indexes);
 });
+
 /**
  * Returns a partial copy of an array omitting the indexes specified.
  *
@@ -26,7 +25,6 @@ var containsIndex = (0, _ramda.curry)(function (indexes, val, index) {
  *
  * RA.omitIndexes([-1, 1, 3], ['a', 'b', 'c', 'd']); //=> ['a', 'c']
  */
-
 var omitIndexes = (0, _ramda.curry)(function (indexes, list) {
   return rejectIndexed(containsIndex(indexes), list);
 });

package/lib/overlaps.js

@@ -2,13 +2,9 @@
 
 exports.__esModule = true;
 exports["default"] = void 0;
-
 var _ramda = require("ramda");
-
 var _isNotEmpty = _interopRequireDefault(require("./isNotEmpty"));
-
 function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "default": obj }; }
-
 /**
  * Returns true if two lists have at least one element common to both lists.
  *
@@ -27,11 +23,11 @@ function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "d
  * RA.overlaps([1, 2, 3], [3, 4, 5]); //=> true
  * RA.overlaps([1, 2, 3], [4, 5]); //=> false
  */
+
 var overlaps = (0, _ramda.curryN)(2, function (list1, list2) {
   if ((0, _ramda.isEmpty)(list1)) {
     return true;
   }
-
   return (0, _ramda.pipe)(_ramda.intersection, _isNotEmpty["default"])(list1, list2);
 });
 var _default = overlaps;

package/lib/padCharsEnd.js

@@ -2,18 +2,14 @@
 
 exports.__esModule = true;
 exports.padEndPonyfill = exports.padEndInvoker = exports["default"] = void 0;
-
 var _ramda = require("ramda");
-
 var _String = _interopRequireDefault(require("./internal/ponyfills/String.padEnd"));
-
 var _isFunction = _interopRequireDefault(require("./isFunction"));
-
 function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "default": obj }; }
-
 var padEndPonyfill = (0, _ramda.curry)(_String["default"]);
 exports.padEndPonyfill = padEndPonyfill;
 var padEndInvoker = (0, _ramda.flip)((0, _ramda.invoker)(2, 'padEnd'));
+
 /**
  * The function pads the current string with a given string
  * (repeated, if needed) so that the resulting string reaches a given length.
@@ -37,7 +33,6 @@ var padEndInvoker = (0, _ramda.flip)((0, _ramda.invoker)(2, 'padEnd'));
  * RA.padCharsEnd('foo', 10, 'abc'); // => 'abcfoofoof'
  * RA.padCharsEnd('123456', 6, 'abc'); // => 'abc123'
  */
-
 exports.padEndInvoker = padEndInvoker;
 var padCharsEnd = (0, _isFunction["default"])(String.prototype.padEnd) ? padEndInvoker : padEndPonyfill;
 var _default = padCharsEnd;

package/lib/padCharsStart.js

@@ -2,18 +2,14 @@
 
 exports.__esModule = true;
 exports.padStartPonyfill = exports.padStartInvoker = exports["default"] = void 0;
-
 var _ramda = require("ramda");
-
 var _isFunction = _interopRequireDefault(require("./isFunction"));
-
 var _String = _interopRequireDefault(require("./internal/ponyfills/String.padStart"));
-
 function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "default": obj }; }
-
 var padStartInvoker = (0, _ramda.flip)((0, _ramda.invoker)(2, 'padStart'));
 exports.padStartInvoker = padStartInvoker;
 var padStartPonyfill = (0, _ramda.curry)(_String["default"]);
+
 /**
  * The function pads the current string with a given string
  * (repeated, if needed) so that the resulting string reaches a given length.
@@ -35,7 +31,6 @@ var padStartPonyfill = (0, _ramda.curry)(_String["default"]);
  * RA.padCharsStart('foo', 10, 'abc'); // => 'foofoofabc'
  * RA.padCharsStart('123456', 6, 'abc'); // => '123abc'
  */
-
 exports.padStartPonyfill = padStartPonyfill;
 var padCharsStart = (0, _isFunction["default"])(String.prototype.padStart) ? padStartInvoker : padStartPonyfill;
 var _default = padCharsStart;

package/lib/padEnd.js

@@ -2,11 +2,8 @@
 
 exports.__esModule = true;
 exports["default"] = void 0;
-
 var _padCharsEnd = _interopRequireDefault(require("./padCharsEnd"));
-
 function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "default": obj }; }
-
 /**
  * The function pads the current string with an empty string
  * so that the resulting string reaches a given length.

package/lib/padStart.js

@@ -2,11 +2,8 @@
 
 exports.__esModule = true;
 exports["default"] = void 0;
-
 var _padCharsStart = _interopRequireDefault(require("./padCharsStart"));
-
 function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "default": obj }; }
-
 /**
  * Pads string on the left side if it's shorter than length.
  *

package/lib/pathNotEq.js

@@ -2,11 +2,8 @@
 
 exports.__esModule = true;
 exports["default"] = void 0;
-
 var _ramda = require("ramda");
-
 /* eslint-disable max-len */
-
 /**
  * Determines whether a nested path on an object doesn't have a specific value,
  * in R.equals terms. Most likely used to filter a list.
@@ -15,10 +12,10 @@ var _ramda = require("ramda");
  * @memberOf RA
  * @since {@link https://char0n.github.io/ramda-adjunct/2.4.0|v2.4.0}
  * @category Relation
- * @sig [Idx] => a => {a} => Boolean
- * @sig Idx = String | Int
- * @param {Array} path The path of the nested property to use
+ * @sig a => [Idx] => {a} => Boolean
+ * @sig Idx = String | Int | Symbol
  * @param {a} val The value to compare the nested property with
+ * @param {Array} path The path of the nested property to use
  * @param {Object} object The object to check the nested property in
  * @return {boolean} Returns Boolean `false` if the value equals the nested object property, `true` otherwise
  * @see {@link http://ramdajs.com/docs/#pathEq|R.pathEq}
@@ -28,10 +25,9 @@ var _ramda = require("ramda");
  * const user2 = { address: { zipCode: 55555 } };
  * const user3 = { name: 'Bob' };
  * const users = [ user1, user2, user3 ];
- * const isFamous = R.pathNotEq(['address', 'zipCode'], 90210);
+ * const isFamous = R.pathNotEq(90210, ['address', 'zipCode']);
  * R.filter(isFamous, users); //=> [ user2, user3 ]
  */
-
 /* eslint-enable max-len */
 var pathNotEq = (0, _ramda.complement)(_ramda.pathEq);
 var _default = pathNotEq;

package/lib/pathOrLazy.js

@@ -2,9 +2,7 @@
 
 exports.__esModule = true;
 exports["default"] = void 0;
-
 var _ramda = require("ramda");
-
 /**
  * If the given, non-null object has a value at the given path, returns the value at that path.
  * Otherwise returns the result of invoking the provided function with the object.

package/lib/paths.js

@@ -2,9 +2,7 @@
 
 exports.__esModule = true;
 exports["default"] = void 0;
-
 var _ramda = require("ramda");
-
 /**
  * Acts as multiple path: arrays of paths in, array of values out. Preserves order.
  *

package/lib/pickIndexes.js

@@ -2,14 +2,13 @@
 
 exports.__esModule = true;
 exports["default"] = void 0;
-
 var _ramda = require("ramda");
-
 // helpers
 var filterIndexed = (0, _ramda.addIndex)(_ramda.filter);
 var containsIndex = (0, _ramda.curry)(function (indexes, val, index) {
   return (0, _ramda.includes)(index, indexes);
 });
+
 /**
  * Picks values from list by indexes.
  *
@@ -29,7 +28,6 @@ var containsIndex = (0, _ramda.curry)(function (indexes, val, index) {
  *
  * RA.pickIndexes([0, 2], ['a', 'b', 'c']); //=> ['a', 'c']
  */
-
 var pickIndexes = (0, _ramda.curry)(function (indexes, list) {
   return filterIndexed(containsIndex(indexes), list);
 });

package/lib/propNotEq.js

@@ -2,9 +2,7 @@
 
 exports.__esModule = true;
 exports["default"] = void 0;
-
 var _ramda = require("ramda");
-
 /**
  * Returns true if the specified object property is not equal,
  * in R.equals terms, to the given value; false otherwise.
@@ -13,9 +11,9 @@ var _ramda = require("ramda");
  * @memberOf RA
  * @since {@link https://char0n.github.io/ramda-adjunct/2.3.0|v2.3.0}
  * @category Relation
- * @sig  String -> a -> Object -> Boolean
- * @param {String} name The property to pick
+ * @sig  a -> String -> Object -> Boolean
  * @param {a} val The value to compare to
+ * @param {String} name The property to pick
  * @param {Object} object The object, that presumably contains value under the property
  * @return {boolean} Comparison result
  * @see {@link http://ramdajs.com/docs/#propEq|R.propEq}
@@ -26,7 +24,7 @@ var _ramda = require("ramda");
  * const rusty = { name: 'Rusty', age: 10, hair: 'brown' };
  * const alois = { name: 'Alois', age: 15, disposition: 'surly' };
  * const kids = [abby, fred, rusty, alois];
- * const hasNotBrownHair = RA.propNotEq('hair', 'brown');
+ * const hasNotBrownHair = RA.propNotEq('brown', 'hair');
  *
  * R.filter(hasNotBrownHair, kids); //=> [abby, alois]
  */

package/lib/rangeStep.js

@@ -2,13 +2,9 @@
 
 exports.__esModule = true;
 exports["default"] = void 0;
-
 var _ramda = require("ramda");
-
 var _floor = _interopRequireDefault(require("./floor"));
-
 function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "default": obj }; }
-
 /**
  * Creates an array of numbers (positive and/or negative) progressing from start up to, but not including, end.
  *

package/lib/reduceIndexed.js

@@ -2,9 +2,7 @@
 
 exports.__esModule = true;
 exports["default"] = void 0;
-
 var _ramda = require("ramda");
-
 /**
  * {@link http://ramdajs.com/docs/#reduce|R.reduce} function that more closely resembles Array.prototype.reduce.
  * It takes two new parameters to its callback function: the current index, and the entire list.

package/lib/reduceP.js

@@ -2,31 +2,18 @@
 
 exports.__esModule = true;
 exports["default"] = void 0;
-
 var _ramda = require("ramda");
-
 var _isUndefined = _interopRequireDefault(require("./isUndefined"));
-
 var _resolveP = _interopRequireDefault(require("./resolveP"));
-
 var _allP = _interopRequireDefault(require("./allP"));
-
 function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "default": obj }; }
-
 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 _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 = 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 _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }
-
 /* eslint-disable max-len */
-
 /**
  * Given an `Iterable`(arrays are `Iterable`), or a promise of an `Iterable`,
  * which produces promises (or a mix of promises and values),
@@ -90,28 +77,23 @@ function _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }
  * ); // => Promise(10)
  *
  */
-
 /* esline-enable max-len */
 var reduceP = (0, _ramda.curryN)(3, function (fn, acc, list) {
   return (0, _resolveP["default"])(list).then(function (iterable) {
     var listLength = (0, _ramda.length)(iterable);
-
     if (listLength === 0) {
       return acc;
     }
-
     var reducer = (0, _ramda.reduce)(function (accP, currentValueP) {
       return accP.then(function (previousValue) {
         return (0, _allP["default"])([previousValue, currentValueP]);
       }).then(function (_ref) {
         var _ref2 = _slicedToArray(_ref, 2),
-            previousValue = _ref2[0],
-            currentValue = _ref2[1];
-
+          previousValue = _ref2[0],
+          currentValue = _ref2[1];
         if ((0, _isUndefined["default"])(previousValue) && listLength === 1) {
           return currentValue;
         }
-
         return fn(previousValue, currentValue);
       });
     });

package/lib/reduceRightP.js

@@ -2,33 +2,21 @@
 
 exports.__esModule = true;
 exports["default"] = void 0;
-
 var _ramda = require("ramda");
-
 var _isUndefined = _interopRequireDefault(require("./isUndefined"));
-
 var _resolveP = _interopRequireDefault(require("./resolveP"));
-
 var _allP = _interopRequireDefault(require("./allP"));
-
 function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "default": obj }; }
-
 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 _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 = 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 _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }
-
 // in older ramda versions the order of the arguments is flipped
 var flipArgs = (0, _ramda.pipe)((0, _ramda.reduceRight)(_ramda.concat, ''), (0, _ramda.equals)('ba'))(['a', 'b']);
-/* eslint-disable max-len */
 
+/* eslint-disable max-len */
 /**
  * Given an `Iterable`(arrays are `Iterable`), or a promise of an `Iterable`,
  * which produces promises (or a mix of promises and values),
@@ -85,21 +73,16 @@ var flipArgs = (0, _ramda.pipe)((0, _ramda.reduceRight)(_ramda.concat, ''), (0,
  * ); // => Promise(10)
  *
  */
-
 /* esline-enable max-len */
-
 var reduceRightP = (0, _ramda.curryN)(3, function (fn, acc, list) {
   return (0, _resolveP["default"])(list).then(function (iterable) {
     var listLength = (0, _ramda.length)(iterable);
-
     if (listLength === 0) {
       return acc;
     }
-
     var reducer = (0, _ramda.reduceRight)(function (arg1, arg2) {
       var accP;
       var currentValueP;
-
       if (flipArgs) {
         accP = arg1;
         currentValueP = arg2;
@@ -107,18 +90,15 @@ var reduceRightP = (0, _ramda.curryN)(3, function (fn, acc, list) {
         accP = arg2;
         currentValueP = arg1;
       }
-
       return accP.then(function (previousValue) {
         return (0, _allP["default"])([previousValue, currentValueP]);
       }).then(function (_ref) {
         var _ref2 = _slicedToArray(_ref, 2),
-            previousValue = _ref2[0],
-            currentValue = _ref2[1];
-
+          previousValue = _ref2[0],
+          currentValue = _ref2[1];
         if ((0, _isUndefined["default"])(previousValue) && listLength === 1) {
           return currentValue;
         }
-
         return fn(currentValue, previousValue);
       });
     });

package/lib/rejectP.js

@@ -2,9 +2,7 @@
 
 exports.__esModule = true;
 exports["default"] = void 0;
-
 var _ramda = require("ramda");
-
 /**
  * Composable shortcut for `Promise.reject`.
  *