ramda-adjunct 5.0.0 → 5.0.1

package/src/internal/isOfTypeObject.js

@@ -1,3 +0,0 @@
-const isOfTypeObject = (val) => typeof val === 'object';
-
-export default isOfTypeObject;

package/src/internal/makeFlat.js

@@ -1,42 +0,0 @@
-import isArrayLike from '../isArrayLike.js';
-
-/**
- * `makeFlat` is a helper function that returns a one-level or fully recursive
- * function based on the flag passed in.
- *
- * @func makeFlat
- * @memberOf RA
- *
- * @category List
- * @param {!bool} = should recursively flatten
- * @param {!Array} = the nested list to be flattened
- * @return {!Array} = the flattened list
- * @sig Bool -> List -> List
- *
- */
-const makeFlat = (recursive) =>
-  function flatt(list) {
-    let value;
-    let jlen;
-    let j;
-    const result = [];
-    let idx = 0;
-
-    while (idx < list.length) {
-      if (isArrayLike(list[idx])) {
-        value = recursive ? flatt(list[idx]) : list[idx];
-        j = 0;
-        jlen = value.length;
-        while (j < jlen) {
-          result[result.length] = value[j];
-          j += 1;
-        }
-      } else {
-        result[result.length] = list[idx];
-      }
-      idx += 1;
-    }
-    return result;
-  };
-
-export default makeFlat;

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

@@ -1,34 +0,0 @@
-import { bind } from 'ramda';
-
-import isIterable from '../../isIterable.js';
-import isNotUndefined from '../../isNotUndefined.js';
-import isNotNil from '../../isNotNil.js';
-import isNotFunction from '../../isNotFunction.js';
-
-const copyArray = (items, mapFn, thisArg) => {
-  const boundMapFn = isNotUndefined(thisArg) ? bind(mapFn, thisArg) : mapFn;
-
-  return isNotUndefined(mapFn) ? [...items].map(boundMapFn) : [...items];
-};
-
-const fromArray = (items, mapFn, thisArg) => {
-  if (items == null) {
-    throw new TypeError(
-      'Array.from requires an array-like object - not null or undefined'
-    );
-  }
-
-  if (isNotNil(mapFn) && isNotFunction(mapFn)) {
-    throw new TypeError(
-      'Array.from: when provided, the second argument must be a function'
-    );
-  }
-
-  if (isIterable(items)) {
-    return copyArray(items, mapFn, thisArg);
-  }
-
-  return [];
-};
-
-export default fromArray;

package/src/internal/ponyfills/Math.sign.js

@@ -1,3 +0,0 @@
-const signPonyfill = (number) => (number > 0) - (number < 0) || +number;
-
-export default signPonyfill;

package/src/internal/ponyfills/Math.trunc.js

@@ -1,14 +0,0 @@
-import isFinite from '../../isFinite.js';
-
-const truncPonyfill = (v) => {
-  const numV = Number(v);
-
-  if (!isFinite(numV)) {
-    return numV;
-  }
-
-  // eslint-disable-next-line no-nested-ternary
-  return numV - (numV % 1) || (numV < 0 ? -0 : numV === 0 ? numV : 0);
-};
-
-export default truncPonyfill;

package/src/internal/ponyfills/Number.MAX_SAFE_INTEGER.js

@@ -1,3 +0,0 @@
-const MAX_SAFE_INTEGER = Number.MAX_SAFE_INTEGER || 2 ** 53 - 1;
-
-export default MAX_SAFE_INTEGER;

package/src/internal/ponyfills/Number.MIN_SAFE_INTEGER.js

@@ -1,3 +0,0 @@
-const MIN_SAFE_INTEGER = Number.MIN_SAFE_INTEGER || -(2 ** 53) - 1;
-
-export default MIN_SAFE_INTEGER;

package/src/internal/ponyfills/Number.isFinite.js

@@ -1,8 +0,0 @@
-import { both } from 'ramda';
-
-import isNumber from '../../isNumber.js';
-
-// eslint-disable-next-line no-restricted-globals
-const isFinitePonyfill = both(isNumber, isFinite);
-
-export default isFinitePonyfill;

package/src/internal/ponyfills/Number.isInteger.js

@@ -1,10 +0,0 @@
-import { both, converge, equals, identity } from 'ramda';
-
-import isFinite from '../../isFinite.js';
-
-const isIntegerPonyfill = both(
-  isFinite,
-  converge(equals, [Math.floor, identity])
-);
-
-export default isIntegerPonyfill;

