lib0 0.2.117 → 1.0.0-0

package/dist/prng-37d48618.cjs

@@ -1,387 +0,0 @@
-'use strict';
-
-var binary = require('./binary-ac8e39e2.cjs');
-var string = require('./string-fddc5f8b.cjs');
-var math = require('./math-96d5e8c4.cjs');
-var buffer = require('./buffer-3e750729.cjs');
-
-/**
- * @module prng
- */
-
-/**
- * Xorshift32 is a very simple but elegang PRNG with a period of `2^32-1`.
- */
-class Xorshift32 {
-  /**
-   * @param {number} seed Unsigned 32 bit number
-   */
-  constructor (seed) {
-    this.seed = seed;
-    /**
-     * @type {number}
-     */
-    this._state = seed;
-  }
-
-  /**
-   * Generate a random signed integer.
-   *
-   * @return {Number} A 32 bit signed integer.
-   */
-  next () {
-    let x = this._state;
-    x ^= x << 13;
-    x ^= x >> 17;
-    x ^= x << 5;
-    this._state = x;
-    return (x >>> 0) / (binary.BITS32 + 1)
-  }
-}
-
-/**
- * @module prng
- */
-
-/**
- * This is a variant of xoroshiro128plus - the fastest full-period generator passing BigCrush without systematic failures.
- *
- * This implementation follows the idea of the original xoroshiro128plus implementation,
- * but is optimized for the JavaScript runtime. I.e.
- * * The operations are performed on 32bit integers (the original implementation works with 64bit values).
- * * The initial 128bit state is computed based on a 32bit seed and Xorshift32.
- * * This implementation returns two 32bit values based on the 64bit value that is computed by xoroshiro128plus.
- *   Caution: The last addition step works slightly different than in the original implementation - the add carry of the
- *   first 32bit addition is not carried over to the last 32bit.
- *
- * [Reference implementation](http://vigna.di.unimi.it/xorshift/xoroshiro128plus.c)
- */
-class Xoroshiro128plus {
-  /**
-   * @param {number} seed Unsigned 32 bit number
-   */
-  constructor (seed) {
-    this.seed = seed;
-    // This is a variant of Xoroshiro128plus to fill the initial state
-    const xorshift32 = new Xorshift32(seed);
-    this.state = new Uint32Array(4);
-    for (let i = 0; i < 4; i++) {
-      this.state[i] = xorshift32.next() * binary.BITS32;
-    }
-    this._fresh = true;
-  }
-
-  /**
-   * @return {number} Float/Double in [0,1)
-   */
-  next () {
-    const state = this.state;
-    if (this._fresh) {
-      this._fresh = false;
-      return ((state[0] + state[2]) >>> 0) / (binary.BITS32 + 1)
-    } else {
-      this._fresh = true;
-      const s0 = state[0];
-      const s1 = state[1];
-      const s2 = state[2] ^ s0;
-      const s3 = state[3] ^ s1;
-      // function js_rotl (x, k) {
-      //   k = k - 32
-      //   const x1 = x[0]
-      //   const x2 = x[1]
-      //   x[0] = x2 << k | x1 >>> (32 - k)
-      //   x[1] = x1 << k | x2 >>> (32 - k)
-      // }
-      // rotl(s0, 55) // k = 23 = 55 - 32; j = 9 =  32 - 23
-      state[0] = (s1 << 23 | s0 >>> 9) ^ s2 ^ (s2 << 14 | s3 >>> 18);
-      state[1] = (s0 << 23 | s1 >>> 9) ^ s3 ^ (s3 << 14);
-      // rol(s1, 36) // k = 4 = 36 - 32; j = 23 = 32 - 9
-      state[2] = s3 << 4 | s2 >>> 28;
-      state[3] = s2 << 4 | s3 >>> 28;
-      return (((state[1] + state[3]) >>> 0) / (binary.BITS32 + 1))
-    }
-  }
-}
-
-/*
-// Reference implementation
-// Source: http://vigna.di.unimi.it/xorshift/xoroshiro128plus.c
-// By David Blackman and Sebastiano Vigna
-// Who published the reference implementation under Public Domain (CC0)
-
-#include <stdint.h>
-#include <stdio.h>
-
-uint64_t s[2];
-
-static inline uint64_t rotl(const uint64_t x, int k) {
-    return (x << k) | (x >> (64 - k));
-}
-
-uint64_t next(void) {
-    const uint64_t s0 = s[0];
-    uint64_t s1 = s[1];
-    s1 ^= s0;
-    s[0] = rotl(s0, 55) ^ s1 ^ (s1 << 14); // a, b
-    s[1] = rotl(s1, 36); // c
-    return (s[0] + s[1]) & 0xFFFFFFFF;
-}
-
-int main(void)
-{
-    int i;
-    s[0] = 1111 | (1337ul << 32);
-    s[1] = 1234 | (9999ul << 32);
-
-    printf("1000 outputs of genrand_int31()\n");
-    for (i=0; i<100; i++) {
-        printf("%10lu ", i);
-        printf("%10lu ", next());
-        printf("- %10lu ", s[0] >> 32);
-        printf("%10lu ", (s[0] << 32) >> 32);
-        printf("%10lu ", s[1] >> 32);
-        printf("%10lu ", (s[1] << 32) >> 32);
-        printf("\n");
-        // if (i%5==4) printf("\n");
-    }
-    return 0;
-}
-*/
-
-/**
- * Fast Pseudo Random Number Generators.
- *
- * Given a seed a PRNG generates a sequence of numbers that cannot be reasonably predicted.
- * Two PRNGs must generate the same random sequence of numbers if  given the same seed.
- *
- * @module prng
- */
-
-/**
- * Description of the function
- *  @callback generatorNext
- *  @return {number} A random float in the cange of [0,1)
- */
-
-/**
- * A random type generator.
- *
- * @typedef {Object} PRNG
- * @property {generatorNext} next Generate new number
- */
-const DefaultPRNG = Xoroshiro128plus;
-
-/**
- * Create a Xoroshiro128plus Pseudo-Random-Number-Generator.
- * This is the fastest full-period generator passing BigCrush without systematic failures.
- * But there are more PRNGs available in ./PRNG/.
- *
- * @param {number} seed A positive 32bit integer. Do not use negative numbers.
- * @return {PRNG}
- */
-const create = seed => new DefaultPRNG(seed);
-
-/**
- * Generates a single random bool.
- *
- * @param {PRNG} gen A random number generator.
- * @return {Boolean} A random boolean
- */
-const bool = gen => (gen.next() >= 0.5);
-
-/**
- * Generates a random integer with 53 bit resolution.
- *
- * @param {PRNG} gen A random number generator.
- * @param {Number} min The lower bound of the allowed return values (inclusive).
- * @param {Number} max The upper bound of the allowed return values (inclusive).
- * @return {Number} A random integer on [min, max]
- */
-const int53 = (gen, min, max) => math.floor(gen.next() * (max + 1 - min) + min);
-
-/**
- * Generates a random integer with 53 bit resolution.
- *
- * @param {PRNG} gen A random number generator.
- * @param {Number} min The lower bound of the allowed return values (inclusive).
- * @param {Number} max The upper bound of the allowed return values (inclusive).
- * @return {Number} A random integer on [min, max]
- */
-const uint53 = (gen, min, max) => math.abs(int53(gen, min, max));
-
-/**
- * Generates a random integer with 32 bit resolution.
- *
- * @param {PRNG} gen A random number generator.
- * @param {Number} min The lower bound of the allowed return values (inclusive).
- * @param {Number} max The upper bound of the allowed return values (inclusive).
- * @return {Number} A random integer on [min, max]
- */
-const int32 = (gen, min, max) => math.floor(gen.next() * (max + 1 - min) + min);
-
-/**
- * Generates a random integer with 53 bit resolution.
- *
- * @param {PRNG} gen A random number generator.
- * @param {Number} min The lower bound of the allowed return values (inclusive).
- * @param {Number} max The upper bound of the allowed return values (inclusive).
- * @return {Number} A random integer on [min, max]
- */
-const uint32 = (gen, min, max) => int32(gen, min, max) >>> 0;
-
-/**
- * @deprecated
- * Optimized version of prng.int32. It has the same precision as prng.int32, but should be preferred when
- * openaring on smaller ranges.
- *
- * @param {PRNG} gen A random number generator.
- * @param {Number} min The lower bound of the allowed return values (inclusive).
- * @param {Number} max The upper bound of the allowed return values (inclusive). The max inclusive number is `binary.BITS31-1`
- * @return {Number} A random integer on [min, max]
- */
-const int31 = (gen, min, max) => int32(gen, min, max);
-
-/**
- * Generates a random real on [0, 1) with 53 bit resolution.
- *
- * @param {PRNG} gen A random number generator.
- * @return {Number} A random real number on [0, 1).
- */
-const real53 = gen => gen.next(); // (((gen.next() >>> 5) * binary.BIT26) + (gen.next() >>> 6)) / MAX_SAFE_INTEGER
-
-/**
- * Generates a random character from char code 32 - 126. I.e. Characters, Numbers, special characters, and Space:
- *
- * @param {PRNG} gen A random number generator.
- * @return {string}
- *
- * (Space)!"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[/]^_`abcdefghijklmnopqrstuvwxyz{|}~
- */
-const char = gen => string.fromCharCode(int31(gen, 32, 126));
-
-/**
- * @param {PRNG} gen
- * @return {string} A single letter (a-z)
- */
-const letter = gen => string.fromCharCode(int31(gen, 97, 122));
-
-/**
- * @param {PRNG} gen
- * @param {number} [minLen=0]
- * @param {number} [maxLen=20]
- * @return {string} A random word (0-20 characters) without spaces consisting of letters (a-z)
- */
-const word = (gen, minLen = 0, maxLen = 20) => {
-  const len = int31(gen, minLen, maxLen);
-  let str = '';
-  for (let i = 0; i < len; i++) {
-    str += letter(gen);
-  }
-  return str
-};
-
-/**
- * TODO: this function produces invalid runes. Does not cover all of utf16!!
- *
- * @param {PRNG} gen
- * @return {string}
- */
-const utf16Rune = gen => {
-  const codepoint = int31(gen, 0, 256);
-  return string.fromCodePoint(codepoint)
-};
-
-/**
- * @param {PRNG} gen
- * @param {number} [maxlen = 20]
- */
-const utf16String = (gen, maxlen = 20) => {
-  const len = int31(gen, 0, maxlen);
-  let str = '';
-  for (let i = 0; i < len; i++) {
-    str += utf16Rune(gen);
-  }
-  return str
-};
-
-/**
- * Returns one element of a given array.
- *
- * @param {PRNG} gen A random number generator.
- * @param {Array<T>} array Non empty Array of possible values.
- * @return {T} One of the values of the supplied Array.
- * @template T
- */
-const oneOf = (gen, array) => array[int31(gen, 0, array.length - 1)];
-
-/**
- * @param {PRNG} gen
- * @param {number} len
- * @return {Uint8Array<ArrayBuffer>}
- */
-const uint8Array = (gen, len) => {
-  const buf = buffer.createUint8ArrayFromLen(len);
-  for (let i = 0; i < buf.length; i++) {
-    buf[i] = int32(gen, 0, binary.BITS8);
-  }
-  return buf
-};
-
-/* c8 ignore start */
-/**
- * @param {PRNG} gen
- * @param {number} len
- * @return {Uint16Array}
- */
-const uint16Array = (gen, len) => new Uint16Array(uint8Array(gen, len * 2).buffer);
-
-/**
- * @param {PRNG} gen
- * @param {number} len
- * @return {Uint32Array}
- */
-const uint32Array = (gen, len) => new Uint32Array(uint8Array(gen, len * 4).buffer);
-/* c8 ignore stop */
-
-var prng = /*#__PURE__*/Object.freeze({
-  __proto__: null,
-  DefaultPRNG: DefaultPRNG,
-  create: create,
-  bool: bool,
-  int53: int53,
-  uint53: uint53,
-  int32: int32,
-  uint32: uint32,
-  int31: int31,
-  real53: real53,
-  char: char,
-  letter: letter,
-  word: word,
-  utf16Rune: utf16Rune,
-  utf16String: utf16String,
-  oneOf: oneOf,
-  uint8Array: uint8Array,
-  uint16Array: uint16Array,
-  uint32Array: uint32Array
-});
-
-exports.DefaultPRNG = DefaultPRNG;
-exports.bool = bool;
-exports.char = char;
-exports.create = create;
-exports.int31 = int31;
-exports.int32 = int32;
-exports.int53 = int53;
-exports.letter = letter;
-exports.oneOf = oneOf;
-exports.prng = prng;
-exports.real53 = real53;
-exports.uint16Array = uint16Array;
-exports.uint32 = uint32;
-exports.uint32Array = uint32Array;
-exports.uint53 = uint53;
-exports.uint8Array = uint8Array;
-exports.utf16Rune = utf16Rune;
-exports.utf16String = utf16String;
-exports.word = word;
-//# sourceMappingURL=prng-37d48618.cjs.map

