ramda-adjunct 3.4.0 → 4.1.0

package/es/concatAll.js

@@ -24,7 +24,8 @@ var leftIdentitySemigroup = {
  *
  * concatAll([[1], [2], [3]]); //=> [1, 2, 3]
  * concatAll(['1', '2', '3']); //=> '123'
- * concatAll([]); //=> undefined;
+ * concatAll([]); //=> undefined
+ * concatAll(null); //=> undefined
  */
 var concatAll = pipe(reduce(concat, leftIdentitySemigroup), when(identical(leftIdentitySemigroup), stubUndefined));
 export default concatAll;

package/es/dispatch.js

@@ -3,7 +3,7 @@ function _nonIterableSpread() { throw new TypeError("Invalid attempt to spread n
 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; }
+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; }
 import { sort, comparator, prop, pipe, head, curryN, reduce, reduced, curry, ifElse } from 'ramda';
 
 /**

package/es/ensureArray.js

@@ -18,5 +18,5 @@ import isNotArray from './isNotArray';
  * RA.ensureArray(42); //=> [42]
  * RA.ensureArray([42]); //=> [42]
  */
-var ensureArray = when(isNotArray, of);
+var ensureArray = when(isNotArray, of(Array));
 export default ensureArray;

package/es/flattenDepth.js

@@ -3,7 +3,7 @@ function _nonIterableSpread() { throw new TypeError("Invalid attempt to spread n
 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; }
+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; }
 import { curry } from 'ramda';
 import _makeFlat from './internal/makeFlat';
 var flatten1 = _makeFlat(false);

package/es/flattenProp.js

@@ -23,6 +23,6 @@ import flattenPath from './flattenPath';
  * ); // => { a: 1, c: 3, d: 4, b: { c: 3, d: 4 } };
  */
 var flattenProp = curry(function (prop, obj) {
-  return flattenPath(of(prop), obj);
+  return flattenPath(of(Array, prop), obj);
 });
 export default flattenProp;

package/es/index.js

@@ -170,6 +170,7 @@ export { default as findOr } from './findOr';
 export { default as invoke } from './invoke';
 export { default as invokeArgs } from './invokeArgs';
 export { default as paths } from './paths';
+export { default as renameKey } from './renameKey';
 export { default as renameKeys } from './renameKeys';
 export { default as renameKeysWith } from './renameKeysWith';
 export { default as renameKeyWith } from './renameKeyWith';

package/es/internal/ponyfills/Array.from.js

@@ -3,7 +3,7 @@ function _nonIterableSpread() { throw new TypeError("Invalid attempt to spread n
 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; }
+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; }
 import { bind } from 'ramda';
 import isIterable from '../../isIterable';
 import isNotUndefined from '../../isNotUndefined';

package/es/internal/ponyfills/Promise.allSettled.js

@@ -3,7 +3,7 @@ function _nonIterableSpread() { throw new TypeError("Invalid attempt to spread n
 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; }
+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; }
 import { map } from 'ramda';
 import allP from '../../allP';
 import resolveP from '../../resolveP';

package/es/internal/ponyfills/Promise.any.js

@@ -4,7 +4,7 @@ function _nonIterableSpread() { throw new TypeError("Invalid attempt to spread n
 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; }
+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 _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, _toPropertyKey(descriptor.key), descriptor); } }
 function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, "prototype", { writable: false }); return Constructor; }
 function _toPropertyKey(arg) { var key = _toPrimitive(arg, "string"); return _typeof(key) === "symbol" ? key : String(key); }

package/es/isFalse.js

@@ -1,4 +1,4 @@
-import { identical } from 'ramda';
+import { identical, curryN } from 'ramda';
 
 /**
  * Checks if input value is the Boolean primitive `false`. Will return false for all values created
@@ -26,5 +26,5 @@ import { identical } from 'ramda';
  * RA.isFalse(new Boolean(false)); // => false
  */
 
-var isFalse = identical(false);
+var isFalse = curryN(1, identical(false));
 export default isFalse;

package/es/isNegativeZero.js

