@grandom/boolean-umd/basic.min.js

Various UMD builds of a great random boolean generator.

/*!
* @grandom/boolean v1.4.7
* https://github.com/grandom-library/grandom-js/tree/main/packages/boolean#readme
*
* Copyright (c) 2023 Richard King <richrdkng@gmail.com> (www.richrdkng.com)
* Released under the MIT License
* https://github.com/grandom-library/grandom-js/tree/main/packages/boolean#readme/blob/main/LICENSE
*
* Date: 2023-09-06T22:04:47.368Z
*/
!function(e,t){"object"==typeof exports&&"undefined"!=typeof module?module.exports=t():"function"==typeof define&&define.amd?define(t):(e="undefined"!=typeof globalThis?globalThis:e||self).grandomBooleanBasic=t()}(this,(function(){"use strict";function e(e){return e&&e.__esModule&&Object.prototype.hasOwnProperty.call(e,"default")?e.default:e}var t={};class n{constructor(e){this._name=e}_next(){throw new Error("_next() must be implemented.")}get name(){return this._name}nextBoolean(){return this._next()<.5}nextInteger(e=n.DEFAULT_INTEGER_MINIMUM,t=n.DEFAULT_INTEGER_MAXIMUM,r=n.DEFAULT_INCLUDE_MINIMUM,o=n.DEFAULT_INCLUDE_MAXIMUM){let M=0,I=0;return r&&!o?(M=0,I=0):r&&o?I=1:!r&&o?M=1:(M=1,I=-1),Math.floor(this._next()*(t-e+I))+e+M}nextFloat(e=n.DEFAULT_FLOAT_MINIMUM,t=n.DEFAULT_FLOAT_MAXIMUM,r=n.DEFAULT_INCLUDE_MINIMUM,o=n.DEFAULT_INCLUDE_MAXIMUM){const M=this._next()*(t-e)+e;if(r&&!o)return M;{const n=M+Number.EPSILON*M;return r&&o?n<t?n:t:!r&&o?n>e?n:e+Number.EPSILON:n<=e?e+Number.EPSILON:n>=t?t-Number.EPSILON:n}}nextBigInt(e=n.DEFAULT_BIGINT_MINIMUM,t=n.DEFAULT_BIGINT_MAXIMUM,r=n.DEFAULT_INCLUDE_MINIMUM,o=n.DEFAULT_INCLUDE_MAXIMUM){let M=0n,I=0n;return r&&!o?(M=0n,I=0n):r&&o?I=1n:!r&&o?M=1n:(M=1n,I=-1n),BigInt(Math.floor(this._next()*Number.MAX_SAFE_INTEGER))*(BigInt(t)-BigInt(e)+I)/BigInt(Number.MAX_SAFE_INTEGER)+BigInt(e)+M}nextString(e,t){const n=t.length;let r="";for(let o=0;o<e;o++)r+=t.charAt(Math.floor(this._next()*n));return r}nextWeighted(e,t){let n=0;for(let e=0;e<t.length;e++)n+=t[e];const r=this._next()*n;let o=0;for(let n=0;n<e.length;n++)if(o+=t[n],o>r)return e[n];return e[e.length-1]}pickArray(e){return e[Math.floor(this._next()*e.length)]}shuffleArray(e){let t,n;for(let r=e.length-1;r>0;r--)t=Math.floor(this._next()*(r+1)),n=e[r],e[r]=e[t],e[t]=n}}n.DEFAULT_INCLUDE_MINIMUM=!0,n.DEFAULT_INCLUDE_MAXIMUM=!1,n.DEFAULT_FLOAT_MINIMUM=0,n.DEFAULT_FLOAT_MAXIMUM=1,n.DEFAULT_INTEGER_MINIMUM=0,n.DEFAULT_INTEGER_MAXIMUM=4294967296,n.DEFAULT_BIGINT_MINIMUM=0n,n.DEFAULT_BIGINT_MAXIMUM=18446744073709551616n;var r=n;var o=r,M=class{constructor(e){this._engine=e}get engine(){return this._engine}};t.RandomEngine=o;var I=t.RandomGenerator=M,_=t;class i extends _.RandomEngine{constructor(){super("basic")}_next(){return Math.random()}}var s=e(i);class E extends I{boolean(e){if(void 0!==e){if("number"!=typeof e)throw new TypeError(`bias must be a number, got: ${typeof e}.`);if(e==e)return e<0?e=0:e>1&&(e=1),this._engine.nextFloat()<e}return this._engine.nextBoolean()}}const a=new E(new s),l=a.boolean.bind(a);return Object.defineProperties(l,{BasicEngine:{value:s},RandomBoolean:{value:E}}),l}));
//# sourceMappingURL=basic.min.js.map