ramda-adjunct 3.3.0 → 3.4.0

package/es/mergeProps.js

@@ -1,4 +1,5 @@
 import { curryN, pipe, mergeAll, props } from 'ramda';
+
 /**
  * Functional equivalent of merging object properties with object spread operator.
  *
@@ -21,6 +22,5 @@ import { curryN, pipe, mergeAll, props } from 'ramda';
  * { ...obj.foo, ...obj.bar }; //=> { fooInner: 1, barInner: 2 }
  * RA.mergeProps(['foo', 'bar'], obj); //=> { fooInner: 1, barInner: 2 }
  */
-
 var mergeProps = curryN(2, pipe(props, mergeAll));
 export default mergeProps;

package/es/move.js

@@ -1,4 +1,5 @@
 import { compose, curry, insert, nth, remove } from '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`.
@@ -18,7 +19,6 @@ import { compose, curry, insert, nth, remove } from 'ramda';
  * const list = ['a', 'b', 'c', 'd', 'e'];
  * RA.move(1, 3, list) //=> ['a', 'c', 'd', 'b', 'e']
  */
-
 var move = curry(function (fromIdx, toIdx, list) {
   return compose(insert(toIdx, nth(fromIdx, list)), remove(fromIdx, 1))(list);
 });

package/es/nand.js

@@ -1,4 +1,5 @@
 import { and, complement } from 'ramda';
+
 /**
  * Returns false if both arguments are truthy; true otherwise.
  *
@@ -21,7 +22,6 @@ import { and, complement } from 'ramda';
  * RA.nand(0, 1.0); //=> true
  * RA.nand(0, 0); //=> true
  */
-
 var nand = complement(and); // eslint-disable-line ramda/complement-simplification
 
 export default nand;

package/es/neither.js

@@ -1,6 +1,6 @@
 import { curry, compose, complement, either } from 'ramda';
-/* eslint-disable max-len */
 
+/* eslint-disable max-len */
 /**
  * A function which calls the two provided functions and returns the complement of `||`ing the
  * results.
@@ -32,8 +32,6 @@ import { curry, compose, complement, either } from 'ramda';
  * f(11); //=> false
  * f(9); //=> true
  */
-
 /* eslint-enable max-len */
-
 var neither = curry(compose(complement, either));
 export default neither;

package/es/noneP.js

@@ -2,6 +2,7 @@ import { curryN, map, pipe } from 'ramda';
 import allP from './allP';
 import rejectP from './rejectP';
 import resolveP from './resolveP';
+
 /**
  * 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.
@@ -21,7 +22,6 @@ import resolveP from './resolveP';
  * RA.noneP([Promise.reject(), Promise.resolve('hello world')]); //=> Promise('hello world')
  * RA.noneP([Promise.reject(), 'hello world']); //=> Promise('hello world')
  */
-
 var noneP = curryN(1, pipe(map(resolveP), map(function (p) {
   return p.then(rejectP, resolveP);
 }), allP));

package/es/nonePass.js

@@ -1,4 +1,5 @@
 import { complement, compose, anyPass, curryN } from '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
@@ -26,6 +27,5 @@ import { complement, compose, anyPass, curryN } from 'ramda';
  * f(11); //=> false
  * f(9); //=> true
  */
-
 var nonePass = curryN(1, compose(complement, anyPass));
 export default nonePass;

package/es/noop.js

@@ -1,5 +1,6 @@
 import { always } from 'ramda';
 import stubUndefined from './stubUndefined';
+
 /**
  * A function that performs no operations.
  *
@@ -14,6 +15,5 @@ import stubUndefined from './stubUndefined';
  * RA.noop(); //=> undefined
  * RA.noop(1, 2, 3); //=> undefined
  */
-
 var noop = always(stubUndefined());
 export default noop;

package/es/nor.js

@@ -1,4 +1,5 @@
 import { or, complement } from 'ramda';
+
 /**
  * Returns true if both arguments are falsy; false otherwise.
  *
@@ -22,7 +23,6 @@ import { or, complement } from 'ramda';
  * RA.nor(0, 1); //=> false
  * RA.nor(0, 0); //=> true
  */
-
 var nor = complement(or); // eslint-disable-line ramda/complement-simplification
 
 export default nor;

package/es/notAllPass.js

@@ -1,4 +1,5 @@
 import { curry, complement, compose, allPass } from '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
@@ -26,6 +27,5 @@ import { curry, complement, compose, allPass } from 'ramda';
  * f(11); //=> true
  * f(9); //=> true
  */