@@ -1,4 +1,4 @@
-import { identical } from 'ramda';
+import { identical, curryN } from 'ramda';
 
 /**
  * Checks if value is a negative zero (-0).
@@ -18,5 +18,5 @@ import { identical } from 'ramda';
  * RA.isNegativeZero(0); //=> false
  * RA.isNegativeZero(null); //=> false
  */
-var isNegativeZero = identical(-0);
+var isNegativeZero = curryN(1, identical(-0));
 export default isNegativeZero;

package/es/isPositiveZero.js

@@ -1,4 +1,4 @@
-import { identical } from 'ramda';
+import { identical, curryN } from 'ramda';
 
 /**
  * Checks if value is a positive zero (+0).
@@ -18,5 +18,5 @@ import { identical } from 'ramda';
  * RA.isPositiveZero(-0); //=> false
  * RA.isPositiveZero(null); //=> false
  */
-var isPositiveZero = identical(+0);
+var isPositiveZero = curryN(1, identical(+0));
 export default isPositiveZero;

package/es/isTrue.js

@@ -1,4 +1,4 @@
-import { identical } from 'ramda';
+import { identical, curryN } from 'ramda';
 
 /**
  * Checks if input value is the Boolean primitive `true`. Will return false for Boolean objects
@@ -22,5 +22,5 @@ import { identical } from 'ramda';
  * RA.isTrue(new Boolean(true)); // => false
  */
 
-var isTrue = identical(true);
+var isTrue = curryN(1, identical(true));
 export default isTrue;

package/es/lastP.js

@@ -3,7 +3,7 @@ function _nonIterableSpread() { throw new TypeError("Invalid attempt to spread n
 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; }
+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; }
 import { bind, last, map, curryN } from 'ramda';
 import allP from './allP';
 import lengthEq from './lengthEq';

package/es/lensTraverse.js

