@nodef/extra-bigint.web 1.4.0 → 1.4.1

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
package/index.js CHANGED
@@ -1,2 +1,2 @@
1
- function $(n){return typeof n=="bigint"}function a(n,t){return Number(n-t)}function i(n){return n<0n?-n:n}function E(n){return n<0n?-1n:n>0n?1n:0n}function g(n,t){return t<0n&&(n=-n,t=-t),n>=0n?n/t:(n-t+1n)/t}function N(n,t){return t<0n&&(n=-n,t=-t),n>=0n?(n+t-1n)/t:n/t}function R(n,t){return t<0n&&(n=-n,t=-t),n>=0n?(n+t/2n)/t:(n-t/2n)/t}function T(n,t){return n%t}function j(n,t){return n-t*g(n,t)}function z(n,t){return n-i(t)*g(n,i(t))}function A(n,t,r){return v(F(n,t),r)}function C(n,t,r,e,o){return e+(n-t)*(o-e)/(r-t)}function G(n,t,r){return n+BigInt(Math.floor(r*Number(t-n)))}function H(n){return/^10*$/.test(n.toString(2))}function J(n){return/^10*$/.test(n.toString())}function K(n){if(n<=1n)return 0n;let t=n.toString(2).length;return BigInt("0b1"+"0".repeat(t-1))}function L(n){if(n<=1n)return 0n;let t=n.toString(10).length;return BigInt("1"+"0".repeat(t-1))}function O(n){if(n<=0n)return 1n;let t=(n-1n).toString(2).length;return BigInt("0b1"+"0".repeat(t))}function Q(n){if(n<=0n)return 1n;let t=(n-1n).toString(10).length;return BigInt("1"+"0".repeat(t))}function h(n){let t=n.toString(2).length-1;return n<=0n?0n:BigInt(t)}function U(n){let t=n.toString().length-1;return n<=0n?0n:BigInt(t)}function u(n){return n===0n?0n:n>0n?B(n):null}function B(n){let t=1n<<h(n)/2n+1n,r=1n+t;for(;t<r;)r=t,t=(r+n/r)/2n;return r}function d(n){return m(n,3n)}function m(n,t=1n){return n===0n?0n:n>0n?p(n,t):t%2n!==0n?-p(-n,t):null}function p(n,t){let r=1n<<h(n)/t+1n,e=1n+r,o=t-1n;if(r===2n)return 1n;for(;r<e;)e=r,r=(o*e+n/e**o)/t;return e}function V(n){n=i(n);let t=[];for(let r=1n;r<n;r++)n%r===0n&&t.push(r);return t}function W(n){n=i(n);let t=0n;for(let r=1n;r<n;r++)n%r===0n&&(t+=r);return t}function w(n){if(n=i(n),n<=1n)return 0n;if(n<=3n)return n;if(n%2n===0n)return 2n;if(n%3n===0n)return 3n;for(let t=6n,r=u(n)+1n;t<=r;t+=6n){if(n%(t-1n)===0n)return t-1n;if(n%(t+1n)===0n)return t+1n}return n}function X(n){n=i(n);let t=0n;if(n<=1n)return 0n;if(n<=3n)return n;for(;n%2n===0n;t=2n)n/=2n;for(;n%3n===0n;t=3n)n/=3n;for(let r=6n,e=u(n)+1n;n>1n&&r<=e;r+=6n){for(;n%(r-1n)==0n;t=r-1n)n/=r-1n;for(;n%(r+1n)==0n;t=r+1n)n/=r+1n}return n<=1n?t:n}function Y(n){n=i(n);let t=[];if(n<=1n)return[];if(n<=3n)return[n];n=f(t,n,2n),n=f(t,n,3n);for(let r=6n,e=u(n)+1n;n>1n&&r<=e;r+=6n)n=f(t,n,r-1n),n=f(t,n,r+1n);return n>1n&&t.push(n),t}function f(n,t,r){if(t%r!==0n)return t;do t/=r;while(t%r===0n);return n.push(r),t}function Z(n){n=i(n);let t=[];if(n<=1n)return[];if(n<=3n)return[[n,1n]];n=c(t,n,2n),n=c(t,n,3n);for(let r=6n,e=u(n)+1n;n>1n&&r<=e;r+=6n)n=c(t,n,r-1n),n=c(t,n,r+1n);return n>1n&&t.push([n,1n]),t}function c(n,t,r){if(t%r!==0n)return t;let e=0n;do t/=r,++e;while(t%r===0n);return n.push([r,e]),t}function _(n){return n!==0n&&w(n)===i(n)}function k(...n){let t=n[0]||1n;for(let r=1,e=n.length;r<e;r++)t=s(t,n[r]);return t}function s(n,t){for(;t!==0n;){let r=t;t=n%t,n=r}return n}function y(...n){let t=n[0]||1n;for(let r=1,e=n.length;r<e;r++)t=t*n[r]/s(t,n[r]);return t}function x(n,t=0n){let r=1n;if(n<0n)return 0n;for(let e=t+1n;e<=n;e++)r*=e;return r}function M(n,t){if(t<0n||t>i(n))return 0n;if(n<0n)return(-1n)**t*M(-n,t);t=t>n-t?n-t:t;let r=1n,e=1n;for(let o=1n;o<=t;o++,n--)r*=n,e*=o;return r/e}function nn(...n){let t=I(...n),r=1n,e=1n;for(let o=0,l=0n,b=n.length;o<b;)l<=0n?l=n[o++]:(r*=t--,e*=l--);return r/e}function tn(...n){let t=0n;for(let r of n)t+=r*r;return u(t)}function I(...n){let t=0n;for(let r of n)t+=r;return t}function P(...n){let t=1n;for(let r of n)t*=r;return t}function rn(...n){if(n.length===0)return 0n;n.sort(a);let t=n.length>>1;return(n.length&1)===1?n[t]:(n[t-1]+n[t])/2n}function en(...n){n.sort(a);let t=S(n);return q(n,t)}function S(n){let t=Math.min(n.length,1),r=t;for(let e=1,o=n.length;e<o;e++)n[e-1]===n[e]?t++:(r=Math.max(r,t),t=1);return Math.max(r,t)}function q(n,t){let r=[];t--;for(let e=0,o=n.length-t;e<o;e++)n[e]===n[e+t]&&r.push(n[e+=t]);return r}function v(...n){if(n.length===0)return 0n;let t=n[0];for(let r of n)t=r<t?r:t;return t}function F(...n){if(n.length===0)return 0n;let t=n[0];for(let r of n)t=r>t?r:t;return t}function on(...n){if(n.length===0)return[0n,0n];let t=n[0],r=t;for(let e of n)t=e<t?e:t,r=e>r?e:r;return[t,r]}function un(...n){if(n.length===0)return 0n;let t=D(...n),r=0n;for(let e of n)r+=(e-t)**2n;return r/BigInt(n.length)}function D(...n){let t=BigInt(n.length);return I(...n)/t}function fn(...n){let t=BigInt(n.length);return m(P(...n),t)}function cn(...n){let t=BigInt(n.length),r=P(...n),e=0n;for(let o of n)e+=r/o;return t*r/e}function ln(...n){let t=BigInt(n.length),r=0n;for(let e of n)r+=e*e;return u(r/t)}function pn(...n){let t=BigInt(n.length),r=0n;for(let e of n)r+=e**3n;return d(r/t)}export{i as abs,V as aliquotParts,W as aliquotSum,D as arithmeticMean,M as binomial,d as cbrt,N as ceilDiv,A as clamp,a as compare,A as constrain,pn as cubicMean,x as factorial,g as floorDiv,k as gcd,fn as geometricMean,X as greatestPrimeFactor,cn as harmonicMean,k as hcf,tn as hypot,$ as is,J as isPow10,H as isPow2,_ as isPrime,y as lcm,w as leastPrimeFactor,G as lerp,U as log10,h as log2,C as map,F as max,X as maxPrimeFactor,D as mean,rn as median,v as min,w as minPrimeFactor,j as mod,en as modes,z as modp,nn as multinomial,Q as nextPow10,O as nextPow2,L as prevPow10,K as prevPow2,Z as primeExponentials,Y as primeFactors,P as product,V as properDivisors,ln as quadriaticMean,on as range,T as rem,C as remap,m as root,ln as rootMeanSquare,R as roundDiv,E as sign,u as sqrt,I as sum,un as variance};
1
+ function $(n){return typeof n=="bigint"}function a(n,t){return Number(n-t)}function i(n){return n<0n?-n:n}function E(n){return n<0n?-1n:n>0n?1n:0n}function g(n,t){return t<0n&&(n=-n,t=-t),n>=0n?n/t:(n-t+1n)/t}function N(n,t){return t<0n&&(n=-n,t=-t),n>=0n?(n+t-1n)/t:n/t}function R(n,t){return t<0n&&(n=-n,t=-t),n>=0n?(n+t/2n)/t:(n-t/2n)/t}function T(n,t){return n%t}function j(n,t){return n-t*g(n,t)}function z(n,t){return n-i(t)*g(n,i(t))}function A(n,t,r){return v(F(n,t),r)}function C(n,t,r,e,o){return e+(n-t)*(o-e)/(r-t)}function G(n,t,r){return n+BigInt(Math.floor(r*Number(t-n)))}function H(n){return/^10*$/.test(n.toString(2))}function J(n){return/^10*$/.test(n.toString())}function K(n){if(n<1n)return 0n;let t=n.toString(2).length;return BigInt("0b1"+"0".repeat(t-1))}function L(n){if(n<1n)return 0n;let t=n.toString(10).length;return BigInt("1"+"0".repeat(t-1))}function O(n){if(n<=1n)return 1n;let t=(n-1n).toString(2).length;return BigInt("0b1"+"0".repeat(t))}function Q(n){if(n<=1n)return 1n;let t=(n-1n).toString(10).length;return BigInt("1"+"0".repeat(t))}function h(n){let t=n.toString(2).length-1;return n<=0n?0n:BigInt(t)}function U(n){let t=n.toString().length-1;return n<=0n?0n:BigInt(t)}function u(n){return n===0n?0n:n>0n?B(n):null}function B(n){let t=1n<<h(n)/2n+1n,r=1n+t;for(;t<r;)r=t,t=(r+n/r)/2n;return r}function d(n){return m(n,3n)}function m(n,t=1n){return n===0n?0n:n>0n?p(n,t):t%2n!==0n?-p(-n,t):null}function p(n,t){let r=1n<<h(n)/t+1n,e=1n+r,o=t-1n;if(r===2n)return 1n;for(;r<e;)e=r,r=(o*e+n/e**o)/t;return e}function V(n){n=i(n);let t=[];for(let r=1n;r<n;r++)n%r===0n&&t.push(r);return t}function W(n){n=i(n);let t=0n;for(let r=1n;r<n;r++)n%r===0n&&(t+=r);return t}function w(n){if(n=i(n),n<=1n)return 0n;if(n<=3n)return n;if(n%2n===0n)return 2n;if(n%3n===0n)return 3n;for(let t=6n,r=u(n)+1n;t<=r;t+=6n){if(n%(t-1n)===0n)return t-1n;if(n%(t+1n)===0n)return t+1n}return n}function X(n){n=i(n);let t=0n;if(n<=1n)return 0n;if(n<=3n)return n;for(;n%2n===0n;t=2n)n/=2n;for(;n%3n===0n;t=3n)n/=3n;for(let r=6n,e=u(n)+1n;n>1n&&r<=e;r+=6n){for(;n%(r-1n)==0n;t=r-1n)n/=r-1n;for(;n%(r+1n)==0n;t=r+1n)n/=r+1n}return n<=1n?t:n}function Y(n){n=i(n);let t=[];if(n<=1n)return[];if(n<=3n)return[n];n=f(t,n,2n),n=f(t,n,3n);for(let r=6n,e=u(n)+1n;n>1n&&r<=e;r+=6n)n=f(t,n,r-1n),n=f(t,n,r+1n);return n>1n&&t.push(n),t}function f(n,t,r){if(t%r!==0n)return t;do t/=r;while(t%r===0n);return n.push(r),t}function Z(n){n=i(n);let t=[];if(n<=1n)return[];if(n<=3n)return[[n,1n]];n=c(t,n,2n),n=c(t,n,3n);for(let r=6n,e=u(n)+1n;n>1n&&r<=e;r+=6n)n=c(t,n,r-1n),n=c(t,n,r+1n);return n>1n&&t.push([n,1n]),t}function c(n,t,r){if(t%r!==0n)return t;let e=0n;do t/=r,++e;while(t%r===0n);return n.push([r,e]),t}function _(n){return n!==0n&&w(n)===i(n)}function k(...n){let t=n.length?i(n[0]):1n;for(let r=1,e=n.length;r<e;r++)t=s(t,n[r]);return t}function s(n,t){for(n=i(n),t=i(t);t!==0n;){let r=t;t=n%t,n=r}return n}function y(...n){let t=n.length?i(n[0]):1n;for(let r=1,e=n.length;r<e;r++){if(t===0n||n[r]===0n)return 0n;t=i(t*n[r])/s(t,n[r])}return t}function x(n,t=0n){let r=1n;if(n<0n)return 0n;for(let e=t+1n;e<=n;e++)r*=e;return r}function M(n,t){if(t<0n)return 0n;if(n<0n)return(t%2n===0n?1n:-1n)*M(t-n-1n,t);if(t>n)return 0n;t=t>n-t?n-t:t;let r=1n,e=1n;for(let o=1n;o<=t;o++,n--)r*=n,e*=o;return r/e}function nn(...n){let t=I(...n),r=1n,e=1n;for(let o=0,l=0n,b=n.length;o<b;)l<=0n?l=n[o++]:(r*=t--,e*=l--);return r/e}function tn(...n){let t=0n;for(let r of n)t+=r*r;return u(t)}function I(...n){let t=0n;for(let r of n)t+=r;return t}function P(...n){let t=1n;for(let r of n)t*=r;return t}function rn(...n){if(n.length===0)return 0n;n.sort(a);let t=n.length>>1;return(n.length&1)===1?n[t]:(n[t-1]+n[t])/2n}function en(...n){n.sort(a);let t=S(n);return q(n,t)}function S(n){let t=Math.min(n.length,1),r=t;for(let e=1,o=n.length;e<o;e++)n[e-1]===n[e]?t++:(r=Math.max(r,t),t=1);return Math.max(r,t)}function q(n,t){let r=[];t--;for(let e=0,o=n.length-t;e<o;e++)n[e]===n[e+t]&&r.push(n[e+=t]);return r}function v(...n){if(n.length===0)return 0n;let t=n[0];for(let r of n)t=r<t?r:t;return t}function F(...n){if(n.length===0)return 0n;let t=n[0];for(let r of n)t=r>t?r:t;return t}function on(...n){if(n.length===0)return[0n,0n];let t=n[0],r=t;for(let e of n)t=e<t?e:t,r=e>r?e:r;return[t,r]}function un(...n){if(n.length===0)return 0n;let t=D(...n),r=0n;for(let e of n)r+=(e-t)**2n;return r/BigInt(n.length)}function D(...n){let t=BigInt(n.length);return I(...n)/t}function fn(...n){let t=BigInt(n.length);return m(P(...n),t)}function cn(...n){let t=BigInt(n.length),r=P(...n),e=0n;for(let o of n)e+=r/o;return t*r/e}function ln(...n){let t=BigInt(n.length),r=0n;for(let e of n)r+=e*e;return u(r/t)}function pn(...n){let t=BigInt(n.length),r=0n;for(let e of n)r+=e**3n;return d(r/t)}export{i as abs,V as aliquotParts,W as aliquotSum,D as arithmeticMean,M as binomial,d as cbrt,N as ceilDiv,A as clamp,a as compare,A as constrain,pn as cubicMean,x as factorial,g as floorDiv,k as gcd,fn as geometricMean,X as greatestPrimeFactor,cn as harmonicMean,k as hcf,tn as hypot,$ as is,J as isPow10,H as isPow2,_ as isPrime,y as lcm,w as leastPrimeFactor,G as lerp,U as log10,h as log2,C as map,F as max,X as maxPrimeFactor,D as mean,rn as median,v as min,w as minPrimeFactor,j as mod,en as modes,z as modp,nn as multinomial,Q as nextPow10,O as nextPow2,L as prevPow10,K as prevPow2,Z as primeExponentials,Y as primeFactors,P as product,V as properDivisors,ln as quadriaticMean,on as range,T as rem,C as remap,m as root,ln as rootMeanSquare,R as roundDiv,E as sign,u as sqrt,I as sum,un as variance};
2
2
  //# sourceMappingURL=index.js.map
