@bleedingdev/modern-js-utils 3.9.0-ultramodern.9 → 3.9.3-ultramodern.10

package/dist/compiled/mime-types/licenses-cjs.txt

@@ -0,0 +1,52 @@
+mime-db
+MIT
+(The MIT License)
+
+Copyright (c) 2014 Jonathan Ong <me@jongleberry.com>
+Copyright (c) 2015-2022 Douglas Christopher Wilson <doug@somethingdoug.com>
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+'Software'), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+
+mime-types
+MIT
+(The MIT License)
+
+Copyright (c) 2014 Jonathan Ong <me@jongleberry.com>
+Copyright (c) 2015 Douglas Christopher Wilson <doug@somethingdoug.com>
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+'Software'), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

package/dist/compiled/mime-types/package.json

@@ -1 +1 @@
-{"name":"mime-types","version":"2.1.35","license":"MIT"}
+{"name":"mime-types","version":"3.0.2","funding":{"type":"opencollective","url":"https://opencollective.com/express"},"license":"MIT","types":"index.d.ts"}

package/dist/compiled/mime-types/provenance.json

@@ -0,0 +1,19 @@
+{
+  "name": "mime-types",
+  "sourceName": "mime-types",
+  "version": "3.0.2",
+  "entrySha256": "7de0cc894fd1d45cc9e4d0b5ad76d00aca6cb04966bed947bdfbf7d710c61c06",
+  "license": "MIT",
+  "repository": "jshttp/mime-types",
+  "producer": "scripts/prebundle",
+  "ncc": "0.45.0",
+  "declarations": "6.5.1",
+  "declarationSources": [
+    {
+      "name": "@types/mime-types",
+      "version": "3.0.1",
+      "license": "MIT"
+    }
+  ],
+  "lockfileSha256": "b3ac341ea4d3fbd3adf92aa1683e1d5d49f8e7a90ee6b84d9af8904f4643cdd4"
+}

package/dist/compiled/minimist/declaration-licenses/@types_minimist/LICENSE

@@ -0,0 +1,21 @@
+    MIT License
+
+    Copyright (c) Microsoft Corporation.
+
+    Permission is hereby granted, free of charge, to any person obtaining a copy
+    of this software and associated documentation files (the "Software"), to deal
+    in the Software without restriction, including without limitation the rights
+    to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+    copies of the Software, and to permit persons to whom the Software is
+    furnished to do so, subject to the following conditions:
+
+    The above copyright notice and this permission notice shall be included in all
+    copies or substantial portions of the Software.
+
+    THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+    IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+    FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+    AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+    LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+    OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+    SOFTWARE

package/dist/compiled/minimist/index.d.ts

@@ -1,11 +1,3 @@
-// Type definitions for minimist 1.2
-// Project: https://github.com/substack/minimist
-// Definitions by: Bart van der Schoor <https://github.com/Bartvds>
-//                 Necroskillz <https://github.com/Necroskillz>
-//                 kamranayub <https://github.com/kamranayub>
-//                 Piotr Błażejewicz <https://github.com/peterblazejewicz>
-// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
-
 /**
  * Return an argument object populated with the array arguments from args
  *
@@ -74,7 +66,7 @@ declare namespace minimist {
          * When true, populate argv._ with everything before the -- and argv['--'] with everything after the --.
          * Note that with -- set, parsing for arguments still stops after the `--`.
          */
