@moda/om 19.4.1 → 19.4.3

package/dist/index.esm.js

@@ -323,6 +323,7 @@ colors.colors = {
     "teal": "rgb(0, 111, 98)",
     "ivory": "rgb(242, 233, 219)",
     "klein-blue": "rgb(38, 48, 120)",
+    "persian-blue": "rgb(30, 34, 170)",
     "brick": "rgb(147, 58, 32)",
     "goldenrod": "rgb(186, 145, 46)",
     "seafoam": "rgb(177, 191, 170)",
@@ -348,6 +349,7 @@ colors.colors = {
   },
   "global": {
     "klein-blue": "rgb(38, 48, 120)",
+    "persian-blue": "rgb(30, 34, 170)",
     "brick": "rgb(147, 58, 32)",
     "goldenrod": "rgb(186, 145, 46)",
     "seafoam": "rgb(177, 191, 170)",
@@ -999,6 +1001,85 @@ var colorStringExports = colorString.exports;
   __exportStar(helpers, exports);
 })(dist$4);
 
+function _arrayLikeToArray(r, a) {
+  (null == a || a > r.length) && (a = r.length);
+  for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e];
+  return n;
+}
+function _arrayWithHoles(r) {
+  if (Array.isArray(r)) return r;
+}
+function _arrayWithoutHoles(r) {
+  if (Array.isArray(r)) return _arrayLikeToArray(r);
+}
+function _createForOfIteratorHelper(r, e) {
+  var t = "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"];
+  if (!t) {
+    if (Array.isArray(r) || (t = _unsupportedIterableToArray(r)) || e  ) {
+      t && (r = t);
+      var n = 0,
+        F = function () {};
+      return {
+        s: F,
+        n: function () {
+          return n >= r.length ? {
+            done: !0
+          } : {
+            done: !1,
+            value: r[n++]
+          };
+        },
+        e: function (r) {
+          throw r;
+        },
+        f: F
+      };
+    }
+    throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
+  }
+  var o,
+    a = !0,
+    u = !1;
+  return {
+    s: function () {
+      t = t.call(r);
+    },
+    n: function () {
+      var r = t.next();
+      return a = r.done, r;
+    },
+    e: function (r) {
+      u = !0, o = r;
+    },
+    f: function () {
+      try {
+        a || null == t.return || t.return();
+      } finally {
+        if (u) throw o;
+      }
+    }
+  };
+}
+function _defineProperty$1(e, r, t) {
+  return (r = _toPropertyKey(r)) in e ? Object.defineProperty(e, r, {
+    value: t,
+    enumerable: !0,
+    configurable: !0,
+    writable: !0
+  }) : e[r] = t, e;
+}
+function _extends$1() {
+  return _extends$1 = Object.assign ? Object.assign.bind() : function (n) {
+    for (var e = 1; e < arguments.length; e++) {
+      var t = arguments[e];
+      for (var r in t) ({}).hasOwnProperty.call(t, r) && (n[r] = t[r]);
+    }
+    return n;
+  }, _extends$1.apply(null, arguments);
+}
+function _iterableToArray(r) {
+  if ("undefined" != typeof Symbol && null != r[Symbol.iterator] || null != r["@@iterator"]) return Array.from(r);
+}
 function _iterableToArrayLimit(r, l) {
   var t = null == r ? null : "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"];
   if (null != t) {
@@ -1026,6 +1107,15 @@ function _iterableToArrayLimit(r, l) {
     return a;
   }
 }