package/src/internal/ponyfills/Number.isNaN.js

@@ -1,8 +0,0 @@
-import { both } from 'ramda';
-
-import isNumber from '../../isNumber.js';
-
-// eslint-disable-next-line no-restricted-globals
-const isNaNPonyfill = both(isNumber, isNaN);
-
-export default isNaNPonyfill;

package/src/internal/ponyfills/Number.isSafeInteger.js

@@ -1,11 +0,0 @@
-import { both } from 'ramda';
-
-import isInteger from '../../isInteger.js';
-import MAX_SAFE_INTEGER from './Number.MAX_SAFE_INTEGER.js';
-
-const isSafeIntegerPonyfill = both(
-  isInteger,
-  (value) => Math.abs(value) <= MAX_SAFE_INTEGER
-);
-
-export default isSafeIntegerPonyfill;

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

@@ -1,18 +0,0 @@
-import { map } from 'ramda';
-
-import allP from '../../allP.js';
-import resolveP from '../../resolveP.js';
-
-const onFulfill = (value) => ({ status: 'fulfilled', value });
-const onReject = (reason) => ({ status: 'rejected', reason });
-
-const allSettledPonyfill = (iterable) => {
-  const array = map(
-    (p) => resolveP(p).then(onFulfill).catch(onReject),
-    [...iterable]
-  );
-
-  return allP(array);
-};
-
-export default allSettledPonyfill;

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

@@ -1,29 +0,0 @@
-import { map } from 'ramda';
-
-import resolveP from '../../resolveP.js';
-
-export class AggregatedError extends Error {
-  constructor(errors = [], message = '') {
-    super(message);
-
-    this.errors = errors;
-  }
-}
-
-const anyPonyfill = (iterable) => {
-  const exceptions = [];
-
-  return new Promise((resolve, reject) => {
-    const onReject = (e) => {
-      exceptions.push(e);
-
-      if (exceptions.length === iterable.length) {
-        reject(new AggregatedError(exceptions));
-      }
-    };
-
-    map((p) => resolveP(p).then(resolve).catch(onReject), [...iterable]);
-  });
-};
-
-export default anyPonyfill;

package/src/internal/ponyfills/String.padEnd.js

@@ -1,25 +0,0 @@
-import isFunction from '../../isFunction.js';
-import isNotUndefined from '../../isNotUndefined.js';
-import repeat from './String.repeat.js';
-
-const padEndPonyfill = (padString, targetLength, value) => {
-  // eslint-disable-next-line no-bitwise
-  let finalLength = targetLength >> 0;
-  let finalPadString = String(isNotUndefined(padString) ? padString : ' ');
-
-  if (value.length > finalLength) {
-    return String(value);
-  }
-
-  finalLength -= value.length;
-  if (finalLength > finalPadString.length) {
-    const remainingLength = finalLength / finalPadString.length;
-    finalPadString += isFunction(String.prototype.repeat)
-      ? finalPadString.repeat(remainingLength)
-      : repeat(finalPadString, remainingLength);
-  }
-
-  return String(value) + finalPadString.slice(0, finalLength);
-};
-
-export default padEndPonyfill;

package/src/internal/ponyfills/String.padStart.js

@@ -1,27 +0,0 @@
-import isFunction from '../../isFunction.js';
-import isNotUndefined from '../../isNotUndefined.js';
-import repeat from './String.repeat.js';
-
-const padStartPonyfill = (padString, targetLength, value) => {
-  // eslint-disable-next-line no-bitwise
-  let finalLength = targetLength >> 0; // truncate if number, or convert non-number to 0;
-  let finalPadString = String(isNotUndefined(padString) ? padString : ' ');
-
-  // return the original string, if targeted length is less than original strings length
-  if (value.length >= finalLength) {
-    return String(value);
-  }
-
-  finalLength -= value.length;
-  if (finalLength > finalPadString.length) {
-    const lenghtToPad = finalLength / finalPadString.length;
-    // append to original to ensure we are longer than needed
-    finalPadString += isFunction(String.prototype.repeat)
-      ? finalPadString.repeat(lenghtToPad)
-      : repeat(finalPadString, lenghtToPad);
-  }
-
-  return finalPadString.slice(0, finalLength) + String(value);
-};
-
-export default padStartPonyfill;

package/src/internal/ponyfills/String.repeat.js

