dune-react 0.0.1

package/dist/node_modules/.pnpm/file-type@12.4.1/node_modules/file-type/supported.js

@@ -0,0 +1,242 @@
+var supported = {
+  extensions: [
+    "jpg",
+    "png",
+    "apng",
+    "gif",
+    "webp",
+    "flif",
+    "cr2",
+    "orf",
+    "arw",
+    "dng",
+    "nef",
+    "rw2",
+    "raf",
+    "tif",
+    "bmp",
+    "jxr",
+    "psd",
+    "zip",
+    "tar",
+    "rar",
+    "gz",
+    "bz2",
+    "7z",
+    "dmg",
+    "mp4",
+    "mid",
+    "mkv",
+    "webm",
+    "mov",
+    "avi",
+    "mpg",
+    "mp2",
+    "mp3",
+    "m4a",
+    "oga",
+    "ogg",
+    "ogv",
+    "opus",
+    "flac",
+    "wav",
+    "spx",
+    "amr",
+    "pdf",
+    "epub",
+    "exe",
+    "swf",
+    "rtf",
+    "wasm",
+    "woff",
+    "woff2",
+    "eot",
+    "ttf",
+    "otf",
+    "ico",
+    "flv",
+    "ps",
+    "xz",
+    "sqlite",
+    "nes",
+    "crx",
+    "xpi",
+    "cab",
+    "deb",
+    "ar",
+    "rpm",
+    "Z",
+    "lz",
+    "msi",
+    "mxf",
+    "mts",
+    "blend",
+    "bpg",
+    "docx",
+    "pptx",
+    "xlsx",
+    "3gp",
+    "3g2",
+    "jp2",
+    "jpm",
+    "jpx",
+    "mj2",
+    "aif",
+    "qcp",
+    "odt",
+    "ods",
+    "odp",
+    "xml",
+    "mobi",
+    "heic",
+    "cur",
+    "ktx",
+    "ape",
+    "wv",
+    "wmv",
+    "wma",
+    "dcm",
+    "ics",
+    "glb",
+    "pcap",
+    "dsf",
+    "lnk",
+    "alias",
+    "voc",
+    "ac3",
+    "m4v",
+    "m4p",
+    "m4b",
+    "f4v",
+    "f4p",
+    "f4b",
+    "f4a",
+    "mie",
+    "asf",
+    "ogm",
+    "ogx",
+    "mpc",
+    "arrow",
+    "shp"
+  ],
+  mimeTypes: [
+    "image/jpeg",
+    "image/png",
+    "image/gif",
+    "image/webp",
+    "image/flif",
+    "image/x-canon-cr2",
+    "image/tiff",
+    "image/bmp",
+    "image/vnd.ms-photo",
+    "image/vnd.adobe.photoshop",
+    "application/epub+zip",
+    "application/x-xpinstall",
+    "application/vnd.oasis.opendocument.text",
+    "application/vnd.oasis.opendocument.spreadsheet",
+    "application/vnd.oasis.opendocument.presentation",
+    "application/vnd.openxmlformats-officedocument.wordprocessingml.document",
+    "application/vnd.openxmlformats-officedocument.presentationml.presentation",
+    "application/vnd.openxmlformats-officedocument.spreadsheetml.sheet",
+    "application/zip",
+    "application/x-tar",
+    "application/x-rar-compressed",
+    "application/gzip",
+    "application/x-bzip2",
+    "application/x-7z-compressed",
+    "application/x-apple-diskimage",
+    "application/x-apache-arrow",
+    "video/mp4",
+    "audio/midi",
+    "video/x-matroska",
+    "video/webm",
+    "video/quicktime",
+    "video/vnd.avi",
+    "audio/vnd.wave",
+    "audio/qcelp",
+    "audio/x-ms-wma",
+    "video/x-ms-asf",
+    "application/vnd.ms-asf",
+    "video/mpeg",
+    "video/3gpp",
+    "audio/mpeg",
+    "audio/mp4",
+    // RFC 4337
+    "audio/opus",
+    "video/ogg",
+    "audio/ogg",
+    "application/ogg",
+    "audio/x-flac",
+    "audio/ape",
+    "audio/wavpack",
+    "audio/amr",
+    "application/pdf",
+    "application/x-msdownload",
+    "application/x-shockwave-flash",
+    "application/rtf",
+    "application/wasm",
+    "font/woff",
+    "font/woff2",
+    "application/vnd.ms-fontobject",
+    "font/ttf",
+    "font/otf",
+    "image/x-icon",
+    "video/x-flv",
+    "application/postscript",
+    "application/x-xz",
+    "application/x-sqlite3",
+    "application/x-nintendo-nes-rom",
+    "application/x-google-chrome-extension",
+    "application/vnd.ms-cab-compressed",
+    "application/x-deb",
+    "application/x-unix-archive",
+    "application/x-rpm",
+    "application/x-compress",
+    "application/x-lzip",
+    "application/x-msi",
+    "application/x-mie",
+    "application/mxf",
+    "video/mp2t",
+    "application/x-blender",
+    "image/bpg",
+    "image/jp2",
+    "image/jpx",
+    "image/jpm",
+    "image/mj2",
+    "audio/aiff",
+    "application/xml",
+    "application/x-mobipocket-ebook",
+    "image/heif",
+    "image/heif-sequence",
+    "image/heic",
+    "image/heic-sequence",
+    "image/ktx",
+    "application/dicom",
+    "audio/x-musepack",
+    "text/calendar",
+    "model/gltf-binary",
+    "application/vnd.tcpdump.pcap",
+    "audio/x-dsf",
+    // Non-standard
+    "application/x.ms.shortcut",
+    // Invented by us
+    "application/x.apple.alias",
+    // Invented by us
+    "audio/x-voc",
+    "audio/vnd.dolby.dd-raw",
+    "audio/x-m4a",
+    "image/apng",
+    "image/x-olympus-orf",
+    "image/x-sony-arw",
+    "image/x-adobe-dng",
+    "image/x-nikon-nef",
+    "image/x-panasonic-rw2",
+    "image/x-fujifilm-raf",
+    "video/x-m4v",
+    "video/3gpp2",
+    "application/x-esri-shape"
+  ]
+};
+export {
+  supported as s
+};