package/index.js.map CHANGED
@@ -1,7 +1,7 @@
1
1
  {
2
2
  "version": 3,
3
3
  "sources": ["../../index.ts"],
4
- "sourcesContent": ["// METHODS\n// =======\n\n// ABOUT\n// -----\n\n/**\n * Check if value is a bigint.\n * @param x a value\n * @returns is bigint?\n */\nexport function is(x: unknown): x is bigint {\n return typeof x===\"bigint\";\n}\n\n\n\n\n// COMPARE\n// -------\n\n/**\n * Compare two bigints.\n * @param x a bigint\n * @param y another bigint\n * @returns x<y: -ve, x=y: 0, x>y: +ve\n */\nexport function compare(x: bigint, y: bigint): number {\n return Number(x-y);\n}\n\n\n\n\n// SIGN\n// ----\n\n/**\n * Get the absolute of a bigint.\n * @param x a bigint\n * @returns |x|\n */\nexport function abs(x: bigint): bigint {\n return x<0n? -x : x;\n}\n\n\n/**\n * Get the sign of a bigint.\n * @param x a bigint\n * @returns x>0: 1n, x<0: -1n, x=0: 0n\n */\nexport function sign(x: bigint): bigint {\n return x<0n? -1n : (x>0n? 1n : 0n);\n}\n\n\n\n\n// ROUNDED DIVISION\n// ----------------\n\n/**\n * Perform floor-divison of two bigints (\\\\).\n * @param x dividend\n * @param y divisor\n * @returns ⌊x/y⌋\n */\nexport function floorDiv(x: bigint, y: bigint): bigint {\n if (y<0n) { x = -x; y = -y; }\n return x>=0n? x/y : (x-y+1n)/y;\n}\n// - https://python-reference.readthedocs.io/en/latest/docs/operators/floor_division.html\n\n\n/**\n * Perform ceiling-divison of two bigints.\n * @param x dividend\n * @param y divisor\n * @returns ⌈x/y⌉\n */\nexport function ceilDiv(x: bigint, y: bigint): bigint {\n if (y<0n) { x = -x; y = -y; }\n return x>=0n? (x+y-1n)/y : x/y;\n}\n\n\n/**\n * Perform rounded-divison of two bigints.\n * @param x divisor\n * @param y dividend\n * @returns [x/y]\n */\nexport function roundDiv(x: bigint, y: bigint): bigint {\n if (y<0n) { x = -x; y = -y; }\n return x>=0n? (x+y/2n)/y : (x-y/2n)/y;\n}\n\n\n\n\n// MODULO\n// ------\n\n/**\n * Find the remainder of x/y with sign of x (truncated division).\n * @param x dividend\n * @param y divisor\n * @returns trunc(x % y)\n */\nexport function rem(x: bigint, y: bigint): bigint {\n return x % y;\n}\n// - https://en.wikipedia.org/wiki/Modulo_operation\n\n\n/**\n * Find the remainder of x/y with sign of y (floored division).\n * @param x dividend\n * @param y divisor\n * @returns floor(x % y)\n */\nexport function mod(x: bigint, y: bigint): bigint {\n return x - y*floorDiv(x, y);\n}\n// - https://en.wikipedia.org/wiki/Modulo_operation\n\n\n/**\n * Find the remainder of x/y with +ve sign (euclidean division).\n * @param x dividend\n * @param y divisor\n * @returns x/y>0: floor(x % y), x/y<0: ceil(x % y)\n */\nexport function modp(x: bigint, y: bigint): bigint {\n return x - abs(y)*floorDiv(x, abs(y));\n}\n// - https://en.wikipedia.org/wiki/Modulo_operation\n\n\n\n\n// RANGE CONTROL\n// -------------\n\n/**\n * Constrain a bigint within a minimum and a maximum value.\n * @param x a bigint\n * @param minv minimum value\n * @param maxv maximum value\n * @returns x<min: min, x>max: max, x\n */\nexport function constrain(x: bigint, minv: bigint, maxv: bigint): bigint {\n return min(max(x, minv), maxv);\n}\nexport {constrain as clamp};\n// - https://processing.org/reference/constrain_.html\n// - https://www.npmjs.com/package/clamp\n// - https://en.cppreference.com/w/cpp/algorithm/clamp\n// - https://dlang.org/library/std/algorithm/comparison/clamp.html\n// - https://www.rdocumentation.org/packages/raster/versions/3.0-12/topics/clamp\n// - https://docs.microsoft.com/en-us/dotnet/api/system.math.clamp?view=netcore-3.1\n// - https://docs.microsoft.com/en-us/windows/win32/direct3dhlsl/dx-graphics-hlsl-clamp\n// - https://www.khronos.org/registry/OpenGL-Refpages/gl4/html/clamp.xhtml\n// - https://docs.unity3d.com/ScriptReference/Mathf.Clamp.html\n// - https://en.wikipedia.org/wiki/Clamping_(graphics)\n\n\n/**\n * Re-map a bigint from one range to another.\n * @param x a bigint\n * @param r lower bound of current range\n * @param R upper bound of current range\n * @param t lower bound of target range\n * @param T upper bound of target range\n * @returns ∈ [ymin, ymax]\n */\nexport function remap(x: bigint, r: bigint, R: bigint, t: bigint, T: bigint): bigint {\n return t + (x - r)*(T - t)/(R - r);\n}\nexport {remap as map};\n// - https://processing.org/reference/map_.html\n\n\n/**\n * Linearly interpolate a bigint between two bigints.\n * @param x start bigint\n * @param y stop bigint\n * @param t interpolant ∈ [0, 1]\n * @returns ∈ [x, y]\n */\nexport function lerp(x: bigint, y: bigint, t: number): bigint {\n return x + BigInt(Math.floor(t*Number(y - x)));\n}\n// - https://processing.org/reference/lerp_.html\n// - https://docs.unity3d.com/ScriptReference/Vector3.Lerp.html\n// - https://stackoverflow.com/questions/53970655/how-to-convert-bigint-to-number-in-javascript\n\n\n\n\n// POWER / LOGARITHM\n// -----------------\n\n/**\n * Check if bigint is a power-of-2.\n * @param x a bigint\n * @returns 2ⁱ = x? | i = +ve integer\n */\nexport function isPow2(x: bigint): boolean {\n return /^10*$/.test(x.toString(2));\n}\n\n\n/**\n * Check if bigint is a power-of-10.\n * @param x a bigint\n * @returns 10ⁱ = x? | i = +ve integer\n */\nexport function isPow10(x: bigint): boolean {\n return /^10*$/.test(x.toString());\n}\n\n\n/**\n * Find largest power-of-2 less than or equal to given bigint.\n * @param x a bigint\n * @returns 2ⁱ | 2ⁱ ≤ x and 2ⁱ > x/2\n */\nexport function prevPow2(x: bigint): bigint {\n if (x<=1n) return 0n;\n const n = x.toString(2).length;\n return BigInt(\"0b1\" + \"0\".repeat(n-1));\n}\n\n\n/**\n * Find largest power-of-10 less than or equal to given bigint.\n * @param x a bigint\n * @returns 10ⁱ | 10ⁱ ≤ x and 10ⁱ > x/10\n */\nexport function prevPow10(x: bigint): bigint {\n if (x<=1n) return 0n;\n const n = x.toString(10).length;\n return BigInt(\"1\" + \"0\".repeat(n-1));\n}\n\n\n/**\n * Find smallest power-of-2 greater than or equal to given bigint.\n * @param x a bigint\n * @returns 2ⁱ | 2ⁱ ≥ x and 2ⁱ < 2x\n */\nexport function nextPow2(x: bigint): bigint {\n if (x<=0n) return 1n;\n const n = (x-1n).toString(2).length;\n return BigInt(\"0b1\" + \"0\".repeat(n));\n}\n\n\n/**\n * Find smallest power-of-10 greater than or equal to given bigint.\n * @param x a bigint\n * @returns 10ⁱ | 10ⁱ ≥ x and 10ⁱ < 10x\n */\nexport function nextPow10(x: bigint): bigint {\n if (x<=0n) return 1n;\n const n = (x-1n).toString(10).length;\n return BigInt(\"1\" + \"0\".repeat(n));\n}\n\n\n/**\n * Find the base-2 logarithm of a bigint.\n * @param x a bigint\n * @returns log₂(x)\n */\nexport function log2(x: bigint): bigint {\n const n = x.toString(2).length - 1;\n return x<=0n? 0n : BigInt(n);\n}\n\n\n/**\n * Find the base-10 logarithm of a bigint.\n * @param x a bigint\n * @returns log₁₀(x)\n */\nexport function log10(x: bigint): bigint {\n const n = x.toString().length - 1;\n return x<=0n? 0n : BigInt(n);\n}\n\n\n// TODO: isPow() based on accelerated search\n// TODO: prevPow() based on accelerated search\n// TODO: nextPow() based on accelerated search\n// TODO: log() based on accelerated search\n\n\n\n\n// ROOT\n// ----\n\n/**\n * Find the square root of a bigint.\n * @param x a bigint\n * @returns √x\n */\nexport function sqrt(x: bigint): bigint | null {\n if (x===0n) return 0n;\n return x>0n? sqrtPos(x) : null;\n}\n\nfunction sqrtPos(x: bigint): bigint {\n let a = 1n << (log2(x)/2n + 1n); // initial guess\n let b = 1n + a;\n while (a<b) {\n b = a;\n a = (b + x/b)/2n;\n }\n return b;\n}\n\n\n/**\n * Find the cube root of a bigint.\n * @param x a bigint\n * @returns ³√x\n */\nexport function cbrt(x: bigint): bigint | null {\n return root(x, 3n);\n}\n\n\n/**\n * Find the nth root of a bigint.\n * @param x a bigint\n * @param n nth root (1n)\n * @returns ⁿ√x\n */\nexport function root(x: bigint, n: bigint=1n): bigint | null {\n if (x===0n) return 0n;\n else if (x>0n) return rootPos(x, n);\n return n % 2n!==0n? -rootPos(-x, n) : null;\n}\n\nfunction rootPos(x: bigint, n: bigint): bigint {\n let a = 1n << (log2(x)/n + 1n); // initial guess\n let b = 1n + a; const m = n - 1n;\n if (a===2n) return 1n;\n while (a<b) {\n b = a;\n a = (m*b + x/b**m)/n;\n }\n return b;\n}\n\n\n\n\n// DIVISORS\n// --------\n\n/**\n * List all divisors of a bigint, except itself.\n * @param x a bigint\n * @returns proper divisors (factors)\n */\nexport function properDivisors(x: bigint): bigint[] {\n x = abs(x); const a = [];\n for (let i=1n; i<x; i++)\n if (x % i===0n) a.push(i);\n return a;\n}\nexport {properDivisors as aliquotParts};\n// - https://mathworld.wolfram.com/ProperDivisor.html\n// - https://en.wikipedia.org/wiki/Divisor#Further_notions_and_facts\n\n\n/**\n * Sum all proper divisors of a bigint.\n * @param x a bigint\n * @returns Σdᵢ | dᵢ is a divisor of x and ≠x\n */\nexport function aliquotSum(x: bigint): bigint {\n x = abs(x); let a = 0n;\n for (let i=1n; i<x; i++)\n if (x % i===0n) a += i;\n return a;\n}\n\n\n/**\n * Find the least prime number which divides a bigint.\n * @param x a bigint\n * @returns least prime factor\n */\nexport function minPrimeFactor(x: bigint): bigint {\n x = abs(x);\n // 1. LPF of 2, 3 is the number itself.\n if (x<=1n) return 0n;\n if (x<=3n) return x;\n // 2. LPF for multiples of 2, 3.\n if (x % 2n===0n) return 2n;\n if (x % 3n===0n) return 3n;\n // 3. LPF can be 6k-1 or 6k+1.\n for (let i=6n, I=(sqrt(x) as bigint)+1n; i<=I; i+=6n) {\n if (x % (i-1n)===0n) return i-1n;\n if (x % (i+1n)===0n) return i+1n;\n }\n return x;\n}\nexport {minPrimeFactor as leastPrimeFactor};\n// - https://mathworld.wolfram.com/LeastPrimeFactor.html\n\n\n/**\n * Find the greatest prime number which divides a bigint.\n * @param x a bigint\n * @returns greatest prime factor\n */\nexport function maxPrimeFactor(x: bigint): bigint {\n x = abs(x); let a = 0n;\n // 1. GPF of 2, 3 is the number itself.\n if (x<=1n) return 0n;\n if (x<=3n) return x;\n // 2. Remove factors 2, 3.\n for (; x % 2n===0n; a=2n)\n x /= 2n;\n for (; x % 3n===0n; a=3n)\n x /= 3n;\n // 3. Remove factors 6k-1, 6k+1.\n for (let i=6n, I=(sqrt(x) as bigint)+1n; x>1n && i<=I; i+=6n) {\n for (; x % (i-1n)==0n; a=i-1n)\n x /= i-1n;\n for (; x % (i+1n)==0n; a=i+1n)\n x /= i+1n;\n }\n if (x<=1n) return a;\n return x;\n}\nexport {maxPrimeFactor as greatestPrimeFactor};\n// - https://mathworld.wolfram.com/GreatestPrimeFactor.html\n// - https://www.geeksforgeeks.org/find-largest-prime-factor-number/\n\n\n/**\n * Find the prime factors of a bigint.\n * @param x a bigint\n * @returns [f₀, f₁, ...] | fᵢ divides x and is prime\n */\nexport function primeFactors(x: bigint): bigint[] {\n x = abs(x); const a: bigint[] = [];\n if (x<=1n) return [];\n if (x<=3n) return [x];\n // 2. Try factors 2, 3.\n x = pushPrimeFactorTo$(a, x, 2n);\n x = pushPrimeFactorTo$(a, x, 3n);\n // 3. Try factors 6k-1, 6k+1.\n for (let i=6n, I=(sqrt(x) as bigint)+1n; x>1n && i<=I; i+=6n) {\n x = pushPrimeFactorTo$(a, x, i-1n);\n x = pushPrimeFactorTo$(a, x, i+1n);\n }\n if (x>1n) a.push(x);\n return a;\n}\n\nfunction pushPrimeFactorTo$(a: bigint[], x: bigint, f: bigint): bigint {\n if (x % f!==0n) return x;\n do {\n x /= f;\n } while (x % f===0n);\n a.push(f);\n return x;\n}\n// - https://www.geeksforgeeks.org/prime-factors-big-number/\n// - https://mathworld.wolfram.com/PrimeFactor.html\n\n\n/**\n * Find the prime factors and respective exponents of a bigint.\n * @param x a bigint\n * @returns [[f₀, e₀], [f₁, e₁], ...] | fᵢ is a prime factor of x and eᵢ is its exponent\n */\nexport function primeExponentials(x: bigint): [bigint, bigint][] {\n x = abs(x); const a: [bigint, bigint][] = [];\n if (x<=1n) return [];\n if (x<=3n) return [[x, 1n]];\n // 2. Try factors 2, 3.\n x = pushPrimeExponentialTo$(a, x, 2n);\n x = pushPrimeExponentialTo$(a, x, 3n);\n // 3. Try factors 6k-1, 6k+1.\n for (let i=6n, I=(sqrt(x) as bigint)+1n; x>1n && i<=I; i+=6n) {\n x = pushPrimeExponentialTo$(a, x, i-1n);\n x = pushPrimeExponentialTo$(a, x, i+1n);\n }\n if (x>1n) a.push([x, 1n]);\n return a;\n}\n\nfunction pushPrimeExponentialTo$(a: [bigint, bigint][], x: bigint, f: bigint): bigint {\n if (x % f!==0n) return x;\n let e = 0n;\n do {\n x /= f; ++e;\n } while (x % f===0n);\n a.push([f, e]);\n return x;\n}\n// - https://www.geeksforgeeks.org/prime-factors-big-number/\n// - https://reference.wolfram.com/language/ref/FactorInteger.html\n// - https://mathworld.wolfram.com/PrimeFactorization.html\n// - https://mathworld.wolfram.com/PrimeFactor.html\n\n\n/**\n * Check if bigint is prime.\n * @param x a bigint\n * @returns is divisible by 1n and itself only?\n */\nexport function isPrime(x: bigint): boolean {\n return x!==0n && minPrimeFactor(x) === abs(x);\n}\n\n\n/**\n * Find the greatest common divisor of bigints.\n * @param xs a list of bigints\n * @returns gcd(x₁, x₂, ...)\n */\nexport function gcd(...xs: bigint[]): bigint {\n let a = xs[0] || 1n;\n for(let i=1, I=xs.length; i<I; i++)\n a = gcdPair(a, xs[i]);\n return a;\n}\nexport {gcd as hcf};\n\n// Find the greatest common divisor of a pair of bigints.\nfunction gcdPair(x: bigint, y: bigint): bigint {\n while (y!==0n) {\n const t = y;\n y = x % y;\n x = t;\n }\n return x;\n}\n// - https://lemire.me/blog/2013/12/26/fastest-way-to-compute-the-greatest-common-divisor/\n// - https://en.wikipedia.org/wiki/Euclidean_algorithm\n\n\n/**\n * Find the least common multiple of bigints.\n * @param xs a list of bigints\n * @returns lcm(x₁, x₂, ...)\n */\nexport function lcm(...xs: bigint[]): bigint {\n let a = xs[0] || 1n;\n for (let i=1, I=xs.length; i<I; i++)\n a = a*xs[i] / gcdPair(a, xs[i]);\n return a;\n}\n// - https://en.wikipedia.org/wiki/Least_common_multiple\n\n\n\n\n// ARRANGEMENTS\n// ------------\n\n/**\n * Find the factorial of a bigint.\n * @param n a bigint\n * @param k denominator factorial [0]\n * @returns P(n, k); k=0: n!, k>0: n!/k!\n */\nexport function factorial(n: bigint, k: bigint=0n): bigint {\n let a = 1n;\n if (n<0n) return 0n;\n for (let i=k+1n; i<=n; i++)\n a *= i;\n return a;\n}\n// - https://github.com/alawatthe/MathLib/blob/master/src/Functn/functions/factorial.ts\n// - https://en.wikipedia.org/wiki/Permutation\n\n\n/**\n * Find the number of ways to choose k elements from a set of n elements.\n * @param n elements in source set\n * @param k elements in choose set\n * @returns C(n, k)\n */\nexport function binomial(n: bigint, k: bigint): bigint {\n // 1. Generalization to negative integers\n if (k<0n || k>abs(n)) return 0n;\n if (n<0n) return ((-1n)**k)*binomial(-n, k);\n // 2. Take advantage of symmetry\n k = k>n-k? n-k:k;\n let a = 1n, b = 1n;\n for (let i=1n; i<=k; i++, n--) {\n a *= n;\n b *= i;\n }\n return a/b;\n}\n// - https://github.com/alawatthe/MathLib/blob/master/src/Functn/functions/binomial.ts\n// - https://en.wikipedia.org/wiki/Binomial_coefficient\n\n\n/**\n * Find the number of ways to put n objects in m bins (n=sum(kᵢ)).\n * @param ks objects per bin (kᵢ)\n * @returns n!/(k₁!k₂!...) | n=sum(kᵢ)\n */\nexport function multinomial(...ks: bigint[]): bigint {\n let n = sum(...ks), a = 1n, b = 1n;\n for (let i=0, j=0n, I=ks.length; i<I;) {\n if (j<=0n) j = ks[i++];\n else { a *= n--; b*= j--; }\n }\n return a/b;\n}\n// - https://en.wikipedia.org/wiki/Multinomial_distribution\n\n\n\n\n// GEOMETRY\n// --------\n\n/**\n * Find the length of hypotenuse.\n * @param xs lengths of perpendicular sides (x, y, z, ...)\n * @returns √(x² + y² + z²)\n */\nexport function hypot(...xs: bigint[]): bigint {\n let a = 0n;\n for (const x of xs)\n a += x*x;\n return sqrt(a) as bigint;\n}\n\n\n\n\n// STATISTICS\n// ----------\n\n/**\n * Find the sum of bigints (Σ).\n * @param xs bigints\n * @returns Σxᵢ\n */\nexport function sum(...xs: bigint[]): bigint {\n let a = 0n;\n for (const x of xs)\n a += x;\n return a;\n}\n\n\n/**\n * Find the product of bigints (∏).\n * @param xs bigints\n * @returns ∏xᵢ\n */\nexport function product(...xs: bigint[]): bigint {\n let a = 1n;\n for (const x of xs)\n a *= x;\n return a;\n}\n\n\n/**\n * Find the value separating the higher and lower halves of bigints.\n * @param xs a list of bigints\n * @returns xₘ | sort(xs) = [..., xₘ, ...]\n */\nexport function median(...xs: bigint[]): bigint {\n if (xs.length===0) return 0n;\n xs.sort(compare);\n const i = xs.length>>1;\n if ((xs.length & 1)===1) return xs[i];\n return (xs[i-1] + xs[i])/2n;\n}\n// - https://stackoverflow.com/questions/45309447/calculating-median-javascript\n// - https://en.wikipedia.org/wiki/Median\n\n\n/**\n * Find the values that appear most often.\n * @param xs a list of bigints\n * @returns [xₘ₁, xₘ₂, ...] | count(xₘᵢ) ≥ count(xᵢ) ∀ xᵢ ∈ xs\n */\nexport function modes(...xs: bigint[]): bigint[] {\n xs.sort(compare);\n const r = maxRepeat(xs);\n return getRepeats(xs, r);\n}\n// - https://en.wikipedia.org/wiki/Mode_(statistics)\n\n// Get the maximum number of times any bigint has repeated in a sorted array.\nfunction maxRepeat(xs: bigint[]): number {\n let count = Math.min(xs.length, 1), max = count;\n for (let i=1, I=xs.length; i<I; i++) {\n if (xs[i-1]===xs[i]) count++;\n else { max = Math.max(max, count); count = 1; }\n }\n return Math.max(max, count);\n}\n\n// Get the numbers which have been repeated atleast given number of times.\nfunction getRepeats(xs: bigint[], r: number): bigint[] {\n const a: bigint[] = []; r--;\n for (let i=0, I=xs.length-r; i<I; i++)\n if (xs[i]===xs[i+r]) a.push(xs[i+=r]);\n return a;\n}\n\n\n/**\n * Find the smallest bigint.\n * @param xs bigints\n * @returns min(xs)\n */\nexport function min(...xs: bigint[]): bigint {\n if (xs.length===0) return 0n;\n let a = xs[0];\n for (const x of xs)\n a = x<a? x : a;\n return a;\n}\n\n\n/**\n * Find the largest bigint.\n * @param xs bigints\n * @returns max(xs)\n */\nexport function max(...xs: bigint[]): bigint {\n if (xs.length===0) return 0n;\n let a = xs[0];\n for (const x of xs)\n a = x>a? x : a;\n return a;\n}\n\n\n/**\n * Find the minimum and maximum bigint.\n * @param xs bigints\n * @returns [min, max]\n */\nexport function range(...xs: bigint[]): [bigint, bigint] {\n if (xs.length===0) return [0n, 0n];\n let a = xs[0], b = a;\n for (const x of xs) {\n a = x<a? x : a;\n b = x>b? x : b;\n }\n return [a, b];\n}\n\n\n/**\n * Find the mean of squared deviation of bigints from its mean.\n * @param xs a list of bigints\n * @returns σ² = E[(xs - µ)²] | µ = mean(xs)\n */\nexport function variance(...xs: bigint[]): bigint {\n if (xs.length===0) return 0n;\n const m = arithmeticMean(...xs); let a = 0n;\n for (const x of xs)\n a += (x-m)**2n;\n return a/BigInt(xs.length);\n}\n// - https://en.wikipedia.org/wiki/Variance\n\n\n\n\n// MEAN (STATISTICS)\n// -----------------\n\n/**\n * Find the arithmetic mean of bigints (µ).\n * @param xs bigints\n * @returns µ = (Σxᵢ)/n | n = size(xs)\n */\nexport function arithmeticMean(...xs: bigint[]): bigint {\n const n = BigInt(xs.length);\n return sum(...xs)/n;\n}\nexport {arithmeticMean as mean};\n\n\n/**\n * Find the geometric mean of bigints.\n * @param xs bigints\n * @returns ⁿ√(∏xᵢ) | n = size(xs)\n */\nexport function geometricMean(...xs: bigint[]): bigint | null {\n const n = BigInt(xs.length);\n return root(product(...xs), n);\n}\n\n\n/**\n * Find the harmonic mean of bigints.\n * @param xs bigints\n * @returns n/Σ(1/xᵢ) | n = size(xs)\n */\nexport function harmonicMean(...xs: bigint[]): bigint {\n const n = BigInt(xs.length);\n const p = product(...xs); let q = 0n;\n for (const x of xs)\n q += p/x;\n return n*p/q;\n}\n\n\n/**\n * Find the quadriatic mean of bigints.\n * @param xs bigints\n * @returns √(Σxᵢ²)/n | n = size(xs)\n */\nexport function quadriaticMean(...xs: bigint[]): bigint {\n const n = BigInt(xs.length);\n let a = 0n;\n for (const x of xs)\n a += x*x;\n return sqrt(a/n) as bigint;\n}\nexport {quadriaticMean as rootMeanSquare};\n\n\n/**\n * Find the cubic mean of bigints.\n * @param xs bigints\n * @returns ³√(Σxᵢ³)/n | n = size(xs)\n */\nexport function cubicMean(...xs: bigint[]): bigint | null {\n const n = BigInt(xs.length);\n let a = 0n;\n for (const x of xs)\n a += x**3n;\n return cbrt(a/n);\n}\n"],
5
- "mappings": "AAWO,SAASA,EAAGC,EAAU,CAC3B,OAAO,OAAOA,GAAI,QACpB,CAcO,SAASC,EAAQD,EAAWE,EAAS,CAC1C,OAAO,OAAOF,EAAEE,CAAA,CAClB,CAaO,SAASC,EAAIH,EAAS,CAC3B,OAAOA,EAAE,GAAI,CAACA,EAAIA,CACpB,CAQO,SAASI,EAAKJ,EAAS,CAC5B,OAAOA,EAAE,GAAI,CAAC,GAAMA,EAAE,GAAI,GAAK,EACjC,CAcO,SAASK,EAASL,EAAWE,EAAS,CAC3C,OAAIA,EAAE,KAAMF,EAAI,CAACA,EAAGE,EAAI,CAACA,GAClBF,GAAG,GAAIA,EAAEE,GAAKF,EAAEE,EAAE,IAAIA,CAC/B,CAUO,SAASI,EAAQN,EAAWE,EAAS,CAC1C,OAAIA,EAAE,KAAMF,EAAI,CAACA,EAAGE,EAAI,CAACA,GAClBF,GAAG,IAAKA,EAAEE,EAAE,IAAIA,EAAIF,EAAEE,CAC/B,CASO,SAASK,EAASP,EAAWE,EAAS,CAC3C,OAAIA,EAAE,KAAMF,EAAI,CAACA,EAAGE,EAAI,CAACA,GAClBF,GAAG,IAAKA,EAAEE,EAAE,IAAIA,GAAKF,EAAEE,EAAE,IAAIA,CACtC,CAcO,SAASM,EAAIR,EAAWE,EAAS,CACtC,OAAOF,EAAIE,CACb,CAUO,SAASO,EAAIT,EAAWE,EAAS,CACtC,OAAOF,EAAIE,EAAEG,EAASL,EAAGE,CAAA,CAC3B,CAUO,SAASQ,EAAKV,EAAWE,EAAS,CACvC,OAAOF,EAAIG,EAAID,CAAA,EAAGG,EAASL,EAAGG,EAAID,CAAA,CAAA,CACpC,CAgBO,SAASS,EAAUX,EAAWY,EAAcC,EAAY,CAC7D,OAAOC,EAAIC,EAAIf,EAAGY,CAAA,EAAOC,CAAA,CAC3B,CAuBO,SAASG,EAAMC,EAAWC,EAAWC,EAAWC,EAAWC,EAAS,CACzE,OAAOD,GAAKH,EAAIC,IAAIG,EAAID,IAAID,EAAID,EAClC,CAYO,SAASI,EAAKC,EAAWC,EAAWC,EAAS,CAClD,OAAOF,EAAI,OAAO,KAAK,MAAME,EAAE,OAAOD,EAAID,CAAA,CAAA,CAAA,CAC5C,CAgBO,SAASG,EAAOH,EAAS,CAC9B,MAAO,QAAQ,KAAKA,EAAE,SAAS,CAAA,CAAA,CACjC,CAQO,SAASI,EAAQJ,EAAS,CAC/B,MAAO,QAAQ,KAAKA,EAAE,SAAQ,CAAA,CAChC,CAQO,SAASK,EAASL,EAAS,CAChC,GAAIA,GAAG,GAAI,OAAO,GAClB,IAAMM,EAAIN,EAAE,SAAS,CAAA,EAAG,OACxB,OAAO,OAAO,MAAQ,IAAI,OAAOM,EAAE,CAAA,CAAA,CACrC,CAQO,SAASC,EAAUP,EAAS,CACjC,GAAIA,GAAG,GAAI,OAAO,GAClB,IAAMM,EAAIN,EAAE,SAAS,EAAA,EAAI,OACzB,OAAO,OAAO,IAAM,IAAI,OAAOM,EAAE,CAAA,CAAA,CACnC,CAQO,SAASE,EAASR,EAAS,CAChC,GAAIA,GAAG,GAAI,OAAO,GAClB,IAAMM,GAAKN,EAAE,IAAI,SAAS,CAAA,EAAG,OAC7B,OAAO,OAAO,MAAQ,IAAI,OAAOM,CAAA,CAAA,CACnC,CAQO,SAASG,EAAUT,EAAS,CACjC,GAAIA,GAAG,GAAI,OAAO,GAClB,IAAMM,GAAKN,EAAE,IAAI,SAAS,EAAA,EAAI,OAC9B,OAAO,OAAO,IAAM,IAAI,OAAOM,CAAA,CAAA,CACjC,CAQO,SAASI,EAAKV,EAAS,CAC5B,IAAMM,EAAIN,EAAE,SAAS,CAAA,EAAG,OAAS,EACjC,OAAOA,GAAG,GAAI,GAAK,OAAOM,CAAA,CAC5B,CAQO,SAASK,EAAMX,EAAS,CAC7B,IAAMM,EAAIN,EAAE,SAAQ,EAAG,OAAS,EAChC,OAAOA,GAAG,GAAI,GAAK,OAAOM,CAAA,CAC5B,CAmBO,SAASM,EAAKZ,EAAS,CAC5B,OAAIA,IAAI,GAAW,GACZA,EAAE,GAAIa,EAAQb,CAAA,EAAK,IAC5B,CAEA,SAASa,EAAQb,EAAS,CACxB,IAAIc,EAAI,IAAOJ,EAAKV,CAAA,EAAG,GAAK,GACxBe,EAAI,GAAKD,EACb,KAAOA,EAAEC,GACPA,EAAID,EACJA,GAAKC,EAAIf,EAAEe,GAAG,GAEhB,OAAOA,CACT,CAQO,SAASC,EAAKhB,EAAS,CAC5B,OAAOiB,EAAKjB,EAAG,EAAE,CACnB,CASO,SAASiB,EAAKjB,EAAWM,EAAU,GAAE,CAC1C,OAAIN,IAAI,GAAW,GACVA,EAAE,GAAWkB,EAAQlB,EAAGM,CAAA,EAC1BA,EAAI,KAAK,GAAK,CAACY,EAAQ,CAAClB,EAAGM,CAAA,EAAK,IACzC,CAEA,SAASY,EAAQlB,EAAWM,EAAS,CACnC,IAAIQ,EAAI,IAAOJ,EAAKV,CAAA,EAAGM,EAAI,GACvBS,EAAI,GAAKD,EAASK,EAAIb,EAAI,GAC9B,GAAIQ,IAAI,GAAI,OAAO,GACnB,KAAOA,EAAEC,GACPA,EAAID,EACJA,GAAKK,EAAEJ,EAAIf,EAAEe,GAAGI,GAAGb,EAErB,OAAOS,CACT,CAaO,SAASK,EAAepB,EAAS,CACtCA,EAAIqB,EAAIrB,CAAA,EAAI,IAAMc,EAAI,CAAA,EACtB,QAASQ,EAAE,GAAIA,EAAEtB,EAAGsB,IACdtB,EAAIsB,IAAI,IAAIR,EAAE,KAAKQ,CAAA,EACzB,OAAOR,CACT,CAWO,SAASS,EAAWC,EAAS,CAClCA,EAAIC,EAAID,CAAA,EAAI,IAAIE,EAAI,GACpB,QAASC,EAAE,GAAIA,EAAEH,EAAGG,IACdH,EAAIG,IAAI,KAAID,GAAKC,GACvB,OAAOD,CACT,CAQO,SAASE,EAAeJ,EAAS,CAGtC,GAFAA,EAAIC,EAAID,CAAA,EAEJA,GAAG,GAAI,OAAO,GAClB,GAAIA,GAAG,GAAI,OAAOA,EAElB,GAAIA,EAAI,KAAK,GAAI,OAAO,GACxB,GAAIA,EAAI,KAAK,GAAI,OAAO,GAExB,QAASG,EAAE,GAAIE,EAAGC,EAAKN,CAAA,EAAc,GAAIG,GAAGE,EAAGF,GAAG,GAAI,CACpD,GAAIH,GAAKG,EAAE,MAAM,GAAI,OAAOA,EAAE,GAC9B,GAAIH,GAAKG,EAAE,MAAM,GAAI,OAAOA,EAAE,EAChC,CACA,OAAOH,CACT,CAUO,SAASO,EAAeC,EAAS,CACtCA,EAAIC,EAAID,CAAA,EAAI,IAAIE,EAAI,GAEpB,GAAIF,GAAG,GAAI,OAAO,GAClB,GAAIA,GAAG,GAAI,OAAOA,EAElB,KAAOA,EAAI,KAAK,GAAIE,EAAE,GACpBF,GAAK,GACP,KAAOA,EAAI,KAAK,GAAIE,EAAE,GACpBF,GAAK,GAEP,QAASG,EAAE,GAAIC,EAAGC,EAAKL,CAAA,EAAc,GAAIA,EAAE,IAAMG,GAAGC,EAAGD,GAAG,GAAI,CAC5D,KAAOH,GAAKG,EAAE,KAAK,GAAID,EAAEC,EAAE,GACzBH,GAAKG,EAAE,GACT,KAAOH,GAAKG,EAAE,KAAK,GAAID,EAAEC,EAAE,GACzBH,GAAKG,EAAE,EACX,CACA,OAAIH,GAAG,GAAWE,EACXF,CACT,CAWO,SAASM,EAAaC,EAAS,CACpCA,EAAIC,EAAID,CAAA,EAAI,IAAME,EAAc,CAAA,EAChC,GAAIF,GAAG,GAAI,MAAO,CAAA,EAClB,GAAIA,GAAG,GAAI,MAAO,CAACA,GAEnBA,EAAIG,EAAmBD,EAAGF,EAAG,EAAE,EAC/BA,EAAIG,EAAmBD,EAAGF,EAAG,EAAE,EAE/B,QAASI,EAAE,GAAIC,EAAGC,EAAKN,CAAA,EAAc,GAAIA,EAAE,IAAMI,GAAGC,EAAGD,GAAG,GACxDJ,EAAIG,EAAmBD,EAAGF,EAAGI,EAAE,EAAE,EACjCJ,EAAIG,EAAmBD,EAAGF,EAAGI,EAAE,EAAE,EAEnC,OAAIJ,EAAE,IAAIE,EAAE,KAAKF,CAAA,EACVE,CACT,CAEA,SAASC,EAAmBD,EAAaF,EAAWO,EAAS,CAC3D,GAAIP,EAAIO,IAAI,GAAI,OAAOP,EACvB,GACEA,GAAKO,QACEP,EAAIO,IAAI,IACjB,OAAAL,EAAE,KAAKK,CAAA,EACAP,CACT,CAUO,SAASQ,EAAkBR,EAAS,CACzCA,EAAIC,EAAID,CAAA,EAAI,IAAME,EAAwB,CAAA,EAC1C,GAAIF,GAAG,GAAI,MAAO,CAAA,EAClB,GAAIA,GAAG,GAAI,MAAO,CAAC,CAACA,EAAG,KAEvBA,EAAIS,EAAwBP,EAAGF,EAAG,EAAE,EACpCA,EAAIS,EAAwBP,EAAGF,EAAG,EAAE,EAEpC,QAASI,EAAE,GAAIC,EAAGC,EAAKN,CAAA,EAAc,GAAIA,EAAE,IAAMI,GAAGC,EAAGD,GAAG,GACxDJ,EAAIS,EAAwBP,EAAGF,EAAGI,EAAE,EAAE,EACtCJ,EAAIS,EAAwBP,EAAGF,EAAGI,EAAE,EAAE,EAExC,OAAIJ,EAAE,IAAIE,EAAE,KAAK,CAACF,EAAG,GAAG,EACjBE,CACT,CAEA,SAASO,EAAwBP,EAAuBF,EAAWO,EAAS,CAC1E,GAAIP,EAAIO,IAAI,GAAI,OAAOP,EACvB,IAAI,EAAI,GACR,GACEA,GAAKO,EAAG,EAAE,QACHP,EAAIO,IAAI,IACjB,OAAAL,EAAE,KAAK,CAACK,EAAG,EAAE,EACNP,CACT,CAYO,SAASU,EAAQV,EAAS,CAC/B,OAAOA,IAAI,IAAMW,EAAeX,CAAA,IAAOC,EAAID,CAAA,CAC7C,CAQO,SAASY,KAAOC,EAAY,CACjC,IAAIX,EAAIW,EAAG,CAAA,GAAM,GACjB,QAAQT,EAAE,EAAGC,EAAEQ,EAAG,OAAQT,EAAEC,EAAGD,IAC7BF,EAAIY,EAAQZ,EAAGW,EAAGT,CAAA,CAAE,EACtB,OAAOF,CACT,CAIA,SAASa,EAAQC,EAAWC,EAAS,CACnC,KAAOA,IAAI,IAAI,CACb,IAAMC,EAAID,EACVA,EAAID,EAAIC,EACRD,EAAIE,CACN,CACA,OAAOF,CACT,CAUO,SAASG,KAAOC,EAAY,CACjC,IAAIC,EAAID,EAAG,CAAA,GAAM,GACjB,QAASE,EAAE,EAAGC,EAAEH,EAAG,OAAQE,EAAEC,EAAGD,IAC5BD,EAAIA,EAAED,EAAGE,CAAA,EAAKP,EAAQM,EAAGD,EAAGE,CAAA,CAAE,EAClC,OAAOD,CACT,CAeO,SAASG,EAAU,EAAWC,EAAU,GAAE,CAC/C,IAAIJ,EAAI,GACR,GAAI,EAAE,GAAI,OAAO,GACjB,QAASC,EAAEG,EAAE,GAAIH,GAAG,EAAGA,IACrBD,GAAKC,EACP,OAAOD,CACT,CAWO,SAASK,EAAS,EAAWD,EAAS,CAE3C,GAAIA,EAAE,IAAMA,EAAEE,EAAI,CAAA,EAAI,OAAO,GAC7B,GAAI,EAAE,GAAI,OAAS,CAAC,KAAKF,EAAGC,EAAS,CAAC,EAAGD,CAAA,EAEzCA,EAAIA,EAAE,EAAEA,EAAG,EAAEA,EAAEA,EACf,IAAIJ,EAAI,GAAIO,EAAI,GAChB,QAASN,EAAE,GAAIA,GAAGG,EAAGH,IAAK,IACxBD,GAAK,EACLO,GAAKN,EAEP,OAAOD,EAAEO,CACX,CAUO,SAASC,MAAeC,EAAY,CACzC,IAAIC,EAAIC,EAAA,GAAOF,CAAA,EAAKT,EAAI,GAAIO,EAAI,GAChC,QAASN,EAAE,EAAGW,EAAE,GAAIV,EAAEO,EAAG,OAAQR,EAAEC,GAC7BU,GAAG,GAAIA,EAAIH,EAAGR,GAAA,GACXD,GAAKU,IAAKH,GAAIK,KAEvB,OAAOZ,EAAEO,CACX,CAcO,SAASM,MAASd,EAAY,CACnC,IAAIC,EAAI,GACR,QAAWL,KAAKI,EACdC,GAAKL,EAAEA,EACT,OAAOmB,EAAKd,CAAA,CACd,CAaO,SAASW,KAAOZ,EAAY,CACjC,IAAIC,EAAI,GACR,QAAWL,KAAKI,EACdC,GAAKL,EACP,OAAOK,CACT,CAQO,SAASe,KAAWhB,EAAY,CACrC,IAAIC,EAAI,GACR,QAAWL,KAAKI,EACdC,GAAKL,EACP,OAAOK,CACT,CAQO,SAASgB,MAAUjB,EAAY,CACpC,GAAIA,EAAG,SAAS,EAAG,OAAO,GAC1BA,EAAG,KAAKkB,CAAA,EACR,IAAMhB,EAAIF,EAAG,QAAQ,EACrB,OAAKA,EAAG,OAAS,KAAK,EAAUA,EAAGE,CAAA,GAC3BF,EAAGE,EAAE,CAAA,EAAKF,EAAGE,CAAA,GAAI,EAC3B,CAUO,SAASiB,MAASnB,EAAY,CACnCA,EAAG,KAAKkB,CAAA,EACR,IAAME,EAAIC,EAAUrB,CAAA,EACpB,OAAOsB,EAAWtB,EAAIoB,CAAA,CACxB,CAIA,SAASC,EAAUrB,EAAY,CAC7B,IAAIuB,EAAQ,KAAK,IAAIvB,EAAG,OAAQ,CAAA,EAAIwB,EAAMD,EAC1C,QAASrB,EAAE,EAAGC,EAAEH,EAAG,OAAQE,EAAEC,EAAGD,IAC1BF,EAAGE,EAAE,CAAA,IAAKF,EAAGE,CAAA,EAAIqB,KACdC,EAAM,KAAK,IAAIA,EAAKD,CAAA,EAAQA,EAAQ,GAE7C,OAAO,KAAK,IAAIC,EAAKD,CAAA,CACvB,CAGA,SAASD,EAAWtB,EAAcoB,EAAS,CACzC,IAAMnB,EAAc,CAAA,EAAImB,IACxB,QAASlB,EAAE,EAAGC,EAAEH,EAAG,OAAOoB,EAAGlB,EAAEC,EAAGD,IAC5BF,EAAGE,CAAA,IAAKF,EAAGE,EAAEkB,CAAA,GAAInB,EAAE,KAAKD,EAAGE,GAAGkB,CAAA,CAAE,EACtC,OAAOnB,CACT,CAQO,SAASwB,KAAOzB,EAAY,CACjC,GAAIA,EAAG,SAAS,EAAG,OAAO,GAC1B,IAAIC,EAAID,EAAG,CAAA,EACX,QAAWJ,KAAKI,EACdC,EAAIL,EAAEK,EAAGL,EAAIK,EACf,OAAOA,CACT,CAQO,SAASuB,KAAOxB,EAAY,CACjC,GAAIA,EAAG,SAAS,EAAG,OAAO,GAC1B,IAAIC,EAAID,EAAG,CAAA,EACX,QAAWJ,KAAKI,EACdC,EAAIL,EAAEK,EAAGL,EAAIK,EACf,OAAOA,CACT,CAQO,SAASyB,MAAS1B,EAAY,CACnC,GAAIA,EAAG,SAAS,EAAG,MAAO,CAAC,GAAI,IAC/B,IAAIC,EAAID,EAAG,CAAA,EAAIQ,EAAIP,EACnB,QAAWL,KAAKI,EACdC,EAAIL,EAAEK,EAAGL,EAAIK,EACbO,EAAIZ,EAAEY,EAAGZ,EAAIY,EAEf,MAAO,CAACP,EAAGO,EACb,CAQO,SAASmB,MAAY3B,EAAY,CACtC,GAAIA,EAAG,SAAS,EAAG,OAAO,GAC1B,IAAM4B,EAAIC,EAAA,GAAkB7B,CAAA,EAASC,EAAI,GACzC,QAAWL,KAAKI,EACdC,IAAML,EAAEgC,IAAI,GACd,OAAO3B,EAAE,OAAOD,EAAG,MAAM,CAC3B,CAcO,SAAS6B,KAAkB7B,EAAY,CAC5C,IAAMW,EAAI,OAAOX,EAAG,MAAM,EAC1B,OAAOY,EAAA,GAAOZ,CAAA,EAAIW,CACpB,CASO,SAASmB,MAAiBC,EAAY,CAC3C,IAAMC,EAAI,OAAOD,EAAG,MAAM,EAC1B,OAAOE,EAAKC,EAAA,GAAWH,CAAA,EAAKC,CAAA,CAC9B,CAQO,SAASG,MAAgBJ,EAAY,CAC1C,IAAMC,EAAI,OAAOD,EAAG,MAAM,EACpBK,EAAIF,EAAA,GAAWH,CAAA,EAASM,EAAI,GAClC,QAAWC,KAAKP,EACdM,GAAKD,EAAEE,EACT,OAAON,EAAEI,EAAEC,CACb,CAQO,SAASE,MAAkBR,EAAY,CAC5C,IAAMC,EAAI,OAAOD,EAAG,MAAM,EACtBS,EAAI,GACR,QAAWF,KAAKP,EACdS,GAAKF,EAAEA,EACT,OAAOG,EAAKD,EAAER,CAAA,CAChB,CASO,SAASU,MAAaC,EAAY,CACvC,IAAMC,EAAI,OAAOD,EAAG,MAAM,EACtBE,EAAI,GACR,QAAWC,KAAKH,EACdE,GAAKC,GAAG,GACV,OAAOC,EAAKF,EAAED,CAAA,CAChB",
6
- "names": ["is", "x", "compare", "y", "abs", "sign", "floorDiv", "ceilDiv", "roundDiv", "rem", "mod", "modp", "constrain", "minv", "maxv", "min", "max", "remap", "x", "r", "R", "t", "T", "lerp", "x", "y", "t", "isPow2", "isPow10", "prevPow2", "n", "prevPow10", "nextPow2", "nextPow10", "log2", "log10", "sqrt", "sqrtPos", "a", "b", "cbrt", "root", "rootPos", "m", "properDivisors", "abs", "i", "aliquotSum", "x", "abs", "a", "i", "minPrimeFactor", "I", "sqrt", "maxPrimeFactor", "x", "abs", "a", "i", "I", "sqrt", "primeFactors", "x", "abs", "a", "pushPrimeFactorTo$", "i", "I", "sqrt", "f", "primeExponentials", "pushPrimeExponentialTo$", "isPrime", "minPrimeFactor", "gcd", "xs", "gcdPair", "gcdPair", "x", "y", "t", "lcm", "xs", "a", "i", "I", "factorial", "k", "binomial", "abs", "b", "multinomial", "ks", "n", "sum", "j", "hypot", "sqrt", "product", "median", "compare", "modes", "r", "maxRepeat", "getRepeats", "count", "max", "min", "range", "variance", "m", "arithmeticMean", "geometricMean", "xs", "n", "root", "product", "harmonicMean", "p", "q", "x", "quadriaticMean", "a", "sqrt", "cubicMean", "xs", "n", "a", "x", "cbrt"]
4
+ "sourcesContent": ["// METHODS\n// =======\n\n// ABOUT\n// -----\n\n/**\n * Check if value is a bigint.\n * @param x a value\n * @returns is bigint?\n */\nexport function is(x: unknown): x is bigint {\n return typeof x===\"bigint\";\n}\n\n\n\n\n// COMPARE\n// -------\n\n/**\n * Compare two bigints.\n * @param x a bigint\n * @param y another bigint\n * @returns x<y: -ve, x=y: 0, x>y: +ve\n */\nexport function compare(x: bigint, y: bigint): number {\n return Number(x-y);\n}\n\n\n\n\n// SIGN\n// ----\n\n/**\n * Get the absolute of a bigint.\n * @param x a bigint\n * @returns |x|\n */\nexport function abs(x: bigint): bigint {\n return x<0n? -x : x;\n}\n\n\n/**\n * Get the sign of a bigint.\n * @param x a bigint\n * @returns x>0: 1n, x<0: -1n, x=0: 0n\n */\nexport function sign(x: bigint): bigint {\n return x<0n? -1n : (x>0n? 1n : 0n);\n}\n\n\n\n\n// ROUNDED DIVISION\n// ----------------\n\n/**\n * Perform floor-divison of two bigints (\\\\).\n * @param x dividend\n * @param y divisor\n * @returns ⌊x/y⌋\n */\nexport function floorDiv(x: bigint, y: bigint): bigint {\n if (y<0n) { x = -x; y = -y; }\n return x>=0n? x/y : (x-y+1n)/y;\n}\n// - https://python-reference.readthedocs.io/en/latest/docs/operators/floor_division.html\n\n\n/**\n * Perform ceiling-divison of two bigints.\n * @param x dividend\n * @param y divisor\n * @returns ⌈x/y⌉\n */\nexport function ceilDiv(x: bigint, y: bigint): bigint {\n if (y<0n) { x = -x; y = -y; }\n return x>=0n? (x+y-1n)/y : x/y;\n}\n\n\n/**\n * Perform rounded-divison of two bigints.\n * @param x divisor\n * @param y dividend\n * @returns [x/y]\n */\nexport function roundDiv(x: bigint, y: bigint): bigint {\n if (y<0n) { x = -x; y = -y; }\n return x>=0n? (x+y/2n)/y : (x-y/2n)/y;\n}\n\n\n\n\n// MODULO\n// ------\n\n/**\n * Find the remainder of x/y with sign of x (truncated division).\n * @param x dividend\n * @param y divisor\n * @returns trunc(x % y)\n */\nexport function rem(x: bigint, y: bigint): bigint {\n return x % y;\n}\n// - https://en.wikipedia.org/wiki/Modulo_operation\n\n\n/**\n * Find the remainder of x/y with sign of y (floored division).\n * @param x dividend\n * @param y divisor\n * @returns floor(x % y)\n */\nexport function mod(x: bigint, y: bigint): bigint {\n return x - y*floorDiv(x, y);\n}\n// - https://en.wikipedia.org/wiki/Modulo_operation\n\n\n/**\n * Find the remainder of x/y with +ve sign (euclidean division).\n * @param x dividend\n * @param y divisor\n * @returns x/y>0: floor(x % y), x/y<0: ceil(x % y)\n */\nexport function modp(x: bigint, y: bigint): bigint {\n return x - abs(y)*floorDiv(x, abs(y));\n}\n// - https://en.wikipedia.org/wiki/Modulo_operation\n\n\n\n\n// RANGE CONTROL\n// -------------\n\n/**\n * Constrain a bigint within a minimum and a maximum value.\n * @param x a bigint\n * @param minv minimum value\n * @param maxv maximum value\n * @returns x<min: min, x>max: max, x\n */\nexport function constrain(x: bigint, minv: bigint, maxv: bigint): bigint {\n return min(max(x, minv), maxv);\n}\nexport {constrain as clamp};\n// - https://processing.org/reference/constrain_.html\n// - https://www.npmjs.com/package/clamp\n// - https://en.cppreference.com/w/cpp/algorithm/clamp\n// - https://dlang.org/library/std/algorithm/comparison/clamp.html\n// - https://www.rdocumentation.org/packages/raster/versions/3.0-12/topics/clamp\n// - https://docs.microsoft.com/en-us/dotnet/api/system.math.clamp?view=netcore-3.1\n// - https://docs.microsoft.com/en-us/windows/win32/direct3dhlsl/dx-graphics-hlsl-clamp\n// - https://www.khronos.org/registry/OpenGL-Refpages/gl4/html/clamp.xhtml\n// - https://docs.unity3d.com/ScriptReference/Mathf.Clamp.html\n// - https://en.wikipedia.org/wiki/Clamping_(graphics)\n\n\n/**\n * Re-map a bigint from one range to another.\n * @param x a bigint\n * @param r lower bound of current range\n * @param R upper bound of current range\n * @param t lower bound of target range\n * @param T upper bound of target range\n * @returns ∈ [ymin, ymax]\n */\nexport function remap(x: bigint, r: bigint, R: bigint, t: bigint, T: bigint): bigint {\n return t + (x - r)*(T - t)/(R - r);\n}\nexport {remap as map};\n// - https://processing.org/reference/map_.html\n\n\n/**\n * Linearly interpolate a bigint between two bigints.\n * @param x start bigint\n * @param y stop bigint\n * @param t interpolant ∈ [0, 1]\n * @returns ∈ [x, y]\n */\nexport function lerp(x: bigint, y: bigint, t: number): bigint {\n return x + BigInt(Math.floor(t*Number(y - x)));\n}\n// - https://processing.org/reference/lerp_.html\n// - https://docs.unity3d.com/ScriptReference/Vector3.Lerp.html\n// - https://stackoverflow.com/questions/53970655/how-to-convert-bigint-to-number-in-javascript\n\n\n\n\n// POWER / LOGARITHM\n// -----------------\n\n/**\n * Check if bigint is a power-of-2.\n * @param x a bigint\n * @returns 2ⁱ = x? | i = +ve integer\n */\nexport function isPow2(x: bigint): boolean {\n return /^10*$/.test(x.toString(2));\n}\n\n\n/**\n * Check if bigint is a power-of-10.\n * @param x a bigint\n * @returns 10ⁱ = x? | i = +ve integer\n */\nexport function isPow10(x: bigint): boolean {\n return /^10*$/.test(x.toString());\n}\n\n\n/**\n * Find largest power-of-2 less than or equal to given bigint.\n * @param x a bigint\n * @returns 2ⁱ | 2ⁱ ≤ x and 2ⁱ > x/2\n */\nexport function prevPow2(x: bigint): bigint {\n if (x < 1n) return 0n;\n const n = x.toString(2).length;\n return BigInt(\"0b1\" + \"0\".repeat(n - 1));\n}\n\n\n/**\n * Find largest power-of-10 less than or equal to given bigint.\n * @param x a bigint\n * @returns 10ⁱ | 10ⁱ ≤ x and 10ⁱ > x/10\n */\nexport function prevPow10(x: bigint): bigint {\n if (x < 1n) return 0n;\n const n = x.toString(10).length;\n return BigInt(\"1\" + \"0\".repeat(n - 1));\n}\n\n\n/**\n * Find smallest power-of-2 greater than or equal to given bigint.\n * @param x a bigint\n * @returns 2ⁱ | 2ⁱ ≥ x and 2ⁱ < 2x\n */\nexport function nextPow2(x: bigint): bigint {\n if (x <= 1n) return 1n;\n const n = (x - 1n).toString(2).length;\n return BigInt(\"0b1\" + \"0\".repeat(n));\n}\n\n\n/**\n * Find smallest power-of-10 greater than or equal to given bigint.\n * @param x a bigint\n * @returns 10ⁱ | 10ⁱ ≥ x and 10ⁱ < 10x\n */\nexport function nextPow10(x: bigint): bigint {\n if (x <= 1n) return 1n;\n const n = (x - 1n).toString(10).length;\n return BigInt(\"1\" + \"0\".repeat(n));\n}\n\n\n/**\n * Find the base-2 logarithm of a bigint.\n * @param x a bigint\n * @returns log₂(x)\n */\nexport function log2(x: bigint): bigint {\n const n = x.toString(2).length - 1;\n return x<=0n? 0n : BigInt(n);\n}\n\n\n/**\n * Find the base-10 logarithm of a bigint.\n * @param x a bigint\n * @returns log₁₀(x)\n */\nexport function log10(x: bigint): bigint {\n const n = x.toString().length - 1;\n return x<=0n? 0n : BigInt(n);\n}\n\n\n// TODO: isPow() based on accelerated search\n// TODO: prevPow() based on accelerated search\n// TODO: nextPow() based on accelerated search\n// TODO: log() based on accelerated search\n\n\n\n\n// ROOT\n// ----\n\n/**\n * Find the square root of a bigint.\n * @param x a bigint\n * @returns √x\n */\nexport function sqrt(x: bigint): bigint | null {\n if (x===0n) return 0n;\n return x>0n? sqrtPos(x) : null;\n}\n\nfunction sqrtPos(x: bigint): bigint {\n let a = 1n << (log2(x)/2n + 1n); // initial guess\n let b = 1n + a;\n while (a<b) {\n b = a;\n a = (b + x/b)/2n;\n }\n return b;\n}\n\n\n/**\n * Find the cube root of a bigint.\n * @param x a bigint\n * @returns ³√x\n */\nexport function cbrt(x: bigint): bigint | null {\n return root(x, 3n);\n}\n\n\n/**\n * Find the nth root of a bigint.\n * @param x a bigint\n * @param n nth root (1n)\n * @returns ⁿ√x\n */\nexport function root(x: bigint, n: bigint=1n): bigint | null {\n if (x===0n) return 0n;\n else if (x>0n) return rootPos(x, n);\n return n % 2n!==0n? -rootPos(-x, n) : null;\n}\n\nfunction rootPos(x: bigint, n: bigint): bigint {\n let a = 1n << (log2(x)/n + 1n); // initial guess\n let b = 1n + a; const m = n - 1n;\n if (a===2n) return 1n;\n while (a<b) {\n b = a;\n a = (m*b + x/b**m)/n;\n }\n return b;\n}\n\n\n\n\n// DIVISORS\n// --------\n\n/**\n * List all divisors of a bigint, except itself.\n * @param x a bigint\n * @returns proper divisors (factors)\n */\nexport function properDivisors(x: bigint): bigint[] {\n x = abs(x); const a = [];\n for (let i=1n; i<x; i++)\n if (x % i===0n) a.push(i);\n return a;\n}\nexport {properDivisors as aliquotParts};\n// - https://mathworld.wolfram.com/ProperDivisor.html\n// - https://en.wikipedia.org/wiki/Divisor#Further_notions_and_facts\n\n\n/**\n * Sum all proper divisors of a bigint.\n * @param x a bigint\n * @returns Σdᵢ | dᵢ is a divisor of x and ≠x\n */\nexport function aliquotSum(x: bigint): bigint {\n x = abs(x); let a = 0n;\n for (let i=1n; i<x; i++)\n if (x % i===0n) a += i;\n return a;\n}\n\n\n/**\n * Find the least prime number which divides a bigint.\n * @param x a bigint\n * @returns least prime factor\n */\nexport function minPrimeFactor(x: bigint): bigint {\n x = abs(x);\n // 1. LPF of 2, 3 is the number itself.\n if (x<=1n) return 0n;\n if (x<=3n) return x;\n // 2. LPF for multiples of 2, 3.\n if (x % 2n===0n) return 2n;\n if (x % 3n===0n) return 3n;\n // 3. LPF can be 6k-1 or 6k+1.\n for (let i=6n, I=(sqrt(x) as bigint)+1n; i<=I; i+=6n) {\n if (x % (i-1n)===0n) return i-1n;\n if (x % (i+1n)===0n) return i+1n;\n }\n return x;\n}\nexport {minPrimeFactor as leastPrimeFactor};\n// - https://mathworld.wolfram.com/LeastPrimeFactor.html\n\n\n/**\n * Find the greatest prime number which divides a bigint.\n * @param x a bigint\n * @returns greatest prime factor\n */\nexport function maxPrimeFactor(x: bigint): bigint {\n x = abs(x); let a = 0n;\n // 1. GPF of 2, 3 is the number itself.\n if (x<=1n) return 0n;\n if (x<=3n) return x;\n // 2. Remove factors 2, 3.\n for (; x % 2n===0n; a=2n)\n x /= 2n;\n for (; x % 3n===0n; a=3n)\n x /= 3n;\n // 3. Remove factors 6k-1, 6k+1.\n for (let i=6n, I=(sqrt(x) as bigint)+1n; x>1n && i<=I; i+=6n) {\n for (; x % (i-1n)==0n; a=i-1n)\n x /= i-1n;\n for (; x % (i+1n)==0n; a=i+1n)\n x /= i+1n;\n }\n if (x<=1n) return a;\n return x;\n}\nexport {maxPrimeFactor as greatestPrimeFactor};\n// - https://mathworld.wolfram.com/GreatestPrimeFactor.html\n// - https://www.geeksforgeeks.org/find-largest-prime-factor-number/\n\n\n/**\n * Find the prime factors of a bigint.\n * @param x a bigint\n * @returns [f₀, f₁, ...] | fᵢ divides x and is prime\n */\nexport function primeFactors(x: bigint): bigint[] {\n x = abs(x); const a: bigint[] = [];\n if (x<=1n) return [];\n if (x<=3n) return [x];\n // 2. Try factors 2, 3.\n x = pushPrimeFactorTo$(a, x, 2n);\n x = pushPrimeFactorTo$(a, x, 3n);\n // 3. Try factors 6k-1, 6k+1.\n for (let i=6n, I=(sqrt(x) as bigint)+1n; x>1n && i<=I; i+=6n) {\n x = pushPrimeFactorTo$(a, x, i-1n);\n x = pushPrimeFactorTo$(a, x, i+1n);\n }\n if (x>1n) a.push(x);\n return a;\n}\n\nfunction pushPrimeFactorTo$(a: bigint[], x: bigint, f: bigint): bigint {\n if (x % f!==0n) return x;\n do {\n x /= f;\n } while (x % f===0n);\n a.push(f);\n return x;\n}\n// - https://www.geeksforgeeks.org/prime-factors-big-number/\n// - https://mathworld.wolfram.com/PrimeFactor.html\n\n\n/**\n * Find the prime factors and respective exponents of a bigint.\n * @param x a bigint\n * @returns [[f₀, e₀], [f₁, e₁], ...] | fᵢ is a prime factor of x and eᵢ is its exponent\n */\nexport function primeExponentials(x: bigint): [bigint, bigint][] {\n x = abs(x); const a: [bigint, bigint][] = [];\n if (x<=1n) return [];\n if (x<=3n) return [[x, 1n]];\n // 2. Try factors 2, 3.\n x = pushPrimeExponentialTo$(a, x, 2n);\n x = pushPrimeExponentialTo$(a, x, 3n);\n // 3. Try factors 6k-1, 6k+1.\n for (let i=6n, I=(sqrt(x) as bigint)+1n; x>1n && i<=I; i+=6n) {\n x = pushPrimeExponentialTo$(a, x, i-1n);\n x = pushPrimeExponentialTo$(a, x, i+1n);\n }\n if (x>1n) a.push([x, 1n]);\n return a;\n}\n\nfunction pushPrimeExponentialTo$(a: [bigint, bigint][], x: bigint, f: bigint): bigint {\n if (x % f!==0n) return x;\n let e = 0n;\n do {\n x /= f; ++e;\n } while (x % f===0n);\n a.push([f, e]);\n return x;\n}\n// - https://www.geeksforgeeks.org/prime-factors-big-number/\n// - https://reference.wolfram.com/language/ref/FactorInteger.html\n// - https://mathworld.wolfram.com/PrimeFactorization.html\n// - https://mathworld.wolfram.com/PrimeFactor.html\n\n\n/**\n * Check if bigint is prime.\n * @param x a bigint\n * @returns is divisible by 1n and itself only?\n */\nexport function isPrime(x: bigint): boolean {\n return x!==0n && minPrimeFactor(x) === abs(x);\n}\n\n\n/**\n * Find the greatest common divisor of bigints.\n * @param xs a list of bigints\n * @returns gcd(x₁, x₂, ...)\n */\nexport function gcd(...xs: bigint[]): bigint {\n let a = xs.length? abs(xs[0]) : 1n;\n for (let i = 1, I = xs.length; i < I; i++)\n a = gcdPair(a, xs[i]);\n return a;\n}\nexport {gcd as hcf};\n\n// Find the greatest common divisor of a pair of bigints.\nfunction gcdPair(x: bigint, y: bigint): bigint {\n x = abs(x);\n y = abs(y);\n while (y !== 0n) {\n const t = y;\n y = x % y;\n x = t;\n }\n return x;\n}\n// - https://lemire.me/blog/2013/12/26/fastest-way-to-compute-the-greatest-common-divisor/\n// - https://en.wikipedia.org/wiki/Euclidean_algorithm\n\n\n/**\n * Find the least common multiple of bigints.\n * @param xs a list of bigints\n * @returns lcm(x₁, x₂, ...)\n */\nexport function lcm(...xs: bigint[]): bigint {\n let a = xs.length? abs(xs[0]) : 1n;\n for (let i = 1, I = xs.length; i < I; i++) {\n if (a === 0n || xs[i] === 0n) return 0n;\n a = abs(a * xs[i]) / gcdPair(a, xs[i]);\n }\n return a;\n}\n// - https://en.wikipedia.org/wiki/Least_common_multiple\n\n\n\n\n// ARRANGEMENTS\n// ------------\n\n/**\n * Find the factorial of a bigint.\n * @param n a bigint\n * @param k denominator factorial [0]\n * @returns P(n, k); k=0: n!, k>0: n!/k!\n */\nexport function factorial(n: bigint, k: bigint=0n): bigint {\n let a = 1n;\n if (n<0n) return 0n;\n for (let i=k+1n; i<=n; i++)\n a *= i;\n return a;\n}\n// - https://github.com/alawatthe/MathLib/blob/master/src/Functn/functions/factorial.ts\n// - https://en.wikipedia.org/wiki/Permutation\n\n\n/**\n * Find the number of ways to choose k elements from a set of n elements.\n * @param n elements in source set\n * @param k elements in choose set\n * @returns C(n, k)\n */\nexport function binomial(n: bigint, k: bigint): bigint {\n if (k < 0n) return 0n;\n // Negative-integer generalization:\n // C(n, k) = (-1)^k * C(-n + k - 1, k)\n if (n < 0n) {\n const sign = k % 2n === 0n? 1n : -1n;\n return sign * binomial(k - n - 1n, k);\n }\n if (k > n) return 0n;\n // Take advantage of symmetry\n k = k > n - k? n - k : k;\n let a = 1n;\n let b = 1n;\n for (let i = 1n; i <= k; i++, n--) {\n a *= n;\n b *= i;\n }\n return a / b;\n}\n// - https://github.com/alawatthe/MathLib/blob/master/src/Functn/functions/binomial.ts\n// - https://en.wikipedia.org/wiki/Binomial_coefficient\n\n\n/**\n * Find the number of ways to put n objects in m bins (n=sum(kᵢ)).\n * @param ks objects per bin (kᵢ)\n * @returns n!/(k₁!k₂!...) | n=sum(kᵢ)\n */\nexport function multinomial(...ks: bigint[]): bigint {\n let n = sum(...ks), a = 1n, b = 1n;\n for (let i=0, j=0n, I=ks.length; i<I;) {\n if (j<=0n) j = ks[i++];\n else { a *= n--; b*= j--; }\n }\n return a/b;\n}\n// - https://en.wikipedia.org/wiki/Multinomial_distribution\n\n\n\n\n// GEOMETRY\n// --------\n\n/**\n * Find the length of hypotenuse.\n * @param xs lengths of perpendicular sides (x, y, z, ...)\n * @returns √(x² + y² + z²)\n */\nexport function hypot(...xs: bigint[]): bigint {\n let a = 0n;\n for (const x of xs)\n a += x*x;\n return sqrt(a) as bigint;\n}\n\n\n\n\n// STATISTICS\n// ----------\n\n/**\n * Find the sum of bigints (Σ).\n * @param xs bigints\n * @returns Σxᵢ\n */\nexport function sum(...xs: bigint[]): bigint {\n let a = 0n;\n for (const x of xs)\n a += x;\n return a;\n}\n\n\n/**\n * Find the product of bigints (∏).\n * @param xs bigints\n * @returns ∏xᵢ\n */\nexport function product(...xs: bigint[]): bigint {\n let a = 1n;\n for (const x of xs)\n a *= x;\n return a;\n}\n\n\n/**\n * Find the value separating the higher and lower halves of bigints.\n * @param xs a list of bigints\n * @returns xₘ | sort(xs) = [..., xₘ, ...]\n */\nexport function median(...xs: bigint[]): bigint {\n if (xs.length===0) return 0n;\n xs.sort(compare);\n const i = xs.length>>1;\n if ((xs.length & 1)===1) return xs[i];\n return (xs[i-1] + xs[i])/2n;\n}\n// - https://stackoverflow.com/questions/45309447/calculating-median-javascript\n// - https://en.wikipedia.org/wiki/Median\n\n\n/**\n * Find the values that appear most often.\n * @param xs a list of bigints\n * @returns [xₘ₁, xₘ₂, ...] | count(xₘᵢ) ≥ count(xᵢ) ∀ xᵢ ∈ xs\n */\nexport function modes(...xs: bigint[]): bigint[] {\n xs.sort(compare);\n const r = maxRepeat(xs);\n return getRepeats(xs, r);\n}\n// - https://en.wikipedia.org/wiki/Mode_(statistics)\n\n// Get the maximum number of times any bigint has repeated in a sorted array.\nfunction maxRepeat(xs: bigint[]): number {\n let count = Math.min(xs.length, 1), max = count;\n for (let i=1, I=xs.length; i<I; i++) {\n if (xs[i-1]===xs[i]) count++;\n else { max = Math.max(max, count); count = 1; }\n }\n return Math.max(max, count);\n}\n\n// Get the numbers which have been repeated atleast given number of times.\nfunction getRepeats(xs: bigint[], r: number): bigint[] {\n const a: bigint[] = []; r--;\n for (let i=0, I=xs.length-r; i<I; i++)\n if (xs[i]===xs[i+r]) a.push(xs[i+=r]);\n return a;\n}\n\n\n/**\n * Find the smallest bigint.\n * @param xs bigints\n * @returns min(xs)\n */\nexport function min(...xs: bigint[]): bigint {\n if (xs.length===0) return 0n;\n let a = xs[0];\n for (const x of xs)\n a = x<a? x : a;\n return a;\n}\n\n\n/**\n * Find the largest bigint.\n * @param xs bigints\n * @returns max(xs)\n */\nexport function max(...xs: bigint[]): bigint {\n if (xs.length===0) return 0n;\n let a = xs[0];\n for (const x of xs)\n a = x>a? x : a;\n return a;\n}\n\n\n/**\n * Find the minimum and maximum bigint.\n * @param xs bigints\n * @returns [min, max]\n */\nexport function range(...xs: bigint[]): [bigint, bigint] {\n if (xs.length===0) return [0n, 0n];\n let a = xs[0], b = a;\n for (const x of xs) {\n a = x<a? x : a;\n b = x>b? x : b;\n }\n return [a, b];\n}\n\n\n/**\n * Find the mean of squared deviation of bigints from its mean.\n * @param xs a list of bigints\n * @returns σ² = E[(xs - µ)²] | µ = mean(xs)\n */\nexport function variance(...xs: bigint[]): bigint {\n if (xs.length===0) return 0n;\n const m = arithmeticMean(...xs); let a = 0n;\n for (const x of xs)\n a += (x-m)**2n;\n return a/BigInt(xs.length);\n}\n// - https://en.wikipedia.org/wiki/Variance\n\n\n\n\n// MEAN (STATISTICS)\n// -----------------\n\n/**\n * Find the arithmetic mean of bigints (µ).\n * @param xs bigints\n * @returns µ = (Σxᵢ)/n | n = size(xs)\n */\nexport function arithmeticMean(...xs: bigint[]): bigint {\n const n = BigInt(xs.length);\n return sum(...xs)/n;\n}\nexport {arithmeticMean as mean};\n\n\n/**\n * Find the geometric mean of bigints.\n * @param xs bigints\n * @returns ⁿ√(∏xᵢ) | n = size(xs)\n */\nexport function geometricMean(...xs: bigint[]): bigint | null {\n const n = BigInt(xs.length);\n return root(product(...xs), n);\n}\n\n\n/**\n * Find the harmonic mean of bigints.\n * @param xs bigints\n * @returns n/Σ(1/xᵢ) | n = size(xs)\n */\nexport function harmonicMean(...xs: bigint[]): bigint {\n const n = BigInt(xs.length);\n const p = product(...xs); let q = 0n;\n for (const x of xs)\n q += p/x;\n return n*p/q;\n}\n\n\n/**\n * Find the quadriatic mean of bigints.\n * @param xs bigints\n * @returns √(Σxᵢ²)/n | n = size(xs)\n */\nexport function quadriaticMean(...xs: bigint[]): bigint {\n const n = BigInt(xs.length);\n let a = 0n;\n for (const x of xs)\n a += x*x;\n return sqrt(a/n) as bigint;\n}\nexport {quadriaticMean as rootMeanSquare};\n\n\n/**\n * Find the cubic mean of bigints.\n * @param xs bigints\n * @returns ³√(Σxᵢ³)/n | n = size(xs)\n */\nexport function cubicMean(...xs: bigint[]): bigint | null {\n const n = BigInt(xs.length);\n let a = 0n;\n for (const x of xs)\n a += x**3n;\n return cbrt(a/n);\n}\n"],
5
+ "mappings": "AAWO,SAASA,EAAGC,EAAU,CAC3B,OAAO,OAAOA,GAAI,QACpB,CAcO,SAASC,EAAQD,EAAWE,EAAS,CAC1C,OAAO,OAAOF,EAAEE,CAAA,CAClB,CAaO,SAASC,EAAIH,EAAS,CAC3B,OAAOA,EAAE,GAAI,CAACA,EAAIA,CACpB,CAQO,SAASI,EAAKJ,EAAS,CAC5B,OAAOA,EAAE,GAAI,CAAC,GAAMA,EAAE,GAAI,GAAK,EACjC,CAcO,SAASK,EAASL,EAAWE,EAAS,CAC3C,OAAIA,EAAE,KAAMF,EAAI,CAACA,EAAGE,EAAI,CAACA,GAClBF,GAAG,GAAIA,EAAEE,GAAKF,EAAEE,EAAE,IAAIA,CAC/B,CAUO,SAASI,EAAQN,EAAWE,EAAS,CAC1C,OAAIA,EAAE,KAAMF,EAAI,CAACA,EAAGE,EAAI,CAACA,GAClBF,GAAG,IAAKA,EAAEE,EAAE,IAAIA,EAAIF,EAAEE,CAC/B,CASO,SAASK,EAASP,EAAWE,EAAS,CAC3C,OAAIA,EAAE,KAAMF,EAAI,CAACA,EAAGE,EAAI,CAACA,GAClBF,GAAG,IAAKA,EAAEE,EAAE,IAAIA,GAAKF,EAAEE,EAAE,IAAIA,CACtC,CAcO,SAASM,EAAIR,EAAWE,EAAS,CACtC,OAAOF,EAAIE,CACb,CAUO,SAASO,EAAIT,EAAWE,EAAS,CACtC,OAAOF,EAAIE,EAAEG,EAASL,EAAGE,CAAA,CAC3B,CAUO,SAASQ,EAAKV,EAAWE,EAAS,CACvC,OAAOF,EAAIG,EAAID,CAAA,EAAGG,EAASL,EAAGG,EAAID,CAAA,CAAA,CACpC,CAgBO,SAASS,EAAUX,EAAWY,EAAcC,EAAY,CAC7D,OAAOC,EAAIC,EAAIf,EAAGY,CAAA,EAAOC,CAAA,CAC3B,CAuBO,SAASG,EAAMC,EAAWC,EAAWC,EAAWC,EAAWC,EAAS,CACzE,OAAOD,GAAKH,EAAIC,IAAIG,EAAID,IAAID,EAAID,EAClC,CAYO,SAASI,EAAKC,EAAWC,EAAWC,EAAS,CAClD,OAAOF,EAAI,OAAO,KAAK,MAAME,EAAE,OAAOD,EAAID,CAAA,CAAA,CAAA,CAC5C,CAgBO,SAASG,EAAOH,EAAS,CAC9B,MAAO,QAAQ,KAAKA,EAAE,SAAS,CAAA,CAAA,CACjC,CAQO,SAASI,EAAQJ,EAAS,CAC/B,MAAO,QAAQ,KAAKA,EAAE,SAAQ,CAAA,CAChC,CAQO,SAASK,EAASL,EAAS,CAChC,GAAIA,EAAI,GAAI,OAAO,GACnB,IAAMM,EAAIN,EAAE,SAAS,CAAA,EAAG,OACxB,OAAO,OAAO,MAAQ,IAAI,OAAOM,EAAI,CAAA,CAAA,CACvC,CAQO,SAASC,EAAUP,EAAS,CACjC,GAAIA,EAAI,GAAI,OAAO,GACnB,IAAMM,EAAIN,EAAE,SAAS,EAAA,EAAI,OACzB,OAAO,OAAO,IAAM,IAAI,OAAOM,EAAI,CAAA,CAAA,CACrC,CAQO,SAASE,EAASR,EAAS,CAChC,GAAIA,GAAK,GAAI,OAAO,GACpB,IAAMM,GAAKN,EAAI,IAAI,SAAS,CAAA,EAAG,OAC/B,OAAO,OAAO,MAAQ,IAAI,OAAOM,CAAA,CAAA,CACnC,CAQO,SAASG,EAAUT,EAAS,CACjC,GAAIA,GAAK,GAAI,OAAO,GACpB,IAAMM,GAAKN,EAAI,IAAI,SAAS,EAAA,EAAI,OAChC,OAAO,OAAO,IAAM,IAAI,OAAOM,CAAA,CAAA,CACjC,CAQO,SAASI,EAAKV,EAAS,CAC5B,IAAMM,EAAIN,EAAE,SAAS,CAAA,EAAG,OAAS,EACjC,OAAOA,GAAG,GAAI,GAAK,OAAOM,CAAA,CAC5B,CAQO,SAASK,EAAMX,EAAS,CAC7B,IAAMM,EAAIN,EAAE,SAAQ,EAAG,OAAS,EAChC,OAAOA,GAAG,GAAI,GAAK,OAAOM,CAAA,CAC5B,CAmBO,SAASM,EAAKZ,EAAS,CAC5B,OAAIA,IAAI,GAAW,GACZA,EAAE,GAAIa,EAAQb,CAAA,EAAK,IAC5B,CAEA,SAASa,EAAQb,EAAS,CACxB,IAAIc,EAAI,IAAOJ,EAAKV,CAAA,EAAG,GAAK,GACxBe,EAAI,GAAKD,EACb,KAAOA,EAAEC,GACPA,EAAID,EACJA,GAAKC,EAAIf,EAAEe,GAAG,GAEhB,OAAOA,CACT,CAQO,SAASC,EAAKhB,EAAS,CAC5B,OAAOiB,EAAKjB,EAAG,EAAE,CACnB,CASO,SAASiB,EAAKjB,EAAWM,EAAU,GAAE,CAC1C,OAAIN,IAAI,GAAW,GACVA,EAAE,GAAWkB,EAAQlB,EAAGM,CAAA,EAC1BA,EAAI,KAAK,GAAK,CAACY,EAAQ,CAAClB,EAAGM,CAAA,EAAK,IACzC,CAEA,SAASY,EAAQlB,EAAWM,EAAS,CACnC,IAAIQ,EAAI,IAAOJ,EAAKV,CAAA,EAAGM,EAAI,GACvBS,EAAI,GAAKD,EAASK,EAAIb,EAAI,GAC9B,GAAIQ,IAAI,GAAI,OAAO,GACnB,KAAOA,EAAEC,GACPA,EAAID,EACJA,GAAKK,EAAEJ,EAAIf,EAAEe,GAAGI,GAAGb,EAErB,OAAOS,CACT,CAaO,SAASK,EAAepB,EAAS,CACtCA,EAAIqB,EAAIrB,CAAA,EAAI,IAAMc,EAAI,CAAA,EACtB,QAASQ,EAAE,GAAIA,EAAEtB,EAAGsB,IACdtB,EAAIsB,IAAI,IAAIR,EAAE,KAAKQ,CAAA,EACzB,OAAOR,CACT,CAWO,SAASS,EAAWC,EAAS,CAClCA,EAAIC,EAAID,CAAA,EAAI,IAAIE,EAAI,GACpB,QAASC,EAAE,GAAIA,EAAEH,EAAGG,IACdH,EAAIG,IAAI,KAAID,GAAKC,GACvB,OAAOD,CACT,CAQO,SAASE,EAAeJ,EAAS,CAGtC,GAFAA,EAAIC,EAAID,CAAA,EAEJA,GAAG,GAAI,OAAO,GAClB,GAAIA,GAAG,GAAI,OAAOA,EAElB,GAAIA,EAAI,KAAK,GAAI,OAAO,GACxB,GAAIA,EAAI,KAAK,GAAI,OAAO,GAExB,QAASG,EAAE,GAAIE,EAAGC,EAAKN,CAAA,EAAc,GAAIG,GAAGE,EAAGF,GAAG,GAAI,CACpD,GAAIH,GAAKG,EAAE,MAAM,GAAI,OAAOA,EAAE,GAC9B,GAAIH,GAAKG,EAAE,MAAM,GAAI,OAAOA,EAAE,EAChC,CACA,OAAOH,CACT,CAUO,SAASO,EAAeC,EAAS,CACtCA,EAAIC,EAAID,CAAA,EAAI,IAAIE,EAAI,GAEpB,GAAIF,GAAG,GAAI,OAAO,GAClB,GAAIA,GAAG,GAAI,OAAOA,EAElB,KAAOA,EAAI,KAAK,GAAIE,EAAE,GACpBF,GAAK,GACP,KAAOA,EAAI,KAAK,GAAIE,EAAE,GACpBF,GAAK,GAEP,QAASG,EAAE,GAAIC,EAAGC,EAAKL,CAAA,EAAc,GAAIA,EAAE,IAAMG,GAAGC,EAAGD,GAAG,GAAI,CAC5D,KAAOH,GAAKG,EAAE,KAAK,GAAID,EAAEC,EAAE,GACzBH,GAAKG,EAAE,GACT,KAAOH,GAAKG,EAAE,KAAK,GAAID,EAAEC,EAAE,GACzBH,GAAKG,EAAE,EACX,CACA,OAAIH,GAAG,GAAWE,EACXF,CACT,CAWO,SAASM,EAAaC,EAAS,CACpCA,EAAIC,EAAID,CAAA,EAAI,IAAME,EAAc,CAAA,EAChC,GAAIF,GAAG,GAAI,MAAO,CAAA,EAClB,GAAIA,GAAG,GAAI,MAAO,CAACA,GAEnBA,EAAIG,EAAmBD,EAAGF,EAAG,EAAE,EAC/BA,EAAIG,EAAmBD,EAAGF,EAAG,EAAE,EAE/B,QAASI,EAAE,GAAIC,EAAGC,EAAKN,CAAA,EAAc,GAAIA,EAAE,IAAMI,GAAGC,EAAGD,GAAG,GACxDJ,EAAIG,EAAmBD,EAAGF,EAAGI,EAAE,EAAE,EACjCJ,EAAIG,EAAmBD,EAAGF,EAAGI,EAAE,EAAE,EAEnC,OAAIJ,EAAE,IAAIE,EAAE,KAAKF,CAAA,EACVE,CACT,CAEA,SAASC,EAAmBD,EAAaF,EAAWO,EAAS,CAC3D,GAAIP,EAAIO,IAAI,GAAI,OAAOP,EACvB,GACEA,GAAKO,QACEP,EAAIO,IAAI,IACjB,OAAAL,EAAE,KAAKK,CAAA,EACAP,CACT,CAUO,SAASQ,EAAkBR,EAAS,CACzCA,EAAIC,EAAID,CAAA,EAAI,IAAME,EAAwB,CAAA,EAC1C,GAAIF,GAAG,GAAI,MAAO,CAAA,EAClB,GAAIA,GAAG,GAAI,MAAO,CAAC,CAACA,EAAG,KAEvBA,EAAIS,EAAwBP,EAAGF,EAAG,EAAE,EACpCA,EAAIS,EAAwBP,EAAGF,EAAG,EAAE,EAEpC,QAASI,EAAE,GAAIC,EAAGC,EAAKN,CAAA,EAAc,GAAIA,EAAE,IAAMI,GAAGC,EAAGD,GAAG,GACxDJ,EAAIS,EAAwBP,EAAGF,EAAGI,EAAE,EAAE,EACtCJ,EAAIS,EAAwBP,EAAGF,EAAGI,EAAE,EAAE,EAExC,OAAIJ,EAAE,IAAIE,EAAE,KAAK,CAACF,EAAG,GAAG,EACjBE,CACT,CAEA,SAASO,EAAwBP,EAAuBF,EAAWO,EAAS,CAC1E,GAAIP,EAAIO,IAAI,GAAI,OAAOP,EACvB,IAAI,EAAI,GACR,GACEA,GAAKO,EAAG,EAAE,QACHP,EAAIO,IAAI,IACjB,OAAAL,EAAE,KAAK,CAACK,EAAG,EAAE,EACNP,CACT,CAYO,SAASU,EAAQV,EAAS,CAC/B,OAAOA,IAAI,IAAMW,EAAeX,CAAA,IAAOC,EAAID,CAAA,CAC7C,CAQO,SAASY,KAAOC,EAAY,CACjC,IAAIX,EAAIW,EAAG,OAAQZ,EAAIY,EAAG,CAAA,CAAE,EAAI,GAChC,QAAST,EAAI,EAAGC,EAAIQ,EAAG,OAAQT,EAAIC,EAAGD,IACpCF,EAAIY,EAAQZ,EAAGW,EAAGT,CAAA,CAAE,EACtB,OAAOF,CACT,CAIA,SAASa,EAAQC,EAAWC,EAAS,CAGnC,IAFAD,EAAIE,EAAIF,CAAA,EACRC,EAAIC,EAAID,CAAA,EACDA,IAAM,IAAI,CACf,IAAME,EAAIF,EACVA,EAAID,EAAIC,EACRD,EAAIG,CACN,CACA,OAAOH,CACT,CAUO,SAASI,KAAOC,EAAY,CACjC,IAAIC,EAAID,EAAG,OAAQH,EAAIG,EAAG,CAAA,CAAE,EAAI,GAChC,QAASE,EAAI,EAAGC,EAAIH,EAAG,OAAQE,EAAIC,EAAGD,IAAK,CACzC,GAAID,IAAM,IAAMD,EAAGE,CAAA,IAAO,GAAI,OAAO,GACrCD,EAAIJ,EAAII,EAAID,EAAGE,CAAA,CAAE,EAAIR,EAAQO,EAAGD,EAAGE,CAAA,CAAE,CACvC,CACA,OAAOD,CACT,CAeO,SAASG,EAAU,EAAWC,EAAU,GAAE,CAC/C,IAAIJ,EAAI,GACR,GAAI,EAAE,GAAI,OAAO,GACjB,QAASC,EAAEG,EAAE,GAAIH,GAAG,EAAGA,IACrBD,GAAKC,EACP,OAAOD,CACT,CAWO,SAASK,EAAS,EAAWD,EAAS,CAC3C,GAAIA,EAAI,GAAI,OAAO,GAGnB,GAAI,EAAI,GAEN,OADaA,EAAI,KAAO,GAAI,GAAK,CAAC,IACpBC,EAASD,EAAI,EAAI,GAAIA,CAAA,EAErC,GAAIA,EAAI,EAAG,OAAO,GAElBA,EAAIA,EAAI,EAAIA,EAAG,EAAIA,EAAIA,EACvB,IAAIJ,EAAI,GACJM,EAAI,GACR,QAASL,EAAI,GAAIA,GAAKG,EAAGH,IAAK,IAC5BD,GAAK,EACLM,GAAKL,EAEP,OAAOD,EAAIM,CACb,CAUO,SAASC,MAAeC,EAAY,CACzC,IAAIC,EAAIC,EAAA,GAAOF,CAAA,EAAKR,EAAI,GAAIM,EAAI,GAChC,QAASL,EAAE,EAAGU,EAAE,GAAIT,EAAEM,EAAG,OAAQP,EAAEC,GAC7BS,GAAG,GAAIA,EAAIH,EAAGP,GAAA,GACXD,GAAKS,IAAKH,GAAIK,KAEvB,OAAOX,EAAEM,CACX,CAcO,SAASM,MAASb,EAAY,CACnC,IAAIC,EAAI,GACR,QAAWN,KAAKK,EACdC,GAAKN,EAAEA,EACT,OAAOmB,EAAKb,CAAA,CACd,CAaO,SAASU,KAAOX,EAAY,CACjC,IAAIC,EAAI,GACR,QAAWN,KAAKK,EACdC,GAAKN,EACP,OAAOM,CACT,CAQO,SAASc,KAAWf,EAAY,CACrC,IAAIC,EAAI,GACR,QAAWN,KAAKK,EACdC,GAAKN,EACP,OAAOM,CACT,CAQO,SAASe,MAAUhB,EAAY,CACpC,GAAIA,EAAG,SAAS,EAAG,OAAO,GAC1BA,EAAG,KAAKiB,CAAA,EACR,IAAMf,EAAIF,EAAG,QAAQ,EACrB,OAAKA,EAAG,OAAS,KAAK,EAAUA,EAAGE,CAAA,GAC3BF,EAAGE,EAAE,CAAA,EAAKF,EAAGE,CAAA,GAAI,EAC3B,CAUO,SAASgB,MAASlB,EAAY,CACnCA,EAAG,KAAKiB,CAAA,EACR,IAAME,EAAIC,EAAUpB,CAAA,EACpB,OAAOqB,EAAWrB,EAAImB,CAAA,CACxB,CAIA,SAASC,EAAUpB,EAAY,CAC7B,IAAIsB,EAAQ,KAAK,IAAItB,EAAG,OAAQ,CAAA,EAAIuB,EAAMD,EAC1C,QAASpB,EAAE,EAAGC,EAAEH,EAAG,OAAQE,EAAEC,EAAGD,IAC1BF,EAAGE,EAAE,CAAA,IAAKF,EAAGE,CAAA,EAAIoB,KACdC,EAAM,KAAK,IAAIA,EAAKD,CAAA,EAAQA,EAAQ,GAE7C,OAAO,KAAK,IAAIC,EAAKD,CAAA,CACvB,CAGA,SAASD,EAAWrB,EAAcmB,EAAS,CACzC,IAAMlB,EAAc,CAAA,EAAIkB,IACxB,QAASjB,EAAE,EAAGC,EAAEH,EAAG,OAAOmB,EAAGjB,EAAEC,EAAGD,IAC5BF,EAAGE,CAAA,IAAKF,EAAGE,EAAEiB,CAAA,GAAIlB,EAAE,KAAKD,EAAGE,GAAGiB,CAAA,CAAE,EACtC,OAAOlB,CACT,CAQO,SAASuB,KAAOxB,EAAY,CACjC,GAAIA,EAAG,SAAS,EAAG,OAAO,GAC1B,IAAIC,EAAID,EAAG,CAAA,EACX,QAAWL,KAAKK,EACdC,EAAIN,EAAEM,EAAGN,EAAIM,EACf,OAAOA,CACT,CAQO,SAASsB,KAAOvB,EAAY,CACjC,GAAIA,EAAG,SAAS,EAAG,OAAO,GAC1B,IAAIC,EAAID,EAAG,CAAA,EACX,QAAWL,KAAKK,EACdC,EAAIN,EAAEM,EAAGN,EAAIM,EACf,OAAOA,CACT,CAQO,SAASwB,MAASzB,EAAY,CACnC,GAAIA,EAAG,SAAS,EAAG,MAAO,CAAC,GAAI,IAC/B,IAAIC,EAAID,EAAG,CAAA,EAAIO,EAAIN,EACnB,QAAWN,KAAKK,EACdC,EAAIN,EAAEM,EAAGN,EAAIM,EACbM,EAAIZ,EAAEY,EAAGZ,EAAIY,EAEf,MAAO,CAACN,EAAGM,EACb,CAQO,SAASmB,MAAY1B,EAAY,CACtC,GAAIA,EAAG,SAAS,EAAG,OAAO,GAC1B,IAAM2B,EAAIC,EAAA,GAAkB5B,CAAA,EAASC,EAAI,GACzC,QAAWN,KAAKK,EACdC,IAAMN,EAAEgC,IAAI,GACd,OAAO1B,EAAE,OAAOD,EAAG,MAAM,CAC3B,CAcO,SAAS4B,KAAkB5B,EAAY,CAC5C,IAAMU,EAAI,OAAOV,EAAG,MAAM,EAC1B,OAAOW,EAAA,GAAOX,CAAA,EAAIU,CACpB,CASO,SAASmB,MAAiBC,EAAY,CAC3C,IAAMC,EAAI,OAAOD,EAAG,MAAM,EAC1B,OAAOE,EAAKC,EAAA,GAAWH,CAAA,EAAKC,CAAA,CAC9B,CAQO,SAASG,MAAgBJ,EAAY,CAC1C,IAAMC,EAAI,OAAOD,EAAG,MAAM,EACpBK,EAAIF,EAAA,GAAWH,CAAA,EAASM,EAAI,GAClC,QAAWC,KAAKP,EACdM,GAAKD,EAAEE,EACT,OAAON,EAAEI,EAAEC,CACb,CAQO,SAASE,MAAkBR,EAAY,CAC5C,IAAMC,EAAI,OAAOD,EAAG,MAAM,EACtBS,EAAI,GACR,QAAWF,KAAKP,EACdS,GAAKF,EAAEA,EACT,OAAOG,EAAKD,EAAER,CAAA,CAChB,CASO,SAASU,MAAaC,EAAY,CACvC,IAAMC,EAAI,OAAOD,EAAG,MAAM,EACtBE,EAAI,GACR,QAAWC,KAAKH,EACdE,GAAKC,GAAG,GACV,OAAOC,EAAKF,EAAED,CAAA,CAChB",
6
+ "names": ["is", "x", "compare", "y", "abs", "sign", "floorDiv", "ceilDiv", "roundDiv", "rem", "mod", "modp", "constrain", "minv", "maxv", "min", "max", "remap", "x", "r", "R", "t", "T", "lerp", "x", "y", "t", "isPow2", "isPow10", "prevPow2", "n", "prevPow10", "nextPow2", "nextPow10", "log2", "log10", "sqrt", "sqrtPos", "a", "b", "cbrt", "root", "rootPos", "m", "properDivisors", "abs", "i", "aliquotSum", "x", "abs", "a", "i", "minPrimeFactor", "I", "sqrt", "maxPrimeFactor", "x", "abs", "a", "i", "I", "sqrt", "primeFactors", "x", "abs", "a", "pushPrimeFactorTo$", "i", "I", "sqrt", "f", "primeExponentials", "pushPrimeExponentialTo$", "isPrime", "minPrimeFactor", "gcd", "xs", "gcdPair", "gcdPair", "x", "y", "abs", "t", "lcm", "xs", "a", "i", "I", "factorial", "k", "binomial", "b", "multinomial", "ks", "n", "sum", "j", "hypot", "sqrt", "product", "median", "compare", "modes", "r", "maxRepeat", "getRepeats", "count", "max", "min", "range", "variance", "m", "arithmeticMean", "geometricMean", "xs", "n", "root", "product", "harmonicMean", "p", "q", "x", "quadriaticMean", "a", "sqrt", "cubicMean", "xs", "n", "a", "x", "cbrt"]
7
7
  }