@@ -1,49 +0,0 @@
-import isNotFinite from '../../isNotFinite.js';
-import isNegative from '../../isNegative.js';
-
-const repeat = (value, count) => {
-  let validCount = Number(count);
-
-  if (validCount !== count) {
-    validCount = 0;
-  }
-
-  if (isNegative(validCount)) {
-    throw new RangeError('repeat count must be non-negative');
-  }
-
-  if (isNotFinite(validCount)) {
-    throw new RangeError('repeat count must be less than infinity');
-  }
-
-  validCount = Math.floor(validCount);
-
-  if (value.length === 0 || validCount === 0) {
-    return '';
-  }
-
-  // Ensuring validCount is a 31-bit integer allows us to heavily optimize the
-  // main part. But anyway, most current (August 2014) browsers can't handle
-  // strings 1 << 28 chars or longer, so:
-  // eslint-disable-next-line no-bitwise
-  if (value.length * validCount >= 1 << 28) {
-    throw new RangeError('repeat count must not overflow maximum string size');
-  }
-
-  const maxCount = value.length * validCount;
-
-  validCount = Math.floor(Math.log(validCount) / Math.log(2));
-
-  let result = value;
-
-  while (validCount) {
-    result += value;
-    validCount -= 1;
-  }
-
-  result += result.substring(0, maxCount - result.length);
-
-  return result;
-};
-
-export default repeat;

package/src/internal/ponyfills/String.replaceAll.js

@@ -1,44 +0,0 @@
-import { replace } from 'ramda';
-
-import isRegExp from '../../isRegExp.js';
-import escapeRegExp from '../../escapeRegExp.js';
-
-const checkArguments = (searchValue, replaceValue, str) => {
-  if (str == null || searchValue == null || replaceValue == null) {
-    throw TypeError('Input values must not be `null` or `undefined`');
-  }
-};
-
-const checkValue = (value, valueName) => {
-  if (typeof value !== 'string') {
-    if (!(value instanceof String)) {
-      throw TypeError(`\`${valueName}\` must be a string`);
-    }
-  }
-};
-
-const checkSearchValue = (searchValue) => {
-  if (
-    typeof searchValue !== 'string' &&
-    !(searchValue instanceof String) &&
-    !(searchValue instanceof RegExp)
-  ) {
-    throw TypeError('`searchValue` must be a string or an regexp');
-  }
-};
-
-const replaceAll = (searchValue, replaceValue, str) => {
-  checkArguments(searchValue, replaceValue, str);
-  checkValue(str, 'str');
-  checkValue(replaceValue, 'replaceValue');
-  checkSearchValue(searchValue);
-
-  const regexp = new RegExp(
-    isRegExp(searchValue) ? searchValue : escapeRegExp(searchValue),
-    'g'
-  );
-
-  return replace(regexp, replaceValue, str);
-};
-
-export default replaceAll;

package/src/internal/ponyfills/String.trimEnd.js

@@ -1,5 +0,0 @@
-import { replace } from 'ramda';
-
-const trimStart = replace(/[\s\uFEFF\xA0]+$/, '');
-
-export default trimStart;

package/src/internal/ponyfills/String.trimStart.js

@@ -1,5 +0,0 @@
-import { replace } from 'ramda';
-
-const trimStart = replace(/^[\s\uFEFF\xA0]+/, '');
-
-export default trimStart;

package/src/invoke.js

@@ -1,22 +0,0 @@
-import { __ } from 'ramda';
-
-import invokeArgs from './invokeArgs.js';
-
-/**
- * Invokes the method at path of object.
- *
- * @func invoke
- * @memberOf RA
- * @since {@link https://char0n.github.io/ramda-adjunct/2.31.0|v2.31.0}
- * @category Object
- * @sig Array -> Object -> *
- * @param {Array.<string|number>} path The path of the method to invoke
- * @param {Object} obj The object to query
- * @return {*}
- * @example
- *
- * RA.invoke(['random'], Math); //=> 0.5113253820009047
- */
-const invoke = invokeArgs(__, [], __);
-
-export default invoke;

package/src/invokeArgs.js