package/dist/node_modules/.pnpm/file-type@12.4.1/node_modules/file-type/util.js

@@ -0,0 +1,64 @@
+import { __exports as util } from "../../../../../_virtual/util.js";
+util.stringToBytes = (string) => [...string].map((character) => character.charCodeAt(0));
+const uint8ArrayUtf8ByteString = (array, start, end) => {
+  return String.fromCharCode(...array.slice(start, end));
+};
+util.readUInt64LE = (buffer, offset = 0) => {
+  let n = buffer[offset];
+  let mul = 1;
+  let i = 0;
+  while (++i < 8) {
+    mul *= 256;
+    n += buffer[offset + i] * mul;
+  }
+  return n;
+};
+util.tarHeaderChecksumMatches = (buffer) => {
+  if (buffer.length < 512) {
+    return false;
+  }
+  const MASK_8TH_BIT = 128;
+  let sum = 256;
+  let signedBitSum = 0;
+  for (let i = 0; i < 148; i++) {
+    const byte = buffer[i];
+    sum += byte;
+    signedBitSum += byte & MASK_8TH_BIT;
+  }
+  for (let i = 156; i < 512; i++) {
+    const byte = buffer[i];
+    sum += byte;
+    signedBitSum += byte & MASK_8TH_BIT;
+  }
+  const readSum = parseInt(uint8ArrayUtf8ByteString(buffer, 148, 154), 8);
+  return (
+    // Checksum in header equals the sum we calculated
+    readSum === sum || // Checksum in header equals sum we calculated plus signed-to-unsigned delta
+    readSum === sum - (signedBitSum << 1)
+  );
+};
+util.multiByteIndexOf = (buffer, bytesToSearch, startAt = 0) => {
+  if (Buffer && Buffer.isBuffer(buffer)) {
+    return buffer.indexOf(Buffer.from(bytesToSearch), startAt);
+  }
+  const nextBytesMatch = (buffer2, bytes, startIndex) => {
+    for (let i = 1; i < bytes.length; i++) {
+      if (bytes[i] !== buffer2[startIndex + i]) {
+        return false;
+      }
+    }
+    return true;
+  };
+  let index = buffer.indexOf(bytesToSearch[0], startAt);
+  while (index >= 0) {
+    if (nextBytesMatch(buffer, bytesToSearch, index)) {
+      return index;
+    }
+    index = buffer.indexOf(bytesToSearch[0], index + 1);
+  }
+  return -1;
+};
+util.uint8ArrayUtf8ByteString = uint8ArrayUtf8ByteString;
+export {
+  util as default
+};