@@ -17,8 +17,10 @@ import Identity from './fantasy-land/Identity';
  * @since {@link https://char0n.github.io/ramda-adjunct/2.7.0|2.7.0}
  * @category Relation
  * @typedef Lens s a = Functor f => (a -> f a) -> s -> f s
+ * @sig fantasy-land/of :: TypeRep f => f ~> a → f a
  * @sig Applicative f => (a -> f a) -> Lens s a
- * @param {!function} of The Applicative-returning function
+ * @sig Applicative f => TypeRep f -> Lens s a
+ * @param {!Object|!Function} TypeRepresentative with an `of` or `fantasy-land/of` method
  * @return {!function} The Traversable lens
  * @see {@link http://ramdajs.com/docs/#lens|R.lens}, {@link http://ramdajs.com/docs/#traverse|R.traverse}
  *
@@ -34,9 +36,16 @@ import Identity from './fantasy-land/Identity';
  *
  * R.set(maybeLens, Maybe.Just(1), [Maybe.just(2), Maybe.Just(3)]); // => Maybe.Just([1, 1])
  */
-var lensTraverse = curryN(1, function (of) {
+/* eslint-disable no-nested-ternary */
+var lensTraverse = curryN(1, function (F) {
+  var of = typeof F['fantasy-land/of'] === 'function' ? F['fantasy-land/of'] : typeof F.of === 'function' ? F.of : F;
+  var TypeRep = {
+    'fantasy-land/of': of
+  };
   return curry(function (toFunctorFn, target) {
-    return Identity.of(traverse(of, pipe(toFunctorFn, prop('value')), target));
+    return Identity.of(traverse(TypeRep, pipe(toFunctorFn, prop('value')), target));
   });
 });
+/* eslint-enable */
+
 export default lensTraverse;

package/es/mergeProp.js

@@ -25,6 +25,6 @@ import mergePath from './mergePath';
  * ); //=> { outer: { foo: 3, bar: 4 } };
  */
 var mergeProp = curry(function (p, subj, obj) {
-  return mergePath(of(p), subj, obj);
+  return mergePath(of(Array, p), subj, obj);
 });
 export default mergeProp;

package/es/pathNotEq.js

@@ -9,10 +9,10 @@ import { pathEq, complement } from '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}
@@ -22,7 +22,7 @@ import { pathEq, complement } from 'ramda';
  * const user2 = { address: { zipCode: 55555 } };
  * const user3 = { name: 'Bob' };
  * const users = [ user1, user2, user3 ];
- * const isFamous = R.pathNotEq(['address', 'zipCode'], 90210);
+ * const isFamous = RA.pathNotEq(90210, ['address', 'zipCode']);
  * R.filter(isFamous, users); //=> [ user2, user3 ]
  */
 /* eslint-enable max-len */

package/es/propNotEq.js

@@ -8,9 +8,9 @@ import { propEq, complement } from '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}
@@ -21,7 +21,7 @@ import { propEq, complement } from '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/es/reduceP.js

@@ -1,8 +1,8 @@
 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 = 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 _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; }
 import { curryN, reduce, length } from 'ramda';
 import isUndefined from './isUndefined';

package/es/reduceRightP.js

@@ -1,8 +1,8 @@
 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 = 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 _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; }
 import { curryN, pipe, equals, reduceRight, length, concat } from 'ramda';
 import isUndefined from './isUndefined';

package/es/renameKey.js

@@ -0,0 +1,35 @@
+function _typeof(obj) { "@babel/helpers - typeof"; return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (obj) { return typeof obj; } : function (obj) { return obj && "function" == typeof Symbol && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }, _typeof(obj); }
+function _defineProperty(obj, key, value) { key = _toPropertyKey(key); if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }
+function _toPropertyKey(arg) { var key = _toPrimitive(arg, "string"); return _typeof(key) === "symbol" ? key : String(key); }
+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); }
+import { curry } from 'ramda';
+import renameKeys from './renameKeys';
+
+/**
+ * Creates a new object with the own properties of the provided object, but a
+ * single key is renamed from `oldKey` to `newKey`.
+ *
+ * Keep in mind that in the case of keys conflict is behavior undefined and
+ * the result may vary between various JS engines!
+ *
+ * @func renameKey
+ * @memberOf RA
+ * @since {@link https://char0n.github.io/ramda-adjunct/4.1.0|v4.1.0}
+ * @category Object
+ * @sig (String a, String b) => a -> b ->  {a: *} -> {b: *}
+ * @param {!string} oldKey
+ * @param {!string} newKey
+ * @param {!Object} obj
+ * @return {!Object} New object with renamed key
+ * @see {@link https://github.com/ramda/ramda/wiki/Cookbook#rename-key-of-an-object|Ramda Cookbook}, {@link RA.renameKeyWith|renameKeyWith}
+ * @example
+ *
+ * const input = { firstName: 'Elisia', age: 22, type: 'human' };
+ *
+ * RA.renameKey('firstName', 'name')(input);
+ * //=> { name: 'Elisia', age: 22, type: 'human' }
+ */
+var renameKey = curry(function (oldKey, newKey, obj) {
+  return renameKeys(_defineProperty({}, oldKey, newKey), obj);
+});
+export default renameKey;

package/es/sortByProps.js

@@ -1,7 +1,7 @@
 function _toArray(arr) { return _arrayWithHoles(arr) || _iterableToArray(arr) || _unsupportedIterableToArray(arr) || _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 _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 _iterableToArray(iter) { if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter); }
 function _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }
 import { comparator, curry, either, lt, map, prop, reduce, sort } from 'ramda';

package/es/spreadProp.js

@@ -20,6 +20,6 @@ import spreadPath from './spreadPath';
  * RA.spreadProp('b', { a: 1, b: { c: 3, d: 4 } }); // => { a: 1, c: 3, d: 4 };
  */
 var spreadProp = curry(function (prop, obj) {
-  return spreadPath(of(prop), obj);
+  return spreadPath(of(Array, prop), obj);
 });
 export default spreadProp;

package/lib/allEqual.js

@@ -7,7 +7,6 @@ var _lengthLte = _interopRequireDefault(require("./lengthLte"));
 function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "default": obj }; }
 // Original idea for this function was conceived by https://github.com/jackmellis
 // in https://github.com/char0n/ramda-adjunct/pull/513.
