From 04cad8250bc7faf429f5ac7abef401e72e481724 Mon Sep 17 00:00:00 2001 From: juanelas Date: Tue, 21 Apr 2020 02:41:32 +0200 Subject: [PATCH] fixed browser tests --- lib/index.browser.bundle.iife.js | 2 +- lib/index.browser.bundle.mod.js | 2 +- lib/index.browser.mod.js | 35 ++++--- lib/index.node.js | 35 ++++--- src/js/index.js | 35 ++++--- test/browser/tests.js | 163 ++++++++++++++++--------------- test/prime.js | 27 +++-- test/randBetween.js | 18 +--- test/random.js | 118 ++++++++++++---------- 9 files changed, 221 insertions(+), 214 deletions(-) diff --git a/lib/index.browser.bundle.iife.js b/lib/index.browser.bundle.iife.js index 54a822e..d75a602 100644 --- a/lib/index.browser.bundle.iife.js +++ b/lib/index.browser.bundle.iife.js @@ -1 +1 @@ -var bigintCryptoUtils=function(n){"use strict";function t(n){return(n=BigInt(n))>=0n?n:-n}function e(n){if(1n===(n=BigInt(n)))return 1;let t=1;do{t++}while((n>>=1n)>1n);return t}function r(n,t){if((n=BigInt(n))<=0n|(t=BigInt(t))<=0n)throw new RangeError("a and b MUST be > 0");let e=0n,r=1n,i=1n,o=0n;for(;0n!==n;){const s=t/n,a=t%n,c=e-i*s,u=r-o*s;t=n,n=a,e=i,r=o,i=c,o=u}return{g:t,x:e,y:r}}function i(n,e){if(n=t(n),e=t(e),0n===n)return e;if(0n===e)return n;let r=0n;for(;!(1n&(n|e));)n>>=1n,e>>=1n,r++;for(;!(1n&n);)n>>=1n;do{for(;!(1n&e);)e>>=1n;if(n>e){const t=n;n=e,e=t}e-=n}while(e);return n<0;)e%2n===1n&&(i=i*n%r),e/=2n,n=n**2n%r;return i}function a(n,t){return(t=BigInt(t))<=0?NaN:(n=BigInt(n)%t)<0?n+t:n}function c(n,t=16,e=!1){return"number"==typeof n&&(n=BigInt(n)),new Promise((e,r)=>{const i=new Worker(m());i.onmessage=n=>{i.terminate(),e(n.data.isPrime)},i.onmessageerror=n=>{r(n)},i.postMessage({rnd:n,iterations:t,id:0})})}function u(n,t=1n){if(n<=0n||t<0n||n<=t)throw new Error("inputs should be max > 0, min >= 0; max > min");const r=n-t,i=e(r);let o;do{o=w(g(i))}while(o>r);return o+t}async function f(n,t=!1){if(n<1)throw new RangeError("bitLength MUST be > 0");const e=Math.ceil(n/8),r=n%8,i=await l(e,!1);if(r&&(i[0]=i[0]&2**r-1),t){const n=r?2**(r-1):128;i[0]=i[0]|n}return i}function g(n,t=!1){if(n<1)throw new RangeError("bitLength MUST be > 0");const e=d(Math.ceil(n/8),!1),r=n%8;if(r&&(e[0]=e[0]&2**r-1),t){const n=r?2**(r-1):128;e[0]=e[0]|n}return e}function l(n,t=!1){if(n<1)throw new RangeError("byteLength MUST be > 0");return new Promise((function(e,r){{const r=new Uint8Array(n);self.crypto.getRandomValues(r),t&&(r[0]=128|r[0]),e(r)}}))}function d(n,t=!1){if(n<1)throw new RangeError("byteLength MUST be > 0");{const e=new Uint8Array(n);return self.crypto.getRandomValues(e),t&&(e[0]=128|e[0]),e}}function w(n){let t=0n;for(const e of n.values()){const n=BigInt(e);t=(t< {${n}})()`;const t=new Blob([n],{type:"text/javascript"});return window.URL.createObjectURL(t)}(n)}function h(n,t=16){if(2n===n)return!0;if(0n===(1n&n)||1n===n)return!1;const e=[3n,5n,7n,11n,13n,17n,19n,23n,29n,31n,37n,41n,43n,47n,53n,59n,61n,67n,71n,73n,79n,83n,89n,97n,101n,103n,107n,109n,113n,127n,131n,137n,139n,149n,151n,157n,163n,167n,173n,179n,181n,191n,193n,197n,199n,211n,223n,227n,229n,233n,239n,241n,251n,257n,263n,269n,271n,277n,281n,283n,293n,307n,311n,313n,317n,331n,337n,347n,349n,353n,359n,367n,373n,379n,383n,389n,397n,401n,409n,419n,421n,431n,433n,439n,443n,449n,457n,461n,463n,467n,479n,487n,491n,499n,503n,509n,521n,523n,541n,547n,557n,563n,569n,571n,577n,587n,593n,599n,601n,607n,613n,617n,619n,631n,641n,643n,647n,653n,659n,661n,673n,677n,683n,691n,701n,709n,719n,727n,733n,739n,743n,751n,757n,761n,769n,773n,787n,797n,809n,811n,821n,823n,827n,829n,839n,853n,857n,859n,863n,877n,881n,883n,887n,907n,911n,919n,929n,937n,941n,947n,953n,967n,971n,977n,983n,991n,997n,1009n,1013n,1019n,1021n,1031n,1033n,1039n,1049n,1051n,1061n,1063n,1069n,1087n,1091n,1093n,1097n,1103n,1109n,1117n,1123n,1129n,1151n,1153n,1163n,1171n,1181n,1187n,1193n,1201n,1213n,1217n,1223n,1229n,1231n,1237n,1249n,1259n,1277n,1279n,1283n,1289n,1291n,1297n,1301n,1303n,1307n,1319n,1321n,1327n,1361n,1367n,1373n,1381n,1399n,1409n,1423n,1427n,1429n,1433n,1439n,1447n,1451n,1453n,1459n,1471n,1481n,1483n,1487n,1489n,1493n,1499n,1511n,1523n,1531n,1543n,1549n,1553n,1559n,1567n,1571n,1579n,1583n,1597n];for(let t=0;t=(t=BigInt(t))?n:t},n.min=function(n,t){return(n=BigInt(n))>=(t=BigInt(t))?t:n},n.modInv=o,n.modPow=s,n.prime=function(n,t=16){if(n<1)throw new RangeError("bitLength MUST be > 0");if(!B){let e=0n;do{e=w(g(n,!0))}while(!h(e,t));return new Promise(n=>{n(e)})}return new Promise(e=>{const r=[],i=(i,o)=>{if(i.isPrime){for(let n=0;ni(n.data,t),r.push(t)}}for(let e=0;e 0");let e=0n;do{e=w(g(n,!0))}while(!h(e,t));return e},n.randBetween=u,n.randBits=f,n.randBitsSync=g,n.randBytes=l,n.randBytesSync=d,n.toZn=a,n}({}); +var bigintCryptoUtils=function(n){"use strict";function t(n){return(n=BigInt(n))>=0n?n:-n}function e(n){if(1n===(n=BigInt(n)))return 1;let t=1;do{t++}while((n>>=1n)>1n);return t}function r(n,t){if((n=BigInt(n))<=0n|(t=BigInt(t))<=0n)throw new RangeError("a and b MUST be > 0");let e=0n,r=1n,i=1n,o=0n;for(;0n!==n;){const s=t/n,a=t%n,c=e-i*s,u=r-o*s;t=n,n=a,e=i,r=o,i=c,o=u}return{g:t,x:e,y:r}}function i(n,e){if(n=t(n),e=t(e),0n===n)return e;if(0n===e)return n;let r=0n;for(;!(1n&(n|e));)n>>=1n,e>>=1n,r++;for(;!(1n&n);)n>>=1n;do{for(;!(1n&e);)e>>=1n;if(n>e){const t=n;n=e,e=t}e-=n}while(e);return n<0;)e%2n===1n&&(i=i*n%r),e/=2n,n=n**2n%r;return i}function a(n,t){return(t=BigInt(t))<=0?NaN:(n=BigInt(n)%t)<0?n+t:n}function c(n,t=16,e=!1){return"number"==typeof n&&(n=BigInt(n)),new Promise((e,r)=>{const i=new Worker(m());i.onmessage=n=>{i.terminate(),e(n.data.isPrime)},i.onmessageerror=n=>{r(n)},i.postMessage({rnd:n,iterations:t,id:0})})}function u(n,t=1n){if(n<=0n||t<0n||n<=t)throw new RangeError("inputs should be max > 0, min >= 0; max > min");const r=n-t,i=e(r);let o;do{o=w(g(i))}while(o>r);return o+t}function f(n,t=!1){if(n<1)throw new RangeError("bitLength MUST be > 0");const e=Math.ceil(n/8),r=n%8;return new Promise(n=>{l(e,!1).then((function(e){if(r&&(e[0]=e[0]&2**r-1),t){const n=r?2**(r-1):128;e[0]=e[0]|n}n(e)}))})}function g(n,t=!1){if(n<1)throw new RangeError("bitLength MUST be > 0");const e=d(Math.ceil(n/8),!1),r=n%8;if(r&&(e[0]=e[0]&2**r-1),t){const n=r?2**(r-1):128;e[0]=e[0]|n}return e}function l(n,t=!1){if(n<1)throw new RangeError("byteLength MUST be > 0");return new Promise((function(e,r){{const r=new Uint8Array(n);self.crypto.getRandomValues(r),t&&(r[0]=128|r[0]),e(r)}}))}function d(n,t=!1){if(n<1)throw new RangeError("byteLength MUST be > 0");{const e=new Uint8Array(n);return self.crypto.getRandomValues(e),t&&(e[0]=128|e[0]),e}}function w(n){let t=0n;for(const e of n.values()){const n=BigInt(e);t=(t< {${n}})()`;const t=new Blob([n],{type:"text/javascript"});return window.URL.createObjectURL(t)}(n)}function h(n,t=16){if(2n===n)return!0;if(0n===(1n&n)||1n===n)return!1;const e=[3n,5n,7n,11n,13n,17n,19n,23n,29n,31n,37n,41n,43n,47n,53n,59n,61n,67n,71n,73n,79n,83n,89n,97n,101n,103n,107n,109n,113n,127n,131n,137n,139n,149n,151n,157n,163n,167n,173n,179n,181n,191n,193n,197n,199n,211n,223n,227n,229n,233n,239n,241n,251n,257n,263n,269n,271n,277n,281n,283n,293n,307n,311n,313n,317n,331n,337n,347n,349n,353n,359n,367n,373n,379n,383n,389n,397n,401n,409n,419n,421n,431n,433n,439n,443n,449n,457n,461n,463n,467n,479n,487n,491n,499n,503n,509n,521n,523n,541n,547n,557n,563n,569n,571n,577n,587n,593n,599n,601n,607n,613n,617n,619n,631n,641n,643n,647n,653n,659n,661n,673n,677n,683n,691n,701n,709n,719n,727n,733n,739n,743n,751n,757n,761n,769n,773n,787n,797n,809n,811n,821n,823n,827n,829n,839n,853n,857n,859n,863n,877n,881n,883n,887n,907n,911n,919n,929n,937n,941n,947n,953n,967n,971n,977n,983n,991n,997n,1009n,1013n,1019n,1021n,1031n,1033n,1039n,1049n,1051n,1061n,1063n,1069n,1087n,1091n,1093n,1097n,1103n,1109n,1117n,1123n,1129n,1151n,1153n,1163n,1171n,1181n,1187n,1193n,1201n,1213n,1217n,1223n,1229n,1231n,1237n,1249n,1259n,1277n,1279n,1283n,1289n,1291n,1297n,1301n,1303n,1307n,1319n,1321n,1327n,1361n,1367n,1373n,1381n,1399n,1409n,1423n,1427n,1429n,1433n,1439n,1447n,1451n,1453n,1459n,1471n,1481n,1483n,1487n,1489n,1493n,1499n,1511n,1523n,1531n,1543n,1549n,1553n,1559n,1567n,1571n,1579n,1583n,1597n];for(let t=0;t=(t=BigInt(t))?n:t},n.min=function(n,t){return(n=BigInt(n))>=(t=BigInt(t))?t:n},n.modInv=o,n.modPow=s,n.prime=function(n,t=16){if(n<1)throw new RangeError("bitLength MUST be > 0");if(!B){let e=0n;do{e=w(g(n,!0))}while(!h(e,t));return new Promise(n=>{n(e)})}return new Promise(e=>{const r=[],i=(i,o)=>{if(i.isPrime){for(let n=0;ni(n.data,t),r.push(t)}}for(let e=0;e 0");let e=0n;do{e=w(g(n,!0))}while(!h(e,t));return e},n.randBetween=u,n.randBits=f,n.randBitsSync=g,n.randBytes=l,n.randBytesSync=d,n.toZn=a,n}({}); diff --git a/lib/index.browser.bundle.mod.js b/lib/index.browser.bundle.mod.js index 165e726..9dc25ce 100644 --- a/lib/index.browser.bundle.mod.js +++ b/lib/index.browser.bundle.mod.js @@ -1 +1 @@ -function n(n){return(n=BigInt(n))>=0n?n:-n}function t(n){if(1n===(n=BigInt(n)))return 1;let t=1;do{t++}while((n>>=1n)>1n);return t}function e(n,t){if((n=BigInt(n))<=0n|(t=BigInt(t))<=0n)throw new RangeError("a and b MUST be > 0");let e=0n,r=1n,o=1n,i=0n;for(;0n!==n;){const s=t/n,a=t%n,c=e-o*s,u=r-i*s;t=n,n=a,e=o,r=i,o=c,i=u}return{g:t,x:e,y:r}}function r(t,e){if(t=n(t),e=n(e),0n===t)return e;if(0n===e)return t;let r=0n;for(;!(1n&(t|e));)t>>=1n,e>>=1n,r++;for(;!(1n&t);)t>>=1n;do{for(;!(1n&e);)e>>=1n;if(t>e){const n=t;t=e,e=n}e-=t}while(e);return t<=(t=BigInt(t))?n:t}function s(n,t){return(n=BigInt(n))>=(t=BigInt(t))?t:n}function a(n,t){try{const r=e(u(n,t),t);return 1n!==r.g?NaN:u(r.x,t)}catch(n){return NaN}}function c(t,e,r){if(0n===(r=BigInt(r)))return NaN;if(1n===r)return BigInt(0);if(t=u(t,r),(e=BigInt(e))<0n)return a(c(t,n(e),r),r);let o=1n;for(;e>0;)e%2n===1n&&(o=o*t%r),e/=2n,t=t**2n%r;return o}function u(n,t){return(t=BigInt(t))<=0?NaN:(n=BigInt(n)%t)<0?n+t:n}function f(n,t=16,e=!1){return"number"==typeof n&&(n=BigInt(n)),new Promise((e,r)=>{const o=new Worker(I());o.onmessage=n=>{o.terminate(),e(n.data.isPrime)},o.onmessageerror=n=>{r(n)},o.postMessage({rnd:n,iterations:t,id:0})})}function g(n,t=16){if(n<1)throw new RangeError("bitLength MUST be > 0");if(!S){let e=0n;do{e=$(d(n,!0))}while(!b(e,t));return new Promise(n=>{n(e)})}return new Promise(e=>{const r=[],o=(o,i)=>{if(o.isPrime){for(let n=0;no(n.data,t),r.push(t)}}for(let e=0;e 0");let e=0n;do{e=$(d(n,!0))}while(!b(e,t));return e}function w(n,e=1n){if(n<=0n||e<0n||n<=e)throw new Error("inputs should be max > 0, min >= 0; max > min");const r=n-e,o=t(r);let i;do{i=$(d(o))}while(i>r);return i+e}async function h(n,t=!1){if(n<1)throw new RangeError("bitLength MUST be > 0");const e=Math.ceil(n/8),r=n%8,o=await m(e,!1);if(r&&(o[0]=o[0]&2**r-1),t){const n=r?2**(r-1):128;o[0]=o[0]|n}return o}function d(n,t=!1){if(n<1)throw new RangeError("bitLength MUST be > 0");const e=B(Math.ceil(n/8),!1),r=n%8;if(r&&(e[0]=e[0]&2**r-1),t){const n=r?2**(r-1):128;e[0]=e[0]|n}return e}function m(n,t=!1){if(n<1)throw new RangeError("byteLength MUST be > 0");return new Promise((function(e,r){{const r=new Uint8Array(n);self.crypto.getRandomValues(r),t&&(r[0]=128|r[0]),e(r)}}))}function B(n,t=!1){if(n<1)throw new RangeError("byteLength MUST be > 0");{const e=new Uint8Array(n);return self.crypto.getRandomValues(e),t&&(e[0]=128|e[0]),e}}function $(n){let t=0n;for(const e of n.values()){const n=BigInt(e);t=(t< {${n}})()`;const t=new Blob([n],{type:"text/javascript"});return window.URL.createObjectURL(t)}(n)}function b(n,t=16){if(2n===n)return!0;if(0n===(1n&n)||1n===n)return!1;const e=[3n,5n,7n,11n,13n,17n,19n,23n,29n,31n,37n,41n,43n,47n,53n,59n,61n,67n,71n,73n,79n,83n,89n,97n,101n,103n,107n,109n,113n,127n,131n,137n,139n,149n,151n,157n,163n,167n,173n,179n,181n,191n,193n,197n,199n,211n,223n,227n,229n,233n,239n,241n,251n,257n,263n,269n,271n,277n,281n,283n,293n,307n,311n,313n,317n,331n,337n,347n,349n,353n,359n,367n,373n,379n,383n,389n,397n,401n,409n,419n,421n,431n,433n,439n,443n,449n,457n,461n,463n,467n,479n,487n,491n,499n,503n,509n,521n,523n,541n,547n,557n,563n,569n,571n,577n,587n,593n,599n,601n,607n,613n,617n,619n,631n,641n,643n,647n,653n,659n,661n,673n,677n,683n,691n,701n,709n,719n,727n,733n,739n,743n,751n,757n,761n,769n,773n,787n,797n,809n,811n,821n,823n,827n,829n,839n,853n,857n,859n,863n,877n,881n,883n,887n,907n,911n,919n,929n,937n,941n,947n,953n,967n,971n,977n,983n,991n,997n,1009n,1013n,1019n,1021n,1031n,1033n,1039n,1049n,1051n,1061n,1063n,1069n,1087n,1091n,1093n,1097n,1103n,1109n,1117n,1123n,1129n,1151n,1153n,1163n,1171n,1181n,1187n,1193n,1201n,1213n,1217n,1223n,1229n,1231n,1237n,1249n,1259n,1277n,1279n,1283n,1289n,1291n,1297n,1301n,1303n,1307n,1319n,1321n,1327n,1361n,1367n,1373n,1381n,1399n,1409n,1423n,1427n,1429n,1433n,1439n,1447n,1451n,1453n,1459n,1471n,1481n,1483n,1487n,1489n,1493n,1499n,1511n,1523n,1531n,1543n,1549n,1553n,1559n,1567n,1571n,1579n,1583n,1597n];for(let t=0;t=0n?n:-n}function t(n){if(1n===(n=BigInt(n)))return 1;let t=1;do{t++}while((n>>=1n)>1n);return t}function e(n,t){if((n=BigInt(n))<=0n|(t=BigInt(t))<=0n)throw new RangeError("a and b MUST be > 0");let e=0n,r=1n,o=1n,i=0n;for(;0n!==n;){const s=t/n,c=t%n,u=e-o*s,a=r-i*s;t=n,n=c,e=o,r=i,o=u,i=a}return{g:t,x:e,y:r}}function r(t,e){if(t=n(t),e=n(e),0n===t)return e;if(0n===e)return t;let r=0n;for(;!(1n&(t|e));)t>>=1n,e>>=1n,r++;for(;!(1n&t);)t>>=1n;do{for(;!(1n&e);)e>>=1n;if(t>e){const n=t;t=e,e=n}e-=t}while(e);return t<=(t=BigInt(t))?n:t}function s(n,t){return(n=BigInt(n))>=(t=BigInt(t))?t:n}function c(n,t){try{const r=e(a(n,t),t);return 1n!==r.g?NaN:a(r.x,t)}catch(n){return NaN}}function u(t,e,r){if(0n===(r=BigInt(r)))return NaN;if(1n===r)return BigInt(0);if(t=a(t,r),(e=BigInt(e))<0n)return c(u(t,n(e),r),r);let o=1n;for(;e>0;)e%2n===1n&&(o=o*t%r),e/=2n,t=t**2n%r;return o}function a(n,t){return(t=BigInt(t))<=0?NaN:(n=BigInt(n)%t)<0?n+t:n}function f(n,t=16,e=!1){return"number"==typeof n&&(n=BigInt(n)),new Promise((e,r)=>{const o=new Worker(I());o.onmessage=n=>{o.terminate(),e(n.data.isPrime)},o.onmessageerror=n=>{r(n)},o.postMessage({rnd:n,iterations:t,id:0})})}function g(n,t=16){if(n<1)throw new RangeError("bitLength MUST be > 0");if(!S){let e=0n;do{e=$(d(n,!0))}while(!b(e,t));return new Promise(n=>{n(e)})}return new Promise(e=>{const r=[],o=(o,i)=>{if(o.isPrime){for(let n=0;no(n.data,t),r.push(t)}}for(let e=0;e 0");let e=0n;do{e=$(d(n,!0))}while(!b(e,t));return e}function w(n,e=1n){if(n<=0n||e<0n||n<=e)throw new RangeError("inputs should be max > 0, min >= 0; max > min");const r=n-e,o=t(r);let i;do{i=$(d(o))}while(i>r);return i+e}function h(n,t=!1){if(n<1)throw new RangeError("bitLength MUST be > 0");const e=Math.ceil(n/8),r=n%8;return new Promise(n=>{m(e,!1).then((function(e){if(r&&(e[0]=e[0]&2**r-1),t){const n=r?2**(r-1):128;e[0]=e[0]|n}n(e)}))})}function d(n,t=!1){if(n<1)throw new RangeError("bitLength MUST be > 0");const e=B(Math.ceil(n/8),!1),r=n%8;if(r&&(e[0]=e[0]&2**r-1),t){const n=r?2**(r-1):128;e[0]=e[0]|n}return e}function m(n,t=!1){if(n<1)throw new RangeError("byteLength MUST be > 0");return new Promise((function(e,r){{const r=new Uint8Array(n);self.crypto.getRandomValues(r),t&&(r[0]=128|r[0]),e(r)}}))}function B(n,t=!1){if(n<1)throw new RangeError("byteLength MUST be > 0");{const e=new Uint8Array(n);return self.crypto.getRandomValues(e),t&&(e[0]=128|e[0]),e}}function $(n){let t=0n;for(const e of n.values()){const n=BigInt(e);t=(t< {${n}})()`;const t=new Blob([n],{type:"text/javascript"});return window.URL.createObjectURL(t)}(n)}function b(n,t=16){if(2n===n)return!0;if(0n===(1n&n)||1n===n)return!1;const e=[3n,5n,7n,11n,13n,17n,19n,23n,29n,31n,37n,41n,43n,47n,53n,59n,61n,67n,71n,73n,79n,83n,89n,97n,101n,103n,107n,109n,113n,127n,131n,137n,139n,149n,151n,157n,163n,167n,173n,179n,181n,191n,193n,197n,199n,211n,223n,227n,229n,233n,239n,241n,251n,257n,263n,269n,271n,277n,281n,283n,293n,307n,311n,313n,317n,331n,337n,347n,349n,353n,359n,367n,373n,379n,383n,389n,397n,401n,409n,419n,421n,431n,433n,439n,443n,449n,457n,461n,463n,467n,479n,487n,491n,499n,503n,509n,521n,523n,541n,547n,557n,563n,569n,571n,577n,587n,593n,599n,601n,607n,613n,617n,619n,631n,641n,643n,647n,653n,659n,661n,673n,677n,683n,691n,701n,709n,719n,727n,733n,739n,743n,751n,757n,761n,769n,773n,787n,797n,809n,811n,821n,823n,827n,829n,839n,853n,857n,859n,863n,877n,881n,883n,887n,907n,911n,919n,929n,937n,941n,947n,953n,967n,971n,977n,983n,991n,997n,1009n,1013n,1019n,1021n,1031n,1033n,1039n,1049n,1051n,1061n,1063n,1069n,1087n,1091n,1093n,1097n,1103n,1109n,1117n,1123n,1129n,1151n,1153n,1163n,1171n,1181n,1187n,1193n,1201n,1213n,1217n,1223n,1229n,1231n,1237n,1249n,1259n,1277n,1279n,1283n,1289n,1291n,1297n,1301n,1303n,1307n,1319n,1321n,1327n,1361n,1367n,1373n,1381n,1399n,1409n,1423n,1427n,1429n,1433n,1439n,1447n,1451n,1453n,1459n,1471n,1481n,1483n,1487n,1489n,1493n,1499n,1511n,1523n,1531n,1543n,1549n,1553n,1559n,1567n,1571n,1579n,1583n,1597n];for(let t=0;t 0, min >= 0; max > min') + if (max <= 0n || min < 0n || max <= min) throw new RangeError('inputs should be max > 0, min >= 0; max > min') const interval = max - min const bitLen = bitLength(interval) let rnd @@ -156,24 +156,25 @@ function randBetween (max, min = 1n) { * * @returns {Promise} A Promise that resolves to a Buffer/UInt8Array (Node.js/Browser) filled with cryptographically secure random bits */ -async function randBits (bitLength, forceLength = false) { - if (bitLength < 1) { - throw new RangeError('bitLength MUST be > 0') - } +function randBits (bitLength, forceLength = false) { + if (bitLength < 1) throw new RangeError('bitLength MUST be > 0') const byteLength = Math.ceil(bitLength / 8) const bitLengthMod8 = bitLength % 8 - const rndBytes = await randBytes(byteLength, false) - if (bitLengthMod8) { - // Fill with 0's the extra bits - rndBytes[0] = rndBytes[0] & (2 ** bitLengthMod8 - 1) - } - if (forceLength) { - const mask = bitLengthMod8 ? 2 ** (bitLengthMod8 - 1) : 128 - rndBytes[0] = rndBytes[0] | mask - } - return rndBytes + return new Promise((resolve) => { + randBytes(byteLength, false).then(function (rndBytes) { + if (bitLengthMod8) { + // Fill with 0's the extra bits + rndBytes[0] = rndBytes[0] & (2 ** bitLengthMod8 - 1) + } + if (forceLength) { + const mask = bitLengthMod8 ? 2 ** (bitLengthMod8 - 1) : 128 + rndBytes[0] = rndBytes[0] | mask + } + resolve(rndBytes) + }) + }) } /** @@ -184,9 +185,7 @@ async function randBits (bitLength, forceLength = false) { * @returns {Buffer | Uint8Array} A Buffer/UInt8Array (Node.js/Browser) filled with cryptographically secure random bits */ function randBitsSync (bitLength, forceLength = false) { - if (bitLength < 1) { - throw new RangeError('bitLength MUST be > 0') - } + if (bitLength < 1) throw new RangeError('bitLength MUST be > 0') const byteLength = Math.ceil(bitLength / 8) const rndBytes = randBytesSync(byteLength, false) diff --git a/lib/index.node.js b/lib/index.node.js index d33991c..3b67dfb 100644 --- a/lib/index.node.js +++ b/lib/index.node.js @@ -145,7 +145,7 @@ function primeSync (bitLength, iterations = 16) { * @returns {bigint} A cryptographically secure random bigint between [min,max] */ function randBetween (max, min = 1n) { - if (max <= 0n || min < 0n || max <= min) throw new Error('inputs should be max > 0, min >= 0; max > min') + if (max <= 0n || min < 0n || max <= min) throw new RangeError('inputs should be max > 0, min >= 0; max > min') const interval = max - min const bitLen = bigintModArith.bitLength(interval) let rnd @@ -164,24 +164,25 @@ function randBetween (max, min = 1n) { * * @returns {Promise} A Promise that resolves to a Buffer/UInt8Array (Node.js/Browser) filled with cryptographically secure random bits */ -async function randBits (bitLength, forceLength = false) { - if (bitLength < 1) { - throw new RangeError('bitLength MUST be > 0') - } +function randBits (bitLength, forceLength = false) { + if (bitLength < 1) throw new RangeError('bitLength MUST be > 0') const byteLength = Math.ceil(bitLength / 8) const bitLengthMod8 = bitLength % 8 - const rndBytes = await randBytes(byteLength, false) - if (bitLengthMod8) { - // Fill with 0's the extra bits - rndBytes[0] = rndBytes[0] & (2 ** bitLengthMod8 - 1) - } - if (forceLength) { - const mask = bitLengthMod8 ? 2 ** (bitLengthMod8 - 1) : 128 - rndBytes[0] = rndBytes[0] | mask - } - return rndBytes + return new Promise((resolve) => { + randBytes(byteLength, false).then(function (rndBytes) { + if (bitLengthMod8) { + // Fill with 0's the extra bits + rndBytes[0] = rndBytes[0] & (2 ** bitLengthMod8 - 1) + } + if (forceLength) { + const mask = bitLengthMod8 ? 2 ** (bitLengthMod8 - 1) : 128 + rndBytes[0] = rndBytes[0] | mask + } + resolve(rndBytes) + }) + }) } /** @@ -192,9 +193,7 @@ async function randBits (bitLength, forceLength = false) { * @returns {Buffer | Uint8Array} A Buffer/UInt8Array (Node.js/Browser) filled with cryptographically secure random bits */ function randBitsSync (bitLength, forceLength = false) { - if (bitLength < 1) { - throw new RangeError('bitLength MUST be > 0') - } + if (bitLength < 1) throw new RangeError('bitLength MUST be > 0') const byteLength = Math.ceil(bitLength / 8) const rndBytes = randBytesSync(byteLength, false) diff --git a/src/js/index.js b/src/js/index.js index 71e4bb2..e59217f 100644 --- a/src/js/index.js +++ b/src/js/index.js @@ -171,7 +171,7 @@ export function primeSync (bitLength, iterations = 16) { * @returns {bigint} A cryptographically secure random bigint between [min,max] */ export function randBetween (max, min = 1n) { - if (max <= 0n || min < 0n || max <= min) throw new Error('inputs should be max > 0, min >= 0; max > min') + if (max <= 0n || min < 0n || max <= min) throw new RangeError('inputs should be max > 0, min >= 0; max > min') const interval = max - min const bitLen = bitLength(interval) let rnd @@ -190,24 +190,25 @@ export function randBetween (max, min = 1n) { * * @returns {Promise} A Promise that resolves to a Buffer/UInt8Array (Node.js/Browser) filled with cryptographically secure random bits */ -export async function randBits (bitLength, forceLength = false) { - if (bitLength < 1) { - throw new RangeError('bitLength MUST be > 0') - } +export function randBits (bitLength, forceLength = false) { + if (bitLength < 1) throw new RangeError('bitLength MUST be > 0') const byteLength = Math.ceil(bitLength / 8) const bitLengthMod8 = bitLength % 8 - const rndBytes = await randBytes(byteLength, false) - if (bitLengthMod8) { - // Fill with 0's the extra bits - rndBytes[0] = rndBytes[0] & (2 ** bitLengthMod8 - 1) - } - if (forceLength) { - const mask = bitLengthMod8 ? 2 ** (bitLengthMod8 - 1) : 128 - rndBytes[0] = rndBytes[0] | mask - } - return rndBytes + return new Promise((resolve) => { + randBytes(byteLength, false).then(function (rndBytes) { + if (bitLengthMod8) { + // Fill with 0's the extra bits + rndBytes[0] = rndBytes[0] & (2 ** bitLengthMod8 - 1) + } + if (forceLength) { + const mask = bitLengthMod8 ? 2 ** (bitLengthMod8 - 1) : 128 + rndBytes[0] = rndBytes[0] | mask + } + resolve(rndBytes) + }) + }) } /** @@ -218,9 +219,7 @@ export async function randBits (bitLength, forceLength = false) { * @returns {Buffer | Uint8Array} A Buffer/UInt8Array (Node.js/Browser) filled with cryptographically secure random bits */ export function randBitsSync (bitLength, forceLength = false) { - if (bitLength < 1) { - throw new RangeError('bitLength MUST be > 0') - } + if (bitLength < 1) throw new RangeError('bitLength MUST be > 0') const byteLength = Math.ceil(bitLength / 8) const rndBytes = randBytesSync(byteLength, false) diff --git a/test/browser/tests.js b/test/browser/tests.js index 120dae2..82fabc9 100644 --- a/test/browser/tests.js +++ b/test/browser/tests.js @@ -111,30 +111,27 @@ const bitLengths = [ 3072 ]; -describe('prime', function () { +describe('Testing prime generation', function () { this.timeout(120000); for (const bitLength of bitLengths) { describe(`prime(${bitLength})`, function () { - it(`should return a random ${bitLength}-bits probable prime`, async function () { - let primeBitLength = bitLength; - try { + if (bitLength > 0) { + it(`should return a random ${bitLength}-bits probable prime`, async function () { const prime = await _pkg.prime(bitLength); - primeBitLength = _pkg.bitLength(prime); - } catch {} - chai.expect(primeBitLength).to.equal(bitLength); - }); + chai.expect(_pkg.bitLength(prime)).to.equal(bitLength); + }); + } else { + it('should throw error', async function () { + chai.expect(() => _pkg.prime(bitLength)).to.throw(RangeError); + }); + } }); } describe('Testing sync (NOT-RECOMMENDED) version: primeSync()', function () { it('should return a random 1024-bits probable prime', function () { const prime = _pkg.primeSync(1024, 16); - const primeBitLength = _pkg.bitLength(prime); - chai.expect(primeBitLength).to.equal(1024); - try { - _pkg.primeSync(0); - } catch (error) { - chai.expect(true).to.equal(true); - } + chai.expect(_pkg.bitLength(prime)).to.equal(1024); + chai.expect(() => _pkg.primeSync(0)).to.throw(RangeError); }); }); }); @@ -204,13 +201,8 @@ describe('randBetween', function () { chai.expect(ret).to.equal(true); }); } else { - it('should return error (max <=0 || min <0 || min>=max)', function () { - try { - _pkg.randBetween(num.max, num.min); - chai.expect(num.error).to.equal(false); - } catch (error) { - chai.expect(num.error).to.equal(true); - } + it('should throw RangeError (max <=0 || min <0 || min>=max)', function () { + chai.expect(() => _pkg.randBetween(num.max, num.min)).to.throw(RangeError); }); } }); @@ -225,13 +217,8 @@ describe('randBetween', function () { chai.expect(ret).to.equal(true); }); } else { - it('should return error (max <=0)', function () { - try { - _pkg.randBetween(num.max); - chai.expect(num.errorMax).to.equal(false); - } catch (error) { - chai.expect(num.errorMax).to.equal(true); - } + it('should throw RangeError (max <=0)', function () { + chai.expect(() => _pkg.randBetween(num.max)).to.throw(RangeError); }); } }); @@ -245,44 +232,54 @@ describe('randBetween', function () { // <-- const iterations = 10; -const bitLengths$1 = [0, 3, 8, 16, 511, 2048]; -const byteLengths = [0, 1, 8, 33, 40]; +const bitLengths$1 = [-1, 0, 3, 8, 16, 511, 2048]; +const byteLengths = [-7, 0, 1, 8, 33, 40]; describe('testing randBits', async function () { for (const bitLength of bitLengths$1) { - describe(`${iterations} of randBitsSync(${bitLength})`, function () { - for (let i = 0; i < iterations; i++) { - it('should return a buffer', function () { - try { + describe(`${iterations} iterations of randBitsSync(${bitLength})`, function () { + if (bitLength > 0) { + it('should return buffers', function () { + let ret = true; + for (let i = 0; i < iterations; i++) { const randbits = _pkg.randBitsSync(bitLength); // console.log(JSON.stringify(randbits)) - if (randbits instanceof Uint8Array) chai.expect(randbits).to.be.an.instanceOf(Uint8Array); - else chai.expect(randbits).to.be.an.instanceOf(Buffer); const randbits2 = _pkg.randBitsSync(bitLength, true); // console.log(JSON.stringify(randbits2)) - if (randbits2 instanceof Uint8Array) chai.expect(randbits2).to.be.an.instanceOf(Uint8Array); - else chai.expect(randbits2).to.be.an.instanceOf(Buffer); - } catch (error) { - chai.expect(bitLength).to.be.lte(0); + if (!(((randbits instanceof Uint8Array) && (randbits2 instanceof Uint8Array)) || + ((randbits instanceof Buffer) && (randbits2 instanceof Buffer)))) { + ret = false; + break + } } + chai.expect(ret).to.equal(true); + }); + } else { + it('should throw RangeError', function () { + chai.expect(() => _pkg.randBitsSync(bitLength)).to.throw(RangeError); }); } }); - describe(`${iterations} of randBits(${bitLength})`, async function () { - for (let i = 0; i < iterations; i++) { - it('should return a buffer', async function () { - try { + describe(`${iterations} iterations of randBits(${bitLength})`, async function () { + if (bitLength > 0) { + it('should return buffers', async function () { + let ret = true; + for (let i = 0; i < iterations; i++) { const randbits = await _pkg.randBits(bitLength); // console.log(JSON.stringify(randbits)) - if (randbits instanceof Uint8Array) chai.expect(randbits).to.be.an.instanceOf(Uint8Array); - else chai.expect(randbits).to.be.an.instanceOf(Buffer); const randbits2 = await _pkg.randBits(bitLength, true); // console.log(JSON.stringify(randbits2)) - if (randbits2 instanceof Uint8Array) chai.expect(randbits2).to.be.an.instanceOf(Uint8Array); - else chai.expect(randbits2).to.be.an.instanceOf(Buffer); - } catch (error) { - chai.expect(bitLength).to.be.lte(0); + if (!(((randbits instanceof Uint8Array) && (randbits2 instanceof Uint8Array)) || + ((randbits instanceof Buffer) && (randbits2 instanceof Buffer)))) { + ret = false; + break + } } + chai.expect(ret).to.equal(true); + }); + } else { + it('should throw RangeError', function () { + chai.expect(() => _pkg.randBits(bitLength)).to.throw(RangeError); }); } }); @@ -291,39 +288,47 @@ describe('testing randBits', async function () { describe('testing randBytes', async function () { for (const byteLength of byteLengths) { - describe(`${iterations} of randBytesSync(${byteLength})`, function () { - for (let i = 0; i < iterations; i++) { - it('should return a buffer', function () { - try { - const randbits = _pkg.randBytesSync(byteLength); - console.log(JSON.stringify(randbits)); - if (randbits instanceof Uint8Array) chai.expect(randbits).to.be.an.instanceOf(Uint8Array); - else chai.expect(randbits).to.be.an.instanceOf(Buffer); - const randbits2 = _pkg.randBytesSync(byteLength, true); - console.log(JSON.stringify(randbits2)); - if (randbits2 instanceof Uint8Array) chai.expect(randbits2).to.be.an.instanceOf(Uint8Array); - else chai.expect(randbits2).to.be.an.instanceOf(Buffer); - } catch (error) { - chai.expect(byteLength).to.be.lte(0); + describe(`${iterations} iterations of randBytesSync(${byteLength})`, function () { + if (byteLength > 0) { + it('should return buffers', function () { + let ret = true; + for (let i = 0; i < iterations; i++) { + const randbytes = _pkg.randBytesSync(byteLength); + // console.log(JSON.stringify(randbits)) + const randbytes2 = _pkg.randBytesSync(byteLength, true); + // console.log(JSON.stringify(randbits2)) + if (!(((randbytes instanceof Uint8Array) && (randbytes2 instanceof Uint8Array)) || + ((randbytes instanceof Buffer) && (randbytes2 instanceof Buffer)))) { + ret = false; + } } + chai.expect(ret).to.equal(true); + }); + } else { + it('should throw RangeError', function () { + chai.expect(() => _pkg.randBytesSync(byteLength)).to.throw(RangeError); }); } }); - describe(`${iterations} of randBytes(${byteLength})`, async function () { - for (let i = 0; i < iterations; i++) { - it('should return a buffer', async function () { - try { - const randbits = await _pkg.randBytes(byteLength); - console.log(JSON.stringify(randbits)); - if (randbits instanceof Uint8Array) chai.expect(randbits).to.be.an.instanceOf(Uint8Array); - else chai.expect(randbits).to.be.an.instanceOf(Buffer); - const randbits2 = await _pkg.randBytes(byteLength, true); - console.log(JSON.stringify(randbits2)); - if (randbits2 instanceof Uint8Array) chai.expect(randbits2).to.be.an.instanceOf(Uint8Array); - else chai.expect(randbits2).to.be.an.instanceOf(Buffer); - } catch (error) { - chai.expect(byteLength).to.be.lte(0); + describe(`${iterations} iterations of randBytes(${byteLength})`, async function () { + if (byteLength > 0) { + it('should return buffers', async function () { + let ret = true; + for (let i = 0; i < iterations; i++) { + const randbytes = await _pkg.randBytes(byteLength); + // console.log(JSON.stringify(randbits)) + const randbytes2 = await _pkg.randBytes(byteLength, true); + // console.log(JSON.stringify(randbits2)) + if (!(((randbytes instanceof Uint8Array) && (randbytes2 instanceof Uint8Array)) || + ((randbytes instanceof Buffer) && (randbytes2 instanceof Buffer)))) { + ret = false; + } } + chai.expect(ret).to.equal(true); + }); + } else { + it('should throw RangeError', function () { + chai.expect(() => _pkg.randBytes(byteLength)).to.throw(RangeError); }); } }); diff --git a/test/prime.js b/test/prime.js index 8956df4..a842c56 100644 --- a/test/prime.js +++ b/test/prime.js @@ -18,30 +18,27 @@ const bitLengths = [ 3072 ] -describe('prime', function () { +describe('Testing prime generation', function () { this.timeout(120000) for (const bitLength of bitLengths) { describe(`prime(${bitLength})`, function () { - it(`should return a random ${bitLength}-bits probable prime`, async function () { - let primeBitLength = bitLength - try { + if (bitLength > 0) { + it(`should return a random ${bitLength}-bits probable prime`, async function () { const prime = await _pkg.prime(bitLength) - primeBitLength = _pkg.bitLength(prime) - } catch {} - chai.expect(primeBitLength).to.equal(bitLength) - }) + chai.expect(_pkg.bitLength(prime)).to.equal(bitLength) + }) + } else { + it('should throw error', async function () { + chai.expect(() => _pkg.prime(bitLength)).to.throw(RangeError) + }) + } }) } describe('Testing sync (NOT-RECOMMENDED) version: primeSync()', function () { it('should return a random 1024-bits probable prime', function () { const prime = _pkg.primeSync(1024, 16) - const primeBitLength = _pkg.bitLength(prime) - chai.expect(primeBitLength).to.equal(1024) - try { - _pkg.primeSync(0) - } catch (error) { - chai.expect(true).to.equal(true) - } + chai.expect(_pkg.bitLength(prime)).to.equal(1024) + chai.expect(() => _pkg.primeSync(0)).to.throw(RangeError) }) }) }) diff --git a/test/randBetween.js b/test/randBetween.js index 88c1d47..94c3291 100644 --- a/test/randBetween.js +++ b/test/randBetween.js @@ -65,13 +65,8 @@ describe('randBetween', function () { chai.expect(ret).to.equal(true) }) } else { - it('should return error (max <=0 || min <0 || min>=max)', function () { - try { - _pkg.randBetween(num.max, num.min) - chai.expect(num.error).to.equal(false) - } catch (error) { - chai.expect(num.error).to.equal(true) - } + it('should throw RangeError (max <=0 || min <0 || min>=max)', function () { + chai.expect(() => _pkg.randBetween(num.max, num.min)).to.throw(RangeError) }) } }) @@ -86,13 +81,8 @@ describe('randBetween', function () { chai.expect(ret).to.equal(true) }) } else { - it('should return error (max <=0)', function () { - try { - _pkg.randBetween(num.max) - chai.expect(num.errorMax).to.equal(false) - } catch (error) { - chai.expect(num.errorMax).to.equal(true) - } + it('should throw RangeError (max <=0)', function () { + chai.expect(() => _pkg.randBetween(num.max)).to.throw(RangeError) }) } }) diff --git a/test/random.js b/test/random.js index 9362bc6..acc7649 100644 --- a/test/random.js +++ b/test/random.js @@ -7,44 +7,54 @@ const chai = require('chai') // <-- const iterations = 10 -const bitLengths = [0, 3, 8, 16, 511, 2048] -const byteLengths = [0, 1, 8, 33, 40] +const bitLengths = [-1, 0, 3, 8, 16, 511, 2048] +const byteLengths = [-7, 0, 1, 8, 33, 40] describe('testing randBits', async function () { for (const bitLength of bitLengths) { - describe(`${iterations} of randBitsSync(${bitLength})`, function () { - for (let i = 0; i < iterations; i++) { - it('should return a buffer', function () { - try { + describe(`${iterations} iterations of randBitsSync(${bitLength})`, function () { + if (bitLength > 0) { + it('should return buffers', function () { + let ret = true + for (let i = 0; i < iterations; i++) { const randbits = _pkg.randBitsSync(bitLength) // console.log(JSON.stringify(randbits)) - if (randbits instanceof Uint8Array) chai.expect(randbits).to.be.an.instanceOf(Uint8Array) - else chai.expect(randbits).to.be.an.instanceOf(Buffer) const randbits2 = _pkg.randBitsSync(bitLength, true) // console.log(JSON.stringify(randbits2)) - if (randbits2 instanceof Uint8Array) chai.expect(randbits2).to.be.an.instanceOf(Uint8Array) - else chai.expect(randbits2).to.be.an.instanceOf(Buffer) - } catch (error) { - chai.expect(bitLength).to.be.lte(0) + if (!(((randbits instanceof Uint8Array) && (randbits2 instanceof Uint8Array)) || + ((randbits instanceof Buffer) && (randbits2 instanceof Buffer)))) { + ret = false + break + } } + chai.expect(ret).to.equal(true) + }) + } else { + it('should throw RangeError', function () { + chai.expect(() => _pkg.randBitsSync(bitLength)).to.throw(RangeError) }) } }) - describe(`${iterations} of randBits(${bitLength})`, async function () { - for (let i = 0; i < iterations; i++) { - it('should return a buffer', async function () { - try { + describe(`${iterations} iterations of randBits(${bitLength})`, async function () { + if (bitLength > 0) { + it('should return buffers', async function () { + let ret = true + for (let i = 0; i < iterations; i++) { const randbits = await _pkg.randBits(bitLength) // console.log(JSON.stringify(randbits)) - if (randbits instanceof Uint8Array) chai.expect(randbits).to.be.an.instanceOf(Uint8Array) - else chai.expect(randbits).to.be.an.instanceOf(Buffer) const randbits2 = await _pkg.randBits(bitLength, true) // console.log(JSON.stringify(randbits2)) - if (randbits2 instanceof Uint8Array) chai.expect(randbits2).to.be.an.instanceOf(Uint8Array) - else chai.expect(randbits2).to.be.an.instanceOf(Buffer) - } catch (error) { - chai.expect(bitLength).to.be.lte(0) + if (!(((randbits instanceof Uint8Array) && (randbits2 instanceof Uint8Array)) || + ((randbits instanceof Buffer) && (randbits2 instanceof Buffer)))) { + ret = false + break + } } + chai.expect(ret).to.equal(true) + }) + } else { + it('should throw RangeError', function () { + chai.expect(() => _pkg.randBits(bitLength)).to.throw(RangeError) }) } }) @@ -53,39 +63,47 @@ describe('testing randBits', async function () { describe('testing randBytes', async function () { for (const byteLength of byteLengths) { - describe(`${iterations} of randBytesSync(${byteLength})`, function () { - for (let i = 0; i < iterations; i++) { - it('should return a buffer', function () { - try { - const randbits = _pkg.randBytesSync(byteLength) - console.log(JSON.stringify(randbits)) - if (randbits instanceof Uint8Array) chai.expect(randbits).to.be.an.instanceOf(Uint8Array) - else chai.expect(randbits).to.be.an.instanceOf(Buffer) - const randbits2 = _pkg.randBytesSync(byteLength, true) - console.log(JSON.stringify(randbits2)) - if (randbits2 instanceof Uint8Array) chai.expect(randbits2).to.be.an.instanceOf(Uint8Array) - else chai.expect(randbits2).to.be.an.instanceOf(Buffer) - } catch (error) { - chai.expect(byteLength).to.be.lte(0) + describe(`${iterations} iterations of randBytesSync(${byteLength})`, function () { + if (byteLength > 0) { + it('should return buffers', function () { + let ret = true + for (let i = 0; i < iterations; i++) { + const randbytes = _pkg.randBytesSync(byteLength) + // console.log(JSON.stringify(randbits)) + const randbytes2 = _pkg.randBytesSync(byteLength, true) + // console.log(JSON.stringify(randbits2)) + if (!(((randbytes instanceof Uint8Array) && (randbytes2 instanceof Uint8Array)) || + ((randbytes instanceof Buffer) && (randbytes2 instanceof Buffer)))) { + ret = false + } } + chai.expect(ret).to.equal(true) + }) + } else { + it('should throw RangeError', function () { + chai.expect(() => _pkg.randBytesSync(byteLength)).to.throw(RangeError) }) } }) - describe(`${iterations} of randBytes(${byteLength})`, async function () { - for (let i = 0; i < iterations; i++) { - it('should return a buffer', async function () { - try { - const randbits = await _pkg.randBytes(byteLength) - console.log(JSON.stringify(randbits)) - if (randbits instanceof Uint8Array) chai.expect(randbits).to.be.an.instanceOf(Uint8Array) - else chai.expect(randbits).to.be.an.instanceOf(Buffer) - const randbits2 = await _pkg.randBytes(byteLength, true) - console.log(JSON.stringify(randbits2)) - if (randbits2 instanceof Uint8Array) chai.expect(randbits2).to.be.an.instanceOf(Uint8Array) - else chai.expect(randbits2).to.be.an.instanceOf(Buffer) - } catch (error) { - chai.expect(byteLength).to.be.lte(0) + describe(`${iterations} iterations of randBytes(${byteLength})`, async function () { + if (byteLength > 0) { + it('should return buffers', async function () { + let ret = true + for (let i = 0; i < iterations; i++) { + const randbytes = await _pkg.randBytes(byteLength) + // console.log(JSON.stringify(randbits)) + const randbytes2 = await _pkg.randBytes(byteLength, true) + // console.log(JSON.stringify(randbits2)) + if (!(((randbytes instanceof Uint8Array) && (randbytes2 instanceof Uint8Array)) || + ((randbytes instanceof Buffer) && (randbytes2 instanceof Buffer)))) { + ret = false + } } + chai.expect(ret).to.equal(true) + }) + } else { + it('should throw RangeError', function () { + chai.expect(() => _pkg.randBytes(byteLength)).to.throw(RangeError) }) } })