+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 _nonIterableSpread() {
+  throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
+}
+function _objectDestructuringEmpty(t) {
+  if (null == t) throw new TypeError("Cannot destructure " + t);
+}
 function ownKeys(e, r) {
   var t = Object.keys(e);
   if (Object.getOwnPropertySymbols) {
@@ -1047,6 +1137,32 @@ function _objectSpread2(e) {
   }
   return e;
 }
+function _objectWithoutProperties(e, t) {
+  if (null == e) return {};
+  var o,
+    r,
+    i = _objectWithoutPropertiesLoose(e, t);
+  if (Object.getOwnPropertySymbols) {
+    var n = Object.getOwnPropertySymbols(e);
+    for (r = 0; r < n.length; r++) o = n[r], t.indexOf(o) >= 0 || {}.propertyIsEnumerable.call(e, o) && (i[o] = e[o]);
+  }
+  return i;
+}
+function _objectWithoutPropertiesLoose(r, e) {
+  if (null == r) return {};
+  var t = {};
+  for (var n in r) if ({}.hasOwnProperty.call(r, n)) {
+    if (e.indexOf(n) >= 0) continue;
+    t[n] = r[n];
+  }
+  return t;
+}
+function _slicedToArray(r, e) {
+  return _arrayWithHoles(r) || _iterableToArrayLimit(r, e) || _unsupportedIterableToArray(r, e) || _nonIterableRest();
+}
+function _toConsumableArray(r) {
+  return _arrayWithoutHoles(r) || _iterableToArray(r) || _unsupportedIterableToArray(r) || _nonIterableSpread();
+}
 function _toPrimitive(t, r) {
   if ("object" != typeof t || !t) return t;
   var e = t[Symbol.toPrimitive];
@@ -1070,148 +1186,12 @@ function _typeof$1(o) {
     return o && "function" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? "symbol" : typeof o;
   }, _typeof$1(o);
 }
-function _defineProperty$1(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 _extends$1() {
-  _extends$1 = Object.assign ? Object.assign.bind() : function (target) {
-    for (var i = 1; i < arguments.length; i++) {
-      var source = arguments[i];
-      for (var key in source) {
-        if (Object.prototype.hasOwnProperty.call(source, key)) {
-          target[key] = source[key];
-        }
-      }
-    }
-    return target;
-  };
-  return _extends$1.apply(this, arguments);
-}
-function _objectDestructuringEmpty(obj) {
-  if (obj == null) throw new TypeError("Cannot destructure " + obj);
-}
-function _objectWithoutPropertiesLoose(source, excluded) {
-  if (source == null) return {};
-  var target = {};
-  var sourceKeys = Object.keys(source);
-  var key, i;
-  for (i = 0; i < sourceKeys.length; i++) {
-    key = sourceKeys[i];
-    if (excluded.indexOf(key) >= 0) continue;
-    target[key] = source[key];
-  }
-  return target;
-}
-function _objectWithoutProperties(source, excluded) {
-  if (source == null) return {};
-  var target = _objectWithoutPropertiesLoose(source, excluded);
-  var key, i;
-  if (Object.getOwnPropertySymbols) {
-    var sourceSymbolKeys = Object.getOwnPropertySymbols(source);
-    for (i = 0; i < sourceSymbolKeys.length; i++) {
-      key = sourceSymbolKeys[i];
-      if (excluded.indexOf(key) >= 0) continue;
-      if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue;
-      target[key] = source[key];
-    }
+function _unsupportedIterableToArray(r, a) {
+  if (r) {
+    if ("string" == typeof r) return _arrayLikeToArray(r, a);
+    var t = {}.toString.call(r).slice(8, -1);
+    return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? Array.from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? _arrayLikeToArray(r, a) : void 0;
   }
-  return target;
-}
-function _slicedToArray(arr, i) {
-  return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _unsupportedIterableToArray(arr, i) || _nonIterableRest();
-}
-function _toConsumableArray(arr) {
-  return _arrayWithoutHoles(arr) || _iterableToArray(arr) || _unsupportedIterableToArray(arr) || _nonIterableSpread();
-}
-function _arrayWithoutHoles(arr) {
-  if (Array.isArray(arr)) return _arrayLikeToArray(arr);
-}
-function _arrayWithHoles(arr) {
-  if (Array.isArray(arr)) return arr;
-}
-function _iterableToArray(iter) {
-  if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
-}
-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 _nonIterableSpread() {
-  throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
-}
-function _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 _createForOfIteratorHelper(o, allowArrayLike) {
-  var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"];
-  if (!it) {
-    if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") {
-      if (it) o = it;
-      var i = 0;
-      var F = function () {};
-      return {
-        s: F,
-        n: function () {
-          if (i >= o.length) return {
-            done: true
-          };
-          return {
-            done: false,
-            value: o[i++]
-          };
-        },
-        e: function (e) {
-          throw e;
-        },
-        f: F
-      };
-    }
-    throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
-  }
-  var normalCompletion = true,
-    didErr = false,
-    err;
-  return {
-    s: function () {
-      it = it.call(o);
-    },
-    n: function () {
-      var step = it.next();
-      normalCompletion = step.done;
-      return step;
-    },
-    e: function (e) {
-      didErr = true;
-      err = e;
-    },
-    f: function () {
-      try {
-        if (!normalCompletion && it.return != null) it.return();
-      } finally {
-        if (didErr) throw err;
-      }
-    }
-  };
 }
 
 var isRenderProps = function isRenderProps(children) {
@@ -1524,6 +1504,7 @@ function useCallbackRef(initialValue, callback) {
   return ref.facade;
 }
 
+var useIsomorphicLayoutEffect = typeof window !== 'undefined' ? React.useLayoutEffect : React.useEffect;
 var currentValues = new WeakMap();
 /**
  * Merges two or more refs together providing a single interface to set their value
@@ -1540,13 +1521,13 @@ var currentValues = new WeakMap();
  * }
  */
 function useMergeRefs(refs, defaultValue) {
-  var callbackRef = useCallbackRef(defaultValue || null, function (newValue) {
+  var callbackRef = useCallbackRef(null, function (newValue) {
     return refs.forEach(function (ref) {
       return assignRef(ref, newValue);
     });
   });
   // handle refs changes - added or removed
-  React.useLayoutEffect(function () {
+  useIsomorphicLayoutEffect(function () {
     var oldValue = currentValues.get(callbackRef);
     if (oldValue) {
       var prevRefs_1 = new Set(oldValue);
@@ -3105,7 +3086,6 @@ FocusLock.propTypes = process.env.NODE_ENV !== "production" ? {
   onDeactivation: propTypesExports.func,
   sideCar: propTypesExports.any.isRequired
 } : {};
-var FocusLockUI = FocusLock;
 
 function deferAction(action) {
   setTimeout(action, 1);
@@ -3160,7 +3140,7 @@ var FocusOn$1 = /*#__PURE__*/React.forwardRef(function (props, parentRef) {
     inert: inert,
     enabled: enabled && scrollLock
   });
-  return /*#__PURE__*/React.createElement(React.Fragment, null, /*#__PURE__*/React.createElement(FocusLockUI, {
+  return /*#__PURE__*/React.createElement(React.Fragment, null, /*#__PURE__*/React.createElement(FocusLock, {
     ref: parentRef,
     sideCar: sideCar,
     disabled: !(lockProps && enabled && focusLock),
@@ -4047,6 +4027,13 @@ var moveFocusInside = function moveFocusInside(topNode, lastNode, options) {
 
 function weakRef(value) {
   if (!value) return null;
+  // #68 Safari 14.1 dont have it yet
+  // FIXME: remove in 2025
+  if (typeof WeakRef === 'undefined') {
+    return function () {
+      return value || null;
+    };
+  }
   var w = value ? new WeakRef(value) : null;
   return function () {
     return (w === null || w === void 0 ? void 0 : w.deref()) || null;
@@ -4762,9 +4749,9 @@ var handleScroll = function handleScroll(axis, endTarget, event, sourceDelta, no
   // self content
   targetInLock && (endTarget.contains(target) || endTarget === target));
   // handle epsilon around 0 (non standard zoom levels)
-  if (isDeltaPositive && (noOverscroll && Math.abs(availableScroll) < 1 || !noOverscroll && delta > availableScroll)) {
+  if (isDeltaPositive && (Math.abs(availableScroll) < 1 || !noOverscroll )) {
     shouldCancelScroll = true;
-  } else if (!isDeltaPositive && (noOverscroll && Math.abs(availableScrollTop) < 1 || !noOverscroll && -delta > availableScrollTop)) {
+  } else if (!isDeltaPositive && (Math.abs(availableScrollTop) < 1 || !noOverscroll )) {
     shouldCancelScroll = true;
   }
   return shouldCancelScroll;
@@ -5065,9 +5052,6 @@ var applyAttributeToOthers = function applyAttributeToOthers(originalTarget, par
  * @return {Undo} undo command
  */
 var hideOthers = function hideOthers(originalTarget, parentNode, markerName) {
-  if (markerName === void 0) {
-    markerName = 'data-aria-hidden';
-  }
   var targets = Array.from(Array.isArray(originalTarget) ? originalTarget : [originalTarget]);
   var activeParentNode = parentNode || getDefaultParent(originalTarget);
   if (!activeParentNode) {
@@ -5494,10 +5478,13 @@ var Breadcrumb = function Breadcrumb(_ref) {
 var T = function T() {
   return true;
 };
-var otherwise = T;
+
+var _placeholder = {
+  '@@functional/placeholder': true
+};
 
 function _isPlaceholder(a) {
-  return a != null && _typeof$1(a) === 'object' && a['@@functional/placeholder'] === true;
+  return a === _placeholder;
 }
 
 /**
@@ -5508,7 +5495,6 @@ function _isPlaceholder(a) {
  * @param {Function} fn The function to curry.
  * @return {Function} The curried function.
  */
-
 function _curry1(fn) {
   return function f1(a) {
     if (arguments.length === 0 || _isPlaceholder(a)) {
@@ -5527,7 +5513,6 @@ function _curry1(fn) {
  * @param {Function} fn The function to curry.
  * @return {Function} The curried function.
  */
-
 function _curry2(fn) {
   return function f2(a, b) {
     switch (arguments.length) {
@@ -5609,7 +5594,6 @@ function _arity(n, fn) {
  * @param {Function} fn The function to curry.
  * @return {Function} The curried function.
  */
-
 function _curryN(length, received, fn) {
   return function () {
     var combined = [];
@@ -5679,9 +5663,7 @@ function _curryN(length, received, fn) {
  *      const g = f(3);
  *      g(4); //=> 10
  */
-
-var curryN = /*#__PURE__*/
-_curry2(function curryN(length, fn) {
+var curryN = /*#__PURE__*/_curry2(function curryN(length, fn) {
   if (length === 1) {
     return _curry1(fn);
   }
@@ -5696,7 +5678,6 @@ _curry2(function curryN(length, fn) {
  * @param {Function} fn The function to curry.
  * @return {Function} The curried function.
  */
-
 function _curry3(fn) {
   return function f3(a, b, c) {
     switch (arguments.length) {
@@ -5767,7 +5748,6 @@ function _isTransformer(obj) {
  * @param {Function} fn default ramda implementation
  * @return {Function} A function that dispatches on object in list position
  */
-
 function _dispatchable(methodNames, transducerCreator, fn) {
   return function () {
     if (arguments.length === 0) {
@@ -5846,8 +5826,7 @@ function _objectIs(a, b) {
 var _objectIs$1 = typeof Object.is === 'function' ? Object.is : _objectIs;
 
 var toString$1 = Object.prototype.toString;
-var _isArguments = /*#__PURE__*/
-function () {
+var _isArguments = /*#__PURE__*/function () {
   return toString$1.call(arguments) === '[object Arguments]' ? function _isArguments(x) {
     return toString$1.call(x) === '[object Arguments]';
   } : function _isArguments(x) {
@@ -5855,14 +5834,13 @@ function () {
   };
 }();
 
-var hasEnumBug = ! /*#__PURE__*/
-{
+// cover IE < 9 keys issues
+var hasEnumBug = ! /*#__PURE__*/{
   toString: null
 }.propertyIsEnumerable('toString');
-var nonEnumerableProps = ['constructor', 'valueOf', 'isPrototypeOf', 'toString', 'propertyIsEnumerable', 'hasOwnProperty', 'toLocaleString']; // Safari bug
-
-var hasArgsEnumBug = /*#__PURE__*/
-function () {
+var nonEnumerableProps = ['constructor', 'valueOf', 'isPrototypeOf', 'toString', 'propertyIsEnumerable', 'hasOwnProperty', 'toLocaleString'];
+// Safari bug
+var hasArgsEnumBug = /*#__PURE__*/function () {
 
   return arguments.propertyIsEnumerable('length');
 }();
@@ -5876,6 +5854,7 @@ var contains = function contains(list, item) {
   }
   return false;
 };
+
 /**
  * Returns a list containing the names of all the enumerable own properties of
  * the supplied object.
@@ -5894,12 +5873,9 @@ var contains = function contains(list, item) {
  *
  *      R.keys({a: 1, b: 2, c: 3}); //=> ['a', 'b', 'c']
  */
-
-var keys = typeof Object.keys === 'function' && !hasArgsEnumBug ? /*#__PURE__*/
-_curry1(function keys(obj) {
+var keys = typeof Object.keys === 'function' && !hasArgsEnumBug ? /*#__PURE__*/_curry1(function keys(obj) {
   return Object(obj) !== obj ? [] : Object.keys(obj);
-}) : /*#__PURE__*/
-_curry1(function keys(obj) {
+}) : /*#__PURE__*/_curry1(function keys(obj) {
   if (Object(obj) !== obj) {
     return [];
   }
@@ -5949,10 +5925,9 @@ _curry1(function keys(obj) {
  *      R.type(() => {}); //=> "Function"
  *      R.type(async () => {}); //=> "AsyncFunction"
  *      R.type(undefined); //=> "Undefined"
+ *      R.type(BigInt(123)); //=> "BigInt"
  */
-
-var type = /*#__PURE__*/
-_curry1(function type(val) {
+var type = /*#__PURE__*/_curry1(function type(val) {
   return val === null ? 'Null' : val === undefined ? 'Undefined' : Object.prototype.toString.call(val).slice(8, -1);
 });
 
@@ -5972,8 +5947,9 @@ function _uniqContentEquals(aIterator, bIterator, stackA, stackB) {
   var b = _arrayFromIterator(bIterator);
   function eq(_a, _b) {
     return _equals(_a, _b, stackA.slice(), stackB.slice());
-  } // if *a* array contains any element that is not included in *b*
+  }
 
+  // if *a* array contains any element that is not included in *b*
   return !_includesWith(function (b, aItem) {
     return !_includesWith(eq, aItem, b);
   }, b, a);
@@ -6104,15 +6080,13 @@ function _equals(a, b, stackA, stackB) {
  *      const b = {}; b.v = b;
  *      R.equals(a, b); //=> true
  */
-
-var equals = /*#__PURE__*/
-_curry2(function equals(a, b) {
+var equals = /*#__PURE__*/_curry2(function equals(a, b) {
   return _equals(a, b, [], []);
 });
 
 function _indexOf(list, a, idx) {
-  var inf, item; // Array.prototype.indexOf doesn't exist below IE9
-
+  var inf, item;
+  // Array.prototype.indexOf doesn't exist below IE9
   if (typeof list.indexOf === 'function') {
     switch (_typeof$1(a)) {
       case 'number':
@@ -6137,11 +6111,11 @@ function _indexOf(list, a, idx) {
             idx += 1;
           }
           return -1;
-        } // non-zero numbers can utilise Set
-
+        }
+        // non-zero numbers can utilise Set
         return list.indexOf(a, idx);
-      // all these types can utilise Set
 
+      // all these types can utilise Set
       case 'string':
       case 'boolean':
       case 'function':
@@ -6153,8 +6127,8 @@ function _indexOf(list, a, idx) {
           return list.indexOf(a, idx);
         }
     }
-  } // anything else not covered above, defer to R.equals
-
+  }
+  // anything else not covered above, defer to R.equals
   while (idx < list.length) {
     if (equals(list[idx], a)) {
       return idx;
@@ -6230,8 +6204,7 @@ function _isObject(x) {
   return Object.prototype.toString.call(x) === '[object Object]';
 }
 
-var XFilter = /*#__PURE__*/
-function () {
+var XFilter = /*#__PURE__*/function () {
   function XFilter(f, xf) {
     this.xf = xf;
     this.f = f;
@@ -6277,10 +6250,7 @@ function _xfilter(f) {
  *
  *      R.filter(isEven, {a: 1, b: 2, c: 3, d: 4}); //=> {b: 2, d: 4}
  */
-
-var filter = /*#__PURE__*/
-_curry2( /*#__PURE__*/
-_dispatchable(['fantasy-land/filter', 'filter'], _xfilter, function (pred, filterable) {
+var filter = /*#__PURE__*/_curry2( /*#__PURE__*/_dispatchable(['fantasy-land/filter', 'filter'], _xfilter, function (pred, filterable) {
   return _isObject(filterable) ? _arrayReduce(function (acc, key) {
     if (pred(filterable[key])) {
       acc[key] = filterable[key];
@@ -6315,19 +6285,17 @@ _dispatchable(['fantasy-land/filter', 'filter'], _xfilter, function (pred, filte
  *
  *      R.reject(isOdd, {a: 1, b: 2, c: 3, d: 4}); //=> {b: 2, d: 4}
  */
-
-var reject = /*#__PURE__*/
-_curry2(function reject(pred, filterable) {
+var reject = /*#__PURE__*/_curry2(function reject(pred, filterable) {
   return filter(_complement(pred), filterable);
 });
-var reject$1 = reject;
 
 function _toString(x, seen) {
   var recur = function recur(y) {
     var xs = seen.concat([x]);
     return _includes(y, xs) ? '<Circular>' : _toString(y, xs);
-  }; //  mapPairs :: (Object, [String]) -> [String]
+  };
 
+  //  mapPairs :: (Object, [String]) -> [String]
   var mapPairs = function mapPairs(obj, keys) {
     return _map(function (k) {
       return _quote(k) + ': ' + recur(obj[k]);
@@ -6337,7 +6305,7 @@ function _toString(x, seen) {
     case '[object Arguments]':
       return '(function() { return arguments; }(' + _map(recur, x).join(', ') + '))';
     case '[object Array]':
-      return '[' + _map(recur, x).concat(mapPairs(x, reject$1(function (k) {
+      return '[' + _map(recur, x).concat(mapPairs(x, reject(function (k) {
         return /^\d+$/.test(k);
       }, keys(x)))).join(', ') + ']';
     case '[object Boolean]':
@@ -6403,9 +6371,7 @@ function _toString(x, seen) {
  *      R.toString({foo: 1, bar: 2, baz: 3}); //=> '{"bar": 2, "baz": 3, "foo": 1}'
  *      R.toString(new Date('2001-02-03T04:05:06Z')); //=> 'new Date("2001-02-03T04:05:06.000Z")'
  */
-
-var toString = /*#__PURE__*/
-_curry1(function toString(val) {
+var toString = /*#__PURE__*/_curry1(function toString(val) {
   return _toString(val, []);
 });
 
@@ -6426,9 +6392,7 @@ _curry1(function toString(val) {
  *      R.max(789, 123); //=> 789
  *      R.max('a', 'b'); //=> 'b'
  */
-
-var max = /*#__PURE__*/
-_curry2(function max(a, b) {
+var max = /*#__PURE__*/_curry2(function max(a, b) {
   if (a === b) {
     return b;
   }
@@ -6453,10 +6417,8 @@ _curry2(function max(a, b) {
   }
   return b;
 });
-var max$1 = max;
 
-var XMap = /*#__PURE__*/
-function () {
+var XMap = /*#__PURE__*/function () {
   function XMap(f, xf) {
     this.xf = xf;
     this.f = f;
@@ -6473,7 +6435,6 @@ var _xmap = function _xmap(f) {
     return new XMap(f, xf);
   };
 };
-var _xmap$1 = _xmap;
 
 /**
  * Takes a function and
@@ -6510,10 +6471,7 @@ var _xmap$1 = _xmap;
  * @symb R.map(f, { x: a, y: b }) = { x: f(a), y: f(b) }
  * @symb R.map(f, functor_o) = functor_o.map(f)
  */
-
-var map = /*#__PURE__*/
-_curry2( /*#__PURE__*/
-_dispatchable(['fantasy-land/map', 'map'], _xmap$1, function map(fn, functor) {
+var map = /*#__PURE__*/_curry2( /*#__PURE__*/_dispatchable(['fantasy-land/map', 'map'], _xmap, function map(fn, functor) {
   switch (Object.prototype.toString.call(functor)) {
     case '[object Function]':
       return curryN(functor.length, function () {
@@ -6551,9 +6509,7 @@ function _isString(x) {
  *      _isArrayLike({0: 'zero', 9: 'nine', length: 10}); //=> true
  *      _isArrayLike({nodeType: 1, length: 1}) // => false
  */
-
-var _isArrayLike = /*#__PURE__*/
-_curry1(function isArrayLike(x) {
+var _isArrayLike = /*#__PURE__*/_curry1(function isArrayLike(x) {
   if (_isArray(x)) {
     return true;
   }
@@ -6636,9 +6592,7 @@ function _xArrayReduce(xf, acc, list) {
  *      // logs {a: 2}
  * @symb R.bind(f, o)(a, b) = f.call(o, a, b)
  */
-
-var bind = /*#__PURE__*/
-_curry2(function bind(fn, thisObj) {
+var bind = /*#__PURE__*/_curry2(function bind(fn, thisObj) {
   return _arity(fn.length, function () {
     return fn.apply(thisObj, arguments);
   });
@@ -6659,11 +6613,9 @@ function _xIterableReduce(xf, acc, iter) {
 function _xMethodReduce(xf, acc, obj, methodName) {
   return xf['@@transducer/result'](obj[methodName](bind(xf['@@transducer/step'], xf), acc));
 }
-var _xReduce = /*#__PURE__*/
-_createReduce(_xArrayReduce, _xMethodReduce, _xIterableReduce);
+var _xReduce = /*#__PURE__*/_createReduce(_xArrayReduce, _xMethodReduce, _xIterableReduce);
 
-var XWrap = /*#__PURE__*/
-function () {
+var XWrap = /*#__PURE__*/function () {
   function XWrap(fn) {
     this.f = fn;
   }
@@ -6734,12 +6686,9 @@ function _xwrap(fn) {
  *
  * @symb R.reduce(f, a, [b, c, d]) = f(f(f(a, b), c), d)
  */
-
-var reduce = /*#__PURE__*/
-_curry3(function (xf, acc, list) {
+var reduce = /*#__PURE__*/_curry3(function (xf, acc, list) {
   return _xReduce(typeof xf === 'function' ? _xwrap(xf) : xf, acc, list);
 });
-var reduce$1 = reduce;
 
 function _identity(x) {
   return x;
@@ -6764,10 +6713,7 @@ function _identity(x) {
  *      R.identity(obj) === obj; //=> true
  * @symb R.identity(a) = a
  */
-
-var identity = /*#__PURE__*/
-_curry1(_identity);
-var identity$1 = identity;
+var identity = /*#__PURE__*/_curry1(_identity);
 
 /**
  * Returns a function, `fn`, which encapsulates `if/else, if/else, ...` logic.
@@ -6800,10 +6746,8 @@ var identity$1 = identity;
  *      fn(50); //=> 'nothing special happens at 50°C'
  *      fn(100); //=> 'water boils at 100°C'
  */
-
-var cond = /*#__PURE__*/
-_curry1(function cond(pairs) {
-  var arity = reduce$1(max$1, 0, map(function (pair) {
+var cond = /*#__PURE__*/_curry1(function cond(pairs) {
+  var arity = reduce(max, 0, map(function (pair) {
     return pair[0].length;
   }, pairs));
   return _arity(arity, function () {
@@ -6817,28 +6761,29 @@ _curry1(function cond(pairs) {
   });
 });
 
-var _Set = /*#__PURE__*/
-function () {
+var _Set = /*#__PURE__*/function () {
   function _Set() {
     /* globals Set */
     this._nativeSet = typeof Set === 'function' ? new Set() : null;
     this._items = {};
   }
-
   // until we figure out why jsdoc chokes on this
   // @param item The item to add to the Set
   // @returns {boolean} true if the item did not exist prior, otherwise false
   //
   _Set.prototype.add = function (item) {
     return !hasOrAdd(item, true, this);
-  }; //
+  };
+
+  //
   // @param item The item to check for existence in the Set
   // @returns {boolean} true if the item exists in the Set, otherwise false
   //
-
   _Set.prototype.has = function (item) {
     return hasOrAdd(item, false, this);
-  }; //
+  };
+
+  //
   // Combines the logic for checking whether an item is a member of the set and
   // for adding a new item to the set.
   //
@@ -6848,7 +6793,6 @@ function () {
   // @param set        The set instance to check or add to.
   // @return {boolean} true if the item already existed, otherwise false.
   //
-
   return _Set;
 }();
 function hasOrAdd(item, shouldAdd, set) {
@@ -6867,8 +6811,8 @@ function hasOrAdd(item, shouldAdd, set) {
           }
           return false;
         }
-      } // these types can all utilise the native Set
-
+      }
+      // these types can all utilise the native Set
       if (set._nativeSet !== null) {
         if (shouldAdd) {
           prevSize = set._nativeSet.size;
@@ -6958,9 +6902,7 @@ function hasOrAdd(item, shouldAdd, set) {
         }
         return true;
       }
-
     /* falls through */
-
     default:
       // reduce the search size of heterogeneous sets by creating buckets
       // for each type.
@@ -6970,8 +6912,8 @@ function hasOrAdd(item, shouldAdd, set) {
           set._items[type] = [item];
         }
         return false;
-      } // scan through all previously applied items
-
+      }
+      // scan through all previously applied items
       if (!_includes(item, set._items[type])) {
         if (shouldAdd) {
           set._items[type].push(item);
@@ -6980,10 +6922,9 @@ function hasOrAdd(item, shouldAdd, set) {
       }
       return true;
   }
-} // A simple Set type that honours R.equals semantics
+}
 
-var XUniqBy = /*#__PURE__*/
-function () {
+var XUniqBy = /*#__PURE__*/function () {
   function XUniqBy(f, xf) {
     this.xf = xf;
     this.f = f;
@@ -7022,10 +6963,7 @@ function _xuniqBy(f) {
  *
  *      R.uniqBy(Math.abs, [-1, -5, 2, 10, 1, 2]); //=> [-1, -5, 2, 10]
  */
-
-var uniqBy = /*#__PURE__*/
-_curry2( /*#__PURE__*/
-_dispatchable([], _xuniqBy, function (fn, list) {
+var uniqBy = /*#__PURE__*/_curry2( /*#__PURE__*/_dispatchable([], _xuniqBy, function (fn, list) {
   var set = new _Set();
   var result = [];
   var idx = 0;
@@ -7058,9 +6996,7 @@ _dispatchable([], _xuniqBy, function (fn, list) {
  *      R.uniq([1, '1']);     //=> [1, '1']
  *      R.uniq([[42], [42]]); //=> [[42]]
  */
-
-var uniq = /*#__PURE__*/
-uniqBy(identity$1);
+var uniq = /*#__PURE__*/uniqBy(identity);
 
 function _isNumber(x) {
   return Object.prototype.toString.call(x) === '[object Number]';
@@ -7082,9 +7018,7 @@ function _isNumber(x) {
  *
  *      R.omit(['a', 'd'], {a: 1, b: 2, c: 3, d: 4}); //=> {b: 2, c: 3}
  */
-
-var omit = /*#__PURE__*/
-_curry2(function omit(names, obj) {
+var omit = /*#__PURE__*/_curry2(function omit(names, obj) {
   var result = {};
   var index = {};
   var idx = 0;
@@ -7117,17 +7051,16 @@ _curry2(function omit(names, obj) {
  *      R.range(1, 5);    //=> [1, 2, 3, 4]
  *      R.range(50, 53);  //=> [50, 51, 52]
  */
-
-var range = /*#__PURE__*/
-_curry2(function range(from, to) {
+var range = /*#__PURE__*/_curry2(function range(from, to) {
   if (!(_isNumber(from) && _isNumber(to))) {
     throw new TypeError('Both arguments to range must be numbers');
   }
-  var result = [];
-  var n = from;
-  while (n < to) {
-    result.push(n);
-    n += 1;
+  var result = Array(from < to ? to - from : 0);
+  var finish = from < 0 ? to + Math.abs(from) : to - from;
+  var idx = 0;
+  while (idx < finish) {
+    result[idx] = idx + from;
+    idx += 1;
   }
   return result;
 });
@@ -11626,7 +11559,7 @@ var showAGroupOfPagesCenteredOnTheCurrentPage = function showAGroupOfPagesCenter
   var diff = Math.floor((maxPages - 2) / 2);
   return [1].concat(_toConsumableArray(range(page - diff, page + diff + 1)), [totalPages]);
 };
-var determinePagesToShow = cond([[whenThereAreFewerPagesThanWeDisplay, showAllPages], [whenCurrentPageIsLessThanHalfTheTotal, showFirstNPagesAndLastPage], [whenCurrentPageIsGreaterThanHalfTheTotal, showTheLastNPages], [otherwise, showAGroupOfPagesCenteredOnTheCurrentPage]]);
+var determinePagesToShow = cond([[whenThereAreFewerPagesThanWeDisplay, showAllPages], [whenCurrentPageIsLessThanHalfTheTotal, showFirstNPagesAndLastPage], [whenCurrentPageIsGreaterThanHalfTheTotal, showTheLastNPages], [T, showAGroupOfPagesCenteredOnTheCurrentPage]]);
 var Paginator = function Paginator(_ref) {
   var selectedPage = _ref.selectedPage,
     totalPages = _ref.totalPages,