UNPKG

extra-number

Version:

A number is a mathematical object used to count, measure, and label.

414 lines (411 loc) 14.2 kB
var _build = {}; Object.defineProperty(_build, "__esModule", { value: true }); var mean = _build.mean = arithmeticMean_1 = _build.arithmeticMean = variance_1 = _build.variance = range_1 = _build.range = modes_1 = _build.modes = median_1 = _build.median = product_1 = _build.product = sum_1 = _build.sum = radians_1 = _build.radians = degrees_1 = _build.degrees = multinomial_1 = _build.multinomial = binomial_1 = _build.binomial = factorial_1 = _build.factorial = lcm_1 = _build.lcm = hcf = _build.hcf = gcd_1 = _build.gcd = isPrime_1 = _build.isPrime = primeExponentials_1 = _build.primeExponentials = primeFactors_1 = _build.primeFactors = greatestPrimeFactor = _build.greatestPrimeFactor = maxPrimeFactor_1 = _build.maxPrimeFactor = leastPrimeFactor = _build.leastPrimeFactor = minPrimeFactor_1 = _build.minPrimeFactor = aliquotSum_1 = _build.aliquotSum = aliquotParts = _build.aliquotParts = properDivisors_1 = _build.properDivisors = log_1 = _build.log = root_1 = _build.root = nextPow_1 = _build.nextPow = prevPow_1 = _build.prevPow = isPow_1 = _build.isPow = lerp_1 = _build.lerp = map = _build.map = remap_1 = _build.remap = norm = _build.norm = normalize_1 = _build.normalize = clamp = _build.clamp = constrain_1 = _build.constrain = modp_1 = _build.modp = mod_1 = _build.mod = rem_1 = _build.rem = roundDiv_1 = _build.roundDiv = ceilDiv_1 = _build.ceilDiv = floorDiv_1 = _build.floorDiv = round_1 = _build.round = ceil_1 = _build.ceil = floor_1 = _build.floor = compare_1 = _build.compare = significantDigits_1 = _build.significantDigits = is_1 = _build.is = void 0; var toRoman = _build.toRoman = toRomanNumerals_1 = _build.toRomanNumerals = fromRoman = _build.fromRoman = fromRomanNumerals_1 = _build.fromRomanNumerals = cubicMean_1 = _build.cubicMean = rootMeanSquare = _build.rootMeanSquare = quadriaticMean_1 = _build.quadriaticMean = harmonicMean_1 = _build.harmonicMean = geometricMean_1 = _build.geometricMean = void 0; function is(v) { return typeof v === "number"; } var is_1 = _build.is = is; function significantDigits(x) { var a = x.toExponential(); return a.replace(/e[\+\-0-9]*$/, "").replace(/^0\.?0*|\./, "").length; } var significantDigits_1 = _build.significantDigits = significantDigits; function compare(x, y) { return x - y; } var compare_1 = _build.compare = compare; function floor(x, pre = 1) { return Math.floor(x / pre) * pre; } var floor_1 = _build.floor = floor; function ceil(x, pre = 1) { return Math.ceil(x / pre) * pre; } var ceil_1 = _build.ceil = ceil; function round(x, pre = 1) { return Math.round(x / pre) * pre; } var round_1 = _build.round = round; function floorDiv(x, y) { return Math.floor(x / y); } var floorDiv_1 = _build.floorDiv = floorDiv; function ceilDiv(x, y) { return Math.ceil(x / y); } var ceilDiv_1 = _build.ceilDiv = ceilDiv; function roundDiv(x, y) { return Math.round(x / y); } var roundDiv_1 = _build.roundDiv = roundDiv; function rem(x, y) { return x % y; } var rem_1 = _build.rem = rem; function mod(x, y) { return x - y * Math.floor(x / y); } var mod_1 = _build.mod = mod; function modp(x, y) { return x - Math.abs(y) * Math.floor(x / Math.abs(y)); } var modp_1 = _build.modp = modp; function constrain(x, min, max) { return Math.min(Math.max(x, min), max); } var constrain_1 = _build.constrain = constrain; var clamp = _build.clamp = constrain; function normalize(x, r, R) { return (x - r) / (R - r); } var normalize_1 = _build.normalize = normalize; var norm = _build.norm = normalize; function remap(x, r, R, t, T) { return t + ((x - r) / (R - r)) * (T - t); } var remap_1 = _build.remap = remap; var map = _build.map = remap; function lerp(x, y, t) { return x + t * (y - x); } var lerp_1 = _build.lerp = lerp; function isPow(x, n) { if (n === 0) return x === 0; var p = log(Math.abs(x), Math.abs(n)); if (p !== Math.floor(p)) return false; return x < 0 ? n < 0 && (p & 1) === 1 : n > 0 || (p & 1) === 0; } var isPow_1 = _build.isPow = isPow; function prevPow(x, n) { if (x <= 1) return 0; var p = Math.floor(Math.log(x) / Math.log(n)); return Math.pow(n, p); } var prevPow_1 = _build.prevPow = prevPow; function nextPow(x, n) { if (x <= 0) return 1; var p = Math.ceil(Math.log(x) / Math.log(n)); return Math.pow(n, p); } var nextPow_1 = _build.nextPow = nextPow; function root(x, n) { if ((n & 1) === 0) return Math.pow(x, 1 / n); return Math.sign(x) * Math.pow(Math.abs(x), 1 / n); } var root_1 = _build.root = root; function log(x, b = Math.E) { return Math.log(x) / Math.log(b); } var log_1 = _build.log = log; function properDivisors(x) { var x = Math.abs(x), a = []; for (var i = 1; i < x; i++) if (x % i === 0) a.push(i); return a; } var properDivisors_1 = _build.properDivisors = properDivisors; var aliquotParts = _build.aliquotParts = properDivisors; function aliquotSum(x) { var x = Math.abs(x), a = 0; for (var i = 0; i < x; i++) if (x % i === 0) a += i; return a; } var aliquotSum_1 = _build.aliquotSum = aliquotSum; function minPrimeFactor(x) { var x = Math.abs(x); if (x <= 1) return 0; if (x <= 3) return x; if (x % 2 === 0) return 2; if (x % 3 === 0) return 3; for (var i = 6, I = Math.sqrt(x) + 1; i <= I; i += 6) { if (x % (i - 1) === 0) return i - 1; if (x % (i + 1) === 0) return i + 1; } return x; } var minPrimeFactor_1 = _build.minPrimeFactor = minPrimeFactor; var leastPrimeFactor = _build.leastPrimeFactor = minPrimeFactor; function maxPrimeFactor(x) { var x = Math.abs(x), a = 0; if (x <= 1) return 0; if (x <= 3) return x; for (; x % 2 === 0; a = 2) x /= 2; for (; x % 3 === 0; a = 3) x /= 3; for (var i = 6, I = Math.sqrt(x) + 1; x > 1 && i <= I; i += 6) { for (; x % (i - 1) == 0; a = i - 1) x /= i - 1; for (; x % (i + 1) == 0; a = i + 1) x /= i + 1; } if (x <= 1) return a; return x; } var maxPrimeFactor_1 = _build.maxPrimeFactor = maxPrimeFactor; var greatestPrimeFactor = _build.greatestPrimeFactor = maxPrimeFactor; function primeFactors(x) { var x = Math.abs(x), a = []; if (x <= 1) return []; if (x <= 3) return [x]; x = pushPrimeFactorTo$(a, x, 2); x = pushPrimeFactorTo$(a, x, 3); for (var i = 6, I = Math.sqrt(x) + 1; x > 1 && i <= I; i += 6) { x = pushPrimeFactorTo$(a, x, i - 1); x = pushPrimeFactorTo$(a, x, i + 1); } if (x > 1) a.push(x); return a; } var primeFactors_1 = _build.primeFactors = primeFactors; function pushPrimeFactorTo$(a, x, f) { if (x % f !== 0) return x; do { x /= f; } while (x % f === 0); a.push(f); return x; } function primeExponentials(x) { var x = Math.abs(x), a = []; if (x <= 1) return []; if (x <= 3) return [[x, 1]]; x = pushPrimeExponentialTo$(a, x, 2); x = pushPrimeExponentialTo$(a, x, 3); for (var i = 6, I = Math.sqrt(x) + 1; x > 1 && i <= I; i += 6) { x = pushPrimeExponentialTo$(a, x, i - 1); x = pushPrimeExponentialTo$(a, x, i + 1); } if (x > 1) a.push([x, 1]); return a; } var primeExponentials_1 = _build.primeExponentials = primeExponentials; function pushPrimeExponentialTo$(a, x, f) { if (x % f !== 0) return x; var e = 0; do { x /= f; ++e; } while (x % f === 0); a.push([f, e]); return x; } function isPrime(x) { return x !== 0 && minPrimeFactor(x) === Math.abs(x); } var isPrime_1 = _build.isPrime = isPrime; function gcd(...xs) { var a = xs[0] || 1; for (var i = 1, I = xs.length; i < I; i++) a = gcdPair(a, xs[i]); return a; } var gcd_1 = _build.gcd = gcd; var hcf = _build.hcf = gcd; function gcdPair(x, y) { while (y !== 0) { var t = y; y = x % y; x = t; } return x; } function lcm(...xs) { var a = xs[0] || 1; for (var i = 1, I = xs.length; i < I; i++) a = a * xs[i] / gcdPair(a, xs[i]); return a; } var lcm_1 = _build.lcm = lcm; function factorial(n, k = 0) { if (n < 0) return 0; for (var i = k + 1, a = 1; i <= n; i++) a *= i; return a; } var factorial_1 = _build.factorial = factorial; function binomial(n, k) { if (k < 0 || k > Math.abs(n)) return 0; if (n < 0) return Math.pow(-1, k) * binomial(-n, k); k = k > n - k ? n - k : k; for (var a = 1, i = 1; i <= k; i++, n--) a *= n / i; return a; } var binomial_1 = _build.binomial = binomial; function multinomial(...ks) { var n = sum(...ks), a = 1; for (var i = 0, j = 0, I = ks.length; i < I;) { if (j <= 0) j = ks[i++]; else a *= n-- / j--; } return a; } var multinomial_1 = _build.multinomial = multinomial; function degrees(x) { return x * (180 / Math.PI); } var degrees_1 = _build.degrees = degrees; function radians(x) { return x * (Math.PI / 180); } var radians_1 = _build.radians = radians; function sum(...xs) { var a = 0; for (var x of xs) a += x; return a; } var sum_1 = _build.sum = sum; function product(...xs) { var a = 1; for (var x of xs) a *= x; return a; } var product_1 = _build.product = product; function median(...xs) { if (xs.length === 0) return 0; xs.sort((a, b) => a - b); var i = xs.length >> 1; if ((xs.length & 1) === 1) return xs[i]; return (xs[i - 1] + xs[i]) / 2; } var median_1 = _build.median = median; function modes(...xs) { xs.sort((a, b) => a - b); var r = maxRepeat(xs); return getRepeats(xs, r); } var modes_1 = _build.modes = modes; function maxRepeat(xs) { var count = Math.min(xs.length, 1), max = count; for (var i = 1, I = xs.length; i < I; i++) { if (xs[i - 1] === xs[i]) count++; else { max = Math.max(max, count); count = 1; } } return Math.max(max, count); } function getRepeats(xs, r) { var a = []; r--; for (var i = 0, I = xs.length - r; i < I; i++) if (xs[i] === xs[i + r]) a.push(xs[i += r]); return a; } function range(...xs) { return [Math.min(...xs), Math.max(...xs)]; } var range_1 = _build.range = range; function variance(...xs) { if (xs.length === 0) return 0; var m = arithmeticMean(...xs), a = 0; for (var x of xs) a += (x - m) ** 2; return a / xs.length; } var variance_1 = _build.variance = variance; function arithmeticMean(...xs) { if (xs.length === 0) return 0; return sum(...xs) / xs.length; } var arithmeticMean_1 = _build.arithmeticMean = arithmeticMean; mean = _build.mean = arithmeticMean; function geometricMean(...xs) { var n = xs.length; return root(product(...xs), n); } var geometricMean_1 = _build.geometricMean = geometricMean; function harmonicMean(...xs) { var n = xs.length; var p = product(...xs), q = 0; for (var x of xs) q += p / x; return n * p / q; } var harmonicMean_1 = _build.harmonicMean = harmonicMean; function quadriaticMean(...xs) { var n = xs.length, a = 0; for (var x of xs) a += x * x; return Math.sqrt(a / n); } var quadriaticMean_1 = _build.quadriaticMean = quadriaticMean; var rootMeanSquare = _build.rootMeanSquare = quadriaticMean; function cubicMean(...xs) { var n = xs.length, a = 0; for (var x of xs) a += x ** 3; return Math.cbrt(a / n); } var cubicMean_1 = _build.cubicMean = cubicMean; const ROMAN_SYMBOLS = ['I', 'IV', 'V', 'IX', 'X', 'XL', 'L', 'XC', 'C', 'CD', 'D', 'CM', 'M']; const ROMAN_VALUES = [1, 4, 5, 9, 10, 40, 50, 90, 100, 400, 500, 900, 1000]; function fromRomanNumerals(txt) { var s = ROMAN_SYMBOLS.length - 1; var n = txt.search(/^\s*-/) >= 0, a = 0; var txt = txt.replace(/\W/g, '').toUpperCase(); for (var i = 0, I = txt.length; i < I; i += ROMAN_SYMBOLS[s].length) { while (s >= 0 && txt.substring(i, i + ROMAN_SYMBOLS[s].length) !== ROMAN_SYMBOLS[s]) --s; if (s < 0) break; a += ROMAN_VALUES[s]; } return n ? -a : a; } var fromRomanNumerals_1 = _build.fromRomanNumerals = fromRomanNumerals; var fromRoman = _build.fromRoman = fromRomanNumerals; function toRomanNumerals(x) { var a = x < 0 ? '-' : ''; var x = Math.abs(x); for (var s = ROMAN_SYMBOLS.length - 1; s >= 0; --s) while (x >= ROMAN_VALUES[s]) { x -= ROMAN_VALUES[s]; a += ROMAN_SYMBOLS[s]; } return a; } var toRomanNumerals_1 = _build.toRomanNumerals = toRomanNumerals; toRoman = _build.toRoman = toRomanNumerals; export { aliquotParts, aliquotSum_1 as aliquotSum, arithmeticMean_1 as arithmeticMean, binomial_1 as binomial, ceil_1 as ceil, ceilDiv_1 as ceilDiv, clamp, compare_1 as compare, constrain_1 as constrain, cubicMean_1 as cubicMean, _build as default, degrees_1 as degrees, factorial_1 as factorial, floor_1 as floor, floorDiv_1 as floorDiv, fromRoman, fromRomanNumerals_1 as fromRomanNumerals, gcd_1 as gcd, geometricMean_1 as geometricMean, greatestPrimeFactor, harmonicMean_1 as harmonicMean, hcf, is_1 as is, isPow_1 as isPow, isPrime_1 as isPrime, lcm_1 as lcm, leastPrimeFactor, lerp_1 as lerp, log_1 as log, map, maxPrimeFactor_1 as maxPrimeFactor, mean, median_1 as median, minPrimeFactor_1 as minPrimeFactor, mod_1 as mod, modes_1 as modes, modp_1 as modp, multinomial_1 as multinomial, nextPow_1 as nextPow, norm, normalize_1 as normalize, prevPow_1 as prevPow, primeExponentials_1 as primeExponentials, primeFactors_1 as primeFactors, product_1 as product, properDivisors_1 as properDivisors, quadriaticMean_1 as quadriaticMean, radians_1 as radians, range_1 as range, rem_1 as rem, remap_1 as remap, root_1 as root, rootMeanSquare, round_1 as round, roundDiv_1 as roundDiv, significantDigits_1 as significantDigits, sum_1 as sum, toRoman, toRomanNumerals_1 as toRomanNumerals, variance_1 as variance };