package/dist/prng-37d48618.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"prng-37d48618.cjs","sources":["../prng/Xorshift32.js","../prng/Xoroshiro128plus.js","../prng.js"],"sourcesContent":["/**\n * @module prng\n */\n\nimport * as binary from '../binary.js'\n\n/**\n * Xorshift32 is a very simple but elegang PRNG with a period of `2^32-1`.\n */\nexport class Xorshift32 {\n  /**\n   * @param {number} seed Unsigned 32 bit number\n   */\n  constructor (seed) {\n    this.seed = seed\n    /**\n     * @type {number}\n     */\n    this._state = seed\n  }\n\n  /**\n   * Generate a random signed integer.\n   *\n   * @return {Number} A 32 bit signed integer.\n   */\n  next () {\n    let x = this._state\n    x ^= x << 13\n    x ^= x >> 17\n    x ^= x << 5\n    this._state = x\n    return (x >>> 0) / (binary.BITS32 + 1)\n  }\n}\n","/**\n * @module prng\n */\n\nimport { Xorshift32 } from './Xorshift32.js'\nimport * as binary from '../binary.js'\n\n/**\n * This is a variant of xoroshiro128plus - the fastest full-period generator passing BigCrush without systematic failures.\n *\n * This implementation follows the idea of the original xoroshiro128plus implementation,\n * but is optimized for the JavaScript runtime. I.e.\n * * The operations are performed on 32bit integers (the original implementation works with 64bit values).\n * * The initial 128bit state is computed based on a 32bit seed and Xorshift32.\n * * This implementation returns two 32bit values based on the 64bit value that is computed by xoroshiro128plus.\n *   Caution: The last addition step works slightly different than in the original implementation - the add carry of the\n *   first 32bit addition is not carried over to the last 32bit.\n *\n * [Reference implementation](http://vigna.di.unimi.it/xorshift/xoroshiro128plus.c)\n */\nexport class Xoroshiro128plus {\n  /**\n   * @param {number} seed Unsigned 32 bit number\n   */\n  constructor (seed) {\n    this.seed = seed\n    // This is a variant of Xoroshiro128plus to fill the initial state\n    const xorshift32 = new Xorshift32(seed)\n    this.state = new Uint32Array(4)\n    for (let i = 0; i < 4; i++) {\n      this.state[i] = xorshift32.next() * binary.BITS32\n    }\n    this._fresh = true\n  }\n\n  /**\n   * @return {number} Float/Double in [0,1)\n   */\n  next () {\n    const state = this.state\n    if (this._fresh) {\n      this._fresh = false\n      return ((state[0] + state[2]) >>> 0) / (binary.BITS32 + 1)\n    } else {\n      this._fresh = true\n      const s0 = state[0]\n      const s1 = state[1]\n      const s2 = state[2] ^ s0\n      const s3 = state[3] ^ s1\n      // function js_rotl (x, k) {\n      //   k = k - 32\n      //   const x1 = x[0]\n      //   const x2 = x[1]\n      //   x[0] = x2 << k | x1 >>> (32 - k)\n      //   x[1] = x1 << k | x2 >>> (32 - k)\n      // }\n      // rotl(s0, 55) // k = 23 = 55 - 32; j = 9 =  32 - 23\n      state[0] = (s1 << 23 | s0 >>> 9) ^ s2 ^ (s2 << 14 | s3 >>> 18)\n      state[1] = (s0 << 23 | s1 >>> 9) ^ s3 ^ (s3 << 14)\n      // rol(s1, 36) // k = 4 = 36 - 32; j = 23 = 32 - 9\n      state[2] = s3 << 4 | s2 >>> 28\n      state[3] = s2 << 4 | s3 >>> 28\n      return (((state[1] + state[3]) >>> 0) / (binary.BITS32 + 1))\n    }\n  }\n}\n\n/*\n// Reference implementation\n// Source: http://vigna.di.unimi.it/xorshift/xoroshiro128plus.c\n// By David Blackman and Sebastiano Vigna\n// Who published the reference implementation under Public Domain (CC0)\n\n#include <stdint.h>\n#include <stdio.h>\n\nuint64_t s[2];\n\nstatic inline uint64_t rotl(const uint64_t x, int k) {\n    return (x << k) | (x >> (64 - k));\n}\n\nuint64_t next(void) {\n    const uint64_t s0 = s[0];\n    uint64_t s1 = s[1];\n    s1 ^= s0;\n    s[0] = rotl(s0, 55) ^ s1 ^ (s1 << 14); // a, b\n    s[1] = rotl(s1, 36); // c\n    return (s[0] + s[1]) & 0xFFFFFFFF;\n}\n\nint main(void)\n{\n    int i;\n    s[0] = 1111 | (1337ul << 32);\n    s[1] = 1234 | (9999ul << 32);\n\n    printf(\"1000 outputs of genrand_int31()\\n\");\n    for (i=0; i<100; i++) {\n        printf(\"%10lu \", i);\n        printf(\"%10lu \", next());\n        printf(\"- %10lu \", s[0] >> 32);\n        printf(\"%10lu \", (s[0] << 32) >> 32);\n        printf(\"%10lu \", s[1] >> 32);\n        printf(\"%10lu \", (s[1] << 32) >> 32);\n        printf(\"\\n\");\n        // if (i%5==4) printf(\"\\n\");\n    }\n    return 0;\n}\n*/\n","/**\n * Fast Pseudo Random Number Generators.\n *\n * Given a seed a PRNG generates a sequence of numbers that cannot be reasonably predicted.\n * Two PRNGs must generate the same random sequence of numbers if  given the same seed.\n *\n * @module prng\n */\n\nimport * as binary from './binary.js'\nimport { fromCharCode, fromCodePoint } from './string.js'\nimport * as math from './math.js'\nimport { Xoroshiro128plus } from './prng/Xoroshiro128plus.js'\nimport * as buffer from './buffer.js'\n\n/**\n * Description of the function\n *  @callback generatorNext\n *  @return {number} A random float in the cange of [0,1)\n */\n\n/**\n * A random type generator.\n *\n * @typedef {Object} PRNG\n * @property {generatorNext} next Generate new number\n */\nexport const DefaultPRNG = Xoroshiro128plus\n\n/**\n * Create a Xoroshiro128plus Pseudo-Random-Number-Generator.\n * This is the fastest full-period generator passing BigCrush without systematic failures.\n * But there are more PRNGs available in ./PRNG/.\n *\n * @param {number} seed A positive 32bit integer. Do not use negative numbers.\n * @return {PRNG}\n */\nexport const create = seed => new DefaultPRNG(seed)\n\n/**\n * Generates a single random bool.\n *\n * @param {PRNG} gen A random number generator.\n * @return {Boolean} A random boolean\n */\nexport const bool = gen => (gen.next() >= 0.5)\n\n/**\n * Generates a random integer with 53 bit resolution.\n *\n * @param {PRNG} gen A random number generator.\n * @param {Number} min The lower bound of the allowed return values (inclusive).\n * @param {Number} max The upper bound of the allowed return values (inclusive).\n * @return {Number} A random integer on [min, max]\n */\nexport const int53 = (gen, min, max) => math.floor(gen.next() * (max + 1 - min) + min)\n\n/**\n * Generates a random integer with 53 bit resolution.\n *\n * @param {PRNG} gen A random number generator.\n * @param {Number} min The lower bound of the allowed return values (inclusive).\n * @param {Number} max The upper bound of the allowed return values (inclusive).\n * @return {Number} A random integer on [min, max]\n */\nexport const uint53 = (gen, min, max) => math.abs(int53(gen, min, max))\n\n/**\n * Generates a random integer with 32 bit resolution.\n *\n * @param {PRNG} gen A random number generator.\n * @param {Number} min The lower bound of the allowed return values (inclusive).\n * @param {Number} max The upper bound of the allowed return values (inclusive).\n * @return {Number} A random integer on [min, max]\n */\nexport const int32 = (gen, min, max) => math.floor(gen.next() * (max + 1 - min) + min)\n\n/**\n * Generates a random integer with 53 bit resolution.\n *\n * @param {PRNG} gen A random number generator.\n * @param {Number} min The lower bound of the allowed return values (inclusive).\n * @param {Number} max The upper bound of the allowed return values (inclusive).\n * @return {Number} A random integer on [min, max]\n */\nexport const uint32 = (gen, min, max) => int32(gen, min, max) >>> 0\n\n/**\n * @deprecated\n * Optimized version of prng.int32. It has the same precision as prng.int32, but should be preferred when\n * openaring on smaller ranges.\n *\n * @param {PRNG} gen A random number generator.\n * @param {Number} min The lower bound of the allowed return values (inclusive).\n * @param {Number} max The upper bound of the allowed return values (inclusive). The max inclusive number is `binary.BITS31-1`\n * @return {Number} A random integer on [min, max]\n */\nexport const int31 = (gen, min, max) => int32(gen, min, max)\n\n/**\n * Generates a random real on [0, 1) with 53 bit resolution.\n *\n * @param {PRNG} gen A random number generator.\n * @return {Number} A random real number on [0, 1).\n */\nexport const real53 = gen => gen.next() // (((gen.next() >>> 5) * binary.BIT26) + (gen.next() >>> 6)) / MAX_SAFE_INTEGER\n\n/**\n * Generates a random character from char code 32 - 126. I.e. Characters, Numbers, special characters, and Space:\n *\n * @param {PRNG} gen A random number generator.\n * @return {string}\n *\n * (Space)!\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[/]^_`abcdefghijklmnopqrstuvwxyz{|}~\n */\nexport const char = gen => fromCharCode(int31(gen, 32, 126))\n\n/**\n * @param {PRNG} gen\n * @return {string} A single letter (a-z)\n */\nexport const letter = gen => fromCharCode(int31(gen, 97, 122))\n\n/**\n * @param {PRNG} gen\n * @param {number} [minLen=0]\n * @param {number} [maxLen=20]\n * @return {string} A random word (0-20 characters) without spaces consisting of letters (a-z)\n */\nexport const word = (gen, minLen = 0, maxLen = 20) => {\n  const len = int31(gen, minLen, maxLen)\n  let str = ''\n  for (let i = 0; i < len; i++) {\n    str += letter(gen)\n  }\n  return str\n}\n\n/**\n * TODO: this function produces invalid runes. Does not cover all of utf16!!\n *\n * @param {PRNG} gen\n * @return {string}\n */\nexport const utf16Rune = gen => {\n  const codepoint = int31(gen, 0, 256)\n  return fromCodePoint(codepoint)\n}\n\n/**\n * @param {PRNG} gen\n * @param {number} [maxlen = 20]\n */\nexport const utf16String = (gen, maxlen = 20) => {\n  const len = int31(gen, 0, maxlen)\n  let str = ''\n  for (let i = 0; i < len; i++) {\n    str += utf16Rune(gen)\n  }\n  return str\n}\n\n/**\n * Returns one element of a given array.\n *\n * @param {PRNG} gen A random number generator.\n * @param {Array<T>} array Non empty Array of possible values.\n * @return {T} One of the values of the supplied Array.\n * @template T\n */\nexport const oneOf = (gen, array) => array[int31(gen, 0, array.length - 1)]\n\n/**\n * @param {PRNG} gen\n * @param {number} len\n * @return {Uint8Array<ArrayBuffer>}\n */\nexport const uint8Array = (gen, len) => {\n  const buf = buffer.createUint8ArrayFromLen(len)\n  for (let i = 0; i < buf.length; i++) {\n    buf[i] = int32(gen, 0, binary.BITS8)\n  }\n  return buf\n}\n\n/* c8 ignore start */\n/**\n * @param {PRNG} gen\n * @param {number} len\n * @return {Uint16Array}\n */\nexport const uint16Array = (gen, len) => new Uint16Array(uint8Array(gen, len * 2).buffer)\n\n/**\n * @param {PRNG} gen\n * @param {number} len\n * @return {Uint32Array}\n */\nexport const uint32Array = (gen, len) => new Uint32Array(uint8Array(gen, len * 4).buffer)\n/* c8 ignore stop */\n"],"names":["binary.BITS32","math.floor","math.abs","fromCharCode","fromCodePoint","buffer.createUint8ArrayFromLen","binary.BITS8"],"mappings":";;;;;;;AAAA;AACA;AACA;AAGA;AACA;AACA;AACA;AACO,MAAM,UAAU,CAAC;AACxB;AACA;AACA;AACA,EAAE,WAAW,CAAC,CAAC,IAAI,EAAE;AACrB,IAAI,IAAI,CAAC,IAAI,GAAG,KAAI;AACpB;AACA;AACA;AACA,IAAI,IAAI,CAAC,MAAM,GAAG,KAAI;AACtB,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,IAAI,CAAC,GAAG;AACV,IAAI,IAAI,CAAC,GAAG,IAAI,CAAC,OAAM;AACvB,IAAI,CAAC,IAAI,CAAC,IAAI,GAAE;AAChB,IAAI,CAAC,IAAI,CAAC,IAAI,GAAE;AAChB,IAAI,CAAC,IAAI,CAAC,IAAI,EAAC;AACf,IAAI,IAAI,CAAC,MAAM,GAAG,EAAC;AACnB,IAAI,OAAO,CAAC,CAAC,KAAK,CAAC,KAAKA,aAAa,GAAG,CAAC,CAAC;AAC1C,GAAG;AACH;;AClCA;AACA;AACA;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,MAAM,gBAAgB,CAAC;AAC9B;AACA;AACA;AACA,EAAE,WAAW,CAAC,CAAC,IAAI,EAAE;AACrB,IAAI,IAAI,CAAC,IAAI,GAAG,KAAI;AACpB;AACA,IAAI,MAAM,UAAU,GAAG,IAAI,UAAU,CAAC,IAAI,EAAC;AAC3C,IAAI,IAAI,CAAC,KAAK,GAAG,IAAI,WAAW,CAAC,CAAC,EAAC;AACnC,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;AAChC,MAAM,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,IAAI,EAAE,GAAGA,cAAa;AACvD,KAAK;AACL,IAAI,IAAI,CAAC,MAAM,GAAG,KAAI;AACtB,GAAG;AACH;AACA;AACA;AACA;AACA,EAAE,IAAI,CAAC,GAAG;AACV,IAAI,MAAM,KAAK,GAAG,IAAI,CAAC,MAAK;AAC5B,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE;AACrB,MAAM,IAAI,CAAC,MAAM,GAAG,MAAK;AACzB,MAAM,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,KAAKA,aAAa,GAAG,CAAC,CAAC;AAChE,KAAK,MAAM;AACX,MAAM,IAAI,CAAC,MAAM,GAAG,KAAI;AACxB,MAAM,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,EAAC;AACzB,MAAM,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,EAAC;AACzB,MAAM,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,GAAE;AAC9B,MAAM,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,GAAE;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,EAAC;AACpE,MAAM,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,EAAC;AACxD;AACA,MAAM,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,KAAK,GAAE;AACpC,MAAM,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,KAAK,GAAE;AACpC,MAAM,QAAQ,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,KAAKA,aAAa,GAAG,CAAC,CAAC,CAAC;AAClE,KAAK;AACL,GAAG;AACH,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC9GA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAOA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,WAAW,GAAG,iBAAgB;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,MAAM,GAAG,IAAI,IAAI,IAAI,WAAW,CAAC,IAAI,EAAC;AACnD;AACA;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,IAAI,GAAG,GAAG,KAAK,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,EAAC;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,KAAK,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,KAAKC,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,EAAC;AACtF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,MAAM,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,KAAKC,QAAQ,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,EAAC;AACvE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,KAAK,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,KAAKD,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,EAAC;AACtF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,MAAM,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,KAAK,KAAK,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,KAAK,EAAC;AACnE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,KAAK,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,KAAK,KAAK,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAC;AAC5D;AACA;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,IAAI,GAAE;AACvC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,IAAI,GAAG,GAAG,IAAIE,mBAAY,CAAC,KAAK,CAAC,GAAG,EAAE,EAAE,EAAE,GAAG,CAAC,EAAC;AAC5D;AACA;AACA;AACA;AACA;AACY,MAAC,MAAM,GAAG,GAAG,IAAIA,mBAAY,CAAC,KAAK,CAAC,GAAG,EAAE,EAAE,EAAE,GAAG,CAAC,EAAC;AAC9D;AACA;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,IAAI,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,EAAE,KAAK;AACtD,EAAE,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,EAAE,MAAM,EAAE,MAAM,EAAC;AACxC,EAAE,IAAI,GAAG,GAAG,GAAE;AACd,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;AAChC,IAAI,GAAG,IAAI,MAAM,CAAC,GAAG,EAAC;AACtB,GAAG;AACH,EAAE,OAAO,GAAG;AACZ,EAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,SAAS,GAAG,GAAG,IAAI;AAChC,EAAE,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,EAAC;AACtC,EAAE,OAAOC,oBAAa,CAAC,SAAS,CAAC;AACjC,EAAC;AACD;AACA;AACA;AACA;AACA;AACY,MAAC,WAAW,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,EAAE,KAAK;AACjD,EAAE,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC,EAAE,MAAM,EAAC;AACnC,EAAE,IAAI,GAAG,GAAG,GAAE;AACd,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;AAChC,IAAI,GAAG,IAAI,SAAS,CAAC,GAAG,EAAC;AACzB,GAAG;AACH,EAAE,OAAO,GAAG;AACZ,EAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,KAAK,GAAG,CAAC,GAAG,EAAE,KAAK,KAAK,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,EAAC;AAC3E;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,UAAU,GAAG,CAAC,GAAG,EAAE,GAAG,KAAK;AACxC,EAAE,MAAM,GAAG,GAAGC,8BAA8B,CAAC,GAAG,EAAC;AACjD,EAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACvC,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC,EAAEC,YAAY,EAAC;AACxC,GAAG;AACH,EAAE,OAAO,GAAG;AACZ,EAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,WAAW,GAAG,CAAC,GAAG,EAAE,GAAG,KAAK,IAAI,WAAW,CAAC,UAAU,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,MAAM,EAAC;AACzF;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,WAAW,GAAG,CAAC,GAAG,EAAE,GAAG,KAAK,IAAI,WAAW,CAAC,UAAU,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,MAAM,EAAC;AACzF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;"}

