ramda-adjunct 3.4.0 → 4.0.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (69) hide show
  1. package/CHANGELOG.md +14 -0
  2. package/README.md +2 -2
  3. package/dist/RA.node.js +77 -39
  4. package/dist/RA.node.min.js +1 -1
  5. package/dist/RA.web.js +77 -39
  6. package/dist/RA.web.min.js +1 -1
  7. package/dist/RA.web.standalone.js +1178 -531
  8. package/dist/RA.web.standalone.min.js +1 -1
  9. package/es/concatAll.js +2 -1
  10. package/es/dispatch.js +1 -1
  11. package/es/ensureArray.js +1 -1
  12. package/es/flattenDepth.js +1 -1
  13. package/es/flattenProp.js +1 -1
  14. package/es/internal/ponyfills/Array.from.js +1 -1
  15. package/es/internal/ponyfills/Promise.allSettled.js +1 -1
  16. package/es/internal/ponyfills/Promise.any.js +1 -1
  17. package/es/isFalse.js +2 -2
  18. package/es/isNegativeZero.js +2 -2
  19. package/es/isPositiveZero.js +2 -2
  20. package/es/isTrue.js +2 -2
  21. package/es/lastP.js +1 -1
  22. package/es/lensTraverse.js +12 -3
  23. package/es/mergeProp.js +1 -1
  24. package/es/pathNotEq.js +4 -4
  25. package/es/propNotEq.js +3 -3
  26. package/es/reduceP.js +2 -2
  27. package/es/reduceRightP.js +2 -2
  28. package/es/sortByProps.js +1 -1
  29. package/es/spreadProp.js +1 -1
  30. package/lib/allEqual.js +0 -1
  31. package/lib/concatAll.js +2 -1
  32. package/lib/dispatch.js +36 -1
  33. package/lib/ensureArray.js +1 -1
  34. package/lib/flattenDepth.js +1 -1
  35. package/lib/flattenProp.js +1 -1
  36. package/lib/internal/ponyfills/Array.from.js +1 -1
  37. package/lib/internal/ponyfills/Promise.allSettled.js +1 -1
  38. package/lib/internal/ponyfills/Promise.any.js +1 -1
  39. package/lib/isFalse.js +1 -1
  40. package/lib/isNegativeZero.js +1 -1
  41. package/lib/isPositiveZero.js +1 -1
  42. package/lib/isSentinelValue.js +1 -2
  43. package/lib/isTrue.js +1 -1
  44. package/lib/lastP.js +1 -1
  45. package/lib/lensTraverse.js +11 -3
  46. package/lib/mergeProp.js +1 -1
  47. package/lib/pathNotEq.js +4 -4
  48. package/lib/propNotEq.js +3 -3
  49. package/lib/reduceP.js +2 -2
  50. package/lib/reduceRightP.js +2 -2
  51. package/lib/seq.js +0 -1
  52. package/lib/sortByProps.js +1 -1
  53. package/lib/spreadProp.js +1 -1
  54. package/lib/toInteger32.js +1 -2
  55. package/lib/toUinteger32.js +1 -3
  56. package/package.json +33 -33
  57. package/src/concatAll.js +2 -1
  58. package/src/ensureArray.js +1 -1
  59. package/src/flattenProp.js +1 -1
  60. package/src/isFalse.js +2 -2
  61. package/src/isNegativeZero.js +2 -2
  62. package/src/isPositiveZero.js +2 -2
  63. package/src/isTrue.js +2 -2
  64. package/src/lensTraverse.js +18 -6
  65. package/src/mergeProp.js +1 -1
  66. package/src/pathNotEq.js +4 -4
  67. package/src/propNotEq.js +3 -3
  68. package/src/spreadProp.js +1 -1
  69. package/tmp-test-bundle.js.LICENSE.txt +618 -0