@@ -1,36 +0,0 @@
-import { curryN, path, apply, init, bind } from 'ramda';
-
-import isNotFunction from './isNotFunction.js';
-import isEmptyArray from './isEmptyArray.js';
-
-/**
- * Invokes the method at path of object with given arguments.
- *
- * @func invokeArgs
- * @memberOf RA
- * @since {@link https://char0n.github.io/ramda-adjunct/2.27.0|v2.27.0}
- * @category Object
- * @sig Array -> Array -> Object -> *
- * @param {Array.<string|number>} path The path of the method to invoke
- * @param {Array} args The arguments to invoke the method with
- * @param {Object} obj The object to query
- * @return {*}
- * @example
- *
- * RA.invokeArgs(['abs'], [-1], Math); //=> 1
- * RA.invokeArgs(['path', 'to', 'non-existent', 'method'], [-1], Math); //=> undefined
- */
-
-const invokeArgs = curryN(3, (mpath, args, obj) => {
-  const method = path(mpath, obj);
-  const context = path(init(mpath), obj);
-
-  if (isNotFunction(method)) return undefined;
-  if (isEmptyArray(mpath)) return undefined;
-
-  const boundMethod = bind(method, context);
-
-  return apply(boundMethod, args);
-});
-
-export default invokeArgs;

package/src/isArray.js

@@ -1,27 +0,0 @@
-import { curryN, pipe, type, identical } from 'ramda';
-
-import isFunction from './isFunction.js';
-
-/**
- * Checks if input value is `Array`.
- *
- * @func isArray
- * @memberOf RA
- * @since {@link https://char0n.github.io/ramda-adjunct/0.3.0|v0.3.0}
- * @category Type
- * @sig * -> Boolean
- * @param {*} val The value to test
- * @return {boolean}
- * @see {@link RA.isNotArray|isNotArray}
- * @example
- *
- * RA.isArray([]); //=> true
- * RA.isArray(null); //=> false
- * RA.isArray({}); //=> false
- */
-const isArray = curryN(
-  1,
-  isFunction(Array.isArray) ? Array.isArray : pipe(type, identical('Array'))
-);
-
-export default isArray;

package/src/isArrayLike.js

@@ -1,79 +0,0 @@
-import { has, curryN } from 'ramda';
-
-import isArray from './isArray.js';
-import isString from './isString.js';
-
-/* eslint-disable max-len */
-/**
- * Tests whether or not an object is similar to an array.
- *
- * @func isArrayLike
- * @memberOf RA
- * @since {@link https://char0n.github.io/ramda-adjunct/1.9.0|v1.9.0}
- * @licence https://github.com/ramda/ramda/blob/master/LICENSE.txt
- * @category List
- * @category Type
- * @sig * -> Boolean
- * @param {*} val The value to test
- * @returns {boolean} `true` if `val` has a numeric length property and extreme indices defined; `false` otherwise.
- * @see {@link RA.isNotArrayLike|isNotArrayLike}
-
- * @example
- *
- * RA.isArrayLike([]); //=> true
- * RA.isArrayLike(true); //=> false
- * RA.isArrayLike({}); //=> false
- * RA.isArrayLike({length: 10}); //=> false
- * RA.isArrayLike({0: 'zero', 9: 'nine', length: 10}); //=> true
- */
-/* eslint-enable max-len */
-const isArrayLike = curryN(1, (val) => {
-  if (isArray(val)) {
-    return true;
-  }
-  if (!val) {
-    return false;
-  }
-  if (isString(val)) {
-    return false;
-  }
-  if (typeof val !== 'object') {
-    return false;
-  }
-  if (val.nodeType === 1) {
-    return !!val.length;
-  }
-  if (val.length === 0) {
-    return true;
-  }
-  if (val.length > 0) {
-    return has(0, val) && has(val.length - 1, val);
-  }
-  return false;
-});
-
-export default isArrayLike;
-
-/**
- The MIT License (MIT)
-
- Copyright (c) 2013-2016 Scott Sauyet and Michael Hurley
-
- Permission is hereby granted, free of charge, to any person obtaining a copy
- of this software and associated documentation files (the "Software"), to deal
- in the Software without restriction, including without limitation the rights
- to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
- copies of the Software, and to permit persons to whom the Software is
- furnished to do so, subject to the following conditions:
-
- The above copyright notice and this permission notice shall be included in
- all copies or substantial portions of the Software.
-
- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
- AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
- OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
- THE SOFTWARE.
-*/

package/src/isAsyncFunction.js

@@ -1,23 +0,0 @@
-import { pipe, type, identical, curryN } from 'ramda';
-
-/**
- * Checks if input value is `Async Function`.
- *
- * @func isAsyncFunction
- * @memberOf RA
- * @since {@link https://char0n.github.io/ramda-adjunct/0.5.0|v0.5.0}
- * @category Type
- * @sig * -> Boolean
- * @param {*} val The value to test
- * @return {boolean}
- * @see {@link RA.isFunction|isFunction}, {@link RA.isNotAsyncFunction|isNotAsyncFunction}, {@link RA.isGeneratorFunction|isGeneratorFunction}
- * @example
- *
- * RA.isAsyncFunction(async function test() { }); //=> true
- * RA.isAsyncFunction(null); //=> false
- * RA.isAsyncFunction(function test() { }); //=> false
- * RA.isAsyncFunction(() => {}); //=> false
- */
-const isAsyncFunction = curryN(1, pipe(type, identical('AsyncFunction')));
-
-export default isAsyncFunction;