package/dist/prng.cjs

@@ -1,44 +0,0 @@
-'use strict';
-
-Object.defineProperty(exports, '__esModule', { value: true });
-
-require('./binary-ac8e39e2.cjs');
-require('./string-fddc5f8b.cjs');
-require('./math-96d5e8c4.cjs');
-var prng = require('./prng-37d48618.cjs');
-require('./buffer-3e750729.cjs');
-require('./array-78849c95.cjs');
-require('./set-5b47859e.cjs');
-require('./environment-1c97264d.cjs');
-require('./map-24d263c0.cjs');
-require('./conditions-f5c0c102.cjs');
-require('./storage.cjs');
-require('./function-314580f7.cjs');
-require('./object-c0c9435b.cjs');
-require('./equality.cjs');
-require('./encoding-1a745c43.cjs');
-require('./number-1fb57bba.cjs');
-require('./decoding-76e75827.cjs');
-require('./error-0c1f634f.cjs');
-
-
-
-exports.DefaultPRNG = prng.DefaultPRNG;
-exports.bool = prng.bool;
-exports.char = prng.char;
-exports.create = prng.create;
-exports.int31 = prng.int31;
-exports.int32 = prng.int32;
-exports.int53 = prng.int53;
-exports.letter = prng.letter;
-exports.oneOf = prng.oneOf;
-exports.real53 = prng.real53;
-exports.uint16Array = prng.uint16Array;
-exports.uint32 = prng.uint32;
-exports.uint32Array = prng.uint32Array;
-exports.uint53 = prng.uint53;
-exports.uint8Array = prng.uint8Array;
-exports.utf16Rune = prng.utf16Rune;
-exports.utf16String = prng.utf16String;
-exports.word = prng.word;
-//# sourceMappingURL=prng.cjs.map