package/CHANGELOG.md CHANGED
@@ -1,3 +1,17 @@
1
+ # [4.0.0](https://github.com/char0n/ramda-adjunct/compare/v3.4.0...v4.0.0) (2023-04-05)
2
+
3
+
4
+ ### Features
5
+
6
+ * add support for ramda@0.29.0 ([#2568](https://github.com/char0n/ramda-adjunct/issues/2568)) ([05def8d](https://github.com/char0n/ramda-adjunct/commit/05def8d60fd9c71c4e4f8d9345b7b80ffa6dd6f7)), closes [#2567](https://github.com/char0n/ramda-adjunct/issues/2567)
7
+
8
+ ### Breaking changes
9
+
10
+ * pathNotEq changed parameter order to reflect the order in ramda@0.29.0
11
+ * propNotEq changed parameter order to reflect the order in ramda@0.29.0
12
+
13
+
14
+
1
15
  # [3.4.0](https://github.com/char0n/ramda-adjunct/compare/v3.3.0...v3.4.0) (2022-12-03)
2
16
 
3
17
 
package/README.md CHANGED
@@ -123,7 +123,7 @@ _Do you want to find out more about why this library exists ? Read this [**artic
123
123
 
124
124
  ## Requirements
125
125
 
126
- - ramda >= 0.28.0
126
+ - ramda >= 0.29.0
127
127
  - node >= 0.10.48
128
128
 
129
129
  Ramda Adjunct is being automatically tested against all LTS and Current Node.js versions.
@@ -137,7 +137,7 @@ It is also possible that our ES5 distributions run on node versions older than 0
137
137
  ## API Documentation
138
138
 
139
139
  [LATEST](https://char0n.github.io/ramda-adjunct),
140
- [PREVIOUS](https://char0n.github.io/ramda-adjunct/3.3.0),
140
+ [PREVIOUS](https://char0n.github.io/ramda-adjunct/3.4.0),
141
141
  [ALL VERSIONS](./VERSIONS.md)
142
142
 
143
143
  ## Wrote about us
package/dist/RA.node.js CHANGED
@@ -73,7 +73,6 @@ var _lengthLte = _interopRequireDefault(__webpack_require__(2385));
73
73
  function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "default": obj }; }
74
74
  // Original idea for this function was conceived by https://github.com/jackmellis
75
75
  // in https://github.com/char0n/ramda-adjunct/pull/513.
76
-
77
76
  /**
78
77
  * Returns true if all items in the list are equivalent using `R.equals` for equality comparisons.
79
78
  *
@@ -752,7 +751,8 @@ var leftIdentitySemigroup = {
752
751
  *
753
752
  * concatAll([[1], [2], [3]]); //=> [1, 2, 3]
754
753
  * concatAll(['1', '2', '3']); //=> '123'
755
- * concatAll([]); //=> undefined;
754
+ * concatAll([]); //=> undefined
755
+ * concatAll(null); //=> undefined
756
756
  */
757
757
  var concatAll = (0, _ramda.pipe)((0, _ramda.reduce)(_ramda.concat, leftIdentitySemigroup), (0, _ramda.when)((0, _ramda.identical)(leftIdentitySemigroup), _stubUndefined["default"]));
758
758
  var _default = concatAll;
@@ -1025,7 +1025,42 @@ function _nonIterableSpread() { throw new TypeError("Invalid attempt to spread n
1025
1025
  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); }
1026
1026
  function _iterableToArray(iter) { if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter); }
1027
1027
  function _arrayWithoutHoles(arr) { if (Array.isArray(arr)) return _arrayLikeToArray(arr); }
1028
- 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; }
1028
+ 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; } /**
1029
+ * Can be used as a way to compose multiple invokers together to form polymorphic functions,
1030
+ * or functions that exhibit different behaviors based on their argument(s).
1031
+ * Consumes dispatching functions and keep trying to invoke each in turn, until a non-nil value is returned.
1032
+ *
1033
+ * Accepts a list of dispatching functions and returns a new function.
1034
+ * When invoked, this new function is applied to some arguments,
1035
+ * each dispatching function is applied to those same arguments until one of the
1036
+ * dispatching functions returns a non-nil value.
1037
+ *
1038
+ * @func dispatch
1039
+ * @memberOf RA
1040
+ * @since {@link https://char0n.github.io/ramda-adjunct/2.6.0|v2.6.0}
1041
+ * @category Function
1042
+ * @sig [((a, b, ...) -> x1), ((a, b, ...) -> x2), ...] -> x1 | x2 | ...
1043
+ * @param {!Array} functions A list of functions
1044
+ * @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
1045
+ * @see {@link RA.isNotNil}
1046
+ * @example
1047
+ *
1048
+ * // returns first non-nil value
1049
+ * const stubNil = () => null;
1050
+ * const stubUndefined = () => undefined;
1051
+ * const addOne = v => v + 1;
1052
+ * const addTwo = v => v + 2;
1053
+ *
1054
+ * RA.dispatch([stubNil, stubUndefined, addOne, addTwo])(1); //=> 2
1055
+ *
1056
+ * // acts as a switch
1057
+ * const fnSwitch = RA.dispatch([
1058
+ * R.ifElse(RA.isString, s => `${s}-join`, RA.stubUndefined),
1059
+ * R.ifElse(RA.isNumber, n => n + 1, RA.stubUndefined),
1060
+ * R.ifElse(RA.isDate, R.T, RA.stubUndefined),
1061
+ * ]);
1062
+ * fnSwitch(1); //=> 2
1063
+ */
1029
1064
  var byArity = (0, _ramda.comparator)(function (a, b) {
1030
1065
  return a.length > b.length;
1031
1066
  });
@@ -1137,7 +1172,7 @@ function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "d
1137
1172
  * RA.ensureArray(42); //=> [42]
1138
1173
  * RA.ensureArray([42]); //=> [42]
1139
1174
  */
1140
- var ensureArray = (0, _ramda.when)(_isNotArray["default"], _ramda.of);
1175
+ var ensureArray = (0, _ramda.when)(_isNotArray["default"], (0, _ramda.of)(Array));
1141
1176
  var _default = ensureArray;
1142
1177
  exports["default"] = _default;
1143
1178
 
@@ -1718,7 +1753,7 @@ function _nonIterableSpread() { throw new TypeError("Invalid attempt to spread n
1718
1753
  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); }
1719
1754
  function _iterableToArray(iter) { if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter); }
