{"version":3,"file":"4670-0da72.js","mappings":"kEAGAA,EAAOC,QAAU,SAAUC,EAAQC,EAAUC,GAwB3C,IAlBA,IAAIC,GAAQ,GAAKC,KAAKC,IAAIJ,EAASK,OAAS,GAAKF,KAAKG,KAAO,EAezDC,KAAU,IAAML,EAAOD,EAAOD,EAASK,QACvCG,EAAK,KAMP,IAHA,IAAIC,EAAQV,EAAOQ,GAEfG,EAAIH,EACDG,KAKL,IAFAF,GAAMR,EAASS,EAAMC,GAAKR,IAAS,IAE5BG,UAAYJ,EAAM,OAAOO,I,6BCnCtCX,EAAOC,QAAU,EAAjB,Q,6BCCA,IAGIE,EACAW,EAEAC,EANAC,EAAiB,EAAQ,OAEzBC,EAAW,mEAMf,SAASC,IACLH,GAAW,EAGf,SAASI,EAAcC,GACnB,GAAKA,GAQL,GAAIA,IAAejB,EAAnB,CAIA,GAAIiB,EAAWZ,SAAWS,EAAST,OAC/B,MAAM,IAAIa,MAAM,uCAAyCJ,EAAST,OAAS,qCAAuCY,EAAWZ,OAAS,gBAAkBY,GAG5J,IAAIE,EAASF,EAAWG,MAAM,IAAIC,QAAO,SAASC,EAAMC,EAAKC,GAC1D,OAAOD,IAAQC,EAAIC,YAAYH,MAGlC,GAAIH,EAAOd,OACP,MAAM,IAAIa,MAAM,uCAAyCJ,EAAST,OAAS,yDAA2Dc,EAAOO,KAAK,OAGtJ1B,EAAWiB,EACXF,UAxBQf,IAAac,IACbd,EAAWc,EACXC,KAwDZ,SAASY,IACL,OAAIf,IAGJA,EAtBJ,WACSZ,GACDgB,EAAcF,GAQlB,IALA,IAGIc,EAHAC,EAAc7B,EAASoB,MAAM,IAC7BU,EAAc,GACdC,EAAIlB,EAAemB,YAGhBH,EAAYxB,OAAS,GACxB0B,EAAIlB,EAAemB,YACnBJ,EAAiBzB,KAAK8B,MAAMF,EAAIF,EAAYxB,QAC5CyB,EAAYI,KAAKL,EAAYM,OAAOP,EAAgB,GAAG,IAE3D,OAAOE,EAAYJ,KAAK,IAObU,IAkBfvC,EAAOC,QAAU,CACbuC,IALJ,WACE,OAAOrC,GAAYc,GAKjBwB,WAvDJ,SAAoBrB,GAEhB,OADAD,EAAcC,GACPjB,GAsDPuC,KAnDJ,SAAiBA,GACb1B,EAAe0B,KAAKA,GAChB5B,IAAiB4B,IACjBxB,IACAJ,EAAe4B,IAgDnBC,OAbJ,SAAgBC,GAEZ,OADuBd,IACCc,IAYxB7B,SAAUe,I,6BCnGd,IAaIe,EAGAC,EAhBAC,EAAW,EAAQ,OACR,EAAQ,OA0CvB/C,EAAOC,QArBP,SAAe+C,GACX,IAAIC,EAAM,GAENC,EAAU5C,KAAK8B,MAAmC,MAA5Be,KAAKC,MAnBjB,gBAkCd,OAbIF,IAAYJ,EACZD,KAEAA,EAAU,EACVC,EAAkBI,GAGtBD,GAAYF,EAxBF,GAyBVE,GAAYF,EAASC,GACjBH,EAAU,IACVI,GAAYF,EAASF,IAEzBI,EAAYF,EAASG,K,6BCvCzB,IAAI/C,EAAW,EAAQ,OACnBD,EAAS,EAAQ,OACjBmD,EAAS,EAAQ,OAgBrBrD,EAAOC,QAdP,SAAkBqD,GAMd,IALA,IACIC,EADAC,EAAc,EAGdP,EAAM,IAEFM,GACJN,GAAYI,EAAOnD,EAAQC,EAASqC,MAAO,GAC3Ce,EAAOD,EAAUhD,KAAKmD,IAAI,GAAID,EAAc,GAC5CA,IAEJ,OAAOP,I,6BCfX,IAAI9C,EAAW,EAAQ,OACnBuD,EAAQ,EAAQ,OAChBC,EAAU,EAAQ,OAMlBX,EAAkB,EAAQ,QAA+B,EAyC7D,SAASD,IACP,OAAOW,EAAMV,GAIfhD,EAAOC,QAAU8C,EACjB/C,EAAOC,QAAQ8C,SAAWA,EAC1B/C,EAAOC,QAAQyC,KAxCf,SAAckB,GAEV,OADAzD,EAASuC,KAAKkB,GACP5D,EAAOC,SAuClBD,EAAOC,QAAQ4D,OA9Bf,SAAgBC,GAEZ,OADAd,EAAkBc,EACX9D,EAAOC,SA6BlBD,EAAOC,QAAQwC,WArBf,SAAoBsB,GAKhB,YAJsBC,IAAlBD,GACA5D,EAASsC,WAAWsB,GAGjB5D,EAASY,YAiBpBf,EAAOC,QAAQ0D,QAAUA,G,6BC5DzB,IAAIxD,EAAW,EAAQ,OAavBH,EAAOC,QAXP,SAAmBU,GACf,SAAKA,GAAoB,iBAAPA,GAAmBA,EAAGH,OAAS,GAI7B,IAAIyD,OAAO,KAC7B9D,EAASqC,MAAM0B,QAAQ,uBAAwB,QACjD,KACsBC,KAAKxD,M,uBCT/B,IAEIyD,EAFAC,EAA2B,iBAAXC,SAAwBA,OAAOD,QAAUC,OAAOC,UAahEH,EATCC,GAAWA,EAAOG,gBASN,SAASpE,GAClB,OAAOiE,EAAOG,gBAAgB,IAAIC,WAAWrE,KATpC,SAASA,GAElB,IADA,IAAIQ,EAAQ,GACHC,EAAI,EAAGA,EAAIT,EAAMS,IACtBD,EAAMyB,KAAK/B,KAAK8B,MAAsB,IAAhB9B,KAAKJ,WAE/B,OAAOU,GAQfZ,EAAOC,QAAUmE,G,uBCfjB,IAAI1B,EAAO,EAgBX1C,EAAOC,QAAU,CACbkC,UAVJ,WAEI,OADAO,GAAe,KAAPA,EAAc,OAAS,QACnB,QASZA,KANJ,SAAiBgC,GACbhC,EAAOgC,K,uBChBX1E,EAAOC,QAAU","sources":["/home/vsts/work/1/s/node_modules/nanoid/format.browser.js","/home/vsts/work/1/s/node_modules/shortid/index.js","/home/vsts/work/1/s/node_modules/shortid/lib/alphabet.js","/home/vsts/work/1/s/node_modules/shortid/lib/build.js","/home/vsts/work/1/s/node_modules/shortid/lib/generate.js","/home/vsts/work/1/s/node_modules/shortid/lib/index.js","/home/vsts/work/1/s/node_modules/shortid/lib/is-valid.js","/home/vsts/work/1/s/node_modules/shortid/lib/random/random-byte-browser.js","/home/vsts/work/1/s/node_modules/shortid/lib/random/random-from-seed.js","/home/vsts/work/1/s/node_modules/shortid/lib/util/cluster-worker-id-browser.js"],"sourcesContent":["// This file replaces `format.js` in bundlers like webpack or Rollup,\n// according to `browser` config in `package.json`.\n\nmodule.exports = function (random, alphabet, size) {\n  // We can’t use bytes bigger than the alphabet. To make bytes values closer\n  // to the alphabet, we apply bitmask on them. We look for the closest\n  // `2 ** x - 1` number, which will be bigger than alphabet size. If we have\n  // 30 symbols in the alphabet, we will take 31 (00011111).\n  // We do not use faster Math.clz32, because it is not available in browsers.\n  var mask = (2 << Math.log(alphabet.length - 1) / Math.LN2) - 1\n  // Bitmask is not a perfect solution (in our example it will pass 31 bytes,\n  // which is bigger than the alphabet). As a result, we will need more bytes,\n  // than ID size, because we will refuse bytes bigger than the alphabet.\n\n  // Every hardware random generator call is costly,\n  // because we need to wait for entropy collection. This is why often it will\n  // be faster to ask for few extra bytes in advance, to avoid additional calls.\n\n  // Here we calculate how many random bytes should we call in advance.\n  // It depends on ID length, mask / alphabet size and magic number 1.6\n  // (which was selected according benchmarks).\n\n  // -~f => Math.ceil(f) if n is float number\n  // -~i => i + 1 if n is integer number\n  var step = -~(1.6 * mask * size / alphabet.length)\n  var id = ''\n\n  while (true) {\n    var bytes = random(step)\n    // Compact alternative for `for (var i = 0; i < step; i++)`\n    var i = step\n    while (i--) {\n      // If random byte is bigger than alphabet even after bitmask,\n      // we refuse it by `|| ''`.\n      id += alphabet[bytes[i] & mask] || ''\n      // More compact than `id.length + 1 === size`\n      if (id.length === +size) return id\n    }\n  }\n}\n","'use strict';\nmodule.exports = require('./lib/index');\n","'use strict';\n\nvar randomFromSeed = require('./random/random-from-seed');\n\nvar ORIGINAL = '0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ_-';\nvar alphabet;\nvar previousSeed;\n\nvar shuffled;\n\nfunction reset() {\n    shuffled = false;\n}\n\nfunction setCharacters(_alphabet_) {\n    if (!_alphabet_) {\n        if (alphabet !== ORIGINAL) {\n            alphabet = ORIGINAL;\n            reset();\n        }\n        return;\n    }\n\n    if (_alphabet_ === alphabet) {\n        return;\n    }\n\n    if (_alphabet_.length !== ORIGINAL.length) {\n        throw new Error('Custom alphabet for shortid must be ' + ORIGINAL.length + ' unique characters. You submitted ' + _alphabet_.length + ' characters: ' + _alphabet_);\n    }\n\n    var unique = _alphabet_.split('').filter(function(item, ind, arr){\n       return ind !== arr.lastIndexOf(item);\n    });\n\n    if (unique.length) {\n        throw new Error('Custom alphabet for shortid must be ' + ORIGINAL.length + ' unique characters. These characters were not unique: ' + unique.join(', '));\n    }\n\n    alphabet = _alphabet_;\n    reset();\n}\n\nfunction characters(_alphabet_) {\n    setCharacters(_alphabet_);\n    return alphabet;\n}\n\nfunction setSeed(seed) {\n    randomFromSeed.seed(seed);\n    if (previousSeed !== seed) {\n        reset();\n        previousSeed = seed;\n    }\n}\n\nfunction shuffle() {\n    if (!alphabet) {\n        setCharacters(ORIGINAL);\n    }\n\n    var sourceArray = alphabet.split('');\n    var targetArray = [];\n    var r = randomFromSeed.nextValue();\n    var characterIndex;\n\n    while (sourceArray.length > 0) {\n        r = randomFromSeed.nextValue();\n        characterIndex = Math.floor(r * sourceArray.length);\n        targetArray.push(sourceArray.splice(characterIndex, 1)[0]);\n    }\n    return targetArray.join('');\n}\n\nfunction getShuffled() {\n    if (shuffled) {\n        return shuffled;\n    }\n    shuffled = shuffle();\n    return shuffled;\n}\n\n/**\n * lookup shuffled letter\n * @param index\n * @returns {string}\n */\nfunction lookup(index) {\n    var alphabetShuffled = getShuffled();\n    return alphabetShuffled[index];\n}\n\nfunction get () {\n  return alphabet || ORIGINAL;\n}\n\nmodule.exports = {\n    get: get,\n    characters: characters,\n    seed: setSeed,\n    lookup: lookup,\n    shuffled: getShuffled\n};\n","'use strict';\n\nvar generate = require('./generate');\nvar alphabet = require('./alphabet');\n\n// Ignore all milliseconds before a certain time to reduce the size of the date entropy without sacrificing uniqueness.\n// This number should be updated every year or so to keep the generated id short.\n// To regenerate `new Date() - 0` and bump the version. Always bump the version!\nvar REDUCE_TIME = 1567752802062;\n\n// don't change unless we change the algos or REDUCE_TIME\n// must be an integer and less than 16\nvar version = 7;\n\n// Counter is used when shortid is called multiple times in one second.\nvar counter;\n\n// Remember the last time shortid was called in case counter is needed.\nvar previousSeconds;\n\n/**\n * Generate unique id\n * Returns string id\n */\nfunction build(clusterWorkerId) {\n    var str = '';\n\n    var seconds = Math.floor((Date.now() - REDUCE_TIME) * 0.001);\n\n    if (seconds === previousSeconds) {\n        counter++;\n    } else {\n        counter = 0;\n        previousSeconds = seconds;\n    }\n\n    str = str + generate(version);\n    str = str + generate(clusterWorkerId);\n    if (counter > 0) {\n        str = str + generate(counter);\n    }\n    str = str + generate(seconds);\n    return str;\n}\n\nmodule.exports = build;\n","'use strict';\n\nvar alphabet = require('./alphabet');\nvar random = require('./random/random-byte');\nvar format = require('nanoid/format');\n\nfunction generate(number) {\n    var loopCounter = 0;\n    var done;\n\n    var str = '';\n\n    while (!done) {\n        str = str + format(random, alphabet.get(), 1);\n        done = number < (Math.pow(16, loopCounter + 1 ) );\n        loopCounter++;\n    }\n    return str;\n}\n\nmodule.exports = generate;\n","'use strict';\n\nvar alphabet = require('./alphabet');\nvar build = require('./build');\nvar isValid = require('./is-valid');\n\n// if you are using cluster or multiple servers use this to make each instance\n// has a unique value for worker\n// Note: I don't know if this is automatically set when using third\n// party cluster solutions such as pm2.\nvar clusterWorkerId = require('./util/cluster-worker-id') || 0;\n\n/**\n * Set the seed.\n * Highly recommended if you don't want people to try to figure out your id schema.\n * exposed as shortid.seed(int)\n * @param seed Integer value to seed the random alphabet.  ALWAYS USE THE SAME SEED or you might get overlaps.\n */\nfunction seed(seedValue) {\n    alphabet.seed(seedValue);\n    return module.exports;\n}\n\n/**\n * Set the cluster worker or machine id\n * exposed as shortid.worker(int)\n * @param workerId worker must be positive integer.  Number less than 16 is recommended.\n * returns shortid module so it can be chained.\n */\nfunction worker(workerId) {\n    clusterWorkerId = workerId;\n    return module.exports;\n}\n\n/**\n *\n * sets new characters to use in the alphabet\n * returns the shuffled alphabet\n */\nfunction characters(newCharacters) {\n    if (newCharacters !== undefined) {\n        alphabet.characters(newCharacters);\n    }\n\n    return alphabet.shuffled();\n}\n\n/**\n * Generate unique id\n * Returns string id\n */\nfunction generate() {\n  return build(clusterWorkerId);\n}\n\n// Export all other functions as properties of the generate function\nmodule.exports = generate;\nmodule.exports.generate = generate;\nmodule.exports.seed = seed;\nmodule.exports.worker = worker;\nmodule.exports.characters = characters;\nmodule.exports.isValid = isValid;\n","'use strict';\nvar alphabet = require('./alphabet');\n\nfunction isShortId(id) {\n    if (!id || typeof id !== 'string' || id.length < 6 ) {\n        return false;\n    }\n\n    var nonAlphabetic = new RegExp('[^' +\n      alphabet.get().replace(/[|\\\\{}()[\\]^$+*?.-]/g, '\\\\$&') +\n    ']');\n    return !nonAlphabetic.test(id);\n}\n\nmodule.exports = isShortId;\n","'use strict';\n\nvar crypto = typeof window === 'object' && (window.crypto || window.msCrypto); // IE 11 uses window.msCrypto\n\nvar randomByte;\n\nif (!crypto || !crypto.getRandomValues) {\n    randomByte = function(size) {\n        var bytes = [];\n        for (var i = 0; i < size; i++) {\n            bytes.push(Math.floor(Math.random() * 256));\n        }\n        return bytes;\n    };\n} else {\n    randomByte = function(size) {\n        return crypto.getRandomValues(new Uint8Array(size));\n    };\n}\n\nmodule.exports = randomByte;\n","'use strict';\n\n// Found this seed-based random generator somewhere\n// Based on The Central Randomizer 1.3 (C) 1997 by Paul Houle (houle@msc.cornell.edu)\n\nvar seed = 1;\n\n/**\n * return a random number based on a seed\n * @param seed\n * @returns {number}\n */\nfunction getNextValue() {\n    seed = (seed * 9301 + 49297) % 233280;\n    return seed/(233280.0);\n}\n\nfunction setSeed(_seed_) {\n    seed = _seed_;\n}\n\nmodule.exports = {\n    nextValue: getNextValue,\n    seed: setSeed\n};\n","'use strict';\n\nmodule.exports = 0;\n"],"names":["module","exports","random","alphabet","size","mask","Math","log","length","LN2","step","id","bytes","i","previousSeed","shuffled","randomFromSeed","ORIGINAL","reset","setCharacters","_alphabet_","Error","unique","split","filter","item","ind","arr","lastIndexOf","join","getShuffled","characterIndex","sourceArray","targetArray","r","nextValue","floor","push","splice","shuffle","get","characters","seed","lookup","index","counter","previousSeconds","generate","clusterWorkerId","str","seconds","Date","now","format","number","done","loopCounter","pow","build","isValid","seedValue","worker","workerId","newCharacters","undefined","RegExp","replace","test","randomByte","crypto","window","msCrypto","getRandomValues","Uint8Array","_seed_"],"sourceRoot":""}