package/dist/prng.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"prng.cjs","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;"}

package/dist/prng.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"prng.d.ts","sourceRoot":"","sources":["../prng.js"],"names":[],"mappings":"AAeA;;;;GAIG;AAEH;;;;;GAKG;AACH,kDAA2C;AAUpC,6BAHI,MAAM,GACL,IAAI,CAEmC;AAQ5C,0BAHI,IAAI,WAG+B;AAUvC,2BALI,IAAI,oCAKuE;AAU/E,4BALI,IAAI,oCAKwD;AAUhE,2BALI,IAAI,oCAKuE;AAU/E,4BALI,IAAI,oCAKoD;AAY5D,2BALI,IAAI,oCAK6C;AAQrD,4BAHI,IAAI,UAGwB;AAUhC,0BALI,IAAI,GACH,MAAM,CAI0C;AAMrD,4BAHI,IAAI,GACH,MAAM,CAE4C;AAQvD,0BALI,IAAI,WACJ,MAAM,WACN,MAAM,GACL,MAAM,CASjB;AAQM,+BAHI,IAAI,GACH,MAAM,CAKjB;AAMM,iCAHI,IAAI,WACJ,MAAM,UAShB;AAUM,sBAFM,CAAC,OAHH,IAAI,SACJ,KAAK,CAAC,CAAC,CAAC,GACP,CAAC,CAG8D;AAOpE,gCAJI,IAAI,OACJ,MAAM,GACL,UAAU,CAAC,WAAW,CAAC,CAQlC;AAQM,iCAJI,IAAI,OACJ,MAAM,GACL,WAAW,CAEkE;AAOlF,iCAJI,IAAI,OACJ,MAAM,GACL,WAAW,CAEkE;;;;kCApL5E,MAAM;;;;;;;;UAOL,aAAa;;iCAbM,4BAA4B"}