-        '--'?: boolean | undefined;
+        "--"?: boolean | undefined;
     }
 
     interface ParsedArgs {
@@ -83,7 +75,7 @@ declare namespace minimist {
         /**
          * If opts['--'] is true, populated with everything after the --
          */
-        '--'?: string[] | undefined;
+        "--"?: string[] | undefined;
 
         /**
          * Contains all the arguments that didn't have an option associated with them
@@ -92,4 +84,4 @@ declare namespace minimist {
     }
 }
 
-export = minimist;
+export { minimist as default };

package/dist/compiled/minimist/index.js

@@ -1,6 +1,23 @@
 (()=>{
+    "use strict";
     var e = {
-        319: (e)=>{
+        890: (e)=>{
+            function hasKey(e, t) {
+                var r = e;
+                t.slice(0, -1).forEach(function(e) {
+                    r = r[e] || {};
+                });
+                var n = t[t.length - 1];
+                return n in r;
+            }
+            function isNumber(e) {
+                if ("number" == typeof e) return true;
+                if (/^0x[0-9a-f]+$/i.test(e)) return true;
+                return /^[-+]?(?:\d+(?:\.\d*)?|\.\d+)(e[-+]?\d+)?$/.test(e);
+            }
+            function isConstructorOrProto(e, t) {
+                return "constructor" === t && "function" == typeof e[t] || "__proto__" === t;
+            }
             e.exports = function(e, t) {
                 if (!t) t = {};
                 var r = {
@@ -8,12 +25,17 @@
                     strings: {},
                     unknownFn: null
                 };
-                if ("function" == typeof t["unknown"]) r.unknownFn = t["unknown"];
-                if ("boolean" == typeof t["boolean"] && t["boolean"]) r.allBools = true;
-                else [].concat(t["boolean"]).filter(Boolean).forEach(function(e) {
+                if ("function" == typeof t.unknown) r.unknownFn = t.unknown;
+                if ("boolean" == typeof t.boolean && t.boolean) r.allBools = true;
+                else [].concat(t.boolean).filter(Boolean).forEach(function(e) {
                     r.bools[e] = true;
                 });
                 var n = {};
+                function aliasIsBoolean(e) {
+                    return n[e].some(function(e) {
+                        return r.bools[e];
+                    });
+                }
                 Object.keys(t.alias || {}).forEach(function(e) {
                     n[e] = [].concat(t.alias[e]);
                     n[e].forEach(function(t) {
@@ -26,33 +48,17 @@
                 });
                 [].concat(t.string).filter(Boolean).forEach(function(e) {
                     r.strings[e] = true;
-                    if (n[e]) r.strings[n[e]] = true;
+                    if (n[e]) [].concat(n[e]).forEach(function(e) {
+                        r.strings[e] = true;
+                    });
                 });
-                var o = t["default"] || {};
+                var o = t.default || {};
                 var s = {
                     _: []
                 };
-                Object.keys(r.bools).forEach(function(e) {
-                    setArg(e, void 0 === o[e] ? false : o[e]);
-                });
-                var i = [];
-                if (-1 !== e.indexOf("--")) {
-                    i = e.slice(e.indexOf("--") + 1);
-                    e = e.slice(0, e.indexOf("--"));
-                }
                 function argDefined(e, t) {
                     return r.allBools && /^--[^=]+$/.test(t) || r.strings[e] || r.bools[e] || n[e];
                 }
-                function setArg(e, t, o) {
-                    if (o && r.unknownFn && !argDefined(e, o)) {
-                        if (false === r.unknownFn(o)) return;
-                    }
-                    var i = !r.strings[e] && isNumber(t) ? Number(t) : t;
-                    setKey(s, e.split("."), i);
-                    (n[e] || []).forEach(function(e) {
-                        setKey(s, e.split("."), i);
-                    });
-                }
                 function setKey(e, t, n) {
                     var o = e;
                     for(var s = 0; s < t.length - 1; s++){
@@ -63,83 +69,97 @@
                         if (o[i] === Array.prototype) o[i] = [];
                         o = o[i];
                     }
-                    var i = t[t.length - 1];
-                    if (isConstructorOrProto(o, i)) return;
+                    var f = t[t.length - 1];
+                    if (isConstructorOrProto(o, f)) return;
                     if (o === Object.prototype || o === Number.prototype || o === String.prototype) o = {};
                     if (o === Array.prototype) o = [];
-                    if (void 0 === o[i] || r.bools[i] || "boolean" == typeof o[i]) o[i] = n;
-                    else if (Array.isArray(o[i])) o[i].push(n);
-                    else o[i] = [
-                        o[i],
+                    if (void 0 === o[f] || r.bools[f] || "boolean" == typeof o[f]) o[f] = n;
+                    else if (Array.isArray(o[f])) o[f].push(n);
+                    else o[f] = [
+                        o[f],
                         n
                     ];
                 }
-                function aliasIsBoolean(e) {
-                    return n[e].some(function(e) {
-                        return r.bools[e];
+                function setArg(e, t, o) {
+                    if (o && r.unknownFn && !argDefined(e, o)) {
+                        if (false === r.unknownFn(o)) return;
+                    }
+                    var i = !r.strings[e] && isNumber(t) ? Number(t) : t;
+                    setKey(s, e.split("."), i);
+                    (n[e] || []).forEach(function(e) {
+                        setKey(s, e.split("."), i);
                     });
                 }
-                for(var a = 0; a < e.length; a++){
-                    var f = e[a];
-                    if (/^--.+=/.test(f)) {
-                        var u = f.match(/^--([^=]+)=([\s\S]*)$/);
-                        var l = u[1];
-                        var c = u[2];
-                        if (r.bools[l]) c = "false" !== c;
-                        setArg(l, c, f);
-                    } else if (/^--no-.+/.test(f)) {
-                        var l = f.match(/^--no-(.+)/)[1];
-                        setArg(l, false, f);
-                    } else if (/^--.+/.test(f)) {
-                        var l = f.match(/^--(.+)/)[1];
-                        var p = e[a + 1];
-                        if (void 0 === p || /^-/.test(p) || r.bools[l] || r.allBools || (n[l] ? aliasIsBoolean(l) : false)) if (/^(true|false)$/.test(p)) {
-                            setArg(l, "true" === p, f);
-                            a++;
-                        } else setArg(l, r.strings[l] ? "" : true, f);
+                Object.keys(r.bools).forEach(function(e) {
+                    setArg(e, void 0 === o[e] ? false : o[e]);
+                });
+                var i = [];
+                if (-1 !== e.indexOf("--")) {
+                    i = e.slice(e.indexOf("--") + 1);
+                    e = e.slice(0, e.indexOf("--"));
+                }
+                for(var f = 0; f < e.length; f++){
+                    var a = e[f];
+                    var u;
+                    var l;
+                    if (/^--.+=/.test(a)) {
+                        var c = a.match(/^--([^=]+)=([\s\S]*)$/);
+                        u = c[1];
+                        var p = c[2];
+                        if (r.bools[u]) p = "false" !== p;
+                        setArg(u, p, a);
+                    } else if (/^--no-.+/.test(a)) {
+                        u = a.match(/^--no-(.+)/)[1];
+                        setArg(u, false, a);
+                    } else if (/^--.+/.test(a)) {
+                        u = a.match(/^--(.+)/)[1];
+                        l = e[f + 1];
+                        if (void 0 === l || /^(-|--)[^-]/.test(l) || r.bools[u] || r.allBools || (n[u] ? aliasIsBoolean(u) : false)) if (/^(true|false)$/.test(l)) {
+                            setArg(u, "true" === l, a);
+                            f += 1;
+                        } else setArg(u, r.strings[u] ? "" : true, a);
                         else {
-                            setArg(l, p, f);
-                            a++;
+                            setArg(u, l, a);
+                            f += 1;
                         }
-                    } else if (/^-[^-]+/.test(f)) {
-                        var b = f.slice(1, -1).split("");
-                        var _ = false;
-                        for(var g = 0; g < b.length; g++){
-                            var p = f.slice(g + 2);
-                            if ("-" === p) {
-                                setArg(b[g], p, f);
+                    } else if (/^-[^-]+/.test(a)) {
+                        var b = a.slice(1, -1).split("");
+                        var g = false;
+                        for(var y = 0; y < b.length; y++){
+                            l = a.slice(y + 2);
+                            if ("-" === l) {
+                                setArg(b[y], l, a);
                                 continue;
                             }
-                            if (/[A-Za-z]/.test(b[g]) && /=/.test(p)) {
-                                setArg(b[g], p.split("=")[1], f);
-                                _ = true;
+                            if (/[A-Za-z]/.test(b[y]) && "=" === l[0]) {
+                                setArg(b[y], l.slice(1), a);
+                                g = true;
                                 break;
                             }
-                            if (/[A-Za-z]/.test(b[g]) && /-?\d+(\.\d*)?(e-?\d+)?$/.test(p)) {
-                                setArg(b[g], p, f);
-                                _ = true;
+                            if (/[A-Za-z]/.test(b[y]) && /-?\d+(\.\d*)?(e-?\d+)?$/.test(l)) {
+                                setArg(b[y], l, a);
+                                g = true;
                                 break;
                             }
-                            if (b[g + 1] && b[g + 1].match(/\W/)) {
-                                setArg(b[g], f.slice(g + 2), f);
-                                _ = true;
+                            if (b[y + 1] && b[y + 1].match(/\W/)) {
+                                setArg(b[y], a.slice(y + 2), a);
+                                g = true;
                                 break;
-                            }
-                            setArg(b[g], r.strings[b[g]] ? "" : true, f);
+                            } else setArg(b[y], r.strings[b[y]] ? "" : true, a);
                         }
-                        var l = f.slice(-1)[0];
-                        if (!_ && "-" !== l) if (!e[a + 1] || /^(-|--)[^-]/.test(e[a + 1]) || r.bools[l] || (n[l] ? aliasIsBoolean(l) : false)) if (e[a + 1] && /^(true|false)$/.test(e[a + 1])) {
-                            setArg(l, "true" === e[a + 1], f);
-                            a++;
-                        } else setArg(l, r.strings[l] ? "" : true, f);
+                        u = a.slice(-1)[0];
+                        if (!g && "-" !== u) if (!e[f + 1] || /^(-|--)[^-]/.test(e[f + 1]) || r.bools[u] || (n[u] ? aliasIsBoolean(u) : false)) if (e[f + 1] && /^(true|false)$/.test(e[f + 1])) {
+                            setArg(u, "true" === e[f + 1], a);
+                            f += 1;
+                        } else setArg(u, r.strings[u] ? "" : true, a);
                         else {
-                            setArg(l, e[a + 1], f);
-                            a++;
+                            setArg(u, e[f + 1], a);
+                            f += 1;
                         }
                     } else {
-                        if (!r.unknownFn || false !== r.unknownFn(f)) s._.push(r.strings["_"] || !isNumber(f) ? f : Number(f));
+                        if (!r.unknownFn || false !== r.unknownFn(a)) s._.push(r.strings._ || !isNumber(a) ? a : Number(a));
                         if (t.stopEarly) {
-                            s._.push.apply(s._, e.slice(a + 1));
+                            s._.push.apply(s._, e.slice(f + 1));
                             break;
                         }
                     }
@@ -152,32 +172,12 @@
                         });
                     }
                 });
-                if (t["--"]) {
-                    s["--"] = new Array;
-                    i.forEach(function(e) {
-                        s["--"].push(e);
-                    });
-                } else i.forEach(function(e) {
+                if (t["--"]) s["--"] = i.slice();
+                else i.forEach(function(e) {
                     s._.push(e);
                 });
                 return s;
             };
-            function hasKey(e, t) {
-                var r = e;
-                t.slice(0, -1).forEach(function(e) {
-                    r = r[e] || {};
-                });
-                var n = t[t.length - 1];
-                return n in r;
-            }
-            function isNumber(e) {
-                if ("number" == typeof e) return true;
-                if (/^0x[0-9a-f]+$/i.test(e)) return true;
-                return /^[-+]?(?:\d+(?:\.\d*)?|\.\d+)(e[-+]?\d+)?$/.test(e);
-            }
-            function isConstructorOrProto(e, t) {
-                return "constructor" === t && "function" == typeof e[t] || "__proto__" === t;
-            }
         }
     };
     var t = {};
@@ -196,7 +196,6 @@
         }
         return o.exports;
     }
-    if (void 0 !== __nccwpck_require__) __nccwpck_require__.ab = __dirname + "/";
-    var r = __nccwpck_require__(319);
+    var r = __nccwpck_require__(890);
     module.exports = r;
 })();

package/dist/compiled/minimist/licenses-cjs.txt

@@ -0,0 +1,20 @@
+minimist
+MIT
+This software is released under the MIT license:
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of
+this software and associated documentation files (the "Software"), to deal in
+the Software without restriction, including without limitation the rights to
+use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
+the Software, and to permit persons to whom the Software is furnished to do so,
+subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
+FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
+COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
+IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
+CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

package/dist/compiled/minimist/package.json

@@ -1 +1 @@
-{"name":"minimist","author":{"name":"James Halliday","email":"mail@substack.net","url":"http://substack.net"},"version":"1.2.6","license":"MIT"}
+{"name":"minimist","author":{"name":"James Halliday","email":"mail@substack.net","url":"http://substack.net"},"version":"1.2.8","funding":{"url":"https://github.com/sponsors/ljharb"},"license":"MIT","types":"index.d.ts"}

package/dist/compiled/minimist/provenance.json

@@ -0,0 +1,22 @@
+{
+  "name": "minimist",
+  "sourceName": "minimist",
+  "version": "1.2.8",
+  "entrySha256": "9cf5e83d36697a92d8af11e000f513ac30a3464bbb024850f9ffdeb1edf59848",
+  "license": "MIT",
+  "repository": {
+    "type": "git",
+    "url": "git://github.com/minimistjs/minimist.git"
+  },
+  "producer": "scripts/prebundle",
+  "ncc": "0.45.0",
+  "declarations": "6.5.1",
+  "declarationSources": [
+    {
+      "name": "@types/minimist",
+      "version": "1.2.5",
+      "license": "MIT"
+    }
+  ],
+  "lockfileSha256": "b3ac341ea4d3fbd3adf92aa1683e1d5d49f8e7a90ee6b84d9af8904f4643cdd4"
+}

package/dist/compiled/nanoid/LICENSE

@@ -0,0 +1,20 @@
+The MIT License (MIT)
+
+Copyright 2017 Andrey Sitnik <andrey@sitnik.es>
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of
+this software and associated documentation files (the "Software"), to deal in
+the Software without restriction, including without limitation the rights to
+use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
+the Software, and to permit persons to whom the Software is furnished to do so,
+subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
+FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
+COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
+IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
+CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

package/dist/compiled/nanoid/declaration-licenses/nanoid/LICENSE

@@ -0,0 +1,20 @@
+The MIT License (MIT)
+
+Copyright 2017 Andrey Sitnik <andrey@sitnik.es>
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of
+this software and associated documentation files (the "Software"), to deal in
+the Software without restriction, including without limitation the rights to
+use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
+the Software, and to permit persons to whom the Software is furnished to do so,
+subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
+FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
+COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
+IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
+CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

package/dist/compiled/nanoid/index.d.mts

@@ -0,0 +1,108 @@
+/**
+ * A tiny, secure, URL-friendly, unique string ID generator for JavaScript
+ * with hardware random generator.
+ *
+ * ```js
+ * import { nanoid } from 'nanoid'
+ * model.id = nanoid() //=> "V1StGXR8_Z5jdHi6B-myT"
+ * ```
+ *
+ * @module
+ */
+
+/**
+ * Generate secure URL-friendly unique ID.
+ *
+ * By default, the ID will have 21 symbols to have a collision probability
+ * similar to UUID v4.
+ *
+ * ```js
+ * import { nanoid } from 'nanoid'
+ * model.id = nanoid() //=> "Uakgb_J5m9g-0JDMbcJqL"
+ * ```
+ *
+ * @param size Size of the ID. The default size is 21.
+ * @typeparam Type The ID type to replace `string` with some opaque type.
+ * @returns A random string.
+ */
+declare function nanoid<Type extends string>(size?: number): Type
+
+/**
+ * Generate secure unique ID with custom alphabet.
+ *
+ * Alphabet must contain 256 symbols or less. Otherwise, the generator
+ * will not be secure.
+ *
+ * @param alphabet Alphabet used to generate the ID.
+ * @param defaultSize Size of the ID. The default size is 21.
+ * @typeparam Type The ID type to replace `string` with some opaque type.
+ * @returns A random string generator.
+ *
+ * ```js
+ * import { customAlphabet } from 'nanoid'
+ * const nanoid = customAlphabet('0123456789абвгдеё', 5)
+ * nanoid() //=> "8ё56а"
+ * ```
+ */
+declare function customAlphabet<Type extends string>(
+  alphabet: string,
+  defaultSize?: number
+): (size?: number) => Type
+
+/**
+ * Generate unique ID with custom random generator and alphabet.
+ *
+ * Alphabet must contain 256 symbols or less. Otherwise, the generator
+ * will not be secure.
+ *
+ * ```js
+ * import { customRandom } from 'nanoid'
+ *
+ * const nanoid = customRandom('abcdef', 5, size => {
+ *   const random = new Uint8Array(size)
+ *   for (let i = 0; i < size; i++) {
+ *     random[i] = randomByte()
+ *   }
+ *   return random
+ * })
+ *
+ * nanoid() //=> "fbaef"
+ * ```
+ *
+ * @param alphabet Alphabet used to generate a random string.
+ * @param defaultSize Size of the random string.
+ * @param random A random bytes generator.
+ * @typeparam Type The ID type to replace `string` with some opaque type.
+ * @returns A random string generator.
+ */
+declare function customRandom<Type extends string>(
+  alphabet: string,
+  defaultSize: number,
+  random: (bytes: number) => Uint8Array
+): (size?: number) => Type
+
+/**
+ * URL safe symbols.
+ *
+ * ```js
+ * import { customAlphabet, urlAlphabet } from 'nanoid'
+ * const nanoid = customAlphabet(urlAlphabet, 10)
+ * nanoid() //=> "Uakgb_J5m9"
+ * ```
+ */
+declare const urlAlphabet: string
+
+/**
+ * Generate an array of random bytes collected from hardware noise.
+ *
+ * ```js
+ * import { customRandom, random } from 'nanoid'
+ * const nanoid = customRandom("abcdef", 5, random)
+ * ```
+ *
+ * @param bytes Size of the array.
+ * @returns An array of random bytes.
+ */
+declare function random(bytes: number): Uint8Array
+
+export { customAlphabet, customRandom, nanoid, random, urlAlphabet };