package/src/isBigInt.js

@@ -1,24 +0,0 @@
-import { type, pipe, identical, curryN } from 'ramda';
-
-/**
- * Checks if value is a BigInt.
- *
- * @func isBigInt
- * @memberOf RA
- * @category Type
- * @since {@link https://char0n.github.io/ramda-adjunct/2.27.0|v2.27.0}
- * @sig * -> Boolean
- * @param {*} val The value to test
- * @return {boolean}
- * @example
- *
- * RA.isBigInt(5); // => false
- * RA.isBigInt(Number.MAX_VALUE); // => false
- * RA.isBigInt(-Infinity); // => false
- * RA.isBigInt(10); // => false
- * RA.isBigInt(10n); // => true
- * RA.isBigInt(BitInt(9007199254740991)); // => true
- */
-const isBigInt = curryN(1, pipe(type, identical('BigInt')));
-
-export default isBigInt;

package/src/isBlank.js

@@ -1,33 +0,0 @@
-import { isEmpty, isNil, anyPass, test } from 'ramda';
-
-import isFalse from './isFalse.js';
-/**
- * Returns `true` if the given value is its type's empty value, `false`, `undefined`
- * as well as strings containing only whitespace characters; `false` otherwise.
- *
- * @func isBlank
- * @memberOf RA
- * @since {@link https://char0n.github.io/ramda-adjunct/3.1.0|v3.1.0}
- * @category Type
- * @sig * -> Boolean
- * @param {*} val The value to test
- * @return {boolean}
- * @see {@link https://blog.appsignal.com/2018/09/11/differences-between-nil-empty-blank-and-present.html|Differences Between #nil?, #empty?, #blank?, and #present?}
- * @example
- *
- * RA.isBlank(''); //=> true
- * RA.isBlank('   '); //=> true
- * RA.isBlank('\t\n'); //=> true
- * RA.isBlank({}); //=> true
- * RA.isBlank(null); //=> true
- * RA.isBlank(undefined); //=> true
- * RA.isBlank([]); //=> true
- * RA.isBlank(false); //=> true
- * RA.isBlank('value'); //=> false
- * RA.isBlank({ foo: 'foo' }); //=> false
- * RA.isBlank([1, 2, 3]); //=> false
- * RA.isBlank(true); //=> false
- */
-const isBlank = anyPass([isFalse, isNil, isEmpty, test(/^\s+$/gm)]);
-
-export default isBlank;

package/src/isBoolean.js

@@ -1,22 +0,0 @@
-import { type, identical, pipe, curryN } from 'ramda';
-
-/**
- * Checks if input value is `Boolean`.
- *
- * @func isBoolean
- * @memberOf RA
- * @since {@link https://char0n.github.io/ramda-adjunct/0.3.0|v0.3.0}
- * @category Type
- * @sig * -> Boolean
- * @param {*} val The value to test
- * @return {boolean}
- * @see {@link RA.isNotBoolean|isNotBoolean}
- * @example
- *
- * RA.isBoolean(false); //=> true
- * RA.isBoolean(true); //=> true
- * RA.isBoolean(null); //=> false
- */
-const isBoolean = curryN(1, pipe(type, identical('Boolean')));
-
-export default isBoolean;

package/src/isDate.js

@@ -1,21 +0,0 @@
-import { type, identical, pipe, curryN } from 'ramda';
-
-/**
- * Checks if value is `Date` object.
- *
- * @func isDate
- * @memberOf RA
- * @since {@link https://char0n.github.io/ramda-adjunct/0.6.0|v0.6.0}
- * @category Type
- * @sig * -> Boolean
- * @param {*} val The value to test
- * @return {boolean}
- * @see {@link RA.isNotDate|isNotDate}, {@link RA.isValidDate|isValidDate}, {@link RA.isNotValidDate|isNotValidDate}
- * @example
- *
- * RA.isDate(new Date()); //=> true
- * RA.isDate('1997-07-16T19:20+01:00'); //=> false
- */
-const isDate = curryN(1, pipe(type, identical('Date')));
-
-export default isDate;