package/dist/prng.test.d.ts

@@ -1,6 +0,0 @@
-export function testGeneratorXoroshiro128plus(tc: t.TestCase): void;
-export function testGeneratorXorshift32(tc: t.TestCase): void;
-export function testGeneratorMt19937(tc: t.TestCase): void;
-export function testNumberDistributions(tc: t.TestCase): void;
-import * as t from './testing.js';
-//# sourceMappingURL=prng.test.d.ts.map

package/dist/prng.test.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"prng.test.d.ts","sourceRoot":"","sources":["../prng.test.js"],"names":[],"mappings":"AA4LO,kDAFI,CAAC,CAAC,QAAQ,QAE2E;AAKzF,4CAFI,CAAC,CAAC,QAAQ,QAIpB;AAKM,yCAFI,CAAC,CAAC,QAAQ,QAIpB;AA2BM,4CAFI,CAAC,CAAC,QAAQ,QAOpB;mBAtOkB,cAAc"}

package/dist/promise-cda7b9bb.cjs

@@ -1,145 +0,0 @@
-'use strict';
-
-var time = require('./time-d8438852.cjs');
-
-/**
- * Utility helpers to work with promises.
- *
- * @module promise
- */
-
-/**
- * @template T
- * @callback PromiseResolve
- * @param {T|PromiseLike<T>} [result]
- */
-
-/**
- * @template T
- * @param {function(PromiseResolve<T>,function(Error):void):any} f
- * @return {Promise<T>}
- */
-const create = f => /** @type {Promise<T>} */ (new Promise(f));
-
-/**
- * @param {function(function():void,function(Error):void):void} f
- * @return {Promise<void>}
- */
-const createEmpty = f => new Promise(f);
-
-/**
- * `Promise.all` wait for all promises in the array to resolve and return the result
- * @template {unknown[] | []} PS
- *
- * @param {PS} ps
- * @return {Promise<{ -readonly [P in keyof PS]: Awaited<PS[P]> }>}
- */
-const all = Promise.all.bind(Promise);
-
-/**
- * @param {Error} [reason]
- * @return {Promise<never>}
- */
-const reject = reason => Promise.reject(reason);
-
-/**
- * @template T
- * @param {T|void} res
- * @return {Promise<T|void>}
- */
-const resolve = res => Promise.resolve(res);
-
-/**
- * @template T
- * @param {T} res
- * @return {Promise<T>}
- */
-const resolveWith = res => Promise.resolve(res);
-
-/**
- * @todo Next version, reorder parameters: check, [timeout, [intervalResolution]]
- * @deprecated use untilAsync instead
- *
- * @param {number} timeout
- * @param {function():boolean} check
- * @param {number} [intervalResolution]
- * @return {Promise<void>}
- */
-const until = (timeout, check, intervalResolution = 10) => create((resolve, reject) => {
-  const startTime = time.getUnixTime();
-  const hasTimeout = timeout > 0;
-  const untilInterval = () => {
-    if (check()) {
-      clearInterval(intervalHandle);
-      resolve();
-    } else if (hasTimeout) {
-      /* c8 ignore else */
-      if (time.getUnixTime() - startTime > timeout) {
-        clearInterval(intervalHandle);
-        reject(new Error('Timeout'));
-      }
-    }
-  };
-  const intervalHandle = setInterval(untilInterval, intervalResolution);
-});
-
-/**
- * @param {()=>Promise<boolean>|boolean} check
- * @param {number} timeout
- * @param {number} intervalResolution
- * @return {Promise<void>}
- */
-const untilAsync = async (check, timeout = 0, intervalResolution = 10) => {
-  const startTime = time.getUnixTime();
-  const noTimeout = timeout <= 0;
-  // eslint-disable-next-line no-unmodified-loop-condition
-  while (noTimeout || time.getUnixTime() - startTime <= timeout) {
-    if (await check()) return
-    await wait(intervalResolution);
-  }
-  throw new Error('Timeout')
-};
-
-/**
- * @param {number} timeout
- * @return {Promise<undefined>}
- */
-const wait = timeout => create((resolve, _reject) => setTimeout(resolve, timeout));
-
-/**
- * Checks if an object is a promise using ducktyping.
- *
- * Promises are often polyfilled, so it makes sense to add some additional guarantees if the user of this
- * library has some insane environment where global Promise objects are overwritten.
- *
- * @param {any} p
- * @return {boolean}
- */
-const isPromise = p => p instanceof Promise || (p && p.then && p.catch && p.finally);
-
-var promise = /*#__PURE__*/Object.freeze({
-  __proto__: null,
-  create: create,
-  createEmpty: createEmpty,
-  all: all,
-  reject: reject,
-  resolve: resolve,
-  resolveWith: resolveWith,
-  until: until,
-  untilAsync: untilAsync,
-  wait: wait,
-  isPromise: isPromise
-});
-
-exports.all = all;
-exports.create = create;
-exports.createEmpty = createEmpty;
-exports.isPromise = isPromise;
-exports.promise = promise;
-exports.reject = reject;
-exports.resolve = resolve;
-exports.resolveWith = resolveWith;
-exports.until = until;
-exports.untilAsync = untilAsync;
-exports.wait = wait;
-//# sourceMappingURL=promise-cda7b9bb.cjs.map