1720
1755
  function _arrayWithoutHoles(arr) { if (Array.isArray(arr)) return _arrayLikeToArray(arr); }
1721
- 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; }
1756
+ 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; }
1722
1757
  var flatten1 = (0, _makeFlat2["default"])(false);
1723
1758
 
1724
1759
  /**
@@ -1823,7 +1858,7 @@ function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "d
1823
1858
  * ); // => { a: 1, c: 3, d: 4, b: { c: 3, d: 4 } };
1824
1859
  */
1825
1860
  var flattenProp = (0, _ramda.curry)(function (prop, obj) {
1826
- return (0, _flattenPath["default"])((0, _ramda.of)(prop), obj);
1861
+ return (0, _flattenPath["default"])((0, _ramda.of)(Array, prop), obj);
1827
1862
  });
1828
1863
  var _default = flattenProp;
1829
1864
  exports["default"] = _default;
@@ -2145,7 +2180,7 @@ function _nonIterableSpread() { throw new TypeError("Invalid attempt to spread n
2145
2180
  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); }
2146
2181
  function _iterableToArray(iter) { if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter); }
2147
2182
  function _arrayWithoutHoles(arr) { if (Array.isArray(arr)) return _arrayLikeToArray(arr); }
2148
- 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; }
2183
+ 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; }
2149
2184
  var copyArray = function copyArray(items, mapFn, thisArg) {
2150
2185
  var boundMapFn = (0, _isNotUndefined["default"])(thisArg) ? (0, _ramda.bind)(mapFn, thisArg) : mapFn;
2151
2186
  return (0, _isNotUndefined["default"])(mapFn) ? _toConsumableArray(items).map(boundMapFn) : _toConsumableArray(items);
@@ -2303,7 +2338,7 @@ function _nonIterableSpread() { throw new TypeError("Invalid attempt to spread n
2303
2338
  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); }
2304
2339
  function _iterableToArray(iter) { if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter); }
2305
2340
  function _arrayWithoutHoles(arr) { if (Array.isArray(arr)) return _arrayLikeToArray(arr); }
2306
- 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; }
2341
+ 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; }
2307
2342
  var onFulfill = function onFulfill(value) {
2308
2343
  return {
2309
2344
  status: 'fulfilled',
@@ -2343,7 +2378,7 @@ function _nonIterableSpread() { throw new TypeError("Invalid attempt to spread n
2343
2378
  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); }
2344
2379
  function _iterableToArray(iter) { if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter); }
2345
2380
  function _arrayWithoutHoles(arr) { if (Array.isArray(arr)) return _arrayLikeToArray(arr); }
2346
- 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; }
2381
+ 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; }
2347
2382
  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); } }
2348
2383
  function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, "prototype", { writable: false }); return Constructor; }
