vbapm 0.6.3-alpha

package/lib/index-35cff1d5.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index-35cff1d5.js","sources":["../node_modules/fs.realpath/old.js","../node_modules/fs.realpath/index.js","../node_modules/path-is-absolute/index.js","../node_modules/glob/common.js","../node_modules/glob/sync.js","../node_modules/inflight/inflight.js","../node_modules/glob/glob.js","../node_modules/async/dist/async.js","../node_modules/lazystream/node_modules/readable-stream/passthrough.js","../node_modules/lazystream/lib/lazystream.js","../node_modules/normalize-path/index.js","../node_modules/lodash.defaults/index.js","../node_modules/archiver-utils/node_modules/readable-stream/readable.js","../node_modules/lodash.flatten/index.js","../node_modules/lodash.difference/index.js","../node_modules/lodash.union/index.js","../node_modules/lodash.isplainobject/index.js","../node_modules/archiver-utils/file.js","../node_modules/archiver-utils/index.js","../node_modules/archiver/lib/error.js","../node_modules/readable-stream/readable.js","../node_modules/archiver/lib/core.js","../node_modules/compress-commons/lib/archivers/archive-entry.js","../node_modules/compress-commons/lib/archivers/zip/util.js","../node_modules/compress-commons/lib/archivers/zip/general-purpose-bit.js","../node_modules/compress-commons/lib/archivers/zip/unix-stat.js","../node_modules/compress-commons/lib/archivers/zip/constants.js","../node_modules/compress-commons/lib/archivers/zip/zip-archive-entry.js","../node_modules/compress-commons/node_modules/readable-stream/readable.js","../node_modules/compress-commons/lib/util/index.js","../node_modules/compress-commons/lib/archivers/archive-output-stream.js","../node_modules/crc/create_buffer.js","../node_modules/crc/define_crc.js","../node_modules/crc/crc1.js","../node_modules/crc/crc8.js","../node_modules/crc/crc81wire.js","../node_modules/crc/crc16.js","../node_modules/crc/crc16ccitt.js","../node_modules/crc/crc16modbus.js","../node_modules/crc/crc16xmodem.js","../node_modules/crc/crc16kermit.js","../node_modules/crc/crc24.js","../node_modules/crc/crc32.js","../node_modules/crc/crcjam.js","../node_modules/crc/index.js","../node_modules/crc32-stream/lib/crc32-stream.js","../node_modules/crc32-stream/lib/deflate-crc32-stream.js","../node_modules/crc32-stream/lib/index.js","../node_modules/compress-commons/lib/archivers/zip/zip-archive-output-stream.js","../node_modules/compress-commons/lib/compress-commons.js","../node_modules/zip-stream/index.js","../node_modules/archiver/lib/plugins/zip.js","../node_modules/bl/BufferList.js","../node_modules/bl/bl.js","../node_modules/tar-stream/headers.js","../node_modules/tar-stream/extract.js","../node_modules/tar-stream/pack.js","../node_modules/tar-stream/index.js","../node_modules/archiver/lib/plugins/tar.js","../node_modules/archiver/lib/plugins/json.js","../node_modules/archiver/index.js"],"sourcesContent":["// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\nvar pathModule = require('path');\nvar isWindows = process.platform === 'win32';\nvar fs = require('fs');\n\n// JavaScript implementation of realpath, ported from node pre-v6\n\nvar DEBUG = process.env.NODE_DEBUG && /fs/.test(process.env.NODE_DEBUG);\n\nfunction rethrow() {\n  // Only enable in debug mode. A backtrace uses ~1000 bytes of heap space and\n  // is fairly slow to generate.\n  var callback;\n  if (DEBUG) {\n    var backtrace = new Error;\n    callback = debugCallback;\n  } else\n    callback = missingCallback;\n\n  return callback;\n\n  function debugCallback(err) {\n    if (err) {\n      backtrace.message = err.message;\n      err = backtrace;\n      missingCallback(err);\n    }\n  }\n\n  function missingCallback(err) {\n    if (err) {\n      if (process.throwDeprecation)\n        throw err;  // Forgot a callback but don't know where? Use NODE_DEBUG=fs\n      else if (!process.noDeprecation) {\n        var msg = 'fs: missing callback ' + (err.stack || err.message);\n        if (process.traceDeprecation)\n          console.trace(msg);\n        else\n          console.error(msg);\n      }\n    }\n  }\n}\n\nfunction maybeCallback(cb) {\n  return typeof cb === 'function' ? cb : rethrow();\n}\n\nvar normalize = pathModule.normalize;\n\n// Regexp that finds the next partion of a (partial) path\n// result is [base_with_slash, base], e.g. ['somedir/', 'somedir']\nif (isWindows) {\n  var nextPartRe = /(.*?)(?:[\\/\\\\]+|$)/g;\n} else {\n  var nextPartRe = /(.*?)(?:[\\/]+|$)/g;\n}\n\n// Regex to find the device root, including trailing slash. E.g. 'c:\\\\'.\nif (isWindows) {\n  var splitRootRe = /^(?:[a-zA-Z]:|[\\\\\\/]{2}[^\\\\\\/]+[\\\\\\/][^\\\\\\/]+)?[\\\\\\/]*/;\n} else {\n  var splitRootRe = /^[\\/]*/;\n}\n\nexports.realpathSync = function realpathSync(p, cache) {\n  // make p is absolute\n  p = pathModule.resolve(p);\n\n  if (cache && Object.prototype.hasOwnProperty.call(cache, p)) {\n    return cache[p];\n  }\n\n  var original = p,\n      seenLinks = {},\n      knownHard = {};\n\n  // current character position in p\n  var pos;\n  // the partial path so far, including a trailing slash if any\n  var current;\n  // the partial path without a trailing slash (except when pointing at a root)\n  var base;\n  // the partial path scanned in the previous round, with slash\n  var previous;\n\n  start();\n\n  function start() {\n    // Skip over roots\n    var m = splitRootRe.exec(p);\n    pos = m[0].length;\n    current = m[0];\n    base = m[0];\n    previous = '';\n\n    // On windows, check that the root exists. On unix there is no need.\n    if (isWindows && !knownHard[base]) {\n      fs.lstatSync(base);\n      knownHard[base] = true;\n    }\n  }\n\n  // walk down the path, swapping out linked pathparts for their real\n  // values\n  // NB: p.length changes.\n  while (pos < p.length) {\n    // find the next part\n    nextPartRe.lastIndex = pos;\n    var result = nextPartRe.exec(p);\n    previous = current;\n    current += result[0];\n    base = previous + result[1];\n    pos = nextPartRe.lastIndex;\n\n    // continue if not a symlink\n    if (knownHard[base] || (cache && cache[base] === base)) {\n      continue;\n    }\n\n    var resolvedLink;\n    if (cache && Object.prototype.hasOwnProperty.call(cache, base)) {\n      // some known symbolic link.  no need to stat again.\n      resolvedLink = cache[base];\n    } else {\n      var stat = fs.lstatSync(base);\n      if (!stat.isSymbolicLink()) {\n        knownHard[base] = true;\n        if (cache) cache[base] = base;\n        continue;\n      }\n\n      // read the link if it wasn't read before\n      // dev/ino always return 0 on windows, so skip the check.\n      var linkTarget = null;\n      if (!isWindows) {\n        var id = stat.dev.toString(32) + ':' + stat.ino.toString(32);\n        if (seenLinks.hasOwnProperty(id)) {\n          linkTarget = seenLinks[id];\n        }\n      }\n      if (linkTarget === null) {\n        fs.statSync(base);\n        linkTarget = fs.readlinkSync(base);\n      }\n      resolvedLink = pathModule.resolve(previous, linkTarget);\n      // track this, if given a cache.\n      if (cache) cache[base] = resolvedLink;\n      if (!isWindows) seenLinks[id] = linkTarget;\n    }\n\n    // resolve the link, then start over\n    p = pathModule.resolve(resolvedLink, p.slice(pos));\n    start();\n  }\n\n  if (cache) cache[original] = p;\n\n  return p;\n};\n\n\nexports.realpath = function realpath(p, cache, cb) {\n  if (typeof cb !== 'function') {\n    cb = maybeCallback(cache);\n    cache = null;\n  }\n\n  // make p is absolute\n  p = pathModule.resolve(p);\n\n  if (cache && Object.prototype.hasOwnProperty.call(cache, p)) {\n    return process.nextTick(cb.bind(null, null, cache[p]));\n  }\n\n  var original = p,\n      seenLinks = {},\n      knownHard = {};\n\n  // current character position in p\n  var pos;\n  // the partial path so far, including a trailing slash if any\n  var current;\n  // the partial path without a trailing slash (except when pointing at a root)\n  var base;\n  // the partial path scanned in the previous round, with slash\n  var previous;\n\n  start();\n\n  function start() {\n    // Skip over roots\n    var m = splitRootRe.exec(p);\n    pos = m[0].length;\n    current = m[0];\n    base = m[0];\n    previous = '';\n\n    // On windows, check that the root exists. On unix there is no need.\n    if (isWindows && !knownHard[base]) {\n      fs.lstat(base, function(err) {\n        if (err) return cb(err);\n        knownHard[base] = true;\n        LOOP();\n      });\n    } else {\n      process.nextTick(LOOP);\n    }\n  }\n\n  // walk down the path, swapping out linked pathparts for their real\n  // values\n  function LOOP() {\n    // stop if scanned past end of path\n    if (pos >= p.length) {\n      if (cache) cache[original] = p;\n      return cb(null, p);\n    }\n\n    // find the next part\n    nextPartRe.lastIndex = pos;\n    var result = nextPartRe.exec(p);\n    previous = current;\n    current += result[0];\n    base = previous + result[1];\n    pos = nextPartRe.lastIndex;\n\n    // continue if not a symlink\n    if (knownHard[base] || (cache && cache[base] === base)) {\n      return process.nextTick(LOOP);\n    }\n\n    if (cache && Object.prototype.hasOwnProperty.call(cache, base)) {\n      // known symbolic link.  no need to stat again.\n      return gotResolvedLink(cache[base]);\n    }\n\n    return fs.lstat(base, gotStat);\n  }\n\n  function gotStat(err, stat) {\n    if (err) return cb(err);\n\n    // if not a symlink, skip to the next path part\n    if (!stat.isSymbolicLink()) {\n      knownHard[base] = true;\n      if (cache) cache[base] = base;\n      return process.nextTick(LOOP);\n    }\n\n    // stat & read the link if not read before\n    // call gotTarget as soon as the link target is known\n    // dev/ino always return 0 on windows, so skip the check.\n    if (!isWindows) {\n      var id = stat.dev.toString(32) + ':' + stat.ino.toString(32);\n      if (seenLinks.hasOwnProperty(id)) {\n        return gotTarget(null, seenLinks[id], base);\n      }\n    }\n    fs.stat(base, function(err) {\n      if (err) return cb(err);\n\n      fs.readlink(base, function(err, target) {\n        if (!isWindows) seenLinks[id] = target;\n        gotTarget(err, target);\n      });\n    });\n  }\n\n  function gotTarget(err, target, base) {\n    if (err) return cb(err);\n\n    var resolvedLink = pathModule.resolve(previous, target);\n    if (cache) cache[base] = resolvedLink;\n    gotResolvedLink(resolvedLink);\n  }\n\n  function gotResolvedLink(resolvedLink) {\n    // resolve the link, then start over\n    p = pathModule.resolve(resolvedLink, p.slice(pos));\n    start();\n  }\n};\n","module.exports = realpath\nrealpath.realpath = realpath\nrealpath.sync = realpathSync\nrealpath.realpathSync = realpathSync\nrealpath.monkeypatch = monkeypatch\nrealpath.unmonkeypatch = unmonkeypatch\n\nvar fs = require('fs')\nvar origRealpath = fs.realpath\nvar origRealpathSync = fs.realpathSync\n\nvar version = process.version\nvar ok = /^v[0-5]\\./.test(version)\nvar old = require('./old.js')\n\nfunction newError (er) {\n  return er && er.syscall === 'realpath' && (\n    er.code === 'ELOOP' ||\n    er.code === 'ENOMEM' ||\n    er.code === 'ENAMETOOLONG'\n  )\n}\n\nfunction realpath (p, cache, cb) {\n  if (ok) {\n    return origRealpath(p, cache, cb)\n  }\n\n  if (typeof cache === 'function') {\n    cb = cache\n    cache = null\n  }\n  origRealpath(p, cache, function (er, result) {\n    if (newError(er)) {\n      old.realpath(p, cache, cb)\n    } else {\n      cb(er, result)\n    }\n  })\n}\n\nfunction realpathSync (p, cache) {\n  if (ok) {\n    return origRealpathSync(p, cache)\n  }\n\n  try {\n    return origRealpathSync(p, cache)\n  } catch (er) {\n    if (newError(er)) {\n      return old.realpathSync(p, cache)\n    } else {\n      throw er\n    }\n  }\n}\n\nfunction monkeypatch () {\n  fs.realpath = realpath\n  fs.realpathSync = realpathSync\n}\n\nfunction unmonkeypatch () {\n  fs.realpath = origRealpath\n  fs.realpathSync = origRealpathSync\n}\n","'use strict';\n\nfunction posix(path) {\n\treturn path.charAt(0) === '/';\n}\n\nfunction win32(path) {\n\t// https://github.com/nodejs/node/blob/b3fcc245fb25539909ef1d5eaa01dbf92e168633/lib/path.js#L56\n\tvar splitDeviceRe = /^([a-zA-Z]:|[\\\\\\/]{2}[^\\\\\\/]+[\\\\\\/]+[^\\\\\\/]+)?([\\\\\\/])?([\\s\\S]*?)$/;\n\tvar result = splitDeviceRe.exec(path);\n\tvar device = result[1] || '';\n\tvar isUnc = Boolean(device && device.charAt(1) !== ':');\n\n\t// UNC paths are always absolute\n\treturn Boolean(result[2] || isUnc);\n}\n\nmodule.exports = process.platform === 'win32' ? win32 : posix;\nmodule.exports.posix = posix;\nmodule.exports.win32 = win32;\n","exports.alphasort = alphasort\nexports.alphasorti = alphasorti\nexports.setopts = setopts\nexports.ownProp = ownProp\nexports.makeAbs = makeAbs\nexports.finish = finish\nexports.mark = mark\nexports.isIgnored = isIgnored\nexports.childrenIgnored = childrenIgnored\n\nfunction ownProp (obj, field) {\n  return Object.prototype.hasOwnProperty.call(obj, field)\n}\n\nvar path = require(\"path\")\nvar minimatch = require(\"minimatch\")\nvar isAbsolute = require(\"path-is-absolute\")\nvar Minimatch = minimatch.Minimatch\n\nfunction alphasorti (a, b) {\n  return a.toLowerCase().localeCompare(b.toLowerCase())\n}\n\nfunction alphasort (a, b) {\n  return a.localeCompare(b)\n}\n\nfunction setupIgnores (self, options) {\n  self.ignore = options.ignore || []\n\n  if (!Array.isArray(self.ignore))\n    self.ignore = [self.ignore]\n\n  if (self.ignore.length) {\n    self.ignore = self.ignore.map(ignoreMap)\n  }\n}\n\n// ignore patterns are always in dot:true mode.\nfunction ignoreMap (pattern) {\n  var gmatcher = null\n  if (pattern.slice(-3) === '/**') {\n    var gpattern = pattern.replace(/(\\/\\*\\*)+$/, '')\n    gmatcher = new Minimatch(gpattern, { dot: true })\n  }\n\n  return {\n    matcher: new Minimatch(pattern, { dot: true }),\n    gmatcher: gmatcher\n  }\n}\n\nfunction setopts (self, pattern, options) {\n  if (!options)\n    options = {}\n\n  // base-matching: just use globstar for that.\n  if (options.matchBase && -1 === pattern.indexOf(\"/\")) {\n    if (options.noglobstar) {\n      throw new Error(\"base matching requires globstar\")\n    }\n    pattern = \"**/\" + pattern\n  }\n\n  self.silent = !!options.silent\n  self.pattern = pattern\n  self.strict = options.strict !== false\n  self.realpath = !!options.realpath\n  self.realpathCache = options.realpathCache || Object.create(null)\n  self.follow = !!options.follow\n  self.dot = !!options.dot\n  self.mark = !!options.mark\n  self.nodir = !!options.nodir\n  if (self.nodir)\n    self.mark = true\n  self.sync = !!options.sync\n  self.nounique = !!options.nounique\n  self.nonull = !!options.nonull\n  self.nosort = !!options.nosort\n  self.nocase = !!options.nocase\n  self.stat = !!options.stat\n  self.noprocess = !!options.noprocess\n  self.absolute = !!options.absolute\n\n  self.maxLength = options.maxLength || Infinity\n  self.cache = options.cache || Object.create(null)\n  self.statCache = options.statCache || Object.create(null)\n  self.symlinks = options.symlinks || Object.create(null)\n\n  setupIgnores(self, options)\n\n  self.changedCwd = false\n  var cwd = process.cwd()\n  if (!ownProp(options, \"cwd\"))\n    self.cwd = cwd\n  else {\n    self.cwd = path.resolve(options.cwd)\n    self.changedCwd = self.cwd !== cwd\n  }\n\n  self.root = options.root || path.resolve(self.cwd, \"/\")\n  self.root = path.resolve(self.root)\n  if (process.platform === \"win32\")\n    self.root = self.root.replace(/\\\\/g, \"/\")\n\n  // TODO: is an absolute `cwd` supposed to be resolved against `root`?\n  // e.g. { cwd: '/test', root: __dirname } === path.join(__dirname, '/test')\n  self.cwdAbs = isAbsolute(self.cwd) ? self.cwd : makeAbs(self, self.cwd)\n  if (process.platform === \"win32\")\n    self.cwdAbs = self.cwdAbs.replace(/\\\\/g, \"/\")\n  self.nomount = !!options.nomount\n\n  // disable comments and negation in Minimatch.\n  // Note that they are not supported in Glob itself anyway.\n  options.nonegate = true\n  options.nocomment = true\n\n  self.minimatch = new Minimatch(pattern, options)\n  self.options = self.minimatch.options\n}\n\nfunction finish (self) {\n  var nou = self.nounique\n  var all = nou ? [] : Object.create(null)\n\n  for (var i = 0, l = self.matches.length; i < l; i ++) {\n    var matches = self.matches[i]\n    if (!matches || Object.keys(matches).length === 0) {\n      if (self.nonull) {\n        // do like the shell, and spit out the literal glob\n        var literal = self.minimatch.globSet[i]\n        if (nou)\n          all.push(literal)\n        else\n          all[literal] = true\n      }\n    } else {\n      // had matches\n      var m = Object.keys(matches)\n      if (nou)\n        all.push.apply(all, m)\n      else\n        m.forEach(function (m) {\n          all[m] = true\n        })\n    }\n  }\n\n  if (!nou)\n    all = Object.keys(all)\n\n  if (!self.nosort)\n    all = all.sort(self.nocase ? alphasorti : alphasort)\n\n  // at *some* point we statted all of these\n  if (self.mark) {\n    for (var i = 0; i < all.length; i++) {\n      all[i] = self._mark(all[i])\n    }\n    if (self.nodir) {\n      all = all.filter(function (e) {\n        var notDir = !(/\\/$/.test(e))\n        var c = self.cache[e] || self.cache[makeAbs(self, e)]\n        if (notDir && c)\n          notDir = c !== 'DIR' && !Array.isArray(c)\n        return notDir\n      })\n    }\n  }\n\n  if (self.ignore.length)\n    all = all.filter(function(m) {\n      return !isIgnored(self, m)\n    })\n\n  self.found = all\n}\n\nfunction mark (self, p) {\n  var abs = makeAbs(self, p)\n  var c = self.cache[abs]\n  var m = p\n  if (c) {\n    var isDir = c === 'DIR' || Array.isArray(c)\n    var slash = p.slice(-1) === '/'\n\n    if (isDir && !slash)\n      m += '/'\n    else if (!isDir && slash)\n      m = m.slice(0, -1)\n\n    if (m !== p) {\n      var mabs = makeAbs(self, m)\n      self.statCache[mabs] = self.statCache[abs]\n      self.cache[mabs] = self.cache[abs]\n    }\n  }\n\n  return m\n}\n\n// lotta situps...\nfunction makeAbs (self, f) {\n  var abs = f\n  if (f.charAt(0) === '/') {\n    abs = path.join(self.root, f)\n  } else if (isAbsolute(f) || f === '') {\n    abs = f\n  } else if (self.changedCwd) {\n    abs = path.resolve(self.cwd, f)\n  } else {\n    abs = path.resolve(f)\n  }\n\n  if (process.platform === 'win32')\n    abs = abs.replace(/\\\\/g, '/')\n\n  return abs\n}\n\n\n// Return true, if pattern ends with globstar '**', for the accompanying parent directory.\n// Ex:- If node_modules/** is the pattern, add 'node_modules' to ignore list along with it's contents\nfunction isIgnored (self, path) {\n  if (!self.ignore.length)\n    return false\n\n  return self.ignore.some(function(item) {\n    return item.matcher.match(path) || !!(item.gmatcher && item.gmatcher.match(path))\n  })\n}\n\nfunction childrenIgnored (self, path) {\n  if (!self.ignore.length)\n    return false\n\n  return self.ignore.some(function(item) {\n    return !!(item.gmatcher && item.gmatcher.match(path))\n  })\n}\n","module.exports = globSync\nglobSync.GlobSync = GlobSync\n\nvar fs = require('fs')\nvar rp = require('fs.realpath')\nvar minimatch = require('minimatch')\nvar Minimatch = minimatch.Minimatch\nvar Glob = require('./glob.js').Glob\nvar util = require('util')\nvar path = require('path')\nvar assert = require('assert')\nvar isAbsolute = require('path-is-absolute')\nvar common = require('./common.js')\nvar alphasort = common.alphasort\nvar alphasorti = common.alphasorti\nvar setopts = common.setopts\nvar ownProp = common.ownProp\nvar childrenIgnored = common.childrenIgnored\nvar isIgnored = common.isIgnored\n\nfunction globSync (pattern, options) {\n  if (typeof options === 'function' || arguments.length === 3)\n    throw new TypeError('callback provided to sync glob\\n'+\n                        'See: https://github.com/isaacs/node-glob/issues/167')\n\n  return new GlobSync(pattern, options).found\n}\n\nfunction GlobSync (pattern, options) {\n  if (!pattern)\n    throw new Error('must provide pattern')\n\n  if (typeof options === 'function' || arguments.length === 3)\n    throw new TypeError('callback provided to sync glob\\n'+\n                        'See: https://github.com/isaacs/node-glob/issues/167')\n\n  if (!(this instanceof GlobSync))\n    return new GlobSync(pattern, options)\n\n  setopts(this, pattern, options)\n\n  if (this.noprocess)\n    return this\n\n  var n = this.minimatch.set.length\n  this.matches = new Array(n)\n  for (var i = 0; i < n; i ++) {\n    this._process(this.minimatch.set[i], i, false)\n  }\n  this._finish()\n}\n\nGlobSync.prototype._finish = function () {\n  assert(this instanceof GlobSync)\n  if (this.realpath) {\n    var self = this\n    this.matches.forEach(function (matchset, index) {\n      var set = self.matches[index] = Object.create(null)\n      for (var p in matchset) {\n        try {\n          p = self._makeAbs(p)\n          var real = rp.realpathSync(p, self.realpathCache)\n          set[real] = true\n        } catch (er) {\n          if (er.syscall === 'stat')\n            set[self._makeAbs(p)] = true\n          else\n            throw er\n        }\n      }\n    })\n  }\n  common.finish(this)\n}\n\n\nGlobSync.prototype._process = function (pattern, index, inGlobStar) {\n  assert(this instanceof GlobSync)\n\n  // Get the first [n] parts of pattern that are all strings.\n  var n = 0\n  while (typeof pattern[n] === 'string') {\n    n ++\n  }\n  // now n is the index of the first one that is *not* a string.\n\n  // See if there's anything else\n  var prefix\n  switch (n) {\n    // if not, then this is rather simple\n    case pattern.length:\n      this._processSimple(pattern.join('/'), index)\n      return\n\n    case 0:\n      // pattern *starts* with some non-trivial item.\n      // going to readdir(cwd), but not include the prefix in matches.\n      prefix = null\n      break\n\n    default:\n      // pattern has some string bits in the front.\n      // whatever it starts with, whether that's 'absolute' like /foo/bar,\n      // or 'relative' like '../baz'\n      prefix = pattern.slice(0, n).join('/')\n      break\n  }\n\n  var remain = pattern.slice(n)\n\n  // get the list of entries.\n  var read\n  if (prefix === null)\n    read = '.'\n  else if (isAbsolute(prefix) || isAbsolute(pattern.join('/'))) {\n    if (!prefix || !isAbsolute(prefix))\n      prefix = '/' + prefix\n    read = prefix\n  } else\n    read = prefix\n\n  var abs = this._makeAbs(read)\n\n  //if ignored, skip processing\n  if (childrenIgnored(this, read))\n    return\n\n  var isGlobStar = remain[0] === minimatch.GLOBSTAR\n  if (isGlobStar)\n    this._processGlobStar(prefix, read, abs, remain, index, inGlobStar)\n  else\n    this._processReaddir(prefix, read, abs, remain, index, inGlobStar)\n}\n\n\nGlobSync.prototype._processReaddir = function (prefix, read, abs, remain, index, inGlobStar) {\n  var entries = this._readdir(abs, inGlobStar)\n\n  // if the abs isn't a dir, then nothing can match!\n  if (!entries)\n    return\n\n  // It will only match dot entries if it starts with a dot, or if\n  // dot is set.  Stuff like @(.foo|.bar) isn't allowed.\n  var pn = remain[0]\n  var negate = !!this.minimatch.negate\n  var rawGlob = pn._glob\n  var dotOk = this.dot || rawGlob.charAt(0) === '.'\n\n  var matchedEntries = []\n  for (var i = 0; i < entries.length; i++) {\n    var e = entries[i]\n    if (e.charAt(0) !== '.' || dotOk) {\n      var m\n      if (negate && !prefix) {\n        m = !e.match(pn)\n      } else {\n        m = e.match(pn)\n      }\n      if (m)\n        matchedEntries.push(e)\n    }\n  }\n\n  var len = matchedEntries.length\n  // If there are no matched entries, then nothing matches.\n  if (len === 0)\n    return\n\n  // if this is the last remaining pattern bit, then no need for\n  // an additional stat *unless* the user has specified mark or\n  // stat explicitly.  We know they exist, since readdir returned\n  // them.\n\n  if (remain.length === 1 && !this.mark && !this.stat) {\n    if (!this.matches[index])\n      this.matches[index] = Object.create(null)\n\n    for (var i = 0; i < len; i ++) {\n      var e = matchedEntries[i]\n      if (prefix) {\n        if (prefix.slice(-1) !== '/')\n          e = prefix + '/' + e\n        else\n          e = prefix + e\n      }\n\n      if (e.charAt(0) === '/' && !this.nomount) {\n        e = path.join(this.root, e)\n      }\n      this._emitMatch(index, e)\n    }\n    // This was the last one, and no stats were needed\n    return\n  }\n\n  // now test all matched entries as stand-ins for that part\n  // of the pattern.\n  remain.shift()\n  for (var i = 0; i < len; i ++) {\n    var e = matchedEntries[i]\n    var newPattern\n    if (prefix)\n      newPattern = [prefix, e]\n    else\n      newPattern = [e]\n    this._process(newPattern.concat(remain), index, inGlobStar)\n  }\n}\n\n\nGlobSync.prototype._emitMatch = function (index, e) {\n  if (isIgnored(this, e))\n    return\n\n  var abs = this._makeAbs(e)\n\n  if (this.mark)\n    e = this._mark(e)\n\n  if (this.absolute) {\n    e = abs\n  }\n\n  if (this.matches[index][e])\n    return\n\n  if (this.nodir) {\n    var c = this.cache[abs]\n    if (c === 'DIR' || Array.isArray(c))\n      return\n  }\n\n  this.matches[index][e] = true\n\n  if (this.stat)\n    this._stat(e)\n}\n\n\nGlobSync.prototype._readdirInGlobStar = function (abs) {\n  // follow all symlinked directories forever\n  // just proceed as if this is a non-globstar situation\n  if (this.follow)\n    return this._readdir(abs, false)\n\n  var entries\n  var lstat\n  var stat\n  try {\n    lstat = fs.lstatSync(abs)\n  } catch (er) {\n    if (er.code === 'ENOENT') {\n      // lstat failed, doesn't exist\n      return null\n    }\n  }\n\n  var isSym = lstat && lstat.isSymbolicLink()\n  this.symlinks[abs] = isSym\n\n  // If it's not a symlink or a dir, then it's definitely a regular file.\n  // don't bother doing a readdir in that case.\n  if (!isSym && lstat && !lstat.isDirectory())\n    this.cache[abs] = 'FILE'\n  else\n    entries = this._readdir(abs, false)\n\n  return entries\n}\n\nGlobSync.prototype._readdir = function (abs, inGlobStar) {\n  var entries\n\n  if (inGlobStar && !ownProp(this.symlinks, abs))\n    return this._readdirInGlobStar(abs)\n\n  if (ownProp(this.cache, abs)) {\n    var c = this.cache[abs]\n    if (!c || c === 'FILE')\n      return null\n\n    if (Array.isArray(c))\n      return c\n  }\n\n  try {\n    return this._readdirEntries(abs, fs.readdirSync(abs))\n  } catch (er) {\n    this._readdirError(abs, er)\n    return null\n  }\n}\n\nGlobSync.prototype._readdirEntries = function (abs, entries) {\n  // if we haven't asked to stat everything, then just\n  // assume that everything in there exists, so we can avoid\n  // having to stat it a second time.\n  if (!this.mark && !this.stat) {\n    for (var i = 0; i < entries.length; i ++) {\n      var e = entries[i]\n      if (abs === '/')\n        e = abs + e\n      else\n        e = abs + '/' + e\n      this.cache[e] = true\n    }\n  }\n\n  this.cache[abs] = entries\n\n  // mark and cache dir-ness\n  return entries\n}\n\nGlobSync.prototype._readdirError = function (f, er) {\n  // handle errors, and cache the information\n  switch (er.code) {\n    case 'ENOTSUP': // https://github.com/isaacs/node-glob/issues/205\n    case 'ENOTDIR': // totally normal. means it *does* exist.\n      var abs = this._makeAbs(f)\n      this.cache[abs] = 'FILE'\n      if (abs === this.cwdAbs) {\n        var error = new Error(er.code + ' invalid cwd ' + this.cwd)\n        error.path = this.cwd\n        error.code = er.code\n        throw error\n      }\n      break\n\n    case 'ENOENT': // not terribly unusual\n    case 'ELOOP':\n    case 'ENAMETOOLONG':\n    case 'UNKNOWN':\n      this.cache[this._makeAbs(f)] = false\n      break\n\n    default: // some unusual error.  Treat as failure.\n      this.cache[this._makeAbs(f)] = false\n      if (this.strict)\n        throw er\n      if (!this.silent)\n        console.error('glob error', er)\n      break\n  }\n}\n\nGlobSync.prototype._processGlobStar = function (prefix, read, abs, remain, index, inGlobStar) {\n\n  var entries = this._readdir(abs, inGlobStar)\n\n  // no entries means not a dir, so it can never have matches\n  // foo.txt/** doesn't match foo.txt\n  if (!entries)\n    return\n\n  // test without the globstar, and with every child both below\n  // and replacing the globstar.\n  var remainWithoutGlobStar = remain.slice(1)\n  var gspref = prefix ? [ prefix ] : []\n  var noGlobStar = gspref.concat(remainWithoutGlobStar)\n\n  // the noGlobStar pattern exits the inGlobStar state\n  this._process(noGlobStar, index, false)\n\n  var len = entries.length\n  var isSym = this.symlinks[abs]\n\n  // If it's a symlink, and we're in a globstar, then stop\n  if (isSym && inGlobStar)\n    return\n\n  for (var i = 0; i < len; i++) {\n    var e = entries[i]\n    if (e.charAt(0) === '.' && !this.dot)\n      continue\n\n    // these two cases enter the inGlobStar state\n    var instead = gspref.concat(entries[i], remainWithoutGlobStar)\n    this._process(instead, index, true)\n\n    var below = gspref.concat(entries[i], remain)\n    this._process(below, index, true)\n  }\n}\n\nGlobSync.prototype._processSimple = function (prefix, index) {\n  // XXX review this.  Shouldn't it be doing the mounting etc\n  // before doing stat?  kinda weird?\n  var exists = this._stat(prefix)\n\n  if (!this.matches[index])\n    this.matches[index] = Object.create(null)\n\n  // If it doesn't exist, then just mark the lack of results\n  if (!exists)\n    return\n\n  if (prefix && isAbsolute(prefix) && !this.nomount) {\n    var trail = /[\\/\\\\]$/.test(prefix)\n    if (prefix.charAt(0) === '/') {\n      prefix = path.join(this.root, prefix)\n    } else {\n      prefix = path.resolve(this.root, prefix)\n      if (trail)\n        prefix += '/'\n    }\n  }\n\n  if (process.platform === 'win32')\n    prefix = prefix.replace(/\\\\/g, '/')\n\n  // Mark this as a match\n  this._emitMatch(index, prefix)\n}\n\n// Returns either 'DIR', 'FILE', or false\nGlobSync.prototype._stat = function (f) {\n  var abs = this._makeAbs(f)\n  var needDir = f.slice(-1) === '/'\n\n  if (f.length > this.maxLength)\n    return false\n\n  if (!this.stat && ownProp(this.cache, abs)) {\n    var c = this.cache[abs]\n\n    if (Array.isArray(c))\n      c = 'DIR'\n\n    // It exists, but maybe not how we need it\n    if (!needDir || c === 'DIR')\n      return c\n\n    if (needDir && c === 'FILE')\n      return false\n\n    // otherwise we have to stat, because maybe c=true\n    // if we know it exists, but not what it is.\n  }\n\n  var exists\n  var stat = this.statCache[abs]\n  if (!stat) {\n    var lstat\n    try {\n      lstat = fs.lstatSync(abs)\n    } catch (er) {\n      if (er && (er.code === 'ENOENT' || er.code === 'ENOTDIR')) {\n        this.statCache[abs] = false\n        return false\n      }\n    }\n\n    if (lstat && lstat.isSymbolicLink()) {\n      try {\n        stat = fs.statSync(abs)\n      } catch (er) {\n        stat = lstat\n      }\n    } else {\n      stat = lstat\n    }\n  }\n\n  this.statCache[abs] = stat\n\n  var c = true\n  if (stat)\n    c = stat.isDirectory() ? 'DIR' : 'FILE'\n\n  this.cache[abs] = this.cache[abs] || c\n\n  if (needDir && c === 'FILE')\n    return false\n\n  return c\n}\n\nGlobSync.prototype._mark = function (p) {\n  return common.mark(this, p)\n}\n\nGlobSync.prototype._makeAbs = function (f) {\n  return common.makeAbs(this, f)\n}\n","var wrappy = require('wrappy')\nvar reqs = Object.create(null)\nvar once = require('once')\n\nmodule.exports = wrappy(inflight)\n\nfunction inflight (key, cb) {\n  if (reqs[key]) {\n    reqs[key].push(cb)\n    return null\n  } else {\n    reqs[key] = [cb]\n    return makeres(key)\n  }\n}\n\nfunction makeres (key) {\n  return once(function RES () {\n    var cbs = reqs[key]\n    var len = cbs.length\n    var args = slice(arguments)\n\n    // XXX It's somewhat ambiguous whether a new callback added in this\n    // pass should be queued for later execution if something in the\n    // list of callbacks throws, or if it should just be discarded.\n    // However, it's such an edge case that it hardly matters, and either\n    // choice is likely as surprising as the other.\n    // As it happens, we do go ahead and schedule it for later execution.\n    try {\n      for (var i = 0; i < len; i++) {\n        cbs[i].apply(null, args)\n      }\n    } finally {\n      if (cbs.length > len) {\n        // added more in the interim.\n        // de-zalgo, just in case, but don't call again.\n        cbs.splice(0, len)\n        process.nextTick(function () {\n          RES.apply(null, args)\n        })\n      } else {\n        delete reqs[key]\n      }\n    }\n  })\n}\n\nfunction slice (args) {\n  var length = args.length\n  var array = []\n\n  for (var i = 0; i < length; i++) array[i] = args[i]\n  return array\n}\n","// Approach:\n//\n// 1. Get the minimatch set\n// 2. For each pattern in the set, PROCESS(pattern, false)\n// 3. Store matches per-set, then uniq them\n//\n// PROCESS(pattern, inGlobStar)\n// Get the first [n] items from pattern that are all strings\n// Join these together.  This is PREFIX.\n//   If there is no more remaining, then stat(PREFIX) and\n//   add to matches if it succeeds.  END.\n//\n// If inGlobStar and PREFIX is symlink and points to dir\n//   set ENTRIES = []\n// else readdir(PREFIX) as ENTRIES\n//   If fail, END\n//\n// with ENTRIES\n//   If pattern[n] is GLOBSTAR\n//     // handle the case where the globstar match is empty\n//     // by pruning it out, and testing the resulting pattern\n//     PROCESS(pattern[0..n] + pattern[n+1 .. $], false)\n//     // handle other cases.\n//     for ENTRY in ENTRIES (not dotfiles)\n//       // attach globstar + tail onto the entry\n//       // Mark that this entry is a globstar match\n//       PROCESS(pattern[0..n] + ENTRY + pattern[n .. $], true)\n//\n//   else // not globstar\n//     for ENTRY in ENTRIES (not dotfiles, unless pattern[n] is dot)\n//       Test ENTRY against pattern[n]\n//       If fails, continue\n//       If passes, PROCESS(pattern[0..n] + item + pattern[n+1 .. $])\n//\n// Caveat:\n//   Cache all stats and readdirs results to minimize syscall.  Since all\n//   we ever care about is existence and directory-ness, we can just keep\n//   `true` for files, and [children,...] for directories, or `false` for\n//   things that don't exist.\n\nmodule.exports = glob\n\nvar fs = require('fs')\nvar rp = require('fs.realpath')\nvar minimatch = require('minimatch')\nvar Minimatch = minimatch.Minimatch\nvar inherits = require('inherits')\nvar EE = require('events').EventEmitter\nvar path = require('path')\nvar assert = require('assert')\nvar isAbsolute = require('path-is-absolute')\nvar globSync = require('./sync.js')\nvar common = require('./common.js')\nvar alphasort = common.alphasort\nvar alphasorti = common.alphasorti\nvar setopts = common.setopts\nvar ownProp = common.ownProp\nvar inflight = require('inflight')\nvar util = require('util')\nvar childrenIgnored = common.childrenIgnored\nvar isIgnored = common.isIgnored\n\nvar once = require('once')\n\nfunction glob (pattern, options, cb) {\n  if (typeof options === 'function') cb = options, options = {}\n  if (!options) options = {}\n\n  if (options.sync) {\n    if (cb)\n      throw new TypeError('callback provided to sync glob')\n    return globSync(pattern, options)\n  }\n\n  return new Glob(pattern, options, cb)\n}\n\nglob.sync = globSync\nvar GlobSync = glob.GlobSync = globSync.GlobSync\n\n// old api surface\nglob.glob = glob\n\nfunction extend (origin, add) {\n  if (add === null || typeof add !== 'object') {\n    return origin\n  }\n\n  var keys = Object.keys(add)\n  var i = keys.length\n  while (i--) {\n    origin[keys[i]] = add[keys[i]]\n  }\n  return origin\n}\n\nglob.hasMagic = function (pattern, options_) {\n  var options = extend({}, options_)\n  options.noprocess = true\n\n  var g = new Glob(pattern, options)\n  var set = g.minimatch.set\n\n  if (!pattern)\n    return false\n\n  if (set.length > 1)\n    return true\n\n  for (var j = 0; j < set[0].length; j++) {\n    if (typeof set[0][j] !== 'string')\n      return true\n  }\n\n  return false\n}\n\nglob.Glob = Glob\ninherits(Glob, EE)\nfunction Glob (pattern, options, cb) {\n  if (typeof options === 'function') {\n    cb = options\n    options = null\n  }\n\n  if (options && options.sync) {\n    if (cb)\n      throw new TypeError('callback provided to sync glob')\n    return new GlobSync(pattern, options)\n  }\n\n  if (!(this instanceof Glob))\n    return new Glob(pattern, options, cb)\n\n  setopts(this, pattern, options)\n  this._didRealPath = false\n\n  // process each pattern in the minimatch set\n  var n = this.minimatch.set.length\n\n  // The matches are stored as {<filename>: true,...} so that\n  // duplicates are automagically pruned.\n  // Later, we do an Object.keys() on these.\n  // Keep them as a list so we can fill in when nonull is set.\n  this.matches = new Array(n)\n\n  if (typeof cb === 'function') {\n    cb = once(cb)\n    this.on('error', cb)\n    this.on('end', function (matches) {\n      cb(null, matches)\n    })\n  }\n\n  var self = this\n  this._processing = 0\n\n  this._emitQueue = []\n  this._processQueue = []\n  this.paused = false\n\n  if (this.noprocess)\n    return this\n\n  if (n === 0)\n    return done()\n\n  var sync = true\n  for (var i = 0; i < n; i ++) {\n    this._process(this.minimatch.set[i], i, false, done)\n  }\n  sync = false\n\n  function done () {\n    --self._processing\n    if (self._processing <= 0) {\n      if (sync) {\n        process.nextTick(function () {\n          self._finish()\n        })\n      } else {\n        self._finish()\n      }\n    }\n  }\n}\n\nGlob.prototype._finish = function () {\n  assert(this instanceof Glob)\n  if (this.aborted)\n    return\n\n  if (this.realpath && !this._didRealpath)\n    return this._realpath()\n\n  common.finish(this)\n  this.emit('end', this.found)\n}\n\nGlob.prototype._realpath = function () {\n  if (this._didRealpath)\n    return\n\n  this._didRealpath = true\n\n  var n = this.matches.length\n  if (n === 0)\n    return this._finish()\n\n  var self = this\n  for (var i = 0; i < this.matches.length; i++)\n    this._realpathSet(i, next)\n\n  function next () {\n    if (--n === 0)\n      self._finish()\n  }\n}\n\nGlob.prototype._realpathSet = function (index, cb) {\n  var matchset = this.matches[index]\n  if (!matchset)\n    return cb()\n\n  var found = Object.keys(matchset)\n  var self = this\n  var n = found.length\n\n  if (n === 0)\n    return cb()\n\n  var set = this.matches[index] = Object.create(null)\n  found.forEach(function (p, i) {\n    // If there's a problem with the stat, then it means that\n    // one or more of the links in the realpath couldn't be\n    // resolved.  just return the abs value in that case.\n    p = self._makeAbs(p)\n    rp.realpath(p, self.realpathCache, function (er, real) {\n      if (!er)\n        set[real] = true\n      else if (er.syscall === 'stat')\n        set[p] = true\n      else\n        self.emit('error', er) // srsly wtf right here\n\n      if (--n === 0) {\n        self.matches[index] = set\n        cb()\n      }\n    })\n  })\n}\n\nGlob.prototype._mark = function (p) {\n  return common.mark(this, p)\n}\n\nGlob.prototype._makeAbs = function (f) {\n  return common.makeAbs(this, f)\n}\n\nGlob.prototype.abort = function () {\n  this.aborted = true\n  this.emit('abort')\n}\n\nGlob.prototype.pause = function () {\n  if (!this.paused) {\n    this.paused = true\n    this.emit('pause')\n  }\n}\n\nGlob.prototype.resume = function () {\n  if (this.paused) {\n    this.emit('resume')\n    this.paused = false\n    if (this._emitQueue.length) {\n      var eq = this._emitQueue.slice(0)\n      this._emitQueue.length = 0\n      for (var i = 0; i < eq.length; i ++) {\n        var e = eq[i]\n        this._emitMatch(e[0], e[1])\n      }\n    }\n    if (this._processQueue.length) {\n      var pq = this._processQueue.slice(0)\n      this._processQueue.length = 0\n      for (var i = 0; i < pq.length; i ++) {\n        var p = pq[i]\n        this._processing--\n        this._process(p[0], p[1], p[2], p[3])\n      }\n    }\n  }\n}\n\nGlob.prototype._process = function (pattern, index, inGlobStar, cb) {\n  assert(this instanceof Glob)\n  assert(typeof cb === 'function')\n\n  if (this.aborted)\n    return\n\n  this._processing++\n  if (this.paused) {\n    this._processQueue.push([pattern, index, inGlobStar, cb])\n    return\n  }\n\n  //console.error('PROCESS %d', this._processing, pattern)\n\n  // Get the first [n] parts of pattern that are all strings.\n  var n = 0\n  while (typeof pattern[n] === 'string') {\n    n ++\n  }\n  // now n is the index of the first one that is *not* a string.\n\n  // see if there's anything else\n  var prefix\n  switch (n) {\n    // if not, then this is rather simple\n    case pattern.length:\n      this._processSimple(pattern.join('/'), index, cb)\n      return\n\n    case 0:\n      // pattern *starts* with some non-trivial item.\n      // going to readdir(cwd), but not include the prefix in matches.\n      prefix = null\n      break\n\n    default:\n      // pattern has some string bits in the front.\n      // whatever it starts with, whether that's 'absolute' like /foo/bar,\n      // or 'relative' like '../baz'\n      prefix = pattern.slice(0, n).join('/')\n      break\n  }\n\n  var remain = pattern.slice(n)\n\n  // get the list of entries.\n  var read\n  if (prefix === null)\n    read = '.'\n  else if (isAbsolute(prefix) || isAbsolute(pattern.join('/'))) {\n    if (!prefix || !isAbsolute(prefix))\n      prefix = '/' + prefix\n    read = prefix\n  } else\n    read = prefix\n\n  var abs = this._makeAbs(read)\n\n  //if ignored, skip _processing\n  if (childrenIgnored(this, read))\n    return cb()\n\n  var isGlobStar = remain[0] === minimatch.GLOBSTAR\n  if (isGlobStar)\n    this._processGlobStar(prefix, read, abs, remain, index, inGlobStar, cb)\n  else\n    this._processReaddir(prefix, read, abs, remain, index, inGlobStar, cb)\n}\n\nGlob.prototype._processReaddir = function (prefix, read, abs, remain, index, inGlobStar, cb) {\n  var self = this\n  this._readdir(abs, inGlobStar, function (er, entries) {\n    return self._processReaddir2(prefix, read, abs, remain, index, inGlobStar, entries, cb)\n  })\n}\n\nGlob.prototype._processReaddir2 = function (prefix, read, abs, remain, index, inGlobStar, entries, cb) {\n\n  // if the abs isn't a dir, then nothing can match!\n  if (!entries)\n    return cb()\n\n  // It will only match dot entries if it starts with a dot, or if\n  // dot is set.  Stuff like @(.foo|.bar) isn't allowed.\n  var pn = remain[0]\n  var negate = !!this.minimatch.negate\n  var rawGlob = pn._glob\n  var dotOk = this.dot || rawGlob.charAt(0) === '.'\n\n  var matchedEntries = []\n  for (var i = 0; i < entries.length; i++) {\n    var e = entries[i]\n    if (e.charAt(0) !== '.' || dotOk) {\n      var m\n      if (negate && !prefix) {\n        m = !e.match(pn)\n      } else {\n        m = e.match(pn)\n      }\n      if (m)\n        matchedEntries.push(e)\n    }\n  }\n\n  //console.error('prd2', prefix, entries, remain[0]._glob, matchedEntries)\n\n  var len = matchedEntries.length\n  // If there are no matched entries, then nothing matches.\n  if (len === 0)\n    return cb()\n\n  // if this is the last remaining pattern bit, then no need for\n  // an additional stat *unless* the user has specified mark or\n  // stat explicitly.  We know they exist, since readdir returned\n  // them.\n\n  if (remain.length === 1 && !this.mark && !this.stat) {\n    if (!this.matches[index])\n      this.matches[index] = Object.create(null)\n\n    for (var i = 0; i < len; i ++) {\n      var e = matchedEntries[i]\n      if (prefix) {\n        if (prefix !== '/')\n          e = prefix + '/' + e\n        else\n          e = prefix + e\n      }\n\n      if (e.charAt(0) === '/' && !this.nomount) {\n        e = path.join(this.root, e)\n      }\n      this._emitMatch(index, e)\n    }\n    // This was the last one, and no stats were needed\n    return cb()\n  }\n\n  // now test all matched entries as stand-ins for that part\n  // of the pattern.\n  remain.shift()\n  for (var i = 0; i < len; i ++) {\n    var e = matchedEntries[i]\n    var newPattern\n    if (prefix) {\n      if (prefix !== '/')\n        e = prefix + '/' + e\n      else\n        e = prefix + e\n    }\n    this._process([e].concat(remain), index, inGlobStar, cb)\n  }\n  cb()\n}\n\nGlob.prototype._emitMatch = function (index, e) {\n  if (this.aborted)\n    return\n\n  if (isIgnored(this, e))\n    return\n\n  if (this.paused) {\n    this._emitQueue.push([index, e])\n    return\n  }\n\n  var abs = isAbsolute(e) ? e : this._makeAbs(e)\n\n  if (this.mark)\n    e = this._mark(e)\n\n  if (this.absolute)\n    e = abs\n\n  if (this.matches[index][e])\n    return\n\n  if (this.nodir) {\n    var c = this.cache[abs]\n    if (c === 'DIR' || Array.isArray(c))\n      return\n  }\n\n  this.matches[index][e] = true\n\n  var st = this.statCache[abs]\n  if (st)\n    this.emit('stat', e, st)\n\n  this.emit('match', e)\n}\n\nGlob.prototype._readdirInGlobStar = function (abs, cb) {\n  if (this.aborted)\n    return\n\n  // follow all symlinked directories forever\n  // just proceed as if this is a non-globstar situation\n  if (this.follow)\n    return this._readdir(abs, false, cb)\n\n  var lstatkey = 'lstat\\0' + abs\n  var self = this\n  var lstatcb = inflight(lstatkey, lstatcb_)\n\n  if (lstatcb)\n    fs.lstat(abs, lstatcb)\n\n  function lstatcb_ (er, lstat) {\n    if (er && er.code === 'ENOENT')\n      return cb()\n\n    var isSym = lstat && lstat.isSymbolicLink()\n    self.symlinks[abs] = isSym\n\n    // If it's not a symlink or a dir, then it's definitely a regular file.\n    // don't bother doing a readdir in that case.\n    if (!isSym && lstat && !lstat.isDirectory()) {\n      self.cache[abs] = 'FILE'\n      cb()\n    } else\n      self._readdir(abs, false, cb)\n  }\n}\n\nGlob.prototype._readdir = function (abs, inGlobStar, cb) {\n  if (this.aborted)\n    return\n\n  cb = inflight('readdir\\0'+abs+'\\0'+inGlobStar, cb)\n  if (!cb)\n    return\n\n  //console.error('RD %j %j', +inGlobStar, abs)\n  if (inGlobStar && !ownProp(this.symlinks, abs))\n    return this._readdirInGlobStar(abs, cb)\n\n  if (ownProp(this.cache, abs)) {\n    var c = this.cache[abs]\n    if (!c || c === 'FILE')\n      return cb()\n\n    if (Array.isArray(c))\n      return cb(null, c)\n  }\n\n  var self = this\n  fs.readdir(abs, readdirCb(this, abs, cb))\n}\n\nfunction readdirCb (self, abs, cb) {\n  return function (er, entries) {\n    if (er)\n      self._readdirError(abs, er, cb)\n    else\n      self._readdirEntries(abs, entries, cb)\n  }\n}\n\nGlob.prototype._readdirEntries = function (abs, entries, cb) {\n  if (this.aborted)\n    return\n\n  // if we haven't asked to stat everything, then just\n  // assume that everything in there exists, so we can avoid\n  // having to stat it a second time.\n  if (!this.mark && !this.stat) {\n    for (var i = 0; i < entries.length; i ++) {\n      var e = entries[i]\n      if (abs === '/')\n        e = abs + e\n      else\n        e = abs + '/' + e\n      this.cache[e] = true\n    }\n  }\n\n  this.cache[abs] = entries\n  return cb(null, entries)\n}\n\nGlob.prototype._readdirError = function (f, er, cb) {\n  if (this.aborted)\n    return\n\n  // handle errors, and cache the information\n  switch (er.code) {\n    case 'ENOTSUP': // https://github.com/isaacs/node-glob/issues/205\n    case 'ENOTDIR': // totally normal. means it *does* exist.\n      var abs = this._makeAbs(f)\n      this.cache[abs] = 'FILE'\n      if (abs === this.cwdAbs) {\n        var error = new Error(er.code + ' invalid cwd ' + this.cwd)\n        error.path = this.cwd\n        error.code = er.code\n        this.emit('error', error)\n        this.abort()\n      }\n      break\n\n    case 'ENOENT': // not terribly unusual\n    case 'ELOOP':\n    case 'ENAMETOOLONG':\n    case 'UNKNOWN':\n      this.cache[this._makeAbs(f)] = false\n      break\n\n    default: // some unusual error.  Treat as failure.\n      this.cache[this._makeAbs(f)] = false\n      if (this.strict) {\n        this.emit('error', er)\n        // If the error is handled, then we abort\n        // if not, we threw out of here\n        this.abort()\n      }\n      if (!this.silent)\n        console.error('glob error', er)\n      break\n  }\n\n  return cb()\n}\n\nGlob.prototype._processGlobStar = function (prefix, read, abs, remain, index, inGlobStar, cb) {\n  var self = this\n  this._readdir(abs, inGlobStar, function (er, entries) {\n    self._processGlobStar2(prefix, read, abs, remain, index, inGlobStar, entries, cb)\n  })\n}\n\n\nGlob.prototype._processGlobStar2 = function (prefix, read, abs, remain, index, inGlobStar, entries, cb) {\n  //console.error('pgs2', prefix, remain[0], entries)\n\n  // no entries means not a dir, so it can never have matches\n  // foo.txt/** doesn't match foo.txt\n  if (!entries)\n    return cb()\n\n  // test without the globstar, and with every child both below\n  // and replacing the globstar.\n  var remainWithoutGlobStar = remain.slice(1)\n  var gspref = prefix ? [ prefix ] : []\n  var noGlobStar = gspref.concat(remainWithoutGlobStar)\n\n  // the noGlobStar pattern exits the inGlobStar state\n  this._process(noGlobStar, index, false, cb)\n\n  var isSym = this.symlinks[abs]\n  var len = entries.length\n\n  // If it's a symlink, and we're in a globstar, then stop\n  if (isSym && inGlobStar)\n    return cb()\n\n  for (var i = 0; i < len; i++) {\n    var e = entries[i]\n    if (e.charAt(0) === '.' && !this.dot)\n      continue\n\n    // these two cases enter the inGlobStar state\n    var instead = gspref.concat(entries[i], remainWithoutGlobStar)\n    this._process(instead, index, true, cb)\n\n    var below = gspref.concat(entries[i], remain)\n    this._process(below, index, true, cb)\n  }\n\n  cb()\n}\n\nGlob.prototype._processSimple = function (prefix, index, cb) {\n  // XXX review this.  Shouldn't it be doing the mounting etc\n  // before doing stat?  kinda weird?\n  var self = this\n  this._stat(prefix, function (er, exists) {\n    self._processSimple2(prefix, index, er, exists, cb)\n  })\n}\nGlob.prototype._processSimple2 = function (prefix, index, er, exists, cb) {\n\n  //console.error('ps2', prefix, exists)\n\n  if (!this.matches[index])\n    this.matches[index] = Object.create(null)\n\n  // If it doesn't exist, then just mark the lack of results\n  if (!exists)\n    return cb()\n\n  if (prefix && isAbsolute(prefix) && !this.nomount) {\n    var trail = /[\\/\\\\]$/.test(prefix)\n    if (prefix.charAt(0) === '/') {\n      prefix = path.join(this.root, prefix)\n    } else {\n      prefix = path.resolve(this.root, prefix)\n      if (trail)\n        prefix += '/'\n    }\n  }\n\n  if (process.platform === 'win32')\n    prefix = prefix.replace(/\\\\/g, '/')\n\n  // Mark this as a match\n  this._emitMatch(index, prefix)\n  cb()\n}\n\n// Returns either 'DIR', 'FILE', or false\nGlob.prototype._stat = function (f, cb) {\n  var abs = this._makeAbs(f)\n  var needDir = f.slice(-1) === '/'\n\n  if (f.length > this.maxLength)\n    return cb()\n\n  if (!this.stat && ownProp(this.cache, abs)) {\n    var c = this.cache[abs]\n\n    if (Array.isArray(c))\n      c = 'DIR'\n\n    // It exists, but maybe not how we need it\n    if (!needDir || c === 'DIR')\n      return cb(null, c)\n\n    if (needDir && c === 'FILE')\n      return cb()\n\n    // otherwise we have to stat, because maybe c=true\n    // if we know it exists, but not what it is.\n  }\n\n  var exists\n  var stat = this.statCache[abs]\n  if (stat !== undefined) {\n    if (stat === false)\n      return cb(null, stat)\n    else {\n      var type = stat.isDirectory() ? 'DIR' : 'FILE'\n      if (needDir && type === 'FILE')\n        return cb()\n      else\n        return cb(null, type, stat)\n    }\n  }\n\n  var self = this\n  var statcb = inflight('stat\\0' + abs, lstatcb_)\n  if (statcb)\n    fs.lstat(abs, statcb)\n\n  function lstatcb_ (er, lstat) {\n    if (lstat && lstat.isSymbolicLink()) {\n      // If it's a symlink, then treat it as the target, unless\n      // the target does not exist, then treat it as a file.\n      return fs.stat(abs, function (er, stat) {\n        if (er)\n          self._stat2(f, abs, null, lstat, cb)\n        else\n          self._stat2(f, abs, er, stat, cb)\n      })\n    } else {\n      self._stat2(f, abs, er, lstat, cb)\n    }\n  }\n}\n\nGlob.prototype._stat2 = function (f, abs, er, stat, cb) {\n  if (er && (er.code === 'ENOENT' || er.code === 'ENOTDIR')) {\n    this.statCache[abs] = false\n    return cb()\n  }\n\n  var needDir = f.slice(-1) === '/'\n  this.statCache[abs] = stat\n\n  if (abs.slice(-1) === '/' && stat && !stat.isDirectory())\n    return cb(null, false, stat)\n\n  var c = true\n  if (stat)\n    c = stat.isDirectory() ? 'DIR' : 'FILE'\n  this.cache[abs] = this.cache[abs] || c\n\n  if (needDir && c === 'FILE')\n    return cb()\n\n  return cb(null, c, stat)\n}\n","(function (global, factory) {\n  typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports) :\n  typeof define === 'function' && define.amd ? define(['exports'], factory) :\n  (factory((global.async = global.async || {})));\n}(this, (function (exports) { 'use strict';\n\nfunction slice(arrayLike, start) {\n    start = start|0;\n    var newLen = Math.max(arrayLike.length - start, 0);\n    var newArr = Array(newLen);\n    for(var idx = 0; idx < newLen; idx++)  {\n        newArr[idx] = arrayLike[start + idx];\n    }\n    return newArr;\n}\n\n/**\n * Creates a continuation function with some arguments already applied.\n *\n * Useful as a shorthand when combined with other control flow functions. Any\n * arguments passed to the returned function are added to the arguments\n * originally passed to apply.\n *\n * @name apply\n * @static\n * @memberOf module:Utils\n * @method\n * @category Util\n * @param {Function} fn - The function you want to eventually apply all\n * arguments to. Invokes with (arguments...).\n * @param {...*} arguments... - Any number of arguments to automatically apply\n * when the continuation is called.\n * @returns {Function} the partially-applied function\n * @example\n *\n * // using apply\n * async.parallel([\n *     async.apply(fs.writeFile, 'testfile1', 'test1'),\n *     async.apply(fs.writeFile, 'testfile2', 'test2')\n * ]);\n *\n *\n * // the same process without using apply\n * async.parallel([\n *     function(callback) {\n *         fs.writeFile('testfile1', 'test1', callback);\n *     },\n *     function(callback) {\n *         fs.writeFile('testfile2', 'test2', callback);\n *     }\n * ]);\n *\n * // It's possible to pass any number of additional arguments when calling the\n * // continuation:\n *\n * node> var fn = async.apply(sys.puts, 'one');\n * node> fn('two', 'three');\n * one\n * two\n * three\n */\nvar apply = function(fn/*, ...args*/) {\n    var args = slice(arguments, 1);\n    return function(/*callArgs*/) {\n        var callArgs = slice(arguments);\n        return fn.apply(null, args.concat(callArgs));\n    };\n};\n\nvar initialParams = function (fn) {\n    return function (/*...args, callback*/) {\n        var args = slice(arguments);\n        var callback = args.pop();\n        fn.call(this, args, callback);\n    };\n};\n\n/**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\nfunction isObject(value) {\n  var type = typeof value;\n  return value != null && (type == 'object' || type == 'function');\n}\n\nvar hasSetImmediate = typeof setImmediate === 'function' && setImmediate;\nvar hasNextTick = typeof process === 'object' && typeof process.nextTick === 'function';\n\nfunction fallback(fn) {\n    setTimeout(fn, 0);\n}\n\nfunction wrap(defer) {\n    return function (fn/*, ...args*/) {\n        var args = slice(arguments, 1);\n        defer(function () {\n            fn.apply(null, args);\n        });\n    };\n}\n\nvar _defer;\n\nif (hasSetImmediate) {\n    _defer = setImmediate;\n} else if (hasNextTick) {\n    _defer = process.nextTick;\n} else {\n    _defer = fallback;\n}\n\nvar setImmediate$1 = wrap(_defer);\n\n/**\n * Take a sync function and make it async, passing its return value to a\n * callback. This is useful for plugging sync functions into a waterfall,\n * series, or other async functions. Any arguments passed to the generated\n * function will be passed to the wrapped function (except for the final\n * callback argument). Errors thrown will be passed to the callback.\n *\n * If the function passed to `asyncify` returns a Promise, that promises's\n * resolved/rejected state will be used to call the callback, rather than simply\n * the synchronous return value.\n *\n * This also means you can asyncify ES2017 `async` functions.\n *\n * @name asyncify\n * @static\n * @memberOf module:Utils\n * @method\n * @alias wrapSync\n * @category Util\n * @param {Function} func - The synchronous function, or Promise-returning\n * function to convert to an {@link AsyncFunction}.\n * @returns {AsyncFunction} An asynchronous wrapper of the `func`. To be\n * invoked with `(args..., callback)`.\n * @example\n *\n * // passing a regular synchronous function\n * async.waterfall([\n *     async.apply(fs.readFile, filename, \"utf8\"),\n *     async.asyncify(JSON.parse),\n *     function (data, next) {\n *         // data is the result of parsing the text.\n *         // If there was a parsing error, it would have been caught.\n *     }\n * ], callback);\n *\n * // passing a function returning a promise\n * async.waterfall([\n *     async.apply(fs.readFile, filename, \"utf8\"),\n *     async.asyncify(function (contents) {\n *         return db.model.create(contents);\n *     }),\n *     function (model, next) {\n *         // `model` is the instantiated model object.\n *         // If there was an error, this function would be skipped.\n *     }\n * ], callback);\n *\n * // es2017 example, though `asyncify` is not needed if your JS environment\n * // supports async functions out of the box\n * var q = async.queue(async.asyncify(async function(file) {\n *     var intermediateStep = await processFile(file);\n *     return await somePromise(intermediateStep)\n * }));\n *\n * q.push(files);\n */\nfunction asyncify(func) {\n    return initialParams(function (args, callback) {\n        var result;\n        try {\n            result = func.apply(this, args);\n        } catch (e) {\n            return callback(e);\n        }\n        // if result is Promise object\n        if (isObject(result) && typeof result.then === 'function') {\n            result.then(function(value) {\n                invokeCallback(callback, null, value);\n            }, function(err) {\n                invokeCallback(callback, err.message ? err : new Error(err));\n            });\n        } else {\n            callback(null, result);\n        }\n    });\n}\n\nfunction invokeCallback(callback, error, value) {\n    try {\n        callback(error, value);\n    } catch (e) {\n        setImmediate$1(rethrow, e);\n    }\n}\n\nfunction rethrow(error) {\n    throw error;\n}\n\nvar supportsSymbol = typeof Symbol === 'function';\n\nfunction isAsync(fn) {\n    return supportsSymbol && fn[Symbol.toStringTag] === 'AsyncFunction';\n}\n\nfunction wrapAsync(asyncFn) {\n    return isAsync(asyncFn) ? asyncify(asyncFn) : asyncFn;\n}\n\nfunction applyEach$1(eachfn) {\n    return function(fns/*, ...args*/) {\n        var args = slice(arguments, 1);\n        var go = initialParams(function(args, callback) {\n            var that = this;\n            return eachfn(fns, function (fn, cb) {\n                wrapAsync(fn).apply(that, args.concat(cb));\n            }, callback);\n        });\n        if (args.length) {\n            return go.apply(this, args);\n        }\n        else {\n            return go;\n        }\n    };\n}\n\n/** Detect free variable `global` from Node.js. */\nvar freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\n/** Detect free variable `self`. */\nvar freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n/** Used as a reference to the global object. */\nvar root = freeGlobal || freeSelf || Function('return this')();\n\n/** Built-in value references. */\nvar Symbol$1 = root.Symbol;\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar nativeObjectToString = objectProto.toString;\n\n/** Built-in value references. */\nvar symToStringTag$1 = Symbol$1 ? Symbol$1.toStringTag : undefined;\n\n/**\n * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the raw `toStringTag`.\n */\nfunction getRawTag(value) {\n  var isOwn = hasOwnProperty.call(value, symToStringTag$1),\n      tag = value[symToStringTag$1];\n\n  try {\n    value[symToStringTag$1] = undefined;\n    var unmasked = true;\n  } catch (e) {}\n\n  var result = nativeObjectToString.call(value);\n  if (unmasked) {\n    if (isOwn) {\n      value[symToStringTag$1] = tag;\n    } else {\n      delete value[symToStringTag$1];\n    }\n  }\n  return result;\n}\n\n/** Used for built-in method references. */\nvar objectProto$1 = Object.prototype;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar nativeObjectToString$1 = objectProto$1.toString;\n\n/**\n * Converts `value` to a string using `Object.prototype.toString`.\n *\n * @private\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n */\nfunction objectToString(value) {\n  return nativeObjectToString$1.call(value);\n}\n\n/** `Object#toString` result references. */\nvar nullTag = '[object Null]';\nvar undefinedTag = '[object Undefined]';\n\n/** Built-in value references. */\nvar symToStringTag = Symbol$1 ? Symbol$1.toStringTag : undefined;\n\n/**\n * The base implementation of `getTag` without fallbacks for buggy environments.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\nfunction baseGetTag(value) {\n  if (value == null) {\n    return value === undefined ? undefinedTag : nullTag;\n  }\n  return (symToStringTag && symToStringTag in Object(value))\n    ? getRawTag(value)\n    : objectToString(value);\n}\n\n/** `Object#toString` result references. */\nvar asyncTag = '[object AsyncFunction]';\nvar funcTag = '[object Function]';\nvar genTag = '[object GeneratorFunction]';\nvar proxyTag = '[object Proxy]';\n\n/**\n * Checks if `value` is classified as a `Function` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a function, else `false`.\n * @example\n *\n * _.isFunction(_);\n * // => true\n *\n * _.isFunction(/abc/);\n * // => false\n */\nfunction isFunction(value) {\n  if (!isObject(value)) {\n    return false;\n  }\n  // The use of `Object#toString` avoids issues with the `typeof` operator\n  // in Safari 9 which returns 'object' for typed arrays and other constructors.\n  var tag = baseGetTag(value);\n  return tag == funcTag || tag == genTag || tag == asyncTag || tag == proxyTag;\n}\n\n/** Used as references for various `Number` constants. */\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/**\n * Checks if `value` is a valid array-like length.\n *\n * **Note:** This method is loosely based on\n * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.\n * @example\n *\n * _.isLength(3);\n * // => true\n *\n * _.isLength(Number.MIN_VALUE);\n * // => false\n *\n * _.isLength(Infinity);\n * // => false\n *\n * _.isLength('3');\n * // => false\n */\nfunction isLength(value) {\n  return typeof value == 'number' &&\n    value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n}\n\n/**\n * Checks if `value` is array-like. A value is considered array-like if it's\n * not a function and has a `value.length` that's an integer greater than or\n * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is array-like, else `false`.\n * @example\n *\n * _.isArrayLike([1, 2, 3]);\n * // => true\n *\n * _.isArrayLike(document.body.children);\n * // => true\n *\n * _.isArrayLike('abc');\n * // => true\n *\n * _.isArrayLike(_.noop);\n * // => false\n */\nfunction isArrayLike(value) {\n  return value != null && isLength(value.length) && !isFunction(value);\n}\n\n// A temporary value used to identify if the loop should be broken.\n// See #1064, #1293\nvar breakLoop = {};\n\n/**\n * This method returns `undefined`.\n *\n * @static\n * @memberOf _\n * @since 2.3.0\n * @category Util\n * @example\n *\n * _.times(2, _.noop);\n * // => [undefined, undefined]\n */\nfunction noop() {\n  // No operation performed.\n}\n\nfunction once(fn) {\n    return function () {\n        if (fn === null) return;\n        var callFn = fn;\n        fn = null;\n        callFn.apply(this, arguments);\n    };\n}\n\nvar iteratorSymbol = typeof Symbol === 'function' && Symbol.iterator;\n\nvar getIterator = function (coll) {\n    return iteratorSymbol && coll[iteratorSymbol] && coll[iteratorSymbol]();\n};\n\n/**\n * The base implementation of `_.times` without support for iteratee shorthands\n * or max array length checks.\n *\n * @private\n * @param {number} n The number of times to invoke `iteratee`.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the array of results.\n */\nfunction baseTimes(n, iteratee) {\n  var index = -1,\n      result = Array(n);\n\n  while (++index < n) {\n    result[index] = iteratee(index);\n  }\n  return result;\n}\n\n/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n  return value != null && typeof value == 'object';\n}\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]';\n\n/**\n * The base implementation of `_.isArguments`.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n */\nfunction baseIsArguments(value) {\n  return isObjectLike(value) && baseGetTag(value) == argsTag;\n}\n\n/** Used for built-in method references. */\nvar objectProto$3 = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty$2 = objectProto$3.hasOwnProperty;\n\n/** Built-in value references. */\nvar propertyIsEnumerable = objectProto$3.propertyIsEnumerable;\n\n/**\n * Checks if `value` is likely an `arguments` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n *  else `false`.\n * @example\n *\n * _.isArguments(function() { return arguments; }());\n * // => true\n *\n * _.isArguments([1, 2, 3]);\n * // => false\n */\nvar isArguments = baseIsArguments(function() { return arguments; }()) ? baseIsArguments : function(value) {\n  return isObjectLike(value) && hasOwnProperty$2.call(value, 'callee') &&\n    !propertyIsEnumerable.call(value, 'callee');\n};\n\n/**\n * Checks if `value` is classified as an `Array` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array, else `false`.\n * @example\n *\n * _.isArray([1, 2, 3]);\n * // => true\n *\n * _.isArray(document.body.children);\n * // => false\n *\n * _.isArray('abc');\n * // => false\n *\n * _.isArray(_.noop);\n * // => false\n */\nvar isArray = Array.isArray;\n\n/**\n * This method returns `false`.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {boolean} Returns `false`.\n * @example\n *\n * _.times(2, _.stubFalse);\n * // => [false, false]\n */\nfunction stubFalse() {\n  return false;\n}\n\n/** Detect free variable `exports`. */\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/** Built-in value references. */\nvar Buffer = moduleExports ? root.Buffer : undefined;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined;\n\n/**\n * Checks if `value` is a buffer.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a buffer, else `false`.\n * @example\n *\n * _.isBuffer(new Buffer(2));\n * // => true\n *\n * _.isBuffer(new Uint8Array(2));\n * // => false\n */\nvar isBuffer = nativeIsBuffer || stubFalse;\n\n/** Used as references for various `Number` constants. */\nvar MAX_SAFE_INTEGER$1 = 9007199254740991;\n\n/** Used to detect unsigned integer values. */\nvar reIsUint = /^(?:0|[1-9]\\d*)$/;\n\n/**\n * Checks if `value` is a valid array-like index.\n *\n * @private\n * @param {*} value The value to check.\n * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.\n * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.\n */\nfunction isIndex(value, length) {\n  var type = typeof value;\n  length = length == null ? MAX_SAFE_INTEGER$1 : length;\n\n  return !!length &&\n    (type == 'number' ||\n      (type != 'symbol' && reIsUint.test(value))) &&\n        (value > -1 && value % 1 == 0 && value < length);\n}\n\n/** `Object#toString` result references. */\nvar argsTag$1 = '[object Arguments]';\nvar arrayTag = '[object Array]';\nvar boolTag = '[object Boolean]';\nvar dateTag = '[object Date]';\nvar errorTag = '[object Error]';\nvar funcTag$1 = '[object Function]';\nvar mapTag = '[object Map]';\nvar numberTag = '[object Number]';\nvar objectTag = '[object Object]';\nvar regexpTag = '[object RegExp]';\nvar setTag = '[object Set]';\nvar stringTag = '[object String]';\nvar weakMapTag = '[object WeakMap]';\n\nvar arrayBufferTag = '[object ArrayBuffer]';\nvar dataViewTag = '[object DataView]';\nvar float32Tag = '[object Float32Array]';\nvar float64Tag = '[object Float64Array]';\nvar int8Tag = '[object Int8Array]';\nvar int16Tag = '[object Int16Array]';\nvar int32Tag = '[object Int32Array]';\nvar uint8Tag = '[object Uint8Array]';\nvar uint8ClampedTag = '[object Uint8ClampedArray]';\nvar uint16Tag = '[object Uint16Array]';\nvar uint32Tag = '[object Uint32Array]';\n\n/** Used to identify `toStringTag` values of typed arrays. */\nvar typedArrayTags = {};\ntypedArrayTags[float32Tag] = typedArrayTags[float64Tag] =\ntypedArrayTags[int8Tag] = typedArrayTags[int16Tag] =\ntypedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =\ntypedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =\ntypedArrayTags[uint32Tag] = true;\ntypedArrayTags[argsTag$1] = typedArrayTags[arrayTag] =\ntypedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =\ntypedArrayTags[dataViewTag] = typedArrayTags[dateTag] =\ntypedArrayTags[errorTag] = typedArrayTags[funcTag$1] =\ntypedArrayTags[mapTag] = typedArrayTags[numberTag] =\ntypedArrayTags[objectTag] = typedArrayTags[regexpTag] =\ntypedArrayTags[setTag] = typedArrayTags[stringTag] =\ntypedArrayTags[weakMapTag] = false;\n\n/**\n * The base implementation of `_.isTypedArray` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n */\nfunction baseIsTypedArray(value) {\n  return isObjectLike(value) &&\n    isLength(value.length) && !!typedArrayTags[baseGetTag(value)];\n}\n\n/**\n * The base implementation of `_.unary` without support for storing metadata.\n *\n * @private\n * @param {Function} func The function to cap arguments for.\n * @returns {Function} Returns the new capped function.\n */\nfunction baseUnary(func) {\n  return function(value) {\n    return func(value);\n  };\n}\n\n/** Detect free variable `exports`. */\nvar freeExports$1 = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule$1 = freeExports$1 && typeof module == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports$1 = freeModule$1 && freeModule$1.exports === freeExports$1;\n\n/** Detect free variable `process` from Node.js. */\nvar freeProcess = moduleExports$1 && freeGlobal.process;\n\n/** Used to access faster Node.js helpers. */\nvar nodeUtil = (function() {\n  try {\n    // Use `util.types` for Node.js 10+.\n    var types = freeModule$1 && freeModule$1.require && freeModule$1.require('util').types;\n\n    if (types) {\n      return types;\n    }\n\n    // Legacy `process.binding('util')` for Node.js < 10.\n    return freeProcess && freeProcess.binding && freeProcess.binding('util');\n  } catch (e) {}\n}());\n\n/* Node.js helper references. */\nvar nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;\n\n/**\n * Checks if `value` is classified as a typed array.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n * @example\n *\n * _.isTypedArray(new Uint8Array);\n * // => true\n *\n * _.isTypedArray([]);\n * // => false\n */\nvar isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;\n\n/** Used for built-in method references. */\nvar objectProto$2 = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty$1 = objectProto$2.hasOwnProperty;\n\n/**\n * Creates an array of the enumerable property names of the array-like `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @param {boolean} inherited Specify returning inherited property names.\n * @returns {Array} Returns the array of property names.\n */\nfunction arrayLikeKeys(value, inherited) {\n  var isArr = isArray(value),\n      isArg = !isArr && isArguments(value),\n      isBuff = !isArr && !isArg && isBuffer(value),\n      isType = !isArr && !isArg && !isBuff && isTypedArray(value),\n      skipIndexes = isArr || isArg || isBuff || isType,\n      result = skipIndexes ? baseTimes(value.length, String) : [],\n      length = result.length;\n\n  for (var key in value) {\n    if ((inherited || hasOwnProperty$1.call(value, key)) &&\n        !(skipIndexes && (\n           // Safari 9 has enumerable `arguments.length` in strict mode.\n           key == 'length' ||\n           // Node.js 0.10 has enumerable non-index properties on buffers.\n           (isBuff && (key == 'offset' || key == 'parent')) ||\n           // PhantomJS 2 has enumerable non-index properties on typed arrays.\n           (isType && (key == 'buffer' || key == 'byteLength' || key == 'byteOffset')) ||\n           // Skip index properties.\n           isIndex(key, length)\n        ))) {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\n/** Used for built-in method references. */\nvar objectProto$5 = Object.prototype;\n\n/**\n * Checks if `value` is likely a prototype object.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.\n */\nfunction isPrototype(value) {\n  var Ctor = value && value.constructor,\n      proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto$5;\n\n  return value === proto;\n}\n\n/**\n * Creates a unary function that invokes `func` with its argument transformed.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {Function} transform The argument transform.\n * @returns {Function} Returns the new function.\n */\nfunction overArg(func, transform) {\n  return function(arg) {\n    return func(transform(arg));\n  };\n}\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeKeys = overArg(Object.keys, Object);\n\n/** Used for built-in method references. */\nvar objectProto$4 = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty$3 = objectProto$4.hasOwnProperty;\n\n/**\n * The base implementation of `_.keys` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\nfunction baseKeys(object) {\n  if (!isPrototype(object)) {\n    return nativeKeys(object);\n  }\n  var result = [];\n  for (var key in Object(object)) {\n    if (hasOwnProperty$3.call(object, key) && key != 'constructor') {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\n/**\n * Creates an array of the own enumerable property names of `object`.\n *\n * **Note:** Non-object values are coerced to objects. See the\n * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * for more details.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.keys(new Foo);\n * // => ['a', 'b'] (iteration order is not guaranteed)\n *\n * _.keys('hi');\n * // => ['0', '1']\n */\nfunction keys(object) {\n  return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);\n}\n\nfunction createArrayIterator(coll) {\n    var i = -1;\n    var len = coll.length;\n    return function next() {\n        return ++i < len ? {value: coll[i], key: i} : null;\n    }\n}\n\nfunction createES2015Iterator(iterator) {\n    var i = -1;\n    return function next() {\n        var item = iterator.next();\n        if (item.done)\n            return null;\n        i++;\n        return {value: item.value, key: i};\n    }\n}\n\nfunction createObjectIterator(obj) {\n    var okeys = keys(obj);\n    var i = -1;\n    var len = okeys.length;\n    return function next() {\n        var key = okeys[++i];\n        if (key === '__proto__') {\n            return next();\n        }\n        return i < len ? {value: obj[key], key: key} : null;\n    };\n}\n\nfunction iterator(coll) {\n    if (isArrayLike(coll)) {\n        return createArrayIterator(coll);\n    }\n\n    var iterator = getIterator(coll);\n    return iterator ? createES2015Iterator(iterator) : createObjectIterator(coll);\n}\n\nfunction onlyOnce(fn) {\n    return function() {\n        if (fn === null) throw new Error(\"Callback was already called.\");\n        var callFn = fn;\n        fn = null;\n        callFn.apply(this, arguments);\n    };\n}\n\nfunction _eachOfLimit(limit) {\n    return function (obj, iteratee, callback) {\n        callback = once(callback || noop);\n        if (limit <= 0 || !obj) {\n            return callback(null);\n        }\n        var nextElem = iterator(obj);\n        var done = false;\n        var running = 0;\n        var looping = false;\n\n        function iterateeCallback(err, value) {\n            running -= 1;\n            if (err) {\n                done = true;\n                callback(err);\n            }\n            else if (value === breakLoop || (done && running <= 0)) {\n                done = true;\n                return callback(null);\n            }\n            else if (!looping) {\n                replenish();\n            }\n        }\n\n        function replenish () {\n            looping = true;\n            while (running < limit && !done) {\n                var elem = nextElem();\n                if (elem === null) {\n                    done = true;\n                    if (running <= 0) {\n                        callback(null);\n                    }\n                    return;\n                }\n                running += 1;\n                iteratee(elem.value, elem.key, onlyOnce(iterateeCallback));\n            }\n            looping = false;\n        }\n\n        replenish();\n    };\n}\n\n/**\n * The same as [`eachOf`]{@link module:Collections.eachOf} but runs a maximum of `limit` async operations at a\n * time.\n *\n * @name eachOfLimit\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.eachOf]{@link module:Collections.eachOf}\n * @alias forEachOfLimit\n * @category Collection\n * @param {Array|Iterable|Object} coll - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {AsyncFunction} iteratee - An async function to apply to each\n * item in `coll`. The `key` is the item's key, or index in the case of an\n * array.\n * Invoked with (item, key, callback).\n * @param {Function} [callback] - A callback which is called when all\n * `iteratee` functions have finished, or an error occurs. Invoked with (err).\n */\nfunction eachOfLimit(coll, limit, iteratee, callback) {\n    _eachOfLimit(limit)(coll, wrapAsync(iteratee), callback);\n}\n\nfunction doLimit(fn, limit) {\n    return function (iterable, iteratee, callback) {\n        return fn(iterable, limit, iteratee, callback);\n    };\n}\n\n// eachOf implementation optimized for array-likes\nfunction eachOfArrayLike(coll, iteratee, callback) {\n    callback = once(callback || noop);\n    var index = 0,\n        completed = 0,\n        length = coll.length;\n    if (length === 0) {\n        callback(null);\n    }\n\n    function iteratorCallback(err, value) {\n        if (err) {\n            callback(err);\n        } else if ((++completed === length) || value === breakLoop) {\n            callback(null);\n        }\n    }\n\n    for (; index < length; index++) {\n        iteratee(coll[index], index, onlyOnce(iteratorCallback));\n    }\n}\n\n// a generic version of eachOf which can handle array, object, and iterator cases.\nvar eachOfGeneric = doLimit(eachOfLimit, Infinity);\n\n/**\n * Like [`each`]{@link module:Collections.each}, except that it passes the key (or index) as the second argument\n * to the iteratee.\n *\n * @name eachOf\n * @static\n * @memberOf module:Collections\n * @method\n * @alias forEachOf\n * @category Collection\n * @see [async.each]{@link module:Collections.each}\n * @param {Array|Iterable|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - A function to apply to each\n * item in `coll`.\n * The `key` is the item's key, or index in the case of an array.\n * Invoked with (item, key, callback).\n * @param {Function} [callback] - A callback which is called when all\n * `iteratee` functions have finished, or an error occurs. Invoked with (err).\n * @example\n *\n * var obj = {dev: \"/dev.json\", test: \"/test.json\", prod: \"/prod.json\"};\n * var configs = {};\n *\n * async.forEachOf(obj, function (value, key, callback) {\n *     fs.readFile(__dirname + value, \"utf8\", function (err, data) {\n *         if (err) return callback(err);\n *         try {\n *             configs[key] = JSON.parse(data);\n *         } catch (e) {\n *             return callback(e);\n *         }\n *         callback();\n *     });\n * }, function (err) {\n *     if (err) console.error(err.message);\n *     // configs is now a map of JSON data\n *     doSomethingWith(configs);\n * });\n */\nvar eachOf = function(coll, iteratee, callback) {\n    var eachOfImplementation = isArrayLike(coll) ? eachOfArrayLike : eachOfGeneric;\n    eachOfImplementation(coll, wrapAsync(iteratee), callback);\n};\n\nfunction doParallel(fn) {\n    return function (obj, iteratee, callback) {\n        return fn(eachOf, obj, wrapAsync(iteratee), callback);\n    };\n}\n\nfunction _asyncMap(eachfn, arr, iteratee, callback) {\n    callback = callback || noop;\n    arr = arr || [];\n    var results = [];\n    var counter = 0;\n    var _iteratee = wrapAsync(iteratee);\n\n    eachfn(arr, function (value, _, callback) {\n        var index = counter++;\n        _iteratee(value, function (err, v) {\n            results[index] = v;\n            callback(err);\n        });\n    }, function (err) {\n        callback(err, results);\n    });\n}\n\n/**\n * Produces a new collection of values by mapping each value in `coll` through\n * the `iteratee` function. The `iteratee` is called with an item from `coll`\n * and a callback for when it has finished processing. Each of these callback\n * takes 2 arguments: an `error`, and the transformed item from `coll`. If\n * `iteratee` passes an error to its callback, the main `callback` (for the\n * `map` function) is immediately called with the error.\n *\n * Note, that since this function applies the `iteratee` to each item in\n * parallel, there is no guarantee that the `iteratee` functions will complete\n * in order. However, the results array will be in the same order as the\n * original `coll`.\n *\n * If `map` is passed an Object, the results will be an Array.  The results\n * will roughly be in the order of the original Objects' keys (but this can\n * vary across JavaScript engines).\n *\n * @name map\n * @static\n * @memberOf module:Collections\n * @method\n * @category Collection\n * @param {Array|Iterable|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - An async function to apply to each item in\n * `coll`.\n * The iteratee should complete with the transformed item.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called when all `iteratee`\n * functions have finished, or an error occurs. Results is an Array of the\n * transformed items from the `coll`. Invoked with (err, results).\n * @example\n *\n * async.map(['file1','file2','file3'], fs.stat, function(err, results) {\n *     // results is now an array of stats for each file\n * });\n */\nvar map = doParallel(_asyncMap);\n\n/**\n * Applies the provided arguments to each function in the array, calling\n * `callback` after all functions have completed. If you only provide the first\n * argument, `fns`, then it will return a function which lets you pass in the\n * arguments as if it were a single function call. If more arguments are\n * provided, `callback` is required while `args` is still optional.\n *\n * @name applyEach\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @param {Array|Iterable|Object} fns - A collection of {@link AsyncFunction}s\n * to all call with the same arguments\n * @param {...*} [args] - any number of separate arguments to pass to the\n * function.\n * @param {Function} [callback] - the final argument should be the callback,\n * called when all functions have completed processing.\n * @returns {Function} - If only the first argument, `fns`, is provided, it will\n * return a function which lets you pass in the arguments as if it were a single\n * function call. The signature is `(..args, callback)`. If invoked with any\n * arguments, `callback` is required.\n * @example\n *\n * async.applyEach([enableSearch, updateSchema], 'bucket', callback);\n *\n * // partial application example:\n * async.each(\n *     buckets,\n *     async.applyEach([enableSearch, updateSchema]),\n *     callback\n * );\n */\nvar applyEach = applyEach$1(map);\n\nfunction doParallelLimit(fn) {\n    return function (obj, limit, iteratee, callback) {\n        return fn(_eachOfLimit(limit), obj, wrapAsync(iteratee), callback);\n    };\n}\n\n/**\n * The same as [`map`]{@link module:Collections.map} but runs a maximum of `limit` async operations at a time.\n *\n * @name mapLimit\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.map]{@link module:Collections.map}\n * @category Collection\n * @param {Array|Iterable|Object} coll - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {AsyncFunction} iteratee - An async function to apply to each item in\n * `coll`.\n * The iteratee should complete with the transformed item.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called when all `iteratee`\n * functions have finished, or an error occurs. Results is an array of the\n * transformed items from the `coll`. Invoked with (err, results).\n */\nvar mapLimit = doParallelLimit(_asyncMap);\n\n/**\n * The same as [`map`]{@link module:Collections.map} but runs only a single async operation at a time.\n *\n * @name mapSeries\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.map]{@link module:Collections.map}\n * @category Collection\n * @param {Array|Iterable|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - An async function to apply to each item in\n * `coll`.\n * The iteratee should complete with the transformed item.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called when all `iteratee`\n * functions have finished, or an error occurs. Results is an array of the\n * transformed items from the `coll`. Invoked with (err, results).\n */\nvar mapSeries = doLimit(mapLimit, 1);\n\n/**\n * The same as [`applyEach`]{@link module:ControlFlow.applyEach} but runs only a single async operation at a time.\n *\n * @name applyEachSeries\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.applyEach]{@link module:ControlFlow.applyEach}\n * @category Control Flow\n * @param {Array|Iterable|Object} fns - A collection of {@link AsyncFunction}s to all\n * call with the same arguments\n * @param {...*} [args] - any number of separate arguments to pass to the\n * function.\n * @param {Function} [callback] - the final argument should be the callback,\n * called when all functions have completed processing.\n * @returns {Function} - If only the first argument is provided, it will return\n * a function which lets you pass in the arguments as if it were a single\n * function call.\n */\nvar applyEachSeries = applyEach$1(mapSeries);\n\n/**\n * A specialized version of `_.forEach` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns `array`.\n */\nfunction arrayEach(array, iteratee) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  while (++index < length) {\n    if (iteratee(array[index], index, array) === false) {\n      break;\n    }\n  }\n  return array;\n}\n\n/**\n * Creates a base function for methods like `_.forIn` and `_.forOwn`.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n */\nfunction createBaseFor(fromRight) {\n  return function(object, iteratee, keysFunc) {\n    var index = -1,\n        iterable = Object(object),\n        props = keysFunc(object),\n        length = props.length;\n\n    while (length--) {\n      var key = props[fromRight ? length : ++index];\n      if (iteratee(iterable[key], key, iterable) === false) {\n        break;\n      }\n    }\n    return object;\n  };\n}\n\n/**\n * The base implementation of `baseForOwn` which iterates over `object`\n * properties returned by `keysFunc` and invokes `iteratee` for each property.\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @returns {Object} Returns `object`.\n */\nvar baseFor = createBaseFor();\n\n/**\n * The base implementation of `_.forOwn` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Object} Returns `object`.\n */\nfunction baseForOwn(object, iteratee) {\n  return object && baseFor(object, iteratee, keys);\n}\n\n/**\n * The base implementation of `_.findIndex` and `_.findLastIndex` without\n * support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} predicate The function invoked per iteration.\n * @param {number} fromIndex The index to search from.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction baseFindIndex(array, predicate, fromIndex, fromRight) {\n  var length = array.length,\n      index = fromIndex + (fromRight ? 1 : -1);\n\n  while ((fromRight ? index-- : ++index < length)) {\n    if (predicate(array[index], index, array)) {\n      return index;\n    }\n  }\n  return -1;\n}\n\n/**\n * The base implementation of `_.isNaN` without support for number objects.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n */\nfunction baseIsNaN(value) {\n  return value !== value;\n}\n\n/**\n * A specialized version of `_.indexOf` which performs strict equality\n * comparisons of values, i.e. `===`.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction strictIndexOf(array, value, fromIndex) {\n  var index = fromIndex - 1,\n      length = array.length;\n\n  while (++index < length) {\n    if (array[index] === value) {\n      return index;\n    }\n  }\n  return -1;\n}\n\n/**\n * The base implementation of `_.indexOf` without `fromIndex` bounds checks.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction baseIndexOf(array, value, fromIndex) {\n  return value === value\n    ? strictIndexOf(array, value, fromIndex)\n    : baseFindIndex(array, baseIsNaN, fromIndex);\n}\n\n/**\n * Determines the best order for running the {@link AsyncFunction}s in `tasks`, based on\n * their requirements. Each function can optionally depend on other functions\n * being completed first, and each function is run as soon as its requirements\n * are satisfied.\n *\n * If any of the {@link AsyncFunction}s pass an error to their callback, the `auto` sequence\n * will stop. Further tasks will not execute (so any other functions depending\n * on it will not run), and the main `callback` is immediately called with the\n * error.\n *\n * {@link AsyncFunction}s also receive an object containing the results of functions which\n * have completed so far as the first argument, if they have dependencies. If a\n * task function has no dependencies, it will only be passed a callback.\n *\n * @name auto\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @param {Object} tasks - An object. Each of its properties is either a\n * function or an array of requirements, with the {@link AsyncFunction} itself the last item\n * in the array. The object's key of a property serves as the name of the task\n * defined by that property, i.e. can be used when specifying requirements for\n * other tasks. The function receives one or two arguments:\n * * a `results` object, containing the results of the previously executed\n *   functions, only passed if the task has any dependencies,\n * * a `callback(err, result)` function, which must be called when finished,\n *   passing an `error` (which can be `null`) and the result of the function's\n *   execution.\n * @param {number} [concurrency=Infinity] - An optional `integer` for\n * determining the maximum number of tasks that can be run in parallel. By\n * default, as many as possible.\n * @param {Function} [callback] - An optional callback which is called when all\n * the tasks have been completed. It receives the `err` argument if any `tasks`\n * pass an error to their callback. Results are always returned; however, if an\n * error occurs, no further `tasks` will be performed, and the results object\n * will only contain partial results. Invoked with (err, results).\n * @returns undefined\n * @example\n *\n * async.auto({\n *     // this function will just be passed a callback\n *     readData: async.apply(fs.readFile, 'data.txt', 'utf-8'),\n *     showData: ['readData', function(results, cb) {\n *         // results.readData is the file's contents\n *         // ...\n *     }]\n * }, callback);\n *\n * async.auto({\n *     get_data: function(callback) {\n *         console.log('in get_data');\n *         // async code to get some data\n *         callback(null, 'data', 'converted to array');\n *     },\n *     make_folder: function(callback) {\n *         console.log('in make_folder');\n *         // async code to create a directory to store a file in\n *         // this is run at the same time as getting the data\n *         callback(null, 'folder');\n *     },\n *     write_file: ['get_data', 'make_folder', function(results, callback) {\n *         console.log('in write_file', JSON.stringify(results));\n *         // once there is some data and the directory exists,\n *         // write the data to a file in the directory\n *         callback(null, 'filename');\n *     }],\n *     email_link: ['write_file', function(results, callback) {\n *         console.log('in email_link', JSON.stringify(results));\n *         // once the file is written let's email a link to it...\n *         // results.write_file contains the filename returned by write_file.\n *         callback(null, {'file':results.write_file, 'email':'user@example.com'});\n *     }]\n * }, function(err, results) {\n *     console.log('err = ', err);\n *     console.log('results = ', results);\n * });\n */\nvar auto = function (tasks, concurrency, callback) {\n    if (typeof concurrency === 'function') {\n        // concurrency is optional, shift the args.\n        callback = concurrency;\n        concurrency = null;\n    }\n    callback = once(callback || noop);\n    var keys$$1 = keys(tasks);\n    var numTasks = keys$$1.length;\n    if (!numTasks) {\n        return callback(null);\n    }\n    if (!concurrency) {\n        concurrency = numTasks;\n    }\n\n    var results = {};\n    var runningTasks = 0;\n    var hasError = false;\n\n    var listeners = Object.create(null);\n\n    var readyTasks = [];\n\n    // for cycle detection:\n    var readyToCheck = []; // tasks that have been identified as reachable\n    // without the possibility of returning to an ancestor task\n    var uncheckedDependencies = {};\n\n    baseForOwn(tasks, function (task, key) {\n        if (!isArray(task)) {\n            // no dependencies\n            enqueueTask(key, [task]);\n            readyToCheck.push(key);\n            return;\n        }\n\n        var dependencies = task.slice(0, task.length - 1);\n        var remainingDependencies = dependencies.length;\n        if (remainingDependencies === 0) {\n            enqueueTask(key, task);\n            readyToCheck.push(key);\n            return;\n        }\n        uncheckedDependencies[key] = remainingDependencies;\n\n        arrayEach(dependencies, function (dependencyName) {\n            if (!tasks[dependencyName]) {\n                throw new Error('async.auto task `' + key +\n                    '` has a non-existent dependency `' +\n                    dependencyName + '` in ' +\n                    dependencies.join(', '));\n            }\n            addListener(dependencyName, function () {\n                remainingDependencies--;\n                if (remainingDependencies === 0) {\n                    enqueueTask(key, task);\n                }\n            });\n        });\n    });\n\n    checkForDeadlocks();\n    processQueue();\n\n    function enqueueTask(key, task) {\n        readyTasks.push(function () {\n            runTask(key, task);\n        });\n    }\n\n    function processQueue() {\n        if (readyTasks.length === 0 && runningTasks === 0) {\n            return callback(null, results);\n        }\n        while(readyTasks.length && runningTasks < concurrency) {\n            var run = readyTasks.shift();\n            run();\n        }\n\n    }\n\n    function addListener(taskName, fn) {\n        var taskListeners = listeners[taskName];\n        if (!taskListeners) {\n            taskListeners = listeners[taskName] = [];\n        }\n\n        taskListeners.push(fn);\n    }\n\n    function taskComplete(taskName) {\n        var taskListeners = listeners[taskName] || [];\n        arrayEach(taskListeners, function (fn) {\n            fn();\n        });\n        processQueue();\n    }\n\n\n    function runTask(key, task) {\n        if (hasError) return;\n\n        var taskCallback = onlyOnce(function(err, result) {\n            runningTasks--;\n            if (arguments.length > 2) {\n                result = slice(arguments, 1);\n            }\n            if (err) {\n                var safeResults = {};\n                baseForOwn(results, function(val, rkey) {\n                    safeResults[rkey] = val;\n                });\n                safeResults[key] = result;\n                hasError = true;\n                listeners = Object.create(null);\n\n                callback(err, safeResults);\n            } else {\n                results[key] = result;\n                taskComplete(key);\n            }\n        });\n\n        runningTasks++;\n        var taskFn = wrapAsync(task[task.length - 1]);\n        if (task.length > 1) {\n            taskFn(results, taskCallback);\n        } else {\n            taskFn(taskCallback);\n        }\n    }\n\n    function checkForDeadlocks() {\n        // Kahn's algorithm\n        // https://en.wikipedia.org/wiki/Topological_sorting#Kahn.27s_algorithm\n        // http://connalle.blogspot.com/2013/10/topological-sortingkahn-algorithm.html\n        var currentTask;\n        var counter = 0;\n        while (readyToCheck.length) {\n            currentTask = readyToCheck.pop();\n            counter++;\n            arrayEach(getDependents(currentTask), function (dependent) {\n                if (--uncheckedDependencies[dependent] === 0) {\n                    readyToCheck.push(dependent);\n                }\n            });\n        }\n\n        if (counter !== numTasks) {\n            throw new Error(\n                'async.auto cannot execute tasks due to a recursive dependency'\n            );\n        }\n    }\n\n    function getDependents(taskName) {\n        var result = [];\n        baseForOwn(tasks, function (task, key) {\n            if (isArray(task) && baseIndexOf(task, taskName, 0) >= 0) {\n                result.push(key);\n            }\n        });\n        return result;\n    }\n};\n\n/**\n * A specialized version of `_.map` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\nfunction arrayMap(array, iteratee) {\n  var index = -1,\n      length = array == null ? 0 : array.length,\n      result = Array(length);\n\n  while (++index < length) {\n    result[index] = iteratee(array[index], index, array);\n  }\n  return result;\n}\n\n/** `Object#toString` result references. */\nvar symbolTag = '[object Symbol]';\n\n/**\n * Checks if `value` is classified as a `Symbol` primitive or object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.\n * @example\n *\n * _.isSymbol(Symbol.iterator);\n * // => true\n *\n * _.isSymbol('abc');\n * // => false\n */\nfunction isSymbol(value) {\n  return typeof value == 'symbol' ||\n    (isObjectLike(value) && baseGetTag(value) == symbolTag);\n}\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\n\n/** Used to convert symbols to primitives and strings. */\nvar symbolProto = Symbol$1 ? Symbol$1.prototype : undefined;\nvar symbolToString = symbolProto ? symbolProto.toString : undefined;\n\n/**\n * The base implementation of `_.toString` which doesn't convert nullish\n * values to empty strings.\n *\n * @private\n * @param {*} value The value to process.\n * @returns {string} Returns the string.\n */\nfunction baseToString(value) {\n  // Exit early for strings to avoid a performance hit in some environments.\n  if (typeof value == 'string') {\n    return value;\n  }\n  if (isArray(value)) {\n    // Recursively convert values (susceptible to call stack limits).\n    return arrayMap(value, baseToString) + '';\n  }\n  if (isSymbol(value)) {\n    return symbolToString ? symbolToString.call(value) : '';\n  }\n  var result = (value + '');\n  return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n}\n\n/**\n * The base implementation of `_.slice` without an iteratee call guard.\n *\n * @private\n * @param {Array} array The array to slice.\n * @param {number} [start=0] The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the slice of `array`.\n */\nfunction baseSlice(array, start, end) {\n  var index = -1,\n      length = array.length;\n\n  if (start < 0) {\n    start = -start > length ? 0 : (length + start);\n  }\n  end = end > length ? length : end;\n  if (end < 0) {\n    end += length;\n  }\n  length = start > end ? 0 : ((end - start) >>> 0);\n  start >>>= 0;\n\n  var result = Array(length);\n  while (++index < length) {\n    result[index] = array[index + start];\n  }\n  return result;\n}\n\n/**\n * Casts `array` to a slice if it's needed.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {number} start The start position.\n * @param {number} [end=array.length] The end position.\n * @returns {Array} Returns the cast slice.\n */\nfunction castSlice(array, start, end) {\n  var length = array.length;\n  end = end === undefined ? length : end;\n  return (!start && end >= length) ? array : baseSlice(array, start, end);\n}\n\n/**\n * Used by `_.trim` and `_.trimEnd` to get the index of the last string symbol\n * that is not found in the character symbols.\n *\n * @private\n * @param {Array} strSymbols The string symbols to inspect.\n * @param {Array} chrSymbols The character symbols to find.\n * @returns {number} Returns the index of the last unmatched string symbol.\n */\nfunction charsEndIndex(strSymbols, chrSymbols) {\n  var index = strSymbols.length;\n\n  while (index-- && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}\n  return index;\n}\n\n/**\n * Used by `_.trim` and `_.trimStart` to get the index of the first string symbol\n * that is not found in the character symbols.\n *\n * @private\n * @param {Array} strSymbols The string symbols to inspect.\n * @param {Array} chrSymbols The character symbols to find.\n * @returns {number} Returns the index of the first unmatched string symbol.\n */\nfunction charsStartIndex(strSymbols, chrSymbols) {\n  var index = -1,\n      length = strSymbols.length;\n\n  while (++index < length && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}\n  return index;\n}\n\n/**\n * Converts an ASCII `string` to an array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n */\nfunction asciiToArray(string) {\n  return string.split('');\n}\n\n/** Used to compose unicode character classes. */\nvar rsAstralRange = '\\\\ud800-\\\\udfff';\nvar rsComboMarksRange = '\\\\u0300-\\\\u036f';\nvar reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f';\nvar rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff';\nvar rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange;\nvar rsVarRange = '\\\\ufe0e\\\\ufe0f';\n\n/** Used to compose unicode capture groups. */\nvar rsZWJ = '\\\\u200d';\n\n/** Used to detect strings with [zero-width joiners or code points from the astral planes](http://eev.ee/blog/2015/09/12/dark-corners-of-unicode/). */\nvar reHasUnicode = RegExp('[' + rsZWJ + rsAstralRange  + rsComboRange + rsVarRange + ']');\n\n/**\n * Checks if `string` contains Unicode symbols.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {boolean} Returns `true` if a symbol is found, else `false`.\n */\nfunction hasUnicode(string) {\n  return reHasUnicode.test(string);\n}\n\n/** Used to compose unicode character classes. */\nvar rsAstralRange$1 = '\\\\ud800-\\\\udfff';\nvar rsComboMarksRange$1 = '\\\\u0300-\\\\u036f';\nvar reComboHalfMarksRange$1 = '\\\\ufe20-\\\\ufe2f';\nvar rsComboSymbolsRange$1 = '\\\\u20d0-\\\\u20ff';\nvar rsComboRange$1 = rsComboMarksRange$1 + reComboHalfMarksRange$1 + rsComboSymbolsRange$1;\nvar rsVarRange$1 = '\\\\ufe0e\\\\ufe0f';\n\n/** Used to compose unicode capture groups. */\nvar rsAstral = '[' + rsAstralRange$1 + ']';\nvar rsCombo = '[' + rsComboRange$1 + ']';\nvar rsFitz = '\\\\ud83c[\\\\udffb-\\\\udfff]';\nvar rsModifier = '(?:' + rsCombo + '|' + rsFitz + ')';\nvar rsNonAstral = '[^' + rsAstralRange$1 + ']';\nvar rsRegional = '(?:\\\\ud83c[\\\\udde6-\\\\uddff]){2}';\nvar rsSurrPair = '[\\\\ud800-\\\\udbff][\\\\udc00-\\\\udfff]';\nvar rsZWJ$1 = '\\\\u200d';\n\n/** Used to compose unicode regexes. */\nvar reOptMod = rsModifier + '?';\nvar rsOptVar = '[' + rsVarRange$1 + ']?';\nvar rsOptJoin = '(?:' + rsZWJ$1 + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('|') + ')' + rsOptVar + reOptMod + ')*';\nvar rsSeq = rsOptVar + reOptMod + rsOptJoin;\nvar rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('|') + ')';\n\n/** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). */\nvar reUnicode = RegExp(rsFitz + '(?=' + rsFitz + ')|' + rsSymbol + rsSeq, 'g');\n\n/**\n * Converts a Unicode `string` to an array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n */\nfunction unicodeToArray(string) {\n  return string.match(reUnicode) || [];\n}\n\n/**\n * Converts `string` to an array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the converted array.\n */\nfunction stringToArray(string) {\n  return hasUnicode(string)\n    ? unicodeToArray(string)\n    : asciiToArray(string);\n}\n\n/**\n * Converts `value` to a string. An empty string is returned for `null`\n * and `undefined` values. The sign of `-0` is preserved.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n * @example\n *\n * _.toString(null);\n * // => ''\n *\n * _.toString(-0);\n * // => '-0'\n *\n * _.toString([1, 2, 3]);\n * // => '1,2,3'\n */\nfunction toString(value) {\n  return value == null ? '' : baseToString(value);\n}\n\n/** Used to match leading and trailing whitespace. */\nvar reTrim = /^\\s+|\\s+$/g;\n\n/**\n * Removes leading and trailing whitespace or specified characters from `string`.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category String\n * @param {string} [string=''] The string to trim.\n * @param {string} [chars=whitespace] The characters to trim.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {string} Returns the trimmed string.\n * @example\n *\n * _.trim('  abc  ');\n * // => 'abc'\n *\n * _.trim('-_-abc-_-', '_-');\n * // => 'abc'\n *\n * _.map(['  foo  ', '  bar  '], _.trim);\n * // => ['foo', 'bar']\n */\nfunction trim(string, chars, guard) {\n  string = toString(string);\n  if (string && (guard || chars === undefined)) {\n    return string.replace(reTrim, '');\n  }\n  if (!string || !(chars = baseToString(chars))) {\n    return string;\n  }\n  var strSymbols = stringToArray(string),\n      chrSymbols = stringToArray(chars),\n      start = charsStartIndex(strSymbols, chrSymbols),\n      end = charsEndIndex(strSymbols, chrSymbols) + 1;\n\n  return castSlice(strSymbols, start, end).join('');\n}\n\nvar FN_ARGS = /^(?:async\\s+)?(function)?\\s*[^\\(]*\\(\\s*([^\\)]*)\\)/m;\nvar FN_ARG_SPLIT = /,/;\nvar FN_ARG = /(=.+)?(\\s*)$/;\nvar STRIP_COMMENTS = /((\\/\\/.*$)|(\\/\\*[\\s\\S]*?\\*\\/))/mg;\n\nfunction parseParams(func) {\n    func = func.toString().replace(STRIP_COMMENTS, '');\n    func = func.match(FN_ARGS)[2].replace(' ', '');\n    func = func ? func.split(FN_ARG_SPLIT) : [];\n    func = func.map(function (arg){\n        return trim(arg.replace(FN_ARG, ''));\n    });\n    return func;\n}\n\n/**\n * A dependency-injected version of the [async.auto]{@link module:ControlFlow.auto} function. Dependent\n * tasks are specified as parameters to the function, after the usual callback\n * parameter, with the parameter names matching the names of the tasks it\n * depends on. This can provide even more readable task graphs which can be\n * easier to maintain.\n *\n * If a final callback is specified, the task results are similarly injected,\n * specified as named parameters after the initial error parameter.\n *\n * The autoInject function is purely syntactic sugar and its semantics are\n * otherwise equivalent to [async.auto]{@link module:ControlFlow.auto}.\n *\n * @name autoInject\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.auto]{@link module:ControlFlow.auto}\n * @category Control Flow\n * @param {Object} tasks - An object, each of whose properties is an {@link AsyncFunction} of\n * the form 'func([dependencies...], callback). The object's key of a property\n * serves as the name of the task defined by that property, i.e. can be used\n * when specifying requirements for other tasks.\n * * The `callback` parameter is a `callback(err, result)` which must be called\n *   when finished, passing an `error` (which can be `null`) and the result of\n *   the function's execution. The remaining parameters name other tasks on\n *   which the task is dependent, and the results from those tasks are the\n *   arguments of those parameters.\n * @param {Function} [callback] - An optional callback which is called when all\n * the tasks have been completed. It receives the `err` argument if any `tasks`\n * pass an error to their callback, and a `results` object with any completed\n * task results, similar to `auto`.\n * @example\n *\n * //  The example from `auto` can be rewritten as follows:\n * async.autoInject({\n *     get_data: function(callback) {\n *         // async code to get some data\n *         callback(null, 'data', 'converted to array');\n *     },\n *     make_folder: function(callback) {\n *         // async code to create a directory to store a file in\n *         // this is run at the same time as getting the data\n *         callback(null, 'folder');\n *     },\n *     write_file: function(get_data, make_folder, callback) {\n *         // once there is some data and the directory exists,\n *         // write the data to a file in the directory\n *         callback(null, 'filename');\n *     },\n *     email_link: function(write_file, callback) {\n *         // once the file is written let's email a link to it...\n *         // write_file contains the filename returned by write_file.\n *         callback(null, {'file':write_file, 'email':'user@example.com'});\n *     }\n * }, function(err, results) {\n *     console.log('err = ', err);\n *     console.log('email_link = ', results.email_link);\n * });\n *\n * // If you are using a JS minifier that mangles parameter names, `autoInject`\n * // will not work with plain functions, since the parameter names will be\n * // collapsed to a single letter identifier.  To work around this, you can\n * // explicitly specify the names of the parameters your task function needs\n * // in an array, similar to Angular.js dependency injection.\n *\n * // This still has an advantage over plain `auto`, since the results a task\n * // depends on are still spread into arguments.\n * async.autoInject({\n *     //...\n *     write_file: ['get_data', 'make_folder', function(get_data, make_folder, callback) {\n *         callback(null, 'filename');\n *     }],\n *     email_link: ['write_file', function(write_file, callback) {\n *         callback(null, {'file':write_file, 'email':'user@example.com'});\n *     }]\n *     //...\n * }, function(err, results) {\n *     console.log('err = ', err);\n *     console.log('email_link = ', results.email_link);\n * });\n */\nfunction autoInject(tasks, callback) {\n    var newTasks = {};\n\n    baseForOwn(tasks, function (taskFn, key) {\n        var params;\n        var fnIsAsync = isAsync(taskFn);\n        var hasNoDeps =\n            (!fnIsAsync && taskFn.length === 1) ||\n            (fnIsAsync && taskFn.length === 0);\n\n        if (isArray(taskFn)) {\n            params = taskFn.slice(0, -1);\n            taskFn = taskFn[taskFn.length - 1];\n\n            newTasks[key] = params.concat(params.length > 0 ? newTask : taskFn);\n        } else if (hasNoDeps) {\n            // no dependencies, use the function as-is\n            newTasks[key] = taskFn;\n        } else {\n            params = parseParams(taskFn);\n            if (taskFn.length === 0 && !fnIsAsync && params.length === 0) {\n                throw new Error(\"autoInject task functions require explicit parameters.\");\n            }\n\n            // remove callback param\n            if (!fnIsAsync) params.pop();\n\n            newTasks[key] = params.concat(newTask);\n        }\n\n        function newTask(results, taskCb) {\n            var newArgs = arrayMap(params, function (name) {\n                return results[name];\n            });\n            newArgs.push(taskCb);\n            wrapAsync(taskFn).apply(null, newArgs);\n        }\n    });\n\n    auto(newTasks, callback);\n}\n\n// Simple doubly linked list (https://en.wikipedia.org/wiki/Doubly_linked_list) implementation\n// used for queues. This implementation assumes that the node provided by the user can be modified\n// to adjust the next and last properties. We implement only the minimal functionality\n// for queue support.\nfunction DLL() {\n    this.head = this.tail = null;\n    this.length = 0;\n}\n\nfunction setInitial(dll, node) {\n    dll.length = 1;\n    dll.head = dll.tail = node;\n}\n\nDLL.prototype.removeLink = function(node) {\n    if (node.prev) node.prev.next = node.next;\n    else this.head = node.next;\n    if (node.next) node.next.prev = node.prev;\n    else this.tail = node.prev;\n\n    node.prev = node.next = null;\n    this.length -= 1;\n    return node;\n};\n\nDLL.prototype.empty = function () {\n    while(this.head) this.shift();\n    return this;\n};\n\nDLL.prototype.insertAfter = function(node, newNode) {\n    newNode.prev = node;\n    newNode.next = node.next;\n    if (node.next) node.next.prev = newNode;\n    else this.tail = newNode;\n    node.next = newNode;\n    this.length += 1;\n};\n\nDLL.prototype.insertBefore = function(node, newNode) {\n    newNode.prev = node.prev;\n    newNode.next = node;\n    if (node.prev) node.prev.next = newNode;\n    else this.head = newNode;\n    node.prev = newNode;\n    this.length += 1;\n};\n\nDLL.prototype.unshift = function(node) {\n    if (this.head) this.insertBefore(this.head, node);\n    else setInitial(this, node);\n};\n\nDLL.prototype.push = function(node) {\n    if (this.tail) this.insertAfter(this.tail, node);\n    else setInitial(this, node);\n};\n\nDLL.prototype.shift = function() {\n    return this.head && this.removeLink(this.head);\n};\n\nDLL.prototype.pop = function() {\n    return this.tail && this.removeLink(this.tail);\n};\n\nDLL.prototype.toArray = function () {\n    var arr = Array(this.length);\n    var curr = this.head;\n    for(var idx = 0; idx < this.length; idx++) {\n        arr[idx] = curr.data;\n        curr = curr.next;\n    }\n    return arr;\n};\n\nDLL.prototype.remove = function (testFn) {\n    var curr = this.head;\n    while(!!curr) {\n        var next = curr.next;\n        if (testFn(curr)) {\n            this.removeLink(curr);\n        }\n        curr = next;\n    }\n    return this;\n};\n\nfunction queue(worker, concurrency, payload) {\n    if (concurrency == null) {\n        concurrency = 1;\n    }\n    else if(concurrency === 0) {\n        throw new Error('Concurrency must not be zero');\n    }\n\n    var _worker = wrapAsync(worker);\n    var numRunning = 0;\n    var workersList = [];\n\n    var processingScheduled = false;\n    function _insert(data, insertAtFront, callback) {\n        if (callback != null && typeof callback !== 'function') {\n            throw new Error('task callback must be a function');\n        }\n        q.started = true;\n        if (!isArray(data)) {\n            data = [data];\n        }\n        if (data.length === 0 && q.idle()) {\n            // call drain immediately if there are no tasks\n            return setImmediate$1(function() {\n                q.drain();\n            });\n        }\n\n        for (var i = 0, l = data.length; i < l; i++) {\n            var item = {\n                data: data[i],\n                callback: callback || noop\n            };\n\n            if (insertAtFront) {\n                q._tasks.unshift(item);\n            } else {\n                q._tasks.push(item);\n            }\n        }\n\n        if (!processingScheduled) {\n            processingScheduled = true;\n            setImmediate$1(function() {\n                processingScheduled = false;\n                q.process();\n            });\n        }\n    }\n\n    function _next(tasks) {\n        return function(err){\n            numRunning -= 1;\n\n            for (var i = 0, l = tasks.length; i < l; i++) {\n                var task = tasks[i];\n\n                var index = baseIndexOf(workersList, task, 0);\n                if (index === 0) {\n                    workersList.shift();\n                } else if (index > 0) {\n                    workersList.splice(index, 1);\n                }\n\n                task.callback.apply(task, arguments);\n\n                if (err != null) {\n                    q.error(err, task.data);\n                }\n            }\n\n            if (numRunning <= (q.concurrency - q.buffer) ) {\n                q.unsaturated();\n            }\n\n            if (q.idle()) {\n                q.drain();\n            }\n            q.process();\n        };\n    }\n\n    var isProcessing = false;\n    var q = {\n        _tasks: new DLL(),\n        concurrency: concurrency,\n        payload: payload,\n        saturated: noop,\n        unsaturated:noop,\n        buffer: concurrency / 4,\n        empty: noop,\n        drain: noop,\n        error: noop,\n        started: false,\n        paused: false,\n        push: function (data, callback) {\n            _insert(data, false, callback);\n        },\n        kill: function () {\n            q.drain = noop;\n            q._tasks.empty();\n        },\n        unshift: function (data, callback) {\n            _insert(data, true, callback);\n        },\n        remove: function (testFn) {\n            q._tasks.remove(testFn);\n        },\n        process: function () {\n            // Avoid trying to start too many processing operations. This can occur\n            // when callbacks resolve synchronously (#1267).\n            if (isProcessing) {\n                return;\n            }\n            isProcessing = true;\n            while(!q.paused && numRunning < q.concurrency && q._tasks.length){\n                var tasks = [], data = [];\n                var l = q._tasks.length;\n                if (q.payload) l = Math.min(l, q.payload);\n                for (var i = 0; i < l; i++) {\n                    var node = q._tasks.shift();\n                    tasks.push(node);\n                    workersList.push(node);\n                    data.push(node.data);\n                }\n\n                numRunning += 1;\n\n                if (q._tasks.length === 0) {\n                    q.empty();\n                }\n\n                if (numRunning === q.concurrency) {\n                    q.saturated();\n                }\n\n                var cb = onlyOnce(_next(tasks));\n                _worker(data, cb);\n            }\n            isProcessing = false;\n        },\n        length: function () {\n            return q._tasks.length;\n        },\n        running: function () {\n            return numRunning;\n        },\n        workersList: function () {\n            return workersList;\n        },\n        idle: function() {\n            return q._tasks.length + numRunning === 0;\n        },\n        pause: function () {\n            q.paused = true;\n        },\n        resume: function () {\n            if (q.paused === false) { return; }\n            q.paused = false;\n            setImmediate$1(q.process);\n        }\n    };\n    return q;\n}\n\n/**\n * A cargo of tasks for the worker function to complete. Cargo inherits all of\n * the same methods and event callbacks as [`queue`]{@link module:ControlFlow.queue}.\n * @typedef {Object} CargoObject\n * @memberOf module:ControlFlow\n * @property {Function} length - A function returning the number of items\n * waiting to be processed. Invoke like `cargo.length()`.\n * @property {number} payload - An `integer` for determining how many tasks\n * should be process per round. This property can be changed after a `cargo` is\n * created to alter the payload on-the-fly.\n * @property {Function} push - Adds `task` to the `queue`. The callback is\n * called once the `worker` has finished processing the task. Instead of a\n * single task, an array of `tasks` can be submitted. The respective callback is\n * used for every task in the list. Invoke like `cargo.push(task, [callback])`.\n * @property {Function} saturated - A callback that is called when the\n * `queue.length()` hits the concurrency and further tasks will be queued.\n * @property {Function} empty - A callback that is called when the last item\n * from the `queue` is given to a `worker`.\n * @property {Function} drain - A callback that is called when the last item\n * from the `queue` has returned from the `worker`.\n * @property {Function} idle - a function returning false if there are items\n * waiting or being processed, or true if not. Invoke like `cargo.idle()`.\n * @property {Function} pause - a function that pauses the processing of tasks\n * until `resume()` is called. Invoke like `cargo.pause()`.\n * @property {Function} resume - a function that resumes the processing of\n * queued tasks when the queue is paused. Invoke like `cargo.resume()`.\n * @property {Function} kill - a function that removes the `drain` callback and\n * empties remaining tasks from the queue forcing it to go idle. Invoke like `cargo.kill()`.\n */\n\n/**\n * Creates a `cargo` object with the specified payload. Tasks added to the\n * cargo will be processed altogether (up to the `payload` limit). If the\n * `worker` is in progress, the task is queued until it becomes available. Once\n * the `worker` has completed some tasks, each callback of those tasks is\n * called. Check out [these](https://camo.githubusercontent.com/6bbd36f4cf5b35a0f11a96dcd2e97711ffc2fb37/68747470733a2f2f662e636c6f75642e6769746875622e636f6d2f6173736574732f313637363837312f36383130382f62626330636662302d356632392d313165322d393734662d3333393763363464633835382e676966) [animations](https://camo.githubusercontent.com/f4810e00e1c5f5f8addbe3e9f49064fd5d102699/68747470733a2f2f662e636c6f75642e6769746875622e636f6d2f6173736574732f313637363837312f36383130312f38346339323036362d356632392d313165322d383134662d3964336430323431336266642e676966)\n * for how `cargo` and `queue` work.\n *\n * While [`queue`]{@link module:ControlFlow.queue} passes only one task to one of a group of workers\n * at a time, cargo passes an array of tasks to a single worker, repeating\n * when the worker is finished.\n *\n * @name cargo\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.queue]{@link module:ControlFlow.queue}\n * @category Control Flow\n * @param {AsyncFunction} worker - An asynchronous function for processing an array\n * of queued tasks. Invoked with `(tasks, callback)`.\n * @param {number} [payload=Infinity] - An optional `integer` for determining\n * how many tasks should be processed per round; if omitted, the default is\n * unlimited.\n * @returns {module:ControlFlow.CargoObject} A cargo object to manage the tasks. Callbacks can\n * attached as certain properties to listen for specific events during the\n * lifecycle of the cargo and inner queue.\n * @example\n *\n * // create a cargo object with payload 2\n * var cargo = async.cargo(function(tasks, callback) {\n *     for (var i=0; i<tasks.length; i++) {\n *         console.log('hello ' + tasks[i].name);\n *     }\n *     callback();\n * }, 2);\n *\n * // add some items\n * cargo.push({name: 'foo'}, function(err) {\n *     console.log('finished processing foo');\n * });\n * cargo.push({name: 'bar'}, function(err) {\n *     console.log('finished processing bar');\n * });\n * cargo.push({name: 'baz'}, function(err) {\n *     console.log('finished processing baz');\n * });\n */\nfunction cargo(worker, payload) {\n    return queue(worker, 1, payload);\n}\n\n/**\n * The same as [`eachOf`]{@link module:Collections.eachOf} but runs only a single async operation at a time.\n *\n * @name eachOfSeries\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.eachOf]{@link module:Collections.eachOf}\n * @alias forEachOfSeries\n * @category Collection\n * @param {Array|Iterable|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - An async function to apply to each item in\n * `coll`.\n * Invoked with (item, key, callback).\n * @param {Function} [callback] - A callback which is called when all `iteratee`\n * functions have finished, or an error occurs. Invoked with (err).\n */\nvar eachOfSeries = doLimit(eachOfLimit, 1);\n\n/**\n * Reduces `coll` into a single value using an async `iteratee` to return each\n * successive step. `memo` is the initial state of the reduction. This function\n * only operates in series.\n *\n * For performance reasons, it may make sense to split a call to this function\n * into a parallel map, and then use the normal `Array.prototype.reduce` on the\n * results. This function is for situations where each step in the reduction\n * needs to be async; if you can get the data before reducing it, then it's\n * probably a good idea to do so.\n *\n * @name reduce\n * @static\n * @memberOf module:Collections\n * @method\n * @alias inject\n * @alias foldl\n * @category Collection\n * @param {Array|Iterable|Object} coll - A collection to iterate over.\n * @param {*} memo - The initial state of the reduction.\n * @param {AsyncFunction} iteratee - A function applied to each item in the\n * array to produce the next step in the reduction.\n * The `iteratee` should complete with the next state of the reduction.\n * If the iteratee complete with an error, the reduction is stopped and the\n * main `callback` is immediately called with the error.\n * Invoked with (memo, item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Result is the reduced value. Invoked with\n * (err, result).\n * @example\n *\n * async.reduce([1,2,3], 0, function(memo, item, callback) {\n *     // pointless async:\n *     process.nextTick(function() {\n *         callback(null, memo + item)\n *     });\n * }, function(err, result) {\n *     // result is now equal to the last value of memo, which is 6\n * });\n */\nfunction reduce(coll, memo, iteratee, callback) {\n    callback = once(callback || noop);\n    var _iteratee = wrapAsync(iteratee);\n    eachOfSeries(coll, function(x, i, callback) {\n        _iteratee(memo, x, function(err, v) {\n            memo = v;\n            callback(err);\n        });\n    }, function(err) {\n        callback(err, memo);\n    });\n}\n\n/**\n * Version of the compose function that is more natural to read. Each function\n * consumes the return value of the previous function. It is the equivalent of\n * [compose]{@link module:ControlFlow.compose} with the arguments reversed.\n *\n * Each function is executed with the `this` binding of the composed function.\n *\n * @name seq\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.compose]{@link module:ControlFlow.compose}\n * @category Control Flow\n * @param {...AsyncFunction} functions - the asynchronous functions to compose\n * @returns {Function} a function that composes the `functions` in order\n * @example\n *\n * // Requires lodash (or underscore), express3 and dresende's orm2.\n * // Part of an app, that fetches cats of the logged user.\n * // This example uses `seq` function to avoid overnesting and error\n * // handling clutter.\n * app.get('/cats', function(request, response) {\n *     var User = request.models.User;\n *     async.seq(\n *         _.bind(User.get, User),  // 'User.get' has signature (id, callback(err, data))\n *         function(user, fn) {\n *             user.getCats(fn);      // 'getCats' has signature (callback(err, data))\n *         }\n *     )(req.session.user_id, function (err, cats) {\n *         if (err) {\n *             console.error(err);\n *             response.json({ status: 'error', message: err.message });\n *         } else {\n *             response.json({ status: 'ok', message: 'Cats found', data: cats });\n *         }\n *     });\n * });\n */\nfunction seq(/*...functions*/) {\n    var _functions = arrayMap(arguments, wrapAsync);\n    return function(/*...args*/) {\n        var args = slice(arguments);\n        var that = this;\n\n        var cb = args[args.length - 1];\n        if (typeof cb == 'function') {\n            args.pop();\n        } else {\n            cb = noop;\n        }\n\n        reduce(_functions, args, function(newargs, fn, cb) {\n            fn.apply(that, newargs.concat(function(err/*, ...nextargs*/) {\n                var nextargs = slice(arguments, 1);\n                cb(err, nextargs);\n            }));\n        },\n        function(err, results) {\n            cb.apply(that, [err].concat(results));\n        });\n    };\n}\n\n/**\n * Creates a function which is a composition of the passed asynchronous\n * functions. Each function consumes the return value of the function that\n * follows. Composing functions `f()`, `g()`, and `h()` would produce the result\n * of `f(g(h()))`, only this version uses callbacks to obtain the return values.\n *\n * Each function is executed with the `this` binding of the composed function.\n *\n * @name compose\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @param {...AsyncFunction} functions - the asynchronous functions to compose\n * @returns {Function} an asynchronous function that is the composed\n * asynchronous `functions`\n * @example\n *\n * function add1(n, callback) {\n *     setTimeout(function () {\n *         callback(null, n + 1);\n *     }, 10);\n * }\n *\n * function mul3(n, callback) {\n *     setTimeout(function () {\n *         callback(null, n * 3);\n *     }, 10);\n * }\n *\n * var add1mul3 = async.compose(mul3, add1);\n * add1mul3(4, function (err, result) {\n *     // result now equals 15\n * });\n */\nvar compose = function(/*...args*/) {\n    return seq.apply(null, slice(arguments).reverse());\n};\n\nvar _concat = Array.prototype.concat;\n\n/**\n * The same as [`concat`]{@link module:Collections.concat} but runs a maximum of `limit` async operations at a time.\n *\n * @name concatLimit\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.concat]{@link module:Collections.concat}\n * @category Collection\n * @param {Array|Iterable|Object} coll - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {AsyncFunction} iteratee - A function to apply to each item in `coll`,\n * which should use an array as its result. Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished, or an error occurs. Results is an array\n * containing the concatenated results of the `iteratee` function. Invoked with\n * (err, results).\n */\nvar concatLimit = function(coll, limit, iteratee, callback) {\n    callback = callback || noop;\n    var _iteratee = wrapAsync(iteratee);\n    mapLimit(coll, limit, function(val, callback) {\n        _iteratee(val, function(err /*, ...args*/) {\n            if (err) return callback(err);\n            return callback(null, slice(arguments, 1));\n        });\n    }, function(err, mapResults) {\n        var result = [];\n        for (var i = 0; i < mapResults.length; i++) {\n            if (mapResults[i]) {\n                result = _concat.apply(result, mapResults[i]);\n            }\n        }\n\n        return callback(err, result);\n    });\n};\n\n/**\n * Applies `iteratee` to each item in `coll`, concatenating the results. Returns\n * the concatenated list. The `iteratee`s are called in parallel, and the\n * results are concatenated as they return. There is no guarantee that the\n * results array will be returned in the original order of `coll` passed to the\n * `iteratee` function.\n *\n * @name concat\n * @static\n * @memberOf module:Collections\n * @method\n * @category Collection\n * @param {Array|Iterable|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - A function to apply to each item in `coll`,\n * which should use an array as its result. Invoked with (item, callback).\n * @param {Function} [callback(err)] - A callback which is called after all the\n * `iteratee` functions have finished, or an error occurs. Results is an array\n * containing the concatenated results of the `iteratee` function. Invoked with\n * (err, results).\n * @example\n *\n * async.concat(['dir1','dir2','dir3'], fs.readdir, function(err, files) {\n *     // files is now a list of filenames that exist in the 3 directories\n * });\n */\nvar concat = doLimit(concatLimit, Infinity);\n\n/**\n * The same as [`concat`]{@link module:Collections.concat} but runs only a single async operation at a time.\n *\n * @name concatSeries\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.concat]{@link module:Collections.concat}\n * @category Collection\n * @param {Array|Iterable|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - A function to apply to each item in `coll`.\n * The iteratee should complete with an array an array of results.\n * Invoked with (item, callback).\n * @param {Function} [callback(err)] - A callback which is called after all the\n * `iteratee` functions have finished, or an error occurs. Results is an array\n * containing the concatenated results of the `iteratee` function. Invoked with\n * (err, results).\n */\nvar concatSeries = doLimit(concatLimit, 1);\n\n/**\n * Returns a function that when called, calls-back with the values provided.\n * Useful as the first function in a [`waterfall`]{@link module:ControlFlow.waterfall}, or for plugging values in to\n * [`auto`]{@link module:ControlFlow.auto}.\n *\n * @name constant\n * @static\n * @memberOf module:Utils\n * @method\n * @category Util\n * @param {...*} arguments... - Any number of arguments to automatically invoke\n * callback with.\n * @returns {AsyncFunction} Returns a function that when invoked, automatically\n * invokes the callback with the previous given arguments.\n * @example\n *\n * async.waterfall([\n *     async.constant(42),\n *     function (value, next) {\n *         // value === 42\n *     },\n *     //...\n * ], callback);\n *\n * async.waterfall([\n *     async.constant(filename, \"utf8\"),\n *     fs.readFile,\n *     function (fileData, next) {\n *         //...\n *     }\n *     //...\n * ], callback);\n *\n * async.auto({\n *     hostname: async.constant(\"https://server.net/\"),\n *     port: findFreePort,\n *     launchServer: [\"hostname\", \"port\", function (options, cb) {\n *         startServer(options, cb);\n *     }],\n *     //...\n * }, callback);\n */\nvar constant = function(/*...values*/) {\n    var values = slice(arguments);\n    var args = [null].concat(values);\n    return function (/*...ignoredArgs, callback*/) {\n        var callback = arguments[arguments.length - 1];\n        return callback.apply(this, args);\n    };\n};\n\n/**\n * This method returns the first argument it receives.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {*} value Any value.\n * @returns {*} Returns `value`.\n * @example\n *\n * var object = { 'a': 1 };\n *\n * console.log(_.identity(object) === object);\n * // => true\n */\nfunction identity(value) {\n  return value;\n}\n\nfunction _createTester(check, getResult) {\n    return function(eachfn, arr, iteratee, cb) {\n        cb = cb || noop;\n        var testPassed = false;\n        var testResult;\n        eachfn(arr, function(value, _, callback) {\n            iteratee(value, function(err, result) {\n                if (err) {\n                    callback(err);\n                } else if (check(result) && !testResult) {\n                    testPassed = true;\n                    testResult = getResult(true, value);\n                    callback(null, breakLoop);\n                } else {\n                    callback();\n                }\n            });\n        }, function(err) {\n            if (err) {\n                cb(err);\n            } else {\n                cb(null, testPassed ? testResult : getResult(false));\n            }\n        });\n    };\n}\n\nfunction _findGetResult(v, x) {\n    return x;\n}\n\n/**\n * Returns the first value in `coll` that passes an async truth test. The\n * `iteratee` is applied in parallel, meaning the first iteratee to return\n * `true` will fire the detect `callback` with that result. That means the\n * result might not be the first item in the original `coll` (in terms of order)\n * that passes the test.\n\n * If order within the original `coll` is important, then look at\n * [`detectSeries`]{@link module:Collections.detectSeries}.\n *\n * @name detect\n * @static\n * @memberOf module:Collections\n * @method\n * @alias find\n * @category Collections\n * @param {Array|Iterable|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - A truth test to apply to each item in `coll`.\n * The iteratee must complete with a boolean value as its result.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called as soon as any\n * iteratee returns `true`, or after all the `iteratee` functions have finished.\n * Result will be the first item in the array that passes the truth test\n * (iteratee) or the value `undefined` if none passed. Invoked with\n * (err, result).\n * @example\n *\n * async.detect(['file1','file2','file3'], function(filePath, callback) {\n *     fs.access(filePath, function(err) {\n *         callback(null, !err)\n *     });\n * }, function(err, result) {\n *     // result now equals the first file in the list that exists\n * });\n */\nvar detect = doParallel(_createTester(identity, _findGetResult));\n\n/**\n * The same as [`detect`]{@link module:Collections.detect} but runs a maximum of `limit` async operations at a\n * time.\n *\n * @name detectLimit\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.detect]{@link module:Collections.detect}\n * @alias findLimit\n * @category Collections\n * @param {Array|Iterable|Object} coll - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {AsyncFunction} iteratee - A truth test to apply to each item in `coll`.\n * The iteratee must complete with a boolean value as its result.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called as soon as any\n * iteratee returns `true`, or after all the `iteratee` functions have finished.\n * Result will be the first item in the array that passes the truth test\n * (iteratee) or the value `undefined` if none passed. Invoked with\n * (err, result).\n */\nvar detectLimit = doParallelLimit(_createTester(identity, _findGetResult));\n\n/**\n * The same as [`detect`]{@link module:Collections.detect} but runs only a single async operation at a time.\n *\n * @name detectSeries\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.detect]{@link module:Collections.detect}\n * @alias findSeries\n * @category Collections\n * @param {Array|Iterable|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - A truth test to apply to each item in `coll`.\n * The iteratee must complete with a boolean value as its result.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called as soon as any\n * iteratee returns `true`, or after all the `iteratee` functions have finished.\n * Result will be the first item in the array that passes the truth test\n * (iteratee) or the value `undefined` if none passed. Invoked with\n * (err, result).\n */\nvar detectSeries = doLimit(detectLimit, 1);\n\nfunction consoleFunc(name) {\n    return function (fn/*, ...args*/) {\n        var args = slice(arguments, 1);\n        args.push(function (err/*, ...args*/) {\n            var args = slice(arguments, 1);\n            if (typeof console === 'object') {\n                if (err) {\n                    if (console.error) {\n                        console.error(err);\n                    }\n                } else if (console[name]) {\n                    arrayEach(args, function (x) {\n                        console[name](x);\n                    });\n                }\n            }\n        });\n        wrapAsync(fn).apply(null, args);\n    };\n}\n\n/**\n * Logs the result of an [`async` function]{@link AsyncFunction} to the\n * `console` using `console.dir` to display the properties of the resulting object.\n * Only works in Node.js or in browsers that support `console.dir` and\n * `console.error` (such as FF and Chrome).\n * If multiple arguments are returned from the async function,\n * `console.dir` is called on each argument in order.\n *\n * @name dir\n * @static\n * @memberOf module:Utils\n * @method\n * @category Util\n * @param {AsyncFunction} function - The function you want to eventually apply\n * all arguments to.\n * @param {...*} arguments... - Any number of arguments to apply to the function.\n * @example\n *\n * // in a module\n * var hello = function(name, callback) {\n *     setTimeout(function() {\n *         callback(null, {hello: name});\n *     }, 1000);\n * };\n *\n * // in the node repl\n * node> async.dir(hello, 'world');\n * {hello: 'world'}\n */\nvar dir = consoleFunc('dir');\n\n/**\n * The post-check version of [`during`]{@link module:ControlFlow.during}. To reflect the difference in\n * the order of operations, the arguments `test` and `fn` are switched.\n *\n * Also a version of [`doWhilst`]{@link module:ControlFlow.doWhilst} with asynchronous `test` function.\n * @name doDuring\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.during]{@link module:ControlFlow.during}\n * @category Control Flow\n * @param {AsyncFunction} fn - An async function which is called each time\n * `test` passes. Invoked with (callback).\n * @param {AsyncFunction} test - asynchronous truth test to perform before each\n * execution of `fn`. Invoked with (...args, callback), where `...args` are the\n * non-error args from the previous callback of `fn`.\n * @param {Function} [callback] - A callback which is called after the test\n * function has failed and repeated execution of `fn` has stopped. `callback`\n * will be passed an error if one occurred, otherwise `null`.\n */\nfunction doDuring(fn, test, callback) {\n    callback = onlyOnce(callback || noop);\n    var _fn = wrapAsync(fn);\n    var _test = wrapAsync(test);\n\n    function next(err/*, ...args*/) {\n        if (err) return callback(err);\n        var args = slice(arguments, 1);\n        args.push(check);\n        _test.apply(this, args);\n    }\n\n    function check(err, truth) {\n        if (err) return callback(err);\n        if (!truth) return callback(null);\n        _fn(next);\n    }\n\n    check(null, true);\n\n}\n\n/**\n * The post-check version of [`whilst`]{@link module:ControlFlow.whilst}. To reflect the difference in\n * the order of operations, the arguments `test` and `iteratee` are switched.\n *\n * `doWhilst` is to `whilst` as `do while` is to `while` in plain JavaScript.\n *\n * @name doWhilst\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.whilst]{@link module:ControlFlow.whilst}\n * @category Control Flow\n * @param {AsyncFunction} iteratee - A function which is called each time `test`\n * passes. Invoked with (callback).\n * @param {Function} test - synchronous truth test to perform after each\n * execution of `iteratee`. Invoked with any non-error callback results of\n * `iteratee`.\n * @param {Function} [callback] - A callback which is called after the test\n * function has failed and repeated execution of `iteratee` has stopped.\n * `callback` will be passed an error and any arguments passed to the final\n * `iteratee`'s callback. Invoked with (err, [results]);\n */\nfunction doWhilst(iteratee, test, callback) {\n    callback = onlyOnce(callback || noop);\n    var _iteratee = wrapAsync(iteratee);\n    var next = function(err/*, ...args*/) {\n        if (err) return callback(err);\n        var args = slice(arguments, 1);\n        if (test.apply(this, args)) return _iteratee(next);\n        callback.apply(null, [null].concat(args));\n    };\n    _iteratee(next);\n}\n\n/**\n * Like ['doWhilst']{@link module:ControlFlow.doWhilst}, except the `test` is inverted. Note the\n * argument ordering differs from `until`.\n *\n * @name doUntil\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.doWhilst]{@link module:ControlFlow.doWhilst}\n * @category Control Flow\n * @param {AsyncFunction} iteratee - An async function which is called each time\n * `test` fails. Invoked with (callback).\n * @param {Function} test - synchronous truth test to perform after each\n * execution of `iteratee`. Invoked with any non-error callback results of\n * `iteratee`.\n * @param {Function} [callback] - A callback which is called after the test\n * function has passed and repeated execution of `iteratee` has stopped. `callback`\n * will be passed an error and any arguments passed to the final `iteratee`'s\n * callback. Invoked with (err, [results]);\n */\nfunction doUntil(iteratee, test, callback) {\n    doWhilst(iteratee, function() {\n        return !test.apply(this, arguments);\n    }, callback);\n}\n\n/**\n * Like [`whilst`]{@link module:ControlFlow.whilst}, except the `test` is an asynchronous function that\n * is passed a callback in the form of `function (err, truth)`. If error is\n * passed to `test` or `fn`, the main callback is immediately called with the\n * value of the error.\n *\n * @name during\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.whilst]{@link module:ControlFlow.whilst}\n * @category Control Flow\n * @param {AsyncFunction} test - asynchronous truth test to perform before each\n * execution of `fn`. Invoked with (callback).\n * @param {AsyncFunction} fn - An async function which is called each time\n * `test` passes. Invoked with (callback).\n * @param {Function} [callback] - A callback which is called after the test\n * function has failed and repeated execution of `fn` has stopped. `callback`\n * will be passed an error, if one occurred, otherwise `null`.\n * @example\n *\n * var count = 0;\n *\n * async.during(\n *     function (callback) {\n *         return callback(null, count < 5);\n *     },\n *     function (callback) {\n *         count++;\n *         setTimeout(callback, 1000);\n *     },\n *     function (err) {\n *         // 5 seconds have passed\n *     }\n * );\n */\nfunction during(test, fn, callback) {\n    callback = onlyOnce(callback || noop);\n    var _fn = wrapAsync(fn);\n    var _test = wrapAsync(test);\n\n    function next(err) {\n        if (err) return callback(err);\n        _test(check);\n    }\n\n    function check(err, truth) {\n        if (err) return callback(err);\n        if (!truth) return callback(null);\n        _fn(next);\n    }\n\n    _test(check);\n}\n\nfunction _withoutIndex(iteratee) {\n    return function (value, index, callback) {\n        return iteratee(value, callback);\n    };\n}\n\n/**\n * Applies the function `iteratee` to each item in `coll`, in parallel.\n * The `iteratee` is called with an item from the list, and a callback for when\n * it has finished. If the `iteratee` passes an error to its `callback`, the\n * main `callback` (for the `each` function) is immediately called with the\n * error.\n *\n * Note, that since this function applies `iteratee` to each item in parallel,\n * there is no guarantee that the iteratee functions will complete in order.\n *\n * @name each\n * @static\n * @memberOf module:Collections\n * @method\n * @alias forEach\n * @category Collection\n * @param {Array|Iterable|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - An async function to apply to\n * each item in `coll`. Invoked with (item, callback).\n * The array index is not passed to the iteratee.\n * If you need the index, use `eachOf`.\n * @param {Function} [callback] - A callback which is called when all\n * `iteratee` functions have finished, or an error occurs. Invoked with (err).\n * @example\n *\n * // assuming openFiles is an array of file names and saveFile is a function\n * // to save the modified contents of that file:\n *\n * async.each(openFiles, saveFile, function(err){\n *   // if any of the saves produced an error, err would equal that error\n * });\n *\n * // assuming openFiles is an array of file names\n * async.each(openFiles, function(file, callback) {\n *\n *     // Perform operation on file here.\n *     console.log('Processing file ' + file);\n *\n *     if( file.length > 32 ) {\n *       console.log('This file name is too long');\n *       callback('File name too long');\n *     } else {\n *       // Do work to process file here\n *       console.log('File processed');\n *       callback();\n *     }\n * }, function(err) {\n *     // if any of the file processing produced an error, err would equal that error\n *     if( err ) {\n *       // One of the iterations produced an error.\n *       // All processing will now stop.\n *       console.log('A file failed to process');\n *     } else {\n *       console.log('All files have been processed successfully');\n *     }\n * });\n */\nfunction eachLimit(coll, iteratee, callback) {\n    eachOf(coll, _withoutIndex(wrapAsync(iteratee)), callback);\n}\n\n/**\n * The same as [`each`]{@link module:Collections.each} but runs a maximum of `limit` async operations at a time.\n *\n * @name eachLimit\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.each]{@link module:Collections.each}\n * @alias forEachLimit\n * @category Collection\n * @param {Array|Iterable|Object} coll - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {AsyncFunction} iteratee - An async function to apply to each item in\n * `coll`.\n * The array index is not passed to the iteratee.\n * If you need the index, use `eachOfLimit`.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called when all\n * `iteratee` functions have finished, or an error occurs. Invoked with (err).\n */\nfunction eachLimit$1(coll, limit, iteratee, callback) {\n    _eachOfLimit(limit)(coll, _withoutIndex(wrapAsync(iteratee)), callback);\n}\n\n/**\n * The same as [`each`]{@link module:Collections.each} but runs only a single async operation at a time.\n *\n * @name eachSeries\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.each]{@link module:Collections.each}\n * @alias forEachSeries\n * @category Collection\n * @param {Array|Iterable|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - An async function to apply to each\n * item in `coll`.\n * The array index is not passed to the iteratee.\n * If you need the index, use `eachOfSeries`.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called when all\n * `iteratee` functions have finished, or an error occurs. Invoked with (err).\n */\nvar eachSeries = doLimit(eachLimit$1, 1);\n\n/**\n * Wrap an async function and ensure it calls its callback on a later tick of\n * the event loop.  If the function already calls its callback on a next tick,\n * no extra deferral is added. This is useful for preventing stack overflows\n * (`RangeError: Maximum call stack size exceeded`) and generally keeping\n * [Zalgo](http://blog.izs.me/post/59142742143/designing-apis-for-asynchrony)\n * contained. ES2017 `async` functions are returned as-is -- they are immune\n * to Zalgo's corrupting influences, as they always resolve on a later tick.\n *\n * @name ensureAsync\n * @static\n * @memberOf module:Utils\n * @method\n * @category Util\n * @param {AsyncFunction} fn - an async function, one that expects a node-style\n * callback as its last argument.\n * @returns {AsyncFunction} Returns a wrapped function with the exact same call\n * signature as the function passed in.\n * @example\n *\n * function sometimesAsync(arg, callback) {\n *     if (cache[arg]) {\n *         return callback(null, cache[arg]); // this would be synchronous!!\n *     } else {\n *         doSomeIO(arg, callback); // this IO would be asynchronous\n *     }\n * }\n *\n * // this has a risk of stack overflows if many results are cached in a row\n * async.mapSeries(args, sometimesAsync, done);\n *\n * // this will defer sometimesAsync's callback if necessary,\n * // preventing stack overflows\n * async.mapSeries(args, async.ensureAsync(sometimesAsync), done);\n */\nfunction ensureAsync(fn) {\n    if (isAsync(fn)) return fn;\n    return initialParams(function (args, callback) {\n        var sync = true;\n        args.push(function () {\n            var innerArgs = arguments;\n            if (sync) {\n                setImmediate$1(function () {\n                    callback.apply(null, innerArgs);\n                });\n            } else {\n                callback.apply(null, innerArgs);\n            }\n        });\n        fn.apply(this, args);\n        sync = false;\n    });\n}\n\nfunction notId(v) {\n    return !v;\n}\n\n/**\n * Returns `true` if every element in `coll` satisfies an async test. If any\n * iteratee call returns `false`, the main `callback` is immediately called.\n *\n * @name every\n * @static\n * @memberOf module:Collections\n * @method\n * @alias all\n * @category Collection\n * @param {Array|Iterable|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - An async truth test to apply to each item\n * in the collection in parallel.\n * The iteratee must complete with a boolean result value.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Result will be either `true` or `false`\n * depending on the values of the async tests. Invoked with (err, result).\n * @example\n *\n * async.every(['file1','file2','file3'], function(filePath, callback) {\n *     fs.access(filePath, function(err) {\n *         callback(null, !err)\n *     });\n * }, function(err, result) {\n *     // if result is true then every file exists\n * });\n */\nvar every = doParallel(_createTester(notId, notId));\n\n/**\n * The same as [`every`]{@link module:Collections.every} but runs a maximum of `limit` async operations at a time.\n *\n * @name everyLimit\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.every]{@link module:Collections.every}\n * @alias allLimit\n * @category Collection\n * @param {Array|Iterable|Object} coll - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {AsyncFunction} iteratee - An async truth test to apply to each item\n * in the collection in parallel.\n * The iteratee must complete with a boolean result value.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Result will be either `true` or `false`\n * depending on the values of the async tests. Invoked with (err, result).\n */\nvar everyLimit = doParallelLimit(_createTester(notId, notId));\n\n/**\n * The same as [`every`]{@link module:Collections.every} but runs only a single async operation at a time.\n *\n * @name everySeries\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.every]{@link module:Collections.every}\n * @alias allSeries\n * @category Collection\n * @param {Array|Iterable|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - An async truth test to apply to each item\n * in the collection in series.\n * The iteratee must complete with a boolean result value.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Result will be either `true` or `false`\n * depending on the values of the async tests. Invoked with (err, result).\n */\nvar everySeries = doLimit(everyLimit, 1);\n\n/**\n * The base implementation of `_.property` without support for deep paths.\n *\n * @private\n * @param {string} key The key of the property to get.\n * @returns {Function} Returns the new accessor function.\n */\nfunction baseProperty(key) {\n  return function(object) {\n    return object == null ? undefined : object[key];\n  };\n}\n\nfunction filterArray(eachfn, arr, iteratee, callback) {\n    var truthValues = new Array(arr.length);\n    eachfn(arr, function (x, index, callback) {\n        iteratee(x, function (err, v) {\n            truthValues[index] = !!v;\n            callback(err);\n        });\n    }, function (err) {\n        if (err) return callback(err);\n        var results = [];\n        for (var i = 0; i < arr.length; i++) {\n            if (truthValues[i]) results.push(arr[i]);\n        }\n        callback(null, results);\n    });\n}\n\nfunction filterGeneric(eachfn, coll, iteratee, callback) {\n    var results = [];\n    eachfn(coll, function (x, index, callback) {\n        iteratee(x, function (err, v) {\n            if (err) {\n                callback(err);\n            } else {\n                if (v) {\n                    results.push({index: index, value: x});\n                }\n                callback();\n            }\n        });\n    }, function (err) {\n        if (err) {\n            callback(err);\n        } else {\n            callback(null, arrayMap(results.sort(function (a, b) {\n                return a.index - b.index;\n            }), baseProperty('value')));\n        }\n    });\n}\n\nfunction _filter(eachfn, coll, iteratee, callback) {\n    var filter = isArrayLike(coll) ? filterArray : filterGeneric;\n    filter(eachfn, coll, wrapAsync(iteratee), callback || noop);\n}\n\n/**\n * Returns a new array of all the values in `coll` which pass an async truth\n * test. This operation is performed in parallel, but the results array will be\n * in the same order as the original.\n *\n * @name filter\n * @static\n * @memberOf module:Collections\n * @method\n * @alias select\n * @category Collection\n * @param {Array|Iterable|Object} coll - A collection to iterate over.\n * @param {Function} iteratee - A truth test to apply to each item in `coll`.\n * The `iteratee` is passed a `callback(err, truthValue)`, which must be called\n * with a boolean argument once it has completed. Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Invoked with (err, results).\n * @example\n *\n * async.filter(['file1','file2','file3'], function(filePath, callback) {\n *     fs.access(filePath, function(err) {\n *         callback(null, !err)\n *     });\n * }, function(err, results) {\n *     // results now equals an array of the existing files\n * });\n */\nvar filter = doParallel(_filter);\n\n/**\n * The same as [`filter`]{@link module:Collections.filter} but runs a maximum of `limit` async operations at a\n * time.\n *\n * @name filterLimit\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.filter]{@link module:Collections.filter}\n * @alias selectLimit\n * @category Collection\n * @param {Array|Iterable|Object} coll - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {Function} iteratee - A truth test to apply to each item in `coll`.\n * The `iteratee` is passed a `callback(err, truthValue)`, which must be called\n * with a boolean argument once it has completed. Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Invoked with (err, results).\n */\nvar filterLimit = doParallelLimit(_filter);\n\n/**\n * The same as [`filter`]{@link module:Collections.filter} but runs only a single async operation at a time.\n *\n * @name filterSeries\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.filter]{@link module:Collections.filter}\n * @alias selectSeries\n * @category Collection\n * @param {Array|Iterable|Object} coll - A collection to iterate over.\n * @param {Function} iteratee - A truth test to apply to each item in `coll`.\n * The `iteratee` is passed a `callback(err, truthValue)`, which must be called\n * with a boolean argument once it has completed. Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Invoked with (err, results)\n */\nvar filterSeries = doLimit(filterLimit, 1);\n\n/**\n * Calls the asynchronous function `fn` with a callback parameter that allows it\n * to call itself again, in series, indefinitely.\n\n * If an error is passed to the callback then `errback` is called with the\n * error, and execution stops, otherwise it will never be called.\n *\n * @name forever\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @param {AsyncFunction} fn - an async function to call repeatedly.\n * Invoked with (next).\n * @param {Function} [errback] - when `fn` passes an error to it's callback,\n * this function will be called, and execution stops. Invoked with (err).\n * @example\n *\n * async.forever(\n *     function(next) {\n *         // next is suitable for passing to things that need a callback(err [, whatever]);\n *         // it will result in this function being called again.\n *     },\n *     function(err) {\n *         // if next is called with a value in its first parameter, it will appear\n *         // in here as 'err', and execution will stop.\n *     }\n * );\n */\nfunction forever(fn, errback) {\n    var done = onlyOnce(errback || noop);\n    var task = wrapAsync(ensureAsync(fn));\n\n    function next(err) {\n        if (err) return done(err);\n        task(next);\n    }\n    next();\n}\n\n/**\n * The same as [`groupBy`]{@link module:Collections.groupBy} but runs a maximum of `limit` async operations at a time.\n *\n * @name groupByLimit\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.groupBy]{@link module:Collections.groupBy}\n * @category Collection\n * @param {Array|Iterable|Object} coll - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {AsyncFunction} iteratee - An async function to apply to each item in\n * `coll`.\n * The iteratee should complete with a `key` to group the value under.\n * Invoked with (value, callback).\n * @param {Function} [callback] - A callback which is called when all `iteratee`\n * functions have finished, or an error occurs. Result is an `Object` whoses\n * properties are arrays of values which returned the corresponding key.\n */\nvar groupByLimit = function(coll, limit, iteratee, callback) {\n    callback = callback || noop;\n    var _iteratee = wrapAsync(iteratee);\n    mapLimit(coll, limit, function(val, callback) {\n        _iteratee(val, function(err, key) {\n            if (err) return callback(err);\n            return callback(null, {key: key, val: val});\n        });\n    }, function(err, mapResults) {\n        var result = {};\n        // from MDN, handle object having an `hasOwnProperty` prop\n        var hasOwnProperty = Object.prototype.hasOwnProperty;\n\n        for (var i = 0; i < mapResults.length; i++) {\n            if (mapResults[i]) {\n                var key = mapResults[i].key;\n                var val = mapResults[i].val;\n\n                if (hasOwnProperty.call(result, key)) {\n                    result[key].push(val);\n                } else {\n                    result[key] = [val];\n                }\n            }\n        }\n\n        return callback(err, result);\n    });\n};\n\n/**\n * Returns a new object, where each value corresponds to an array of items, from\n * `coll`, that returned the corresponding key. That is, the keys of the object\n * correspond to the values passed to the `iteratee` callback.\n *\n * Note: Since this function applies the `iteratee` to each item in parallel,\n * there is no guarantee that the `iteratee` functions will complete in order.\n * However, the values for each key in the `result` will be in the same order as\n * the original `coll`. For Objects, the values will roughly be in the order of\n * the original Objects' keys (but this can vary across JavaScript engines).\n *\n * @name groupBy\n * @static\n * @memberOf module:Collections\n * @method\n * @category Collection\n * @param {Array|Iterable|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - An async function to apply to each item in\n * `coll`.\n * The iteratee should complete with a `key` to group the value under.\n * Invoked with (value, callback).\n * @param {Function} [callback] - A callback which is called when all `iteratee`\n * functions have finished, or an error occurs. Result is an `Object` whoses\n * properties are arrays of values which returned the corresponding key.\n * @example\n *\n * async.groupBy(['userId1', 'userId2', 'userId3'], function(userId, callback) {\n *     db.findById(userId, function(err, user) {\n *         if (err) return callback(err);\n *         return callback(null, user.age);\n *     });\n * }, function(err, result) {\n *     // result is object containing the userIds grouped by age\n *     // e.g. { 30: ['userId1', 'userId3'], 42: ['userId2']};\n * });\n */\nvar groupBy = doLimit(groupByLimit, Infinity);\n\n/**\n * The same as [`groupBy`]{@link module:Collections.groupBy} but runs only a single async operation at a time.\n *\n * @name groupBySeries\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.groupBy]{@link module:Collections.groupBy}\n * @category Collection\n * @param {Array|Iterable|Object} coll - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {AsyncFunction} iteratee - An async function to apply to each item in\n * `coll`.\n * The iteratee should complete with a `key` to group the value under.\n * Invoked with (value, callback).\n * @param {Function} [callback] - A callback which is called when all `iteratee`\n * functions have finished, or an error occurs. Result is an `Object` whoses\n * properties are arrays of values which returned the corresponding key.\n */\nvar groupBySeries = doLimit(groupByLimit, 1);\n\n/**\n * Logs the result of an `async` function to the `console`. Only works in\n * Node.js or in browsers that support `console.log` and `console.error` (such\n * as FF and Chrome). If multiple arguments are returned from the async\n * function, `console.log` is called on each argument in order.\n *\n * @name log\n * @static\n * @memberOf module:Utils\n * @method\n * @category Util\n * @param {AsyncFunction} function - The function you want to eventually apply\n * all arguments to.\n * @param {...*} arguments... - Any number of arguments to apply to the function.\n * @example\n *\n * // in a module\n * var hello = function(name, callback) {\n *     setTimeout(function() {\n *         callback(null, 'hello ' + name);\n *     }, 1000);\n * };\n *\n * // in the node repl\n * node> async.log(hello, 'world');\n * 'hello world'\n */\nvar log = consoleFunc('log');\n\n/**\n * The same as [`mapValues`]{@link module:Collections.mapValues} but runs a maximum of `limit` async operations at a\n * time.\n *\n * @name mapValuesLimit\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.mapValues]{@link module:Collections.mapValues}\n * @category Collection\n * @param {Object} obj - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {AsyncFunction} iteratee - A function to apply to each value and key\n * in `coll`.\n * The iteratee should complete with the transformed value as its result.\n * Invoked with (value, key, callback).\n * @param {Function} [callback] - A callback which is called when all `iteratee`\n * functions have finished, or an error occurs. `result` is a new object consisting\n * of each key from `obj`, with each transformed value on the right-hand side.\n * Invoked with (err, result).\n */\nfunction mapValuesLimit(obj, limit, iteratee, callback) {\n    callback = once(callback || noop);\n    var newObj = {};\n    var _iteratee = wrapAsync(iteratee);\n    eachOfLimit(obj, limit, function(val, key, next) {\n        _iteratee(val, key, function (err, result) {\n            if (err) return next(err);\n            newObj[key] = result;\n            next();\n        });\n    }, function (err) {\n        callback(err, newObj);\n    });\n}\n\n/**\n * A relative of [`map`]{@link module:Collections.map}, designed for use with objects.\n *\n * Produces a new Object by mapping each value of `obj` through the `iteratee`\n * function. The `iteratee` is called each `value` and `key` from `obj` and a\n * callback for when it has finished processing. Each of these callbacks takes\n * two arguments: an `error`, and the transformed item from `obj`. If `iteratee`\n * passes an error to its callback, the main `callback` (for the `mapValues`\n * function) is immediately called with the error.\n *\n * Note, the order of the keys in the result is not guaranteed.  The keys will\n * be roughly in the order they complete, (but this is very engine-specific)\n *\n * @name mapValues\n * @static\n * @memberOf module:Collections\n * @method\n * @category Collection\n * @param {Object} obj - A collection to iterate over.\n * @param {AsyncFunction} iteratee - A function to apply to each value and key\n * in `coll`.\n * The iteratee should complete with the transformed value as its result.\n * Invoked with (value, key, callback).\n * @param {Function} [callback] - A callback which is called when all `iteratee`\n * functions have finished, or an error occurs. `result` is a new object consisting\n * of each key from `obj`, with each transformed value on the right-hand side.\n * Invoked with (err, result).\n * @example\n *\n * async.mapValues({\n *     f1: 'file1',\n *     f2: 'file2',\n *     f3: 'file3'\n * }, function (file, key, callback) {\n *   fs.stat(file, callback);\n * }, function(err, result) {\n *     // result is now a map of stats for each file, e.g.\n *     // {\n *     //     f1: [stats for file1],\n *     //     f2: [stats for file2],\n *     //     f3: [stats for file3]\n *     // }\n * });\n */\n\nvar mapValues = doLimit(mapValuesLimit, Infinity);\n\n/**\n * The same as [`mapValues`]{@link module:Collections.mapValues} but runs only a single async operation at a time.\n *\n * @name mapValuesSeries\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.mapValues]{@link module:Collections.mapValues}\n * @category Collection\n * @param {Object} obj - A collection to iterate over.\n * @param {AsyncFunction} iteratee - A function to apply to each value and key\n * in `coll`.\n * The iteratee should complete with the transformed value as its result.\n * Invoked with (value, key, callback).\n * @param {Function} [callback] - A callback which is called when all `iteratee`\n * functions have finished, or an error occurs. `result` is a new object consisting\n * of each key from `obj`, with each transformed value on the right-hand side.\n * Invoked with (err, result).\n */\nvar mapValuesSeries = doLimit(mapValuesLimit, 1);\n\nfunction has(obj, key) {\n    return key in obj;\n}\n\n/**\n * Caches the results of an async function. When creating a hash to store\n * function results against, the callback is omitted from the hash and an\n * optional hash function can be used.\n *\n * If no hash function is specified, the first argument is used as a hash key,\n * which may work reasonably if it is a string or a data type that converts to a\n * distinct string. Note that objects and arrays will not behave reasonably.\n * Neither will cases where the other arguments are significant. In such cases,\n * specify your own hash function.\n *\n * The cache of results is exposed as the `memo` property of the function\n * returned by `memoize`.\n *\n * @name memoize\n * @static\n * @memberOf module:Utils\n * @method\n * @category Util\n * @param {AsyncFunction} fn - The async function to proxy and cache results from.\n * @param {Function} hasher - An optional function for generating a custom hash\n * for storing results. It has all the arguments applied to it apart from the\n * callback, and must be synchronous.\n * @returns {AsyncFunction} a memoized version of `fn`\n * @example\n *\n * var slow_fn = function(name, callback) {\n *     // do something\n *     callback(null, result);\n * };\n * var fn = async.memoize(slow_fn);\n *\n * // fn can now be used as if it were slow_fn\n * fn('some name', function() {\n *     // callback\n * });\n */\nfunction memoize(fn, hasher) {\n    var memo = Object.create(null);\n    var queues = Object.create(null);\n    hasher = hasher || identity;\n    var _fn = wrapAsync(fn);\n    var memoized = initialParams(function memoized(args, callback) {\n        var key = hasher.apply(null, args);\n        if (has(memo, key)) {\n            setImmediate$1(function() {\n                callback.apply(null, memo[key]);\n            });\n        } else if (has(queues, key)) {\n            queues[key].push(callback);\n        } else {\n            queues[key] = [callback];\n            _fn.apply(null, args.concat(function(/*args*/) {\n                var args = slice(arguments);\n                memo[key] = args;\n                var q = queues[key];\n                delete queues[key];\n                for (var i = 0, l = q.length; i < l; i++) {\n                    q[i].apply(null, args);\n                }\n            }));\n        }\n    });\n    memoized.memo = memo;\n    memoized.unmemoized = fn;\n    return memoized;\n}\n\n/**\n * Calls `callback` on a later loop around the event loop. In Node.js this just\n * calls `process.nextTick`.  In the browser it will use `setImmediate` if\n * available, otherwise `setTimeout(callback, 0)`, which means other higher\n * priority events may precede the execution of `callback`.\n *\n * This is used internally for browser-compatibility purposes.\n *\n * @name nextTick\n * @static\n * @memberOf module:Utils\n * @method\n * @see [async.setImmediate]{@link module:Utils.setImmediate}\n * @category Util\n * @param {Function} callback - The function to call on a later loop around\n * the event loop. Invoked with (args...).\n * @param {...*} args... - any number of additional arguments to pass to the\n * callback on the next tick.\n * @example\n *\n * var call_order = [];\n * async.nextTick(function() {\n *     call_order.push('two');\n *     // call_order now equals ['one','two']\n * });\n * call_order.push('one');\n *\n * async.setImmediate(function (a, b, c) {\n *     // a, b, and c equal 1, 2, and 3\n * }, 1, 2, 3);\n */\nvar _defer$1;\n\nif (hasNextTick) {\n    _defer$1 = process.nextTick;\n} else if (hasSetImmediate) {\n    _defer$1 = setImmediate;\n} else {\n    _defer$1 = fallback;\n}\n\nvar nextTick = wrap(_defer$1);\n\nfunction _parallel(eachfn, tasks, callback) {\n    callback = callback || noop;\n    var results = isArrayLike(tasks) ? [] : {};\n\n    eachfn(tasks, function (task, key, callback) {\n        wrapAsync(task)(function (err, result) {\n            if (arguments.length > 2) {\n                result = slice(arguments, 1);\n            }\n            results[key] = result;\n            callback(err);\n        });\n    }, function (err) {\n        callback(err, results);\n    });\n}\n\n/**\n * Run the `tasks` collection of functions in parallel, without waiting until\n * the previous function has completed. If any of the functions pass an error to\n * its callback, the main `callback` is immediately called with the value of the\n * error. Once the `tasks` have completed, the results are passed to the final\n * `callback` as an array.\n *\n * **Note:** `parallel` is about kicking-off I/O tasks in parallel, not about\n * parallel execution of code.  If your tasks do not use any timers or perform\n * any I/O, they will actually be executed in series.  Any synchronous setup\n * sections for each task will happen one after the other.  JavaScript remains\n * single-threaded.\n *\n * **Hint:** Use [`reflect`]{@link module:Utils.reflect} to continue the\n * execution of other tasks when a task fails.\n *\n * It is also possible to use an object instead of an array. Each property will\n * be run as a function and the results will be passed to the final `callback`\n * as an object instead of an array. This can be a more readable way of handling\n * results from {@link async.parallel}.\n *\n * @name parallel\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @param {Array|Iterable|Object} tasks - A collection of\n * [async functions]{@link AsyncFunction} to run.\n * Each async function can complete with any number of optional `result` values.\n * @param {Function} [callback] - An optional callback to run once all the\n * functions have completed successfully. This function gets a results array\n * (or object) containing all the result arguments passed to the task callbacks.\n * Invoked with (err, results).\n *\n * @example\n * async.parallel([\n *     function(callback) {\n *         setTimeout(function() {\n *             callback(null, 'one');\n *         }, 200);\n *     },\n *     function(callback) {\n *         setTimeout(function() {\n *             callback(null, 'two');\n *         }, 100);\n *     }\n * ],\n * // optional callback\n * function(err, results) {\n *     // the results array will equal ['one','two'] even though\n *     // the second function had a shorter timeout.\n * });\n *\n * // an example using an object instead of an array\n * async.parallel({\n *     one: function(callback) {\n *         setTimeout(function() {\n *             callback(null, 1);\n *         }, 200);\n *     },\n *     two: function(callback) {\n *         setTimeout(function() {\n *             callback(null, 2);\n *         }, 100);\n *     }\n * }, function(err, results) {\n *     // results is now equals to: {one: 1, two: 2}\n * });\n */\nfunction parallelLimit(tasks, callback) {\n    _parallel(eachOf, tasks, callback);\n}\n\n/**\n * The same as [`parallel`]{@link module:ControlFlow.parallel} but runs a maximum of `limit` async operations at a\n * time.\n *\n * @name parallelLimit\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.parallel]{@link module:ControlFlow.parallel}\n * @category Control Flow\n * @param {Array|Iterable|Object} tasks - A collection of\n * [async functions]{@link AsyncFunction} to run.\n * Each async function can complete with any number of optional `result` values.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {Function} [callback] - An optional callback to run once all the\n * functions have completed successfully. This function gets a results array\n * (or object) containing all the result arguments passed to the task callbacks.\n * Invoked with (err, results).\n */\nfunction parallelLimit$1(tasks, limit, callback) {\n    _parallel(_eachOfLimit(limit), tasks, callback);\n}\n\n/**\n * A queue of tasks for the worker function to complete.\n * @typedef {Object} QueueObject\n * @memberOf module:ControlFlow\n * @property {Function} length - a function returning the number of items\n * waiting to be processed. Invoke with `queue.length()`.\n * @property {boolean} started - a boolean indicating whether or not any\n * items have been pushed and processed by the queue.\n * @property {Function} running - a function returning the number of items\n * currently being processed. Invoke with `queue.running()`.\n * @property {Function} workersList - a function returning the array of items\n * currently being processed. Invoke with `queue.workersList()`.\n * @property {Function} idle - a function returning false if there are items\n * waiting or being processed, or true if not. Invoke with `queue.idle()`.\n * @property {number} concurrency - an integer for determining how many `worker`\n * functions should be run in parallel. This property can be changed after a\n * `queue` is created to alter the concurrency on-the-fly.\n * @property {Function} push - add a new task to the `queue`. Calls `callback`\n * once the `worker` has finished processing the task. Instead of a single task,\n * a `tasks` array can be submitted. The respective callback is used for every\n * task in the list. Invoke with `queue.push(task, [callback])`,\n * @property {Function} unshift - add a new task to the front of the `queue`.\n * Invoke with `queue.unshift(task, [callback])`.\n * @property {Function} remove - remove items from the queue that match a test\n * function.  The test function will be passed an object with a `data` property,\n * and a `priority` property, if this is a\n * [priorityQueue]{@link module:ControlFlow.priorityQueue} object.\n * Invoked with `queue.remove(testFn)`, where `testFn` is of the form\n * `function ({data, priority}) {}` and returns a Boolean.\n * @property {Function} saturated - a callback that is called when the number of\n * running workers hits the `concurrency` limit, and further tasks will be\n * queued.\n * @property {Function} unsaturated - a callback that is called when the number\n * of running workers is less than the `concurrency` & `buffer` limits, and\n * further tasks will not be queued.\n * @property {number} buffer - A minimum threshold buffer in order to say that\n * the `queue` is `unsaturated`.\n * @property {Function} empty - a callback that is called when the last item\n * from the `queue` is given to a `worker`.\n * @property {Function} drain - a callback that is called when the last item\n * from the `queue` has returned from the `worker`.\n * @property {Function} error - a callback that is called when a task errors.\n * Has the signature `function(error, task)`.\n * @property {boolean} paused - a boolean for determining whether the queue is\n * in a paused state.\n * @property {Function} pause - a function that pauses the processing of tasks\n * until `resume()` is called. Invoke with `queue.pause()`.\n * @property {Function} resume - a function that resumes the processing of\n * queued tasks when the queue is paused. Invoke with `queue.resume()`.\n * @property {Function} kill - a function that removes the `drain` callback and\n * empties remaining tasks from the queue forcing it to go idle. No more tasks\n * should be pushed to the queue after calling this function. Invoke with `queue.kill()`.\n */\n\n/**\n * Creates a `queue` object with the specified `concurrency`. Tasks added to the\n * `queue` are processed in parallel (up to the `concurrency` limit). If all\n * `worker`s are in progress, the task is queued until one becomes available.\n * Once a `worker` completes a `task`, that `task`'s callback is called.\n *\n * @name queue\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @param {AsyncFunction} worker - An async function for processing a queued task.\n * If you want to handle errors from an individual task, pass a callback to\n * `q.push()`. Invoked with (task, callback).\n * @param {number} [concurrency=1] - An `integer` for determining how many\n * `worker` functions should be run in parallel.  If omitted, the concurrency\n * defaults to `1`.  If the concurrency is `0`, an error is thrown.\n * @returns {module:ControlFlow.QueueObject} A queue object to manage the tasks. Callbacks can\n * attached as certain properties to listen for specific events during the\n * lifecycle of the queue.\n * @example\n *\n * // create a queue object with concurrency 2\n * var q = async.queue(function(task, callback) {\n *     console.log('hello ' + task.name);\n *     callback();\n * }, 2);\n *\n * // assign a callback\n * q.drain = function() {\n *     console.log('all items have been processed');\n * };\n *\n * // add some items to the queue\n * q.push({name: 'foo'}, function(err) {\n *     console.log('finished processing foo');\n * });\n * q.push({name: 'bar'}, function (err) {\n *     console.log('finished processing bar');\n * });\n *\n * // add some items to the queue (batch-wise)\n * q.push([{name: 'baz'},{name: 'bay'},{name: 'bax'}], function(err) {\n *     console.log('finished processing item');\n * });\n *\n * // add some items to the front of the queue\n * q.unshift({name: 'bar'}, function (err) {\n *     console.log('finished processing bar');\n * });\n */\nvar queue$1 = function (worker, concurrency) {\n    var _worker = wrapAsync(worker);\n    return queue(function (items, cb) {\n        _worker(items[0], cb);\n    }, concurrency, 1);\n};\n\n/**\n * The same as [async.queue]{@link module:ControlFlow.queue} only tasks are assigned a priority and\n * completed in ascending priority order.\n *\n * @name priorityQueue\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.queue]{@link module:ControlFlow.queue}\n * @category Control Flow\n * @param {AsyncFunction} worker - An async function for processing a queued task.\n * If you want to handle errors from an individual task, pass a callback to\n * `q.push()`.\n * Invoked with (task, callback).\n * @param {number} concurrency - An `integer` for determining how many `worker`\n * functions should be run in parallel.  If omitted, the concurrency defaults to\n * `1`.  If the concurrency is `0`, an error is thrown.\n * @returns {module:ControlFlow.QueueObject} A priorityQueue object to manage the tasks. There are two\n * differences between `queue` and `priorityQueue` objects:\n * * `push(task, priority, [callback])` - `priority` should be a number. If an\n *   array of `tasks` is given, all tasks will be assigned the same priority.\n * * The `unshift` method was removed.\n */\nvar priorityQueue = function(worker, concurrency) {\n    // Start with a normal queue\n    var q = queue$1(worker, concurrency);\n\n    // Override push to accept second parameter representing priority\n    q.push = function(data, priority, callback) {\n        if (callback == null) callback = noop;\n        if (typeof callback !== 'function') {\n            throw new Error('task callback must be a function');\n        }\n        q.started = true;\n        if (!isArray(data)) {\n            data = [data];\n        }\n        if (data.length === 0) {\n            // call drain immediately if there are no tasks\n            return setImmediate$1(function() {\n                q.drain();\n            });\n        }\n\n        priority = priority || 0;\n        var nextNode = q._tasks.head;\n        while (nextNode && priority >= nextNode.priority) {\n            nextNode = nextNode.next;\n        }\n\n        for (var i = 0, l = data.length; i < l; i++) {\n            var item = {\n                data: data[i],\n                priority: priority,\n                callback: callback\n            };\n\n            if (nextNode) {\n                q._tasks.insertBefore(nextNode, item);\n            } else {\n                q._tasks.push(item);\n            }\n        }\n        setImmediate$1(q.process);\n    };\n\n    // Remove unshift function\n    delete q.unshift;\n\n    return q;\n};\n\n/**\n * Runs the `tasks` array of functions in parallel, without waiting until the\n * previous function has completed. Once any of the `tasks` complete or pass an\n * error to its callback, the main `callback` is immediately called. It's\n * equivalent to `Promise.race()`.\n *\n * @name race\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @param {Array} tasks - An array containing [async functions]{@link AsyncFunction}\n * to run. Each function can complete with an optional `result` value.\n * @param {Function} callback - A callback to run once any of the functions have\n * completed. This function gets an error or result from the first function that\n * completed. Invoked with (err, result).\n * @returns undefined\n * @example\n *\n * async.race([\n *     function(callback) {\n *         setTimeout(function() {\n *             callback(null, 'one');\n *         }, 200);\n *     },\n *     function(callback) {\n *         setTimeout(function() {\n *             callback(null, 'two');\n *         }, 100);\n *     }\n * ],\n * // main callback\n * function(err, result) {\n *     // the result will be equal to 'two' as it finishes earlier\n * });\n */\nfunction race(tasks, callback) {\n    callback = once(callback || noop);\n    if (!isArray(tasks)) return callback(new TypeError('First argument to race must be an array of functions'));\n    if (!tasks.length) return callback();\n    for (var i = 0, l = tasks.length; i < l; i++) {\n        wrapAsync(tasks[i])(callback);\n    }\n}\n\n/**\n * Same as [`reduce`]{@link module:Collections.reduce}, only operates on `array` in reverse order.\n *\n * @name reduceRight\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.reduce]{@link module:Collections.reduce}\n * @alias foldr\n * @category Collection\n * @param {Array} array - A collection to iterate over.\n * @param {*} memo - The initial state of the reduction.\n * @param {AsyncFunction} iteratee - A function applied to each item in the\n * array to produce the next step in the reduction.\n * The `iteratee` should complete with the next state of the reduction.\n * If the iteratee complete with an error, the reduction is stopped and the\n * main `callback` is immediately called with the error.\n * Invoked with (memo, item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Result is the reduced value. Invoked with\n * (err, result).\n */\nfunction reduceRight (array, memo, iteratee, callback) {\n    var reversed = slice(array).reverse();\n    reduce(reversed, memo, iteratee, callback);\n}\n\n/**\n * Wraps the async function in another function that always completes with a\n * result object, even when it errors.\n *\n * The result object has either the property `error` or `value`.\n *\n * @name reflect\n * @static\n * @memberOf module:Utils\n * @method\n * @category Util\n * @param {AsyncFunction} fn - The async function you want to wrap\n * @returns {Function} - A function that always passes null to it's callback as\n * the error. The second argument to the callback will be an `object` with\n * either an `error` or a `value` property.\n * @example\n *\n * async.parallel([\n *     async.reflect(function(callback) {\n *         // do some stuff ...\n *         callback(null, 'one');\n *     }),\n *     async.reflect(function(callback) {\n *         // do some more stuff but error ...\n *         callback('bad stuff happened');\n *     }),\n *     async.reflect(function(callback) {\n *         // do some more stuff ...\n *         callback(null, 'two');\n *     })\n * ],\n * // optional callback\n * function(err, results) {\n *     // values\n *     // results[0].value = 'one'\n *     // results[1].error = 'bad stuff happened'\n *     // results[2].value = 'two'\n * });\n */\nfunction reflect(fn) {\n    var _fn = wrapAsync(fn);\n    return initialParams(function reflectOn(args, reflectCallback) {\n        args.push(function callback(error, cbArg) {\n            if (error) {\n                reflectCallback(null, { error: error });\n            } else {\n                var value;\n                if (arguments.length <= 2) {\n                    value = cbArg;\n                } else {\n                    value = slice(arguments, 1);\n                }\n                reflectCallback(null, { value: value });\n            }\n        });\n\n        return _fn.apply(this, args);\n    });\n}\n\n/**\n * A helper function that wraps an array or an object of functions with `reflect`.\n *\n * @name reflectAll\n * @static\n * @memberOf module:Utils\n * @method\n * @see [async.reflect]{@link module:Utils.reflect}\n * @category Util\n * @param {Array|Object|Iterable} tasks - The collection of\n * [async functions]{@link AsyncFunction} to wrap in `async.reflect`.\n * @returns {Array} Returns an array of async functions, each wrapped in\n * `async.reflect`\n * @example\n *\n * let tasks = [\n *     function(callback) {\n *         setTimeout(function() {\n *             callback(null, 'one');\n *         }, 200);\n *     },\n *     function(callback) {\n *         // do some more stuff but error ...\n *         callback(new Error('bad stuff happened'));\n *     },\n *     function(callback) {\n *         setTimeout(function() {\n *             callback(null, 'two');\n *         }, 100);\n *     }\n * ];\n *\n * async.parallel(async.reflectAll(tasks),\n * // optional callback\n * function(err, results) {\n *     // values\n *     // results[0].value = 'one'\n *     // results[1].error = Error('bad stuff happened')\n *     // results[2].value = 'two'\n * });\n *\n * // an example using an object instead of an array\n * let tasks = {\n *     one: function(callback) {\n *         setTimeout(function() {\n *             callback(null, 'one');\n *         }, 200);\n *     },\n *     two: function(callback) {\n *         callback('two');\n *     },\n *     three: function(callback) {\n *         setTimeout(function() {\n *             callback(null, 'three');\n *         }, 100);\n *     }\n * };\n *\n * async.parallel(async.reflectAll(tasks),\n * // optional callback\n * function(err, results) {\n *     // values\n *     // results.one.value = 'one'\n *     // results.two.error = 'two'\n *     // results.three.value = 'three'\n * });\n */\nfunction reflectAll(tasks) {\n    var results;\n    if (isArray(tasks)) {\n        results = arrayMap(tasks, reflect);\n    } else {\n        results = {};\n        baseForOwn(tasks, function(task, key) {\n            results[key] = reflect.call(this, task);\n        });\n    }\n    return results;\n}\n\nfunction reject$1(eachfn, arr, iteratee, callback) {\n    _filter(eachfn, arr, function(value, cb) {\n        iteratee(value, function(err, v) {\n            cb(err, !v);\n        });\n    }, callback);\n}\n\n/**\n * The opposite of [`filter`]{@link module:Collections.filter}. Removes values that pass an `async` truth test.\n *\n * @name reject\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.filter]{@link module:Collections.filter}\n * @category Collection\n * @param {Array|Iterable|Object} coll - A collection to iterate over.\n * @param {Function} iteratee - An async truth test to apply to each item in\n * `coll`.\n * The should complete with a boolean value as its `result`.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Invoked with (err, results).\n * @example\n *\n * async.reject(['file1','file2','file3'], function(filePath, callback) {\n *     fs.access(filePath, function(err) {\n *         callback(null, !err)\n *     });\n * }, function(err, results) {\n *     // results now equals an array of missing files\n *     createFiles(results);\n * });\n */\nvar reject = doParallel(reject$1);\n\n/**\n * The same as [`reject`]{@link module:Collections.reject} but runs a maximum of `limit` async operations at a\n * time.\n *\n * @name rejectLimit\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.reject]{@link module:Collections.reject}\n * @category Collection\n * @param {Array|Iterable|Object} coll - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {Function} iteratee - An async truth test to apply to each item in\n * `coll`.\n * The should complete with a boolean value as its `result`.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Invoked with (err, results).\n */\nvar rejectLimit = doParallelLimit(reject$1);\n\n/**\n * The same as [`reject`]{@link module:Collections.reject} but runs only a single async operation at a time.\n *\n * @name rejectSeries\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.reject]{@link module:Collections.reject}\n * @category Collection\n * @param {Array|Iterable|Object} coll - A collection to iterate over.\n * @param {Function} iteratee - An async truth test to apply to each item in\n * `coll`.\n * The should complete with a boolean value as its `result`.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Invoked with (err, results).\n */\nvar rejectSeries = doLimit(rejectLimit, 1);\n\n/**\n * Creates a function that returns `value`.\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Util\n * @param {*} value The value to return from the new function.\n * @returns {Function} Returns the new constant function.\n * @example\n *\n * var objects = _.times(2, _.constant({ 'a': 1 }));\n *\n * console.log(objects);\n * // => [{ 'a': 1 }, { 'a': 1 }]\n *\n * console.log(objects[0] === objects[1]);\n * // => true\n */\nfunction constant$1(value) {\n  return function() {\n    return value;\n  };\n}\n\n/**\n * Attempts to get a successful response from `task` no more than `times` times\n * before returning an error. If the task is successful, the `callback` will be\n * passed the result of the successful task. If all attempts fail, the callback\n * will be passed the error and result (if any) of the final attempt.\n *\n * @name retry\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @see [async.retryable]{@link module:ControlFlow.retryable}\n * @param {Object|number} [opts = {times: 5, interval: 0}| 5] - Can be either an\n * object with `times` and `interval` or a number.\n * * `times` - The number of attempts to make before giving up.  The default\n *   is `5`.\n * * `interval` - The time to wait between retries, in milliseconds.  The\n *   default is `0`. The interval may also be specified as a function of the\n *   retry count (see example).\n * * `errorFilter` - An optional synchronous function that is invoked on\n *   erroneous result. If it returns `true` the retry attempts will continue;\n *   if the function returns `false` the retry flow is aborted with the current\n *   attempt's error and result being returned to the final callback.\n *   Invoked with (err).\n * * If `opts` is a number, the number specifies the number of times to retry,\n *   with the default interval of `0`.\n * @param {AsyncFunction} task - An async function to retry.\n * Invoked with (callback).\n * @param {Function} [callback] - An optional callback which is called when the\n * task has succeeded, or after the final failed attempt. It receives the `err`\n * and `result` arguments of the last attempt at completing the `task`. Invoked\n * with (err, results).\n *\n * @example\n *\n * // The `retry` function can be used as a stand-alone control flow by passing\n * // a callback, as shown below:\n *\n * // try calling apiMethod 3 times\n * async.retry(3, apiMethod, function(err, result) {\n *     // do something with the result\n * });\n *\n * // try calling apiMethod 3 times, waiting 200 ms between each retry\n * async.retry({times: 3, interval: 200}, apiMethod, function(err, result) {\n *     // do something with the result\n * });\n *\n * // try calling apiMethod 10 times with exponential backoff\n * // (i.e. intervals of 100, 200, 400, 800, 1600, ... milliseconds)\n * async.retry({\n *   times: 10,\n *   interval: function(retryCount) {\n *     return 50 * Math.pow(2, retryCount);\n *   }\n * }, apiMethod, function(err, result) {\n *     // do something with the result\n * });\n *\n * // try calling apiMethod the default 5 times no delay between each retry\n * async.retry(apiMethod, function(err, result) {\n *     // do something with the result\n * });\n *\n * // try calling apiMethod only when error condition satisfies, all other\n * // errors will abort the retry control flow and return to final callback\n * async.retry({\n *   errorFilter: function(err) {\n *     return err.message === 'Temporary error'; // only retry on a specific error\n *   }\n * }, apiMethod, function(err, result) {\n *     // do something with the result\n * });\n *\n * // to retry individual methods that are not as reliable within other\n * // control flow functions, use the `retryable` wrapper:\n * async.auto({\n *     users: api.getUsers.bind(api),\n *     payments: async.retryable(3, api.getPayments.bind(api))\n * }, function(err, results) {\n *     // do something with the results\n * });\n *\n */\nfunction retry(opts, task, callback) {\n    var DEFAULT_TIMES = 5;\n    var DEFAULT_INTERVAL = 0;\n\n    var options = {\n        times: DEFAULT_TIMES,\n        intervalFunc: constant$1(DEFAULT_INTERVAL)\n    };\n\n    function parseTimes(acc, t) {\n        if (typeof t === 'object') {\n            acc.times = +t.times || DEFAULT_TIMES;\n\n            acc.intervalFunc = typeof t.interval === 'function' ?\n                t.interval :\n                constant$1(+t.interval || DEFAULT_INTERVAL);\n\n            acc.errorFilter = t.errorFilter;\n        } else if (typeof t === 'number' || typeof t === 'string') {\n            acc.times = +t || DEFAULT_TIMES;\n        } else {\n            throw new Error(\"Invalid arguments for async.retry\");\n        }\n    }\n\n    if (arguments.length < 3 && typeof opts === 'function') {\n        callback = task || noop;\n        task = opts;\n    } else {\n        parseTimes(options, opts);\n        callback = callback || noop;\n    }\n\n    if (typeof task !== 'function') {\n        throw new Error(\"Invalid arguments for async.retry\");\n    }\n\n    var _task = wrapAsync(task);\n\n    var attempt = 1;\n    function retryAttempt() {\n        _task(function(err) {\n            if (err && attempt++ < options.times &&\n                (typeof options.errorFilter != 'function' ||\n                    options.errorFilter(err))) {\n                setTimeout(retryAttempt, options.intervalFunc(attempt));\n            } else {\n                callback.apply(null, arguments);\n            }\n        });\n    }\n\n    retryAttempt();\n}\n\n/**\n * A close relative of [`retry`]{@link module:ControlFlow.retry}.  This method\n * wraps a task and makes it retryable, rather than immediately calling it\n * with retries.\n *\n * @name retryable\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.retry]{@link module:ControlFlow.retry}\n * @category Control Flow\n * @param {Object|number} [opts = {times: 5, interval: 0}| 5] - optional\n * options, exactly the same as from `retry`\n * @param {AsyncFunction} task - the asynchronous function to wrap.\n * This function will be passed any arguments passed to the returned wrapper.\n * Invoked with (...args, callback).\n * @returns {AsyncFunction} The wrapped function, which when invoked, will\n * retry on an error, based on the parameters specified in `opts`.\n * This function will accept the same parameters as `task`.\n * @example\n *\n * async.auto({\n *     dep1: async.retryable(3, getFromFlakyService),\n *     process: [\"dep1\", async.retryable(3, function (results, cb) {\n *         maybeProcessData(results.dep1, cb);\n *     })]\n * }, callback);\n */\nvar retryable = function (opts, task) {\n    if (!task) {\n        task = opts;\n        opts = null;\n    }\n    var _task = wrapAsync(task);\n    return initialParams(function (args, callback) {\n        function taskFn(cb) {\n            _task.apply(null, args.concat(cb));\n        }\n\n        if (opts) retry(opts, taskFn, callback);\n        else retry(taskFn, callback);\n\n    });\n};\n\n/**\n * Run the functions in the `tasks` collection in series, each one running once\n * the previous function has completed. If any functions in the series pass an\n * error to its callback, no more functions are run, and `callback` is\n * immediately called with the value of the error. Otherwise, `callback`\n * receives an array of results when `tasks` have completed.\n *\n * It is also possible to use an object instead of an array. Each property will\n * be run as a function, and the results will be passed to the final `callback`\n * as an object instead of an array. This can be a more readable way of handling\n *  results from {@link async.series}.\n *\n * **Note** that while many implementations preserve the order of object\n * properties, the [ECMAScript Language Specification](http://www.ecma-international.org/ecma-262/5.1/#sec-8.6)\n * explicitly states that\n *\n * > The mechanics and order of enumerating the properties is not specified.\n *\n * So if you rely on the order in which your series of functions are executed,\n * and want this to work on all platforms, consider using an array.\n *\n * @name series\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @param {Array|Iterable|Object} tasks - A collection containing\n * [async functions]{@link AsyncFunction} to run in series.\n * Each function can complete with any number of optional `result` values.\n * @param {Function} [callback] - An optional callback to run once all the\n * functions have completed. This function gets a results array (or object)\n * containing all the result arguments passed to the `task` callbacks. Invoked\n * with (err, result).\n * @example\n * async.series([\n *     function(callback) {\n *         // do some stuff ...\n *         callback(null, 'one');\n *     },\n *     function(callback) {\n *         // do some more stuff ...\n *         callback(null, 'two');\n *     }\n * ],\n * // optional callback\n * function(err, results) {\n *     // results is now equal to ['one', 'two']\n * });\n *\n * async.series({\n *     one: function(callback) {\n *         setTimeout(function() {\n *             callback(null, 1);\n *         }, 200);\n *     },\n *     two: function(callback){\n *         setTimeout(function() {\n *             callback(null, 2);\n *         }, 100);\n *     }\n * }, function(err, results) {\n *     // results is now equal to: {one: 1, two: 2}\n * });\n */\nfunction series(tasks, callback) {\n    _parallel(eachOfSeries, tasks, callback);\n}\n\n/**\n * Returns `true` if at least one element in the `coll` satisfies an async test.\n * If any iteratee call returns `true`, the main `callback` is immediately\n * called.\n *\n * @name some\n * @static\n * @memberOf module:Collections\n * @method\n * @alias any\n * @category Collection\n * @param {Array|Iterable|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - An async truth test to apply to each item\n * in the collections in parallel.\n * The iteratee should complete with a boolean `result` value.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called as soon as any\n * iteratee returns `true`, or after all the iteratee functions have finished.\n * Result will be either `true` or `false` depending on the values of the async\n * tests. Invoked with (err, result).\n * @example\n *\n * async.some(['file1','file2','file3'], function(filePath, callback) {\n *     fs.access(filePath, function(err) {\n *         callback(null, !err)\n *     });\n * }, function(err, result) {\n *     // if result is true then at least one of the files exists\n * });\n */\nvar some = doParallel(_createTester(Boolean, identity));\n\n/**\n * The same as [`some`]{@link module:Collections.some} but runs a maximum of `limit` async operations at a time.\n *\n * @name someLimit\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.some]{@link module:Collections.some}\n * @alias anyLimit\n * @category Collection\n * @param {Array|Iterable|Object} coll - A collection to iterate over.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {AsyncFunction} iteratee - An async truth test to apply to each item\n * in the collections in parallel.\n * The iteratee should complete with a boolean `result` value.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called as soon as any\n * iteratee returns `true`, or after all the iteratee functions have finished.\n * Result will be either `true` or `false` depending on the values of the async\n * tests. Invoked with (err, result).\n */\nvar someLimit = doParallelLimit(_createTester(Boolean, identity));\n\n/**\n * The same as [`some`]{@link module:Collections.some} but runs only a single async operation at a time.\n *\n * @name someSeries\n * @static\n * @memberOf module:Collections\n * @method\n * @see [async.some]{@link module:Collections.some}\n * @alias anySeries\n * @category Collection\n * @param {Array|Iterable|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - An async truth test to apply to each item\n * in the collections in series.\n * The iteratee should complete with a boolean `result` value.\n * Invoked with (item, callback).\n * @param {Function} [callback] - A callback which is called as soon as any\n * iteratee returns `true`, or after all the iteratee functions have finished.\n * Result will be either `true` or `false` depending on the values of the async\n * tests. Invoked with (err, result).\n */\nvar someSeries = doLimit(someLimit, 1);\n\n/**\n * Sorts a list by the results of running each `coll` value through an async\n * `iteratee`.\n *\n * @name sortBy\n * @static\n * @memberOf module:Collections\n * @method\n * @category Collection\n * @param {Array|Iterable|Object} coll - A collection to iterate over.\n * @param {AsyncFunction} iteratee - An async function to apply to each item in\n * `coll`.\n * The iteratee should complete with a value to use as the sort criteria as\n * its `result`.\n * Invoked with (item, callback).\n * @param {Function} callback - A callback which is called after all the\n * `iteratee` functions have finished, or an error occurs. Results is the items\n * from the original `coll` sorted by the values returned by the `iteratee`\n * calls. Invoked with (err, results).\n * @example\n *\n * async.sortBy(['file1','file2','file3'], function(file, callback) {\n *     fs.stat(file, function(err, stats) {\n *         callback(err, stats.mtime);\n *     });\n * }, function(err, results) {\n *     // results is now the original array of files sorted by\n *     // modified date\n * });\n *\n * // By modifying the callback parameter the\n * // sorting order can be influenced:\n *\n * // ascending order\n * async.sortBy([1,9,3,5], function(x, callback) {\n *     callback(null, x);\n * }, function(err,result) {\n *     // result callback\n * });\n *\n * // descending order\n * async.sortBy([1,9,3,5], function(x, callback) {\n *     callback(null, x*-1);    //<- x*-1 instead of x, turns the order around\n * }, function(err,result) {\n *     // result callback\n * });\n */\nfunction sortBy (coll, iteratee, callback) {\n    var _iteratee = wrapAsync(iteratee);\n    map(coll, function (x, callback) {\n        _iteratee(x, function (err, criteria) {\n            if (err) return callback(err);\n            callback(null, {value: x, criteria: criteria});\n        });\n    }, function (err, results) {\n        if (err) return callback(err);\n        callback(null, arrayMap(results.sort(comparator), baseProperty('value')));\n    });\n\n    function comparator(left, right) {\n        var a = left.criteria, b = right.criteria;\n        return a < b ? -1 : a > b ? 1 : 0;\n    }\n}\n\n/**\n * Sets a time limit on an asynchronous function. If the function does not call\n * its callback within the specified milliseconds, it will be called with a\n * timeout error. The code property for the error object will be `'ETIMEDOUT'`.\n *\n * @name timeout\n * @static\n * @memberOf module:Utils\n * @method\n * @category Util\n * @param {AsyncFunction} asyncFn - The async function to limit in time.\n * @param {number} milliseconds - The specified time limit.\n * @param {*} [info] - Any variable you want attached (`string`, `object`, etc)\n * to timeout Error for more information..\n * @returns {AsyncFunction} Returns a wrapped function that can be used with any\n * of the control flow functions.\n * Invoke this function with the same parameters as you would `asyncFunc`.\n * @example\n *\n * function myFunction(foo, callback) {\n *     doAsyncTask(foo, function(err, data) {\n *         // handle errors\n *         if (err) return callback(err);\n *\n *         // do some stuff ...\n *\n *         // return processed data\n *         return callback(null, data);\n *     });\n * }\n *\n * var wrapped = async.timeout(myFunction, 1000);\n *\n * // call `wrapped` as you would `myFunction`\n * wrapped({ bar: 'bar' }, function(err, data) {\n *     // if `myFunction` takes < 1000 ms to execute, `err`\n *     // and `data` will have their expected values\n *\n *     // else `err` will be an Error with the code 'ETIMEDOUT'\n * });\n */\nfunction timeout(asyncFn, milliseconds, info) {\n    var fn = wrapAsync(asyncFn);\n\n    return initialParams(function (args, callback) {\n        var timedOut = false;\n        var timer;\n\n        function timeoutCallback() {\n            var name = asyncFn.name || 'anonymous';\n            var error  = new Error('Callback function \"' + name + '\" timed out.');\n            error.code = 'ETIMEDOUT';\n            if (info) {\n                error.info = info;\n            }\n            timedOut = true;\n            callback(error);\n        }\n\n        args.push(function () {\n            if (!timedOut) {\n                callback.apply(null, arguments);\n                clearTimeout(timer);\n            }\n        });\n\n        // setup timer and call original function\n        timer = setTimeout(timeoutCallback, milliseconds);\n        fn.apply(null, args);\n    });\n}\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeCeil = Math.ceil;\nvar nativeMax = Math.max;\n\n/**\n * The base implementation of `_.range` and `_.rangeRight` which doesn't\n * coerce arguments.\n *\n * @private\n * @param {number} start The start of the range.\n * @param {number} end The end of the range.\n * @param {number} step The value to increment or decrement by.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Array} Returns the range of numbers.\n */\nfunction baseRange(start, end, step, fromRight) {\n  var index = -1,\n      length = nativeMax(nativeCeil((end - start) / (step || 1)), 0),\n      result = Array(length);\n\n  while (length--) {\n    result[fromRight ? length : ++index] = start;\n    start += step;\n  }\n  return result;\n}\n\n/**\n * The same as [times]{@link module:ControlFlow.times} but runs a maximum of `limit` async operations at a\n * time.\n *\n * @name timesLimit\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.times]{@link module:ControlFlow.times}\n * @category Control Flow\n * @param {number} count - The number of times to run the function.\n * @param {number} limit - The maximum number of async operations at a time.\n * @param {AsyncFunction} iteratee - The async function to call `n` times.\n * Invoked with the iteration index and a callback: (n, next).\n * @param {Function} callback - see [async.map]{@link module:Collections.map}.\n */\nfunction timeLimit(count, limit, iteratee, callback) {\n    var _iteratee = wrapAsync(iteratee);\n    mapLimit(baseRange(0, count, 1), limit, _iteratee, callback);\n}\n\n/**\n * Calls the `iteratee` function `n` times, and accumulates results in the same\n * manner you would use with [map]{@link module:Collections.map}.\n *\n * @name times\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.map]{@link module:Collections.map}\n * @category Control Flow\n * @param {number} n - The number of times to run the function.\n * @param {AsyncFunction} iteratee - The async function to call `n` times.\n * Invoked with the iteration index and a callback: (n, next).\n * @param {Function} callback - see {@link module:Collections.map}.\n * @example\n *\n * // Pretend this is some complicated async factory\n * var createUser = function(id, callback) {\n *     callback(null, {\n *         id: 'user' + id\n *     });\n * };\n *\n * // generate 5 users\n * async.times(5, function(n, next) {\n *     createUser(n, function(err, user) {\n *         next(err, user);\n *     });\n * }, function(err, users) {\n *     // we should now have 5 users\n * });\n */\nvar times = doLimit(timeLimit, Infinity);\n\n/**\n * The same as [times]{@link module:ControlFlow.times} but runs only a single async operation at a time.\n *\n * @name timesSeries\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.times]{@link module:ControlFlow.times}\n * @category Control Flow\n * @param {number} n - The number of times to run the function.\n * @param {AsyncFunction} iteratee - The async function to call `n` times.\n * Invoked with the iteration index and a callback: (n, next).\n * @param {Function} callback - see {@link module:Collections.map}.\n */\nvar timesSeries = doLimit(timeLimit, 1);\n\n/**\n * A relative of `reduce`.  Takes an Object or Array, and iterates over each\n * element in series, each step potentially mutating an `accumulator` value.\n * The type of the accumulator defaults to the type of collection passed in.\n *\n * @name transform\n * @static\n * @memberOf module:Collections\n * @method\n * @category Collection\n * @param {Array|Iterable|Object} coll - A collection to iterate over.\n * @param {*} [accumulator] - The initial state of the transform.  If omitted,\n * it will default to an empty Object or Array, depending on the type of `coll`\n * @param {AsyncFunction} iteratee - A function applied to each item in the\n * collection that potentially modifies the accumulator.\n * Invoked with (accumulator, item, key, callback).\n * @param {Function} [callback] - A callback which is called after all the\n * `iteratee` functions have finished. Result is the transformed accumulator.\n * Invoked with (err, result).\n * @example\n *\n * async.transform([1,2,3], function(acc, item, index, callback) {\n *     // pointless async:\n *     process.nextTick(function() {\n *         acc.push(item * 2)\n *         callback(null)\n *     });\n * }, function(err, result) {\n *     // result is now equal to [2, 4, 6]\n * });\n *\n * @example\n *\n * async.transform({a: 1, b: 2, c: 3}, function (obj, val, key, callback) {\n *     setImmediate(function () {\n *         obj[key] = val * 2;\n *         callback();\n *     })\n * }, function (err, result) {\n *     // result is equal to {a: 2, b: 4, c: 6}\n * })\n */\nfunction transform (coll, accumulator, iteratee, callback) {\n    if (arguments.length <= 3) {\n        callback = iteratee;\n        iteratee = accumulator;\n        accumulator = isArray(coll) ? [] : {};\n    }\n    callback = once(callback || noop);\n    var _iteratee = wrapAsync(iteratee);\n\n    eachOf(coll, function(v, k, cb) {\n        _iteratee(accumulator, v, k, cb);\n    }, function(err) {\n        callback(err, accumulator);\n    });\n}\n\n/**\n * It runs each task in series but stops whenever any of the functions were\n * successful. If one of the tasks were successful, the `callback` will be\n * passed the result of the successful task. If all tasks fail, the callback\n * will be passed the error and result (if any) of the final attempt.\n *\n * @name tryEach\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @param {Array|Iterable|Object} tasks - A collection containing functions to\n * run, each function is passed a `callback(err, result)` it must call on\n * completion with an error `err` (which can be `null`) and an optional `result`\n * value.\n * @param {Function} [callback] - An optional callback which is called when one\n * of the tasks has succeeded, or all have failed. It receives the `err` and\n * `result` arguments of the last attempt at completing the `task`. Invoked with\n * (err, results).\n * @example\n * async.tryEach([\n *     function getDataFromFirstWebsite(callback) {\n *         // Try getting the data from the first website\n *         callback(err, data);\n *     },\n *     function getDataFromSecondWebsite(callback) {\n *         // First website failed,\n *         // Try getting the data from the backup website\n *         callback(err, data);\n *     }\n * ],\n * // optional callback\n * function(err, results) {\n *     Now do something with the data.\n * });\n *\n */\nfunction tryEach(tasks, callback) {\n    var error = null;\n    var result;\n    callback = callback || noop;\n    eachSeries(tasks, function(task, callback) {\n        wrapAsync(task)(function (err, res/*, ...args*/) {\n            if (arguments.length > 2) {\n                result = slice(arguments, 1);\n            } else {\n                result = res;\n            }\n            error = err;\n            callback(!err);\n        });\n    }, function () {\n        callback(error, result);\n    });\n}\n\n/**\n * Undoes a [memoize]{@link module:Utils.memoize}d function, reverting it to the original,\n * unmemoized form. Handy for testing.\n *\n * @name unmemoize\n * @static\n * @memberOf module:Utils\n * @method\n * @see [async.memoize]{@link module:Utils.memoize}\n * @category Util\n * @param {AsyncFunction} fn - the memoized function\n * @returns {AsyncFunction} a function that calls the original unmemoized function\n */\nfunction unmemoize(fn) {\n    return function () {\n        return (fn.unmemoized || fn).apply(null, arguments);\n    };\n}\n\n/**\n * Repeatedly call `iteratee`, while `test` returns `true`. Calls `callback` when\n * stopped, or an error occurs.\n *\n * @name whilst\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @param {Function} test - synchronous truth test to perform before each\n * execution of `iteratee`. Invoked with ().\n * @param {AsyncFunction} iteratee - An async function which is called each time\n * `test` passes. Invoked with (callback).\n * @param {Function} [callback] - A callback which is called after the test\n * function has failed and repeated execution of `iteratee` has stopped. `callback`\n * will be passed an error and any arguments passed to the final `iteratee`'s\n * callback. Invoked with (err, [results]);\n * @returns undefined\n * @example\n *\n * var count = 0;\n * async.whilst(\n *     function() { return count < 5; },\n *     function(callback) {\n *         count++;\n *         setTimeout(function() {\n *             callback(null, count);\n *         }, 1000);\n *     },\n *     function (err, n) {\n *         // 5 seconds have passed, n = 5\n *     }\n * );\n */\nfunction whilst(test, iteratee, callback) {\n    callback = onlyOnce(callback || noop);\n    var _iteratee = wrapAsync(iteratee);\n    if (!test()) return callback(null);\n    var next = function(err/*, ...args*/) {\n        if (err) return callback(err);\n        if (test()) return _iteratee(next);\n        var args = slice(arguments, 1);\n        callback.apply(null, [null].concat(args));\n    };\n    _iteratee(next);\n}\n\n/**\n * Repeatedly call `iteratee` until `test` returns `true`. Calls `callback` when\n * stopped, or an error occurs. `callback` will be passed an error and any\n * arguments passed to the final `iteratee`'s callback.\n *\n * The inverse of [whilst]{@link module:ControlFlow.whilst}.\n *\n * @name until\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @see [async.whilst]{@link module:ControlFlow.whilst}\n * @category Control Flow\n * @param {Function} test - synchronous truth test to perform before each\n * execution of `iteratee`. Invoked with ().\n * @param {AsyncFunction} iteratee - An async function which is called each time\n * `test` fails. Invoked with (callback).\n * @param {Function} [callback] - A callback which is called after the test\n * function has passed and repeated execution of `iteratee` has stopped. `callback`\n * will be passed an error and any arguments passed to the final `iteratee`'s\n * callback. Invoked with (err, [results]);\n */\nfunction until(test, iteratee, callback) {\n    whilst(function() {\n        return !test.apply(this, arguments);\n    }, iteratee, callback);\n}\n\n/**\n * Runs the `tasks` array of functions in series, each passing their results to\n * the next in the array. However, if any of the `tasks` pass an error to their\n * own callback, the next function is not executed, and the main `callback` is\n * immediately called with the error.\n *\n * @name waterfall\n * @static\n * @memberOf module:ControlFlow\n * @method\n * @category Control Flow\n * @param {Array} tasks - An array of [async functions]{@link AsyncFunction}\n * to run.\n * Each function should complete with any number of `result` values.\n * The `result` values will be passed as arguments, in order, to the next task.\n * @param {Function} [callback] - An optional callback to run once all the\n * functions have completed. This will be passed the results of the last task's\n * callback. Invoked with (err, [results]).\n * @returns undefined\n * @example\n *\n * async.waterfall([\n *     function(callback) {\n *         callback(null, 'one', 'two');\n *     },\n *     function(arg1, arg2, callback) {\n *         // arg1 now equals 'one' and arg2 now equals 'two'\n *         callback(null, 'three');\n *     },\n *     function(arg1, callback) {\n *         // arg1 now equals 'three'\n *         callback(null, 'done');\n *     }\n * ], function (err, result) {\n *     // result now equals 'done'\n * });\n *\n * // Or, with named functions:\n * async.waterfall([\n *     myFirstFunction,\n *     mySecondFunction,\n *     myLastFunction,\n * ], function (err, result) {\n *     // result now equals 'done'\n * });\n * function myFirstFunction(callback) {\n *     callback(null, 'one', 'two');\n * }\n * function mySecondFunction(arg1, arg2, callback) {\n *     // arg1 now equals 'one' and arg2 now equals 'two'\n *     callback(null, 'three');\n * }\n * function myLastFunction(arg1, callback) {\n *     // arg1 now equals 'three'\n *     callback(null, 'done');\n * }\n */\nvar waterfall = function(tasks, callback) {\n    callback = once(callback || noop);\n    if (!isArray(tasks)) return callback(new Error('First argument to waterfall must be an array of functions'));\n    if (!tasks.length) return callback();\n    var taskIndex = 0;\n\n    function nextTask(args) {\n        var task = wrapAsync(tasks[taskIndex++]);\n        args.push(onlyOnce(next));\n        task.apply(null, args);\n    }\n\n    function next(err/*, ...args*/) {\n        if (err || taskIndex === tasks.length) {\n            return callback.apply(null, arguments);\n        }\n        nextTask(slice(arguments, 1));\n    }\n\n    nextTask([]);\n};\n\n/**\n * An \"async function\" in the context of Async is an asynchronous function with\n * a variable number of parameters, with the final parameter being a callback.\n * (`function (arg1, arg2, ..., callback) {}`)\n * The final callback is of the form `callback(err, results...)`, which must be\n * called once the function is completed.  The callback should be called with a\n * Error as its first argument to signal that an error occurred.\n * Otherwise, if no error occurred, it should be called with `null` as the first\n * argument, and any additional `result` arguments that may apply, to signal\n * successful completion.\n * The callback must be called exactly once, ideally on a later tick of the\n * JavaScript event loop.\n *\n * This type of function is also referred to as a \"Node-style async function\",\n * or a \"continuation passing-style function\" (CPS). Most of the methods of this\n * library are themselves CPS/Node-style async functions, or functions that\n * return CPS/Node-style async functions.\n *\n * Wherever we accept a Node-style async function, we also directly accept an\n * [ES2017 `async` function]{@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/async_function}.\n * In this case, the `async` function will not be passed a final callback\n * argument, and any thrown error will be used as the `err` argument of the\n * implicit callback, and the return value will be used as the `result` value.\n * (i.e. a `rejected` of the returned Promise becomes the `err` callback\n * argument, and a `resolved` value becomes the `result`.)\n *\n * Note, due to JavaScript limitations, we can only detect native `async`\n * functions and not transpilied implementations.\n * Your environment must have `async`/`await` support for this to work.\n * (e.g. Node > v7.6, or a recent version of a modern browser).\n * If you are using `async` functions through a transpiler (e.g. Babel), you\n * must still wrap the function with [asyncify]{@link module:Utils.asyncify},\n * because the `async function` will be compiled to an ordinary function that\n * returns a promise.\n *\n * @typedef {Function} AsyncFunction\n * @static\n */\n\n/**\n * Async is a utility module which provides straight-forward, powerful functions\n * for working with asynchronous JavaScript. Although originally designed for\n * use with [Node.js](http://nodejs.org) and installable via\n * `npm install --save async`, it can also be used directly in the browser.\n * @module async\n * @see AsyncFunction\n */\n\n\n/**\n * A collection of `async` functions for manipulating collections, such as\n * arrays and objects.\n * @module Collections\n */\n\n/**\n * A collection of `async` functions for controlling the flow through a script.\n * @module ControlFlow\n */\n\n/**\n * A collection of `async` utility functions.\n * @module Utils\n */\n\nvar index = {\n    apply: apply,\n    applyEach: applyEach,\n    applyEachSeries: applyEachSeries,\n    asyncify: asyncify,\n    auto: auto,\n    autoInject: autoInject,\n    cargo: cargo,\n    compose: compose,\n    concat: concat,\n    concatLimit: concatLimit,\n    concatSeries: concatSeries,\n    constant: constant,\n    detect: detect,\n    detectLimit: detectLimit,\n    detectSeries: detectSeries,\n    dir: dir,\n    doDuring: doDuring,\n    doUntil: doUntil,\n    doWhilst: doWhilst,\n    during: during,\n    each: eachLimit,\n    eachLimit: eachLimit$1,\n    eachOf: eachOf,\n    eachOfLimit: eachOfLimit,\n    eachOfSeries: eachOfSeries,\n    eachSeries: eachSeries,\n    ensureAsync: ensureAsync,\n    every: every,\n    everyLimit: everyLimit,\n    everySeries: everySeries,\n    filter: filter,\n    filterLimit: filterLimit,\n    filterSeries: filterSeries,\n    forever: forever,\n    groupBy: groupBy,\n    groupByLimit: groupByLimit,\n    groupBySeries: groupBySeries,\n    log: log,\n    map: map,\n    mapLimit: mapLimit,\n    mapSeries: mapSeries,\n    mapValues: mapValues,\n    mapValuesLimit: mapValuesLimit,\n    mapValuesSeries: mapValuesSeries,\n    memoize: memoize,\n    nextTick: nextTick,\n    parallel: parallelLimit,\n    parallelLimit: parallelLimit$1,\n    priorityQueue: priorityQueue,\n    queue: queue$1,\n    race: race,\n    reduce: reduce,\n    reduceRight: reduceRight,\n    reflect: reflect,\n    reflectAll: reflectAll,\n    reject: reject,\n    rejectLimit: rejectLimit,\n    rejectSeries: rejectSeries,\n    retry: retry,\n    retryable: retryable,\n    seq: seq,\n    series: series,\n    setImmediate: setImmediate$1,\n    some: some,\n    someLimit: someLimit,\n    someSeries: someSeries,\n    sortBy: sortBy,\n    timeout: timeout,\n    times: times,\n    timesLimit: timeLimit,\n    timesSeries: timesSeries,\n    transform: transform,\n    tryEach: tryEach,\n    unmemoize: unmemoize,\n    until: until,\n    waterfall: waterfall,\n    whilst: whilst,\n\n    // aliases\n    all: every,\n    allLimit: everyLimit,\n    allSeries: everySeries,\n    any: some,\n    anyLimit: someLimit,\n    anySeries: someSeries,\n    find: detect,\n    findLimit: detectLimit,\n    findSeries: detectSeries,\n    forEach: eachLimit,\n    forEachSeries: eachSeries,\n    forEachLimit: eachLimit$1,\n    forEachOf: eachOf,\n    forEachOfSeries: eachOfSeries,\n    forEachOfLimit: eachOfLimit,\n    inject: reduce,\n    foldl: reduce,\n    foldr: reduceRight,\n    select: filter,\n    selectLimit: filterLimit,\n    selectSeries: filterSeries,\n    wrapSync: asyncify\n};\n\nexports['default'] = index;\nexports.apply = apply;\nexports.applyEach = applyEach;\nexports.applyEachSeries = applyEachSeries;\nexports.asyncify = asyncify;\nexports.auto = auto;\nexports.autoInject = autoInject;\nexports.cargo = cargo;\nexports.compose = compose;\nexports.concat = concat;\nexports.concatLimit = concatLimit;\nexports.concatSeries = concatSeries;\nexports.constant = constant;\nexports.detect = detect;\nexports.detectLimit = detectLimit;\nexports.detectSeries = detectSeries;\nexports.dir = dir;\nexports.doDuring = doDuring;\nexports.doUntil = doUntil;\nexports.doWhilst = doWhilst;\nexports.during = during;\nexports.each = eachLimit;\nexports.eachLimit = eachLimit$1;\nexports.eachOf = eachOf;\nexports.eachOfLimit = eachOfLimit;\nexports.eachOfSeries = eachOfSeries;\nexports.eachSeries = eachSeries;\nexports.ensureAsync = ensureAsync;\nexports.every = every;\nexports.everyLimit = everyLimit;\nexports.everySeries = everySeries;\nexports.filter = filter;\nexports.filterLimit = filterLimit;\nexports.filterSeries = filterSeries;\nexports.forever = forever;\nexports.groupBy = groupBy;\nexports.groupByLimit = groupByLimit;\nexports.groupBySeries = groupBySeries;\nexports.log = log;\nexports.map = map;\nexports.mapLimit = mapLimit;\nexports.mapSeries = mapSeries;\nexports.mapValues = mapValues;\nexports.mapValuesLimit = mapValuesLimit;\nexports.mapValuesSeries = mapValuesSeries;\nexports.memoize = memoize;\nexports.nextTick = nextTick;\nexports.parallel = parallelLimit;\nexports.parallelLimit = parallelLimit$1;\nexports.priorityQueue = priorityQueue;\nexports.queue = queue$1;\nexports.race = race;\nexports.reduce = reduce;\nexports.reduceRight = reduceRight;\nexports.reflect = reflect;\nexports.reflectAll = reflectAll;\nexports.reject = reject;\nexports.rejectLimit = rejectLimit;\nexports.rejectSeries = rejectSeries;\nexports.retry = retry;\nexports.retryable = retryable;\nexports.seq = seq;\nexports.series = series;\nexports.setImmediate = setImmediate$1;\nexports.some = some;\nexports.someLimit = someLimit;\nexports.someSeries = someSeries;\nexports.sortBy = sortBy;\nexports.timeout = timeout;\nexports.times = times;\nexports.timesLimit = timeLimit;\nexports.timesSeries = timesSeries;\nexports.transform = transform;\nexports.tryEach = tryEach;\nexports.unmemoize = unmemoize;\nexports.until = until;\nexports.waterfall = waterfall;\nexports.whilst = whilst;\nexports.all = every;\nexports.allLimit = everyLimit;\nexports.allSeries = everySeries;\nexports.any = some;\nexports.anyLimit = someLimit;\nexports.anySeries = someSeries;\nexports.find = detect;\nexports.findLimit = detectLimit;\nexports.findSeries = detectSeries;\nexports.forEach = eachLimit;\nexports.forEachSeries = eachSeries;\nexports.forEachLimit = eachLimit$1;\nexports.forEachOf = eachOf;\nexports.forEachOfSeries = eachOfSeries;\nexports.forEachOfLimit = eachOfLimit;\nexports.inject = reduce;\nexports.foldl = reduce;\nexports.foldr = reduceRight;\nexports.select = filter;\nexports.selectLimit = filterLimit;\nexports.selectSeries = filterSeries;\nexports.wrapSync = asyncify;\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\n})));\n","module.exports = require('stream').PassThrough;","var util = require('util');\nvar PassThrough = require('readable-stream/passthrough');\n\nmodule.exports = {\n  Readable: Readable,\n  Writable: Writable\n};\n\nutil.inherits(Readable, PassThrough);\nutil.inherits(Writable, PassThrough);\n\n// Patch the given method of instance so that the callback\n// is executed once, before the actual method is called the\n// first time.\nfunction beforeFirstCall(instance, method, callback) {\n  instance[method] = function() {\n    delete instance[method];\n    callback.apply(this, arguments);\n    return this[method].apply(this, arguments);\n  };\n}\n\nfunction Readable(fn, options) {\n  if (!(this instanceof Readable))\n    return new Readable(fn, options);\n\n  PassThrough.call(this, options);\n\n  beforeFirstCall(this, '_read', function() {\n    var source = fn.call(this, options);\n    var emit = this.emit.bind(this, 'error');\n    source.on('error', emit);\n    source.pipe(this);\n  });\n\n  this.emit('readable');\n}\n\nfunction Writable(fn, options) {\n  if (!(this instanceof Writable))\n    return new Writable(fn, options);\n\n  PassThrough.call(this, options);\n\n  beforeFirstCall(this, '_write', function() {\n    var destination = fn.call(this, options);\n    var emit = this.emit.bind(this, 'error');\n    destination.on('error', emit);\n    this.pipe(destination);\n  });\n\n  this.emit('writable');\n}\n\n","/*!\n * normalize-path <https://github.com/jonschlinkert/normalize-path>\n *\n * Copyright (c) 2014-2018, Jon Schlinkert.\n * Released under the MIT License.\n */\n\nmodule.exports = function(path, stripTrailing) {\n  if (typeof path !== 'string') {\n    throw new TypeError('expected path to be a string');\n  }\n\n  if (path === '\\\\' || path === '/') return '/';\n\n  var len = path.length;\n  if (len <= 1) return path;\n\n  // ensure that win32 namespaces has two leading slashes, so that the path is\n  // handled properly by the win32 version of path.parse() after being normalized\n  // https://msdn.microsoft.com/library/windows/desktop/aa365247(v=vs.85).aspx#namespaces\n  var prefix = '';\n  if (len > 4 && path[3] === '\\\\') {\n    var ch = path[2];\n    if ((ch === '?' || ch === '.') && path.slice(0, 2) === '\\\\\\\\') {\n      path = path.slice(2);\n      prefix = '//';\n    }\n  }\n\n  var segs = path.split(/[/\\\\]+/);\n  if (stripTrailing !== false && segs[segs.length - 1] === '') {\n    segs.pop();\n  }\n  return prefix + segs.join('/');\n};\n","/**\n * lodash (Custom Build) <https://lodash.com/>\n * Build: `lodash modularize exports=\"npm\" -o ./`\n * Copyright jQuery Foundation and other contributors <https://jquery.org/>\n * Released under MIT license <https://lodash.com/license>\n * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>\n * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n */\n\n/** Used as references for various `Number` constants. */\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]',\n    funcTag = '[object Function]',\n    genTag = '[object GeneratorFunction]';\n\n/** Used to detect unsigned integer values. */\nvar reIsUint = /^(?:0|[1-9]\\d*)$/;\n\n/**\n * A faster alternative to `Function#apply`, this function invokes `func`\n * with the `this` binding of `thisArg` and the arguments of `args`.\n *\n * @private\n * @param {Function} func The function to invoke.\n * @param {*} thisArg The `this` binding of `func`.\n * @param {Array} args The arguments to invoke `func` with.\n * @returns {*} Returns the result of `func`.\n */\nfunction apply(func, thisArg, args) {\n  switch (args.length) {\n    case 0: return func.call(thisArg);\n    case 1: return func.call(thisArg, args[0]);\n    case 2: return func.call(thisArg, args[0], args[1]);\n    case 3: return func.call(thisArg, args[0], args[1], args[2]);\n  }\n  return func.apply(thisArg, args);\n}\n\n/**\n * The base implementation of `_.times` without support for iteratee shorthands\n * or max array length checks.\n *\n * @private\n * @param {number} n The number of times to invoke `iteratee`.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the array of results.\n */\nfunction baseTimes(n, iteratee) {\n  var index = -1,\n      result = Array(n);\n\n  while (++index < n) {\n    result[index] = iteratee(index);\n  }\n  return result;\n}\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar objectToString = objectProto.toString;\n\n/** Built-in value references. */\nvar propertyIsEnumerable = objectProto.propertyIsEnumerable;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max;\n\n/**\n * Creates an array of the enumerable property names of the array-like `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @param {boolean} inherited Specify returning inherited property names.\n * @returns {Array} Returns the array of property names.\n */\nfunction arrayLikeKeys(value, inherited) {\n  // Safari 8.1 makes `arguments.callee` enumerable in strict mode.\n  // Safari 9 makes `arguments.length` enumerable in strict mode.\n  var result = (isArray(value) || isArguments(value))\n    ? baseTimes(value.length, String)\n    : [];\n\n  var length = result.length,\n      skipIndexes = !!length;\n\n  for (var key in value) {\n    if ((inherited || hasOwnProperty.call(value, key)) &&\n        !(skipIndexes && (key == 'length' || isIndex(key, length)))) {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\n/**\n * Used by `_.defaults` to customize its `_.assignIn` use.\n *\n * @private\n * @param {*} objValue The destination value.\n * @param {*} srcValue The source value.\n * @param {string} key The key of the property to assign.\n * @param {Object} object The parent object of `objValue`.\n * @returns {*} Returns the value to assign.\n */\nfunction assignInDefaults(objValue, srcValue, key, object) {\n  if (objValue === undefined ||\n      (eq(objValue, objectProto[key]) && !hasOwnProperty.call(object, key))) {\n    return srcValue;\n  }\n  return objValue;\n}\n\n/**\n * Assigns `value` to `key` of `object` if the existing value is not equivalent\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\nfunction assignValue(object, key, value) {\n  var objValue = object[key];\n  if (!(hasOwnProperty.call(object, key) && eq(objValue, value)) ||\n      (value === undefined && !(key in object))) {\n    object[key] = value;\n  }\n}\n\n/**\n * The base implementation of `_.keysIn` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\nfunction baseKeysIn(object) {\n  if (!isObject(object)) {\n    return nativeKeysIn(object);\n  }\n  var isProto = isPrototype(object),\n      result = [];\n\n  for (var key in object) {\n    if (!(key == 'constructor' && (isProto || !hasOwnProperty.call(object, key)))) {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\n/**\n * The base implementation of `_.rest` which doesn't validate or coerce arguments.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @returns {Function} Returns the new function.\n */\nfunction baseRest(func, start) {\n  start = nativeMax(start === undefined ? (func.length - 1) : start, 0);\n  return function() {\n    var args = arguments,\n        index = -1,\n        length = nativeMax(args.length - start, 0),\n        array = Array(length);\n\n    while (++index < length) {\n      array[index] = args[start + index];\n    }\n    index = -1;\n    var otherArgs = Array(start + 1);\n    while (++index < start) {\n      otherArgs[index] = args[index];\n    }\n    otherArgs[start] = array;\n    return apply(func, this, otherArgs);\n  };\n}\n\n/**\n * Copies properties of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy properties from.\n * @param {Array} props The property identifiers to copy.\n * @param {Object} [object={}] The object to copy properties to.\n * @param {Function} [customizer] The function to customize copied values.\n * @returns {Object} Returns `object`.\n */\nfunction copyObject(source, props, object, customizer) {\n  object || (object = {});\n\n  var index = -1,\n      length = props.length;\n\n  while (++index < length) {\n    var key = props[index];\n\n    var newValue = customizer\n      ? customizer(object[key], source[key], key, object, source)\n      : undefined;\n\n    assignValue(object, key, newValue === undefined ? source[key] : newValue);\n  }\n  return object;\n}\n\n/**\n * Creates a function like `_.assign`.\n *\n * @private\n * @param {Function} assigner The function to assign values.\n * @returns {Function} Returns the new assigner function.\n */\nfunction createAssigner(assigner) {\n  return baseRest(function(object, sources) {\n    var index = -1,\n        length = sources.length,\n        customizer = length > 1 ? sources[length - 1] : undefined,\n        guard = length > 2 ? sources[2] : undefined;\n\n    customizer = (assigner.length > 3 && typeof customizer == 'function')\n      ? (length--, customizer)\n      : undefined;\n\n    if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n      customizer = length < 3 ? undefined : customizer;\n      length = 1;\n    }\n    object = Object(object);\n    while (++index < length) {\n      var source = sources[index];\n      if (source) {\n        assigner(object, source, index, customizer);\n      }\n    }\n    return object;\n  });\n}\n\n/**\n * Checks if `value` is a valid array-like index.\n *\n * @private\n * @param {*} value The value to check.\n * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.\n * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.\n */\nfunction isIndex(value, length) {\n  length = length == null ? MAX_SAFE_INTEGER : length;\n  return !!length &&\n    (typeof value == 'number' || reIsUint.test(value)) &&\n    (value > -1 && value % 1 == 0 && value < length);\n}\n\n/**\n * Checks if the given arguments are from an iteratee call.\n *\n * @private\n * @param {*} value The potential iteratee value argument.\n * @param {*} index The potential iteratee index or key argument.\n * @param {*} object The potential iteratee object argument.\n * @returns {boolean} Returns `true` if the arguments are from an iteratee call,\n *  else `false`.\n */\nfunction isIterateeCall(value, index, object) {\n  if (!isObject(object)) {\n    return false;\n  }\n  var type = typeof index;\n  if (type == 'number'\n        ? (isArrayLike(object) && isIndex(index, object.length))\n        : (type == 'string' && index in object)\n      ) {\n    return eq(object[index], value);\n  }\n  return false;\n}\n\n/**\n * Checks if `value` is likely a prototype object.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.\n */\nfunction isPrototype(value) {\n  var Ctor = value && value.constructor,\n      proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;\n\n  return value === proto;\n}\n\n/**\n * This function is like\n * [`Object.keys`](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * except that it includes inherited enumerable properties.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\nfunction nativeKeysIn(object) {\n  var result = [];\n  if (object != null) {\n    for (var key in Object(object)) {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\n/**\n * Performs a\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * comparison between two values to determine if they are equivalent.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * var object = { 'a': 1 };\n * var other = { 'a': 1 };\n *\n * _.eq(object, object);\n * // => true\n *\n * _.eq(object, other);\n * // => false\n *\n * _.eq('a', 'a');\n * // => true\n *\n * _.eq('a', Object('a'));\n * // => false\n *\n * _.eq(NaN, NaN);\n * // => true\n */\nfunction eq(value, other) {\n  return value === other || (value !== value && other !== other);\n}\n\n/**\n * Checks if `value` is likely an `arguments` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n *  else `false`.\n * @example\n *\n * _.isArguments(function() { return arguments; }());\n * // => true\n *\n * _.isArguments([1, 2, 3]);\n * // => false\n */\nfunction isArguments(value) {\n  // Safari 8.1 makes `arguments.callee` enumerable in strict mode.\n  return isArrayLikeObject(value) && hasOwnProperty.call(value, 'callee') &&\n    (!propertyIsEnumerable.call(value, 'callee') || objectToString.call(value) == argsTag);\n}\n\n/**\n * Checks if `value` is classified as an `Array` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array, else `false`.\n * @example\n *\n * _.isArray([1, 2, 3]);\n * // => true\n *\n * _.isArray(document.body.children);\n * // => false\n *\n * _.isArray('abc');\n * // => false\n *\n * _.isArray(_.noop);\n * // => false\n */\nvar isArray = Array.isArray;\n\n/**\n * Checks if `value` is array-like. A value is considered array-like if it's\n * not a function and has a `value.length` that's an integer greater than or\n * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is array-like, else `false`.\n * @example\n *\n * _.isArrayLike([1, 2, 3]);\n * // => true\n *\n * _.isArrayLike(document.body.children);\n * // => true\n *\n * _.isArrayLike('abc');\n * // => true\n *\n * _.isArrayLike(_.noop);\n * // => false\n */\nfunction isArrayLike(value) {\n  return value != null && isLength(value.length) && !isFunction(value);\n}\n\n/**\n * This method is like `_.isArrayLike` except that it also checks if `value`\n * is an object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array-like object,\n *  else `false`.\n * @example\n *\n * _.isArrayLikeObject([1, 2, 3]);\n * // => true\n *\n * _.isArrayLikeObject(document.body.children);\n * // => true\n *\n * _.isArrayLikeObject('abc');\n * // => false\n *\n * _.isArrayLikeObject(_.noop);\n * // => false\n */\nfunction isArrayLikeObject(value) {\n  return isObjectLike(value) && isArrayLike(value);\n}\n\n/**\n * Checks if `value` is classified as a `Function` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a function, else `false`.\n * @example\n *\n * _.isFunction(_);\n * // => true\n *\n * _.isFunction(/abc/);\n * // => false\n */\nfunction isFunction(value) {\n  // The use of `Object#toString` avoids issues with the `typeof` operator\n  // in Safari 8-9 which returns 'object' for typed array and other constructors.\n  var tag = isObject(value) ? objectToString.call(value) : '';\n  return tag == funcTag || tag == genTag;\n}\n\n/**\n * Checks if `value` is a valid array-like length.\n *\n * **Note:** This method is loosely based on\n * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.\n * @example\n *\n * _.isLength(3);\n * // => true\n *\n * _.isLength(Number.MIN_VALUE);\n * // => false\n *\n * _.isLength(Infinity);\n * // => false\n *\n * _.isLength('3');\n * // => false\n */\nfunction isLength(value) {\n  return typeof value == 'number' &&\n    value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n}\n\n/**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\nfunction isObject(value) {\n  var type = typeof value;\n  return !!value && (type == 'object' || type == 'function');\n}\n\n/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n  return !!value && typeof value == 'object';\n}\n\n/**\n * This method is like `_.assignIn` except that it accepts `customizer`\n * which is invoked to produce the assigned values. If `customizer` returns\n * `undefined`, assignment is handled by the method instead. The `customizer`\n * is invoked with five arguments: (objValue, srcValue, key, object, source).\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @alias extendWith\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} sources The source objects.\n * @param {Function} [customizer] The function to customize assigned values.\n * @returns {Object} Returns `object`.\n * @see _.assignWith\n * @example\n *\n * function customizer(objValue, srcValue) {\n *   return _.isUndefined(objValue) ? srcValue : objValue;\n * }\n *\n * var defaults = _.partialRight(_.assignInWith, customizer);\n *\n * defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n * // => { 'a': 1, 'b': 2 }\n */\nvar assignInWith = createAssigner(function(object, source, srcIndex, customizer) {\n  copyObject(source, keysIn(source), object, customizer);\n});\n\n/**\n * Assigns own and inherited enumerable string keyed properties of source\n * objects to the destination object for all destination properties that\n * resolve to `undefined`. Source objects are applied from left to right.\n * Once a property is set, additional values of the same property are ignored.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @see _.defaultsDeep\n * @example\n *\n * _.defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n * // => { 'a': 1, 'b': 2 }\n */\nvar defaults = baseRest(function(args) {\n  args.push(undefined, assignInDefaults);\n  return apply(assignInWith, undefined, args);\n});\n\n/**\n * Creates an array of the own and inherited enumerable property names of `object`.\n *\n * **Note:** Non-object values are coerced to objects.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.keysIn(new Foo);\n * // => ['a', 'b', 'c'] (iteration order is not guaranteed)\n */\nfunction keysIn(object) {\n  return isArrayLike(object) ? arrayLikeKeys(object, true) : baseKeysIn(object);\n}\n\nmodule.exports = defaults;\n","\n            const Stream = require('stream');\n\n            exports = module.exports = Stream.Readable;\n            exports.Readable = Stream.Readable;\n            exports.Writable = Stream.Writable;\n            exports.Duplex = Stream.Duplex;\n            exports.Transform = Stream.Transform;\n            exports.PassThrough = Stream.PassThrough;\n            exports.Stream = Stream;\n          ","/**\n * lodash (Custom Build) <https://lodash.com/>\n * Build: `lodash modularize exports=\"npm\" -o ./`\n * Copyright jQuery Foundation and other contributors <https://jquery.org/>\n * Released under MIT license <https://lodash.com/license>\n * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>\n * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n */\n\n/** Used as references for various `Number` constants. */\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]',\n    funcTag = '[object Function]',\n    genTag = '[object GeneratorFunction]';\n\n/** Detect free variable `global` from Node.js. */\nvar freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\n/** Detect free variable `self`. */\nvar freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n/** Used as a reference to the global object. */\nvar root = freeGlobal || freeSelf || Function('return this')();\n\n/**\n * Appends the elements of `values` to `array`.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {Array} values The values to append.\n * @returns {Array} Returns `array`.\n */\nfunction arrayPush(array, values) {\n  var index = -1,\n      length = values.length,\n      offset = array.length;\n\n  while (++index < length) {\n    array[offset + index] = values[index];\n  }\n  return array;\n}\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar objectToString = objectProto.toString;\n\n/** Built-in value references. */\nvar Symbol = root.Symbol,\n    propertyIsEnumerable = objectProto.propertyIsEnumerable,\n    spreadableSymbol = Symbol ? Symbol.isConcatSpreadable : undefined;\n\n/**\n * The base implementation of `_.flatten` with support for restricting flattening.\n *\n * @private\n * @param {Array} array The array to flatten.\n * @param {number} depth The maximum recursion depth.\n * @param {boolean} [predicate=isFlattenable] The function invoked per iteration.\n * @param {boolean} [isStrict] Restrict to values that pass `predicate` checks.\n * @param {Array} [result=[]] The initial result value.\n * @returns {Array} Returns the new flattened array.\n */\nfunction baseFlatten(array, depth, predicate, isStrict, result) {\n  var index = -1,\n      length = array.length;\n\n  predicate || (predicate = isFlattenable);\n  result || (result = []);\n\n  while (++index < length) {\n    var value = array[index];\n    if (depth > 0 && predicate(value)) {\n      if (depth > 1) {\n        // Recursively flatten arrays (susceptible to call stack limits).\n        baseFlatten(value, depth - 1, predicate, isStrict, result);\n      } else {\n        arrayPush(result, value);\n      }\n    } else if (!isStrict) {\n      result[result.length] = value;\n    }\n  }\n  return result;\n}\n\n/**\n * Checks if `value` is a flattenable `arguments` object or array.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is flattenable, else `false`.\n */\nfunction isFlattenable(value) {\n  return isArray(value) || isArguments(value) ||\n    !!(spreadableSymbol && value && value[spreadableSymbol]);\n}\n\n/**\n * Flattens `array` a single level deep.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * _.flatten([1, [2, [3, [4]], 5]]);\n * // => [1, 2, [3, [4]], 5]\n */\nfunction flatten(array) {\n  var length = array ? array.length : 0;\n  return length ? baseFlatten(array, 1) : [];\n}\n\n/**\n * Checks if `value` is likely an `arguments` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n *  else `false`.\n * @example\n *\n * _.isArguments(function() { return arguments; }());\n * // => true\n *\n * _.isArguments([1, 2, 3]);\n * // => false\n */\nfunction isArguments(value) {\n  // Safari 8.1 makes `arguments.callee` enumerable in strict mode.\n  return isArrayLikeObject(value) && hasOwnProperty.call(value, 'callee') &&\n    (!propertyIsEnumerable.call(value, 'callee') || objectToString.call(value) == argsTag);\n}\n\n/**\n * Checks if `value` is classified as an `Array` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array, else `false`.\n * @example\n *\n * _.isArray([1, 2, 3]);\n * // => true\n *\n * _.isArray(document.body.children);\n * // => false\n *\n * _.isArray('abc');\n * // => false\n *\n * _.isArray(_.noop);\n * // => false\n */\nvar isArray = Array.isArray;\n\n/**\n * Checks if `value` is array-like. A value is considered array-like if it's\n * not a function and has a `value.length` that's an integer greater than or\n * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is array-like, else `false`.\n * @example\n *\n * _.isArrayLike([1, 2, 3]);\n * // => true\n *\n * _.isArrayLike(document.body.children);\n * // => true\n *\n * _.isArrayLike('abc');\n * // => true\n *\n * _.isArrayLike(_.noop);\n * // => false\n */\nfunction isArrayLike(value) {\n  return value != null && isLength(value.length) && !isFunction(value);\n}\n\n/**\n * This method is like `_.isArrayLike` except that it also checks if `value`\n * is an object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array-like object,\n *  else `false`.\n * @example\n *\n * _.isArrayLikeObject([1, 2, 3]);\n * // => true\n *\n * _.isArrayLikeObject(document.body.children);\n * // => true\n *\n * _.isArrayLikeObject('abc');\n * // => false\n *\n * _.isArrayLikeObject(_.noop);\n * // => false\n */\nfunction isArrayLikeObject(value) {\n  return isObjectLike(value) && isArrayLike(value);\n}\n\n/**\n * Checks if `value` is classified as a `Function` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a function, else `false`.\n * @example\n *\n * _.isFunction(_);\n * // => true\n *\n * _.isFunction(/abc/);\n * // => false\n */\nfunction isFunction(value) {\n  // The use of `Object#toString` avoids issues with the `typeof` operator\n  // in Safari 8-9 which returns 'object' for typed array and other constructors.\n  var tag = isObject(value) ? objectToString.call(value) : '';\n  return tag == funcTag || tag == genTag;\n}\n\n/**\n * Checks if `value` is a valid array-like length.\n *\n * **Note:** This method is loosely based on\n * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.\n * @example\n *\n * _.isLength(3);\n * // => true\n *\n * _.isLength(Number.MIN_VALUE);\n * // => false\n *\n * _.isLength(Infinity);\n * // => false\n *\n * _.isLength('3');\n * // => false\n */\nfunction isLength(value) {\n  return typeof value == 'number' &&\n    value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n}\n\n/**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\nfunction isObject(value) {\n  var type = typeof value;\n  return !!value && (type == 'object' || type == 'function');\n}\n\n/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n  return !!value && typeof value == 'object';\n}\n\nmodule.exports = flatten;\n","/**\n * lodash (Custom Build) <https://lodash.com/>\n * Build: `lodash modularize exports=\"npm\" -o ./`\n * Copyright jQuery Foundation and other contributors <https://jquery.org/>\n * Released under MIT license <https://lodash.com/license>\n * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>\n * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n */\n\n/** Used as the size to enable large array optimizations. */\nvar LARGE_ARRAY_SIZE = 200;\n\n/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/** Used as references for various `Number` constants. */\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]',\n    funcTag = '[object Function]',\n    genTag = '[object GeneratorFunction]';\n\n/**\n * Used to match `RegExp`\n * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).\n */\nvar reRegExpChar = /[\\\\^$.*+?()[\\]{}|]/g;\n\n/** Used to detect host constructors (Safari). */\nvar reIsHostCtor = /^\\[object .+?Constructor\\]$/;\n\n/** Detect free variable `global` from Node.js. */\nvar freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\n/** Detect free variable `self`. */\nvar freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n/** Used as a reference to the global object. */\nvar root = freeGlobal || freeSelf || Function('return this')();\n\n/**\n * A faster alternative to `Function#apply`, this function invokes `func`\n * with the `this` binding of `thisArg` and the arguments of `args`.\n *\n * @private\n * @param {Function} func The function to invoke.\n * @param {*} thisArg The `this` binding of `func`.\n * @param {Array} args The arguments to invoke `func` with.\n * @returns {*} Returns the result of `func`.\n */\nfunction apply(func, thisArg, args) {\n  switch (args.length) {\n    case 0: return func.call(thisArg);\n    case 1: return func.call(thisArg, args[0]);\n    case 2: return func.call(thisArg, args[0], args[1]);\n    case 3: return func.call(thisArg, args[0], args[1], args[2]);\n  }\n  return func.apply(thisArg, args);\n}\n\n/**\n * A specialized version of `_.includes` for arrays without support for\n * specifying an index to search from.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\nfunction arrayIncludes(array, value) {\n  var length = array ? array.length : 0;\n  return !!length && baseIndexOf(array, value, 0) > -1;\n}\n\n/**\n * This function is like `arrayIncludes` except that it accepts a comparator.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @param {Function} comparator The comparator invoked per element.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\nfunction arrayIncludesWith(array, value, comparator) {\n  var index = -1,\n      length = array ? array.length : 0;\n\n  while (++index < length) {\n    if (comparator(value, array[index])) {\n      return true;\n    }\n  }\n  return false;\n}\n\n/**\n * A specialized version of `_.map` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\nfunction arrayMap(array, iteratee) {\n  var index = -1,\n      length = array ? array.length : 0,\n      result = Array(length);\n\n  while (++index < length) {\n    result[index] = iteratee(array[index], index, array);\n  }\n  return result;\n}\n\n/**\n * Appends the elements of `values` to `array`.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {Array} values The values to append.\n * @returns {Array} Returns `array`.\n */\nfunction arrayPush(array, values) {\n  var index = -1,\n      length = values.length,\n      offset = array.length;\n\n  while (++index < length) {\n    array[offset + index] = values[index];\n  }\n  return array;\n}\n\n/**\n * The base implementation of `_.findIndex` and `_.findLastIndex` without\n * support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} predicate The function invoked per iteration.\n * @param {number} fromIndex The index to search from.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction baseFindIndex(array, predicate, fromIndex, fromRight) {\n  var length = array.length,\n      index = fromIndex + (fromRight ? 1 : -1);\n\n  while ((fromRight ? index-- : ++index < length)) {\n    if (predicate(array[index], index, array)) {\n      return index;\n    }\n  }\n  return -1;\n}\n\n/**\n * The base implementation of `_.indexOf` without `fromIndex` bounds checks.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction baseIndexOf(array, value, fromIndex) {\n  if (value !== value) {\n    return baseFindIndex(array, baseIsNaN, fromIndex);\n  }\n  var index = fromIndex - 1,\n      length = array.length;\n\n  while (++index < length) {\n    if (array[index] === value) {\n      return index;\n    }\n  }\n  return -1;\n}\n\n/**\n * The base implementation of `_.isNaN` without support for number objects.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n */\nfunction baseIsNaN(value) {\n  return value !== value;\n}\n\n/**\n * The base implementation of `_.unary` without support for storing metadata.\n *\n * @private\n * @param {Function} func The function to cap arguments for.\n * @returns {Function} Returns the new capped function.\n */\nfunction baseUnary(func) {\n  return function(value) {\n    return func(value);\n  };\n}\n\n/**\n * Checks if a cache value for `key` exists.\n *\n * @private\n * @param {Object} cache The cache to query.\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction cacheHas(cache, key) {\n  return cache.has(key);\n}\n\n/**\n * Gets the value at `key` of `object`.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\nfunction getValue(object, key) {\n  return object == null ? undefined : object[key];\n}\n\n/**\n * Checks if `value` is a host object in IE < 9.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a host object, else `false`.\n */\nfunction isHostObject(value) {\n  // Many host objects are `Object` objects that can coerce to strings\n  // despite having improperly defined `toString` methods.\n  var result = false;\n  if (value != null && typeof value.toString != 'function') {\n    try {\n      result = !!(value + '');\n    } catch (e) {}\n  }\n  return result;\n}\n\n/** Used for built-in method references. */\nvar arrayProto = Array.prototype,\n    funcProto = Function.prototype,\n    objectProto = Object.prototype;\n\n/** Used to detect overreaching core-js shims. */\nvar coreJsData = root['__core-js_shared__'];\n\n/** Used to detect methods masquerading as native. */\nvar maskSrcKey = (function() {\n  var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');\n  return uid ? ('Symbol(src)_1.' + uid) : '';\n}());\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar objectToString = objectProto.toString;\n\n/** Used to detect if a method is native. */\nvar reIsNative = RegExp('^' +\n  funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\$&')\n  .replace(/hasOwnProperty|(function).*?(?=\\\\\\()| for .+?(?=\\\\\\])/g, '$1.*?') + '$'\n);\n\n/** Built-in value references. */\nvar Symbol = root.Symbol,\n    propertyIsEnumerable = objectProto.propertyIsEnumerable,\n    splice = arrayProto.splice,\n    spreadableSymbol = Symbol ? Symbol.isConcatSpreadable : undefined;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max;\n\n/* Built-in method references that are verified to be native. */\nvar Map = getNative(root, 'Map'),\n    nativeCreate = getNative(Object, 'create');\n\n/**\n * Creates a hash object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Hash(entries) {\n  var index = -1,\n      length = entries ? entries.length : 0;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n/**\n * Removes all key-value entries from the hash.\n *\n * @private\n * @name clear\n * @memberOf Hash\n */\nfunction hashClear() {\n  this.__data__ = nativeCreate ? nativeCreate(null) : {};\n}\n\n/**\n * Removes `key` and its value from the hash.\n *\n * @private\n * @name delete\n * @memberOf Hash\n * @param {Object} hash The hash to modify.\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction hashDelete(key) {\n  return this.has(key) && delete this.__data__[key];\n}\n\n/**\n * Gets the hash value for `key`.\n *\n * @private\n * @name get\n * @memberOf Hash\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction hashGet(key) {\n  var data = this.__data__;\n  if (nativeCreate) {\n    var result = data[key];\n    return result === HASH_UNDEFINED ? undefined : result;\n  }\n  return hasOwnProperty.call(data, key) ? data[key] : undefined;\n}\n\n/**\n * Checks if a hash value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Hash\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction hashHas(key) {\n  var data = this.__data__;\n  return nativeCreate ? data[key] !== undefined : hasOwnProperty.call(data, key);\n}\n\n/**\n * Sets the hash `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Hash\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the hash instance.\n */\nfunction hashSet(key, value) {\n  var data = this.__data__;\n  data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;\n  return this;\n}\n\n// Add methods to `Hash`.\nHash.prototype.clear = hashClear;\nHash.prototype['delete'] = hashDelete;\nHash.prototype.get = hashGet;\nHash.prototype.has = hashHas;\nHash.prototype.set = hashSet;\n\n/**\n * Creates an list cache object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction ListCache(entries) {\n  var index = -1,\n      length = entries ? entries.length : 0;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n/**\n * Removes all key-value entries from the list cache.\n *\n * @private\n * @name clear\n * @memberOf ListCache\n */\nfunction listCacheClear() {\n  this.__data__ = [];\n}\n\n/**\n * Removes `key` and its value from the list cache.\n *\n * @private\n * @name delete\n * @memberOf ListCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction listCacheDelete(key) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  if (index < 0) {\n    return false;\n  }\n  var lastIndex = data.length - 1;\n  if (index == lastIndex) {\n    data.pop();\n  } else {\n    splice.call(data, index, 1);\n  }\n  return true;\n}\n\n/**\n * Gets the list cache value for `key`.\n *\n * @private\n * @name get\n * @memberOf ListCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction listCacheGet(key) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  return index < 0 ? undefined : data[index][1];\n}\n\n/**\n * Checks if a list cache value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf ListCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction listCacheHas(key) {\n  return assocIndexOf(this.__data__, key) > -1;\n}\n\n/**\n * Sets the list cache `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf ListCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the list cache instance.\n */\nfunction listCacheSet(key, value) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  if (index < 0) {\n    data.push([key, value]);\n  } else {\n    data[index][1] = value;\n  }\n  return this;\n}\n\n// Add methods to `ListCache`.\nListCache.prototype.clear = listCacheClear;\nListCache.prototype['delete'] = listCacheDelete;\nListCache.prototype.get = listCacheGet;\nListCache.prototype.has = listCacheHas;\nListCache.prototype.set = listCacheSet;\n\n/**\n * Creates a map cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction MapCache(entries) {\n  var index = -1,\n      length = entries ? entries.length : 0;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n/**\n * Removes all key-value entries from the map.\n *\n * @private\n * @name clear\n * @memberOf MapCache\n */\nfunction mapCacheClear() {\n  this.__data__ = {\n    'hash': new Hash,\n    'map': new (Map || ListCache),\n    'string': new Hash\n  };\n}\n\n/**\n * Removes `key` and its value from the map.\n *\n * @private\n * @name delete\n * @memberOf MapCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction mapCacheDelete(key) {\n  return getMapData(this, key)['delete'](key);\n}\n\n/**\n * Gets the map value for `key`.\n *\n * @private\n * @name get\n * @memberOf MapCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction mapCacheGet(key) {\n  return getMapData(this, key).get(key);\n}\n\n/**\n * Checks if a map value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf MapCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction mapCacheHas(key) {\n  return getMapData(this, key).has(key);\n}\n\n/**\n * Sets the map `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf MapCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the map cache instance.\n */\nfunction mapCacheSet(key, value) {\n  getMapData(this, key).set(key, value);\n  return this;\n}\n\n// Add methods to `MapCache`.\nMapCache.prototype.clear = mapCacheClear;\nMapCache.prototype['delete'] = mapCacheDelete;\nMapCache.prototype.get = mapCacheGet;\nMapCache.prototype.has = mapCacheHas;\nMapCache.prototype.set = mapCacheSet;\n\n/**\n *\n * Creates an array cache object to store unique values.\n *\n * @private\n * @constructor\n * @param {Array} [values] The values to cache.\n */\nfunction SetCache(values) {\n  var index = -1,\n      length = values ? values.length : 0;\n\n  this.__data__ = new MapCache;\n  while (++index < length) {\n    this.add(values[index]);\n  }\n}\n\n/**\n * Adds `value` to the array cache.\n *\n * @private\n * @name add\n * @memberOf SetCache\n * @alias push\n * @param {*} value The value to cache.\n * @returns {Object} Returns the cache instance.\n */\nfunction setCacheAdd(value) {\n  this.__data__.set(value, HASH_UNDEFINED);\n  return this;\n}\n\n/**\n * Checks if `value` is in the array cache.\n *\n * @private\n * @name has\n * @memberOf SetCache\n * @param {*} value The value to search for.\n * @returns {number} Returns `true` if `value` is found, else `false`.\n */\nfunction setCacheHas(value) {\n  return this.__data__.has(value);\n}\n\n// Add methods to `SetCache`.\nSetCache.prototype.add = SetCache.prototype.push = setCacheAdd;\nSetCache.prototype.has = setCacheHas;\n\n/**\n * Gets the index at which the `key` is found in `array` of key-value pairs.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} key The key to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction assocIndexOf(array, key) {\n  var length = array.length;\n  while (length--) {\n    if (eq(array[length][0], key)) {\n      return length;\n    }\n  }\n  return -1;\n}\n\n/**\n * The base implementation of methods like `_.difference` without support\n * for excluding multiple arrays or iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Array} values The values to exclude.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n */\nfunction baseDifference(array, values, iteratee, comparator) {\n  var index = -1,\n      includes = arrayIncludes,\n      isCommon = true,\n      length = array.length,\n      result = [],\n      valuesLength = values.length;\n\n  if (!length) {\n    return result;\n  }\n  if (iteratee) {\n    values = arrayMap(values, baseUnary(iteratee));\n  }\n  if (comparator) {\n    includes = arrayIncludesWith;\n    isCommon = false;\n  }\n  else if (values.length >= LARGE_ARRAY_SIZE) {\n    includes = cacheHas;\n    isCommon = false;\n    values = new SetCache(values);\n  }\n  outer:\n  while (++index < length) {\n    var value = array[index],\n        computed = iteratee ? iteratee(value) : value;\n\n    value = (comparator || value !== 0) ? value : 0;\n    if (isCommon && computed === computed) {\n      var valuesIndex = valuesLength;\n      while (valuesIndex--) {\n        if (values[valuesIndex] === computed) {\n          continue outer;\n        }\n      }\n      result.push(value);\n    }\n    else if (!includes(values, computed, comparator)) {\n      result.push(value);\n    }\n  }\n  return result;\n}\n\n/**\n * The base implementation of `_.flatten` with support for restricting flattening.\n *\n * @private\n * @param {Array} array The array to flatten.\n * @param {number} depth The maximum recursion depth.\n * @param {boolean} [predicate=isFlattenable] The function invoked per iteration.\n * @param {boolean} [isStrict] Restrict to values that pass `predicate` checks.\n * @param {Array} [result=[]] The initial result value.\n * @returns {Array} Returns the new flattened array.\n */\nfunction baseFlatten(array, depth, predicate, isStrict, result) {\n  var index = -1,\n      length = array.length;\n\n  predicate || (predicate = isFlattenable);\n  result || (result = []);\n\n  while (++index < length) {\n    var value = array[index];\n    if (depth > 0 && predicate(value)) {\n      if (depth > 1) {\n        // Recursively flatten arrays (susceptible to call stack limits).\n        baseFlatten(value, depth - 1, predicate, isStrict, result);\n      } else {\n        arrayPush(result, value);\n      }\n    } else if (!isStrict) {\n      result[result.length] = value;\n    }\n  }\n  return result;\n}\n\n/**\n * The base implementation of `_.isNative` without bad shim checks.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a native function,\n *  else `false`.\n */\nfunction baseIsNative(value) {\n  if (!isObject(value) || isMasked(value)) {\n    return false;\n  }\n  var pattern = (isFunction(value) || isHostObject(value)) ? reIsNative : reIsHostCtor;\n  return pattern.test(toSource(value));\n}\n\n/**\n * The base implementation of `_.rest` which doesn't validate or coerce arguments.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @returns {Function} Returns the new function.\n */\nfunction baseRest(func, start) {\n  start = nativeMax(start === undefined ? (func.length - 1) : start, 0);\n  return function() {\n    var args = arguments,\n        index = -1,\n        length = nativeMax(args.length - start, 0),\n        array = Array(length);\n\n    while (++index < length) {\n      array[index] = args[start + index];\n    }\n    index = -1;\n    var otherArgs = Array(start + 1);\n    while (++index < start) {\n      otherArgs[index] = args[index];\n    }\n    otherArgs[start] = array;\n    return apply(func, this, otherArgs);\n  };\n}\n\n/**\n * Gets the data for `map`.\n *\n * @private\n * @param {Object} map The map to query.\n * @param {string} key The reference key.\n * @returns {*} Returns the map data.\n */\nfunction getMapData(map, key) {\n  var data = map.__data__;\n  return isKeyable(key)\n    ? data[typeof key == 'string' ? 'string' : 'hash']\n    : data.map;\n}\n\n/**\n * Gets the native function at `key` of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the method to get.\n * @returns {*} Returns the function if it's native, else `undefined`.\n */\nfunction getNative(object, key) {\n  var value = getValue(object, key);\n  return baseIsNative(value) ? value : undefined;\n}\n\n/**\n * Checks if `value` is a flattenable `arguments` object or array.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is flattenable, else `false`.\n */\nfunction isFlattenable(value) {\n  return isArray(value) || isArguments(value) ||\n    !!(spreadableSymbol && value && value[spreadableSymbol]);\n}\n\n/**\n * Checks if `value` is suitable for use as unique object key.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is suitable, else `false`.\n */\nfunction isKeyable(value) {\n  var type = typeof value;\n  return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')\n    ? (value !== '__proto__')\n    : (value === null);\n}\n\n/**\n * Checks if `func` has its source masked.\n *\n * @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` is masked, else `false`.\n */\nfunction isMasked(func) {\n  return !!maskSrcKey && (maskSrcKey in func);\n}\n\n/**\n * Converts `func` to its source code.\n *\n * @private\n * @param {Function} func The function to process.\n * @returns {string} Returns the source code.\n */\nfunction toSource(func) {\n  if (func != null) {\n    try {\n      return funcToString.call(func);\n    } catch (e) {}\n    try {\n      return (func + '');\n    } catch (e) {}\n  }\n  return '';\n}\n\n/**\n * Creates an array of `array` values not included in the other given arrays\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons. The order of result values is determined by the\n * order they occur in the first array.\n *\n * **Note:** Unlike `_.pullAll`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...Array} [values] The values to exclude.\n * @returns {Array} Returns the new array of filtered values.\n * @see _.without, _.xor\n * @example\n *\n * _.difference([2, 1], [2, 3]);\n * // => [1]\n */\nvar difference = baseRest(function(array, values) {\n  return isArrayLikeObject(array)\n    ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true))\n    : [];\n});\n\n/**\n * Performs a\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * comparison between two values to determine if they are equivalent.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * var object = { 'a': 1 };\n * var other = { 'a': 1 };\n *\n * _.eq(object, object);\n * // => true\n *\n * _.eq(object, other);\n * // => false\n *\n * _.eq('a', 'a');\n * // => true\n *\n * _.eq('a', Object('a'));\n * // => false\n *\n * _.eq(NaN, NaN);\n * // => true\n */\nfunction eq(value, other) {\n  return value === other || (value !== value && other !== other);\n}\n\n/**\n * Checks if `value` is likely an `arguments` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n *  else `false`.\n * @example\n *\n * _.isArguments(function() { return arguments; }());\n * // => true\n *\n * _.isArguments([1, 2, 3]);\n * // => false\n */\nfunction isArguments(value) {\n  // Safari 8.1 makes `arguments.callee` enumerable in strict mode.\n  return isArrayLikeObject(value) && hasOwnProperty.call(value, 'callee') &&\n    (!propertyIsEnumerable.call(value, 'callee') || objectToString.call(value) == argsTag);\n}\n\n/**\n * Checks if `value` is classified as an `Array` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array, else `false`.\n * @example\n *\n * _.isArray([1, 2, 3]);\n * // => true\n *\n * _.isArray(document.body.children);\n * // => false\n *\n * _.isArray('abc');\n * // => false\n *\n * _.isArray(_.noop);\n * // => false\n */\nvar isArray = Array.isArray;\n\n/**\n * Checks if `value` is array-like. A value is considered array-like if it's\n * not a function and has a `value.length` that's an integer greater than or\n * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is array-like, else `false`.\n * @example\n *\n * _.isArrayLike([1, 2, 3]);\n * // => true\n *\n * _.isArrayLike(document.body.children);\n * // => true\n *\n * _.isArrayLike('abc');\n * // => true\n *\n * _.isArrayLike(_.noop);\n * // => false\n */\nfunction isArrayLike(value) {\n  return value != null && isLength(value.length) && !isFunction(value);\n}\n\n/**\n * This method is like `_.isArrayLike` except that it also checks if `value`\n * is an object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array-like object,\n *  else `false`.\n * @example\n *\n * _.isArrayLikeObject([1, 2, 3]);\n * // => true\n *\n * _.isArrayLikeObject(document.body.children);\n * // => true\n *\n * _.isArrayLikeObject('abc');\n * // => false\n *\n * _.isArrayLikeObject(_.noop);\n * // => false\n */\nfunction isArrayLikeObject(value) {\n  return isObjectLike(value) && isArrayLike(value);\n}\n\n/**\n * Checks if `value` is classified as a `Function` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a function, else `false`.\n * @example\n *\n * _.isFunction(_);\n * // => true\n *\n * _.isFunction(/abc/);\n * // => false\n */\nfunction isFunction(value) {\n  // The use of `Object#toString` avoids issues with the `typeof` operator\n  // in Safari 8-9 which returns 'object' for typed array and other constructors.\n  var tag = isObject(value) ? objectToString.call(value) : '';\n  return tag == funcTag || tag == genTag;\n}\n\n/**\n * Checks if `value` is a valid array-like length.\n *\n * **Note:** This method is loosely based on\n * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.\n * @example\n *\n * _.isLength(3);\n * // => true\n *\n * _.isLength(Number.MIN_VALUE);\n * // => false\n *\n * _.isLength(Infinity);\n * // => false\n *\n * _.isLength('3');\n * // => false\n */\nfunction isLength(value) {\n  return typeof value == 'number' &&\n    value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n}\n\n/**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\nfunction isObject(value) {\n  var type = typeof value;\n  return !!value && (type == 'object' || type == 'function');\n}\n\n/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n  return !!value && typeof value == 'object';\n}\n\nmodule.exports = difference;\n","/**\n * lodash (Custom Build) <https://lodash.com/>\n * Build: `lodash modularize exports=\"npm\" -o ./`\n * Copyright jQuery Foundation and other contributors <https://jquery.org/>\n * Released under MIT license <https://lodash.com/license>\n * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>\n * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n */\n\n/** Used as the size to enable large array optimizations. */\nvar LARGE_ARRAY_SIZE = 200;\n\n/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0,\n    MAX_SAFE_INTEGER = 9007199254740991;\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]',\n    funcTag = '[object Function]',\n    genTag = '[object GeneratorFunction]';\n\n/**\n * Used to match `RegExp`\n * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).\n */\nvar reRegExpChar = /[\\\\^$.*+?()[\\]{}|]/g;\n\n/** Used to detect host constructors (Safari). */\nvar reIsHostCtor = /^\\[object .+?Constructor\\]$/;\n\n/** Detect free variable `global` from Node.js. */\nvar freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\n/** Detect free variable `self`. */\nvar freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n/** Used as a reference to the global object. */\nvar root = freeGlobal || freeSelf || Function('return this')();\n\n/**\n * A faster alternative to `Function#apply`, this function invokes `func`\n * with the `this` binding of `thisArg` and the arguments of `args`.\n *\n * @private\n * @param {Function} func The function to invoke.\n * @param {*} thisArg The `this` binding of `func`.\n * @param {Array} args The arguments to invoke `func` with.\n * @returns {*} Returns the result of `func`.\n */\nfunction apply(func, thisArg, args) {\n  switch (args.length) {\n    case 0: return func.call(thisArg);\n    case 1: return func.call(thisArg, args[0]);\n    case 2: return func.call(thisArg, args[0], args[1]);\n    case 3: return func.call(thisArg, args[0], args[1], args[2]);\n  }\n  return func.apply(thisArg, args);\n}\n\n/**\n * A specialized version of `_.includes` for arrays without support for\n * specifying an index to search from.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\nfunction arrayIncludes(array, value) {\n  var length = array ? array.length : 0;\n  return !!length && baseIndexOf(array, value, 0) > -1;\n}\n\n/**\n * This function is like `arrayIncludes` except that it accepts a comparator.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @param {Function} comparator The comparator invoked per element.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\nfunction arrayIncludesWith(array, value, comparator) {\n  var index = -1,\n      length = array ? array.length : 0;\n\n  while (++index < length) {\n    if (comparator(value, array[index])) {\n      return true;\n    }\n  }\n  return false;\n}\n\n/**\n * Appends the elements of `values` to `array`.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {Array} values The values to append.\n * @returns {Array} Returns `array`.\n */\nfunction arrayPush(array, values) {\n  var index = -1,\n      length = values.length,\n      offset = array.length;\n\n  while (++index < length) {\n    array[offset + index] = values[index];\n  }\n  return array;\n}\n\n/**\n * The base implementation of `_.findIndex` and `_.findLastIndex` without\n * support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} predicate The function invoked per iteration.\n * @param {number} fromIndex The index to search from.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction baseFindIndex(array, predicate, fromIndex, fromRight) {\n  var length = array.length,\n      index = fromIndex + (fromRight ? 1 : -1);\n\n  while ((fromRight ? index-- : ++index < length)) {\n    if (predicate(array[index], index, array)) {\n      return index;\n    }\n  }\n  return -1;\n}\n\n/**\n * The base implementation of `_.indexOf` without `fromIndex` bounds checks.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction baseIndexOf(array, value, fromIndex) {\n  if (value !== value) {\n    return baseFindIndex(array, baseIsNaN, fromIndex);\n  }\n  var index = fromIndex - 1,\n      length = array.length;\n\n  while (++index < length) {\n    if (array[index] === value) {\n      return index;\n    }\n  }\n  return -1;\n}\n\n/**\n * The base implementation of `_.isNaN` without support for number objects.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n */\nfunction baseIsNaN(value) {\n  return value !== value;\n}\n\n/**\n * Checks if a cache value for `key` exists.\n *\n * @private\n * @param {Object} cache The cache to query.\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction cacheHas(cache, key) {\n  return cache.has(key);\n}\n\n/**\n * Gets the value at `key` of `object`.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\nfunction getValue(object, key) {\n  return object == null ? undefined : object[key];\n}\n\n/**\n * Checks if `value` is a host object in IE < 9.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a host object, else `false`.\n */\nfunction isHostObject(value) {\n  // Many host objects are `Object` objects that can coerce to strings\n  // despite having improperly defined `toString` methods.\n  var result = false;\n  if (value != null && typeof value.toString != 'function') {\n    try {\n      result = !!(value + '');\n    } catch (e) {}\n  }\n  return result;\n}\n\n/**\n * Converts `set` to an array of its values.\n *\n * @private\n * @param {Object} set The set to convert.\n * @returns {Array} Returns the values.\n */\nfunction setToArray(set) {\n  var index = -1,\n      result = Array(set.size);\n\n  set.forEach(function(value) {\n    result[++index] = value;\n  });\n  return result;\n}\n\n/** Used for built-in method references. */\nvar arrayProto = Array.prototype,\n    funcProto = Function.prototype,\n    objectProto = Object.prototype;\n\n/** Used to detect overreaching core-js shims. */\nvar coreJsData = root['__core-js_shared__'];\n\n/** Used to detect methods masquerading as native. */\nvar maskSrcKey = (function() {\n  var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');\n  return uid ? ('Symbol(src)_1.' + uid) : '';\n}());\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar objectToString = objectProto.toString;\n\n/** Used to detect if a method is native. */\nvar reIsNative = RegExp('^' +\n  funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\$&')\n  .replace(/hasOwnProperty|(function).*?(?=\\\\\\()| for .+?(?=\\\\\\])/g, '$1.*?') + '$'\n);\n\n/** Built-in value references. */\nvar Symbol = root.Symbol,\n    propertyIsEnumerable = objectProto.propertyIsEnumerable,\n    splice = arrayProto.splice,\n    spreadableSymbol = Symbol ? Symbol.isConcatSpreadable : undefined;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max;\n\n/* Built-in method references that are verified to be native. */\nvar Map = getNative(root, 'Map'),\n    Set = getNative(root, 'Set'),\n    nativeCreate = getNative(Object, 'create');\n\n/**\n * Creates a hash object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Hash(entries) {\n  var index = -1,\n      length = entries ? entries.length : 0;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n/**\n * Removes all key-value entries from the hash.\n *\n * @private\n * @name clear\n * @memberOf Hash\n */\nfunction hashClear() {\n  this.__data__ = nativeCreate ? nativeCreate(null) : {};\n}\n\n/**\n * Removes `key` and its value from the hash.\n *\n * @private\n * @name delete\n * @memberOf Hash\n * @param {Object} hash The hash to modify.\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction hashDelete(key) {\n  return this.has(key) && delete this.__data__[key];\n}\n\n/**\n * Gets the hash value for `key`.\n *\n * @private\n * @name get\n * @memberOf Hash\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction hashGet(key) {\n  var data = this.__data__;\n  if (nativeCreate) {\n    var result = data[key];\n    return result === HASH_UNDEFINED ? undefined : result;\n  }\n  return hasOwnProperty.call(data, key) ? data[key] : undefined;\n}\n\n/**\n * Checks if a hash value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Hash\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction hashHas(key) {\n  var data = this.__data__;\n  return nativeCreate ? data[key] !== undefined : hasOwnProperty.call(data, key);\n}\n\n/**\n * Sets the hash `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Hash\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the hash instance.\n */\nfunction hashSet(key, value) {\n  var data = this.__data__;\n  data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;\n  return this;\n}\n\n// Add methods to `Hash`.\nHash.prototype.clear = hashClear;\nHash.prototype['delete'] = hashDelete;\nHash.prototype.get = hashGet;\nHash.prototype.has = hashHas;\nHash.prototype.set = hashSet;\n\n/**\n * Creates an list cache object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction ListCache(entries) {\n  var index = -1,\n      length = entries ? entries.length : 0;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n/**\n * Removes all key-value entries from the list cache.\n *\n * @private\n * @name clear\n * @memberOf ListCache\n */\nfunction listCacheClear() {\n  this.__data__ = [];\n}\n\n/**\n * Removes `key` and its value from the list cache.\n *\n * @private\n * @name delete\n * @memberOf ListCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction listCacheDelete(key) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  if (index < 0) {\n    return false;\n  }\n  var lastIndex = data.length - 1;\n  if (index == lastIndex) {\n    data.pop();\n  } else {\n    splice.call(data, index, 1);\n  }\n  return true;\n}\n\n/**\n * Gets the list cache value for `key`.\n *\n * @private\n * @name get\n * @memberOf ListCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction listCacheGet(key) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  return index < 0 ? undefined : data[index][1];\n}\n\n/**\n * Checks if a list cache value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf ListCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction listCacheHas(key) {\n  return assocIndexOf(this.__data__, key) > -1;\n}\n\n/**\n * Sets the list cache `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf ListCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the list cache instance.\n */\nfunction listCacheSet(key, value) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  if (index < 0) {\n    data.push([key, value]);\n  } else {\n    data[index][1] = value;\n  }\n  return this;\n}\n\n// Add methods to `ListCache`.\nListCache.prototype.clear = listCacheClear;\nListCache.prototype['delete'] = listCacheDelete;\nListCache.prototype.get = listCacheGet;\nListCache.prototype.has = listCacheHas;\nListCache.prototype.set = listCacheSet;\n\n/**\n * Creates a map cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction MapCache(entries) {\n  var index = -1,\n      length = entries ? entries.length : 0;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n/**\n * Removes all key-value entries from the map.\n *\n * @private\n * @name clear\n * @memberOf MapCache\n */\nfunction mapCacheClear() {\n  this.__data__ = {\n    'hash': new Hash,\n    'map': new (Map || ListCache),\n    'string': new Hash\n  };\n}\n\n/**\n * Removes `key` and its value from the map.\n *\n * @private\n * @name delete\n * @memberOf MapCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction mapCacheDelete(key) {\n  return getMapData(this, key)['delete'](key);\n}\n\n/**\n * Gets the map value for `key`.\n *\n * @private\n * @name get\n * @memberOf MapCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction mapCacheGet(key) {\n  return getMapData(this, key).get(key);\n}\n\n/**\n * Checks if a map value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf MapCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction mapCacheHas(key) {\n  return getMapData(this, key).has(key);\n}\n\n/**\n * Sets the map `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf MapCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the map cache instance.\n */\nfunction mapCacheSet(key, value) {\n  getMapData(this, key).set(key, value);\n  return this;\n}\n\n// Add methods to `MapCache`.\nMapCache.prototype.clear = mapCacheClear;\nMapCache.prototype['delete'] = mapCacheDelete;\nMapCache.prototype.get = mapCacheGet;\nMapCache.prototype.has = mapCacheHas;\nMapCache.prototype.set = mapCacheSet;\n\n/**\n *\n * Creates an array cache object to store unique values.\n *\n * @private\n * @constructor\n * @param {Array} [values] The values to cache.\n */\nfunction SetCache(values) {\n  var index = -1,\n      length = values ? values.length : 0;\n\n  this.__data__ = new MapCache;\n  while (++index < length) {\n    this.add(values[index]);\n  }\n}\n\n/**\n * Adds `value` to the array cache.\n *\n * @private\n * @name add\n * @memberOf SetCache\n * @alias push\n * @param {*} value The value to cache.\n * @returns {Object} Returns the cache instance.\n */\nfunction setCacheAdd(value) {\n  this.__data__.set(value, HASH_UNDEFINED);\n  return this;\n}\n\n/**\n * Checks if `value` is in the array cache.\n *\n * @private\n * @name has\n * @memberOf SetCache\n * @param {*} value The value to search for.\n * @returns {number} Returns `true` if `value` is found, else `false`.\n */\nfunction setCacheHas(value) {\n  return this.__data__.has(value);\n}\n\n// Add methods to `SetCache`.\nSetCache.prototype.add = SetCache.prototype.push = setCacheAdd;\nSetCache.prototype.has = setCacheHas;\n\n/**\n * Gets the index at which the `key` is found in `array` of key-value pairs.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} key The key to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction assocIndexOf(array, key) {\n  var length = array.length;\n  while (length--) {\n    if (eq(array[length][0], key)) {\n      return length;\n    }\n  }\n  return -1;\n}\n\n/**\n * The base implementation of `_.flatten` with support for restricting flattening.\n *\n * @private\n * @param {Array} array The array to flatten.\n * @param {number} depth The maximum recursion depth.\n * @param {boolean} [predicate=isFlattenable] The function invoked per iteration.\n * @param {boolean} [isStrict] Restrict to values that pass `predicate` checks.\n * @param {Array} [result=[]] The initial result value.\n * @returns {Array} Returns the new flattened array.\n */\nfunction baseFlatten(array, depth, predicate, isStrict, result) {\n  var index = -1,\n      length = array.length;\n\n  predicate || (predicate = isFlattenable);\n  result || (result = []);\n\n  while (++index < length) {\n    var value = array[index];\n    if (depth > 0 && predicate(value)) {\n      if (depth > 1) {\n        // Recursively flatten arrays (susceptible to call stack limits).\n        baseFlatten(value, depth - 1, predicate, isStrict, result);\n      } else {\n        arrayPush(result, value);\n      }\n    } else if (!isStrict) {\n      result[result.length] = value;\n    }\n  }\n  return result;\n}\n\n/**\n * The base implementation of `_.isNative` without bad shim checks.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a native function,\n *  else `false`.\n */\nfunction baseIsNative(value) {\n  if (!isObject(value) || isMasked(value)) {\n    return false;\n  }\n  var pattern = (isFunction(value) || isHostObject(value)) ? reIsNative : reIsHostCtor;\n  return pattern.test(toSource(value));\n}\n\n/**\n * The base implementation of `_.rest` which doesn't validate or coerce arguments.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @returns {Function} Returns the new function.\n */\nfunction baseRest(func, start) {\n  start = nativeMax(start === undefined ? (func.length - 1) : start, 0);\n  return function() {\n    var args = arguments,\n        index = -1,\n        length = nativeMax(args.length - start, 0),\n        array = Array(length);\n\n    while (++index < length) {\n      array[index] = args[start + index];\n    }\n    index = -1;\n    var otherArgs = Array(start + 1);\n    while (++index < start) {\n      otherArgs[index] = args[index];\n    }\n    otherArgs[start] = array;\n    return apply(func, this, otherArgs);\n  };\n}\n\n/**\n * The base implementation of `_.uniqBy` without support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n */\nfunction baseUniq(array, iteratee, comparator) {\n  var index = -1,\n      includes = arrayIncludes,\n      length = array.length,\n      isCommon = true,\n      result = [],\n      seen = result;\n\n  if (comparator) {\n    isCommon = false;\n    includes = arrayIncludesWith;\n  }\n  else if (length >= LARGE_ARRAY_SIZE) {\n    var set = iteratee ? null : createSet(array);\n    if (set) {\n      return setToArray(set);\n    }\n    isCommon = false;\n    includes = cacheHas;\n    seen = new SetCache;\n  }\n  else {\n    seen = iteratee ? [] : result;\n  }\n  outer:\n  while (++index < length) {\n    var value = array[index],\n        computed = iteratee ? iteratee(value) : value;\n\n    value = (comparator || value !== 0) ? value : 0;\n    if (isCommon && computed === computed) {\n      var seenIndex = seen.length;\n      while (seenIndex--) {\n        if (seen[seenIndex] === computed) {\n          continue outer;\n        }\n      }\n      if (iteratee) {\n        seen.push(computed);\n      }\n      result.push(value);\n    }\n    else if (!includes(seen, computed, comparator)) {\n      if (seen !== result) {\n        seen.push(computed);\n      }\n      result.push(value);\n    }\n  }\n  return result;\n}\n\n/**\n * Creates a set object of `values`.\n *\n * @private\n * @param {Array} values The values to add to the set.\n * @returns {Object} Returns the new set.\n */\nvar createSet = !(Set && (1 / setToArray(new Set([,-0]))[1]) == INFINITY) ? noop : function(values) {\n  return new Set(values);\n};\n\n/**\n * Gets the data for `map`.\n *\n * @private\n * @param {Object} map The map to query.\n * @param {string} key The reference key.\n * @returns {*} Returns the map data.\n */\nfunction getMapData(map, key) {\n  var data = map.__data__;\n  return isKeyable(key)\n    ? data[typeof key == 'string' ? 'string' : 'hash']\n    : data.map;\n}\n\n/**\n * Gets the native function at `key` of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the method to get.\n * @returns {*} Returns the function if it's native, else `undefined`.\n */\nfunction getNative(object, key) {\n  var value = getValue(object, key);\n  return baseIsNative(value) ? value : undefined;\n}\n\n/**\n * Checks if `value` is a flattenable `arguments` object or array.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is flattenable, else `false`.\n */\nfunction isFlattenable(value) {\n  return isArray(value) || isArguments(value) ||\n    !!(spreadableSymbol && value && value[spreadableSymbol]);\n}\n\n/**\n * Checks if `value` is suitable for use as unique object key.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is suitable, else `false`.\n */\nfunction isKeyable(value) {\n  var type = typeof value;\n  return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')\n    ? (value !== '__proto__')\n    : (value === null);\n}\n\n/**\n * Checks if `func` has its source masked.\n *\n * @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` is masked, else `false`.\n */\nfunction isMasked(func) {\n  return !!maskSrcKey && (maskSrcKey in func);\n}\n\n/**\n * Converts `func` to its source code.\n *\n * @private\n * @param {Function} func The function to process.\n * @returns {string} Returns the source code.\n */\nfunction toSource(func) {\n  if (func != null) {\n    try {\n      return funcToString.call(func);\n    } catch (e) {}\n    try {\n      return (func + '');\n    } catch (e) {}\n  }\n  return '';\n}\n\n/**\n * Creates an array of unique values, in order, from all given arrays using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of combined values.\n * @example\n *\n * _.union([2], [1, 2]);\n * // => [2, 1]\n */\nvar union = baseRest(function(arrays) {\n  return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true));\n});\n\n/**\n * Performs a\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * comparison between two values to determine if they are equivalent.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * var object = { 'a': 1 };\n * var other = { 'a': 1 };\n *\n * _.eq(object, object);\n * // => true\n *\n * _.eq(object, other);\n * // => false\n *\n * _.eq('a', 'a');\n * // => true\n *\n * _.eq('a', Object('a'));\n * // => false\n *\n * _.eq(NaN, NaN);\n * // => true\n */\nfunction eq(value, other) {\n  return value === other || (value !== value && other !== other);\n}\n\n/**\n * Checks if `value` is likely an `arguments` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n *  else `false`.\n * @example\n *\n * _.isArguments(function() { return arguments; }());\n * // => true\n *\n * _.isArguments([1, 2, 3]);\n * // => false\n */\nfunction isArguments(value) {\n  // Safari 8.1 makes `arguments.callee` enumerable in strict mode.\n  return isArrayLikeObject(value) && hasOwnProperty.call(value, 'callee') &&\n    (!propertyIsEnumerable.call(value, 'callee') || objectToString.call(value) == argsTag);\n}\n\n/**\n * Checks if `value` is classified as an `Array` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array, else `false`.\n * @example\n *\n * _.isArray([1, 2, 3]);\n * // => true\n *\n * _.isArray(document.body.children);\n * // => false\n *\n * _.isArray('abc');\n * // => false\n *\n * _.isArray(_.noop);\n * // => false\n */\nvar isArray = Array.isArray;\n\n/**\n * Checks if `value` is array-like. A value is considered array-like if it's\n * not a function and has a `value.length` that's an integer greater than or\n * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is array-like, else `false`.\n * @example\n *\n * _.isArrayLike([1, 2, 3]);\n * // => true\n *\n * _.isArrayLike(document.body.children);\n * // => true\n *\n * _.isArrayLike('abc');\n * // => true\n *\n * _.isArrayLike(_.noop);\n * // => false\n */\nfunction isArrayLike(value) {\n  return value != null && isLength(value.length) && !isFunction(value);\n}\n\n/**\n * This method is like `_.isArrayLike` except that it also checks if `value`\n * is an object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array-like object,\n *  else `false`.\n * @example\n *\n * _.isArrayLikeObject([1, 2, 3]);\n * // => true\n *\n * _.isArrayLikeObject(document.body.children);\n * // => true\n *\n * _.isArrayLikeObject('abc');\n * // => false\n *\n * _.isArrayLikeObject(_.noop);\n * // => false\n */\nfunction isArrayLikeObject(value) {\n  return isObjectLike(value) && isArrayLike(value);\n}\n\n/**\n * Checks if `value` is classified as a `Function` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a function, else `false`.\n * @example\n *\n * _.isFunction(_);\n * // => true\n *\n * _.isFunction(/abc/);\n * // => false\n */\nfunction isFunction(value) {\n  // The use of `Object#toString` avoids issues with the `typeof` operator\n  // in Safari 8-9 which returns 'object' for typed array and other constructors.\n  var tag = isObject(value) ? objectToString.call(value) : '';\n  return tag == funcTag || tag == genTag;\n}\n\n/**\n * Checks if `value` is a valid array-like length.\n *\n * **Note:** This method is loosely based on\n * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.\n * @example\n *\n * _.isLength(3);\n * // => true\n *\n * _.isLength(Number.MIN_VALUE);\n * // => false\n *\n * _.isLength(Infinity);\n * // => false\n *\n * _.isLength('3');\n * // => false\n */\nfunction isLength(value) {\n  return typeof value == 'number' &&\n    value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n}\n\n/**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\nfunction isObject(value) {\n  var type = typeof value;\n  return !!value && (type == 'object' || type == 'function');\n}\n\n/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n  return !!value && typeof value == 'object';\n}\n\n/**\n * This method returns `undefined`.\n *\n * @static\n * @memberOf _\n * @since 2.3.0\n * @category Util\n * @example\n *\n * _.times(2, _.noop);\n * // => [undefined, undefined]\n */\nfunction noop() {\n  // No operation performed.\n}\n\nmodule.exports = union;\n","/**\n * lodash (Custom Build) <https://lodash.com/>\n * Build: `lodash modularize exports=\"npm\" -o ./`\n * Copyright jQuery Foundation and other contributors <https://jquery.org/>\n * Released under MIT license <https://lodash.com/license>\n * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>\n * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n */\n\n/** `Object#toString` result references. */\nvar objectTag = '[object Object]';\n\n/**\n * Checks if `value` is a host object in IE < 9.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a host object, else `false`.\n */\nfunction isHostObject(value) {\n  // Many host objects are `Object` objects that can coerce to strings\n  // despite having improperly defined `toString` methods.\n  var result = false;\n  if (value != null && typeof value.toString != 'function') {\n    try {\n      result = !!(value + '');\n    } catch (e) {}\n  }\n  return result;\n}\n\n/**\n * Creates a unary function that invokes `func` with its argument transformed.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {Function} transform The argument transform.\n * @returns {Function} Returns the new function.\n */\nfunction overArg(func, transform) {\n  return function(arg) {\n    return func(transform(arg));\n  };\n}\n\n/** Used for built-in method references. */\nvar funcProto = Function.prototype,\n    objectProto = Object.prototype;\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Used to infer the `Object` constructor. */\nvar objectCtorString = funcToString.call(Object);\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar objectToString = objectProto.toString;\n\n/** Built-in value references. */\nvar getPrototype = overArg(Object.getPrototypeOf, Object);\n\n/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n  return !!value && typeof value == 'object';\n}\n\n/**\n * Checks if `value` is a plain object, that is, an object created by the\n * `Object` constructor or one with a `[[Prototype]]` of `null`.\n *\n * @static\n * @memberOf _\n * @since 0.8.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a plain object, else `false`.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n * }\n *\n * _.isPlainObject(new Foo);\n * // => false\n *\n * _.isPlainObject([1, 2, 3]);\n * // => false\n *\n * _.isPlainObject({ 'x': 0, 'y': 0 });\n * // => true\n *\n * _.isPlainObject(Object.create(null));\n * // => true\n */\nfunction isPlainObject(value) {\n  if (!isObjectLike(value) ||\n      objectToString.call(value) != objectTag || isHostObject(value)) {\n    return false;\n  }\n  var proto = getPrototype(value);\n  if (proto === null) {\n    return true;\n  }\n  var Ctor = hasOwnProperty.call(proto, 'constructor') && proto.constructor;\n  return (typeof Ctor == 'function' &&\n    Ctor instanceof Ctor && funcToString.call(Ctor) == objectCtorString);\n}\n\nmodule.exports = isPlainObject;\n","/**\r\n * archiver-utils\r\n *\r\n * Copyright (c) 2012-2014 Chris Talkington, contributors.\r\n * Licensed under the MIT license.\r\n * https://github.com/archiverjs/node-archiver/blob/master/LICENSE-MIT\r\n */\r\nvar fs = require('graceful-fs');\r\nvar path = require('path');\r\n\r\nvar flatten = require('lodash.flatten');\r\nvar difference = require('lodash.difference');\r\nvar union = require('lodash.union');\r\nvar isPlainObject = require('lodash.isplainobject');\r\n\r\nvar glob = require('glob');\r\n\r\nvar file = module.exports = {};\r\n\r\nvar pathSeparatorRe = /[\\/\\\\]/g;\r\n\r\n// Process specified wildcard glob patterns or filenames against a\r\n// callback, excluding and uniquing files in the result set.\r\nvar processPatterns = function(patterns, fn) {\r\n  // Filepaths to return.\r\n  var result = [];\r\n  // Iterate over flattened patterns array.\r\n  flatten(patterns).forEach(function(pattern) {\r\n    // If the first character is ! it should be omitted\r\n    var exclusion = pattern.indexOf('!') === 0;\r\n    // If the pattern is an exclusion, remove the !\r\n    if (exclusion) { pattern = pattern.slice(1); }\r\n    // Find all matching files for this pattern.\r\n    var matches = fn(pattern);\r\n    if (exclusion) {\r\n      // If an exclusion, remove matching files.\r\n      result = difference(result, matches);\r\n    } else {\r\n      // Otherwise add matching files.\r\n      result = union(result, matches);\r\n    }\r\n  });\r\n  return result;\r\n};\r\n\r\n// True if the file path exists.\r\nfile.exists = function() {\r\n  var filepath = path.join.apply(path, arguments);\r\n  return fs.existsSync(filepath);\r\n};\r\n\r\n// Return an array of all file paths that match the given wildcard patterns.\r\nfile.expand = function(...args) {\r\n  // If the first argument is an options object, save those options to pass\r\n  // into the File.prototype.glob.sync method.\r\n  var options = isPlainObject(args[0]) ? args.shift() : {};\r\n  // Use the first argument if it's an Array, otherwise convert the arguments\r\n  // object to an array and use that.\r\n  var patterns = Array.isArray(args[0]) ? args[0] : args;\r\n  // Return empty set if there are no patterns or filepaths.\r\n  if (patterns.length === 0) { return []; }\r\n  // Return all matching filepaths.\r\n  var matches = processPatterns(patterns, function(pattern) {\r\n    // Find all matching files for this pattern.\r\n    return glob.sync(pattern, options);\r\n  });\r\n  // Filter result set?\r\n  if (options.filter) {\r\n    matches = matches.filter(function(filepath) {\r\n      filepath = path.join(options.cwd || '', filepath);\r\n      try {\r\n        if (typeof options.filter === 'function') {\r\n          return options.filter(filepath);\r\n        } else {\r\n          // If the file is of the right type and exists, this should work.\r\n          return fs.statSync(filepath)[options.filter]();\r\n        }\r\n      } catch(e) {\r\n        // Otherwise, it's probably not the right type.\r\n        return false;\r\n      }\r\n    });\r\n  }\r\n  return matches;\r\n};\r\n\r\n// Build a multi task \"files\" object dynamically.\r\nfile.expandMapping = function(patterns, destBase, options) {\r\n  options = Object.assign({\r\n    rename: function(destBase, destPath) {\r\n      return path.join(destBase || '', destPath);\r\n    }\r\n  }, options);\r\n  var files = [];\r\n  var fileByDest = {};\r\n  // Find all files matching pattern, using passed-in options.\r\n  file.expand(options, patterns).forEach(function(src) {\r\n    var destPath = src;\r\n    // Flatten?\r\n    if (options.flatten) {\r\n      destPath = path.basename(destPath);\r\n    }\r\n    // Change the extension?\r\n    if (options.ext) {\r\n      destPath = destPath.replace(/(\\.[^\\/]*)?$/, options.ext);\r\n    }\r\n    // Generate destination filename.\r\n    var dest = options.rename(destBase, destPath, options);\r\n    // Prepend cwd to src path if necessary.\r\n    if (options.cwd) { src = path.join(options.cwd, src); }\r\n    // Normalize filepaths to be unix-style.\r\n    dest = dest.replace(pathSeparatorRe, '/');\r\n    src = src.replace(pathSeparatorRe, '/');\r\n    // Map correct src path to dest path.\r\n    if (fileByDest[dest]) {\r\n      // If dest already exists, push this src onto that dest's src array.\r\n      fileByDest[dest].src.push(src);\r\n    } else {\r\n      // Otherwise create a new src-dest file mapping object.\r\n      files.push({\r\n        src: [src],\r\n        dest: dest,\r\n      });\r\n      // And store a reference for later use.\r\n      fileByDest[dest] = files[files.length - 1];\r\n    }\r\n  });\r\n  return files;\r\n};\r\n\r\n// reusing bits of grunt's multi-task source normalization\r\nfile.normalizeFilesArray = function(data) {\r\n  var files = [];\r\n\r\n  data.forEach(function(obj) {\r\n    var prop;\r\n    if ('src' in obj || 'dest' in obj) {\r\n      files.push(obj);\r\n    }\r\n  });\r\n\r\n  if (files.length === 0) {\r\n    return [];\r\n  }\r\n\r\n  files = _(files).chain().forEach(function(obj) {\r\n    if (!('src' in obj) || !obj.src) { return; }\r\n    // Normalize .src properties to flattened array.\r\n    if (Array.isArray(obj.src)) {\r\n      obj.src = flatten(obj.src);\r\n    } else {\r\n      obj.src = [obj.src];\r\n    }\r\n  }).map(function(obj) {\r\n    // Build options object, removing unwanted properties.\r\n    var expandOptions = Object.assign({}, obj);\r\n    delete expandOptions.src;\r\n    delete expandOptions.dest;\r\n\r\n    // Expand file mappings.\r\n    if (obj.expand) {\r\n      return file.expandMapping(obj.src, obj.dest, expandOptions).map(function(mapObj) {\r\n        // Copy obj properties to result.\r\n        var result = Object.assign({}, obj);\r\n        // Make a clone of the orig obj available.\r\n        result.orig = Object.assign({}, obj);\r\n        // Set .src and .dest, processing both as templates.\r\n        result.src = mapObj.src;\r\n        result.dest = mapObj.dest;\r\n        // Remove unwanted properties.\r\n        ['expand', 'cwd', 'flatten', 'rename', 'ext'].forEach(function(prop) {\r\n          delete result[prop];\r\n        });\r\n        return result;\r\n      });\r\n    }\r\n\r\n    // Copy obj properties to result, adding an .orig property.\r\n    var result = Object.assign({}, obj);\r\n    // Make a clone of the orig obj available.\r\n    result.orig = Object.assign({}, obj);\r\n\r\n    if ('src' in result) {\r\n      // Expose an expand-on-demand getter method as .src.\r\n      Object.defineProperty(result, 'src', {\r\n        enumerable: true,\r\n        get: function fn() {\r\n          var src;\r\n          if (!('result' in fn)) {\r\n            src = obj.src;\r\n            // If src is an array, flatten it. Otherwise, make it into an array.\r\n            src = Array.isArray(src) ? flatten(src) : [src];\r\n            // Expand src files, memoizing result.\r\n            fn.result = file.expand(expandOptions, src);\r\n          }\r\n          return fn.result;\r\n        }\r\n      });\r\n    }\r\n\r\n    if ('dest' in result) {\r\n      result.dest = obj.dest;\r\n    }\r\n\r\n    return result;\r\n  }).flatten().value();\r\n\r\n  return files;\r\n};\r\n","/**\r\n * archiver-utils\r\n *\r\n * Copyright (c) 2015 Chris Talkington.\r\n * Licensed under the MIT license.\r\n * https://github.com/archiverjs/archiver-utils/blob/master/LICENSE\r\n */\r\nvar fs = require('graceful-fs');\r\nvar path = require('path');\r\nvar nutil = require('util');\r\nvar lazystream = require('lazystream');\r\nvar normalizePath = require('normalize-path');\r\nvar defaults = require('lodash.defaults');\r\n\r\nvar Stream = require('stream').Stream;\r\nvar PassThrough = require('readable-stream').PassThrough;\r\n\r\nvar utils = module.exports = {};\r\nutils.file = require('./file.js');\r\n\r\nfunction assertPath(path) {\r\n  if (typeof path !== 'string') {\r\n    throw new TypeError('Path must be a string. Received ' + nutils.inspect(path));\r\n  }\r\n}\r\n\r\nutils.collectStream = function(source, callback) {\r\n  var collection = [];\r\n  var size = 0;\r\n\r\n  source.on('error', callback);\r\n\r\n  source.on('data', function(chunk) {\r\n    collection.push(chunk);\r\n    size += chunk.length;\r\n  });\r\n\r\n  source.on('end', function() {\r\n    var buf = new Buffer(size);\r\n    var offset = 0;\r\n\r\n    collection.forEach(function(data) {\r\n      data.copy(buf, offset);\r\n      offset += data.length;\r\n    });\r\n\r\n    callback(null, buf);\r\n  });\r\n};\r\n\r\nutils.dateify = function(dateish) {\r\n  dateish = dateish || new Date();\r\n\r\n  if (dateish instanceof Date) {\r\n    dateish = dateish;\r\n  } else if (typeof dateish === 'string') {\r\n    dateish = new Date(dateish);\r\n  } else {\r\n    dateish = new Date();\r\n  }\r\n\r\n  return dateish;\r\n};\r\n\r\n// this is slightly different from lodash version\r\nutils.defaults = function(object, source, guard) {\r\n  var args = arguments;\r\n  args[0] = args[0] || {};\r\n\r\n  return defaults(...args);\r\n};\r\n\r\nutils.isStream = function(source) {\r\n  return source instanceof Stream;\r\n};\r\n\r\nutils.lazyReadStream = function(filepath) {\r\n  return new lazystream.Readable(function() {\r\n    return fs.createReadStream(filepath);\r\n  });\r\n};\r\n\r\nutils.normalizeInputSource = function(source) {\r\n  if (source === null) {\r\n    return new Buffer(0);\r\n  } else if (typeof source === 'string') {\r\n    return new Buffer(source);\r\n  } else if (utils.isStream(source) && !source._readableState) {\r\n    var normalized = new PassThrough();\r\n    source.pipe(normalized);\r\n\r\n    return normalized;\r\n  }\r\n\r\n  return source;\r\n};\r\n\r\nutils.sanitizePath = function(filepath) {\r\n  return normalizePath(filepath, false).replace(/^\\w+:/, '').replace(/^(\\.\\.\\/|\\/)+/, '');\r\n};\r\n\r\nutils.trailingSlashIt = function(str) {\r\n  return str.slice(-1) !== '/' ? str + '/' : str;\r\n};\r\n\r\nutils.unixifyPath = function(filepath) {\r\n  return normalizePath(filepath, false).replace(/^\\w+:/, '');\r\n};\r\n\r\nutils.walkdir = function(dirpath, base, callback) {\r\n  var results = [];\r\n\r\n  if (typeof base === 'function') {\r\n    callback = base;\r\n    base = dirpath;\r\n  }\r\n\r\n  fs.readdir(dirpath, function(err, list) {\r\n    var i = 0;\r\n    var file;\r\n    var filepath;\r\n\r\n    if (err) {\r\n      return callback(err);\r\n    }\r\n\r\n    (function next() {\r\n      file = list[i++];\r\n\r\n      if (!file) {\r\n        return callback(null, results);\r\n      }\r\n\r\n      filepath = path.join(dirpath, file);\r\n\r\n      fs.stat(filepath, function(err, stats) {\r\n        results.push({\r\n          path: filepath,\r\n          relative: path.relative(base, filepath).replace(/\\\\/g, '/'),\r\n          stats: stats\r\n        });\r\n\r\n        if (stats && stats.isDirectory()) {\r\n          utils.walkdir(filepath, base, function(err, res) {\r\n            res.forEach(function(dirEntry) {\r\n              results.push(dirEntry);\r\n            });\r\n            next();\r\n          });\r\n        } else {\r\n          next();\r\n        }\r\n      });\r\n    })();\r\n  });\r\n};\r\n","/**\r\n * Archiver Core\r\n *\r\n * @ignore\r\n * @license [MIT]{@link https://github.com/archiverjs/node-archiver/blob/master/LICENSE}\r\n * @copyright (c) 2012-2014 Chris Talkington, contributors.\r\n */\r\n\r\nvar util = require('util');\r\n\r\nconst ERROR_CODES = {\r\n  'ABORTED': 'archive was aborted',\r\n  'DIRECTORYDIRPATHREQUIRED': 'diretory dirpath argument must be a non-empty string value',\r\n  'DIRECTORYFUNCTIONINVALIDDATA': 'invalid data returned by directory custom data function',\r\n  'ENTRYNAMEREQUIRED': 'entry name must be a non-empty string value',\r\n  'FILEFILEPATHREQUIRED': 'file filepath argument must be a non-empty string value',\r\n  'FINALIZING': 'archive already finalizing',\r\n  'QUEUECLOSED': 'queue closed',\r\n  'NOENDMETHOD': 'no suitable finalize/end method defined by module',\r\n  'DIRECTORYNOTSUPPORTED': 'support for directory entries not defined by module',\r\n  'FORMATSET': 'archive format already set',\r\n  'INPUTSTEAMBUFFERREQUIRED': 'input source must be valid Stream or Buffer instance',\r\n  'MODULESET': 'module already set',\r\n  'SYMLINKNOTSUPPORTED': 'support for symlink entries not defined by module',\r\n  'SYMLINKFILEPATHREQUIRED': 'symlink filepath argument must be a non-empty string value',\r\n  'SYMLINKTARGETREQUIRED': 'symlink target argument must be a non-empty string value',\r\n  'ENTRYNOTSUPPORTED': 'entry not supported'\r\n};\r\n\r\nfunction ArchiverError(code, data) {\r\n  Error.captureStackTrace(this, this.constructor);\r\n  //this.name = this.constructor.name;\r\n  this.message = ERROR_CODES[code] || code;\r\n  this.code = code;\r\n  this.data = data;\r\n}\r\n\r\nutil.inherits(ArchiverError, Error);\r\n\r\nexports = module.exports = ArchiverError;","\n            const Stream = require('stream');\n\n            exports = module.exports = Stream.Readable;\n            exports.Readable = Stream.Readable;\n            exports.Writable = Stream.Writable;\n            exports.Duplex = Stream.Duplex;\n            exports.Transform = Stream.Transform;\n            exports.PassThrough = Stream.PassThrough;\n            exports.Stream = Stream;\n          ","/**\r\n * Archiver Core\r\n *\r\n * @ignore\r\n * @license [MIT]{@link https://github.com/archiverjs/node-archiver/blob/master/LICENSE}\r\n * @copyright (c) 2012-2014 Chris Talkington, contributors.\r\n */\r\nvar fs = require('fs');\r\nvar glob = require('glob');\r\nvar async = require('async');\r\nvar path = require('path');\r\nvar util = require('archiver-utils');\r\n\r\nvar inherits = require('util').inherits;\r\nvar ArchiverError = require('./error');\r\nvar Transform = require('readable-stream').Transform;\r\n\r\nvar win32 = process.platform === 'win32';\r\n\r\n/**\r\n * @constructor\r\n * @param {String} format The archive format to use.\r\n * @param {(CoreOptions|TransformOptions)} options See also {@link ZipOptions} and {@link TarOptions}.\r\n */\r\nvar Archiver = function(format, options) {\r\n  if (!(this instanceof Archiver)) {\r\n    return new Archiver(format, options);\r\n  }\r\n\r\n  if (typeof format !== 'string') {\r\n    options = format;\r\n    format = 'zip';\r\n  }\r\n\r\n  options = this.options = util.defaults(options, {\r\n    highWaterMark: 1024 * 1024,\r\n    statConcurrency: 4\r\n  });\r\n\r\n  Transform.call(this, options);\r\n\r\n  this._format = false;\r\n  this._module = false;\r\n  this._pending = 0;\r\n  this._pointer = 0;\r\n\r\n  this._entriesCount = 0;\r\n  this._entriesProcessedCount = 0;\r\n  this._fsEntriesTotalBytes = 0;\r\n  this._fsEntriesProcessedBytes = 0;\r\n\r\n  this._queue = async.queue(this._onQueueTask.bind(this), 1);\r\n  this._queue.drain = this._onQueueDrain.bind(this);\r\n\r\n  this._statQueue = async.queue(this._onStatQueueTask.bind(this), options.statConcurrency);\r\n\r\n  this._state = {\r\n    aborted: false,\r\n    finalize: false,\r\n    finalizing: false,\r\n    finalized: false,\r\n    modulePiped: false\r\n  };\r\n\r\n  this._streams = [];\r\n};\r\n\r\ninherits(Archiver, Transform);\r\n\r\n/**\r\n * Internal logic for `abort`.\r\n *\r\n * @private\r\n * @return void\r\n */\r\nArchiver.prototype._abort = function() {\r\n  this._state.aborted = true;\r\n  this._queue.kill();\r\n  this._statQueue.kill();\r\n\r\n  if (this._queue.idle()) {\r\n    this._shutdown();\r\n  }\r\n};\r\n\r\n/**\r\n * Internal helper for appending files.\r\n *\r\n * @private\r\n * @param  {String} filepath The source filepath.\r\n * @param  {EntryData} data The entry data.\r\n * @return void\r\n */\r\nArchiver.prototype._append = function(filepath, data) {\r\n  data = data || {};\r\n\r\n  var task = {\r\n    source: null,\r\n    filepath: filepath\r\n  };\r\n\r\n  if (!data.name) {\r\n    data.name = filepath;\r\n  }\r\n\r\n  data.sourcePath = filepath;\r\n  task.data = data;\r\n  this._entriesCount++;\r\n\r\n  if (data.stats && data.stats instanceof fs.Stats) {\r\n    task = this._updateQueueTaskWithStats(task, data.stats);\r\n    if (task) {\r\n      if (data.stats.size) {\r\n        this._fsEntriesTotalBytes += data.stats.size;\r\n      }\r\n\r\n      this._queue.push(task);\r\n    }\r\n  } else {\r\n    this._statQueue.push(task);\r\n  }\r\n};\r\n\r\n/**\r\n * Internal logic for `finalize`.\r\n *\r\n * @private\r\n * @return void\r\n */\r\nArchiver.prototype._finalize = function() {\r\n  if (this._state.finalizing || this._state.finalized || this._state.aborted) {\r\n    return;\r\n  }\r\n\r\n  this._state.finalizing = true;\r\n\r\n  this._moduleFinalize();\r\n\r\n  this._state.finalizing = false;\r\n  this._state.finalized = true;\r\n};\r\n\r\n/**\r\n * Checks the various state variables to determine if we can `finalize`.\r\n *\r\n * @private\r\n * @return {Boolean}\r\n */\r\nArchiver.prototype._maybeFinalize = function() {\r\n  if (this._state.finalizing || this._state.finalized || this._state.aborted) {\r\n    return false;\r\n  }\r\n\r\n  if (this._state.finalize && this._pending === 0 && this._queue.idle() && this._statQueue.idle()) {\r\n    this._finalize();\r\n    return true;\r\n  }\r\n\r\n  return false;\r\n};\r\n\r\n/**\r\n * Appends an entry to the module.\r\n *\r\n * @private\r\n * @fires  Archiver#entry\r\n * @param  {(Buffer|Stream)} source\r\n * @param  {EntryData} data\r\n * @param  {Function} callback\r\n * @return void\r\n */\r\nArchiver.prototype._moduleAppend = function(source, data, callback) {\r\n  if (this._state.aborted) {\r\n    callback();\r\n    return;\r\n  }\r\n\r\n  this._module.append(source, data, function(err) {\r\n    this._task = null;\r\n\r\n    if (this._state.aborted) {\r\n      this._shutdown();\r\n      return;\r\n    }\r\n\r\n    if (err) {\r\n      this.emit('error', err);\r\n      setImmediate(callback);\r\n      return;\r\n    }\r\n\r\n    /**\r\n     * Fires when the entry's input has been processed and appended to the archive.\r\n     *\r\n     * @event Archiver#entry\r\n     * @type {EntryData}\r\n     */\r\n    this.emit('entry', data);\r\n    this._entriesProcessedCount++;\r\n\r\n    if (data.stats && data.stats.size) {\r\n      this._fsEntriesProcessedBytes += data.stats.size;\r\n    }\r\n\r\n    /**\r\n     * @event Archiver#progress\r\n     * @type {ProgressData}\r\n     */\r\n    this.emit('progress', {\r\n      entries: {\r\n        total: this._entriesCount,\r\n        processed: this._entriesProcessedCount\r\n      },\r\n      fs: {\r\n        totalBytes: this._fsEntriesTotalBytes,\r\n        processedBytes: this._fsEntriesProcessedBytes\r\n      }\r\n    });\r\n\r\n    setImmediate(callback);\r\n  }.bind(this));\r\n};\r\n\r\n/**\r\n * Finalizes the module.\r\n *\r\n * @private\r\n * @return void\r\n */\r\nArchiver.prototype._moduleFinalize = function() {\r\n  if (typeof this._module.finalize === 'function') {\r\n    this._module.finalize();\r\n  } else if (typeof this._module.end === 'function') {\r\n    this._module.end();\r\n  } else {\r\n    this.emit('error', new ArchiverError('NOENDMETHOD'));\r\n  }\r\n};\r\n\r\n/**\r\n * Pipes the module to our internal stream with error bubbling.\r\n *\r\n * @private\r\n * @return void\r\n */\r\nArchiver.prototype._modulePipe = function() {\r\n  this._module.on('error', this._onModuleError.bind(this));\r\n  this._module.pipe(this);\r\n  this._state.modulePiped = true;\r\n};\r\n\r\n/**\r\n * Determines if the current module supports a defined feature.\r\n *\r\n * @private\r\n * @param  {String} key\r\n * @return {Boolean}\r\n */\r\nArchiver.prototype._moduleSupports = function(key) {\r\n  if (!this._module.supports || !this._module.supports[key]) {\r\n    return false;\r\n  }\r\n\r\n  return this._module.supports[key];\r\n};\r\n\r\n/**\r\n * Unpipes the module from our internal stream.\r\n *\r\n * @private\r\n * @return void\r\n */\r\nArchiver.prototype._moduleUnpipe = function() {\r\n  this._module.unpipe(this);\r\n  this._state.modulePiped = false;\r\n};\r\n\r\n/**\r\n * Normalizes entry data with fallbacks for key properties.\r\n *\r\n * @private\r\n * @param  {Object} data\r\n * @param  {fs.Stats} stats\r\n * @return {Object}\r\n */\r\nArchiver.prototype._normalizeEntryData = function(data, stats) {\r\n  data = util.defaults(data, {\r\n    type: 'file',\r\n    name: null,\r\n    date: null,\r\n    mode: null,\r\n    prefix: null,\r\n    sourcePath: null,\r\n    stats: false\r\n  });\r\n\r\n  if (stats && data.stats === false) {\r\n    data.stats = stats;\r\n  }\r\n\r\n  var isDir = data.type === 'directory';\r\n\r\n  if (data.name) {\r\n    if (typeof data.prefix === 'string' && '' !== data.prefix) {\r\n      data.name = data.prefix + '/' + data.name;\r\n      data.prefix = null;\r\n    }\r\n\r\n    data.name = util.sanitizePath(data.name);\r\n\r\n    if (data.type !== 'symlink' && data.name.slice(-1) === '/') {\r\n      isDir = true;\r\n      data.type = 'directory';\r\n    } else if (isDir) {\r\n      data.name += '/';\r\n    }\r\n  }\r\n\r\n  // 511 === 0777; 493 === 0755; 438 === 0666; 420 === 0644\r\n  if (typeof data.mode === 'number') {\r\n    if (win32) {\r\n      data.mode &= 511;\r\n    } else {\r\n      data.mode &= 4095\r\n    }\r\n  } else if (data.stats && data.mode === null) {\r\n    if (win32) {\r\n      data.mode = data.stats.mode & 511;\r\n    } else {\r\n      data.mode = data.stats.mode & 4095;\r\n    }\r\n\r\n    // stat isn't reliable on windows; force 0755 for dir\r\n    if (win32 && isDir) {\r\n      data.mode = 493;\r\n    }\r\n  } else if (data.mode === null) {\r\n    data.mode = isDir ? 493 : 420;\r\n  }\r\n\r\n  if (data.stats && data.date === null) {\r\n    data.date = data.stats.mtime;\r\n  } else {\r\n    data.date = util.dateify(data.date);\r\n  }\r\n\r\n  return data;\r\n};\r\n\r\n/**\r\n * Error listener that re-emits error on to our internal stream.\r\n *\r\n * @private\r\n * @param  {Error} err\r\n * @return void\r\n */\r\nArchiver.prototype._onModuleError = function(err) {\r\n  /**\r\n   * @event Archiver#error\r\n   * @type {ErrorData}\r\n   */\r\n  this.emit('error', err);\r\n};\r\n\r\n/**\r\n * Checks the various state variables after queue has drained to determine if\r\n * we need to `finalize`.\r\n *\r\n * @private\r\n * @return void\r\n */\r\nArchiver.prototype._onQueueDrain = function() {\r\n  if (this._state.finalizing || this._state.finalized || this._state.aborted) {\r\n    return;\r\n  }\r\n\r\n  if (this._state.finalize && this._pending === 0 && this._queue.idle() && this._statQueue.idle()) {\r\n    this._finalize();\r\n  }\r\n};\r\n\r\n/**\r\n * Appends each queue task to the module.\r\n *\r\n * @private\r\n * @param  {Object} task\r\n * @param  {Function} callback\r\n * @return void\r\n */\r\nArchiver.prototype._onQueueTask = function(task, callback) {\r\n  if (this._state.finalizing || this._state.finalized || this._state.aborted) {\r\n    callback();\r\n    return;\r\n  }\r\n\r\n  this._task = task;\r\n  this._moduleAppend(task.source, task.data, callback);\r\n};\r\n\r\n/**\r\n * Performs a file stat and reinjects the task back into the queue.\r\n *\r\n * @private\r\n * @param  {Object} task\r\n * @param  {Function} callback\r\n * @return void\r\n */\r\nArchiver.prototype._onStatQueueTask = function(task, callback) {\r\n  if (this._state.finalizing || this._state.finalized || this._state.aborted) {\r\n    callback();\r\n    return;\r\n  }\r\n\r\n  fs.lstat(task.filepath, function(err, stats) {\r\n    if (this._state.aborted) {\r\n      setImmediate(callback);\r\n      return;\r\n    }\r\n\r\n    if (err) {\r\n      this._entriesCount--;\r\n\r\n      /**\r\n       * @event Archiver#warning\r\n       * @type {ErrorData}\r\n       */\r\n      this.emit('warning', err);\r\n      setImmediate(callback);\r\n      return;\r\n    }\r\n\r\n    task = this._updateQueueTaskWithStats(task, stats);\r\n\r\n    if (task) {\r\n      if (stats.size) {\r\n        this._fsEntriesTotalBytes += stats.size;\r\n      }\r\n\r\n      this._queue.push(task);\r\n    }\r\n\r\n    setImmediate(callback);\r\n  }.bind(this));\r\n};\r\n\r\n/**\r\n * Unpipes the module and ends our internal stream.\r\n *\r\n * @private\r\n * @return void\r\n */\r\nArchiver.prototype._shutdown = function() {\r\n  this._moduleUnpipe();\r\n  this.end();\r\n};\r\n\r\n/**\r\n * Tracks the bytes emitted by our internal stream.\r\n *\r\n * @private\r\n * @param  {Buffer} chunk\r\n * @param  {String} encoding\r\n * @param  {Function} callback\r\n * @return void\r\n */\r\nArchiver.prototype._transform = function(chunk, encoding, callback) {\r\n  if (chunk) {\r\n    this._pointer += chunk.length;\r\n  }\r\n\r\n  callback(null, chunk);\r\n};\r\n\r\n/**\r\n * Updates and normalizes a queue task using stats data.\r\n *\r\n * @private\r\n * @param  {Object} task\r\n * @param  {fs.Stats} stats\r\n * @return {Object}\r\n */\r\nArchiver.prototype._updateQueueTaskWithStats = function(task, stats) {\r\n  if (stats.isFile()) {\r\n    task.data.type = 'file';\r\n    task.data.sourceType = 'stream';\r\n    task.source = util.lazyReadStream(task.filepath);\r\n  } else if (stats.isDirectory() && this._moduleSupports('directory')) {\r\n    task.data.name = util.trailingSlashIt(task.data.name);\r\n    task.data.type = 'directory';\r\n    task.data.sourcePath = util.trailingSlashIt(task.filepath);\r\n    task.data.sourceType = 'buffer';\r\n    task.source = Buffer.concat([]);\r\n  } else if (stats.isSymbolicLink() && this._moduleSupports('symlink')) {\r\n    var linkPath = fs.readlinkSync(task.filepath);\r\n    var dirName = path.dirname(task.filepath);\r\n    task.data.type = 'symlink';\r\n    task.data.linkname = path.relative(dirName, path.resolve(dirName, linkPath));\r\n    task.data.sourceType = 'buffer';\r\n    task.source = Buffer.concat([]);\r\n  } else {\r\n    if (stats.isDirectory()) {\r\n      this.emit('warning', new ArchiverError('DIRECTORYNOTSUPPORTED', task.data));\r\n    } else if (stats.isSymbolicLink()) {\r\n      this.emit('warning', new ArchiverError('SYMLINKNOTSUPPORTED', task.data));\r\n    } else {\r\n      this.emit('warning', new ArchiverError('ENTRYNOTSUPPORTED', task.data));\r\n    }\r\n\r\n    return null;\r\n  }\r\n\r\n  task.data = this._normalizeEntryData(task.data, stats);\r\n\r\n  return task;\r\n};\r\n\r\n/**\r\n * Aborts the archiving process, taking a best-effort approach, by:\r\n *\r\n * - removing any pending queue tasks\r\n * - allowing any active queue workers to finish\r\n * - detaching internal module pipes\r\n * - ending both sides of the Transform stream\r\n *\r\n * It will NOT drain any remaining sources.\r\n *\r\n * @return {this}\r\n */\r\nArchiver.prototype.abort = function() {\r\n  if (this._state.aborted || this._state.finalized) {\r\n    return this;\r\n  }\r\n\r\n  this._abort();\r\n\r\n  return this;\r\n};\r\n\r\n/**\r\n * Appends an input source (text string, buffer, or stream) to the instance.\r\n *\r\n * When the instance has received, processed, and emitted the input, the `entry`\r\n * event is fired.\r\n *\r\n * @fires  Archiver#entry\r\n * @param  {(Buffer|Stream|String)} source The input source.\r\n * @param  {EntryData} data See also {@link ZipEntryData} and {@link TarEntryData}.\r\n * @return {this}\r\n */\r\nArchiver.prototype.append = function(source, data) {\r\n  if (this._state.finalize || this._state.aborted) {\r\n    this.emit('error', new ArchiverError('QUEUECLOSED'));\r\n    return this;\r\n  }\r\n\r\n  data = this._normalizeEntryData(data);\r\n\r\n  if (typeof data.name !== 'string' || data.name.length === 0) {\r\n    this.emit('error', new ArchiverError('ENTRYNAMEREQUIRED'));\r\n    return this;\r\n  }\r\n\r\n  if (data.type === 'directory' && !this._moduleSupports('directory')) {\r\n    this.emit('error', new ArchiverError('DIRECTORYNOTSUPPORTED', { name: data.name }));\r\n    return this;\r\n  }\r\n\r\n  source = util.normalizeInputSource(source);\r\n\r\n  if (Buffer.isBuffer(source)) {\r\n    data.sourceType = 'buffer';\r\n  } else if (util.isStream(source)) {\r\n    data.sourceType = 'stream';\r\n  } else {\r\n    this.emit('error', new ArchiverError('INPUTSTEAMBUFFERREQUIRED', { name: data.name }));\r\n    return this;\r\n  }\r\n\r\n  this._entriesCount++;\r\n  this._queue.push({\r\n    data: data,\r\n    source: source\r\n  });\r\n\r\n  return this;\r\n};\r\n\r\n/**\r\n * Appends a directory and its files, recursively, given its dirpath.\r\n *\r\n * @param  {String} dirpath The source directory path.\r\n * @param  {String} destpath The destination path within the archive.\r\n * @param  {(EntryData|Function)} data See also [ZipEntryData]{@link ZipEntryData} and\r\n * [TarEntryData]{@link TarEntryData}.\r\n * @return {this}\r\n */\r\nArchiver.prototype.directory = function(dirpath, destpath, data) {\r\n  if (this._state.finalize || this._state.aborted) {\r\n    this.emit('error', new ArchiverError('QUEUECLOSED'));\r\n    return this;\r\n  }\r\n\r\n  if (typeof dirpath !== 'string' || dirpath.length === 0) {\r\n    this.emit('error', new ArchiverError('DIRECTORYDIRPATHREQUIRED'));\r\n    return this;\r\n  }\r\n\r\n  this._pending++;\r\n\r\n  if (destpath === false) {\r\n    destpath = '';\r\n  } else if (typeof destpath !== 'string'){\r\n    destpath = dirpath;\r\n  }\r\n\r\n  var dataFunction = false;\r\n  if (typeof data === 'function') {\r\n    dataFunction = data;\r\n    data = {};\r\n  } else if (typeof data !== 'object') {\r\n    data = {};\r\n  }\r\n\r\n  var globOptions = {\r\n    stat: false,\r\n    dot: true,\r\n    cwd: dirpath\r\n  };\r\n\r\n  function onGlobEnd() {\r\n    this._pending--;\r\n    this._maybeFinalize();\r\n  }\r\n\r\n  function onGlobError(err) {\r\n    this.emit('error', err);\r\n  }\r\n\r\n  function onGlobMatch(match){\r\n    var ignoreMatch = false;\r\n    var entryData = Object.assign({}, data);\r\n    entryData.name = match;\r\n    entryData.prefix = destpath;\r\n    match = globber._makeAbs(match);\r\n\r\n    try {\r\n      if (dataFunction) {\r\n        entryData = dataFunction(entryData);\r\n\r\n        if (entryData === false) {\r\n          ignoreMatch = true;\r\n        } else if (typeof entryData !== 'object') {\r\n          throw new ArchiverError('DIRECTORYFUNCTIONINVALIDDATA', { dirpath: dirpath });\r\n        }\r\n      }\r\n    } catch(e) {\r\n      this.emit('error', e);\r\n      return;\r\n    }\r\n\r\n    if (ignoreMatch) {\r\n      return;\r\n    }\r\n\r\n    this._append(match, entryData);\r\n  }\r\n\r\n  var globber = glob('**', globOptions);\r\n  globber.on('error', onGlobError.bind(this));\r\n  globber.on('match', onGlobMatch.bind(this));\r\n  globber.on('end', onGlobEnd.bind(this));\r\n\r\n  return this;\r\n};\r\n\r\n/**\r\n * Appends a file given its filepath using a\r\n * [lazystream]{@link https://github.com/jpommerening/node-lazystream} wrapper to\r\n * prevent issues with open file limits.\r\n *\r\n * When the instance has received, processed, and emitted the file, the `entry`\r\n * event is fired.\r\n *\r\n * @param  {String} filepath The source filepath.\r\n * @param  {EntryData} data See also [ZipEntryData]{@link ZipEntryData} and\r\n * [TarEntryData]{@link TarEntryData}.\r\n * @return {this}\r\n */\r\nArchiver.prototype.file = function(filepath, data) {\r\n  if (this._state.finalize || this._state.aborted) {\r\n    this.emit('error', new ArchiverError('QUEUECLOSED'));\r\n    return this;\r\n  }\r\n\r\n  if (typeof filepath !== 'string' || filepath.length === 0) {\r\n    this.emit('error', new ArchiverError('FILEFILEPATHREQUIRED'));\r\n    return this;\r\n  }\r\n\r\n  this._append(filepath, data);\r\n\r\n  return this;\r\n};\r\n\r\n/**\r\n * Appends multiple files that match a glob pattern.\r\n *\r\n * @param  {String} pattern The [glob pattern]{@link https://github.com/isaacs/node-glob#glob-primer} to match.\r\n * @param  {Object} options See [node-glob]{@link https://github.com/isaacs/node-glob#options}.\r\n * @param  {EntryData} data See also [ZipEntryData]{@link ZipEntryData} and\r\n * [TarEntryData]{@link TarEntryData}.\r\n * @return {this}\r\n */\r\nArchiver.prototype.glob = function(pattern, options, data) {\r\n  this._pending++;\r\n\r\n  options = util.defaults(options, {\r\n    stat: false\r\n  });\r\n\r\n  function onGlobEnd() {\r\n    this._pending--;\r\n    this._maybeFinalize();\r\n  }\r\n\r\n  function onGlobError(err) {\r\n    this.emit('error', err);\r\n  }\r\n\r\n  function onGlobMatch(match){\r\n    var entryData = Object.assign({}, data);\r\n\r\n    if (options.cwd) {\r\n      entryData.name = match;\r\n      match = globber._makeAbs(match);\r\n    }\r\n\r\n    this._append(match, entryData);\r\n  }\r\n\r\n  var globber = glob(pattern, options);\r\n  globber.on('error', onGlobError.bind(this));\r\n  globber.on('match', onGlobMatch.bind(this));\r\n  globber.on('end', onGlobEnd.bind(this));\r\n\r\n  return this;\r\n};\r\n\r\n/**\r\n * Finalizes the instance and prevents further appending to the archive\r\n * structure (queue will continue til drained).\r\n *\r\n * The `end`, `close` or `finish` events on the destination stream may fire\r\n * right after calling this method so you should set listeners beforehand to\r\n * properly detect stream completion.\r\n *\r\n * @return {this}\r\n */\r\nArchiver.prototype.finalize = function() {\r\n  if (this._state.aborted) {\r\n    this.emit('error', new ArchiverError('ABORTED'));\r\n    return this;\r\n  }\r\n\r\n  if (this._state.finalize) {\r\n    this.emit('error', new ArchiverError('FINALIZING'));\r\n    return this;\r\n  }\r\n\r\n  this._state.finalize = true;\r\n\r\n  if (this._pending === 0 && this._queue.idle() && this._statQueue.idle()) {\r\n    this._finalize();\r\n  }\r\n\r\n  var self = this;\r\n\r\n  return new Promise(function(resolve, reject) {\r\n    var errored;\r\n\r\n    self._module.on('end', function() {\r\n      if (!errored) {\r\n        resolve();\r\n      }\r\n    })\r\n\r\n    self._module.on('error', function(err) {\r\n      errored = true;\r\n      reject(err);\r\n    })\r\n  })\r\n};\r\n\r\n/**\r\n * Sets the module format name used for archiving.\r\n *\r\n * @param {String} format The name of the format.\r\n * @return {this}\r\n */\r\nArchiver.prototype.setFormat = function(format) {\r\n  if (this._format) {\r\n    this.emit('error', new ArchiverError('FORMATSET'));\r\n    return this;\r\n  }\r\n\r\n  this._format = format;\r\n\r\n  return this;\r\n};\r\n\r\n/**\r\n * Sets the module used for archiving.\r\n *\r\n * @param {Function} module The function for archiver to interact with.\r\n * @return {this}\r\n */\r\nArchiver.prototype.setModule = function(module) {\r\n  if (this._state.aborted) {\r\n    this.emit('error', new ArchiverError('ABORTED'));\r\n    return this;\r\n  }\r\n\r\n  if (this._state.module) {\r\n    this.emit('error', new ArchiverError('MODULESET'));\r\n    return this;\r\n  }\r\n\r\n  this._module = module;\r\n  this._modulePipe();\r\n\r\n  return this;\r\n};\r\n\r\n/**\r\n * Appends a symlink to the instance.\r\n *\r\n * This does NOT interact with filesystem and is used for programmatically creating symlinks.\r\n *\r\n * @param  {String} filepath The symlink path (within archive).\r\n * @param  {String} target The target path (within archive).\r\n * @return {this}\r\n */\r\nArchiver.prototype.symlink = function(filepath, target) {\r\n  if (this._state.finalize || this._state.aborted) {\r\n    this.emit('error', new ArchiverError('QUEUECLOSED'));\r\n    return this;\r\n  }\r\n\r\n  if (typeof filepath !== 'string' || filepath.length === 0) {\r\n    this.emit('error', new ArchiverError('SYMLINKFILEPATHREQUIRED'));\r\n    return this;\r\n  }\r\n\r\n  if (typeof target !== 'string' || target.length === 0) {\r\n    this.emit('error', new ArchiverError('SYMLINKTARGETREQUIRED', { filepath: filepath }));\r\n    return this;\r\n  }\r\n\r\n  if (!this._moduleSupports('symlink')) {\r\n    this.emit('error', new ArchiverError('SYMLINKNOTSUPPORTED', { filepath: filepath }));\r\n    return this;\r\n  }\r\n\r\n  var data = {};\r\n  data.type = 'symlink';\r\n  data.name = filepath.replace(/\\\\/g, '/');\r\n  data.linkname = target.replace(/\\\\/g, '/');\r\n  data.sourceType = 'buffer';\r\n\r\n  this._entriesCount++;\r\n  this._queue.push({\r\n    data: data,\r\n    source: Buffer.concat([])\r\n  });\r\n\r\n  return this;\r\n};\r\n\r\n/**\r\n * Returns the current length (in bytes) that has been emitted.\r\n *\r\n * @return {Number}\r\n */\r\nArchiver.prototype.pointer = function() {\r\n  return this._pointer;\r\n};\r\n\r\n/**\r\n * Middleware-like helper that has yet to be fully implemented.\r\n *\r\n * @private\r\n * @param  {Function} plugin\r\n * @return {this}\r\n */\r\nArchiver.prototype.use = function(plugin) {\r\n  this._streams.push(plugin);\r\n  return this;\r\n};\r\n\r\nmodule.exports = Archiver;\r\n\r\n/**\r\n * @typedef {Object} CoreOptions\r\n * @global\r\n * @property {Number} [statConcurrency=4] Sets the number of workers used to\r\n * process the internal fs stat queue.\r\n */\r\n\r\n/**\r\n * @typedef {Object} TransformOptions\r\n * @property {Boolean} [allowHalfOpen=true] If set to false, then the stream\r\n * will automatically end the readable side when the writable side ends and vice\r\n * versa.\r\n * @property {Boolean} [readableObjectMode=false] Sets objectMode for readable\r\n * side of the stream. Has no effect if objectMode is true.\r\n * @property {Boolean} [writableObjectMode=false] Sets objectMode for writable\r\n * side of the stream. Has no effect if objectMode is true.\r\n * @property {Boolean} [decodeStrings=true] Whether or not to decode strings\r\n * into Buffers before passing them to _write(). `Writable`\r\n * @property {String} [encoding=NULL] If specified, then buffers will be decoded\r\n * to strings using the specified encoding. `Readable`\r\n * @property {Number} [highWaterMark=16kb] The maximum number of bytes to store\r\n * in the internal buffer before ceasing to read from the underlying resource.\r\n * `Readable` `Writable`\r\n * @property {Boolean} [objectMode=false] Whether this stream should behave as a\r\n * stream of objects. Meaning that stream.read(n) returns a single value instead\r\n * of a Buffer of size n. `Readable` `Writable`\r\n */\r\n\r\n/**\r\n * @typedef {Object} EntryData\r\n * @property {String} name Sets the entry name including internal path.\r\n * @property {(String|Date)} [date=NOW()] Sets the entry date.\r\n * @property {Number} [mode=D:0755/F:0644] Sets the entry permissions.\r\n * @property {String} [prefix] Sets a path prefix for the entry name. Useful\r\n * when working with methods like `directory` or `glob`.\r\n * @property {fs.Stats} [stats] Sets the fs stat data for this entry allowing\r\n * for reduction of fs stat calls when stat data is already known.\r\n */\r\n\r\n/**\r\n * @typedef {Object} ErrorData\r\n * @property {String} message The message of the error.\r\n * @property {String} code The error code assigned to this error.\r\n * @property {String} data Additional data provided for reporting or debugging (where available).\r\n */\r\n\r\n/**\r\n * @typedef {Object} ProgressData\r\n * @property {Object} entries\r\n * @property {Number} entries.total Number of entries that have been appended.\r\n * @property {Number} entries.processed Number of entries that have been processed.\r\n * @property {Object} fs\r\n * @property {Number} fs.totalBytes Number of bytes that have been appended. Calculated asynchronously and might not be accurate: it growth while entries are added. (based on fs.Stats)\r\n * @property {Number} fs.processedBytes Number of bytes that have been processed. (based on fs.Stats)\r\n */\r\n","/**\r\n * node-compress-commons\r\n *\r\n * Copyright (c) 2014 Chris Talkington, contributors.\r\n * Licensed under the MIT license.\r\n * https://github.com/archiverjs/node-compress-commons/blob/master/LICENSE-MIT\r\n */\r\nvar ArchiveEntry = module.exports = function() {};\r\n\r\nArchiveEntry.prototype.getName = function() {};\r\n\r\nArchiveEntry.prototype.getSize = function() {};\r\n\r\nArchiveEntry.prototype.getLastModifiedDate = function() {};\r\n\r\nArchiveEntry.prototype.isDirectory = function() {};","/**\r\n * node-compress-commons\r\n *\r\n * Copyright (c) 2014 Chris Talkington, contributors.\r\n * Licensed under the MIT license.\r\n * https://github.com/archiverjs/node-compress-commons/blob/master/LICENSE-MIT\r\n */\r\nvar util = module.exports = {};\r\n\r\nutil.dateToDos = function(d, forceLocalTime) {\r\n  forceLocalTime = forceLocalTime || false;\r\n\r\n  var year = forceLocalTime ? d.getFullYear() : d.getUTCFullYear();\r\n\r\n  if (year < 1980) {\r\n    return 2162688; // 1980-1-1 00:00:00\r\n  } else if (year >= 2044) {\r\n    return 2141175677; // 2043-12-31 23:59:58\r\n  }\r\n\r\n  var val = {\r\n    year: year,\r\n    month: forceLocalTime ? d.getMonth() : d.getUTCMonth(),\r\n    date: forceLocalTime ? d.getDate() : d.getUTCDate(),\r\n    hours: forceLocalTime ? d.getHours() : d.getUTCHours(),\r\n    minutes: forceLocalTime ? d.getMinutes() : d.getUTCMinutes(),\r\n    seconds: forceLocalTime ? d.getSeconds() : d.getUTCSeconds()\r\n  };\r\n\r\n  return ((val.year - 1980) << 25) | ((val.month + 1) << 21) | (val.date << 16) |\r\n    (val.hours << 11) | (val.minutes << 5) | (val.seconds / 2);\r\n};\r\n\r\nutil.dosToDate = function(dos) {\r\n  return new Date(((dos >> 25) & 0x7f) + 1980, ((dos >> 21) & 0x0f) - 1, (dos >> 16) & 0x1f, (dos >> 11) & 0x1f, (dos >> 5) & 0x3f, (dos & 0x1f) << 1);\r\n};\r\n\r\nutil.fromDosTime = function(buf) {\r\n  return util.dosToDate(buf.readUInt32LE(0));\r\n};\r\n\r\nutil.getEightBytes = function(v) {\r\n  var buf = Buffer.alloc(8);\r\n  buf.writeUInt32LE(v % 0x0100000000, 0);\r\n  buf.writeUInt32LE((v / 0x0100000000) | 0, 4);\r\n\r\n  return buf;\r\n};\r\n\r\nutil.getShortBytes = function(v) {\r\n  var buf = Buffer.alloc(2);\r\n  buf.writeUInt16LE((v & 0xFFFF) >>> 0, 0);\r\n\r\n  return buf;\r\n};\r\n\r\nutil.getShortBytesValue = function(buf, offset) {\r\n  return buf.readUInt16LE(offset);\r\n};\r\n\r\nutil.getLongBytes = function(v) {\r\n  var buf = Buffer.alloc(4);\r\n  buf.writeUInt32LE((v & 0xFFFFFFFF) >>> 0, 0);\r\n\r\n  return buf;\r\n};\r\n\r\nutil.getLongBytesValue = function(buf, offset) {\r\n  return buf.readUInt32LE(offset);\r\n};\r\n\r\nutil.toDosTime = function(d) {\r\n  return util.getLongBytes(util.dateToDos(d));\r\n};","/**\r\n * node-compress-commons\r\n *\r\n * Copyright (c) 2014 Chris Talkington, contributors.\r\n * Licensed under the MIT license.\r\n * https://github.com/archiverjs/node-compress-commons/blob/master/LICENSE-MIT\r\n */\r\nvar zipUtil = require('./util');\r\n\r\nvar DATA_DESCRIPTOR_FLAG = 1 << 3;\r\nvar ENCRYPTION_FLAG = 1 << 0;\r\nvar NUMBER_OF_SHANNON_FANO_TREES_FLAG = 1 << 2;\r\nvar SLIDING_DICTIONARY_SIZE_FLAG = 1 << 1;\r\nvar STRONG_ENCRYPTION_FLAG = 1 << 6;\r\nvar UFT8_NAMES_FLAG = 1 << 11;\r\n\r\nvar GeneralPurposeBit = module.exports = function() {\r\n  if (!(this instanceof GeneralPurposeBit)) {\r\n    return new GeneralPurposeBit();\r\n  }\r\n\r\n  this.descriptor = false;\r\n  this.encryption = false;\r\n  this.utf8 = false;\r\n  this.numberOfShannonFanoTrees = 0;\r\n  this.strongEncryption = false;\r\n  this.slidingDictionarySize = 0;\r\n\r\n  return this;\r\n};\r\n\r\nGeneralPurposeBit.prototype.encode = function() {\r\n  return zipUtil.getShortBytes(\r\n    (this.descriptor ? DATA_DESCRIPTOR_FLAG : 0) |\r\n    (this.utf8 ? UFT8_NAMES_FLAG : 0) |\r\n    (this.encryption ? ENCRYPTION_FLAG : 0) |\r\n    (this.strongEncryption ? STRONG_ENCRYPTION_FLAG : 0)\r\n  );\r\n};\r\n\r\nGeneralPurposeBit.prototype.parse = function(buf, offset) {\r\n  var flag = zipUtil.getShortBytesValue(buf, offset);\r\n  var gbp = new GeneralPurposeBit();\r\n\r\n  gbp.useDataDescriptor((flag & DATA_DESCRIPTOR_FLAG) !== 0);\r\n  gbp.useUTF8ForNames((flag & UFT8_NAMES_FLAG) !== 0);\r\n  gbp.useStrongEncryption((flag & STRONG_ENCRYPTION_FLAG) !== 0);\r\n  gbp.useEncryption((flag & ENCRYPTION_FLAG) !== 0);\r\n  gbp.setSlidingDictionarySize((flag & SLIDING_DICTIONARY_SIZE_FLAG) !== 0 ? 8192 : 4096);\r\n  gbp.setNumberOfShannonFanoTrees((flag & NUMBER_OF_SHANNON_FANO_TREES_FLAG) !== 0 ? 3 : 2);\r\n\r\n  return gbp;\r\n};\r\n\r\nGeneralPurposeBit.prototype.setNumberOfShannonFanoTrees = function(n) {\r\n  this.numberOfShannonFanoTrees = n;\r\n};\r\n\r\nGeneralPurposeBit.prototype.getNumberOfShannonFanoTrees = function() {\r\n  return this.numberOfShannonFanoTrees;\r\n};\r\n\r\nGeneralPurposeBit.prototype.setSlidingDictionarySize = function(n) {\r\n  this.slidingDictionarySize = n;\r\n};\r\n\r\nGeneralPurposeBit.prototype.getSlidingDictionarySize = function() {\r\n  return this.slidingDictionarySize;\r\n};\r\n\r\nGeneralPurposeBit.prototype.useDataDescriptor = function(b) {\r\n  this.descriptor = b;\r\n};\r\n\r\nGeneralPurposeBit.prototype.usesDataDescriptor = function() {\r\n  return this.descriptor;\r\n};\r\n\r\nGeneralPurposeBit.prototype.useEncryption = function(b) {\r\n  this.encryption = b;\r\n};\r\n\r\nGeneralPurposeBit.prototype.usesEncryption = function() {\r\n  return this.encryption;\r\n};\r\n\r\nGeneralPurposeBit.prototype.useStrongEncryption = function(b) {\r\n  this.strongEncryption = b;\r\n};\r\n\r\nGeneralPurposeBit.prototype.usesStrongEncryption = function() {\r\n  return this.strongEncryption;\r\n};\r\n\r\nGeneralPurposeBit.prototype.useUTF8ForNames = function(b) {\r\n  this.utf8 = b;\r\n};\r\n\r\nGeneralPurposeBit.prototype.usesUTF8ForNames = function() {\r\n  return this.utf8;\r\n};","/**\r\n * node-compress-commons\r\n *\r\n * Copyright (c) 2014 Chris Talkington, contributors.\r\n * Licensed under the MIT license.\r\n * https://github.com/archiverjs/node-compress-commons/blob/master/LICENSE-MIT\r\n */\r\nmodule.exports = {\r\n    /**\r\n     * Bits used for permissions (and sticky bit)\r\n     */\r\n    PERM_MASK: 4095, // 07777\r\n\r\n    /**\r\n     * Bits used to indicate the filesystem object type.\r\n     */\r\n    FILE_TYPE_FLAG: 61440, // 0170000\r\n\r\n    /**\r\n     * Indicates symbolic links.\r\n     */\r\n    LINK_FLAG: 40960, // 0120000\r\n\r\n    /**\r\n     * Indicates plain files.\r\n     */\r\n    FILE_FLAG: 32768, // 0100000\r\n\r\n    /**\r\n     * Indicates directories.\r\n     */\r\n    DIR_FLAG: 16384, // 040000\r\n\r\n    // ----------------------------------------------------------\r\n    // somewhat arbitrary choices that are quite common for shared\r\n    // installations\r\n    // -----------------------------------------------------------\r\n\r\n    /**\r\n     * Default permissions for symbolic links.\r\n     */\r\n    DEFAULT_LINK_PERM: 511, // 0777\r\n\r\n    /**\r\n     * Default permissions for directories.\r\n     */\r\n    DEFAULT_DIR_PERM: 493, // 0755\r\n\r\n    /**\r\n     * Default permissions for plain files.\r\n     */\r\n    DEFAULT_FILE_PERM: 420 // 0644\r\n};","/**\r\n * node-compress-commons\r\n *\r\n * Copyright (c) 2014 Chris Talkington, contributors.\r\n * Licensed under the MIT license.\r\n * https://github.com/archiverjs/node-compress-commons/blob/master/LICENSE-MIT\r\n */\r\nmodule.exports = {\r\n  WORD: 4,\r\n  DWORD: 8,\r\n  EMPTY: Buffer.alloc(0),\r\n\r\n  SHORT: 2,\r\n  SHORT_MASK: 0xffff,\r\n  SHORT_SHIFT: 16,\r\n  SHORT_ZERO: Buffer.from(Array(2)),\r\n  LONG: 4,\r\n  LONG_ZERO: Buffer.from(Array(4)),\r\n\r\n  MIN_VERSION_INITIAL: 10,\r\n  MIN_VERSION_DATA_DESCRIPTOR: 20,\r\n  MIN_VERSION_ZIP64: 45,\r\n  VERSION_MADEBY: 45,\r\n\r\n  METHOD_STORED: 0,\r\n  METHOD_DEFLATED: 8,\r\n\r\n  PLATFORM_UNIX: 3,\r\n  PLATFORM_FAT: 0,\r\n\r\n  SIG_LFH: 0x04034b50,\r\n  SIG_DD: 0x08074b50,\r\n  SIG_CFH: 0x02014b50,\r\n  SIG_EOCD: 0x06054b50,\r\n  SIG_ZIP64_EOCD: 0x06064B50,\r\n  SIG_ZIP64_EOCD_LOC: 0x07064B50,\r\n\r\n  ZIP64_MAGIC_SHORT: 0xffff,\r\n  ZIP64_MAGIC: 0xffffffff,\r\n  ZIP64_EXTRA_ID: 0x0001,\r\n\r\n  ZLIB_NO_COMPRESSION: 0,\r\n  ZLIB_BEST_SPEED: 1,\r\n  ZLIB_BEST_COMPRESSION: 9,\r\n  ZLIB_DEFAULT_COMPRESSION: -1,\r\n\r\n  MODE_MASK: 0xFFF,\r\n  DEFAULT_FILE_MODE: 33188, // 010644 = -rw-r--r-- = S_IFREG | S_IRUSR | S_IWUSR | S_IRGRP | S_IROTH\r\n  DEFAULT_DIR_MODE: 16877,  // 040755 = drwxr-xr-x = S_IFDIR | S_IRWXU | S_IRGRP | S_IXGRP | S_IROTH | S_IXOTH\r\n\r\n  EXT_FILE_ATTR_DIR: 1106051088,  // 010173200020 = drwxr-xr-x = (((S_IFDIR | 0755) << 16) | S_DOS_D)\r\n  EXT_FILE_ATTR_FILE: 2175008800, // 020151000040 = -rw-r--r-- = (((S_IFREG | 0644) << 16) | S_DOS_A) >>> 0\r\n\r\n  // Unix file types\r\n  S_IFMT: 61440,   // 0170000 type of file mask\r\n  S_IFIFO: 4096,   // 010000 named pipe (fifo)\r\n  S_IFCHR: 8192,   // 020000 character special\r\n  S_IFDIR: 16384,  // 040000 directory\r\n  S_IFBLK: 24576,  // 060000 block special\r\n  S_IFREG: 32768,  // 0100000 regular\r\n  S_IFLNK: 40960,  // 0120000 symbolic link\r\n  S_IFSOCK: 49152, // 0140000 socket\r\n\r\n  // DOS file type flags\r\n  S_DOS_A: 32, // 040 Archive\r\n  S_DOS_D: 16, // 020 Directory\r\n  S_DOS_V: 8,  // 010 Volume\r\n  S_DOS_S: 4,  // 04 System\r\n  S_DOS_H: 2,  // 02 Hidden\r\n  S_DOS_R: 1   // 01 Read Only\r\n};\r\n","/**\r\n * node-compress-commons\r\n *\r\n * Copyright (c) 2014 Chris Talkington, contributors.\r\n * Licensed under the MIT license.\r\n * https://github.com/archiverjs/node-compress-commons/blob/master/LICENSE-MIT\r\n */\r\nvar inherits = require('util').inherits;\r\nvar normalizePath = require('normalize-path');\r\n\r\nvar ArchiveEntry = require('../archive-entry');\r\nvar GeneralPurposeBit = require('./general-purpose-bit');\r\nvar UnixStat = require('./unix-stat');\r\n\r\nvar constants = require('./constants');\r\nvar zipUtil = require('./util');\r\n\r\nvar ZipArchiveEntry = module.exports = function(name) {\r\n  if (!(this instanceof ZipArchiveEntry)) {\r\n    return new ZipArchiveEntry(name);\r\n  }\r\n\r\n  ArchiveEntry.call(this);\r\n\r\n  this.platform = constants.PLATFORM_FAT;\r\n  this.method = -1;\r\n\r\n  this.name = null;\r\n  this.size = 0;\r\n  this.csize = 0;\r\n  this.gpb = new GeneralPurposeBit();\r\n  this.crc = 0;\r\n  this.time = -1;\r\n\r\n  this.minver = constants.MIN_VERSION_INITIAL;\r\n  this.mode = -1;\r\n  this.extra = null;\r\n  this.exattr = 0;\r\n  this.inattr = 0;\r\n  this.comment = null;\r\n\r\n  if (name) {\r\n    this.setName(name);\r\n  }\r\n};\r\n\r\ninherits(ZipArchiveEntry, ArchiveEntry);\r\n\r\n/**\r\n * Returns the extra fields related to the entry.\r\n *\r\n * @returns {Buffer}\r\n */\r\nZipArchiveEntry.prototype.getCentralDirectoryExtra = function() {\r\n  return this.getExtra();\r\n};\r\n\r\n/**\r\n * Returns the comment set for the entry.\r\n *\r\n * @returns {string}\r\n */\r\nZipArchiveEntry.prototype.getComment = function() {\r\n  return this.comment !== null ? this.comment : '';\r\n};\r\n\r\n/**\r\n * Returns the compressed size of the entry.\r\n *\r\n * @returns {number}\r\n */\r\nZipArchiveEntry.prototype.getCompressedSize = function() {\r\n  return this.csize;\r\n};\r\n\r\n/**\r\n * Returns the CRC32 digest for the entry.\r\n *\r\n * @returns {number}\r\n */\r\nZipArchiveEntry.prototype.getCrc = function() {\r\n  return this.crc;\r\n};\r\n\r\n/**\r\n * Returns the external file attributes for the entry.\r\n *\r\n * @returns {number}\r\n */\r\nZipArchiveEntry.prototype.getExternalAttributes = function() {\r\n  return this.exattr;\r\n};\r\n\r\n/**\r\n * Returns the extra fields related to the entry.\r\n *\r\n * @returns {Buffer}\r\n */\r\nZipArchiveEntry.prototype.getExtra = function() {\r\n  return this.extra !== null ? this.extra : constants.EMPTY;\r\n};\r\n\r\n/**\r\n * Returns the general purpose bits related to the entry.\r\n *\r\n * @returns {GeneralPurposeBit}\r\n */\r\nZipArchiveEntry.prototype.getGeneralPurposeBit = function() {\r\n  return this.gpb;\r\n};\r\n\r\n/**\r\n * Returns the internal file attributes for the entry.\r\n *\r\n * @returns {number}\r\n */\r\nZipArchiveEntry.prototype.getInternalAttributes = function() {\r\n  return this.inattr;\r\n};\r\n\r\n/**\r\n * Returns the last modified date of the entry.\r\n *\r\n * @returns {number}\r\n */\r\nZipArchiveEntry.prototype.getLastModifiedDate = function() {\r\n  return this.getTime();\r\n};\r\n\r\n/**\r\n * Returns the extra fields related to the entry.\r\n *\r\n * @returns {Buffer}\r\n */\r\nZipArchiveEntry.prototype.getLocalFileDataExtra = function() {\r\n  return this.getExtra();\r\n};\r\n\r\n/**\r\n * Returns the compression method used on the entry.\r\n *\r\n * @returns {number}\r\n */\r\nZipArchiveEntry.prototype.getMethod = function() {\r\n  return this.method;\r\n};\r\n\r\n/**\r\n * Returns the filename of the entry.\r\n *\r\n * @returns {string}\r\n */\r\nZipArchiveEntry.prototype.getName = function() {\r\n  return this.name;\r\n};\r\n\r\n/**\r\n * Returns the platform on which the entry was made.\r\n *\r\n * @returns {number}\r\n */\r\nZipArchiveEntry.prototype.getPlatform = function() {\r\n  return this.platform;\r\n};\r\n\r\n/**\r\n * Returns the size of the entry.\r\n *\r\n * @returns {number}\r\n */\r\nZipArchiveEntry.prototype.getSize = function() {\r\n  return this.size;\r\n};\r\n\r\n/**\r\n * Returns a date object representing the last modified date of the entry.\r\n *\r\n * @returns {number|Date}\r\n */\r\nZipArchiveEntry.prototype.getTime = function() {\r\n  return this.time !== -1 ? zipUtil.dosToDate(this.time) : -1;\r\n};\r\n\r\n/**\r\n * Returns the DOS timestamp for the entry.\r\n *\r\n * @returns {number}\r\n */\r\nZipArchiveEntry.prototype.getTimeDos = function() {\r\n  return this.time !== -1 ? this.time : 0;\r\n};\r\n\r\n/**\r\n * Returns the UNIX file permissions for the entry.\r\n *\r\n * @returns {number}\r\n */\r\nZipArchiveEntry.prototype.getUnixMode = function() {\r\n  return this.platform !== constants.PLATFORM_UNIX ? 0 : ((this.getExternalAttributes() >> constants.SHORT_SHIFT) & constants.SHORT_MASK);\r\n};\r\n\r\n/**\r\n * Returns the version of ZIP needed to extract the entry.\r\n *\r\n * @returns {number}\r\n */\r\nZipArchiveEntry.prototype.getVersionNeededToExtract = function() {\r\n  return this.minver;\r\n};\r\n\r\n/**\r\n * Sets the comment of the entry.\r\n *\r\n * @param comment\r\n */\r\nZipArchiveEntry.prototype.setComment = function(comment) {\r\n  if (Buffer.byteLength(comment) !== comment.length) {\r\n    this.getGeneralPurposeBit().useUTF8ForNames(true);\r\n  }\r\n\r\n  this.comment = comment;\r\n};\r\n\r\n/**\r\n * Sets the compressed size of the entry.\r\n *\r\n * @param size\r\n */\r\nZipArchiveEntry.prototype.setCompressedSize = function(size) {\r\n  if (size < 0) {\r\n    throw new Error('invalid entry compressed size');\r\n  }\r\n\r\n  this.csize = size;\r\n};\r\n\r\n/**\r\n * Sets the checksum of the entry.\r\n *\r\n * @param crc\r\n */\r\nZipArchiveEntry.prototype.setCrc = function(crc) {\r\n  if (crc < 0) {\r\n    throw new Error('invalid entry crc32');\r\n  }\r\n\r\n  this.crc = crc;\r\n};\r\n\r\n/**\r\n * Sets the external file attributes of the entry.\r\n *\r\n * @param attr\r\n */\r\nZipArchiveEntry.prototype.setExternalAttributes = function(attr) {\r\n  this.exattr = attr >>> 0;\r\n};\r\n\r\n/**\r\n * Sets the extra fields related to the entry.\r\n *\r\n * @param extra\r\n */\r\nZipArchiveEntry.prototype.setExtra = function(extra) {\r\n  this.extra = extra;\r\n};\r\n\r\n/**\r\n * Sets the general purpose bits related to the entry.\r\n *\r\n * @param gpb\r\n */\r\nZipArchiveEntry.prototype.setGeneralPurposeBit = function(gpb) {\r\n  if (!(gpb instanceof GeneralPurposeBit)) {\r\n    throw new Error('invalid entry GeneralPurposeBit');\r\n  }\r\n\r\n  this.gpb = gpb;\r\n};\r\n\r\n/**\r\n * Sets the internal file attributes of the entry.\r\n *\r\n * @param attr\r\n */\r\nZipArchiveEntry.prototype.setInternalAttributes = function(attr) {\r\n  this.inattr = attr;\r\n};\r\n\r\n/**\r\n * Sets the compression method of the entry.\r\n *\r\n * @param method\r\n */\r\nZipArchiveEntry.prototype.setMethod = function(method) {\r\n  if (method < 0) {\r\n    throw new Error('invalid entry compression method');\r\n  }\r\n\r\n  this.method = method;\r\n};\r\n\r\n/**\r\n * Sets the name of the entry.\r\n *\r\n * @param name\r\n */\r\nZipArchiveEntry.prototype.setName = function(name) {\r\n  name = normalizePath(name, false).replace(/^\\w+:/, '').replace(/^(\\.\\.\\/|\\/)+/, '');\r\n\r\n  if (Buffer.byteLength(name) !== name.length) {\r\n    this.getGeneralPurposeBit().useUTF8ForNames(true);\r\n  }\r\n\r\n  this.name = name;\r\n};\r\n\r\n/**\r\n * Sets the platform on which the entry was made.\r\n *\r\n * @param platform\r\n */\r\nZipArchiveEntry.prototype.setPlatform = function(platform) {\r\n  this.platform = platform;\r\n};\r\n\r\n/**\r\n * Sets the size of the entry.\r\n *\r\n * @param size\r\n */\r\nZipArchiveEntry.prototype.setSize = function(size) {\r\n  if (size < 0) {\r\n    throw new Error('invalid entry size');\r\n  }\r\n\r\n  this.size = size;\r\n};\r\n\r\n/**\r\n * Sets the time of the entry.\r\n *\r\n * @param time\r\n * @param forceLocalTime\r\n */\r\nZipArchiveEntry.prototype.setTime = function(time, forceLocalTime) {\r\n  if (!(time instanceof Date)) {\r\n    throw new Error('invalid entry time');\r\n  }\r\n\r\n  this.time = zipUtil.dateToDos(time, forceLocalTime);\r\n};\r\n\r\n/**\r\n * Sets the UNIX file permissions for the entry.\r\n *\r\n * @param mode\r\n */\r\nZipArchiveEntry.prototype.setUnixMode = function(mode) {\r\n  mode |= this.isDirectory() ? constants.S_IFDIR : constants.S_IFREG;\r\n\r\n  var extattr = 0;\r\n  extattr |= (mode << constants.SHORT_SHIFT) | (this.isDirectory() ? constants.S_DOS_D : constants.S_DOS_A);\r\n\r\n  this.setExternalAttributes(extattr);\r\n  this.mode = mode & constants.MODE_MASK;\r\n  this.platform = constants.PLATFORM_UNIX;\r\n};\r\n\r\n/**\r\n * Sets the version of ZIP needed to extract this entry.\r\n *\r\n * @param minver\r\n */\r\nZipArchiveEntry.prototype.setVersionNeededToExtract = function(minver) {\r\n  this.minver = minver;\r\n};\r\n\r\n/**\r\n * Returns true if this entry represents a directory.\r\n *\r\n * @returns {boolean}\r\n */\r\nZipArchiveEntry.prototype.isDirectory = function() {\r\n  return this.getName().slice(-1) === '/';\r\n};\r\n\r\n/**\r\n * Returns true if this entry represents a unix symlink,\r\n * in which case the entry's content contains the target path\r\n * for the symlink.\r\n *\r\n * @returns {boolean}\r\n */\r\nZipArchiveEntry.prototype.isUnixSymlink = function() {\r\n  return (this.getUnixMode() & UnixStat.FILE_TYPE_FLAG) === UnixStat.LINK_FLAG;\r\n};\r\n\r\n/**\r\n * Returns true if this entry is using the ZIP64 extension of ZIP.\r\n *\r\n * @returns {boolean}\r\n */\r\nZipArchiveEntry.prototype.isZip64 = function() {\r\n  return this.csize > constants.ZIP64_MAGIC || this.size > constants.ZIP64_MAGIC;\r\n};\r\n","\n            const Stream = require('stream');\n\n            exports = module.exports = Stream.Readable;\n            exports.Readable = Stream.Readable;\n            exports.Writable = Stream.Writable;\n            exports.Duplex = Stream.Duplex;\n            exports.Transform = Stream.Transform;\n            exports.PassThrough = Stream.PassThrough;\n            exports.Stream = Stream;\n          ","/**\r\n * node-compress-commons\r\n *\r\n * Copyright (c) 2014 Chris Talkington, contributors.\r\n * Licensed under the MIT license.\r\n * https://github.com/archiverjs/node-compress-commons/blob/master/LICENSE-MIT\r\n */\r\nvar Stream = require('stream').Stream;\r\nvar PassThrough = require('readable-stream').PassThrough;\r\n\r\nvar util = module.exports = {};\r\n\r\nutil.isStream = function(source) {\r\n  return source instanceof Stream;\r\n};\r\n\r\nutil.normalizeInputSource = function(source) {\r\n  if (source === null) {\r\n    return Buffer.alloc(0);\r\n  } else if (typeof source === 'string') {\r\n    return Buffer.from(source);\r\n  } else if (util.isStream(source) && !source._readableState) {\r\n    var normalized = new PassThrough();\r\n    source.pipe(normalized);\r\n\r\n    return normalized;\r\n  }\r\n\r\n  return source;\r\n};","/**\r\n * node-compress-commons\r\n *\r\n * Copyright (c) 2014 Chris Talkington, contributors.\r\n * Licensed under the MIT license.\r\n * https://github.com/archiverjs/node-compress-commons/blob/master/LICENSE-MIT\r\n */\r\nvar inherits = require('util').inherits;\r\nvar Transform = require('readable-stream').Transform;\r\n\r\nvar ArchiveEntry = require('./archive-entry');\r\nvar util = require('../util');\r\n\r\nvar ArchiveOutputStream = module.exports = function(options) {\r\n  if (!(this instanceof ArchiveOutputStream)) {\r\n    return new ArchiveOutputStream(options);\r\n  }\r\n\r\n  Transform.call(this, options);\r\n\r\n  this.offset = 0;\r\n  this._archive = {\r\n    finish: false,\r\n    finished: false,\r\n    processing: false\r\n  };\r\n};\r\n\r\ninherits(ArchiveOutputStream, Transform);\r\n\r\nArchiveOutputStream.prototype._appendBuffer = function(zae, source, callback) {\r\n  // scaffold only\r\n};\r\n\r\nArchiveOutputStream.prototype._appendStream = function(zae, source, callback) {\r\n  // scaffold only\r\n};\r\n\r\nArchiveOutputStream.prototype._emitErrorCallback = function(err) {\r\n  if (err) {\r\n    this.emit('error', err);\r\n  }\r\n};\r\n\r\nArchiveOutputStream.prototype._finish = function(ae) {\r\n  // scaffold only\r\n};\r\n\r\nArchiveOutputStream.prototype._normalizeEntry = function(ae) {\r\n  // scaffold only\r\n};\r\n\r\nArchiveOutputStream.prototype._transform = function(chunk, encoding, callback) {\r\n  callback(null, chunk);\r\n};\r\n\r\nArchiveOutputStream.prototype.entry = function(ae, source, callback) {\r\n  source = source || null;\r\n\r\n  if (typeof callback !== 'function') {\r\n    callback = this._emitErrorCallback.bind(this);\r\n  }\r\n\r\n  if (!(ae instanceof ArchiveEntry)) {\r\n    callback(new Error('not a valid instance of ArchiveEntry'));\r\n    return;\r\n  }\r\n\r\n  if (this._archive.finish || this._archive.finished) {\r\n    callback(new Error('unacceptable entry after finish'));\r\n    return;\r\n  }\r\n\r\n  if (this._archive.processing) {\r\n    callback(new Error('already processing an entry'));\r\n    return;\r\n  }\r\n\r\n  this._archive.processing = true;\r\n  this._normalizeEntry(ae);\r\n  this._entry = ae;\r\n\r\n  source = util.normalizeInputSource(source);\r\n\r\n  if (Buffer.isBuffer(source)) {\r\n    this._appendBuffer(ae, source, callback);\r\n  } else if (util.isStream(source)) {\r\n    this._appendStream(ae, source, callback);\r\n  } else {\r\n    this._archive.processing = false;\r\n    callback(new Error('input source must be valid Stream or Buffer instance'));\r\n    return;\r\n  }\r\n\r\n  return this;\r\n};\r\n\r\nArchiveOutputStream.prototype.finish = function() {\r\n  if (this._archive.processing) {\r\n    this._archive.finish = true;\r\n    return;\r\n  }\r\n\r\n  this._finish();\r\n};\r\n\r\nArchiveOutputStream.prototype.getBytesWritten = function() {\r\n  return this.offset;\r\n};\r\n\r\nArchiveOutputStream.prototype.write = function(chunk, cb) {\r\n  if (chunk) {\r\n    this.offset += chunk.length;\r\n  }\r\n\r\n  return Transform.prototype.write.call(this, chunk, cb);\r\n};","import { Buffer } from 'buffer';\n\nconst createBuffer =\n  Buffer.from && Buffer.alloc && Buffer.allocUnsafe && Buffer.allocUnsafeSlow\n    ? Buffer.from\n    : // support for Node < 5.10\n      val => new Buffer(val);\n\nexport default createBuffer;\n","export default function(model, calc) {\n  const fn = (buf, previous) => calc(buf, previous) >>> 0;\n  fn.signed = calc;\n  fn.unsigned = fn;\n  fn.model = model;\n\n  return fn;\n}\n","import { Buffer } from 'buffer';\nimport createBuffer from './create_buffer';\nimport defineCrc from './define_crc';\n\nconst crc1 = defineCrc('crc1', function(buf, previous) {\n  if (!Buffer.isBuffer(buf)) buf = createBuffer(buf);\n\n  let crc = ~~previous;\n  let accum = 0;\n\n  for (let index = 0; index < buf.length; index++) {\n    const byte = buf[index];\n    accum += byte;\n  }\n\n  crc += accum % 256;\n  return crc % 256;\n});\n\nexport default crc1;\n","import { Buffer } from 'buffer';\nimport createBuffer from './create_buffer';\nimport defineCrc from './define_crc';\n\n// Generated by `./pycrc.py --algorithm=table-driven --model=crc-8 --generate=c`\n// prettier-ignore\nlet TABLE = [\n  0x00, 0x07, 0x0e, 0x09, 0x1c, 0x1b, 0x12, 0x15, 0x38, 0x3f, 0x36, 0x31, 0x24, 0x23, 0x2a, 0x2d,\n  0x70, 0x77, 0x7e, 0x79, 0x6c, 0x6b, 0x62, 0x65, 0x48, 0x4f, 0x46, 0x41, 0x54, 0x53, 0x5a, 0x5d,\n  0xe0, 0xe7, 0xee, 0xe9, 0xfc, 0xfb, 0xf2, 0xf5, 0xd8, 0xdf, 0xd6, 0xd1, 0xc4, 0xc3, 0xca, 0xcd,\n  0x90, 0x97, 0x9e, 0x99, 0x8c, 0x8b, 0x82, 0x85, 0xa8, 0xaf, 0xa6, 0xa1, 0xb4, 0xb3, 0xba, 0xbd,\n  0xc7, 0xc0, 0xc9, 0xce, 0xdb, 0xdc, 0xd5, 0xd2, 0xff, 0xf8, 0xf1, 0xf6, 0xe3, 0xe4, 0xed, 0xea,\n  0xb7, 0xb0, 0xb9, 0xbe, 0xab, 0xac, 0xa5, 0xa2, 0x8f, 0x88, 0x81, 0x86, 0x93, 0x94, 0x9d, 0x9a,\n  0x27, 0x20, 0x29, 0x2e, 0x3b, 0x3c, 0x35, 0x32, 0x1f, 0x18, 0x11, 0x16, 0x03, 0x04, 0x0d, 0x0a,\n  0x57, 0x50, 0x59, 0x5e, 0x4b, 0x4c, 0x45, 0x42, 0x6f, 0x68, 0x61, 0x66, 0x73, 0x74, 0x7d, 0x7a,\n  0x89, 0x8e, 0x87, 0x80, 0x95, 0x92, 0x9b, 0x9c, 0xb1, 0xb6, 0xbf, 0xb8, 0xad, 0xaa, 0xa3, 0xa4,\n  0xf9, 0xfe, 0xf7, 0xf0, 0xe5, 0xe2, 0xeb, 0xec, 0xc1, 0xc6, 0xcf, 0xc8, 0xdd, 0xda, 0xd3, 0xd4,\n  0x69, 0x6e, 0x67, 0x60, 0x75, 0x72, 0x7b, 0x7c, 0x51, 0x56, 0x5f, 0x58, 0x4d, 0x4a, 0x43, 0x44,\n  0x19, 0x1e, 0x17, 0x10, 0x05, 0x02, 0x0b, 0x0c, 0x21, 0x26, 0x2f, 0x28, 0x3d, 0x3a, 0x33, 0x34,\n  0x4e, 0x49, 0x40, 0x47, 0x52, 0x55, 0x5c, 0x5b, 0x76, 0x71, 0x78, 0x7f, 0x6a, 0x6d, 0x64, 0x63,\n  0x3e, 0x39, 0x30, 0x37, 0x22, 0x25, 0x2c, 0x2b, 0x06, 0x01, 0x08, 0x0f, 0x1a, 0x1d, 0x14, 0x13,\n  0xae, 0xa9, 0xa0, 0xa7, 0xb2, 0xb5, 0xbc, 0xbb, 0x96, 0x91, 0x98, 0x9f, 0x8a, 0x8d, 0x84, 0x83,\n  0xde, 0xd9, 0xd0, 0xd7, 0xc2, 0xc5, 0xcc, 0xcb, 0xe6, 0xe1, 0xe8, 0xef, 0xfa, 0xfd, 0xf4, 0xf3\n];\n\nif (typeof Int32Array !== 'undefined') TABLE = new Int32Array(TABLE);\n\nconst crc8 = defineCrc('crc-8', function(buf, previous) {\n  if (!Buffer.isBuffer(buf)) buf = createBuffer(buf);\n\n  let crc = ~~previous;\n\n  for (let index = 0; index < buf.length; index++) {\n    const byte = buf[index];\n    crc = TABLE[(crc ^ byte) & 0xff] & 0xff;\n  }\n\n  return crc;\n});\n\nexport default crc8;\n","import { Buffer } from 'buffer';\nimport createBuffer from './create_buffer';\nimport defineCrc from './define_crc';\n\n// Generated by `./pycrc.py --algorithm=table-driven --model=dallas-1-wire --generate=c`\n// prettier-ignore\nlet TABLE = [\n  0x00, 0x5e, 0xbc, 0xe2, 0x61, 0x3f, 0xdd, 0x83, 0xc2, 0x9c, 0x7e, 0x20, 0xa3, 0xfd, 0x1f, 0x41,\n  0x9d, 0xc3, 0x21, 0x7f, 0xfc, 0xa2, 0x40, 0x1e, 0x5f, 0x01, 0xe3, 0xbd, 0x3e, 0x60, 0x82, 0xdc,\n  0x23, 0x7d, 0x9f, 0xc1, 0x42, 0x1c, 0xfe, 0xa0, 0xe1, 0xbf, 0x5d, 0x03, 0x80, 0xde, 0x3c, 0x62,\n  0xbe, 0xe0, 0x02, 0x5c, 0xdf, 0x81, 0x63, 0x3d, 0x7c, 0x22, 0xc0, 0x9e, 0x1d, 0x43, 0xa1, 0xff,\n  0x46, 0x18, 0xfa, 0xa4, 0x27, 0x79, 0x9b, 0xc5, 0x84, 0xda, 0x38, 0x66, 0xe5, 0xbb, 0x59, 0x07,\n  0xdb, 0x85, 0x67, 0x39, 0xba, 0xe4, 0x06, 0x58, 0x19, 0x47, 0xa5, 0xfb, 0x78, 0x26, 0xc4, 0x9a,\n  0x65, 0x3b, 0xd9, 0x87, 0x04, 0x5a, 0xb8, 0xe6, 0xa7, 0xf9, 0x1b, 0x45, 0xc6, 0x98, 0x7a, 0x24,\n  0xf8, 0xa6, 0x44, 0x1a, 0x99, 0xc7, 0x25, 0x7b, 0x3a, 0x64, 0x86, 0xd8, 0x5b, 0x05, 0xe7, 0xb9,\n  0x8c, 0xd2, 0x30, 0x6e, 0xed, 0xb3, 0x51, 0x0f, 0x4e, 0x10, 0xf2, 0xac, 0x2f, 0x71, 0x93, 0xcd,\n  0x11, 0x4f, 0xad, 0xf3, 0x70, 0x2e, 0xcc, 0x92, 0xd3, 0x8d, 0x6f, 0x31, 0xb2, 0xec, 0x0e, 0x50,\n  0xaf, 0xf1, 0x13, 0x4d, 0xce, 0x90, 0x72, 0x2c, 0x6d, 0x33, 0xd1, 0x8f, 0x0c, 0x52, 0xb0, 0xee,\n  0x32, 0x6c, 0x8e, 0xd0, 0x53, 0x0d, 0xef, 0xb1, 0xf0, 0xae, 0x4c, 0x12, 0x91, 0xcf, 0x2d, 0x73,\n  0xca, 0x94, 0x76, 0x28, 0xab, 0xf5, 0x17, 0x49, 0x08, 0x56, 0xb4, 0xea, 0x69, 0x37, 0xd5, 0x8b,\n  0x57, 0x09, 0xeb, 0xb5, 0x36, 0x68, 0x8a, 0xd4, 0x95, 0xcb, 0x29, 0x77, 0xf4, 0xaa, 0x48, 0x16,\n  0xe9, 0xb7, 0x55, 0x0b, 0x88, 0xd6, 0x34, 0x6a, 0x2b, 0x75, 0x97, 0xc9, 0x4a, 0x14, 0xf6, 0xa8,\n  0x74, 0x2a, 0xc8, 0x96, 0x15, 0x4b, 0xa9, 0xf7, 0xb6, 0xe8, 0x0a, 0x54, 0xd7, 0x89, 0x6b, 0x35\n];\n\nif (typeof Int32Array !== 'undefined') TABLE = new Int32Array(TABLE);\n\nconst crc81wire = defineCrc('dallas-1-wire', function(buf, previous) {\n  if (!Buffer.isBuffer(buf)) buf = createBuffer(buf);\n\n  let crc = ~~previous;\n\n  for (let index = 0; index < buf.length; index++) {\n    const byte = buf[index];\n    crc = TABLE[(crc ^ byte) & 0xff] & 0xff;\n  }\n\n  return crc;\n});\n\nexport default crc81wire;\n","import { Buffer } from 'buffer';\nimport createBuffer from './create_buffer';\nimport defineCrc from './define_crc';\n\n// Generated by `./pycrc.py --algorithm=table-driven --model=crc-16 --generate=c`\n// prettier-ignore\nlet TABLE = [\n  0x0000, 0xc0c1, 0xc181, 0x0140, 0xc301, 0x03c0, 0x0280, 0xc241,\n  0xc601, 0x06c0, 0x0780, 0xc741, 0x0500, 0xc5c1, 0xc481, 0x0440,\n  0xcc01, 0x0cc0, 0x0d80, 0xcd41, 0x0f00, 0xcfc1, 0xce81, 0x0e40,\n  0x0a00, 0xcac1, 0xcb81, 0x0b40, 0xc901, 0x09c0, 0x0880, 0xc841,\n  0xd801, 0x18c0, 0x1980, 0xd941, 0x1b00, 0xdbc1, 0xda81, 0x1a40,\n  0x1e00, 0xdec1, 0xdf81, 0x1f40, 0xdd01, 0x1dc0, 0x1c80, 0xdc41,\n  0x1400, 0xd4c1, 0xd581, 0x1540, 0xd701, 0x17c0, 0x1680, 0xd641,\n  0xd201, 0x12c0, 0x1380, 0xd341, 0x1100, 0xd1c1, 0xd081, 0x1040,\n  0xf001, 0x30c0, 0x3180, 0xf141, 0x3300, 0xf3c1, 0xf281, 0x3240,\n  0x3600, 0xf6c1, 0xf781, 0x3740, 0xf501, 0x35c0, 0x3480, 0xf441,\n  0x3c00, 0xfcc1, 0xfd81, 0x3d40, 0xff01, 0x3fc0, 0x3e80, 0xfe41,\n  0xfa01, 0x3ac0, 0x3b80, 0xfb41, 0x3900, 0xf9c1, 0xf881, 0x3840,\n  0x2800, 0xe8c1, 0xe981, 0x2940, 0xeb01, 0x2bc0, 0x2a80, 0xea41,\n  0xee01, 0x2ec0, 0x2f80, 0xef41, 0x2d00, 0xedc1, 0xec81, 0x2c40,\n  0xe401, 0x24c0, 0x2580, 0xe541, 0x2700, 0xe7c1, 0xe681, 0x2640,\n  0x2200, 0xe2c1, 0xe381, 0x2340, 0xe101, 0x21c0, 0x2080, 0xe041,\n  0xa001, 0x60c0, 0x6180, 0xa141, 0x6300, 0xa3c1, 0xa281, 0x6240,\n  0x6600, 0xa6c1, 0xa781, 0x6740, 0xa501, 0x65c0, 0x6480, 0xa441,\n  0x6c00, 0xacc1, 0xad81, 0x6d40, 0xaf01, 0x6fc0, 0x6e80, 0xae41,\n  0xaa01, 0x6ac0, 0x6b80, 0xab41, 0x6900, 0xa9c1, 0xa881, 0x6840,\n  0x7800, 0xb8c1, 0xb981, 0x7940, 0xbb01, 0x7bc0, 0x7a80, 0xba41,\n  0xbe01, 0x7ec0, 0x7f80, 0xbf41, 0x7d00, 0xbdc1, 0xbc81, 0x7c40,\n  0xb401, 0x74c0, 0x7580, 0xb541, 0x7700, 0xb7c1, 0xb681, 0x7640,\n  0x7200, 0xb2c1, 0xb381, 0x7340, 0xb101, 0x71c0, 0x7080, 0xb041,\n  0x5000, 0x90c1, 0x9181, 0x5140, 0x9301, 0x53c0, 0x5280, 0x9241,\n  0x9601, 0x56c0, 0x5780, 0x9741, 0x5500, 0x95c1, 0x9481, 0x5440,\n  0x9c01, 0x5cc0, 0x5d80, 0x9d41, 0x5f00, 0x9fc1, 0x9e81, 0x5e40,\n  0x5a00, 0x9ac1, 0x9b81, 0x5b40, 0x9901, 0x59c0, 0x5880, 0x9841,\n  0x8801, 0x48c0, 0x4980, 0x8941, 0x4b00, 0x8bc1, 0x8a81, 0x4a40,\n  0x4e00, 0x8ec1, 0x8f81, 0x4f40, 0x8d01, 0x4dc0, 0x4c80, 0x8c41,\n  0x4400, 0x84c1, 0x8581, 0x4540, 0x8701, 0x47c0, 0x4680, 0x8641,\n  0x8201, 0x42c0, 0x4380, 0x8341, 0x4100, 0x81c1, 0x8081, 0x4040\n]\n\nif (typeof Int32Array !== 'undefined') TABLE = new Int32Array(TABLE);\n\nconst crc16 = defineCrc('crc-16', function(buf, previous) {\n  if (!Buffer.isBuffer(buf)) buf = createBuffer(buf);\n\n  let crc = ~~previous;\n\n  for (let index = 0; index < buf.length; index++) {\n    const byte = buf[index];\n    crc = (TABLE[(crc ^ byte) & 0xff] ^ (crc >> 8)) & 0xffff;\n  }\n\n  return crc;\n});\n\nexport default crc16;\n","import { Buffer } from 'buffer';\nimport createBuffer from './create_buffer';\nimport defineCrc from './define_crc';\n\n// Generated by `./pycrc.py --algorithm=table-driven --model=ccitt --generate=c`\n// prettier-ignore\nlet TABLE = [\n  0x0000, 0x1021, 0x2042, 0x3063, 0x4084, 0x50a5, 0x60c6, 0x70e7,\n  0x8108, 0x9129, 0xa14a, 0xb16b, 0xc18c, 0xd1ad, 0xe1ce, 0xf1ef,\n  0x1231, 0x0210, 0x3273, 0x2252, 0x52b5, 0x4294, 0x72f7, 0x62d6,\n  0x9339, 0x8318, 0xb37b, 0xa35a, 0xd3bd, 0xc39c, 0xf3ff, 0xe3de,\n  0x2462, 0x3443, 0x0420, 0x1401, 0x64e6, 0x74c7, 0x44a4, 0x5485,\n  0xa56a, 0xb54b, 0x8528, 0x9509, 0xe5ee, 0xf5cf, 0xc5ac, 0xd58d,\n  0x3653, 0x2672, 0x1611, 0x0630, 0x76d7, 0x66f6, 0x5695, 0x46b4,\n  0xb75b, 0xa77a, 0x9719, 0x8738, 0xf7df, 0xe7fe, 0xd79d, 0xc7bc,\n  0x48c4, 0x58e5, 0x6886, 0x78a7, 0x0840, 0x1861, 0x2802, 0x3823,\n  0xc9cc, 0xd9ed, 0xe98e, 0xf9af, 0x8948, 0x9969, 0xa90a, 0xb92b,\n  0x5af5, 0x4ad4, 0x7ab7, 0x6a96, 0x1a71, 0x0a50, 0x3a33, 0x2a12,\n  0xdbfd, 0xcbdc, 0xfbbf, 0xeb9e, 0x9b79, 0x8b58, 0xbb3b, 0xab1a,\n  0x6ca6, 0x7c87, 0x4ce4, 0x5cc5, 0x2c22, 0x3c03, 0x0c60, 0x1c41,\n  0xedae, 0xfd8f, 0xcdec, 0xddcd, 0xad2a, 0xbd0b, 0x8d68, 0x9d49,\n  0x7e97, 0x6eb6, 0x5ed5, 0x4ef4, 0x3e13, 0x2e32, 0x1e51, 0x0e70,\n  0xff9f, 0xefbe, 0xdfdd, 0xcffc, 0xbf1b, 0xaf3a, 0x9f59, 0x8f78,\n  0x9188, 0x81a9, 0xb1ca, 0xa1eb, 0xd10c, 0xc12d, 0xf14e, 0xe16f,\n  0x1080, 0x00a1, 0x30c2, 0x20e3, 0x5004, 0x4025, 0x7046, 0x6067,\n  0x83b9, 0x9398, 0xa3fb, 0xb3da, 0xc33d, 0xd31c, 0xe37f, 0xf35e,\n  0x02b1, 0x1290, 0x22f3, 0x32d2, 0x4235, 0x5214, 0x6277, 0x7256,\n  0xb5ea, 0xa5cb, 0x95a8, 0x8589, 0xf56e, 0xe54f, 0xd52c, 0xc50d,\n  0x34e2, 0x24c3, 0x14a0, 0x0481, 0x7466, 0x6447, 0x5424, 0x4405,\n  0xa7db, 0xb7fa, 0x8799, 0x97b8, 0xe75f, 0xf77e, 0xc71d, 0xd73c,\n  0x26d3, 0x36f2, 0x0691, 0x16b0, 0x6657, 0x7676, 0x4615, 0x5634,\n  0xd94c, 0xc96d, 0xf90e, 0xe92f, 0x99c8, 0x89e9, 0xb98a, 0xa9ab,\n  0x5844, 0x4865, 0x7806, 0x6827, 0x18c0, 0x08e1, 0x3882, 0x28a3,\n  0xcb7d, 0xdb5c, 0xeb3f, 0xfb1e, 0x8bf9, 0x9bd8, 0xabbb, 0xbb9a,\n  0x4a75, 0x5a54, 0x6a37, 0x7a16, 0x0af1, 0x1ad0, 0x2ab3, 0x3a92,\n  0xfd2e, 0xed0f, 0xdd6c, 0xcd4d, 0xbdaa, 0xad8b, 0x9de8, 0x8dc9,\n  0x7c26, 0x6c07, 0x5c64, 0x4c45, 0x3ca2, 0x2c83, 0x1ce0, 0x0cc1,\n  0xef1f, 0xff3e, 0xcf5d, 0xdf7c, 0xaf9b, 0xbfba, 0x8fd9, 0x9ff8,\n  0x6e17, 0x7e36, 0x4e55, 0x5e74, 0x2e93, 0x3eb2, 0x0ed1, 0x1ef0\n];\n\nif (typeof Int32Array !== 'undefined') TABLE = new Int32Array(TABLE);\n\nconst crc16ccitt = defineCrc('ccitt', function(buf, previous) {\n  if (!Buffer.isBuffer(buf)) buf = createBuffer(buf);\n\n  let crc = typeof previous !== 'undefined' ? ~~previous : 0xffff;\n\n  for (let index = 0; index < buf.length; index++) {\n    const byte = buf[index];\n    crc = (TABLE[((crc >> 8) ^ byte) & 0xff] ^ (crc << 8)) & 0xffff;\n  }\n\n  return crc;\n});\n\nexport default crc16ccitt;\n","import { Buffer } from 'buffer';\nimport createBuffer from './create_buffer';\nimport defineCrc from './define_crc';\n\n// Generated by `./pycrc.py --algorithm=table-driven --model=crc-16-modbus --generate=c`\n// prettier-ignore\nlet TABLE = [\n  0x0000, 0xc0c1, 0xc181, 0x0140, 0xc301, 0x03c0, 0x0280, 0xc241,\n  0xc601, 0x06c0, 0x0780, 0xc741, 0x0500, 0xc5c1, 0xc481, 0x0440,\n  0xcc01, 0x0cc0, 0x0d80, 0xcd41, 0x0f00, 0xcfc1, 0xce81, 0x0e40,\n  0x0a00, 0xcac1, 0xcb81, 0x0b40, 0xc901, 0x09c0, 0x0880, 0xc841,\n  0xd801, 0x18c0, 0x1980, 0xd941, 0x1b00, 0xdbc1, 0xda81, 0x1a40,\n  0x1e00, 0xdec1, 0xdf81, 0x1f40, 0xdd01, 0x1dc0, 0x1c80, 0xdc41,\n  0x1400, 0xd4c1, 0xd581, 0x1540, 0xd701, 0x17c0, 0x1680, 0xd641,\n  0xd201, 0x12c0, 0x1380, 0xd341, 0x1100, 0xd1c1, 0xd081, 0x1040,\n  0xf001, 0x30c0, 0x3180, 0xf141, 0x3300, 0xf3c1, 0xf281, 0x3240,\n  0x3600, 0xf6c1, 0xf781, 0x3740, 0xf501, 0x35c0, 0x3480, 0xf441,\n  0x3c00, 0xfcc1, 0xfd81, 0x3d40, 0xff01, 0x3fc0, 0x3e80, 0xfe41,\n  0xfa01, 0x3ac0, 0x3b80, 0xfb41, 0x3900, 0xf9c1, 0xf881, 0x3840,\n  0x2800, 0xe8c1, 0xe981, 0x2940, 0xeb01, 0x2bc0, 0x2a80, 0xea41,\n  0xee01, 0x2ec0, 0x2f80, 0xef41, 0x2d00, 0xedc1, 0xec81, 0x2c40,\n  0xe401, 0x24c0, 0x2580, 0xe541, 0x2700, 0xe7c1, 0xe681, 0x2640,\n  0x2200, 0xe2c1, 0xe381, 0x2340, 0xe101, 0x21c0, 0x2080, 0xe041,\n  0xa001, 0x60c0, 0x6180, 0xa141, 0x6300, 0xa3c1, 0xa281, 0x6240,\n  0x6600, 0xa6c1, 0xa781, 0x6740, 0xa501, 0x65c0, 0x6480, 0xa441,\n  0x6c00, 0xacc1, 0xad81, 0x6d40, 0xaf01, 0x6fc0, 0x6e80, 0xae41,\n  0xaa01, 0x6ac0, 0x6b80, 0xab41, 0x6900, 0xa9c1, 0xa881, 0x6840,\n  0x7800, 0xb8c1, 0xb981, 0x7940, 0xbb01, 0x7bc0, 0x7a80, 0xba41,\n  0xbe01, 0x7ec0, 0x7f80, 0xbf41, 0x7d00, 0xbdc1, 0xbc81, 0x7c40,\n  0xb401, 0x74c0, 0x7580, 0xb541, 0x7700, 0xb7c1, 0xb681, 0x7640,\n  0x7200, 0xb2c1, 0xb381, 0x7340, 0xb101, 0x71c0, 0x7080, 0xb041,\n  0x5000, 0x90c1, 0x9181, 0x5140, 0x9301, 0x53c0, 0x5280, 0x9241,\n  0x9601, 0x56c0, 0x5780, 0x9741, 0x5500, 0x95c1, 0x9481, 0x5440,\n  0x9c01, 0x5cc0, 0x5d80, 0x9d41, 0x5f00, 0x9fc1, 0x9e81, 0x5e40,\n  0x5a00, 0x9ac1, 0x9b81, 0x5b40, 0x9901, 0x59c0, 0x5880, 0x9841,\n  0x8801, 0x48c0, 0x4980, 0x8941, 0x4b00, 0x8bc1, 0x8a81, 0x4a40,\n  0x4e00, 0x8ec1, 0x8f81, 0x4f40, 0x8d01, 0x4dc0, 0x4c80, 0x8c41,\n  0x4400, 0x84c1, 0x8581, 0x4540, 0x8701, 0x47c0, 0x4680, 0x8641,\n  0x8201, 0x42c0, 0x4380, 0x8341, 0x4100, 0x81c1, 0x8081, 0x4040\n]\n\nif (typeof Int32Array !== 'undefined') TABLE = new Int32Array(TABLE);\n\nconst crc16modbus = defineCrc('crc-16-modbus', function(buf, previous) {\n  if (!Buffer.isBuffer(buf)) buf = createBuffer(buf);\n\n  let crc = typeof previous !== 'undefined' ? ~~previous : 0xffff;\n\n  for (let index = 0; index < buf.length; index++) {\n    const byte = buf[index];\n    crc = (TABLE[(crc ^ byte) & 0xff] ^ (crc >> 8)) & 0xffff;\n  }\n\n  return crc;\n});\n\nexport default crc16modbus;\n","import { Buffer } from 'buffer';\nimport createBuffer from './create_buffer';\nimport defineCrc from './define_crc';\n\nconst crc16xmodem = defineCrc('xmodem', function(buf, previous) {\n  if (!Buffer.isBuffer(buf)) buf = createBuffer(buf);\n\n  let crc = typeof previous !== 'undefined' ? ~~previous : 0x0;\n\n  for (let index = 0; index < buf.length; index++) {\n    const byte = buf[index];\n    let code = (crc >>> 8) & 0xff;\n\n    code ^= byte & 0xff;\n    code ^= code >>> 4;\n    crc = (crc << 8) & 0xffff;\n    crc ^= code;\n    code = (code << 5) & 0xffff;\n    crc ^= code;\n    code = (code << 7) & 0xffff;\n    crc ^= code;\n  }\n\n  return crc;\n});\n\nexport default crc16xmodem;\n","import { Buffer } from 'buffer';\nimport createBuffer from './create_buffer';\nimport defineCrc from './define_crc';\n\n// Generated by `./pycrc.py --algorithm=table-driven --model=kermit --generate=c`\n// prettier-ignore\nlet TABLE = [\n  0x0000, 0x1189, 0x2312, 0x329b, 0x4624, 0x57ad, 0x6536, 0x74bf,\n  0x8c48, 0x9dc1, 0xaf5a, 0xbed3, 0xca6c, 0xdbe5, 0xe97e, 0xf8f7,\n  0x1081, 0x0108, 0x3393, 0x221a, 0x56a5, 0x472c, 0x75b7, 0x643e,\n  0x9cc9, 0x8d40, 0xbfdb, 0xae52, 0xdaed, 0xcb64, 0xf9ff, 0xe876,\n  0x2102, 0x308b, 0x0210, 0x1399, 0x6726, 0x76af, 0x4434, 0x55bd,\n  0xad4a, 0xbcc3, 0x8e58, 0x9fd1, 0xeb6e, 0xfae7, 0xc87c, 0xd9f5,\n  0x3183, 0x200a, 0x1291, 0x0318, 0x77a7, 0x662e, 0x54b5, 0x453c,\n  0xbdcb, 0xac42, 0x9ed9, 0x8f50, 0xfbef, 0xea66, 0xd8fd, 0xc974,\n  0x4204, 0x538d, 0x6116, 0x709f, 0x0420, 0x15a9, 0x2732, 0x36bb,\n  0xce4c, 0xdfc5, 0xed5e, 0xfcd7, 0x8868, 0x99e1, 0xab7a, 0xbaf3,\n  0x5285, 0x430c, 0x7197, 0x601e, 0x14a1, 0x0528, 0x37b3, 0x263a,\n  0xdecd, 0xcf44, 0xfddf, 0xec56, 0x98e9, 0x8960, 0xbbfb, 0xaa72,\n  0x6306, 0x728f, 0x4014, 0x519d, 0x2522, 0x34ab, 0x0630, 0x17b9,\n  0xef4e, 0xfec7, 0xcc5c, 0xddd5, 0xa96a, 0xb8e3, 0x8a78, 0x9bf1,\n  0x7387, 0x620e, 0x5095, 0x411c, 0x35a3, 0x242a, 0x16b1, 0x0738,\n  0xffcf, 0xee46, 0xdcdd, 0xcd54, 0xb9eb, 0xa862, 0x9af9, 0x8b70,\n  0x8408, 0x9581, 0xa71a, 0xb693, 0xc22c, 0xd3a5, 0xe13e, 0xf0b7,\n  0x0840, 0x19c9, 0x2b52, 0x3adb, 0x4e64, 0x5fed, 0x6d76, 0x7cff,\n  0x9489, 0x8500, 0xb79b, 0xa612, 0xd2ad, 0xc324, 0xf1bf, 0xe036,\n  0x18c1, 0x0948, 0x3bd3, 0x2a5a, 0x5ee5, 0x4f6c, 0x7df7, 0x6c7e,\n  0xa50a, 0xb483, 0x8618, 0x9791, 0xe32e, 0xf2a7, 0xc03c, 0xd1b5,\n  0x2942, 0x38cb, 0x0a50, 0x1bd9, 0x6f66, 0x7eef, 0x4c74, 0x5dfd,\n  0xb58b, 0xa402, 0x9699, 0x8710, 0xf3af, 0xe226, 0xd0bd, 0xc134,\n  0x39c3, 0x284a, 0x1ad1, 0x0b58, 0x7fe7, 0x6e6e, 0x5cf5, 0x4d7c,\n  0xc60c, 0xd785, 0xe51e, 0xf497, 0x8028, 0x91a1, 0xa33a, 0xb2b3,\n  0x4a44, 0x5bcd, 0x6956, 0x78df, 0x0c60, 0x1de9, 0x2f72, 0x3efb,\n  0xd68d, 0xc704, 0xf59f, 0xe416, 0x90a9, 0x8120, 0xb3bb, 0xa232,\n  0x5ac5, 0x4b4c, 0x79d7, 0x685e, 0x1ce1, 0x0d68, 0x3ff3, 0x2e7a,\n  0xe70e, 0xf687, 0xc41c, 0xd595, 0xa12a, 0xb0a3, 0x8238, 0x93b1,\n  0x6b46, 0x7acf, 0x4854, 0x59dd, 0x2d62, 0x3ceb, 0x0e70, 0x1ff9,\n  0xf78f, 0xe606, 0xd49d, 0xc514, 0xb1ab, 0xa022, 0x92b9, 0x8330,\n  0x7bc7, 0x6a4e, 0x58d5, 0x495c, 0x3de3, 0x2c6a, 0x1ef1, 0x0f78\n];\n\nif (typeof Int32Array !== 'undefined') TABLE = new Int32Array(TABLE);\n\nconst crc16kermit = defineCrc('kermit', function(buf, previous) {\n  if (!Buffer.isBuffer(buf)) buf = createBuffer(buf);\n\n  let crc = typeof previous !== 'undefined' ? ~~previous : 0x0000;\n\n  for (let index = 0; index < buf.length; index++) {\n    const byte = buf[index];\n    crc = (TABLE[(crc ^ byte) & 0xff] ^ (crc >> 8)) & 0xffff;\n  }\n\n  return crc;\n});\n\nexport default crc16kermit;\n","import { Buffer } from 'buffer';\nimport createBuffer from './create_buffer';\nimport defineCrc from './define_crc';\n\n// Generated by `./pycrc.py --algorithm=table-drive --model=crc-24 --generate=c`\n// prettier-ignore\nlet TABLE = [\n  0x000000, 0x864cfb, 0x8ad50d, 0x0c99f6, 0x93e6e1, 0x15aa1a, 0x1933ec, 0x9f7f17,\n  0xa18139, 0x27cdc2, 0x2b5434, 0xad18cf, 0x3267d8, 0xb42b23, 0xb8b2d5, 0x3efe2e,\n  0xc54e89, 0x430272, 0x4f9b84, 0xc9d77f, 0x56a868, 0xd0e493, 0xdc7d65, 0x5a319e,\n  0x64cfb0, 0xe2834b, 0xee1abd, 0x685646, 0xf72951, 0x7165aa, 0x7dfc5c, 0xfbb0a7,\n  0x0cd1e9, 0x8a9d12, 0x8604e4, 0x00481f, 0x9f3708, 0x197bf3, 0x15e205, 0x93aefe,\n  0xad50d0, 0x2b1c2b, 0x2785dd, 0xa1c926, 0x3eb631, 0xb8faca, 0xb4633c, 0x322fc7,\n  0xc99f60, 0x4fd39b, 0x434a6d, 0xc50696, 0x5a7981, 0xdc357a, 0xd0ac8c, 0x56e077,\n  0x681e59, 0xee52a2, 0xe2cb54, 0x6487af, 0xfbf8b8, 0x7db443, 0x712db5, 0xf7614e,\n  0x19a3d2, 0x9fef29, 0x9376df, 0x153a24, 0x8a4533, 0x0c09c8, 0x00903e, 0x86dcc5,\n  0xb822eb, 0x3e6e10, 0x32f7e6, 0xb4bb1d, 0x2bc40a, 0xad88f1, 0xa11107, 0x275dfc,\n  0xdced5b, 0x5aa1a0, 0x563856, 0xd074ad, 0x4f0bba, 0xc94741, 0xc5deb7, 0x43924c,\n  0x7d6c62, 0xfb2099, 0xf7b96f, 0x71f594, 0xee8a83, 0x68c678, 0x645f8e, 0xe21375,\n  0x15723b, 0x933ec0, 0x9fa736, 0x19ebcd, 0x8694da, 0x00d821, 0x0c41d7, 0x8a0d2c,\n  0xb4f302, 0x32bff9, 0x3e260f, 0xb86af4, 0x2715e3, 0xa15918, 0xadc0ee, 0x2b8c15,\n  0xd03cb2, 0x567049, 0x5ae9bf, 0xdca544, 0x43da53, 0xc596a8, 0xc90f5e, 0x4f43a5,\n  0x71bd8b, 0xf7f170, 0xfb6886, 0x7d247d, 0xe25b6a, 0x641791, 0x688e67, 0xeec29c,\n  0x3347a4, 0xb50b5f, 0xb992a9, 0x3fde52, 0xa0a145, 0x26edbe, 0x2a7448, 0xac38b3,\n  0x92c69d, 0x148a66, 0x181390, 0x9e5f6b, 0x01207c, 0x876c87, 0x8bf571, 0x0db98a,\n  0xf6092d, 0x7045d6, 0x7cdc20, 0xfa90db, 0x65efcc, 0xe3a337, 0xef3ac1, 0x69763a,\n  0x578814, 0xd1c4ef, 0xdd5d19, 0x5b11e2, 0xc46ef5, 0x42220e, 0x4ebbf8, 0xc8f703,\n  0x3f964d, 0xb9dab6, 0xb54340, 0x330fbb, 0xac70ac, 0x2a3c57, 0x26a5a1, 0xa0e95a,\n  0x9e1774, 0x185b8f, 0x14c279, 0x928e82, 0x0df195, 0x8bbd6e, 0x872498, 0x016863,\n  0xfad8c4, 0x7c943f, 0x700dc9, 0xf64132, 0x693e25, 0xef72de, 0xe3eb28, 0x65a7d3,\n  0x5b59fd, 0xdd1506, 0xd18cf0, 0x57c00b, 0xc8bf1c, 0x4ef3e7, 0x426a11, 0xc426ea,\n  0x2ae476, 0xaca88d, 0xa0317b, 0x267d80, 0xb90297, 0x3f4e6c, 0x33d79a, 0xb59b61,\n  0x8b654f, 0x0d29b4, 0x01b042, 0x87fcb9, 0x1883ae, 0x9ecf55, 0x9256a3, 0x141a58,\n  0xefaaff, 0x69e604, 0x657ff2, 0xe33309, 0x7c4c1e, 0xfa00e5, 0xf69913, 0x70d5e8,\n  0x4e2bc6, 0xc8673d, 0xc4fecb, 0x42b230, 0xddcd27, 0x5b81dc, 0x57182a, 0xd154d1,\n  0x26359f, 0xa07964, 0xace092, 0x2aac69, 0xb5d37e, 0x339f85, 0x3f0673, 0xb94a88,\n  0x87b4a6, 0x01f85d, 0x0d61ab, 0x8b2d50, 0x145247, 0x921ebc, 0x9e874a, 0x18cbb1,\n  0xe37b16, 0x6537ed, 0x69ae1b, 0xefe2e0, 0x709df7, 0xf6d10c, 0xfa48fa, 0x7c0401,\n  0x42fa2f, 0xc4b6d4, 0xc82f22, 0x4e63d9, 0xd11cce, 0x575035, 0x5bc9c3, 0xdd8538\n]\n\nif (typeof Int32Array !== 'undefined') TABLE = new Int32Array(TABLE);\n\nconst crc24 = defineCrc('crc-24', function(buf, previous) {\n  if (!Buffer.isBuffer(buf)) buf = createBuffer(buf);\n\n  let crc = typeof previous !== 'undefined' ? ~~previous : 0xb704ce;\n\n  for (let index = 0; index < buf.length; index++) {\n    const byte = buf[index];\n    crc = (TABLE[((crc >> 16) ^ byte) & 0xff] ^ (crc << 8)) & 0xffffff;\n  }\n\n  return crc;\n});\n\nexport default crc24;\n","import { Buffer } from 'buffer';\nimport createBuffer from './create_buffer';\nimport defineCrc from './define_crc';\n\n// Generated by `./pycrc.py --algorithm=table-driven --model=crc-32 --generate=c`\n// prettier-ignore\nlet TABLE = [\n  0x00000000, 0x77073096, 0xee0e612c, 0x990951ba,\n  0x076dc419, 0x706af48f, 0xe963a535, 0x9e6495a3,\n  0x0edb8832, 0x79dcb8a4, 0xe0d5e91e, 0x97d2d988,\n  0x09b64c2b, 0x7eb17cbd, 0xe7b82d07, 0x90bf1d91,\n  0x1db71064, 0x6ab020f2, 0xf3b97148, 0x84be41de,\n  0x1adad47d, 0x6ddde4eb, 0xf4d4b551, 0x83d385c7,\n  0x136c9856, 0x646ba8c0, 0xfd62f97a, 0x8a65c9ec,\n  0x14015c4f, 0x63066cd9, 0xfa0f3d63, 0x8d080df5,\n  0x3b6e20c8, 0x4c69105e, 0xd56041e4, 0xa2677172,\n  0x3c03e4d1, 0x4b04d447, 0xd20d85fd, 0xa50ab56b,\n  0x35b5a8fa, 0x42b2986c, 0xdbbbc9d6, 0xacbcf940,\n  0x32d86ce3, 0x45df5c75, 0xdcd60dcf, 0xabd13d59,\n  0x26d930ac, 0x51de003a, 0xc8d75180, 0xbfd06116,\n  0x21b4f4b5, 0x56b3c423, 0xcfba9599, 0xb8bda50f,\n  0x2802b89e, 0x5f058808, 0xc60cd9b2, 0xb10be924,\n  0x2f6f7c87, 0x58684c11, 0xc1611dab, 0xb6662d3d,\n  0x76dc4190, 0x01db7106, 0x98d220bc, 0xefd5102a,\n  0x71b18589, 0x06b6b51f, 0x9fbfe4a5, 0xe8b8d433,\n  0x7807c9a2, 0x0f00f934, 0x9609a88e, 0xe10e9818,\n  0x7f6a0dbb, 0x086d3d2d, 0x91646c97, 0xe6635c01,\n  0x6b6b51f4, 0x1c6c6162, 0x856530d8, 0xf262004e,\n  0x6c0695ed, 0x1b01a57b, 0x8208f4c1, 0xf50fc457,\n  0x65b0d9c6, 0x12b7e950, 0x8bbeb8ea, 0xfcb9887c,\n  0x62dd1ddf, 0x15da2d49, 0x8cd37cf3, 0xfbd44c65,\n  0x4db26158, 0x3ab551ce, 0xa3bc0074, 0xd4bb30e2,\n  0x4adfa541, 0x3dd895d7, 0xa4d1c46d, 0xd3d6f4fb,\n  0x4369e96a, 0x346ed9fc, 0xad678846, 0xda60b8d0,\n  0x44042d73, 0x33031de5, 0xaa0a4c5f, 0xdd0d7cc9,\n  0x5005713c, 0x270241aa, 0xbe0b1010, 0xc90c2086,\n  0x5768b525, 0x206f85b3, 0xb966d409, 0xce61e49f,\n  0x5edef90e, 0x29d9c998, 0xb0d09822, 0xc7d7a8b4,\n  0x59b33d17, 0x2eb40d81, 0xb7bd5c3b, 0xc0ba6cad,\n  0xedb88320, 0x9abfb3b6, 0x03b6e20c, 0x74b1d29a,\n  0xead54739, 0x9dd277af, 0x04db2615, 0x73dc1683,\n  0xe3630b12, 0x94643b84, 0x0d6d6a3e, 0x7a6a5aa8,\n  0xe40ecf0b, 0x9309ff9d, 0x0a00ae27, 0x7d079eb1,\n  0xf00f9344, 0x8708a3d2, 0x1e01f268, 0x6906c2fe,\n  0xf762575d, 0x806567cb, 0x196c3671, 0x6e6b06e7,\n  0xfed41b76, 0x89d32be0, 0x10da7a5a, 0x67dd4acc,\n  0xf9b9df6f, 0x8ebeeff9, 0x17b7be43, 0x60b08ed5,\n  0xd6d6a3e8, 0xa1d1937e, 0x38d8c2c4, 0x4fdff252,\n  0xd1bb67f1, 0xa6bc5767, 0x3fb506dd, 0x48b2364b,\n  0xd80d2bda, 0xaf0a1b4c, 0x36034af6, 0x41047a60,\n  0xdf60efc3, 0xa867df55, 0x316e8eef, 0x4669be79,\n  0xcb61b38c, 0xbc66831a, 0x256fd2a0, 0x5268e236,\n  0xcc0c7795, 0xbb0b4703, 0x220216b9, 0x5505262f,\n  0xc5ba3bbe, 0xb2bd0b28, 0x2bb45a92, 0x5cb36a04,\n  0xc2d7ffa7, 0xb5d0cf31, 0x2cd99e8b, 0x5bdeae1d,\n  0x9b64c2b0, 0xec63f226, 0x756aa39c, 0x026d930a,\n  0x9c0906a9, 0xeb0e363f, 0x72076785, 0x05005713,\n  0x95bf4a82, 0xe2b87a14, 0x7bb12bae, 0x0cb61b38,\n  0x92d28e9b, 0xe5d5be0d, 0x7cdcefb7, 0x0bdbdf21,\n  0x86d3d2d4, 0xf1d4e242, 0x68ddb3f8, 0x1fda836e,\n  0x81be16cd, 0xf6b9265b, 0x6fb077e1, 0x18b74777,\n  0x88085ae6, 0xff0f6a70, 0x66063bca, 0x11010b5c,\n  0x8f659eff, 0xf862ae69, 0x616bffd3, 0x166ccf45,\n  0xa00ae278, 0xd70dd2ee, 0x4e048354, 0x3903b3c2,\n  0xa7672661, 0xd06016f7, 0x4969474d, 0x3e6e77db,\n  0xaed16a4a, 0xd9d65adc, 0x40df0b66, 0x37d83bf0,\n  0xa9bcae53, 0xdebb9ec5, 0x47b2cf7f, 0x30b5ffe9,\n  0xbdbdf21c, 0xcabac28a, 0x53b39330, 0x24b4a3a6,\n  0xbad03605, 0xcdd70693, 0x54de5729, 0x23d967bf,\n  0xb3667a2e, 0xc4614ab8, 0x5d681b02, 0x2a6f2b94,\n  0xb40bbe37, 0xc30c8ea1, 0x5a05df1b, 0x2d02ef8d\n];\n\nif (typeof Int32Array !== 'undefined') TABLE = new Int32Array(TABLE);\n\nconst crc32 = defineCrc('crc-32', function(buf, previous) {\n  if (!Buffer.isBuffer(buf)) buf = createBuffer(buf);\n\n  let crc = previous === 0 ? 0 : ~~previous ^ -1;\n\n  for (let index = 0; index < buf.length; index++) {\n    const byte = buf[index];\n    crc = TABLE[(crc ^ byte) & 0xff] ^ (crc >>> 8);\n  }\n\n  return crc ^ -1;\n});\n\nexport default crc32;\n","import { Buffer } from 'buffer';\nimport createBuffer from './create_buffer';\nimport defineCrc from './define_crc';\n\n// Generated by `./pycrc.py --algorithm=table-driven --model=jam --generate=c`\n// prettier-ignore\nlet TABLE = [\n  0x00000000, 0x77073096, 0xee0e612c, 0x990951ba,\n  0x076dc419, 0x706af48f, 0xe963a535, 0x9e6495a3,\n  0x0edb8832, 0x79dcb8a4, 0xe0d5e91e, 0x97d2d988,\n  0x09b64c2b, 0x7eb17cbd, 0xe7b82d07, 0x90bf1d91,\n  0x1db71064, 0x6ab020f2, 0xf3b97148, 0x84be41de,\n  0x1adad47d, 0x6ddde4eb, 0xf4d4b551, 0x83d385c7,\n  0x136c9856, 0x646ba8c0, 0xfd62f97a, 0x8a65c9ec,\n  0x14015c4f, 0x63066cd9, 0xfa0f3d63, 0x8d080df5,\n  0x3b6e20c8, 0x4c69105e, 0xd56041e4, 0xa2677172,\n  0x3c03e4d1, 0x4b04d447, 0xd20d85fd, 0xa50ab56b,\n  0x35b5a8fa, 0x42b2986c, 0xdbbbc9d6, 0xacbcf940,\n  0x32d86ce3, 0x45df5c75, 0xdcd60dcf, 0xabd13d59,\n  0x26d930ac, 0x51de003a, 0xc8d75180, 0xbfd06116,\n  0x21b4f4b5, 0x56b3c423, 0xcfba9599, 0xb8bda50f,\n  0x2802b89e, 0x5f058808, 0xc60cd9b2, 0xb10be924,\n  0x2f6f7c87, 0x58684c11, 0xc1611dab, 0xb6662d3d,\n  0x76dc4190, 0x01db7106, 0x98d220bc, 0xefd5102a,\n  0x71b18589, 0x06b6b51f, 0x9fbfe4a5, 0xe8b8d433,\n  0x7807c9a2, 0x0f00f934, 0x9609a88e, 0xe10e9818,\n  0x7f6a0dbb, 0x086d3d2d, 0x91646c97, 0xe6635c01,\n  0x6b6b51f4, 0x1c6c6162, 0x856530d8, 0xf262004e,\n  0x6c0695ed, 0x1b01a57b, 0x8208f4c1, 0xf50fc457,\n  0x65b0d9c6, 0x12b7e950, 0x8bbeb8ea, 0xfcb9887c,\n  0x62dd1ddf, 0x15da2d49, 0x8cd37cf3, 0xfbd44c65,\n  0x4db26158, 0x3ab551ce, 0xa3bc0074, 0xd4bb30e2,\n  0x4adfa541, 0x3dd895d7, 0xa4d1c46d, 0xd3d6f4fb,\n  0x4369e96a, 0x346ed9fc, 0xad678846, 0xda60b8d0,\n  0x44042d73, 0x33031de5, 0xaa0a4c5f, 0xdd0d7cc9,\n  0x5005713c, 0x270241aa, 0xbe0b1010, 0xc90c2086,\n  0x5768b525, 0x206f85b3, 0xb966d409, 0xce61e49f,\n  0x5edef90e, 0x29d9c998, 0xb0d09822, 0xc7d7a8b4,\n  0x59b33d17, 0x2eb40d81, 0xb7bd5c3b, 0xc0ba6cad,\n  0xedb88320, 0x9abfb3b6, 0x03b6e20c, 0x74b1d29a,\n  0xead54739, 0x9dd277af, 0x04db2615, 0x73dc1683,\n  0xe3630b12, 0x94643b84, 0x0d6d6a3e, 0x7a6a5aa8,\n  0xe40ecf0b, 0x9309ff9d, 0x0a00ae27, 0x7d079eb1,\n  0xf00f9344, 0x8708a3d2, 0x1e01f268, 0x6906c2fe,\n  0xf762575d, 0x806567cb, 0x196c3671, 0x6e6b06e7,\n  0xfed41b76, 0x89d32be0, 0x10da7a5a, 0x67dd4acc,\n  0xf9b9df6f, 0x8ebeeff9, 0x17b7be43, 0x60b08ed5,\n  0xd6d6a3e8, 0xa1d1937e, 0x38d8c2c4, 0x4fdff252,\n  0xd1bb67f1, 0xa6bc5767, 0x3fb506dd, 0x48b2364b,\n  0xd80d2bda, 0xaf0a1b4c, 0x36034af6, 0x41047a60,\n  0xdf60efc3, 0xa867df55, 0x316e8eef, 0x4669be79,\n  0xcb61b38c, 0xbc66831a, 0x256fd2a0, 0x5268e236,\n  0xcc0c7795, 0xbb0b4703, 0x220216b9, 0x5505262f,\n  0xc5ba3bbe, 0xb2bd0b28, 0x2bb45a92, 0x5cb36a04,\n  0xc2d7ffa7, 0xb5d0cf31, 0x2cd99e8b, 0x5bdeae1d,\n  0x9b64c2b0, 0xec63f226, 0x756aa39c, 0x026d930a,\n  0x9c0906a9, 0xeb0e363f, 0x72076785, 0x05005713,\n  0x95bf4a82, 0xe2b87a14, 0x7bb12bae, 0x0cb61b38,\n  0x92d28e9b, 0xe5d5be0d, 0x7cdcefb7, 0x0bdbdf21,\n  0x86d3d2d4, 0xf1d4e242, 0x68ddb3f8, 0x1fda836e,\n  0x81be16cd, 0xf6b9265b, 0x6fb077e1, 0x18b74777,\n  0x88085ae6, 0xff0f6a70, 0x66063bca, 0x11010b5c,\n  0x8f659eff, 0xf862ae69, 0x616bffd3, 0x166ccf45,\n  0xa00ae278, 0xd70dd2ee, 0x4e048354, 0x3903b3c2,\n  0xa7672661, 0xd06016f7, 0x4969474d, 0x3e6e77db,\n  0xaed16a4a, 0xd9d65adc, 0x40df0b66, 0x37d83bf0,\n  0xa9bcae53, 0xdebb9ec5, 0x47b2cf7f, 0x30b5ffe9,\n  0xbdbdf21c, 0xcabac28a, 0x53b39330, 0x24b4a3a6,\n  0xbad03605, 0xcdd70693, 0x54de5729, 0x23d967bf,\n  0xb3667a2e, 0xc4614ab8, 0x5d681b02, 0x2a6f2b94,\n  0xb40bbe37, 0xc30c8ea1, 0x5a05df1b, 0x2d02ef8d\n];\n\nif (typeof Int32Array !== 'undefined') TABLE = new Int32Array(TABLE);\n\nconst crcjam = defineCrc('jam', function(buf, previous = -1) {\n  if (!Buffer.isBuffer(buf)) buf = createBuffer(buf);\n\n  let crc = previous === 0 ? 0 : ~~previous;\n\n  for (let index = 0; index < buf.length; index++) {\n    const byte = buf[index];\n    crc = TABLE[(crc ^ byte) & 0xff] ^ (crc >>> 8);\n  }\n\n  return crc;\n});\n\nexport default crcjam;\n","import crc1 from './crc1';\nimport crc8 from './crc8';\nimport crc81wire from './crc81wire';\nimport crc16 from './crc16';\nimport crc16ccitt from './crc16ccitt';\nimport crc16modbus from './crc16modbus';\nimport crc16xmodem from './crc16xmodem';\nimport crc16kermit from './crc16kermit';\nimport crc24 from './crc24';\nimport crc32 from './crc32';\nimport crcjam from './crcjam';\n\nexport { crc1 };\nexport { crc8 };\nexport { crc81wire };\nexport { crc16 };\nexport { crc16ccitt };\nexport { crc16modbus };\nexport { crc16xmodem };\nexport { crc16kermit };\nexport { crc24 };\nexport { crc32 };\nexport { crcjam };\n\nexport default {\n  crc1,\n  crc8,\n  crc81wire,\n  crc16,\n  crc16ccitt,\n  crc16modbus,\n  crc16xmodem,\n  crc16kermit,\n  crc24,\n  crc32,\n  crcjam,\n};\n","/**\r\n * node-crc32-stream\r\n *\r\n * Copyright (c) 2014 Chris Talkington, contributors.\r\n * Licensed under the MIT license.\r\n * https://github.com/archiverjs/node-crc32-stream/blob/master/LICENSE-MIT\r\n */\r\n\r\n 'use strict';\r\n\r\nconst {Transform} = require('readable-stream');\r\n\r\nconst {crc32} = require('crc');\r\n\r\nclass CRC32Stream extends Transform {\r\n  constructor(options) {\r\n    super(options);\r\n    this.checksum = Buffer.allocUnsafe(4);\r\n    this.checksum.writeInt32BE(0, 0);\r\n\r\n    this.rawSize = 0;\r\n  }\r\n\r\n  _transform(chunk, encoding, callback) {\r\n    if (chunk) {\r\n      this.checksum = crc32(chunk, this.checksum);\r\n      this.rawSize += chunk.length;\r\n    }\r\n\r\n    callback(null, chunk);\r\n  }\r\n\r\n  digest(encoding) {\r\n    const checksum = Buffer.allocUnsafe(4);\r\n    checksum.writeUInt32BE(this.checksum >>> 0, 0);\r\n    return encoding ? checksum.toString(encoding) : checksum;\r\n  }\r\n\r\n  hex() {\r\n    return this.digest('hex').toUpperCase();\r\n  }\r\n\r\n  size() {\r\n    return this.rawSize;\r\n  }\r\n}\r\n\r\nmodule.exports = CRC32Stream;\r\n","/**\r\n * node-crc32-stream\r\n *\r\n * Copyright (c) 2014 Chris Talkington, contributors.\r\n * Licensed under the MIT license.\r\n * https://github.com/archiverjs/node-crc32-stream/blob/master/LICENSE-MIT\r\n */\r\n\r\n'use strict';\r\n\r\nconst {DeflateRaw} = require('zlib');\r\n\r\nconst {crc32} = require('crc');\r\n\r\nclass DeflateCRC32Stream extends DeflateRaw {\r\n  constructor(options) {\r\n    super(options);\r\n\r\n    this.checksum = Buffer.allocUnsafe(4);\r\n    this.checksum.writeInt32BE(0, 0);\r\n\r\n    this.rawSize = 0;\r\n    this.compressedSize = 0;\r\n  }\r\n\r\n  push(chunk, encoding) {\r\n    if (chunk) {\r\n      this.compressedSize += chunk.length;\r\n    }\r\n\r\n    return super.push(chunk, encoding);\r\n  }\r\n\r\n  write(chunk, enc, cb) {\r\n    if (chunk) {\r\n      this.checksum = crc32(chunk, this.checksum);\r\n      this.rawSize += chunk.length;\r\n    }\r\n\r\n    return super.write(chunk, enc, cb);\r\n  }\r\n\r\n  digest(encoding) {\r\n    const checksum = Buffer.allocUnsafe(4);\r\n    checksum.writeUInt32BE(this.checksum >>> 0, 0);\r\n    return encoding ? checksum.toString(encoding) : checksum;\r\n  }\r\n\r\n  hex() {\r\n    return this.digest('hex').toUpperCase();\r\n  }\r\n\r\n  size(compressed = false) {\r\n    if (compressed) {\r\n      return this.compressedSize;\r\n    } else {\r\n      return this.rawSize;\r\n    }\r\n  }\r\n}\r\n\r\nmodule.exports = DeflateCRC32Stream;\r\n","/**\r\n * node-crc32-stream\r\n *\r\n * Copyright (c) 2014 Chris Talkington, contributors.\r\n * Licensed under the MIT license.\r\n * https://github.com/archiverjs/node-crc32-stream/blob/master/LICENSE-MIT\r\n */\r\n\r\n'use strict';\r\n\r\nmodule.exports = {\r\n  CRC32Stream: require('./crc32-stream'),\r\n  DeflateCRC32Stream: require('./deflate-crc32-stream')\r\n}\r\n","/**\r\n * node-compress-commons\r\n *\r\n * Copyright (c) 2014 Chris Talkington, contributors.\r\n * Licensed under the MIT license.\r\n * https://github.com/archiverjs/node-compress-commons/blob/master/LICENSE-MIT\r\n */\r\nvar inherits = require('util').inherits;\r\nvar crc32 = require('buffer-crc32');\r\nvar {CRC32Stream} = require('crc32-stream');\r\nvar {DeflateCRC32Stream} = require('crc32-stream');\r\n\r\nvar ArchiveOutputStream = require('../archive-output-stream');\r\nvar ZipArchiveEntry = require('./zip-archive-entry');\r\nvar GeneralPurposeBit = require('./general-purpose-bit');\r\n\r\nvar constants = require('./constants');\r\nvar util = require('../../util');\r\nvar zipUtil = require('./util');\r\n\r\nvar ZipArchiveOutputStream = module.exports = function(options) {\r\n  if (!(this instanceof ZipArchiveOutputStream)) {\r\n    return new ZipArchiveOutputStream(options);\r\n  }\r\n\r\n  options = this.options = this._defaults(options);\r\n\r\n  ArchiveOutputStream.call(this, options);\r\n\r\n  this._entry = null;\r\n  this._entries = [];\r\n  this._archive = {\r\n    centralLength: 0,\r\n    centralOffset: 0,\r\n    comment: '',\r\n    finish: false,\r\n    finished: false,\r\n    processing: false,\r\n    forceZip64: options.forceZip64,\r\n    forceLocalTime: options.forceLocalTime\r\n  };\r\n};\r\n\r\ninherits(ZipArchiveOutputStream, ArchiveOutputStream);\r\n\r\nZipArchiveOutputStream.prototype._afterAppend = function(ae) {\r\n  this._entries.push(ae);\r\n\r\n  if (ae.getGeneralPurposeBit().usesDataDescriptor()) {\r\n    this._writeDataDescriptor(ae);\r\n  }\r\n\r\n  this._archive.processing = false;\r\n  this._entry = null;\r\n\r\n  if (this._archive.finish && !this._archive.finished) {\r\n    this._finish();\r\n  }\r\n};\r\n\r\nZipArchiveOutputStream.prototype._appendBuffer = function(ae, source, callback) {\r\n  if (source.length === 0) {\r\n    ae.setMethod(constants.METHOD_STORED);\r\n  }\r\n\r\n  var method = ae.getMethod();\r\n\r\n  if (method === constants.METHOD_STORED) {\r\n    ae.setSize(source.length);\r\n    ae.setCompressedSize(source.length);\r\n    ae.setCrc(crc32.unsigned(source));\r\n  }\r\n\r\n  this._writeLocalFileHeader(ae);\r\n\r\n  if (method === constants.METHOD_STORED) {\r\n    this.write(source);\r\n    this._afterAppend(ae);\r\n    callback(null, ae);\r\n    return;\r\n  } else if (method === constants.METHOD_DEFLATED) {\r\n    this._smartStream(ae, callback).end(source);\r\n    return;\r\n  } else {\r\n    callback(new Error('compression method ' + method + ' not implemented'));\r\n    return;\r\n  }\r\n};\r\n\r\nZipArchiveOutputStream.prototype._appendStream = function(ae, source, callback) {\r\n  ae.getGeneralPurposeBit().useDataDescriptor(true);\r\n  ae.setVersionNeededToExtract(constants.MIN_VERSION_DATA_DESCRIPTOR);\r\n\r\n  this._writeLocalFileHeader(ae);\r\n\r\n  var smart = this._smartStream(ae, callback);\r\n  source.once('error', function(err) {\r\n    smart.emit('error', err);\r\n    smart.end();\r\n  })\r\n  source.pipe(smart);\r\n};\r\n\r\nZipArchiveOutputStream.prototype._defaults = function(o) {\r\n  if (typeof o !== 'object') {\r\n    o = {};\r\n  }\r\n\r\n  if (typeof o.zlib !== 'object') {\r\n    o.zlib = {};\r\n  }\r\n\r\n  if (typeof o.zlib.level !== 'number') {\r\n    o.zlib.level = constants.ZLIB_BEST_SPEED;\r\n  }\r\n\r\n  o.forceZip64 = !!o.forceZip64;\r\n  o.forceLocalTime = !!o.forceLocalTime;\r\n\r\n  return o;\r\n};\r\n\r\nZipArchiveOutputStream.prototype._finish = function() {\r\n  this._archive.centralOffset = this.offset;\r\n\r\n  this._entries.forEach(function(ae) {\r\n    this._writeCentralFileHeader(ae);\r\n  }.bind(this));\r\n\r\n  this._archive.centralLength = this.offset - this._archive.centralOffset;\r\n\r\n  if (this.isZip64()) {\r\n    this._writeCentralDirectoryZip64();\r\n  }\r\n\r\n  this._writeCentralDirectoryEnd();\r\n\r\n  this._archive.processing = false;\r\n  this._archive.finish = true;\r\n  this._archive.finished = true;\r\n  this.end();\r\n};\r\n\r\nZipArchiveOutputStream.prototype._normalizeEntry = function(ae) {\r\n  if (ae.getMethod() === -1) {\r\n    ae.setMethod(constants.METHOD_DEFLATED);\r\n  }\r\n\r\n  if (ae.getMethod() === constants.METHOD_DEFLATED) {\r\n    ae.getGeneralPurposeBit().useDataDescriptor(true);\r\n    ae.setVersionNeededToExtract(constants.MIN_VERSION_DATA_DESCRIPTOR);\r\n  }\r\n\r\n  if (ae.getTime() === -1) {\r\n    ae.setTime(new Date(), this._archive.forceLocalTime);\r\n  }\r\n\r\n  ae._offsets = {\r\n    file: 0,\r\n    data: 0,\r\n    contents: 0,\r\n  };\r\n};\r\n\r\nZipArchiveOutputStream.prototype._smartStream = function(ae, callback) {\r\n  var deflate = ae.getMethod() === constants.METHOD_DEFLATED;\r\n  var process = deflate ? new DeflateCRC32Stream(this.options.zlib) : new CRC32Stream();\r\n  var error = null;\r\n\r\n  function handleStuff() {\r\n    var digest = process.digest().readUInt32BE(0);\r\n    ae.setCrc(digest);\r\n    ae.setSize(process.size());\r\n    ae.setCompressedSize(process.size(true));\r\n    this._afterAppend(ae);\r\n    callback(error, ae);\r\n  }\r\n\r\n  process.once('end', handleStuff.bind(this));\r\n  process.once('error', function(err) {\r\n    error = err;\r\n  });\r\n\r\n  process.pipe(this, { end: false });\r\n\r\n  return process;\r\n};\r\n\r\nZipArchiveOutputStream.prototype._writeCentralDirectoryEnd = function() {\r\n  var records = this._entries.length;\r\n  var size = this._archive.centralLength;\r\n  var offset = this._archive.centralOffset;\r\n\r\n  if (this.isZip64()) {\r\n    records = constants.ZIP64_MAGIC_SHORT;\r\n    size = constants.ZIP64_MAGIC;\r\n    offset = constants.ZIP64_MAGIC;\r\n  }\r\n\r\n  // signature\r\n  this.write(zipUtil.getLongBytes(constants.SIG_EOCD));\r\n\r\n  // disk numbers\r\n  this.write(constants.SHORT_ZERO);\r\n  this.write(constants.SHORT_ZERO);\r\n\r\n  // number of entries\r\n  this.write(zipUtil.getShortBytes(records));\r\n  this.write(zipUtil.getShortBytes(records));\r\n\r\n  // length and location of CD\r\n  this.write(zipUtil.getLongBytes(size));\r\n  this.write(zipUtil.getLongBytes(offset));\r\n\r\n  // archive comment\r\n  var comment = this.getComment();\r\n  var commentLength = Buffer.byteLength(comment);\r\n  this.write(zipUtil.getShortBytes(commentLength));\r\n  this.write(comment);\r\n};\r\n\r\nZipArchiveOutputStream.prototype._writeCentralDirectoryZip64 = function() {\r\n  // signature\r\n  this.write(zipUtil.getLongBytes(constants.SIG_ZIP64_EOCD));\r\n\r\n  // size of the ZIP64 EOCD record\r\n  this.write(zipUtil.getEightBytes(44));\r\n\r\n  // version made by\r\n  this.write(zipUtil.getShortBytes(constants.MIN_VERSION_ZIP64));\r\n\r\n  // version to extract\r\n  this.write(zipUtil.getShortBytes(constants.MIN_VERSION_ZIP64));\r\n\r\n  // disk numbers\r\n  this.write(constants.LONG_ZERO);\r\n  this.write(constants.LONG_ZERO);\r\n\r\n  // number of entries\r\n  this.write(zipUtil.getEightBytes(this._entries.length));\r\n  this.write(zipUtil.getEightBytes(this._entries.length));\r\n\r\n  // length and location of CD\r\n  this.write(zipUtil.getEightBytes(this._archive.centralLength));\r\n  this.write(zipUtil.getEightBytes(this._archive.centralOffset));\r\n\r\n  // extensible data sector\r\n  // not implemented at this time\r\n\r\n  // end of central directory locator\r\n  this.write(zipUtil.getLongBytes(constants.SIG_ZIP64_EOCD_LOC));\r\n\r\n  // disk number holding the ZIP64 EOCD record\r\n  this.write(constants.LONG_ZERO);\r\n\r\n  // relative offset of the ZIP64 EOCD record\r\n  this.write(zipUtil.getEightBytes(this._archive.centralOffset + this._archive.centralLength));\r\n\r\n  // total number of disks\r\n  this.write(zipUtil.getLongBytes(1));\r\n};\r\n\r\nZipArchiveOutputStream.prototype._writeCentralFileHeader = function(ae) {\r\n  var gpb = ae.getGeneralPurposeBit();\r\n  var method = ae.getMethod();\r\n  var offsets = ae._offsets;\r\n\r\n  var size = ae.getSize();\r\n  var compressedSize = ae.getCompressedSize();\r\n\r\n  if (ae.isZip64() || offsets.file > constants.ZIP64_MAGIC) {\r\n    size = constants.ZIP64_MAGIC;\r\n    compressedSize = constants.ZIP64_MAGIC;\r\n\r\n    ae.setVersionNeededToExtract(constants.MIN_VERSION_ZIP64);\r\n\r\n    var extraBuf = Buffer.concat([\r\n      zipUtil.getShortBytes(constants.ZIP64_EXTRA_ID),\r\n      zipUtil.getShortBytes(24),\r\n      zipUtil.getEightBytes(ae.getSize()),\r\n      zipUtil.getEightBytes(ae.getCompressedSize()),\r\n      zipUtil.getEightBytes(offsets.file)\r\n    ], 28);\r\n\r\n    ae.setExtra(extraBuf);\r\n  }\r\n\r\n  // signature\r\n  this.write(zipUtil.getLongBytes(constants.SIG_CFH));\r\n\r\n  // version made by\r\n  this.write(zipUtil.getShortBytes((ae.getPlatform() << 8) | constants.VERSION_MADEBY));\r\n\r\n  // version to extract and general bit flag\r\n  this.write(zipUtil.getShortBytes(ae.getVersionNeededToExtract()));\r\n  this.write(gpb.encode());\r\n\r\n  // compression method\r\n  this.write(zipUtil.getShortBytes(method));\r\n\r\n  // datetime\r\n  this.write(zipUtil.getLongBytes(ae.getTimeDos()));\r\n\r\n  // crc32 checksum\r\n  this.write(zipUtil.getLongBytes(ae.getCrc()));\r\n\r\n  // sizes\r\n  this.write(zipUtil.getLongBytes(compressedSize));\r\n  this.write(zipUtil.getLongBytes(size));\r\n\r\n  var name = ae.getName();\r\n  var comment = ae.getComment();\r\n  var extra = ae.getCentralDirectoryExtra();\r\n\r\n  if (gpb.usesUTF8ForNames()) {\r\n    name = Buffer.from(name);\r\n    comment = Buffer.from(comment);\r\n  }\r\n\r\n  // name length\r\n  this.write(zipUtil.getShortBytes(name.length));\r\n\r\n  // extra length\r\n  this.write(zipUtil.getShortBytes(extra.length));\r\n\r\n  // comments length\r\n  this.write(zipUtil.getShortBytes(comment.length));\r\n\r\n  // disk number start\r\n  this.write(constants.SHORT_ZERO);\r\n\r\n  // internal attributes\r\n  this.write(zipUtil.getShortBytes(ae.getInternalAttributes()));\r\n\r\n  // external attributes\r\n  this.write(zipUtil.getLongBytes(ae.getExternalAttributes()));\r\n\r\n  // relative offset of LFH\r\n  if (offsets.file > constants.ZIP64_MAGIC) {\r\n    this.write(zipUtil.getLongBytes(constants.ZIP64_MAGIC));\r\n  } else {\r\n    this.write(zipUtil.getLongBytes(offsets.file));\r\n  }\r\n\r\n  // name\r\n  this.write(name);\r\n\r\n  // extra\r\n  this.write(extra);\r\n\r\n  // comment\r\n  this.write(comment);\r\n};\r\n\r\nZipArchiveOutputStream.prototype._writeDataDescriptor = function(ae) {\r\n  // signature\r\n  this.write(zipUtil.getLongBytes(constants.SIG_DD));\r\n\r\n  // crc32 checksum\r\n  this.write(zipUtil.getLongBytes(ae.getCrc()));\r\n\r\n  // sizes\r\n  if (ae.isZip64()) {\r\n    this.write(zipUtil.getEightBytes(ae.getCompressedSize()));\r\n    this.write(zipUtil.getEightBytes(ae.getSize()));\r\n  } else {\r\n    this.write(zipUtil.getLongBytes(ae.getCompressedSize()));\r\n    this.write(zipUtil.getLongBytes(ae.getSize()));\r\n  }\r\n};\r\n\r\nZipArchiveOutputStream.prototype._writeLocalFileHeader = function(ae) {\r\n  var gpb = ae.getGeneralPurposeBit();\r\n  var method = ae.getMethod();\r\n  var name = ae.getName();\r\n  var extra = ae.getLocalFileDataExtra();\r\n\r\n  if (ae.isZip64()) {\r\n    gpb.useDataDescriptor(true);\r\n    ae.setVersionNeededToExtract(constants.MIN_VERSION_ZIP64);\r\n  }\r\n\r\n  if (gpb.usesUTF8ForNames()) {\r\n    name = Buffer.from(name);\r\n  }\r\n\r\n  ae._offsets.file = this.offset;\r\n\r\n  // signature\r\n  this.write(zipUtil.getLongBytes(constants.SIG_LFH));\r\n\r\n  // version to extract and general bit flag\r\n  this.write(zipUtil.getShortBytes(ae.getVersionNeededToExtract()));\r\n  this.write(gpb.encode());\r\n\r\n  // compression method\r\n  this.write(zipUtil.getShortBytes(method));\r\n\r\n  // datetime\r\n  this.write(zipUtil.getLongBytes(ae.getTimeDos()));\r\n\r\n  ae._offsets.data = this.offset;\r\n\r\n  // crc32 checksum and sizes\r\n  if (gpb.usesDataDescriptor()) {\r\n    this.write(constants.LONG_ZERO);\r\n    this.write(constants.LONG_ZERO);\r\n    this.write(constants.LONG_ZERO);\r\n  } else {\r\n    this.write(zipUtil.getLongBytes(ae.getCrc()));\r\n    this.write(zipUtil.getLongBytes(ae.getCompressedSize()));\r\n    this.write(zipUtil.getLongBytes(ae.getSize()));\r\n  }\r\n\r\n  // name length\r\n  this.write(zipUtil.getShortBytes(name.length));\r\n\r\n  // extra length\r\n  this.write(zipUtil.getShortBytes(extra.length));\r\n\r\n  // name\r\n  this.write(name);\r\n\r\n  // extra\r\n  this.write(extra);\r\n\r\n  ae._offsets.contents = this.offset;\r\n};\r\n\r\nZipArchiveOutputStream.prototype.getComment = function(comment) {\r\n  return this._archive.comment !== null ? this._archive.comment : '';\r\n};\r\n\r\nZipArchiveOutputStream.prototype.isZip64 = function() {\r\n  return this._archive.forceZip64 || this._entries.length > constants.ZIP64_MAGIC_SHORT || this._archive.centralLength > constants.ZIP64_MAGIC || this._archive.centralOffset > constants.ZIP64_MAGIC;\r\n};\r\n\r\nZipArchiveOutputStream.prototype.setComment = function(comment) {\r\n  this._archive.comment = comment;\r\n};\r\n","/**\r\n * node-compress-commons\r\n *\r\n * Copyright (c) 2014 Chris Talkington, contributors.\r\n * Licensed under the MIT license.\r\n * https://github.com/archiverjs/node-compress-commons/blob/master/LICENSE-MIT\r\n */\r\nmodule.exports = {\r\n  ArchiveEntry: require('./archivers/archive-entry'),\r\n  ZipArchiveEntry: require('./archivers/zip/zip-archive-entry'),\r\n  ArchiveOutputStream: require('./archivers/archive-output-stream'),\r\n  ZipArchiveOutputStream: require('./archivers/zip/zip-archive-output-stream')\r\n};","/**\n * ZipStream\n *\n * @ignore\n * @license [MIT]{@link https://github.com/archiverjs/node-zip-stream/blob/master/LICENSE}\n * @copyright (c) 2014 Chris Talkington, contributors.\n */\nvar inherits = require('util').inherits;\n\nvar ZipArchiveOutputStream = require('compress-commons').ZipArchiveOutputStream;\nvar ZipArchiveEntry = require('compress-commons').ZipArchiveEntry;\n\nvar util = require('archiver-utils');\n\n/**\n * @constructor\n * @extends external:ZipArchiveOutputStream\n * @param {Object} [options]\n * @param {String} [options.comment] Sets the zip archive comment.\n * @param {Boolean} [options.forceLocalTime=false] Forces the archive to contain local file times instead of UTC.\n * @param {Boolean} [options.forceZip64=false] Forces the archive to contain ZIP64 headers.\n * @param {Boolean} [options.store=false] Sets the compression method to STORE.\n * @param {Object} [options.zlib] Passed to [zlib]{@link https://nodejs.org/api/zlib.html#zlib_class_options}\n * to control compression.\n */\nvar ZipStream = module.exports = function(options) {\n  if (!(this instanceof ZipStream)) {\n    return new ZipStream(options);\n  }\n\n  options = this.options = options || {};\n  options.zlib = options.zlib || {};\n\n  ZipArchiveOutputStream.call(this, options);\n\n  if (typeof options.level === 'number' && options.level >= 0) {\n    options.zlib.level = options.level;\n    delete options.level;\n  }\n\n  if (!options.forceZip64 && typeof options.zlib.level === 'number' && options.zlib.level === 0) {\n    options.store = true;\n  }\n\n  if (options.comment && options.comment.length > 0) {\n    this.setComment(options.comment);\n  }\n};\n\ninherits(ZipStream, ZipArchiveOutputStream);\n\n/**\n * Normalizes entry data with fallbacks for key properties.\n *\n * @private\n * @param  {Object} data\n * @return {Object}\n */\nZipStream.prototype._normalizeFileData = function(data) {\n  data = util.defaults(data, {\n    type: 'file',\n    name: null,\n    linkname: null,\n    date: null,\n    mode: null,\n    store: this.options.store,\n    comment: ''\n  });\n\n  var isDir = data.type === 'directory';\n  var isSymlink = data.type === 'symlink';\n\n  if (data.name) {\n    data.name = util.sanitizePath(data.name);\n\n    if (!isSymlink && data.name.slice(-1) === '/') {\n      isDir = true;\n      data.type = 'directory';\n    } else if (isDir) {\n      data.name += '/';\n    }\n  }\n\n  if (isDir || isSymlink) {\n    data.store = true;\n  }\n\n  data.date = util.dateify(data.date);\n\n  return data;\n};\n\n/**\n * Appends an entry given an input source (text string, buffer, or stream).\n *\n * @param  {(Buffer|Stream|String)} source The input source.\n * @param  {Object} data\n * @param  {String} data.name Sets the entry name including internal path.\n * @param  {String} [data.comment] Sets the entry comment.\n * @param  {(String|Date)} [data.date=NOW()] Sets the entry date.\n * @param  {Number} [data.mode=D:0755/F:0644] Sets the entry permissions.\n * @param  {Boolean} [data.store=options.store] Sets the compression method to STORE.\n * @param  {String} [data.type=file] Sets the entry type. Defaults to `directory`\n * if name ends with trailing slash.\n * @param  {Function} callback\n * @return this\n */\nZipStream.prototype.entry = function(source, data, callback) {\n  if (typeof callback !== 'function') {\n    callback = this._emitErrorCallback.bind(this);\n  }\n\n  data = this._normalizeFileData(data);\n\n  if (data.type !== 'file' && data.type !== 'directory' && data.type !== 'symlink') {\n    callback(new Error(data.type + ' entries not currently supported'));\n    return;\n  }\n\n  if (typeof data.name !== 'string' || data.name.length === 0) {\n    callback(new Error('entry name must be a non-empty string value'));\n    return;\n  }\n\n  if (data.type === 'symlink' && typeof data.linkname !== 'string') {\n    callback(new Error('entry linkname must be a non-empty string value when type equals symlink'));\n    return;\n  }\n\n  var entry = new ZipArchiveEntry(data.name);\n  entry.setTime(data.date, this.options.forceLocalTime);\n\n  if (data.store) {\n    entry.setMethod(0);\n  }\n\n  if (data.comment.length > 0) {\n    entry.setComment(data.comment);\n  }\n\n  if (data.type === 'symlink' && typeof data.mode !== 'number') {\n    data.mode = 40960; // 0120000\n  }\n\n  if (typeof data.mode === 'number') {\n    if (data.type === 'symlink') {\n      data.mode |= 40960;\n    }\n\n    entry.setUnixMode(data.mode);\n  }\n\n  if (data.type === 'symlink' && typeof data.linkname === 'string') {\n    source = Buffer.from(data.linkname);\n  }\n\n  return ZipArchiveOutputStream.prototype.entry.call(this, entry, source, callback);\n};\n\n/**\n * Finalizes the instance and prevents further appending to the archive\n * structure (queue will continue til drained).\n *\n * @return void\n */\nZipStream.prototype.finalize = function() {\n  this.finish();\n};\n\n/**\n * Returns the current number of bytes written to this stream.\n * @function ZipStream#getBytesWritten\n * @returns {Number}\n */\n\n/**\n * Compress Commons ZipArchiveOutputStream\n * @external ZipArchiveOutputStream\n * @see {@link https://github.com/archiverjs/node-compress-commons}\n */\n","/**\r\n * ZIP Format Plugin\r\n *\r\n * @module plugins/zip\r\n * @license [MIT]{@link https://github.com/archiverjs/node-archiver/blob/master/LICENSE}\r\n * @copyright (c) 2012-2014 Chris Talkington, contributors.\r\n */\r\nvar engine = require('zip-stream');\r\nvar util = require('archiver-utils');\r\n\r\n/**\r\n * @constructor\r\n * @param {ZipOptions} [options]\r\n * @param {String} [options.comment] Sets the zip archive comment.\r\n * @param {Boolean} [options.forceLocalTime=false] Forces the archive to contain local file times instead of UTC.\r\n * @param {Boolean} [options.forceZip64=false] Forces the archive to contain ZIP64 headers.\r\n * @param {Boolean} [options.store=false] Sets the compression method to STORE.\r\n * @param {Object} [options.zlib] Passed to [zlib]{@link https://nodejs.org/api/zlib.html#zlib_class_options}\r\n */\r\nvar Zip = function(options) {\r\n  if (!(this instanceof Zip)) {\r\n    return new Zip(options);\r\n  }\r\n\r\n  options = this.options = util.defaults(options, {\r\n    comment: '',\r\n    forceUTC: false,\r\n    store: false\r\n  });\r\n\r\n  this.supports = {\r\n    directory: true,\r\n    symlink: true\r\n  };\r\n\r\n  this.engine = new engine(options);\r\n};\r\n\r\n/**\r\n * @param  {(Buffer|Stream)} source\r\n * @param  {ZipEntryData} data\r\n * @param  {String} data.name Sets the entry name including internal path.\r\n * @param  {(String|Date)} [data.date=NOW()] Sets the entry date.\r\n * @param  {Number} [data.mode=D:0755/F:0644] Sets the entry permissions.\r\n * @param  {String} [data.prefix] Sets a path prefix for the entry name. Useful\r\n * when working with methods like `directory` or `glob`.\r\n * @param  {fs.Stats} [data.stats] Sets the fs stat data for this entry allowing\r\n * for reduction of fs stat calls when stat data is already known.\r\n * @param  {Boolean} [data.store=ZipOptions.store] Sets the compression method to STORE.\r\n * @param  {Function} callback\r\n * @return void\r\n */\r\nZip.prototype.append = function(source, data, callback) {\r\n  this.engine.entry(source, data, callback);\r\n};\r\n\r\n/**\r\n * @return void\r\n */\r\nZip.prototype.finalize = function() {\r\n  this.engine.finalize();\r\n};\r\n\r\n/**\r\n * @return this.engine\r\n */\r\nZip.prototype.on = function() {\r\n  return this.engine.on.apply(this.engine, arguments);\r\n};\r\n\r\n/**\r\n * @return this.engine\r\n */\r\nZip.prototype.pipe = function() {\r\n  return this.engine.pipe.apply(this.engine, arguments);\r\n};\r\n\r\n/**\r\n * @return this.engine\r\n */\r\nZip.prototype.unpipe = function() {\r\n  return this.engine.unpipe.apply(this.engine, arguments);\r\n};\r\n\r\nmodule.exports = Zip;\r\n\r\n/**\r\n * @typedef {Object} ZipOptions\r\n * @global\r\n * @property {String} [comment] Sets the zip archive comment.\r\n * @property {Boolean} [forceLocalTime=false] Forces the archive to contain local file times instead of UTC.\r\n * @property {Boolean} [forceZip64=false] Forces the archive to contain ZIP64 headers.\r\n * @property {Boolean} [store=false] Sets the compression method to STORE.\r\n * @property {Object} [zlib] Passed to [zlib]{@link https://nodejs.org/api/zlib.html#zlib_class_options}\r\n * to control compression.\r\n * @property {*} [*] See [zip-stream]{@link https://archiverjs.com/zip-stream/ZipStream.html} documentation for current list of properties.\r\n */\r\n\r\n/**\r\n * @typedef {Object} ZipEntryData\r\n * @global\r\n * @property {String} name Sets the entry name including internal path.\r\n * @property {(String|Date)} [date=NOW()] Sets the entry date.\r\n * @property {Number} [mode=D:0755/F:0644] Sets the entry permissions.\r\n * @property {String} [prefix] Sets a path prefix for the entry name. Useful\r\n * when working with methods like `directory` or `glob`.\r\n * @property {fs.Stats} [stats] Sets the fs stat data for this entry allowing\r\n * for reduction of fs stat calls when stat data is already known.\r\n * @property {Boolean} [store=ZipOptions.store] Sets the compression method to STORE.\r\n */\r\n\r\n/**\r\n * ZipStream Module\r\n * @external ZipStream\r\n * @see {@link https://www.archiverjs.com/zip-stream/ZipStream.html}\r\n */\r\n","'use strict'\n\nconst { Buffer } = require('buffer')\nconst symbol = Symbol.for('BufferList')\n\nfunction BufferList (buf) {\n  if (!(this instanceof BufferList)) {\n    return new BufferList(buf)\n  }\n\n  BufferList._init.call(this, buf)\n}\n\nBufferList._init = function _init (buf) {\n  Object.defineProperty(this, symbol, { value: true })\n\n  this._bufs = []\n  this.length = 0\n\n  if (buf) {\n    this.append(buf)\n  }\n}\n\nBufferList.prototype._new = function _new (buf) {\n  return new BufferList(buf)\n}\n\nBufferList.prototype._offset = function _offset (offset) {\n  if (offset === 0) {\n    return [0, 0]\n  }\n\n  let tot = 0\n\n  for (let i = 0; i < this._bufs.length; i++) {\n    const _t = tot + this._bufs[i].length\n    if (offset < _t || i === this._bufs.length - 1) {\n      return [i, offset - tot]\n    }\n    tot = _t\n  }\n}\n\nBufferList.prototype._reverseOffset = function (blOffset) {\n  const bufferId = blOffset[0]\n  let offset = blOffset[1]\n\n  for (let i = 0; i < bufferId; i++) {\n    offset += this._bufs[i].length\n  }\n\n  return offset\n}\n\nBufferList.prototype.get = function get (index) {\n  if (index > this.length || index < 0) {\n    return undefined\n  }\n\n  const offset = this._offset(index)\n\n  return this._bufs[offset[0]][offset[1]]\n}\n\nBufferList.prototype.slice = function slice (start, end) {\n  if (typeof start === 'number' && start < 0) {\n    start += this.length\n  }\n\n  if (typeof end === 'number' && end < 0) {\n    end += this.length\n  }\n\n  return this.copy(null, 0, start, end)\n}\n\nBufferList.prototype.copy = function copy (dst, dstStart, srcStart, srcEnd) {\n  if (typeof srcStart !== 'number' || srcStart < 0) {\n    srcStart = 0\n  }\n\n  if (typeof srcEnd !== 'number' || srcEnd > this.length) {\n    srcEnd = this.length\n  }\n\n  if (srcStart >= this.length) {\n    return dst || Buffer.alloc(0)\n  }\n\n  if (srcEnd <= 0) {\n    return dst || Buffer.alloc(0)\n  }\n\n  const copy = !!dst\n  const off = this._offset(srcStart)\n  const len = srcEnd - srcStart\n  let bytes = len\n  let bufoff = (copy && dstStart) || 0\n  let start = off[1]\n\n  // copy/slice everything\n  if (srcStart === 0 && srcEnd === this.length) {\n    if (!copy) {\n      // slice, but full concat if multiple buffers\n      return this._bufs.length === 1\n        ? this._bufs[0]\n        : Buffer.concat(this._bufs, this.length)\n    }\n\n    // copy, need to copy individual buffers\n    for (let i = 0; i < this._bufs.length; i++) {\n      this._bufs[i].copy(dst, bufoff)\n      bufoff += this._bufs[i].length\n    }\n\n    return dst\n  }\n\n  // easy, cheap case where it's a subset of one of the buffers\n  if (bytes <= this._bufs[off[0]].length - start) {\n    return copy\n      ? this._bufs[off[0]].copy(dst, dstStart, start, start + bytes)\n      : this._bufs[off[0]].slice(start, start + bytes)\n  }\n\n  if (!copy) {\n    // a slice, we need something to copy in to\n    dst = Buffer.allocUnsafe(len)\n  }\n\n  for (let i = off[0]; i < this._bufs.length; i++) {\n    const l = this._bufs[i].length - start\n\n    if (bytes > l) {\n      this._bufs[i].copy(dst, bufoff, start)\n      bufoff += l\n    } else {\n      this._bufs[i].copy(dst, bufoff, start, start + bytes)\n      bufoff += l\n      break\n    }\n\n    bytes -= l\n\n    if (start) {\n      start = 0\n    }\n  }\n\n  // safeguard so that we don't return uninitialized memory\n  if (dst.length > bufoff) return dst.slice(0, bufoff)\n\n  return dst\n}\n\nBufferList.prototype.shallowSlice = function shallowSlice (start, end) {\n  start = start || 0\n  end = typeof end !== 'number' ? this.length : end\n\n  if (start < 0) {\n    start += this.length\n  }\n\n  if (end < 0) {\n    end += this.length\n  }\n\n  if (start === end) {\n    return this._new()\n  }\n\n  const startOffset = this._offset(start)\n  const endOffset = this._offset(end)\n  const buffers = this._bufs.slice(startOffset[0], endOffset[0] + 1)\n\n  if (endOffset[1] === 0) {\n    buffers.pop()\n  } else {\n    buffers[buffers.length - 1] = buffers[buffers.length - 1].slice(0, endOffset[1])\n  }\n\n  if (startOffset[1] !== 0) {\n    buffers[0] = buffers[0].slice(startOffset[1])\n  }\n\n  return this._new(buffers)\n}\n\nBufferList.prototype.toString = function toString (encoding, start, end) {\n  return this.slice(start, end).toString(encoding)\n}\n\nBufferList.prototype.consume = function consume (bytes) {\n  // first, normalize the argument, in accordance with how Buffer does it\n  bytes = Math.trunc(bytes)\n  // do nothing if not a positive number\n  if (Number.isNaN(bytes) || bytes <= 0) return this\n\n  while (this._bufs.length) {\n    if (bytes >= this._bufs[0].length) {\n      bytes -= this._bufs[0].length\n      this.length -= this._bufs[0].length\n      this._bufs.shift()\n    } else {\n      this._bufs[0] = this._bufs[0].slice(bytes)\n      this.length -= bytes\n      break\n    }\n  }\n\n  return this\n}\n\nBufferList.prototype.duplicate = function duplicate () {\n  const copy = this._new()\n\n  for (let i = 0; i < this._bufs.length; i++) {\n    copy.append(this._bufs[i])\n  }\n\n  return copy\n}\n\nBufferList.prototype.append = function append (buf) {\n  if (buf == null) {\n    return this\n  }\n\n  if (buf.buffer) {\n    // append a view of the underlying ArrayBuffer\n    this._appendBuffer(Buffer.from(buf.buffer, buf.byteOffset, buf.byteLength))\n  } else if (Array.isArray(buf)) {\n    for (let i = 0; i < buf.length; i++) {\n      this.append(buf[i])\n    }\n  } else if (this._isBufferList(buf)) {\n    // unwrap argument into individual BufferLists\n    for (let i = 0; i < buf._bufs.length; i++) {\n      this.append(buf._bufs[i])\n    }\n  } else {\n    // coerce number arguments to strings, since Buffer(number) does\n    // uninitialized memory allocation\n    if (typeof buf === 'number') {\n      buf = buf.toString()\n    }\n\n    this._appendBuffer(Buffer.from(buf))\n  }\n\n  return this\n}\n\nBufferList.prototype._appendBuffer = function appendBuffer (buf) {\n  this._bufs.push(buf)\n  this.length += buf.length\n}\n\nBufferList.prototype.indexOf = function (search, offset, encoding) {\n  if (encoding === undefined && typeof offset === 'string') {\n    encoding = offset\n    offset = undefined\n  }\n\n  if (typeof search === 'function' || Array.isArray(search)) {\n    throw new TypeError('The \"value\" argument must be one of type string, Buffer, BufferList, or Uint8Array.')\n  } else if (typeof search === 'number') {\n    search = Buffer.from([search])\n  } else if (typeof search === 'string') {\n    search = Buffer.from(search, encoding)\n  } else if (this._isBufferList(search)) {\n    search = search.slice()\n  } else if (Array.isArray(search.buffer)) {\n    search = Buffer.from(search.buffer, search.byteOffset, search.byteLength)\n  } else if (!Buffer.isBuffer(search)) {\n    search = Buffer.from(search)\n  }\n\n  offset = Number(offset || 0)\n\n  if (isNaN(offset)) {\n    offset = 0\n  }\n\n  if (offset < 0) {\n    offset = this.length + offset\n  }\n\n  if (offset < 0) {\n    offset = 0\n  }\n\n  if (search.length === 0) {\n    return offset > this.length ? this.length : offset\n  }\n\n  const blOffset = this._offset(offset)\n  let blIndex = blOffset[0] // index of which internal buffer we're working on\n  let buffOffset = blOffset[1] // offset of the internal buffer we're working on\n\n  // scan over each buffer\n  for (; blIndex < this._bufs.length; blIndex++) {\n    const buff = this._bufs[blIndex]\n\n    while (buffOffset < buff.length) {\n      const availableWindow = buff.length - buffOffset\n\n      if (availableWindow >= search.length) {\n        const nativeSearchResult = buff.indexOf(search, buffOffset)\n\n        if (nativeSearchResult !== -1) {\n          return this._reverseOffset([blIndex, nativeSearchResult])\n        }\n\n        buffOffset = buff.length - search.length + 1 // end of native search window\n      } else {\n        const revOffset = this._reverseOffset([blIndex, buffOffset])\n\n        if (this._match(revOffset, search)) {\n          return revOffset\n        }\n\n        buffOffset++\n      }\n    }\n\n    buffOffset = 0\n  }\n\n  return -1\n}\n\nBufferList.prototype._match = function (offset, search) {\n  if (this.length - offset < search.length) {\n    return false\n  }\n\n  for (let searchOffset = 0; searchOffset < search.length; searchOffset++) {\n    if (this.get(offset + searchOffset) !== search[searchOffset]) {\n      return false\n    }\n  }\n  return true\n}\n\n;(function () {\n  const methods = {\n    readDoubleBE: 8,\n    readDoubleLE: 8,\n    readFloatBE: 4,\n    readFloatLE: 4,\n    readInt32BE: 4,\n    readInt32LE: 4,\n    readUInt32BE: 4,\n    readUInt32LE: 4,\n    readInt16BE: 2,\n    readInt16LE: 2,\n    readUInt16BE: 2,\n    readUInt16LE: 2,\n    readInt8: 1,\n    readUInt8: 1,\n    readIntBE: null,\n    readIntLE: null,\n    readUIntBE: null,\n    readUIntLE: null\n  }\n\n  for (const m in methods) {\n    (function (m) {\n      if (methods[m] === null) {\n        BufferList.prototype[m] = function (offset, byteLength) {\n          return this.slice(offset, offset + byteLength)[m](0, byteLength)\n        }\n      } else {\n        BufferList.prototype[m] = function (offset) {\n          return this.slice(offset, offset + methods[m])[m](0)\n        }\n      }\n    }(m))\n  }\n}())\n\n// Used internally by the class and also as an indicator of this object being\n// a `BufferList`. It's not possible to use `instanceof BufferList` in a browser\n// environment because there could be multiple different copies of the\n// BufferList class and some `BufferList`s might be `BufferList`s.\nBufferList.prototype._isBufferList = function _isBufferList (b) {\n  return b instanceof BufferList || BufferList.isBufferList(b)\n}\n\nBufferList.isBufferList = function isBufferList (b) {\n  return b != null && b[symbol]\n}\n\nmodule.exports = BufferList\n","'use strict'\n\nconst DuplexStream = require('readable-stream').Duplex\nconst inherits = require('inherits')\nconst BufferList = require('./BufferList')\n\nfunction BufferListStream (callback) {\n  if (!(this instanceof BufferListStream)) {\n    return new BufferListStream(callback)\n  }\n\n  if (typeof callback === 'function') {\n    this._callback = callback\n\n    const piper = function piper (err) {\n      if (this._callback) {\n        this._callback(err)\n        this._callback = null\n      }\n    }.bind(this)\n\n    this.on('pipe', function onPipe (src) {\n      src.on('error', piper)\n    })\n    this.on('unpipe', function onUnpipe (src) {\n      src.removeListener('error', piper)\n    })\n\n    callback = null\n  }\n\n  BufferList._init.call(this, callback)\n  DuplexStream.call(this)\n}\n\ninherits(BufferListStream, DuplexStream)\nObject.assign(BufferListStream.prototype, BufferList.prototype)\n\nBufferListStream.prototype._new = function _new (callback) {\n  return new BufferListStream(callback)\n}\n\nBufferListStream.prototype._write = function _write (buf, encoding, callback) {\n  this._appendBuffer(buf)\n\n  if (typeof callback === 'function') {\n    callback()\n  }\n}\n\nBufferListStream.prototype._read = function _read (size) {\n  if (!this.length) {\n    return this.push(null)\n  }\n\n  size = Math.min(size, this.length)\n  this.push(this.slice(0, size))\n  this.consume(size)\n}\n\nBufferListStream.prototype.end = function end (chunk) {\n  DuplexStream.prototype.end.call(this, chunk)\n\n  if (this._callback) {\n    this._callback(null, this.slice())\n    this._callback = null\n  }\n}\n\nBufferListStream.prototype._destroy = function _destroy (err, cb) {\n  this._bufs.length = 0\n  this.length = 0\n  cb(err)\n}\n\nBufferListStream.prototype._isBufferList = function _isBufferList (b) {\n  return b instanceof BufferListStream || b instanceof BufferList || BufferListStream.isBufferList(b)\n}\n\nBufferListStream.isBufferList = BufferList.isBufferList\n\nmodule.exports = BufferListStream\nmodule.exports.BufferListStream = BufferListStream\nmodule.exports.BufferList = BufferList\n","var alloc = Buffer.alloc\n\nvar ZEROS = '0000000000000000000'\nvar SEVENS = '7777777777777777777'\nvar ZERO_OFFSET = '0'.charCodeAt(0)\nvar USTAR_MAGIC = Buffer.from('ustar\\x00', 'binary')\nvar USTAR_VER = Buffer.from('00', 'binary')\nvar GNU_MAGIC = Buffer.from('ustar\\x20', 'binary')\nvar GNU_VER = Buffer.from('\\x20\\x00', 'binary')\nvar MASK = parseInt('7777', 8)\nvar MAGIC_OFFSET = 257\nvar VERSION_OFFSET = 263\n\nvar clamp = function (index, len, defaultValue) {\n  if (typeof index !== 'number') return defaultValue\n  index = ~~index // Coerce to integer.\n  if (index >= len) return len\n  if (index >= 0) return index\n  index += len\n  if (index >= 0) return index\n  return 0\n}\n\nvar toType = function (flag) {\n  switch (flag) {\n    case 0:\n      return 'file'\n    case 1:\n      return 'link'\n    case 2:\n      return 'symlink'\n    case 3:\n      return 'character-device'\n    case 4:\n      return 'block-device'\n    case 5:\n      return 'directory'\n    case 6:\n      return 'fifo'\n    case 7:\n      return 'contiguous-file'\n    case 72:\n      return 'pax-header'\n    case 55:\n      return 'pax-global-header'\n    case 27:\n      return 'gnu-long-link-path'\n    case 28:\n    case 30:\n      return 'gnu-long-path'\n  }\n\n  return null\n}\n\nvar toTypeflag = function (flag) {\n  switch (flag) {\n    case 'file':\n      return 0\n    case 'link':\n      return 1\n    case 'symlink':\n      return 2\n    case 'character-device':\n      return 3\n    case 'block-device':\n      return 4\n    case 'directory':\n      return 5\n    case 'fifo':\n      return 6\n    case 'contiguous-file':\n      return 7\n    case 'pax-header':\n      return 72\n  }\n\n  return 0\n}\n\nvar indexOf = function (block, num, offset, end) {\n  for (; offset < end; offset++) {\n    if (block[offset] === num) return offset\n  }\n  return end\n}\n\nvar cksum = function (block) {\n  var sum = 8 * 32\n  for (var i = 0; i < 148; i++) sum += block[i]\n  for (var j = 156; j < 512; j++) sum += block[j]\n  return sum\n}\n\nvar encodeOct = function (val, n) {\n  val = val.toString(8)\n  if (val.length > n) return SEVENS.slice(0, n) + ' '\n  else return ZEROS.slice(0, n - val.length) + val + ' '\n}\n\n/* Copied from the node-tar repo and modified to meet\n * tar-stream coding standard.\n *\n * Source: https://github.com/npm/node-tar/blob/51b6627a1f357d2eb433e7378e5f05e83b7aa6cd/lib/header.js#L349\n */\nfunction parse256 (buf) {\n  // first byte MUST be either 80 or FF\n  // 80 for positive, FF for 2's comp\n  var positive\n  if (buf[0] === 0x80) positive = true\n  else if (buf[0] === 0xFF) positive = false\n  else return null\n\n  // build up a base-256 tuple from the least sig to the highest\n  var tuple = []\n  for (var i = buf.length - 1; i > 0; i--) {\n    var byte = buf[i]\n    if (positive) tuple.push(byte)\n    else tuple.push(0xFF - byte)\n  }\n\n  var sum = 0\n  var l = tuple.length\n  for (i = 0; i < l; i++) {\n    sum += tuple[i] * Math.pow(256, i)\n  }\n\n  return positive ? sum : -1 * sum\n}\n\nvar decodeOct = function (val, offset, length) {\n  val = val.slice(offset, offset + length)\n  offset = 0\n\n  // If prefixed with 0x80 then parse as a base-256 integer\n  if (val[offset] & 0x80) {\n    return parse256(val)\n  } else {\n    // Older versions of tar can prefix with spaces\n    while (offset < val.length && val[offset] === 32) offset++\n    var end = clamp(indexOf(val, 32, offset, val.length), val.length, val.length)\n    while (offset < end && val[offset] === 0) offset++\n    if (end === offset) return 0\n    return parseInt(val.slice(offset, end).toString(), 8)\n  }\n}\n\nvar decodeStr = function (val, offset, length, encoding) {\n  return val.slice(offset, indexOf(val, 0, offset, offset + length)).toString(encoding)\n}\n\nvar addLength = function (str) {\n  var len = Buffer.byteLength(str)\n  var digits = Math.floor(Math.log(len) / Math.log(10)) + 1\n  if (len + digits >= Math.pow(10, digits)) digits++\n\n  return (len + digits) + str\n}\n\nexports.decodeLongPath = function (buf, encoding) {\n  return decodeStr(buf, 0, buf.length, encoding)\n}\n\nexports.encodePax = function (opts) { // TODO: encode more stuff in pax\n  var result = ''\n  if (opts.name) result += addLength(' path=' + opts.name + '\\n')\n  if (opts.linkname) result += addLength(' linkpath=' + opts.linkname + '\\n')\n  var pax = opts.pax\n  if (pax) {\n    for (var key in pax) {\n      result += addLength(' ' + key + '=' + pax[key] + '\\n')\n    }\n  }\n  return Buffer.from(result)\n}\n\nexports.decodePax = function (buf) {\n  var result = {}\n\n  while (buf.length) {\n    var i = 0\n    while (i < buf.length && buf[i] !== 32) i++\n    var len = parseInt(buf.slice(0, i).toString(), 10)\n    if (!len) return result\n\n    var b = buf.slice(i + 1, len - 1).toString()\n    var keyIndex = b.indexOf('=')\n    if (keyIndex === -1) return result\n    result[b.slice(0, keyIndex)] = b.slice(keyIndex + 1)\n\n    buf = buf.slice(len)\n  }\n\n  return result\n}\n\nexports.encode = function (opts) {\n  var buf = alloc(512)\n  var name = opts.name\n  var prefix = ''\n\n  if (opts.typeflag === 5 && name[name.length - 1] !== '/') name += '/'\n  if (Buffer.byteLength(name) !== name.length) return null // utf-8\n\n  while (Buffer.byteLength(name) > 100) {\n    var i = name.indexOf('/')\n    if (i === -1) return null\n    prefix += prefix ? '/' + name.slice(0, i) : name.slice(0, i)\n    name = name.slice(i + 1)\n  }\n\n  if (Buffer.byteLength(name) > 100 || Buffer.byteLength(prefix) > 155) return null\n  if (opts.linkname && Buffer.byteLength(opts.linkname) > 100) return null\n\n  buf.write(name)\n  buf.write(encodeOct(opts.mode & MASK, 6), 100)\n  buf.write(encodeOct(opts.uid, 6), 108)\n  buf.write(encodeOct(opts.gid, 6), 116)\n  buf.write(encodeOct(opts.size, 11), 124)\n  buf.write(encodeOct((opts.mtime.getTime() / 1000) | 0, 11), 136)\n\n  buf[156] = ZERO_OFFSET + toTypeflag(opts.type)\n\n  if (opts.linkname) buf.write(opts.linkname, 157)\n\n  USTAR_MAGIC.copy(buf, MAGIC_OFFSET)\n  USTAR_VER.copy(buf, VERSION_OFFSET)\n  if (opts.uname) buf.write(opts.uname, 265)\n  if (opts.gname) buf.write(opts.gname, 297)\n  buf.write(encodeOct(opts.devmajor || 0, 6), 329)\n  buf.write(encodeOct(opts.devminor || 0, 6), 337)\n\n  if (prefix) buf.write(prefix, 345)\n\n  buf.write(encodeOct(cksum(buf), 6), 148)\n\n  return buf\n}\n\nexports.decode = function (buf, filenameEncoding) {\n  var typeflag = buf[156] === 0 ? 0 : buf[156] - ZERO_OFFSET\n\n  var name = decodeStr(buf, 0, 100, filenameEncoding)\n  var mode = decodeOct(buf, 100, 8)\n  var uid = decodeOct(buf, 108, 8)\n  var gid = decodeOct(buf, 116, 8)\n  var size = decodeOct(buf, 124, 12)\n  var mtime = decodeOct(buf, 136, 12)\n  var type = toType(typeflag)\n  var linkname = buf[157] === 0 ? null : decodeStr(buf, 157, 100, filenameEncoding)\n  var uname = decodeStr(buf, 265, 32)\n  var gname = decodeStr(buf, 297, 32)\n  var devmajor = decodeOct(buf, 329, 8)\n  var devminor = decodeOct(buf, 337, 8)\n\n  var c = cksum(buf)\n\n  // checksum is still initial value if header was null.\n  if (c === 8 * 32) return null\n\n  // valid checksum\n  if (c !== decodeOct(buf, 148, 8)) throw new Error('Invalid tar header. Maybe the tar is corrupted or it needs to be gunzipped?')\n\n  if (USTAR_MAGIC.compare(buf, MAGIC_OFFSET, MAGIC_OFFSET + 6) === 0) {\n    // ustar (posix) format.\n    // prepend prefix, if present.\n    if (buf[345]) name = decodeStr(buf, 345, 155, filenameEncoding) + '/' + name\n  } else if (GNU_MAGIC.compare(buf, MAGIC_OFFSET, MAGIC_OFFSET + 6) === 0 &&\n             GNU_VER.compare(buf, VERSION_OFFSET, VERSION_OFFSET + 2) === 0) {\n    // 'gnu'/'oldgnu' format. Similar to ustar, but has support for incremental and\n    // multi-volume tarballs.\n  } else {\n    throw new Error('Invalid tar header: unknown format.')\n  }\n\n  // to support old tar versions that use trailing / to indicate dirs\n  if (typeflag === 0 && name && name[name.length - 1] === '/') typeflag = 5\n\n  return {\n    name,\n    mode,\n    uid,\n    gid,\n    size,\n    mtime: new Date(1000 * mtime),\n    type,\n    linkname,\n    uname,\n    gname,\n    devmajor,\n    devminor\n  }\n}\n","var util = require('util')\nvar bl = require('bl')\nvar headers = require('./headers')\n\nvar Writable = require('readable-stream').Writable\nvar PassThrough = require('readable-stream').PassThrough\n\nvar noop = function () {}\n\nvar overflow = function (size) {\n  size &= 511\n  return size && 512 - size\n}\n\nvar emptyStream = function (self, offset) {\n  var s = new Source(self, offset)\n  s.end()\n  return s\n}\n\nvar mixinPax = function (header, pax) {\n  if (pax.path) header.name = pax.path\n  if (pax.linkpath) header.linkname = pax.linkpath\n  if (pax.size) header.size = parseInt(pax.size, 10)\n  header.pax = pax\n  return header\n}\n\nvar Source = function (self, offset) {\n  this._parent = self\n  this.offset = offset\n  PassThrough.call(this, { autoDestroy: false })\n}\n\nutil.inherits(Source, PassThrough)\n\nSource.prototype.destroy = function (err) {\n  this._parent.destroy(err)\n}\n\nvar Extract = function (opts) {\n  if (!(this instanceof Extract)) return new Extract(opts)\n  Writable.call(this, opts)\n\n  opts = opts || {}\n\n  this._offset = 0\n  this._buffer = bl()\n  this._missing = 0\n  this._partial = false\n  this._onparse = noop\n  this._header = null\n  this._stream = null\n  this._overflow = null\n  this._cb = null\n  this._locked = false\n  this._destroyed = false\n  this._pax = null\n  this._paxGlobal = null\n  this._gnuLongPath = null\n  this._gnuLongLinkPath = null\n\n  var self = this\n  var b = self._buffer\n\n  var oncontinue = function () {\n    self._continue()\n  }\n\n  var onunlock = function (err) {\n    self._locked = false\n    if (err) return self.destroy(err)\n    if (!self._stream) oncontinue()\n  }\n\n  var onstreamend = function () {\n    self._stream = null\n    var drain = overflow(self._header.size)\n    if (drain) self._parse(drain, ondrain)\n    else self._parse(512, onheader)\n    if (!self._locked) oncontinue()\n  }\n\n  var ondrain = function () {\n    self._buffer.consume(overflow(self._header.size))\n    self._parse(512, onheader)\n    oncontinue()\n  }\n\n  var onpaxglobalheader = function () {\n    var size = self._header.size\n    self._paxGlobal = headers.decodePax(b.slice(0, size))\n    b.consume(size)\n    onstreamend()\n  }\n\n  var onpaxheader = function () {\n    var size = self._header.size\n    self._pax = headers.decodePax(b.slice(0, size))\n    if (self._paxGlobal) self._pax = Object.assign({}, self._paxGlobal, self._pax)\n    b.consume(size)\n    onstreamend()\n  }\n\n  var ongnulongpath = function () {\n    var size = self._header.size\n    this._gnuLongPath = headers.decodeLongPath(b.slice(0, size), opts.filenameEncoding)\n    b.consume(size)\n    onstreamend()\n  }\n\n  var ongnulonglinkpath = function () {\n    var size = self._header.size\n    this._gnuLongLinkPath = headers.decodeLongPath(b.slice(0, size), opts.filenameEncoding)\n    b.consume(size)\n    onstreamend()\n  }\n\n  var onheader = function () {\n    var offset = self._offset\n    var header\n    try {\n      header = self._header = headers.decode(b.slice(0, 512), opts.filenameEncoding)\n    } catch (err) {\n      self.emit('error', err)\n    }\n    b.consume(512)\n\n    if (!header) {\n      self._parse(512, onheader)\n      oncontinue()\n      return\n    }\n    if (header.type === 'gnu-long-path') {\n      self._parse(header.size, ongnulongpath)\n      oncontinue()\n      return\n    }\n    if (header.type === 'gnu-long-link-path') {\n      self._parse(header.size, ongnulonglinkpath)\n      oncontinue()\n      return\n    }\n    if (header.type === 'pax-global-header') {\n      self._parse(header.size, onpaxglobalheader)\n      oncontinue()\n      return\n    }\n    if (header.type === 'pax-header') {\n      self._parse(header.size, onpaxheader)\n      oncontinue()\n      return\n    }\n\n    if (self._gnuLongPath) {\n      header.name = self._gnuLongPath\n      self._gnuLongPath = null\n    }\n\n    if (self._gnuLongLinkPath) {\n      header.linkname = self._gnuLongLinkPath\n      self._gnuLongLinkPath = null\n    }\n\n    if (self._pax) {\n      self._header = header = mixinPax(header, self._pax)\n      self._pax = null\n    }\n\n    self._locked = true\n\n    if (!header.size || header.type === 'directory') {\n      self._parse(512, onheader)\n      self.emit('entry', header, emptyStream(self, offset), onunlock)\n      return\n    }\n\n    self._stream = new Source(self, offset)\n\n    self.emit('entry', header, self._stream, onunlock)\n    self._parse(header.size, onstreamend)\n    oncontinue()\n  }\n\n  this._onheader = onheader\n  this._parse(512, onheader)\n}\n\nutil.inherits(Extract, Writable)\n\nExtract.prototype.destroy = function (err) {\n  if (this._destroyed) return\n  this._destroyed = true\n\n  if (err) this.emit('error', err)\n  this.emit('close')\n  if (this._stream) this._stream.emit('close')\n}\n\nExtract.prototype._parse = function (size, onparse) {\n  if (this._destroyed) return\n  this._offset += size\n  this._missing = size\n  if (onparse === this._onheader) this._partial = false\n  this._onparse = onparse\n}\n\nExtract.prototype._continue = function () {\n  if (this._destroyed) return\n  var cb = this._cb\n  this._cb = noop\n  if (this._overflow) this._write(this._overflow, undefined, cb)\n  else cb()\n}\n\nExtract.prototype._write = function (data, enc, cb) {\n  if (this._destroyed) return\n\n  var s = this._stream\n  var b = this._buffer\n  var missing = this._missing\n  if (data.length) this._partial = true\n\n  // we do not reach end-of-chunk now. just forward it\n\n  if (data.length < missing) {\n    this._missing -= data.length\n    this._overflow = null\n    if (s) return s.write(data, cb)\n    b.append(data)\n    return cb()\n  }\n\n  // end-of-chunk. the parser should call cb.\n\n  this._cb = cb\n  this._missing = 0\n\n  var overflow = null\n  if (data.length > missing) {\n    overflow = data.slice(missing)\n    data = data.slice(0, missing)\n  }\n\n  if (s) s.end(data)\n  else b.append(data)\n\n  this._overflow = overflow\n  this._onparse()\n}\n\nExtract.prototype._final = function (cb) {\n  if (this._partial) return this.destroy(new Error('Unexpected end of data'))\n  cb()\n}\n\nmodule.exports = Extract\n","var constants = require('fs-constants')\nvar eos = require('end-of-stream')\nvar inherits = require('inherits')\nvar alloc = Buffer.alloc\n\nvar Readable = require('readable-stream').Readable\nvar Writable = require('readable-stream').Writable\nvar StringDecoder = require('string_decoder').StringDecoder\n\nvar headers = require('./headers')\n\nvar DMODE = parseInt('755', 8)\nvar FMODE = parseInt('644', 8)\n\nvar END_OF_TAR = alloc(1024)\n\nvar noop = function () {}\n\nvar overflow = function (self, size) {\n  size &= 511\n  if (size) self.push(END_OF_TAR.slice(0, 512 - size))\n}\n\nfunction modeToType (mode) {\n  switch (mode & constants.S_IFMT) {\n    case constants.S_IFBLK: return 'block-device'\n    case constants.S_IFCHR: return 'character-device'\n    case constants.S_IFDIR: return 'directory'\n    case constants.S_IFIFO: return 'fifo'\n    case constants.S_IFLNK: return 'symlink'\n  }\n\n  return 'file'\n}\n\nvar Sink = function (to) {\n  Writable.call(this)\n  this.written = 0\n  this._to = to\n  this._destroyed = false\n}\n\ninherits(Sink, Writable)\n\nSink.prototype._write = function (data, enc, cb) {\n  this.written += data.length\n  if (this._to.push(data)) return cb()\n  this._to._drain = cb\n}\n\nSink.prototype.destroy = function () {\n  if (this._destroyed) return\n  this._destroyed = true\n  this.emit('close')\n}\n\nvar LinkSink = function () {\n  Writable.call(this)\n  this.linkname = ''\n  this._decoder = new StringDecoder('utf-8')\n  this._destroyed = false\n}\n\ninherits(LinkSink, Writable)\n\nLinkSink.prototype._write = function (data, enc, cb) {\n  this.linkname += this._decoder.write(data)\n  cb()\n}\n\nLinkSink.prototype.destroy = function () {\n  if (this._destroyed) return\n  this._destroyed = true\n  this.emit('close')\n}\n\nvar Void = function () {\n  Writable.call(this)\n  this._destroyed = false\n}\n\ninherits(Void, Writable)\n\nVoid.prototype._write = function (data, enc, cb) {\n  cb(new Error('No body allowed for this entry'))\n}\n\nVoid.prototype.destroy = function () {\n  if (this._destroyed) return\n  this._destroyed = true\n  this.emit('close')\n}\n\nvar Pack = function (opts) {\n  if (!(this instanceof Pack)) return new Pack(opts)\n  Readable.call(this, opts)\n\n  this._drain = noop\n  this._finalized = false\n  this._finalizing = false\n  this._destroyed = false\n  this._stream = null\n}\n\ninherits(Pack, Readable)\n\nPack.prototype.entry = function (header, buffer, callback) {\n  if (this._stream) throw new Error('already piping an entry')\n  if (this._finalized || this._destroyed) return\n\n  if (typeof buffer === 'function') {\n    callback = buffer\n    buffer = null\n  }\n\n  if (!callback) callback = noop\n\n  var self = this\n\n  if (!header.size || header.type === 'symlink') header.size = 0\n  if (!header.type) header.type = modeToType(header.mode)\n  if (!header.mode) header.mode = header.type === 'directory' ? DMODE : FMODE\n  if (!header.uid) header.uid = 0\n  if (!header.gid) header.gid = 0\n  if (!header.mtime) header.mtime = new Date()\n\n  if (typeof buffer === 'string') buffer = Buffer.from(buffer)\n  if (Buffer.isBuffer(buffer)) {\n    header.size = buffer.length\n    this._encode(header)\n    var ok = this.push(buffer)\n    overflow(self, header.size)\n    if (ok) process.nextTick(callback)\n    else this._drain = callback\n    return new Void()\n  }\n\n  if (header.type === 'symlink' && !header.linkname) {\n    var linkSink = new LinkSink()\n    eos(linkSink, function (err) {\n      if (err) { // stream was closed\n        self.destroy()\n        return callback(err)\n      }\n\n      header.linkname = linkSink.linkname\n      self._encode(header)\n      callback()\n    })\n\n    return linkSink\n  }\n\n  this._encode(header)\n\n  if (header.type !== 'file' && header.type !== 'contiguous-file') {\n    process.nextTick(callback)\n    return new Void()\n  }\n\n  var sink = new Sink(this)\n\n  this._stream = sink\n\n  eos(sink, function (err) {\n    self._stream = null\n\n    if (err) { // stream was closed\n      self.destroy()\n      return callback(err)\n    }\n\n    if (sink.written !== header.size) { // corrupting tar\n      self.destroy()\n      return callback(new Error('size mismatch'))\n    }\n\n    overflow(self, header.size)\n    if (self._finalizing) self.finalize()\n    callback()\n  })\n\n  return sink\n}\n\nPack.prototype.finalize = function () {\n  if (this._stream) {\n    this._finalizing = true\n    return\n  }\n\n  if (this._finalized) return\n  this._finalized = true\n  this.push(END_OF_TAR)\n  this.push(null)\n}\n\nPack.prototype.destroy = function (err) {\n  if (this._destroyed) return\n  this._destroyed = true\n\n  if (err) this.emit('error', err)\n  this.emit('close')\n  if (this._stream && this._stream.destroy) this._stream.destroy()\n}\n\nPack.prototype._encode = function (header) {\n  if (!header.pax) {\n    var buf = headers.encode(header)\n    if (buf) {\n      this.push(buf)\n      return\n    }\n  }\n  this._encodePax(header)\n}\n\nPack.prototype._encodePax = function (header) {\n  var paxHeader = headers.encodePax({\n    name: header.name,\n    linkname: header.linkname,\n    pax: header.pax\n  })\n\n  var newHeader = {\n    name: 'PaxHeader',\n    mode: header.mode,\n    uid: header.uid,\n    gid: header.gid,\n    size: paxHeader.length,\n    mtime: header.mtime,\n    type: 'pax-header',\n    linkname: header.linkname && 'PaxHeader',\n    uname: header.uname,\n    gname: header.gname,\n    devmajor: header.devmajor,\n    devminor: header.devminor\n  }\n\n  this.push(headers.encode(newHeader))\n  this.push(paxHeader)\n  overflow(this, paxHeader.length)\n\n  newHeader.size = header.size\n  newHeader.type = header.type\n  this.push(headers.encode(newHeader))\n}\n\nPack.prototype._read = function (n) {\n  var drain = this._drain\n  this._drain = noop\n  drain()\n}\n\nmodule.exports = Pack\n","exports.extract = require('./extract')\nexports.pack = require('./pack')\n","/**\r\n * TAR Format Plugin\r\n *\r\n * @module plugins/tar\r\n * @license [MIT]{@link https://github.com/archiverjs/node-archiver/blob/master/LICENSE}\r\n * @copyright (c) 2012-2014 Chris Talkington, contributors.\r\n */\r\nvar zlib = require('zlib');\r\n\r\nvar engine = require('tar-stream');\r\nvar util = require('archiver-utils');\r\n\r\n/**\r\n * @constructor\r\n * @param {TarOptions} options\r\n */\r\nvar Tar = function(options) {\r\n  if (!(this instanceof Tar)) {\r\n    return new Tar(options);\r\n  }\r\n\r\n  options = this.options = util.defaults(options, {\r\n    gzip: false\r\n  });\r\n\r\n  if (typeof options.gzipOptions !== 'object') {\r\n    options.gzipOptions = {};\r\n  }\r\n\r\n  this.supports = {\r\n    directory: true,\r\n    symlink: true\r\n  };\r\n\r\n  this.engine = engine.pack(options);\r\n  this.compressor = false;\r\n\r\n  if (options.gzip) {\r\n    this.compressor = zlib.createGzip(options.gzipOptions);\r\n    this.compressor.on('error', this._onCompressorError.bind(this));\r\n  }\r\n};\r\n\r\n/**\r\n * [_onCompressorError description]\r\n *\r\n * @private\r\n * @param  {Error} err\r\n * @return void\r\n */\r\nTar.prototype._onCompressorError = function(err) {\r\n  this.engine.emit('error', err);\r\n};\r\n\r\n/**\r\n * [append description]\r\n *\r\n * @param  {(Buffer|Stream)} source\r\n * @param  {TarEntryData} data\r\n * @param  {Function} callback\r\n * @return void\r\n */\r\nTar.prototype.append = function(source, data, callback) {\r\n  var self = this;\r\n\r\n  data.mtime = data.date;\r\n\r\n  function append(err, sourceBuffer) {\r\n    if (err) {\r\n      callback(err);\r\n      return;\r\n    }\r\n\r\n    self.engine.entry(data, sourceBuffer, function(err) {\r\n      callback(err, data);\r\n    });\r\n  }\r\n\r\n  if (data.sourceType === 'buffer') {\r\n    append(null, source);\r\n  } else if (data.sourceType === 'stream' && data.stats) {\r\n    data.size = data.stats.size;\r\n\r\n    var entry = self.engine.entry(data, function(err) {\r\n      callback(err, data);\r\n    });\r\n\r\n    source.pipe(entry);\r\n  } else if (data.sourceType === 'stream') {\r\n    util.collectStream(source, append);\r\n  }\r\n};\r\n\r\n/**\r\n * [finalize description]\r\n *\r\n * @return void\r\n */\r\nTar.prototype.finalize = function() {\r\n  this.engine.finalize();\r\n};\r\n\r\n/**\r\n * [on description]\r\n *\r\n * @return this.engine\r\n */\r\nTar.prototype.on = function() {\r\n  return this.engine.on.apply(this.engine, arguments);\r\n};\r\n\r\n/**\r\n * [pipe description]\r\n *\r\n * @param  {String} destination\r\n * @param  {Object} options\r\n * @return this.engine\r\n */\r\nTar.prototype.pipe = function(destination, options) {\r\n  if (this.compressor) {\r\n    return this.engine.pipe.apply(this.engine, [this.compressor]).pipe(destination, options);\r\n  } else {\r\n    return this.engine.pipe.apply(this.engine, arguments);\r\n  }\r\n};\r\n\r\n/**\r\n * [unpipe description]\r\n *\r\n * @return this.engine\r\n */\r\nTar.prototype.unpipe = function() {\r\n  if (this.compressor) {\r\n    return this.compressor.unpipe.apply(this.compressor, arguments);\r\n  } else {\r\n    return this.engine.unpipe.apply(this.engine, arguments);\r\n  }\r\n};\r\n\r\nmodule.exports = Tar;\r\n\r\n/**\r\n * @typedef {Object} TarOptions\r\n * @global\r\n * @property {Boolean} [gzip=false] Compress the tar archive using gzip.\r\n * @property {Object} [gzipOptions] Passed to [zlib]{@link https://nodejs.org/api/zlib.html#zlib_class_options}\r\n * to control compression.\r\n * @property {*} [*] See [tar-stream]{@link https://github.com/mafintosh/tar-stream} documentation for additional properties.\r\n */\r\n\r\n/**\r\n * @typedef {Object} TarEntryData\r\n * @global\r\n * @property {String} name Sets the entry name including internal path.\r\n * @property {(String|Date)} [date=NOW()] Sets the entry date.\r\n * @property {Number} [mode=D:0755/F:0644] Sets the entry permissions.\r\n * @property {String} [prefix] Sets a path prefix for the entry name. Useful\r\n * when working with methods like `directory` or `glob`.\r\n * @property {fs.Stats} [stats] Sets the fs stat data for this entry allowing\r\n * for reduction of fs stat calls when stat data is already known.\r\n */\r\n\r\n/**\r\n * TarStream Module\r\n * @external TarStream\r\n * @see {@link https://github.com/mafintosh/tar-stream}\r\n */\r\n","/**\r\n * JSON Format Plugin\r\n *\r\n * @module plugins/json\r\n * @license [MIT]{@link https://github.com/archiverjs/node-archiver/blob/master/LICENSE}\r\n * @copyright (c) 2012-2014 Chris Talkington, contributors.\r\n */\r\nvar inherits = require('util').inherits;\r\nvar Transform = require('readable-stream').Transform;\r\n\r\nvar crc32 = require('buffer-crc32');\r\nvar util = require('archiver-utils');\r\n\r\n/**\r\n * @constructor\r\n * @param {(JsonOptions|TransformOptions)} options\r\n */\r\nvar Json = function(options) {\r\n  if (!(this instanceof Json)) {\r\n    return new Json(options);\r\n  }\r\n\r\n  options = this.options = util.defaults(options, {});\r\n\r\n  Transform.call(this, options);\r\n\r\n  this.supports = {\r\n    directory: true,\r\n    symlink: true\r\n  };\r\n\r\n  this.files = [];\r\n};\r\n\r\ninherits(Json, Transform);\r\n\r\n/**\r\n * [_transform description]\r\n *\r\n * @private\r\n * @param  {Buffer}   chunk\r\n * @param  {String}   encoding\r\n * @param  {Function} callback\r\n * @return void\r\n */\r\nJson.prototype._transform = function(chunk, encoding, callback) {\r\n  callback(null, chunk);\r\n};\r\n\r\n/**\r\n * [_writeStringified description]\r\n *\r\n * @private\r\n * @return void\r\n */\r\nJson.prototype._writeStringified = function() {\r\n  var fileString = JSON.stringify(this.files);\r\n  this.write(fileString);\r\n};\r\n\r\n/**\r\n * [append description]\r\n *\r\n * @param  {(Buffer|Stream)}   source\r\n * @param  {EntryData}   data\r\n * @param  {Function} callback\r\n * @return void\r\n */\r\nJson.prototype.append = function(source, data, callback) {\r\n  var self = this;\r\n\r\n  data.crc32 = 0;\r\n\r\n  function onend(err, sourceBuffer) {\r\n    if (err) {\r\n      callback(err);\r\n      return;\r\n    }\r\n\r\n    data.size = sourceBuffer.length || 0;\r\n    data.crc32 = crc32.unsigned(sourceBuffer);\r\n\r\n    self.files.push(data);\r\n\r\n    callback(null, data);\r\n  }\r\n\r\n  if (data.sourceType === 'buffer') {\r\n    onend(null, source);\r\n  } else if (data.sourceType === 'stream') {\r\n    util.collectStream(source, onend);\r\n  }\r\n};\r\n\r\n/**\r\n * [finalize description]\r\n *\r\n * @return void\r\n */\r\nJson.prototype.finalize = function() {\r\n  this._writeStringified();\r\n  this.end();\r\n};\r\n\r\nmodule.exports = Json;\r\n\r\n/**\r\n * @typedef {Object} JsonOptions\r\n * @global\r\n */\r\n","/**\r\n * Archiver Vending\r\n *\r\n * @ignore\r\n * @license [MIT]{@link https://github.com/archiverjs/node-archiver/blob/master/LICENSE}\r\n * @copyright (c) 2012-2014 Chris Talkington, contributors.\r\n */\r\nvar Archiver = require('./lib/core');\r\n\r\nvar formats = {};\r\n\r\n/**\r\n * Dispenses a new Archiver instance.\r\n *\r\n * @constructor\r\n * @param  {String} format The archive format to use.\r\n * @param  {Object} options See [Archiver]{@link Archiver}\r\n * @return {Archiver}\r\n */\r\nvar vending = function(format, options) {\r\n  return vending.create(format, options);\r\n};\r\n\r\n/**\r\n * Creates a new Archiver instance.\r\n *\r\n * @param  {String} format The archive format to use.\r\n * @param  {Object} options See [Archiver]{@link Archiver}\r\n * @return {Archiver}\r\n */\r\nvending.create = function(format, options) {\r\n  if (formats[format]) {\r\n    var instance = new Archiver(format, options);\r\n    instance.setFormat(format);\r\n    instance.setModule(new formats[format](options));\r\n\r\n    return instance;\r\n  } else {\r\n    throw new Error('create(' + format + '): format not registered');\r\n  }\r\n};\r\n\r\n/**\r\n * Registers a format for use with archiver.\r\n *\r\n * @param  {String} format The name of the format.\r\n * @param  {Function} module The function for archiver to interact with.\r\n * @return void\r\n */\r\nvending.registerFormat = function(format, module) {\r\n  if (formats[format]) {\r\n    throw new Error('register(' + format + '): format already registered');\r\n  }\r\n\r\n  if (typeof module !== 'function') {\r\n    throw new Error('register(' + format + '): format module invalid');\r\n  }\r\n\r\n  if (typeof module.prototype.append !== 'function' || typeof module.prototype.finalize !== 'function') {\r\n    throw new Error('register(' + format + '): format module missing methods');\r\n  }\r\n\r\n  formats[format] = module;\r\n};\r\n\r\nvending.registerFormat('zip', require('./lib/plugins/zip'));\r\nvending.registerFormat('tar', require('./lib/plugins/tar'));\r\nvending.registerFormat('json', require('./lib/plugins/json'));\r\n\r\nmodule.exports = vending;"],"names":["isWindows","process","platform","DEBUG","env","NODE_DEBUG","test","maybeCallback","cb","callback","backtrace","Error","err","message","missingCallback","throwDeprecation","noDeprecation","msg","stack","traceDeprecation","console","trace","error","rethrow","pathModule","normalize","nextPartRe","splitRootRe","p","cache","resolve","Object","prototype","hasOwnProperty","call","pos","current","base","previous","original","seenLinks","knownHard","start","m","exec","length","fs","lstatSync","lastIndex","result","resolvedLink","stat","isSymbolicLink","linkTarget","id","dev","toString","ino","statSync","readlinkSync","slice","nextTick","bind","lstat","LOOP","gotResolvedLink","gotStat","gotTarget","readlink","target","fs_realpath","realpath","sync","realpathSync","monkeypatch","unmonkeypatch","origRealpath","origRealpathSync","version","ok","newError","er","syscall","code","old","posix","path","charAt","win32","device","isUnc","Boolean","pathIsAbsolute","posix_1","win32_1","alphasort_1","alphasort","alphasorti_1","alphasorti","setopts_1","self","pattern","options","matchBase","indexOf","noglobstar","silent","strict","realpathCache","create","follow","dot","mark","nodir","nounique","nonull","nosort","nocase","noprocess","absolute","maxLength","Infinity","statCache","symlinks","ignore","Array","isArray","map","ignoreMap","setupIgnores","changedCwd","cwd","ownProp","root","replace","cwdAbs","isAbsolute","makeAbs","nomount","nonegate","nocomment","minimatch","Minimatch","ownProp_1","makeAbs_1","finish_1","nou","all","i","l","matches","keys","push","apply","forEach","literal","globSet","sort","_mark","filter","e","notDir","c","isIgnored","found","mark_1","abs","isDir","slash","mabs","isIgnored_1","childrenIgnored_1","some","item","gmatcher","match","obj","field","minimatch_1","a","b","toLowerCase","localeCompare","gpattern","matcher","f","join","globSync","GlobSync","require$$0","Glob","setopts","common","childrenIgnored","arguments","TypeError","this","n","set","_process","_finish","assert","matchset","index","_makeAbs","rp","finish","inGlobStar","prefix","_processSimple","read","remain","GLOBSTAR","_processGlobStar","_processReaddir","entries","_readdir","pn","negate","rawGlob","_glob","dotOk","matchedEntries","len","shift","newPattern","concat","_emitMatch","_stat","_readdirInGlobStar","isSym","isDirectory","_readdirEntries","readdirSync","_readdirError","remainWithoutGlobStar","gspref","noGlobStar","instead","below","exists","trail","needDir","reqs","inflight_1","wrappy","wrappy_1","key","once","RES","cbs","args","array","splice","makeres","glob_1","glob","EE","EventEmitter","_didRealPath","once_1","on","_processing","_emitQueue","_processQueue","paused","done","hasMagic","options_","origin","add","extend","j","inherits","aborted","_didRealpath","_realpath","emit","_realpathSet","next","real","abort","pause","resume","eq","pq","_processReaddir2","st","lstatcb","inflight","readdir","readdirCb","_processGlobStar2","_processSimple2","undefined","type","statcb","_stat2","commonjsGlobal","exports","arrayLike","newLen","Math","max","newArr","idx","fn","callArgs","initialParams","pop","isObject","value","hasSetImmediate","setImmediate","hasNextTick","fallback","setTimeout","wrap","defer","setImmediate$1","asyncify","func","then","invokeCallback","supportsSymbol","Symbol","isAsync","toStringTag","wrapAsync","asyncFn","applyEach$1","eachfn","fns","go","that","freeGlobal","global","freeSelf","Function","Symbol$1","objectProto","nativeObjectToString","symToStringTag$1","getRawTag","isOwn","tag","unmasked","objectProto$1","nativeObjectToString$1","objectToString","nullTag","undefinedTag","symToStringTag","baseGetTag","asyncTag","funcTag","genTag","proxyTag","isFunction","MAX_SAFE_INTEGER","isLength","isArrayLike","breakLoop","noop","callFn","iteratorSymbol","iterator","getIterator","coll","baseTimes","iteratee","isObjectLike","argsTag","baseIsArguments","objectProto$3","hasOwnProperty$2","propertyIsEnumerable","isArguments","stubFalse","freeExports","nodeType","freeModule","module","Buffer","isBuffer","MAX_SAFE_INTEGER$1","reIsUint","isIndex","argsTag$1","arrayTag","boolTag","dateTag","errorTag","funcTag$1","mapTag","numberTag","objectTag","regexpTag","setTag","stringTag","weakMapTag","arrayBufferTag","dataViewTag","float64Tag","int8Tag","int16Tag","int32Tag","uint8Tag","uint8ClampedTag","uint16Tag","uint32Tag","typedArrayTags","baseIsTypedArray","baseUnary","freeExports$1","freeModule$1","freeProcess","nodeUtil","types","require","binding","nodeIsTypedArray","isTypedArray","objectProto$2","hasOwnProperty$1","arrayLikeKeys","inherited","isArr","isArg","isBuff","isType","skipIndexes","String","objectProto$5","isPrototype","Ctor","constructor","overArg","transform","arg","nativeKeys","objectProto$4","hasOwnProperty$3","baseKeys","object","createArrayIterator","createES2015Iterator","createObjectIterator","okeys","onlyOnce","_eachOfLimit","limit","nextElem","running","looping","iterateeCallback","replenish","elem","eachOfLimit","doLimit","iterable","eachOfArrayLike","completed","iteratorCallback","eachOfGeneric","eachOf","doParallel","_asyncMap","arr","results","counter","_iteratee","_","v","applyEach","doParallelLimit","mapLimit","mapSeries","applyEachSeries","arrayEach","createBaseFor","fromRight","keysFunc","props","baseFor","baseForOwn","baseFindIndex","predicate","fromIndex","baseIsNaN","strictIndexOf","baseIndexOf","auto","tasks","concurrency","numTasks","runningTasks","hasError","listeners","readyTasks","readyToCheck","uncheckedDependencies","enqueueTask","task","runTask","processQueue","run","addListener","taskName","taskListeners","taskComplete","taskCallback","safeResults","val","rkey","taskFn","checkForDeadlocks","getDependents","dependent","dependencies","remainingDependencies","dependencyName","arrayMap","symbolTag","isSymbol","INFINITY","symbolProto","symbolToString","baseToString","baseSlice","end","castSlice","charsEndIndex","strSymbols","chrSymbols","charsStartIndex","asciiToArray","string","split","reHasUnicode","RegExp","hasUnicode","rsAstralRange$1","rsAstral","rsCombo","rsFitz","rsNonAstral","rsRegional","rsSurrPair","reOptMod","rsModifier","rsOptVar","rsOptJoin","rsSeq","rsSymbol","reUnicode","unicodeToArray","stringToArray","reTrim","trim","chars","guard","FN_ARGS","FN_ARG_SPLIT","FN_ARG","STRIP_COMMENTS","parseParams","autoInject","newTasks","params","fnIsAsync","hasNoDeps","newTask","taskCb","newArgs","name","DLL","head","tail","setInitial","dll","node","queue","worker","payload","_worker","numRunning","workersList","processingScheduled","_insert","data","insertAtFront","q","started","idle","drain","_tasks","unshift","_next","buffer","unsaturated","isProcessing","saturated","empty","kill","remove","testFn","min","cargo","removeLink","prev","insertAfter","newNode","insertBefore","toArray","curr","eachOfSeries","reduce","memo","x","seq","_functions","newargs","nextargs","compose","reverse","_concat","concatLimit","mapResults","concatSeries","constant","values","identity","_createTester","check","getResult","testResult","testPassed","_findGetResult","detect","detectLimit","detectSeries","consoleFunc","dir","doDuring","_fn","_test","truth","doWhilst","doUntil","during","_withoutIndex","eachLimit","eachLimit$1","eachSeries","ensureAsync","innerArgs","notId","every","everyLimit","everySeries","baseProperty","filterArray","truthValues","filterGeneric","_filter","filterLimit","filterSeries","forever","errback","groupByLimit","groupBy","groupBySeries","log","mapValuesLimit","newObj","mapValues","mapValuesSeries","has","memoize","hasher","queues","memoized","unmemoized","_parallel","parallelLimit","parallelLimit$1","queue$1","items","priorityQueue","priority","nextNode","race","reduceRight","reflect","reflectCallback","cbArg","reflectAll","reject$1","reject","rejectLimit","rejectSeries","constant$1","retry","opts","DEFAULT_TIMES","DEFAULT_INTERVAL","times","intervalFunc","parseTimes","acc","t","interval","errorFilter","_task","attempt","retryAttempt","retryable","series","someLimit","someSeries","sortBy","comparator","left","right","criteria","timeout","milliseconds","info","timer","timedOut","timeoutCallback","clearTimeout","nativeCeil","ceil","nativeMax","baseRange","step","timeLimit","count","timesSeries","accumulator","k","tryEach","res","unmemoize","whilst","until","waterfall","taskIndex","nextTask","each","parallel","timesLimit","allLimit","allSeries","any","anyLimit","anySeries","find","findLimit","findSeries","forEachSeries","forEachLimit","forEachOf","forEachOfSeries","forEachOfLimit","inject","foldl","foldr","select","selectLimit","selectSeries","wrapSync","defineProperty","factory","passthrough","PassThrough","lazystream","Readable","Writable","beforeFirstCall","instance","method","source","pipe","destination","util","normalizePath","stripTrailing","ch","segs","thisArg","isArrayLikeObject","assignInDefaults","objValue","srcValue","assignValue","baseKeysIn","nativeKeysIn","proto","isProto","baseRest","otherArgs","other","assigner","assignInWith","srcIndex","customizer","newValue","copyObject","keysIn","sources","isIterateeCall","lodash_defaults","Stream","Duplex","Transform","arrayPush","offset","spreadableSymbol","isConcatSpreadable","baseFlatten","depth","isStrict","isFlattenable","lodash_flatten","HASH_UNDEFINED","reIsHostCtor","arrayIncludes","arrayIncludesWith","cacheHas","uid","arrayProto","funcProto","coreJsData","maskSrcKey","IE_PROTO","funcToString","reIsNative","Map","getNative","nativeCreate","Hash","clear","entry","ListCache","MapCache","SetCache","__data__","assocIndexOf","baseDifference","includes","isCommon","valuesLength","outer","computed","valuesIndex","baseIsNative","isHostObject","toSource","getMapData","getValue","get","hash","difference","lodash_difference","setToArray","size","Set","isMasked","createSet","union","arrays","seen","seenIndex","baseUniq","lodash_union","objectCtorString","getPrototype","getPrototypeOf","lodash_isplainobject","file","pathSeparatorRe","filepath","gracefulFs","existsSync","expand","isPlainObject","patterns","flatten","exclusion","processPatterns","expandMapping","destBase","assign","rename","destPath","files","fileByDest","src","basename","ext","dest","normalizeFilesArray","chain","expandOptions","mapObj","orig","prop","enumerable","require$$1","utils","require$$2","collectStream","collection","chunk","buf","copy","dateify","dateish","Date","defaults","isStream","lazyReadStream","createReadStream","normalizeInputSource","_readableState","normalized","sanitizePath","trailingSlashIt","str","unixifyPath","walkdir","dirpath","list","stats","relative","dirEntry","ERROR_CODES","ABORTED","DIRECTORYDIRPATHREQUIRED","DIRECTORYFUNCTIONINVALIDDATA","ENTRYNAMEREQUIRED","FILEFILEPATHREQUIRED","FINALIZING","QUEUECLOSED","NOENDMETHOD","DIRECTORYNOTSUPPORTED","FORMATSET","INPUTSTEAMBUFFERREQUIRED","MODULESET","SYMLINKNOTSUPPORTED","SYMLINKFILEPATHREQUIRED","SYMLINKTARGETREQUIRED","ENTRYNOTSUPPORTED","ArchiverError","captureStackTrace","Archiver","format","highWaterMark","statConcurrency","_format","_module","_pending","_pointer","_entriesCount","_entriesProcessedCount","_fsEntriesTotalBytes","_fsEntriesProcessedBytes","_queue","async","_onQueueTask","_onQueueDrain","_statQueue","_onStatQueueTask","_state","finalize","finalizing","finalized","modulePiped","_streams","_abort","_shutdown","_append","sourcePath","Stats","_updateQueueTaskWithStats","_finalize","_moduleFinalize","_maybeFinalize","_moduleAppend","append","total","processed","totalBytes","processedBytes","_modulePipe","_onModuleError","_moduleSupports","supports","_moduleUnpipe","unpipe","_normalizeEntryData","date","mode","mtime","_transform","encoding","isFile","sourceType","linkPath","dirName","dirname","linkname","directory","destpath","dataFunction","globber","ignoreMatch","entryData","Promise","errored","setFormat","setModule","symlink","pointer","use","plugin","core","ArchiveEntry","getName","getSize","getLastModifiedDate","dateToDos","d","forceLocalTime","year","getFullYear","getUTCFullYear","getMonth","getUTCMonth","getDate","getUTCDate","getHours","getUTCHours","getMinutes","getUTCMinutes","getSeconds","getUTCSeconds","dosToDate","dos","fromDosTime","readUInt32LE","getEightBytes","alloc","writeUInt32LE","getShortBytes","writeUInt16LE","getShortBytesValue","readUInt16LE","getLongBytes","getLongBytesValue","toDosTime","GeneralPurposeBit","descriptor","encryption","utf8","numberOfShannonFanoTrees","strongEncryption","slidingDictionarySize","encode","zipUtil","parse","flag","gbp","useDataDescriptor","useUTF8ForNames","useStrongEncryption","useEncryption","setSlidingDictionarySize","setNumberOfShannonFanoTrees","getNumberOfShannonFanoTrees","getSlidingDictionarySize","usesDataDescriptor","usesEncryption","usesStrongEncryption","usesUTF8ForNames","unixStat","constants","WORD","DWORD","EMPTY","SHORT","SHORT_MASK","SHORT_SHIFT","SHORT_ZERO","from","LONG","LONG_ZERO","MIN_VERSION_INITIAL","MIN_VERSION_DATA_DESCRIPTOR","MIN_VERSION_ZIP64","VERSION_MADEBY","METHOD_STORED","METHOD_DEFLATED","PLATFORM_UNIX","PLATFORM_FAT","SIG_LFH","SIG_DD","SIG_CFH","SIG_EOCD","SIG_ZIP64_EOCD","SIG_ZIP64_EOCD_LOC","ZIP64_MAGIC_SHORT","ZIP64_MAGIC","ZIP64_EXTRA_ID","ZLIB_NO_COMPRESSION","ZLIB_BEST_SPEED","ZLIB_BEST_COMPRESSION","ZLIB_DEFAULT_COMPRESSION","MODE_MASK","DEFAULT_FILE_MODE","DEFAULT_DIR_MODE","EXT_FILE_ATTR_DIR","EXT_FILE_ATTR_FILE","S_IFMT","S_IFIFO","S_IFCHR","S_IFDIR","S_IFBLK","S_IFREG","S_IFLNK","S_IFSOCK","S_DOS_A","S_DOS_D","S_DOS_V","S_DOS_S","S_DOS_H","S_DOS_R","ZipArchiveEntry","csize","gpb","crc","time","minver","extra","exattr","inattr","comment","setName","getCentralDirectoryExtra","getExtra","getComment","getCompressedSize","getCrc","getExternalAttributes","getGeneralPurposeBit","getInternalAttributes","getTime","getLocalFileDataExtra","getMethod","getPlatform","getTimeDos","getUnixMode","getVersionNeededToExtract","setComment","byteLength","setCompressedSize","setCrc","setExternalAttributes","attr","setExtra","setGeneralPurposeBit","setInternalAttributes","setMethod","setPlatform","setSize","setTime","setUnixMode","extattr","setVersionNeededToExtract","isUnixSymlink","UnixStat","isZip64","ArchiveOutputStream","_archive","finished","processing","_appendBuffer","zae","_appendStream","_emitErrorCallback","ae","_normalizeEntry","_entry","getBytesWritten","write","createBuffer","allocUnsafe","allocUnsafeSlow","defineCrc","model","calc","signed","unsigned","crc1","accum","TABLE","Int32Array","crc8","byte","crc81wire","crc16","crc16ccitt","crc16modbus","crc16xmodem","crc16kermit","crc24","crc32","crcjam","index$1","crc32Stream","super","checksum","writeInt32BE","rawSize","digest","writeUInt32BE","hex","toUpperCase","DeflateRaw","lib","CRC32Stream","DeflateCRC32Stream","compressedSize","enc","compressed","ZipArchiveOutputStream","_defaults","_entries","centralLength","centralOffset","forceZip64","_afterAppend","_writeDataDescriptor","_writeLocalFileHeader","_smartStream","smart","o","zlib","level","_writeCentralFileHeader","_writeCentralDirectoryZip64","_writeCentralDirectoryEnd","_offsets","contents","readUInt32BE","records","commentLength","offsets","extraBuf","compressCommons","require$$3","ZipStream","store","_normalizeFileData","isSymlink","Zip","forceUTC","engine","zip","symbol","for","BufferList","_init","_bufs","_new","_offset","tot","_t","_reverseOffset","blOffset","bufferId","dst","dstStart","srcStart","srcEnd","off","bytes","bufoff","shallowSlice","startOffset","endOffset","buffers","consume","trunc","Number","isNaN","duplicate","byteOffset","_isBufferList","search","blIndex","buffOffset","buff","nativeSearchResult","revOffset","_match","searchOffset","methods","readDoubleBE","readDoubleLE","readFloatBE","readFloatLE","readInt32BE","readInt32LE","readInt16BE","readInt16LE","readUInt16BE","readInt8","readUInt8","readIntBE","readIntLE","readUIntBE","readUIntLE","isBufferList","BufferList_1","DuplexStream","BufferListStream","_callback","piper","removeListener","_write","_read","_destroy","bl","BufferListStream_1","ZERO_OFFSET","charCodeAt","USTAR_MAGIC","USTAR_VER","GNU_MAGIC","GNU_VER","MASK","parseInt","MAGIC_OFFSET","block","num","cksum","sum","encodeOct","decodeOct","positive","tuple","pow","parse256","defaultValue","clamp","decodeStr","addLength","digits","floor","pax","keyIndex","typeflag","gid","toTypeflag","uname","gname","devmajor","devminor","filenameEncoding","toType","compare","VERSION_OFFSET","overflow","Source","_parent","autoDestroy","destroy","Extract","_buffer","_missing","_partial","_onparse","_header","_stream","_overflow","_cb","_locked","_destroyed","_pax","_paxGlobal","_gnuLongPath","_gnuLongLinkPath","oncontinue","_continue","onunlock","onstreamend","_parse","ondrain","onheader","onpaxglobalheader","headers","onpaxheader","ongnulongpath","ongnulonglinkpath","header","linkpath","mixinPax","s","emptyStream","_onheader","onparse","missing","_final","extract","StringDecoder","DMODE","FMODE","END_OF_TAR","Sink","to","written","_to","_drain","LinkSink","_decoder","Void","Pack","_finalized","_finalizing","fsConstants","modeToType","_encode","linkSink","eos","sink","_encodePax","paxHeader","newHeader","Tar","gzip","gzipOptions","pack","compressor","createGzip","_onCompressorError","sourceBuffer","tar","Json","_writeStringified","fileString","JSON","stringify","onend","json","formats","vending","registerFormat"],"mappings":"+0BAsBIA,EAAiC,UAArBC,QAAQC,SAKpBC,EAAQF,QAAQG,IAAIC,YAAc,KAAKC,KAAKL,QAAQG,IAAIC,YAqC5D,SAASE,EAAcC,GACrB,MAAqB,mBAAPA,EAAoBA,EApCpC,WAGE,IAAIC,EACJ,GAAIN,EAAO,CACT,IAAIO,EAAY,IAAIC,MACpBF,EAMF,SAAuBG,GACjBA,IACFF,EAAUG,QAAUD,EAAIC,QAExBC,EADAF,EAAMF,GAGT,CAXA,MACCD,EAAWK,EAEb,OAAOL,EAUP,SAASK,EAAgBF,GACvB,GAAIA,EAAK,CACP,GAAIX,QAAQc,iBACV,MAAMH,EACH,IAAKX,QAAQe,cAAe,CAC/B,IAAIC,EAAM,yBAA2BL,EAAIM,OAASN,EAAIC,SAClDZ,QAAQkB,iBACVC,QAAQC,MAAMJ,GAEdG,QAAQE,MAAML,EACjB,CACF,CACF,CACH,CAGyCM,EACzC,CAMA,GAJgBC,EAAAA,QAAWC,UAIvBzB,EACF,IAAI0B,EAAa,2BAEbA,EAAa,oBAInB,GAAI1B,EACF,IAAI2B,EAAc,8DAEdA,EAAc,SAGpB,MAAuB,SAAsBC,EAAGC,GAI9C,GAFAD,EAAIJ,EAAU,QAACM,QAAQF,GAEnBC,GAASE,OAAOC,UAAUC,eAAeC,KAAKL,EAAOD,GACvD,OAAOC,EAAMD,GAGf,IAKIO,EAEAC,EAEAC,EAEAC,EAXAC,EAAWX,EACXY,EAAY,CAAE,EACdC,EAAY,CAAA,EAahB,SAASC,IAEP,IAAIC,EAAIhB,EAAYiB,KAAKhB,GACzBO,EAAMQ,EAAE,GAAGE,OACXT,EAAUO,EAAE,GACZN,EAAOM,EAAE,GACTL,EAAW,GAGPtC,IAAcyC,EAAUJ,KAC1BS,UAAGC,UAAUV,GACbI,EAAUJ,IAAQ,EAErB,CAKD,IApBAK,IAoBOP,EAAMP,EAAEiB,QAAQ,CAErBnB,EAAWsB,UAAYb,EACvB,IAAIc,EAASvB,EAAWkB,KAAKhB,GAO7B,GANAU,EAAWF,EACXA,GAAWa,EAAO,GAClBZ,EAAOC,EAAWW,EAAO,GACzBd,EAAMT,EAAWsB,YAGbP,EAAUJ,IAAUR,GAASA,EAAMQ,KAAUA,GAAjD,CAIA,IAAIa,EACJ,GAAIrB,GAASE,OAAOC,UAAUC,eAAeC,KAAKL,EAAOQ,GAEvDa,EAAerB,EAAMQ,OAChB,CACL,IAAIc,EAAOL,EAAAA,QAAGC,UAAUV,GACxB,IAAKc,EAAKC,iBAAkB,CAC1BX,EAAUJ,IAAQ,EACdR,IAAOA,EAAMQ,GAAQA,GACzB,QACD,CAID,IAAIgB,EAAa,KACjB,IAAKrD,EAAW,CACd,IAAIsD,EAAKH,EAAKI,IAAIC,SAAS,IAAM,IAAML,EAAKM,IAAID,SAAS,IACrDhB,EAAUP,eAAeqB,KAC3BD,EAAab,EAAUc,GAE1B,CACkB,OAAfD,IACFP,UAAGY,SAASrB,GACZgB,EAAaP,EAAE,QAACa,aAAatB,IAE/Ba,EAAe1B,EAAAA,QAAWM,QAAQQ,EAAUe,GAExCxB,IAAOA,EAAMQ,GAAQa,GACpBlD,IAAWwC,EAAUc,GAAMD,EACjC,CAGDzB,EAAIJ,EAAU,QAACM,QAAQoB,EAActB,EAAEgC,MAAMzB,IAC7CO,GAnCC,CAoCF,CAID,OAFIb,IAAOA,EAAMU,GAAYX,GAEtBA,CACT,IAGmB,SAAkBA,EAAGC,EAAOrB,GAS7C,GARkB,mBAAPA,IACTA,EAAKD,EAAcsB,GACnBA,EAAQ,MAIVD,EAAIJ,EAAU,QAACM,QAAQF,GAEnBC,GAASE,OAAOC,UAAUC,eAAeC,KAAKL,EAAOD,GACvD,OAAO3B,QAAQ4D,SAASrD,EAAGsD,KAAK,KAAM,KAAMjC,EAAMD,KAGpD,IAKIO,EAEAC,EAEAC,EAEAC,EAXAC,EAAWX,EACXY,EAAY,CAAE,EACdC,EAAY,CAAA,EAahB,SAASC,IAEP,IAAIC,EAAIhB,EAAYiB,KAAKhB,GACzBO,EAAMQ,EAAE,GAAGE,OACXT,EAAUO,EAAE,GACZN,EAAOM,EAAE,GACTL,EAAW,GAGPtC,IAAcyC,EAAUJ,GAC1BS,EAAAA,QAAGiB,MAAM1B,GAAM,SAASzB,GACtB,GAAIA,EAAK,OAAOJ,EAAGI,GACnB6B,EAAUJ,IAAQ,EAClB2B,GACR,IAEM/D,QAAQ4D,SAASG,EAEpB,CAID,SAASA,IAEP,GAAI7B,GAAOP,EAAEiB,OAEX,OADIhB,IAAOA,EAAMU,GAAYX,GACtBpB,EAAG,KAAMoB,GAIlBF,EAAWsB,UAAYb,EACvB,IAAIc,EAASvB,EAAWkB,KAAKhB,GAO7B,OANAU,EAAWF,EACXA,GAAWa,EAAO,GAClBZ,EAAOC,EAAWW,EAAO,GACzBd,EAAMT,EAAWsB,UAGbP,EAAUJ,IAAUR,GAASA,EAAMQ,KAAUA,EACxCpC,QAAQ4D,SAASG,GAGtBnC,GAASE,OAAOC,UAAUC,eAAeC,KAAKL,EAAOQ,GAEhD4B,EAAgBpC,EAAMQ,IAGxBS,UAAGiB,MAAM1B,EAAM6B,EACvB,CAED,SAASA,EAAQtD,EAAKuC,GACpB,GAAIvC,EAAK,OAAOJ,EAAGI,GAGnB,IAAKuC,EAAKC,iBAGR,OAFAX,EAAUJ,IAAQ,EACdR,IAAOA,EAAMQ,GAAQA,GAClBpC,QAAQ4D,SAASG,GAM1B,IAAKhE,EAAW,CACd,IAAIsD,EAAKH,EAAKI,IAAIC,SAAS,IAAM,IAAML,EAAKM,IAAID,SAAS,IACzD,GAAIhB,EAAUP,eAAeqB,GAC3B,OAAOa,EAAU,KAAM3B,EAAUc,GAAKjB,EAEzC,CACDS,EAAAA,QAAGK,KAAKd,GAAM,SAASzB,GACrB,GAAIA,EAAK,OAAOJ,EAAGI,GAEnBkC,EAAAA,QAAGsB,SAAS/B,GAAM,SAASzB,EAAKyD,GACzBrE,IAAWwC,EAAUc,GAAMe,GAChCF,EAAUvD,EAAKyD,EACvB,GACA,GACG,CAED,SAASF,EAAUvD,EAAKyD,EAAQhC,GAC9B,GAAIzB,EAAK,OAAOJ,EAAGI,GAEnB,IAAIsC,EAAe1B,EAAU,QAACM,QAAQQ,EAAU+B,GAC5CxC,IAAOA,EAAMQ,GAAQa,GACzBe,EAAgBf,EACjB,CAED,SAASe,EAAgBf,GAEvBtB,EAAIJ,EAAU,QAACM,QAAQoB,EAActB,EAAEgC,MAAMzB,IAC7CO,GACD,CA7FDA,GA8FF,EC9SA4B,EAAiBC,EACjBA,EAASA,SAAWA,EACpBA,EAASC,KAAOC,EAChBF,EAASE,aAAeA,EACxBF,EAASG,YAqDT,WACE5B,EAAE,QAACyB,SAAWA,EACdzB,EAAE,QAAC2B,aAAeA,CACpB,EAvDAF,EAASI,cAyDT,WACE7B,EAAE,QAACyB,SAAWK,EACd9B,EAAE,QAAC2B,aAAeI,CACpB,EAzDA,IAAID,EAAe9B,EAAE,QAACyB,SAClBM,EAAmB/B,EAAE,QAAC2B,aAEtBK,EAAU7E,QAAQ6E,QAClBC,EAAK,YAAYzE,KAAKwE,GAG1B,SAASE,EAAUC,GACjB,OAAOA,GAAqB,aAAfA,EAAGC,UACF,UAAZD,EAAGE,MACS,WAAZF,EAAGE,MACS,iBAAZF,EAAGE,KAEP,CAEA,SAASZ,EAAU3C,EAAGC,EAAOrB,GAC3B,GAAIuE,EACF,OAAOH,EAAahD,EAAGC,EAAOrB,GAGX,mBAAVqB,IACTrB,EAAKqB,EACLA,EAAQ,MAEV+C,EAAahD,EAAGC,GAAO,SAAUoD,EAAIhC,GAC/B+B,EAASC,GACXG,EAAaxD,EAAGC,EAAOrB,GAEvBA,EAAGyE,EAAIhC,EAEb,GACA,CAEA,SAASwB,EAAc7C,EAAGC,GACxB,GAAIkD,EACF,OAAOF,EAAiBjD,EAAGC,GAG7B,IACE,OAAOgD,EAAiBjD,EAAGC,EAC5B,CAAC,MAAOoD,GACP,GAAID,EAASC,GACX,OAAOG,EAAiBxD,EAAGC,GAE3B,MAAMoD,CAET,CACH,CCrDA,SAASI,EAAMC,GACd,MAA0B,MAAnBA,EAAKC,OAAO,EACpB,CAEA,SAASC,EAAMF,GAEd,IACIrC,EADgB,qEACOL,KAAK0C,GAC5BG,EAASxC,EAAO,IAAM,GACtByC,EAAQC,QAAQF,GAA+B,MAArBA,EAAOF,OAAO,IAG5C,OAAOI,QAAQ1C,EAAO,IAAMyC,EAC7B,CAEA,IAAcE,EAAwB,UAArB3F,QAAQC,SAAuBsF,EAAQH,EACpCQ,EAAGR,EACvBS,EAAuBN,sBCnBvB,IAAAO,EAAoBC,GACpBC,EAAqBC,GACrBC,EAkDA,SAAkBC,EAAMC,EAASC,GAC1BA,IACHA,EAAU,CAAE,GAGd,GAAIA,EAAQC,YAAc,IAAMF,EAAQG,QAAQ,KAAM,CACpD,GAAIF,EAAQG,WACV,MAAM,IAAI9F,MAAM,mCAElB0F,EAAU,MAAQA,CACnB,CAEDD,EAAKM,SAAWJ,EAAQI,OACxBN,EAAKC,QAAUA,EACfD,EAAKO,QAA4B,IAAnBL,EAAQK,OACtBP,EAAK7B,WAAa+B,EAAQ/B,SAC1B6B,EAAKQ,cAAgBN,EAAQM,eAAiB7E,OAAO8E,OAAO,MAC5DT,EAAKU,SAAWR,EAAQQ,OACxBV,EAAKW,MAAQT,EAAQS,IACrBX,EAAKY,OAASV,EAAQU,KACtBZ,EAAKa,QAAUX,EAAQW,MACnBb,EAAKa,QACPb,EAAKY,MAAO,GACdZ,EAAK5B,OAAS8B,EAAQ9B,KACtB4B,EAAKc,WAAaZ,EAAQY,SAC1Bd,EAAKe,SAAWb,EAAQa,OACxBf,EAAKgB,SAAWd,EAAQc,OACxBhB,EAAKiB,SAAWf,EAAQe,OACxBjB,EAAKjD,OAASmD,EAAQnD,KACtBiD,EAAKkB,YAAchB,EAAQgB,UAC3BlB,EAAKmB,WAAajB,EAAQiB,SAE1BnB,EAAKoB,UAAYlB,EAAQkB,WAAaC,IACtCrB,EAAKvE,MAAQyE,EAAQzE,OAASE,OAAO8E,OAAO,MAC5CT,EAAKsB,UAAYpB,EAAQoB,WAAa3F,OAAO8E,OAAO,MACpDT,EAAKuB,SAAWrB,EAAQqB,UAAY5F,OAAO8E,OAAO,MA5DpD,SAAuBT,EAAME,GAC3BF,EAAKwB,OAAStB,EAAQsB,QAAU,GAE3BC,MAAMC,QAAQ1B,EAAKwB,UACtBxB,EAAKwB,OAAS,CAACxB,EAAKwB,SAElBxB,EAAKwB,OAAO/E,SACduD,EAAKwB,OAASxB,EAAKwB,OAAOG,IAAIC,IAElC,CAqDEC,CAAa7B,EAAME,GAEnBF,EAAK8B,YAAa,EAClB,IAAIC,EAAMlI,QAAQkI,MACbC,GAAQ9B,EAAS,QAGpBF,EAAK+B,IAAM7C,EAAAA,QAAKxD,QAAQwE,EAAQ6B,KAChC/B,EAAK8B,WAAa9B,EAAK+B,MAAQA,GAH/B/B,EAAK+B,IAAMA,EAMb/B,EAAKiC,KAAO/B,EAAQ+B,MAAQ/C,EAAI,QAACxD,QAAQsE,EAAK+B,IAAK,KACnD/B,EAAKiC,KAAO/C,EAAAA,QAAKxD,QAAQsE,EAAKiC,MACL,UAArBpI,QAAQC,WACVkG,EAAKiC,KAAOjC,EAAKiC,KAAKC,QAAQ,MAAO,MAIvClC,EAAKmC,OAASC,EAAWpC,EAAK+B,KAAO/B,EAAK+B,IAAMM,GAAQrC,EAAMA,EAAK+B,KAC1C,UAArBlI,QAAQC,WACVkG,EAAKmC,OAASnC,EAAKmC,OAAOD,QAAQ,MAAO,MAC3ClC,EAAKsC,UAAYpC,EAAQoC,QAIzBpC,EAAQqC,UAAW,EACnBrC,EAAQsC,WAAY,EAEpBxC,EAAKyC,UAAY,IAAIC,GAAUzC,EAASC,GACxCF,EAAKE,QAAUF,EAAKyC,UAAUvC,OAChC,EApHAyC,EAAkBX,GAClBY,EAAkBP,GAClBQ,EAoHA,SAAiB7C,GAIf,IAHA,IAAI8C,EAAM9C,EAAKc,SACXiC,EAAMD,EAAM,GAAKnH,OAAO8E,OAAO,MAE1BuC,EAAI,EAAGC,EAAIjD,EAAKkD,QAAQzG,OAAQuG,EAAIC,EAAGD,IAAM,CACpD,IAAIE,EAAUlD,EAAKkD,QAAQF,GAC3B,GAAKE,GAA2C,IAAhCvH,OAAOwH,KAAKD,GAASzG,OAS9B,CAEL,IAAIF,EAAIZ,OAAOwH,KAAKD,GAChBJ,EACFC,EAAIK,KAAKC,MAAMN,EAAKxG,GAEpBA,EAAE+G,SAAQ,SAAU/G,GAClBwG,EAAIxG,IAAK,CACnB,GACK,MAjBC,GAAIyD,EAAKe,OAAQ,CAEf,IAAIwC,EAAUvD,EAAKyC,UAAUe,QAAQR,GACjCF,EACFC,EAAIK,KAAKG,GAETR,EAAIQ,IAAW,CAClB,CAWJ,CAEIT,IACHC,EAAMpH,OAAOwH,KAAKJ,IAEf/C,EAAKgB,SACR+B,EAAMA,EAAIU,KAAKzD,EAAKiB,OAASnB,GAAaF,KAG5C,GAAII,EAAKY,KAAM,CACb,IAASoC,EAAI,EAAGA,EAAID,EAAItG,OAAQuG,IAC9BD,EAAIC,GAAKhD,EAAK0D,MAAMX,EAAIC,IAEtBhD,EAAKa,QACPkC,EAAMA,EAAIY,QAAO,SAAUC,GACzB,IAAIC,GAAW,MAAM3J,KAAK0J,GACtBE,EAAI9D,EAAKvE,MAAMmI,IAAM5D,EAAKvE,MAAM4G,GAAQrC,EAAM4D,IAGlD,OAFIC,GAAUC,IACZD,EAAe,QAANC,IAAgBrC,MAAMC,QAAQoC,IAClCD,CACf,IAEG,CAEG7D,EAAKwB,OAAO/E,SACdsG,EAAMA,EAAIY,QAAO,SAASpH,GACxB,OAAQwH,GAAU/D,EAAMzD,EAC9B,KAEEyD,EAAKgE,MAAQjB,CACf,EA1KAkB,EA4KA,SAAejE,EAAMxE,GACnB,IAAI0I,EAAM7B,GAAQrC,EAAMxE,GACpBsI,EAAI9D,EAAKvE,MAAMyI,GACf3H,EAAIf,EACR,GAAIsI,EAAG,CACL,IAAIK,EAAc,QAANL,GAAerC,MAAMC,QAAQoC,GACrCM,EAAwB,MAAhB5I,EAAEgC,OAAO,GAOrB,GALI2G,IAAUC,EACZ7H,GAAK,KACG4H,GAASC,IACjB7H,EAAIA,EAAEiB,MAAM,GAAI,IAEdjB,IAAMf,EAAG,CACX,IAAI6I,EAAOhC,GAAQrC,EAAMzD,GACzByD,EAAKsB,UAAU+C,GAAQrE,EAAKsB,UAAU4C,GACtClE,EAAKvE,MAAM4I,GAAQrE,EAAKvE,MAAMyI,EAC/B,CACF,CAED,OAAO3H,CACT,EAhMA+H,GAAoBP,GACpBQ,GAgOA,SAA0BvE,EAAMd,GAC9B,QAAKc,EAAKwB,OAAO/E,QAGVuD,EAAKwB,OAAOgD,MAAK,SAASC,GAC/B,SAAUA,EAAKC,WAAYD,EAAKC,SAASC,MAAMzF,GACnD,GACA,EArOA,SAAS8C,GAAS4C,EAAKC,GACrB,OAAOlJ,OAAOC,UAAUC,eAAeC,KAAK8I,EAAKC,EACnD,CAKA,IAAInC,GAAYD,EAASqC,YAACpC,UAE1B,SAAS5C,GAAYiF,EAAGC,GACtB,OAAOD,EAAEE,cAAcC,cAAcF,EAAEC,cACzC,CAEA,SAASrF,GAAWmF,EAAGC,GACrB,OAAOD,EAAEG,cAAcF,EACzB,CAcA,SAASpD,GAAW3B,GAClB,IAAIyE,EAAW,KACf,GAA0B,QAAtBzE,EAAQzC,OAAO,GAAc,CAC/B,IAAI2H,EAAWlF,EAAQiC,QAAQ,aAAc,IAC7CwC,EAAW,IAAIhC,GAAUyC,EAAU,CAAExE,KAAK,GAC3C,CAED,MAAO,CACLyE,QAAS,IAAI1C,GAAUzC,EAAS,CAAEU,KAAK,IACvC+D,SAAUA,EAEd,CAwJA,SAASrC,GAASrC,EAAMqF,GACtB,IAAInB,EAAMmB,EAcV,OAZEnB,EADkB,MAAhBmB,EAAElG,OAAO,GACLD,EAAAA,QAAKoG,KAAKtF,EAAKiC,KAAMoD,GAClBjD,EAAWiD,IAAY,KAANA,EACpBA,EACGrF,EAAK8B,WACR5C,EAAAA,QAAKxD,QAAQsE,EAAK+B,IAAKsD,GAEvBnG,EAAAA,QAAKxD,QAAQ2J,GAGI,UAArBxL,QAAQC,WACVoK,EAAMA,EAAIhC,QAAQ,MAAO,MAEpBgC,CACT,CAKA,SAASH,GAAW/D,EAAMd,GACxB,QAAKc,EAAKwB,OAAO/E,QAGVuD,EAAKwB,OAAOgD,MAAK,SAASC,GAC/B,OAAOA,EAAKW,QAAQT,MAAMzF,OAAYuF,EAAKC,WAAYD,EAAKC,SAASC,MAAMzF,GAC/E,GACA,uHCtOAd,GAAiBmH,GACjBA,GAASC,SAAWA,GAKJ/C,EAAAA,YAAUC,UACf+C,GAAqBC,KAQhC,IAAIC,GAAUC,GAAOD,QACjB3D,GAAU4D,GAAO5D,QACjB6D,GAAkBD,GAAOC,gBACzB9B,GAAY6B,GAAO7B,UAEvB,SAASwB,GAAUtF,EAASC,GAC1B,GAAuB,mBAAZA,GAA+C,IAArB4F,UAAUrJ,OAC7C,MAAM,IAAIsJ,UAAU,uFAGtB,OAAO,IAAIP,GAASvF,EAASC,GAAS8D,KACxC,CAEA,SAASwB,GAAUvF,EAASC,GAC1B,IAAKD,EACH,MAAM,IAAI1F,MAAM,wBAElB,GAAuB,mBAAZ2F,GAA+C,IAArB4F,UAAUrJ,OAC7C,MAAM,IAAIsJ,UAAU,uFAGtB,KAAMC,gBAAgBR,IACpB,OAAO,IAAIA,GAASvF,EAASC,GAI/B,GAFAyF,GAAQK,KAAM/F,EAASC,GAEnB8F,KAAK9E,UACP,OAAO8E,KAET,IAAIC,EAAID,KAAKvD,UAAUyD,IAAIzJ,OAC3BuJ,KAAK9C,QAAU,IAAIzB,MAAMwE,GACzB,IAAK,IAAIjD,EAAI,EAAGA,EAAIiD,EAAGjD,IACrBgD,KAAKG,SAASH,KAAKvD,UAAUyD,IAAIlD,GAAIA,GAAG,GAE1CgD,KAAKI,SACP,CAEAZ,GAAS5J,UAAUwK,QAAU,WAE3B,GADAC,EAAM,QAACL,gBAAgBR,IACnBQ,KAAK7H,SAAU,CACjB,IAAI6B,EAAOgG,KACXA,KAAK9C,QAAQI,SAAQ,SAAUgD,EAAUC,GACvC,IAAIL,EAAMlG,EAAKkD,QAAQqD,GAAS5K,OAAO8E,OAAO,MAC9C,IAAK,IAAIjF,KAAK8K,EACZ,IACE9K,EAAIwE,EAAKwG,SAAShL,GAElB0K,EADWO,EAAGpI,aAAa7C,EAAGwE,EAAKQ,iBACvB,CACb,CAAC,MAAO3B,GACP,GAAmB,SAAfA,EAAGC,QAGL,MAAMD,EAFNqH,EAAIlG,EAAKwG,SAAShL,KAAM,CAG3B,CAET,GACG,CACDoK,GAAOc,OAAOV,KAChB,EAGAR,GAAS5J,UAAUuK,SAAW,SAAUlG,EAASsG,EAAOI,GACtDN,EAAM,QAACL,gBAAgBR,IAIvB,IADA,IAOIoB,EAPAX,EAAI,EACqB,iBAAfhG,EAAQgG,IACpBA,IAMF,OAAQA,GAEN,KAAKhG,EAAQxD,OAEX,YADAuJ,KAAKa,eAAe5G,EAAQqF,KAAK,KAAMiB,GAGzC,KAAK,EAGHK,EAAS,KACT,MAEF,QAIEA,EAAS3G,EAAQzC,MAAM,EAAGyI,GAAGX,KAAK,KAItC,IAGIwB,EAHAC,EAAS9G,EAAQzC,MAAMyI,GAIZ,OAAXW,EACFE,EAAO,IACA1E,EAAWwE,IAAWxE,EAAWnC,EAAQqF,KAAK,OAChDsB,GAAWxE,EAAWwE,KACzBA,EAAS,IAAMA,GACjBE,EAAOF,GAEPE,EAAOF,EAET,IAAI1C,EAAM8B,KAAKQ,SAASM,GAGpBjB,GAAgBG,KAAMc,KAGTC,EAAO,KAAOtE,EAASqC,YAACkC,SAEvChB,KAAKiB,iBAAiBL,EAAQE,EAAM5C,EAAK6C,EAAQR,EAAOI,GAExDX,KAAKkB,gBAAgBN,EAAQE,EAAM5C,EAAK6C,EAAQR,EAAOI,GAC3D,EAGAnB,GAAS5J,UAAUsL,gBAAkB,SAAUN,EAAQE,EAAM5C,EAAK6C,EAAQR,EAAOI,GAC/E,IAAIQ,EAAUnB,KAAKoB,SAASlD,EAAKyC,GAGjC,GAAKQ,EAAL,CAWA,IANA,IAAIE,EAAKN,EAAO,GACZO,IAAWtB,KAAKvD,UAAU6E,OAC1BC,EAAUF,EAAGG,MACbC,EAAQzB,KAAKrF,KAA6B,MAAtB4G,EAAQpI,OAAO,GAEnCuI,EAAiB,GACZ1E,EAAI,EAAGA,EAAImE,EAAQ1K,OAAQuG,IAAK,CAEvC,GAAoB,OADhBY,EAAIuD,EAAQnE,IACV7D,OAAO,IAAcsI,GAErBH,IAAWV,GACRhD,EAAEe,MAAM0C,GAETzD,EAAEe,MAAM0C,KAGZK,EAAetE,KAAKQ,EAEzB,CAED,IAAI+D,EAAMD,EAAejL,OAEzB,GAAY,IAARkL,EAQJ,GAAsB,IAAlBZ,EAAOtK,QAAiBuJ,KAAKpF,MAASoF,KAAKjJ,KAA/C,CAwBAgK,EAAOa,QACP,IAAS5E,EAAI,EAAGA,EAAI2E,EAAK3E,IAAM,CAC7B,IACI6E,EADAjE,EAAI8D,EAAe1E,GAGrB6E,EADEjB,EACW,CAACA,EAAQhD,GAET,CAACA,GAChBoC,KAAKG,SAAS0B,EAAWC,OAAOf,GAASR,EAAOI,EACjD,CAbA,KApBD,CACOX,KAAK9C,QAAQqD,KAChBP,KAAK9C,QAAQqD,GAAS5K,OAAO8E,OAAO,OAEtC,IAAK,IAAIuC,EAAI,EAAGA,EAAI2E,EAAK3E,IAAM,CAC7B,IAAIY,EAAI8D,EAAe1E,GACnB4D,IAEAhD,EADuB,MAArBgD,EAAOpJ,OAAO,GACZoJ,EAAS,IAAMhD,EAEfgD,EAAShD,GAGG,MAAhBA,EAAEzE,OAAO,IAAe6G,KAAK1D,UAC/BsB,EAAI1E,EAAAA,QAAKoG,KAAKU,KAAK/D,KAAM2B,IAE3BoC,KAAK+B,WAAWxB,EAAO3C,EACxB,CAGF,CAtDC,CAoEJ,EAGA4B,GAAS5J,UAAUmM,WAAa,SAAUxB,EAAO3C,GAC/C,IAAIG,GAAUiC,KAAMpC,GAApB,CAGA,IAAIM,EAAM8B,KAAKQ,SAAS5C,GASxB,GAPIoC,KAAKpF,OACPgD,EAAIoC,KAAKtC,MAAME,IAEboC,KAAK7E,WACPyC,EAAIM,IAGF8B,KAAK9C,QAAQqD,GAAO3C,GAAxB,CAGA,GAAIoC,KAAKnF,MAAO,CACd,IAAIiD,EAAIkC,KAAKvK,MAAMyI,GACnB,GAAU,QAANJ,GAAerC,MAAMC,QAAQoC,GAC/B,MACH,CAEDkC,KAAK9C,QAAQqD,GAAO3C,IAAK,EAErBoC,KAAKjJ,MACPiJ,KAAKgC,MAAMpE,EAXX,CAZA,CAwBJ,EAGA4B,GAAS5J,UAAUqM,mBAAqB,SAAU/D,GAGhD,GAAI8B,KAAKtF,OACP,OAAOsF,KAAKoB,SAASlD,GAAK,GAE5B,IAAIiD,EACAxJ,EAEJ,IACEA,EAAQjB,EAAAA,QAAGC,UAAUuH,EACtB,CAAC,MAAOrF,GACP,GAAgB,WAAZA,EAAGE,KAEL,OAAO,IAEV,CAED,IAAImJ,EAAQvK,GAASA,EAAMX,iBAU3B,OATAgJ,KAAKzE,SAAS2C,GAAOgE,EAIhBA,IAASvK,GAAUA,EAAMwK,cAG5BhB,EAAUnB,KAAKoB,SAASlD,GAAK,GAF7B8B,KAAKvK,MAAMyI,GAAO,OAIbiD,CACT,EAEA3B,GAAS5J,UAAUwL,SAAW,SAAUlD,EAAKyC,GAG3C,GAAIA,IAAe3E,GAAQgE,KAAKzE,SAAU2C,GACxC,OAAO8B,KAAKiC,mBAAmB/D,GAEjC,GAAIlC,GAAQgE,KAAKvK,MAAOyI,GAAM,CAC5B,IAAIJ,EAAIkC,KAAKvK,MAAMyI,GACnB,IAAKJ,GAAW,SAANA,EACR,OAAO,KAET,GAAIrC,MAAMC,QAAQoC,GAChB,OAAOA,CACV,CAED,IACE,OAAOkC,KAAKoC,gBAAgBlE,EAAKxH,EAAAA,QAAG2L,YAAYnE,GACjD,CAAC,MAAOrF,GAEP,OADAmH,KAAKsC,cAAcpE,EAAKrF,GACjB,IACR,CACH,EAEA2G,GAAS5J,UAAUwM,gBAAkB,SAAUlE,EAAKiD,GAIlD,IAAKnB,KAAKpF,OAASoF,KAAKjJ,KACtB,IAAK,IAAIiG,EAAI,EAAGA,EAAImE,EAAQ1K,OAAQuG,IAAM,CACxC,IAAIY,EAAIuD,EAAQnE,GAEdY,EADU,MAARM,EACEA,EAAMN,EAENM,EAAM,IAAMN,EAClBoC,KAAKvK,MAAMmI,IAAK,CACjB,CAMH,OAHAoC,KAAKvK,MAAMyI,GAAOiD,EAGXA,CACT,EAEA3B,GAAS5J,UAAU0M,cAAgB,SAAUjD,EAAGxG,GAE9C,OAAQA,EAAGE,MACT,IAAK,UACL,IAAK,UACH,IAAImF,EAAM8B,KAAKQ,SAASnB,GAExB,GADAW,KAAKvK,MAAMyI,GAAO,OACdA,IAAQ8B,KAAK7D,OAAQ,CACvB,IAAIjH,EAAQ,IAAIX,MAAMsE,EAAGE,KAAO,gBAAkBiH,KAAKjE,KAGvD,MAFA7G,EAAMgE,KAAO8G,KAAKjE,IAClB7G,EAAM6D,KAAOF,EAAGE,KACV7D,CACP,CACD,MAEF,IAAK,SACL,IAAK,QACL,IAAK,eACL,IAAK,UACH8K,KAAKvK,MAAMuK,KAAKQ,SAASnB,KAAM,EAC/B,MAEF,QAEE,GADAW,KAAKvK,MAAMuK,KAAKQ,SAASnB,KAAM,EAC3BW,KAAKzF,OACP,MAAM1B,EACHmH,KAAK1F,QACRtF,QAAQE,MAAM,aAAc2D,GAGpC,EAEA2G,GAAS5J,UAAUqL,iBAAmB,SAAUL,EAAQE,EAAM5C,EAAK6C,EAAQR,EAAOI,GAEhF,IAAIQ,EAAUnB,KAAKoB,SAASlD,EAAKyC,GAIjC,GAAKQ,EAAL,CAKA,IAAIoB,EAAwBxB,EAAOvJ,MAAM,GACrCgL,EAAS5B,EAAS,CAAEA,GAAW,GAC/B6B,EAAaD,EAAOV,OAAOS,GAG/BvC,KAAKG,SAASsC,EAAYlC,GAAO,GAEjC,IAAIoB,EAAMR,EAAQ1K,OAIlB,IAHYuJ,KAAKzE,SAAS2C,KAGbyC,EAGb,IAAK,IAAI3D,EAAI,EAAGA,EAAI2E,EAAK3E,IAAK,CAE5B,GAAoB,MADZmE,EAAQnE,GACV7D,OAAO,IAAe6G,KAAKrF,IAAjC,CAIA,IAAI+H,EAAUF,EAAOV,OAAOX,EAAQnE,GAAIuF,GACxCvC,KAAKG,SAASuC,EAASnC,GAAO,GAE9B,IAAIoC,EAAQH,EAAOV,OAAOX,EAAQnE,GAAI+D,GACtCf,KAAKG,SAASwC,EAAOpC,GAAO,EAP1B,CAQH,CA7BC,CA8BJ,EAEAf,GAAS5J,UAAUiL,eAAiB,SAAUD,EAAQL,GAGpD,IAAIqC,EAAS5C,KAAKgC,MAAMpB,GAMxB,GAJKZ,KAAK9C,QAAQqD,KAChBP,KAAK9C,QAAQqD,GAAS5K,OAAO8E,OAAO,OAGjCmI,EAAL,CAGA,GAAIhC,GAAUxE,EAAWwE,KAAYZ,KAAK1D,QAAS,CACjD,IAAIuG,EAAQ,UAAU3O,KAAK0M,GACF,MAArBA,EAAOzH,OAAO,GAChByH,EAAS1H,EAAAA,QAAKoG,KAAKU,KAAK/D,KAAM2E,IAE9BA,EAAS1H,EAAAA,QAAKxD,QAAQsK,KAAK/D,KAAM2E,GAC7BiC,IACFjC,GAAU,KAEf,CAEwB,UAArB/M,QAAQC,WACV8M,EAASA,EAAO1E,QAAQ,MAAO,MAGjC8D,KAAK+B,WAAWxB,EAAOK,EAjBrB,CAkBJ,EAGApB,GAAS5J,UAAUoM,MAAQ,SAAU3C,GACnC,IAAInB,EAAM8B,KAAKQ,SAASnB,GACpByD,EAA0B,MAAhBzD,EAAE7H,OAAO,GAEvB,GAAI6H,EAAE5I,OAASuJ,KAAK5E,UAClB,OAAO,EAET,IAAK4E,KAAKjJ,MAAQiF,GAAQgE,KAAKvK,MAAOyI,GAAM,CAC1C,IAAIJ,EAAIkC,KAAKvK,MAAMyI,GAMnB,GAJIzC,MAAMC,QAAQoC,KAChBA,EAAI,QAGDgF,GAAiB,QAANhF,EACd,OAAOA,EAET,GAAIgF,GAAiB,SAANhF,EACb,OAAO,CAIV,CAGD,IAAI/G,EAAOiJ,KAAK1E,UAAU4C,GAC1B,IAAKnH,EAAM,CACT,IAAIY,EACJ,IACEA,EAAQjB,EAAAA,QAAGC,UAAUuH,EACtB,CAAC,MAAOrF,GACP,GAAIA,IAAmB,WAAZA,EAAGE,MAAiC,YAAZF,EAAGE,MAEpC,OADAiH,KAAK1E,UAAU4C,IAAO,GACf,CAEV,CAED,GAAIvG,GAASA,EAAMX,iBACjB,IACED,EAAOL,EAAAA,QAAGY,SAAS4G,EACpB,CAAC,MAAOrF,GACP9B,EAAOY,CACR,MAEDZ,EAAOY,CAEV,CAEDqI,KAAK1E,UAAU4C,GAAOnH,EAElB+G,GAAI,EAMR,OALI/G,IACF+G,EAAI/G,EAAKoL,cAAgB,MAAQ,QAEnCnC,KAAKvK,MAAMyI,GAAO8B,KAAKvK,MAAMyI,IAAQJ,IAEjCgF,GAAiB,SAANhF,IAGRA,CACT,EAEA0B,GAAS5J,UAAU8H,MAAQ,SAAUlI,GACnC,OAAOoK,GAAOhF,KAAKoF,KAAMxK,EAC3B,EAEAgK,GAAS5J,UAAU4K,SAAW,SAAUnB,GACtC,OAAOO,GAAOvD,QAAQ2D,KAAMX,EAC9B,ECpeA,IAAI0D,GAAOpN,OAAO8E,OAAO,MAGzBuI,GAAiBC,EAAMC,UAEvB,SAAmBC,EAAK/O,GACtB,OAAI2O,GAAKI,IACPJ,GAAKI,GAAK/F,KAAKhJ,GACR,OAEP2O,GAAKI,GAAO,CAAC/O,GAKjB,SAAkB+O,GAChB,OAAOC,EAAAA,QAAK,SAASC,IACnB,IAAIC,EAAMP,GAAKI,GACXxB,EAAM2B,EAAI7M,OACV8M,EA2BR,SAAgBA,GAId,IAHA,IAAI9M,EAAS8M,EAAK9M,OACd+M,EAAQ,GAEHxG,EAAI,EAAGA,EAAIvG,EAAQuG,IAAKwG,EAAMxG,GAAKuG,EAAKvG,GACjD,OAAOwG,CACT,CAjCehM,CAAMsI,WAQjB,IACE,IAAK,IAAI9C,EAAI,EAAGA,EAAI2E,EAAK3E,IACvBsG,EAAItG,GAAGK,MAAM,KAAMkG,EAE3B,CAAc,QACJD,EAAI7M,OAASkL,GAGf2B,EAAIG,OAAO,EAAG9B,GACd9N,QAAQ4D,UAAS,WACf4L,EAAIhG,MAAM,KAAMkG,EAC1B,YAEeR,GAAKI,EAEf,CACL,GACA,CAjCWO,CAAQP,GAEnB,IC0BA,IAAAQ,GAAiBC,GAKDnH,EAAAA,YAAUC,UAE1B,IAAImH,GAAKpE,EAAiB,QAACqE,aAQvBnE,GAAUC,GAAOD,QACjB3D,GAAU4D,GAAO5D,QAGjB6D,GAAkBD,GAAOC,gBACzB9B,GAAY6B,GAAO7B,UAIvB,SAAS6F,GAAM3J,EAASC,EAAS9F,GAI/B,GAHuB,mBAAZ8F,IAAwB9F,EAAK8F,EAASA,EAAU,CAAE,GACxDA,IAASA,EAAU,CAAE,GAEtBA,EAAQ9B,KAAM,CAChB,GAAIhE,EACF,MAAM,IAAI2L,UAAU,kCACtB,OAAOR,GAAStF,EAASC,EAC1B,CAED,OAAO,IAAIwF,GAAKzF,EAASC,EAAS9F,EACpC,CAEAwP,GAAKxL,KAAOmH,GACZ,IAAIC,GAAWoE,GAAKpE,SAAWD,GAASC,SAyCxC,SAASE,GAAMzF,EAASC,EAAS9F,GAM/B,GALuB,mBAAZ8F,IACT9F,EAAK8F,EACLA,EAAU,MAGRA,GAAWA,EAAQ9B,KAAM,CAC3B,GAAIhE,EACF,MAAM,IAAI2L,UAAU,kCACtB,OAAO,IAAIP,GAASvF,EAASC,EAC9B,CAED,KAAM8F,gBAAgBN,IACpB,OAAO,IAAIA,GAAKzF,EAASC,EAAS9F,GAEpCuL,GAAQK,KAAM/F,EAASC,GACvB8F,KAAK+D,cAAe,EAGpB,IAAI9D,EAAID,KAAKvD,UAAUyD,IAAIzJ,OAM3BuJ,KAAK9C,QAAU,IAAIzB,MAAMwE,GAEP,mBAAP7L,IACTA,EAAKgP,EAAIY,OAAC5P,GACV4L,KAAKiE,GAAG,QAAS7P,GACjB4L,KAAKiE,GAAG,OAAO,SAAU/G,GACvB9I,EAAG,KAAM8I,EACf,KAGE,IAAIlD,EAAOgG,KAOX,GANAA,KAAKkE,YAAc,EAEnBlE,KAAKmE,WAAa,GAClBnE,KAAKoE,cAAgB,GACrBpE,KAAKqE,QAAS,EAEVrE,KAAK9E,UACP,OAAO8E,KAET,GAAU,IAANC,EACF,OAAOqE,IAGT,IADA,IAAIlM,GAAO,EACF4E,EAAI,EAAGA,EAAIiD,EAAGjD,IACrBgD,KAAKG,SAASH,KAAKvD,UAAUyD,IAAIlD,GAAIA,GAAG,EAAOsH,GAIjD,SAASA,MACLtK,EAAKkK,YACHlK,EAAKkK,aAAe,IAClB9L,EACFvE,QAAQ4D,UAAS,WACfuC,EAAKoG,SACf,IAEQpG,EAAKoG,UAGV,CAbDhI,GAAO,CAcT,CAxGAwL,GAAKA,KAAOA,GAeZA,GAAKW,SAAW,SAAUtK,EAASuK,GACjC,IAAItK,EAdN,SAAiBuK,EAAQC,GACvB,GAAY,OAARA,GAA+B,iBAARA,EACzB,OAAOD,EAKT,IAFA,IAAItH,EAAOxH,OAAOwH,KAAKuH,GACnB1H,EAAIG,EAAK1G,OACNuG,KACLyH,EAAOtH,EAAKH,IAAM0H,EAAIvH,EAAKH,IAE7B,OAAOyH,CACT,CAGgBE,CAAO,CAAE,EAAEH,GACzBtK,EAAQgB,WAAY,EAEpB,IACIgF,EADI,IAAIR,GAAKzF,EAASC,GACduC,UAAUyD,IAEtB,IAAKjG,EACH,OAAO,EAET,GAAIiG,EAAIzJ,OAAS,EACf,OAAO,EAET,IAAK,IAAImO,EAAI,EAAGA,EAAI1E,EAAI,GAAGzJ,OAAQmO,IACjC,GAAyB,iBAAd1E,EAAI,GAAG0E,GAChB,OAAO,EAGX,OAAO,CACT,EAEAhB,GAAKlE,KAAOA,GACZmF,EAAAA,SAASnF,GAAMmE,IAqEfnE,GAAK9J,UAAUwK,QAAU,WAEvB,GADAC,EAAM,QAACL,gBAAgBN,KACnBM,KAAK8E,QAAT,CAGA,GAAI9E,KAAK7H,WAAa6H,KAAK+E,aACzB,OAAO/E,KAAKgF,YAEdpF,GAAOc,OAAOV,MACdA,KAAKiF,KAAK,MAAOjF,KAAKhC,MANpB,CAOJ,EAEA0B,GAAK9J,UAAUoP,UAAY,WACzB,IAAIhF,KAAK+E,aAAT,CAGA/E,KAAK+E,cAAe,EAEpB,IAAI9E,EAAID,KAAK9C,QAAQzG,OACrB,GAAU,IAANwJ,EACF,OAAOD,KAAKI,UAGd,IADA,IAAIpG,EAAOgG,KACFhD,EAAI,EAAGA,EAAIgD,KAAK9C,QAAQzG,OAAQuG,IACvCgD,KAAKkF,aAAalI,EAAGmI,EAVrB,CAYF,SAASA,IACK,KAANlF,GACJjG,EAAKoG,SACR,CACH,EAEAV,GAAK9J,UAAUsP,aAAe,SAAU3E,EAAOnM,GAC7C,IAAIkM,EAAWN,KAAK9C,QAAQqD,GAC5B,IAAKD,EACH,OAAOlM,IAET,IAAI4J,EAAQrI,OAAOwH,KAAKmD,GACpBtG,EAAOgG,KACPC,EAAIjC,EAAMvH,OAEd,GAAU,IAANwJ,EACF,OAAO7L,IAET,IAAI8L,EAAMF,KAAK9C,QAAQqD,GAAS5K,OAAO8E,OAAO,MAC9CuD,EAAMV,SAAQ,SAAU9H,EAAGwH,GAIzBxH,EAAIwE,EAAKwG,SAAShL,GAClBiL,EAAGtI,SAAS3C,EAAGwE,EAAKQ,eAAe,SAAU3B,EAAIuM,GAC1CvM,EAEmB,SAAfA,EAAGC,QACVoH,EAAI1K,IAAK,EAETwE,EAAKiL,KAAK,QAASpM,GAJnBqH,EAAIkF,IAAQ,EAMF,KAANnF,IACJjG,EAAKkD,QAAQqD,GAASL,EACtB9L,IAER,GACA,GACA,EAEAsL,GAAK9J,UAAU8H,MAAQ,SAAUlI,GAC/B,OAAOoK,GAAOhF,KAAKoF,KAAMxK,EAC3B,EAEAkK,GAAK9J,UAAU4K,SAAW,SAAUnB,GAClC,OAAOO,GAAOvD,QAAQ2D,KAAMX,EAC9B,EAEAK,GAAK9J,UAAUyP,MAAQ,WACrBrF,KAAK8E,SAAU,EACf9E,KAAKiF,KAAK,QACZ,EAEAvF,GAAK9J,UAAU0P,MAAQ,WAChBtF,KAAKqE,SACRrE,KAAKqE,QAAS,EACdrE,KAAKiF,KAAK,SAEd,EAEAvF,GAAK9J,UAAU2P,OAAS,WACtB,GAAIvF,KAAKqE,OAAQ,CAGf,GAFArE,KAAKiF,KAAK,UACVjF,KAAKqE,QAAS,EACVrE,KAAKmE,WAAW1N,OAAQ,CAC1B,IAAI+O,EAAKxF,KAAKmE,WAAW3M,MAAM,GAC/BwI,KAAKmE,WAAW1N,OAAS,EACzB,IAAK,IAAIuG,EAAI,EAAGA,EAAIwI,EAAG/O,OAAQuG,IAAM,CACnC,IAAIY,EAAI4H,EAAGxI,GACXgD,KAAK+B,WAAWnE,EAAE,GAAIA,EAAE,GACzB,CACF,CACD,GAAIoC,KAAKoE,cAAc3N,OAAQ,CAC7B,IAAIgP,EAAKzF,KAAKoE,cAAc5M,MAAM,GAClCwI,KAAKoE,cAAc3N,OAAS,EAC5B,IAASuG,EAAI,EAAGA,EAAIyI,EAAGhP,OAAQuG,IAAM,CACnC,IAAIxH,EAAIiQ,EAAGzI,GACXgD,KAAKkE,cACLlE,KAAKG,SAAS3K,EAAE,GAAIA,EAAE,GAAIA,EAAE,GAAIA,EAAE,GACnC,CACF,CACF,CACH,EAEAkK,GAAK9J,UAAUuK,SAAW,SAAUlG,EAASsG,EAAOI,EAAYvM,GAI9D,GAHAiM,EAAM,QAACL,gBAAgBN,IACvBW,UAAqB,mBAAPjM,IAEV4L,KAAK8E,QAIT,GADA9E,KAAKkE,cACDlE,KAAKqE,OACPrE,KAAKoE,cAAchH,KAAK,CAACnD,EAASsG,EAAOI,EAAYvM,QADvD,CASA,IADA,IAOIwM,EAPAX,EAAI,EACqB,iBAAfhG,EAAQgG,IACpBA,IAMF,OAAQA,GAEN,KAAKhG,EAAQxD,OAEX,YADAuJ,KAAKa,eAAe5G,EAAQqF,KAAK,KAAMiB,EAAOnM,GAGhD,KAAK,EAGHwM,EAAS,KACT,MAEF,QAIEA,EAAS3G,EAAQzC,MAAM,EAAGyI,GAAGX,KAAK,KAItC,IAGIwB,EAHAC,EAAS9G,EAAQzC,MAAMyI,GAIZ,OAAXW,EACFE,EAAO,IACA1E,EAAWwE,IAAWxE,EAAWnC,EAAQqF,KAAK,OAChDsB,GAAWxE,EAAWwE,KACzBA,EAAS,IAAMA,GACjBE,EAAOF,GAEPE,EAAOF,EAET,IAAI1C,EAAM8B,KAAKQ,SAASM,GAGxB,GAAIjB,GAAgBG,KAAMc,GACxB,OAAO1M,IAEQ2M,EAAO,KAAOtE,EAASqC,YAACkC,SAEvChB,KAAKiB,iBAAiBL,EAAQE,EAAM5C,EAAK6C,EAAQR,EAAOI,EAAYvM,GAEpE4L,KAAKkB,gBAAgBN,EAAQE,EAAM5C,EAAK6C,EAAQR,EAAOI,EAAYvM,EAxDpE,CAyDH,EAEAsL,GAAK9J,UAAUsL,gBAAkB,SAAUN,EAAQE,EAAM5C,EAAK6C,EAAQR,EAAOI,EAAYvM,GACvF,IAAI4F,EAAOgG,KACXA,KAAKoB,SAASlD,EAAKyC,GAAY,SAAU9H,EAAIsI,GAC3C,OAAOnH,EAAK0L,iBAAiB9E,EAAQE,EAAM5C,EAAK6C,EAAQR,EAAOI,EAAYQ,EAAS/M,EACxF,GACA,EAEAsL,GAAK9J,UAAU8P,iBAAmB,SAAU9E,EAAQE,EAAM5C,EAAK6C,EAAQR,EAAOI,EAAYQ,EAAS/M,GAGjG,IAAK+M,EACH,OAAO/M,IAUT,IANA,IAAIiN,EAAKN,EAAO,GACZO,IAAWtB,KAAKvD,UAAU6E,OAC1BC,EAAUF,EAAGG,MACbC,EAAQzB,KAAKrF,KAA6B,MAAtB4G,EAAQpI,OAAO,GAEnCuI,EAAiB,GACZ1E,EAAI,EAAGA,EAAImE,EAAQ1K,OAAQuG,IAAK,CAEvC,GAAoB,OADhBY,EAAIuD,EAAQnE,IACV7D,OAAO,IAAcsI,GAErBH,IAAWV,GACRhD,EAAEe,MAAM0C,GAETzD,EAAEe,MAAM0C,KAGZK,EAAetE,KAAKQ,EAEzB,CAID,IAAI+D,EAAMD,EAAejL,OAEzB,GAAY,IAARkL,EACF,OAAOvN,IAOT,GAAsB,IAAlB2M,EAAOtK,SAAiBuJ,KAAKpF,OAASoF,KAAKjJ,KAAM,CAC9CiJ,KAAK9C,QAAQqD,KAChBP,KAAK9C,QAAQqD,GAAS5K,OAAO8E,OAAO,OAEtC,IAASuC,EAAI,EAAGA,EAAI2E,EAAK3E,IAAM,CAC7B,IAAIY,EAAI8D,EAAe1E,GACnB4D,IAEAhD,EADa,MAAXgD,EACEA,EAAS,IAAMhD,EAEfgD,EAAShD,GAGG,MAAhBA,EAAEzE,OAAO,IAAe6G,KAAK1D,UAC/BsB,EAAI1E,EAAAA,QAAKoG,KAAKU,KAAK/D,KAAM2B,IAE3BoC,KAAK+B,WAAWxB,EAAO3C,EACxB,CAED,OAAOxJ,GACR,CAID2M,EAAOa,QACP,IAAS5E,EAAI,EAAGA,EAAI2E,EAAK3E,IAAM,CACzBY,EAAI8D,EAAe1E,GAEnB4D,IAEAhD,EADa,MAAXgD,EACEA,EAAS,IAAMhD,EAEfgD,EAAShD,GAEjBoC,KAAKG,SAAS,CAACvC,GAAGkE,OAAOf,GAASR,EAAOI,EAAYvM,EACtD,CACDA,GACF,EAEAsL,GAAK9J,UAAUmM,WAAa,SAAUxB,EAAO3C,GAC3C,IAAIoC,KAAK8E,UAGL/G,GAAUiC,KAAMpC,GAGpB,GAAIoC,KAAKqE,OACPrE,KAAKmE,WAAW/G,KAAK,CAACmD,EAAO3C,QAD/B,CAKA,IAAIM,EAAM9B,EAAWwB,GAAKA,EAAIoC,KAAKQ,SAAS5C,GAQ5C,GANIoC,KAAKpF,OACPgD,EAAIoC,KAAKtC,MAAME,IAEboC,KAAK7E,WACPyC,EAAIM,IAEF8B,KAAK9C,QAAQqD,GAAO3C,GAAxB,CAGA,GAAIoC,KAAKnF,MAAO,CACd,IAAIiD,EAAIkC,KAAKvK,MAAMyI,GACnB,GAAU,QAANJ,GAAerC,MAAMC,QAAQoC,GAC/B,MACH,CAEDkC,KAAK9C,QAAQqD,GAAO3C,IAAK,EAEzB,IAAI+H,EAAK3F,KAAK1E,UAAU4C,GACpByH,GACF3F,KAAKiF,KAAK,OAAQrH,EAAG+H,GAEvB3F,KAAKiF,KAAK,QAASrH,EAdjB,CAXD,CA0BH,EAEA8B,GAAK9J,UAAUqM,mBAAqB,SAAU/D,EAAK9J,GACjD,IAAI4L,KAAK8E,QAAT,CAKA,GAAI9E,KAAKtF,OACP,OAAOsF,KAAKoB,SAASlD,GAAK,EAAO9J,GAEnC,IACI4F,EAAOgG,KACP4F,EAAUC,GAFC,UAAY3H,GAO3B,SAAmBrF,EAAIlB,GACrB,GAAIkB,GAAkB,WAAZA,EAAGE,KACX,OAAO3E,IAET,IAAI8N,EAAQvK,GAASA,EAAMX,iBAC3BgD,EAAKuB,SAAS2C,GAAOgE,EAIhBA,IAASvK,GAAUA,EAAMwK,cAI5BnI,EAAKoH,SAASlD,GAAK,EAAO9J,IAH1B4F,EAAKvE,MAAMyI,GAAO,OAClB9J,IAGH,IAjBGwR,GACFlP,UAAGiB,MAAMuG,EAAK0H,EAZd,CA6BJ,EAEAlG,GAAK9J,UAAUwL,SAAW,SAAUlD,EAAKyC,EAAYvM,GACnD,IAAI4L,KAAK8E,UAGT1Q,EAAKyR,GAAS,YAAY3H,EAAI,KAAKyC,EAAYvM,IAC/C,CAIA,GAAIuM,IAAe3E,GAAQgE,KAAKzE,SAAU2C,GACxC,OAAO8B,KAAKiC,mBAAmB/D,EAAK9J,GAEtC,GAAI4H,GAAQgE,KAAKvK,MAAOyI,GAAM,CAC5B,IAAIJ,EAAIkC,KAAKvK,MAAMyI,GACnB,IAAKJ,GAAW,SAANA,EACR,OAAO1J,IAET,GAAIqH,MAAMC,QAAQoC,GAChB,OAAO1J,EAAG,KAAM0J,EACnB,CAGDpH,EAAE,QAACoP,QAAQ5H,EAGb,SAAoBlE,EAAMkE,EAAK9J,GAC7B,OAAO,SAAUyE,EAAIsI,GACftI,EACFmB,EAAKsI,cAAcpE,EAAKrF,EAAIzE,GAE5B4F,EAAKoI,gBAAgBlE,EAAKiD,EAAS/M,EACtC,CACH,CAVkB2R,CAAU/F,KAAM9B,EAAK9J,GAhBnC,CAiBJ,EAWAsL,GAAK9J,UAAUwM,gBAAkB,SAAUlE,EAAKiD,EAAS/M,GACvD,IAAI4L,KAAK8E,QAAT,CAMA,IAAK9E,KAAKpF,OAASoF,KAAKjJ,KACtB,IAAK,IAAIiG,EAAI,EAAGA,EAAImE,EAAQ1K,OAAQuG,IAAM,CACxC,IAAIY,EAAIuD,EAAQnE,GAEdY,EADU,MAARM,EACEA,EAAMN,EAENM,EAAM,IAAMN,EAClBoC,KAAKvK,MAAMmI,IAAK,CACjB,CAIH,OADAoC,KAAKvK,MAAMyI,GAAOiD,EACX/M,EAAG,KAAM+M,EAjBd,CAkBJ,EAEAzB,GAAK9J,UAAU0M,cAAgB,SAAUjD,EAAGxG,EAAIzE,GAC9C,IAAI4L,KAAK8E,QAAT,CAIA,OAAQjM,EAAGE,MACT,IAAK,UACL,IAAK,UACH,IAAImF,EAAM8B,KAAKQ,SAASnB,GAExB,GADAW,KAAKvK,MAAMyI,GAAO,OACdA,IAAQ8B,KAAK7D,OAAQ,CACvB,IAAIjH,EAAQ,IAAIX,MAAMsE,EAAGE,KAAO,gBAAkBiH,KAAKjE,KACvD7G,EAAMgE,KAAO8G,KAAKjE,IAClB7G,EAAM6D,KAAOF,EAAGE,KAChBiH,KAAKiF,KAAK,QAAS/P,GACnB8K,KAAKqF,OACN,CACD,MAEF,IAAK,SACL,IAAK,QACL,IAAK,eACL,IAAK,UACHrF,KAAKvK,MAAMuK,KAAKQ,SAASnB,KAAM,EAC/B,MAEF,QACEW,KAAKvK,MAAMuK,KAAKQ,SAASnB,KAAM,EAC3BW,KAAKzF,SACPyF,KAAKiF,KAAK,QAASpM,GAGnBmH,KAAKqF,SAEFrF,KAAK1F,QACRtF,QAAQE,MAAM,aAAc2D,GAIlC,OAAOzE,GArCL,CAsCJ,EAEAsL,GAAK9J,UAAUqL,iBAAmB,SAAUL,EAAQE,EAAM5C,EAAK6C,EAAQR,EAAOI,EAAYvM,GACxF,IAAI4F,EAAOgG,KACXA,KAAKoB,SAASlD,EAAKyC,GAAY,SAAU9H,EAAIsI,GAC3CnH,EAAKgM,kBAAkBpF,EAAQE,EAAM5C,EAAK6C,EAAQR,EAAOI,EAAYQ,EAAS/M,EAClF,GACA,EAGAsL,GAAK9J,UAAUoQ,kBAAoB,SAAUpF,EAAQE,EAAM5C,EAAK6C,EAAQR,EAAOI,EAAYQ,EAAS/M,GAKlG,IAAK+M,EACH,OAAO/M,IAIT,IAAImO,EAAwBxB,EAAOvJ,MAAM,GACrCgL,EAAS5B,EAAS,CAAEA,GAAW,GAC/B6B,EAAaD,EAAOV,OAAOS,GAG/BvC,KAAKG,SAASsC,EAAYlC,GAAO,EAAOnM,GAExC,IAAI8N,EAAQlC,KAAKzE,SAAS2C,GACtByD,EAAMR,EAAQ1K,OAGlB,GAAIyL,GAASvB,EACX,OAAOvM,IAET,IAAK,IAAI4I,EAAI,EAAGA,EAAI2E,EAAK3E,IAAK,CAE5B,GAAoB,MADZmE,EAAQnE,GACV7D,OAAO,IAAe6G,KAAKrF,IAAjC,CAIA,IAAI+H,EAAUF,EAAOV,OAAOX,EAAQnE,GAAIuF,GACxCvC,KAAKG,SAASuC,EAASnC,GAAO,EAAMnM,GAEpC,IAAIuO,EAAQH,EAAOV,OAAOX,EAAQnE,GAAI+D,GACtCf,KAAKG,SAASwC,EAAOpC,GAAO,EAAMnM,EAPhC,CAQH,CAEDA,GACF,EAEAsL,GAAK9J,UAAUiL,eAAiB,SAAUD,EAAQL,EAAOnM,GAGvD,IAAI4F,EAAOgG,KACXA,KAAKgC,MAAMpB,GAAQ,SAAU/H,EAAI+J,GAC/B5I,EAAKiM,gBAAgBrF,EAAQL,EAAO1H,EAAI+J,EAAQxO,EACpD,GACA,EACAsL,GAAK9J,UAAUqQ,gBAAkB,SAAUrF,EAAQL,EAAO1H,EAAI+J,EAAQxO,GAQpE,GAJK4L,KAAK9C,QAAQqD,KAChBP,KAAK9C,QAAQqD,GAAS5K,OAAO8E,OAAO,QAGjCmI,EACH,OAAOxO,IAET,GAAIwM,GAAUxE,EAAWwE,KAAYZ,KAAK1D,QAAS,CACjD,IAAIuG,EAAQ,UAAU3O,KAAK0M,GACF,MAArBA,EAAOzH,OAAO,GAChByH,EAAS1H,EAAAA,QAAKoG,KAAKU,KAAK/D,KAAM2E,IAE9BA,EAAS1H,EAAAA,QAAKxD,QAAQsK,KAAK/D,KAAM2E,GAC7BiC,IACFjC,GAAU,KAEf,CAEwB,UAArB/M,QAAQC,WACV8M,EAASA,EAAO1E,QAAQ,MAAO,MAGjC8D,KAAK+B,WAAWxB,EAAOK,GACvBxM,GACF,EAGAsL,GAAK9J,UAAUoM,MAAQ,SAAU3C,EAAGjL,GAClC,IAAI8J,EAAM8B,KAAKQ,SAASnB,GACpByD,EAA0B,MAAhBzD,EAAE7H,OAAO,GAEvB,GAAI6H,EAAE5I,OAASuJ,KAAK5E,UAClB,OAAOhH,IAET,IAAK4L,KAAKjJ,MAAQiF,GAAQgE,KAAKvK,MAAOyI,GAAM,CAC1C,IAAIJ,EAAIkC,KAAKvK,MAAMyI,GAMnB,GAJIzC,MAAMC,QAAQoC,KAChBA,EAAI,QAGDgF,GAAiB,QAANhF,EACd,OAAO1J,EAAG,KAAM0J,GAElB,GAAIgF,GAAiB,SAANhF,EACb,OAAO1J,GAIV,CAGD,IAAI2C,EAAOiJ,KAAK1E,UAAU4C,GAC1B,QAAagI,IAATnP,EAAoB,CACtB,IAAa,IAATA,EACF,OAAO3C,EAAG,KAAM2C,GAEhB,IAAIoP,EAAOpP,EAAKoL,cAAgB,MAAQ,OACxC,OAAIW,GAAoB,SAATqD,EACN/R,IAEAA,EAAG,KAAM+R,EAAMpP,EAE3B,CAED,IAAIiD,EAAOgG,KACPoG,EAASP,GAAS,SAAW3H,GAIjC,SAAmBrF,EAAIlB,GACrB,GAAIA,GAASA,EAAMX,iBAGjB,OAAON,EAAE,QAACK,KAAKmH,GAAK,SAAUrF,EAAI9B,GAC5B8B,EACFmB,EAAKqM,OAAOhH,EAAGnB,EAAK,KAAMvG,EAAOvD,GAEjC4F,EAAKqM,OAAOhH,EAAGnB,EAAKrF,EAAI9B,EAAM3C,EACxC,IAEM4F,EAAKqM,OAAOhH,EAAGnB,EAAKrF,EAAIlB,EAAOvD,EAElC,IAhBGgS,GACF1P,UAAGiB,MAAMuG,EAAKkI,EAgBlB,EAEA1G,GAAK9J,UAAUyQ,OAAS,SAAUhH,EAAGnB,EAAKrF,EAAI9B,EAAM3C,GAClD,GAAIyE,IAAmB,WAAZA,EAAGE,MAAiC,YAAZF,EAAGE,MAEpC,OADAiH,KAAK1E,UAAU4C,IAAO,EACf9J,IAGT,IAAI0O,EAA0B,MAAhBzD,EAAE7H,OAAO,GAGvB,GAFAwI,KAAK1E,UAAU4C,GAAOnH,EAEA,MAAlBmH,EAAI1G,OAAO,IAAcT,IAASA,EAAKoL,cACzC,OAAO/N,EAAG,MAAM,EAAO2C,GAEzB,IAAI+G,GAAI,EAKR,OAJI/G,IACF+G,EAAI/G,EAAKoL,cAAgB,MAAQ,QACnCnC,KAAKvK,MAAMyI,GAAO8B,KAAKvK,MAAMyI,IAAQJ,EAEjCgF,GAAiB,SAANhF,EACN1J,IAEFA,EAAG,KAAM0J,EAAG/G,EACrB,+CCjxBEiJ,EAAIsG,eAAA,SAAaC,GAEnB,SAAS/O,EAAMgP,EAAWlQ,GACtBA,GAAc,EAGd,IAFA,IAAImQ,EAASC,KAAKC,IAAIH,EAAU/P,OAASH,EAAO,GAC5CsQ,EAASnL,MAAMgL,GACXI,EAAM,EAAGA,EAAMJ,EAAQI,IAC3BD,EAAOC,GAAOL,EAAUlQ,EAAQuQ,GAEpC,OAAOD,CACX,CA+CA,IAAIvJ,EAAQ,SAASyJ,GACjB,IAAIvD,EAAO/L,EAAMsI,UAAW,GAC5B,OAAO,WACH,IAAIiH,EAAWvP,EAAMsI,WACrB,OAAOgH,EAAGzJ,MAAM,KAAMkG,EAAKzB,OAAOiF,GAC1C,CACA,EAEIC,EAAgB,SAAUF,GAC1B,OAAO,WACH,IAAIvD,EAAO/L,EAAMsI,WACbzL,EAAWkP,EAAK0D,MACpBH,EAAGhR,KAAKkK,KAAMuD,EAAMlP,EAC5B,CACA,EA2BA,SAAS6S,EAASC,GAChB,IAAIhB,SAAcgB,EAClB,OAAgB,MAATA,IAA0B,UAARhB,GAA4B,YAARA,EAC/C,CAEA,IAAIiB,EAA0C,mBAAjBC,cAA+BA,aACxDC,EAAiC,iBAAZzT,SAAoD,mBAArBA,QAAQ4D,SAEhE,SAAS8P,EAAST,GACdU,WAAWV,EAAI,EACnB,CAEA,SAASW,EAAKC,GACV,OAAO,SAAUZ,GACb,IAAIvD,EAAO/L,EAAMsI,UAAW,GAC5B4H,GAAM,WACFZ,EAAGzJ,MAAM,KAAMkG,EAC3B,GACA,CACA,CAYA,IAAIoE,EAAiBF,EARjBL,EACSC,aACFC,EACEzT,QAAQ4D,SAER8P,GA6Db,SAASK,EAASC,GACd,OAAOb,GAAc,SAAUzD,EAAMlP,GACjC,IAAIwC,EACJ,IACIA,EAASgR,EAAKxK,MAAM2C,KAAMuD,EAC7B,CAAC,MAAO3F,GACL,OAAOvJ,EAASuJ,EACnB,CAEGsJ,EAASrQ,IAAkC,mBAAhBA,EAAOiR,KAClCjR,EAAOiR,MAAK,SAASX,GACjBY,EAAe1T,EAAU,KAAM8S,EAClC,IAAE,SAAS3S,GACRuT,EAAe1T,EAAUG,EAAIC,QAAUD,EAAM,IAAID,MAAMC,GACvE,IAEYH,EAAS,KAAMwC,EAE3B,GACA,CAEA,SAASkR,EAAe1T,EAAUa,EAAOiS,GACrC,IACI9S,EAASa,EAAOiS,EACnB,CAAC,MAAOvJ,GACL+J,EAAexS,EAASyI,EAC3B,CACL,CAEA,SAASzI,EAAQD,GACb,MAAMA,CACV,CAEA,IAAI8S,EAAmC,mBAAXC,OAE5B,SAASC,EAAQpB,GACb,OAAOkB,GAA6C,kBAA3BlB,EAAGmB,OAAOE,YACvC,CAEA,SAASC,EAAUC,GACf,OAAOH,EAAQG,GAAWT,EAASS,GAAWA,CAClD,CAEA,SAASC,EAAYC,GACjB,OAAO,SAASC,GACZ,IAAIjF,EAAO/L,EAAMsI,UAAW,GACxB2I,EAAKzB,GAAc,SAASzD,EAAMlP,GAClC,IAAIqU,EAAO1I,KACX,OAAOuI,EAAOC,GAAK,SAAU1B,EAAI1S,GAC7BgU,EAAUtB,GAAIzJ,MAAMqL,EAAMnF,EAAKzB,OAAO1N,GACzC,GAAEC,EACf,IACQ,OAAIkP,EAAK9M,OACEgS,EAAGpL,MAAM2C,KAAMuD,GAGfkF,CAEnB,CACA,CAGA,IAAIE,EAA8B,iBAAVC,EAAMtC,gBAAgBsC,EAAAA,gBAAUA,EAAAA,eAAOjT,SAAWA,QAAUiT,iBAGhFC,EAA0B,iBAAR7O,MAAoBA,MAAQA,KAAKrE,SAAWA,QAAUqE,KAGxEiC,EAAO0M,GAAcE,GAAYC,SAAS,cAATA,GAGjCC,EAAW9M,EAAKgM,OAGhBe,EAAcrT,OAAOC,UAGrBC,EAAiBmT,EAAYnT,eAO7BoT,EAAuBD,EAAY5R,SAGnC8R,EAAmBH,EAAWA,EAASZ,iBAAcjC,EASzD,SAASiD,EAAUhC,GACjB,IAAIiC,EAAQvT,EAAeC,KAAKqR,EAAO+B,GACnCG,EAAMlC,EAAM+B,GAEhB,IACE/B,EAAM+B,QAAoBhD,EAC1B,IAAIoD,GAAW,CACnB,CAAI,MAAO1L,GAAK,CAEd,IAAI/G,EAASoS,EAAqBnT,KAAKqR,GAQvC,OAPImC,IACEF,EACFjC,EAAM+B,GAAoBG,SAEnBlC,EAAM+B,IAGVrS,CACT,CAGA,IAAI0S,EAAgB5T,OAAOC,UAOvB4T,EAAyBD,EAAcnS,SAS3C,SAASqS,EAAetC,GACtB,OAAOqC,EAAuB1T,KAAKqR,EACrC,CAGA,IAAIuC,EAAU,gBACVC,EAAe,qBAGfC,EAAiBb,EAAWA,EAASZ,iBAAcjC,EASvD,SAAS2D,EAAW1C,GAClB,OAAa,MAATA,OACejB,IAAViB,EAAsBwC,EAAeD,EAEtCE,GAAkBA,KAAkBjU,OAAOwR,GAC/CgC,EAAUhC,GACVsC,EAAetC,EACrB,CAGA,IAAI2C,EAAW,yBACXC,EAAU,oBACVC,EAAS,6BACTC,EAAW,iBAmBf,SAASC,EAAW/C,GAClB,IAAKD,EAASC,GACZ,OAAO,EAIT,IAAIkC,EAAMQ,EAAW1C,GACrB,OAAOkC,GAAOU,GAAWV,GAAOW,GAAUX,GAAOS,GAAYT,GAAOY,CACtE,CAGA,IAAIE,EAAmB,iBA4BvB,SAASC,EAASjD,GAChB,MAAuB,iBAATA,GACZA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,GAASgD,CAC7C,CA2BA,SAASE,EAAYlD,GACnB,OAAgB,MAATA,GAAiBiD,EAASjD,EAAM1Q,UAAYyT,EAAW/C,EAChE,CAIA,IAAImD,EAAY,CAAA,EAchB,SAASC,IAET,CAEA,SAASnH,EAAK0D,GACV,OAAO,WACH,GAAW,OAAPA,EAAJ,CACA,IAAI0D,EAAS1D,EACbA,EAAK,KACL0D,EAAOnN,MAAM2C,KAAMF,UAHK,CAIhC,CACA,CAEA,IAAI2K,EAAmC,mBAAXxC,QAAyBA,OAAOyC,SAExDC,EAAc,SAAUC,GACxB,OAAOH,GAAkBG,EAAKH,IAAmBG,EAAKH,IAC1D,EAWA,SAASI,EAAU5K,EAAG6K,GAIpB,IAHA,IAAIvK,GAAS,EACT1J,EAAS4E,MAAMwE,KAEVM,EAAQN,GACfpJ,EAAO0J,GAASuK,EAASvK,GAE3B,OAAO1J,CACT,CA0BA,SAASkU,EAAa5D,GACpB,OAAgB,MAATA,GAAiC,iBAATA,CACjC,CAGA,IAAI6D,EAAU,qBASd,SAASC,EAAgB9D,GACvB,OAAO4D,EAAa5D,IAAU0C,EAAW1C,IAAU6D,CACrD,CAGA,IAAIE,EAAgBvV,OAAOC,UAGvBuV,EAAmBD,EAAcrV,eAGjCuV,GAAuBF,EAAcE,qBAoBrCC,GAAcJ,EAAgB,WAAa,OAAOnL,SAAU,CAA9B,IAAsCmL,EAAkB,SAAS9D,GACjG,OAAO4D,EAAa5D,IAAUgE,EAAiBrV,KAAKqR,EAAO,YACxDiE,GAAqBtV,KAAKqR,EAAO,SACtC,EAyBIzL,GAAUD,MAAMC,QAepB,SAAS4P,KACP,OAAO,CACT,CAGA,IAAIC,GAAgC,iBAAXhF,GAAuBA,IAAYA,EAAQiF,UAAYjF,EAG5EkF,GAAaF,IAA4CG,IAAWA,EAAOF,UAAYE,EAMvFC,GAHgBF,IAAcA,GAAWlF,UAAYgF,GAG5BtP,EAAK0P,YAASzF,EAsBvC0F,IAnBiBD,GAASA,GAAOC,cAAW1F,IAmBfoF,GAG7BO,GAAqB,iBAGrBC,GAAW,mBAUf,SAASC,GAAQ5E,EAAO1Q,GACtB,IAAI0P,SAAcgB,EAGlB,SAFA1Q,EAAmB,MAAVA,EAAiBoV,GAAqBpV,KAGpC,UAAR0P,GACU,UAARA,GAAoB2F,GAAS5X,KAAKiT,KAChCA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,EAAQ1Q,CACjD,CAGA,IAAIuV,GAAY,qBACZC,GAAW,iBACXC,GAAU,mBACVC,GAAU,gBACVC,GAAW,iBACXC,GAAY,oBACZC,GAAS,eACTC,GAAY,kBACZC,GAAY,kBACZC,GAAY,kBACZC,GAAS,eACTC,GAAY,kBACZC,GAAa,mBAEbC,GAAiB,uBACjBC,GAAc,oBAEdC,GAAa,wBACbC,GAAU,qBACVC,GAAW,sBACXC,GAAW,sBACXC,GAAW,sBACXC,GAAkB,6BAClBC,GAAY,uBACZC,GAAY,uBAGZC,GAAiB,CAAA,EAsBrB,SAASC,GAAiBrG,GACxB,OAAO4D,EAAa5D,IAClBiD,EAASjD,EAAM1Q,WAAa8W,GAAe1D,EAAW1C,GAC1D,CASA,SAASsG,GAAU5F,GACjB,OAAO,SAASV,GACd,OAAOU,EAAKV,EAChB,CACA,CArCAoG,GAZiB,yBAYYA,GAAeR,IAC5CQ,GAAeP,IAAWO,GAAeN,IACzCM,GAAeL,IAAYK,GAAeJ,IAC1CI,GAAeH,IAAmBG,GAAeF,IACjDE,GAAeD,KAAa,EAC5BC,GAAevB,IAAauB,GAAetB,IAC3CsB,GAAeV,IAAkBU,GAAerB,IAChDqB,GAAeT,IAAeS,GAAepB,IAC7CoB,GAAenB,IAAYmB,GAAelB,IAC1CkB,GAAejB,IAAUiB,GAAehB,IACxCgB,GAAef,IAAae,GAAed,IAC3Cc,GAAeb,IAAUa,GAAeZ,IACxCY,GAAeX,KAAc,EA4B7B,IAAIc,GAAkC,iBAAXnH,GAAuBA,IAAYA,EAAQiF,UAAYjF,EAG9EoH,GAAeD,IAA8ChC,IAAWA,EAAOF,UAAYE,EAM3FkC,GAHkBD,IAAgBA,GAAapH,UAAYmH,IAG1B/E,EAAW9U,QAG5Cga,GAAY,WACd,IAEE,IAAIC,EAAQH,IAAgBA,GAAaI,SAAWJ,GAAaI,QAAQ,QAAQD,MAEjF,OAAIA,GAKGF,IAAeA,GAAYI,SAAWJ,GAAYI,QAAQ,OACrE,CAAI,MAAOpQ,GAAK,CAChB,IAGIqQ,GAAmBJ,IAAYA,GAASK,aAmBxCA,GAAeD,GAAmBR,GAAUQ,IAAoBT,GAGhEW,GAAgBxY,OAAOC,UAGvBwY,GAAmBD,GAActY,eAUrC,SAASwY,GAAclH,EAAOmH,GAC5B,IAAIC,EAAQ7S,GAAQyL,GAChBqH,GAASD,GAASlD,GAAYlE,GAC9BsH,GAAUF,IAAUC,GAAS5C,GAASzE,GACtCuH,GAAUH,IAAUC,IAAUC,GAAUP,GAAa/G,GACrDwH,EAAcJ,GAASC,GAASC,GAAUC,EAC1C7X,EAAS8X,EAAc9D,EAAU1D,EAAM1Q,OAAQmY,QAAU,GACzDnY,EAASI,EAAOJ,OAEpB,IAAK,IAAI0M,KAAOgE,GACTmH,IAAaF,GAAiBtY,KAAKqR,EAAOhE,IACzCwL,IAEQ,UAAPxL,GAECsL,IAAkB,UAAPtL,GAA0B,UAAPA,IAE9BuL,IAAkB,UAAPvL,GAA0B,cAAPA,GAA8B,cAAPA,IAEtD4I,GAAQ5I,EAAK1M,KAElBI,EAAOuG,KAAK+F,GAGhB,OAAOtM,CACT,CAGA,IAAIgY,GAAgBlZ,OAAOC,UAS3B,SAASkZ,GAAY3H,GACnB,IAAI4H,EAAO5H,GAASA,EAAM6H,YAG1B,OAAO7H,KAFqB,mBAAR4H,GAAsBA,EAAKnZ,WAAciZ,GAG/D,CAUA,SAASI,GAAQpH,EAAMqH,GACrB,OAAO,SAASC,GACd,OAAOtH,EAAKqH,EAAUC,GAC1B,CACA,CAGA,IAAIC,GAAaH,GAAQtZ,OAAOwH,KAAMxH,QAGlC0Z,GAAgB1Z,OAAOC,UAGvB0Z,GAAmBD,GAAcxZ,eASrC,SAAS0Z,GAASC,GAChB,IAAKV,GAAYU,GACf,OAAOJ,GAAWI,GAEpB,IAAI3Y,EAAS,GACb,IAAK,IAAIsM,KAAOxN,OAAO6Z,GACjBF,GAAiBxZ,KAAK0Z,EAAQrM,IAAe,eAAPA,GACxCtM,EAAOuG,KAAK+F,GAGhB,OAAOtM,CACT,CA8BA,SAASsG,GAAKqS,GACZ,OAAOnF,EAAYmF,GAAUnB,GAAcmB,GAAUD,GAASC,EAChE,CAEA,SAASC,GAAoB7E,GACzB,IAAI5N,GAAK,EACL2E,EAAMiJ,EAAKnU,OACf,OAAO,WACH,QAASuG,EAAI2E,EAAM,CAACwF,MAAOyD,EAAK5N,GAAImG,IAAKnG,GAAK,IACjD,CACL,CAEA,SAAS0S,GAAqBhF,GAC1B,IAAI1N,GAAK,EACT,OAAO,WACH,IAAIyB,EAAOiM,EAASvF,OACpB,OAAI1G,EAAK6F,KACE,MACXtH,IACO,CAACmK,MAAO1I,EAAK0I,MAAOhE,IAAKnG,GACnC,CACL,CAEA,SAAS2S,GAAqB/Q,GAC1B,IAAIgR,EAAQzS,GAAKyB,GACb5B,GAAK,EACL2E,EAAMiO,EAAMnZ,OAChB,OAAO,SAAS0O,IACZ,IAAIhC,EAAMyM,IAAQ5S,GAClB,MAAY,cAARmG,EACOgC,IAEJnI,EAAI2E,EAAM,CAACwF,MAAOvI,EAAIuE,GAAMA,IAAKA,GAAO,IACvD,CACA,CAEA,SAASuH,GAASE,GACd,GAAIP,EAAYO,GACZ,OAAO6E,GAAoB7E,GAG/B,IAAIF,EAAWC,EAAYC,GAC3B,OAAOF,EAAWgF,GAAqBhF,GAAYiF,GAAqB/E,EAC5E,CAEA,SAASiF,GAAS/I,GACd,OAAO,WACH,GAAW,OAAPA,EAAa,MAAM,IAAIvS,MAAM,gCACjC,IAAIiW,EAAS1D,EACbA,EAAK,KACL0D,EAAOnN,MAAM2C,KAAMF,UAC3B,CACA,CAEA,SAASgQ,GAAaC,GAClB,OAAO,SAAUnR,EAAKkM,EAAUzW,GAE5B,GADAA,EAAW+O,EAAK/O,GAAYkW,GACxBwF,GAAS,IAAMnR,EACf,OAAOvK,EAAS,MAEpB,IAAI2b,EAAWtF,GAAS9L,GACpB0F,GAAO,EACP2L,EAAU,EACVC,GAAU,EAEd,SAASC,EAAiB3b,EAAK2S,GAE3B,GADA8I,GAAW,EACPzb,EACA8P,GAAO,EACPjQ,EAASG,OAER,IAAI2S,IAAUmD,GAAchG,GAAQ2L,GAAW,EAEhD,OADA3L,GAAO,EACAjQ,EAAS,MAEV6b,GACNE,GACH,CACJ,CAED,SAASA,IAEL,IADAF,GAAU,EACHD,EAAUF,IAAUzL,GAAM,CAC7B,IAAI+L,EAAOL,IACX,GAAa,OAATK,EAKA,OAJA/L,GAAO,OACH2L,GAAW,GACX5b,EAAS,OAIjB4b,GAAW,EACXnF,EAASuF,EAAKlJ,MAAOkJ,EAAKlN,IAAK0M,GAASM,GAC3C,CACDD,GAAU,CACb,CAEDE,GACR,CACA,CAsBA,SAASE,GAAY1F,EAAMmF,EAAOjF,EAAUzW,GACxCyb,GAAaC,EAAbD,CAAoBlF,EAAMxC,EAAU0C,GAAWzW,EACnD,CAEA,SAASkc,GAAQzJ,EAAIiJ,GACjB,OAAO,SAAUS,EAAU1F,EAAUzW,GACjC,OAAOyS,EAAG0J,EAAUT,EAAOjF,EAAUzW,EAC7C,CACA,CAGA,SAASoc,GAAgB7F,EAAME,EAAUzW,GACrCA,EAAW+O,EAAK/O,GAAYkW,GAC5B,IAAIhK,EAAQ,EACRmQ,EAAY,EACZja,EAASmU,EAAKnU,OAKlB,SAASka,EAAiBnc,EAAK2S,GACvB3S,EACAH,EAASG,KACCkc,IAAcja,GAAW0Q,IAAUmD,GAC7CjW,EAAS,KAEhB,CAED,IAZe,IAAXoC,GACApC,EAAS,MAWNkM,EAAQ9J,EAAQ8J,IACnBuK,EAASF,EAAKrK,GAAQA,EAAOsP,GAASc,GAE9C,CAGA,IAAIC,GAAgBL,GAAQD,GAAajV,KAyCrCwV,GAAS,SAASjG,EAAME,EAAUzW,IACPgW,EAAYO,GAAQ6F,GAAkBG,IAC5ChG,EAAMxC,EAAU0C,GAAWzW,EACpD,EAEA,SAASyc,GAAWhK,GAChB,OAAO,SAAUlI,EAAKkM,EAAUzW,GAC5B,OAAOyS,EAAG+J,GAAQjS,EAAKwJ,EAAU0C,GAAWzW,EACpD,CACA,CAEA,SAAS0c,GAAUxI,EAAQyI,EAAKlG,EAAUzW,GACtCA,EAAWA,GAAYkW,EACvByG,EAAMA,GAAO,GACb,IAAIC,EAAU,GACVC,EAAU,EACVC,EAAY/I,EAAU0C,GAE1BvC,EAAOyI,GAAK,SAAU7J,EAAOiK,EAAG/c,GAC5B,IAAIkM,EAAQ2Q,IACZC,EAAUhK,GAAO,SAAU3S,EAAK6c,GAC5BJ,EAAQ1Q,GAAS8Q,EACjBhd,EAASG,EACrB,GACK,IAAE,SAAUA,GACTH,EAASG,EAAKyc,EACtB,GACA,CAsCA,IAAItV,GAAMmV,GAAWC,IAmCjBO,GAAYhJ,EAAY3M,IAE5B,SAAS4V,GAAgBzK,GACrB,OAAO,SAAUlI,EAAKmR,EAAOjF,EAAUzW,GACnC,OAAOyS,EAAGgJ,GAAaC,GAAQnR,EAAKwJ,EAAU0C,GAAWzW,EACjE,CACA,CAqBA,IAAImd,GAAWD,GAAgBR,IAoB3BU,GAAYlB,GAAQiB,GAAU,GAqB9BE,GAAkBpJ,EAAYmJ,IAWlC,SAASE,GAAUnO,EAAOsH,GAIxB,IAHA,IAAIvK,GAAS,EACT9J,EAAkB,MAAT+M,EAAgB,EAAIA,EAAM/M,SAE9B8J,EAAQ9J,IAC8B,IAAzCqU,EAAStH,EAAMjD,GAAQA,EAAOiD,KAIpC,OAAOA,CACT,CASA,SAASoO,GAAcC,GACrB,OAAO,SAASrC,EAAQ1E,EAAUgH,GAMhC,IALA,IAAIvR,GAAS,EACTiQ,EAAW7a,OAAO6Z,GAClBuC,EAAQD,EAAStC,GACjB/Y,EAASsb,EAAMtb,OAEZA,KAAU,CACf,IAAI0M,EAAM4O,EAAMF,EAAYpb,IAAW8J,GACvC,IAA+C,IAA3CuK,EAAS0F,EAASrN,GAAMA,EAAKqN,GAC/B,KAEH,CACD,OAAOhB,CACX,CACA,CAaA,IAAIwC,GAAUJ,KAUd,SAASK,GAAWzC,EAAQ1E,GAC1B,OAAO0E,GAAUwC,GAAQxC,EAAQ1E,EAAU3N,GAC7C,CAaA,SAAS+U,GAAc1O,EAAO2O,EAAWC,EAAWP,GAIlD,IAHA,IAAIpb,EAAS+M,EAAM/M,OACf8J,EAAQ6R,GAAaP,EAAY,GAAK,GAElCA,EAAYtR,MAAYA,EAAQ9J,GACtC,GAAI0b,EAAU3O,EAAMjD,GAAQA,EAAOiD,GACjC,OAAOjD,EAGX,OAAQ,CACV,CASA,SAAS8R,GAAUlL,GACjB,OAAOA,GAAUA,CACnB,CAYA,SAASmL,GAAc9O,EAAO2D,EAAOiL,GAInC,IAHA,IAAI7R,EAAQ6R,EAAY,EACpB3b,EAAS+M,EAAM/M,SAEV8J,EAAQ9J,GACf,GAAI+M,EAAMjD,KAAW4G,EACnB,OAAO5G,EAGX,OAAQ,CACV,CAWA,SAASgS,GAAY/O,EAAO2D,EAAOiL,GACjC,OAAOjL,GAAUA,EACbmL,GAAc9O,EAAO2D,EAAOiL,GAC5BF,GAAc1O,EAAO6O,GAAWD,EACtC,CAiFA,IAAII,GAAO,SAAUC,EAAOC,EAAare,GACV,mBAAhBqe,IAEPre,EAAWqe,EACXA,EAAc,MAElBre,EAAW+O,EAAK/O,GAAYkW,GAC5B,IACIoI,EADUxV,GAAKsV,GACIhc,OACvB,IAAKkc,EACD,OAAOte,EAAS,MAEfqe,IACDA,EAAcC,GAGlB,IAAI1B,EAAU,CAAA,EACV2B,EAAe,EACfC,GAAW,EAEXC,EAAYnd,OAAO8E,OAAO,MAE1BsY,EAAa,GAGbC,EAAe,GAEfC,EAAwB,CAAA,EAsC5B,SAASC,EAAY/P,EAAKgQ,GACtBJ,EAAW3V,MAAK,WACZgW,EAAQjQ,EAAKgQ,EACzB,GACK,CAED,SAASE,IACL,GAA0B,IAAtBN,EAAWtc,QAAiC,IAAjBmc,EAC3B,OAAOve,EAAS,KAAM4c,GAE1B,KAAM8B,EAAWtc,QAAUmc,EAAeF,GAC5BK,EAAWnR,OACrB0R,EAGP,CAED,SAASC,EAAYC,EAAU1M,GAC3B,IAAI2M,EAAgBX,EAAUU,GACzBC,IACDA,EAAgBX,EAAUU,GAAY,IAG1CC,EAAcrW,KAAK0J,EACtB,CAED,SAAS4M,EAAaF,GAElB7B,GADoBmB,EAAUU,IAAa,IAClB,SAAU1M,GAC/BA,GACZ,IACQuM,GACH,CAGD,SAASD,EAAQjQ,EAAKgQ,GAClB,IAAIN,EAAJ,CAEA,IAAIc,EAAe9D,IAAS,SAASrb,EAAKqC,GAKtC,GAJA+b,IACI9S,UAAUrJ,OAAS,IACnBI,EAASW,EAAMsI,UAAW,IAE1BtL,EAAK,CACL,IAAIof,EAAc,CAAA,EAClB3B,GAAWhB,GAAS,SAAS4C,EAAKC,GAC9BF,EAAYE,GAAQD,CACxC,IACgBD,EAAYzQ,GAAOtM,EACnBgc,GAAW,EACXC,EAAYnd,OAAO8E,OAAO,MAE1BpG,EAASG,EAAKof,EAC9B,MACgB3C,EAAQ9N,GAAOtM,EACf6c,EAAavQ,EAE7B,IAEQyP,IACA,IAAImB,EAAS3L,EAAU+K,EAAKA,EAAK1c,OAAS,IACtC0c,EAAK1c,OAAS,EACdsd,EAAO9C,EAAS0C,GAEhBI,EAAOJ,EA5BU,CA8BxB,CAED,SAASK,IAML,IAFA,IACI9C,EAAU,EACP8B,EAAavc,QAEhBya,IACAS,GAAUsC,EAFIjB,EAAa/L,QAEW,SAAUiN,GACD,KAArCjB,EAAsBiB,IACxBlB,EAAa5V,KAAK8W,EAEtC,IAGQ,GAAIhD,IAAYyB,EACZ,MAAM,IAAIpe,MACN,gEAGX,CAED,SAAS0f,EAAcT,GACnB,IAAI3c,EAAS,GAMb,OALAob,GAAWQ,GAAO,SAAUU,EAAMhQ,GAC1BzH,GAAQyX,IAASZ,GAAYY,EAAMK,EAAU,IAAM,GACnD3c,EAAOuG,KAAK+F,EAE5B,IACetM,CACV,CAvIDob,GAAWQ,GAAO,SAAUU,EAAMhQ,GAC9B,IAAKzH,GAAQyX,GAIT,OAFAD,EAAY/P,EAAK,CAACgQ,SAClBH,EAAa5V,KAAK+F,GAItB,IAAIgR,EAAehB,EAAK3b,MAAM,EAAG2b,EAAK1c,OAAS,GAC3C2d,EAAwBD,EAAa1d,OACzC,GAA8B,IAA1B2d,EAGA,OAFAlB,EAAY/P,EAAKgQ,QACjBH,EAAa5V,KAAK+F,GAGtB8P,EAAsB9P,GAAOiR,EAE7BzC,GAAUwC,GAAc,SAAUE,GAC9B,IAAK5B,EAAM4B,GACP,MAAM,IAAI9f,MAAM,oBAAsB4O,EAClC,oCACAkR,EAAiB,QACjBF,EAAa7U,KAAK,OAE1BiU,EAAYc,GAAgB,WAEM,KAD9BD,GAEIlB,EAAY/P,EAAKgQ,EAErC,GACA,GACA,IAEIa,IACAX,GAsGJ,EAWA,SAASiB,GAAS9Q,EAAOsH,GAKvB,IAJA,IAAIvK,GAAS,EACT9J,EAAkB,MAAT+M,EAAgB,EAAIA,EAAM/M,OACnCI,EAAS4E,MAAMhF,KAEV8J,EAAQ9J,GACfI,EAAO0J,GAASuK,EAAStH,EAAMjD,GAAQA,EAAOiD,GAEhD,OAAO3M,CACT,CAGA,IAAI0d,GAAY,kBAmBhB,SAASC,GAASrN,GAChB,MAAuB,iBAATA,GACX4D,EAAa5D,IAAU0C,EAAW1C,IAAUoN,EACjD,CAGA,IAAIE,GAAW,IAGXC,GAAc3L,EAAWA,EAASnT,eAAYsQ,EAC9CyO,GAAiBD,GAAcA,GAAYtd,cAAW8O,EAU1D,SAAS0O,GAAazN,GAEpB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAIzL,GAAQyL,GAEV,OAAOmN,GAASnN,EAAOyN,IAAgB,GAEzC,GAAIJ,GAASrN,GACX,OAAOwN,GAAiBA,GAAe7e,KAAKqR,GAAS,GAEvD,IAAItQ,EAAUsQ,EAAQ,GACtB,MAAkB,KAAVtQ,GAAkB,EAAIsQ,IAAWsN,GAAY,KAAO5d,CAC9D,CAWA,SAASge,GAAUrR,EAAOlN,EAAOwe,GAC/B,IAAIvU,GAAS,EACT9J,EAAS+M,EAAM/M,OAEfH,EAAQ,IACVA,GAASA,EAAQG,EAAS,EAAKA,EAASH,IAE1Cwe,EAAMA,EAAMre,EAASA,EAASqe,GACpB,IACRA,GAAOre,GAETA,EAASH,EAAQwe,EAAM,EAAMA,EAAMxe,IAAW,EAC9CA,KAAW,EAGX,IADA,IAAIO,EAAS4E,MAAMhF,KACV8J,EAAQ9J,GACfI,EAAO0J,GAASiD,EAAMjD,EAAQjK,GAEhC,OAAOO,CACT,CAWA,SAASke,GAAUvR,EAAOlN,EAAOwe,GAC/B,IAAIre,EAAS+M,EAAM/M,OAEnB,OADAqe,OAAc5O,IAAR4O,EAAoBre,EAASqe,GAC1Bxe,GAASwe,GAAOre,EAAU+M,EAAQqR,GAAUrR,EAAOlN,EAAOwe,EACrE,CAWA,SAASE,GAAcC,EAAYC,GAGjC,IAFA,IAAI3U,EAAQ0U,EAAWxe,OAEhB8J,KAAWgS,GAAY2C,EAAYD,EAAW1U,GAAQ,IAAM,IACnE,OAAOA,CACT,CAWA,SAAS4U,GAAgBF,EAAYC,GAInC,IAHA,IAAI3U,GAAS,EACT9J,EAASwe,EAAWxe,SAEf8J,EAAQ9J,GAAU8b,GAAY2C,EAAYD,EAAW1U,GAAQ,IAAM,IAC5E,OAAOA,CACT,CASA,SAAS6U,GAAaC,GACpB,OAAOA,EAAOC,MAAM,GACtB,CAGA,IAWIC,GAAeC,OAAO,uFAS1B,SAASC,GAAWJ,GAClB,OAAOE,GAAarhB,KAAKmhB,EAC3B,CAGA,IAAIK,GAAkB,kBAQlBC,GAAW,IAAMD,GAAkB,IACnCE,GAAU,kDACVC,GAAS,2BAETC,GAAc,KAAOJ,GAAkB,IACvCK,GAAa,kCACbC,GAAa,qCAIbC,GAPa,MAAQL,GAAU,IAAMC,GAO1BK,KACXC,GAAW,oBACXC,GAAY,gBAA0B,CAACN,GAAaC,GAAYC,IAAY1W,KAAK,KAAO,IAAM6W,GAAWF,GAAW,KACpHI,GAAQF,GAAWF,GAAWG,GAC9BE,GAAW,MAAQ,CAACR,GAAcF,GAAU,IAAKA,GAASG,GAAYC,GAAYL,IAAUrW,KAAK,KAAO,IAGxGiX,GAAYf,OAAOK,GAAS,MAAQA,GAAS,KAAOS,GAAWD,GAAO,KAS1E,SAASG,GAAenB,GACtB,OAAOA,EAAO1W,MAAM4X,KAAc,EACpC,CASA,SAASE,GAAcpB,GACrB,OAAOI,GAAWJ,GACdmB,GAAenB,GACfD,GAAaC,EACnB,CAuBA,SAASje,GAAS+P,GAChB,OAAgB,MAATA,EAAgB,GAAKyN,GAAazN,EAC3C,CAGA,IAAIuP,GAAS,aAwBb,SAASC,GAAKtB,EAAQuB,EAAOC,GAE3B,IADAxB,EAASje,GAASie,MACHwB,QAAmB3Q,IAAV0Q,GACtB,OAAOvB,EAAOnZ,QAAQwa,GAAQ,IAEhC,IAAKrB,KAAYuB,EAAQhC,GAAagC,IACpC,OAAOvB,EAET,IAAIJ,EAAawB,GAAcpB,GAC3BH,EAAauB,GAAcG,GAI/B,OAAO7B,GAAUE,EAHLE,GAAgBF,EAAYC,GAC9BF,GAAcC,EAAYC,GAAc,GAET5V,KAAK,GAChD,CAEA,IAAIwX,GAAU,qDACVC,GAAe,IACfC,GAAS,eACTC,GAAiB,mCAErB,SAASC,GAAYrP,GAOjB,OAHAA,GADAA,GADAA,GADAA,EAAOA,EAAKzQ,WAAW8E,QAAQ+a,GAAgB,KACnCtY,MAAMmY,IAAS,GAAG5a,QAAQ,IAAK,KAC7B2L,EAAKyN,MAAMyB,IAAgB,IAC7Bpb,KAAI,SAAUwT,GACtB,OAAOwH,GAAKxH,EAAIjT,QAAQ8a,GAAQ,IACxC,GAEA,CAoFA,SAASG,GAAW1E,EAAOpe,GACvB,IAAI+iB,EAAW,CAAA,EAEfnF,GAAWQ,GAAO,SAAUsB,EAAQ5Q,GAChC,IAAIkU,EACAC,EAAYpP,EAAQ6L,GACpBwD,GACED,GAA+B,IAAlBvD,EAAOtd,QACrB6gB,GAA+B,IAAlBvD,EAAOtd,OAEzB,GAAIiF,GAAQqY,GACRsD,EAAStD,EAAOvc,MAAM,GAAI,GAC1Buc,EAASA,EAAOA,EAAOtd,OAAS,GAEhC2gB,EAASjU,GAAOkU,EAAOvV,OAAOuV,EAAO5gB,OAAS,EAAI+gB,EAAUzD,QACzD,GAAIwD,EAEPH,EAASjU,GAAO4Q,MACb,CAEH,GADAsD,EAASH,GAAYnD,GACC,IAAlBA,EAAOtd,SAAiB6gB,GAA+B,IAAlBD,EAAO5gB,OAC5C,MAAM,IAAIlC,MAAM,0DAIf+iB,GAAWD,EAAOpQ,MAEvBmQ,EAASjU,GAAOkU,EAAOvV,OAAO0V,EACjC,CAED,SAASA,EAAQvG,EAASwG,GACtB,IAAIC,EAAUpD,GAAS+C,GAAQ,SAAUM,GACrC,OAAO1G,EAAQ0G,EAC/B,IACYD,EAAQta,KAAKqa,GACbrP,EAAU2L,GAAQ1W,MAAM,KAAMqa,EACjC,CACT,IAEIlF,GAAK4E,EAAU/iB,EACnB,CAMA,SAASujB,KACL5X,KAAK6X,KAAO7X,KAAK8X,KAAO,KACxB9X,KAAKvJ,OAAS,CAClB,CAEA,SAASshB,GAAWC,EAAKC,GACrBD,EAAIvhB,OAAS,EACbuhB,EAAIH,KAAOG,EAAIF,KAAOG,CAC1B,CA4EA,SAASC,GAAMC,EAAQzF,EAAa0F,GAChC,GAAmB,MAAf1F,EACAA,EAAc,OAEb,GAAmB,IAAhBA,EACJ,MAAM,IAAIne,MAAM,gCAGpB,IAAI8jB,EAAUjQ,EAAU+P,GACpBG,EAAa,EACbC,EAAc,GAEdC,GAAsB,EAC1B,SAASC,EAAQC,EAAMC,EAAetkB,GAClC,GAAgB,MAAZA,GAAwC,mBAAbA,EAC3B,MAAM,IAAIE,MAAM,oCAMpB,GAJAqkB,EAAEC,SAAU,EACPnd,GAAQgd,KACTA,EAAO,CAACA,IAEQ,IAAhBA,EAAKjiB,QAAgBmiB,EAAEE,OAEvB,OAAOnR,GAAe,WAClBiR,EAAEG,OAClB,IAGQ,IAAK,IAAI/b,EAAI,EAAGC,EAAIyb,EAAKjiB,OAAQuG,EAAIC,EAAGD,IAAK,CACzC,IAAIyB,EAAO,CACPia,KAAMA,EAAK1b,GACX3I,SAAUA,GAAYkW,GAGtBoO,EACAC,EAAEI,OAAOC,QAAQxa,GAEjBma,EAAEI,OAAO5b,KAAKqB,EAErB,CAEI+Z,IACDA,GAAsB,EACtB7Q,GAAe,WACX6Q,GAAsB,EACtBI,EAAE/kB,SAClB,IAEK,CAED,SAASqlB,EAAMzG,GACX,OAAO,SAASje,GACZ8jB,GAAc,EAEd,IAAK,IAAItb,EAAI,EAAGC,EAAIwV,EAAMhc,OAAQuG,EAAIC,EAAGD,IAAK,CAC1C,IAAImW,EAAOV,EAAMzV,GAEbuD,EAAQgS,GAAYgG,EAAapF,EAAM,GAC7B,IAAV5S,EACAgY,EAAY3W,QACLrB,EAAQ,GACfgY,EAAY9U,OAAOlD,EAAO,GAG9B4S,EAAK9e,SAASgJ,MAAM8V,EAAMrT,WAEf,MAAPtL,GACAokB,EAAE1jB,MAAMV,EAAK2e,EAAKuF,KAEzB,CAEGJ,GAAeM,EAAElG,YAAckG,EAAEO,QACjCP,EAAEQ,cAGFR,EAAEE,QACFF,EAAEG,QAENH,EAAE/kB,SACd,CACK,CAED,IAAIwlB,GAAe,EACfT,EAAI,CACJI,OAAQ,IAAIpB,GACZlF,YAAaA,EACb0F,QAASA,EACTkB,UAAW/O,EACX6O,YAAY7O,EACZ4O,OAAQzG,EAAc,EACtB6G,MAAOhP,EACPwO,MAAOxO,EACPrV,MAAOqV,EACPsO,SAAS,EACTxU,QAAQ,EACRjH,KAAM,SAAUsb,EAAMrkB,GAClBokB,EAAQC,GAAM,EAAOrkB,EACxB,EACDmlB,KAAM,WACFZ,EAAEG,MAAQxO,EACVqO,EAAEI,OAAOO,OACZ,EACDN,QAAS,SAAUP,EAAMrkB,GACrBokB,EAAQC,GAAM,EAAMrkB,EACvB,EACDolB,OAAQ,SAAUC,GACdd,EAAEI,OAAOS,OAAOC,EACnB,EACD7lB,QAAS,WAGL,IAAIwlB,EAAJ,CAIA,IADAA,GAAe,GACRT,EAAEvU,QAAUiU,EAAaM,EAAElG,aAAekG,EAAEI,OAAOviB,QAAO,CAC7D,IAAIgc,EAAQ,GAAIiG,EAAO,GACnBzb,EAAI2b,EAAEI,OAAOviB,OACbmiB,EAAER,UAASnb,EAAIyJ,KAAKiT,IAAI1c,EAAG2b,EAAER,UACjC,IAAK,IAAIpb,EAAI,EAAGA,EAAIC,EAAGD,IAAK,CACxB,IAAIib,EAAOW,EAAEI,OAAOpX,QACpB6Q,EAAMrV,KAAK6a,GACXM,EAAYnb,KAAK6a,GACjBS,EAAKtb,KAAK6a,EAAKS,KAClB,CAEDJ,GAAc,EAEU,IAApBM,EAAEI,OAAOviB,QACTmiB,EAAEW,QAGFjB,IAAeM,EAAElG,aACjBkG,EAAEU,YAGN,IAAIllB,EAAKyb,GAASqJ,EAAMzG,IACxB4F,EAAQK,EAAMtkB,EACjB,CACDilB,GAAe,CA1Bd,CA2BJ,EACD5iB,OAAQ,WACJ,OAAOmiB,EAAEI,OAAOviB,MACnB,EACDwZ,QAAS,WACL,OAAOqI,CACV,EACDC,YAAa,WACT,OAAOA,CACV,EACDO,KAAM,WACF,OAAOF,EAAEI,OAAOviB,OAAS6hB,IAAe,CAC3C,EACDhT,MAAO,WACHsT,EAAEvU,QAAS,CACd,EACDkB,OAAQ,YACa,IAAbqT,EAAEvU,SACNuU,EAAEvU,QAAS,EACXsD,EAAeiR,EAAE/kB,SACpB,GAEL,OAAO+kB,CACX,CA+EA,SAASgB,GAAMzB,EAAQC,GACnB,OAAOF,GAAMC,EAAQ,EAAGC,EAC5B,CA9TAR,GAAIhiB,UAAUikB,WAAa,SAAS5B,GAQhC,OAPIA,EAAK6B,KAAM7B,EAAK6B,KAAK3U,KAAO8S,EAAK9S,KAChCnF,KAAK6X,KAAOI,EAAK9S,KAClB8S,EAAK9S,KAAM8S,EAAK9S,KAAK2U,KAAO7B,EAAK6B,KAChC9Z,KAAK8X,KAAOG,EAAK6B,KAEtB7B,EAAK6B,KAAO7B,EAAK9S,KAAO,KACxBnF,KAAKvJ,QAAU,EACRwhB,CACX,EAEAL,GAAIhiB,UAAU2jB,MAAQ,WAClB,KAAMvZ,KAAK6X,MAAM7X,KAAK4B,QACtB,OAAO5B,IACX,EAEA4X,GAAIhiB,UAAUmkB,YAAc,SAAS9B,EAAM+B,GACvCA,EAAQF,KAAO7B,EACf+B,EAAQ7U,KAAO8S,EAAK9S,KAChB8S,EAAK9S,KAAM8S,EAAK9S,KAAK2U,KAAOE,EAC3Bha,KAAK8X,KAAOkC,EACjB/B,EAAK9S,KAAO6U,EACZha,KAAKvJ,QAAU,CACnB,EAEAmhB,GAAIhiB,UAAUqkB,aAAe,SAAShC,EAAM+B,GACxCA,EAAQF,KAAO7B,EAAK6B,KACpBE,EAAQ7U,KAAO8S,EACXA,EAAK6B,KAAM7B,EAAK6B,KAAK3U,KAAO6U,EAC3Bha,KAAK6X,KAAOmC,EACjB/B,EAAK6B,KAAOE,EACZha,KAAKvJ,QAAU,CACnB,EAEAmhB,GAAIhiB,UAAUqjB,QAAU,SAAShB,GACzBjY,KAAK6X,KAAM7X,KAAKia,aAAaja,KAAK6X,KAAMI,GACvCF,GAAW/X,KAAMiY,EAC1B,EAEAL,GAAIhiB,UAAUwH,KAAO,SAAS6a,GACtBjY,KAAK8X,KAAM9X,KAAK+Z,YAAY/Z,KAAK8X,KAAMG,GACtCF,GAAW/X,KAAMiY,EAC1B,EAEAL,GAAIhiB,UAAUgM,MAAQ,WAClB,OAAO5B,KAAK6X,MAAQ7X,KAAK6Z,WAAW7Z,KAAK6X,KAC7C,EAEAD,GAAIhiB,UAAUqR,IAAM,WAChB,OAAOjH,KAAK8X,MAAQ9X,KAAK6Z,WAAW7Z,KAAK8X,KAC7C,EAEAF,GAAIhiB,UAAUskB,QAAU,WAGpB,IAFA,IAAIlJ,EAAMvV,MAAMuE,KAAKvJ,QACjB0jB,EAAOna,KAAK6X,KACRhR,EAAM,EAAGA,EAAM7G,KAAKvJ,OAAQoQ,IAChCmK,EAAInK,GAAOsT,EAAKzB,KAChByB,EAAOA,EAAKhV,KAEhB,OAAO6L,CACX,EAEA4G,GAAIhiB,UAAU6jB,OAAS,SAAUC,GAE7B,IADA,IAAIS,EAAOna,KAAK6X,KACRsC,GAAM,CACV,IAAIhV,EAAOgV,EAAKhV,KACZuU,EAAOS,IACPna,KAAK6Z,WAAWM,GAEpBA,EAAOhV,CACV,CACD,OAAOnF,IACX,EAyQA,IAAIoa,GAAe7J,GAAQD,GAAa,GA0CxC,SAAS+J,GAAOzP,EAAM0P,EAAMxP,EAAUzW,GAClCA,EAAW+O,EAAK/O,GAAYkW,GAC5B,IAAI4G,EAAY/I,EAAU0C,GAC1BsP,GAAaxP,GAAM,SAAS2P,EAAGvd,EAAG3I,GAC9B8c,EAAUmJ,EAAMC,GAAG,SAAS/lB,EAAK6c,GAC7BiJ,EAAOjJ,EACPhd,EAASG,EACrB,GACK,IAAE,SAASA,GACRH,EAASG,EAAK8lB,EACtB,GACA,CAwCA,SAASE,KACL,IAAIC,EAAanG,GAASxU,UAAWsI,GACrC,OAAO,WACH,IAAI7E,EAAO/L,EAAMsI,WACb4I,EAAO1I,KAEP5L,EAAKmP,EAAKA,EAAK9M,OAAS,GACX,mBAANrC,EACPmP,EAAK0D,MAEL7S,EAAKmW,EAGT8P,GAAOI,EAAYlX,GAAM,SAASmX,EAAS5T,EAAI1S,GAC3C0S,EAAGzJ,MAAMqL,EAAMgS,EAAQ5Y,QAAO,SAAStN,GACnC,IAAImmB,EAAWnjB,EAAMsI,UAAW,GAChC1L,EAAGI,EAAKmmB,EACX,IACJ,IACD,SAASnmB,EAAKyc,GACV7c,EAAGiJ,MAAMqL,EAAM,CAAClU,GAAKsN,OAAOmP,GACxC,GACA,CACA,CAqCA,IAAI2J,GAAU,WACV,OAAOJ,GAAInd,MAAM,KAAM7F,EAAMsI,WAAW+a,UAC5C,EAEIC,GAAUrf,MAAM7F,UAAUkM,OAoB1BiZ,GAAc,SAASnQ,EAAMmF,EAAOjF,EAAUzW,GAC9CA,EAAWA,GAAYkW,EACvB,IAAI4G,EAAY/I,EAAU0C,GAC1B0G,GAAS5G,EAAMmF,GAAO,SAAS8D,EAAKxf,GAChC8c,EAAU0C,GAAK,SAASrf,GACpB,OAAIA,EAAYH,EAASG,GAClBH,EAAS,KAAMmD,EAAMsI,UAAW,GACnD,GACA,IAAO,SAAStL,EAAKwmB,GAEb,IADA,IAAInkB,EAAS,GACJmG,EAAI,EAAGA,EAAIge,EAAWvkB,OAAQuG,IAC/Bge,EAAWhe,KACXnG,EAASikB,GAAQzd,MAAMxG,EAAQmkB,EAAWhe,KAIlD,OAAO3I,EAASG,EAAKqC,EAC7B,GACA,EA2BIiL,GAASyO,GAAQwK,GAAa1f,KAoB9B4f,GAAe1K,GAAQwK,GAAa,GA4CpCG,GAAW,WACX,IAAIC,EAAS3jB,EAAMsI,WACfyD,EAAO,CAAC,MAAMzB,OAAOqZ,GACzB,OAAO,WAEH,OADerb,UAAUA,UAAUrJ,OAAS,GAC5B4G,MAAM2C,KAAMuD,EACpC,CACA,EAkBA,SAAS6X,GAASjU,GAChB,OAAOA,CACT,CAEA,SAASkU,GAAcC,EAAOC,GAC1B,OAAO,SAAShT,EAAQyI,EAAKlG,EAAU1W,GACnCA,EAAKA,GAAMmW,EACX,IACIiR,EADAC,GAAa,EAEjBlT,EAAOyI,GAAK,SAAS7J,EAAOiK,EAAG/c,GAC3ByW,EAAS3D,GAAO,SAAS3S,EAAKqC,GACtBrC,EACAH,EAASG,GACF8mB,EAAMzkB,KAAY2kB,GACzBC,GAAa,EACbD,EAAaD,GAAU,EAAMpU,GAC7B9S,EAAS,KAAMiW,IAEfjW,GAEpB,GACS,IAAE,SAASG,GACJA,EACAJ,EAAGI,GAEHJ,EAAG,KAAMqnB,EAAaD,EAAaD,GAAU,GAE7D,GACA,CACA,CAEA,SAASG,GAAerK,EAAGkJ,GACvB,OAAOA,CACX,CAqCA,IAAIoB,GAAS7K,GAAWuK,GAAcD,GAAUM,KAwB5CE,GAAcrK,GAAgB8J,GAAcD,GAAUM,KAsBtDG,GAAetL,GAAQqL,GAAa,GAExC,SAASE,GAAYnE,GACjB,OAAO,SAAU7Q,GACb,IAAIvD,EAAO/L,EAAMsI,UAAW,GAC5ByD,EAAKnG,MAAK,SAAU5I,GAChB,IAAI+O,EAAO/L,EAAMsI,UAAW,GACL,iBAAZ9K,UACHR,EACIQ,QAAQE,OACRF,QAAQE,MAAMV,GAEXQ,QAAQ2iB,IACfhG,GAAUpO,GAAM,SAAUgX,GACtBvlB,QAAQ2iB,GAAM4C,EACtC,IAGA,IACQnS,EAAUtB,GAAIzJ,MAAM,KAAMkG,EAClC,CACA,CA+BA,IAAIwY,GAAMD,GAAY,OAsBtB,SAASE,GAASlV,EAAI5S,EAAMG,GACxBA,EAAWwb,GAASxb,GAAYkW,GAChC,IAAI0R,EAAM7T,EAAUtB,GAChBoV,EAAQ9T,EAAUlU,GAEtB,SAASiR,EAAK3Q,GACV,GAAIA,EAAK,OAAOH,EAASG,GACzB,IAAI+O,EAAO/L,EAAMsI,UAAW,GAC5ByD,EAAKnG,KAAKke,GACVY,EAAM7e,MAAM2C,KAAMuD,EACrB,CAED,SAAS+X,EAAM9mB,EAAK2nB,GAChB,OAAI3nB,EAAYH,EAASG,GACpB2nB,OACLF,EAAI9W,GADe9Q,EAAS,KAE/B,CAEDinB,EAAM,MAAM,EAEhB,CAwBA,SAASc,GAAStR,EAAU5W,EAAMG,GAC9BA,EAAWwb,GAASxb,GAAYkW,GAChC,IAAI4G,EAAY/I,EAAU0C,GACtB3F,EAAO,SAAS3Q,GAChB,GAAIA,EAAK,OAAOH,EAASG,GACzB,IAAI+O,EAAO/L,EAAMsI,UAAW,GAC5B,GAAI5L,EAAKmJ,MAAM2C,KAAMuD,GAAO,OAAO4N,EAAUhM,GAC7C9Q,EAASgJ,MAAM,KAAM,CAAC,MAAMyE,OAAOyB,GAC3C,EACI4N,EAAUhM,EACd,CAsBA,SAASkX,GAAQvR,EAAU5W,EAAMG,GAC7B+nB,GAAStR,GAAU,WACf,OAAQ5W,EAAKmJ,MAAM2C,KAAMF,UAC5B,GAAEzL,EACP,CAsCA,SAASioB,GAAOpoB,EAAM4S,EAAIzS,GACtBA,EAAWwb,GAASxb,GAAYkW,GAChC,IAAI0R,EAAM7T,EAAUtB,GAChBoV,EAAQ9T,EAAUlU,GAEtB,SAASiR,EAAK3Q,GACV,GAAIA,EAAK,OAAOH,EAASG,GACzB0nB,EAAMZ,EACT,CAED,SAASA,EAAM9mB,EAAK2nB,GAChB,OAAI3nB,EAAYH,EAASG,GACpB2nB,OACLF,EAAI9W,GADe9Q,EAAS,KAE/B,CAED6nB,EAAMZ,EACV,CAEA,SAASiB,GAAczR,GACnB,OAAO,SAAU3D,EAAO5G,EAAOlM,GAC3B,OAAOyW,EAAS3D,EAAO9S,EAC/B,CACA,CA2DA,SAASmoB,GAAU5R,EAAME,EAAUzW,GAC/Bwc,GAAOjG,EAAM2R,GAAcnU,EAAU0C,IAAYzW,EACrD,CAsBA,SAASooB,GAAY7R,EAAMmF,EAAOjF,EAAUzW,GACxCyb,GAAaC,EAAbD,CAAoBlF,EAAM2R,GAAcnU,EAAU0C,IAAYzW,EAClE,CAqBA,IAAIqoB,GAAanM,GAAQkM,GAAa,GAqCtC,SAASE,GAAY7V,GACjB,OAAIoB,EAAQpB,GAAYA,EACjBE,GAAc,SAAUzD,EAAMlP,GACjC,IAAI+D,GAAO,EACXmL,EAAKnG,MAAK,WACN,IAAIwf,EAAY9c,UACZ1H,EACAuP,GAAe,WACXtT,EAASgJ,MAAM,KAAMuf,EACzC,IAEgBvoB,EAASgJ,MAAM,KAAMuf,EAErC,IACQ9V,EAAGzJ,MAAM2C,KAAMuD,GACfnL,GAAO,CACf,GACA,CAEA,SAASykB,GAAMxL,GACX,OAAQA,CACZ,CA8BA,IAAIyL,GAAQhM,GAAWuK,GAAcwB,GAAOA,KAsBxCE,GAAaxL,GAAgB8J,GAAcwB,GAAOA,KAqBlDG,GAAczM,GAAQwM,GAAY,GAStC,SAASE,GAAa9Z,GACpB,OAAO,SAASqM,GACd,OAAiB,MAAVA,OAAiBtJ,EAAYsJ,EAAOrM,EAC/C,CACA,CAEA,SAAS+Z,GAAY3U,EAAQyI,EAAKlG,EAAUzW,GACxC,IAAI8oB,EAAc,IAAI1hB,MAAMuV,EAAIva,QAChC8R,EAAOyI,GAAK,SAAUuJ,EAAGha,EAAOlM,GAC5ByW,EAASyP,GAAG,SAAU/lB,EAAK6c,GACvB8L,EAAY5c,KAAW8Q,EACvBhd,EAASG,EACrB,GACK,IAAE,SAAUA,GACT,GAAIA,EAAK,OAAOH,EAASG,GAEzB,IADA,IAAIyc,EAAU,GACLjU,EAAI,EAAGA,EAAIgU,EAAIva,OAAQuG,IACxBmgB,EAAYngB,IAAIiU,EAAQ7T,KAAK4T,EAAIhU,IAEzC3I,EAAS,KAAM4c,EACvB,GACA,CAEA,SAASmM,GAAc7U,EAAQqC,EAAME,EAAUzW,GAC3C,IAAI4c,EAAU,GACd1I,EAAOqC,GAAM,SAAU2P,EAAGha,EAAOlM,GAC7ByW,EAASyP,GAAG,SAAU/lB,EAAK6c,GACnB7c,EACAH,EAASG,IAEL6c,GACAJ,EAAQ7T,KAAK,CAACmD,MAAOA,EAAO4G,MAAOoT,IAEvClmB,IAEhB,GACK,IAAE,SAAUG,GACLA,EACAH,EAASG,GAETH,EAAS,KAAMigB,GAASrD,EAAQxT,MAAK,SAAUsB,EAAGC,GAC9C,OAAOD,EAAEwB,MAAQvB,EAAEuB,KACtB,IAAG0c,GAAa,UAE7B,GACA,CAEA,SAASI,GAAQ9U,EAAQqC,EAAME,EAAUzW,IACxBgW,EAAYO,GAAQsS,GAAcE,IACxC7U,EAAQqC,EAAMxC,EAAU0C,GAAWzW,GAAYkW,EAC1D,CA6BA,IAAI5M,GAASmT,GAAWuM,IAqBpBC,GAAc/L,GAAgB8L,IAmB9BE,GAAehN,GAAQ+M,GAAa,GA+BxC,SAASE,GAAQ1W,EAAI2W,GACjB,IAAInZ,EAAOuL,GAAS4N,GAAWlT,GAC3B4I,EAAO/K,EAAUuU,GAAY7V,IAEjC,SAAS3B,EAAK3Q,GACV,GAAIA,EAAK,OAAO8P,EAAK9P,GACrB2e,EAAKhO,EACR,CACDA,GACJ,CAqBA,IAAIuY,GAAe,SAAS9S,EAAMmF,EAAOjF,EAAUzW,GAC/CA,EAAWA,GAAYkW,EACvB,IAAI4G,EAAY/I,EAAU0C,GAC1B0G,GAAS5G,EAAMmF,GAAO,SAAS8D,EAAKxf,GAChC8c,EAAU0C,GAAK,SAASrf,EAAK2O,GACzB,OAAI3O,EAAYH,EAASG,GAClBH,EAAS,KAAM,CAAC8O,IAAKA,EAAK0Q,IAAKA,GAClD,GACA,IAAO,SAASrf,EAAKwmB,GAKb,IAJA,IAAInkB,EAAS,CAAA,EAEThB,EAAiBF,OAAOC,UAAUC,eAE7BmH,EAAI,EAAGA,EAAIge,EAAWvkB,OAAQuG,IACnC,GAAIge,EAAWhe,GAAI,CACf,IAAImG,EAAM6X,EAAWhe,GAAGmG,IACpB0Q,EAAMmH,EAAWhe,GAAG6W,IAEpBhe,EAAeC,KAAKe,EAAQsM,GAC5BtM,EAAOsM,GAAK/F,KAAKyW,GAEjBhd,EAAOsM,GAAO,CAAC0Q,EAEtB,CAGL,OAAOxf,EAASG,EAAKqC,EAC7B,GACA,EAsCI8mB,GAAUpN,GAAQmN,GAAcriB,KAqBhCuiB,GAAgBrN,GAAQmN,GAAc,GA6BtCG,GAAM/B,GAAY,OAuBtB,SAASgC,GAAelf,EAAKmR,EAAOjF,EAAUzW,GAC1CA,EAAW+O,EAAK/O,GAAYkW,GAC5B,IAAIwT,EAAS,CAAA,EACT5M,EAAY/I,EAAU0C,GAC1BwF,GAAY1R,EAAKmR,GAAO,SAAS8D,EAAK1Q,EAAKgC,GACvCgM,EAAU0C,EAAK1Q,GAAK,SAAU3O,EAAKqC,GAC/B,GAAIrC,EAAK,OAAO2Q,EAAK3Q,GACrBupB,EAAO5a,GAAOtM,EACdsO,GACZ,GACK,IAAE,SAAU3Q,GACTH,EAASG,EAAKupB,EACtB,GACA,CA+CA,IAAIC,GAAYzN,GAAQuN,GAAgBziB,KAqBpC4iB,GAAkB1N,GAAQuN,GAAgB,GAE9C,SAASI,GAAItf,EAAKuE,GACd,OAAOA,KAAOvE,CAClB,CAuCA,SAASuf,GAAQrX,EAAIsX,GACjB,IAAI9D,EAAO3kB,OAAO8E,OAAO,MACrB4jB,EAAS1oB,OAAO8E,OAAO,MAC3B2jB,EAASA,GAAUhD,GACnB,IAAIa,EAAM7T,EAAUtB,GAChBwX,EAAWtX,GAAc,SAAkBzD,EAAMlP,GACjD,IAAI8O,EAAMib,EAAO/gB,MAAM,KAAMkG,GACzB2a,GAAI5D,EAAMnX,GACVwE,GAAe,WACXtT,EAASgJ,MAAM,KAAMid,EAAKnX,GAC1C,IACmB+a,GAAIG,EAAQlb,GACnBkb,EAAOlb,GAAK/F,KAAK/I,IAEjBgqB,EAAOlb,GAAO,CAAC9O,GACf4nB,EAAI5e,MAAM,KAAMkG,EAAKzB,QAAO,WACxB,IAAIyB,EAAO/L,EAAMsI,WACjBwa,EAAKnX,GAAOI,EACZ,IAAIqV,EAAIyF,EAAOlb,UACRkb,EAAOlb,GACd,IAAK,IAAInG,EAAI,EAAGC,EAAI2b,EAAEniB,OAAQuG,EAAIC,EAAGD,IACjC4b,EAAE5b,GAAGK,MAAM,KAAMkG,EAExB,KAEb,IAGI,OAFA+a,EAAShE,KAAOA,EAChBgE,EAASC,WAAazX,EACfwX,CACX,CA2CA,IAAI7mB,GAAWgQ,EARXH,EACWzT,QAAQ4D,SACZ2P,EACIC,aAEAE,GAKf,SAASiX,GAAUjW,EAAQkK,EAAOpe,GAC9BA,EAAWA,GAAYkW,EACvB,IAAI0G,EAAU5G,EAAYoI,GAAS,GAAK,CAAA,EAExClK,EAAOkK,GAAO,SAAUU,EAAMhQ,EAAK9O,GAC/B+T,EAAU+K,EAAV/K,EAAgB,SAAU5T,EAAKqC,GACvBiJ,UAAUrJ,OAAS,IACnBI,EAASW,EAAMsI,UAAW,IAE9BmR,EAAQ9N,GAAOtM,EACfxC,EAASG,EACrB,GACK,IAAE,SAAUA,GACTH,EAASG,EAAKyc,EACtB,GACA,CAuEA,SAASwN,GAAchM,EAAOpe,GAC1BmqB,GAAU3N,GAAQ4B,EAAOpe,EAC7B,CAqBA,SAASqqB,GAAgBjM,EAAO1C,EAAO1b,GACnCmqB,GAAU1O,GAAaC,GAAQ0C,EAAOpe,EAC1C,CA2GA,IAAIsqB,GAAU,SAAUxG,EAAQzF,GAC5B,IAAI2F,EAAUjQ,EAAU+P,GACxB,OAAOD,IAAM,SAAU0G,EAAOxqB,GAC1BikB,EAAQuG,EAAM,GAAIxqB,EAC1B,GAAOse,EAAa,EACpB,EAyBImM,GAAgB,SAAS1G,EAAQzF,GAEjC,IAAIkG,EAAI+F,GAAQxG,EAAQzF,GA4CxB,OAzCAkG,EAAExb,KAAO,SAASsb,EAAMoG,EAAUzqB,GAE9B,GADgB,MAAZA,IAAkBA,EAAWkW,GACT,mBAAblW,EACP,MAAM,IAAIE,MAAM,oCAMpB,GAJAqkB,EAAEC,SAAU,EACPnd,GAAQgd,KACTA,EAAO,CAACA,IAEQ,IAAhBA,EAAKjiB,OAEL,OAAOkR,GAAe,WAClBiR,EAAEG,OAClB,IAGQ+F,EAAWA,GAAY,EAEvB,IADA,IAAIC,EAAWnG,EAAEI,OAAOnB,KACjBkH,GAAYD,GAAYC,EAASD,UACpCC,EAAWA,EAAS5Z,KAGxB,IAAK,IAAInI,EAAI,EAAGC,EAAIyb,EAAKjiB,OAAQuG,EAAIC,EAAGD,IAAK,CACzC,IAAIyB,EAAO,CACPia,KAAMA,EAAK1b,GACX8hB,SAAUA,EACVzqB,SAAUA,GAGV0qB,EACAnG,EAAEI,OAAOiB,aAAa8E,EAAUtgB,GAEhCma,EAAEI,OAAO5b,KAAKqB,EAErB,CACDkJ,EAAeiR,EAAE/kB,QACzB,SAGW+kB,EAAEK,QAEFL,CACX,EAsCA,SAASoG,GAAKvM,EAAOpe,GAEjB,GADAA,EAAW+O,EAAK/O,GAAYkW,IACvB7O,GAAQ+W,GAAQ,OAAOpe,EAAS,IAAI0L,UAAU,yDACnD,IAAK0S,EAAMhc,OAAQ,OAAOpC,IAC1B,IAAK,IAAI2I,EAAI,EAAGC,EAAIwV,EAAMhc,OAAQuG,EAAIC,EAAGD,IACrCoL,EAAUqK,EAAMzV,GAAhBoL,CAAoB/T,EAE5B,CAwBA,SAAS4qB,GAAazb,EAAO8W,EAAMxP,EAAUzW,GAEzCgmB,GADe7iB,EAAMgM,GAAOqX,UACXP,EAAMxP,EAAUzW,EACrC,CAyCA,SAAS6qB,GAAQpY,GACb,IAAImV,EAAM7T,EAAUtB,GACpB,OAAOE,GAAc,SAAmBzD,EAAM4b,GAe1C,OAdA5b,EAAKnG,MAAK,SAAkBlI,EAAOkqB,GAI3B,IAAIjY,EAHJjS,EACAiqB,EAAgB,KAAM,CAAEjqB,MAAOA,KAI3BiS,EADArH,UAAUrJ,QAAU,EACZ2oB,EAEA5nB,EAAMsI,UAAW,GAE7Bqf,EAAgB,KAAM,CAAEhY,MAAOA,IAE/C,IAEe8U,EAAI5e,MAAM2C,KAAMuD,EAC/B,GACA,CAqEA,SAAS8b,GAAW5M,GAChB,IAAIxB,EASJ,OARIvV,GAAQ+W,GACRxB,EAAUqD,GAAS7B,EAAOyM,KAE1BjO,EAAU,CAAA,EACVgB,GAAWQ,GAAO,SAASU,EAAMhQ,GAC7B8N,EAAQ9N,GAAO+b,GAAQppB,KAAKkK,KAAMmT,EAC9C,KAEWlC,CACX,CAEA,SAASqO,GAAS/W,EAAQyI,EAAKlG,EAAUzW,GACrCgpB,GAAQ9U,EAAQyI,GAAK,SAAS7J,EAAO/S,GACjC0W,EAAS3D,GAAO,SAAS3S,EAAK6c,GAC1Bjd,EAAGI,GAAM6c,EACrB,GACK,GAAEhd,EACP,CA6BA,IAAIkrB,GAASzO,GAAWwO,IAqBpBE,GAAcjO,GAAgB+N,IAmB9BG,GAAelP,GAAQiP,GAAa,GAqBxC,SAASE,GAAWvY,GAClB,OAAO,WACL,OAAOA,CACX,CACA,CAsFA,SAASwY,GAAMC,EAAMzM,EAAM9e,GACvB,IAAIwrB,EAAgB,EAChBC,EAAmB,EAEnB5lB,EAAU,CACV6lB,MAAOF,EACPG,aAAcN,GAAWI,IAG7B,SAASG,EAAWC,EAAKC,GACrB,GAAiB,iBAANA,EACPD,EAAIH,OAASI,EAAEJ,OAASF,EAExBK,EAAIF,aAAqC,mBAAfG,EAAEC,SACxBD,EAAEC,SACFV,IAAYS,EAAEC,UAAYN,GAE9BI,EAAIG,YAAcF,EAAEE,gBACjB,IAAiB,iBAANF,GAA+B,iBAANA,EAGvC,MAAM,IAAI5rB,MAAM,qCAFhB2rB,EAAIH,OAASI,GAAKN,CAGrB,CACJ,CAUD,GARI/f,UAAUrJ,OAAS,GAAqB,mBAATmpB,GAC/BvrB,EAAW8e,GAAQ5I,EACnB4I,EAAOyM,IAEPK,EAAW/lB,EAAS0lB,GACpBvrB,EAAWA,GAAYkW,GAGP,mBAAT4I,EACP,MAAM,IAAI5e,MAAM,qCAGpB,IAAI+rB,EAAQlY,EAAU+K,GAElBoN,EAAU,EACd,SAASC,IACLF,GAAM,SAAS9rB,GACPA,GAAO+rB,IAAYrmB,EAAQ6lB,QACI,mBAAvB7lB,EAAQmmB,aACZnmB,EAAQmmB,YAAY7rB,IACxBgT,WAAWgZ,EAActmB,EAAQ8lB,aAAaO,IAE9ClsB,EAASgJ,MAAM,KAAMyC,UAErC,GACK,CAED0gB,GACJ,CA8BA,IAAIC,GAAY,SAAUb,EAAMzM,GACvBA,IACDA,EAAOyM,EACPA,EAAO,MAEX,IAAIU,EAAQlY,EAAU+K,GACtB,OAAOnM,GAAc,SAAUzD,EAAMlP,GACjC,SAAS0f,EAAO3f,GACZksB,EAAMjjB,MAAM,KAAMkG,EAAKzB,OAAO1N,GACjC,CAEGwrB,EAAMD,GAAMC,EAAM7L,EAAQ1f,GACzBsrB,GAAM5L,EAAQ1f,EAE3B,GACA,EAkEA,SAASqsB,GAAOjO,EAAOpe,GACnBmqB,GAAUpE,GAAc3H,EAAOpe,EACnC,CAgCA,IAAImK,GAAOsS,GAAWuK,GAAc9hB,QAAS6hB,KAuBzCuF,GAAYpP,GAAgB8J,GAAc9hB,QAAS6hB,KAsBnDwF,GAAarQ,GAAQoQ,GAAW,GAiDpC,SAASE,GAAQjW,EAAME,EAAUzW,GAC7B,IAAI8c,EAAY/I,EAAU0C,GAW1B,SAASgW,EAAWC,EAAMC,GACtB,IAAIjiB,EAAIgiB,EAAKE,SAAUjiB,EAAIgiB,EAAMC,SACjC,OAAOliB,EAAIC,GAAK,EAAID,EAAIC,EAAI,EAAI,CACnC,CAbDrD,GAAIiP,GAAM,SAAU2P,EAAGlmB,GACnB8c,EAAUoJ,GAAG,SAAU/lB,EAAKysB,GACxB,GAAIzsB,EAAK,OAAOH,EAASG,GACzBH,EAAS,KAAM,CAAC8S,MAAOoT,EAAG0G,SAAUA,GAChD,GACA,IAAO,SAAUzsB,EAAKyc,GACd,GAAIzc,EAAK,OAAOH,EAASG,GACzBH,EAAS,KAAMigB,GAASrD,EAAQxT,KAAKqjB,GAAa7D,GAAa,UACvE,GAMA,CA2CA,SAASiE,GAAQ7Y,EAAS8Y,EAAcC,GACpC,IAAIta,EAAKsB,EAAUC,GAEnB,OAAOrB,GAAc,SAAUzD,EAAMlP,GACjC,IACIgtB,EADAC,GAAW,EAGf,SAASC,IACL,IAAI5J,EAAOtP,EAAQsP,MAAQ,YACvBziB,EAAS,IAAIX,MAAM,sBAAwBojB,EAAO,gBACtDziB,EAAM6D,KAAO,YACTqoB,IACAlsB,EAAMksB,KAAOA,GAEjBE,GAAW,EACXjtB,EAASa,EACZ,CAEDqO,EAAKnG,MAAK,WACDkkB,IACDjtB,EAASgJ,MAAM,KAAMyC,WACrB0hB,aAAaH,GAE7B,IAGQA,EAAQ7Z,WAAW+Z,EAAiBJ,GACpCra,EAAGzJ,MAAM,KAAMkG,EACvB,GACA,CAGA,IAAIke,GAAa/a,KAAKgb,KAClBC,GAAYjb,KAAKC,IAarB,SAASib,GAAUtrB,EAAOwe,EAAK+M,EAAMhQ,GAKnC,IAJA,IAAItR,GAAS,EACT9J,EAASkrB,GAAUF,IAAY3M,EAAMxe,IAAUurB,GAAQ,IAAK,GAC5DhrB,EAAS4E,MAAMhF,GAEZA,KACLI,EAAOgb,EAAYpb,IAAW8J,GAASjK,EACvCA,GAASurB,EAEX,OAAOhrB,CACT,CAkBA,SAASirB,GAAUC,EAAOhS,EAAOjF,EAAUzW,GACvC,IAAI8c,EAAY/I,EAAU0C,GAC1B0G,GAASoQ,GAAU,EAAGG,EAAO,GAAIhS,EAAOoB,EAAW9c,EACvD,CAkCA,IAAI0rB,GAAQxP,GAAQuR,GAAWzmB,KAgB3B2mB,GAAczR,GAAQuR,GAAW,GA4CrC,SAAS5S,GAAWtE,EAAMqX,EAAanX,EAAUzW,GACzCyL,UAAUrJ,QAAU,IACpBpC,EAAWyW,EACXA,EAAWmX,EACXA,EAAcvmB,GAAQkP,GAAQ,GAAK,CAAA,GAEvCvW,EAAW+O,EAAK/O,GAAYkW,GAC5B,IAAI4G,EAAY/I,EAAU0C,GAE1B+F,GAAOjG,GAAM,SAASyG,EAAG6Q,EAAG9tB,GACxB+c,EAAU8Q,EAAa5Q,EAAG6Q,EAAG9tB,EAChC,IAAE,SAASI,GACRH,EAASG,EAAKytB,EACtB,GACA,CAuCA,SAASE,GAAQ1P,EAAOpe,GACpB,IACIwC,EADA3B,EAAQ,KAEZb,EAAWA,GAAYkW,EACvBmS,GAAWjK,GAAO,SAASU,EAAM9e,GAC7B+T,EAAU+K,EAAV/K,EAAgB,SAAU5T,EAAK4tB,GAEvBvrB,EADAiJ,UAAUrJ,OAAS,EACVe,EAAMsI,UAAW,GAEjBsiB,EAEbltB,EAAQV,EACRH,GAAUG,EACtB,GACA,IAAO,WACCH,EAASa,EAAO2B,EACxB,GACA,CAeA,SAASwrB,GAAUvb,GACf,OAAO,WACH,OAAQA,EAAGyX,YAAczX,GAAIzJ,MAAM,KAAMyC,UACjD,CACA,CAoCA,SAASwiB,GAAOpuB,EAAM4W,EAAUzW,GAC5BA,EAAWwb,GAASxb,GAAYkW,GAChC,IAAI4G,EAAY/I,EAAU0C,GAC1B,IAAK5W,IAAQ,OAAOG,EAAS,MAC7B,IAAI8Q,EAAO,SAAS3Q,GAChB,GAAIA,EAAK,OAAOH,EAASG,GACzB,GAAIN,IAAQ,OAAOid,EAAUhM,GAC7B,IAAI5B,EAAO/L,EAAMsI,UAAW,GAC5BzL,EAASgJ,MAAM,KAAM,CAAC,MAAMyE,OAAOyB,GAC3C,EACI4N,EAAUhM,EACd,CAwBA,SAASod,GAAMruB,EAAM4W,EAAUzW,GAC3BiuB,IAAO,WACH,OAAQpuB,EAAKmJ,MAAM2C,KAAMF,UACjC,GAAOgL,EAAUzW,EACjB,CA2DA,IAAImuB,GAAY,SAAS/P,EAAOpe,GAE5B,GADAA,EAAW+O,EAAK/O,GAAYkW,IACvB7O,GAAQ+W,GAAQ,OAAOpe,EAAS,IAAIE,MAAM,8DAC/C,IAAKke,EAAMhc,OAAQ,OAAOpC,IAC1B,IAAIouB,EAAY,EAEhB,SAASC,EAASnf,GACd,IAAI4P,EAAO/K,EAAUqK,EAAMgQ,MAC3Blf,EAAKnG,KAAKyS,GAAS1K,IACnBgO,EAAK9V,MAAM,KAAMkG,EACpB,CAED,SAAS4B,EAAK3Q,GACV,GAAIA,GAAOiuB,IAAchQ,EAAMhc,OAC3B,OAAOpC,EAASgJ,MAAM,KAAMyC,WAEhC4iB,EAASlrB,EAAMsI,UAAW,GAC7B,CAED4iB,EAAS,GACb,EAmEIniB,GAAQ,CACRlD,MAAOA,EACPiU,UAAWA,GACXI,gBAAiBA,GACjB9J,SAAUA,EACV4K,KAAMA,GACN2E,WAAYA,GACZyC,MAAOA,GACPgB,QAASA,GACT9Y,OAAQA,GACRiZ,YAAaA,GACbE,aAAcA,GACdC,SAAUA,GACVS,OAAQA,GACRC,YAAaA,GACbC,aAAcA,GACdE,IAAKA,GACLC,SAAUA,GACVK,QAASA,GACTD,SAAUA,GACVE,OAAQA,GACRqG,KAAMnG,GACNA,UAAWC,GACX5L,OAAQA,GACRP,YAAaA,GACb8J,aAAcA,GACdsC,WAAYA,GACZC,YAAaA,GACbG,MAAOA,GACPC,WAAYA,GACZC,YAAaA,GACbrf,OAAQA,GACR2f,YAAaA,GACbC,aAAcA,GACdC,QAASA,GACTG,QAASA,GACTD,aAAcA,GACdE,cAAeA,GACfC,IAAKA,GACLliB,IAAKA,GACL6V,SAAUA,GACVC,UAAWA,GACXuM,UAAWA,GACXF,eAAgBA,GAChBG,gBAAiBA,GACjBE,QAASA,GACT1mB,SAAUA,GACVmrB,SAAUnE,GACVA,cAAeC,GACfG,cAAeA,GACf3G,MAAOyG,GACPK,KAAMA,GACN3E,OAAQA,GACR4E,YAAaA,GACbC,QAASA,GACTG,WAAYA,GACZE,OAAQA,GACRC,YAAaA,GACbC,aAAcA,GACdE,MAAOA,GACPc,UAAWA,GACXjG,IAAKA,GACLkG,OAAQA,GACRrZ,aAAcM,EACdnJ,KAAMA,GACNmiB,UAAWA,GACXC,WAAYA,GACZC,OAAQA,GACRK,QAASA,GACTnB,MAAOA,GACP8C,WAAYf,GACZE,YAAaA,GACb9S,UAAWA,GACXiT,QAASA,GACTE,UAAWA,GACXE,MAAOA,GACPC,UAAWA,GACXF,OAAQA,GAGRvlB,IAAK+f,GACLgG,SAAU/F,GACVgG,UAAW/F,GACXgG,IAAKxkB,GACLykB,SAAUtC,GACVuC,UAAWtC,GACXuC,KAAMxH,GACNyH,UAAWxH,GACXyH,WAAYxH,GACZve,QAASkf,GACT8G,cAAe5G,GACf6G,aAAc9G,GACd+G,UAAW3S,GACX4S,gBAAiBrJ,GACjBsJ,eAAgBpT,GAChBqT,OAAQtJ,GACRuJ,MAAOvJ,GACPwJ,MAAO5E,GACP6E,OAAQnmB,GACRomB,YAAazG,GACb0G,aAAczG,GACd0G,SAAUrc,GAGdrB,EAAiB,QAAIhG,GACrBgG,EAAQlJ,MAAQA,EAChBkJ,EAAQ+K,UAAYA,GACpB/K,EAAQmL,gBAAkBA,GAC1BnL,EAAQqB,SAAWA,EACnBrB,EAAQiM,KAAOA,GACfjM,EAAQ4Q,WAAaA,GACrB5Q,EAAQqT,MAAQA,GAChBrT,EAAQqU,QAAUA,GAClBrU,EAAQzE,OAASA,GACjByE,EAAQwU,YAAcA,GACtBxU,EAAQ0U,aAAeA,GACvB1U,EAAQ2U,SAAWA,GACnB3U,EAAQoV,OAASA,GACjBpV,EAAQqV,YAAcA,GACtBrV,EAAQsV,aAAeA,GACvBtV,EAAQwV,IAAMA,GACdxV,EAAQyV,SAAWA,GACnBzV,EAAQ8V,QAAUA,GAClB9V,EAAQ6V,SAAWA,GACnB7V,EAAQ+V,OAASA,GACjB/V,EAAQoc,KAAOnG,GACfjW,EAAQiW,UAAYC,GACpBlW,EAAQsK,OAASA,GACjBtK,EAAQ+J,YAAcA,GACtB/J,EAAQ6T,aAAeA,GACvB7T,EAAQmW,WAAaA,GACrBnW,EAAQoW,YAAcA,GACtBpW,EAAQuW,MAAQA,GAChBvW,EAAQwW,WAAaA,GACrBxW,EAAQyW,YAAcA,GACtBzW,EAAQ5I,OAASA,GACjB4I,EAAQ+W,YAAcA,GACtB/W,EAAQgX,aAAeA,GACvBhX,EAAQiX,QAAUA,GAClBjX,EAAQoX,QAAUA,GAClBpX,EAAQmX,aAAeA,GACvBnX,EAAQqX,cAAgBA,GACxBrX,EAAQsX,IAAMA,GACdtX,EAAQ5K,IAAMA,GACd4K,EAAQiL,SAAWA,GACnBjL,EAAQkL,UAAYA,GACpBlL,EAAQyX,UAAYA,GACpBzX,EAAQuX,eAAiBA,GACzBvX,EAAQ0X,gBAAkBA,GAC1B1X,EAAQ4X,QAAUA,GAClB5X,EAAQ9O,SAAWA,GACnB8O,EAAQqc,SAAWnE,GACnBlY,EAAQkY,cAAgBC,GACxBnY,EAAQsY,cAAgBA,GACxBtY,EAAQ2R,MAAQyG,GAChBpY,EAAQyY,KAAOA,GACfzY,EAAQ8T,OAASA,GACjB9T,EAAQ0Y,YAAcA,GACtB1Y,EAAQ2Y,QAAUA,GAClB3Y,EAAQ8Y,WAAaA,GACrB9Y,EAAQgZ,OAASA,GACjBhZ,EAAQiZ,YAAcA,GACtBjZ,EAAQkZ,aAAeA,GACvBlZ,EAAQoZ,MAAQA,GAChBpZ,EAAQka,UAAYA,GACpBla,EAAQiU,IAAMA,GACdjU,EAAQma,OAASA,GACjBna,EAAQc,aAAeM,EACvBpB,EAAQ/H,KAAOA,GACf+H,EAAQoa,UAAYA,GACpBpa,EAAQqa,WAAaA,GACrBra,EAAQsa,OAASA,GACjBta,EAAQ2a,QAAUA,GAClB3a,EAAQwZ,MAAQA,GAChBxZ,EAAQsc,WAAaf,GACrBvb,EAAQyb,YAAcA,GACtBzb,EAAQ2I,UAAYA,GACpB3I,EAAQ4b,QAAUA,GAClB5b,EAAQ8b,UAAYA,GACpB9b,EAAQgc,MAAQA,GAChBhc,EAAQic,UAAYA,GACpBjc,EAAQ+b,OAASA,GACjB/b,EAAQxJ,IAAM+f,GACdvW,EAAQuc,SAAW/F,GACnBxW,EAAQwc,UAAY/F,GACpBzW,EAAQyc,IAAMxkB,GACd+H,EAAQ0c,SAAWtC,GACnBpa,EAAQ2c,UAAYtC,GACpBra,EAAQ4c,KAAOxH,GACfpV,EAAQ6c,UAAYxH,GACpBrV,EAAQ8c,WAAaxH,GACrBtV,EAAQjJ,QAAUkf,GAClBjW,EAAQ+c,cAAgB5G,GACxBnW,EAAQgd,aAAe9G,GACvBlW,EAAQid,UAAY3S,GACpBtK,EAAQkd,gBAAkBrJ,GAC1B7T,EAAQmd,eAAiBpT,GACzB/J,EAAQod,OAAStJ,GACjB9T,EAAQqd,MAAQvJ,GAChB9T,EAAQsd,MAAQ5E,GAChB1Y,EAAQud,OAASnmB,GACjB4I,EAAQwd,YAAczG,GACtB/W,EAAQyd,aAAezG,GACvBhX,EAAQ0d,SAAWrc,EAEnBjS,OAAOuuB,eAAe3d,EAAS,aAAc,CAAEY,OAAO,GAErD,CA1+KgEgd,CAAQ5d,MCD3D6d,GAAG3kB,EAAiB,QAAC4kB,YCGnCC,GAAiB,CACfC,SAAUA,GACVC,SAAUA,IASZ,SAASC,GAAgBC,EAAUC,EAAQtwB,GACzCqwB,EAASC,GAAU,WAGjB,cAFOD,EAASC,GAChBtwB,EAASgJ,MAAM2C,KAAMF,WACdE,KAAK2kB,GAAQtnB,MAAM2C,KAAMF,UACpC,CACA,CAEA,SAASykB,GAASzd,EAAI5M,GACpB,KAAM8F,gBAAgBukB,IACpB,OAAO,IAAIA,GAASzd,EAAI5M,GAE1BmqB,GAAYvuB,KAAKkK,KAAM9F,GAEvBuqB,GAAgBzkB,KAAM,SAAS,WAC7B,IAAI4kB,EAAS9d,EAAGhR,KAAKkK,KAAM9F,GACvB+K,EAAOjF,KAAKiF,KAAKvN,KAAKsI,KAAM,SAChC4kB,EAAO3gB,GAAG,QAASgB,GACnB2f,EAAOC,KAAK7kB,KAChB,IAEEA,KAAKiF,KAAK,WACZ,CAEA,SAASuf,GAAS1d,EAAI5M,GACpB,KAAM8F,gBAAgBwkB,IACpB,OAAO,IAAIA,GAAS1d,EAAI5M,GAE1BmqB,GAAYvuB,KAAKkK,KAAM9F,GAEvBuqB,GAAgBzkB,KAAM,UAAU,WAC9B,IAAI8kB,EAAche,EAAGhR,KAAKkK,KAAM9F,GAC5B+K,EAAOjF,KAAKiF,KAAKvN,KAAKsI,KAAM,SAChC8kB,EAAY7gB,GAAG,QAASgB,GACxBjF,KAAK6kB,KAAKC,EACd,IAEE9kB,KAAKiF,KAAK,WACZ;;;;;;GA5CA8f,EAAAA,QAAKlgB,SAAS0f,GAAUF,IACxBU,EAAAA,QAAKlgB,SAAS2f,GAAUH,ICFxB,IAAAW,GAAiB,SAAS9rB,EAAM+rB,GAC9B,GAAoB,iBAAT/rB,EACT,MAAM,IAAI6G,UAAU,gCAGtB,GAAa,OAAT7G,GAA0B,MAATA,EAAc,MAAO,IAE1C,IAAIyI,EAAMzI,EAAKzC,OACf,GAAIkL,GAAO,EAAG,OAAOzI,EAKrB,IAAI0H,EAAS,GACb,GAAIe,EAAM,GAAiB,OAAZzI,EAAK,GAAa,CAC/B,IAAIgsB,EAAKhsB,EAAK,GACF,MAAPgsB,GAAqB,MAAPA,GAAoC,SAArBhsB,EAAK1B,MAAM,EAAG,KAC9C0B,EAAOA,EAAK1B,MAAM,GAClBoJ,EAAS,KAEZ,CAED,IAAIukB,EAAOjsB,EAAKoc,MAAM,UAItB,OAHsB,IAAlB2P,GAAqD,KAA1BE,EAAKA,EAAK1uB,OAAS,IAChD0uB,EAAKle,MAEArG,EAASukB,EAAK7lB,KAAK,IAC5B,ECxBI6K,GAAmB,iBAGnBa,GAAU,qBACVjB,GAAU,oBACVC,GAAS,6BAGT8B,GAAW,mBAYf,SAASzO,GAAMwK,EAAMud,EAAS7hB,GAC5B,OAAQA,EAAK9M,QACX,KAAK,EAAG,OAAOoR,EAAK/R,KAAKsvB,GACzB,KAAK,EAAG,OAAOvd,EAAK/R,KAAKsvB,EAAS7hB,EAAK,IACvC,KAAK,EAAG,OAAOsE,EAAK/R,KAAKsvB,EAAS7hB,EAAK,GAAIA,EAAK,IAChD,KAAK,EAAG,OAAOsE,EAAK/R,KAAKsvB,EAAS7hB,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAE3D,OAAOsE,EAAKxK,MAAM+nB,EAAS7hB,EAC7B,CAsBA,IAAIyF,GAAcrT,OAAOC,UAGrBC,GAAiBmT,GAAYnT,eAO7B4T,GAAiBT,GAAY5R,SAG7BgU,GAAuBpC,GAAYoC,qBAGnCuW,GAAYjb,KAAKC,IAUrB,SAAS0H,GAAclH,EAAOmH,GAG5B,IAAIzX,EAAU6E,GAAQyL,IAkSxB,SAAqBA,GAEnB,OAmFF,SAA2BA,GACzB,OAgHF,SAAsBA,GACpB,QAASA,GAAyB,iBAATA,CAC3B,CAlHS4D,CAAa5D,IAAUkD,GAAYlD,EAC5C,CArFSke,CAAkBle,IAAUtR,GAAeC,KAAKqR,EAAO,aAC1DiE,GAAqBtV,KAAKqR,EAAO,WAAasC,GAAe3T,KAAKqR,IAAU6D,GAClF,CAtSkCK,CAAYlE,GAxC9C,SAAmBlH,EAAG6K,GAIpB,IAHA,IAAIvK,GAAS,EACT1J,EAAS4E,MAAMwE,KAEVM,EAAQN,GACfpJ,EAAO0J,GAASuK,EAASvK,GAE3B,OAAO1J,CACT,CAiCMgU,CAAU1D,EAAM1Q,OAAQmY,QACxB,GAEAnY,EAASI,EAAOJ,OAChBkY,IAAgBlY,EAEpB,IAAK,IAAI0M,KAAOgE,GACTmH,IAAazY,GAAeC,KAAKqR,EAAOhE,IACvCwL,IAAuB,UAAPxL,GAAmB4I,GAAQ5I,EAAK1M,KACpDI,EAAOuG,KAAK+F,GAGhB,OAAOtM,CACT,CAYA,SAASyuB,GAAiBC,EAAUC,EAAUriB,EAAKqM,GACjD,YAAiBtJ,IAAbqf,GACC/f,GAAG+f,EAAUvc,GAAY7F,MAAUtN,GAAeC,KAAK0Z,EAAQrM,GAC3DqiB,EAEFD,CACT,CAYA,SAASE,GAAYjW,EAAQrM,EAAKgE,GAChC,IAAIoe,EAAW/V,EAAOrM,GAChBtN,GAAeC,KAAK0Z,EAAQrM,IAAQqC,GAAG+f,EAAUpe,UACxCjB,IAAViB,GAAyBhE,KAAOqM,KACnCA,EAAOrM,GAAOgE,EAElB,CASA,SAASue,GAAWlW,GAClB,IAAKtI,GAASsI,GACZ,OAqKJ,SAAsBA,GACpB,IAAI3Y,EAAS,GACb,GAAc,MAAV2Y,EACF,IAAK,IAAIrM,KAAOxN,OAAO6Z,GACrB3Y,EAAOuG,KAAK+F,GAGhB,OAAOtM,CACT,CA7KW8uB,CAAanW,GAEtB,IAmJmBrI,EACf4H,EACA6W,EArJAC,GAoJA9W,GADe5H,EAnJOqI,IAoJNrI,EAAM6H,YACtB4W,EAAwB,mBAAR7W,GAAsBA,EAAKnZ,WAAcoT,GAEtD7B,IAAUye,GAtJb/uB,EAAS,GAEb,IAAK,IAAIsM,KAAOqM,GACD,eAAPrM,IAAyB0iB,GAAYhwB,GAAeC,KAAK0Z,EAAQrM,KACrEtM,EAAOuG,KAAK+F,GAGhB,OAAOtM,CACT,CAUA,SAASivB,GAASje,EAAMvR,GAEtB,OADAA,EAAQqrB,QAAoBzb,IAAV5P,EAAuBuR,EAAKpR,OAAS,EAAKH,EAAO,GAC5D,WAML,IALA,IAAIiN,EAAOzD,UACPS,GAAS,EACT9J,EAASkrB,GAAUpe,EAAK9M,OAASH,EAAO,GACxCkN,EAAQ/H,MAAMhF,KAET8J,EAAQ9J,GACf+M,EAAMjD,GAASgD,EAAKjN,EAAQiK,GAE9BA,GAAS,EAET,IADA,IAAIwlB,EAAYtqB,MAAMnF,EAAQ,KACrBiK,EAAQjK,GACfyvB,EAAUxlB,GAASgD,EAAKhD,GAG1B,OADAwlB,EAAUzvB,GAASkN,EACZnG,GAAMwK,EAAM7H,KAAM+lB,EAC7B,CACA,CAuEA,SAASha,GAAQ5E,EAAO1Q,GAEtB,SADAA,EAAmB,MAAVA,EAAiB0T,GAAmB1T,KAE1B,iBAAT0Q,GAAqB2E,GAAS5X,KAAKiT,KAC1CA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,EAAQ1Q,CAC7C,CA2FA,SAAS+O,GAAG2B,EAAO6e,GACjB,OAAO7e,IAAU6e,GAAU7e,GAAUA,GAAS6e,GAAUA,CAC1D,CAiDA,IAAItqB,GAAUD,MAAMC,QA2BpB,SAAS2O,GAAYlD,GACnB,OAAgB,MAATA,GAkFT,SAAkBA,GAChB,MAAuB,iBAATA,GACZA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,GAASgD,EAC7C,CArF0BC,CAASjD,EAAM1Q,UAiDzC,SAAoB0Q,GAGlB,IAAIkC,EAAMnC,GAASC,GAASsC,GAAe3T,KAAKqR,GAAS,GACzD,OAAOkC,GAAOU,IAAWV,GAAOW,EAClC,CAtDqDE,CAAW/C,EAChE,CA+GA,SAASD,GAASC,GAChB,IAAIhB,SAAcgB,EAClB,QAASA,IAAkB,UAARhB,GAA4B,YAARA,EACzC,CA2DA,IA/XwB8f,GA+XpBC,IA/XoBD,GA+XU,SAASzW,EAAQoV,EAAQuB,EAAUC,IAxZrE,SAAoBxB,EAAQ7S,EAAOvC,EAAQ4W,GACzC5W,IAAWA,EAAS,CAAA,GAKpB,IAHA,IAAIjP,GAAS,EACT9J,EAASsb,EAAMtb,SAEV8J,EAAQ9J,GAAQ,CACvB,IAAI0M,EAAM4O,EAAMxR,GAEZ8lB,EAAWD,EACXA,EAAW5W,EAAOrM,GAAMyhB,EAAOzhB,GAAMA,EAAKqM,EAAQoV,QAClD1e,EAEJuf,GAAYjW,EAAQrM,OAAkB+C,IAAbmgB,EAAyBzB,EAAOzhB,GAAOkjB,EACjE,CAEH,CAyYEC,CAAW1B,EAoDb,SAAgBpV,GACd,OAAOnF,GAAYmF,GAAUnB,GAAcmB,GAAQ,GAAQkW,GAAWlW,EACxE,CAtDqB+W,CAAO3B,GAASpV,EAAQ4W,EAC7C,EAhYSN,IAAS,SAAStW,EAAQgX,GAC/B,IAAIjmB,GAAS,EACT9J,EAAS+vB,EAAQ/vB,OACjB2vB,EAAa3vB,EAAS,EAAI+vB,EAAQ/vB,EAAS,QAAKyP,EAChD2Q,EAAQpgB,EAAS,EAAI+vB,EAAQ,QAAKtgB,EAWtC,IATAkgB,EAAcH,GAASxvB,OAAS,GAA0B,mBAAd2vB,GACvC3vB,IAAU2vB,QACXlgB,EAEA2Q,GAwCR,SAAwB1P,EAAO5G,EAAOiP,GACpC,IAAKtI,GAASsI,GACZ,OAAO,EAET,IAAIrJ,SAAc5F,EAClB,SAAY,UAAR4F,EACKkE,GAAYmF,IAAWzD,GAAQxL,EAAOiP,EAAO/Y,QACrC,UAAR0P,GAAoB5F,KAASiP,IAE7BhK,GAAGgK,EAAOjP,GAAQ4G,EAG7B,CApDiBsf,CAAeD,EAAQ,GAAIA,EAAQ,GAAI3P,KAClDuP,EAAa3vB,EAAS,OAAIyP,EAAYkgB,EACtC3vB,EAAS,GAEX+Y,EAAS7Z,OAAO6Z,KACPjP,EAAQ9J,GAAQ,CACvB,IAAImuB,EAAS4B,EAAQjmB,GACjBqkB,GACFqB,GAASzW,EAAQoV,EAAQrkB,EAAO6lB,EAEnC,CACD,OAAO5W,CACX,KAiaA,IAAAkX,GAhCeZ,IAAS,SAASviB,GAE/B,OADAA,EAAKnG,UAAK8I,EAAWof,IACdjoB,GAAM6oB,QAAchgB,EAAW3C,EACxC,8CC3nBYgD,EAAUmF,EAAcnF,QAAGogB,EAAM,QAACpC,UAClBA,SAAGoC,EAAM,QAACpC,SAC1Bhe,EAAgBie,SAAGmC,EAAM,QAACnC,SAC1Bje,EAAcqgB,OAAGD,EAAM,QAACC,OACxBrgB,EAAiBsgB,UAAGF,EAAM,QAACE,UAC3BtgB,EAAmB8d,YAAGsC,EAAM,QAACtC,YAC7B9d,EAAAogB,OAAiBA,aCCzBxc,GAAmB,iBAGnBa,GAAU,qBACVjB,GAAU,oBACVC,GAAS,6BAGTrB,GAA8B,iBAAVC,EAAMtC,gBAAgBsC,EAAAA,gBAAUA,EAAAA,eAAOjT,SAAWA,QAAUiT,iBAGhFC,GAA0B,iBAAR7O,MAAoBA,MAAQA,KAAKrE,SAAWA,QAAUqE,KAGxEiC,GAAO0M,IAAcE,IAAYC,SAAS,cAATA,GAUrC,SAASge,GAAUtjB,EAAO2X,GAKxB,IAJA,IAAI5a,GAAS,EACT9J,EAAS0kB,EAAO1kB,OAChBswB,EAASvjB,EAAM/M,SAEV8J,EAAQ9J,GACf+M,EAAMujB,EAASxmB,GAAS4a,EAAO5a,GAEjC,OAAOiD,CACT,CAGA,IAAIwF,GAAcrT,OAAOC,UAGrBC,GAAiBmT,GAAYnT,eAO7B4T,GAAiBT,GAAY5R,SAG7B6Q,GAAShM,GAAKgM,OACdmD,GAAuBpC,GAAYoC,qBACnC4b,GAAmB/e,GAASA,GAAOgf,wBAAqB/gB,EAa5D,SAASghB,GAAY1jB,EAAO2jB,EAAOhV,EAAWiV,EAAUvwB,GACtD,IAAI0J,GAAS,EACT9J,EAAS+M,EAAM/M,OAKnB,IAHA0b,IAAcA,EAAYkV,IAC1BxwB,IAAWA,EAAS,MAEX0J,EAAQ9J,GAAQ,CACvB,IAAI0Q,EAAQ3D,EAAMjD,GACd4mB,EAAQ,GAAKhV,EAAUhL,GACrBggB,EAAQ,EAEVD,GAAY/f,EAAOggB,EAAQ,EAAGhV,EAAWiV,EAAUvwB,GAEnDiwB,GAAUjwB,EAAQsQ,GAEVigB,IACVvwB,EAAOA,EAAOJ,QAAU0Q,EAE3B,CACD,OAAOtQ,CACT,CASA,SAASwwB,GAAclgB,GACrB,OAAOzL,GAAQyL,IAyCjB,SAAqBA,GAEnB,OAmFF,SAA2BA,GACzB,OAgHF,SAAsBA,GACpB,QAASA,GAAyB,iBAATA,CAC3B,CAlHS4D,CAAa5D,IA9BtB,SAAqBA,GACnB,OAAgB,MAATA,GAkFT,SAAkBA,GAChB,MAAuB,iBAATA,GACZA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,GAASgD,EAC7C,CArF0BC,CAASjD,EAAM1Q,UAiDzC,SAAoB0Q,GAGlB,IAAIkC,EA4DN,SAAkBlC,GAChB,IAAIhB,SAAcgB,EAClB,QAASA,IAAkB,UAARhB,GAA4B,YAARA,EACzC,CA/DYe,CAASC,GAASsC,GAAe3T,KAAKqR,GAAS,GACzD,OAAOkC,GAAOU,IAAWV,GAAOW,EAClC,CAtDqDE,CAAW/C,EAChE,CA4BgCkD,CAAYlD,EAC5C,CArFSke,CAAkBle,IAAUtR,GAAeC,KAAKqR,EAAO,aAC1DiE,GAAqBtV,KAAKqR,EAAO,WAAasC,GAAe3T,KAAKqR,IAAU6D,GAClF,CA7C2BK,CAAYlE,OAChC6f,IAAoB7f,GAASA,EAAM6f,IAC1C,CAoEA,IAAItrB,GAAUD,MAAMC,QA6KpB,IAAA4rB,GAjOA,SAAiB9jB,GAEf,OADaA,EAAQA,EAAM/M,OAAS,GACpBywB,GAAY1jB,EAAO,GAAK,EAC1C,ECjHI+jB,GAAiB,4BAGjBpd,GAAmB,iBAGnBa,GAAU,qBAWVwc,GAAe,8BAGf7e,GAA8B,iBAAVC,EAAMtC,gBAAgBsC,EAAAA,gBAAUA,EAAAA,eAAOjT,SAAWA,QAAUiT,iBAGhFC,GAA0B,iBAAR7O,MAAoBA,MAAQA,KAAKrE,SAAWA,QAAUqE,KAGxEiC,GAAO0M,IAAcE,IAAYC,SAAS,cAATA,GA+BrC,SAAS2e,GAAcjkB,EAAO2D,GAE5B,SADa3D,EAAQA,EAAM/M,OAAS,IAgGtC,SAAqB+M,EAAO2D,EAAOiL,GACjC,GAAIjL,GAAUA,EACZ,OAvBJ,SAAuB3D,EAAO2O,EAAWC,EAAWP,GAClD,IAAIpb,EAAS+M,EAAM/M,OACf8J,EAAQ6R,GAAaP,EAAY,GAAK,GAE1C,KAAQA,EAAYtR,MAAYA,EAAQ9J,GACtC,GAAI0b,EAAU3O,EAAMjD,GAAQA,EAAOiD,GACjC,OAAOjD,EAGX,OAAQ,CACV,CAaW2R,CAAc1O,EAAO6O,GAAWD,GAEzC,IAAI7R,EAAQ6R,EAAY,EACpB3b,EAAS+M,EAAM/M,OAEnB,OAAS8J,EAAQ9J,GACf,GAAI+M,EAAMjD,KAAW4G,EACnB,OAAO5G,EAGX,OAAQ,CACV,CA5GqBgS,CAAY/O,EAAO2D,EAAO,IAAM,CACrD,CAWA,SAASugB,GAAkBlkB,EAAO2D,EAAO2Z,GAIvC,IAHA,IAAIvgB,GAAS,EACT9J,EAAS+M,EAAQA,EAAM/M,OAAS,IAE3B8J,EAAQ9J,GACf,GAAIqqB,EAAW3Z,EAAO3D,EAAMjD,IAC1B,OAAO,EAGX,OAAO,CACT,CA8BA,SAASumB,GAAUtjB,EAAO2X,GAKxB,IAJA,IAAI5a,GAAS,EACT9J,EAAS0kB,EAAO1kB,OAChBswB,EAASvjB,EAAM/M,SAEV8J,EAAQ9J,GACf+M,EAAMujB,EAASxmB,GAAS4a,EAAO5a,GAEjC,OAAOiD,CACT,CAwDA,SAAS6O,GAAUlL,GACjB,OAAOA,GAAUA,CACnB,CAuBA,SAASwgB,GAASlyB,EAAO0N,GACvB,OAAO1N,EAAMyoB,IAAI/a,EACnB,CAkCA,IASMykB,GATFC,GAAapsB,MAAM7F,UACnBkyB,GAAYhf,SAASlT,UACrBoT,GAAcrT,OAAOC,UAGrBmyB,GAAa9rB,GAAK,sBAGlB+rB,IACEJ,GAAM,SAASpxB,KAAKuxB,IAAcA,GAAW5qB,MAAQ4qB,GAAW5qB,KAAK8qB,UAAY,KACvE,iBAAmBL,GAAO,GAItCM,GAAeJ,GAAU1wB,SAGzBvB,GAAiBmT,GAAYnT,eAO7B4T,GAAiBT,GAAY5R,SAG7B+wB,GAAa3S,OAAO,IACtB0S,GAAapyB,KAAKD,IAAgBqG,QA3PjB,sBA2PuC,QACvDA,QAAQ,yDAA0D,SAAW,KAI5E+L,GAAShM,GAAKgM,OACdmD,GAAuBpC,GAAYoC,qBACnC3H,GAASokB,GAAWpkB,OACpBujB,GAAmB/e,GAASA,GAAOgf,wBAAqB/gB,EAGxDyb,GAAYjb,KAAKC,IAGjByhB,GAAMC,GAAUpsB,GAAM,OACtBqsB,GAAeD,GAAU1yB,OAAQ,UASrC,SAAS4yB,GAAKpnB,GACZ,IAAIZ,GAAS,EACT9J,EAAS0K,EAAUA,EAAQ1K,OAAS,EAGxC,IADAuJ,KAAKwoB,UACIjoB,EAAQ9J,GAAQ,CACvB,IAAIgyB,EAAQtnB,EAAQZ,GACpBP,KAAKE,IAAIuoB,EAAM,GAAIA,EAAM,GAC1B,CACH,CAyFA,SAASC,GAAUvnB,GACjB,IAAIZ,GAAS,EACT9J,EAAS0K,EAAUA,EAAQ1K,OAAS,EAGxC,IADAuJ,KAAKwoB,UACIjoB,EAAQ9J,GAAQ,CACvB,IAAIgyB,EAAQtnB,EAAQZ,GACpBP,KAAKE,IAAIuoB,EAAM,GAAIA,EAAM,GAC1B,CACH,CAuGA,SAASE,GAASxnB,GAChB,IAAIZ,GAAS,EACT9J,EAAS0K,EAAUA,EAAQ1K,OAAS,EAGxC,IADAuJ,KAAKwoB,UACIjoB,EAAQ9J,GAAQ,CACvB,IAAIgyB,EAAQtnB,EAAQZ,GACpBP,KAAKE,IAAIuoB,EAAM,GAAIA,EAAM,GAC1B,CACH,CAsFA,SAASG,GAASzN,GAChB,IAAI5a,GAAS,EACT9J,EAAS0kB,EAASA,EAAO1kB,OAAS,EAGtC,IADAuJ,KAAK6oB,SAAW,IAAIF,KACXpoB,EAAQ9J,GACfuJ,KAAK0E,IAAIyW,EAAO5a,GAEpB,CA0CA,SAASuoB,GAAatlB,EAAOL,GAE3B,IADA,IA+RUgE,EAAO6e,EA/RbvvB,EAAS+M,EAAM/M,OACZA,KACL,IA6RQ0Q,EA7RD3D,EAAM/M,GAAQ,OA6RNuvB,EA7RU7iB,IA8RAgE,GAAUA,GAAS6e,GAAUA,EA7RpD,OAAOvvB,EAGX,OAAQ,CACV,CAaA,SAASsyB,GAAevlB,EAAO2X,EAAQrQ,EAAUgW,GAC/C,IA/diBjZ,EA+dbtH,GAAS,EACTyoB,EAAWvB,GACXwB,GAAW,EACXxyB,EAAS+M,EAAM/M,OACfI,EAAS,GACTqyB,EAAe/N,EAAO1kB,OAE1B,IAAKA,EACH,OAAOI,EAELiU,IACFqQ,EAzkBJ,SAAkB3X,EAAOsH,GAKvB,IAJA,IAAIvK,GAAS,EACT9J,EAAS+M,EAAQA,EAAM/M,OAAS,EAChCI,EAAS4E,MAAMhF,KAEV8J,EAAQ9J,GACfI,EAAO0J,GAASuK,EAAStH,EAAMjD,GAAQA,EAAOiD,GAEhD,OAAO3M,CACT,CAgkBayd,CAAS6G,GA1eHtT,EA0eqBiD,EAze/B,SAAS3D,GACd,OAAOU,EAAKV,EAChB,KAyeM2Z,GACFkI,EAAWtB,GACXuB,GAAW,GAEJ9N,EAAO1kB,QA9qBK,MA+qBnBuyB,EAAWrB,GACXsB,GAAW,EACX9N,EAAS,IAAIyN,GAASzN,IAExBgO,EACA,OAAS5oB,EAAQ9J,GAAQ,CACvB,IAAI0Q,EAAQ3D,EAAMjD,GACd6oB,EAAWte,EAAWA,EAAS3D,GAASA,EAG5C,GADAA,EAAS2Z,GAAwB,IAAV3Z,EAAeA,EAAQ,EAC1C8hB,GAAYG,GAAaA,EAAU,CAErC,IADA,IAAIC,EAAcH,EACXG,KACL,GAAIlO,EAAOkO,KAAiBD,EAC1B,SAASD,EAGbtyB,EAAOuG,KAAK+J,EACb,MACS6hB,EAAS7N,EAAQiO,EAAUtI,IACnCjqB,EAAOuG,KAAK+J,EAEf,CACD,OAAOtQ,CACT,CAaA,SAASqwB,GAAY1jB,EAAO2jB,EAAOhV,EAAWiV,EAAUvwB,GACtD,IAAI0J,GAAS,EACT9J,EAAS+M,EAAM/M,OAKnB,IAHA0b,IAAcA,EAAYkV,IAC1BxwB,IAAWA,EAAS,MAEX0J,EAAQ9J,GAAQ,CACvB,IAAI0Q,EAAQ3D,EAAMjD,GACd4mB,EAAQ,GAAKhV,EAAUhL,GACrBggB,EAAQ,EAEVD,GAAY/f,EAAOggB,EAAQ,EAAGhV,EAAWiV,EAAUvwB,GAEnDiwB,GAAUjwB,EAAQsQ,GAEVigB,IACVvwB,EAAOA,EAAOJ,QAAU0Q,EAE3B,CACD,OAAOtQ,CACT,CAUA,SAASyyB,GAAaniB,GACpB,IAAKD,GAASC,KAiGEU,EAjGiBV,EAkGxB6gB,IAAeA,MAAcngB,GAjGpC,OAAO,EAgGX,IAAkBA,EA9FZ5N,EAAWiQ,GAAW/C,IAphB5B,SAAsBA,GAGpB,IAAItQ,GAAS,EACb,GAAa,MAATsQ,GAA0C,mBAAlBA,EAAM/P,SAChC,IACEP,KAAYsQ,EAAQ,GAC1B,CAAM,MAAOvJ,GAAK,CAEhB,OAAO/G,CACT,CA0gBsC0yB,CAAapiB,GAAUghB,GAAaX,GACxE,OAAOvtB,EAAQ/F,KAwGjB,SAAkB2T,GAChB,GAAY,MAARA,EAAc,CAChB,IACE,OAAOqgB,GAAapyB,KAAK+R,EAC/B,CAAM,MAAOjK,GAAK,CACd,IACE,OAAQiK,EAAO,EACrB,CAAM,MAAOjK,GAAK,CACf,CACD,MAAO,EACT,CAlHsB4rB,CAASriB,GAC/B,CAuCA,SAASsiB,GAAW9tB,EAAKwH,GACvB,IAsCiBgE,EACbhB,EAvCAuS,EAAO/c,EAAIktB,SACf,OAuCgB,WADZ1iB,SADagB,EArCAhE,KAuCmB,UAARgD,GAA4B,UAARA,GAA4B,WAARA,EACrD,cAAVgB,EACU,OAAVA,GAxCDuR,EAAmB,iBAAPvV,EAAkB,SAAW,QACzCuV,EAAK/c,GACX,CAUA,SAAS0sB,GAAU7Y,EAAQrM,GACzB,IAAIgE,EAxlBN,SAAkBqI,EAAQrM,GACxB,OAAiB,MAAVqM,OAAiBtJ,EAAYsJ,EAAOrM,EAC7C,CAslBcumB,CAASla,EAAQrM,GAC7B,OAAOmmB,GAAaniB,GAASA,OAAQjB,CACvC,CASA,SAASmhB,GAAclgB,GACrB,OAAOzL,GAAQyL,IAiIjB,SAAqBA,GAEnB,OAAOke,GAAkBle,IAAUtR,GAAeC,KAAKqR,EAAO,aAC1DiE,GAAqBtV,KAAKqR,EAAO,WAAasC,GAAe3T,KAAKqR,IAAU6D,GAClF,CArI2BK,CAAYlE,OAChC6f,IAAoB7f,GAASA,EAAM6f,IAC1C,CArcAuB,GAAK3yB,UAAU4yB,MAnEf,WACExoB,KAAK6oB,SAAWP,GAAeA,GAAa,MAAQ,CAAA,CACtD,EAkEAC,GAAK3yB,UAAkB,OAtDvB,SAAoBuN,GAClB,OAAOnD,KAAKke,IAAI/a,WAAenD,KAAK6oB,SAAS1lB,EAC/C,EAqDAolB,GAAK3yB,UAAU+zB,IA1Cf,SAAiBxmB,GACf,IAAIuV,EAAO1Y,KAAK6oB,SAChB,GAAIP,GAAc,CAChB,IAAIzxB,EAAS6hB,EAAKvV,GAClB,OAAOtM,IAAW0wB,QAAiBrhB,EAAYrP,CAChD,CACD,OAAOhB,GAAeC,KAAK4iB,EAAMvV,GAAOuV,EAAKvV,QAAO+C,CACtD,EAoCAqiB,GAAK3yB,UAAUsoB,IAzBf,SAAiB/a,GACf,IAAIuV,EAAO1Y,KAAK6oB,SAChB,OAAOP,QAA6BpiB,IAAdwS,EAAKvV,GAAqBtN,GAAeC,KAAK4iB,EAAMvV,EAC5E,EAuBAolB,GAAK3yB,UAAUsK,IAXf,SAAiBiD,EAAKgE,GAGpB,OAFWnH,KAAK6oB,SACX1lB,GAAQmlB,SAA0BpiB,IAAViB,EAAuBogB,GAAiBpgB,EAC9DnH,IACT,EAmHA0oB,GAAU9yB,UAAU4yB,MAjFpB,WACExoB,KAAK6oB,SAAW,EAClB,EAgFAH,GAAU9yB,UAAkB,OArE5B,SAAyBuN,GACvB,IAAIuV,EAAO1Y,KAAK6oB,SACZtoB,EAAQuoB,GAAapQ,EAAMvV,GAE/B,QAAI5C,EAAQ,KAIRA,GADYmY,EAAKjiB,OAAS,EAE5BiiB,EAAKzR,MAELxD,GAAO3N,KAAK4iB,EAAMnY,EAAO,IAEpB,EACT,EAwDAmoB,GAAU9yB,UAAU+zB,IA7CpB,SAAsBxmB,GACpB,IAAIuV,EAAO1Y,KAAK6oB,SACZtoB,EAAQuoB,GAAapQ,EAAMvV,GAE/B,OAAO5C,EAAQ,OAAI2F,EAAYwS,EAAKnY,GAAO,EAC7C,EAyCAmoB,GAAU9yB,UAAUsoB,IA9BpB,SAAsB/a,GACpB,OAAO2lB,GAAa9oB,KAAK6oB,SAAU1lB,IAAQ,CAC7C,EA6BAulB,GAAU9yB,UAAUsK,IAjBpB,SAAsBiD,EAAKgE,GACzB,IAAIuR,EAAO1Y,KAAK6oB,SACZtoB,EAAQuoB,GAAapQ,EAAMvV,GAO/B,OALI5C,EAAQ,EACVmY,EAAKtb,KAAK,CAAC+F,EAAKgE,IAEhBuR,EAAKnY,GAAO,GAAK4G,EAEZnH,IACT,EAiGA2oB,GAAS/yB,UAAU4yB,MA/DnB,WACExoB,KAAK6oB,SAAW,CACde,KAAQ,IAAIrB,GACZ5sB,IAAO,IAAKysB,IAAOM,IACnBrT,OAAU,IAAIkT,GAElB,EA0DAI,GAAS/yB,UAAkB,OA/C3B,SAAwBuN,GACtB,OAAOsmB,GAAWzpB,KAAMmD,GAAa,OAAEA,EACzC,EA8CAwlB,GAAS/yB,UAAU+zB,IAnCnB,SAAqBxmB,GACnB,OAAOsmB,GAAWzpB,KAAMmD,GAAKwmB,IAAIxmB,EACnC,EAkCAwlB,GAAS/yB,UAAUsoB,IAvBnB,SAAqB/a,GACnB,OAAOsmB,GAAWzpB,KAAMmD,GAAK+a,IAAI/a,EACnC,EAsBAwlB,GAAS/yB,UAAUsK,IAVnB,SAAqBiD,EAAKgE,GAExB,OADAsiB,GAAWzpB,KAAMmD,GAAKjD,IAAIiD,EAAKgE,GACxBnH,IACT,EAwDA4oB,GAAShzB,UAAU8O,IAAMkkB,GAAShzB,UAAUwH,KAnB5C,SAAqB+J,GAEnB,OADAnH,KAAK6oB,SAAS3oB,IAAIiH,EAAOogB,IAClBvnB,IACT,EAiBA4oB,GAAShzB,UAAUsoB,IANnB,SAAqB/W,GACnB,OAAOnH,KAAK6oB,SAAS3K,IAAI/W,EAC3B,EAwQA,IA9HkBU,GAAMvR,GA8HpBuzB,IA9HchiB,GA8HQ,SAASrE,EAAO2X,GACxC,OAAOkK,GAAkB7hB,GACrBulB,GAAevlB,EAAO0jB,GAAY/L,EAAQ,EAAGkK,IAAmB,IAChE,EACN,EAjIE/uB,GAAQqrB,QAAoBzb,IAAV5P,GAAuBuR,GAAKpR,OAAS,EAAKH,GAAO,GAC5D,WAML,IALA,IAAIiN,EAAOzD,UACPS,GAAS,EACT9J,EAASkrB,GAAUpe,EAAK9M,OAASH,GAAO,GACxCkN,EAAQ/H,MAAMhF,KAET8J,EAAQ9J,GACf+M,EAAMjD,GAASgD,EAAKjN,GAAQiK,GAE9BA,GAAS,EAET,IADA,IAAIwlB,EAAYtqB,MAAMnF,GAAQ,KACrBiK,EAAQjK,IACfyvB,EAAUxlB,GAASgD,EAAKhD,GAG1B,OADAwlB,EAAUzvB,IAASkN,EA1uBvB,SAAeqE,EAAMud,EAAS7hB,GAC5B,OAAQA,EAAK9M,QACX,KAAK,EAAG,OAAOoR,EAAK/R,KAAKsvB,GACzB,KAAK,EAAG,OAAOvd,EAAK/R,KAAKsvB,EAAS7hB,EAAK,IACvC,KAAK,EAAG,OAAOsE,EAAK/R,KAAKsvB,EAAS7hB,EAAK,GAAIA,EAAK,IAChD,KAAK,EAAG,OAAOsE,EAAK/R,KAAKsvB,EAAS7hB,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAE3D,OAAOsE,EAAKxK,MAAM+nB,EAAS7hB,EAC7B,CAmuBWlG,CAAMwK,GAAM7H,KAAM+lB,EAC7B,GAqMA,IAAIrqB,GAAUD,MAAMC,QA2BpB,SAAS2O,GAAYlD,GACnB,OAAgB,MAATA,GAkFT,SAAkBA,GAChB,MAAuB,iBAATA,GACZA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,GAASgD,EAC7C,CArF0BC,CAASjD,EAAM1Q,UAAYyT,GAAW/C,EAChE,CA2BA,SAASke,GAAkBle,GACzB,OAgHF,SAAsBA,GACpB,QAASA,GAAyB,iBAATA,CAC3B,CAlHS4D,CAAa5D,IAAUkD,GAAYlD,EAC5C,CAmBA,SAAS+C,GAAW/C,GAGlB,IAAIkC,EAAMnC,GAASC,GAASsC,GAAe3T,KAAKqR,GAAS,GACzD,MAjiCY,qBAiiCLkC,GAhiCI,8BAgiCcA,CAC3B,CA0DA,SAASnC,GAASC,GAChB,IAAIhB,SAAcgB,EAClB,QAASA,IAAkB,UAARhB,GAA4B,YAARA,EACzC,CA8BA,IAAA2jB,GAAiBD,GCpoCbtC,GAAiB,4BAIjBpd,GAAmB,iBAGnBa,GAAU,qBAWVwc,GAAe,8BAGf7e,GAA8B,iBAAVC,EAAMtC,gBAAgBsC,EAAAA,gBAAUA,EAAAA,eAAOjT,SAAWA,QAAUiT,iBAGhFC,GAA0B,iBAAR7O,MAAoBA,MAAQA,KAAKrE,SAAWA,QAAUqE,KAGxEiC,GAAO0M,IAAcE,IAAYC,SAAS,cAATA,GA+BrC,SAAS2e,GAAcjkB,EAAO2D,GAE5B,SADa3D,EAAQA,EAAM/M,OAAS,IA4EtC,SAAqB+M,EAAO2D,EAAOiL,GACjC,GAAIjL,GAAUA,EACZ,OAvBJ,SAAuB3D,EAAO2O,EAAWC,EAAWP,GAClD,IAAIpb,EAAS+M,EAAM/M,OACf8J,EAAQ6R,GAAaP,EAAY,GAAK,GAE1C,KAAQA,EAAYtR,MAAYA,EAAQ9J,GACtC,GAAI0b,EAAU3O,EAAMjD,GAAQA,EAAOiD,GACjC,OAAOjD,EAGX,OAAQ,CACV,CAaW2R,CAAc1O,EAAO6O,GAAWD,GAEzC,IAAI7R,EAAQ6R,EAAY,EACpB3b,EAAS+M,EAAM/M,OAEnB,OAAS8J,EAAQ9J,GACf,GAAI+M,EAAMjD,KAAW4G,EACnB,OAAO5G,EAGX,OAAQ,CACV,CAxFqBgS,CAAY/O,EAAO2D,EAAO,IAAM,CACrD,CAWA,SAASugB,GAAkBlkB,EAAO2D,EAAO2Z,GAIvC,IAHA,IAAIvgB,GAAS,EACT9J,EAAS+M,EAAQA,EAAM/M,OAAS,IAE3B8J,EAAQ9J,GACf,GAAIqqB,EAAW3Z,EAAO3D,EAAMjD,IAC1B,OAAO,EAGX,OAAO,CACT,CAUA,SAASumB,GAAUtjB,EAAO2X,GAKxB,IAJA,IAAI5a,GAAS,EACT9J,EAAS0kB,EAAO1kB,OAChBswB,EAASvjB,EAAM/M,SAEV8J,EAAQ9J,GACf+M,EAAMujB,EAASxmB,GAAS4a,EAAO5a,GAEjC,OAAOiD,CACT,CAwDA,SAAS6O,GAAUlL,GACjB,OAAOA,GAAUA,CACnB,CAUA,SAASwgB,GAASlyB,EAAO0N,GACvB,OAAO1N,EAAMyoB,IAAI/a,EACnB,CAwCA,SAAS4mB,GAAW7pB,GAClB,IAAIK,GAAS,EACT1J,EAAS4E,MAAMyE,EAAI8pB,MAKvB,OAHA9pB,EAAI5C,SAAQ,SAAS6J,GACnBtQ,IAAS0J,GAAS4G,CACtB,IACStQ,CACT,CAGA,IAAIgxB,GAAapsB,MAAM7F,UACnBkyB,GAAYhf,SAASlT,UACrBoT,GAAcrT,OAAOC,UAGrBmyB,GAAa9rB,GAAK,sBAGlB+rB,GAAc,WAChB,IAAIJ,EAAM,SAASpxB,KAAKuxB,IAAcA,GAAW5qB,MAAQ4qB,GAAW5qB,KAAK8qB,UAAY,IACrF,OAAOL,EAAO,iBAAmBA,EAAO,EAC1C,IAGIM,GAAeJ,GAAU1wB,SAGzBvB,GAAiBmT,GAAYnT,eAO7B4T,GAAiBT,GAAY5R,SAG7B+wB,GAAa3S,OAAO,IACtB0S,GAAapyB,KAAKD,IAAgBqG,QA3OjB,sBA2OuC,QACvDA,QAAQ,yDAA0D,SAAW,KAI5E+L,GAAShM,GAAKgM,OACdmD,GAAuBpC,GAAYoC,qBACnC3H,GAASokB,GAAWpkB,OACpBujB,GAAmB/e,GAASA,GAAOgf,wBAAqB/gB,EAGxDyb,GAAYjb,KAAKC,IAGjByhB,GAAMC,GAAUpsB,GAAM,OACtBguB,GAAM5B,GAAUpsB,GAAM,OACtBqsB,GAAeD,GAAU1yB,OAAQ,UASrC,SAAS4yB,GAAKpnB,GACZ,IAAIZ,GAAS,EACT9J,EAAS0K,EAAUA,EAAQ1K,OAAS,EAGxC,IADAuJ,KAAKwoB,UACIjoB,EAAQ9J,GAAQ,CACvB,IAAIgyB,EAAQtnB,EAAQZ,GACpBP,KAAKE,IAAIuoB,EAAM,GAAIA,EAAM,GAC1B,CACH,CAyFA,SAASC,GAAUvnB,GACjB,IAAIZ,GAAS,EACT9J,EAAS0K,EAAUA,EAAQ1K,OAAS,EAGxC,IADAuJ,KAAKwoB,UACIjoB,EAAQ9J,GAAQ,CACvB,IAAIgyB,EAAQtnB,EAAQZ,GACpBP,KAAKE,IAAIuoB,EAAM,GAAIA,EAAM,GAC1B,CACH,CAuGA,SAASE,GAASxnB,GAChB,IAAIZ,GAAS,EACT9J,EAAS0K,EAAUA,EAAQ1K,OAAS,EAGxC,IADAuJ,KAAKwoB,UACIjoB,EAAQ9J,GAAQ,CACvB,IAAIgyB,EAAQtnB,EAAQZ,GACpBP,KAAKE,IAAIuoB,EAAM,GAAIA,EAAM,GAC1B,CACH,CAsFA,SAASG,GAASzN,GAChB,IAAI5a,GAAS,EACT9J,EAAS0kB,EAASA,EAAO1kB,OAAS,EAGtC,IADAuJ,KAAK6oB,SAAW,IAAIF,KACXpoB,EAAQ9J,GACfuJ,KAAK0E,IAAIyW,EAAO5a,GAEpB,CA0CA,SAASuoB,GAAatlB,EAAOL,GAE3B,IADA,IAwSUgE,EAAO6e,EAxSbvvB,EAAS+M,EAAM/M,OACZA,KACL,IAsSQ0Q,EAtSD3D,EAAM/M,GAAQ,OAsSNuvB,EAtSU7iB,IAuSAgE,GAAUA,GAAS6e,GAAUA,EAtSpD,OAAOvvB,EAGX,OAAQ,CACV,CAaA,SAASywB,GAAY1jB,EAAO2jB,EAAOhV,EAAWiV,EAAUvwB,GACtD,IAAI0J,GAAS,EACT9J,EAAS+M,EAAM/M,OAKnB,IAHA0b,IAAcA,EAAYkV,IAC1BxwB,IAAWA,EAAS,MAEX0J,EAAQ9J,GAAQ,CACvB,IAAI0Q,EAAQ3D,EAAMjD,GACd4mB,EAAQ,GAAKhV,EAAUhL,GACrBggB,EAAQ,EAEVD,GAAY/f,EAAOggB,EAAQ,EAAGhV,EAAWiV,EAAUvwB,GAEnDiwB,GAAUjwB,EAAQsQ,GAEVigB,IACVvwB,EAAOA,EAAOJ,QAAU0Q,EAE3B,CACD,OAAOtQ,CACT,CAUA,SAASyyB,GAAaniB,GACpB,IAAKD,GAASC,IAyKhB,SAAkBU,GAChB,QAASmgB,IAAeA,MAAcngB,CACxC,CA3K0BqiB,CAAS/iB,GAC/B,OAAO,EAET,IAAIlN,EAAWiQ,GAAW/C,IA9e5B,SAAsBA,GAGpB,IAAItQ,GAAS,EACb,GAAa,MAATsQ,GAA0C,mBAAlBA,EAAM/P,SAChC,IACEP,KAAYsQ,EAAQ,GAC1B,CAAM,MAAOvJ,GAAK,CAEhB,OAAO/G,CACT,CAoesC0yB,CAAapiB,GAAUghB,GAAaX,GACxE,OAAOvtB,EAAQ/F,KAgLjB,SAAkB2T,GAChB,GAAY,MAARA,EAAc,CAChB,IACE,OAAOqgB,GAAapyB,KAAK+R,EAC/B,CAAM,MAAOjK,GAAK,CACd,IACE,OAAQiK,EAAO,EACrB,CAAM,MAAOjK,GAAK,CACf,CACD,MAAO,EACT,CA1LsB4rB,CAASriB,GAC/B,CAxUAohB,GAAK3yB,UAAU4yB,MAnEf,WACExoB,KAAK6oB,SAAWP,GAAeA,GAAa,MAAQ,CAAA,CACtD,EAkEAC,GAAK3yB,UAAkB,OAtDvB,SAAoBuN,GAClB,OAAOnD,KAAKke,IAAI/a,WAAenD,KAAK6oB,SAAS1lB,EAC/C,EAqDAolB,GAAK3yB,UAAU+zB,IA1Cf,SAAiBxmB,GACf,IAAIuV,EAAO1Y,KAAK6oB,SAChB,GAAIP,GAAc,CAChB,IAAIzxB,EAAS6hB,EAAKvV,GAClB,OAAOtM,IAAW0wB,QAAiBrhB,EAAYrP,CAChD,CACD,OAAOhB,GAAeC,KAAK4iB,EAAMvV,GAAOuV,EAAKvV,QAAO+C,CACtD,EAoCAqiB,GAAK3yB,UAAUsoB,IAzBf,SAAiB/a,GACf,IAAIuV,EAAO1Y,KAAK6oB,SAChB,OAAOP,QAA6BpiB,IAAdwS,EAAKvV,GAAqBtN,GAAeC,KAAK4iB,EAAMvV,EAC5E,EAuBAolB,GAAK3yB,UAAUsK,IAXf,SAAiBiD,EAAKgE,GAGpB,OAFWnH,KAAK6oB,SACX1lB,GAAQmlB,SAA0BpiB,IAAViB,EAAuBogB,GAAiBpgB,EAC9DnH,IACT,EAmHA0oB,GAAU9yB,UAAU4yB,MAjFpB,WACExoB,KAAK6oB,SAAW,EAClB,EAgFAH,GAAU9yB,UAAkB,OArE5B,SAAyBuN,GACvB,IAAIuV,EAAO1Y,KAAK6oB,SACZtoB,EAAQuoB,GAAapQ,EAAMvV,GAE/B,QAAI5C,EAAQ,KAIRA,GADYmY,EAAKjiB,OAAS,EAE5BiiB,EAAKzR,MAELxD,GAAO3N,KAAK4iB,EAAMnY,EAAO,IAEpB,EACT,EAwDAmoB,GAAU9yB,UAAU+zB,IA7CpB,SAAsBxmB,GACpB,IAAIuV,EAAO1Y,KAAK6oB,SACZtoB,EAAQuoB,GAAapQ,EAAMvV,GAE/B,OAAO5C,EAAQ,OAAI2F,EAAYwS,EAAKnY,GAAO,EAC7C,EAyCAmoB,GAAU9yB,UAAUsoB,IA9BpB,SAAsB/a,GACpB,OAAO2lB,GAAa9oB,KAAK6oB,SAAU1lB,IAAQ,CAC7C,EA6BAulB,GAAU9yB,UAAUsK,IAjBpB,SAAsBiD,EAAKgE,GACzB,IAAIuR,EAAO1Y,KAAK6oB,SACZtoB,EAAQuoB,GAAapQ,EAAMvV,GAO/B,OALI5C,EAAQ,EACVmY,EAAKtb,KAAK,CAAC+F,EAAKgE,IAEhBuR,EAAKnY,GAAO,GAAK4G,EAEZnH,IACT,EAiGA2oB,GAAS/yB,UAAU4yB,MA/DnB,WACExoB,KAAK6oB,SAAW,CACde,KAAQ,IAAIrB,GACZ5sB,IAAO,IAAKysB,IAAOM,IACnBrT,OAAU,IAAIkT,GAElB,EA0DAI,GAAS/yB,UAAkB,OA/C3B,SAAwBuN,GACtB,OAAOsmB,GAAWzpB,KAAMmD,GAAa,OAAEA,EACzC,EA8CAwlB,GAAS/yB,UAAU+zB,IAnCnB,SAAqBxmB,GACnB,OAAOsmB,GAAWzpB,KAAMmD,GAAKwmB,IAAIxmB,EACnC,EAkCAwlB,GAAS/yB,UAAUsoB,IAvBnB,SAAqB/a,GACnB,OAAOsmB,GAAWzpB,KAAMmD,GAAK+a,IAAI/a,EACnC,EAsBAwlB,GAAS/yB,UAAUsK,IAVnB,SAAqBiD,EAAKgE,GAExB,OADAsiB,GAAWzpB,KAAMmD,GAAKjD,IAAIiD,EAAKgE,GACxBnH,IACT,EAwDA4oB,GAAShzB,UAAU8O,IAAMkkB,GAAShzB,UAAUwH,KAnB5C,SAAqB+J,GAEnB,OADAnH,KAAK6oB,SAAS3oB,IAAIiH,EAAOogB,IAClBvnB,IACT,EAiBA4oB,GAAShzB,UAAUsoB,IANnB,SAAqB/W,GACnB,OAAOnH,KAAK6oB,SAAS3K,IAAI/W,EAC3B,EA2KA,IAAIgjB,GAAcF,IAAQ,EAAIF,GAAW,IAAIE,GAAI,CAAE,EAAC,KAAK,IAhxB1C,IAgxBoE,SAAS9O,GAC1F,OAAO,IAAI8O,GAAI9O,EACjB,EAsXA,WAEA,EA9WA,SAASsO,GAAW9tB,EAAKwH,GACvB,IAsCiBgE,EACbhB,EAvCAuS,EAAO/c,EAAIktB,SACf,OAuCgB,WADZ1iB,SADagB,EArCAhE,KAuCmB,UAARgD,GAA4B,UAARA,GAA4B,WAARA,EACrD,cAAVgB,EACU,OAAVA,GAxCDuR,EAAmB,iBAAPvV,EAAkB,SAAW,QACzCuV,EAAK/c,GACX,CAUA,SAAS0sB,GAAU7Y,EAAQrM,GACzB,IAAIgE,EA1nBN,SAAkBqI,EAAQrM,GACxB,OAAiB,MAAVqM,OAAiBtJ,EAAYsJ,EAAOrM,EAC7C,CAwnBcumB,CAASla,EAAQrM,GAC7B,OAAOmmB,GAAaniB,GAASA,OAAQjB,CACvC,CASA,SAASmhB,GAAclgB,GACrB,OAAOzL,GAAQyL,IA0HjB,SAAqBA,GAEnB,OAAOke,GAAkBle,IAAUtR,GAAeC,KAAKqR,EAAO,aAC1DiE,GAAqBtV,KAAKqR,EAAO,WAAasC,GAAe3T,KAAKqR,IAAU6D,GAClF,CA9H2BK,CAAYlE,OAChC6f,IAAoB7f,GAASA,EAAM6f,IAC1C,CA8DA,IAAIoD,GAjMJ,SAAkBviB,EAAMvR,GAEtB,OADAA,EAAQqrB,QAAoBzb,IAAV5P,EAAuBuR,EAAKpR,OAAS,EAAKH,EAAO,GAC5D,WAML,IALA,IAAIiN,EAAOzD,UACPS,GAAS,EACT9J,EAASkrB,GAAUpe,EAAK9M,OAASH,EAAO,GACxCkN,EAAQ/H,MAAMhF,KAET8J,EAAQ9J,GACf+M,EAAMjD,GAASgD,EAAKjN,EAAQiK,GAE9BA,GAAS,EAET,IADA,IAAIwlB,EAAYtqB,MAAMnF,EAAQ,KACrBiK,EAAQjK,GACfyvB,EAAUxlB,GAASgD,EAAKhD,GAG1B,OADAwlB,EAAUzvB,GAASkN,EAnqBvB,SAAeqE,EAAMud,EAAS7hB,GAC5B,OAAQA,EAAK9M,QACX,KAAK,EAAG,OAAOoR,EAAK/R,KAAKsvB,GACzB,KAAK,EAAG,OAAOvd,EAAK/R,KAAKsvB,EAAS7hB,EAAK,IACvC,KAAK,EAAG,OAAOsE,EAAK/R,KAAKsvB,EAAS7hB,EAAK,GAAIA,EAAK,IAChD,KAAK,EAAG,OAAOsE,EAAK/R,KAAKsvB,EAAS7hB,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAE3D,OAAOsE,EAAKxK,MAAM+nB,EAAS7hB,EAC7B,CA4pBWlG,CAAMwK,EAAM7H,KAAM+lB,EAC7B,CACA,CA8KYD,EAAS,SAASuE,GAC5B,OApKF,SAAkB7mB,EAAOsH,EAAUgW,GACjC,IAAIvgB,GAAS,EACTyoB,EAAWvB,GACXhxB,EAAS+M,EAAM/M,OACfwyB,GAAW,EACXpyB,EAAS,GACTyzB,EAAOzzB,EAEX,GAAIiqB,EACFmI,GAAW,EACXD,EAAWtB,QAER,GAAIjxB,GAvuBY,IAuuBgB,CACnC,IAAIyJ,EAAM4K,EAAW,KAAOqf,GAAU3mB,GACtC,GAAItD,EACF,OAAO6pB,GAAW7pB,GAEpB+oB,GAAW,EACXD,EAAWrB,GACX2C,EAAO,IAAI1B,EACZ,MAEC0B,EAAOxf,EAAW,GAAKjU,EAEzBsyB,EACA,OAAS5oB,EAAQ9J,GAAQ,CACvB,IAAI0Q,EAAQ3D,EAAMjD,GACd6oB,EAAWte,EAAWA,EAAS3D,GAASA,EAG5C,GADAA,EAAS2Z,GAAwB,IAAV3Z,EAAeA,EAAQ,EAC1C8hB,GAAYG,GAAaA,EAAU,CAErC,IADA,IAAImB,EAAYD,EAAK7zB,OACd8zB,KACL,GAAID,EAAKC,KAAenB,EACtB,SAASD,EAGTre,GACFwf,EAAKltB,KAAKgsB,GAEZvyB,EAAOuG,KAAK+J,EACb,MACS6hB,EAASsB,EAAMlB,EAAUtI,KAC7BwJ,IAASzzB,GACXyzB,EAAKltB,KAAKgsB,GAEZvyB,EAAOuG,KAAK+J,GAEf,CACD,OAAOtQ,CACT,CAkHS2zB,CAAStD,GAAYmD,EAAQ,EAAGhF,IAAmB,GAC5D,IAqFA,IAAI3pB,GAAUD,MAAMC,QA2BpB,SAAS2O,GAAYlD,GACnB,OAAgB,MAATA,GAkFT,SAAkBA,GAChB,MAAuB,iBAATA,GACZA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,GAASgD,EAC7C,CArF0BC,CAASjD,EAAM1Q,UAAYyT,GAAW/C,EAChE,CA2BA,SAASke,GAAkBle,GACzB,OAgHF,SAAsBA,GACpB,QAASA,GAAyB,iBAATA,CAC3B,CAlHS4D,CAAa5D,IAAUkD,GAAYlD,EAC5C,CAmBA,SAAS+C,GAAW/C,GAGlB,IAAIkC,EAAMnC,GAASC,GAASsC,GAAe3T,KAAKqR,GAAS,GACzD,MA3hCY,qBA2hCLkC,GA1hCI,8BA0hCcA,CAC3B,CA0DA,SAASnC,GAASC,GAChB,IAAIhB,SAAcgB,EAClB,QAASA,IAAkB,UAARhB,GAA4B,YAARA,EACzC,CA8CA,IAAAskB,GAAiBL,GC9mCjB,IAAItC,GAAYhf,SAASlT,UACrBoT,GAAcrT,OAAOC,UAGrBsyB,GAAeJ,GAAU1wB,SAGzBvB,GAAiBmT,GAAYnT,eAG7B60B,GAAmBxC,GAAapyB,KAAKH,QAOrC8T,GAAiBT,GAAY5R,SAG7BuzB,GA3BJ,SAAiB9iB,EAAMqH,GACrB,OAAO,SAASC,GACd,OAAOtH,EAAKqH,EAAUC,GAC1B,CACA,CAuBmBF,CAAQtZ,OAAOi1B,eAAgBj1B,QAwElD,IAAAk1B,GAdA,SAAuB1jB,GACrB,IAjCF,SAAsBA,GACpB,QAASA,GAAyB,iBAATA,CAC3B,CA+BO4D,CAAa5D,IAnHJ,mBAoHVsC,GAAe3T,KAAKqR,IA3G1B,SAAsBA,GAGpB,IAAItQ,GAAS,EACb,GAAa,MAATsQ,GAA0C,mBAAlBA,EAAM/P,SAChC,IACEP,KAAYsQ,EAAQ,GAC1B,CAAM,MAAOvJ,GAAK,CAEhB,OAAO/G,CACT,CAiGiD0yB,CAAapiB,GAC1D,OAAO,EAET,IAAIye,EAAQ+E,GAAaxjB,GACzB,GAAc,OAAVye,EACF,OAAO,EAET,IAAI7W,EAAOlZ,GAAeC,KAAK8vB,EAAO,gBAAkBA,EAAM5W,YAC9D,MAAuB,mBAARD,GACbA,aAAgBA,GAAQmZ,GAAapyB,KAAKiZ,IAAS2b,EACvD,yCCvHA,IAAII,EAAOpf,EAAcnF,QAAG,GAExBwkB,EAAkB,UA2BtBD,EAAKloB,OAAS,WACZ,IAAIooB,EAAW9xB,EAAAA,QAAKoG,KAAKjC,MAAMnE,EAAAA,QAAM4G,WACrC,OAAOpJ,EAAEu0B,WAACC,WAAWF,EACvB,EAGAF,EAAKK,OAAS,YAAY5nB,GAGxB,IAAIrJ,EAAUkxB,GAAc7nB,EAAK,IAAMA,EAAK3B,QAAU,GAGlDypB,EAAW5vB,MAAMC,QAAQ6H,EAAK,IAAMA,EAAK,GAAKA,EAElD,GAAwB,IAApB8nB,EAAS50B,OAAgB,MAAO,GAEpC,IAAIyG,EAvCgB,SAASmuB,EAAUvkB,GAEvC,IAAIjQ,EAAS,GAiBb,OAfAy0B,GAAQD,GAAU/tB,SAAQ,SAASrD,GAEjC,IAAIsxB,EAAqC,IAAzBtxB,EAAQG,QAAQ,KAE5BmxB,IAAatxB,EAAUA,EAAQzC,MAAM,IAEzC,IAAI0F,EAAU4J,EAAG7M,GAGfpD,EAFE00B,EAEO1B,GAAWhzB,EAAQqG,GAGnBktB,GAAMvzB,EAAQqG,EAE7B,IACSrG,CACT,CAmBgB20B,CAAgBH,GAAU,SAASpxB,GAE/C,OAAO2J,GAAKxL,KAAK6B,EAASC,EAC9B,IAkBE,OAhBIA,EAAQyD,SACVT,EAAUA,EAAQS,QAAO,SAASqtB,GAChCA,EAAW9xB,EAAI,QAACoG,KAAKpF,EAAQ6B,KAAO,GAAIivB,GACxC,IACE,MAA8B,mBAAnB9wB,EAAQyD,OACVzD,EAAQyD,OAAOqtB,GAGft0B,EAAAA,WAAGY,SAAS0zB,GAAU9wB,EAAQyD,SAExC,CAAC,MAAMC,GAEN,OAAO,CACR,CACP,KAESV,CACT,EAGA4tB,EAAKW,cAAgB,SAASJ,EAAUK,EAAUxxB,GAChDA,EAAUvE,OAAOg2B,OAAO,CACtBC,OAAQ,SAASF,EAAUG,GACzB,OAAO3yB,EAAI,QAACoG,KAAKosB,GAAY,GAAIG,EAClC,GACA3xB,GACH,IAAI4xB,EAAQ,GACRC,EAAa,CAAA,EAiCjB,OA/BAjB,EAAKK,OAAOjxB,EAASmxB,GAAU/tB,SAAQ,SAAS0uB,GAC9C,IAAIH,EAAWG,EAEX9xB,EAAQoxB,UACVO,EAAW3yB,EAAI,QAAC+yB,SAASJ,IAGvB3xB,EAAQgyB,MACVL,EAAWA,EAAS3vB,QAAQ,eAAgBhC,EAAQgyB,MAGtD,IAAIC,EAAOjyB,EAAQ0xB,OAAOF,EAAUG,EAAU3xB,GAE1CA,EAAQ6B,MAAOiwB,EAAM9yB,EAAAA,QAAKoG,KAAKpF,EAAQ6B,IAAKiwB,IAEhDG,EAAOA,EAAKjwB,QAAQ6uB,EAAiB,KACrCiB,EAAMA,EAAI9vB,QAAQ6uB,EAAiB,KAE/BgB,EAAWI,GAEbJ,EAAWI,GAAMH,IAAI5uB,KAAK4uB,IAG1BF,EAAM1uB,KAAK,CACT4uB,IAAK,CAACA,GACNG,KAAMA,IAGRJ,EAAWI,GAAQL,EAAMA,EAAMr1B,OAAS,GAE9C,IACSq1B,CACT,EAGAhB,EAAKsB,oBAAsB,SAAS1T,GAClC,IAAIoT,EAAQ,GASZ,OAPApT,EAAKpb,SAAQ,SAASsB,IAEhB,QAASA,GAAO,SAAUA,IAC5BktB,EAAM1uB,KAAKwB,EAEjB,IAEuB,IAAjBktB,EAAMr1B,OACD,GAGTq1B,EAAQ1a,EAAE0a,GAAOO,QAAQ/uB,SAAQ,SAASsB,GAClC,QAASA,GAASA,EAAIotB,MAExBvwB,MAAMC,QAAQkD,EAAIotB,KACpBptB,EAAIotB,IAAMV,GAAQ1sB,EAAIotB,KAEtBptB,EAAIotB,IAAM,CAACptB,EAAIotB,KAErB,IAAKrwB,KAAI,SAASiD,GAEd,IAAI0tB,EAAgB32B,OAAOg2B,OAAO,CAAE,EAAE/sB,GAKtC,UAJO0tB,EAAcN,WACdM,EAAcH,KAGjBvtB,EAAIusB,OACN,OAAOL,EAAKW,cAAc7sB,EAAIotB,IAAKptB,EAAIutB,KAAMG,GAAe3wB,KAAI,SAAS4wB,GAEvE,IAAI11B,EAASlB,OAAOg2B,OAAO,CAAE,EAAE/sB,GAU/B,OARA/H,EAAO21B,KAAO72B,OAAOg2B,OAAO,CAAE,EAAE/sB,GAEhC/H,EAAOm1B,IAAMO,EAAOP,IACpBn1B,EAAOs1B,KAAOI,EAAOJ,KAErB,CAAC,SAAU,MAAO,UAAW,SAAU,OAAO7uB,SAAQ,SAASmvB,UACtD51B,EAAO41B,EACxB,IACe51B,CACf,IAII,IAAIA,EAASlB,OAAOg2B,OAAO,CAAE,EAAE/sB,GA0B/B,OAxBA/H,EAAO21B,KAAO72B,OAAOg2B,OAAO,CAAE,EAAE/sB,GAE5B,QAAS/H,GAEXlB,OAAOuuB,eAAertB,EAAQ,MAAO,CACnC61B,YAAY,EACZ/C,IAAK,SAAS7iB,IACZ,IAAIklB,EAQJ,MAPM,WAAYllB,IAChBklB,EAAMptB,EAAIotB,IAEVA,EAAMvwB,MAAMC,QAAQswB,GAAOV,GAAQU,GAAO,CAACA,GAE3CllB,EAAGjQ,OAASi0B,EAAKK,OAAOmB,EAAeN,IAElCllB,EAAGjQ,MACX,IAID,SAAUA,IACZA,EAAOs1B,KAAOvtB,EAAIutB,MAGbt1B,CACX,IAAKy0B,UAAUnkB,OAGf,4CClMA,IAAIwf,EAASlnB,EAAiB,QAACknB,OAC3BtC,EAAcsI,GAA2BtI,YAEzCuI,EAAQlhB,EAAcnF,QAAG,GAC7BqmB,EAAM9B,KAAO+B,GAQbD,EAAME,cAAgB,SAASlI,EAAQvwB,GACrC,IAAI04B,EAAa,GACb/C,EAAO,EAEXpF,EAAO3gB,GAAG,QAAS5P,GAEnBuwB,EAAO3gB,GAAG,QAAQ,SAAS+oB,GACzBD,EAAW3vB,KAAK4vB,GAChBhD,GAAQgD,EAAMv2B,MAClB,IAEEmuB,EAAO3gB,GAAG,OAAO,WACf,IAAIgpB,EAAM,IAAIthB,OAAOqe,GACjBjD,EAAS,EAEbgG,EAAWzvB,SAAQ,SAASob,GAC1BA,EAAKwU,KAAKD,EAAKlG,GACfA,GAAUrO,EAAKjiB,MACrB,IAEIpC,EAAS,KAAM44B,EACnB,GACA,EAEAL,EAAMO,QAAU,SAASC,GAWvB,OAVAA,EAAUA,GAAW,IAAIC,gBAEFA,OAGrBD,EAD4B,iBAAZA,EACN,IAAIC,KAAKD,GAET,IAAIC,MAGTD,CACT,EAGAR,EAAMU,SAAW,SAAS9d,EAAQoV,EAAQ/N,GACxC,IAAItT,EAAOzD,UAGX,OAFAyD,EAAK,GAAKA,EAAK,IAAM,CAAA,EAEd+pB,MAAY/pB,EACrB,EAEAqpB,EAAMW,SAAW,SAAS3I,GACxB,OAAOA,aAAkB+B,CAC3B,EAEAiG,EAAMY,eAAiB,SAASxC,GAC9B,OAAO,IAAI1G,GAAWC,UAAS,WAC7B,OAAO7tB,EAAEu0B,WAACwC,iBAAiBzC,EAC/B,GACA,EAEA4B,EAAMc,qBAAuB,SAAS9I,GACpC,GAAe,OAAXA,EACF,OAAO,IAAIjZ,OAAO,GACb,GAAsB,iBAAXiZ,EAChB,OAAO,IAAIjZ,OAAOiZ,GACb,GAAIgI,EAAMW,SAAS3I,KAAYA,EAAO+I,eAAgB,CAC3D,IAAIC,EAAa,IAAIvJ,EAGrB,OAFAO,EAAOC,KAAK+I,GAELA,CACR,CAED,OAAOhJ,CACT,EAEAgI,EAAMiB,aAAe,SAAS7C,GAC5B,OAAOhG,GAAcgG,GAAU,GAAO9uB,QAAQ,QAAS,IAAIA,QAAQ,gBAAiB,GACtF,EAEA0wB,EAAMkB,gBAAkB,SAASC,GAC/B,MAAyB,MAAlBA,EAAIv2B,OAAO,GAAau2B,EAAM,IAAMA,CAC7C,EAEAnB,EAAMoB,YAAc,SAAShD,GAC3B,OAAOhG,GAAcgG,GAAU,GAAO9uB,QAAQ,QAAS,GACzD,EAEA0wB,EAAMqB,QAAU,SAASC,EAASj4B,EAAM5B,GACtC,IAAI4c,EAAU,GAEM,mBAAThb,IACT5B,EAAW4B,EACXA,EAAOi4B,GAGTx3B,EAAAA,WAAGoP,QAAQooB,GAAS,SAAS15B,EAAK25B,GAChC,IACIrD,EACAE,EAFAhuB,EAAI,EAIR,GAAIxI,EACF,OAAOH,EAASG,IAGlB,SAAU2Q,IAGR,KAFA2lB,EAAOqD,EAAKnxB,MAGV,OAAO3I,EAAS,KAAM4c,GAGxB+Z,EAAW9xB,EAAAA,QAAKoG,KAAK4uB,EAASpD,GAE9Bp0B,EAAAA,WAAGK,KAAKi0B,GAAU,SAASx2B,EAAK45B,GAC9Bnd,EAAQ7T,KAAK,CACXlE,KAAM8xB,EACNqD,SAAUn1B,EAAAA,QAAKm1B,SAASp4B,EAAM+0B,GAAU9uB,QAAQ,MAAO,KACvDkyB,MAAOA,IAGLA,GAASA,EAAMjsB,cACjByqB,EAAMqB,QAAQjD,EAAU/0B,GAAM,SAASzB,EAAK4tB,GAC1CA,EAAI9kB,SAAQ,SAASgxB,GACnBrd,EAAQ7T,KAAKkxB,EAC3B,IACYnpB,GACZ,IAEUA,GAEV,GACK,CA3BD,EA4BJ,GACA;;;;;;;;ACjJA,MAAMopB,EAAc,CAClBC,QAAW,sBACXC,yBAA4B,6DAC5BC,6BAAgC,0DAChCC,kBAAqB,8CACrBC,qBAAwB,0DACxBC,WAAc,6BACdC,YAAe,eACfC,YAAe,oDACfC,sBAAyB,sDACzBC,UAAa,6BACbC,yBAA4B,uDAC5BC,UAAa,qBACbC,oBAAuB,oDACvBC,wBAA2B,6DAC3BC,sBAAyB,2DACzBC,kBAAqB,uBAGvB,SAASC,EAAcz2B,EAAM2f,GAC3BnkB,MAAMk7B,kBAAkBzvB,KAAMA,KAAKgP,aAEnChP,KAAKvL,QAAU85B,EAAYx1B,IAASA,EACpCiH,KAAKjH,KAAOA,EACZiH,KAAK0Y,KAAOA,CACd,CAEAqM,EAAAA,QAAKlgB,SAAS2qB,EAAej7B,OAEnBmX,EAAcnF,QAAGipB,+CCpCfjpB,EAAUmF,EAAcnF,QAAGogB,EAAM,QAACpC,UAClBA,SAAGoC,EAAM,QAACpC,SAC1Bhe,EAAgBie,SAAGmC,EAAM,QAACnC,SAC1Bje,EAAcqgB,OAAGD,EAAM,QAACC,OACxBrgB,EAAiBsgB,UAAGF,EAAM,QAACE,UAC3BtgB,EAAmB8d,YAAGsC,EAAM,QAACtC,YAC7B9d,EAAAogB,OAAiBA,aCIzB9hB,GAAWpF,EAAe,QAACoF,SAE3BgiB,GAAY8F,GAA2B9F,UAEvCztB,GAA6B,UAArBvF,QAAQC,SAOhB47B,GAAW,SAASC,EAAQz1B,GAC9B,KAAM8F,gBAAgB0vB,IACpB,OAAO,IAAIA,GAASC,EAAQz1B,GAGR,iBAAXy1B,IACTz1B,EAAUy1B,EACVA,EAAS,OAGXz1B,EAAU8F,KAAK9F,QAAU6qB,GAAKuI,SAASpzB,EAAS,CAC9C01B,cAAe,QACfC,gBAAiB,IAGnBhJ,GAAU/wB,KAAKkK,KAAM9F,GAErB8F,KAAK8vB,SAAU,EACf9vB,KAAK+vB,SAAU,EACf/vB,KAAKgwB,SAAW,EAChBhwB,KAAKiwB,SAAW,EAEhBjwB,KAAKkwB,cAAgB,EACrBlwB,KAAKmwB,uBAAyB,EAC9BnwB,KAAKowB,qBAAuB,EAC5BpwB,KAAKqwB,yBAA2B,EAEhCrwB,KAAKswB,OAASC,GAAMrY,MAAMlY,KAAKwwB,aAAa94B,KAAKsI,MAAO,GACxDA,KAAKswB,OAAOvX,MAAQ/Y,KAAKywB,cAAc/4B,KAAKsI,MAE5CA,KAAK0wB,WAAaH,GAAMrY,MAAMlY,KAAK2wB,iBAAiBj5B,KAAKsI,MAAO9F,EAAQ21B,iBAExE7vB,KAAK4wB,OAAS,CACZ9rB,SAAS,EACT+rB,UAAU,EACVC,YAAY,EACZC,WAAW,EACXC,aAAa,GAGfhxB,KAAKixB,SAAW,EAClB,EAEApsB,GAAS6qB,GAAU7I,IAQnB6I,GAAS95B,UAAUs7B,OAAS,WAC1BlxB,KAAK4wB,OAAO9rB,SAAU,EACtB9E,KAAKswB,OAAO9W,OACZxZ,KAAK0wB,WAAWlX,OAEZxZ,KAAKswB,OAAOxX,QACd9Y,KAAKmxB,WAET,EAUAzB,GAAS95B,UAAUw7B,QAAU,SAASpG,EAAUtS,GAG9C,IAAIvF,EAAO,CACTyR,OAAQ,KACRoG,SAAUA,IAJZtS,EAAOA,GAAQ,IAOLf,OACRe,EAAKf,KAAOqT,GAGdtS,EAAK2Y,WAAarG,EAClB7X,EAAKuF,KAAOA,EACZ1Y,KAAKkwB,gBAEDxX,EAAK0V,OAAS1V,EAAK0V,iBAAiB13B,EAAAA,QAAG46B,OACzCne,EAAOnT,KAAKuxB,0BAA0Bpe,EAAMuF,EAAK0V,UAE3C1V,EAAK0V,MAAMpE,OACbhqB,KAAKowB,sBAAwB1X,EAAK0V,MAAMpE,MAG1ChqB,KAAKswB,OAAOlzB,KAAK+V,IAGnBnT,KAAK0wB,WAAWtzB,KAAK+V,EAEzB,EAQAuc,GAAS95B,UAAU47B,UAAY,WACzBxxB,KAAK4wB,OAAOE,YAAc9wB,KAAK4wB,OAAOG,WAAa/wB,KAAK4wB,OAAO9rB,UAInE9E,KAAK4wB,OAAOE,YAAa,EAEzB9wB,KAAKyxB,kBAELzxB,KAAK4wB,OAAOE,YAAa,EACzB9wB,KAAK4wB,OAAOG,WAAY,EAC1B,EAQArB,GAAS95B,UAAU87B,eAAiB,WAClC,QAAI1xB,KAAK4wB,OAAOE,YAAc9wB,KAAK4wB,OAAOG,WAAa/wB,KAAK4wB,OAAO9rB,cAI/D9E,KAAK4wB,OAAOC,UAA8B,IAAlB7wB,KAAKgwB,UAAkBhwB,KAAKswB,OAAOxX,QAAU9Y,KAAK0wB,WAAW5X,UACvF9Y,KAAKwxB,aACE,GAIX,EAYA9B,GAAS95B,UAAU+7B,cAAgB,SAAS/M,EAAQlM,EAAMrkB,GACpD2L,KAAK4wB,OAAO9rB,QACdzQ,IAIF2L,KAAK+vB,QAAQ6B,OAAOhN,EAAQlM,EAAM,SAASlkB,GAGzC,GAFAwL,KAAKsgB,MAAQ,KAETtgB,KAAK4wB,OAAO9rB,QACd9E,KAAKmxB,gBADP,CAKA,GAAI38B,EAGF,OAFAwL,KAAKiF,KAAK,QAASzQ,QACnB6S,aAAahT,GAUf2L,KAAKiF,KAAK,QAASyT,GACnB1Y,KAAKmwB,yBAEDzX,EAAK0V,OAAS1V,EAAK0V,MAAMpE,OAC3BhqB,KAAKqwB,0BAA4B3X,EAAK0V,MAAMpE,MAO9ChqB,KAAKiF,KAAK,WAAY,CACpB9D,QAAS,CACP0wB,MAAO7xB,KAAKkwB,cACZ4B,UAAW9xB,KAAKmwB,wBAElBz5B,GAAI,CACFq7B,WAAY/xB,KAAKowB,qBACjB4B,eAAgBhyB,KAAKqwB,4BAIzBhpB,aAAahT,EApCZ,CAqCL,EAAIqD,KAAKsI,MACT,EAQA0vB,GAAS95B,UAAU67B,gBAAkB,WACE,mBAA1BzxB,KAAK+vB,QAAQc,SACtB7wB,KAAK+vB,QAAQc,WACwB,mBAArB7wB,KAAK+vB,QAAQjb,IAC7B9U,KAAK+vB,QAAQjb,MAEb9U,KAAKiF,KAAK,QAAS,IAAIuqB,GAAc,eAEzC,EAQAE,GAAS95B,UAAUq8B,YAAc,WAC/BjyB,KAAK+vB,QAAQ9rB,GAAG,QAASjE,KAAKkyB,eAAex6B,KAAKsI,OAClDA,KAAK+vB,QAAQlL,KAAK7kB,MAClBA,KAAK4wB,OAAOI,aAAc,CAC5B,EASAtB,GAAS95B,UAAUu8B,gBAAkB,SAAShvB,GAC5C,SAAKnD,KAAK+vB,QAAQqC,WAAapyB,KAAK+vB,QAAQqC,SAASjvB,KAI9CnD,KAAK+vB,QAAQqC,SAASjvB,EAC/B,EAQAusB,GAAS95B,UAAUy8B,cAAgB,WACjCryB,KAAK+vB,QAAQuC,OAAOtyB,MACpBA,KAAK4wB,OAAOI,aAAc,CAC5B,EAUAtB,GAAS95B,UAAU28B,oBAAsB,SAAS7Z,EAAM0V,GACtD1V,EAAOqM,GAAKuI,SAAS5U,EAAM,CACzBvS,KAAM,OACNwR,KAAM,KACN6a,KAAM,KACNC,KAAM,KACN7xB,OAAQ,KACRywB,WAAY,KACZjD,OAAO,IAGLA,IAAwB,IAAf1V,EAAK0V,QAChB1V,EAAK0V,MAAQA,GAGf,IAAIjwB,EAAsB,cAAdua,EAAKvS,KA8CjB,OA5CIuS,EAAKf,OACoB,iBAAhBe,EAAK9X,QAAuB,KAAO8X,EAAK9X,SACjD8X,EAAKf,KAAOe,EAAK9X,OAAS,IAAM8X,EAAKf,KACrCe,EAAK9X,OAAS,MAGhB8X,EAAKf,KAAOoN,GAAK8I,aAAanV,EAAKf,MAEjB,YAAde,EAAKvS,MAA8C,MAAxBuS,EAAKf,KAAKngB,OAAO,IAC9C2G,GAAQ,EACRua,EAAKvS,KAAO,aACHhI,IACTua,EAAKf,MAAQ,MAKQ,iBAAde,EAAK+Z,KAEZ/Z,EAAK+Z,MADHr5B,GACW,IAEA,KAENsf,EAAK0V,OAAuB,OAAd1V,EAAK+Z,MAE1B/Z,EAAK+Z,KADHr5B,GAC4B,IAAlBsf,EAAK0V,MAAMqE,KAEO,KAAlB/Z,EAAK0V,MAAMqE,KAIrBr5B,IAAS+E,IACXua,EAAK+Z,KAAO,MAES,OAAd/Z,EAAK+Z,OACd/Z,EAAK+Z,KAAOt0B,EAAQ,IAAM,KAGxBua,EAAK0V,OAAuB,OAAd1V,EAAK8Z,KACrB9Z,EAAK8Z,KAAO9Z,EAAK0V,MAAMsE,MAEvBha,EAAK8Z,KAAOzN,GAAKoI,QAAQzU,EAAK8Z,MAGzB9Z,CACT,EASAgX,GAAS95B,UAAUs8B,eAAiB,SAAS19B,GAK3CwL,KAAKiF,KAAK,QAASzQ,EACrB,EASAk7B,GAAS95B,UAAU66B,cAAgB,WAC7BzwB,KAAK4wB,OAAOE,YAAc9wB,KAAK4wB,OAAOG,WAAa/wB,KAAK4wB,OAAO9rB,SAI/D9E,KAAK4wB,OAAOC,UAA8B,IAAlB7wB,KAAKgwB,UAAkBhwB,KAAKswB,OAAOxX,QAAU9Y,KAAK0wB,WAAW5X,QACvF9Y,KAAKwxB,WAET,EAUA9B,GAAS95B,UAAU46B,aAAe,SAASrd,EAAM9e,GAC3C2L,KAAK4wB,OAAOE,YAAc9wB,KAAK4wB,OAAOG,WAAa/wB,KAAK4wB,OAAO9rB,QACjEzQ,KAIF2L,KAAKsgB,MAAQnN,EACbnT,KAAK2xB,cAAcxe,EAAKyR,OAAQzR,EAAKuF,KAAMrkB,GAC7C,EAUAq7B,GAAS95B,UAAU+6B,iBAAmB,SAASxd,EAAM9e,GAC/C2L,KAAK4wB,OAAOE,YAAc9wB,KAAK4wB,OAAOG,WAAa/wB,KAAK4wB,OAAO9rB,QACjEzQ,IAIFqC,EAAE,QAACiB,MAAMwb,EAAK6X,SAAU,SAASx2B,EAAK45B,GACpC,GAAIpuB,KAAK4wB,OAAO9rB,QACduC,aAAahT,OADf,CAKA,GAAIG,EASF,OARAwL,KAAKkwB,gBAMLlwB,KAAKiF,KAAK,UAAWzQ,QACrB6S,aAAahT,IAIf8e,EAAOnT,KAAKuxB,0BAA0Bpe,EAAMib,MAGtCA,EAAMpE,OACRhqB,KAAKowB,sBAAwBhC,EAAMpE,MAGrChqB,KAAKswB,OAAOlzB,KAAK+V,IAGnB9L,aAAahT,EAxBZ,CAyBL,EAAIqD,KAAKsI,MACT,EAQA0vB,GAAS95B,UAAUu7B,UAAY,WAC7BnxB,KAAKqyB,gBACLryB,KAAK8U,KACP,EAWA4a,GAAS95B,UAAU+8B,WAAa,SAAS3F,EAAO4F,EAAUv+B,GACpD24B,IACFhtB,KAAKiwB,UAAYjD,EAAMv2B,QAGzBpC,EAAS,KAAM24B,EACjB,EAUA0C,GAAS95B,UAAU27B,0BAA4B,SAASpe,EAAMib,GAC5D,GAAIA,EAAMyE,SACR1f,EAAKuF,KAAKvS,KAAO,OACjBgN,EAAKuF,KAAKoa,WAAa,SACvB3f,EAAKyR,OAASG,GAAKyI,eAAera,EAAK6X,eAClC,GAAIoD,EAAMjsB,eAAiBnC,KAAKmyB,gBAAgB,aACrDhf,EAAKuF,KAAKf,KAAOoN,GAAK+I,gBAAgB3a,EAAKuF,KAAKf,MAChDxE,EAAKuF,KAAKvS,KAAO,YACjBgN,EAAKuF,KAAK2Y,WAAatM,GAAK+I,gBAAgB3a,EAAK6X,UACjD7X,EAAKuF,KAAKoa,WAAa,SACvB3f,EAAKyR,OAASjZ,OAAO7J,OAAO,QACvB,KAAIssB,EAAMp3B,mBAAoBgJ,KAAKmyB,gBAAgB,WAgBxD,OARI/D,EAAMjsB,cACRnC,KAAKiF,KAAK,UAAW,IAAIuqB,GAAc,wBAAyBrc,EAAKuF,OAC5D0V,EAAMp3B,iBACfgJ,KAAKiF,KAAK,UAAW,IAAIuqB,GAAc,sBAAuBrc,EAAKuF,OAEnE1Y,KAAKiF,KAAK,UAAW,IAAIuqB,GAAc,oBAAqBrc,EAAKuF,OAG5D,KAfP,IAAIqa,EAAWr8B,EAAE,QAACa,aAAa4b,EAAK6X,UAChCgI,EAAU95B,EAAI,QAAC+5B,QAAQ9f,EAAK6X,UAChC7X,EAAKuF,KAAKvS,KAAO,UACjBgN,EAAKuF,KAAKwa,SAAWh6B,EAAAA,QAAKm1B,SAAS2E,EAAS95B,EAAAA,QAAKxD,QAAQs9B,EAASD,IAClE5f,EAAKuF,KAAKoa,WAAa,SACvB3f,EAAKyR,OAASjZ,OAAO7J,OAAO,GAW7B,CAID,OAFAqR,EAAKuF,KAAO1Y,KAAKuyB,oBAAoBpf,EAAKuF,KAAM0V,GAEzCjb,CACT,EAcAuc,GAAS95B,UAAUyP,MAAQ,WACzB,OAAIrF,KAAK4wB,OAAO9rB,SAAW9E,KAAK4wB,OAAOG,WAIvC/wB,KAAKkxB,SAHIlxB,IAMX,EAaA0vB,GAAS95B,UAAUg8B,OAAS,SAAShN,EAAQlM,GAC3C,GAAI1Y,KAAK4wB,OAAOC,UAAY7wB,KAAK4wB,OAAO9rB,QAEtC,OADA9E,KAAKiF,KAAK,QAAS,IAAIuqB,GAAc,gBAC9BxvB,KAKT,GAAyB,iBAFzB0Y,EAAO1Y,KAAKuyB,oBAAoB7Z,IAEhBf,MAA0C,IAArBe,EAAKf,KAAKlhB,OAE7C,OADAuJ,KAAKiF,KAAK,QAAS,IAAIuqB,GAAc,sBAC9BxvB,KAGT,GAAkB,cAAd0Y,EAAKvS,OAAyBnG,KAAKmyB,gBAAgB,aAErD,OADAnyB,KAAKiF,KAAK,QAAS,IAAIuqB,GAAc,wBAAyB,CAAE7X,KAAMe,EAAKf,QACpE3X,KAKT,GAFA4kB,EAASG,GAAK2I,qBAAqB9I,GAE/BjZ,OAAOC,SAASgZ,GAClBlM,EAAKoa,WAAa,aACb,KAAI/N,GAAKwI,SAAS3I,GAIvB,OADA5kB,KAAKiF,KAAK,QAAS,IAAIuqB,GAAc,2BAA4B,CAAE7X,KAAMe,EAAKf,QACvE3X,KAHP0Y,EAAKoa,WAAa,QAInB,CAQD,OANA9yB,KAAKkwB,gBACLlwB,KAAKswB,OAAOlzB,KAAK,CACfsb,KAAMA,EACNkM,OAAQA,IAGH5kB,IACT,EAWA0vB,GAAS95B,UAAUu9B,UAAY,SAASjF,EAASkF,EAAU1a,GACzD,GAAI1Y,KAAK4wB,OAAOC,UAAY7wB,KAAK4wB,OAAO9rB,QAEtC,OADA9E,KAAKiF,KAAK,QAAS,IAAIuqB,GAAc,gBAC9BxvB,KAGT,GAAuB,iBAAZkuB,GAA2C,IAAnBA,EAAQz3B,OAEzC,OADAuJ,KAAKiF,KAAK,QAAS,IAAIuqB,GAAc,6BAC9BxvB,KAGTA,KAAKgwB,YAEY,IAAboD,EACFA,EAAW,GACkB,iBAAbA,IAChBA,EAAWlF,GAGb,IAAImF,GAAe,EACC,mBAAT3a,GACT2a,EAAe3a,EACfA,EAAO,CAAA,GACkB,iBAATA,IAChBA,EAAO,CAAA,GA+CT,IAAI4a,EAAU1vB,GAAK,KA5CD,CAChB7M,MAAM,EACN4D,KAAK,EACLoB,IAAKmyB,IA8CP,OAJAoF,EAAQrvB,GAAG,QAlCX,SAAqBzP,GACnBwL,KAAKiF,KAAK,QAASzQ,EACpB,EAgC+BkD,KAAKsI,OACrCszB,EAAQrvB,GAAG,QA/BX,SAAqBtF,GACnB,IAAI40B,GAAc,EACdC,EAAY79B,OAAOg2B,OAAO,CAAE,EAAEjT,GAClC8a,EAAU7b,KAAOhZ,EACjB60B,EAAU5yB,OAASwyB,EACnBz0B,EAAQ20B,EAAQ9yB,SAAS7B,GAEzB,IACE,GAAI00B,EAGF,IAAkB,KAFlBG,EAAYH,EAAaG,IAGvBD,GAAc,OACT,GAAyB,iBAAdC,EAChB,MAAM,IAAIhE,GAAc,+BAAgC,CAAEtB,QAASA,GAGxE,CAAC,MAAMtwB,GAEN,YADAoC,KAAKiF,KAAK,QAASrH,EAEpB,CAEG21B,GAIJvzB,KAAKoxB,QAAQzyB,EAAO60B,EACrB,EAI+B97B,KAAKsI,OACrCszB,EAAQrvB,GAAG,MAzCX,WACEjE,KAAKgwB,WACLhwB,KAAK0xB,gBACN,EAsC2Bh6B,KAAKsI,OAE1BA,IACT,EAeA0vB,GAAS95B,UAAUk1B,KAAO,SAASE,EAAUtS,GAC3C,OAAI1Y,KAAK4wB,OAAOC,UAAY7wB,KAAK4wB,OAAO9rB,SACtC9E,KAAKiF,KAAK,QAAS,IAAIuqB,GAAc,gBAC9BxvB,MAGe,iBAAbgrB,GAA6C,IAApBA,EAASv0B,QAC3CuJ,KAAKiF,KAAK,QAAS,IAAIuqB,GAAc,yBAC9BxvB,OAGTA,KAAKoxB,QAAQpG,EAAUtS,GAEhB1Y,KACT,EAWA0vB,GAAS95B,UAAUgO,KAAO,SAAS3J,EAASC,EAASwe,GACnD1Y,KAAKgwB,WAEL91B,EAAU6qB,GAAKuI,SAASpzB,EAAS,CAC/BnD,MAAM,IAuBR,IAAIu8B,EAAU1vB,GAAK3J,EAASC,GAK5B,OAJAo5B,EAAQrvB,GAAG,QAhBX,SAAqBzP,GACnBwL,KAAKiF,KAAK,QAASzQ,EACpB,EAc+BkD,KAAKsI,OACrCszB,EAAQrvB,GAAG,QAbX,SAAqBtF,GACnB,IAAI60B,EAAY79B,OAAOg2B,OAAO,CAAE,EAAEjT,GAE9Bxe,EAAQ6B,MACVy3B,EAAU7b,KAAOhZ,EACjBA,EAAQ20B,EAAQ9yB,SAAS7B,IAG3BqB,KAAKoxB,QAAQzyB,EAAO60B,EACrB,EAI+B97B,KAAKsI,OACrCszB,EAAQrvB,GAAG,MAvBX,WACEjE,KAAKgwB,WACLhwB,KAAK0xB,gBACN,EAoB2Bh6B,KAAKsI,OAE1BA,IACT,EAYA0vB,GAAS95B,UAAUi7B,SAAW,WAC5B,GAAI7wB,KAAK4wB,OAAO9rB,QAEd,OADA9E,KAAKiF,KAAK,QAAS,IAAIuqB,GAAc,YAC9BxvB,KAGT,GAAIA,KAAK4wB,OAAOC,SAEd,OADA7wB,KAAKiF,KAAK,QAAS,IAAIuqB,GAAc,eAC9BxvB,KAGTA,KAAK4wB,OAAOC,UAAW,EAED,IAAlB7wB,KAAKgwB,UAAkBhwB,KAAKswB,OAAOxX,QAAU9Y,KAAK0wB,WAAW5X,QAC/D9Y,KAAKwxB,YAGP,IAAIx3B,EAAOgG,KAEX,OAAO,IAAIyzB,SAAQ,SAAS/9B,EAAS6pB,GACnC,IAAImU,EAEJ15B,EAAK+1B,QAAQ9rB,GAAG,OAAO,WAChByvB,GACHh+B,GAER,IAEIsE,EAAK+1B,QAAQ9rB,GAAG,SAAS,SAASzP,GAChCk/B,GAAU,EACVnU,EAAO/qB,EACb,GACA,GACA,EAQAk7B,GAAS95B,UAAU+9B,UAAY,SAAShE,GACtC,OAAI3vB,KAAK8vB,SACP9vB,KAAKiF,KAAK,QAAS,IAAIuqB,GAAc,cAC9BxvB,OAGTA,KAAK8vB,QAAUH,EAER3vB,KACT,EAQA0vB,GAAS95B,UAAUg+B,UAAY,SAASloB,GACtC,OAAI1L,KAAK4wB,OAAO9rB,SACd9E,KAAKiF,KAAK,QAAS,IAAIuqB,GAAc,YAC9BxvB,MAGLA,KAAK4wB,OAAOllB,QACd1L,KAAKiF,KAAK,QAAS,IAAIuqB,GAAc,cAC9BxvB,OAGTA,KAAK+vB,QAAUrkB,EACf1L,KAAKiyB,cAEEjyB,KACT,EAWA0vB,GAAS95B,UAAUi+B,QAAU,SAAS7I,EAAU/yB,GAC9C,GAAI+H,KAAK4wB,OAAOC,UAAY7wB,KAAK4wB,OAAO9rB,QAEtC,OADA9E,KAAKiF,KAAK,QAAS,IAAIuqB,GAAc,gBAC9BxvB,KAGT,GAAwB,iBAAbgrB,GAA6C,IAApBA,EAASv0B,OAE3C,OADAuJ,KAAKiF,KAAK,QAAS,IAAIuqB,GAAc,4BAC9BxvB,KAGT,GAAsB,iBAAX/H,GAAyC,IAAlBA,EAAOxB,OAEvC,OADAuJ,KAAKiF,KAAK,QAAS,IAAIuqB,GAAc,wBAAyB,CAAExE,SAAUA,KACnEhrB,KAGT,IAAKA,KAAKmyB,gBAAgB,WAExB,OADAnyB,KAAKiF,KAAK,QAAS,IAAIuqB,GAAc,sBAAuB,CAAExE,SAAUA,KACjEhrB,KAGT,IAAI0Y,EAAO,CACXA,KAAY,WAWZ,OAVAA,EAAKf,KAAOqT,EAAS9uB,QAAQ,MAAO,KACpCwc,EAAKwa,SAAWj7B,EAAOiE,QAAQ,MAAO,KACtCwc,EAAKoa,WAAa,SAElB9yB,KAAKkwB,gBACLlwB,KAAKswB,OAAOlzB,KAAK,CACfsb,KAAMA,EACNkM,OAAQjZ,OAAO7J,OAAO,MAGjB9B,IACT,EAOA0vB,GAAS95B,UAAUk+B,QAAU,WAC3B,OAAO9zB,KAAKiwB,QACd,EASAP,GAAS95B,UAAUm+B,IAAM,SAASC,GAEhC,OADAh0B,KAAKixB,SAAS7zB,KAAK42B,GACZh0B,IACT,EAEA,IAAci0B,GAAGvE,0CC53BjB,IAAIwE,EAAexoB,EAAAnF,QAAiB,aAEpC2tB,EAAat+B,UAAUu+B,QAAU,aAEjCD,EAAat+B,UAAUw+B,QAAU,aAEjCF,EAAat+B,UAAUy+B,oBAAsB,aAE7CH,EAAat+B,UAAUuM,YAAc,uDCRrC,IAAI4iB,EAAOrZ,EAAcnF,QAAG,GAE5Bwe,EAAKuP,UAAY,SAASC,EAAGC,GAG3B,IAAIC,GAFJD,EAAiBA,IAAkB,GAEPD,EAAEG,cAAgBH,EAAEI,iBAEhD,OAAIF,EAAO,KACF,QACEA,GAAQ,KACV,WAIDA,EAQY,MAAS,IAPpBD,EAAiBD,EAAEK,WAAaL,EAAEM,eAOM,GAAM,IAN/CL,EAAiBD,EAAEO,UAAYP,EAAEQ,eAMiC,IALjEP,EAAiBD,EAAES,WAAaT,EAAEU,gBAM3B,IALLT,EAAiBD,EAAEW,aAAeX,EAAEY,kBAKT,GAJ3BX,EAAiBD,EAAEa,aAAeb,EAAEc,iBAIW,CAC5D,EAEAtQ,EAAKuQ,UAAY,SAASC,GACxB,OAAO,IAAIlI,KAA4B,MAArBkI,GAAO,GAAM,MAAgBA,GAAO,GAAM,IAAQ,EAAIA,GAAO,GAAM,GAAOA,GAAO,GAAM,GAAOA,GAAO,EAAK,IAAa,GAANA,IAAe,EACpJ,EAEAxQ,EAAKyQ,YAAc,SAASvI,GAC1B,OAAOlI,EAAKuQ,UAAUrI,EAAIwI,aAAa,GACzC,EAEA1Q,EAAK2Q,cAAgB,SAASrkB,GAC5B,IAAI4b,EAAMthB,OAAOgqB,MAAM,GAIvB,OAHA1I,EAAI2I,cAAcvkB,EAAI,WAAc,GACpC4b,EAAI2I,cAAevkB,EAAI,WAAgB,EAAG,GAEnC4b,CACT,EAEAlI,EAAK8Q,cAAgB,SAASxkB,GAC5B,IAAI4b,EAAMthB,OAAOgqB,MAAM,GAGvB,OAFA1I,EAAI6I,eAAmB,MAAJzkB,KAAgB,EAAG,GAE/B4b,CACT,EAEAlI,EAAKgR,mBAAqB,SAAS9I,EAAKlG,GACtC,OAAOkG,EAAI+I,aAAajP,EAC1B,EAEAhC,EAAKkR,aAAe,SAAS5kB,GAC3B,IAAI4b,EAAMthB,OAAOgqB,MAAM,GAGvB,OAFA1I,EAAI2I,eAAmB,WAAJvkB,KAAoB,EAAG,GAEnC4b,CACT,EAEAlI,EAAKmR,kBAAoB,SAASjJ,EAAKlG,GACrC,OAAOkG,EAAIwI,aAAa1O,EAC1B,EAEAhC,EAAKoR,UAAY,SAAS5B,GACxB,OAAOxP,EAAKkR,aAAalR,EAAKuP,UAAUC,GAC1C,4CChEA,IAOI6B,EAAoB1qB,EAAcnF,QAAG,WACvC,OAAMvG,gBAAgBo2B,GAItBp2B,KAAKq2B,YAAa,EAClBr2B,KAAKs2B,YAAa,EAClBt2B,KAAKu2B,MAAO,EACZv2B,KAAKw2B,yBAA2B,EAChCx2B,KAAKy2B,kBAAmB,EACxBz2B,KAAK02B,sBAAwB,EAEtB12B,MAVE,IAAIo2B,CAWf,EAEAA,EAAkBxgC,UAAU+gC,OAAS,WACnC,OAAOC,GAAQf,eACZ71B,KAAKq2B,WAxBiB,EAwBmB,IACzCr2B,KAAKu2B,KApBY,KAoBa,IAC9Bv2B,KAAKs2B,WAzBY,EAyBmB,IACpCt2B,KAAKy2B,iBAvBmB,GAuByB,GAEtD,EAEAL,EAAkBxgC,UAAUihC,MAAQ,SAAS5J,EAAKlG,GAChD,IAAI+P,EAAOF,GAAQb,mBAAmB9I,EAAKlG,GACvCgQ,EAAM,IAAIX,EASd,OAPAW,EAAIC,qBAnCqB,EAmCFF,IACvBC,EAAIE,mBA/BgB,KA+BCH,IACrBC,EAAIG,uBAjCuB,GAiCFJ,IACzBC,EAAII,iBArCgB,EAqCDL,IACnBC,EAAIK,yBApC6B,EAoCHN,EAA6C,KAAO,MAClFC,EAAIM,4BAtCkC,EAsCLP,EAAkD,EAAI,GAEhFC,CACT,EAEAX,EAAkBxgC,UAAUyhC,4BAA8B,SAASp3B,GACjED,KAAKw2B,yBAA2Bv2B,CAClC,EAEAm2B,EAAkBxgC,UAAU0hC,4BAA8B,WACxD,OAAOt3B,KAAKw2B,wBACd,EAEAJ,EAAkBxgC,UAAUwhC,yBAA2B,SAASn3B,GAC9DD,KAAK02B,sBAAwBz2B,CAC/B,EAEAm2B,EAAkBxgC,UAAU2hC,yBAA2B,WACrD,OAAOv3B,KAAK02B,qBACd,EAEAN,EAAkBxgC,UAAUohC,kBAAoB,SAASh4B,GACvDgB,KAAKq2B,WAAar3B,CACpB,EAEAo3B,EAAkBxgC,UAAU4hC,mBAAqB,WAC/C,OAAOx3B,KAAKq2B,UACd,EAEAD,EAAkBxgC,UAAUuhC,cAAgB,SAASn4B,GACnDgB,KAAKs2B,WAAat3B,CACpB,EAEAo3B,EAAkBxgC,UAAU6hC,eAAiB,WAC3C,OAAOz3B,KAAKs2B,UACd,EAEAF,EAAkBxgC,UAAUshC,oBAAsB,SAASl4B,GACzDgB,KAAKy2B,iBAAmBz3B,CAC1B,EAEAo3B,EAAkBxgC,UAAU8hC,qBAAuB,WACjD,OAAO13B,KAAKy2B,gBACd,EAEAL,EAAkBxgC,UAAUqhC,gBAAkB,SAASj4B,GACrDgB,KAAKu2B,KAAOv3B,CACd,EAEAo3B,EAAkBxgC,UAAU+hC,iBAAmB,WAC7C,OAAO33B,KAAKu2B,IACd,KC7FAqB,GASoB,MATpBA,GAce,MCdfC,GAAiB,CACfC,KAAM,EACNC,MAAO,EACPC,MAAOrsB,OAAOgqB,MAAM,GAEpBsC,MAAO,EACPC,WAAY,MACZC,YAAa,GACbC,WAAYzsB,OAAO0sB,KAAK58B,MAAM,IAC9B68B,KAAM,EACNC,UAAW5sB,OAAO0sB,KAAK58B,MAAM,IAE7B+8B,oBAAqB,GACrBC,4BAA6B,GAC7BC,kBAAmB,GACnBC,eAAgB,GAEhBC,cAAe,EACfC,gBAAiB,EAEjBC,cAAe,EACfC,aAAc,EAEdC,QAAS,SACTC,OAAQ,UACRC,QAAS,SACTC,SAAU,UACVC,eAAgB,UAChBC,mBAAoB,UAEpBC,kBAAmB,MACnBC,YAAa,WACbC,eAAgB,EAEhBC,oBAAqB,EACrBC,gBAAiB,EACjBC,sBAAuB,EACvBC,0BAA2B,EAE3BC,UAAW,KACXC,kBAAmB,MACnBC,iBAAkB,MAElBC,kBAAmB,WACnBC,mBAAoB,WAGpBC,OAAQ,MACRC,QAAS,KACTC,QAAS,KACTC,QAAS,MACTC,QAAS,MACTC,QAAS,MACTC,QAAS,MACTC,SAAU,MAGVC,QAAS,GACTC,QAAS,GACTC,QAAS,EACTC,QAAS,EACTC,QAAS,EACTC,QAAS,0CC9DX,IAAIl2B,EAAWpF,EAAe,QAACoF,SAU3Bm2B,EAAkBtvB,EAAAnF,QAAiB,SAASoR,GAC9C,KAAM3X,gBAAgBg7B,GACpB,OAAO,IAAIA,EAAgBrjB,GAG7Buc,GAAap+B,KAAKkK,MAElBA,KAAKlM,SAAW+jC,GAAUkB,aAC1B/4B,KAAK2kB,QAAU,EAEf3kB,KAAK2X,KAAO,KACZ3X,KAAKgqB,KAAO,EACZhqB,KAAKi7B,MAAQ,EACbj7B,KAAKk7B,IAAM,IAAI9E,GACfp2B,KAAKm7B,IAAM,EACXn7B,KAAKo7B,MAAQ,EAEbp7B,KAAKq7B,OAASxD,GAAUW,oBACxBx4B,KAAKyyB,MAAQ,EACbzyB,KAAKs7B,MAAQ,KACbt7B,KAAKu7B,OAAS,EACdv7B,KAAKw7B,OAAS,EACdx7B,KAAKy7B,QAAU,KAEX9jB,GACF3X,KAAK07B,QAAQ/jB,EAEjB,EAEA9S,EAASm2B,EAAiB9G,IAO1B8G,EAAgBplC,UAAU+lC,yBAA2B,WACnD,OAAO37B,KAAK47B,UACd,EAOAZ,EAAgBplC,UAAUimC,WAAa,WACrC,OAAwB,OAAjB77B,KAAKy7B,QAAmBz7B,KAAKy7B,QAAU,EAChD,EAOAT,EAAgBplC,UAAUkmC,kBAAoB,WAC5C,OAAO97B,KAAKi7B,KACd,EAOAD,EAAgBplC,UAAUmmC,OAAS,WACjC,OAAO/7B,KAAKm7B,GACd,EAOAH,EAAgBplC,UAAUomC,sBAAwB,WAChD,OAAOh8B,KAAKu7B,MACd,EAOAP,EAAgBplC,UAAUgmC,SAAW,WACnC,OAAsB,OAAf57B,KAAKs7B,MAAiBt7B,KAAKs7B,MAAQzD,GAAUG,KACtD,EAOAgD,EAAgBplC,UAAUqmC,qBAAuB,WAC/C,OAAOj8B,KAAKk7B,GACd,EAOAF,EAAgBplC,UAAUsmC,sBAAwB,WAChD,OAAOl8B,KAAKw7B,MACd,EAOAR,EAAgBplC,UAAUy+B,oBAAsB,WAC9C,OAAOr0B,KAAKm8B,SACd,EAOAnB,EAAgBplC,UAAUwmC,sBAAwB,WAChD,OAAOp8B,KAAK47B,UACd,EAOAZ,EAAgBplC,UAAUymC,UAAY,WACpC,OAAOr8B,KAAK2kB,MACd,EAOAqW,EAAgBplC,UAAUu+B,QAAU,WAClC,OAAOn0B,KAAK2X,IACd,EAOAqjB,EAAgBplC,UAAU0mC,YAAc,WACtC,OAAOt8B,KAAKlM,QACd,EAOAknC,EAAgBplC,UAAUw+B,QAAU,WAClC,OAAOp0B,KAAKgqB,IACd,EAOAgR,EAAgBplC,UAAUumC,QAAU,WAClC,OAAsB,IAAfn8B,KAAKo7B,KAAcxE,GAAQtB,UAAUt1B,KAAKo7B,OAAS,CAC5D,EAOAJ,EAAgBplC,UAAU2mC,WAAa,WACrC,OAAsB,IAAfv8B,KAAKo7B,KAAcp7B,KAAKo7B,KAAO,CACxC,EAOAJ,EAAgBplC,UAAU4mC,YAAc,WACtC,OAAOx8B,KAAKlM,WAAa+jC,GAAUiB,cAAgB,EAAM94B,KAAKg8B,yBAA2BnE,GAAUM,YAAeN,GAAUK,UAC9H,EAOA8C,EAAgBplC,UAAU6mC,0BAA4B,WACpD,OAAOz8B,KAAKq7B,MACd,EAOAL,EAAgBplC,UAAU8mC,WAAa,SAASjB,GAC1C9vB,OAAOgxB,WAAWlB,KAAaA,EAAQhlC,QACzCuJ,KAAKi8B,uBAAuBhF,iBAAgB,GAG9Cj3B,KAAKy7B,QAAUA,CACjB,EAOAT,EAAgBplC,UAAUgnC,kBAAoB,SAAS5S,GACrD,GAAIA,EAAO,EACT,MAAM,IAAIz1B,MAAM,iCAGlByL,KAAKi7B,MAAQjR,CACf,EAOAgR,EAAgBplC,UAAUinC,OAAS,SAAS1B,GAC1C,GAAIA,EAAM,EACR,MAAM,IAAI5mC,MAAM,uBAGlByL,KAAKm7B,IAAMA,CACb,EAOAH,EAAgBplC,UAAUknC,sBAAwB,SAASC,GACzD/8B,KAAKu7B,OAASwB,IAAS,CACzB,EAOA/B,EAAgBplC,UAAUonC,SAAW,SAAS1B,GAC5Ct7B,KAAKs7B,MAAQA,CACf,EAOAN,EAAgBplC,UAAUqnC,qBAAuB,SAAS/B,GACxD,KAAMA,aAAe9E,IACnB,MAAM,IAAI7hC,MAAM,mCAGlByL,KAAKk7B,IAAMA,CACb,EAOAF,EAAgBplC,UAAUsnC,sBAAwB,SAASH,GACzD/8B,KAAKw7B,OAASuB,CAChB,EAOA/B,EAAgBplC,UAAUunC,UAAY,SAASxY,GAC7C,GAAIA,EAAS,EACX,MAAM,IAAIpwB,MAAM,oCAGlByL,KAAK2kB,OAASA,CAChB,EAOAqW,EAAgBplC,UAAU8lC,QAAU,SAAS/jB,GAC3CA,EAAOqN,GAAcrN,GAAM,GAAOzb,QAAQ,QAAS,IAAIA,QAAQ,gBAAiB,IAE5EyP,OAAOgxB,WAAWhlB,KAAUA,EAAKlhB,QACnCuJ,KAAKi8B,uBAAuBhF,iBAAgB,GAG9Cj3B,KAAK2X,KAAOA,CACd,EAOAqjB,EAAgBplC,UAAUwnC,YAAc,SAAStpC,GAC/CkM,KAAKlM,SAAWA,CAClB,EAOAknC,EAAgBplC,UAAUynC,QAAU,SAASrT,GAC3C,GAAIA,EAAO,EACT,MAAM,IAAIz1B,MAAM,sBAGlByL,KAAKgqB,KAAOA,CACd,EAQAgR,EAAgBplC,UAAU0nC,QAAU,SAASlC,EAAM5G,GACjD,KAAM4G,aAAgB/N,MACpB,MAAM,IAAI94B,MAAM,sBAGlByL,KAAKo7B,KAAOxE,GAAQtC,UAAU8G,EAAM5G,EACtC,EAOAwG,EAAgBplC,UAAU2nC,YAAc,SAAS9K,GAG/C,IAAI+K,EAAU,EACdA,IAHA/K,GAAQzyB,KAAKmC,cAAgB01B,GAAUwC,QAAUxC,GAAU0C,UAGvC1C,GAAUM,aAAgBn4B,KAAKmC,cAAgB01B,GAAU8C,QAAU9C,GAAU6C,SAEjG16B,KAAK88B,sBAAsBU,GAC3Bx9B,KAAKyyB,KAAOA,EAAOoF,GAAUgC,UAC7B75B,KAAKlM,SAAW+jC,GAAUiB,aAC5B,EAOAkC,EAAgBplC,UAAU6nC,0BAA4B,SAASpC,GAC7Dr7B,KAAKq7B,OAASA,CAChB,EAOAL,EAAgBplC,UAAUuM,YAAc,WACtC,MAAoC,MAA7BnC,KAAKm0B,UAAU38B,OAAO,EAC/B,EASAwjC,EAAgBplC,UAAU8nC,cAAgB,WACxC,OAAQ19B,KAAKw8B,cAAgBmB,MAA6BA,EAC5D,EAOA3C,EAAgBplC,UAAUgoC,QAAU,WAClC,OAAO59B,KAAKi7B,MAAQpD,GAAU0B,aAAev5B,KAAKgqB,KAAO6N,GAAU0B,WACrE,+CClZYhzB,EAAUmF,EAAcnF,QAAGogB,EAAM,QAACpC,UAClBA,SAAGoC,EAAM,QAACpC,SAC1Bhe,EAAgBie,SAAGmC,EAAM,QAACnC,SAC1Bje,EAAcqgB,OAAGD,EAAM,QAACC,OACxBrgB,EAAiBsgB,UAAGF,EAAM,QAACE,UAC3BtgB,EAAmB8d,YAAGsC,EAAM,QAACtC,YAC7B9d,EAAAogB,OAAiBA,oDCF7B,IAAIA,EAASlnB,EAAiB,QAACknB,OAC3BtC,EAAcsI,GAA2BtI,YAEzCU,EAAOrZ,EAAcnF,QAAG,GAE5Bwe,EAAKwI,SAAW,SAAS3I,GACvB,OAAOA,aAAkB+B,CAC3B,EAEA5B,EAAK2I,qBAAuB,SAAS9I,GACnC,GAAe,OAAXA,EACF,OAAOjZ,OAAOgqB,MAAM,GACf,GAAsB,iBAAX/Q,EAChB,OAAOjZ,OAAO0sB,KAAKzT,GACd,GAAIG,EAAKwI,SAAS3I,KAAYA,EAAO+I,eAAgB,CAC1D,IAAIC,EAAa,IAAIvJ,EAGrB,OAFAO,EAAOC,KAAK+I,GAELA,CACR,CAED,OAAOhJ,CACT,4CCtBA,IAAI/f,EAAWpF,EAAe,QAACoF,SAC3BgiB,EAAY8F,GAA2B9F,UAKvCgX,EAAsBnyB,EAAAnF,QAAiB,SAASrM,GAClD,KAAM8F,gBAAgB69B,GACpB,OAAO,IAAIA,EAAoB3jC,GAGjC2sB,EAAU/wB,KAAKkK,KAAM9F,GAErB8F,KAAK+mB,OAAS,EACd/mB,KAAK89B,SAAW,CACdp9B,QAAQ,EACRq9B,UAAU,EACVC,YAAY,EAEhB,EAEAn5B,EAASg5B,EAAqBhX,GAE9BgX,EAAoBjoC,UAAUqoC,cAAgB,SAASC,EAAKtZ,EAAQvwB,GAEpE,EAEAwpC,EAAoBjoC,UAAUuoC,cAAgB,SAASD,EAAKtZ,EAAQvwB,GAEpE,EAEAwpC,EAAoBjoC,UAAUwoC,mBAAqB,SAAS5pC,GACtDA,GACFwL,KAAKiF,KAAK,QAASzQ,EAEvB,EAEAqpC,EAAoBjoC,UAAUwK,QAAU,SAASi+B,GAEjD,EAEAR,EAAoBjoC,UAAU0oC,gBAAkB,SAASD,GAEzD,EAEAR,EAAoBjoC,UAAU+8B,WAAa,SAAS3F,EAAO4F,EAAUv+B,GACnEA,EAAS,KAAM24B,EACjB,EAEA6Q,EAAoBjoC,UAAU6yB,MAAQ,SAAS4V,EAAIzZ,EAAQvwB,GAOzD,GANAuwB,EAASA,GAAU,KAEK,mBAAbvwB,IACTA,EAAW2L,KAAKo+B,mBAAmB1mC,KAAKsI,OAGpCq+B,aAAcnK,GAKpB,GAAIl0B,KAAK89B,SAASp9B,QAAUV,KAAK89B,SAASC,SACxC1pC,EAAS,IAAIE,MAAM,wCADrB,CAKA,IAAIyL,KAAK89B,SAASE,WAAlB,CAWA,GANAh+B,KAAK89B,SAASE,YAAa,EAC3Bh+B,KAAKs+B,gBAAgBD,GACrBr+B,KAAKu+B,OAASF,EAEdzZ,EAASG,GAAK2I,qBAAqB9I,GAE/BjZ,OAAOC,SAASgZ,GAClB5kB,KAAKi+B,cAAcI,EAAIzZ,EAAQvwB,OAC1B,KAAI0wB,GAAKwI,SAAS3I,GAKvB,OAFA5kB,KAAK89B,SAASE,YAAa,OAC3B3pC,EAAS,IAAIE,MAAM,yDAHnByL,KAAKm+B,cAAcE,EAAIzZ,EAAQvwB,EAKhC,CAED,OAAO2L,IAlBN,CAFC3L,EAAS,IAAIE,MAAM,+BAHpB,MAPCF,EAAS,IAAIE,MAAM,wCA+BvB,EAEAspC,EAAoBjoC,UAAU8K,OAAS,WACjCV,KAAK89B,SAASE,WAChBh+B,KAAK89B,SAASp9B,QAAS,EAIzBV,KAAKI,SACP,EAEAy9B,EAAoBjoC,UAAU4oC,gBAAkB,WAC9C,OAAOx+B,KAAK+mB,MACd,EAEA8W,EAAoBjoC,UAAU6oC,MAAQ,SAASzR,EAAO54B,GAKpD,OAJI44B,IACFhtB,KAAK+mB,QAAUiG,EAAMv2B,QAGhBowB,EAAUjxB,UAAU6oC,MAAM3oC,KAAKkK,KAAMgtB,EAAO54B,EACrD,KClHA,MAAMsqC,GACJ/yB,EAAMA,OAAC0sB,MAAQ1sB,SAAOgqB,OAAShqB,EAAAA,OAAOgzB,aAAehzB,EAAAA,OAAOizB,gBACxDjzB,EAAAA,OAAO0sB,KAEPxkB,GAAO,IAAIlI,EAAMA,OAACkI,GCNT,SAAAgrB,GAASC,EAAOC,GAC7B,MAAMj4B,EAAK,CAACmmB,EAAK/2B,IAAa6oC,EAAK9R,EAAK/2B,KAAc,EAKtD,OAJA4Q,EAAGk4B,OAASD,EACZj4B,EAAGm4B,SAAWn4B,EACdA,EAAGg4B,MAAQA,EAEJh4B,CACT,CCHA,MAAMo4B,GAAOL,GAAU,QAAQ,SAAS5R,EAAK/2B,GACtCyV,EAAMA,OAACC,SAASqhB,KAAMA,EAAMyR,GAAazR,IAE9C,IAAIkO,IAAQjlC,EACRipC,EAAQ,EAEZ,IAAK,IAAI5+B,EAAQ,EAAGA,EAAQ0sB,EAAIx2B,OAAQ8J,IAAS,CAE/C4+B,GADalS,EAAI1sB,EAElB,CAGD,OADA46B,GAAOgE,EAAQ,IACRhE,EAAM,GACf,ICXA,IAAIiE,GAAQ,CACV,EAAM,EAAM,GAAM,EAAM,GAAM,GAAM,GAAM,GAAM,GAAM,GAAM,GAAM,GAAM,GAAM,GAAM,GAAM,GAC1F,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,GAAM,IAAM,GAAM,GAAM,GAAM,GAAM,GAAM,GAAM,GAAM,GAC1F,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAC1F,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAC1F,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAC1F,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAC1F,GAAM,GAAM,GAAM,GAAM,GAAM,GAAM,GAAM,GAAM,GAAM,GAAM,GAAM,GAAM,EAAM,EAAM,GAAM,GAC1F,GAAM,GAAM,GAAM,GAAM,GAAM,GAAM,GAAM,GAAM,IAAM,IAAM,GAAM,IAAM,IAAM,IAAM,IAAM,IAC1F,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAC1F,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAC1F,IAAM,IAAM,IAAM,GAAM,IAAM,IAAM,IAAM,IAAM,GAAM,GAAM,GAAM,GAAM,GAAM,GAAM,GAAM,GAC1F,GAAM,GAAM,GAAM,GAAM,EAAM,EAAM,GAAM,GAAM,GAAM,GAAM,GAAM,GAAM,GAAM,GAAM,GAAM,GAC1F,GAAM,GAAM,GAAM,GAAM,GAAM,GAAM,GAAM,GAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,GAC1F,GAAM,GAAM,GAAM,GAAM,GAAM,GAAM,GAAM,GAAM,EAAM,EAAM,EAAM,GAAM,GAAM,GAAM,GAAM,GAC1F,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAC1F,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,KAGlE,oBAAfC,aAA4BD,GAAQ,IAAIC,WAAWD,KAE9D,MAAME,GAAOT,GAAU,SAAS,SAAS5R,EAAK/2B,GACvCyV,EAAMA,OAACC,SAASqhB,KAAMA,EAAMyR,GAAazR,IAE9C,IAAIkO,IAAQjlC,EAEZ,IAAK,IAAIqK,EAAQ,EAAGA,EAAQ0sB,EAAIx2B,OAAQ8J,IAAS,CAC/C,MAAMg/B,EAAOtS,EAAI1sB,GACjB46B,EAAmC,IAA7BiE,GAAqB,KAAdjE,EAAMoE,GACpB,CAED,OAAOpE,CACT,IChCA,IAAIiE,GAAQ,CACV,EAAM,GAAM,IAAM,IAAM,GAAM,GAAM,IAAM,IAAM,IAAM,IAAM,IAAM,GAAM,IAAM,IAAM,GAAM,GAC1F,IAAM,IAAM,GAAM,IAAM,IAAM,IAAM,GAAM,GAAM,GAAM,EAAM,IAAM,IAAM,GAAM,GAAM,IAAM,IAC1F,GAAM,IAAM,IAAM,IAAM,GAAM,GAAM,IAAM,IAAM,IAAM,IAAM,GAAM,EAAM,IAAM,IAAM,GAAM,GAC1F,IAAM,IAAM,EAAM,GAAM,IAAM,IAAM,GAAM,GAAM,IAAM,GAAM,IAAM,IAAM,GAAM,GAAM,IAAM,IAC1F,GAAM,GAAM,IAAM,IAAM,GAAM,IAAM,IAAM,IAAM,IAAM,IAAM,GAAM,IAAM,IAAM,IAAM,GAAM,EAC1F,IAAM,IAAM,IAAM,GAAM,IAAM,IAAM,EAAM,GAAM,GAAM,GAAM,IAAM,IAAM,IAAM,GAAM,IAAM,IAC1F,IAAM,GAAM,IAAM,IAAM,EAAM,GAAM,IAAM,IAAM,IAAM,IAAM,GAAM,GAAM,IAAM,IAAM,IAAM,GAC1F,IAAM,IAAM,GAAM,GAAM,IAAM,IAAM,GAAM,IAAM,GAAM,IAAM,IAAM,IAAM,GAAM,EAAM,IAAM,IAC1F,IAAM,IAAM,GAAM,IAAM,IAAM,IAAM,GAAM,GAAM,GAAM,GAAM,IAAM,IAAM,GAAM,IAAM,IAAM,IAC1F,GAAM,GAAM,IAAM,IAAM,IAAM,GAAM,IAAM,IAAM,IAAM,IAAM,IAAM,GAAM,IAAM,IAAM,GAAM,GAC1F,IAAM,IAAM,GAAM,GAAM,IAAM,IAAM,IAAM,GAAM,IAAM,GAAM,IAAM,IAAM,GAAM,GAAM,IAAM,IAC1F,GAAM,IAAM,IAAM,IAAM,GAAM,GAAM,IAAM,IAAM,IAAM,IAAM,GAAM,GAAM,IAAM,IAAM,GAAM,IAC1F,IAAM,IAAM,IAAM,GAAM,IAAM,IAAM,GAAM,GAAM,EAAM,GAAM,IAAM,IAAM,IAAM,GAAM,IAAM,IAC1F,GAAM,EAAM,IAAM,IAAM,GAAM,IAAM,IAAM,IAAM,IAAM,IAAM,GAAM,IAAM,IAAM,IAAM,GAAM,GAC1F,IAAM,IAAM,GAAM,GAAM,IAAM,IAAM,GAAM,IAAM,GAAM,IAAM,IAAM,IAAM,GAAM,GAAM,IAAM,IAC1F,IAAM,GAAM,IAAM,IAAM,GAAM,GAAM,IAAM,IAAM,IAAM,IAAM,GAAM,GAAM,IAAM,IAAM,IAAM,IAGlE,oBAAfC,aAA4BD,GAAQ,IAAIC,WAAWD,KAE9D,MAAMI,GAAYX,GAAU,iBAAiB,SAAS5R,EAAK/2B,GACpDyV,EAAMA,OAACC,SAASqhB,KAAMA,EAAMyR,GAAazR,IAE9C,IAAIkO,IAAQjlC,EAEZ,IAAK,IAAIqK,EAAQ,EAAGA,EAAQ0sB,EAAIx2B,OAAQ8J,IAAS,CAC/C,MAAMg/B,EAAOtS,EAAI1sB,GACjB46B,EAAmC,IAA7BiE,GAAqB,KAAdjE,EAAMoE,GACpB,CAED,OAAOpE,CACT,IChCA,IAAIiE,GAAQ,CACV,EAAQ,MAAQ,MAAQ,IAAQ,MAAQ,IAAQ,IAAQ,MACxD,MAAQ,KAAQ,KAAQ,MAAQ,KAAQ,MAAQ,MAAQ,KACxD,MAAQ,KAAQ,KAAQ,MAAQ,KAAQ,MAAQ,MAAQ,KACxD,KAAQ,MAAQ,MAAQ,KAAQ,MAAQ,KAAQ,KAAQ,MACxD,MAAQ,KAAQ,KAAQ,MAAQ,KAAQ,MAAQ,MAAQ,KACxD,KAAQ,MAAQ,MAAQ,IAAQ,MAAQ,KAAQ,KAAQ,MACxD,KAAQ,MAAQ,MAAQ,KAAQ,MAAQ,KAAQ,KAAQ,MACxD,MAAQ,KAAQ,KAAQ,MAAQ,KAAQ,MAAQ,MAAQ,KACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,KAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,KAAQ,KAAQ,MAAQ,KAAQ,MAAQ,MAAQ,KACxD,KAAQ,MAAQ,MAAQ,KAAQ,MAAQ,KAAQ,KAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,KAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,OAGhC,oBAAfC,aAA4BD,GAAQ,IAAIC,WAAWD,KAE9D,MAAMK,GAAQZ,GAAU,UAAU,SAAS5R,EAAK/2B,GACzCyV,EAAMA,OAACC,SAASqhB,KAAMA,EAAMyR,GAAazR,IAE9C,IAAIkO,IAAQjlC,EAEZ,IAAK,IAAIqK,EAAQ,EAAGA,EAAQ0sB,EAAIx2B,OAAQ8J,IAAS,CAC/C,MAAMg/B,EAAOtS,EAAI1sB,GACjB46B,EAAkD,OAA3CiE,GAAqB,KAAdjE,EAAMoE,IAAiBpE,GAAO,EAC7C,CAED,OAAOA,CACT,IChDA,IAAIiE,GAAQ,CACV,EAAQ,KAAQ,KAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,KAAQ,IAAQ,MAAQ,KAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,KAAQ,MAAQ,KAAQ,KAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,KAAQ,KAAQ,KAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,KAAQ,KAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,KAAQ,KAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,KAAQ,KACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,KAAQ,KACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,KAAQ,IAAQ,MAAQ,KAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,IAAQ,KAAQ,KAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,KAAQ,KAAQ,KAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,KAAQ,MAAQ,KAAQ,KAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,KAAQ,KAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,KAAQ,KAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,KAAQ,KACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,KAAQ,MAGhC,oBAAfC,aAA4BD,GAAQ,IAAIC,WAAWD,KAE9D,MAAMM,GAAab,GAAU,SAAS,SAAS5R,EAAK/2B,GAC7CyV,EAAMA,OAACC,SAASqhB,KAAMA,EAAMyR,GAAazR,IAE9C,IAAIkO,OAA0B,IAAbjlC,IAA6BA,EAAW,MAEzD,IAAK,IAAIqK,EAAQ,EAAGA,EAAQ0sB,EAAIx2B,OAAQ8J,IAAS,CAC/C,MAAMg/B,EAAOtS,EAAI1sB,GACjB46B,EAAyD,OAAlDiE,GAA4B,KAApBjE,GAAO,EAAKoE,IAAiBpE,GAAO,EACpD,CAED,OAAOA,CACT,IChDA,IAAIiE,GAAQ,CACV,EAAQ,MAAQ,MAAQ,IAAQ,MAAQ,IAAQ,IAAQ,MACxD,MAAQ,KAAQ,KAAQ,MAAQ,KAAQ,MAAQ,MAAQ,KACxD,MAAQ,KAAQ,KAAQ,MAAQ,KAAQ,MAAQ,MAAQ,KACxD,KAAQ,MAAQ,MAAQ,KAAQ,MAAQ,KAAQ,KAAQ,MACxD,MAAQ,KAAQ,KAAQ,MAAQ,KAAQ,MAAQ,MAAQ,KACxD,KAAQ,MAAQ,MAAQ,IAAQ,MAAQ,KAAQ,KAAQ,MACxD,KAAQ,MAAQ,MAAQ,KAAQ,MAAQ,KAAQ,KAAQ,MACxD,MAAQ,KAAQ,KAAQ,MAAQ,KAAQ,MAAQ,MAAQ,KACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,KAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,KAAQ,KAAQ,MAAQ,KAAQ,MAAQ,MAAQ,KACxD,KAAQ,MAAQ,MAAQ,KAAQ,MAAQ,KAAQ,KAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,KAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,OAGhC,oBAAfC,aAA4BD,GAAQ,IAAIC,WAAWD,KAE9D,MAAMO,GAAcd,GAAU,iBAAiB,SAAS5R,EAAK/2B,GACtDyV,EAAMA,OAACC,SAASqhB,KAAMA,EAAMyR,GAAazR,IAE9C,IAAIkO,OAA0B,IAAbjlC,IAA6BA,EAAW,MAEzD,IAAK,IAAIqK,EAAQ,EAAGA,EAAQ0sB,EAAIx2B,OAAQ8J,IAAS,CAC/C,MAAMg/B,EAAOtS,EAAI1sB,GACjB46B,EAAkD,OAA3CiE,GAAqB,KAAdjE,EAAMoE,IAAiBpE,GAAO,EAC7C,CAED,OAAOA,CACT,IClDMyE,GAAcf,GAAU,UAAU,SAAS5R,EAAK/2B,GAC/CyV,EAAMA,OAACC,SAASqhB,KAAMA,EAAMyR,GAAazR,IAE9C,IAAIkO,OAA0B,IAAbjlC,IAA6BA,EAAW,EAEzD,IAAK,IAAIqK,EAAQ,EAAGA,EAAQ0sB,EAAIx2B,OAAQ8J,IAAS,CAE/C,IAAIxH,EAAQoiC,IAAQ,EAAK,IAEzBpiC,GAAe,IAHFk0B,EAAI1sB,GAIjBxH,GAAQA,IAAS,EACjBoiC,EAAOA,GAAO,EAAK,MACnBA,GAAOpiC,EACPA,EAAQA,GAAQ,EAAK,MACrBoiC,GAAOpiC,EACPA,EAAQA,GAAQ,EAAK,MACrBoiC,GAAOpiC,CACR,CAED,OAAOoiC,CACT,IClBA,IAAIiE,GAAQ,CACV,EAAQ,KAAQ,KAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,KAAQ,IAAQ,MAAQ,KAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,KAAQ,MAAQ,IAAQ,KAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,KAAQ,KAAQ,IAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,KAAQ,KAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,KAAQ,KAAQ,MAAQ,KACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,KAAQ,MAAQ,KAAQ,KACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,KAAQ,KAAQ,KACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,KAAQ,KAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,KAAQ,KAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,KAAQ,KAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,KAAQ,KAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,KAAQ,KAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,KAAQ,KAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,KAAQ,KACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MACxD,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,KAAQ,MAGhC,oBAAfC,aAA4BD,GAAQ,IAAIC,WAAWD,KAE9D,MAAMS,GAAchB,GAAU,UAAU,SAAS5R,EAAK/2B,GAC/CyV,EAAMA,OAACC,SAASqhB,KAAMA,EAAMyR,GAAazR,IAE9C,IAAIkO,OAA0B,IAAbjlC,IAA6BA,EAAW,EAEzD,IAAK,IAAIqK,EAAQ,EAAGA,EAAQ0sB,EAAIx2B,OAAQ8J,IAAS,CAC/C,MAAMg/B,EAAOtS,EAAI1sB,GACjB46B,EAAkD,OAA3CiE,GAAqB,KAAdjE,EAAMoE,IAAiBpE,GAAO,EAC7C,CAED,OAAOA,CACT,IChDA,IAAIiE,GAAQ,CACV,EAAU,QAAU,QAAU,OAAU,QAAU,QAAU,QAAU,SACtE,SAAU,QAAU,QAAU,SAAU,QAAU,SAAU,SAAU,QACtE,SAAU,QAAU,QAAU,SAAU,QAAU,SAAU,SAAU,QACtE,QAAU,SAAU,SAAU,QAAU,SAAU,QAAU,QAAU,SACtE,OAAU,QAAU,QAAU,MAAU,SAAU,QAAU,QAAU,QACtE,SAAU,QAAU,QAAU,SAAU,QAAU,SAAU,SAAU,QACtE,SAAU,QAAU,QAAU,SAAU,QAAU,SAAU,SAAU,QACtE,QAAU,SAAU,SAAU,QAAU,SAAU,QAAU,QAAU,SACtE,QAAU,SAAU,QAAU,QAAU,QAAU,OAAU,MAAU,QACtE,SAAU,QAAU,QAAU,SAAU,QAAU,SAAU,SAAU,QACtE,SAAU,QAAU,QAAU,SAAU,QAAU,SAAU,SAAU,QACtE,QAAU,SAAU,SAAU,QAAU,SAAU,QAAU,QAAU,SACtE,QAAU,QAAU,SAAU,QAAU,QAAU,MAAU,OAAU,QACtE,SAAU,QAAU,QAAU,SAAU,QAAU,SAAU,SAAU,QACtE,SAAU,QAAU,QAAU,SAAU,QAAU,SAAU,SAAU,QACtE,QAAU,SAAU,SAAU,QAAU,SAAU,QAAU,QAAU,SACtE,QAAU,SAAU,SAAU,QAAU,SAAU,QAAU,QAAU,SACtE,QAAU,QAAU,QAAU,SAAU,MAAU,QAAU,QAAU,OACtE,SAAU,QAAU,QAAU,SAAU,QAAU,SAAU,SAAU,QACtE,QAAU,SAAU,SAAU,QAAU,SAAU,QAAU,QAAU,SACtE,QAAU,SAAU,SAAU,QAAU,SAAU,QAAU,QAAU,SACtE,SAAU,QAAU,QAAU,QAAU,OAAU,QAAU,QAAU,MACtE,SAAU,QAAU,QAAU,SAAU,QAAU,SAAU,SAAU,QACtE,QAAU,SAAU,SAAU,QAAU,SAAU,QAAU,QAAU,SACtE,QAAU,SAAU,SAAU,QAAU,SAAU,QAAU,QAAU,SACtE,QAAU,OAAU,OAAU,QAAU,QAAU,SAAU,QAAU,QACtE,SAAU,QAAU,QAAU,SAAU,QAAU,SAAU,SAAU,QACtE,QAAU,SAAU,SAAU,QAAU,SAAU,QAAU,QAAU,SACtE,QAAU,SAAU,SAAU,QAAU,SAAU,QAAU,QAAU,SACtE,QAAU,OAAU,OAAU,QAAU,QAAU,QAAU,SAAU,QACtE,SAAU,QAAU,QAAU,SAAU,QAAU,SAAU,SAAU,QACtE,QAAU,SAAU,SAAU,QAAU,SAAU,QAAU,QAAU,UAG9C,oBAAfC,aAA4BD,GAAQ,IAAIC,WAAWD,KAE9D,MAAMU,GAAQjB,GAAU,UAAU,SAAS5R,EAAK/2B,GACzCyV,EAAMA,OAACC,SAASqhB,KAAMA,EAAMyR,GAAazR,IAE9C,IAAIkO,OAA0B,IAAbjlC,IAA6BA,EAAW,SAEzD,IAAK,IAAIqK,EAAQ,EAAGA,EAAQ0sB,EAAIx2B,OAAQ8J,IAAS,CAC/C,MAAMg/B,EAAOtS,EAAI1sB,GACjB46B,EAA0D,UAAnDiE,GAA6B,KAArBjE,GAAO,GAAMoE,IAAiBpE,GAAO,EACrD,CAED,OAAOA,CACT,IChDA,IAAIiE,GAAQ,CACV,EAAY,WAAY,WAAY,WACpC,UAAY,WAAY,WAAY,WACpC,UAAY,WAAY,WAAY,WACpC,UAAY,WAAY,WAAY,WACpC,UAAY,WAAY,WAAY,WACpC,UAAY,WAAY,WAAY,WACpC,UAAY,WAAY,WAAY,WACpC,UAAY,WAAY,WAAY,WACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,UAAY,WAAY,WAAY,WACpC,UAAY,WAAY,WAAY,WACpC,UAAY,WAAY,WAAY,WACpC,UAAY,WAAY,WAAY,WACpC,UAAY,WAAY,WAAY,WACpC,UAAY,WAAY,WAAY,WACpC,WAAY,SAAY,WAAY,WACpC,WAAY,UAAY,WAAY,WACpC,WAAY,UAAY,WAAY,WACpC,WAAY,UAAY,WAAY,WACpC,WAAY,UAAY,WAAY,WACpC,WAAY,UAAY,WAAY,WACpC,WAAY,UAAY,WAAY,WACpC,WAAY,UAAY,WAAY,WACpC,WAAY,UAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,UAAY,WAAY,WACpC,WAAY,UAAY,WAAY,WACpC,WAAY,UAAY,WAAY,WACpC,WAAY,UAAY,WAAY,WACpC,WAAY,UAAY,WAAY,WACpC,WAAY,UAAY,WAAY,WACpC,WAAY,WAAY,SAAY,WACpC,WAAY,WAAY,SAAY,WACpC,WAAY,WAAY,UAAY,WACpC,WAAY,WAAY,UAAY,WACpC,WAAY,WAAY,UAAY,WACpC,WAAY,WAAY,UAAY,WACpC,WAAY,WAAY,UAAY,WACpC,WAAY,WAAY,UAAY,WACpC,WAAY,WAAY,UAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,UAAY,WACpC,WAAY,WAAY,UAAY,WACpC,WAAY,WAAY,UAAY,WACpC,WAAY,WAAY,UAAY,WACpC,WAAY,WAAY,UAAY,WACpC,WAAY,WAAY,UAAY,WACpC,WAAY,WAAY,WAAY,SACpC,WAAY,WAAY,WAAY,SACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,SACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,WAGZ,oBAAfC,aAA4BD,GAAQ,IAAIC,WAAWD,KAE9D,MAAMW,GAAQlB,GAAU,UAAU,SAAS5R,EAAK/2B,GACzCyV,EAAMA,OAACC,SAASqhB,KAAMA,EAAMyR,GAAazR,IAE9C,IAAIkO,EAAmB,IAAbjlC,EAAiB,GAAMA,EAEjC,IAAK,IAAIqK,EAAQ,EAAGA,EAAQ0sB,EAAIx2B,OAAQ8J,IAAS,CAC/C,MAAMg/B,EAAOtS,EAAI1sB,GACjB46B,EAAMiE,GAAqB,KAAdjE,EAAMoE,IAAiBpE,IAAQ,CAC7C,CAED,OAAOA,CACT,IChFA,IAAIiE,GAAQ,CACV,EAAY,WAAY,WAAY,WACpC,UAAY,WAAY,WAAY,WACpC,UAAY,WAAY,WAAY,WACpC,UAAY,WAAY,WAAY,WACpC,UAAY,WAAY,WAAY,WACpC,UAAY,WAAY,WAAY,WACpC,UAAY,WAAY,WAAY,WACpC,UAAY,WAAY,WAAY,WACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,UAAY,WAAY,WAAY,WACpC,UAAY,WAAY,WAAY,WACpC,UAAY,WAAY,WAAY,WACpC,UAAY,WAAY,WAAY,WACpC,UAAY,WAAY,WAAY,WACpC,UAAY,WAAY,WAAY,WACpC,WAAY,SAAY,WAAY,WACpC,WAAY,UAAY,WAAY,WACpC,WAAY,UAAY,WAAY,WACpC,WAAY,UAAY,WAAY,WACpC,WAAY,UAAY,WAAY,WACpC,WAAY,UAAY,WAAY,WACpC,WAAY,UAAY,WAAY,WACpC,WAAY,UAAY,WAAY,WACpC,WAAY,UAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,UAAY,WAAY,WACpC,WAAY,UAAY,WAAY,WACpC,WAAY,UAAY,WAAY,WACpC,WAAY,UAAY,WAAY,WACpC,WAAY,UAAY,WAAY,WACpC,WAAY,UAAY,WAAY,WACpC,WAAY,WAAY,SAAY,WACpC,WAAY,WAAY,SAAY,WACpC,WAAY,WAAY,UAAY,WACpC,WAAY,WAAY,UAAY,WACpC,WAAY,WAAY,UAAY,WACpC,WAAY,WAAY,UAAY,WACpC,WAAY,WAAY,UAAY,WACpC,WAAY,WAAY,UAAY,WACpC,WAAY,WAAY,UAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,UAAY,WACpC,WAAY,WAAY,UAAY,WACpC,WAAY,WAAY,UAAY,WACpC,WAAY,WAAY,UAAY,WACpC,WAAY,WAAY,UAAY,WACpC,WAAY,WAAY,UAAY,WACpC,WAAY,WAAY,WAAY,SACpC,WAAY,WAAY,WAAY,SACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,SACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,WAGZ,oBAAfC,aAA4BD,GAAQ,IAAIC,WAAWD,KAE9D,MAAMY,GAASnB,GAAU,OAAO,SAAS5R,EAAK/2B,GAAW,GAClDyV,EAAMA,OAACC,SAASqhB,KAAMA,EAAMyR,GAAazR,IAE9C,IAAIkO,EAAmB,IAAbjlC,EAAiB,IAAMA,EAEjC,IAAK,IAAIqK,EAAQ,EAAGA,EAAQ0sB,EAAIx2B,OAAQ8J,IAAS,CAC/C,MAAMg/B,EAAOtS,EAAI1sB,GACjB46B,EAAMiE,GAAqB,KAAdjE,EAAMoE,IAAiBpE,IAAQ,CAC7C,CAED,OAAOA,CACT,IC9DA,IAAe8E,GAAA,CACbf,QACAI,QACAE,aACAC,SACAC,cACAC,eACAC,eACAC,eACAC,SACFC,MAAEA,GACAC,qNCzBF,MAAOnZ,UAAAA,IAAapnB,IAEbsgC,MAAAA,IAASpT,GAmChB,IAAAuT,GAjCA,cAA0BrZ,GACxB,WAAA7X,CAAY9U,GACVimC,MAAMjmC,GACN8F,KAAKogC,SAAWz0B,OAAOgzB,YAAY,GACnC3+B,KAAKogC,SAASC,aAAa,EAAG,GAE9BrgC,KAAKsgC,QAAU,CAChB,CAED,UAAA3N,CAAW3F,EAAO4F,EAAUv+B,GACtB24B,IACFhtB,KAAKogC,SAAWL,GAAM/S,EAAOhtB,KAAKogC,UAClCpgC,KAAKsgC,SAAWtT,EAAMv2B,QAGxBpC,EAAS,KAAM24B,EAChB,CAED,MAAAuT,CAAO3N,GACL,MAAMwN,EAAWz0B,OAAOgzB,YAAY,GAEpC,OADAyB,EAASI,cAAcxgC,KAAKogC,WAAa,EAAG,GACrCxN,EAAWwN,EAAShpC,SAASw7B,GAAYwN,CACjD,CAED,GAAAK,GACE,OAAOzgC,KAAKugC,OAAO,OAAOG,aAC3B,CAED,IAAA1W,GACE,OAAOhqB,KAAKsgC,OACb,GClCH,MAAMK,WAACA,IAAclhC,WAEfsgC,MAACA,IAASpT,GAiDhB,ICnDAiU,GAAiB,CACfC,YAAaphC,GACbqhC,mBDEF,cAAiCH,GAC/B,WAAA3xB,CAAY9U,GACVimC,MAAMjmC,GAEN8F,KAAKogC,SAAWz0B,OAAOgzB,YAAY,GACnC3+B,KAAKogC,SAASC,aAAa,EAAG,GAE9BrgC,KAAKsgC,QAAU,EACftgC,KAAK+gC,eAAiB,CACvB,CAED,IAAA3jC,CAAK4vB,EAAO4F,GAKV,OAJI5F,IACFhtB,KAAK+gC,gBAAkB/T,EAAMv2B,QAGxB0pC,MAAM/iC,KAAK4vB,EAAO4F,EAC1B,CAED,KAAA6L,CAAMzR,EAAOgU,EAAK5sC,GAMhB,OALI44B,IACFhtB,KAAKogC,SAAWL,GAAM/S,EAAOhtB,KAAKogC,UAClCpgC,KAAKsgC,SAAWtT,EAAMv2B,QAGjB0pC,MAAM1B,MAAMzR,EAAOgU,EAAK5sC,EAChC,CAED,MAAAmsC,CAAO3N,GACL,MAAMwN,EAAWz0B,OAAOgzB,YAAY,GAEpC,OADAyB,EAASI,cAAcxgC,KAAKogC,WAAa,EAAG,GACrCxN,EAAWwN,EAAShpC,SAASw7B,GAAYwN,CACjD,CAED,GAAAK,GACE,OAAOzgC,KAAKugC,OAAO,OAAOG,aAC3B,CAED,IAAA1W,CAAKiX,GAAa,GAChB,OAAIA,EACKjhC,KAAK+gC,eAEL/gC,KAAKsgC,OAEf,2CEnDH,IAAIz7B,EAAWpF,EAAe,QAACoF,UAE3Bg8B,YAACA,GAAelU,IAChBmU,mBAACA,GAAsBnU,GAUvBuU,EAAyBx1B,EAAAnF,QAAiB,SAASrM,GACrD,KAAM8F,gBAAgBkhC,GACpB,OAAO,IAAIA,EAAuBhnC,GAGpCA,EAAU8F,KAAK9F,QAAU8F,KAAKmhC,UAAUjnC,GAExC2jC,GAAoB/nC,KAAKkK,KAAM9F,GAE/B8F,KAAKu+B,OAAS,KACdv+B,KAAKohC,SAAW,GAChBphC,KAAK89B,SAAW,CACduD,cAAe,EACfC,cAAe,EACf7F,QAAS,GACT/6B,QAAQ,EACRq9B,UAAU,EACVC,YAAY,EACZuD,WAAYrnC,EAAQqnC,WACpB/M,eAAgBt6B,EAAQs6B,eAE5B,EAEA3vB,EAASq8B,EAAwBrD,IAEjCqD,EAAuBtrC,UAAU4rC,aAAe,SAASnD,GACvDr+B,KAAKohC,SAAShkC,KAAKihC,GAEfA,EAAGpC,uBAAuBzE,sBAC5Bx3B,KAAKyhC,qBAAqBpD,GAG5Br+B,KAAK89B,SAASE,YAAa,EAC3Bh+B,KAAKu+B,OAAS,KAEVv+B,KAAK89B,SAASp9B,SAAWV,KAAK89B,SAASC,UACzC/9B,KAAKI,SAET,EAEA8gC,EAAuBtrC,UAAUqoC,cAAgB,SAASI,EAAIzZ,EAAQvwB,GAC9C,IAAlBuwB,EAAOnuB,QACT4nC,EAAGlB,UAAUtF,GAAUe,eAGzB,IAAIjU,EAAS0Z,EAAGhC,YAUhB,OARI1X,IAAWkT,GAAUe,gBACvByF,EAAGhB,QAAQzY,EAAOnuB,QAClB4nC,EAAGzB,kBAAkBhY,EAAOnuB,QAC5B4nC,EAAGxB,OAAOkD,EAAAA,YAAMd,SAASra,KAG3B5kB,KAAK0hC,sBAAsBrD,GAEvB1Z,IAAWkT,GAAUe,eACvB54B,KAAKy+B,MAAM7Z,GACX5kB,KAAKwhC,aAAanD,QAClBhqC,EAAS,KAAMgqC,IAEN1Z,IAAWkT,GAAUgB,qBAC9B74B,KAAK2hC,aAAatD,EAAIhqC,GAAUygB,IAAI8P,QAGpCvwB,EAAS,IAAIE,MAAM,sBAAwBowB,EAAS,oBAGxD,EAEAuc,EAAuBtrC,UAAUuoC,cAAgB,SAASE,EAAIzZ,EAAQvwB,GACpEgqC,EAAGpC,uBAAuBjF,mBAAkB,GAC5CqH,EAAGZ,0BAA0B5F,GAAUY,6BAEvCz4B,KAAK0hC,sBAAsBrD,GAE3B,IAAIuD,EAAQ5hC,KAAK2hC,aAAatD,EAAIhqC,GAClCuwB,EAAOxhB,KAAK,SAAS,SAAS5O,GAC5BotC,EAAM38B,KAAK,QAASzQ,GACpBotC,EAAM9sB,KACV,IACE8P,EAAOC,KAAK+c,EACd,EAEAV,EAAuBtrC,UAAUurC,UAAY,SAASU,GAgBpD,MAfiB,iBAANA,IACTA,EAAI,CAAA,GAGgB,iBAAXA,EAAEC,OACXD,EAAEC,KAAO,IAGiB,iBAAjBD,EAAEC,KAAKC,QAChBF,EAAEC,KAAKC,MAAQlK,GAAU6B,iBAG3BmI,EAAEN,aAAeM,EAAEN,WACnBM,EAAErN,iBAAmBqN,EAAErN,eAEhBqN,CACT,EAEAX,EAAuBtrC,UAAUwK,QAAU,WACzCJ,KAAK89B,SAASwD,cAAgBthC,KAAK+mB,OAEnC/mB,KAAKohC,SAAS9jC,QAAQ,SAAS+gC,GAC7Br+B,KAAKgiC,wBAAwB3D,EACjC,EAAI3mC,KAAKsI,OAEPA,KAAK89B,SAASuD,cAAgBrhC,KAAK+mB,OAAS/mB,KAAK89B,SAASwD,cAEtDthC,KAAK49B,WACP59B,KAAKiiC,8BAGPjiC,KAAKkiC,4BAELliC,KAAK89B,SAASE,YAAa,EAC3Bh+B,KAAK89B,SAASp9B,QAAS,EACvBV,KAAK89B,SAASC,UAAW,EACzB/9B,KAAK8U,KACP,EAEAosB,EAAuBtrC,UAAU0oC,gBAAkB,SAASD,IAClC,IAApBA,EAAGhC,aACLgC,EAAGlB,UAAUtF,GAAUgB,iBAGrBwF,EAAGhC,cAAgBxE,GAAUgB,kBAC/BwF,EAAGpC,uBAAuBjF,mBAAkB,GAC5CqH,EAAGZ,0BAA0B5F,GAAUY,+BAGnB,IAAlB4F,EAAGlC,WACLkC,EAAGf,QAAQ,IAAIjQ,KAAQrtB,KAAK89B,SAAStJ,gBAGvC6J,EAAG8D,SAAW,CACZrX,KAAM,EACNpS,KAAM,EACN0pB,SAAU,EAEd,EAEAlB,EAAuBtrC,UAAU+rC,aAAe,SAAStD,EAAIhqC,GAC3D,IACIR,EADUwqC,EAAGhC,cAAgBxE,GAAUgB,gBACnB,IAAIiI,EAAmB9gC,KAAK9F,QAAQ4nC,MAAQ,IAAIjB,EACpE3rC,EAAQ,KAkBZ,OAPArB,EAAQuP,KAAK,MATb,WACE,IAAIm9B,EAAS1sC,EAAQ0sC,SAAS8B,aAAa,GAC3ChE,EAAGxB,OAAO0D,GACVlC,EAAGhB,QAAQxpC,EAAQm2B,QACnBqU,EAAGzB,kBAAkB/oC,EAAQm2B,MAAK,IAClChqB,KAAKwhC,aAAanD,GAClBhqC,EAASa,EAAOmpC,EACjB,EAE+B3mC,KAAKsI,OACrCnM,EAAQuP,KAAK,SAAS,SAAS5O,GAC7BU,EAAQV,CACZ,IAEEX,EAAQgxB,KAAK7kB,KAAM,CAAE8U,KAAK,IAEnBjhB,CACT,EAEAqtC,EAAuBtrC,UAAUssC,0BAA4B,WAC3D,IAAII,EAAUtiC,KAAKohC,SAAS3qC,OACxBuzB,EAAOhqB,KAAK89B,SAASuD,cACrBta,EAAS/mB,KAAK89B,SAASwD,cAEvBthC,KAAK49B,YACP0E,EAAUzK,GAAUyB,kBACpBtP,EAAO6N,GAAU0B,YACjBxS,EAAS8Q,GAAU0B,aAIrBv5B,KAAKy+B,MAAM7H,GAAQX,aAAa4B,GAAUsB,WAG1Cn5B,KAAKy+B,MAAM5G,GAAUO,YACrBp4B,KAAKy+B,MAAM5G,GAAUO,YAGrBp4B,KAAKy+B,MAAM7H,GAAQf,cAAcyM,IACjCtiC,KAAKy+B,MAAM7H,GAAQf,cAAcyM,IAGjCtiC,KAAKy+B,MAAM7H,GAAQX,aAAajM,IAChChqB,KAAKy+B,MAAM7H,GAAQX,aAAalP,IAGhC,IAAI0U,EAAUz7B,KAAK67B,aACf0G,EAAgB52B,OAAOgxB,WAAWlB,GACtCz7B,KAAKy+B,MAAM7H,GAAQf,cAAc0M,IACjCviC,KAAKy+B,MAAMhD,EACb,EAEAyF,EAAuBtrC,UAAUqsC,4BAA8B,WAE7DjiC,KAAKy+B,MAAM7H,GAAQX,aAAa4B,GAAUuB,iBAG1Cp5B,KAAKy+B,MAAM7H,GAAQlB,cAAc,KAGjC11B,KAAKy+B,MAAM7H,GAAQf,cAAcgC,GAAUa,oBAG3C14B,KAAKy+B,MAAM7H,GAAQf,cAAcgC,GAAUa,oBAG3C14B,KAAKy+B,MAAM5G,GAAUU,WACrBv4B,KAAKy+B,MAAM5G,GAAUU,WAGrBv4B,KAAKy+B,MAAM7H,GAAQlB,cAAc11B,KAAKohC,SAAS3qC,SAC/CuJ,KAAKy+B,MAAM7H,GAAQlB,cAAc11B,KAAKohC,SAAS3qC,SAG/CuJ,KAAKy+B,MAAM7H,GAAQlB,cAAc11B,KAAK89B,SAASuD,gBAC/CrhC,KAAKy+B,MAAM7H,GAAQlB,cAAc11B,KAAK89B,SAASwD,gBAM/CthC,KAAKy+B,MAAM7H,GAAQX,aAAa4B,GAAUwB,qBAG1Cr5B,KAAKy+B,MAAM5G,GAAUU,WAGrBv4B,KAAKy+B,MAAM7H,GAAQlB,cAAc11B,KAAK89B,SAASwD,cAAgBthC,KAAK89B,SAASuD,gBAG7ErhC,KAAKy+B,MAAM7H,GAAQX,aAAa,GAClC,EAEAiL,EAAuBtrC,UAAUosC,wBAA0B,SAAS3D,GAClE,IAAInD,EAAMmD,EAAGpC,uBACTtX,EAAS0Z,EAAGhC,YACZmG,EAAUnE,EAAG8D,SAEbnY,EAAOqU,EAAGjK,UACV2M,EAAiB1C,EAAGvC,oBAExB,GAAIuC,EAAGT,WAAa4E,EAAQ1X,KAAO+M,GAAU0B,YAAa,CACxDvP,EAAO6N,GAAU0B,YACjBwH,EAAiBlJ,GAAU0B,YAE3B8E,EAAGZ,0BAA0B5F,GAAUa,mBAEvC,IAAI+J,EAAW92B,OAAO7J,OAAO,CAC3B80B,GAAQf,cAAcgC,GAAU2B,gBAChC5C,GAAQf,cAAc,IACtBe,GAAQlB,cAAc2I,EAAGjK,WACzBwC,GAAQlB,cAAc2I,EAAGvC,qBACzBlF,GAAQlB,cAAc8M,EAAQ1X,OAC7B,IAEHuT,EAAGrB,SAASyF,EACb,CAGDziC,KAAKy+B,MAAM7H,GAAQX,aAAa4B,GAAUqB,UAG1Cl5B,KAAKy+B,MAAM7H,GAAQf,cAAewI,EAAG/B,eAAiB,EAAKzE,GAAUc,iBAGrE34B,KAAKy+B,MAAM7H,GAAQf,cAAcwI,EAAG5B,8BACpCz8B,KAAKy+B,MAAMvD,EAAIvE,UAGf32B,KAAKy+B,MAAM7H,GAAQf,cAAclR,IAGjC3kB,KAAKy+B,MAAM7H,GAAQX,aAAaoI,EAAG9B,eAGnCv8B,KAAKy+B,MAAM7H,GAAQX,aAAaoI,EAAGtC,WAGnC/7B,KAAKy+B,MAAM7H,GAAQX,aAAa8K,IAChC/gC,KAAKy+B,MAAM7H,GAAQX,aAAajM,IAEhC,IAAIrS,EAAO0mB,EAAGlK,UACVsH,EAAU4C,EAAGxC,aACbP,EAAQ+C,EAAG1C,2BAEXT,EAAIvD,qBACNhgB,EAAOhM,OAAO0sB,KAAK1gB,GACnB8jB,EAAU9vB,OAAO0sB,KAAKoD,IAIxBz7B,KAAKy+B,MAAM7H,GAAQf,cAAcle,EAAKlhB,SAGtCuJ,KAAKy+B,MAAM7H,GAAQf,cAAcyF,EAAM7kC,SAGvCuJ,KAAKy+B,MAAM7H,GAAQf,cAAc4F,EAAQhlC,SAGzCuJ,KAAKy+B,MAAM5G,GAAUO,YAGrBp4B,KAAKy+B,MAAM7H,GAAQf,cAAcwI,EAAGnC,0BAGpCl8B,KAAKy+B,MAAM7H,GAAQX,aAAaoI,EAAGrC,0BAG/BwG,EAAQ1X,KAAO+M,GAAU0B,YAC3Bv5B,KAAKy+B,MAAM7H,GAAQX,aAAa4B,GAAU0B,cAE1Cv5B,KAAKy+B,MAAM7H,GAAQX,aAAauM,EAAQ1X,OAI1C9qB,KAAKy+B,MAAM9mB,GAGX3X,KAAKy+B,MAAMnD,GAGXt7B,KAAKy+B,MAAMhD,EACb,EAEAyF,EAAuBtrC,UAAU6rC,qBAAuB,SAASpD,GAE/Dr+B,KAAKy+B,MAAM7H,GAAQX,aAAa4B,GAAUoB,SAG1Cj5B,KAAKy+B,MAAM7H,GAAQX,aAAaoI,EAAGtC,WAG/BsC,EAAGT,WACL59B,KAAKy+B,MAAM7H,GAAQlB,cAAc2I,EAAGvC,sBACpC97B,KAAKy+B,MAAM7H,GAAQlB,cAAc2I,EAAGjK,cAEpCp0B,KAAKy+B,MAAM7H,GAAQX,aAAaoI,EAAGvC,sBACnC97B,KAAKy+B,MAAM7H,GAAQX,aAAaoI,EAAGjK,YAEvC,EAEA8M,EAAuBtrC,UAAU8rC,sBAAwB,SAASrD,GAChE,IAAInD,EAAMmD,EAAGpC,uBACTtX,EAAS0Z,EAAGhC,YACZ1kB,EAAO0mB,EAAGlK,UACVmH,EAAQ+C,EAAGjC,wBAEXiC,EAAGT,YACL1C,EAAIlE,mBAAkB,GACtBqH,EAAGZ,0BAA0B5F,GAAUa,oBAGrCwC,EAAIvD,qBACNhgB,EAAOhM,OAAO0sB,KAAK1gB,IAGrB0mB,EAAG8D,SAASrX,KAAO9qB,KAAK+mB,OAGxB/mB,KAAKy+B,MAAM7H,GAAQX,aAAa4B,GAAUmB,UAG1Ch5B,KAAKy+B,MAAM7H,GAAQf,cAAcwI,EAAG5B,8BACpCz8B,KAAKy+B,MAAMvD,EAAIvE,UAGf32B,KAAKy+B,MAAM7H,GAAQf,cAAclR,IAGjC3kB,KAAKy+B,MAAM7H,GAAQX,aAAaoI,EAAG9B,eAEnC8B,EAAG8D,SAASzpB,KAAO1Y,KAAK+mB,OAGpBmU,EAAI1D,sBACNx3B,KAAKy+B,MAAM5G,GAAUU,WACrBv4B,KAAKy+B,MAAM5G,GAAUU,WACrBv4B,KAAKy+B,MAAM5G,GAAUU,aAErBv4B,KAAKy+B,MAAM7H,GAAQX,aAAaoI,EAAGtC,WACnC/7B,KAAKy+B,MAAM7H,GAAQX,aAAaoI,EAAGvC,sBACnC97B,KAAKy+B,MAAM7H,GAAQX,aAAaoI,EAAGjK,aAIrCp0B,KAAKy+B,MAAM7H,GAAQf,cAAcle,EAAKlhB,SAGtCuJ,KAAKy+B,MAAM7H,GAAQf,cAAcyF,EAAM7kC,SAGvCuJ,KAAKy+B,MAAM9mB,GAGX3X,KAAKy+B,MAAMnD,GAEX+C,EAAG8D,SAASC,SAAWpiC,KAAK+mB,MAC9B,EAEAma,EAAuBtrC,UAAUimC,WAAa,SAASJ,GACrD,OAAiC,OAA1Bz7B,KAAK89B,SAASrC,QAAmBz7B,KAAK89B,SAASrC,QAAU,EAClE,EAEAyF,EAAuBtrC,UAAUgoC,QAAU,WACzC,OAAO59B,KAAK89B,SAASyD,YAAcvhC,KAAKohC,SAAS3qC,OAASohC,GAAUyB,mBAAqBt5B,KAAK89B,SAASuD,cAAgBxJ,GAAU0B,aAAev5B,KAAK89B,SAASwD,cAAgBzJ,GAAU0B,WAC1L,EAEA2H,EAAuBtrC,UAAU8mC,WAAa,SAASjB,GACrDz7B,KAAK89B,SAASrC,QAAUA,CAC1B,KChbAiH,GAAiB,CACfxO,aAAcz0B,GACdu7B,gBAAiBrO,GACjBkR,oBAAqBhR,GACrBqU,uBAAwByB;;;;;;;;ACJ1B,IAAI99B,EAAWpF,EAAe,QAACoF,SAE3Bq8B,EAAyBvU,GAA4BuU,uBACrDlG,EAAkBrO,GAA4BqO,gBAe9C4H,EAAYl3B,EAAAnF,QAAiB,SAASrM,GACxC,KAAM8F,gBAAgB4iC,GACpB,OAAO,IAAIA,EAAU1oC,IAGvBA,EAAU8F,KAAK9F,QAAUA,GAAW,CAAA,GAC5B4nC,KAAO5nC,EAAQ4nC,MAAQ,CAAA,EAE/BZ,EAAuBprC,KAAKkK,KAAM9F,GAEL,iBAAlBA,EAAQ6nC,OAAsB7nC,EAAQ6nC,OAAS,IACxD7nC,EAAQ4nC,KAAKC,MAAQ7nC,EAAQ6nC,aACtB7nC,EAAQ6nC,OAGZ7nC,EAAQqnC,YAA4C,iBAAvBrnC,EAAQ4nC,KAAKC,OAA6C,IAAvB7nC,EAAQ4nC,KAAKC,QAChF7nC,EAAQ2oC,OAAQ,GAGd3oC,EAAQuhC,SAAWvhC,EAAQuhC,QAAQhlC,OAAS,GAC9CuJ,KAAK08B,WAAWxiC,EAAQuhC,QAE5B,EAEA52B,EAAS+9B,EAAW1B,GASpB0B,EAAUhtC,UAAUktC,mBAAqB,SAASpqB,GAWhD,IAAIva,EAAsB,eAV1Bua,EAAOqM,GAAKuI,SAAS5U,EAAM,CACzBvS,KAAM,OACNwR,KAAM,KACNub,SAAU,KACVV,KAAM,KACNC,KAAM,KACNoQ,MAAO7iC,KAAK9F,QAAQ2oC,MACpBpH,QAAS,MAGMt1B,KACb48B,EAA0B,YAAdrqB,EAAKvS,KAmBrB,OAjBIuS,EAAKf,OACPe,EAAKf,KAAOoN,GAAK8I,aAAanV,EAAKf,MAE9BorB,GAAqC,MAAxBrqB,EAAKf,KAAKngB,OAAO,GAGxB2G,IACTua,EAAKf,MAAQ,MAHbxZ,GAAQ,EACRua,EAAKvS,KAAO,eAMZhI,GAAS4kC,KACXrqB,EAAKmqB,OAAQ,GAGfnqB,EAAK8Z,KAAOzN,GAAKoI,QAAQzU,EAAK8Z,MAEvB9Z,CACT,EAiBAkqB,EAAUhtC,UAAU6yB,MAAQ,SAAS7D,EAAQlM,EAAMrkB,GAOjD,GANwB,mBAAbA,IACTA,EAAW2L,KAAKo+B,mBAAmB1mC,KAAKsI,OAKxB,UAFlB0Y,EAAO1Y,KAAK8iC,mBAAmBpqB,IAEtBvS,MAAiC,cAAduS,EAAKvS,MAAsC,YAAduS,EAAKvS,KAK9D,GAAyB,iBAAduS,EAAKf,MAA0C,IAArBe,EAAKf,KAAKlhB,OAA/C,CAKA,GAAkB,YAAdiiB,EAAKvS,MAA+C,iBAAlBuS,EAAKwa,SAA3C,CAKA,IAAIzK,EAAQ,IAAIuS,EAAgBtiB,EAAKf,MA2BrC,OA1BA8Q,EAAM6U,QAAQ5kB,EAAK8Z,KAAMxyB,KAAK9F,QAAQs6B,gBAElC9b,EAAKmqB,OACPpa,EAAM0U,UAAU,GAGdzkB,EAAK+iB,QAAQhlC,OAAS,GACxBgyB,EAAMiU,WAAWhkB,EAAK+iB,SAGN,YAAd/iB,EAAKvS,MAA2C,iBAAduS,EAAK+Z,OACzC/Z,EAAK+Z,KAAO,OAGW,iBAAd/Z,EAAK+Z,OACI,YAAd/Z,EAAKvS,OACPuS,EAAK+Z,MAAQ,OAGfhK,EAAM8U,YAAY7kB,EAAK+Z,OAGP,YAAd/Z,EAAKvS,MAA+C,iBAAlBuS,EAAKwa,WACzCtO,EAASjZ,OAAO0sB,KAAK3f,EAAKwa,WAGrBgO,EAAuBtrC,UAAU6yB,MAAM3yB,KAAKkK,KAAMyoB,EAAO7D,EAAQvwB,EA7BvE,CAFCA,EAAS,IAAIE,MAAM,4EAHpB,MAFCF,EAAS,IAAIE,MAAM,qDALnBF,EAAS,IAAIE,MAAMmkB,EAAKvS,KAAO,oCA0CnC,EAQAy8B,EAAUhtC,UAAUi7B,SAAW,WAC7B7wB,KAAKU,QACP,KCpJIsiC,GAAM,SAAS9oC,GACjB,KAAM8F,gBAAgBgjC,IACpB,OAAO,IAAIA,GAAI9oC,GAGjBA,EAAU8F,KAAK9F,QAAU6qB,GAAKuI,SAASpzB,EAAS,CAC9CuhC,QAAS,GACTwH,UAAU,EACVJ,OAAO,IAGT7iC,KAAKoyB,SAAW,CACde,WAAW,EACXU,SAAS,GAGX7zB,KAAKkjC,OAAS,IAAIA,GAAOhpC,EAC3B,EAgBA8oC,GAAIptC,UAAUg8B,OAAS,SAAShN,EAAQlM,EAAMrkB,GAC5C2L,KAAKkjC,OAAOza,MAAM7D,EAAQlM,EAAMrkB,EAClC,EAKA2uC,GAAIptC,UAAUi7B,SAAW,WACvB7wB,KAAKkjC,OAAOrS,UACd,EAKAmS,GAAIptC,UAAUqO,GAAK,WACjB,OAAOjE,KAAKkjC,OAAOj/B,GAAG5G,MAAM2C,KAAKkjC,OAAQpjC,UAC3C,EAKAkjC,GAAIptC,UAAUivB,KAAO,WACnB,OAAO7kB,KAAKkjC,OAAOre,KAAKxnB,MAAM2C,KAAKkjC,OAAQpjC,UAC7C,EAKAkjC,GAAIptC,UAAU08B,OAAS,WACrB,OAAOtyB,KAAKkjC,OAAO5Q,OAAOj1B,MAAM2C,KAAKkjC,OAAQpjC,UAC/C,EAEA,IAAcqjC,GAAGH,GClFjB,MAAQr3B,OAAAA,IAAWlM,EAAiB,QAC9B2jC,GAASn7B,OAAOo7B,IAAI,cAE1B,SAASC,GAAYrW,GACnB,KAAMjtB,gBAAgBsjC,IACpB,OAAO,IAAIA,GAAWrW,GAGxBqW,GAAWC,MAAMztC,KAAKkK,KAAMitB,EAC9B,CAEAqW,GAAWC,MAAQ,SAAgBtW,GACjCt3B,OAAOuuB,eAAelkB,KAAMojC,GAAQ,CAAEj8B,OAAO,IAE7CnH,KAAKwjC,MAAQ,GACbxjC,KAAKvJ,OAAS,EAEVw2B,GACFjtB,KAAK4xB,OAAO3E,EAEhB,EAEAqW,GAAW1tC,UAAU6tC,KAAO,SAAexW,GACzC,OAAO,IAAIqW,GAAWrW,EACxB,EAEAqW,GAAW1tC,UAAU8tC,QAAU,SAAkB3c,GAC/C,GAAe,IAAXA,EACF,MAAO,CAAC,EAAG,GAGb,IAAI4c,EAAM,EAEV,IAAK,IAAI3mC,EAAI,EAAGA,EAAIgD,KAAKwjC,MAAM/sC,OAAQuG,IAAK,CAC1C,MAAM4mC,EAAKD,EAAM3jC,KAAKwjC,MAAMxmC,GAAGvG,OAC/B,GAAIswB,EAAS6c,GAAM5mC,IAAMgD,KAAKwjC,MAAM/sC,OAAS,EAC3C,MAAO,CAACuG,EAAG+pB,EAAS4c,GAEtBA,EAAMC,CACP,CACH,EAEAN,GAAW1tC,UAAUiuC,eAAiB,SAAUC,GAC9C,MAAMC,EAAWD,EAAS,GAC1B,IAAI/c,EAAS+c,EAAS,GAEtB,IAAK,IAAI9mC,EAAI,EAAGA,EAAI+mC,EAAU/mC,IAC5B+pB,GAAU/mB,KAAKwjC,MAAMxmC,GAAGvG,OAG1B,OAAOswB,CACT,EAEAuc,GAAW1tC,UAAU+zB,IAAM,SAAcppB,GACvC,GAAIA,EAAQP,KAAKvJ,QAAU8J,EAAQ,EACjC,OAGF,MAAMwmB,EAAS/mB,KAAK0jC,QAAQnjC,GAE5B,OAAOP,KAAKwjC,MAAMzc,EAAO,IAAIA,EAAO,GACtC,EAEAuc,GAAW1tC,UAAU4B,MAAQ,SAAgBlB,EAAOwe,GASlD,MARqB,iBAAVxe,GAAsBA,EAAQ,IACvCA,GAAS0J,KAAKvJ,QAGG,iBAARqe,GAAoBA,EAAM,IACnCA,GAAO9U,KAAKvJ,QAGPuJ,KAAKktB,KAAK,KAAM,EAAG52B,EAAOwe,EACnC,EAEAwuB,GAAW1tC,UAAUs3B,KAAO,SAAe8W,EAAKC,EAAUC,EAAUC,GASlE,IARwB,iBAAbD,GAAyBA,EAAW,KAC7CA,EAAW,IAGS,iBAAXC,GAAuBA,EAASnkC,KAAKvJ,UAC9C0tC,EAASnkC,KAAKvJ,QAGZytC,GAAYlkC,KAAKvJ,OACnB,OAAOutC,GAAOr4B,GAAOgqB,MAAM,GAG7B,GAAIwO,GAAU,EACZ,OAAOH,GAAOr4B,GAAOgqB,MAAM,GAG7B,MAAMzI,IAAS8W,EACTI,EAAMpkC,KAAK0jC,QAAQQ,GACnBviC,EAAMwiC,EAASD,EACrB,IAAIG,EAAQ1iC,EACR2iC,EAAUpX,GAAQ+W,GAAa,EAC/B3tC,EAAQ8tC,EAAI,GAGhB,GAAiB,IAAbF,GAAkBC,IAAWnkC,KAAKvJ,OAAQ,CAC5C,IAAKy2B,EAEH,OAA6B,IAAtBltB,KAAKwjC,MAAM/sC,OACduJ,KAAKwjC,MAAM,GACX73B,GAAO7J,OAAO9B,KAAKwjC,MAAOxjC,KAAKvJ,QAIrC,IAAK,IAAIuG,EAAI,EAAGA,EAAIgD,KAAKwjC,MAAM/sC,OAAQuG,IACrCgD,KAAKwjC,MAAMxmC,GAAGkwB,KAAK8W,EAAKM,GACxBA,GAAUtkC,KAAKwjC,MAAMxmC,GAAGvG,OAG1B,OAAOutC,CACR,CAGD,GAAIK,GAASrkC,KAAKwjC,MAAMY,EAAI,IAAI3tC,OAASH,EACvC,OAAO42B,EACHltB,KAAKwjC,MAAMY,EAAI,IAAIlX,KAAK8W,EAAKC,EAAU3tC,EAAOA,EAAQ+tC,GACtDrkC,KAAKwjC,MAAMY,EAAI,IAAI5sC,MAAMlB,EAAOA,EAAQ+tC,GAGzCnX,IAEH8W,EAAMr4B,GAAOgzB,YAAYh9B,IAG3B,IAAK,IAAI3E,EAAIonC,EAAI,GAAIpnC,EAAIgD,KAAKwjC,MAAM/sC,OAAQuG,IAAK,CAC/C,MAAMC,EAAI+C,KAAKwjC,MAAMxmC,GAAGvG,OAASH,EAEjC,KAAI+tC,EAAQpnC,GAGL,CACL+C,KAAKwjC,MAAMxmC,GAAGkwB,KAAK8W,EAAKM,EAAQhuC,EAAOA,EAAQ+tC,GAC/CC,GAAUrnC,EACV,KACD,CANC+C,KAAKwjC,MAAMxmC,GAAGkwB,KAAK8W,EAAKM,EAAQhuC,GAChCguC,GAAUrnC,EAOZonC,GAASpnC,EAEL3G,IACFA,EAAQ,EAEX,CAGD,OAAI0tC,EAAIvtC,OAAS6tC,EAAeN,EAAIxsC,MAAM,EAAG8sC,GAEtCN,CACT,EAEAV,GAAW1tC,UAAU2uC,aAAe,SAAuBjuC,EAAOwe,GAYhE,GAXAxe,EAAQA,GAAS,EACjBwe,EAAqB,iBAARA,EAAmB9U,KAAKvJ,OAASqe,EAE1Cxe,EAAQ,IACVA,GAAS0J,KAAKvJ,QAGZqe,EAAM,IACRA,GAAO9U,KAAKvJ,QAGVH,IAAUwe,EACZ,OAAO9U,KAAKyjC,OAGd,MAAMe,EAAcxkC,KAAK0jC,QAAQptC,GAC3BmuC,EAAYzkC,KAAK0jC,QAAQ5uB,GACzB4vB,EAAU1kC,KAAKwjC,MAAMhsC,MAAMgtC,EAAY,GAAIC,EAAU,GAAK,GAYhE,OAVqB,IAAjBA,EAAU,GACZC,EAAQz9B,MAERy9B,EAAQA,EAAQjuC,OAAS,GAAKiuC,EAAQA,EAAQjuC,OAAS,GAAGe,MAAM,EAAGitC,EAAU,IAGxD,IAAnBD,EAAY,KACdE,EAAQ,GAAKA,EAAQ,GAAGltC,MAAMgtC,EAAY,KAGrCxkC,KAAKyjC,KAAKiB,EACnB,EAEApB,GAAW1tC,UAAUwB,SAAW,SAAmBw7B,EAAUt8B,EAAOwe,GAClE,OAAO9U,KAAKxI,MAAMlB,EAAOwe,GAAK1d,SAASw7B,EACzC,EAEA0Q,GAAW1tC,UAAU+uC,QAAU,SAAkBN,GAI/C,GAFAA,EAAQ39B,KAAKk+B,MAAMP,GAEfQ,OAAOC,MAAMT,IAAUA,GAAS,EAAG,OAAOrkC,KAE9C,KAAOA,KAAKwjC,MAAM/sC,QAAQ,CACxB,KAAI4tC,GAASrkC,KAAKwjC,MAAM,GAAG/sC,QAIpB,CACLuJ,KAAKwjC,MAAM,GAAKxjC,KAAKwjC,MAAM,GAAGhsC,MAAM6sC,GACpCrkC,KAAKvJ,QAAU4tC,EACf,KACD,CAPCA,GAASrkC,KAAKwjC,MAAM,GAAG/sC,OACvBuJ,KAAKvJ,QAAUuJ,KAAKwjC,MAAM,GAAG/sC,OAC7BuJ,KAAKwjC,MAAM5hC,OAMd,CAED,OAAO5B,IACT,EAEAsjC,GAAW1tC,UAAUmvC,UAAY,WAC/B,MAAM7X,EAAOltB,KAAKyjC,OAElB,IAAK,IAAIzmC,EAAI,EAAGA,EAAIgD,KAAKwjC,MAAM/sC,OAAQuG,IACrCkwB,EAAK0E,OAAO5xB,KAAKwjC,MAAMxmC,IAGzB,OAAOkwB,CACT,EAEAoW,GAAW1tC,UAAUg8B,OAAS,SAAiB3E,GAC7C,GAAW,MAAPA,EACF,OAAOjtB,KAGT,GAAIitB,EAAI9T,OAENnZ,KAAKi+B,cAActyB,GAAO0sB,KAAKpL,EAAI9T,OAAQ8T,EAAI+X,WAAY/X,EAAI0P,kBAC1D,GAAIlhC,MAAMC,QAAQuxB,GACvB,IAAK,IAAIjwB,EAAI,EAAGA,EAAIiwB,EAAIx2B,OAAQuG,IAC9BgD,KAAK4xB,OAAO3E,EAAIjwB,SAEb,GAAIgD,KAAKilC,cAAchY,GAE5B,IAAK,IAAIjwB,EAAI,EAAGA,EAAIiwB,EAAIuW,MAAM/sC,OAAQuG,IACpCgD,KAAK4xB,OAAO3E,EAAIuW,MAAMxmC,QAKL,iBAARiwB,IACTA,EAAMA,EAAI71B,YAGZ4I,KAAKi+B,cAActyB,GAAO0sB,KAAKpL,IAGjC,OAAOjtB,IACT,EAEAsjC,GAAW1tC,UAAUqoC,cAAgB,SAAuBhR,GAC1DjtB,KAAKwjC,MAAMpmC,KAAK6vB,GAChBjtB,KAAKvJ,QAAUw2B,EAAIx2B,MACrB,EAEA6sC,GAAW1tC,UAAUwE,QAAU,SAAU8qC,EAAQne,EAAQ6L,GAMvD,QALiB1sB,IAAb0sB,GAA4C,iBAAX7L,IACnC6L,EAAW7L,EACXA,OAAS7gB,GAGW,mBAAXg/B,GAAyBzpC,MAAMC,QAAQwpC,GAChD,MAAM,IAAInlC,UAAU,uFA2BtB,GA1B6B,iBAAXmlC,EAChBA,EAASv5B,GAAO0sB,KAAK,CAAC6M,IACK,iBAAXA,EAChBA,EAASv5B,GAAO0sB,KAAK6M,EAAQtS,GACpB5yB,KAAKilC,cAAcC,GAC5BA,EAASA,EAAO1tC,QACPiE,MAAMC,QAAQwpC,EAAO/rB,QAC9B+rB,EAASv5B,GAAO0sB,KAAK6M,EAAO/rB,OAAQ+rB,EAAOF,WAAYE,EAAOvI,YACpDhxB,GAAOC,SAASs5B,KAC1BA,EAASv5B,GAAO0sB,KAAK6M,IAGvBne,EAAS8d,OAAO9d,GAAU,GAEtB+d,MAAM/d,KACRA,EAAS,GAGPA,EAAS,IACXA,EAAS/mB,KAAKvJ,OAASswB,GAGrBA,EAAS,IACXA,EAAS,GAGW,IAAlBme,EAAOzuC,OACT,OAAOswB,EAAS/mB,KAAKvJ,OAASuJ,KAAKvJ,OAASswB,EAG9C,MAAM+c,EAAW9jC,KAAK0jC,QAAQ3c,GAC9B,IAAIoe,EAAUrB,EAAS,GACnBsB,EAAatB,EAAS,GAG1B,KAAOqB,EAAUnlC,KAAKwjC,MAAM/sC,OAAQ0uC,IAAW,CAC7C,MAAME,EAAOrlC,KAAKwjC,MAAM2B,GAExB,KAAOC,EAAaC,EAAK5uC,QAAQ,CAG/B,GAFwB4uC,EAAK5uC,OAAS2uC,GAEfF,EAAOzuC,OAAQ,CACpC,MAAM6uC,EAAqBD,EAAKjrC,QAAQ8qC,EAAQE,GAEhD,IAA4B,IAAxBE,EACF,OAAOtlC,KAAK6jC,eAAe,CAACsB,EAASG,IAGvCF,EAAaC,EAAK5uC,OAASyuC,EAAOzuC,OAAS,CACnD,KAAa,CACL,MAAM8uC,EAAYvlC,KAAK6jC,eAAe,CAACsB,EAASC,IAEhD,GAAIplC,KAAKwlC,OAAOD,EAAWL,GACzB,OAAOK,EAGTH,GACD,CACF,CAEDA,EAAa,CACd,CAED,OAAQ,CACV,EAEA9B,GAAW1tC,UAAU4vC,OAAS,SAAUze,EAAQme,GAC9C,GAAIllC,KAAKvJ,OAASswB,EAASme,EAAOzuC,OAChC,OAAO,EAGT,IAAK,IAAIgvC,EAAe,EAAGA,EAAeP,EAAOzuC,OAAQgvC,IACvD,GAAIzlC,KAAK2pB,IAAI5C,EAAS0e,KAAkBP,EAAOO,GAC7C,OAAO,EAGX,OAAO,CACT,EAEE,WACA,MAAMC,EAAU,CACdC,aAAc,EACdC,aAAc,EACdC,YAAa,EACbC,YAAa,EACbC,YAAa,EACbC,YAAa,EACb3D,aAAc,EACd5M,aAAc,EACdwQ,YAAa,EACbC,YAAa,EACbC,aAAc,EACdnQ,aAAc,EACdoQ,SAAU,EACVC,UAAW,EACXC,UAAW,KACXC,UAAW,KACXC,WAAY,KACZC,WAAY,MAGd,IAAK,MAAMlwC,KAAKmvC,GACb,SAAUnvC,GAEP+sC,GAAW1tC,UAAUW,GADJ,OAAfmvC,EAAQnvC,GACgB,SAAUwwB,EAAQ4V,GAC1C,OAAO38B,KAAKxI,MAAMuvB,EAAQA,EAAS4V,GAAYpmC,GAAG,EAAGomC,EACtD,EAEyB,SAAU5V,GAClC,OAAO/mB,KAAKxI,MAAMuvB,EAAQA,EAAS2e,EAAQnvC,IAAIA,GAAG,EACnD,CAEJ,CAVD,CAUEA,EAEN,CAnCC,GAyCD+sC,GAAW1tC,UAAUqvC,cAAgB,SAAwBjmC,GAC3D,OAAOA,aAAaskC,IAAcA,GAAWoD,aAAa1nC,EAC5D,EAEAskC,GAAWoD,aAAe,SAAuB1nC,GAC/C,OAAY,MAALA,GAAaA,EAAEokC,GACxB,EAEA,IAAAuD,GAAiBrD,GCzYjB,MAAMsD,GAAennC,GAA2BmnB,OAIhD,SAASigB,GAAkBxyC,GACzB,KAAM2L,gBAAgB6mC,IACpB,OAAO,IAAIA,GAAiBxyC,GAG9B,GAAwB,mBAAbA,EAAyB,CAClC2L,KAAK8mC,UAAYzyC,EAEjB,MAAM0yC,EAAQ,SAAgBvyC,GACxBwL,KAAK8mC,YACP9mC,KAAK8mC,UAAUtyC,GACfwL,KAAK8mC,UAAY,KAEzB,EAAMpvC,KAAKsI,MAEPA,KAAKiE,GAAG,QAAQ,SAAiB+nB,GAC/BA,EAAI/nB,GAAG,QAAS8iC,EACtB,IACI/mC,KAAKiE,GAAG,UAAU,SAAmB+nB,GACnCA,EAAIgb,eAAe,QAASD,EAClC,IAEI1yC,EAAW,IACZ,CAEDivC,GAAWC,MAAMztC,KAAKkK,KAAM3L,GAC5BuyC,GAAa9wC,KAAKkK,KACpB,CAEA6E,EAAAA,SAASgiC,GAAkBD,IAC3BjxC,OAAOg2B,OAAOkb,GAAiBjxC,UAAW0tC,GAAW1tC,WAErDixC,GAAiBjxC,UAAU6tC,KAAO,SAAepvC,GAC/C,OAAO,IAAIwyC,GAAiBxyC,EAC9B,EAEAwyC,GAAiBjxC,UAAUqxC,OAAS,SAAiBha,EAAK2F,EAAUv+B,GAClE2L,KAAKi+B,cAAchR,GAEK,mBAAb54B,GACTA,GAEJ,EAEAwyC,GAAiBjxC,UAAUsxC,MAAQ,SAAgBld,GACjD,IAAKhqB,KAAKvJ,OACR,OAAOuJ,KAAK5C,KAAK,MAGnB4sB,EAAOtjB,KAAKiT,IAAIqQ,EAAMhqB,KAAKvJ,QAC3BuJ,KAAK5C,KAAK4C,KAAKxI,MAAM,EAAGwyB,IACxBhqB,KAAK2kC,QAAQ3a,EACf,EAEA6c,GAAiBjxC,UAAUkf,IAAM,SAAckY,GAC7C4Z,GAAahxC,UAAUkf,IAAIhf,KAAKkK,KAAMgtB,GAElChtB,KAAK8mC,YACP9mC,KAAK8mC,UAAU,KAAM9mC,KAAKxI,SAC1BwI,KAAK8mC,UAAY,KAErB,EAEAD,GAAiBjxC,UAAUuxC,SAAW,SAAmB3yC,EAAKJ,GAC5D4L,KAAKwjC,MAAM/sC,OAAS,EACpBuJ,KAAKvJ,OAAS,EACdrC,EAAGI,EACL,EAEAqyC,GAAiBjxC,UAAUqvC,cAAgB,SAAwBjmC,GACjE,OAAOA,aAAa6nC,IAAoB7nC,aAAaskC,IAAcuD,GAAiBH,aAAa1nC,EACnG,EAEA6nC,GAAiBH,aAAepD,GAAWoD,aAE3C,IAAAU,GAAiBP,GACjBQ,GAAkCR,GAClCF,GAA4BrD,2CCnF5B,IAAI3N,GAAQhqB,OAAOgqB,MAIf2R,GAAc,IAAIC,WAAW,GAC7BC,GAAc77B,OAAO0sB,KAAK,UAAa,UACvCoP,GAAY97B,OAAO0sB,KAAK,KAAM,UAC9BqP,GAAY/7B,OAAO0sB,KAAK,SAAa,UACrCsP,GAAUh8B,OAAO0sB,KAAK,MAAY,UAClCuP,GAAOC,SAAS,OAAQ,GACxBC,GAAe,IAsEf1tC,GAAU,SAAU2tC,EAAOC,EAAKjhB,EAAQjS,GAC1C,KAAOiS,EAASjS,EAAKiS,IACnB,GAAIghB,EAAMhhB,KAAYihB,EAAK,OAAOjhB,EAEpC,OAAOjS,CACT,EAEImzB,GAAQ,SAAUF,GAEpB,IADA,IAAIG,EAAM,IACDlrC,EAAI,EAAGA,EAAI,IAAKA,IAAKkrC,GAAOH,EAAM/qC,GAC3C,IAAK,IAAI4H,EAAI,IAAKA,EAAI,IAAKA,IAAKsjC,GAAOH,EAAMnjC,GAC7C,OAAOsjC,CACT,EAEIC,GAAY,SAAUt0B,EAAK5T,GAE7B,OADA4T,EAAMA,EAAIzc,SAAS,IACXX,OAASwJ,EA7FN,sBA6FuBzI,MAAM,EAAGyI,GAAK,IA9FtC,sBA+FQzI,MAAM,EAAGyI,EAAI4T,EAAIpd,QAAUod,EAAM,GACrD,EAgCA,IAAIu0B,GAAY,SAAUv0B,EAAKkT,EAAQtwB,GAKrC,GAAkB,KAJlBod,EAAMA,EAAIrc,MAAMuvB,EAAQA,EAAStwB,IACjCswB,EAAS,GAIP,OA/BJ,SAAmBkG,GAGjB,IAAIob,EACJ,GAAe,MAAXpb,EAAI,GAAaob,GAAW,MAC3B,IAAe,MAAXpb,EAAI,GACR,OAAO,KADcob,GAAW,CACzB,CAIZ,IADA,IAAIC,EAAQ,GACHtrC,EAAIiwB,EAAIx2B,OAAS,EAAGuG,EAAI,EAAGA,IAAK,CACvC,IAAIuiC,EAAOtS,EAAIjwB,GACXqrC,EAAUC,EAAMlrC,KAAKmiC,GACpB+I,EAAMlrC,KAAK,IAAOmiC,EACxB,CAED,IAAI2I,EAAM,EACNjrC,EAAIqrC,EAAM7xC,OACd,IAAKuG,EAAI,EAAGA,EAAIC,EAAGD,IACjBkrC,GAAOI,EAAMtrC,GAAK0J,KAAK6hC,IAAI,IAAKvrC,GAGlC,OAAOqrC,EAAWH,GAAO,EAAIA,CAC/B,CAQWM,CAAS30B,GAGhB,KAAOkT,EAASlT,EAAIpd,QAA0B,KAAhBod,EAAIkT,IAAgBA,IAElD,IADA,IAAIjS,EA/HI,SAAUvU,EAAOoB,EAAK8mC,GAChC,MAAqB,iBAAVloC,EAA2BkoC,GACtCloC,IAAUA,IACGoB,EAAYA,EACrBpB,GAAS,IACbA,GAASoB,IACI,EAFUpB,EAGhB,CACT,CAuHcmoC,CAAMtuC,GAAQyZ,EAAK,GAAIkT,EAAQlT,EAAIpd,QAASod,EAAIpd,OAAQod,EAAIpd,QAC/DswB,EAASjS,GAAuB,IAAhBjB,EAAIkT,IAAeA,IAC1C,OAAIjS,IAAQiS,EAAe,EACpB8gB,SAASh0B,EAAIrc,MAAMuvB,EAAQjS,GAAK1d,WAAY,EAEvD,EAEIuxC,GAAY,SAAU90B,EAAKkT,EAAQtwB,EAAQm8B,GAC7C,OAAO/e,EAAIrc,MAAMuvB,EAAQ3sB,GAAQyZ,EAAK,EAAGkT,EAAQA,EAAStwB,IAASW,SAASw7B,EAC9E,EAEIgW,GAAY,SAAU7a,GACxB,IAAIpsB,EAAMgK,OAAOgxB,WAAW5O,GACxB8a,EAASniC,KAAKoiC,MAAMpiC,KAAKmX,IAAIlc,GAAO+E,KAAKmX,IAAI,KAAO,EAGxD,OAFIlc,EAAMknC,GAAUniC,KAAK6hC,IAAI,GAAIM,IAASA,IAElClnC,EAAMknC,EAAU9a,CAC1B,KAEyB,SAAUd,EAAK2F,GACtC,OAAO+V,GAAU1b,EAAK,EAAGA,EAAIx2B,OAAQm8B,EACvC,KAEoB,SAAUhT,GAC5B,IAAI/oB,EAAS,GACT+oB,EAAKjI,OAAM9gB,GAAU+xC,GAAU,SAAWhpB,EAAKjI,KAAO,OACtDiI,EAAKsT,WAAUr8B,GAAU+xC,GAAU,aAAehpB,EAAKsT,SAAW,OACtE,IAAI6V,EAAMnpB,EAAKmpB,IACf,GAAIA,EACF,IAAK,IAAI5lC,KAAO4lC,EACdlyC,GAAU+xC,GAAU,IAAMzlC,EAAM,IAAM4lC,EAAI5lC,GAAO,MAGrD,OAAOwI,OAAO0sB,KAAKxhC,EACrB,KAEoB,SAAUo2B,GAG5B,IAFA,IAAIp2B,EAAS,CAAE,EAERo2B,EAAIx2B,QAAQ,CAEjB,IADA,IAAIuG,EAAI,EACDA,EAAIiwB,EAAIx2B,QAAqB,KAAXw2B,EAAIjwB,IAAWA,IACxC,IAAI2E,EAAMkmC,SAAS5a,EAAIz1B,MAAM,EAAGwF,GAAG5F,WAAY,IAC/C,IAAKuK,EAAK,OAAO9K,EAEjB,IAAImI,EAAIiuB,EAAIz1B,MAAMwF,EAAI,EAAG2E,EAAM,GAAGvK,WAC9B4xC,EAAWhqC,EAAE5E,QAAQ,KACzB,IAAkB,IAAd4uC,EAAiB,OAAOnyC,EAC5BA,EAAOmI,EAAExH,MAAM,EAAGwxC,IAAahqC,EAAExH,MAAMwxC,EAAW,GAElD/b,EAAMA,EAAIz1B,MAAMmK,EACjB,CAED,OAAO9K,CACT,KAEiB,SAAU+oB,GACzB,IAAIqN,EAAM0I,GAAM,KACZhe,EAAOiI,EAAKjI,KACZ/W,EAAS,GAGb,GADsB,IAAlBgf,EAAKqpB,UAA4C,MAA1BtxB,EAAKA,EAAKlhB,OAAS,KAAYkhB,GAAQ,KAC9DhM,OAAOgxB,WAAWhlB,KAAUA,EAAKlhB,OAAQ,OAAO,KAEpD,KAAOkV,OAAOgxB,WAAWhlB,GAAQ,KAAK,CACpC,IAAI3a,EAAI2a,EAAKvd,QAAQ,KACrB,IAAW,IAAP4C,EAAU,OAAO,KACrB4D,GAAUA,EAAS,IAAM+W,EAAKngB,MAAM,EAAGwF,GAAK2a,EAAKngB,MAAM,EAAGwF,GAC1D2a,EAAOA,EAAKngB,MAAMwF,EAAI,EACvB,CAED,OAAI2O,OAAOgxB,WAAWhlB,GAAQ,KAAOhM,OAAOgxB,WAAW/7B,GAAU,KAC7Dgf,EAAKsT,UAAYvnB,OAAOgxB,WAAW/c,EAAKsT,UAAY,IADqB,MAG7EjG,EAAIwR,MAAM9mB,GACVsV,EAAIwR,MAAM0J,GAAUvoB,EAAK6S,KAAOmV,GAAM,GAAI,KAC1C3a,EAAIwR,MAAM0J,GAAUvoB,EAAKgI,IAAK,GAAI,KAClCqF,EAAIwR,MAAM0J,GAAUvoB,EAAKspB,IAAK,GAAI,KAClCjc,EAAIwR,MAAM0J,GAAUvoB,EAAKoK,KAAM,IAAK,KACpCiD,EAAIwR,MAAM0J,GAAWvoB,EAAK8S,MAAMyJ,UAAY,IAAQ,EAAG,IAAK,KAE5DlP,EAAI,KAAOqa,GAtKI,SAAUxQ,GACzB,OAAQA,GACN,IAAK,OACH,OAAO,EACT,IAAK,OACH,OAAO,EACT,IAAK,UACH,OAAO,EACT,IAAK,mBACH,OAAO,EACT,IAAK,eACH,OAAO,EACT,IAAK,YACH,OAAO,EACT,IAAK,OACH,OAAO,EACT,IAAK,kBACH,OAAO,EACT,IAAK,aACH,OAAO,GAGX,OAAO,CACT,CA+I2BqS,CAAWvpB,EAAKzZ,MAErCyZ,EAAKsT,UAAUjG,EAAIwR,MAAM7e,EAAKsT,SAAU,KAE5CsU,GAAYta,KAAKD,EAAK6a,IACtBL,GAAUva,KAAKD,EAvNI,KAwNfrN,EAAKwpB,OAAOnc,EAAIwR,MAAM7e,EAAKwpB,MAAO,KAClCxpB,EAAKypB,OAAOpc,EAAIwR,MAAM7e,EAAKypB,MAAO,KACtCpc,EAAIwR,MAAM0J,GAAUvoB,EAAK0pB,UAAY,EAAG,GAAI,KAC5Crc,EAAIwR,MAAM0J,GAAUvoB,EAAK2pB,UAAY,EAAG,GAAI,KAExC3oC,GAAQqsB,EAAIwR,MAAM79B,EAAQ,KAE9BqsB,EAAIwR,MAAM0J,GAAUF,GAAMhb,GAAM,GAAI,KAE7BA,EACT,KAEiB,SAAUA,EAAKuc,GAC9B,IAAIP,EAAwB,IAAbhc,EAAI,KAAa,EAAIA,EAAI,KAAOqa,GAE3C3vB,EAAOgxB,GAAU1b,EAAK,EAAG,IAAKuc,GAC9B/W,EAAO2V,GAAUnb,EAAK,IAAK,GAC3BrF,EAAMwgB,GAAUnb,EAAK,IAAK,GAC1Bic,EAAMd,GAAUnb,EAAK,IAAK,GAC1BjD,EAAOoe,GAAUnb,EAAK,IAAK,IAC3ByF,EAAQ0V,GAAUnb,EAAK,IAAK,IAC5B9mB,EAjOO,SAAU2wB,GACrB,OAAQA,GACN,KAAK,EACH,MAAO,OACT,KAAK,EACH,MAAO,OACT,KAAK,EACH,MAAO,UACT,KAAK,EACH,MAAO,mBACT,KAAK,EACH,MAAO,eACT,KAAK,EACH,MAAO,YACT,KAAK,EACH,MAAO,OACT,KAAK,EACH,MAAO,kBACT,KAAK,GACH,MAAO,aACT,KAAK,GACH,MAAO,oBACT,KAAK,GACH,MAAO,qBACT,KAAK,GACL,KAAK,GACH,MAAO,gBAGX,OAAO,IACT,CAmMa2S,CAAOR,GACd/V,EAAwB,IAAbjG,EAAI,KAAa,KAAO0b,GAAU1b,EAAK,IAAK,IAAKuc,GAC5DJ,EAAQT,GAAU1b,EAAK,IAAK,IAC5Boc,EAAQV,GAAU1b,EAAK,IAAK,IAC5Bqc,EAAWlB,GAAUnb,EAAK,IAAK,GAC/Bsc,EAAWnB,GAAUnb,EAAK,IAAK,GAE/BnvB,EAAImqC,GAAMhb,GAGd,GAAU,MAANnvB,EAAc,OAAO,KAGzB,GAAIA,IAAMsqC,GAAUnb,EAAK,IAAK,GAAI,MAAM,IAAI14B,MAAM,+EAElD,GAAiE,IAA7DizC,GAAYkC,QAAQzc,EAAK6a,GAAcA,KAGrC7a,EAAI,OAAMtV,EAAOgxB,GAAU1b,EAAK,IAAK,IAAKuc,GAAoB,IAAM7xB,QACnE,GAA+D,IAA3D+vB,GAAUgC,QAAQzc,EAAK6a,GAAcA,MACwB,IAA7DH,GAAQ+B,QAAQzc,EAjQR,IAiQ6B0c,KAI9C,MAAM,IAAIp1C,MAAM,uCAMlB,OAFiB,IAAb00C,GAAkBtxB,GAAkC,MAA1BA,EAAKA,EAAKlhB,OAAS,KAAYwyC,EAAW,GAEjE,CACLtxB,OACA8a,OACA7K,MACAshB,MACAlf,OACA0I,MAAO,IAAIrF,KAAK,IAAOqF,GACvBvsB,OACA+sB,WACAkW,QACAC,QACAC,WACAC,WAEJ,EChSI/kB,GAAW/kB,GAA2B+kB,SACtCH,GAAc5kB,GAA2B4kB,YAEzC9Z,GAAO,WAAc,EAErBq/B,GAAW,SAAU5f,GAEvB,OADAA,GAAQ,MACO,IAAMA,CACvB,EAgBI6f,GAAS,SAAU7vC,EAAM+sB,GAC3B/mB,KAAK8pC,QAAU9vC,EACfgG,KAAK+mB,OAASA,EACd1C,GAAYvuB,KAAKkK,KAAM,CAAE+pC,aAAa,GACxC,EAEAhlB,EAAAA,QAAKlgB,SAASglC,GAAQxlB,IAEtBwlB,GAAOj0C,UAAUo0C,QAAU,SAAUx1C,GACnCwL,KAAK8pC,QAAQE,QAAQx1C,EACvB,EAEA,IAAIy1C,GAAU,SAAUrqB,GACtB,KAAM5f,gBAAgBiqC,IAAU,OAAO,IAAIA,GAAQrqB,GACnD4E,GAAS1uB,KAAKkK,KAAM4f,GAEpBA,EAAOA,GAAQ,CAAE,EAEjB5f,KAAK0jC,QAAU,EACf1jC,KAAKkqC,QAAU9C,KACfpnC,KAAKmqC,SAAW,EAChBnqC,KAAKoqC,UAAW,EAChBpqC,KAAKqqC,SAAW9/B,GAChBvK,KAAKsqC,QAAU,KACftqC,KAAKuqC,QAAU,KACfvqC,KAAKwqC,UAAY,KACjBxqC,KAAKyqC,IAAM,KACXzqC,KAAK0qC,SAAU,EACf1qC,KAAK2qC,YAAa,EAClB3qC,KAAK4qC,KAAO,KACZ5qC,KAAK6qC,WAAa,KAClB7qC,KAAK8qC,aAAe,KACpB9qC,KAAK+qC,iBAAmB,KAExB,IAAI/wC,EAAOgG,KACPhB,EAAIhF,EAAKkwC,QAETc,EAAa,WACfhxC,EAAKixC,WACN,EAEGC,EAAW,SAAU12C,GAEvB,GADAwF,EAAK0wC,SAAU,EACXl2C,EAAK,OAAOwF,EAAKgwC,QAAQx1C,GACxBwF,EAAKuwC,SAASS,GACpB,EAEGG,EAAc,WAChBnxC,EAAKuwC,QAAU,KACf,IAAIxxB,EAAQ6wB,GAAS5vC,EAAKswC,QAAQtgB,MAC9BjR,EAAO/e,EAAKoxC,OAAOryB,EAAOsyB,GACzBrxC,EAAKoxC,OAAO,IAAKE,GACjBtxC,EAAK0wC,SAASM,GACpB,EAEGK,EAAU,WACZrxC,EAAKkwC,QAAQvF,QAAQiF,GAAS5vC,EAAKswC,QAAQtgB,OAC3ChwB,EAAKoxC,OAAO,IAAKE,GACjBN,GACD,EAEGO,EAAoB,WACtB,IAAIvhB,EAAOhwB,EAAKswC,QAAQtgB,KACxBhwB,EAAK6wC,WAAaW,GAAkBxsC,EAAExH,MAAM,EAAGwyB,IAC/ChrB,EAAE2lC,QAAQ3a,GACVmhB,GACD,EAEGM,EAAc,WAChB,IAAIzhB,EAAOhwB,EAAKswC,QAAQtgB,KACxBhwB,EAAK4wC,KAAOY,GAAkBxsC,EAAExH,MAAM,EAAGwyB,IACrChwB,EAAK6wC,aAAY7wC,EAAK4wC,KAAOj1C,OAAOg2B,OAAO,CAAA,EAAI3xB,EAAK6wC,WAAY7wC,EAAK4wC,OACzE5rC,EAAE2lC,QAAQ3a,GACVmhB,GACD,EAEGO,EAAgB,WAClB,IAAI1hB,EAAOhwB,EAAKswC,QAAQtgB,KACxBhqB,KAAK8qC,aAAeU,GAAuBxsC,EAAExH,MAAM,EAAGwyB,GAAOpK,EAAK4pB,kBAClExqC,EAAE2lC,QAAQ3a,GACVmhB,GACD,EAEGQ,EAAoB,WACtB,IAAI3hB,EAAOhwB,EAAKswC,QAAQtgB,KACxBhqB,KAAK+qC,iBAAmBS,GAAuBxsC,EAAExH,MAAM,EAAGwyB,GAAOpK,EAAK4pB,kBACtExqC,EAAE2lC,QAAQ3a,GACVmhB,GACD,EAEGG,EAAW,WACb,IACIM,EADA7kB,EAAS/sB,EAAK0pC,QAElB,IACEkI,EAAS5xC,EAAKswC,QAAUkB,GAAexsC,EAAExH,MAAM,EAAG,KAAMooB,EAAK4pB,iBAC9D,CAAC,MAAOh1C,GACPwF,EAAKiL,KAAK,QAASzQ,EACpB,CAGD,OAFAwK,EAAE2lC,QAAQ,KAELiH,EAKe,kBAAhBA,EAAOzlC,MACTnM,EAAKoxC,OAAOQ,EAAO5hB,KAAM0hB,QACzBV,KAGkB,uBAAhBY,EAAOzlC,MACTnM,EAAKoxC,OAAOQ,EAAO5hB,KAAM2hB,QACzBX,KAGkB,sBAAhBY,EAAOzlC,MACTnM,EAAKoxC,OAAOQ,EAAO5hB,KAAMuhB,QACzBP,KAGkB,eAAhBY,EAAOzlC,MACTnM,EAAKoxC,OAAOQ,EAAO5hB,KAAMyhB,QACzBT,MAIEhxC,EAAK8wC,eACPc,EAAOj0B,KAAO3d,EAAK8wC,aACnB9wC,EAAK8wC,aAAe,MAGlB9wC,EAAK+wC,mBACPa,EAAO1Y,SAAWl5B,EAAK+wC,iBACvB/wC,EAAK+wC,iBAAmB,MAGtB/wC,EAAK4wC,OACP5wC,EAAKswC,QAAUsB,EAjJN,SAAUA,EAAQ7C,GAK/B,OAJIA,EAAI7vC,OAAM0yC,EAAOj0B,KAAOoxB,EAAI7vC,MAC5B6vC,EAAI8C,WAAUD,EAAO1Y,SAAW6V,EAAI8C,UACpC9C,EAAI/e,OAAM4hB,EAAO5hB,KAAO6d,SAASkB,EAAI/e,KAAM,KAC/C4hB,EAAO7C,IAAMA,EACN6C,CACT,CA2I8BE,CAASF,EAAQ5xC,EAAK4wC,MAC9C5wC,EAAK4wC,KAAO,MAGd5wC,EAAK0wC,SAAU,EAEVkB,EAAO5hB,MAAwB,cAAhB4hB,EAAOzlC,MAM3BnM,EAAKuwC,QAAU,IAAIV,GAAO7vC,EAAM+sB,GAEhC/sB,EAAKiL,KAAK,QAAS2mC,EAAQ5xC,EAAKuwC,QAASW,GACzClxC,EAAKoxC,OAAOQ,EAAO5hB,KAAMmhB,QACzBH,MATEhxC,EAAKoxC,OAAO,IAAKE,QACjBtxC,EAAKiL,KAAK,QAAS2mC,EA/JP,SAAU5xC,EAAM+sB,GAChC,IAAIglB,EAAI,IAAIlC,GAAO7vC,EAAM+sB,GAEzB,OADAglB,EAAEj3B,MACKi3B,CACT,CA2JiCC,CAAYhyC,EAAM+sB,GAASmkB,MA5CtDlxC,EAAKoxC,OAAO,IAAKE,QACjBN,IAoDH,EAEDhrC,KAAKisC,UAAYX,EACjBtrC,KAAKorC,OAAO,IAAKE,EACnB,EAEAvmB,EAAAA,QAAKlgB,SAASolC,GAASzlB,IAEvBylB,GAAQr0C,UAAUo0C,QAAU,SAAUx1C,GAChCwL,KAAK2qC,aACT3qC,KAAK2qC,YAAa,EAEdn2C,GAAKwL,KAAKiF,KAAK,QAASzQ,GAC5BwL,KAAKiF,KAAK,SACNjF,KAAKuqC,SAASvqC,KAAKuqC,QAAQtlC,KAAK,SACtC,EAEAglC,GAAQr0C,UAAUw1C,OAAS,SAAUphB,EAAMkiB,GACrClsC,KAAK2qC,aACT3qC,KAAK0jC,SAAW1Z,EAChBhqB,KAAKmqC,SAAWngB,EACZkiB,IAAYlsC,KAAKisC,YAAWjsC,KAAKoqC,UAAW,GAChDpqC,KAAKqqC,SAAW6B,EAClB,EAEAjC,GAAQr0C,UAAUq1C,UAAY,WAC5B,IAAIjrC,KAAK2qC,WAAT,CACA,IAAIv2C,EAAK4L,KAAKyqC,IACdzqC,KAAKyqC,IAAMlgC,GACPvK,KAAKwqC,UAAWxqC,KAAKinC,OAAOjnC,KAAKwqC,eAAWtkC,EAAW9R,GACtDA,GAJgB,CAKvB,EAEA61C,GAAQr0C,UAAUqxC,OAAS,SAAUvuB,EAAMsoB,EAAK5sC,GAC9C,IAAI4L,KAAK2qC,WAAT,CAEA,IAAIoB,EAAI/rC,KAAKuqC,QACTvrC,EAAIgB,KAAKkqC,QACTiC,EAAUnsC,KAAKmqC,SAKnB,GAJIzxB,EAAKjiB,SAAQuJ,KAAKoqC,UAAW,GAI7B1xB,EAAKjiB,OAAS01C,EAGhB,OAFAnsC,KAAKmqC,UAAYzxB,EAAKjiB,OACtBuJ,KAAKwqC,UAAY,KACbuB,EAAUA,EAAEtN,MAAM/lB,EAAMtkB,IAC5B4K,EAAE4yB,OAAOlZ,GACFtkB,KAKT4L,KAAKyqC,IAAMr2C,EACX4L,KAAKmqC,SAAW,EAEhB,IAAIP,EAAW,KACXlxB,EAAKjiB,OAAS01C,IAChBvC,EAAWlxB,EAAKlhB,MAAM20C,GACtBzzB,EAAOA,EAAKlhB,MAAM,EAAG20C,IAGnBJ,EAAGA,EAAEj3B,IAAI4D,GACR1Z,EAAE4yB,OAAOlZ,GAEd1Y,KAAKwqC,UAAYZ,EACjB5pC,KAAKqqC,UAhCgB,CAiCvB,EAEAJ,GAAQr0C,UAAUw2C,OAAS,SAAUh4C,GACnC,GAAI4L,KAAKoqC,SAAU,OAAOpqC,KAAKgqC,QAAQ,IAAIz1C,MAAM,2BACjDH,GACF,EAEA,IAAAi4C,GAAiBpC,GC7PbtU,GAAQhqB,OAAOgqB,MAEfpR,GAAW9kB,GAA2B8kB,SACtCC,GAAW/kB,GAA2B+kB,SACtC8nB,GAAgB3f,EAAyB,QAAC2f,cAI1CC,GAAQ1E,SAAS,MAAO,GACxB2E,GAAQ3E,SAAS,MAAO,GAExB4E,GAAa9W,GAAM,MAEnBprB,GAAO,WAAc,EAErBq/B,GAAW,SAAU5vC,EAAMgwB,IAC7BA,GAAQ,MACEhwB,EAAKoD,KAAKqvC,GAAWj1C,MAAM,EAAG,IAAMwyB,GAChD,EAcA,IAAI0iB,GAAO,SAAUC,GACnBnoB,GAAS1uB,KAAKkK,MACdA,KAAK4sC,QAAU,EACf5sC,KAAK6sC,IAAMF,EACX3sC,KAAK2qC,YAAa,CACpB,EAEA9lC,EAAAA,SAAS6nC,GAAMloB,IAEfkoB,GAAK92C,UAAUqxC,OAAS,SAAUvuB,EAAMsoB,EAAK5sC,GAE3C,GADA4L,KAAK4sC,SAAWl0B,EAAKjiB,OACjBuJ,KAAK6sC,IAAIzvC,KAAKsb,GAAO,OAAOtkB,IAChC4L,KAAK6sC,IAAIC,OAAS14C,CACpB,EAEAs4C,GAAK92C,UAAUo0C,QAAU,WACnBhqC,KAAK2qC,aACT3qC,KAAK2qC,YAAa,EAClB3qC,KAAKiF,KAAK,SACZ,EAEA,IAAI8nC,GAAW,WACbvoB,GAAS1uB,KAAKkK,MACdA,KAAKkzB,SAAW,GAChBlzB,KAAKgtC,SAAW,IAAIV,GAAc,SAClCtsC,KAAK2qC,YAAa,CACpB,EAEA9lC,EAAAA,SAASkoC,GAAUvoB,IAEnBuoB,GAASn3C,UAAUqxC,OAAS,SAAUvuB,EAAMsoB,EAAK5sC,GAC/C4L,KAAKkzB,UAAYlzB,KAAKgtC,SAASvO,MAAM/lB,GACrCtkB,GACF,EAEA24C,GAASn3C,UAAUo0C,QAAU,WACvBhqC,KAAK2qC,aACT3qC,KAAK2qC,YAAa,EAClB3qC,KAAKiF,KAAK,SACZ,EAEA,IAAIgoC,GAAO,WACTzoB,GAAS1uB,KAAKkK,MACdA,KAAK2qC,YAAa,CACpB,EAEA9lC,EAAAA,SAASooC,GAAMzoB,IAEfyoB,GAAKr3C,UAAUqxC,OAAS,SAAUvuB,EAAMsoB,EAAK5sC,GAC3CA,EAAG,IAAIG,MAAM,kCACf,EAEA04C,GAAKr3C,UAAUo0C,QAAU,WACnBhqC,KAAK2qC,aACT3qC,KAAK2qC,YAAa,EAClB3qC,KAAKiF,KAAK,SACZ,EAEA,IAAIioC,GAAO,SAAUttB,GACnB,KAAM5f,gBAAgBktC,IAAO,OAAO,IAAIA,GAAKttB,GAC7C2E,GAASzuB,KAAKkK,KAAM4f,GAEpB5f,KAAK8sC,OAASviC,GACdvK,KAAKmtC,YAAa,EAClBntC,KAAKotC,aAAc,EACnBptC,KAAK2qC,YAAa,EAClB3qC,KAAKuqC,QAAU,IACjB,EAEA1lC,EAAAA,SAASqoC,GAAM3oB,IAEf2oB,GAAKt3C,UAAU6yB,MAAQ,SAAUmjB,EAAQzyB,EAAQ9kB,GAC/C,GAAI2L,KAAKuqC,QAAS,MAAM,IAAIh2C,MAAM,2BAClC,IAAIyL,KAAKmtC,aAAcntC,KAAK2qC,WAA5B,CAEsB,mBAAXxxB,IACT9kB,EAAW8kB,EACXA,EAAS,MAGN9kB,IAAUA,EAAWkW,IAE1B,IAAIvQ,EAAOgG,KAUX,GARK4rC,EAAO5hB,MAAwB,YAAhB4hB,EAAOzlC,OAAoBylC,EAAO5hB,KAAO,GACxD4hB,EAAOzlC,OAAMylC,EAAOzlC,KAjG3B,SAAqBssB,GACnB,OAAQA,EAAOoF,EAAAA,YAAUqC,QACvB,KAAKrC,EAASwV,YAAC/S,QAAS,MAAO,eAC/B,KAAKzC,EAASwV,YAACjT,QAAS,MAAO,mBAC/B,KAAKvC,EAASwV,YAAChT,QAAS,MAAO,YAC/B,KAAKxC,EAASwV,YAAClT,QAAS,MAAO,OAC/B,KAAKtC,EAASwV,YAAC7S,QAAS,MAAO,UAGjC,MAAO,MACT,CAuFkC8S,CAAW1B,EAAOnZ,OAC7CmZ,EAAOnZ,OAAMmZ,EAAOnZ,KAAuB,cAAhBmZ,EAAOzlC,KAAuBomC,GAAQC,IACjEZ,EAAOhkB,MAAKgkB,EAAOhkB,IAAM,GACzBgkB,EAAO1C,MAAK0C,EAAO1C,IAAM,GACzB0C,EAAOlZ,QAAOkZ,EAAOlZ,MAAQ,IAAIrF,MAEhB,iBAAXlU,IAAqBA,EAASxN,OAAO0sB,KAAKlf,IACjDxN,OAAOC,SAASuN,GAAS,CAC3ByyB,EAAO5hB,KAAO7Q,EAAO1iB,OACrBuJ,KAAKutC,QAAQ3B,GACb,IAAIjzC,EAAKqH,KAAK5C,KAAK+b,GAInB,OAHAywB,GAAS5vC,EAAM4xC,EAAO5hB,MAClBrxB,EAAI9E,QAAQ4D,SAASpD,GACpB2L,KAAK8sC,OAASz4C,EACZ,IAAI44C,EACZ,CAED,GAAoB,YAAhBrB,EAAOzlC,OAAuBylC,EAAO1Y,SAAU,CACjD,IAAIsa,EAAW,IAAIT,GAYnB,OAXAU,cAAID,GAAU,SAAUh5C,GACtB,GAAIA,EAEF,OADAwF,EAAKgwC,UACE31C,EAASG,GAGlBo3C,EAAO1Y,SAAWsa,EAASta,SAC3Bl5B,EAAKuzC,QAAQ3B,GACbv3C,GACN,IAEWm5C,CACR,CAID,GAFAxtC,KAAKutC,QAAQ3B,GAEO,SAAhBA,EAAOzlC,MAAmC,oBAAhBylC,EAAOzlC,KAEnC,OADAtS,QAAQ4D,SAASpD,GACV,IAAI44C,GAGb,IAAIS,EAAO,IAAIhB,GAAK1sC,MAsBpB,OApBAA,KAAKuqC,QAAUmD,EAEfD,cAAIC,GAAM,SAAUl5C,GAGlB,OAFAwF,EAAKuwC,QAAU,KAEX/1C,GACFwF,EAAKgwC,UACE31C,EAASG,IAGdk5C,EAAKd,UAAYhB,EAAO5hB,MAC1BhwB,EAAKgwC,UACE31C,EAAS,IAAIE,MAAM,oBAG5Bq1C,GAAS5vC,EAAM4xC,EAAO5hB,MAClBhwB,EAAKozC,aAAapzC,EAAK62B,gBAC3Bx8B,IACJ,IAESq5C,CA1EiC,CA2E1C,EAEAR,GAAKt3C,UAAUi7B,SAAW,WACpB7wB,KAAKuqC,QACPvqC,KAAKotC,aAAc,EAIjBptC,KAAKmtC,aACTntC,KAAKmtC,YAAa,EAClBntC,KAAK5C,KAAKqvC,IACVzsC,KAAK5C,KAAK,MACZ,EAEA8vC,GAAKt3C,UAAUo0C,QAAU,SAAUx1C,GAC7BwL,KAAK2qC,aACT3qC,KAAK2qC,YAAa,EAEdn2C,GAAKwL,KAAKiF,KAAK,QAASzQ,GAC5BwL,KAAKiF,KAAK,SACNjF,KAAKuqC,SAAWvqC,KAAKuqC,QAAQP,SAAShqC,KAAKuqC,QAAQP,UACzD,EAEAkD,GAAKt3C,UAAU23C,QAAU,SAAU3B,GACjC,IAAKA,EAAO7C,IAAK,CACf,IAAI9b,EAAMue,GAAeI,GACzB,GAAI3e,EAEF,YADAjtB,KAAK5C,KAAK6vB,EAGb,CACDjtB,KAAK2tC,WAAW/B,EAClB,EAEAsB,GAAKt3C,UAAU+3C,WAAa,SAAU/B,GACpC,IAAIgC,EAAYpC,GAAkB,CAChC7zB,KAAMi0B,EAAOj0B,KACbub,SAAU0Y,EAAO1Y,SACjB6V,IAAK6C,EAAO7C,MAGV8E,EAAY,CACdl2B,KAAM,YACN8a,KAAMmZ,EAAOnZ,KACb7K,IAAKgkB,EAAOhkB,IACZshB,IAAK0C,EAAO1C,IACZlf,KAAM4jB,EAAUn3C,OAChBi8B,MAAOkZ,EAAOlZ,MACdvsB,KAAM,aACN+sB,SAAU0Y,EAAO1Y,UAAY,YAC7BkW,MAAOwC,EAAOxC,MACdC,MAAOuC,EAAOvC,MACdC,SAAUsC,EAAOtC,SACjBC,SAAUqC,EAAOrC,UAGnBvpC,KAAK5C,KAAKouC,GAAeqC,IACzB7tC,KAAK5C,KAAKwwC,GACVhE,GAAS5pC,KAAM4tC,EAAUn3C,QAEzBo3C,EAAU7jB,KAAO4hB,EAAO5hB,KACxB6jB,EAAU1nC,KAAOylC,EAAOzlC,KACxBnG,KAAK5C,KAAKouC,GAAeqC,GAC3B,EAEAX,GAAKt3C,UAAUsxC,MAAQ,SAAUjnC,GAC/B,IAAI8Y,EAAQ/Y,KAAK8sC,OACjB9sC,KAAK8sC,OAASviC,GACdwO,GACF,EAEA,gBC9PkBtZ,QD8PDytC,IE9ObY,GAAM,SAAS5zC,GACjB,KAAM8F,gBAAgB8tC,IACpB,OAAO,IAAIA,GAAI5zC,GAOkB,iBAJnCA,EAAU8F,KAAK9F,QAAU6qB,GAAKuI,SAASpzB,EAAS,CAC9C6zC,MAAM,KAGWC,cACjB9zC,EAAQ8zC,YAAc,IAGxBhuC,KAAKoyB,SAAW,CACde,WAAW,EACXU,SAAS,GAGX7zB,KAAKkjC,OAASA,GAAO+K,KAAK/zC,GAC1B8F,KAAKkuC,YAAa,EAEdh0C,EAAQ6zC,OACV/tC,KAAKkuC,WAAapM,EAAI,QAACqM,WAAWj0C,EAAQ8zC,aAC1ChuC,KAAKkuC,WAAWjqC,GAAG,QAASjE,KAAKouC,mBAAmB12C,KAAKsI,OAE7D,EASA8tC,GAAIl4C,UAAUw4C,mBAAqB,SAAS55C,GAC1CwL,KAAKkjC,OAAOj+B,KAAK,QAASzQ,EAC5B,EAUAs5C,GAAIl4C,UAAUg8B,OAAS,SAAShN,EAAQlM,EAAMrkB,GAC5C,IAAI2F,EAAOgG,KAIX,SAAS4xB,EAAOp9B,EAAK65C,GACf75C,EACFH,EAASG,GAIXwF,EAAKkpC,OAAOza,MAAM/P,EAAM21B,GAAc,SAAS75C,GAC7CH,EAASG,EAAKkkB,EACpB,GACG,CAED,GAbAA,EAAKga,MAAQha,EAAK8Z,KAaM,WAApB9Z,EAAKoa,WACPlB,EAAO,KAAMhN,QACR,GAAwB,WAApBlM,EAAKoa,YAA2Bpa,EAAK0V,MAAO,CACrD1V,EAAKsR,KAAOtR,EAAK0V,MAAMpE,KAEvB,IAAIvB,EAAQzuB,EAAKkpC,OAAOza,MAAM/P,GAAM,SAASlkB,GAC3CH,EAASG,EAAKkkB,EACpB,IAEIkM,EAAOC,KAAK4D,EAChB,KAAiC,WAApB/P,EAAKoa,YACd/N,GAAK+H,cAAclI,EAAQgN,EAE/B,EAOAkc,GAAIl4C,UAAUi7B,SAAW,WACvB7wB,KAAKkjC,OAAOrS,UACd,EAOAid,GAAIl4C,UAAUqO,GAAK,WACjB,OAAOjE,KAAKkjC,OAAOj/B,GAAG5G,MAAM2C,KAAKkjC,OAAQpjC,UAC3C,EASAguC,GAAIl4C,UAAUivB,KAAO,SAASC,EAAa5qB,GACzC,OAAI8F,KAAKkuC,WACAluC,KAAKkjC,OAAOre,KAAKxnB,MAAM2C,KAAKkjC,OAAQ,CAACljC,KAAKkuC,aAAarpB,KAAKC,EAAa5qB,GAEzE8F,KAAKkjC,OAAOre,KAAKxnB,MAAM2C,KAAKkjC,OAAQpjC,UAE/C,EAOAguC,GAAIl4C,UAAU08B,OAAS,WACrB,OAAItyB,KAAKkuC,WACAluC,KAAKkuC,WAAW5b,OAAOj1B,MAAM2C,KAAKkuC,WAAYpuC,WAE9CE,KAAKkjC,OAAO5Q,OAAOj1B,MAAM2C,KAAKkjC,OAAQpjC,UAEjD,EAEA,IAAcwuC,GAAGR,GCpIbjpC,GAAWpF,EAAe,QAACoF,SAC3BgiB,GAAY8F,GAA2B9F,UASvC0nB,GAAO,SAASr0C,GAClB,KAAM8F,gBAAgBuuC,IACpB,OAAO,IAAIA,GAAKr0C,GAGlBA,EAAU8F,KAAK9F,QAAU6qB,GAAKuI,SAASpzB,EAAS,CAAA,GAEhD2sB,GAAU/wB,KAAKkK,KAAM9F,GAErB8F,KAAKoyB,SAAW,CACde,WAAW,EACXU,SAAS,GAGX7zB,KAAK8rB,MAAQ,EACf;;;;;;;GAEAjnB,GAAS0pC,GAAM1nB,IAWf0nB,GAAK34C,UAAU+8B,WAAa,SAAS3F,EAAO4F,EAAUv+B,GACpDA,EAAS,KAAM24B,EACjB,EAQAuhB,GAAK34C,UAAU44C,kBAAoB,WACjC,IAAIC,EAAaC,KAAKC,UAAU3uC,KAAK8rB,OACrC9rB,KAAKy+B,MAAMgQ,EACb,EAUAF,GAAK34C,UAAUg8B,OAAS,SAAShN,EAAQlM,EAAMrkB,GAC7C,IAAI2F,EAAOgG,KAIX,SAAS4uC,EAAMp6C,EAAK65C,GACd75C,EACFH,EAASG,IAIXkkB,EAAKsR,KAAOqkB,EAAa53C,QAAU,EACnCiiB,EAAKqnB,MAAQA,EAAAA,YAAMd,SAASoP,GAE5Br0C,EAAK8xB,MAAM1uB,KAAKsb,GAEhBrkB,EAAS,KAAMqkB,GAChB,CAdDA,EAAKqnB,MAAQ,EAgBW,WAApBrnB,EAAKoa,WACP8b,EAAM,KAAMhqB,GACiB,WAApBlM,EAAKoa,YACd/N,GAAK+H,cAAclI,EAAQgqB,EAE/B,EAOAL,GAAK34C,UAAUi7B,SAAW,WACxB7wB,KAAKwuC,oBACLxuC,KAAK8U,KACP,EAEA,IAAc+5B,GAAGN,GC/FbO,GAAU,CAAA,EAUVC,GAAU,SAASpf,EAAQz1B,GAC7B,OAAO60C,GAAQt0C,OAAOk1B,EAAQz1B,EAChC;;;;;;;GASA60C,GAAQt0C,OAAS,SAASk1B,EAAQz1B,GAChC,GAAI40C,GAAQnf,GAAS,CACnB,IAAIjL,EAAW,IAAIgL,GAASC,EAAQz1B,GAIpC,OAHAwqB,EAASiP,UAAUhE,GACnBjL,EAASkP,UAAU,IAAIkb,GAAQnf,GAAQz1B,IAEhCwqB,CACX,CACI,MAAM,IAAInwB,MAAM,UAAYo7B,EAAS,2BAEzC,EASAof,GAAQC,eAAiB,SAASrf,EAAQjkB,GACxC,GAAIojC,GAAQnf,GACV,MAAM,IAAIp7B,MAAM,YAAco7B,EAAS,gCAGzC,GAAsB,mBAAXjkB,EACT,MAAM,IAAInX,MAAM,YAAco7B,EAAS,4BAGzC,GAAuC,mBAA5BjkB,EAAO9V,UAAUg8B,QAA8D,mBAA9BlmB,EAAO9V,UAAUi7B,SAC3E,MAAM,IAAIt8B,MAAM,YAAco7B,EAAS,oCAGzCmf,GAAQnf,GAAUjkB,CACpB,EAEAqjC,GAAQC,eAAe,MAAOvvC,IAC9BsvC,GAAQC,eAAe,MAAOriB,IAC9BoiB,GAAQC,eAAe,OAAQniB,IAE/B,iCAAiBkiB,KAAAA"}