package/dist/promise-cda7b9bb.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"promise-cda7b9bb.cjs","sources":["../promise.js"],"sourcesContent":["/**\n * Utility helpers to work with promises.\n *\n * @module promise\n */\n\nimport * as time from './time.js'\n\n/**\n * @template T\n * @callback PromiseResolve\n * @param {T|PromiseLike<T>} [result]\n */\n\n/**\n * @template T\n * @param {function(PromiseResolve<T>,function(Error):void):any} f\n * @return {Promise<T>}\n */\nexport const create = f => /** @type {Promise<T>} */ (new Promise(f))\n\n/**\n * @param {function(function():void,function(Error):void):void} f\n * @return {Promise<void>}\n */\nexport const createEmpty = f => new Promise(f)\n\n/**\n * `Promise.all` wait for all promises in the array to resolve and return the result\n * @template {unknown[] | []} PS\n *\n * @param {PS} ps\n * @return {Promise<{ -readonly [P in keyof PS]: Awaited<PS[P]> }>}\n */\nexport const all = Promise.all.bind(Promise)\n\n/**\n * @param {Error} [reason]\n * @return {Promise<never>}\n */\nexport const reject = reason => Promise.reject(reason)\n\n/**\n * @template T\n * @param {T|void} res\n * @return {Promise<T|void>}\n */\nexport const resolve = res => Promise.resolve(res)\n\n/**\n * @template T\n * @param {T} res\n * @return {Promise<T>}\n */\nexport const resolveWith = res => Promise.resolve(res)\n\n/**\n * @todo Next version, reorder parameters: check, [timeout, [intervalResolution]]\n * @deprecated use untilAsync instead\n *\n * @param {number} timeout\n * @param {function():boolean} check\n * @param {number} [intervalResolution]\n * @return {Promise<void>}\n */\nexport const until = (timeout, check, intervalResolution = 10) => create((resolve, reject) => {\n  const startTime = time.getUnixTime()\n  const hasTimeout = timeout > 0\n  const untilInterval = () => {\n    if (check()) {\n      clearInterval(intervalHandle)\n      resolve()\n    } else if (hasTimeout) {\n      /* c8 ignore else */\n      if (time.getUnixTime() - startTime > timeout) {\n        clearInterval(intervalHandle)\n        reject(new Error('Timeout'))\n      }\n    }\n  }\n  const intervalHandle = setInterval(untilInterval, intervalResolution)\n})\n\n/**\n * @param {()=>Promise<boolean>|boolean} check\n * @param {number} timeout\n * @param {number} intervalResolution\n * @return {Promise<void>}\n */\nexport const untilAsync = async (check, timeout = 0, intervalResolution = 10) => {\n  const startTime = time.getUnixTime()\n  const noTimeout = timeout <= 0\n  // eslint-disable-next-line no-unmodified-loop-condition\n  while (noTimeout || time.getUnixTime() - startTime <= timeout) {\n    if (await check()) return\n    await wait(intervalResolution)\n  }\n  throw new Error('Timeout')\n}\n\n/**\n * @param {number} timeout\n * @return {Promise<undefined>}\n */\nexport const wait = timeout => create((resolve, _reject) => setTimeout(resolve, timeout))\n\n/**\n * Checks if an object is a promise using ducktyping.\n *\n * Promises are often polyfilled, so it makes sense to add some additional guarantees if the user of this\n * library has some insane environment where global Promise objects are overwritten.\n *\n * @param {any} p\n * @return {boolean}\n */\nexport const isPromise = p => p instanceof Promise || (p && p.then && p.catch && p.finally)\n"],"names":["time.getUnixTime"],"mappings":";;;;AAAA;AACA;AACA;AACA;AACA;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,MAAM,GAAG,CAAC,+BAA+B,IAAI,OAAO,CAAC,CAAC,CAAC,EAAC;AACrE;AACA;AACA;AACA;AACA;AACY,MAAC,WAAW,GAAG,CAAC,IAAI,IAAI,OAAO,CAAC,CAAC,EAAC;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,EAAC;AAC5C;AACA;AACA;AACA;AACA;AACY,MAAC,MAAM,GAAG,MAAM,IAAI,OAAO,CAAC,MAAM,CAAC,MAAM,EAAC;AACtD;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,OAAO,GAAG,GAAG,IAAI,OAAO,CAAC,OAAO,CAAC,GAAG,EAAC;AAClD;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,WAAW,GAAG,GAAG,IAAI,OAAO,CAAC,OAAO,CAAC,GAAG,EAAC;AACtD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,KAAK,GAAG,CAAC,OAAO,EAAE,KAAK,EAAE,kBAAkB,GAAG,EAAE,KAAK,MAAM,CAAC,CAAC,OAAO,EAAE,MAAM,KAAK;AAC9F,EAAE,MAAM,SAAS,GAAGA,gBAAgB,GAAE;AACtC,EAAE,MAAM,UAAU,GAAG,OAAO,GAAG,EAAC;AAChC,EAAE,MAAM,aAAa,GAAG,MAAM;AAC9B,IAAI,IAAI,KAAK,EAAE,EAAE;AACjB,MAAM,aAAa,CAAC,cAAc,EAAC;AACnC,MAAM,OAAO,GAAE;AACf,KAAK,MAAM,IAAI,UAAU,EAAE;AAC3B;AACA,MAAM,IAAIA,gBAAgB,EAAE,GAAG,SAAS,GAAG,OAAO,EAAE;AACpD,QAAQ,aAAa,CAAC,cAAc,EAAC;AACrC,QAAQ,MAAM,CAAC,IAAI,KAAK,CAAC,SAAS,CAAC,EAAC;AACpC,OAAO;AACP,KAAK;AACL,IAAG;AACH,EAAE,MAAM,cAAc,GAAG,WAAW,CAAC,aAAa,EAAE,kBAAkB,EAAC;AACvE,CAAC,EAAC;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,UAAU,GAAG,OAAO,KAAK,EAAE,OAAO,GAAG,CAAC,EAAE,kBAAkB,GAAG,EAAE,KAAK;AACjF,EAAE,MAAM,SAAS,GAAGA,gBAAgB,GAAE;AACtC,EAAE,MAAM,SAAS,GAAG,OAAO,IAAI,EAAC;AAChC;AACA,EAAE,OAAO,SAAS,IAAIA,gBAAgB,EAAE,GAAG,SAAS,IAAI,OAAO,EAAE;AACjE,IAAI,IAAI,MAAM,KAAK,EAAE,EAAE,MAAM;AAC7B,IAAI,MAAM,IAAI,CAAC,kBAAkB,EAAC;AAClC,GAAG;AACH,EAAE,MAAM,IAAI,KAAK,CAAC,SAAS,CAAC;AAC5B,EAAC;AACD;AACA;AACA;AACA;AACA;AACY,MAAC,IAAI,GAAG,OAAO,IAAI,MAAM,CAAC,CAAC,OAAO,EAAE,OAAO,KAAK,UAAU,CAAC,OAAO,EAAE,OAAO,CAAC,EAAC;AACzF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,SAAS,GAAG,CAAC,IAAI,CAAC,YAAY,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,OAAO;;;;;;;;;;;;;;;;;;;;;;;;;;;;"}