package/index.test.ts CHANGED
@@ -298,6 +298,7 @@ Deno.test("prevPow2", () => {
298
298
  assertEquals(a, 32n);
299
299
  a = prevPow2(1023n);
300
300
  assertEquals(a, 512n);
301
+ assertEquals(prevPow2(1n), 1n);
301
302
  });
302
303
 
303
304
 
@@ -307,6 +308,7 @@ Deno.test("prevPow10", () => {
307
308
  assertEquals(a, 10n);
308
309
  a = prevPow10(999n);
309
310
  assertEquals(a, 100n);
311
+ assertEquals(prevPow10(1n), 1n);
310
312
  });
311
313
 
312
314
 
@@ -316,6 +318,7 @@ Deno.test("nextPow2", () => {
316
318
  assertEquals(a, 32n);
317
319
  a = nextPow2(1023n);
318
320
  assertEquals(a, 1024n);
321
+ assertEquals(nextPow2(1n), 1n);
319
322
  });
320
323
 
321
324
 
@@ -325,6 +328,7 @@ Deno.test("nextPow10", () => {
325
328
  assertEquals(a, 10n);
326
329
  a = nextPow10(999n);
327
330
  assertEquals(a, 1000n);
331
+ assertEquals(nextPow10(1n), 1n);
328
332
  });