2349
2384
  function _toPropertyKey(arg) { var key = _toPrimitive(arg, "string"); return _typeof(key) === "symbol" ? key : String(key); }
@@ -3114,7 +3149,7 @@ var _ramda = __webpack_require__(3288);
3114
3149
  * RA.isFalse(new Boolean(false)); // => false
3115
3150
  */
3116
3151
 
3117
- var isFalse = (0, _ramda.identical)(false);
3152
+ var isFalse = (0, _ramda.curryN)(1, (0, _ramda.identical)(false));
3118
3153
  var _default = isFalse;
3119
3154
  exports["default"] = _default;
3120
3155
 
@@ -3665,7 +3700,7 @@ var _ramda = __webpack_require__(3288);
3665
3700
  * RA.isNegativeZero(0); //=> false
3666
3701
  * RA.isNegativeZero(null); //=> false
3667
3702
  */
3668
- var isNegativeZero = (0, _ramda.identical)(-0);
3703
+ var isNegativeZero = (0, _ramda.curryN)(1, (0, _ramda.identical)(-0));
3669
3704
  var _default = isNegativeZero;
3670
3705
  exports["default"] = _default;
3671
3706
 
@@ -5215,7 +5250,7 @@ var _ramda = __webpack_require__(3288);
5215
5250
  * RA.isPositiveZero(-0); //=> false
5216
5251
  * RA.isPositiveZero(null); //=> false
5217
5252
  */
5218
- var isPositiveZero = (0, _ramda.identical)(+0);
5253
+ var isPositiveZero = (0, _ramda.curryN)(1, (0, _ramda.identical)(+0));
5219
5254
  var _default = isPositiveZero;
5220
5255
  exports["default"] = _default;
5221
5256
 
@@ -5453,8 +5488,7 @@ function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "d
5453
5488
  * RA.isSentinelValue('-1'); //=> false
5454
5489
  * RA.isSentinelValue(1); //=> false
5455
5490
  * RA.isSentinelValue([-1]); //=> false
5456
- */
5457
- // eslint-disable-next-line no-bitwise
5491
+ */ // eslint-disable-next-line no-bitwise
5458
5492
  var isSentinelValue = (0, _ramda.curryN)(1, function (val) {
5459
5493
  return (0, _isInteger["default"])(val) && ~val === 0;
5460
5494
  });
@@ -5670,7 +5704,7 @@ var _ramda = __webpack_require__(3288);
5670
5704
  * RA.isTrue(new Boolean(true)); // => false
5671
5705
  */
5672
5706
 
5673
- var isTrue = (0, _ramda.identical)(true);
5707
+ var isTrue = (0, _ramda.curryN)(1, (0, _ramda.identical)(true));
5674
5708
  var _default = isTrue;
5675
5709
  exports["default"] = _default;
5676
5710
 
@@ -5877,7 +5911,7 @@ function _nonIterableSpread() { throw new TypeError("Invalid attempt to spread n
5877
5911
  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); }
5878
5912
  function _iterableToArray(iter) { if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter); }
5879
5913
  function _arrayWithoutHoles(arr) { if (Array.isArray(arr)) return _arrayLikeToArray(arr); }
5880
- 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; }
5914
+ 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; }
5881
5915
  /**
5882
5916
  * Returns a promise that is fulfilled by the last given promise to be fulfilled,
5883
5917
  * or rejected with an array of rejection reasons if all of the given promises are rejected.
@@ -6372,8 +6406,10 @@ function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "d
6372
6406
  * @since {@link https://char0n.github.io/ramda-adjunct/2.7.0|2.7.0}
6373
6407
  * @category Relation
6374
6408
  * @typedef Lens s a = Functor f => (a -> f a) -> s -> f s
6409
+ * @sig fantasy-land/of :: TypeRep f => f ~> a → f a
6375
6410
  * @sig Applicative f => (a -> f a) -> Lens s a
6376
- * @param {!function} of The Applicative-returning function
6411
+ * @sig Applicative f => TypeRep f -> Lens s a
6412
+ * @param {!Object|!Function} TypeRepresentative with an `of` or `fantasy-land/of` method
6377
6413
  * @return {!function} The Traversable lens
6378
6414
  * @see {@link http://ramdajs.com/docs/#lens|R.lens}, {@link http://ramdajs.com/docs/#traverse|R.traverse}
6379
6415
  *
@@ -6389,11 +6425,17 @@ function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "d
6389
6425
  *
6390
6426
  * R.set(maybeLens, Maybe.Just(1), [Maybe.just(2), Maybe.Just(3)]); // => Maybe.Just([1, 1])
6391
6427
  */