package/dist/promise.cjs

@@ -1,22 +0,0 @@
-'use strict';
-
-Object.defineProperty(exports, '__esModule', { value: true });
-
-require('./time-d8438852.cjs');
-var promise = require('./promise-cda7b9bb.cjs');
-require('./metric.cjs');
-require('./math-96d5e8c4.cjs');
-
-
-
-exports.all = promise.all;
-exports.create = promise.create;
-exports.createEmpty = promise.createEmpty;
-exports.isPromise = promise.isPromise;
-exports.reject = promise.reject;
-exports.resolve = promise.resolve;
-exports.resolveWith = promise.resolveWith;
-exports.until = promise.until;
-exports.untilAsync = promise.untilAsync;
-exports.wait = promise.wait;
-//# sourceMappingURL=promise.cjs.map

package/dist/promise.cjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"promise.cjs","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;"}

package/dist/promise.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"promise.d.ts","sourceRoot":"","sources":["../promise.js"],"names":[],"mappings":"AAmBO,uBAJM,CAAC,KACH,CAAS,IAAiB,EAAjB,cAAc,CAAC,CAAC,CAAC,EAAC,IAAoB,EAApB,CAAS,IAAK,EAAL,KAAK,KAAE,IAAI,KAAE,GAAG,GACnD,OAAO,CAAC,CAAC,CAAC,CAE+C;AAM9D,+BAHI,CAAS,IAAe,EAAf,MAAW,IAAI,EAAC,IAAoB,EAApB,CAAS,IAAK,EAAL,KAAK,KAAE,IAAI,KAAE,IAAI,GAClD,OAAO,CAAC,IAAI,CAAC,CAEqB;AAE9C;;;;;;GAMG;AACH;;8DAwCM,CAAC;EAxCqC;AAMrC,gCAHI,KAAK,GACJ,OAAO,CAAC,KAAK,CAAC,CAE4B;AAO/C,wBAJM,CAAC,OACH,CAAC,GAAC,IAAI,GACL,OAAO,CAAC,CAAC,GAAC,IAAI,CAAC,CAEuB;AAO3C,4BAJM,CAAC,OACH,CAAC,GACA,OAAO,CAAC,CAAC,CAAC,CAEgC;AAW/C,+BALI,MAAM,SACN,MAAW,OAAO,uBAClB,MAAM,GACL,OAAO,CAAC,IAAI,CAAC,CAkBvB;AAQK,kCALI,MAAI,OAAO,CAAC,OAAO,CAAC,GAAC,OAAO,YAC5B,MAAM,uBACN,MAAM,GACL,OAAO,CAAC,IAAI,CAAC,CAWxB;AAMM,8BAHI,MAAM,GACL,OAAO,CAAC,SAAS,CAAC,CAE2D;AAWlF,6BAHI,GAAG,GACF,OAAO,CAEwE;2BA1G9E,CAAC"}

package/dist/promise.test.d.ts

@@ -1,5 +0,0 @@
-export function testRepeatPromise(_tc: t.TestCase): Promise<void>;
-export function testispromise(_tc: t.TestCase): void;
-export function testTypings(_tc: t.TestCase): Promise<void>;
-import * as t from './testing.js';
-//# sourceMappingURL=promise.test.d.ts.map