-
 var notAllPass = curry(compose(complement, allPass));
 export default notAllPass;

package/es/notAllUnique.js

@@ -1,5 +1,6 @@
 import { complement } from 'ramda';
 import allUnique from './allUnique';
+
 /**
  * Returns true if at least one item of the list is repeated. `R.equals` is used to determine equality.
  *
@@ -18,6 +19,5 @@ import allUnique from './allUnique';
  * RA.notAllUnique([]); //=> false
  *
  */
-
 var notAllUnique = complement(allUnique);
 export default notAllUnique;

package/es/notBoth.js

@@ -1,6 +1,6 @@
 import { curry, compose, complement, both } from 'ramda';
-/* eslint-disable max-len */
 
+/* eslint-disable max-len */
 /**
  * A function which calls the two provided functions and returns the complement of `&&`ing the
  * results.
@@ -32,8 +32,6 @@ import { curry, compose, complement, both } from 'ramda';
  * f(11); //=> true
  * f(9); //=> true
  */
-
 /* eslint-enable max-len */
-
 var notBoth = curry(compose(complement, both));
 export default notBoth;

package/es/notEqual.js

@@ -1,4 +1,5 @@
 import { complement, equals } from 'ramda';
+
 /**
  * Returns `true` if its arguments are not equivalent, `false` otherwise. Handles
  * cyclical data structures.
@@ -25,6 +26,5 @@ import { complement, equals } from 'ramda';
  * const b = {}; b.v = b;
  * RA.notEqual(a, b); //=> false
  */
-
 var notEqual = complement(equals);
 export default notEqual;

package/es/omitBy.js

@@ -1,6 +1,6 @@
 import { complement, identity, pickBy, useWith } from 'ramda';
-/* eslint-disable max-len */
 
+/* eslint-disable max-len */
 /**
  * Returns a partial copy of an object containing only the keys
  * that don't satisfy the supplied predicate.
@@ -19,8 +19,6 @@ import { complement, identity, pickBy, useWith } from '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 = useWith(pickBy, [complement, identity]);
 export default omitBy;

package/es/omitIndexes.js

@@ -1,9 +1,11 @@
-import { includes, curry, addIndex, reject } from 'ramda'; // helpers
+import { includes, curry, addIndex, reject } from 'ramda';
 
+// helpers
 var rejectIndexed = addIndex(reject);
 var containsIndex = curry(function (indexes, val, index) {
   return includes(index, indexes);
 });
+
 /**
  * Returns a partial copy of an array omitting the indexes specified.
  *
@@ -20,7 +22,6 @@ var containsIndex = curry(function (indexes, val, index) {
  *
  * RA.omitIndexes([-1, 1, 3], ['a', 'b', 'c', 'd']); //=> ['a', 'c']
  */
-
 var omitIndexes = curry(function (indexes, list) {
   return rejectIndexed(containsIndex(indexes), list);
 });

package/es/overlaps.js

@@ -1,5 +1,6 @@
 import { pipe, intersection, isEmpty, curryN } from 'ramda';
 import isNotEmpty from './isNotEmpty';
+
 /**
  * Returns true if two lists have at least one element common to both lists.
  *
@@ -23,7 +24,6 @@ var overlaps = curryN(2, function (list1, list2) {
   if (isEmpty(list1)) {
     return true;
   }
-
   return pipe(intersection, isNotEmpty)(list1, list2);
 });
 export default overlaps;

package/es/padCharsEnd.js

@@ -3,6 +3,7 @@ import ponyfill from './internal/ponyfills/String.padEnd';
 import isFunction from './isFunction';
 export var padEndPonyfill = curry(ponyfill);
 export var padEndInvoker = flip(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.
@@ -26,6 +27,5 @@ export var padEndInvoker = flip(invoker(2, 'padEnd'));
  * RA.padCharsEnd('foo', 10, 'abc'); // => 'abcfoofoof'
  * RA.padCharsEnd('123456', 6, 'abc'); // => 'abc123'
  */
-
 var padCharsEnd = isFunction(String.prototype.padEnd) ? padEndInvoker : padEndPonyfill;
 export default padCharsEnd;

package/es/padCharsStart.js

@@ -3,6 +3,7 @@ import isFunction from './isFunction';
 import ponyfill from './internal/ponyfills/String.padStart';
 export var padStartInvoker = flip(invoker(2, 'padStart'));
 export var padStartPonyfill = curry(ponyfill);