-
 /**
  * Returns true if all items in the list are equivalent using `R.equals` for equality comparisons.
  *

package/lib/concatAll.js

@@ -29,7 +29,8 @@ var leftIdentitySemigroup = {
  *
  * concatAll([[1], [2], [3]]); //=> [1, 2, 3]
  * concatAll(['1', '2', '3']); //=> '123'
- * concatAll([]); //=> undefined;
+ * concatAll([]); //=> undefined
+ * concatAll(null); //=> undefined
  */
 var concatAll = (0, _ramda.pipe)((0, _ramda.reduce)(_ramda.concat, leftIdentitySemigroup), (0, _ramda.when)((0, _ramda.identical)(leftIdentitySemigroup), _stubUndefined["default"]));
 var _default = concatAll;

package/lib/dispatch.js

@@ -12,7 +12,42 @@ function _nonIterableSpread() { throw new TypeError("Invalid attempt to spread n
 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; }
+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;
 });

package/lib/ensureArray.js

@@ -22,6 +22,6 @@ function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "d
  * RA.ensureArray(42); //=> [42]
  * RA.ensureArray([42]); //=> [42]
  */
-var ensureArray = (0, _ramda.when)(_isNotArray["default"], _ramda.of);
+var ensureArray = (0, _ramda.when)(_isNotArray["default"], (0, _ramda.of)(Array));
 var _default = ensureArray;
 exports["default"] = _default;

package/lib/flattenDepth.js

@@ -10,7 +10,7 @@ function _nonIterableSpread() { throw new TypeError("Invalid attempt to spread n
 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; }
+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; }
 var flatten1 = (0, _makeFlat2["default"])(false);
 
 /**

package/lib/flattenProp.js

@@ -27,7 +27,7 @@ function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "d
  * ); // => { a: 1, c: 3, d: 4, b: { c: 3, d: 4 } };
  */
 var flattenProp = (0, _ramda.curry)(function (prop, obj) {
-  return (0, _flattenPath["default"])((0, _ramda.of)(prop), obj);
+  return (0, _flattenPath["default"])((0, _ramda.of)(Array, prop), obj);
 });
 var _default = flattenProp;
 exports["default"] = _default;

package/lib/index.js

@@ -2,8 +2,8 @@
 
 exports.__esModule = true;
 exports.isNotRegExp = exports.isNotPrimitive = exports.isNotPlainObject = exports.isNotPlainObj = exports.isNotPair = exports.isNotObjectLike = exports.isNotObject = exports.isNotObjLike = exports.isNotObj = exports.isNotNumber = exports.isNotNull = exports.isNotNilOrEmpty = exports.isNotNil = exports.isNotNaN = exports.isNotMap = exports.isNotInteger = exports.isNotGeneratorFunction = exports.isNotFunction = exports.isNotFloat = exports.isNotFinite = exports.isNotEmpty = exports.isNotDate = exports.isNotBoolean = exports.isNotAsyncFunction = exports.isNotArrayLike = exports.isNotArray = exports.isNonPositive = exports.isNonNegative = exports.isNonEmptyString = exports.isNonEmptyArray = exports.isNilOrEmpty = exports.isNegativeZero = exports.isNegative = exports.isNaturalNumber = exports.isNaN = exports.isMap = exports.isIterable = exports.isInvalidDate = exports.isInteger32 = exports.isInteger = exports.isInt32 = exports.isIndexed = exports.isGeneratorFunction = exports.isFunction = exports.isFloat = exports.isFinite = exports.isFalsy = exports.isFalse = exports.isEven = exports.isError = exports.isEmptyString = exports.isEmptyArray = exports.isDate = exports.isBoolean = exports.isBlank = exports.isBigInt = exports.isAsyncFunction = exports.isArrayLike = exports.isArray = exports.invokeArgs = exports.invoke = exports.included = exports.inRange = exports.fnull = exports.floor = exports.flattenProp = exports.flattenPath = exports.flattenDepth = exports.firstP = exports.findOr = exports.filterIndexed = exports.escapeRegExp = exports.ensureArray = exports.dropArgs = exports.divideNum = exports.dispatch = exports.delayP = exports.defaultWhen = exports.curryRightN = exports.curryRight = exports.copyKeys = exports.concatRight = exports.concatAll = exports.compact = exports.ceil = exports.catchP = exports.cata = exports.async = exports.argsPass = exports.appendFlipped = exports.anyP = exports.allUnique = exports.allSettledP = exports.allP = exports.allIdenticalTo = exports.allIdentical = exports.allEqualTo = exports.allEqual = exports.Y = exports.Identity = void 0;
