rambda 9.4.2 → 10.0.0-beta.1

package/dist/rambda.js

@@ -1,2088 +1,1378 @@
-'use strict';
-
-function F() {
-  return false;
-}
-
-function T() {
-  return true;
-}
-
-function add(a, b) {
-  if (arguments.length === 1) return _b => add(a, _b);
-  return Number(a) + Number(b);
-}
-
-function _concat(set1, set2) {
-  set1 = set1 || [];
-  set2 = set2 || [];
-  let idx;
-  const len1 = set1.length;
-  const len2 = set2.length;
-  const result = [];
-  idx = 0;
-  while (idx < len1) {
-    result[result.length] = set1[idx];
-    idx += 1;
-  }
-  idx = 0;
-  while (idx < len2) {
-    result[result.length] = set2[idx];
-    idx += 1;
-  }
-  return result;
-}
-
-function _arity(n, fn) {
-  switch (n) {
-    case 0:
-      return function () {
-        return fn.apply(this, arguments);
-      };
-    case 1:
-      return function (_1) {
-        return fn.apply(this, arguments);
-      };
-    case 2:
-      return function (_1, _2) {
-        return fn.apply(this, arguments);
-      };
-    case 3:
-      return function (_1, _2, _3) {
-        return fn.apply(this, arguments);
-      };
-    case 4:
-      return function (_1, _2, _3, _4) {
-        return fn.apply(this, arguments);
-      };
-    case 5:
-      return function (_1, _2, _3, _4, _5) {
-        return fn.apply(this, arguments);
-      };
-    case 6:
-      return function (_1, _2, _3, _4, _5, _6) {
-        return fn.apply(this, arguments);
-      };
-    case 7:
-      return function (_1, _2, _3, _4, _5, _6, _7) {
-        return fn.apply(this, arguments);
-      };
-    case 8:
-      return function (_1, _2, _3, _4, _5, _6, _7, _8) {
-        return fn.apply(this, arguments);
-      };
-    case 9:
-      return function (_1, _2, _3, _4, _5, _6, _7, _8, _9) {
-        return fn.apply(this, arguments);
-      };
-    default:
-      return function (_1, _2, _3, _4, _5, _6, _7, _8, _9, _10) {
-        return fn.apply(this, arguments);
-      };
-  }
-}
-
-function _curryN(n, cache, fn) {
-  return function () {
-    let ci = 0;
-    let ai = 0;
-    const cl = cache.length;
-    const al = arguments.length;
-    const args = new Array(cl + al);
-    while (ci < cl) {
-      args[ci] = cache[ci];
-      ci++;
-    }
-    while (ai < al) {
-      args[cl + ai] = arguments[ai];
-      ai++;
-    }
-    const remaining = n - args.length;
-    return args.length >= n ? fn.apply(this, args) : _arity(remaining, _curryN(n, args, fn));
-  };
-}
-function curryN(n, fn) {
-  if (arguments.length === 1) return _fn => curryN(n, _fn);
-  if (n > 10) {
-    throw new Error('First argument to _arity must be a non-negative integer no greater than ten');
-  }
-  return _arity(n, _curryN(n, [], fn));
-}
-
-function addIndex(originalFunction, initialIndexFn = () => 0, loopIndexChange = x => x + 1) {
-  return curryN(originalFunction.length, function () {
-    const origFn = arguments[0];
-    const list = arguments[arguments.length - 1];
-    let idx = initialIndexFn(list.length);
-    const args = Array.prototype.slice.call(arguments, 0);
-    args[0] = function () {
-      const result = origFn.apply(this, _concat(arguments, [idx, list]));
-      idx = loopIndexChange(idx);
-      return result;
-    };
-    return originalFunction.apply(this, args);
-  });
+function addProp(key, value) {
+  return obj => ({ ...obj, [key]: value })
 }
 
-function addIndexRight(originalFunction) {
-  return addIndex(originalFunction, listLength => listLength - 1, x => x - 1);
-}
-
-const cloneList = list => Array.prototype.slice.call(list);
-
-function curry(fn, args = []) {
-  return (..._args) => (rest => rest.length >= fn.length ? fn(...rest) : curry(fn, rest))([...args, ..._args]);
-}
-
-function adjustFn(index, replaceFn, list) {
-  const actualIndex = index < 0 ? list.length + index : index;
-  if (index >= list.length || actualIndex < 0) return list;
-  const clone = cloneList(list);
-  clone[actualIndex] = replaceFn(clone[actualIndex]);
-  return clone;
-}
-const adjust = curry(adjustFn);
+function all(predicate) {
+  return list => {
+    for (let i = 0; i < list.length; i++) {
+      if (!predicate(list[i])) {
+        return false
+      }
+    }
 
-function all(predicate, list) {
-  if (arguments.length === 1) return _list => all(predicate, _list);
-  for (let i = 0; i < list.length; i++) {
-    if (!predicate(list[i])) return false;
+    return true
   }
-  return true;
 }
 
 function allPass(predicates) {
-  return (...input) => {
+  return input => {
     let counter = 0;
     while (counter < predicates.length) {
-      if (!predicates[counter](...input)) {
-        return false;
+      if (!predicates[counter](input)) {
+        return false
       }
       counter++;
     }
-    return true;
-  };
-}
-
-function always(x) {
-  return _ => x;
-}
 
-function and(a, b) {
-  if (arguments.length === 1) return _b => and(a, _b);
-  return a && b;
+    return true
+  }
 }
 
-function any(predicate, list) {
-  if (arguments.length === 1) return _list => any(predicate, _list);
-  let counter = 0;
-  while (counter < list.length) {
-    if (predicate(list[counter], counter)) {
-      return true;
+function any(predicate) {
+  return list => {
+    let counter = 0;
+    while (counter < list.length) {
+      if (predicate(list[counter], counter)) {
+        return true
+      }
+      counter++;
     }
-    counter++;
+
+    return false
   }
-  return false;
 }
 
 function anyPass(predicates) {
-  return (...input) => {
+  return input => {
     let counter = 0;
     while (counter < predicates.length) {
-      if (predicates[counter](...input)) {
-        return true;
+      if (predicates[counter](input)) {
+        return true
       }
       counter++;
     }
-    return false;
-  };
-}
 
-function ap(functions, input) {
-  if (arguments.length === 1) {
-    return _inputs => ap(functions, _inputs);
+    return false
   }
-  return functions.reduce((acc, fn) => [...acc, ...input.map(fn)], []);
 }
 
-function aperture(step, list) {
-  if (arguments.length === 1) {
-    return _list => aperture(step, _list);
-  }
-  if (step > list.length) return [];
-  let idx = 0;
-  const limit = list.length - (step - 1);
-  const acc = new Array(limit);
-  while (idx < limit) {
-    acc[idx] = list.slice(idx, idx + step);
-    idx += 1;
-  }
-  return acc;
-}
+const cloneList$1 = list => Array.prototype.slice.call(list);
 
-function append(x, input) {
-  if (arguments.length === 1) return _input => append(x, _input);
-  if (typeof input === 'string') return input.split('').concat(x);
-  const clone = cloneList(input);
-  clone.push(x);
-  return clone;
-}
+function append(x) {
+  return list => {
+    const clone = cloneList$1(list);
+    clone.push(x);
 
-function apply(fn, args) {
-  if (arguments.length === 1) {
-    return _args => apply(fn, _args);
+    return clone
   }
-  return fn.apply(this, args);
 }
 
-const {
-  isArray
-} = Array;
-
-function __findHighestArity(spec, max = 0) {
-  for (const key in spec) {
-    if (spec.hasOwnProperty(key) === false || key === 'constructor') continue;
-    if (typeof spec[key] === 'object') {
-      max = Math.max(max, __findHighestArity(spec[key]));
-    }
-    if (typeof spec[key] === 'function') {
-      max = Math.max(max, spec[key].length);
-    }
-  }
-  return max;
-}
-function __filterUndefined() {
-  const defined = [];
-  let i = 0;
-  const l = arguments.length;
-  while (i < l) {
-    if (typeof arguments[i] === 'undefined') break;
-    defined[i] = arguments[i];
-    i++;
-  }
-  return defined;
-}
-function __applySpecWithArity(spec, arity, cache) {
-  const remaining = arity - cache.length;
-  if (remaining === 1) return x => __applySpecWithArity(spec, arity, __filterUndefined(...cache, x));
-  if (remaining === 2) return (x, y) => __applySpecWithArity(spec, arity, __filterUndefined(...cache, x, y));
-  if (remaining === 3) return (x, y, z) => __applySpecWithArity(spec, arity, __filterUndefined(...cache, x, y, z));
-  if (remaining === 4) return (x, y, z, a) => __applySpecWithArity(spec, arity, __filterUndefined(...cache, x, y, z, a));
-  if (remaining > 4) return (...args) => __applySpecWithArity(spec, arity, __filterUndefined(...cache, ...args));
-  if (isArray(spec)) {
-    const ret = [];
-    let i = 0;
-    const l = spec.length;
-    for (; i < l; i++) {
-      if (typeof spec[i] === 'object' || isArray(spec[i])) {
-        ret[i] = __applySpecWithArity(spec[i], arity, cache);
-      }
-      if (typeof spec[i] === 'function') {
-        ret[i] = spec[i](...cache);
-      }
-    }
-    return ret;
-  }
-  const ret = {};
-  for (const key in spec) {
-    if (spec.hasOwnProperty(key) === false || key === 'constructor') continue;
-    if (typeof spec[key] === 'object') {
-      ret[key] = __applySpecWithArity(spec[key], arity, cache);
-      continue;
-    }
-    if (typeof spec[key] === 'function') {
-      ret[key] = spec[key](...cache);
-    }
-  }
-  return ret;
-}
-function applySpec(spec, ...args) {
-  const arity = __findHighestArity(spec);
-  if (arity === 0) {
-    return () => ({});
+function createCompareFunction(a, b, winner, loser) {
+  if (a === b) {
+    return 0
   }
-  const toReturn = __applySpecWithArity(spec, arity, args);
-  return toReturn;
-}
 
-function applyTo(input, fn) {
-  if (arguments.length === 1) {
-    return _fn => applyTo(input, _fn);
-  }
-  return fn(input);
+  return a < b ? winner : loser
 }
 
-function createCompareFunction(a, b, winner, loser) {
-  if (a === b) return 0;
-  return a < b ? winner : loser;
-}
-function ascend(getFunction, a, b) {
-  if (arguments.length === 1) {
-    return (_a, _b) => ascend(getFunction, _a, _b);
-  }
+function ascend(getFunction) {
+	return (a, b) => {
   const aValue = getFunction(a);
   const bValue = getFunction(b);
-  return createCompareFunction(aValue, bValue, -1, 1);
-}
 
-function assocFn(prop, newValue, obj) {
-  return Object.assign({}, obj, {
-    [prop]: newValue
-  });
+  return createCompareFunction(aValue, bValue, -1, 1)
 }
-const assoc = curry(assocFn);
-
-function _isInteger(n) {
-  return n << 0 === n;
 }
-const isInteger = Number.isInteger || _isInteger;
-const isIndexInteger = index => Number.isInteger(Number(index));
 
-function createPath(path, delimiter = '.') {
-  return typeof path === 'string' ? path.split(delimiter).map(x => isInteger(x) ? Number(x) : x) : path;
-}
+function checkObjectWithSpec(conditions) {
+  return input => {
+    let shouldProceed = true;
+    for (const prop in conditions) {
+      if (!shouldProceed) {
+        continue
+      }
+      const result = conditions[prop](input[prop]);
+      if (shouldProceed && result === false) {
+        shouldProceed = false;
+      }
+    }
 
-function assocPathFn(path, newValue, input) {
-  const pathArrValue = createPath(path);
-  if (pathArrValue.length === 0) return newValue;
-  const index = pathArrValue[0];
-  if (pathArrValue.length > 1) {
-    const condition = typeof input !== 'object' || input === null || !input.hasOwnProperty(index);
-    const nextInput = condition ? isIndexInteger(pathArrValue[1]) ? [] : {} : input[index];
-    newValue = assocPathFn(Array.prototype.slice.call(pathArrValue, 1), newValue, nextInput);
+    return shouldProceed
   }
-  if (isIndexInteger(index) && isArray(input)) {
-    const arr = cloneList(input);
-    arr[index] = newValue;
-    return arr;
-  }
-  return assocFn(index, newValue, input);
 }
-const assocPath = curry(assocPathFn);
 
-function binary(fn) {
-  if (fn.length <= 2) return fn;
-  return (a, b) => fn(a, b);
-}
+const { isArray } = Array;
 
-function bind(fn, thisObj) {
-  if (arguments.length === 1) {
-    return _thisObj => bind(fn, _thisObj);
-  }
-  return curryN(fn.length, (...args) => fn.apply(thisObj, args));
-}
+function filter(predicate) {
+  return list => {
+    if (!list) {
+      throw new Error('Incorrect iterable input')
+    }
+    let index = 0;
+    const len = list.length;
+    const willReturn = [];
 
-function both(f, g) {
-  if (arguments.length === 1) return _g => both(f, _g);
-  return (...input) => f(...input) && g(...input);
-}
+    while (index < len) {
+      if (predicate(list[index], index)) {
+        willReturn.push(list[index]);
+      }
 
-const call = (fn, ...inputs) => fn(...inputs);
+      index++;
+    }
 
-function chain(fn, list) {
-  if (arguments.length === 1) {
-    return _list => chain(fn, _list);
+    return willReturn
   }
-  return [].concat(...list.map(fn));
 }
 
-function clampFn(min, max, input) {
-  if (min > max) {
-    throw new Error('min must not be greater than max in clamp(min, max, value)');
-  }
-  if (input >= min && input <= max) return input;
-  if (input > max) return max;
-  if (input < min) return min;
+function reject(predicate) {
+  return list => filter(x => !predicate(x))(list)
 }
-const clamp = curry(clampFn);
 
-function clone(input) {
-  const out = isArray(input) ? Array(input.length) : {};
-  if (input && input.getTime) return new Date(input.getTime());
-  for (const key in input) {
-    const v = input[key];
-    out[key] = typeof v === 'object' && v !== null ? v.getTime ? new Date(v.getTime()) : clone(v) : v;
-  }
-  return out;
-}
+function rejectObject(predicate) {
+  return obj => {
+    const willReturn = {};
 
-class ReduceStopper {
-  constructor(value) {
-    this.value = value;
-  }
-}
-function reduceFn(reducer, acc, list) {
-  if (list == null) {
-    return acc;
-  }
-  if (!isArray(list)) {
-    throw new TypeError('reduce: list must be array or iterable');
-  }
-  let index = 0;
-  const len = list.length;
-  while (index < len) {
-    acc = reducer(acc, list[index], index, list);
-    if (acc instanceof ReduceStopper) {
-      return acc.value;
+    for (const prop in obj) {
+      if (!predicate(obj[prop], prop, obj)) {
+        willReturn[prop] = obj[prop];
+      }
     }
-    index++;
-  }
-  return acc;
-}
-const reduce = curry(reduceFn);
-const reduceStopper = value => new ReduceStopper(value);
 
-function collectBy(fn, list) {
-  if (arguments.length === 1) {
-    return _list => collectBy(fn, _list);
+    return willReturn
   }
-  const group = reduce((o, x) => {
-    const tag = fn(x);
-    if (o[tag] === undefined) {
-      o[tag] = [];
-    }
-    o[tag].push(x);
-    return o;
-  }, {}, list);
-  const newList = [];
-  for (const tag in group) {
-    newList.push(group[tag]);
-  }
-  return newList;
 }
 
-function comparator(fn) {
-  return function (a, b) {
-    return fn(a, b) ? -1 : fn(b, a) ? 1 : 0;
-  };
+const isNullOrUndefined = x => x === null || x === undefined;
+
+function compact(input){
+	if(isArray(input)){
+		return reject(isNullOrUndefined)(input)
+	}
+	return rejectObject(isNullOrUndefined)(input)
 }
 
 function complement(fn) {
-  return (...input) => !fn(...input);
+  return (...input) => !fn(...input)
 }
 
-function _pipe(f, g) {
-  return function () {
-    return g.call(this, f.apply(this, arguments));
-  };
-}
-function pipe() {
-  if (arguments.length === 0) {
-    throw new Error('pipe requires at least one argument');
-  }
-  return _arity(arguments[0].length, reduceFn(_pipe, arguments[0], Array.prototype.slice.call(arguments, 1, Infinity)));
+function concat(x) {
+  return y => (typeof x === 'string' ? `${x}${y}` : [...x, ...y])
 }
 
-function compose() {
-  if (arguments.length === 0) {
-    throw new Error('compose requires at least one argument');
+function count(predicate) {
+  return list => {
+    if (!isArray(list)) {
+      return 0
+    }
+
+    return list.filter(x => predicate(x)).length
   }
-  return pipe.apply(this, Array.prototype.slice.call(arguments, 0).reverse());
 }
 
-function head(listOrString) {
-  if (typeof listOrString === 'string') return listOrString[0] || '';
-  return listOrString[0];
-}
+function countBy(fn) {
+  return list => {
+    const willReturn = {};
 
-function identity(x) {
-  return x;
-}
+    list.forEach(item => {
+      const key = fn(item);
+      if (!willReturn[key]) {
+        willReturn[key] = 1;
+      } else {
+        willReturn[key]++;
+      }
+    });
 
-function reverse(listOrString) {
-  if (typeof listOrString === 'string') {
-    return listOrString.split('').reverse().join('');
+    return willReturn
   }
-  const clone = listOrString.slice();
-  return clone.reverse();
 }
 
-function drop(howManyToDrop, listOrString) {
-  if (arguments.length === 1) return _list => drop(howManyToDrop, _list);
-  return listOrString.slice(howManyToDrop > 0 ? howManyToDrop : 0);
+function createObjectFromKeys(keys) {
+	return fn => {
+		const result = {};
+		keys.forEach((key, index) => {
+			result[key] = fn(key, index);
+		});
+
+		return result
+	}
 }
 
-function tail(listOrString) {
-  return drop(1, listOrString);
+function isFalsy(input) {
+  return input === undefined || input === null || Number.isNaN(input) === true
 }
 
-function pipeWith(xf, list) {
-  if (list.length <= 0) {
-    return identity;
+function defaultTo(defaultArgument, input) {
+  if (arguments.length === 1) {
+    return _input => defaultTo(defaultArgument, _input)
   }
-  const headList = head(list);
-  const tailList = tail(list);
-  return _arity(headList.length, function () {
-    return reduce(function (result, f) {
-      return xf.call(this, f, result);
-    }, headList.apply(this, arguments), tailList);
-  });
-}
-function composeWith(xf, list) {
-  if (arguments.length === 1) return _list => composeWith(xf, _list);
-  return pipeWith.apply(this, [xf, reverse(list)]);
-}
 
-function concat(x, y) {
-  if (arguments.length === 1) return _y => concat(x, _y);
-  return typeof x === 'string' ? `${x}${y}` : [...x, ...y];
+  return isFalsy(input) ? defaultArgument : input
 }
 
-function cond(conditions) {
-  return (...input) => {
-    let done = false;
-    let toReturn;
-    conditions.forEach(([predicate, getResult]) => {
-      if (!done && predicate(...input)) {
-        done = true;
-        toReturn = getResult(...input);
-      }
-    });
-    return toReturn;
-  };
-}
-
-const INCORRECT_ITERABLE_INPUT = 'Incorrect iterable input';
-
-const {
-  keys: keys$1
-} = Object;
+function descend(getFunction) {
+  return (a, b) => {
+    const aValue = getFunction(a);
+    const bValue = getFunction(b);
 
-function mapArray(fn, list, isIndexed = false) {
-  let index = 0;
-  const willReturn = Array(list.length);
-  while (index < list.length) {
-    willReturn[index] = isIndexed ? fn(list[index], index) : fn(list[index]);
-    index++;
+    return createCompareFunction(aValue, bValue, 1, -1)
   }
-  return willReturn;
 }
-function mapObject(fn, obj) {
+
+function drop(howManyToDrop, listOrString) {
   if (arguments.length === 1) {
-    return _obj => mapObject(fn, _obj);
-  }
-  let index = 0;
-  const objKeys = keys$1(obj);
-  const len = objKeys.length;
-  const willReturn = {};
-  while (index < len) {
-    const key = objKeys[index];
-    willReturn[key] = fn(obj[key], key, obj);
-    index++;
+    return _list => drop(howManyToDrop, _list)
   }
-  return willReturn;
-}
-const mapObjIndexed = mapObject;
-function map(fn, iterable) {
-  if (arguments.length === 1) return _iterable => map(fn, _iterable);
-  if (!iterable) {
-    throw new Error(INCORRECT_ITERABLE_INPUT);
-  }
-  if (isArray(iterable)) return mapArray(fn, iterable);
-  return mapObject(fn, iterable);
-}
 
-function max(x, y) {
-  if (arguments.length === 1) return _y => max(x, _y);
-  return y > x ? y : x;
+  return listOrString.slice(howManyToDrop > 0 ? howManyToDrop : 0)
 }
 
-function converge(fn, transformers) {
-  if (arguments.length === 1) return _transformers => converge(fn, _transformers);
-  const highestArity = reduce((a, b) => max(a, b.length), 0, transformers);
-  return curryN(highestArity, function () {
-    return fn.apply(this, map(g => g.apply(this, arguments), transformers));
-  });
+function dropLast(numberItems) {
+  return list => (numberItems > 0 ? list.slice(0, -numberItems) : list.slice())
 }
 
-function count(predicate, list) {
-  if (arguments.length === 1) {
-    return _list => count(predicate, _list);
-  }
-  if (!isArray(list)) return 0;
-  return list.filter(x => predicate(x)).length;
-}
+function dropLastWhile(predicate) {
+  return list => {
+    if (list.length === 0) {
+      return list
+    }
 
-function countBy(fn, list) {
-  if (arguments.length === 1) {
-    return _list => countBy(fn, _list);
-  }
-  const willReturn = {};
-  list.forEach(item => {
-    const key = fn(item);
-    if (!willReturn[key]) {
-      willReturn[key] = 1;
-    } else {
-      willReturn[key]++;
+    const toReturn = [];
+    let counter = list.length;
+
+    while (counter) {
+      const item = list[--counter];
+      if (!predicate(item, counter)) {
+        toReturn.push(item);
+        break
+      }
     }
-  });
-  return willReturn;
-}
 
-const dec = x => x - 1;
+    while (counter) {
+      toReturn.push(list[--counter]);
+    }
 
-function isFalsy(input) {
-  return input === undefined || input === null || Number.isNaN(input) === true;
-}
-function defaultTo(defaultArgument, input) {
-  if (arguments.length === 1) {
-    return _input => defaultTo(defaultArgument, _input);
+    return toReturn.reverse()
   }
-  return isFalsy(input) ? defaultArgument : input;
 }
 
-function descend(getFunction, a, b) {
-  if (arguments.length === 1) {
-    return (_a, _b) => descend(getFunction, _a, _b);
+function dropWhile(predicate) {
+  return iterable => {
+    const toReturn = [];
+    let counter = 0;
+
+    while (counter < iterable.length) {
+      const item = iterable[counter++];
+      if (!predicate(item, counter)) {
+        toReturn.push(item);
+        break
+      }
+    }
+
+    while (counter < iterable.length) {
+      toReturn.push(iterable[counter++]);
+    }
+
+    return toReturn
   }
-  const aValue = getFunction(a);
-  const bValue = getFunction(b);
-  return createCompareFunction(aValue, bValue, 1, -1);
 }
 
 function type(input) {
   if (input === null) {
-    return 'Null';
-  } else if (input === undefined) {
-    return 'Undefined';
-  } else if (Number.isNaN(input)) {
-    return 'NaN';
+    return 'Null'
+  }
+  if (input === undefined) {
+    return 'Undefined'
+  }
+  if (Number.isNaN(input)) {
+    return 'NaN'
   }
   const typeResult = Object.prototype.toString.call(input).slice(8, -1);
-  return typeResult === 'AsyncFunction' ? 'Promise' : typeResult;
+  return typeResult === 'AsyncFunction' ? 'Promise' : typeResult
 }
 
 function _lastIndexOf(valueToFind, list) {
-  if (!isArray(list)) throw new Error(`Cannot read property 'indexOf' of ${list}`);
+  if (!isArray(list)) {
+    throw new Error(`Cannot read property 'indexOf' of ${list}`)
+  }
+
   const typeOfValue = type(valueToFind);
-  if (!['Array', 'NaN', 'Object', 'RegExp'].includes(typeOfValue)) return list.lastIndexOf(valueToFind);
-  const {
-    length
-  } = list;
+  if (!['Array', 'NaN', 'Object', 'RegExp'].includes(typeOfValue)) {
+    return list.lastIndexOf(valueToFind)
+  }
+
+  const { length } = list;
   let index = length;
   let foundIndex = -1;
-  while (--index > -1 && foundIndex === -1) if (equals(list[index], valueToFind)) foundIndex = index;
-  return foundIndex;
+
+  while (--index > -1 && foundIndex === -1) {
+    if (equalsFn(list[index], valueToFind)) {
+      foundIndex = index;
+    }
+  }
+
+  return foundIndex
 }
+
 function _indexOf(valueToFind, list) {
-  if (!isArray(list)) throw new Error(`Cannot read property 'indexOf' of ${list}`);
+  if (!isArray(list)) {
+    throw new Error(`Cannot read property 'indexOf' of ${list}`)
+  }
+
   const typeOfValue = type(valueToFind);
-  if (!['Array', 'NaN', 'Object', 'RegExp'].includes(typeOfValue)) return list.indexOf(valueToFind);
+  if (!['Array', 'NaN', 'Object', 'RegExp'].includes(typeOfValue)) {
+    return list.indexOf(valueToFind)
+  }
+
   let index = -1;
   let foundIndex = -1;
-  const {
-    length
-  } = list;
-  while (++index < length && foundIndex === -1) if (equals(list[index], valueToFind)) foundIndex = index;
-  return foundIndex;
+  const { length } = list;
+
+  while (++index < length && foundIndex === -1) {
+    if (equalsFn(list[index], valueToFind)) {
+      foundIndex = index;
+    }
+  }
+
+  return foundIndex
 }
+
 function _arrayFromIterator(iter) {
   const list = [];
   let next;
-  while (!(next = iter.next()).done) list.push(next.value);
-  return list;
+  while (!(next = iter.next()).done) {
+    list.push(next.value);
+  }
+
+  return list
 }
+
 function _compareSets(a, b) {
-  if (a.size !== b.size) return false;
+  if (a.size !== b.size) {
+    return false
+  }
+
   const aList = _arrayFromIterator(a.values());
   const bList = _arrayFromIterator(b.values());
+
   const filtered = aList.filter(aInstance => _indexOf(aInstance, bList) === -1);
-  return filtered.length === 0;
+
+  return filtered.length === 0
 }
+
 function compareErrors(a, b) {
-  if (a.message !== b.message) return false;
-  if (a.toString !== b.toString) return false;
-  return a.toString() === b.toString();
-}
-function parseDate(maybeDate) {
-  if (!maybeDate.toDateString) return [false];
-  return [true, maybeDate.getTime()];
-}
-function parseRegex(maybeRegex) {
-  if (maybeRegex.constructor !== RegExp) return [false];
-  return [true, maybeRegex.toString()];
-}
-function equals(a, b) {
-  if (arguments.length === 1) return _b => equals(a, _b);
-  if (Object.is(a, b)) return true;
-  const aType = type(a);
-  if (aType !== type(b)) return false;
-  if (aType === 'Function') return a.name === undefined ? false : a.name === b.name;
-  if (['NaN', 'Null', 'Undefined'].includes(aType)) return true;
-  if (['BigInt', 'Number'].includes(aType)) {
-    if (Object.is(-0, a) !== Object.is(-0, b)) return false;
-    return a.toString() === b.toString();
-  }
-  if (['Boolean', 'String'].includes(aType)) return a.toString() === b.toString();
-  if (aType === 'Array') {
-    const aClone = Array.from(a);
-    const bClone = Array.from(b);
-    if (aClone.toString() !== bClone.toString()) return false;
-    let loopArrayFlag = true;
-    aClone.forEach((aCloneInstance, aCloneIndex) => {
-      if (loopArrayFlag) if (aCloneInstance !== bClone[aCloneIndex] && !equals(aCloneInstance, bClone[aCloneIndex])) loopArrayFlag = false;
-    });
-    return loopArrayFlag;
+  if (a.message !== b.message) {
+    return false
   }
-  const aRegex = parseRegex(a);
-  const bRegex = parseRegex(b);
-  if (aRegex[0]) return bRegex[0] ? aRegex[1] === bRegex[1] : false;else if (bRegex[0]) return false;
-  const aDate = parseDate(a);
-  const bDate = parseDate(b);
-  if (aDate[0]) return bDate[0] ? aDate[1] === bDate[1] : false;else if (bDate[0]) return false;
-  if (a instanceof Error) {
-    if (!(b instanceof Error)) return false;
-    return compareErrors(a, b);
+  if (a.toString !== b.toString) {
+    return false
   }
-  if (aType === 'Set') return _compareSets(a, b);
-  if (aType === 'Object') {
-    const aKeys = Object.keys(a);
-    if (aKeys.length !== Object.keys(b).length) return false;
-    let loopObjectFlag = true;
-    aKeys.forEach(aKeyInstance => {
-      if (loopObjectFlag) {
-        const aValue = a[aKeyInstance];
-        const bValue = b[aKeyInstance];
-        if (aValue !== bValue && !equals(aValue, bValue)) loopObjectFlag = false;
-      }
-    });
-    return loopObjectFlag;
-  }
-  return false;
-}
 
-function includes$1(valueToFind, iterable) {
-  if (arguments.length === 1) return _iterable => includes$1(valueToFind, _iterable);
-  if (typeof iterable === 'string') {
-    return iterable.includes(valueToFind);
-  }
-  if (!iterable) {
-    throw new TypeError(`Cannot read property \'indexOf\' of ${iterable}`);
-  }
-  if (!isArray(iterable)) return false;
-  return _indexOf(valueToFind, iterable) > -1;
+  return a.toString() === b.toString()
 }
 
-class _Set {
-  constructor() {
-    this.set = new Set();
-    this.items = {};
-  }
-  checkUniqueness(item) {
-    const type$1 = type(item);
-    if (['Null', 'Undefined', 'NaN'].includes(type$1)) {
-      if (type$1 in this.items) {
-        return false;
-      }
-      this.items[type$1] = true;
-      return true;
-    }
-    if (!['Object', 'Array'].includes(type$1)) {
-      const prevSize = this.set.size;
-      this.set.add(item);
-      return this.set.size !== prevSize;
-    }
-    if (!(type$1 in this.items)) {
-      this.items[type$1] = [item];
-      return true;
-    }
-    if (_indexOf(item, this.items[type$1]) === -1) {
-      this.items[type$1].push(item);
-      return true;
-    }
-    return false;
+function parseDate(maybeDate) {
+  if (!maybeDate.toDateString) {
+    return [false]
   }
-}
 
-function uniq(list) {
-  const set = new _Set();
-  const willReturn = [];
-  list.forEach(item => {
-    if (set.checkUniqueness(item)) {
-      willReturn.push(item);
-    }
-  });
-  return willReturn;
-}
-
-function difference(a, b) {
-  if (arguments.length === 1) return _b => difference(a, _b);
-  return uniq(a).filter(aInstance => !includes$1(aInstance, b));
+  return [true, maybeDate.getTime()]
 }
 
-function differenceWithFn(fn, a, b) {
-  const willReturn = [];
-  const [first, second] = a.length >= b.length ? [a, b] : [b, a];
-  first.forEach(item => {
-    const hasItem = second.some(secondItem => fn(item, secondItem));
-    if (!hasItem && _indexOf(item, willReturn) === -1) {
-      willReturn.push(item);
-    }
-  });
-  return willReturn;
-}
-const differenceWith = curry(differenceWithFn);
-
-function dissoc(prop, obj) {
-  if (arguments.length === 1) return _obj => dissoc(prop, _obj);
-  if (obj === null || obj === undefined) return {};
-  const willReturn = {};
-  for (const p in obj) {
-    willReturn[p] = obj[p];
-  }
-  delete willReturn[prop];
-  return willReturn;
-}
-
-function _defineProperty(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 ownKeys(e, r) {
-  var t = Object.keys(e);
-  if (Object.getOwnPropertySymbols) {
-    var o = Object.getOwnPropertySymbols(e);
-    r && (o = o.filter(function (r) {
-      return Object.getOwnPropertyDescriptor(e, r).enumerable;
-    })), t.push.apply(t, o);
-  }
-  return t;
-}
-function _objectSpread2(e) {
-  for (var r = 1; r < arguments.length; r++) {
-    var t = null != arguments[r] ? arguments[r] : {};
-    r % 2 ? ownKeys(Object(t), !0).forEach(function (r) {
-      _defineProperty(e, r, t[r]);
-    }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) {
-      Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r));
-    });
+function parseRegex(maybeRegex) {
+  if (maybeRegex.constructor !== RegExp) {
+    return [false]
   }
-  return e;
+
+  return [true, maybeRegex.toString()]
 }
-function _toPrimitive(t, r) {
-  if ("object" != typeof t || !t) return t;
-  var e = t[Symbol.toPrimitive];
-  if (void 0 !== e) {
-    var i = e.call(t, r || "default");
-    if ("object" != typeof i) return i;
-    throw new TypeError("@@toPrimitive must return a primitive value.");
+
+function equalsFn(a, b) {
+  if (Object.is(a, b)) {
+    return true
   }
-  return ("string" === r ? String : Number)(t);
-}
-function _toPropertyKey(t) {
-  var i = _toPrimitive(t, "string");
-  return "symbol" == typeof i ? i : i + "";
-}
 
-function compare(a, b) {
-  return String(a) === String(b);
-}
+  const aType = type(a);
 
-function includes(a, list) {
-  let index = -1;
-  const {
-    length
-  } = list;
-  while (++index < length) if (compare(list[index], a)) return true;
-  return false;
-}
+  if (aType !== type(b)) {
+    return false
+  }
+  if (aType === 'Function') {
+    return a.name === undefined ? false : a.name === b.name
+  }
 
-function omit(propsToOmit, obj) {
-  if (arguments.length === 1) return _obj => omit(propsToOmit, _obj);
-  if (obj === null || obj === undefined) return undefined;
-  const propsToOmitValue = createPath(propsToOmit, ',');
-  const willReturn = {};
-  for (const key in obj) if (!includes(key, propsToOmitValue)) willReturn[key] = obj[key];
-  return willReturn;
-}
+  if (['NaN', 'Null', 'Undefined'].includes(aType)) {
+    return true
+  }
 
-function pathFn(pathInput, obj) {
-  let willReturn = obj;
-  let counter = 0;
-  const pathArrValue = createPath(pathInput);
-  while (counter < pathArrValue.length) {
-    if (willReturn === null || willReturn === undefined) {
-      return undefined;
+  if (['BigInt', 'Number'].includes(aType)) {
+    if (Object.is(-0, a) !== Object.is(-0, b)) {
+      return false
     }
-    if (willReturn[pathArrValue[counter]] === null) return undefined;
-    willReturn = willReturn[pathArrValue[counter]];
-    counter++;
+
+    return a.toString() === b.toString()
   }
-  return willReturn;
-}
-function path(pathInput, obj) {
-  if (arguments.length === 1) return _obj => path(pathInput, _obj);
-  if (obj === null || obj === undefined) {
-    return undefined;
+
+  if (['Boolean', 'String'].includes(aType)) {
+    return a.toString() === b.toString()
   }
-  return pathFn(pathInput, obj);
-}
 
-function removeIndex(index, list) {
-  if (arguments.length === 1) return _list => removeIndex(index, _list);
-  if (index <= 0) return list.slice(1);
-  if (index >= list.length - 1) return list.slice(0, list.length - 1);
-  return [...list.slice(0, index), ...list.slice(index + 1)];
-}
+  if (aType === 'Array') {
+    const aClone = Array.from(a);
+    const bClone = Array.from(b);
 
-function updateFn(index, newValue, list) {
-  const clone = cloneList(list);
-  if (index === -1) return clone.fill(newValue, index);
-  return clone.fill(newValue, index, index + 1);
-}
-const update = curry(updateFn);
+    if (aClone.toString() !== bClone.toString()) {
+      return false
+    }
 
-function dissocPath(pathInput, input) {
-  if (arguments.length === 1) return _obj => dissocPath(pathInput, _obj);
-  const pathArrValue = createPath(pathInput);
-  if (pathArrValue.length === 0) return input;
-  const pathResult = path(pathArrValue, input);
-  if (pathResult === undefined) return input;
-  const index = pathArrValue[0];
-  const condition = typeof input !== 'object' || input === null || !input.hasOwnProperty(index);
-  if (pathArrValue.length > 1) {
-    const nextInput = condition ? isIndexInteger(pathArrValue[1]) ? [] : {} : input[index];
-    const nextPathInput = Array.prototype.slice.call(pathArrValue, 1);
-    const intermediateResult = dissocPath(nextPathInput, nextInput, input);
-    if (isArray(input)) return update(index, intermediateResult, input);
-    return _objectSpread2(_objectSpread2({}, input), {}, {
-      [index]: intermediateResult
+    let loopArrayFlag = true;
+    aClone.forEach((aCloneInstance, aCloneIndex) => {
+      if (loopArrayFlag) {
+        if (
+          aCloneInstance !== bClone[aCloneIndex] &&
+          !equalsFn(aCloneInstance, bClone[aCloneIndex])
+        ) {
+          loopArrayFlag = false;
+        }
+      }
     });
-  }
-  if (isArray(input)) return removeIndex(index, input);
-  return omit([index], input);
-}
 
-function divide(a, b) {
-  if (arguments.length === 1) return _b => divide(a, _b);
-  return a / b;
-}
-
-function dropLast(howManyToDrop, listOrString) {
-  if (arguments.length === 1) {
-    return _listOrString => dropLast(howManyToDrop, _listOrString);
+    return loopArrayFlag
   }
-  return howManyToDrop > 0 ? listOrString.slice(0, -howManyToDrop) : listOrString.slice();
-}
 
-function dropLastWhile(predicate, iterable) {
-  if (arguments.length === 1) {
-    return _iterable => dropLastWhile(predicate, _iterable);
-  }
-  if (iterable.length === 0) return iterable;
-  const isArray$1 = isArray(iterable);
-  if (typeof predicate !== 'function') {
-    throw new Error(`'predicate' is from wrong type ${typeof predicate}`);
-  }
-  if (!isArray$1 && typeof iterable !== 'string') {
-    throw new Error(`'iterable' is from wrong type ${typeof iterable}`);
-  }
-  const toReturn = [];
-  let counter = iterable.length;
-  while (counter) {
-    const item = iterable[--counter];
-    if (!predicate(item)) {
-      toReturn.push(item);
-      break;
-    }
+  const aRegex = parseRegex(a);
+  const bRegex = parseRegex(b);
+
+  if (aRegex[0]) {
+    return bRegex[0] ? aRegex[1] === bRegex[1] : false
   }
-  while (counter) {
-    toReturn.push(iterable[--counter]);
+  if (bRegex[0]) {
+    return false
   }
-  return isArray$1 ? toReturn.reverse() : toReturn.reverse().join('');
-}
 
-function dropRepeats(list) {
-  if (!isArray(list)) {
-    throw new Error(`${list} is not a list`);
-  }
-  const toReturn = [];
-  list.reduce((prev, current) => {
-    if (!equals(prev, current)) {
-      toReturn.push(current);
-    }
-    return current;
-  }, undefined);
-  return toReturn;
-}
-
-function dropRepeatsBy(fn, list) {
-  if (arguments.length === 1) return _list => dropRepeatsBy(fn, _list);
-  let lastEvaluated = null;
-  return list.slice().filter(item => {
-    if (lastEvaluated === null) {
-      lastEvaluated = fn(item);
-      return true;
-    }
-    const evaluatedResult = fn(item);
-    if (equals(lastEvaluated, evaluatedResult)) return false;
-    lastEvaluated = evaluatedResult;
-    return true;
-  });
-}
+  const aDate = parseDate(a);
+  const bDate = parseDate(b);
 
-function dropRepeatsWith(predicate, list) {
-  if (arguments.length === 1) {
-    return _iterable => dropRepeatsWith(predicate, _iterable);
+  if (aDate[0]) {
+    return bDate[0] ? aDate[1] === bDate[1] : false
   }
-  if (!isArray(list)) {
-    throw new Error(`${list} is not a list`);
+  if (bDate[0]) {
+    return false
   }
-  const toReturn = [];
-  list.reduce((prev, current) => {
-    if (prev === undefined) {
-      toReturn.push(current);
-      return current;
-    }
-    if (!predicate(prev, current)) {
-      toReturn.push(current);
+
+  if (a instanceof Error) {
+    if (!(b instanceof Error)) {
+      return false
     }
-    return current;
-  }, undefined);
-  return toReturn;
-}
 
-function dropWhile(predicate, iterable) {
-  if (arguments.length === 1) {
-    return _iterable => dropWhile(predicate, _iterable);
+    return compareErrors(a, b)
   }
-  const isArray$1 = isArray(iterable);
-  if (!isArray$1 && typeof iterable !== 'string') {
-    throw new Error('`iterable` is neither list nor a string');
+
+  if (aType === 'Set') {
+    return _compareSets(a, b)
   }
-  const toReturn = [];
-  let counter = 0;
-  while (counter < iterable.length) {
-    const item = iterable[counter++];
-    if (!predicate(item)) {
-      toReturn.push(item);
-      break;
+
+  if (aType === 'Object') {
+    const aKeys = Object.keys(a);
+
+    if (aKeys.length !== Object.keys(b).length) {
+      return false
     }
-  }
-  while (counter < iterable.length) {
-    toReturn.push(iterable[counter++]);
-  }
-  return isArray$1 ? toReturn : toReturn.join('');
-}
 
-function either(firstPredicate, secondPredicate) {
-  if (arguments.length === 1) {
-    return _secondPredicate => either(firstPredicate, _secondPredicate);
-  }
-  return (...input) => Boolean(firstPredicate(...input) || secondPredicate(...input));
-}
+    let loopObjectFlag = true;
+    aKeys.forEach(aKeyInstance => {
+      if (loopObjectFlag) {
+        const aValue = a[aKeyInstance];
+        const bValue = b[aKeyInstance];
+
+        if (aValue !== bValue && !equalsFn(aValue, bValue)) {
+          loopObjectFlag = false;
+        }
+      }
+    });
 
-function empty(list) {
-  if (typeof list === 'string') return '';
-  if (Array.isArray(list)) {
-    const {
-      name
-    } = list.constructor;
-    if (name === 'Uint8Array') return Uint8Array.from('');
-    if (name === 'Float32Array') return new Float32Array([]);
-    return [];
+    return loopObjectFlag
   }
-  if (type(list) === 'Object') return {};
-}
 
-function endsWith(target, iterable) {
-  if (arguments.length === 1) return _iterable => endsWith(target, _iterable);
-  if (typeof iterable === 'string') {
-    return iterable.endsWith(target);
-  }
-  if (!isArray(target)) return false;
-  const diff = iterable.length - target.length;
-  let correct = true;
-  const filtered = target.filter((x, index) => {
-    if (!correct) return false;
-    const result = equals(x, iterable[index + diff]);
-    if (!result) correct = false;
-    return result;
-  });
-  return filtered.length === target.length;
+  return false
 }
-
-function eqByFn(fn, a, b) {
-  return equals(fn(a), fn(b));
+function equals(a) {
+  return b => equalsFn(a, b)
 }
-const eqBy = curry(eqByFn);
 
-function propFn(searchProperty, obj) {
-  if (!obj) return undefined;
-  return obj[searchProperty];
-}
-function prop(searchProperty, obj) {
-  if (arguments.length === 1) return _obj => prop(searchProperty, _obj);
-  return propFn(searchProperty, obj);
+function eqBy(fn, a) {
+  return b => equalsFn(fn(a), fn(b))
 }
 
-function eqPropsFn(property, objA, objB) {
-  return equals(prop(property, objA), prop(property, objB));
+function eqProps(property, objA) {
+  return objB => equalsFn( objA[property], objB[property] )
 }
-const eqProps = curry(eqPropsFn);
 
-function evolveArray(rules, list) {
-  return mapArray((x, i) => {
-    if (type(rules[i]) === 'Function') {
-      return rules[i](x);
-    }
-    return x;
-  }, list, true);
-}
-function evolveObject(rules, iterable) {
-  return mapObject((x, prop) => {
-    if (type(x) === 'Object') {
-      const typeRule = type(rules[prop]);
-      if (typeRule === 'Function') {
-        return rules[prop](x);
-      }
-      if (typeRule === 'Object') {
-        return evolve(rules[prop], x);
-      }
-      return x;
-    }
-    if (type(rules[prop]) === 'Function') {
-      return rules[prop](x);
+const { keys } = Object;
+
+function mapObject(fn) {
+  return obj => {
+    let index = 0;
+    const objKeys = keys(obj);
+    const len = objKeys.length;
+    const willReturn = {};
+
+    while (index < len) {
+      const key = objKeys[index];
+      willReturn[key] = fn(obj[key], key, obj);
+      index++;
     }
-    return x;
-  }, iterable);
-}
-function evolve(rules, iterable) {
-  if (arguments.length === 1) {
-    return _iterable => evolve(rules, _iterable);
-  }
-  const rulesType = type(rules);
-  const iterableType = type(iterable);
-  if (iterableType !== rulesType) {
-    throw new Error('iterableType !== rulesType');
-  }
-  if (!['Object', 'Array'].includes(rulesType)) {
-    throw new Error(`'iterable' and 'rules' are from wrong type ${rulesType}`);
-  }
-  if (iterableType === 'Object') {
-    return evolveObject(rules, iterable);
+
+    return willReturn
   }
-  return evolveArray(rules, iterable);
 }
 
-function filterObject(predicate, obj) {
-  const willReturn = {};
-  for (const prop in obj) {
-    if (predicate(obj[prop], prop, obj)) {
-      willReturn[prop] = obj[prop];
-    }
-  }
-  return willReturn;
+function evolve(rules) {
+  return mapObject((x, prop) => type(rules[prop]) === 'Function' ? rules[prop](x): x)
 }
-function filterArray(predicate, list, indexed = false) {
-  let index = 0;
-  const len = list.length;
-  const willReturn = [];
-  while (index < len) {
-    const predicateResult = indexed ? predicate(list[index], index) : predicate(list[index]);
-    if (predicateResult) {
-      willReturn.push(list[index]);
+
+function includes(valueToFind) {
+  return iterable => {
+    if (typeof iterable === 'string') {
+      return iterable.includes(valueToFind)
     }
-    index++;
-  }
-  return willReturn;
-}
-function filter(predicate, iterable) {
-  if (arguments.length === 1) return _iterable => filter(predicate, _iterable);
-  if (!iterable) {
-    throw new Error('Incorrect iterable input');
+    if (!iterable) {
+      throw new TypeError(`Cannot read property \'indexOf\' of ${iterable}`)
+    }
+    if (!isArray(iterable)) {
+      return false
+    }
+
+    return _indexOf(valueToFind, iterable) > -1
   }
-  if (isArray(iterable)) return filterArray(predicate, iterable, false);
-  return filterObject(predicate, iterable);
 }
 
-function find(predicate, list) {
-  if (arguments.length === 1) return _list => find(predicate, _list);
-  let index = 0;
-  const len = list.length;
-  while (index < len) {
-    const x = list[index];
-    if (predicate(x)) {
-      return x;
-    }
-    index++;
-  }
+function excludes(valueToFind) {
+  return iterable => !includes(valueToFind)(iterable)
 }
 
-function findIndex(predicate, list) {
-  if (arguments.length === 1) return _list => findIndex(predicate, _list);
-  const len = list.length;
-  let index = -1;
-  while (++index < len) {
-    if (predicate(list[index])) {
-      return index;
+function filterObject(predicate) {
+  return obj => {
+    const willReturn = {};
+
+    for (const prop in obj) {
+      if (predicate(obj[prop], prop, obj)) {
+        willReturn[prop] = obj[prop];
+      }
     }
+
+    return willReturn
   }
-  return -1;
 }
 
-function findLast(predicate, list) {
-  if (arguments.length === 1) return _list => findLast(predicate, _list);
-  let index = list.length;
-  while (--index >= 0) {
-    if (predicate(list[index])) {
-      return list[index];
+function find(predicate) {
+  return list => {
+    let index = 0;
+    const len = list.length;
+
+    while (index < len) {
+      const x = list[index];
+      if (predicate(x)) {
+        return x
+      }
+
+      index++;
     }
   }
-  return undefined;
 }
 
-function findLastIndex(fn, list) {
-  if (arguments.length === 1) return _list => findLastIndex(fn, _list);
-  let index = list.length;
-  while (--index >= 0) {
-    if (fn(list[index])) {
-      return index;
+function findIndex(predicate) {
+  return list => {
+    const len = list.length;
+    let index = -1;
+
+    while (++index < len) {
+      if (predicate(list[index])) {
+        return index
+      }
     }
+
+    return -1
   }
-  return -1;
 }
 
-function flatten(list, input) {
-  const willReturn = input === undefined ? [] : input;
-  for (let i = 0; i < list.length; i++) {
-    if (isArray(list[i])) {
-      flatten(list[i], willReturn);
-    } else {
-      willReturn.push(list[i]);
+function findLast(predicate) {
+  return list => {
+    let index = list.length;
+
+    while (--index >= 0) {
+      if (predicate(list[index])) {
+        return list[index]
+      }
     }
+
+    return undefined
   }
-  return willReturn;
 }
 
-function flipFn(fn) {
-  return (...input) => {
-    if (input.length === 1) {
-      return holder => fn(holder, input[0]);
-    } else if (input.length === 2) {
-      return fn(input[1], input[0]);
-    } else if (input.length === 3) {
-      return fn(input[1], input[0], input[2]);
-    } else if (input.length === 4) {
-      return fn(input[1], input[0], input[2], input[3]);
+function findLastIndex(fn) {
+  return list => {
+    let index = list.length;
+
+    while (--index >= 0) {
+      if (fn(list[index])) {
+        return index
+      }
     }
-    throw new Error('R.flip doesn\'t work with arity > 4');
-  };
-}
-function flip(fn) {
-  return flipFn(fn);
-}
 
-function forEachObjIndexedFn(fn, obj) {
-  let index = 0;
-  const listKeys = keys$1(obj);
-  const len = listKeys.length;
-  while (index < len) {
-    const key = listKeys[index];
-    fn(obj[key], key, obj);
-    index++;
+    return -1
   }
-  return obj;
-}
-function forEachObjIndexed(fn, list) {
-  if (arguments.length === 1) return _list => forEachObjIndexed(fn, _list);
-  if (list === undefined) return;
-  return forEachObjIndexedFn(fn, list);
 }
 
-function forEach(fn, iterable) {
-  if (arguments.length === 1) return _list => forEach(fn, _list);
-  if (iterable === undefined) return;
-  if (isArray(iterable)) {
+function findNth(predicate, nth) {
+  return list => {
     let index = 0;
-    const len = iterable.length;
+    const len = list.length;
+
     while (index < len) {
-      fn(iterable[index]);
+      const x = list[index];
+      if (predicate(x)) {
+				if (nth === 0) return x
+				nth--;
+      }
+
       index++;
     }
-  } else return forEachObjIndexedFn(fn, iterable);
-  return iterable;
+  }
 }
 
-function fromPairs(listOfPairs) {
-  const toReturn = {};
-  listOfPairs.forEach(([prop, value]) => toReturn[prop] = value);
-  return toReturn;
+function flatMap(fn) {
+  return list => [].concat(...list.map(fn))
 }
 
-function groupBy(groupFn, list) {
-  if (arguments.length === 1) return _list => groupBy(groupFn, _list);
-  const result = {};
+function flatten(list, input) {
+  const willReturn = input === undefined ? [] : input;
+
   for (let i = 0; i < list.length; i++) {
-    const item = list[i];
-    const key = groupFn(item);
-    if (!result[key]) {
-      result[key] = [];
+    if (isArray(list[i])) {
+      flatten(list[i], willReturn);
+    } else {
+      willReturn.push(list[i]);
     }
-    result[key].push(item);
   }
-  return result;
-}
-
-function groupWith(compareFn, list) {
-  if (!isArray(list)) throw new TypeError('list.reduce is not a function');
-  const clone = cloneList(list);
-  if (list.length === 1) return [clone];
-  const toReturn = [];
-  let holder = [];
-  clone.reduce((prev, current, i) => {
-    if (i === 0) return current;
-    const okCompare = compareFn(prev, current);
-    const holderIsEmpty = holder.length === 0;
-    const lastCall = i === list.length - 1;
-    if (okCompare) {
-      if (holderIsEmpty) holder.push(prev);
-      holder.push(current);
-      if (lastCall) toReturn.push(holder);
-      return current;
-    }
-    if (holderIsEmpty) {
-      toReturn.push([prev]);
-      if (lastCall) toReturn.push([current]);
-      return current;
-    }
-    toReturn.push(holder);
-    if (lastCall) toReturn.push([current]);
-    holder = [];
-    return current;
-  }, undefined);
-  return toReturn;
-}
-
-function gt(a, b) {
-  if (arguments.length === 1) return _b => gt(a, _b);
-  return a > b;
-}
 
-function gte(a, b) {
-  if (arguments.length === 1) return _b => gte(a, _b);
-  return a >= b;
+  return willReturn
 }
 
-function has(prop, obj) {
-  if (arguments.length === 1) return _obj => has(prop, _obj);
-  if (!obj) return false;
-  return obj.hasOwnProperty(prop);
-}
+function groupByFallback(groupFn, list) {
+    const result = {};
+    for (let i = 0; i < list.length; i++) {
+      const item = list[i];
+      const key = groupFn(item);
 
-function hasIn(searchProperty, obj) {
-  if (arguments.length === 1) {
-    return _obj => hasIn(searchProperty, _obj);
-  }
-  return propFn(searchProperty, obj) !== undefined;
-}
+      if (!result[key]) {
+        result[key] = [];
+      }
 
-function hasPath(pathInput, obj) {
-  if (arguments.length === 1) {
-    return objHolder => hasPath(pathInput, objHolder);
-  }
-  return path(pathInput, obj) !== undefined;
-}
+      result[key].push(item);
+    }
 
-function _objectIs(a, b) {
-  if (a === b) {
-    return a !== 0 || 1 / a === 1 / b;
-  }
-  return a !== a && b !== b;
+    return result
 }
-const objectIs = Object.is || _objectIs;
 
-function identical(a, b) {
-  if (arguments.length === 1) return _b => identical(a, _b);
-  return objectIs(a, b);
-}
 
-function ifElseFn(condition, onTrue, onFalse) {
-  return (...input) => {
-    const conditionResult = typeof condition === 'boolean' ? condition : condition(...input);
-    if (Boolean(conditionResult)) {
-      return onTrue(...input);
-    }
-    return onFalse(...input);
-  };
+function groupBy(groupFn) {
+  return iterable => Object.groupBy ? Object.groupBy(iterable,groupFn) : groupByFallback(groupFn, iterable)
 }
-const ifElse = curry(ifElseFn);
 
-const inc = x => x + 1;
-
-function indexByPath(pathInput, list) {
-  const toReturn = {};
-  for (let i = 0; i < list.length; i++) {
-    const item = list[i];
-    toReturn[path(pathInput, item)] = item;
-  }
-  return toReturn;
-}
-function indexBy(condition, list) {
-  if (arguments.length === 1) {
-    return _list => indexBy(condition, _list);
-  }
-  if (typeof condition === 'string') {
-    return indexByPath(condition, list);
-  }
-  const toReturn = {};
-  for (let i = 0; i < list.length; i++) {
-    const item = list[i];
-    toReturn[condition(item)] = item;
+function head(listOrString) {
+  if (typeof listOrString === 'string') {
+    return listOrString[0] || ''
   }
-  return toReturn;
+
+  return listOrString[0]
 }
 
-function indexOf(valueToFind, list) {
-  if (arguments.length === 1) {
-    return _list => _indexOf(valueToFind, _list);
-  }
-  return _indexOf(valueToFind, list);
+function indexOf(valueToFind) {
+  return list => _indexOf(valueToFind, list)
 }
 
 function baseSlice(array, start, end) {
   let index = -1;
-  let {
-    length
-  } = array;
+  let { length } = array;
+
   end = end > length ? length : end;
   if (end < 0) {
     end += length;
   }
-  length = start > end ? 0 : end - start >>> 0;
+  length = start > end ? 0 : (end - start) >>> 0;
   start >>>= 0;
+
   const result = Array(length);
+
   while (++index < length) {
     result[index] = array[index + start];
   }
-  return result;
+
+  return result
 }
 
-function init(listOrString) {
-  if (typeof listOrString === 'string') return listOrString.slice(0, -1);
-  return listOrString.length ? baseSlice(listOrString, 0, -1) : [];
+function init(input) {
+  if (typeof input === 'string') {
+    return input.slice(0, -1)
+  }
+
+  return input.length ? baseSlice(input, 0, -1) : []
 }
 
 function _includesWith(pred, x, list) {
   let idx = 0;
   const len = list.length;
+
   while (idx < len) {
-    if (pred(x, list[idx])) return true;
+    if (pred(x, list[idx])) {
+      return true
+    }
+
     idx += 1;
   }
-  return false;
+
+  return false
 }
 function _filter(fn, list) {
   let idx = 0;
   const len = list.length;
   const result = [];
+
   while (idx < len) {
-    if (fn(list[idx])) result[result.length] = list[idx];
+    if (fn(list[idx])) {
+      result[result.length] = list[idx];
+    }
+
     idx += 1;
   }
-  return result;
-}
-function innerJoinFn(pred, xs, ys) {
-  return _filter(x => _includesWith(pred, x, ys), xs);
-}
-const innerJoin = curry(innerJoinFn);
 
-function insertFn(indexToInsert, valueToInsert, array) {
-  return [...array.slice(0, indexToInsert), valueToInsert, ...array.slice(indexToInsert)];
+  return result
 }
-const insert = curry(insertFn);
 
-function insertAllFn(index, listToInsert, list) {
-  return [...list.slice(0, index), ...listToInsert, ...list.slice(index)];
+function innerJoin(pred, xs) {
+  return ys => _filter(x => _includesWith(pred, x, ys), xs)
 }
-const insertAll = curry(insertAllFn);
 
-function intersection(listA, listB) {
-  if (arguments.length === 1) return _list => intersection(listA, _list);
-  return filter(x => includes$1(x, listA), listB);
-}
+const getOccurrences = input => input.match(/{{\s*.+?\s*}}/g);
+const getOccurrenceProp = occurrence => occurrence.replace(/{{\s*|\s*}}/g, '');
 
-function intersperse(separator, list) {
-  if (arguments.length === 1) return _list => intersperse(separator, _list);
-  let index = -1;
-  const len = list.length;
-  const willReturn = [];
-  while (++index < len) {
-    if (index === len - 1) {
-      willReturn.push(list[index]);
-    } else {
-      willReturn.push(list[index], separator);
+const replace$1 = ({ inputHolder, prop, replacer }) => {
+  const regexBase = `{{${prop}}}`;
+  const regex = new RegExp(regexBase, 'g');
+  return inputHolder.replace(regex, replacer)
+};
+
+function interpolate(input) {
+  return templateInput => {
+    const occurrences = getOccurrences(input);
+    if (occurrences === null) {
+      return input
     }
+    let inputHolder = input;
+
+    for (const occurrence of occurrences) {
+      const prop = getOccurrenceProp(occurrence);
+      inputHolder = replace$1({
+        inputHolder,
+        prop,
+        replacer: templateInput[prop],
+      });
+    }
+
+    return inputHolder
   }
-  return willReturn;
 }
 
-function is(targetPrototype, x) {
-  if (arguments.length === 1) return _x => is(targetPrototype, _x);
-  return x != null && x.constructor === targetPrototype || x instanceof targetPrototype;
+function intersection(listA) {
+  return listB => filter(x => includes(x)(listA))(listB)
 }
 
-function isEmpty(input) {
-  const inputType = type(input);
-  if (['Undefined', 'NaN', 'Number', 'Null'].includes(inputType)) return false;
-  if (!input) return true;
-  if (inputType === 'Object') {
-    return Object.keys(input).length === 0;
-  }
-  if (inputType === 'Array') {
-    return input.length === 0;
+function intersperse(separator) {
+  return list => {
+    let index = -1;
+    const len = list.length;
+    const willReturn = [];
+
+    while (++index < len) {
+      if (index === len - 1) {
+        willReturn.push(list[index]);
+      } else {
+        willReturn.push(list[index], separator);
+      }
+    }
+
+    return willReturn
   }
-  return false;
 }
 
-function isNil(x) {
-  return x === undefined || x === null;
+function join(glue) {
+  return list => list.join(glue)
 }
 
-function isNotEmpty(input) {
-  return !isEmpty(input);
+function last(listOrString) {
+  if (typeof listOrString === 'string') {
+    return listOrString[listOrString.length - 1] || ''
+  }
+
+  return listOrString[listOrString.length - 1]
 }
 
-function isNotNil(input) {
-  return input != null;
+function lastIndexOf(valueToFind) {
+  return list => _lastIndexOf(valueToFind, list)
 }
 
-function join(glue, list) {
-  if (arguments.length === 1) return _list => join(glue, _list);
-  return list.join(glue);
+function map(fn) {
+  return list => {
+    let index = 0;
+    const willReturn = Array(list.length);
+    while (index < list.length) {
+      willReturn[index] = fn(list[index], index);
+      index++;
+    }
+    return willReturn
+  }
 }
 
-function juxt(listOfFunctions) {
-  return (...args) => listOfFunctions.map(fn => fn(...args));
+function mapAsync(fn) {
+  return async list => {
+    const willReturn = [];
+    let i = 0;
+    for (const a of list) {
+      willReturn.push(await fn(a, i++));
+    }
+
+    return willReturn
+  }
 }
 
-function keys(x) {
-  return Object.keys(x);
+function mapKeys(fn) {
+  return obj => {
+		const willReturn = {};
+
+		Object.keys(obj).forEach(key => {
+			willReturn[fn(key, obj[key])] = obj[key];
+		});
+
+		return willReturn
+	}
 }
 
-function last(listOrString) {
-  if (typeof listOrString === 'string') {
-    return listOrString[listOrString.length - 1] || '';
+function mapObjectAsync(fn) {
+  return async obj => {
+    const willReturn = {};
+    for (const prop in obj) {
+      willReturn[prop] = await fn(obj[prop], prop);
+    }
+
+    return willReturn
   }
-  return listOrString[listOrString.length - 1];
 }
 
-function lastIndexOf(valueToFind, list) {
-  if (arguments.length === 1) {
-    return _list => _lastIndexOf(valueToFind, _list);
-  }
-  return _lastIndexOf(valueToFind, list);
+function mapParallelAsync(fn) {
+  return async list =>  Promise.all(list.map((x, i) => fn(x, i)))
 }
 
-function length(x) {
-  if (isArray(x)) return x.length;
-  if (typeof x === 'string') return x.length;
-  return NaN;
+function match(pattern) {
+  return input => {
+    const willReturn = input.match(pattern);
+
+    return willReturn === null ? [] : willReturn
+  }
 }
 
-function lens(getter, setter) {
-  return function (functor) {
-    return function (target) {
-      return functor(getter(target)).map(focus => setter(focus, target));
-    };
-  };
+function maxBy(compareFn, x) {
+  return y => (compareFn(y) > compareFn(x) ? y : x)
 }
 
-function nth(index, input) {
-  if (arguments.length === 1) return _input => nth(index, _input);
-  const idx = index < 0 ? input.length + index : index;
-  return Object.prototype.toString.call(input) === '[object String]' ? input.charAt(idx) : input[idx];
+function merge(target) {
+  return objectWithNewProps =>
+    Object.assign({}, target || {}, objectWithNewProps || {})
 }
 
-function lensIndex(index) {
-  return lens(nth(index), update(index));
+function mergeTypes(x) {
+  return x
 }
 
-function lensPath(key) {
-  return lens(path(key), assocPath(key));
+function minBy(compareFn, x) {
+  return y => (compareFn(y) < compareFn(x) ? y : x)
 }
 
-function lensProp(key) {
-  return lens(prop(key), assoc(key));
+function update(index, newValue) {
+  return list => {
+    const clone = cloneList$1(list);
+    if (index === -1) {
+      return clone.fill(newValue, index)
+    }
+
+    return clone.fill(newValue, index, index + 1)
+  }
 }
 
-function lt(a, b) {
-  if (arguments.length === 1) return _b => lt(a, _b);
-  return a < b;
+function modifyFn(property, fn, list) {
+  if (list[property] === undefined) {
+    return list
+  }
+  if (isArray(list)) {
+    return update(property, fn(list[property]))(list)
+  }
+
+  return {
+    ...list,
+    [property]: fn(list[property]),
+  }
 }
 
-function lte(a, b) {
-  if (arguments.length === 1) return _b => lte(a, _b);
-  return a <= b;
+function modifyProp(property, fn) {
+  return obj => modifyFn(property, fn, obj)
 }
 
-function match(pattern, input) {
-  if (arguments.length === 1) return _input => match(pattern, _input);
-  const willReturn = input.match(pattern);
-  return willReturn === null ? [] : willReturn;
+function none(predicate) {
+  return list => {
+    for (let i = 0; i < list.length; i++) {
+      if (predicate(list[i])) {
+        return false
+      }
+    }
+
+    return true
+  }
 }
 
-function mathMod(x, y) {
-  if (arguments.length === 1) return _y => mathMod(x, _y);
-  if (!isInteger(x) || !isInteger(y) || y < 1) return NaN;
-  return (x % y + y) % y;
+function objOf(key) {
+  return value => ({ [key]: value })
 }
 
-function maxByFn(compareFn, x, y) {
-  return compareFn(y) > compareFn(x) ? y : x;
+function objectIncludes(condition) {
+  return obj => {
+    const result = filterObject((conditionValue, conditionProp) =>
+      equals(conditionValue)(obj[conditionProp]),
+    )(condition);
+
+    return Object.keys(result).length === Object.keys(condition).length
+  }
 }
-const maxBy = curry(maxByFn);
 
-function sum(list) {
-  return list.reduce((prev, current) => prev + current, 0);
+function createPath(path, delimiter = '.') {
+  return typeof path === 'string'
+    ? path.split(delimiter).map(x => (Number.isInteger(Number(x)) ? Number(x) : x))
+    : path
 }
 
-function mean(list) {
-  return sum(list) / list.length;
+function _includes(x, list) {
+  let index = -1;
+  const { length } = list;
+
+  while (++index < length) {
+    if (String(list[index]) === String(x)) {
+      return true
+    }
+  }
+
+  return false
 }
 
-function median(list) {
-  const len = list.length;
-  if (len === 0) return NaN;
-  const width = 2 - len % 2;
-  const idx = (len - width) / 2;
-  return mean(Array.prototype.slice.call(list, 0).sort((a, b) => {
-    if (a === b) return 0;
-    return a < b ? -1 : 1;
-  }).slice(idx, idx + width));
+function omit(propsToOmit) {
+  return obj => {
+    if (!obj) {
+      return undefined
+    }
+
+    const propsToOmitValue = createPath(propsToOmit, ',');
+    const willReturn = {};
+
+    for (const key in obj) {
+      if (!_includes(key, propsToOmitValue)) {
+        willReturn[key] = obj[key];
+      }
+    }
+
+    return willReturn
+  }
 }
 
-function mergeRight(target, newProps) {
-  if (arguments.length === 1) return _newProps => mergeRight(target, _newProps);
-  return Object.assign({}, target || {}, newProps || {});
+function partition(predicate) {
+  return list => {
+		const yes = [];
+		const no = [];
+		let counter = -1;
+	
+		while (counter++ < list.length - 1) {
+			if (predicate(list[counter], counter)) {
+				yes.push(list[counter]);
+			} else {
+				no.push(list[counter]);
+			}
+		}
+	
+		return [yes, no]
+  }
 }
 
-function mergeAll(arr) {
-  let willReturn = {};
-  map(val => {
-    willReturn = mergeRight(willReturn, val);
-  }, arr);
-  return willReturn;
+function partitionObject(predicate) {
+	return obj => {
+  const yes = {};
+  const no = {};
+  Object.entries(obj).forEach(([prop, value]) => {
+    if (predicate(value, prop)) {
+      yes[prop] = value;
+    } else {
+      no[prop] = value;
+    }
+  });
+
+  return [yes, no]
+}
 }
 
-function mergeDeepRight(target, source) {
+function path(pathInput, obj) {
   if (arguments.length === 1) {
-    return sourceHolder => mergeDeepRight(target, sourceHolder);
+    return _obj => path(pathInput, _obj)
+  }
+
+  if (!obj) {
+    return undefined
+  }
+  let willReturn = obj;
+  let counter = 0;
+
+  const pathArrValue = createPath(pathInput);
+
+  while (counter < pathArrValue.length) {
+    if (willReturn === null || willReturn === undefined) {
+      return undefined
+    }
+    if (willReturn[pathArrValue[counter]] === null) {
+      return undefined
+    }
+
+    willReturn = willReturn[pathArrValue[counter]];
+    counter++;
+  }
+
+  return willReturn
+}
+
+/**
+ * Source:
+ * https://github.com/denoland/std/blob/main/collections/permutations.ts
+ */
+function permutations(inputArray) {
+  const result = [];
+  const array = cloneList$1(inputArray);
+  const k = array.length;
+  if (k === 0) {
+    return result;
   }
-  const willReturn = clone(target);
-  Object.keys(source).forEach(key => {
-    if (type(source[key]) === 'Object') {
-      if (type(target[key]) === 'Object') {
-        willReturn[key] = mergeDeepRight(target[key], source[key]);
+
+  const c = new Array(k).fill(0);
+
+  result.push([...array]);
+
+  let i = 1;
+
+  while (i < k) {
+    if (c[i] < i) {
+      if (i % 2 === 0) {
+        [array[0], array[i]] = [array[i], array[0]];
       } else {
-        willReturn[key] = source[key];
+        [array[c[i]], array[i]] = [array[i], array[c[i]]];
       }
+
+      result.push([...array]);
+
+      c[i] += 1;
+      i = 1;
     } else {
-      willReturn[key] = source[key];
+      c[i] = 0;
+      i += 1;
     }
-  });
-  return willReturn;
-}
+  }
 
-function mergeDeepLeft(newProps, target) {
-  return mergeDeepRight(target, newProps);
+  return result;
 }
 
-function mergeLeft(x, y) {
-  if (arguments.length === 1) return _y => mergeLeft(x, _y);
-  return mergeRight(y, x);
-}
+function pick(propsToPick) {
+  return input => {
+    if (!input === null) {
+      return undefined
+    }
+    const keys = createPath(propsToPick, ',');
+    const willReturn = {};
+    let counter = 0;
 
-function mergeWithFn(mergeFn, aInput, bInput) {
-  const a = aInput !== null && aInput !== void 0 ? aInput : {};
-  const b = bInput !== null && bInput !== void 0 ? bInput : {};
-  const willReturn = {};
-  Object.keys(a).forEach(key => {
-    if (b[key] === undefined) willReturn[key] = a[key];else willReturn[key] = mergeFn(a[key], b[key]);
-  });
-  Object.keys(b).forEach(key => {
-    if (willReturn[key] !== undefined) return;
-    if (a[key] === undefined) willReturn[key] = b[key];else willReturn[key] = mergeFn(a[key], b[key]);
-  });
-  return willReturn;
-}
-const mergeWith = curry(mergeWithFn);
+    while (counter < keys.length) {
+      if (keys[counter] in input) {
+        willReturn[keys[counter]] = input[keys[counter]];
+      }
+      counter++;
+    }
 
-function min(x, y) {
-  if (arguments.length === 1) return _y => min(x, _y);
-  return y < x ? y : x;
+    return willReturn
+  }
 }
 
-function minByFn(compareFn, x, y) {
-  return compareFn(y) < compareFn(x) ? y : x;
-}
-const minBy = curry(minByFn);
+function reduce(reducer, acc) {
+  return list => {
+    if (list == null) {
+      return acc
+    }
+    if (!isArray(list)) {
+      throw new TypeError('reduce: list must be array or iterable')
+    }
+    let index = 0;
+    const len = list.length;
 
-function isIterable(input) {
-  return Array.isArray(input) || type(input) === 'Object';
-}
+    while (index < len) {
+      acc = reducer(acc, list[index], index, list);
+      index++;
+    }
 
-function modifyFn(property, fn, iterable) {
-  if (!isIterable(iterable)) return iterable;
-  if (iterable[property] === undefined) return iterable;
-  if (isArray(iterable)) {
-    return updateFn(property, fn(iterable[property]), iterable);
+    return acc
   }
-  return _objectSpread2(_objectSpread2({}, iterable), {}, {
-    [property]: fn(iterable[property])
-  });
 }
-const modify = curry(modifyFn);
 
-function modifyPathFn(pathInput, fn, object) {
-  const path$1 = createPath(pathInput);
-  if (path$1.length === 1) {
-    return _objectSpread2(_objectSpread2({}, object), {}, {
-      [path$1[0]]: fn(object[path$1[0]])
-    });
-  }
-  if (path(path$1, object) === undefined) return object;
-  const val = modifyPath(Array.prototype.slice.call(path$1, 1), fn, object[path$1[0]]);
-  if (val === object[path$1[0]]) {
-    return object;
+function _arity(n, fn) {
+  switch (n) {
+    case 0:
+      return function () {
+        return fn.apply(this, arguments)
+      }
+    case 1:
+      return function (a0) {
+        return fn.apply(this, arguments)
+      }
+    case 2:
+      return function (a0, a1) {
+        return fn.apply(this, arguments)
+      }
+    case 3:
+      return function (a0, a1, a2) {
+        return fn.apply(this, arguments)
+      }
+    case 4:
+      return function (a0, a1, a2, a3) {
+        return fn.apply(this, arguments)
+      }
+    case 5:
+      return function (a0, a1, a2, a3, a4) {
+        return fn.apply(this, arguments)
+      }
+    case 6:
+      return function (a0, a1, a2, a3, a4, a5) {
+        return fn.apply(this, arguments)
+      }
+    case 7:
+      return function (a0, a1, a2, a3, a4, a5, a6) {
+        return fn.apply(this, arguments)
+      }
+    case 8:
+      return function (a0, a1, a2, a3, a4, a5, a6, a7) {
+        return fn.apply(this, arguments)
+      }
+    case 9:
+      return function (a0, a1, a2, a3, a4, a5, a6, a7, a8) {
+        return fn.apply(this, arguments)
+      }
+    case 10:
+      return function (a0, a1, a2, a3, a4, a5, a6, a7, a8, a9) {
+        return fn.apply(this, arguments)
+      }
+    default:
+      throw new Error(
+        'First argument to _arity must be a non-negative integer no greater than ten',
+      )
   }
-  return assoc(path$1[0], val, object);
 }
-const modifyPath = curry(modifyPathFn);
 
-function modulo(x, y) {
-  if (arguments.length === 1) return _y => modulo(x, _y);
-  return x % y;
-}
-
-function moveFn(fromIndex, toIndex, list) {
-  if (fromIndex < 0 || toIndex < 0) {
-    throw new Error('Rambda.move does not support negative indexes');
+function _pipe(f, g) {
+  return function () {
+    return g.call(this, f.apply(this, arguments))
   }
-  if (fromIndex > list.length - 1 || toIndex > list.length - 1) return list;
-  const clone = cloneList(list);
-  clone[fromIndex] = list[toIndex];
-  clone[toIndex] = list[fromIndex];
-  return clone;
 }
-const move = curry(moveFn);
 
-function multiply(x, y) {
-  if (arguments.length === 1) return _y => multiply(x, _y);
-  return x * y;
-}
+function pipeFn() {
+  if (arguments.length === 0) {
+    throw new Error('pipe requires at least one argument')
+  }
 
-function negate(x) {
-  return -x;
+  return _arity(
+    arguments[0].length,
+    reduce(
+      _pipe,
+      arguments[0],
+    )(Array.prototype.slice.call(arguments, 1, Number.POSITIVE_INFINITY)),
+  )
 }
 
-function none(predicate, list) {
-  if (arguments.length === 1) return _list => none(predicate, _list);
-  for (let i = 0; i < list.length; i++) {
-    if (predicate(list[i])) return false;
-  }
-  return true;
-}
+function pipe(...inputs) {
+  const [input, ...fnList] = inputs;
 
-function not(input) {
-  return !input;
+  return pipeFn(...fnList)(input)
 }
 
-function objOf(key, value) {
-  if (arguments.length === 1) {
-    return _value => objOf(key, _value);
+async function pipeAsync(input, ...fnList) {
+  let willReturn = input;
+  for (const fn of fnList) {
+    const initialResult = fn(willReturn);
+    willReturn =
+      type(initialResult) === 'Promise' ? await initialResult : initialResult;
   }
-  return {
-    [key]: value
-  };
+  return willReturn
 }
 
-function of(value) {
-  return [value];
-}
+function pluck(property) {
+  return list => {
+    const willReturn = [];
 
-function on(binaryFn, unaryFn, a, b) {
-  if (arguments.length === 3) {
-    return _b => on(binaryFn, unaryFn, a, _b);
-  }
-  if (arguments.length === 2) {
-    return (_a, _b) => on(binaryFn, unaryFn, _a, _b);
-  }
-  return binaryFn(unaryFn(a), unaryFn(b));
-}
+    list.forEach(x => {
+      if (x[property] !== undefined) {
+        willReturn.push(x[property]);
+      }
+    });
 
-function onceFn(fn, context) {
-  let result;
-  return function () {
-    if (fn) {
-      result = fn.apply(context || this, arguments);
-      fn = null;
-    }
-    return result;
-  };
-}
-function once(fn, context) {
-  if (arguments.length === 1) {
-    const wrap = onceFn(fn, context);
-    return curry(wrap);
+    return willReturn
   }
-  return onceFn(fn, context);
 }
 
-function or(a, b) {
-  if (arguments.length === 1) return _b => or(a, _b);
-  return a || b;
+function prepend(x) {
+  return list => [x].concat(list)
 }
 
-const Identity = x => ({
-  x,
-  map: fn => Identity(fn(x))
-});
-function overFn(lens, fn, object) {
-  return lens(x => Identity(fn(x)))(object).x;
+function prop(searchProperty) {
+  return obj => (obj ? obj[searchProperty] : undefined)
 }
-const over = curry(overFn);
 
-function partial(fn, ...args) {
-  const len = fn.length;
-  const argList = args.length === 1 && isArray(args[0]) ? args[0] : args;
-  return (...rest) => {
-    if (argList.length + rest.length >= len) {
-      return fn(...argList, ...rest);
+function propEq(valueToMatch, propToFind) {
+  return obj => {
+    if (!obj) {
+      return false
     }
-    return partial(fn, ...[...argList, ...rest]);
-  };
-}
 
-function partialObject(fn, input) {
-  return nextInput => fn(mergeDeepRight(nextInput, input));
+    return equalsFn(valueToMatch, obj[propToFind])
+  }
 }
 
-function partitionObject(predicate, iterable) {
-  const yes = {};
-  const no = {};
-  Object.entries(iterable).forEach(([prop, value]) => {
-    if (predicate(value, prop)) {
-      yes[prop] = value;
-    } else {
-      no[prop] = value;
-    }
-  });
-  return [yes, no];
-}
-function partitionArray(predicate, list, indexed = false) {
-  const yes = [];
-  const no = [];
-  let counter = -1;
-  while (counter++ < list.length - 1) {
-    if (indexed ? predicate(list[counter], counter) : predicate(list[counter])) {
-      yes.push(list[counter]);
-    } else {
-      no.push(list[counter]);
+function propOr(defaultValue, property) {
+  return obj => {
+    if (!obj) {
+      return defaultValue
     }
+
+    return defaultTo(defaultValue, obj[property])
   }
-  return [yes, no];
-}
-function partition(predicate, iterable) {
-  if (arguments.length === 1) {
-    return listHolder => partition(predicate, listHolder);
-  }
-  if (!isArray(iterable)) return partitionObject(predicate, iterable);
-  return partitionArray(predicate, iterable);
 }
 
-function pathEqFn(pathToSearch, target, input) {
-  return equals(path(pathToSearch, input), target);
+function propSatisfies(predicate, property) {
+  return obj => predicate(obj[property])
 }
-const pathEq = curry(pathEqFn);
 
-function pathOrFn(defaultValue, pathInput, obj) {
-  return defaultTo(defaultValue, path(pathInput, obj));
-}
-const pathOr = curry(pathOrFn);
+function range(start) {
+  return end => {
+    if (Number.isNaN(Number(start)) || Number.isNaN(Number(end))) {
+      throw new TypeError('Both arguments to range must be numbers')
+    }
 
-function pathSatisfiesFn(fn, pathInput, obj) {
-  if (pathInput.length === 0) throw new Error("R.pathSatisfies received an empty path");
-  return Boolean(fn(path(pathInput, obj)));
-}
-const pathSatisfies = curry(pathSatisfiesFn);
+    if (end <= start) {
+      return []
+    }
 
-function paths(pathsToSearch, obj) {
-  if (arguments.length === 1) {
-    return _obj => paths(pathsToSearch, _obj);
-  }
-  return pathsToSearch.map(singlePath => path(singlePath, obj));
-}
+    const len = end - start;
+    const willReturn = Array(len);
 
-function pick(propsToPick, input) {
-  if (arguments.length === 1) return _input => pick(propsToPick, _input);
-  if (input === null || input === undefined) {
-    return undefined;
-  }
-  const keys = createPath(propsToPick, ',');
-  const willReturn = {};
-  let counter = 0;
-  while (counter < keys.length) {
-    if (keys[counter] in input) {
-      willReturn[keys[counter]] = input[keys[counter]];
+    for (let i = 0; i < len + 1; i++) {
+      willReturn[i] = start + i;
     }
-    counter++;
-  }
-  return willReturn;
-}
 
-function pickAll(propsToPick, obj) {
-  if (arguments.length === 1) return _obj => pickAll(propsToPick, _obj);
-  if (obj === null || obj === undefined) {
-    return undefined;
-  }
-  const keysValue = createPath(propsToPick, ',');
-  const willReturn = {};
-  let counter = 0;
-  while (counter < keysValue.length) {
-    if (keysValue[counter] in obj) {
-      willReturn[keysValue[counter]] = obj[keysValue[counter]];
-    } else {
-      willReturn[keysValue[counter]] = undefined;
-    }
-    counter++;
+    return willReturn
   }
-  return willReturn;
 }
 
-function pickBy(predicate, obj) {
-  if (arguments.length === 1) {
-    return _obj => pickBy(predicate, _obj);
-  }
-  return Object.keys(obj).reduce((accum, key) => {
-    if (predicate(obj[key], key, obj)) {
-      accum[key] = obj[key];
+function rangeDescending(start) {
+  return end => {
+    if (Number.isNaN(Number(start)) || Number.isNaN(Number(end))) {
+      throw new TypeError('Both arguments to range must be numbers')
     }
-    return accum;
-  }, {});
-}
 
-function pluck(property, list) {
-  if (arguments.length === 1) return _list => pluck(property, _list);
-  const willReturn = [];
-  map(x => {
-    if (x[property] !== undefined) {
-      willReturn.push(x[property]);
+    if (end >= start) {
+      return []
     }
-  }, list);
-  return willReturn;
-}
 
-function prepend(x, input) {
-  if (arguments.length === 1) return _input => prepend(x, _input);
-  if (typeof input === 'string') return [x].concat(input.split(''));
-  return [x].concat(input);
-}
+    const len = start - end;
+    const willReturn = Array(len);
 
-const product = reduce(multiply, 1);
+    for (let i = 0; i < len + 1; i++) {
+      willReturn[i] = start - i;
+    }
 
-function propEqFn(valueToMatch, propToFind, obj) {
-  if (!obj) return false;
-  return equals(valueToMatch, prop(propToFind, obj));
+    return willReturn
+  }
 }
-const propEq = curry(propEqFn);
 
-function propIsFn(targetPrototype, property, obj) {
-  return is(targetPrototype, obj[property]);
+function replace(pattern, replacer) {
+  return str => str.replace(pattern, replacer)
 }
-const propIs = curry(propIsFn);
 
-function propOrFn(defaultValue, property, obj) {
-  if (!obj) return defaultValue;
-  return defaultTo(defaultValue, obj[property]);
-}
-const propOr = curry(propOrFn);
+function replaceItemAtIndex(index, replaceFn) {
+  return list => {
+    const actualIndex = index < 0 ? list.length + index : index;
+    if (index >= list.length || actualIndex < 0) {
+      return list
+    }
 
-function propSatisfiesFn(predicate, property, obj) {
-  return predicate(prop(property, obj));
-}
-const propSatisfies = curry(propSatisfiesFn);
+    const clone = cloneList$1(list);
+    clone[actualIndex] = replaceFn(clone[actualIndex]);
 
-function props(propsToPick, obj) {
-  if (arguments.length === 1) {
-    return _obj => props(propsToPick, _obj);
-  }
-  if (!isArray(propsToPick)) {
-    throw new Error('propsToPick is not a list');
+    return clone
   }
-  return mapArray(prop => obj[prop], propsToPick);
 }
 
-function range(start, end) {
-  if (arguments.length === 1) return _end => range(start, _end);
-  if (Number.isNaN(Number(start)) || Number.isNaN(Number(end))) {
-    throw new TypeError('Both arguments to range must be numbers');
+function shuffle(listInput) {
+  const list = cloneList(listInput);
+  let counter = list.length;
+  while (counter > 0) {
+    const index = Math.floor(Math.random() * counter);
+    counter--;
+    const temp = list[counter];
+    list[counter] = list[index];
+    list[index] = temp;
   }
-  if (end < start) return [];
-  const len = end - start;
-  const willReturn = Array(len);
-  for (let i = 0; i < len; i++) {
-    willReturn[i] = start + i;
-  }
-  return willReturn;
-}
 
-function reduceByFunction(valueFn, valueAcc, keyFn, acc, elt) {
-  const key = keyFn(elt);
-  const value = valueFn(has(key, acc) ? acc[key] : clone(valueAcc), elt);
-  acc[key] = value;
-  return acc;
+  return list
 }
-function reduceByFn(valueFn, valueAcc, keyFn, list) {
-  return reduce((acc, elt) => reduceByFunction(valueFn, valueAcc, keyFn, acc, elt), {}, list);
-}
-const reduceBy = curry(reduceByFn);
 
-function reject(predicate, list) {
-  if (arguments.length === 1) return _list => reject(predicate, _list);
-  return filter(x => !predicate(x), list);
+function sort(sortFn) {
+  return list => cloneList$1(list).sort(sortFn)
 }
 
-function repeat(x, timesToRepeat) {
-  if (arguments.length === 1) {
-    return _timesToRepeat => repeat(x, _timesToRepeat);
-  }
-  return Array(timesToRepeat).fill(x);
-}
+function sortBy(sortFn) {
+  return list => {
+    const clone = cloneList$1(list);
 
-function replaceFn(pattern, replacer, str) {
-  return str.replace(pattern, replacer);
-}
-const replace = curry(replaceFn);
+    return clone.sort((a, b) => {
+      const aSortResult = sortFn(a);
+      const bSortResult = sortFn(b);
 
-function setFn(lens, replacer, x) {
-  return over(lens, always(replacer), x);
-}
-const set = curry(setFn);
+      if (aSortResult === bSortResult) {
+        return 0
+      }
 
-function sliceFn(from, to, list) {
-  return list.slice(from, to);
+      return aSortResult < bSortResult ? -1 : 1
+    })
+  }
 }
-const slice = curry(sliceFn);
 
-function sort(sortFn, list) {
-  if (arguments.length === 1) return _list => sort(sortFn, _list);
-  return cloneList(list).sort(sortFn);
-}
+function sortObject(predicate) {
+  return obj => {
+    const keys = Object.keys(obj);
+    const sortedKeys = sort((a, b) => predicate(a, b, obj[a], obj[b]))(keys);
 
-function sortBy(sortFn, list) {
-  if (arguments.length === 1) return _list => sortBy(sortFn, _list);
-  const clone = cloneList(list);
-  return clone.sort((a, b) => {
-    const aSortResult = sortFn(a);
-    const bSortResult = sortFn(b);
-    if (aSortResult === bSortResult) return 0;
-    return aSortResult < bSortResult ? -1 : 1;
-  });
+    const toReturn = {};
+    sortedKeys.forEach(singleKey => {
+      toReturn[singleKey] = obj[singleKey];
+    });
+
+    return toReturn
+  }
 }
 
 function sortHelper(a, b, listOfSortingFns) {
@@ -2092,659 +1382,297 @@ function sortHelper(a, b, listOfSortingFns) {
     result = listOfSortingFns[i](a, b);
     i += 1;
   }
-  return result;
-}
-function sortWith(listOfSortingFns, list) {
-  if (arguments.length === 1) return _list => sortWith(listOfSortingFns, _list);
-  if (Array.isArray(list) === false) return [];
-  const clone = list.slice();
-  clone.sort((a, b) => sortHelper(a, b, listOfSortingFns));
-  return clone;
-}
 
-function split(separator, str) {
-  if (arguments.length === 1) return _str => split(separator, _str);
-  return str.split(separator);
+  return result
 }
 
-function maybe(ifRule, whenIf, whenElse) {
-  const whenIfInput = ifRule && type(whenIf) === 'Function' ? whenIf() : whenIf;
-  const whenElseInput = !ifRule && type(whenElse) === 'Function' ? whenElse() : whenElse;
-  return ifRule ? whenIfInput : whenElseInput;
-}
+function sortWith(listOfSortingFns) {
+  return list => {
+    if (Array.isArray(list) === false) {
+      return []
+    }
 
-function take(howMany, listOrString) {
-  if (arguments.length === 1) return _listOrString => take(howMany, _listOrString);
-  if (howMany < 0) return listOrString.slice();
-  if (typeof listOrString === 'string') return listOrString.slice(0, howMany);
-  return baseSlice(listOrString, 0, howMany);
-}
+    const clone = list.slice();
+    clone.sort((a, b) => sortHelper(a, b, listOfSortingFns));
 
-function splitAt(index, input) {
-  if (arguments.length === 1) {
-    return _list => splitAt(index, _list);
+    return clone
   }
-  if (!input) throw new TypeError(`Cannot read property 'slice' of ${input}`);
-  if (!isArray(input) && typeof input !== 'string') return [[], []];
-  const correctIndex = maybe(index < 0, input.length + index < 0 ? 0 : input.length + index, index);
-  return [take(correctIndex, input), drop(correctIndex, input)];
 }
 
-function splitEvery(sliceLength, listOrString) {
-  if (arguments.length === 1) {
-    return _listOrString => splitEvery(sliceLength, _listOrString);
-  }
-  if (sliceLength < 1) {
-    throw new Error('First argument to splitEvery must be a positive integer');
-  }
-  const willReturn = [];
-  let counter = 0;
-  while (counter < listOrString.length) {
-    willReturn.push(listOrString.slice(counter, counter += sliceLength));
-  }
-  return willReturn;
+function split(separator) {
+  return str => str.split(separator)
 }
 
-function splitWhen(predicate, input) {
-  if (arguments.length === 1) {
-    return _input => splitWhen(predicate, _input);
-  }
-  if (!input) throw new TypeError(`Cannot read property 'length' of ${input}`);
-  const preFound = [];
-  const postFound = [];
-  let found = false;
-  let counter = -1;
-  while (counter++ < input.length - 1) {
-    if (found) {
-      postFound.push(input[counter]);
-    } else if (predicate(input[counter])) {
-      postFound.push(input[counter]);
-      found = true;
-    } else {
-      preFound.push(input[counter]);
+function splitEvery(sliceLength) {
+  return list => {
+    if (sliceLength < 1) {
+      throw new Error('First argument to splitEvery must be a positive integer')
+    }
+
+    const willReturn = [];
+    let counter = 0;
+
+    while (counter < list.length) {
+      willReturn.push(list.slice(counter, (counter += sliceLength)));
     }
-  }
-  return [preFound, postFound];
-}
 
-function startsWith(question, iterable) {
-  if (arguments.length === 1) return _iterable => startsWith(question, _iterable);
-  if (typeof iterable === 'string') {
-    return iterable.startsWith(question);
+    return willReturn
   }
-  if (!isArray(question)) return false;
-  let correct = true;
-  const filtered = question.filter((x, index) => {
-    if (!correct) return false;
-    const result = equals(x, iterable[index]);
-    if (!result) correct = false;
-    return result;
-  });
-  return filtered.length === question.length;
-}
-
-function subtract(a, b) {
-  if (arguments.length === 1) return _b => subtract(a, _b);
-  return a - b;
-}
-
-function swapArrayOrString(indexA, indexB, iterable) {
-  const actualIndexA = indexA < 0 ? iterable.length + indexA : indexA;
-  const actualIndexB = indexB < 0 ? iterable.length + indexB : indexB;
-  if (actualIndexA === actualIndexB || Math.min(actualIndexA, actualIndexB) < 0 || Math.max(actualIndexA, actualIndexB) >= iterable.length) return iterable;
-  if (typeof iterable === 'string') {
-    return iterable.slice(0, actualIndexA) + iterable[actualIndexB] + iterable.slice(actualIndexA + 1, actualIndexB) + iterable[actualIndexA] + iterable.slice(actualIndexB + 1);
-  }
-  const clone = iterable.slice();
-  const temp = clone[actualIndexA];
-  clone[actualIndexA] = clone[actualIndexB];
-  clone[actualIndexB] = temp;
-  return clone;
-}
-function swapFn(indexA, indexB, iterable) {
-  if (isArray(iterable) || typeof iterable === 'string') return swapArrayOrString(indexA, indexB, iterable);
-  const aVal = iterable[indexA];
-  const bVal = iterable[indexB];
-  if (aVal === undefined || bVal === undefined) return iterable;
-  return _objectSpread2(_objectSpread2({}, iterable), {}, {
-    [indexA]: iterable[indexB],
-    [indexB]: iterable[indexA]
-  });
 }
-const swap = curry(swapFn);
 
-function symmetricDifference(x, y) {
-  if (arguments.length === 1) {
-    return _y => symmetricDifference(x, _y);
-  }
-  return concat(filter(value => !includes$1(value, y), x), filter(value => !includes$1(value, x), y));
+function symmetricDifference(x) {
+  return y => [
+    ...filter(value => !includes(value)(y))(x),
+    ...filter(value => !includes(value)(x))(y),
+  ]
 }
 
-function takeLast(howMany, listOrString) {
-  if (arguments.length === 1) return _listOrString => takeLast(howMany, _listOrString);
-  const len = listOrString.length;
-  if (howMany < 0) return listOrString.slice();
-  let numValue = howMany > len ? len : howMany;
-  if (typeof listOrString === 'string') return listOrString.slice(len - numValue);
-  numValue = len - numValue;
-  return baseSlice(listOrString, numValue, len);
+function tail(listOrString) {
+  return drop(1)(listOrString)
 }
 
-function takeLastWhile(predicate, input) {
-  if (arguments.length === 1) {
-    return _input => takeLastWhile(predicate, _input);
-  }
-  if (input.length === 0) return input;
-  const toReturn = [];
-  let counter = input.length;
-  while (counter) {
-    const item = input[--counter];
-    if (!predicate(item)) {
-      break;
+function take(numberOfItems) {
+  return input => {
+    if (numberOfItems < 0) {
+      return input.slice()
     }
-    toReturn.push(item);
+    if (typeof input === 'string') {
+      return input.slice(0, numberOfItems)
+    }
+
+    return baseSlice(input, 0, numberOfItems)
   }
-  return isArray(input) ? toReturn.reverse() : toReturn.reverse().join('');
 }
 
-function takeWhile(predicate, iterable) {
-  if (arguments.length === 1) {
-    return _iterable => takeWhile(predicate, _iterable);
-  }
-  const isArray$1 = isArray(iterable);
-  if (!isArray$1 && typeof iterable !== 'string') {
-    throw new Error('`iterable` is neither list nor a string');
-  }
-  const toReturn = [];
-  let counter = 0;
-  while (counter < iterable.length) {
-    const item = iterable[counter++];
-    if (!predicate(item)) {
-      break;
+function takeLast(numberOfItems) {
+  return input => {
+    const len = input.length;
+    if (numberOfItems < 0) {
+      return input.slice()
+    }
+    let numValue = numberOfItems > len ? len : numberOfItems;
+
+    if (typeof input === 'string') {
+      return input.slice(len - numValue)
     }
-    toReturn.push(item);
+
+    numValue = len - numValue;
+
+    return baseSlice(input, numValue, len)
   }
-  return isArray$1 ? toReturn : toReturn.join('');
 }
 
-function tap(fn, x) {
-  if (arguments.length === 1) return _x => tap(fn, _x);
-  fn(x);
-  return x;
-}
+function takeLastWhile(predicate) {
+  return input => {
+    if (input.length === 0) {
+      return input
+    }
+
+    const toReturn = [];
+    let counter = input.length;
+
+    while (counter) {
+      const item = input[--counter];
+      if (!predicate(item)) {
+        break
+      }
+      toReturn.push(item);
+    }
 
-function test(pattern, str) {
-  if (arguments.length === 1) return _str => test(pattern, _str);
-  if (typeof pattern === 'string') {
-    throw new TypeError(`R.test requires a value of type RegExp as its first argument; received "${pattern}"`);
+    return toReturn.reverse()
   }
-  return str.search(pattern) !== -1;
 }
 
-function times(fn, howMany) {
-  if (arguments.length === 1) return _howMany => times(fn, _howMany);
-  if (!isInteger(howMany) || howMany < 0) {
-    throw new RangeError('n must be an integer');
+function takeWhile(predicate) {
+  return iterable => {
+    const toReturn = [];
+    let counter = 0;
+
+    while (counter < iterable.length) {
+      const item = iterable[counter++];
+      if (!predicate(item)) {
+        break
+      }
+      toReturn.push(item);
+    }
+    return toReturn
   }
-  return map(fn, range(0, howMany));
 }
 
-function toLower(str) {
-  return str.toLowerCase();
-}
+function tap(fn) {
+  return x => {
+    fn(x);
 
-function toPairs(obj) {
-  return Object.entries(obj);
+    return x
+  }
 }
 
-function toString(x) {
-  return x.toString();
+function test(pattern) {
+  return str => str.search(pattern) !== -1
 }
 
-function toUpper(str) {
-  return str.toUpperCase();
+function tryCatch(fn, fallback) {
+  return input => {
+    try {
+      return fn(input)
+    } catch (e) {
+      return fallback
+    }
+  }
 }
 
-function transpose(array) {
-  return array.reduce((acc, el) => {
-    el.forEach((nestedEl, i) => isArray(acc[i]) ? acc[i].push(nestedEl) : acc.push([nestedEl]));
-    return acc;
-  }, []);
-}
+function union(x) {
+  return y => {
+    const toReturn = cloneList$1(x);
+
+    y.forEach(yInstance => {
+      if (!includes(yInstance)(x)) {
+        toReturn.push(yInstance);
+      }
+    });
 
-function trim(str) {
-  return str.trim();
+    return toReturn
+  }
 }
 
-const isFunction = x => ['Promise', 'Function'].includes(type(x));
-function tryCatch(fn, fallback) {
-  if (!isFunction(fn)) {
-    throw new Error(`R.tryCatch | fn '${fn}'`);
+class _Set {
+  constructor() {
+    this.set = new Set();
+    this.items = {};
   }
-  const passFallback = isFunction(fallback);
-  return (...inputs) => {
-    try {
-      return fn(...inputs);
-    } catch (e) {
-      return passFallback ? fallback(e, ...inputs) : fallback;
+
+  checkUniqueness(item) {
+    const type$1 = type(item);
+    if (['Null', 'Undefined', 'NaN'].includes(type$1)) {
+      if (type$1 in this.items) {
+        return false
+      }
+      this.items[type$1] = true;
+
+      return true
+    }
+    if (!['Object', 'Array'].includes(type$1)) {
+      const prevSize = this.set.size;
+      this.set.add(item);
+
+      return this.set.size !== prevSize
+    }
+
+    if (!(type$1 in this.items)) {
+      this.items[type$1] = [item];
+
+      return true
+    }
+
+    if (_indexOf(item, this.items[type$1]) === -1) {
+      this.items[type$1].push(item);
+
+      return true
     }
-  };
-}
 
-function unapply(fn) {
-  return function (...args) {
-    return fn.call(this, args);
-  };
+    return false
+  }
 }
 
-function union(x, y) {
-  if (arguments.length === 1) return _y => union(x, _y);
-  const toReturn = cloneList(x);
-  y.forEach(yInstance => {
-    if (!includes$1(yInstance, x)) toReturn.push(yInstance);
+function uniq(list) {
+  const set = new _Set();
+  const willReturn = [];
+  list.forEach(item => {
+    if (set.checkUniqueness(item)) {
+      willReturn.push(item);
+    }
   });
-  return toReturn;
+
+  return willReturn
 }
 
-function uniqBy(fn, list) {
-  if (arguments.length === 1) {
-    return _list => uniqBy(fn, _list);
+function uniqBy(fn) {
+  return list => {
+    const set = new _Set();
+
+    return list.filter(item => set.checkUniqueness(fn(item)))
   }
-  const set = new _Set();
-  return list.filter(item => set.checkUniqueness(fn(item)));
 }
 
 function includesWith(predicate, target, list) {
   let willReturn = false;
   let index = -1;
+
   while (++index < list.length && !willReturn) {
     const value = list[index];
+
     if (predicate(target, value)) {
       willReturn = true;
     }
   }
-  return willReturn;
-}
-function uniqWith(predicate, list) {
-  if (arguments.length === 1) return _list => uniqWith(predicate, _list);
-  let index = -1;
-  const willReturn = [];
-  while (++index < list.length) {
-    const value = list[index];
-    if (!includesWith(predicate, value, willReturn)) {
-      willReturn.push(value);
-    }
-  }
-  return willReturn;
-}
 
-function unlessFn(predicate, whenFalseFn, input) {
-  if (predicate(input)) return input;
-  return whenFalseFn(input);
+  return willReturn
 }
-const unless = curry(unlessFn);
 
-function unnest(list) {
-  return list.reduce((acc, item) => {
-    if (Array.isArray(item)) {
-      return [...acc, ...item];
+function uniqWith(predicate) {
+  return list => {
+    let index = -1;
+    const willReturn = [];
+
+    while (++index < list.length) {
+      const value = list[index];
+
+      if (!includesWith(predicate, value, willReturn)) {
+        willReturn.push(value);
+      }
     }
-    return [...acc, item];
-  }, []);
-}
 
-function unwind(property, obj) {
-  if (arguments.length === 1) {
-    return _obj => unwind(property, _obj);
+    return willReturn
   }
-  if (!isArray(obj[property])) return [obj];
-  return mapArray(x => _objectSpread2(_objectSpread2({}, obj), {}, {
-    [property]: x
-  }), obj[property]);
-}
-
-function values(obj) {
-  if (type(obj) !== 'Object') return [];
-  return Object.values(obj);
 }
 
-const Const = x => ({
-  x,
-  map: fn => Const(x)
-});
-function view(lens, target) {
-  if (arguments.length === 1) return _target => view(lens, _target);
-  return lens(Const)(target).x;
-}
+function unless(predicate, whenFalseFn) {
+  return input => {
+    if (predicate(input)) {
+      return input
+    }
 
-function whenFn(predicate, whenTrueFn, input) {
-  if (!predicate(input)) return input;
-  return whenTrueFn(input);
+    return whenFalseFn(input)
+  }
 }
-const when = curry(whenFn);
 
-function where(conditions, input) {
-  if (input === undefined) {
-    return _input => where(conditions, _input);
-  }
-  let flag = true;
-  for (const prop in conditions) {
-    if (!flag) continue;
-    const result = conditions[prop](input[prop]);
-    if (flag && result === false) {
-      flag = false;
-    }
+function unwind(property) {
+  return obj => {
+    return obj[property].map(x => ({
+      ...obj,
+      [property]: x,
+    }))
   }
-  return flag;
 }
 
-function whereAny(conditions, input) {
-  if (input === undefined) {
-    return _input => whereAny(conditions, _input);
-  }
-  for (const prop in conditions) {
-    if (conditions[prop](input[prop])) {
-      return true;
+function when(predicate, whenTrueFn) {
+  return input => {
+    if (!predicate(input)) {
+      return input
     }
-  }
-  return false;
-}
 
-function whereEq(condition, input) {
-  if (arguments.length === 1) {
-    return _input => whereEq(condition, _input);
+    return whenTrueFn(input)
   }
-  const result = filter((conditionValue, conditionProp) => equals(conditionValue, input[conditionProp]), condition);
-  return Object.keys(result).length === Object.keys(condition).length;
 }
 
-function without(matchAgainst, source) {
-  if (source === undefined) {
-    return _source => without(matchAgainst, _source);
-  }
-  return reduce((prev, current) => _indexOf(current, matchAgainst) > -1 ? prev : prev.concat(current), [], source);
-}
+function zip(left) {
+  return right => {
+    const result = [];
+    const length = Math.min(left.length, right.length);
 
-function xor(a, b) {
-  if (arguments.length === 1) return _b => xor(a, _b);
-  return Boolean(a) && !b || Boolean(b) && !a;
-}
+    for (let i = 0; i < length; i++) {
+      result[i] = [left[i], right[i]];
+    }
 
-function zip(left, right) {
-  if (arguments.length === 1) return _right => zip(left, _right);
-  const result = [];
-  const length = Math.min(left.length, right.length);
-  for (let i = 0; i < length; i++) {
-    result[i] = [left[i], right[i]];
+    return result
   }
-  return result;
 }
 
-function zipObj(keys, values) {
-  if (arguments.length === 1) return yHolder => zipObj(keys, yHolder);
-  return take(values.length, keys).reduce((prev, xInstance, i) => {
-    prev[xInstance] = values[i];
-    return prev;
-  }, {});
-}
-
-function zipWithFn(fn, x, y) {
-  return take(x.length > y.length ? y.length : x.length, x).map((xInstance, i) => fn(xInstance, y[i]));
-}
-const zipWith = curry(zipWithFn);
-
-exports.F = F;
-exports.T = T;
-exports.__findHighestArity = __findHighestArity;
-exports._indexOf = _indexOf;
-exports._lastIndexOf = _lastIndexOf;
-exports._pipe = _pipe;
-exports.add = add;
-exports.addIndex = addIndex;
-exports.addIndexRight = addIndexRight;
-exports.adjust = adjust;
-exports.all = all;
-exports.allPass = allPass;
-exports.always = always;
-exports.and = and;
-exports.any = any;
-exports.anyPass = anyPass;
-exports.ap = ap;
-exports.aperture = aperture;
-exports.append = append;
-exports.apply = apply;
-exports.applySpec = applySpec;
-exports.applyTo = applyTo;
-exports.ascend = ascend;
-exports.assoc = assoc;
-exports.assocFn = assocFn;
-exports.assocPath = assocPath;
-exports.assocPathFn = assocPathFn;
-exports.binary = binary;
-exports.bind = bind;
-exports.both = both;
-exports.call = call;
-exports.chain = chain;
-exports.clamp = clamp;
-exports.clone = clone;
-exports.collectBy = collectBy;
-exports.comparator = comparator;
-exports.complement = complement;
-exports.compose = compose;
-exports.composeWith = composeWith;
-exports.concat = concat;
-exports.cond = cond;
-exports.converge = converge;
-exports.count = count;
-exports.countBy = countBy;
-exports.createCompareFunction = createCompareFunction;
-exports.curry = curry;
-exports.curryN = curryN;
-exports.dec = dec;
-exports.defaultTo = defaultTo;
-exports.descend = descend;
-exports.difference = difference;
-exports.differenceWith = differenceWith;
-exports.differenceWithFn = differenceWithFn;
-exports.dissoc = dissoc;
-exports.dissocPath = dissocPath;
-exports.divide = divide;
-exports.drop = drop;
-exports.dropLast = dropLast;
-exports.dropLastWhile = dropLastWhile;
-exports.dropRepeats = dropRepeats;
-exports.dropRepeatsBy = dropRepeatsBy;
-exports.dropRepeatsWith = dropRepeatsWith;
-exports.dropWhile = dropWhile;
-exports.either = either;
-exports.empty = empty;
-exports.endsWith = endsWith;
-exports.eqBy = eqBy;
-exports.eqByFn = eqByFn;
-exports.eqProps = eqProps;
-exports.equals = equals;
-exports.evolve = evolve;
-exports.evolveArray = evolveArray;
-exports.evolveObject = evolveObject;
-exports.filter = filter;
-exports.filterArray = filterArray;
-exports.filterObject = filterObject;
-exports.find = find;
-exports.findIndex = findIndex;
-exports.findLast = findLast;
-exports.findLastIndex = findLastIndex;
-exports.flatten = flatten;
-exports.flip = flip;
-exports.forEach = forEach;
-exports.forEachObjIndexed = forEachObjIndexed;
-exports.forEachObjIndexedFn = forEachObjIndexedFn;
-exports.fromPairs = fromPairs;
-exports.groupBy = groupBy;
-exports.groupWith = groupWith;
-exports.gt = gt;
-exports.gte = gte;
-exports.has = has;
-exports.hasIn = hasIn;
-exports.hasPath = hasPath;
-exports.head = head;
-exports.identical = identical;
-exports.identity = identity;
-exports.ifElse = ifElse;
-exports.inc = inc;
-exports.includes = includes$1;
-exports.indexBy = indexBy;
-exports.indexOf = indexOf;
-exports.init = init;
-exports.innerJoin = innerJoin;
-exports.innerJoinFn = innerJoinFn;
-exports.insert = insert;
-exports.insertAll = insertAll;
-exports.insertAllFn = insertAllFn;
-exports.insertFn = insertFn;
-exports.intersection = intersection;
-exports.intersperse = intersperse;
-exports.is = is;
-exports.isEmpty = isEmpty;
-exports.isNil = isNil;
-exports.isNotEmpty = isNotEmpty;
-exports.isNotNil = isNotNil;
-exports.join = join;
-exports.juxt = juxt;
-exports.keys = keys;
-exports.last = last;
-exports.lastIndexOf = lastIndexOf;
-exports.length = length;
-exports.lens = lens;
-exports.lensIndex = lensIndex;
-exports.lensPath = lensPath;
-exports.lensProp = lensProp;
-exports.lt = lt;
-exports.lte = lte;
-exports.map = map;
-exports.mapArray = mapArray;
-exports.mapObjIndexed = mapObjIndexed;
-exports.mapObject = mapObject;
-exports.match = match;
-exports.mathMod = mathMod;
-exports.max = max;
-exports.maxBy = maxBy;
-exports.maxByFn = maxByFn;
-exports.mean = mean;
-exports.median = median;
-exports.merge = mergeRight;
-exports.mergeAll = mergeAll;
-exports.mergeDeepLeft = mergeDeepLeft;
-exports.mergeDeepRight = mergeDeepRight;
-exports.mergeLeft = mergeLeft;
-exports.mergeRight = mergeRight;
-exports.mergeWith = mergeWith;
-exports.mergeWithFn = mergeWithFn;
-exports.min = min;
-exports.minBy = minBy;
-exports.minByFn = minByFn;
-exports.modify = modify;
-exports.modifyPath = modifyPath;
-exports.modifyPathFn = modifyPathFn;
-exports.modulo = modulo;
-exports.move = move;
-exports.multiply = multiply;
-exports.negate = negate;
-exports.none = none;
-exports.not = not;
-exports.nth = nth;
-exports.objOf = objOf;
-exports.of = of;
-exports.omit = omit;
-exports.on = on;
-exports.once = once;
-exports.or = or;
-exports.over = over;
-exports.partial = partial;
-exports.partialObject = partialObject;
-exports.partition = partition;
-exports.partitionArray = partitionArray;
-exports.partitionObject = partitionObject;
-exports.path = path;
-exports.pathEq = pathEq;
-exports.pathFn = pathFn;
-exports.pathOr = pathOr;
-exports.pathSatisfies = pathSatisfies;
-exports.pathSatisfiesFn = pathSatisfiesFn;
-exports.paths = paths;
-exports.pick = pick;
-exports.pickAll = pickAll;
-exports.pickBy = pickBy;
-exports.pipe = pipe;
-exports.pipeWith = pipeWith;
-exports.pluck = pluck;
-exports.prepend = prepend;
-exports.product = product;
-exports.prop = prop;
-exports.propEq = propEq;
-exports.propFn = propFn;
-exports.propIs = propIs;
-exports.propOr = propOr;
-exports.propSatisfies = propSatisfies;
-exports.props = props;
-exports.range = range;
-exports.reduce = reduce;
-exports.reduceBy = reduceBy;
-exports.reduceByFn = reduceByFn;
-exports.reduceFn = reduceFn;
-exports.reduceStopper = reduceStopper;
-exports.reject = reject;
-exports.removeIndex = removeIndex;
-exports.repeat = repeat;
-exports.replace = replace;
-exports.reverse = reverse;
-exports.set = set;
-exports.slice = slice;
-exports.sort = sort;
-exports.sortBy = sortBy;
-exports.sortWith = sortWith;
-exports.split = split;
-exports.splitAt = splitAt;
-exports.splitEvery = splitEvery;
-exports.splitWhen = splitWhen;
-exports.startsWith = startsWith;
-exports.subtract = subtract;
-exports.sum = sum;
-exports.swap = swap;
-exports.symmetricDifference = symmetricDifference;
-exports.tail = tail;
-exports.take = take;
-exports.takeLast = takeLast;
-exports.takeLastWhile = takeLastWhile;
-exports.takeWhile = takeWhile;
-exports.tap = tap;
-exports.test = test;
-exports.times = times;
-exports.toLower = toLower;
-exports.toPairs = toPairs;
-exports.toString = toString;
-exports.toUpper = toUpper;
-exports.transpose = transpose;
-exports.trim = trim;
-exports.tryCatch = tryCatch;
-exports.type = type;
-exports.unapply = unapply;
-exports.union = union;
-exports.uniq = uniq;
-exports.uniqBy = uniqBy;
-exports.uniqWith = uniqWith;
-exports.unless = unless;
-exports.unnest = unnest;
-exports.unwind = unwind;
-exports.update = update;
-exports.updateFn = updateFn;
-exports.values = values;
-exports.view = view;
-exports.when = when;
-exports.where = where;
-exports.whereAny = whereAny;
-exports.whereEq = whereEq;
-exports.without = without;
-exports.xor = xor;
-exports.zip = zip;
-exports.zipObj = zipObj;
-exports.zipWith = zipWith;
+function zipWith(fn, x) {
+  return y =>
+    take(x.length > y.length ? y.length : x.length)(x).map((xInstance, i) =>
+      fn(xInstance, y[i]),
+    )
+}
+
+export { _arity, _includes, _indexOf, _lastIndexOf, addProp, all, allPass, any, anyPass, append, ascend, checkObjectWithSpec, compact, complement, concat, count, countBy, createCompareFunction, createObjectFromKeys, defaultTo, descend, drop, dropLast, dropLastWhile, dropWhile, eqBy, eqProps, equals, equalsFn, evolve, excludes, filter, filterObject, find, findIndex, findLast, findLastIndex, findNth, flatMap, flatten, groupBy, groupByFallback, head, includes, indexOf, init, innerJoin, interpolate, intersection, intersperse, join, last, lastIndexOf, map, mapAsync, mapKeys, mapObject, mapObjectAsync, mapParallelAsync, match, maxBy, merge, mergeTypes, minBy, modifyProp, none, objOf, objectIncludes, omit, partition, partitionObject, path, permutations, pick, pipe, pipeAsync, pluck, prepend, prop, propEq, propOr, propSatisfies, range, rangeDescending, reduce, reject, rejectObject, replace, replaceItemAtIndex, shuffle, sort, sortBy, sortObject, sortWith, split, splitEvery, symmetricDifference, tail, take, takeLast, takeLastWhile, takeWhile, tap, test, tryCatch, type, union, uniq, uniqBy, uniqWith, unless, unwind, update, when, zip, zipWith };