+
 /**
  * The function pads the current string with a given string
  * (repeated, if needed) so that the resulting string reaches a given length.
@@ -24,6 +25,5 @@ export var padStartPonyfill = curry(ponyfill);
  * RA.padCharsStart('foo', 10, 'abc'); // => 'foofoofabc'
  * RA.padCharsStart('123456', 6, 'abc'); // => '123abc'
  */
-
 var padCharsStart = isFunction(String.prototype.padStart) ? padStartInvoker : padStartPonyfill;
 export default padCharsStart;

package/es/padEnd.js

@@ -1,4 +1,5 @@
 import padCharsEnd from './padCharsEnd';
+
 /**
  * The function pads the current string with an empty string
  * so that the resulting string reaches a given length.
@@ -19,6 +20,5 @@ import padCharsEnd from './padCharsEnd';
  *
  * RA.padEnd(3, 'a'); // => 'a  '
  */
-
 var padEnd = padCharsEnd(' ');
 export default padEnd;

package/es/padStart.js

@@ -1,4 +1,5 @@
 import padCharsStart from './padCharsStart';
+
 /**
  * Pads string on the left side if it's shorter than length.
  *
@@ -17,6 +18,5 @@ import padCharsStart from './padCharsStart';
  *
  * RA.padStart(3, 'a'); // => '  a'
  */
-
 var padStart = padCharsStart(' ');
 export default padStart;

package/es/pathNotEq.js

@@ -1,6 +1,6 @@
 import { pathEq, complement } from 'ramda';
-/* eslint-disable max-len */
 
+/* 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.
@@ -25,8 +25,6 @@ import { pathEq, complement } from 'ramda';
  * const isFamous = R.pathNotEq(['address', 'zipCode'], 90210);
  * R.filter(isFamous, users); //=> [ user2, user3 ]
  */
-
 /* eslint-enable max-len */
-
 var pathNotEq = complement(pathEq);
 export default pathNotEq;

package/es/pathOrLazy.js

@@ -1,4 +1,5 @@
 import { curryN, identical, partial, pathOr, unary, when } from '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.
@@ -18,7 +19,6 @@ import { curryN, identical, partial, pathOr, unary, when } from 'ramda';
  * RA.pathOrLazy(() => 'N/A', ['a', 'b'], {a: {b: 2}}); //=> 2
  * RA.pathOrLazy(() => 'N/A', ['a', 'b'], {c: {b: 2}}); //=> "N/A"
  */
-
 var pathOrLazy = curryN(3, function (defaultFn, path, obj) {
   return when(identical(defaultFn), partial(unary(defaultFn), [obj]), pathOr(defaultFn, path, obj));
 });

package/es/paths.js

@@ -1,4 +1,5 @@
 import { curry, ap, path, __ } from 'ramda';
+
 /**
  * Acts as multiple path: arrays of paths in, array of values out. Preserves order.
  *
@@ -20,7 +21,6 @@ import { curry, ap, path, __ } from 'ramda';
  *
  * RA.paths([['a', 'b', 'c'], ['x']], obj); //=> [1, 2]
  */
-
 var paths = curry(function (ps, obj) {
   return ap([path(__, obj)], ps);
 });

package/es/pickIndexes.js

@@ -1,9 +1,11 @@
-import { filter, addIndex, curry, includes } from 'ramda'; // helpers
+import { filter, addIndex, curry, includes } from 'ramda';
 
+// helpers
 var filterIndexed = addIndex(filter);
 var containsIndex = curry(function (indexes, val, index) {
   return includes(index, indexes);
 });
+
 /**
  * Picks values from list by indexes.
  *
@@ -23,7 +25,6 @@ var containsIndex = curry(function (indexes, val, index) {
  *
  * RA.pickIndexes([0, 2], ['a', 'b', 'c']); //=> ['a', 'c']
  */
-
 var pickIndexes = curry(function (indexes, list) {
   return filterIndexed(containsIndex(indexes), list);
 });

package/es/propNotEq.js

@@ -1,4 +1,5 @@
 import { propEq, complement } from 'ramda';
+
 /**
  * Returns true if the specified object property is not equal,
  * in R.equals terms, to the given value; false otherwise.
@@ -24,6 +25,5 @@ import { propEq, complement } from 'ramda';
  *
  * R.filter(hasNotBrownHair, kids); //=> [abby, alois]
  */
-
 var propNotEq = complement(propEq);
 export default propNotEq;

package/es/rangeStep.js

@@ -1,5 +1,6 @@
 import { curryN, map, range, always } from 'ramda';
 import floor from './floor';