-exports.sortByProps = exports.sortByProp = exports.sortByPaths = exports.sliceTo = exports.sliceFrom = exports.skipTake = exports.sign = exports.sequencing = exports.seq = exports.round = exports.resolveP = exports.replaceAll = exports.repeatStr = exports.renameKeysWith = exports.renameKeys = exports.renameKeyWith = exports.rejectP = exports.reduceRightP = exports.reduceP = exports.reduceIndexed = exports.rangeStep = exports.propNotEq = exports.pickIndexes = exports.paths = exports.pathOrLazy = exports.pathNotEq = exports.padStart = exports.padEnd = exports.padCharsStart = exports.padCharsEnd = exports.overlaps = exports.omitIndexes = exports.omitBy = exports.notEqual = exports.notBoth = exports.notAllUnique = exports.notAllPass = exports.nor = exports.noop = exports.nonePass = exports.noneP = exports.neither = exports.nand = exports.move = exports.mergeProps = exports.mergeProp = exports.mergePaths = exports.mergePath = exports.mapIndexed = exports.list = exports.liftFN = exports.liftF = exports.lensTraverse = exports.lensSatisfies = exports.lensNotSatisfy = exports.lensNotEq = exports.lensIso = exports.lensEq = exports.lengthNotEq = exports.lengthLte = exports.lengthLt = exports.lengthGte = exports.lengthGt = exports.lengthEq = exports.lastP = exports.isValidNumber = exports.isValidDate = exports.isUndefined = exports.isUinteger32 = exports.isUint32 = exports.isTruthy = exports.isTrue = exports.isThenable = exports.isSymbol = exports.isString = exports.isSparseArray = exports.isSet = exports.isSentinelValue = exports.isSafeInteger = exports.isRegExp = exports.isPrototypeOf = exports.isPromise = exports.isPrimitive = exports.isPositiveZero = exports.isPositive = exports.isPlainObject = exports.isPlainObj = exports.isPair = exports.isOdd = exports.isObjectLike = exports.isObject = exports.isObjLike = exports.isObj = exports.isNumber = exports.isNull = exports.isNotValidNumber = exports.isNotValidDate = exports.isNotUndefined = exports.isNotString = exports.isNotSet = void 0;
-exports.zipObjWith = exports.weaveLazy = exports.weave = exports.viewOr = exports.unzipObjWith = exports.trunc = exports.trimStart = exports.trimRight = exports.trimLeft = exports.trimEnd = exports.trimCharsStart = exports.trimCharsEnd = exports.toUinteger32 = exports.toUint32 = exports.toNumber = exports.toInteger32 = exports.toInt32 = exports.toArray = exports.thenCatchP = exports.subtractNum = exports.stubUndefined = exports.stubString = exports.stubObject = exports.stubObj = exports.stubNull = exports.stubArray = exports.spreadProp = exports.spreadPath = void 0;
+exports.sortByProp = exports.sortByPaths = exports.sliceTo = exports.sliceFrom = exports.skipTake = exports.sign = exports.sequencing = exports.seq = exports.round = exports.resolveP = exports.replaceAll = exports.repeatStr = exports.renameKeysWith = exports.renameKeys = exports.renameKeyWith = exports.renameKey = exports.rejectP = exports.reduceRightP = exports.reduceP = exports.reduceIndexed = exports.rangeStep = exports.propNotEq = exports.pickIndexes = exports.paths = exports.pathOrLazy = exports.pathNotEq = exports.padStart = exports.padEnd = exports.padCharsStart = exports.padCharsEnd = exports.overlaps = exports.omitIndexes = exports.omitBy = exports.notEqual = exports.notBoth = exports.notAllUnique = exports.notAllPass = exports.nor = exports.noop = exports.nonePass = exports.noneP = exports.neither = exports.nand = exports.move = exports.mergeProps = exports.mergeProp = exports.mergePaths = exports.mergePath = exports.mapIndexed = exports.list = exports.liftFN = exports.liftF = exports.lensTraverse = exports.lensSatisfies = exports.lensNotSatisfy = exports.lensNotEq = exports.lensIso = exports.lensEq = exports.lengthNotEq = exports.lengthLte = exports.lengthLt = exports.lengthGte = exports.lengthGt = exports.lengthEq = exports.lastP = exports.isValidNumber = exports.isValidDate = exports.isUndefined = exports.isUinteger32 = exports.isUint32 = exports.isTruthy = exports.isTrue = exports.isThenable = exports.isSymbol = exports.isString = exports.isSparseArray = exports.isSet = exports.isSentinelValue = exports.isSafeInteger = exports.isRegExp = exports.isPrototypeOf = exports.isPromise = exports.isPrimitive = exports.isPositiveZero = exports.isPositive = exports.isPlainObject = exports.isPlainObj = exports.isPair = exports.isOdd = exports.isObjectLike = exports.isObject = exports.isObjLike = exports.isObj = exports.isNumber = exports.isNull = exports.isNotValidNumber = exports.isNotValidDate = exports.isNotUndefined = exports.isNotString = exports.isNotSet = void 0;
+exports.zipObjWith = exports.weaveLazy = exports.weave = exports.viewOr = exports.unzipObjWith = exports.trunc = exports.trimStart = exports.trimRight = exports.trimLeft = exports.trimEnd = exports.trimCharsStart = exports.trimCharsEnd = exports.toUinteger32 = exports.toUint32 = exports.toNumber = exports.toInteger32 = exports.toInt32 = exports.toArray = exports.thenCatchP = exports.subtractNum = exports.stubUndefined = exports.stubString = exports.stubObject = exports.stubObj = exports.stubNull = exports.stubArray = exports.spreadProp = exports.spreadPath = exports.sortByProps = void 0;
 var _isNotUndefined = _interopRequireDefault(require("./isNotUndefined"));
 exports.isNotUndefined = _isNotUndefined["default"];
 var _isUndefined = _interopRequireDefault(require("./isUndefined"));