6392
- var lensTraverse = (0, _ramda.curryN)(1, function (of) {
6428
+ /* eslint-disable no-nested-ternary */
6429
+ var lensTraverse = (0, _ramda.curryN)(1, function (F) {
6430
+ var of = typeof F['fantasy-land/of'] === 'function' ? F['fantasy-land/of'] : typeof F.of === 'function' ? F.of : F;
6431
+ var TypeRep = {
6432
+ 'fantasy-land/of': of
6433
+ };
6393
6434
  return (0, _ramda.curry)(function (toFunctorFn, target) {
6394
- return _Identity["default"].of((0, _ramda.traverse)(of, (0, _ramda.pipe)(toFunctorFn, (0, _ramda.prop)('value')), target));
6435
+ return _Identity["default"].of((0, _ramda.traverse)(TypeRep, (0, _ramda.pipe)(toFunctorFn, (0, _ramda.prop)('value')), target));
6395
6436
  });
6396
6437
  });
6438
+ /* eslint-enable */
6397
6439
  var _default = lensTraverse;
6398
6440
  exports["default"] = _default;
6399
6441
 
@@ -6680,7 +6722,7 @@ function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "d
6680
6722
  * ); //=> { outer: { foo: 3, bar: 4 } };
6681
6723
  */
6682
6724
  var mergeProp = (0, _ramda.curry)(function (p, subj, obj) {
6683
- return (0, _mergePath["default"])((0, _ramda.of)(p), subj, obj);
6725
+ return (0, _mergePath["default"])((0, _ramda.of)(Array, p), subj, obj);
6684
6726
  });
6685
6727
  var _default = mergeProp;
6686
6728
  exports["default"] = _default;
@@ -7435,10 +7477,10 @@ var _ramda = __webpack_require__(3288);
7435
7477
  * @memberOf RA
7436
7478
  * @since {@link https://char0n.github.io/ramda-adjunct/2.4.0|v2.4.0}
7437
7479
  * @category Relation
7438
- * @sig [Idx] => a => {a} => Boolean
7439
- * @sig Idx = String | Int
7440
- * @param {Array} path The path of the nested property to use
7480
+ * @sig a => [Idx] => {a} => Boolean
7481
+ * @sig Idx = String | Int | Symbol
7441
7482
  * @param {a} val The value to compare the nested property with
7483
+ * @param {Array} path The path of the nested property to use
7442
7484
  * @param {Object} object The object to check the nested property in
7443
7485
  * @return {boolean} Returns Boolean `false` if the value equals the nested object property, `true` otherwise
7444
7486
  * @see {@link http://ramdajs.com/docs/#pathEq|R.pathEq}
@@ -7448,7 +7490,7 @@ var _ramda = __webpack_require__(3288);
7448
7490
  * const user2 = { address: { zipCode: 55555 } };
7449
7491
  * const user3 = { name: 'Bob' };
7450
7492
  * const users = [ user1, user2, user3 ];
7451
- * const isFamous = R.pathNotEq(['address', 'zipCode'], 90210);
7493
+ * const isFamous = R.pathNotEq(90210, ['address', 'zipCode']);
7452
7494
  * R.filter(isFamous, users); //=> [ user2, user3 ]
7453
7495
  */
7454
7496
  /* eslint-enable max-len */
@@ -7587,9 +7629,9 @@ var _ramda = __webpack_require__(3288);
7587
7629
  * @memberOf RA
7588
7630
  * @since {@link https://char0n.github.io/ramda-adjunct/2.3.0|v2.3.0}
7589
7631
  * @category Relation
7590
- * @sig String -> a -> Object -> Boolean
7591
- * @param {String} name The property to pick
7632
+ * @sig a -> String -> Object -> Boolean
7592
7633
  * @param {a} val The value to compare to
7634
+ * @param {String} name The property to pick
7593
7635
  * @param {Object} object The object, that presumably contains value under the property
7594
7636
  * @return {boolean} Comparison result
7595
7637
  * @see {@link http://ramdajs.com/docs/#propEq|R.propEq}
@@ -7600,7 +7642,7 @@ var _ramda = __webpack_require__(3288);
7600
7642
  * const rusty = { name: 'Rusty', age: 10, hair: 'brown' };
7601
7643
  * const alois = { name: 'Alois', age: 15, disposition: 'surly' };
7602
7644
  * const kids = [abby, fred, rusty, alois];
7603
- * const hasNotBrownHair = RA.propNotEq('hair', 'brown');
7645
+ * const hasNotBrownHair = RA.propNotEq('brown', 'hair');
7604
7646
  *
7605
7647
  * R.filter(hasNotBrownHair, kids); //=> [abby, alois]
7606
7648
  */
@@ -7712,8 +7754,8 @@ function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "d
7712
7754
  function _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _unsupportedIterableToArray(arr, i) || _nonIterableRest(); }
7713
7755
  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."); }
7714
7756
  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); }
7715
- 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; }
7716
- 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; } }
7757
+ 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; }
7758
+ 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; } }
7717
7759
  function _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }
7718
7760
  /* eslint-disable max-len */
7719
7761
  /**
@@ -7822,8 +7864,8 @@ function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "d
7822
7864
  function _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _unsupportedIterableToArray(arr, i) || _nonIterableRest(); }
7823
7865
  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."); }
7824
7866
  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); }
7825
- 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; }
7826
- 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; } }
7867
+ 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; }
7868
+ 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; } }
7827
7869
  function _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }
7828
7870
  // in older ramda versions the order of the arguments is flipped
7829
7871
  var flipArgs = (0, _ramda.pipe)((0, _ramda.reduceRight)(_ramda.concat, ''), (0, _ramda.equals)('ba'))(['a', 'b']);
@@ -8274,7 +8316,6 @@ var _ramda = __webpack_require__(3288);
8274
8316
  * )('test'); //=> 'PREFIX TEST'
8275
8317
  */
8276
8318
  /* eslint-enable max-len */
8277
-
8278
8319
  var seq = (0, _ramda.curry)(function (fns, x) {
8279
8320
  return (0, _ramda.tap)(function (tx) {
8280
8321
  return (0, _ramda.map)(function (fn) {
@@ -8552,7 +8593,7 @@ var _ramda = __webpack_require__(3288);
8552
8593
  function _toArray(arr) { return _arrayWithHoles(arr) || _iterableToArray(arr) || _unsupportedIterableToArray(arr) || _nonIterableRest(); }
8553
8594
  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."); }
8554
8595
  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); }
8555
- 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; }
8596
+ 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; }
8556
8597
  function _iterableToArray(iter) { if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter); }
8557
8598
  function _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }
8558
8599
  /**
@@ -8659,7 +8700,7 @@ function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { "d
8659
8700
  * RA.spreadProp('b', { a: 1, b: { c: 3, d: 4 } }); // => { a: 1, c: 3, d: 4 };
8660
8701
  */
8661
8702
  var spreadProp = (0, _ramda.curry)(function (prop, obj) {
8662
- return (0, _spreadPath["default"])((0, _ramda.of)(prop), obj);
8703
+ return (0, _spreadPath["default"])((0, _ramda.of)(Array, prop), obj);
8663
8704
  });
8664
8705
  var _default = spreadProp;
8665
8706
  exports["default"] = _default;
@@ -8942,8 +8983,7 @@ var _ramda = __webpack_require__(3288);
8942
8983
  *
8943
8984
  * RA.toInteger32(2 ** 35); // => 0
8944
8985
  * RA.toInteger32(2 ** 30); // => 1073741824
8945
- */
8946
- // eslint-disable-next-line no-bitwise
8986
+ */ // eslint-disable-next-line no-bitwise
8947
8987
  var toInteger32 = (0, _ramda.curryN)(1, function (val) {
8948
8988
  return val >> 0;
8949
8989
  });
@@ -9011,9 +9051,7 @@ var _ramda = __webpack_require__(3288);
9011
9051
  * RA.toInteger32(2 ** 35); // => 0
9012
9052
  * RA.toInteger32(2 ** 31); // => 2147483648
9013
9053
  * RA.toInteger32(2 ** 30); // => 1073741824
9014
- */
9015
-
9016
- // eslint-disable-next-line no-bitwise
9054
+ */ // eslint-disable-next-line no-bitwise
9017
9055
  var toUinteger32 = (0, _ramda.curryN)(1, function (val) {
9018
9056
  return val >>> 0;
9019
9057
  });