+
 /**
  * Creates an array of numbers (positive and/or negative) progressing from start up to, but not including, end.
  *
@@ -25,7 +26,6 @@ import floor from './floor';
  * RA.rangeStep(0, 1, 4); // => [1, 1, 1]
  * RA.rangeStep(1, 0, 0); // => []
  */
-
 var rangeStep = curryN(3, function (step, from, to) {
   var callback = step === 0 ? always(from) : function (n) {
     return from + step * n;

package/es/reduceIndexed.js

@@ -1,4 +1,5 @@
 import { addIndex, reduce } from '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.
@@ -25,6 +26,5 @@ import { addIndex, reduce } from 'ramda';
  * reduceIndexed((acc, val, idx, list) => acc + '-' + val + idx, '', initialList);
  * //=> "-f0-o1-o2-b3-a4-r5"
  */
-
 var reduceIndexed = addIndex(reduce);
 export default reduceIndexed;

package/es/reduceP.js

@@ -1,21 +1,15 @@
 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 _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; }
-
 import { curryN, reduce, length } from 'ramda';
 import isUndefined from './isUndefined';
 import resolveP from './resolveP';
 import allP from './allP';
-/* 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),
@@ -79,29 +73,23 @@ import allP from './allP';
  * ); // => Promise(10)
  *
  */
-
 /* esline-enable max-len */
-
 var reduceP = curryN(3, function (fn, acc, list) {
   return resolveP(list).then(function (iterable) {
     var listLength = length(iterable);
-
     if (listLength === 0) {
       return acc;
     }
-
     var reducer = reduce(function (accP, currentValueP) {
       return accP.then(function (previousValue) {
         return allP([previousValue, currentValueP]);
       }).then(function (_ref) {
         var _ref2 = _slicedToArray(_ref, 2),
-            previousValue = _ref2[0],
-            currentValue = _ref2[1];
-
+          previousValue = _ref2[0],
+          currentValue = _ref2[1];
         if (isUndefined(previousValue) && listLength === 1) {
           return currentValue;
         }
-
         return fn(previousValue, currentValue);
       });
     });

package/es/reduceRightP.js

@@ -1,23 +1,18 @@
 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 _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; }
-
 import { curryN, pipe, equals, reduceRight, length, concat } from 'ramda';
 import isUndefined from './isUndefined';
 import resolveP from './resolveP';
-import allP from './allP'; // in older ramda versions the order of the arguments is flipped
+import allP from './allP';
 
+// in older ramda versions the order of the arguments is flipped
 var flipArgs = pipe(reduceRight(concat, ''), 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),
@@ -74,21 +69,16 @@ var flipArgs = pipe(reduceRight(concat, ''), equals('ba'))(['a', 'b']);
  * ); // => Promise(10)
  *
  */
-
 /* esline-enable max-len */
-
 var reduceRightP = curryN(3, function (fn, acc, list) {
   return resolveP(list).then(function (iterable) {
     var listLength = length(iterable);
-
     if (listLength === 0) {
       return acc;
     }
-
     var reducer = reduceRight(function (arg1, arg2) {
       var accP;
       var currentValueP;
-
       if (flipArgs) {
         accP = arg1;
         currentValueP = arg2;
@@ -96,18 +86,15 @@ var reduceRightP = curryN(3, function (fn, acc, list) {
         accP = arg2;
         currentValueP = arg1;
       }
-
       return accP.then(function (previousValue) {
         return allP([previousValue, currentValueP]);
       }).then(function (_ref) {
         var _ref2 = _slicedToArray(_ref, 2),
-            previousValue = _ref2[0],
-            currentValue = _ref2[1];
-
+          previousValue = _ref2[0],
+          currentValue = _ref2[1];
         if (isUndefined(previousValue) && listLength === 1) {
           return currentValue;
         }
-
         return fn(currentValue, previousValue);
       });
     });

package/es/rejectP.js

@@ -1,4 +1,5 @@
 import { bind } from 'ramda';
+
 /**
  * Composable shortcut for `Promise.reject`.
  *
@@ -18,6 +19,5 @@ import { bind } from 'ramda';
  * RA.rejectP('a'); //=> Promise('a')
  * RA.rejectP([1, 2, 3]); //=> Promise([1, 2, 3])
  */
-
 var rejectP = bind(Promise.reject, Promise);
 export default rejectP;

package/es/renameKeyWith.js

@@ -1,5 +1,6 @@
 import { curry, equals, when } from 'ramda';
 import renameKeysWith from './renameKeysWith';
+
 /**
  * Creates a new object with the own properties of the provided object, but the
  * key `key` renamed according to logic of renaming function.
@@ -21,7 +22,6 @@ import renameKeysWith from './renameKeysWith';
  *
  * RA.renameKeyWith(R.concat('a'), 'A', { A: 1 }) //=> { aA: 1 }
  */
-
 var renameKeyWith = curry(function (fn, key, obj) {
   return renameKeysWith(when(equals(key), fn), obj);
 });

package/es/renameKeys.js

@@ -1,15 +1,14 @@
 import { curry, has } from 'ramda';
 import renameKeysWith from './renameKeysWith';
-
 var valueOrKey = function valueOrKey(keysMap) {
   return function (key) {
     if (has(key, keysMap)) {
       return keysMap[key];
     }
-
     return key;
   };
 };
+
 /**
  * Creates a new object with the own properties of the provided object, but the
  * keys renamed according to the keysMap object as `{oldKey: newKey}`.
@@ -34,8 +33,6 @@ var valueOrKey = function valueOrKey(keysMap) {
  * RA.renameKeys({ firstName: 'name', type: 'kind', foo: 'bar' })(input);
  * //=> { name: 'Elisia', age: 22, kind: 'human' }
  */
-
-
 var renameKeys = curry(function (keysMap, obj) {
   return renameKeysWith(valueOrKey(keysMap), obj);
 });

package/es/renameKeysWith.js

@@ -1,4 +1,5 @@
 import { curry, toPairs, pipe, map, over, lensIndex, fromPairs } from 'ramda';
+
 /**
  * Creates a new object with the own properties of the provided object, but the
  * keys renamed according to logic of renaming function.
@@ -19,7 +20,6 @@ import { curry, toPairs, pipe, map, over, lensIndex, fromPairs } from 'ramda';
  *
  * RA.renameKeysWith(R.concat('a'), { A: 1, B: 2, C: 3 }) //=> { aA: 1, aB: 2, aC: 3 }
  */
-
 var renameKeysWith = curry(function (fn, obj) {
   return pipe(toPairs, map(over(lensIndex(0), fn)), fromPairs)(obj);
 });

package/es/repeatStr.js

@@ -3,6 +3,7 @@ import ponyfill from './internal/ponyfills/String.repeat';
 import isFunction from './isFunction';
 export var repeatStrPonyfill = curry(ponyfill);
 export var repeatStrInvoker = flip(invoker(1, 'repeat'));
+
 /**
  * Constructs and returns a new string which contains the specified
  * number of copies of the string on which it was called, concatenated together.
@@ -19,6 +20,5 @@ export var repeatStrInvoker = flip(invoker(1, 'repeat'));
  *
  * RA.repeatStr('a', 3); //=> 'aaa'
  */
-
 var repeatStr = isFunction(String.prototype.repeat) ? repeatStrInvoker : repeatStrPonyfill;
 export default repeatStr;

package/es/replaceAll.js

@@ -3,6 +3,7 @@ import isFunction from './isFunction';
 import ponyfill from './internal/ponyfills/String.replaceAll';
 export var replaceAllPonyfill = curryN(3, ponyfill);
 export var replaceAllInvoker = invoker(2, 'replaceAll');
+
 /**
  * Replaces all substring matches in a string with a replacement.
  *
@@ -24,6 +25,5 @@ export var replaceAllInvoker = invoker(2, 'replaceAll');
  * RA.replaceAll(/x/g, 'v', 'xxx'); //=> 'vvv'
  * RA.replaceAll(/x/, 'v', 'xxx'); //=> TypeError
  */
-
 var replaceAll = isFunction(String.prototype.replaceAll) ? replaceAllInvoker : replaceAllPonyfill;
 export default replaceAll;

package/es/resolveP.js

@@ -1,6 +1,6 @@
 import { bind } from 'ramda';
-/* eslint-disable max-len */
 
+/* eslint-disable max-len */
 /**
  * Composable shortcut for `Promise.resolve`.
  *
@@ -22,8 +22,6 @@ import { bind } from 'ramda';
  * RA.resolveP('a'); //=> Promise('a')
  * RA.resolveP([1, 2, 3]); //=> Promise([1, 2, 3])
  */
-
 /* eslint-enable max-len */
-
 var resolveP = bind(Promise.resolve, Promise);
 export default resolveP;

package/es/round.js

@@ -1,4 +1,5 @@
 import { bind, curryN } from 'ramda';
+
 /**
  * Returns the value of a number rounded to the nearest integer.
  *