@@ -320,6 +320,8 @@ var _invokeArgs = _interopRequireDefault(require("./invokeArgs"));
 exports.invokeArgs = _invokeArgs["default"];
 var _paths = _interopRequireDefault(require("./paths"));
 exports.paths = _paths["default"];
+var _renameKey = _interopRequireDefault(require("./renameKey"));
+exports.renameKey = _renameKey["default"];
 var _renameKeys = _interopRequireDefault(require("./renameKeys"));
 exports.renameKeys = _renameKeys["default"];
 var _renameKeysWith = _interopRequireDefault(require("./renameKeysWith"));

package/lib/internal/ponyfills/Array.from.js

@@ -13,7 +13,7 @@ function _nonIterableSpread() { throw new TypeError("Invalid attempt to spread n
 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; }
+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; }
 var copyArray = function copyArray(items, mapFn, thisArg) {
   var boundMapFn = (0, _isNotUndefined["default"])(thisArg) ? (0, _ramda.bind)(mapFn, thisArg) : mapFn;
   return (0, _isNotUndefined["default"])(mapFn) ? _toConsumableArray(items).map(boundMapFn) : _toConsumableArray(items);

package/lib/internal/ponyfills/Promise.allSettled.js

@@ -11,7 +11,7 @@ function _nonIterableSpread() { throw new TypeError("Invalid attempt to spread n
 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; }
+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; }
 var onFulfill = function onFulfill(value) {
   return {
     status: 'fulfilled',

package/lib/internal/ponyfills/Promise.any.js

@@ -11,7 +11,7 @@ function _nonIterableSpread() { throw new TypeError("Invalid attempt to spread n
 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; }
+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 _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, _toPropertyKey(descriptor.key), descriptor); } }
 function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, "prototype", { writable: false }); return Constructor; }
 function _toPropertyKey(arg) { var key = _toPrimitive(arg, "string"); return _typeof(key) === "symbol" ? key : String(key); }

package/lib/isFalse.js

@@ -29,6 +29,6 @@ var _ramda = require("ramda");
  * RA.isFalse(new Boolean(false)); // => false
  */
 
-var isFalse = (0, _ramda.identical)(false);
+var isFalse = (0, _ramda.curryN)(1, (0, _ramda.identical)(false));
 var _default = isFalse;
 exports["default"] = _default;