329
333
 
330
334
 
@@ -499,6 +503,10 @@ Deno.test("gcd", () => {
499
503
  assertEquals(a, 1n);
500
504
  a = gcd(); // sp
501
505
  assertEquals(a, 1n); // sp
506
+ assertEquals(gcd(0n, 6n), 6n);
507
+ assertEquals(gcd(6n, 0n), 6n);
508
+ assertEquals(gcd(0n, 0n), 0n);
509
+ assertEquals(gcd(4n, -6n), 2n);
502
510
  });
503
511
 
504
512
 
@@ -512,6 +520,9 @@ Deno.test("lcm", () => {
512
520
  assertEquals(a, 60n);
513
521
  a = lcm(); // sp
514
522
  assertEquals(a, 1n); // sp
523
+ assertEquals(lcm(0n, 5n), 0n);
524
+ assertEquals(lcm(5n, 0n, 0n), 0n);
525
+ assertEquals(lcm(-4n, 6n), 12n);
515
526
  });
516
527
 
517
528
 
@@ -546,6 +557,9 @@ Deno.test("binomial", () => {
546
557
  assertEquals(a, 0n); // sp
547
558
  a = binomial(-4n, 1n); // sp
548
559
  assertEquals(a, -4n); // sp
560
+ assertEquals(binomial(-2n, 2n), 3n);
561
+ assertEquals(binomial(-1n, 2n), 1n);
562
+ assertEquals(binomial(-2n, 3n), -4n);
549
563
  });
550
564
 
551
565
 
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "@nodef/extra-bigint.web",
3
- "version": "1.4.0",
3
+ "version": "1.4.1",
4
4
  "type": "module",
5
5
  "license": "MIT",
6
6
  "main": "./index.js",