package/dist/node_modules/.pnpm/js-sha1@0.6.0/node_modules/js-sha1/src/sha1.js

@@ -0,0 +1,311 @@
+import { commonjsGlobal, getDefaultExportFromCjs } from "../../../../../../_virtual/_commonjsHelpers.js";
+import { __module as sha1 } from "../../../../../../_virtual/sha1.js";
+/*
+ * [js-sha1]{@link https://github.com/emn178/js-sha1}
+ *
+ * @version 0.6.0
+ * @author Chen, Yi-Cyuan [emn178@gmail.com]
+ * @copyright Chen, Yi-Cyuan 2014-2017
+ * @license MIT
+ */
+(function(module) {
+  (function() {
+    var root = typeof window === "object" ? window : {};
+    var NODE_JS = !root.JS_SHA1_NO_NODE_JS && typeof process === "object" && process.versions && process.versions.node;
+    if (NODE_JS) {
+      root = commonjsGlobal;
+    }
+    var COMMON_JS = !root.JS_SHA1_NO_COMMON_JS && true && module.exports;
+    var HEX_CHARS = "0123456789abcdef".split("");
+    var EXTRA = [-2147483648, 8388608, 32768, 128];
+    var SHIFT = [24, 16, 8, 0];
+    var OUTPUT_TYPES = ["hex", "array", "digest", "arrayBuffer"];
+    var blocks = [];
+    var createOutputMethod = function(outputType) {
+      return function(message) {
+        return new Sha1(true).update(message)[outputType]();
+      };
+    };
+    var createMethod = function() {
+      var method2 = createOutputMethod("hex");
+      if (NODE_JS) {
+        method2 = nodeWrap(method2);
+      }
+      method2.create = function() {
+        return new Sha1();
+      };
+      method2.update = function(message) {
+        return method2.create().update(message);
+      };
+      for (var i = 0; i < OUTPUT_TYPES.length; ++i) {
+        var type = OUTPUT_TYPES[i];
+        method2[type] = createOutputMethod(type);
+      }
+      return method2;
+    };
+    var nodeWrap = function(method) {
+      var crypto = eval("require('crypto')");
+      var Buffer = eval("require('buffer').Buffer");
+      var nodeMethod = function(message) {
+        if (typeof message === "string") {
+          return crypto.createHash("sha1").update(message, "utf8").digest("hex");
+        } else if (message.constructor === ArrayBuffer) {
+          message = new Uint8Array(message);
+        } else if (message.length === void 0) {
+          return method(message);
+        }
+        return crypto.createHash("sha1").update(new Buffer(message)).digest("hex");
+      };
+      return nodeMethod;
+    };
+    function Sha1(sharedMemory) {
+      if (sharedMemory) {
+        blocks[0] = blocks[16] = blocks[1] = blocks[2] = blocks[3] = blocks[4] = blocks[5] = blocks[6] = blocks[7] = blocks[8] = blocks[9] = blocks[10] = blocks[11] = blocks[12] = blocks[13] = blocks[14] = blocks[15] = 0;
+        this.blocks = blocks;
+      } else {
+        this.blocks = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0];
+      }
+      this.h0 = 1732584193;
+      this.h1 = 4023233417;
+      this.h2 = 2562383102;
+      this.h3 = 271733878;
+      this.h4 = 3285377520;
+      this.block = this.start = this.bytes = this.hBytes = 0;
+      this.finalized = this.hashed = false;
+      this.first = true;
+    }
+    Sha1.prototype.update = function(message) {
+      if (this.finalized) {
+        return;
+      }
+      var notString = typeof message !== "string";
+      if (notString && message.constructor === root.ArrayBuffer) {
+        message = new Uint8Array(message);
+      }
+      var code, index = 0, i, length = message.length || 0, blocks2 = this.blocks;
+      while (index < length) {
+        if (this.hashed) {
+          this.hashed = false;
+          blocks2[0] = this.block;
+          blocks2[16] = blocks2[1] = blocks2[2] = blocks2[3] = blocks2[4] = blocks2[5] = blocks2[6] = blocks2[7] = blocks2[8] = blocks2[9] = blocks2[10] = blocks2[11] = blocks2[12] = blocks2[13] = blocks2[14] = blocks2[15] = 0;
+        }
+        if (notString) {
+          for (i = this.start; index < length && i < 64; ++index) {
+            blocks2[i >> 2] |= message[index] << SHIFT[i++ & 3];
+          }
+        } else {
+          for (i = this.start; index < length && i < 64; ++index) {
+            code = message.charCodeAt(index);
+            if (code < 128) {
+              blocks2[i >> 2] |= code << SHIFT[i++ & 3];
+            } else if (code < 2048) {
+              blocks2[i >> 2] |= (192 | code >> 6) << SHIFT[i++ & 3];
+              blocks2[i >> 2] |= (128 | code & 63) << SHIFT[i++ & 3];
+            } else if (code < 55296 || code >= 57344) {
+              blocks2[i >> 2] |= (224 | code >> 12) << SHIFT[i++ & 3];
+              blocks2[i >> 2] |= (128 | code >> 6 & 63) << SHIFT[i++ & 3];
+              blocks2[i >> 2] |= (128 | code & 63) << SHIFT[i++ & 3];
+            } else {
+              code = 65536 + ((code & 1023) << 10 | message.charCodeAt(++index) & 1023);
+              blocks2[i >> 2] |= (240 | code >> 18) << SHIFT[i++ & 3];
+              blocks2[i >> 2] |= (128 | code >> 12 & 63) << SHIFT[i++ & 3];
+              blocks2[i >> 2] |= (128 | code >> 6 & 63) << SHIFT[i++ & 3];
+              blocks2[i >> 2] |= (128 | code & 63) << SHIFT[i++ & 3];
+            }
+          }
+        }
+        this.lastByteIndex = i;
+        this.bytes += i - this.start;
+        if (i >= 64) {
+          this.block = blocks2[16];
+          this.start = i - 64;
+          this.hash();
+          this.hashed = true;
+        } else {
+          this.start = i;
+        }
+      }
+      if (this.bytes > 4294967295) {
+        this.hBytes += this.bytes / 4294967296 << 0;
+        this.bytes = this.bytes % 4294967296;
+      }
+      return this;
+    };
+    Sha1.prototype.finalize = function() {
+      if (this.finalized) {
+        return;
+      }
+      this.finalized = true;
+      var blocks2 = this.blocks, i = this.lastByteIndex;
+      blocks2[16] = this.block;
+      blocks2[i >> 2] |= EXTRA[i & 3];
+      this.block = blocks2[16];
+      if (i >= 56) {
+        if (!this.hashed) {
+          this.hash();
+        }
+        blocks2[0] = this.block;
+        blocks2[16] = blocks2[1] = blocks2[2] = blocks2[3] = blocks2[4] = blocks2[5] = blocks2[6] = blocks2[7] = blocks2[8] = blocks2[9] = blocks2[10] = blocks2[11] = blocks2[12] = blocks2[13] = blocks2[14] = blocks2[15] = 0;
+      }
+      blocks2[14] = this.hBytes << 3 | this.bytes >>> 29;
+      blocks2[15] = this.bytes << 3;
+      this.hash();
+    };
+    Sha1.prototype.hash = function() {
+      var a = this.h0, b = this.h1, c = this.h2, d = this.h3, e = this.h4;
+      var f, j, t, blocks2 = this.blocks;
+      for (j = 16; j < 80; ++j) {
+        t = blocks2[j - 3] ^ blocks2[j - 8] ^ blocks2[j - 14] ^ blocks2[j - 16];
+        blocks2[j] = t << 1 | t >>> 31;
+      }
+      for (j = 0; j < 20; j += 5) {
+        f = b & c | ~b & d;
+        t = a << 5 | a >>> 27;
+        e = t + f + e + 1518500249 + blocks2[j] << 0;
+        b = b << 30 | b >>> 2;
+        f = a & b | ~a & c;
+        t = e << 5 | e >>> 27;
+        d = t + f + d + 1518500249 + blocks2[j + 1] << 0;
+        a = a << 30 | a >>> 2;
+        f = e & a | ~e & b;
+        t = d << 5 | d >>> 27;
+        c = t + f + c + 1518500249 + blocks2[j + 2] << 0;
+        e = e << 30 | e >>> 2;
+        f = d & e | ~d & a;
+        t = c << 5 | c >>> 27;
+        b = t + f + b + 1518500249 + blocks2[j + 3] << 0;
+        d = d << 30 | d >>> 2;
+        f = c & d | ~c & e;
+        t = b << 5 | b >>> 27;
+        a = t + f + a + 1518500249 + blocks2[j + 4] << 0;
+        c = c << 30 | c >>> 2;
+      }
+      for (; j < 40; j += 5) {
+        f = b ^ c ^ d;
+        t = a << 5 | a >>> 27;
+        e = t + f + e + 1859775393 + blocks2[j] << 0;
+        b = b << 30 | b >>> 2;
+        f = a ^ b ^ c;
+        t = e << 5 | e >>> 27;
+        d = t + f + d + 1859775393 + blocks2[j + 1] << 0;
+        a = a << 30 | a >>> 2;
+        f = e ^ a ^ b;
+        t = d << 5 | d >>> 27;
+        c = t + f + c + 1859775393 + blocks2[j + 2] << 0;
+        e = e << 30 | e >>> 2;
+        f = d ^ e ^ a;
+        t = c << 5 | c >>> 27;
+        b = t + f + b + 1859775393 + blocks2[j + 3] << 0;
+        d = d << 30 | d >>> 2;
+        f = c ^ d ^ e;
+        t = b << 5 | b >>> 27;
+        a = t + f + a + 1859775393 + blocks2[j + 4] << 0;
+        c = c << 30 | c >>> 2;
+      }
+      for (; j < 60; j += 5) {
+        f = b & c | b & d | c & d;
+        t = a << 5 | a >>> 27;
+        e = t + f + e - 1894007588 + blocks2[j] << 0;
+        b = b << 30 | b >>> 2;
+        f = a & b | a & c | b & c;
+        t = e << 5 | e >>> 27;
+        d = t + f + d - 1894007588 + blocks2[j + 1] << 0;
+        a = a << 30 | a >>> 2;
+        f = e & a | e & b | a & b;
+        t = d << 5 | d >>> 27;
+        c = t + f + c - 1894007588 + blocks2[j + 2] << 0;
+        e = e << 30 | e >>> 2;
+        f = d & e | d & a | e & a;
+        t = c << 5 | c >>> 27;
+        b = t + f + b - 1894007588 + blocks2[j + 3] << 0;
+        d = d << 30 | d >>> 2;
+        f = c & d | c & e | d & e;
+        t = b << 5 | b >>> 27;
+        a = t + f + a - 1894007588 + blocks2[j + 4] << 0;
+        c = c << 30 | c >>> 2;
+      }
+      for (; j < 80; j += 5) {
+        f = b ^ c ^ d;
+        t = a << 5 | a >>> 27;
+        e = t + f + e - 899497514 + blocks2[j] << 0;
+        b = b << 30 | b >>> 2;
+        f = a ^ b ^ c;
+        t = e << 5 | e >>> 27;
+        d = t + f + d - 899497514 + blocks2[j + 1] << 0;
+        a = a << 30 | a >>> 2;
+        f = e ^ a ^ b;
+        t = d << 5 | d >>> 27;
+        c = t + f + c - 899497514 + blocks2[j + 2] << 0;
+        e = e << 30 | e >>> 2;
+        f = d ^ e ^ a;
+        t = c << 5 | c >>> 27;
+        b = t + f + b - 899497514 + blocks2[j + 3] << 0;
+        d = d << 30 | d >>> 2;
+        f = c ^ d ^ e;
+        t = b << 5 | b >>> 27;
+        a = t + f + a - 899497514 + blocks2[j + 4] << 0;
+        c = c << 30 | c >>> 2;
+      }
+      this.h0 = this.h0 + a << 0;
+      this.h1 = this.h1 + b << 0;
+      this.h2 = this.h2 + c << 0;
+      this.h3 = this.h3 + d << 0;
+      this.h4 = this.h4 + e << 0;
+    };
+    Sha1.prototype.hex = function() {
+      this.finalize();
+      var h0 = this.h0, h1 = this.h1, h2 = this.h2, h3 = this.h3, h4 = this.h4;
+      return HEX_CHARS[h0 >> 28 & 15] + HEX_CHARS[h0 >> 24 & 15] + HEX_CHARS[h0 >> 20 & 15] + HEX_CHARS[h0 >> 16 & 15] + HEX_CHARS[h0 >> 12 & 15] + HEX_CHARS[h0 >> 8 & 15] + HEX_CHARS[h0 >> 4 & 15] + HEX_CHARS[h0 & 15] + HEX_CHARS[h1 >> 28 & 15] + HEX_CHARS[h1 >> 24 & 15] + HEX_CHARS[h1 >> 20 & 15] + HEX_CHARS[h1 >> 16 & 15] + HEX_CHARS[h1 >> 12 & 15] + HEX_CHARS[h1 >> 8 & 15] + HEX_CHARS[h1 >> 4 & 15] + HEX_CHARS[h1 & 15] + HEX_CHARS[h2 >> 28 & 15] + HEX_CHARS[h2 >> 24 & 15] + HEX_CHARS[h2 >> 20 & 15] + HEX_CHARS[h2 >> 16 & 15] + HEX_CHARS[h2 >> 12 & 15] + HEX_CHARS[h2 >> 8 & 15] + HEX_CHARS[h2 >> 4 & 15] + HEX_CHARS[h2 & 15] + HEX_CHARS[h3 >> 28 & 15] + HEX_CHARS[h3 >> 24 & 15] + HEX_CHARS[h3 >> 20 & 15] + HEX_CHARS[h3 >> 16 & 15] + HEX_CHARS[h3 >> 12 & 15] + HEX_CHARS[h3 >> 8 & 15] + HEX_CHARS[h3 >> 4 & 15] + HEX_CHARS[h3 & 15] + HEX_CHARS[h4 >> 28 & 15] + HEX_CHARS[h4 >> 24 & 15] + HEX_CHARS[h4 >> 20 & 15] + HEX_CHARS[h4 >> 16 & 15] + HEX_CHARS[h4 >> 12 & 15] + HEX_CHARS[h4 >> 8 & 15] + HEX_CHARS[h4 >> 4 & 15] + HEX_CHARS[h4 & 15];
+    };
+    Sha1.prototype.toString = Sha1.prototype.hex;
+    Sha1.prototype.digest = function() {
+      this.finalize();
+      var h0 = this.h0, h1 = this.h1, h2 = this.h2, h3 = this.h3, h4 = this.h4;
+      return [
+        h0 >> 24 & 255,
+        h0 >> 16 & 255,
+        h0 >> 8 & 255,
+        h0 & 255,
+        h1 >> 24 & 255,
+        h1 >> 16 & 255,
+        h1 >> 8 & 255,
+        h1 & 255,
+        h2 >> 24 & 255,
+        h2 >> 16 & 255,
+        h2 >> 8 & 255,
+        h2 & 255,
+        h3 >> 24 & 255,
+        h3 >> 16 & 255,
+        h3 >> 8 & 255,
+        h3 & 255,
+        h4 >> 24 & 255,
+        h4 >> 16 & 255,
+        h4 >> 8 & 255,
+        h4 & 255
+      ];
+    };
+    Sha1.prototype.array = Sha1.prototype.digest;
+    Sha1.prototype.arrayBuffer = function() {
+      this.finalize();
+      var buffer = new ArrayBuffer(20);
+      var dataView = new DataView(buffer);
+      dataView.setUint32(0, this.h0);
+      dataView.setUint32(4, this.h1);
+      dataView.setUint32(8, this.h2);
+      dataView.setUint32(12, this.h3);
+      dataView.setUint32(16, this.h4);
+      return buffer;
+    };
+    var exports = createMethod();
+    if (COMMON_JS) {
+      module.exports = exports;
+    } else {
+      root.sha1 = exports;
+    }
+  })();
+})(sha1);
+var sha1Exports = sha1.exports;
+const hash = /* @__PURE__ */ getDefaultExportFromCjs(sha1Exports);
+export {
+  hash as default
+};

package/dist/node_modules/.pnpm/nanoid@5.1.5/node_modules/nanoid/index.browser.js

@@ -0,0 +1,22 @@
+let random = (bytes) => crypto.getRandomValues(new Uint8Array(bytes));
+let customRandom = (alphabet, defaultSize, getRandom) => {
+  let mask = (2 << Math.log2(alphabet.length - 1)) - 1;
+  let step = -~(1.6 * mask * defaultSize / alphabet.length);
+  return (size = defaultSize) => {
+    let id = "";
+    while (true) {
+      let bytes = getRandom(step);
+      let j = step | 0;
+      while (j--) {
+        id += alphabet[bytes[j] & mask] || "";
+        if (id.length >= size) return id;
+      }
+    }
+  };
+};
+let customAlphabet = (alphabet, size = 21) => customRandom(alphabet, size | 0, random);
+export {
+  customAlphabet,
+  customRandom,
+  random
+};