package/lib/isNegativeZero.js

@@ -21,6 +21,6 @@ var _ramda = require("ramda");
  * RA.isNegativeZero(0); //=> false
  * RA.isNegativeZero(null); //=> false
  */
-var isNegativeZero = (0, _ramda.identical)(-0);
+var isNegativeZero = (0, _ramda.curryN)(1, (0, _ramda.identical)(-0));
 var _default = isNegativeZero;
 exports["default"] = _default;

package/lib/isPositiveZero.js

@@ -21,6 +21,6 @@ var _ramda = require("ramda");
  * RA.isPositiveZero(-0); //=> false
  * RA.isPositiveZero(null); //=> false
  */
-var isPositiveZero = (0, _ramda.identical)(+0);
+var isPositiveZero = (0, _ramda.curryN)(1, (0, _ramda.identical)(+0));
 var _default = isPositiveZero;
 exports["default"] = _default;

package/lib/isSentinelValue.js

@@ -22,8 +22,7 @@ function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "d
  * RA.isSentinelValue('-1'); //=> false
  * RA.isSentinelValue(1); //=> false
  * RA.isSentinelValue([-1]); //=> false
- */
-// eslint-disable-next-line no-bitwise
+ */ // eslint-disable-next-line no-bitwise
 var isSentinelValue = (0, _ramda.curryN)(1, function (val) {
   return (0, _isInteger["default"])(val) && ~val === 0;
 });

package/lib/isTrue.js

@@ -25,6 +25,6 @@ var _ramda = require("ramda");
  * RA.isTrue(new Boolean(true)); // => false
  */
 
-var isTrue = (0, _ramda.identical)(true);
+var isTrue = (0, _ramda.curryN)(1, (0, _ramda.identical)(true));
 var _default = isTrue;
 exports["default"] = _default;

package/lib/lastP.js

@@ -14,7 +14,7 @@ function _nonIterableSpread() { throw new TypeError("Invalid attempt to spread n
 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; }
+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; }
 /**
  * Returns a promise that is fulfilled by the last given promise to be fulfilled,
  * or rejected with an array of rejection reasons if all of the given promises are rejected.

package/lib/lensTraverse.js

@@ -21,8 +21,10 @@ function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "d
  * @since {@link https://char0n.github.io/ramda-adjunct/2.7.0|2.7.0}
  * @category Relation
  * @typedef Lens s a = Functor f => (a -> f a) -> s -> f s
+ * @sig fantasy-land/of :: TypeRep f => f ~> a → f a
  * @sig Applicative f => (a -> f a) -> Lens s a
- * @param {!function} of The Applicative-returning function
+ * @sig Applicative f => TypeRep f -> Lens s a
+ * @param {!Object|!Function} TypeRepresentative with an `of` or `fantasy-land/of` method
  * @return {!function} The Traversable lens
  * @see {@link http://ramdajs.com/docs/#lens|R.lens}, {@link http://ramdajs.com/docs/#traverse|R.traverse}
  *
@@ -38,10 +40,16 @@ function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "d
  *
  * R.set(maybeLens, Maybe.Just(1), [Maybe.just(2), Maybe.Just(3)]); // => Maybe.Just([1, 1])
  */
-var lensTraverse = (0, _ramda.curryN)(1, function (of) {
+/* eslint-disable no-nested-ternary */
+var lensTraverse = (0, _ramda.curryN)(1, function (F) {
+  var of = typeof F['fantasy-land/of'] === 'function' ? F['fantasy-land/of'] : typeof F.of === 'function' ? F.of : F;
+  var TypeRep = {
+    'fantasy-land/of': of
+  };
   return (0, _ramda.curry)(function (toFunctorFn, target) {
-    return _Identity["default"].of((0, _ramda.traverse)(of, (0, _ramda.pipe)(toFunctorFn, (0, _ramda.prop)('value')), target));
+    return _Identity["default"].of((0, _ramda.traverse)(TypeRep, (0, _ramda.pipe)(toFunctorFn, (0, _ramda.prop)('value')), target));
   });
 });
+/* eslint-enable */
 var _default = lensTraverse;
 exports["default"] = _default;