@slicemachine/init 2.10.40-beta.5 → 2.10.40-beta.6

package/dist/_node_modules/spdx-expression-parse/scan.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"scan.cjs","sources":["../../../../../node_modules/spdx-expression-parse/scan.js"],"sourcesContent":["'use strict'\n\nvar licenses = []\n  .concat(require('spdx-license-ids'))\n  .concat(require('spdx-license-ids/deprecated'))\nvar exceptions = require('spdx-exceptions')\n\nmodule.exports = function (source) {\n  var index = 0\n\n  function hasMore () {\n    return index < source.length\n  }\n\n  // `value` can be a regexp or a string.\n  // If it is recognized, the matching source string is returned and\n  // the index is incremented. Otherwise `undefined` is returned.\n  function read (value) {\n    if (value instanceof RegExp) {\n      var chars = source.slice(index)\n      var match = chars.match(value)\n      if (match) {\n        index += match[0].length\n        return match[0]\n      }\n    } else {\n      if (source.indexOf(value, index) === index) {\n        index += value.length\n        return value\n      }\n    }\n  }\n\n  function skipWhitespace () {\n    read(/[ ]*/)\n  }\n\n  function operator () {\n    var string\n    var possibilities = ['WITH', 'AND', 'OR', '(', ')', ':', '+']\n    for (var i = 0; i < possibilities.length; i++) {\n      string = read(possibilities[i])\n      if (string) {\n        break\n      }\n    }\n\n    if (string === '+' && index > 1 && source[index - 2] === ' ') {\n      throw new Error('Space before `+`')\n    }\n\n    return string && {\n      type: 'OPERATOR',\n      string: string\n    }\n  }\n\n  function idstring () {\n    return read(/[A-Za-z0-9-.]+/)\n  }\n\n  function expectIdstring () {\n    var string = idstring()\n    if (!string) {\n      throw new Error('Expected idstring at offset ' + index)\n    }\n    return string\n  }\n\n  function documentRef () {\n    if (read('DocumentRef-')) {\n      var string = expectIdstring()\n      return { type: 'DOCUMENTREF', string: string }\n    }\n  }\n\n  function licenseRef () {\n    if (read('LicenseRef-')) {\n      var string = expectIdstring()\n      return { type: 'LICENSEREF', string: string }\n    }\n  }\n\n  function identifier () {\n    var begin = index\n    var string = idstring()\n\n    if (licenses.indexOf(string) !== -1) {\n      return {\n        type: 'LICENSE',\n        string: string\n      }\n    } else if (exceptions.indexOf(string) !== -1) {\n      return {\n        type: 'EXCEPTION',\n        string: string\n      }\n    }\n\n    index = begin\n  }\n\n  // Tries to read the next token. Returns `undefined` if no token is\n  // recognized.\n  function parseToken () {\n    // Ordering matters\n    return (\n      operator() ||\n      documentRef() ||\n      licenseRef() ||\n      identifier()\n    )\n  }\n\n  var tokens = []\n  while (hasMore()) {\n    skipWhitespace()\n    if (!hasMore()) {\n      break\n    }\n\n    var token = parseToken()\n    if (!token) {\n      throw new Error('Unexpected `' + source[index] +\n                      '` at offset ' + index)\n    }\n\n    tokens.push(token)\n  }\n  return tokens\n}\n"],"names":["require$$0","require$$1","require$$2","index"],"mappings":";;;;;AAEA,IAAI,WAAW,CAAE,EACd,OAAOA,KAA2B,EAClC,OAAOC,UAAsC;AAChD,IAAI,aAAaC;IAEjB,OAAiB,SAAU,QAAQ;AACjC,MAAIC,SAAQ;AAEZ,WAAS,UAAW;AAClB,WAAOA,SAAQ,OAAO;AAAA,EACvB;AAKD,WAAS,KAAM,OAAO;AACpB,QAAI,iBAAiB,QAAQ;AAC3B,UAAI,QAAQ,OAAO,MAAMA,MAAK;AAC9B,UAAI,QAAQ,MAAM,MAAM,KAAK;AAC7B,UAAI,OAAO;AACT,QAAAA,UAAS,MAAM,CAAC,EAAE;AAClB,eAAO,MAAM,CAAC;AAAA,MACf;AAAA,IACP,OAAW;AACL,UAAI,OAAO,QAAQ,OAAOA,MAAK,MAAMA,QAAO;AAC1C,QAAAA,UAAS,MAAM;AACf,eAAO;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAED,WAAS,iBAAkB;AACzB,SAAK,MAAM;AAAA,EACZ;AAED,WAAS,WAAY;AACnB,QAAI;AACJ,QAAI,gBAAgB,CAAC,QAAQ,OAAO,MAAM,KAAK,KAAK,KAAK,GAAG;AAC5D,aAAS,IAAI,GAAG,IAAI,cAAc,QAAQ,KAAK;AAC7C,eAAS,KAAK,cAAc,CAAC,CAAC;AAC9B,UAAI,QAAQ;AACV;AAAA,MACD;AAAA,IACF;AAED,QAAI,WAAW,OAAOA,SAAQ,KAAK,OAAOA,SAAQ,CAAC,MAAM,KAAK;AAC5D,YAAM,IAAI,MAAM,kBAAkB;AAAA,IACnC;AAED,WAAO,UAAU;AAAA,MACf,MAAM;AAAA,MACN;AAAA,IACD;AAAA,EACF;AAED,WAAS,WAAY;AACnB,WAAO,KAAK,gBAAgB;AAAA,EAC7B;AAED,WAAS,iBAAkB;AACzB,QAAI,SAAS,SAAU;AACvB,QAAI,CAAC,QAAQ;AACX,YAAM,IAAI,MAAM,iCAAiCA,MAAK;AAAA,IACvD;AACD,WAAO;AAAA,EACR;AAED,WAAS,cAAe;AACtB,QAAI,KAAK,cAAc,GAAG;AACxB,UAAI,SAAS,eAAgB;AAC7B,aAAO,EAAE,MAAM,eAAe,OAAgB;AAAA,IAC/C;AAAA,EACF;AAED,WAAS,aAAc;AACrB,QAAI,KAAK,aAAa,GAAG;AACvB,UAAI,SAAS,eAAgB;AAC7B,aAAO,EAAE,MAAM,cAAc,OAAgB;AAAA,IAC9C;AAAA,EACF;AAED,WAAS,aAAc;AACrB,QAAI,QAAQA;AACZ,QAAI,SAAS,SAAU;AAEvB,QAAI,SAAS,QAAQ,MAAM,MAAM,IAAI;AACnC,aAAO;AAAA,QACL,MAAM;AAAA,QACN;AAAA,MACD;AAAA,IACF,WAAU,WAAW,QAAQ,MAAM,MAAM,IAAI;AAC5C,aAAO;AAAA,QACL,MAAM;AAAA,QACN;AAAA,MACD;AAAA,IACF;AAED,IAAAA,SAAQ;AAAA,EACT;AAID,WAAS,aAAc;AAErB,WACE,SAAU,KACV,YAAa,KACb,WAAY,KACZ,WAAY;AAAA,EAEf;AAED,MAAI,SAAS,CAAE;AACf,SAAO,QAAO,GAAI;AAChB,mBAAgB;AAChB,QAAI,CAAC,QAAO,GAAI;AACd;AAAA,IACD;AAED,QAAI,QAAQ,WAAY;AACxB,QAAI,CAAC,OAAO;AACV,YAAM,IAAI,MAAM,iBAAiB,OAAOA,MAAK,IAC7B,iBAAiBA,MAAK;AAAA,IACvC;AAED,WAAO,KAAK,KAAK;AAAA,EAClB;AACD,SAAO;AACT;;","x_google_ignoreList":[0]}
+{"version":3,"file":"scan.cjs","sources":["../../../../../node_modules/spdx-expression-parse/scan.js"],"sourcesContent":["'use strict'\n\nvar licenses = []\n  .concat(require('spdx-license-ids'))\n  .concat(require('spdx-license-ids/deprecated'))\nvar exceptions = require('spdx-exceptions')\n\nmodule.exports = function (source) {\n  var index = 0\n\n  function hasMore () {\n    return index < source.length\n  }\n\n  // `value` can be a regexp or a string.\n  // If it is recognized, the matching source string is returned and\n  // the index is incremented. Otherwise `undefined` is returned.\n  function read (value) {\n    if (value instanceof RegExp) {\n      var chars = source.slice(index)\n      var match = chars.match(value)\n      if (match) {\n        index += match[0].length\n        return match[0]\n      }\n    } else {\n      if (source.indexOf(value, index) === index) {\n        index += value.length\n        return value\n      }\n    }\n  }\n\n  function skipWhitespace () {\n    read(/[ ]*/)\n  }\n\n  function operator () {\n    var string\n    var possibilities = ['WITH', 'AND', 'OR', '(', ')', ':', '+']\n    for (var i = 0; i < possibilities.length; i++) {\n      string = read(possibilities[i])\n      if (string) {\n        break\n      }\n    }\n\n    if (string === '+' && index > 1 && source[index - 2] === ' ') {\n      throw new Error('Space before `+`')\n    }\n\n    return string && {\n      type: 'OPERATOR',\n      string: string\n    }\n  }\n\n  function idstring () {\n    return read(/[A-Za-z0-9-.]+/)\n  }\n\n  function expectIdstring () {\n    var string = idstring()\n    if (!string) {\n      throw new Error('Expected idstring at offset ' + index)\n    }\n    return string\n  }\n\n  function documentRef () {\n    if (read('DocumentRef-')) {\n      var string = expectIdstring()\n      return { type: 'DOCUMENTREF', string: string }\n    }\n  }\n\n  function licenseRef () {\n    if (read('LicenseRef-')) {\n      var string = expectIdstring()\n      return { type: 'LICENSEREF', string: string }\n    }\n  }\n\n  function identifier () {\n    var begin = index\n    var string = idstring()\n\n    if (licenses.indexOf(string) !== -1) {\n      return {\n        type: 'LICENSE',\n        string: string\n      }\n    } else if (exceptions.indexOf(string) !== -1) {\n      return {\n        type: 'EXCEPTION',\n        string: string\n      }\n    }\n\n    index = begin\n  }\n\n  // Tries to read the next token. Returns `undefined` if no token is\n  // recognized.\n  function parseToken () {\n    // Ordering matters\n    return (\n      operator() ||\n      documentRef() ||\n      licenseRef() ||\n      identifier()\n    )\n  }\n\n  var tokens = []\n  while (hasMore()) {\n    skipWhitespace()\n    if (!hasMore()) {\n      break\n    }\n\n    var token = parseToken()\n    if (!token) {\n      throw new Error('Unexpected `' + source[index] +\n                      '` at offset ' + index)\n    }\n\n    tokens.push(token)\n  }\n  return tokens\n}\n"],"names":["require$$0","require$$1","require$$2","index"],"mappings":";;;;;AAEA,IAAI,WAAW,CAAA,EACZ,OAAOA,OAA2B,EAClC,OAAOC,UAAsC;AAChD,IAAI,aAAaC;IAEjB,OAAiB,SAAU,QAAQ;AACjC,MAAIC,SAAQ;AAEZ,WAAS,UAAW;AAClB,WAAOA,SAAQ,OAAO;AAAA,EAC1B;AAKE,WAAS,KAAM,OAAO;AACpB,QAAI,iBAAiB,QAAQ;AAC3B,UAAI,QAAQ,OAAO,MAAMA,MAAK;AAC9B,UAAI,QAAQ,MAAM,MAAM,KAAK;AAC7B,UAAI,OAAO;AACT,QAAAA,UAAS,MAAM,CAAC,EAAE;AAClB,eAAO,MAAM,CAAC;AAAA,MACtB;AAAA,IACA,OAAW;AACL,UAAI,OAAO,QAAQ,OAAOA,MAAK,MAAMA,QAAO;AAC1C,QAAAA,UAAS,MAAM;AACf,eAAO;AAAA,MACf;AAAA,IACA;AAAA,EACA;AAEE,WAAS,iBAAkB;AACzB,SAAK,MAAM;AAAA,EACf;AAEE,WAAS,WAAY;AACnB,QAAI;AACJ,QAAI,gBAAgB,CAAC,QAAQ,OAAO,MAAM,KAAK,KAAK,KAAK,GAAG;AAC5D,aAAS,IAAI,GAAG,IAAI,cAAc,QAAQ,KAAK;AAC7C,eAAS,KAAK,cAAc,CAAC,CAAC;AAC9B,UAAI,QAAQ;AACV;AAAA,MACR;AAAA,IACA;AAEI,QAAI,WAAW,OAAOA,SAAQ,KAAK,OAAOA,SAAQ,CAAC,MAAM,KAAK;AAC5D,YAAM,IAAI,MAAM,kBAAkB;AAAA,IACxC;AAEI,WAAO,UAAU;AAAA,MACf,MAAM;AAAA,MACN;AAAA,IACN;AAAA,EACA;AAEE,WAAS,WAAY;AACnB,WAAO,KAAK,gBAAgB;AAAA,EAChC;AAEE,WAAS,iBAAkB;AACzB,QAAI,SAAS,SAAQ;AACrB,QAAI,CAAC,QAAQ;AACX,YAAM,IAAI,MAAM,iCAAiCA,MAAK;AAAA,IAC5D;AACI,WAAO;AAAA,EACX;AAEE,WAAS,cAAe;AACtB,QAAI,KAAK,cAAc,GAAG;AACxB,UAAI,SAAS,eAAc;AAC3B,aAAO,EAAE,MAAM,eAAe,OAAc;AAAA,IAClD;AAAA,EACA;AAEE,WAAS,aAAc;AACrB,QAAI,KAAK,aAAa,GAAG;AACvB,UAAI,SAAS,eAAc;AAC3B,aAAO,EAAE,MAAM,cAAc,OAAc;AAAA,IACjD;AAAA,EACA;AAEE,WAAS,aAAc;AACrB,QAAI,QAAQA;AACZ,QAAI,SAAS,SAAQ;AAErB,QAAI,SAAS,QAAQ,MAAM,MAAM,IAAI;AACnC,aAAO;AAAA,QACL,MAAM;AAAA,QACN;AAAA,MACR;AAAA,IACA,WAAe,WAAW,QAAQ,MAAM,MAAM,IAAI;AAC5C,aAAO;AAAA,QACL,MAAM;AAAA,QACN;AAAA,MACR;AAAA,IACA;AAEI,IAAAA,SAAQ;AAAA,EACZ;AAIE,WAAS,aAAc;AAErB,WACE,SAAQ,KACR,YAAW,KACX,WAAU,KACV,WAAU;AAAA,EAEhB;AAEE,MAAI,SAAS,CAAA;AACb,SAAO,QAAO,GAAI;AAChB,mBAAc;AACd,QAAI,CAAC,QAAO,GAAI;AACd;AAAA,IACN;AAEI,QAAI,QAAQ,WAAU;AACtB,QAAI,CAAC,OAAO;AACV,YAAM,IAAI,MAAM,iBAAiB,OAAOA,MAAK,IAC7B,iBAAiBA,MAAK;AAAA,IAC5C;AAEI,WAAO,KAAK,KAAK;AAAA,EACrB;AACE,SAAO;AACT;;","x_google_ignoreList":[0]}

package/dist/_node_modules/spdx-expression-parse/scan.js.map

@@ -1 +1 @@
-{"version":3,"file":"scan.js","sources":["../../../../../node_modules/spdx-expression-parse/scan.js"],"sourcesContent":["'use strict'\n\nvar licenses = []\n  .concat(require('spdx-license-ids'))\n  .concat(require('spdx-license-ids/deprecated'))\nvar exceptions = require('spdx-exceptions')\n\nmodule.exports = function (source) {\n  var index = 0\n\n  function hasMore () {\n    return index < source.length\n  }\n\n  // `value` can be a regexp or a string.\n  // If it is recognized, the matching source string is returned and\n  // the index is incremented. Otherwise `undefined` is returned.\n  function read (value) {\n    if (value instanceof RegExp) {\n      var chars = source.slice(index)\n      var match = chars.match(value)\n      if (match) {\n        index += match[0].length\n        return match[0]\n      }\n    } else {\n      if (source.indexOf(value, index) === index) {\n        index += value.length\n        return value\n      }\n    }\n  }\n\n  function skipWhitespace () {\n    read(/[ ]*/)\n  }\n\n  function operator () {\n    var string\n    var possibilities = ['WITH', 'AND', 'OR', '(', ')', ':', '+']\n    for (var i = 0; i < possibilities.length; i++) {\n      string = read(possibilities[i])\n      if (string) {\n        break\n      }\n    }\n\n    if (string === '+' && index > 1 && source[index - 2] === ' ') {\n      throw new Error('Space before `+`')\n    }\n\n    return string && {\n      type: 'OPERATOR',\n      string: string\n    }\n  }\n\n  function idstring () {\n    return read(/[A-Za-z0-9-.]+/)\n  }\n\n  function expectIdstring () {\n    var string = idstring()\n    if (!string) {\n      throw new Error('Expected idstring at offset ' + index)\n    }\n    return string\n  }\n\n  function documentRef () {\n    if (read('DocumentRef-')) {\n      var string = expectIdstring()\n      return { type: 'DOCUMENTREF', string: string }\n    }\n  }\n\n  function licenseRef () {\n    if (read('LicenseRef-')) {\n      var string = expectIdstring()\n      return { type: 'LICENSEREF', string: string }\n    }\n  }\n\n  function identifier () {\n    var begin = index\n    var string = idstring()\n\n    if (licenses.indexOf(string) !== -1) {\n      return {\n        type: 'LICENSE',\n        string: string\n      }\n    } else if (exceptions.indexOf(string) !== -1) {\n      return {\n        type: 'EXCEPTION',\n        string: string\n      }\n    }\n\n    index = begin\n  }\n\n  // Tries to read the next token. Returns `undefined` if no token is\n  // recognized.\n  function parseToken () {\n    // Ordering matters\n    return (\n      operator() ||\n      documentRef() ||\n      licenseRef() ||\n      identifier()\n    )\n  }\n\n  var tokens = []\n  while (hasMore()) {\n    skipWhitespace()\n    if (!hasMore()) {\n      break\n    }\n\n    var token = parseToken()\n    if (!token) {\n      throw new Error('Unexpected `' + source[index] +\n                      '` at offset ' + index)\n    }\n\n    tokens.push(token)\n  }\n  return tokens\n}\n"],"names":["require$$0","require$$1"],"mappings":";;;AAEA,IAAI,WAAW,CAAE,EACd,OAAOA,UAA2B,EAClC,OAAOC,YAAsC;AAChD,IAAI,aAAa;IAEjB,OAAiB,SAAU,QAAQ;AACjC,MAAI,QAAQ;AAEZ,WAAS,UAAW;AAClB,WAAO,QAAQ,OAAO;AAAA,EACvB;AAKD,WAAS,KAAM,OAAO;AACpB,QAAI,iBAAiB,QAAQ;AAC3B,UAAI,QAAQ,OAAO,MAAM,KAAK;AAC9B,UAAI,QAAQ,MAAM,MAAM,KAAK;AAC7B,UAAI,OAAO;AACT,iBAAS,MAAM,CAAC,EAAE;AAClB,eAAO,MAAM,CAAC;AAAA,MACf;AAAA,IACP,OAAW;AACL,UAAI,OAAO,QAAQ,OAAO,KAAK,MAAM,OAAO;AAC1C,iBAAS,MAAM;AACf,eAAO;AAAA,MACR;AAAA,IACF;AAAA,EACF;AAED,WAAS,iBAAkB;AACzB,SAAK,MAAM;AAAA,EACZ;AAED,WAAS,WAAY;AACnB,QAAI;AACJ,QAAI,gBAAgB,CAAC,QAAQ,OAAO,MAAM,KAAK,KAAK,KAAK,GAAG;AAC5D,aAAS,IAAI,GAAG,IAAI,cAAc,QAAQ,KAAK;AAC7C,eAAS,KAAK,cAAc,CAAC,CAAC;AAC9B,UAAI,QAAQ;AACV;AAAA,MACD;AAAA,IACF;AAED,QAAI,WAAW,OAAO,QAAQ,KAAK,OAAO,QAAQ,CAAC,MAAM,KAAK;AAC5D,YAAM,IAAI,MAAM,kBAAkB;AAAA,IACnC;AAED,WAAO,UAAU;AAAA,MACf,MAAM;AAAA,MACN;AAAA,IACD;AAAA,EACF;AAED,WAAS,WAAY;AACnB,WAAO,KAAK,gBAAgB;AAAA,EAC7B;AAED,WAAS,iBAAkB;AACzB,QAAI,SAAS,SAAU;AACvB,QAAI,CAAC,QAAQ;AACX,YAAM,IAAI,MAAM,iCAAiC,KAAK;AAAA,IACvD;AACD,WAAO;AAAA,EACR;AAED,WAAS,cAAe;AACtB,QAAI,KAAK,cAAc,GAAG;AACxB,UAAI,SAAS,eAAgB;AAC7B,aAAO,EAAE,MAAM,eAAe,OAAgB;AAAA,IAC/C;AAAA,EACF;AAED,WAAS,aAAc;AACrB,QAAI,KAAK,aAAa,GAAG;AACvB,UAAI,SAAS,eAAgB;AAC7B,aAAO,EAAE,MAAM,cAAc,OAAgB;AAAA,IAC9C;AAAA,EACF;AAED,WAAS,aAAc;AACrB,QAAI,QAAQ;AACZ,QAAI,SAAS,SAAU;AAEvB,QAAI,SAAS,QAAQ,MAAM,MAAM,IAAI;AACnC,aAAO;AAAA,QACL,MAAM;AAAA,QACN;AAAA,MACD;AAAA,IACF,WAAU,WAAW,QAAQ,MAAM,MAAM,IAAI;AAC5C,aAAO;AAAA,QACL,MAAM;AAAA,QACN;AAAA,MACD;AAAA,IACF;AAED,YAAQ;AAAA,EACT;AAID,WAAS,aAAc;AAErB,WACE,SAAU,KACV,YAAa,KACb,WAAY,KACZ,WAAY;AAAA,EAEf;AAED,MAAI,SAAS,CAAE;AACf,SAAO,QAAO,GAAI;AAChB,mBAAgB;AAChB,QAAI,CAAC,QAAO,GAAI;AACd;AAAA,IACD;AAED,QAAI,QAAQ,WAAY;AACxB,QAAI,CAAC,OAAO;AACV,YAAM,IAAI,MAAM,iBAAiB,OAAO,KAAK,IAC7B,iBAAiB,KAAK;AAAA,IACvC;AAED,WAAO,KAAK,KAAK;AAAA,EAClB;AACD,SAAO;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"scan.js","sources":["../../../../../node_modules/spdx-expression-parse/scan.js"],"sourcesContent":["'use strict'\n\nvar licenses = []\n  .concat(require('spdx-license-ids'))\n  .concat(require('spdx-license-ids/deprecated'))\nvar exceptions = require('spdx-exceptions')\n\nmodule.exports = function (source) {\n  var index = 0\n\n  function hasMore () {\n    return index < source.length\n  }\n\n  // `value` can be a regexp or a string.\n  // If it is recognized, the matching source string is returned and\n  // the index is incremented. Otherwise `undefined` is returned.\n  function read (value) {\n    if (value instanceof RegExp) {\n      var chars = source.slice(index)\n      var match = chars.match(value)\n      if (match) {\n        index += match[0].length\n        return match[0]\n      }\n    } else {\n      if (source.indexOf(value, index) === index) {\n        index += value.length\n        return value\n      }\n    }\n  }\n\n  function skipWhitespace () {\n    read(/[ ]*/)\n  }\n\n  function operator () {\n    var string\n    var possibilities = ['WITH', 'AND', 'OR', '(', ')', ':', '+']\n    for (var i = 0; i < possibilities.length; i++) {\n      string = read(possibilities[i])\n      if (string) {\n        break\n      }\n    }\n\n    if (string === '+' && index > 1 && source[index - 2] === ' ') {\n      throw new Error('Space before `+`')\n    }\n\n    return string && {\n      type: 'OPERATOR',\n      string: string\n    }\n  }\n\n  function idstring () {\n    return read(/[A-Za-z0-9-.]+/)\n  }\n\n  function expectIdstring () {\n    var string = idstring()\n    if (!string) {\n      throw new Error('Expected idstring at offset ' + index)\n    }\n    return string\n  }\n\n  function documentRef () {\n    if (read('DocumentRef-')) {\n      var string = expectIdstring()\n      return { type: 'DOCUMENTREF', string: string }\n    }\n  }\n\n  function licenseRef () {\n    if (read('LicenseRef-')) {\n      var string = expectIdstring()\n      return { type: 'LICENSEREF', string: string }\n    }\n  }\n\n  function identifier () {\n    var begin = index\n    var string = idstring()\n\n    if (licenses.indexOf(string) !== -1) {\n      return {\n        type: 'LICENSE',\n        string: string\n      }\n    } else if (exceptions.indexOf(string) !== -1) {\n      return {\n        type: 'EXCEPTION',\n        string: string\n      }\n    }\n\n    index = begin\n  }\n\n  // Tries to read the next token. Returns `undefined` if no token is\n  // recognized.\n  function parseToken () {\n    // Ordering matters\n    return (\n      operator() ||\n      documentRef() ||\n      licenseRef() ||\n      identifier()\n    )\n  }\n\n  var tokens = []\n  while (hasMore()) {\n    skipWhitespace()\n    if (!hasMore()) {\n      break\n    }\n\n    var token = parseToken()\n    if (!token) {\n      throw new Error('Unexpected `' + source[index] +\n                      '` at offset ' + index)\n    }\n\n    tokens.push(token)\n  }\n  return tokens\n}\n"],"names":["require$$0","require$$1"],"mappings":";;;AAEA,IAAI,WAAW,CAAA,EACZ,OAAOA,UAA2B,EAClC,OAAOC,YAAsC;AAChD,IAAI,aAAa;IAEjB,OAAiB,SAAU,QAAQ;AACjC,MAAI,QAAQ;AAEZ,WAAS,UAAW;AAClB,WAAO,QAAQ,OAAO;AAAA,EAC1B;AAKE,WAAS,KAAM,OAAO;AACpB,QAAI,iBAAiB,QAAQ;AAC3B,UAAI,QAAQ,OAAO,MAAM,KAAK;AAC9B,UAAI,QAAQ,MAAM,MAAM,KAAK;AAC7B,UAAI,OAAO;AACT,iBAAS,MAAM,CAAC,EAAE;AAClB,eAAO,MAAM,CAAC;AAAA,MACtB;AAAA,IACA,OAAW;AACL,UAAI,OAAO,QAAQ,OAAO,KAAK,MAAM,OAAO;AAC1C,iBAAS,MAAM;AACf,eAAO;AAAA,MACf;AAAA,IACA;AAAA,EACA;AAEE,WAAS,iBAAkB;AACzB,SAAK,MAAM;AAAA,EACf;AAEE,WAAS,WAAY;AACnB,QAAI;AACJ,QAAI,gBAAgB,CAAC,QAAQ,OAAO,MAAM,KAAK,KAAK,KAAK,GAAG;AAC5D,aAAS,IAAI,GAAG,IAAI,cAAc,QAAQ,KAAK;AAC7C,eAAS,KAAK,cAAc,CAAC,CAAC;AAC9B,UAAI,QAAQ;AACV;AAAA,MACR;AAAA,IACA;AAEI,QAAI,WAAW,OAAO,QAAQ,KAAK,OAAO,QAAQ,CAAC,MAAM,KAAK;AAC5D,YAAM,IAAI,MAAM,kBAAkB;AAAA,IACxC;AAEI,WAAO,UAAU;AAAA,MACf,MAAM;AAAA,MACN;AAAA,IACN;AAAA,EACA;AAEE,WAAS,WAAY;AACnB,WAAO,KAAK,gBAAgB;AAAA,EAChC;AAEE,WAAS,iBAAkB;AACzB,QAAI,SAAS,SAAQ;AACrB,QAAI,CAAC,QAAQ;AACX,YAAM,IAAI,MAAM,iCAAiC,KAAK;AAAA,IAC5D;AACI,WAAO;AAAA,EACX;AAEE,WAAS,cAAe;AACtB,QAAI,KAAK,cAAc,GAAG;AACxB,UAAI,SAAS,eAAc;AAC3B,aAAO,EAAE,MAAM,eAAe,OAAc;AAAA,IAClD;AAAA,EACA;AAEE,WAAS,aAAc;AACrB,QAAI,KAAK,aAAa,GAAG;AACvB,UAAI,SAAS,eAAc;AAC3B,aAAO,EAAE,MAAM,cAAc,OAAc;AAAA,IACjD;AAAA,EACA;AAEE,WAAS,aAAc;AACrB,QAAI,QAAQ;AACZ,QAAI,SAAS,SAAQ;AAErB,QAAI,SAAS,QAAQ,MAAM,MAAM,IAAI;AACnC,aAAO;AAAA,QACL,MAAM;AAAA,QACN;AAAA,MACR;AAAA,IACA,WAAe,WAAW,QAAQ,MAAM,MAAM,IAAI;AAC5C,aAAO;AAAA,QACL,MAAM;AAAA,QACN;AAAA,MACR;AAAA,IACA;AAEI,YAAQ;AAAA,EACZ;AAIE,WAAS,aAAc;AAErB,WACE,SAAQ,KACR,YAAW,KACX,WAAU,KACV,WAAU;AAAA,EAEhB;AAEE,MAAI,SAAS,CAAA;AACb,SAAO,QAAO,GAAI;AAChB,mBAAc;AACd,QAAI,CAAC,QAAO,GAAI;AACd;AAAA,IACN;AAEI,QAAI,QAAQ,WAAU;AACtB,QAAI,CAAC,OAAO;AACV,YAAM,IAAI,MAAM,iBAAiB,OAAO,KAAK,IAC7B,iBAAiB,KAAK;AAAA,IAC5C;AAEI,WAAO,KAAK,KAAK;AAAA,EACrB;AACE,SAAO;AACT;","x_google_ignoreList":[0]}

package/dist/_node_modules/strip-final-newline/index.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs","sources":["../../../../../node_modules/strip-final-newline/index.js"],"sourcesContent":["export default function stripFinalNewline(input) {\n\tconst LF = typeof input === 'string' ? '\\n' : '\\n'.charCodeAt();\n\tconst CR = typeof input === 'string' ? '\\r' : '\\r'.charCodeAt();\n\n\tif (input[input.length - 1] === LF) {\n\t\tinput = input.slice(0, -1);\n\t}\n\n\tif (input[input.length - 1] === CR) {\n\t\tinput = input.slice(0, -1);\n\t}\n\n\treturn input;\n}\n"],"names":[],"mappings":";AAAe,SAAS,kBAAkB,OAAO;AAChD,QAAM,KAAK,OAAO,UAAU,WAAW,OAAO,KAAK;AACnD,QAAM,KAAK,OAAO,UAAU,WAAW,OAAO,KAAK;AAEnD,MAAI,MAAM,MAAM,SAAS,CAAC,MAAM,IAAI;AACnC,YAAQ,MAAM,MAAM,GAAG,EAAE;AAAA,EACzB;AAED,MAAI,MAAM,MAAM,SAAS,CAAC,MAAM,IAAI;AACnC,YAAQ,MAAM,MAAM,GAAG,EAAE;AAAA,EACzB;AAED,SAAO;AACR;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs","sources":["../../../../../node_modules/strip-final-newline/index.js"],"sourcesContent":["export default function stripFinalNewline(input) {\n\tconst LF = typeof input === 'string' ? '\\n' : '\\n'.charCodeAt();\n\tconst CR = typeof input === 'string' ? '\\r' : '\\r'.charCodeAt();\n\n\tif (input[input.length - 1] === LF) {\n\t\tinput = input.slice(0, -1);\n\t}\n\n\tif (input[input.length - 1] === CR) {\n\t\tinput = input.slice(0, -1);\n\t}\n\n\treturn input;\n}\n"],"names":[],"mappings":";AAAe,SAAS,kBAAkB,OAAO;AAChD,QAAM,KAAK,OAAO,UAAU,WAAW,OAAO,KAAK,WAAU;AAC7D,QAAM,KAAK,OAAO,UAAU,WAAW,OAAO,KAAK,WAAU;AAE7D,MAAI,MAAM,MAAM,SAAS,CAAC,MAAM,IAAI;AACnC,YAAQ,MAAM,MAAM,GAAG,EAAE;AAAA,EAC1B;AAEA,MAAI,MAAM,MAAM,SAAS,CAAC,MAAM,IAAI;AACnC,YAAQ,MAAM,MAAM,GAAG,EAAE;AAAA,EAC1B;AAEA,SAAO;AACR;;","x_google_ignoreList":[0]}

package/dist/_node_modules/strip-final-newline/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sources":["../../../../../node_modules/strip-final-newline/index.js"],"sourcesContent":["export default function stripFinalNewline(input) {\n\tconst LF = typeof input === 'string' ? '\\n' : '\\n'.charCodeAt();\n\tconst CR = typeof input === 'string' ? '\\r' : '\\r'.charCodeAt();\n\n\tif (input[input.length - 1] === LF) {\n\t\tinput = input.slice(0, -1);\n\t}\n\n\tif (input[input.length - 1] === CR) {\n\t\tinput = input.slice(0, -1);\n\t}\n\n\treturn input;\n}\n"],"names":[],"mappings":"AAAe,SAAS,kBAAkB,OAAO;AAChD,QAAM,KAAK,OAAO,UAAU,WAAW,OAAO,KAAK;AACnD,QAAM,KAAK,OAAO,UAAU,WAAW,OAAO,KAAK;AAEnD,MAAI,MAAM,MAAM,SAAS,CAAC,MAAM,IAAI;AACnC,YAAQ,MAAM,MAAM,GAAG,EAAE;AAAA,EACzB;AAED,MAAI,MAAM,MAAM,SAAS,CAAC,MAAM,IAAI;AACnC,YAAQ,MAAM,MAAM,GAAG,EAAE;AAAA,EACzB;AAED,SAAO;AACR;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.js","sources":["../../../../../node_modules/strip-final-newline/index.js"],"sourcesContent":["export default function stripFinalNewline(input) {\n\tconst LF = typeof input === 'string' ? '\\n' : '\\n'.charCodeAt();\n\tconst CR = typeof input === 'string' ? '\\r' : '\\r'.charCodeAt();\n\n\tif (input[input.length - 1] === LF) {\n\t\tinput = input.slice(0, -1);\n\t}\n\n\tif (input[input.length - 1] === CR) {\n\t\tinput = input.slice(0, -1);\n\t}\n\n\treturn input;\n}\n"],"names":[],"mappings":"AAAe,SAAS,kBAAkB,OAAO;AAChD,QAAM,KAAK,OAAO,UAAU,WAAW,OAAO,KAAK,WAAU;AAC7D,QAAM,KAAK,OAAO,UAAU,WAAW,OAAO,KAAK,WAAU;AAE7D,MAAI,MAAM,MAAM,SAAS,CAAC,MAAM,IAAI;AACnC,YAAQ,MAAM,MAAM,GAAG,EAAE;AAAA,EAC1B;AAEA,MAAI,MAAM,MAAM,SAAS,CAAC,MAAM,IAAI;AACnC,YAAQ,MAAM,MAAM,GAAG,EAAE;AAAA,EAC1B;AAEA,SAAO;AACR;","x_google_ignoreList":[0]}

package/dist/_node_modules/to-regex-range/_node_modules/is-number/index.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs","sources":["../../../../../../../node_modules/to-regex-range/node_modules/is-number/index.js"],"sourcesContent":["/*!\n * is-number <https://github.com/jonschlinkert/is-number>\n *\n * Copyright (c) 2014-present, Jon Schlinkert.\n * Released under the MIT License.\n */\n\n'use strict';\n\nmodule.exports = function(num) {\n  if (typeof num === 'number') {\n    return num - num === 0;\n  }\n  if (typeof num === 'string' && num.trim() !== '') {\n    return Number.isFinite ? Number.isFinite(+num) : isFinite(+num);\n  }\n  return false;\n};\n"],"names":[],"mappings":";;;;;;;;IASA,WAAiB,SAAS,KAAK;AAC7B,MAAI,OAAO,QAAQ,UAAU;AAC3B,WAAO,MAAM,QAAQ;AAAA,EACtB;AACD,MAAI,OAAO,QAAQ,YAAY,IAAI,KAAI,MAAO,IAAI;AAChD,WAAO,OAAO,WAAW,OAAO,SAAS,CAAC,GAAG,IAAI,SAAS,CAAC,GAAG;AAAA,EAC/D;AACD,SAAO;AACT;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs","sources":["../../../../../../../node_modules/to-regex-range/node_modules/is-number/index.js"],"sourcesContent":["/*!\n * is-number <https://github.com/jonschlinkert/is-number>\n *\n * Copyright (c) 2014-present, Jon Schlinkert.\n * Released under the MIT License.\n */\n\n'use strict';\n\nmodule.exports = function(num) {\n  if (typeof num === 'number') {\n    return num - num === 0;\n  }\n  if (typeof num === 'string' && num.trim() !== '') {\n    return Number.isFinite ? Number.isFinite(+num) : isFinite(+num);\n  }\n  return false;\n};\n"],"names":[],"mappings":";;;;;;;;IASA,WAAiB,SAAS,KAAK;AAC7B,MAAI,OAAO,QAAQ,UAAU;AAC3B,WAAO,MAAM,QAAQ;AAAA,EACzB;AACE,MAAI,OAAO,QAAQ,YAAY,IAAI,KAAI,MAAO,IAAI;AAChD,WAAO,OAAO,WAAW,OAAO,SAAS,CAAC,GAAG,IAAI,SAAS,CAAC,GAAG;AAAA,EAClE;AACE,SAAO;AACT;;","x_google_ignoreList":[0]}

package/dist/_node_modules/to-regex-range/_node_modules/is-number/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sources":["../../../../../../../node_modules/to-regex-range/node_modules/is-number/index.js"],"sourcesContent":["/*!\n * is-number <https://github.com/jonschlinkert/is-number>\n *\n * Copyright (c) 2014-present, Jon Schlinkert.\n * Released under the MIT License.\n */\n\n'use strict';\n\nmodule.exports = function(num) {\n  if (typeof num === 'number') {\n    return num - num === 0;\n  }\n  if (typeof num === 'string' && num.trim() !== '') {\n    return Number.isFinite ? Number.isFinite(+num) : isFinite(+num);\n  }\n  return false;\n};\n"],"names":[],"mappings":";;;;;;IASA,WAAiB,SAAS,KAAK;AAC7B,MAAI,OAAO,QAAQ,UAAU;AAC3B,WAAO,MAAM,QAAQ;AAAA,EACtB;AACD,MAAI,OAAO,QAAQ,YAAY,IAAI,KAAI,MAAO,IAAI;AAChD,WAAO,OAAO,WAAW,OAAO,SAAS,CAAC,GAAG,IAAI,SAAS,CAAC,GAAG;AAAA,EAC/D;AACD,SAAO;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.js","sources":["../../../../../../../node_modules/to-regex-range/node_modules/is-number/index.js"],"sourcesContent":["/*!\n * is-number <https://github.com/jonschlinkert/is-number>\n *\n * Copyright (c) 2014-present, Jon Schlinkert.\n * Released under the MIT License.\n */\n\n'use strict';\n\nmodule.exports = function(num) {\n  if (typeof num === 'number') {\n    return num - num === 0;\n  }\n  if (typeof num === 'string' && num.trim() !== '') {\n    return Number.isFinite ? Number.isFinite(+num) : isFinite(+num);\n  }\n  return false;\n};\n"],"names":[],"mappings":";;;;;;IASA,WAAiB,SAAS,KAAK;AAC7B,MAAI,OAAO,QAAQ,UAAU;AAC3B,WAAO,MAAM,QAAQ;AAAA,EACzB;AACE,MAAI,OAAO,QAAQ,YAAY,IAAI,KAAI,MAAO,IAAI;AAChD,WAAO,OAAO,WAAW,OAAO,SAAS,CAAC,GAAG,IAAI,SAAS,CAAC,GAAG;AAAA,EAClE;AACE,SAAO;AACT;","x_google_ignoreList":[0]}

package/dist/_node_modules/to-regex-range/index.cjs

@@ -162,8 +162,7 @@ function filterPatterns(arr, comparison, prefix, intersection, options) {
 }
 function zip(a, b) {
   let arr = [];
-  for (let i = 0; i < a.length; i++)
-    arr.push([a[i], b[i]]);
+  for (let i = 0; i < a.length; i++) arr.push([a[i], b[i]]);
   return arr;
 }
 function compare(a, b) {

package/dist/_node_modules/to-regex-range/index.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs","sources":["../../../../../node_modules/to-regex-range/index.js"],"sourcesContent":["/*!\n * to-regex-range <https://github.com/micromatch/to-regex-range>\n *\n * Copyright (c) 2015-present, Jon Schlinkert.\n * Released under the MIT License.\n */\n\n'use strict';\n\nconst isNumber = require('is-number');\n\nconst toRegexRange = (min, max, options) => {\n  if (isNumber(min) === false) {\n    throw new TypeError('toRegexRange: expected the first argument to be a number');\n  }\n\n  if (max === void 0 || min === max) {\n    return String(min);\n  }\n\n  if (isNumber(max) === false) {\n    throw new TypeError('toRegexRange: expected the second argument to be a number.');\n  }\n\n  let opts = { relaxZeros: true, ...options };\n  if (typeof opts.strictZeros === 'boolean') {\n    opts.relaxZeros = opts.strictZeros === false;\n  }\n\n  let relax = String(opts.relaxZeros);\n  let shorthand = String(opts.shorthand);\n  let capture = String(opts.capture);\n  let wrap = String(opts.wrap);\n  let cacheKey = min + ':' + max + '=' + relax + shorthand + capture + wrap;\n\n  if (toRegexRange.cache.hasOwnProperty(cacheKey)) {\n    return toRegexRange.cache[cacheKey].result;\n  }\n\n  let a = Math.min(min, max);\n  let b = Math.max(min, max);\n\n  if (Math.abs(a - b) === 1) {\n    let result = min + '|' + max;\n    if (opts.capture) {\n      return `(${result})`;\n    }\n    if (opts.wrap === false) {\n      return result;\n    }\n    return `(?:${result})`;\n  }\n\n  let isPadded = hasPadding(min) || hasPadding(max);\n  let state = { min, max, a, b };\n  let positives = [];\n  let negatives = [];\n\n  if (isPadded) {\n    state.isPadded = isPadded;\n    state.maxLen = String(state.max).length;\n  }\n\n  if (a < 0) {\n    let newMin = b < 0 ? Math.abs(b) : 1;\n    negatives = splitToPatterns(newMin, Math.abs(a), state, opts);\n    a = state.a = 0;\n  }\n\n  if (b >= 0) {\n    positives = splitToPatterns(a, b, state, opts);\n  }\n\n  state.negatives = negatives;\n  state.positives = positives;\n  state.result = collatePatterns(negatives, positives, opts);\n\n  if (opts.capture === true) {\n    state.result = `(${state.result})`;\n  } else if (opts.wrap !== false && (positives.length + negatives.length) > 1) {\n    state.result = `(?:${state.result})`;\n  }\n\n  toRegexRange.cache[cacheKey] = state;\n  return state.result;\n};\n\nfunction collatePatterns(neg, pos, options) {\n  let onlyNegative = filterPatterns(neg, pos, '-', false, options) || [];\n  let onlyPositive = filterPatterns(pos, neg, '', false, options) || [];\n  let intersected = filterPatterns(neg, pos, '-?', true, options) || [];\n  let subpatterns = onlyNegative.concat(intersected).concat(onlyPositive);\n  return subpatterns.join('|');\n}\n\nfunction splitToRanges(min, max) {\n  let nines = 1;\n  let zeros = 1;\n\n  let stop = countNines(min, nines);\n  let stops = new Set([max]);\n\n  while (min <= stop && stop <= max) {\n    stops.add(stop);\n    nines += 1;\n    stop = countNines(min, nines);\n  }\n\n  stop = countZeros(max + 1, zeros) - 1;\n\n  while (min < stop && stop <= max) {\n    stops.add(stop);\n    zeros += 1;\n    stop = countZeros(max + 1, zeros) - 1;\n  }\n\n  stops = [...stops];\n  stops.sort(compare);\n  return stops;\n}\n\n/**\n * Convert a range to a regex pattern\n * @param {Number} `start`\n * @param {Number} `stop`\n * @return {String}\n */\n\nfunction rangeToPattern(start, stop, options) {\n  if (start === stop) {\n    return { pattern: start, count: [], digits: 0 };\n  }\n\n  let zipped = zip(start, stop);\n  let digits = zipped.length;\n  let pattern = '';\n  let count = 0;\n\n  for (let i = 0; i < digits; i++) {\n    let [startDigit, stopDigit] = zipped[i];\n\n    if (startDigit === stopDigit) {\n      pattern += startDigit;\n\n    } else if (startDigit !== '0' || stopDigit !== '9') {\n      pattern += toCharacterClass(startDigit, stopDigit, options);\n\n    } else {\n      count++;\n    }\n  }\n\n  if (count) {\n    pattern += options.shorthand === true ? '\\\\d' : '[0-9]';\n  }\n\n  return { pattern, count: [count], digits };\n}\n\nfunction splitToPatterns(min, max, tok, options) {\n  let ranges = splitToRanges(min, max);\n  let tokens = [];\n  let start = min;\n  let prev;\n\n  for (let i = 0; i < ranges.length; i++) {\n    let max = ranges[i];\n    let obj = rangeToPattern(String(start), String(max), options);\n    let zeros = '';\n\n    if (!tok.isPadded && prev && prev.pattern === obj.pattern) {\n      if (prev.count.length > 1) {\n        prev.count.pop();\n      }\n\n      prev.count.push(obj.count[0]);\n      prev.string = prev.pattern + toQuantifier(prev.count);\n      start = max + 1;\n      continue;\n    }\n\n    if (tok.isPadded) {\n      zeros = padZeros(max, tok, options);\n    }\n\n    obj.string = zeros + obj.pattern + toQuantifier(obj.count);\n    tokens.push(obj);\n    start = max + 1;\n    prev = obj;\n  }\n\n  return tokens;\n}\n\nfunction filterPatterns(arr, comparison, prefix, intersection, options) {\n  let result = [];\n\n  for (let ele of arr) {\n    let { string } = ele;\n\n    // only push if _both_ are negative...\n    if (!intersection && !contains(comparison, 'string', string)) {\n      result.push(prefix + string);\n    }\n\n    // or _both_ are positive\n    if (intersection && contains(comparison, 'string', string)) {\n      result.push(prefix + string);\n    }\n  }\n  return result;\n}\n\n/**\n * Zip strings\n */\n\nfunction zip(a, b) {\n  let arr = [];\n  for (let i = 0; i < a.length; i++) arr.push([a[i], b[i]]);\n  return arr;\n}\n\nfunction compare(a, b) {\n  return a > b ? 1 : b > a ? -1 : 0;\n}\n\nfunction contains(arr, key, val) {\n  return arr.some(ele => ele[key] === val);\n}\n\nfunction countNines(min, len) {\n  return Number(String(min).slice(0, -len) + '9'.repeat(len));\n}\n\nfunction countZeros(integer, zeros) {\n  return integer - (integer % Math.pow(10, zeros));\n}\n\nfunction toQuantifier(digits) {\n  let [start = 0, stop = ''] = digits;\n  if (stop || start > 1) {\n    return `{${start + (stop ? ',' + stop : '')}}`;\n  }\n  return '';\n}\n\nfunction toCharacterClass(a, b, options) {\n  return `[${a}${(b - a === 1) ? '' : '-'}${b}]`;\n}\n\nfunction hasPadding(str) {\n  return /^-?(0+)\\d/.test(str);\n}\n\nfunction padZeros(value, tok, options) {\n  if (!tok.isPadded) {\n    return value;\n  }\n\n  let diff = Math.abs(tok.maxLen - String(value).length);\n  let relax = options.relaxZeros !== false;\n\n  switch (diff) {\n    case 0:\n      return '';\n    case 1:\n      return relax ? '0?' : '0';\n    case 2:\n      return relax ? '0{0,2}' : '00';\n    default: {\n      return relax ? `0{0,${diff}}` : `0{${diff}}`;\n    }\n  }\n}\n\n/**\n * Cache\n */\n\ntoRegexRange.cache = {};\ntoRegexRange.clearCache = () => (toRegexRange.cache = {});\n\n/**\n * Expose `toRegexRange`\n */\n\nmodule.exports = toRegexRange;\n"],"names":["require$$0","max"],"mappings":";;;;;;;;;AASA,MAAM,WAAWA,MAAAA;AAEjB,MAAM,eAAe,CAAC,KAAK,KAAK,YAAY;AAC1C,MAAI,SAAS,GAAG,MAAM,OAAO;AAC3B,UAAM,IAAI,UAAU,0DAA0D;AAAA,EAC/E;AAED,MAAI,QAAQ,UAAU,QAAQ,KAAK;AACjC,WAAO,OAAO,GAAG;AAAA,EAClB;AAED,MAAI,SAAS,GAAG,MAAM,OAAO;AAC3B,UAAM,IAAI,UAAU,4DAA4D;AAAA,EACjF;AAED,MAAI,OAAO,EAAE,YAAY,MAAM,GAAG,QAAO;AACzC,MAAI,OAAO,KAAK,gBAAgB,WAAW;AACzC,SAAK,aAAa,KAAK,gBAAgB;AAAA,EACxC;AAED,MAAI,QAAQ,OAAO,KAAK,UAAU;AAClC,MAAI,YAAY,OAAO,KAAK,SAAS;AACrC,MAAI,UAAU,OAAO,KAAK,OAAO;AACjC,MAAI,OAAO,OAAO,KAAK,IAAI;AAC3B,MAAI,WAAW,MAAM,MAAM,MAAM,MAAM,QAAQ,YAAY,UAAU;AAErE,MAAI,aAAa,MAAM,eAAe,QAAQ,GAAG;AAC/C,WAAO,aAAa,MAAM,QAAQ,EAAE;AAAA,EACrC;AAED,MAAI,IAAI,KAAK,IAAI,KAAK,GAAG;AACzB,MAAI,IAAI,KAAK,IAAI,KAAK,GAAG;AAEzB,MAAI,KAAK,IAAI,IAAI,CAAC,MAAM,GAAG;AACzB,QAAI,SAAS,MAAM,MAAM;AACzB,QAAI,KAAK,SAAS;AAChB,aAAO,IAAI,MAAM;AAAA,IAClB;AACD,QAAI,KAAK,SAAS,OAAO;AACvB,aAAO;AAAA,IACR;AACD,WAAO,MAAM,MAAM;AAAA,EACpB;AAED,MAAI,WAAW,WAAW,GAAG,KAAK,WAAW,GAAG;AAChD,MAAI,QAAQ,EAAE,KAAK,KAAK,GAAG,EAAC;AAC5B,MAAI,YAAY,CAAA;AAChB,MAAI,YAAY,CAAA;AAEhB,MAAI,UAAU;AACZ,UAAM,WAAW;AACjB,UAAM,SAAS,OAAO,MAAM,GAAG,EAAE;AAAA,EAClC;AAED,MAAI,IAAI,GAAG;AACT,QAAI,SAAS,IAAI,IAAI,KAAK,IAAI,CAAC,IAAI;AACnC,gBAAY,gBAAgB,QAAQ,KAAK,IAAI,CAAC,GAAG,OAAO,IAAI;AAC5D,QAAI,MAAM,IAAI;AAAA,EACf;AAED,MAAI,KAAK,GAAG;AACV,gBAAY,gBAAgB,GAAG,GAAG,OAAO,IAAI;AAAA,EAC9C;AAED,QAAM,YAAY;AAClB,QAAM,YAAY;AAClB,QAAM,SAAS,gBAAgB,WAAW,SAAe;AAEzD,MAAI,KAAK,YAAY,MAAM;AACzB,UAAM,SAAS,IAAI,MAAM,MAAM;AAAA,EACnC,WAAa,KAAK,SAAS,SAAU,UAAU,SAAS,UAAU,SAAU,GAAG;AAC3E,UAAM,SAAS,MAAM,MAAM,MAAM;AAAA,EAClC;AAED,eAAa,MAAM,QAAQ,IAAI;AAC/B,SAAO,MAAM;AACf;AAEA,SAAS,gBAAgB,KAAK,KAAK,SAAS;AAC1C,MAAI,eAAe,eAAe,KAAK,KAAK,KAAK,KAAc,KAAK;AACpE,MAAI,eAAe,eAAe,KAAK,KAAK,IAAI,KAAc,KAAK;AACnE,MAAI,cAAc,eAAe,KAAK,KAAK,MAAM,IAAa,KAAK;AACnE,MAAI,cAAc,aAAa,OAAO,WAAW,EAAE,OAAO,YAAY;AACtE,SAAO,YAAY,KAAK,GAAG;AAC7B;AAEA,SAAS,cAAc,KAAK,KAAK;AAC/B,MAAI,QAAQ;AACZ,MAAI,QAAQ;AAEZ,MAAI,OAAO,WAAW,KAAK,KAAK;AAChC,MAAI,QAAQ,oBAAI,IAAI,CAAC,GAAG,CAAC;AAEzB,SAAO,OAAO,QAAQ,QAAQ,KAAK;AACjC,UAAM,IAAI,IAAI;AACd,aAAS;AACT,WAAO,WAAW,KAAK,KAAK;AAAA,EAC7B;AAED,SAAO,WAAW,MAAM,GAAG,KAAK,IAAI;AAEpC,SAAO,MAAM,QAAQ,QAAQ,KAAK;AAChC,UAAM,IAAI,IAAI;AACd,aAAS;AACT,WAAO,WAAW,MAAM,GAAG,KAAK,IAAI;AAAA,EACrC;AAED,UAAQ,CAAC,GAAG,KAAK;AACjB,QAAM,KAAK,OAAO;AAClB,SAAO;AACT;AASA,SAAS,eAAe,OAAO,MAAM,SAAS;AAC5C,MAAI,UAAU,MAAM;AAClB,WAAO,EAAE,SAAS,OAAO,OAAO,CAAA,GAAI,QAAQ;EAC7C;AAED,MAAI,SAAS,IAAI,OAAO,IAAI;AAC5B,MAAI,SAAS,OAAO;AACpB,MAAI,UAAU;AACd,MAAI,QAAQ;AAEZ,WAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,QAAI,CAAC,YAAY,SAAS,IAAI,OAAO,CAAC;AAEtC,QAAI,eAAe,WAAW;AAC5B,iBAAW;AAAA,IAEZ,WAAU,eAAe,OAAO,cAAc,KAAK;AAClD,iBAAW,iBAAiB,YAAY,SAAkB;AAAA,IAEhE,OAAW;AACL;AAAA,IACD;AAAA,EACF;AAED,MAAI,OAAO;AACT,eAAW,QAAQ,cAAc,OAAO,QAAQ;AAAA,EACjD;AAED,SAAO,EAAE,SAAS,OAAO,CAAC,KAAK,GAAG,OAAM;AAC1C;AAEA,SAAS,gBAAgB,KAAK,KAAK,KAAK,SAAS;AAC/C,MAAI,SAAS,cAAc,KAAK,GAAG;AACnC,MAAI,SAAS,CAAA;AACb,MAAI,QAAQ;AACZ,MAAI;AAEJ,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,QAAIC,OAAM,OAAO,CAAC;AAClB,QAAI,MAAM,eAAe,OAAO,KAAK,GAAG,OAAOA,IAAG,GAAG,OAAO;AAC5D,QAAI,QAAQ;AAEZ,QAAI,CAAC,IAAI,YAAY,QAAQ,KAAK,YAAY,IAAI,SAAS;AACzD,UAAI,KAAK,MAAM,SAAS,GAAG;AACzB,aAAK,MAAM;MACZ;AAED,WAAK,MAAM,KAAK,IAAI,MAAM,CAAC,CAAC;AAC5B,WAAK,SAAS,KAAK,UAAU,aAAa,KAAK,KAAK;AACpD,cAAQA,OAAM;AACd;AAAA,IACD;AAED,QAAI,IAAI,UAAU;AAChB,cAAQ,SAASA,MAAK,KAAK,OAAO;AAAA,IACnC;AAED,QAAI,SAAS,QAAQ,IAAI,UAAU,aAAa,IAAI,KAAK;AACzD,WAAO,KAAK,GAAG;AACf,YAAQA,OAAM;AACd,WAAO;AAAA,EACR;AAED,SAAO;AACT;AAEA,SAAS,eAAe,KAAK,YAAY,QAAQ,cAAc,SAAS;AACtE,MAAI,SAAS,CAAA;AAEb,WAAS,OAAO,KAAK;AACnB,QAAI,EAAE,OAAQ,IAAG;AAGjB,QAAI,CAAC,gBAAgB,CAAC,SAAS,YAAY,UAAU,MAAM,GAAG;AAC5D,aAAO,KAAK,SAAS,MAAM;AAAA,IAC5B;AAGD,QAAI,gBAAgB,SAAS,YAAY,UAAU,MAAM,GAAG;AAC1D,aAAO,KAAK,SAAS,MAAM;AAAA,IAC5B;AAAA,EACF;AACD,SAAO;AACT;AAMA,SAAS,IAAI,GAAG,GAAG;AACjB,MAAI,MAAM,CAAA;AACV,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ;AAAK,QAAI,KAAK,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;AACxD,SAAO;AACT;AAEA,SAAS,QAAQ,GAAG,GAAG;AACrB,SAAO,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK;AAClC;AAEA,SAAS,SAAS,KAAK,KAAK,KAAK;AAC/B,SAAO,IAAI,KAAK,SAAO,IAAI,GAAG,MAAM,GAAG;AACzC;AAEA,SAAS,WAAW,KAAK,KAAK;AAC5B,SAAO,OAAO,OAAO,GAAG,EAAE,MAAM,GAAG,CAAC,GAAG,IAAI,IAAI,OAAO,GAAG,CAAC;AAC5D;AAEA,SAAS,WAAW,SAAS,OAAO;AAClC,SAAO,UAAW,UAAU,KAAK,IAAI,IAAI,KAAK;AAChD;AAEA,SAAS,aAAa,QAAQ;AAC5B,MAAI,CAAC,QAAQ,GAAG,OAAO,EAAE,IAAI;AAC7B,MAAI,QAAQ,QAAQ,GAAG;AACrB,WAAO,IAAI,SAAS,OAAO,MAAM,OAAO,GAAG;AAAA,EAC5C;AACD,SAAO;AACT;AAEA,SAAS,iBAAiB,GAAG,GAAG,SAAS;AACvC,SAAO,IAAI,CAAC,GAAI,IAAI,MAAM,IAAK,KAAK,GAAG,GAAG,CAAC;AAC7C;AAEA,SAAS,WAAW,KAAK;AACvB,SAAO,YAAY,KAAK,GAAG;AAC7B;AAEA,SAAS,SAAS,OAAO,KAAK,SAAS;AACrC,MAAI,CAAC,IAAI,UAAU;AACjB,WAAO;AAAA,EACR;AAED,MAAI,OAAO,KAAK,IAAI,IAAI,SAAS,OAAO,KAAK,EAAE,MAAM;AACrD,MAAI,QAAQ,QAAQ,eAAe;AAEnC,UAAQ,MAAI;AAAA,IACV,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO,QAAQ,OAAO;AAAA,IACxB,KAAK;AACH,aAAO,QAAQ,WAAW;AAAA,IAC5B,SAAS;AACP,aAAO,QAAQ,OAAO,IAAI,MAAM,KAAK,IAAI;AAAA,IAC1C;AAAA,EACF;AACH;AAMA,aAAa,QAAQ,CAAA;AACrB,aAAa,aAAa,MAAO,aAAa,QAAQ,CAAE;AAMxD,IAAA,iBAAiB;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs","sources":["../../../../../node_modules/to-regex-range/index.js"],"sourcesContent":["/*!\n * to-regex-range <https://github.com/micromatch/to-regex-range>\n *\n * Copyright (c) 2015-present, Jon Schlinkert.\n * Released under the MIT License.\n */\n\n'use strict';\n\nconst isNumber = require('is-number');\n\nconst toRegexRange = (min, max, options) => {\n  if (isNumber(min) === false) {\n    throw new TypeError('toRegexRange: expected the first argument to be a number');\n  }\n\n  if (max === void 0 || min === max) {\n    return String(min);\n  }\n\n  if (isNumber(max) === false) {\n    throw new TypeError('toRegexRange: expected the second argument to be a number.');\n  }\n\n  let opts = { relaxZeros: true, ...options };\n  if (typeof opts.strictZeros === 'boolean') {\n    opts.relaxZeros = opts.strictZeros === false;\n  }\n\n  let relax = String(opts.relaxZeros);\n  let shorthand = String(opts.shorthand);\n  let capture = String(opts.capture);\n  let wrap = String(opts.wrap);\n  let cacheKey = min + ':' + max + '=' + relax + shorthand + capture + wrap;\n\n  if (toRegexRange.cache.hasOwnProperty(cacheKey)) {\n    return toRegexRange.cache[cacheKey].result;\n  }\n\n  let a = Math.min(min, max);\n  let b = Math.max(min, max);\n\n  if (Math.abs(a - b) === 1) {\n    let result = min + '|' + max;\n    if (opts.capture) {\n      return `(${result})`;\n    }\n    if (opts.wrap === false) {\n      return result;\n    }\n    return `(?:${result})`;\n  }\n\n  let isPadded = hasPadding(min) || hasPadding(max);\n  let state = { min, max, a, b };\n  let positives = [];\n  let negatives = [];\n\n  if (isPadded) {\n    state.isPadded = isPadded;\n    state.maxLen = String(state.max).length;\n  }\n\n  if (a < 0) {\n    let newMin = b < 0 ? Math.abs(b) : 1;\n    negatives = splitToPatterns(newMin, Math.abs(a), state, opts);\n    a = state.a = 0;\n  }\n\n  if (b >= 0) {\n    positives = splitToPatterns(a, b, state, opts);\n  }\n\n  state.negatives = negatives;\n  state.positives = positives;\n  state.result = collatePatterns(negatives, positives, opts);\n\n  if (opts.capture === true) {\n    state.result = `(${state.result})`;\n  } else if (opts.wrap !== false && (positives.length + negatives.length) > 1) {\n    state.result = `(?:${state.result})`;\n  }\n\n  toRegexRange.cache[cacheKey] = state;\n  return state.result;\n};\n\nfunction collatePatterns(neg, pos, options) {\n  let onlyNegative = filterPatterns(neg, pos, '-', false, options) || [];\n  let onlyPositive = filterPatterns(pos, neg, '', false, options) || [];\n  let intersected = filterPatterns(neg, pos, '-?', true, options) || [];\n  let subpatterns = onlyNegative.concat(intersected).concat(onlyPositive);\n  return subpatterns.join('|');\n}\n\nfunction splitToRanges(min, max) {\n  let nines = 1;\n  let zeros = 1;\n\n  let stop = countNines(min, nines);\n  let stops = new Set([max]);\n\n  while (min <= stop && stop <= max) {\n    stops.add(stop);\n    nines += 1;\n    stop = countNines(min, nines);\n  }\n\n  stop = countZeros(max + 1, zeros) - 1;\n\n  while (min < stop && stop <= max) {\n    stops.add(stop);\n    zeros += 1;\n    stop = countZeros(max + 1, zeros) - 1;\n  }\n\n  stops = [...stops];\n  stops.sort(compare);\n  return stops;\n}\n\n/**\n * Convert a range to a regex pattern\n * @param {Number} `start`\n * @param {Number} `stop`\n * @return {String}\n */\n\nfunction rangeToPattern(start, stop, options) {\n  if (start === stop) {\n    return { pattern: start, count: [], digits: 0 };\n  }\n\n  let zipped = zip(start, stop);\n  let digits = zipped.length;\n  let pattern = '';\n  let count = 0;\n\n  for (let i = 0; i < digits; i++) {\n    let [startDigit, stopDigit] = zipped[i];\n\n    if (startDigit === stopDigit) {\n      pattern += startDigit;\n\n    } else if (startDigit !== '0' || stopDigit !== '9') {\n      pattern += toCharacterClass(startDigit, stopDigit, options);\n\n    } else {\n      count++;\n    }\n  }\n\n  if (count) {\n    pattern += options.shorthand === true ? '\\\\d' : '[0-9]';\n  }\n\n  return { pattern, count: [count], digits };\n}\n\nfunction splitToPatterns(min, max, tok, options) {\n  let ranges = splitToRanges(min, max);\n  let tokens = [];\n  let start = min;\n  let prev;\n\n  for (let i = 0; i < ranges.length; i++) {\n    let max = ranges[i];\n    let obj = rangeToPattern(String(start), String(max), options);\n    let zeros = '';\n\n    if (!tok.isPadded && prev && prev.pattern === obj.pattern) {\n      if (prev.count.length > 1) {\n        prev.count.pop();\n      }\n\n      prev.count.push(obj.count[0]);\n      prev.string = prev.pattern + toQuantifier(prev.count);\n      start = max + 1;\n      continue;\n    }\n\n    if (tok.isPadded) {\n      zeros = padZeros(max, tok, options);\n    }\n\n    obj.string = zeros + obj.pattern + toQuantifier(obj.count);\n    tokens.push(obj);\n    start = max + 1;\n    prev = obj;\n  }\n\n  return tokens;\n}\n\nfunction filterPatterns(arr, comparison, prefix, intersection, options) {\n  let result = [];\n\n  for (let ele of arr) {\n    let { string } = ele;\n\n    // only push if _both_ are negative...\n    if (!intersection && !contains(comparison, 'string', string)) {\n      result.push(prefix + string);\n    }\n\n    // or _both_ are positive\n    if (intersection && contains(comparison, 'string', string)) {\n      result.push(prefix + string);\n    }\n  }\n  return result;\n}\n\n/**\n * Zip strings\n */\n\nfunction zip(a, b) {\n  let arr = [];\n  for (let i = 0; i < a.length; i++) arr.push([a[i], b[i]]);\n  return arr;\n}\n\nfunction compare(a, b) {\n  return a > b ? 1 : b > a ? -1 : 0;\n}\n\nfunction contains(arr, key, val) {\n  return arr.some(ele => ele[key] === val);\n}\n\nfunction countNines(min, len) {\n  return Number(String(min).slice(0, -len) + '9'.repeat(len));\n}\n\nfunction countZeros(integer, zeros) {\n  return integer - (integer % Math.pow(10, zeros));\n}\n\nfunction toQuantifier(digits) {\n  let [start = 0, stop = ''] = digits;\n  if (stop || start > 1) {\n    return `{${start + (stop ? ',' + stop : '')}}`;\n  }\n  return '';\n}\n\nfunction toCharacterClass(a, b, options) {\n  return `[${a}${(b - a === 1) ? '' : '-'}${b}]`;\n}\n\nfunction hasPadding(str) {\n  return /^-?(0+)\\d/.test(str);\n}\n\nfunction padZeros(value, tok, options) {\n  if (!tok.isPadded) {\n    return value;\n  }\n\n  let diff = Math.abs(tok.maxLen - String(value).length);\n  let relax = options.relaxZeros !== false;\n\n  switch (diff) {\n    case 0:\n      return '';\n    case 1:\n      return relax ? '0?' : '0';\n    case 2:\n      return relax ? '0{0,2}' : '00';\n    default: {\n      return relax ? `0{0,${diff}}` : `0{${diff}}`;\n    }\n  }\n}\n\n/**\n * Cache\n */\n\ntoRegexRange.cache = {};\ntoRegexRange.clearCache = () => (toRegexRange.cache = {});\n\n/**\n * Expose `toRegexRange`\n */\n\nmodule.exports = toRegexRange;\n"],"names":["require$$0","max"],"mappings":";;;;;;;;;AASA,MAAM,WAAWA,MAAAA;AAEjB,MAAM,eAAe,CAAC,KAAK,KAAK,YAAY;AAC1C,MAAI,SAAS,GAAG,MAAM,OAAO;AAC3B,UAAM,IAAI,UAAU,0DAA0D;AAAA,EAClF;AAEE,MAAI,QAAQ,UAAU,QAAQ,KAAK;AACjC,WAAO,OAAO,GAAG;AAAA,EACrB;AAEE,MAAI,SAAS,GAAG,MAAM,OAAO;AAC3B,UAAM,IAAI,UAAU,4DAA4D;AAAA,EACpF;AAEE,MAAI,OAAO,EAAE,YAAY,MAAM,GAAG,QAAO;AACzC,MAAI,OAAO,KAAK,gBAAgB,WAAW;AACzC,SAAK,aAAa,KAAK,gBAAgB;AAAA,EAC3C;AAEE,MAAI,QAAQ,OAAO,KAAK,UAAU;AAClC,MAAI,YAAY,OAAO,KAAK,SAAS;AACrC,MAAI,UAAU,OAAO,KAAK,OAAO;AACjC,MAAI,OAAO,OAAO,KAAK,IAAI;AAC3B,MAAI,WAAW,MAAM,MAAM,MAAM,MAAM,QAAQ,YAAY,UAAU;AAErE,MAAI,aAAa,MAAM,eAAe,QAAQ,GAAG;AAC/C,WAAO,aAAa,MAAM,QAAQ,EAAE;AAAA,EACxC;AAEE,MAAI,IAAI,KAAK,IAAI,KAAK,GAAG;AACzB,MAAI,IAAI,KAAK,IAAI,KAAK,GAAG;AAEzB,MAAI,KAAK,IAAI,IAAI,CAAC,MAAM,GAAG;AACzB,QAAI,SAAS,MAAM,MAAM;AACzB,QAAI,KAAK,SAAS;AAChB,aAAO,IAAI,MAAM;AAAA,IACvB;AACI,QAAI,KAAK,SAAS,OAAO;AACvB,aAAO;AAAA,IACb;AACI,WAAO,MAAM,MAAM;AAAA,EACvB;AAEE,MAAI,WAAW,WAAW,GAAG,KAAK,WAAW,GAAG;AAChD,MAAI,QAAQ,EAAE,KAAK,KAAK,GAAG,EAAC;AAC5B,MAAI,YAAY,CAAA;AAChB,MAAI,YAAY,CAAA;AAEhB,MAAI,UAAU;AACZ,UAAM,WAAW;AACjB,UAAM,SAAS,OAAO,MAAM,GAAG,EAAE;AAAA,EACrC;AAEE,MAAI,IAAI,GAAG;AACT,QAAI,SAAS,IAAI,IAAI,KAAK,IAAI,CAAC,IAAI;AACnC,gBAAY,gBAAgB,QAAQ,KAAK,IAAI,CAAC,GAAG,OAAO,IAAI;AAC5D,QAAI,MAAM,IAAI;AAAA,EAClB;AAEE,MAAI,KAAK,GAAG;AACV,gBAAY,gBAAgB,GAAG,GAAG,OAAO,IAAI;AAAA,EACjD;AAEE,QAAM,YAAY;AAClB,QAAM,YAAY;AAClB,QAAM,SAAS,gBAAgB,WAAW,SAAe;AAEzD,MAAI,KAAK,YAAY,MAAM;AACzB,UAAM,SAAS,IAAI,MAAM,MAAM;AAAA,EACnC,WAAa,KAAK,SAAS,SAAU,UAAU,SAAS,UAAU,SAAU,GAAG;AAC3E,UAAM,SAAS,MAAM,MAAM,MAAM;AAAA,EACrC;AAEE,eAAa,MAAM,QAAQ,IAAI;AAC/B,SAAO,MAAM;AACf;AAEA,SAAS,gBAAgB,KAAK,KAAK,SAAS;AAC1C,MAAI,eAAe,eAAe,KAAK,KAAK,KAAK,KAAc,KAAK,CAAA;AACpE,MAAI,eAAe,eAAe,KAAK,KAAK,IAAI,KAAc,KAAK,CAAA;AACnE,MAAI,cAAc,eAAe,KAAK,KAAK,MAAM,IAAa,KAAK,CAAA;AACnE,MAAI,cAAc,aAAa,OAAO,WAAW,EAAE,OAAO,YAAY;AACtE,SAAO,YAAY,KAAK,GAAG;AAC7B;AAEA,SAAS,cAAc,KAAK,KAAK;AAC/B,MAAI,QAAQ;AACZ,MAAI,QAAQ;AAEZ,MAAI,OAAO,WAAW,KAAK,KAAK;AAChC,MAAI,QAAQ,oBAAI,IAAI,CAAC,GAAG,CAAC;AAEzB,SAAO,OAAO,QAAQ,QAAQ,KAAK;AACjC,UAAM,IAAI,IAAI;AACd,aAAS;AACT,WAAO,WAAW,KAAK,KAAK;AAAA,EAChC;AAEE,SAAO,WAAW,MAAM,GAAG,KAAK,IAAI;AAEpC,SAAO,MAAM,QAAQ,QAAQ,KAAK;AAChC,UAAM,IAAI,IAAI;AACd,aAAS;AACT,WAAO,WAAW,MAAM,GAAG,KAAK,IAAI;AAAA,EACxC;AAEE,UAAQ,CAAC,GAAG,KAAK;AACjB,QAAM,KAAK,OAAO;AAClB,SAAO;AACT;AASA,SAAS,eAAe,OAAO,MAAM,SAAS;AAC5C,MAAI,UAAU,MAAM;AAClB,WAAO,EAAE,SAAS,OAAO,OAAO,CAAA,GAAI,QAAQ,EAAC;AAAA,EACjD;AAEE,MAAI,SAAS,IAAI,OAAO,IAAI;AAC5B,MAAI,SAAS,OAAO;AACpB,MAAI,UAAU;AACd,MAAI,QAAQ;AAEZ,WAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,QAAI,CAAC,YAAY,SAAS,IAAI,OAAO,CAAC;AAEtC,QAAI,eAAe,WAAW;AAC5B,iBAAW;AAAA,IAEjB,WAAe,eAAe,OAAO,cAAc,KAAK;AAClD,iBAAW,iBAAiB,YAAY,SAAkB;AAAA,IAEhE,OAAW;AACL;AAAA,IACN;AAAA,EACA;AAEE,MAAI,OAAO;AACT,eAAW,QAAQ,cAAc,OAAO,QAAQ;AAAA,EACpD;AAEE,SAAO,EAAE,SAAS,OAAO,CAAC,KAAK,GAAG,OAAM;AAC1C;AAEA,SAAS,gBAAgB,KAAK,KAAK,KAAK,SAAS;AAC/C,MAAI,SAAS,cAAc,KAAK,GAAG;AACnC,MAAI,SAAS,CAAA;AACb,MAAI,QAAQ;AACZ,MAAI;AAEJ,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,QAAIC,OAAM,OAAO,CAAC;AAClB,QAAI,MAAM,eAAe,OAAO,KAAK,GAAG,OAAOA,IAAG,GAAG,OAAO;AAC5D,QAAI,QAAQ;AAEZ,QAAI,CAAC,IAAI,YAAY,QAAQ,KAAK,YAAY,IAAI,SAAS;AACzD,UAAI,KAAK,MAAM,SAAS,GAAG;AACzB,aAAK,MAAM,IAAG;AAAA,MACtB;AAEM,WAAK,MAAM,KAAK,IAAI,MAAM,CAAC,CAAC;AAC5B,WAAK,SAAS,KAAK,UAAU,aAAa,KAAK,KAAK;AACpD,cAAQA,OAAM;AACd;AAAA,IACN;AAEI,QAAI,IAAI,UAAU;AAChB,cAAQ,SAASA,MAAK,KAAK,OAAO;AAAA,IACxC;AAEI,QAAI,SAAS,QAAQ,IAAI,UAAU,aAAa,IAAI,KAAK;AACzD,WAAO,KAAK,GAAG;AACf,YAAQA,OAAM;AACd,WAAO;AAAA,EACX;AAEE,SAAO;AACT;AAEA,SAAS,eAAe,KAAK,YAAY,QAAQ,cAAc,SAAS;AACtE,MAAI,SAAS,CAAA;AAEb,WAAS,OAAO,KAAK;AACnB,QAAI,EAAE,OAAM,IAAK;AAGjB,QAAI,CAAC,gBAAgB,CAAC,SAAS,YAAY,UAAU,MAAM,GAAG;AAC5D,aAAO,KAAK,SAAS,MAAM;AAAA,IACjC;AAGI,QAAI,gBAAgB,SAAS,YAAY,UAAU,MAAM,GAAG;AAC1D,aAAO,KAAK,SAAS,MAAM;AAAA,IACjC;AAAA,EACA;AACE,SAAO;AACT;AAMA,SAAS,IAAI,GAAG,GAAG;AACjB,MAAI,MAAM,CAAA;AACV,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,IAAK,KAAI,KAAK,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;AACxD,SAAO;AACT;AAEA,SAAS,QAAQ,GAAG,GAAG;AACrB,SAAO,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK;AAClC;AAEA,SAAS,SAAS,KAAK,KAAK,KAAK;AAC/B,SAAO,IAAI,KAAK,SAAO,IAAI,GAAG,MAAM,GAAG;AACzC;AAEA,SAAS,WAAW,KAAK,KAAK;AAC5B,SAAO,OAAO,OAAO,GAAG,EAAE,MAAM,GAAG,CAAC,GAAG,IAAI,IAAI,OAAO,GAAG,CAAC;AAC5D;AAEA,SAAS,WAAW,SAAS,OAAO;AAClC,SAAO,UAAW,UAAU,KAAK,IAAI,IAAI,KAAK;AAChD;AAEA,SAAS,aAAa,QAAQ;AAC5B,MAAI,CAAC,QAAQ,GAAG,OAAO,EAAE,IAAI;AAC7B,MAAI,QAAQ,QAAQ,GAAG;AACrB,WAAO,IAAI,SAAS,OAAO,MAAM,OAAO,GAAG;AAAA,EAC/C;AACE,SAAO;AACT;AAEA,SAAS,iBAAiB,GAAG,GAAG,SAAS;AACvC,SAAO,IAAI,CAAC,GAAI,IAAI,MAAM,IAAK,KAAK,GAAG,GAAG,CAAC;AAC7C;AAEA,SAAS,WAAW,KAAK;AACvB,SAAO,YAAY,KAAK,GAAG;AAC7B;AAEA,SAAS,SAAS,OAAO,KAAK,SAAS;AACrC,MAAI,CAAC,IAAI,UAAU;AACjB,WAAO;AAAA,EACX;AAEE,MAAI,OAAO,KAAK,IAAI,IAAI,SAAS,OAAO,KAAK,EAAE,MAAM;AACrD,MAAI,QAAQ,QAAQ,eAAe;AAEnC,UAAQ,MAAI;AAAA,IACV,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO,QAAQ,OAAO;AAAA,IACxB,KAAK;AACH,aAAO,QAAQ,WAAW;AAAA,IAC5B,SAAS;AACP,aAAO,QAAQ,OAAO,IAAI,MAAM,KAAK,IAAI;AAAA,IAC/C;AAAA,EACA;AACA;AAMA,aAAa,QAAQ,CAAA;AACrB,aAAa,aAAa,MAAO,aAAa,QAAQ,CAAA;AAMtD,IAAA,iBAAiB;;","x_google_ignoreList":[0]}

package/dist/_node_modules/to-regex-range/index.js

@@ -160,8 +160,7 @@ function filterPatterns(arr, comparison, prefix, intersection, options) {
 }
 function zip(a, b) {
   let arr = [];
-  for (let i = 0; i < a.length; i++)
-    arr.push([a[i], b[i]]);
+  for (let i = 0; i < a.length; i++) arr.push([a[i], b[i]]);
   return arr;
 }
 function compare(a, b) {

package/dist/_node_modules/to-regex-range/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sources":["../../../../../node_modules/to-regex-range/index.js"],"sourcesContent":["/*!\n * to-regex-range <https://github.com/micromatch/to-regex-range>\n *\n * Copyright (c) 2015-present, Jon Schlinkert.\n * Released under the MIT License.\n */\n\n'use strict';\n\nconst isNumber = require('is-number');\n\nconst toRegexRange = (min, max, options) => {\n  if (isNumber(min) === false) {\n    throw new TypeError('toRegexRange: expected the first argument to be a number');\n  }\n\n  if (max === void 0 || min === max) {\n    return String(min);\n  }\n\n  if (isNumber(max) === false) {\n    throw new TypeError('toRegexRange: expected the second argument to be a number.');\n  }\n\n  let opts = { relaxZeros: true, ...options };\n  if (typeof opts.strictZeros === 'boolean') {\n    opts.relaxZeros = opts.strictZeros === false;\n  }\n\n  let relax = String(opts.relaxZeros);\n  let shorthand = String(opts.shorthand);\n  let capture = String(opts.capture);\n  let wrap = String(opts.wrap);\n  let cacheKey = min + ':' + max + '=' + relax + shorthand + capture + wrap;\n\n  if (toRegexRange.cache.hasOwnProperty(cacheKey)) {\n    return toRegexRange.cache[cacheKey].result;\n  }\n\n  let a = Math.min(min, max);\n  let b = Math.max(min, max);\n\n  if (Math.abs(a - b) === 1) {\n    let result = min + '|' + max;\n    if (opts.capture) {\n      return `(${result})`;\n    }\n    if (opts.wrap === false) {\n      return result;\n    }\n    return `(?:${result})`;\n  }\n\n  let isPadded = hasPadding(min) || hasPadding(max);\n  let state = { min, max, a, b };\n  let positives = [];\n  let negatives = [];\n\n  if (isPadded) {\n    state.isPadded = isPadded;\n    state.maxLen = String(state.max).length;\n  }\n\n  if (a < 0) {\n    let newMin = b < 0 ? Math.abs(b) : 1;\n    negatives = splitToPatterns(newMin, Math.abs(a), state, opts);\n    a = state.a = 0;\n  }\n\n  if (b >= 0) {\n    positives = splitToPatterns(a, b, state, opts);\n  }\n\n  state.negatives = negatives;\n  state.positives = positives;\n  state.result = collatePatterns(negatives, positives, opts);\n\n  if (opts.capture === true) {\n    state.result = `(${state.result})`;\n  } else if (opts.wrap !== false && (positives.length + negatives.length) > 1) {\n    state.result = `(?:${state.result})`;\n  }\n\n  toRegexRange.cache[cacheKey] = state;\n  return state.result;\n};\n\nfunction collatePatterns(neg, pos, options) {\n  let onlyNegative = filterPatterns(neg, pos, '-', false, options) || [];\n  let onlyPositive = filterPatterns(pos, neg, '', false, options) || [];\n  let intersected = filterPatterns(neg, pos, '-?', true, options) || [];\n  let subpatterns = onlyNegative.concat(intersected).concat(onlyPositive);\n  return subpatterns.join('|');\n}\n\nfunction splitToRanges(min, max) {\n  let nines = 1;\n  let zeros = 1;\n\n  let stop = countNines(min, nines);\n  let stops = new Set([max]);\n\n  while (min <= stop && stop <= max) {\n    stops.add(stop);\n    nines += 1;\n    stop = countNines(min, nines);\n  }\n\n  stop = countZeros(max + 1, zeros) - 1;\n\n  while (min < stop && stop <= max) {\n    stops.add(stop);\n    zeros += 1;\n    stop = countZeros(max + 1, zeros) - 1;\n  }\n\n  stops = [...stops];\n  stops.sort(compare);\n  return stops;\n}\n\n/**\n * Convert a range to a regex pattern\n * @param {Number} `start`\n * @param {Number} `stop`\n * @return {String}\n */\n\nfunction rangeToPattern(start, stop, options) {\n  if (start === stop) {\n    return { pattern: start, count: [], digits: 0 };\n  }\n\n  let zipped = zip(start, stop);\n  let digits = zipped.length;\n  let pattern = '';\n  let count = 0;\n\n  for (let i = 0; i < digits; i++) {\n    let [startDigit, stopDigit] = zipped[i];\n\n    if (startDigit === stopDigit) {\n      pattern += startDigit;\n\n    } else if (startDigit !== '0' || stopDigit !== '9') {\n      pattern += toCharacterClass(startDigit, stopDigit, options);\n\n    } else {\n      count++;\n    }\n  }\n\n  if (count) {\n    pattern += options.shorthand === true ? '\\\\d' : '[0-9]';\n  }\n\n  return { pattern, count: [count], digits };\n}\n\nfunction splitToPatterns(min, max, tok, options) {\n  let ranges = splitToRanges(min, max);\n  let tokens = [];\n  let start = min;\n  let prev;\n\n  for (let i = 0; i < ranges.length; i++) {\n    let max = ranges[i];\n    let obj = rangeToPattern(String(start), String(max), options);\n    let zeros = '';\n\n    if (!tok.isPadded && prev && prev.pattern === obj.pattern) {\n      if (prev.count.length > 1) {\n        prev.count.pop();\n      }\n\n      prev.count.push(obj.count[0]);\n      prev.string = prev.pattern + toQuantifier(prev.count);\n      start = max + 1;\n      continue;\n    }\n\n    if (tok.isPadded) {\n      zeros = padZeros(max, tok, options);\n    }\n\n    obj.string = zeros + obj.pattern + toQuantifier(obj.count);\n    tokens.push(obj);\n    start = max + 1;\n    prev = obj;\n  }\n\n  return tokens;\n}\n\nfunction filterPatterns(arr, comparison, prefix, intersection, options) {\n  let result = [];\n\n  for (let ele of arr) {\n    let { string } = ele;\n\n    // only push if _both_ are negative...\n    if (!intersection && !contains(comparison, 'string', string)) {\n      result.push(prefix + string);\n    }\n\n    // or _both_ are positive\n    if (intersection && contains(comparison, 'string', string)) {\n      result.push(prefix + string);\n    }\n  }\n  return result;\n}\n\n/**\n * Zip strings\n */\n\nfunction zip(a, b) {\n  let arr = [];\n  for (let i = 0; i < a.length; i++) arr.push([a[i], b[i]]);\n  return arr;\n}\n\nfunction compare(a, b) {\n  return a > b ? 1 : b > a ? -1 : 0;\n}\n\nfunction contains(arr, key, val) {\n  return arr.some(ele => ele[key] === val);\n}\n\nfunction countNines(min, len) {\n  return Number(String(min).slice(0, -len) + '9'.repeat(len));\n}\n\nfunction countZeros(integer, zeros) {\n  return integer - (integer % Math.pow(10, zeros));\n}\n\nfunction toQuantifier(digits) {\n  let [start = 0, stop = ''] = digits;\n  if (stop || start > 1) {\n    return `{${start + (stop ? ',' + stop : '')}}`;\n  }\n  return '';\n}\n\nfunction toCharacterClass(a, b, options) {\n  return `[${a}${(b - a === 1) ? '' : '-'}${b}]`;\n}\n\nfunction hasPadding(str) {\n  return /^-?(0+)\\d/.test(str);\n}\n\nfunction padZeros(value, tok, options) {\n  if (!tok.isPadded) {\n    return value;\n  }\n\n  let diff = Math.abs(tok.maxLen - String(value).length);\n  let relax = options.relaxZeros !== false;\n\n  switch (diff) {\n    case 0:\n      return '';\n    case 1:\n      return relax ? '0?' : '0';\n    case 2:\n      return relax ? '0{0,2}' : '00';\n    default: {\n      return relax ? `0{0,${diff}}` : `0{${diff}}`;\n    }\n  }\n}\n\n/**\n * Cache\n */\n\ntoRegexRange.cache = {};\ntoRegexRange.clearCache = () => (toRegexRange.cache = {});\n\n/**\n * Expose `toRegexRange`\n */\n\nmodule.exports = toRegexRange;\n"],"names":["require$$0","max"],"mappings":";;;;;;;AASA,MAAM,WAAWA;AAEjB,MAAM,eAAe,CAAC,KAAK,KAAK,YAAY;AAC1C,MAAI,SAAS,GAAG,MAAM,OAAO;AAC3B,UAAM,IAAI,UAAU,0DAA0D;AAAA,EAC/E;AAED,MAAI,QAAQ,UAAU,QAAQ,KAAK;AACjC,WAAO,OAAO,GAAG;AAAA,EAClB;AAED,MAAI,SAAS,GAAG,MAAM,OAAO;AAC3B,UAAM,IAAI,UAAU,4DAA4D;AAAA,EACjF;AAED,MAAI,OAAO,EAAE,YAAY,MAAM,GAAG,QAAO;AACzC,MAAI,OAAO,KAAK,gBAAgB,WAAW;AACzC,SAAK,aAAa,KAAK,gBAAgB;AAAA,EACxC;AAED,MAAI,QAAQ,OAAO,KAAK,UAAU;AAClC,MAAI,YAAY,OAAO,KAAK,SAAS;AACrC,MAAI,UAAU,OAAO,KAAK,OAAO;AACjC,MAAI,OAAO,OAAO,KAAK,IAAI;AAC3B,MAAI,WAAW,MAAM,MAAM,MAAM,MAAM,QAAQ,YAAY,UAAU;AAErE,MAAI,aAAa,MAAM,eAAe,QAAQ,GAAG;AAC/C,WAAO,aAAa,MAAM,QAAQ,EAAE;AAAA,EACrC;AAED,MAAI,IAAI,KAAK,IAAI,KAAK,GAAG;AACzB,MAAI,IAAI,KAAK,IAAI,KAAK,GAAG;AAEzB,MAAI,KAAK,IAAI,IAAI,CAAC,MAAM,GAAG;AACzB,QAAI,SAAS,MAAM,MAAM;AACzB,QAAI,KAAK,SAAS;AAChB,aAAO,IAAI,MAAM;AAAA,IAClB;AACD,QAAI,KAAK,SAAS,OAAO;AACvB,aAAO;AAAA,IACR;AACD,WAAO,MAAM,MAAM;AAAA,EACpB;AAED,MAAI,WAAW,WAAW,GAAG,KAAK,WAAW,GAAG;AAChD,MAAI,QAAQ,EAAE,KAAK,KAAK,GAAG,EAAC;AAC5B,MAAI,YAAY,CAAA;AAChB,MAAI,YAAY,CAAA;AAEhB,MAAI,UAAU;AACZ,UAAM,WAAW;AACjB,UAAM,SAAS,OAAO,MAAM,GAAG,EAAE;AAAA,EAClC;AAED,MAAI,IAAI,GAAG;AACT,QAAI,SAAS,IAAI,IAAI,KAAK,IAAI,CAAC,IAAI;AACnC,gBAAY,gBAAgB,QAAQ,KAAK,IAAI,CAAC,GAAG,OAAO,IAAI;AAC5D,QAAI,MAAM,IAAI;AAAA,EACf;AAED,MAAI,KAAK,GAAG;AACV,gBAAY,gBAAgB,GAAG,GAAG,OAAO,IAAI;AAAA,EAC9C;AAED,QAAM,YAAY;AAClB,QAAM,YAAY;AAClB,QAAM,SAAS,gBAAgB,WAAW,SAAe;AAEzD,MAAI,KAAK,YAAY,MAAM;AACzB,UAAM,SAAS,IAAI,MAAM,MAAM;AAAA,EACnC,WAAa,KAAK,SAAS,SAAU,UAAU,SAAS,UAAU,SAAU,GAAG;AAC3E,UAAM,SAAS,MAAM,MAAM,MAAM;AAAA,EAClC;AAED,eAAa,MAAM,QAAQ,IAAI;AAC/B,SAAO,MAAM;AACf;AAEA,SAAS,gBAAgB,KAAK,KAAK,SAAS;AAC1C,MAAI,eAAe,eAAe,KAAK,KAAK,KAAK,KAAc,KAAK;AACpE,MAAI,eAAe,eAAe,KAAK,KAAK,IAAI,KAAc,KAAK;AACnE,MAAI,cAAc,eAAe,KAAK,KAAK,MAAM,IAAa,KAAK;AACnE,MAAI,cAAc,aAAa,OAAO,WAAW,EAAE,OAAO,YAAY;AACtE,SAAO,YAAY,KAAK,GAAG;AAC7B;AAEA,SAAS,cAAc,KAAK,KAAK;AAC/B,MAAI,QAAQ;AACZ,MAAI,QAAQ;AAEZ,MAAI,OAAO,WAAW,KAAK,KAAK;AAChC,MAAI,QAAQ,oBAAI,IAAI,CAAC,GAAG,CAAC;AAEzB,SAAO,OAAO,QAAQ,QAAQ,KAAK;AACjC,UAAM,IAAI,IAAI;AACd,aAAS;AACT,WAAO,WAAW,KAAK,KAAK;AAAA,EAC7B;AAED,SAAO,WAAW,MAAM,GAAG,KAAK,IAAI;AAEpC,SAAO,MAAM,QAAQ,QAAQ,KAAK;AAChC,UAAM,IAAI,IAAI;AACd,aAAS;AACT,WAAO,WAAW,MAAM,GAAG,KAAK,IAAI;AAAA,EACrC;AAED,UAAQ,CAAC,GAAG,KAAK;AACjB,QAAM,KAAK,OAAO;AAClB,SAAO;AACT;AASA,SAAS,eAAe,OAAO,MAAM,SAAS;AAC5C,MAAI,UAAU,MAAM;AAClB,WAAO,EAAE,SAAS,OAAO,OAAO,CAAA,GAAI,QAAQ;EAC7C;AAED,MAAI,SAAS,IAAI,OAAO,IAAI;AAC5B,MAAI,SAAS,OAAO;AACpB,MAAI,UAAU;AACd,MAAI,QAAQ;AAEZ,WAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,QAAI,CAAC,YAAY,SAAS,IAAI,OAAO,CAAC;AAEtC,QAAI,eAAe,WAAW;AAC5B,iBAAW;AAAA,IAEZ,WAAU,eAAe,OAAO,cAAc,KAAK;AAClD,iBAAW,iBAAiB,YAAY,SAAkB;AAAA,IAEhE,OAAW;AACL;AAAA,IACD;AAAA,EACF;AAED,MAAI,OAAO;AACT,eAAW,QAAQ,cAAc,OAAO,QAAQ;AAAA,EACjD;AAED,SAAO,EAAE,SAAS,OAAO,CAAC,KAAK,GAAG,OAAM;AAC1C;AAEA,SAAS,gBAAgB,KAAK,KAAK,KAAK,SAAS;AAC/C,MAAI,SAAS,cAAc,KAAK,GAAG;AACnC,MAAI,SAAS,CAAA;AACb,MAAI,QAAQ;AACZ,MAAI;AAEJ,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,QAAIC,OAAM,OAAO,CAAC;AAClB,QAAI,MAAM,eAAe,OAAO,KAAK,GAAG,OAAOA,IAAG,GAAG,OAAO;AAC5D,QAAI,QAAQ;AAEZ,QAAI,CAAC,IAAI,YAAY,QAAQ,KAAK,YAAY,IAAI,SAAS;AACzD,UAAI,KAAK,MAAM,SAAS,GAAG;AACzB,aAAK,MAAM;MACZ;AAED,WAAK,MAAM,KAAK,IAAI,MAAM,CAAC,CAAC;AAC5B,WAAK,SAAS,KAAK,UAAU,aAAa,KAAK,KAAK;AACpD,cAAQA,OAAM;AACd;AAAA,IACD;AAED,QAAI,IAAI,UAAU;AAChB,cAAQ,SAASA,MAAK,KAAK,OAAO;AAAA,IACnC;AAED,QAAI,SAAS,QAAQ,IAAI,UAAU,aAAa,IAAI,KAAK;AACzD,WAAO,KAAK,GAAG;AACf,YAAQA,OAAM;AACd,WAAO;AAAA,EACR;AAED,SAAO;AACT;AAEA,SAAS,eAAe,KAAK,YAAY,QAAQ,cAAc,SAAS;AACtE,MAAI,SAAS,CAAA;AAEb,WAAS,OAAO,KAAK;AACnB,QAAI,EAAE,OAAQ,IAAG;AAGjB,QAAI,CAAC,gBAAgB,CAAC,SAAS,YAAY,UAAU,MAAM,GAAG;AAC5D,aAAO,KAAK,SAAS,MAAM;AAAA,IAC5B;AAGD,QAAI,gBAAgB,SAAS,YAAY,UAAU,MAAM,GAAG;AAC1D,aAAO,KAAK,SAAS,MAAM;AAAA,IAC5B;AAAA,EACF;AACD,SAAO;AACT;AAMA,SAAS,IAAI,GAAG,GAAG;AACjB,MAAI,MAAM,CAAA;AACV,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ;AAAK,QAAI,KAAK,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;AACxD,SAAO;AACT;AAEA,SAAS,QAAQ,GAAG,GAAG;AACrB,SAAO,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK;AAClC;AAEA,SAAS,SAAS,KAAK,KAAK,KAAK;AAC/B,SAAO,IAAI,KAAK,SAAO,IAAI,GAAG,MAAM,GAAG;AACzC;AAEA,SAAS,WAAW,KAAK,KAAK;AAC5B,SAAO,OAAO,OAAO,GAAG,EAAE,MAAM,GAAG,CAAC,GAAG,IAAI,IAAI,OAAO,GAAG,CAAC;AAC5D;AAEA,SAAS,WAAW,SAAS,OAAO;AAClC,SAAO,UAAW,UAAU,KAAK,IAAI,IAAI,KAAK;AAChD;AAEA,SAAS,aAAa,QAAQ;AAC5B,MAAI,CAAC,QAAQ,GAAG,OAAO,EAAE,IAAI;AAC7B,MAAI,QAAQ,QAAQ,GAAG;AACrB,WAAO,IAAI,SAAS,OAAO,MAAM,OAAO,GAAG;AAAA,EAC5C;AACD,SAAO;AACT;AAEA,SAAS,iBAAiB,GAAG,GAAG,SAAS;AACvC,SAAO,IAAI,CAAC,GAAI,IAAI,MAAM,IAAK,KAAK,GAAG,GAAG,CAAC;AAC7C;AAEA,SAAS,WAAW,KAAK;AACvB,SAAO,YAAY,KAAK,GAAG;AAC7B;AAEA,SAAS,SAAS,OAAO,KAAK,SAAS;AACrC,MAAI,CAAC,IAAI,UAAU;AACjB,WAAO;AAAA,EACR;AAED,MAAI,OAAO,KAAK,IAAI,IAAI,SAAS,OAAO,KAAK,EAAE,MAAM;AACrD,MAAI,QAAQ,QAAQ,eAAe;AAEnC,UAAQ,MAAI;AAAA,IACV,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO,QAAQ,OAAO;AAAA,IACxB,KAAK;AACH,aAAO,QAAQ,WAAW;AAAA,IAC5B,SAAS;AACP,aAAO,QAAQ,OAAO,IAAI,MAAM,KAAK,IAAI;AAAA,IAC1C;AAAA,EACF;AACH;AAMA,aAAa,QAAQ,CAAA;AACrB,aAAa,aAAa,MAAO,aAAa,QAAQ,CAAE;AAMxD,IAAA,iBAAiB;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.js","sources":["../../../../../node_modules/to-regex-range/index.js"],"sourcesContent":["/*!\n * to-regex-range <https://github.com/micromatch/to-regex-range>\n *\n * Copyright (c) 2015-present, Jon Schlinkert.\n * Released under the MIT License.\n */\n\n'use strict';\n\nconst isNumber = require('is-number');\n\nconst toRegexRange = (min, max, options) => {\n  if (isNumber(min) === false) {\n    throw new TypeError('toRegexRange: expected the first argument to be a number');\n  }\n\n  if (max === void 0 || min === max) {\n    return String(min);\n  }\n\n  if (isNumber(max) === false) {\n    throw new TypeError('toRegexRange: expected the second argument to be a number.');\n  }\n\n  let opts = { relaxZeros: true, ...options };\n  if (typeof opts.strictZeros === 'boolean') {\n    opts.relaxZeros = opts.strictZeros === false;\n  }\n\n  let relax = String(opts.relaxZeros);\n  let shorthand = String(opts.shorthand);\n  let capture = String(opts.capture);\n  let wrap = String(opts.wrap);\n  let cacheKey = min + ':' + max + '=' + relax + shorthand + capture + wrap;\n\n  if (toRegexRange.cache.hasOwnProperty(cacheKey)) {\n    return toRegexRange.cache[cacheKey].result;\n  }\n\n  let a = Math.min(min, max);\n  let b = Math.max(min, max);\n\n  if (Math.abs(a - b) === 1) {\n    let result = min + '|' + max;\n    if (opts.capture) {\n      return `(${result})`;\n    }\n    if (opts.wrap === false) {\n      return result;\n    }\n    return `(?:${result})`;\n  }\n\n  let isPadded = hasPadding(min) || hasPadding(max);\n  let state = { min, max, a, b };\n  let positives = [];\n  let negatives = [];\n\n  if (isPadded) {\n    state.isPadded = isPadded;\n    state.maxLen = String(state.max).length;\n  }\n\n  if (a < 0) {\n    let newMin = b < 0 ? Math.abs(b) : 1;\n    negatives = splitToPatterns(newMin, Math.abs(a), state, opts);\n    a = state.a = 0;\n  }\n\n  if (b >= 0) {\n    positives = splitToPatterns(a, b, state, opts);\n  }\n\n  state.negatives = negatives;\n  state.positives = positives;\n  state.result = collatePatterns(negatives, positives, opts);\n\n  if (opts.capture === true) {\n    state.result = `(${state.result})`;\n  } else if (opts.wrap !== false && (positives.length + negatives.length) > 1) {\n    state.result = `(?:${state.result})`;\n  }\n\n  toRegexRange.cache[cacheKey] = state;\n  return state.result;\n};\n\nfunction collatePatterns(neg, pos, options) {\n  let onlyNegative = filterPatterns(neg, pos, '-', false, options) || [];\n  let onlyPositive = filterPatterns(pos, neg, '', false, options) || [];\n  let intersected = filterPatterns(neg, pos, '-?', true, options) || [];\n  let subpatterns = onlyNegative.concat(intersected).concat(onlyPositive);\n  return subpatterns.join('|');\n}\n\nfunction splitToRanges(min, max) {\n  let nines = 1;\n  let zeros = 1;\n\n  let stop = countNines(min, nines);\n  let stops = new Set([max]);\n\n  while (min <= stop && stop <= max) {\n    stops.add(stop);\n    nines += 1;\n    stop = countNines(min, nines);\n  }\n\n  stop = countZeros(max + 1, zeros) - 1;\n\n  while (min < stop && stop <= max) {\n    stops.add(stop);\n    zeros += 1;\n    stop = countZeros(max + 1, zeros) - 1;\n  }\n\n  stops = [...stops];\n  stops.sort(compare);\n  return stops;\n}\n\n/**\n * Convert a range to a regex pattern\n * @param {Number} `start`\n * @param {Number} `stop`\n * @return {String}\n */\n\nfunction rangeToPattern(start, stop, options) {\n  if (start === stop) {\n    return { pattern: start, count: [], digits: 0 };\n  }\n\n  let zipped = zip(start, stop);\n  let digits = zipped.length;\n  let pattern = '';\n  let count = 0;\n\n  for (let i = 0; i < digits; i++) {\n    let [startDigit, stopDigit] = zipped[i];\n\n    if (startDigit === stopDigit) {\n      pattern += startDigit;\n\n    } else if (startDigit !== '0' || stopDigit !== '9') {\n      pattern += toCharacterClass(startDigit, stopDigit, options);\n\n    } else {\n      count++;\n    }\n  }\n\n  if (count) {\n    pattern += options.shorthand === true ? '\\\\d' : '[0-9]';\n  }\n\n  return { pattern, count: [count], digits };\n}\n\nfunction splitToPatterns(min, max, tok, options) {\n  let ranges = splitToRanges(min, max);\n  let tokens = [];\n  let start = min;\n  let prev;\n\n  for (let i = 0; i < ranges.length; i++) {\n    let max = ranges[i];\n    let obj = rangeToPattern(String(start), String(max), options);\n    let zeros = '';\n\n    if (!tok.isPadded && prev && prev.pattern === obj.pattern) {\n      if (prev.count.length > 1) {\n        prev.count.pop();\n      }\n\n      prev.count.push(obj.count[0]);\n      prev.string = prev.pattern + toQuantifier(prev.count);\n      start = max + 1;\n      continue;\n    }\n\n    if (tok.isPadded) {\n      zeros = padZeros(max, tok, options);\n    }\n\n    obj.string = zeros + obj.pattern + toQuantifier(obj.count);\n    tokens.push(obj);\n    start = max + 1;\n    prev = obj;\n  }\n\n  return tokens;\n}\n\nfunction filterPatterns(arr, comparison, prefix, intersection, options) {\n  let result = [];\n\n  for (let ele of arr) {\n    let { string } = ele;\n\n    // only push if _both_ are negative...\n    if (!intersection && !contains(comparison, 'string', string)) {\n      result.push(prefix + string);\n    }\n\n    // or _both_ are positive\n    if (intersection && contains(comparison, 'string', string)) {\n      result.push(prefix + string);\n    }\n  }\n  return result;\n}\n\n/**\n * Zip strings\n */\n\nfunction zip(a, b) {\n  let arr = [];\n  for (let i = 0; i < a.length; i++) arr.push([a[i], b[i]]);\n  return arr;\n}\n\nfunction compare(a, b) {\n  return a > b ? 1 : b > a ? -1 : 0;\n}\n\nfunction contains(arr, key, val) {\n  return arr.some(ele => ele[key] === val);\n}\n\nfunction countNines(min, len) {\n  return Number(String(min).slice(0, -len) + '9'.repeat(len));\n}\n\nfunction countZeros(integer, zeros) {\n  return integer - (integer % Math.pow(10, zeros));\n}\n\nfunction toQuantifier(digits) {\n  let [start = 0, stop = ''] = digits;\n  if (stop || start > 1) {\n    return `{${start + (stop ? ',' + stop : '')}}`;\n  }\n  return '';\n}\n\nfunction toCharacterClass(a, b, options) {\n  return `[${a}${(b - a === 1) ? '' : '-'}${b}]`;\n}\n\nfunction hasPadding(str) {\n  return /^-?(0+)\\d/.test(str);\n}\n\nfunction padZeros(value, tok, options) {\n  if (!tok.isPadded) {\n    return value;\n  }\n\n  let diff = Math.abs(tok.maxLen - String(value).length);\n  let relax = options.relaxZeros !== false;\n\n  switch (diff) {\n    case 0:\n      return '';\n    case 1:\n      return relax ? '0?' : '0';\n    case 2:\n      return relax ? '0{0,2}' : '00';\n    default: {\n      return relax ? `0{0,${diff}}` : `0{${diff}}`;\n    }\n  }\n}\n\n/**\n * Cache\n */\n\ntoRegexRange.cache = {};\ntoRegexRange.clearCache = () => (toRegexRange.cache = {});\n\n/**\n * Expose `toRegexRange`\n */\n\nmodule.exports = toRegexRange;\n"],"names":["require$$0","max"],"mappings":";;;;;;;AASA,MAAM,WAAWA;AAEjB,MAAM,eAAe,CAAC,KAAK,KAAK,YAAY;AAC1C,MAAI,SAAS,GAAG,MAAM,OAAO;AAC3B,UAAM,IAAI,UAAU,0DAA0D;AAAA,EAClF;AAEE,MAAI,QAAQ,UAAU,QAAQ,KAAK;AACjC,WAAO,OAAO,GAAG;AAAA,EACrB;AAEE,MAAI,SAAS,GAAG,MAAM,OAAO;AAC3B,UAAM,IAAI,UAAU,4DAA4D;AAAA,EACpF;AAEE,MAAI,OAAO,EAAE,YAAY,MAAM,GAAG,QAAO;AACzC,MAAI,OAAO,KAAK,gBAAgB,WAAW;AACzC,SAAK,aAAa,KAAK,gBAAgB;AAAA,EAC3C;AAEE,MAAI,QAAQ,OAAO,KAAK,UAAU;AAClC,MAAI,YAAY,OAAO,KAAK,SAAS;AACrC,MAAI,UAAU,OAAO,KAAK,OAAO;AACjC,MAAI,OAAO,OAAO,KAAK,IAAI;AAC3B,MAAI,WAAW,MAAM,MAAM,MAAM,MAAM,QAAQ,YAAY,UAAU;AAErE,MAAI,aAAa,MAAM,eAAe,QAAQ,GAAG;AAC/C,WAAO,aAAa,MAAM,QAAQ,EAAE;AAAA,EACxC;AAEE,MAAI,IAAI,KAAK,IAAI,KAAK,GAAG;AACzB,MAAI,IAAI,KAAK,IAAI,KAAK,GAAG;AAEzB,MAAI,KAAK,IAAI,IAAI,CAAC,MAAM,GAAG;AACzB,QAAI,SAAS,MAAM,MAAM;AACzB,QAAI,KAAK,SAAS;AAChB,aAAO,IAAI,MAAM;AAAA,IACvB;AACI,QAAI,KAAK,SAAS,OAAO;AACvB,aAAO;AAAA,IACb;AACI,WAAO,MAAM,MAAM;AAAA,EACvB;AAEE,MAAI,WAAW,WAAW,GAAG,KAAK,WAAW,GAAG;AAChD,MAAI,QAAQ,EAAE,KAAK,KAAK,GAAG,EAAC;AAC5B,MAAI,YAAY,CAAA;AAChB,MAAI,YAAY,CAAA;AAEhB,MAAI,UAAU;AACZ,UAAM,WAAW;AACjB,UAAM,SAAS,OAAO,MAAM,GAAG,EAAE;AAAA,EACrC;AAEE,MAAI,IAAI,GAAG;AACT,QAAI,SAAS,IAAI,IAAI,KAAK,IAAI,CAAC,IAAI;AACnC,gBAAY,gBAAgB,QAAQ,KAAK,IAAI,CAAC,GAAG,OAAO,IAAI;AAC5D,QAAI,MAAM,IAAI;AAAA,EAClB;AAEE,MAAI,KAAK,GAAG;AACV,gBAAY,gBAAgB,GAAG,GAAG,OAAO,IAAI;AAAA,EACjD;AAEE,QAAM,YAAY;AAClB,QAAM,YAAY;AAClB,QAAM,SAAS,gBAAgB,WAAW,SAAe;AAEzD,MAAI,KAAK,YAAY,MAAM;AACzB,UAAM,SAAS,IAAI,MAAM,MAAM;AAAA,EACnC,WAAa,KAAK,SAAS,SAAU,UAAU,SAAS,UAAU,SAAU,GAAG;AAC3E,UAAM,SAAS,MAAM,MAAM,MAAM;AAAA,EACrC;AAEE,eAAa,MAAM,QAAQ,IAAI;AAC/B,SAAO,MAAM;AACf;AAEA,SAAS,gBAAgB,KAAK,KAAK,SAAS;AAC1C,MAAI,eAAe,eAAe,KAAK,KAAK,KAAK,KAAc,KAAK,CAAA;AACpE,MAAI,eAAe,eAAe,KAAK,KAAK,IAAI,KAAc,KAAK,CAAA;AACnE,MAAI,cAAc,eAAe,KAAK,KAAK,MAAM,IAAa,KAAK,CAAA;AACnE,MAAI,cAAc,aAAa,OAAO,WAAW,EAAE,OAAO,YAAY;AACtE,SAAO,YAAY,KAAK,GAAG;AAC7B;AAEA,SAAS,cAAc,KAAK,KAAK;AAC/B,MAAI,QAAQ;AACZ,MAAI,QAAQ;AAEZ,MAAI,OAAO,WAAW,KAAK,KAAK;AAChC,MAAI,QAAQ,oBAAI,IAAI,CAAC,GAAG,CAAC;AAEzB,SAAO,OAAO,QAAQ,QAAQ,KAAK;AACjC,UAAM,IAAI,IAAI;AACd,aAAS;AACT,WAAO,WAAW,KAAK,KAAK;AAAA,EAChC;AAEE,SAAO,WAAW,MAAM,GAAG,KAAK,IAAI;AAEpC,SAAO,MAAM,QAAQ,QAAQ,KAAK;AAChC,UAAM,IAAI,IAAI;AACd,aAAS;AACT,WAAO,WAAW,MAAM,GAAG,KAAK,IAAI;AAAA,EACxC;AAEE,UAAQ,CAAC,GAAG,KAAK;AACjB,QAAM,KAAK,OAAO;AAClB,SAAO;AACT;AASA,SAAS,eAAe,OAAO,MAAM,SAAS;AAC5C,MAAI,UAAU,MAAM;AAClB,WAAO,EAAE,SAAS,OAAO,OAAO,CAAA,GAAI,QAAQ,EAAC;AAAA,EACjD;AAEE,MAAI,SAAS,IAAI,OAAO,IAAI;AAC5B,MAAI,SAAS,OAAO;AACpB,MAAI,UAAU;AACd,MAAI,QAAQ;AAEZ,WAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,QAAI,CAAC,YAAY,SAAS,IAAI,OAAO,CAAC;AAEtC,QAAI,eAAe,WAAW;AAC5B,iBAAW;AAAA,IAEjB,WAAe,eAAe,OAAO,cAAc,KAAK;AAClD,iBAAW,iBAAiB,YAAY,SAAkB;AAAA,IAEhE,OAAW;AACL;AAAA,IACN;AAAA,EACA;AAEE,MAAI,OAAO;AACT,eAAW,QAAQ,cAAc,OAAO,QAAQ;AAAA,EACpD;AAEE,SAAO,EAAE,SAAS,OAAO,CAAC,KAAK,GAAG,OAAM;AAC1C;AAEA,SAAS,gBAAgB,KAAK,KAAK,KAAK,SAAS;AAC/C,MAAI,SAAS,cAAc,KAAK,GAAG;AACnC,MAAI,SAAS,CAAA;AACb,MAAI,QAAQ;AACZ,MAAI;AAEJ,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,QAAIC,OAAM,OAAO,CAAC;AAClB,QAAI,MAAM,eAAe,OAAO,KAAK,GAAG,OAAOA,IAAG,GAAG,OAAO;AAC5D,QAAI,QAAQ;AAEZ,QAAI,CAAC,IAAI,YAAY,QAAQ,KAAK,YAAY,IAAI,SAAS;AACzD,UAAI,KAAK,MAAM,SAAS,GAAG;AACzB,aAAK,MAAM,IAAG;AAAA,MACtB;AAEM,WAAK,MAAM,KAAK,IAAI,MAAM,CAAC,CAAC;AAC5B,WAAK,SAAS,KAAK,UAAU,aAAa,KAAK,KAAK;AACpD,cAAQA,OAAM;AACd;AAAA,IACN;AAEI,QAAI,IAAI,UAAU;AAChB,cAAQ,SAASA,MAAK,KAAK,OAAO;AAAA,IACxC;AAEI,QAAI,SAAS,QAAQ,IAAI,UAAU,aAAa,IAAI,KAAK;AACzD,WAAO,KAAK,GAAG;AACf,YAAQA,OAAM;AACd,WAAO;AAAA,EACX;AAEE,SAAO;AACT;AAEA,SAAS,eAAe,KAAK,YAAY,QAAQ,cAAc,SAAS;AACtE,MAAI,SAAS,CAAA;AAEb,WAAS,OAAO,KAAK;AACnB,QAAI,EAAE,OAAM,IAAK;AAGjB,QAAI,CAAC,gBAAgB,CAAC,SAAS,YAAY,UAAU,MAAM,GAAG;AAC5D,aAAO,KAAK,SAAS,MAAM;AAAA,IACjC;AAGI,QAAI,gBAAgB,SAAS,YAAY,UAAU,MAAM,GAAG;AAC1D,aAAO,KAAK,SAAS,MAAM;AAAA,IACjC;AAAA,EACA;AACE,SAAO;AACT;AAMA,SAAS,IAAI,GAAG,GAAG;AACjB,MAAI,MAAM,CAAA;AACV,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,IAAK,KAAI,KAAK,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;AACxD,SAAO;AACT;AAEA,SAAS,QAAQ,GAAG,GAAG;AACrB,SAAO,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK;AAClC;AAEA,SAAS,SAAS,KAAK,KAAK,KAAK;AAC/B,SAAO,IAAI,KAAK,SAAO,IAAI,GAAG,MAAM,GAAG;AACzC;AAEA,SAAS,WAAW,KAAK,KAAK;AAC5B,SAAO,OAAO,OAAO,GAAG,EAAE,MAAM,GAAG,CAAC,GAAG,IAAI,IAAI,OAAO,GAAG,CAAC;AAC5D;AAEA,SAAS,WAAW,SAAS,OAAO;AAClC,SAAO,UAAW,UAAU,KAAK,IAAI,IAAI,KAAK;AAChD;AAEA,SAAS,aAAa,QAAQ;AAC5B,MAAI,CAAC,QAAQ,GAAG,OAAO,EAAE,IAAI;AAC7B,MAAI,QAAQ,QAAQ,GAAG;AACrB,WAAO,IAAI,SAAS,OAAO,MAAM,OAAO,GAAG;AAAA,EAC/C;AACE,SAAO;AACT;AAEA,SAAS,iBAAiB,GAAG,GAAG,SAAS;AACvC,SAAO,IAAI,CAAC,GAAI,IAAI,MAAM,IAAK,KAAK,GAAG,GAAG,CAAC;AAC7C;AAEA,SAAS,WAAW,KAAK;AACvB,SAAO,YAAY,KAAK,GAAG;AAC7B;AAEA,SAAS,SAAS,OAAO,KAAK,SAAS;AACrC,MAAI,CAAC,IAAI,UAAU;AACjB,WAAO;AAAA,EACX;AAEE,MAAI,OAAO,KAAK,IAAI,IAAI,SAAS,OAAO,KAAK,EAAE,MAAM;AACrD,MAAI,QAAQ,QAAQ,eAAe;AAEnC,UAAQ,MAAI;AAAA,IACV,KAAK;AACH,aAAO;AAAA,IACT,KAAK;AACH,aAAO,QAAQ,OAAO;AAAA,IACxB,KAAK;AACH,aAAO,QAAQ,WAAW;AAAA,IAC5B,SAAS;AACP,aAAO,QAAQ,OAAO,IAAI,MAAM,KAAK,IAAI;AAAA,IAC/C;AAAA,EACA;AACA;AAMA,aAAa,QAAQ,CAAA;AACrB,aAAa,aAAa,MAAO,aAAa,QAAQ,CAAA;AAMtD,IAAA,iBAAiB;","x_google_ignoreList":[0]}

package/dist/_node_modules/validate-npm-package-license/index.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs","sources":["../../../../../node_modules/validate-npm-package-license/index.js"],"sourcesContent":["var parse = require('spdx-expression-parse');\nvar correct = require('spdx-correct');\n\nvar genericWarning = (\n  'license should be ' +\n  'a valid SPDX license expression (without \"LicenseRef\"), ' +\n  '\"UNLICENSED\", or ' +\n  '\"SEE LICENSE IN <filename>\"'\n);\n\nvar fileReferenceRE = /^SEE LICEN[CS]E IN (.+)$/;\n\nfunction startsWith(prefix, string) {\n  return string.slice(0, prefix.length) === prefix;\n}\n\nfunction usesLicenseRef(ast) {\n  if (ast.hasOwnProperty('license')) {\n    var license = ast.license;\n    return (\n      startsWith('LicenseRef', license) ||\n      startsWith('DocumentRef', license)\n    );\n  } else {\n    return (\n      usesLicenseRef(ast.left) ||\n      usesLicenseRef(ast.right)\n    );\n  }\n}\n\nmodule.exports = function(argument) {\n  var ast;\n\n  try {\n    ast = parse(argument);\n  } catch (e) {\n    var match\n    if (\n      argument === 'UNLICENSED' ||\n      argument === 'UNLICENCED'\n    ) {\n      return {\n        validForOldPackages: true,\n        validForNewPackages: true,\n        unlicensed: true\n      };\n    } else if (match = fileReferenceRE.exec(argument)) {\n      return {\n        validForOldPackages: true,\n        validForNewPackages: true,\n        inFile: match[1]\n      };\n    } else {\n      var result = {\n        validForOldPackages: false,\n        validForNewPackages: false,\n        warnings: [genericWarning]\n      };\n      if (argument.trim().length !== 0) {\n        var corrected = correct(argument);\n        if (corrected) {\n          result.warnings.push(\n            'license is similar to the valid expression \"' + corrected + '\"'\n          );\n        }\n      }\n      return result;\n    }\n  }\n\n  if (usesLicenseRef(ast)) {\n    return {\n      validForNewPackages: false,\n      validForOldPackages: false,\n      spdx: true,\n      warnings: [genericWarning]\n    };\n  } else {\n    return {\n      validForNewPackages: true,\n      validForOldPackages: true,\n      spdx: true\n    };\n  }\n};\n"],"names":["require$$0","require$$1"],"mappings":";;;;AAAA,IAAI,QAAQA,MAAAA;AACZ,IAAI,UAAUC,QAAAA;AAEd,IAAI,iBACF;AAMF,IAAI,kBAAkB;AAEtB,SAAS,WAAW,QAAQ,QAAQ;AAClC,SAAO,OAAO,MAAM,GAAG,OAAO,MAAM,MAAM;AAC5C;AAEA,SAAS,eAAe,KAAK;AAC3B,MAAI,IAAI,eAAe,SAAS,GAAG;AACjC,QAAI,UAAU,IAAI;AAClB,WACE,WAAW,cAAc,OAAO,KAChC,WAAW,eAAe,OAAO;AAAA,EAEvC,OAAS;AACL,WACE,eAAe,IAAI,IAAI,KACvB,eAAe,IAAI,KAAK;AAAA,EAE3B;AACH;IAEA,4BAAiB,SAAS,UAAU;AAClC,MAAI;AAEJ,MAAI;AACF,UAAM,MAAM,QAAQ;AAAA,EACrB,SAAQ,GAAG;AACV,QAAI;AACJ,QACE,aAAa,gBACb,aAAa,cACb;AACA,aAAO;AAAA,QACL,qBAAqB;AAAA,QACrB,qBAAqB;AAAA,QACrB,YAAY;AAAA,MACpB;AAAA,IACK,WAAU,QAAQ,gBAAgB,KAAK,QAAQ,GAAG;AACjD,aAAO;AAAA,QACL,qBAAqB;AAAA,QACrB,qBAAqB;AAAA,QACrB,QAAQ,MAAM,CAAC;AAAA,MACvB;AAAA,IACA,OAAW;AACL,UAAI,SAAS;AAAA,QACX,qBAAqB;AAAA,QACrB,qBAAqB;AAAA,QACrB,UAAU,CAAC,cAAc;AAAA,MACjC;AACM,UAAI,SAAS,OAAO,WAAW,GAAG;AAChC,YAAI,YAAY,QAAQ,QAAQ;AAChC,YAAI,WAAW;AACb,iBAAO,SAAS;AAAA,YACd,iDAAiD,YAAY;AAAA,UACzE;AAAA,QACS;AAAA,MACF;AACD,aAAO;AAAA,IACR;AAAA,EACF;AAED,MAAI,eAAe,GAAG,GAAG;AACvB,WAAO;AAAA,MACL,qBAAqB;AAAA,MACrB,qBAAqB;AAAA,MACrB,MAAM;AAAA,MACN,UAAU,CAAC,cAAc;AAAA,IAC/B;AAAA,EACA,OAAS;AACL,WAAO;AAAA,MACL,qBAAqB;AAAA,MACrB,qBAAqB;AAAA,MACrB,MAAM;AAAA,IACZ;AAAA,EACG;AACH;;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs","sources":["../../../../../node_modules/validate-npm-package-license/index.js"],"sourcesContent":["var parse = require('spdx-expression-parse');\nvar correct = require('spdx-correct');\n\nvar genericWarning = (\n  'license should be ' +\n  'a valid SPDX license expression (without \"LicenseRef\"), ' +\n  '\"UNLICENSED\", or ' +\n  '\"SEE LICENSE IN <filename>\"'\n);\n\nvar fileReferenceRE = /^SEE LICEN[CS]E IN (.+)$/;\n\nfunction startsWith(prefix, string) {\n  return string.slice(0, prefix.length) === prefix;\n}\n\nfunction usesLicenseRef(ast) {\n  if (ast.hasOwnProperty('license')) {\n    var license = ast.license;\n    return (\n      startsWith('LicenseRef', license) ||\n      startsWith('DocumentRef', license)\n    );\n  } else {\n    return (\n      usesLicenseRef(ast.left) ||\n      usesLicenseRef(ast.right)\n    );\n  }\n}\n\nmodule.exports = function(argument) {\n  var ast;\n\n  try {\n    ast = parse(argument);\n  } catch (e) {\n    var match\n    if (\n      argument === 'UNLICENSED' ||\n      argument === 'UNLICENCED'\n    ) {\n      return {\n        validForOldPackages: true,\n        validForNewPackages: true,\n        unlicensed: true\n      };\n    } else if (match = fileReferenceRE.exec(argument)) {\n      return {\n        validForOldPackages: true,\n        validForNewPackages: true,\n        inFile: match[1]\n      };\n    } else {\n      var result = {\n        validForOldPackages: false,\n        validForNewPackages: false,\n        warnings: [genericWarning]\n      };\n      if (argument.trim().length !== 0) {\n        var corrected = correct(argument);\n        if (corrected) {\n          result.warnings.push(\n            'license is similar to the valid expression \"' + corrected + '\"'\n          );\n        }\n      }\n      return result;\n    }\n  }\n\n  if (usesLicenseRef(ast)) {\n    return {\n      validForNewPackages: false,\n      validForOldPackages: false,\n      spdx: true,\n      warnings: [genericWarning]\n    };\n  } else {\n    return {\n      validForNewPackages: true,\n      validForOldPackages: true,\n      spdx: true\n    };\n  }\n};\n"],"names":["require$$0","require$$1"],"mappings":";;;;AAAA,IAAI,QAAQA,MAAAA;AACZ,IAAI,UAAUC,QAAAA;AAEd,IAAI,iBACF;AAMF,IAAI,kBAAkB;AAEtB,SAAS,WAAW,QAAQ,QAAQ;AAClC,SAAO,OAAO,MAAM,GAAG,OAAO,MAAM,MAAM;AAC5C;AAEA,SAAS,eAAe,KAAK;AAC3B,MAAI,IAAI,eAAe,SAAS,GAAG;AACjC,QAAI,UAAU,IAAI;AAClB,WACE,WAAW,cAAc,OAAO,KAChC,WAAW,eAAe,OAAO;AAAA,EAEvC,OAAS;AACL,WACE,eAAe,IAAI,IAAI,KACvB,eAAe,IAAI,KAAK;AAAA,EAE9B;AACA;IAEA,4BAAiB,SAAS,UAAU;AAClC,MAAI;AAEJ,MAAI;AACF,UAAM,MAAM,QAAQ;AAAA,EACxB,SAAW,GAAG;AACV,QAAI;AACJ,QACE,aAAa,gBACb,aAAa,cACb;AACA,aAAO;AAAA,QACL,qBAAqB;AAAA,QACrB,qBAAqB;AAAA,QACrB,YAAY;AAAA,MACpB;AAAA,IACA,WAAe,QAAQ,gBAAgB,KAAK,QAAQ,GAAG;AACjD,aAAO;AAAA,QACL,qBAAqB;AAAA,QACrB,qBAAqB;AAAA,QACrB,QAAQ,MAAM,CAAC;AAAA,MACvB;AAAA,IACA,OAAW;AACL,UAAI,SAAS;AAAA,QACX,qBAAqB;AAAA,QACrB,qBAAqB;AAAA,QACrB,UAAU,CAAC,cAAc;AAAA,MACjC;AACM,UAAI,SAAS,OAAO,WAAW,GAAG;AAChC,YAAI,YAAY,QAAQ,QAAQ;AAChC,YAAI,WAAW;AACb,iBAAO,SAAS;AAAA,YACd,iDAAiD,YAAY;AAAA,UACzE;AAAA,QACA;AAAA,MACA;AACM,aAAO;AAAA,IACb;AAAA,EACA;AAEE,MAAI,eAAe,GAAG,GAAG;AACvB,WAAO;AAAA,MACL,qBAAqB;AAAA,MACrB,qBAAqB;AAAA,MACrB,MAAM;AAAA,MACN,UAAU,CAAC,cAAc;AAAA,IAC/B;AAAA,EACA,OAAS;AACL,WAAO;AAAA,MACL,qBAAqB;AAAA,MACrB,qBAAqB;AAAA,MACrB,MAAM;AAAA,IACZ;AAAA,EACA;AACA;;","x_google_ignoreList":[0]}

package/dist/_node_modules/validate-npm-package-license/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sources":["../../../../../node_modules/validate-npm-package-license/index.js"],"sourcesContent":["var parse = require('spdx-expression-parse');\nvar correct = require('spdx-correct');\n\nvar genericWarning = (\n  'license should be ' +\n  'a valid SPDX license expression (without \"LicenseRef\"), ' +\n  '\"UNLICENSED\", or ' +\n  '\"SEE LICENSE IN <filename>\"'\n);\n\nvar fileReferenceRE = /^SEE LICEN[CS]E IN (.+)$/;\n\nfunction startsWith(prefix, string) {\n  return string.slice(0, prefix.length) === prefix;\n}\n\nfunction usesLicenseRef(ast) {\n  if (ast.hasOwnProperty('license')) {\n    var license = ast.license;\n    return (\n      startsWith('LicenseRef', license) ||\n      startsWith('DocumentRef', license)\n    );\n  } else {\n    return (\n      usesLicenseRef(ast.left) ||\n      usesLicenseRef(ast.right)\n    );\n  }\n}\n\nmodule.exports = function(argument) {\n  var ast;\n\n  try {\n    ast = parse(argument);\n  } catch (e) {\n    var match\n    if (\n      argument === 'UNLICENSED' ||\n      argument === 'UNLICENCED'\n    ) {\n      return {\n        validForOldPackages: true,\n        validForNewPackages: true,\n        unlicensed: true\n      };\n    } else if (match = fileReferenceRE.exec(argument)) {\n      return {\n        validForOldPackages: true,\n        validForNewPackages: true,\n        inFile: match[1]\n      };\n    } else {\n      var result = {\n        validForOldPackages: false,\n        validForNewPackages: false,\n        warnings: [genericWarning]\n      };\n      if (argument.trim().length !== 0) {\n        var corrected = correct(argument);\n        if (corrected) {\n          result.warnings.push(\n            'license is similar to the valid expression \"' + corrected + '\"'\n          );\n        }\n      }\n      return result;\n    }\n  }\n\n  if (usesLicenseRef(ast)) {\n    return {\n      validForNewPackages: false,\n      validForOldPackages: false,\n      spdx: true,\n      warnings: [genericWarning]\n    };\n  } else {\n    return {\n      validForNewPackages: true,\n      validForOldPackages: true,\n      spdx: true\n    };\n  }\n};\n"],"names":["require$$0","require$$1"],"mappings":";;AAAA,IAAI,QAAQA;AACZ,IAAI,UAAUC;AAEd,IAAI,iBACF;AAMF,IAAI,kBAAkB;AAEtB,SAAS,WAAW,QAAQ,QAAQ;AAClC,SAAO,OAAO,MAAM,GAAG,OAAO,MAAM,MAAM;AAC5C;AAEA,SAAS,eAAe,KAAK;AAC3B,MAAI,IAAI,eAAe,SAAS,GAAG;AACjC,QAAI,UAAU,IAAI;AAClB,WACE,WAAW,cAAc,OAAO,KAChC,WAAW,eAAe,OAAO;AAAA,EAEvC,OAAS;AACL,WACE,eAAe,IAAI,IAAI,KACvB,eAAe,IAAI,KAAK;AAAA,EAE3B;AACH;IAEA,4BAAiB,SAAS,UAAU;AAClC,MAAI;AAEJ,MAAI;AACF,UAAM,MAAM,QAAQ;AAAA,EACrB,SAAQ,GAAG;AACV,QAAI;AACJ,QACE,aAAa,gBACb,aAAa,cACb;AACA,aAAO;AAAA,QACL,qBAAqB;AAAA,QACrB,qBAAqB;AAAA,QACrB,YAAY;AAAA,MACpB;AAAA,IACK,WAAU,QAAQ,gBAAgB,KAAK,QAAQ,GAAG;AACjD,aAAO;AAAA,QACL,qBAAqB;AAAA,QACrB,qBAAqB;AAAA,QACrB,QAAQ,MAAM,CAAC;AAAA,MACvB;AAAA,IACA,OAAW;AACL,UAAI,SAAS;AAAA,QACX,qBAAqB;AAAA,QACrB,qBAAqB;AAAA,QACrB,UAAU,CAAC,cAAc;AAAA,MACjC;AACM,UAAI,SAAS,OAAO,WAAW,GAAG;AAChC,YAAI,YAAY,QAAQ,QAAQ;AAChC,YAAI,WAAW;AACb,iBAAO,SAAS;AAAA,YACd,iDAAiD,YAAY;AAAA,UACzE;AAAA,QACS;AAAA,MACF;AACD,aAAO;AAAA,IACR;AAAA,EACF;AAED,MAAI,eAAe,GAAG,GAAG;AACvB,WAAO;AAAA,MACL,qBAAqB;AAAA,MACrB,qBAAqB;AAAA,MACrB,MAAM;AAAA,MACN,UAAU,CAAC,cAAc;AAAA,IAC/B;AAAA,EACA,OAAS;AACL,WAAO;AAAA,MACL,qBAAqB;AAAA,MACrB,qBAAqB;AAAA,MACrB,MAAM;AAAA,IACZ;AAAA,EACG;AACH;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.js","sources":["../../../../../node_modules/validate-npm-package-license/index.js"],"sourcesContent":["var parse = require('spdx-expression-parse');\nvar correct = require('spdx-correct');\n\nvar genericWarning = (\n  'license should be ' +\n  'a valid SPDX license expression (without \"LicenseRef\"), ' +\n  '\"UNLICENSED\", or ' +\n  '\"SEE LICENSE IN <filename>\"'\n);\n\nvar fileReferenceRE = /^SEE LICEN[CS]E IN (.+)$/;\n\nfunction startsWith(prefix, string) {\n  return string.slice(0, prefix.length) === prefix;\n}\n\nfunction usesLicenseRef(ast) {\n  if (ast.hasOwnProperty('license')) {\n    var license = ast.license;\n    return (\n      startsWith('LicenseRef', license) ||\n      startsWith('DocumentRef', license)\n    );\n  } else {\n    return (\n      usesLicenseRef(ast.left) ||\n      usesLicenseRef(ast.right)\n    );\n  }\n}\n\nmodule.exports = function(argument) {\n  var ast;\n\n  try {\n    ast = parse(argument);\n  } catch (e) {\n    var match\n    if (\n      argument === 'UNLICENSED' ||\n      argument === 'UNLICENCED'\n    ) {\n      return {\n        validForOldPackages: true,\n        validForNewPackages: true,\n        unlicensed: true\n      };\n    } else if (match = fileReferenceRE.exec(argument)) {\n      return {\n        validForOldPackages: true,\n        validForNewPackages: true,\n        inFile: match[1]\n      };\n    } else {\n      var result = {\n        validForOldPackages: false,\n        validForNewPackages: false,\n        warnings: [genericWarning]\n      };\n      if (argument.trim().length !== 0) {\n        var corrected = correct(argument);\n        if (corrected) {\n          result.warnings.push(\n            'license is similar to the valid expression \"' + corrected + '\"'\n          );\n        }\n      }\n      return result;\n    }\n  }\n\n  if (usesLicenseRef(ast)) {\n    return {\n      validForNewPackages: false,\n      validForOldPackages: false,\n      spdx: true,\n      warnings: [genericWarning]\n    };\n  } else {\n    return {\n      validForNewPackages: true,\n      validForOldPackages: true,\n      spdx: true\n    };\n  }\n};\n"],"names":["require$$0","require$$1"],"mappings":";;AAAA,IAAI,QAAQA;AACZ,IAAI,UAAUC;AAEd,IAAI,iBACF;AAMF,IAAI,kBAAkB;AAEtB,SAAS,WAAW,QAAQ,QAAQ;AAClC,SAAO,OAAO,MAAM,GAAG,OAAO,MAAM,MAAM;AAC5C;AAEA,SAAS,eAAe,KAAK;AAC3B,MAAI,IAAI,eAAe,SAAS,GAAG;AACjC,QAAI,UAAU,IAAI;AAClB,WACE,WAAW,cAAc,OAAO,KAChC,WAAW,eAAe,OAAO;AAAA,EAEvC,OAAS;AACL,WACE,eAAe,IAAI,IAAI,KACvB,eAAe,IAAI,KAAK;AAAA,EAE9B;AACA;IAEA,4BAAiB,SAAS,UAAU;AAClC,MAAI;AAEJ,MAAI;AACF,UAAM,MAAM,QAAQ;AAAA,EACxB,SAAW,GAAG;AACV,QAAI;AACJ,QACE,aAAa,gBACb,aAAa,cACb;AACA,aAAO;AAAA,QACL,qBAAqB;AAAA,QACrB,qBAAqB;AAAA,QACrB,YAAY;AAAA,MACpB;AAAA,IACA,WAAe,QAAQ,gBAAgB,KAAK,QAAQ,GAAG;AACjD,aAAO;AAAA,QACL,qBAAqB;AAAA,QACrB,qBAAqB;AAAA,QACrB,QAAQ,MAAM,CAAC;AAAA,MACvB;AAAA,IACA,OAAW;AACL,UAAI,SAAS;AAAA,QACX,qBAAqB;AAAA,QACrB,qBAAqB;AAAA,QACrB,UAAU,CAAC,cAAc;AAAA,MACjC;AACM,UAAI,SAAS,OAAO,WAAW,GAAG;AAChC,YAAI,YAAY,QAAQ,QAAQ;AAChC,YAAI,WAAW;AACb,iBAAO,SAAS;AAAA,YACd,iDAAiD,YAAY;AAAA,UACzE;AAAA,QACA;AAAA,MACA;AACM,aAAO;AAAA,IACb;AAAA,EACA;AAEE,MAAI,eAAe,GAAG,GAAG;AACvB,WAAO;AAAA,MACL,qBAAqB;AAAA,MACrB,qBAAqB;AAAA,MACrB,MAAM;AAAA,MACN,UAAU,CAAC,cAAc;AAAA,IAC/B;AAAA,EACA,OAAS;AACL,WAAO;AAAA,MACL,qBAAqB;AAAA,MACrB,qBAAqB;AAAA,MACrB,MAAM;AAAA,IACZ;AAAA,EACA;AACA;","x_google_ignoreList":[0]}

package/dist/_node_modules/which/which.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"which.cjs","sources":["../../../../../node_modules/which/which.js"],"sourcesContent":["const isWindows = process.platform === 'win32' ||\n    process.env.OSTYPE === 'cygwin' ||\n    process.env.OSTYPE === 'msys'\n\nconst path = require('path')\nconst COLON = isWindows ? ';' : ':'\nconst isexe = require('isexe')\n\nconst getNotFoundError = (cmd) =>\n  Object.assign(new Error(`not found: ${cmd}`), { code: 'ENOENT' })\n\nconst getPathInfo = (cmd, opt) => {\n  const colon = opt.colon || COLON\n\n  // If it has a slash, then we don't bother searching the pathenv.\n  // just check the file itself, and that's it.\n  const pathEnv = cmd.match(/\\//) || isWindows && cmd.match(/\\\\/) ? ['']\n    : (\n      [\n        // windows always checks the cwd first\n        ...(isWindows ? [process.cwd()] : []),\n        ...(opt.path || process.env.PATH ||\n          /* istanbul ignore next: very unusual */ '').split(colon),\n      ]\n    )\n  const pathExtExe = isWindows\n    ? opt.pathExt || process.env.PATHEXT || '.EXE;.CMD;.BAT;.COM'\n    : ''\n  const pathExt = isWindows ? pathExtExe.split(colon) : ['']\n\n  if (isWindows) {\n    if (cmd.indexOf('.') !== -1 && pathExt[0] !== '')\n      pathExt.unshift('')\n  }\n\n  return {\n    pathEnv,\n    pathExt,\n    pathExtExe,\n  }\n}\n\nconst which = (cmd, opt, cb) => {\n  if (typeof opt === 'function') {\n    cb = opt\n    opt = {}\n  }\n  if (!opt)\n    opt = {}\n\n  const { pathEnv, pathExt, pathExtExe } = getPathInfo(cmd, opt)\n  const found = []\n\n  const step = i => new Promise((resolve, reject) => {\n    if (i === pathEnv.length)\n      return opt.all && found.length ? resolve(found)\n        : reject(getNotFoundError(cmd))\n\n    const ppRaw = pathEnv[i]\n    const pathPart = /^\".*\"$/.test(ppRaw) ? ppRaw.slice(1, -1) : ppRaw\n\n    const pCmd = path.join(pathPart, cmd)\n    const p = !pathPart && /^\\.[\\\\\\/]/.test(cmd) ? cmd.slice(0, 2) + pCmd\n      : pCmd\n\n    resolve(subStep(p, i, 0))\n  })\n\n  const subStep = (p, i, ii) => new Promise((resolve, reject) => {\n    if (ii === pathExt.length)\n      return resolve(step(i + 1))\n    const ext = pathExt[ii]\n    isexe(p + ext, { pathExt: pathExtExe }, (er, is) => {\n      if (!er && is) {\n        if (opt.all)\n          found.push(p + ext)\n        else\n          return resolve(p + ext)\n      }\n      return resolve(subStep(p, i, ii + 1))\n    })\n  })\n\n  return cb ? step(0).then(res => cb(null, res), cb) : step(0)\n}\n\nconst whichSync = (cmd, opt) => {\n  opt = opt || {}\n\n  const { pathEnv, pathExt, pathExtExe } = getPathInfo(cmd, opt)\n  const found = []\n\n  for (let i = 0; i < pathEnv.length; i ++) {\n    const ppRaw = pathEnv[i]\n    const pathPart = /^\".*\"$/.test(ppRaw) ? ppRaw.slice(1, -1) : ppRaw\n\n    const pCmd = path.join(pathPart, cmd)\n    const p = !pathPart && /^\\.[\\\\\\/]/.test(cmd) ? cmd.slice(0, 2) + pCmd\n      : pCmd\n\n    for (let j = 0; j < pathExt.length; j ++) {\n      const cur = p + pathExt[j]\n      try {\n        const is = isexe.sync(cur, { pathExt: pathExtExe })\n        if (is) {\n          if (opt.all)\n            found.push(cur)\n          else\n            return cur\n        }\n      } catch (ex) {}\n    }\n  }\n\n  if (opt.all && found.length)\n    return found\n\n  if (opt.nothrow)\n    return null\n\n  throw getNotFoundError(cmd)\n}\n\nmodule.exports = which\nwhich.sync = whichSync\n"],"names":["require$$1"],"mappings":";;;;AAAA,MAAM,YAAY,QAAQ,aAAa,WACnC,QAAQ,IAAI,WAAW,YACvB,QAAQ,IAAI,WAAW;AAE3B,MAAM,OAAO;AACb,MAAM,QAAQ,YAAY,MAAM;AAChC,MAAM,QAAQA,MAAgB;AAE9B,MAAM,mBAAmB,CAAC,QACxB,OAAO,OAAO,IAAI,MAAM,cAAc,GAAG,EAAE,GAAG,EAAE,MAAM,UAAU;AAElE,MAAM,cAAc,CAAC,KAAK,QAAQ;AAChC,QAAM,QAAQ,IAAI,SAAS;AAI3B,QAAM,UAAU,IAAI,MAAM,IAAI,KAAK,aAAa,IAAI,MAAM,IAAI,IAAI,CAAC,EAAE,IAEjE;AAAA;AAAA,IAEE,GAAI,YAAY,CAAC,QAAQ,IAAK,CAAA,IAAI,CAAA;AAAA,IAClC,IAAI,IAAI,QAAQ,QAAQ,IAAI;AAAA,IACe,IAAI,MAAM,KAAK;AAAA,EAC3D;AAEL,QAAM,aAAa,YACf,IAAI,WAAW,QAAQ,IAAI,WAAW,wBACtC;AACJ,QAAM,UAAU,YAAY,WAAW,MAAM,KAAK,IAAI,CAAC,EAAE;AAEzD,MAAI,WAAW;AACb,QAAI,IAAI,QAAQ,GAAG,MAAM,MAAM,QAAQ,CAAC,MAAM;AAC5C,cAAQ,QAAQ,EAAE;AAAA,EACrB;AAED,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,EACD;AACH;AAEA,MAAM,QAAQ,CAAC,KAAK,KAAK,OAAO;AAC9B,MAAI,OAAO,QAAQ,YAAY;AAC7B,SAAK;AACL,UAAM,CAAE;AAAA,EACT;AACD,MAAI,CAAC;AACH,UAAM,CAAE;AAEV,QAAM,EAAE,SAAS,SAAS,WAAY,IAAG,YAAY,KAAK,GAAG;AAC7D,QAAM,QAAQ,CAAE;AAEhB,QAAM,OAAO,OAAK,IAAI,QAAQ,CAAC,SAAS,WAAW;AACjD,QAAI,MAAM,QAAQ;AAChB,aAAO,IAAI,OAAO,MAAM,SAAS,QAAQ,KAAK,IAC1C,OAAO,iBAAiB,GAAG,CAAC;AAElC,UAAM,QAAQ,QAAQ,CAAC;AACvB,UAAM,WAAW,SAAS,KAAK,KAAK,IAAI,MAAM,MAAM,GAAG,EAAE,IAAI;AAE7D,UAAM,OAAO,KAAK,KAAK,UAAU,GAAG;AACpC,UAAM,IAAI,CAAC,YAAY,YAAY,KAAK,GAAG,IAAI,IAAI,MAAM,GAAG,CAAC,IAAI,OAC7D;AAEJ,YAAQ,QAAQ,GAAG,GAAG,CAAC,CAAC;AAAA,EAC5B,CAAG;AAED,QAAM,UAAU,CAAC,GAAG,GAAG,OAAO,IAAI,QAAQ,CAAC,SAAS,WAAW;AAC7D,QAAI,OAAO,QAAQ;AACjB,aAAO,QAAQ,KAAK,IAAI,CAAC,CAAC;AAC5B,UAAM,MAAM,QAAQ,EAAE;AACtB,UAAM,IAAI,KAAK,EAAE,SAAS,cAAc,CAAC,IAAI,OAAO;AAClD,UAAI,CAAC,MAAM,IAAI;AACb,YAAI,IAAI;AACN,gBAAM,KAAK,IAAI,GAAG;AAAA;AAElB,iBAAO,QAAQ,IAAI,GAAG;AAAA,MACzB;AACD,aAAO,QAAQ,QAAQ,GAAG,GAAG,KAAK,CAAC,CAAC;AAAA,IAC1C,CAAK;AAAA,EACL,CAAG;AAED,SAAO,KAAK,KAAK,CAAC,EAAE,KAAK,SAAO,GAAG,MAAM,GAAG,GAAG,EAAE,IAAI,KAAK,CAAC;AAC7D;AAEA,MAAM,YAAY,CAAC,KAAK,QAAQ;AAC9B,QAAM,OAAO,CAAE;AAEf,QAAM,EAAE,SAAS,SAAS,WAAY,IAAG,YAAY,KAAK,GAAG;AAC7D,QAAM,QAAQ,CAAE;AAEhB,WAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAM;AACxC,UAAM,QAAQ,QAAQ,CAAC;AACvB,UAAM,WAAW,SAAS,KAAK,KAAK,IAAI,MAAM,MAAM,GAAG,EAAE,IAAI;AAE7D,UAAM,OAAO,KAAK,KAAK,UAAU,GAAG;AACpC,UAAM,IAAI,CAAC,YAAY,YAAY,KAAK,GAAG,IAAI,IAAI,MAAM,GAAG,CAAC,IAAI,OAC7D;AAEJ,aAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAM;AACxC,YAAM,MAAM,IAAI,QAAQ,CAAC;AACzB,UAAI;AACF,cAAM,KAAK,MAAM,KAAK,KAAK,EAAE,SAAS,YAAY;AAClD,YAAI,IAAI;AACN,cAAI,IAAI;AACN,kBAAM,KAAK,GAAG;AAAA;AAEd,mBAAO;AAAA,QACV;AAAA,MACT,SAAe,IAAI;AAAA,MAAE;AAAA,IAChB;AAAA,EACF;AAED,MAAI,IAAI,OAAO,MAAM;AACnB,WAAO;AAET,MAAI,IAAI;AACN,WAAO;AAET,QAAM,iBAAiB,GAAG;AAC5B;AAEA,IAAA,UAAiB;AACjB,MAAM,OAAO;;","x_google_ignoreList":[0]}
+{"version":3,"file":"which.cjs","sources":["../../../../../node_modules/which/which.js"],"sourcesContent":["const isWindows = process.platform === 'win32' ||\n    process.env.OSTYPE === 'cygwin' ||\n    process.env.OSTYPE === 'msys'\n\nconst path = require('path')\nconst COLON = isWindows ? ';' : ':'\nconst isexe = require('isexe')\n\nconst getNotFoundError = (cmd) =>\n  Object.assign(new Error(`not found: ${cmd}`), { code: 'ENOENT' })\n\nconst getPathInfo = (cmd, opt) => {\n  const colon = opt.colon || COLON\n\n  // If it has a slash, then we don't bother searching the pathenv.\n  // just check the file itself, and that's it.\n  const pathEnv = cmd.match(/\\//) || isWindows && cmd.match(/\\\\/) ? ['']\n    : (\n      [\n        // windows always checks the cwd first\n        ...(isWindows ? [process.cwd()] : []),\n        ...(opt.path || process.env.PATH ||\n          /* istanbul ignore next: very unusual */ '').split(colon),\n      ]\n    )\n  const pathExtExe = isWindows\n    ? opt.pathExt || process.env.PATHEXT || '.EXE;.CMD;.BAT;.COM'\n    : ''\n  const pathExt = isWindows ? pathExtExe.split(colon) : ['']\n\n  if (isWindows) {\n    if (cmd.indexOf('.') !== -1 && pathExt[0] !== '')\n      pathExt.unshift('')\n  }\n\n  return {\n    pathEnv,\n    pathExt,\n    pathExtExe,\n  }\n}\n\nconst which = (cmd, opt, cb) => {\n  if (typeof opt === 'function') {\n    cb = opt\n    opt = {}\n  }\n  if (!opt)\n    opt = {}\n\n  const { pathEnv, pathExt, pathExtExe } = getPathInfo(cmd, opt)\n  const found = []\n\n  const step = i => new Promise((resolve, reject) => {\n    if (i === pathEnv.length)\n      return opt.all && found.length ? resolve(found)\n        : reject(getNotFoundError(cmd))\n\n    const ppRaw = pathEnv[i]\n    const pathPart = /^\".*\"$/.test(ppRaw) ? ppRaw.slice(1, -1) : ppRaw\n\n    const pCmd = path.join(pathPart, cmd)\n    const p = !pathPart && /^\\.[\\\\\\/]/.test(cmd) ? cmd.slice(0, 2) + pCmd\n      : pCmd\n\n    resolve(subStep(p, i, 0))\n  })\n\n  const subStep = (p, i, ii) => new Promise((resolve, reject) => {\n    if (ii === pathExt.length)\n      return resolve(step(i + 1))\n    const ext = pathExt[ii]\n    isexe(p + ext, { pathExt: pathExtExe }, (er, is) => {\n      if (!er && is) {\n        if (opt.all)\n          found.push(p + ext)\n        else\n          return resolve(p + ext)\n      }\n      return resolve(subStep(p, i, ii + 1))\n    })\n  })\n\n  return cb ? step(0).then(res => cb(null, res), cb) : step(0)\n}\n\nconst whichSync = (cmd, opt) => {\n  opt = opt || {}\n\n  const { pathEnv, pathExt, pathExtExe } = getPathInfo(cmd, opt)\n  const found = []\n\n  for (let i = 0; i < pathEnv.length; i ++) {\n    const ppRaw = pathEnv[i]\n    const pathPart = /^\".*\"$/.test(ppRaw) ? ppRaw.slice(1, -1) : ppRaw\n\n    const pCmd = path.join(pathPart, cmd)\n    const p = !pathPart && /^\\.[\\\\\\/]/.test(cmd) ? cmd.slice(0, 2) + pCmd\n      : pCmd\n\n    for (let j = 0; j < pathExt.length; j ++) {\n      const cur = p + pathExt[j]\n      try {\n        const is = isexe.sync(cur, { pathExt: pathExtExe })\n        if (is) {\n          if (opt.all)\n            found.push(cur)\n          else\n            return cur\n        }\n      } catch (ex) {}\n    }\n  }\n\n  if (opt.all && found.length)\n    return found\n\n  if (opt.nothrow)\n    return null\n\n  throw getNotFoundError(cmd)\n}\n\nmodule.exports = which\nwhich.sync = whichSync\n"],"names":["require$$1"],"mappings":";;;;AAAA,MAAM,YAAY,QAAQ,aAAa,WACnC,QAAQ,IAAI,WAAW,YACvB,QAAQ,IAAI,WAAW;AAE3B,MAAM,OAAO;AACb,MAAM,QAAQ,YAAY,MAAM;AAChC,MAAM,QAAQA,MAAAA;AAEd,MAAM,mBAAmB,CAAC,QACxB,OAAO,OAAO,IAAI,MAAM,cAAc,GAAG,EAAE,GAAG,EAAE,MAAM,SAAQ,CAAE;AAElE,MAAM,cAAc,CAAC,KAAK,QAAQ;AAChC,QAAM,QAAQ,IAAI,SAAS;AAI3B,QAAM,UAAU,IAAI,MAAM,IAAI,KAAK,aAAa,IAAI,MAAM,IAAI,IAAI,CAAC,EAAE,IAEjE;AAAA;AAAA,IAEE,GAAI,YAAY,CAAC,QAAQ,IAAG,CAAE,IAAI,CAAA;AAAA,IAClC,IAAI,IAAI,QAAQ,QAAQ,IAAI;AAAA,IACe,IAAI,MAAM,KAAK;AAAA,EAClE;AAEE,QAAM,aAAa,YACf,IAAI,WAAW,QAAQ,IAAI,WAAW,wBACtC;AACJ,QAAM,UAAU,YAAY,WAAW,MAAM,KAAK,IAAI,CAAC,EAAE;AAEzD,MAAI,WAAW;AACb,QAAI,IAAI,QAAQ,GAAG,MAAM,MAAM,QAAQ,CAAC,MAAM;AAC5C,cAAQ,QAAQ,EAAE;AAAA,EACxB;AAEE,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,EACJ;AACA;AAEA,MAAM,QAAQ,CAAC,KAAK,KAAK,OAAO;AAC9B,MAAI,OAAO,QAAQ,YAAY;AAC7B,SAAK;AACL,UAAM,CAAA;AAAA,EACV;AACE,MAAI,CAAC;AACH,UAAM,CAAA;AAER,QAAM,EAAE,SAAS,SAAS,WAAU,IAAK,YAAY,KAAK,GAAG;AAC7D,QAAM,QAAQ,CAAA;AAEd,QAAM,OAAO,OAAK,IAAI,QAAQ,CAAC,SAAS,WAAW;AACjD,QAAI,MAAM,QAAQ;AAChB,aAAO,IAAI,OAAO,MAAM,SAAS,QAAQ,KAAK,IAC1C,OAAO,iBAAiB,GAAG,CAAC;AAElC,UAAM,QAAQ,QAAQ,CAAC;AACvB,UAAM,WAAW,SAAS,KAAK,KAAK,IAAI,MAAM,MAAM,GAAG,EAAE,IAAI;AAE7D,UAAM,OAAO,KAAK,KAAK,UAAU,GAAG;AACpC,UAAM,IAAI,CAAC,YAAY,YAAY,KAAK,GAAG,IAAI,IAAI,MAAM,GAAG,CAAC,IAAI,OAC7D;AAEJ,YAAQ,QAAQ,GAAG,GAAG,CAAC,CAAC;AAAA,EAC5B,CAAG;AAED,QAAM,UAAU,CAAC,GAAG,GAAG,OAAO,IAAI,QAAQ,CAAC,SAAS,WAAW;AAC7D,QAAI,OAAO,QAAQ;AACjB,aAAO,QAAQ,KAAK,IAAI,CAAC,CAAC;AAC5B,UAAM,MAAM,QAAQ,EAAE;AACtB,UAAM,IAAI,KAAK,EAAE,SAAS,cAAc,CAAC,IAAI,OAAO;AAClD,UAAI,CAAC,MAAM,IAAI;AACb,YAAI,IAAI;AACN,gBAAM,KAAK,IAAI,GAAG;AAAA;AAElB,iBAAO,QAAQ,IAAI,GAAG;AAAA,MAChC;AACM,aAAO,QAAQ,QAAQ,GAAG,GAAG,KAAK,CAAC,CAAC;AAAA,IAC1C,CAAK;AAAA,EACL,CAAG;AAED,SAAO,KAAK,KAAK,CAAC,EAAE,KAAK,SAAO,GAAG,MAAM,GAAG,GAAG,EAAE,IAAI,KAAK,CAAC;AAC7D;AAEA,MAAM,YAAY,CAAC,KAAK,QAAQ;AAC9B,QAAM,OAAO,CAAA;AAEb,QAAM,EAAE,SAAS,SAAS,WAAU,IAAK,YAAY,KAAK,GAAG;AAC7D,QAAM,QAAQ,CAAA;AAEd,WAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAM;AACxC,UAAM,QAAQ,QAAQ,CAAC;AACvB,UAAM,WAAW,SAAS,KAAK,KAAK,IAAI,MAAM,MAAM,GAAG,EAAE,IAAI;AAE7D,UAAM,OAAO,KAAK,KAAK,UAAU,GAAG;AACpC,UAAM,IAAI,CAAC,YAAY,YAAY,KAAK,GAAG,IAAI,IAAI,MAAM,GAAG,CAAC,IAAI,OAC7D;AAEJ,aAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAM;AACxC,YAAM,MAAM,IAAI,QAAQ,CAAC;AACzB,UAAI;AACF,cAAM,KAAK,MAAM,KAAK,KAAK,EAAE,SAAS,WAAU,CAAE;AAClD,YAAI,IAAI;AACN,cAAI,IAAI;AACN,kBAAM,KAAK,GAAG;AAAA;AAEd,mBAAO;AAAA,QACnB;AAAA,MACA,SAAe,IAAI;AAAA,MAAA;AAAA,IACnB;AAAA,EACA;AAEE,MAAI,IAAI,OAAO,MAAM;AACnB,WAAO;AAET,MAAI,IAAI;AACN,WAAO;AAET,QAAM,iBAAiB,GAAG;AAC5B;AAEA,IAAA,UAAiB;AACjB,MAAM,OAAO;;","x_google_ignoreList":[0]}

package/dist/_node_modules/which/which.js.map

@@ -1 +1 @@
-{"version":3,"file":"which.js","sources":["../../../../../node_modules/which/which.js"],"sourcesContent":["const isWindows = process.platform === 'win32' ||\n    process.env.OSTYPE === 'cygwin' ||\n    process.env.OSTYPE === 'msys'\n\nconst path = require('path')\nconst COLON = isWindows ? ';' : ':'\nconst isexe = require('isexe')\n\nconst getNotFoundError = (cmd) =>\n  Object.assign(new Error(`not found: ${cmd}`), { code: 'ENOENT' })\n\nconst getPathInfo = (cmd, opt) => {\n  const colon = opt.colon || COLON\n\n  // If it has a slash, then we don't bother searching the pathenv.\n  // just check the file itself, and that's it.\n  const pathEnv = cmd.match(/\\//) || isWindows && cmd.match(/\\\\/) ? ['']\n    : (\n      [\n        // windows always checks the cwd first\n        ...(isWindows ? [process.cwd()] : []),\n        ...(opt.path || process.env.PATH ||\n          /* istanbul ignore next: very unusual */ '').split(colon),\n      ]\n    )\n  const pathExtExe = isWindows\n    ? opt.pathExt || process.env.PATHEXT || '.EXE;.CMD;.BAT;.COM'\n    : ''\n  const pathExt = isWindows ? pathExtExe.split(colon) : ['']\n\n  if (isWindows) {\n    if (cmd.indexOf('.') !== -1 && pathExt[0] !== '')\n      pathExt.unshift('')\n  }\n\n  return {\n    pathEnv,\n    pathExt,\n    pathExtExe,\n  }\n}\n\nconst which = (cmd, opt, cb) => {\n  if (typeof opt === 'function') {\n    cb = opt\n    opt = {}\n  }\n  if (!opt)\n    opt = {}\n\n  const { pathEnv, pathExt, pathExtExe } = getPathInfo(cmd, opt)\n  const found = []\n\n  const step = i => new Promise((resolve, reject) => {\n    if (i === pathEnv.length)\n      return opt.all && found.length ? resolve(found)\n        : reject(getNotFoundError(cmd))\n\n    const ppRaw = pathEnv[i]\n    const pathPart = /^\".*\"$/.test(ppRaw) ? ppRaw.slice(1, -1) : ppRaw\n\n    const pCmd = path.join(pathPart, cmd)\n    const p = !pathPart && /^\\.[\\\\\\/]/.test(cmd) ? cmd.slice(0, 2) + pCmd\n      : pCmd\n\n    resolve(subStep(p, i, 0))\n  })\n\n  const subStep = (p, i, ii) => new Promise((resolve, reject) => {\n    if (ii === pathExt.length)\n      return resolve(step(i + 1))\n    const ext = pathExt[ii]\n    isexe(p + ext, { pathExt: pathExtExe }, (er, is) => {\n      if (!er && is) {\n        if (opt.all)\n          found.push(p + ext)\n        else\n          return resolve(p + ext)\n      }\n      return resolve(subStep(p, i, ii + 1))\n    })\n  })\n\n  return cb ? step(0).then(res => cb(null, res), cb) : step(0)\n}\n\nconst whichSync = (cmd, opt) => {\n  opt = opt || {}\n\n  const { pathEnv, pathExt, pathExtExe } = getPathInfo(cmd, opt)\n  const found = []\n\n  for (let i = 0; i < pathEnv.length; i ++) {\n    const ppRaw = pathEnv[i]\n    const pathPart = /^\".*\"$/.test(ppRaw) ? ppRaw.slice(1, -1) : ppRaw\n\n    const pCmd = path.join(pathPart, cmd)\n    const p = !pathPart && /^\\.[\\\\\\/]/.test(cmd) ? cmd.slice(0, 2) + pCmd\n      : pCmd\n\n    for (let j = 0; j < pathExt.length; j ++) {\n      const cur = p + pathExt[j]\n      try {\n        const is = isexe.sync(cur, { pathExt: pathExtExe })\n        if (is) {\n          if (opt.all)\n            found.push(cur)\n          else\n            return cur\n        }\n      } catch (ex) {}\n    }\n  }\n\n  if (opt.all && found.length)\n    return found\n\n  if (opt.nothrow)\n    return null\n\n  throw getNotFoundError(cmd)\n}\n\nmodule.exports = which\nwhich.sync = whichSync\n"],"names":["require$$1"],"mappings":";;AAAA,MAAM,YAAY,QAAQ,aAAa,WACnC,QAAQ,IAAI,WAAW,YACvB,QAAQ,IAAI,WAAW;AAE3B,MAAM,OAAO;AACb,MAAM,QAAQ,YAAY,MAAM;AAChC,MAAM,QAAQA;AAEd,MAAM,mBAAmB,CAAC,QACxB,OAAO,OAAO,IAAI,MAAM,cAAc,GAAG,EAAE,GAAG,EAAE,MAAM,UAAU;AAElE,MAAM,cAAc,CAAC,KAAK,QAAQ;AAChC,QAAM,QAAQ,IAAI,SAAS;AAI3B,QAAM,UAAU,IAAI,MAAM,IAAI,KAAK,aAAa,IAAI,MAAM,IAAI,IAAI,CAAC,EAAE,IAEjE;AAAA;AAAA,IAEE,GAAI,YAAY,CAAC,QAAQ,IAAK,CAAA,IAAI,CAAA;AAAA,IAClC,IAAI,IAAI,QAAQ,QAAQ,IAAI;AAAA,IACe,IAAI,MAAM,KAAK;AAAA,EAC3D;AAEL,QAAM,aAAa,YACf,IAAI,WAAW,QAAQ,IAAI,WAAW,wBACtC;AACJ,QAAM,UAAU,YAAY,WAAW,MAAM,KAAK,IAAI,CAAC,EAAE;AAEzD,MAAI,WAAW;AACb,QAAI,IAAI,QAAQ,GAAG,MAAM,MAAM,QAAQ,CAAC,MAAM;AAC5C,cAAQ,QAAQ,EAAE;AAAA,EACrB;AAED,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,EACD;AACH;AAEA,MAAM,QAAQ,CAAC,KAAK,KAAK,OAAO;AAC9B,MAAI,OAAO,QAAQ,YAAY;AAC7B,SAAK;AACL,UAAM,CAAE;AAAA,EACT;AACD,MAAI,CAAC;AACH,UAAM,CAAE;AAEV,QAAM,EAAE,SAAS,SAAS,WAAY,IAAG,YAAY,KAAK,GAAG;AAC7D,QAAM,QAAQ,CAAE;AAEhB,QAAM,OAAO,OAAK,IAAI,QAAQ,CAAC,SAAS,WAAW;AACjD,QAAI,MAAM,QAAQ;AAChB,aAAO,IAAI,OAAO,MAAM,SAAS,QAAQ,KAAK,IAC1C,OAAO,iBAAiB,GAAG,CAAC;AAElC,UAAM,QAAQ,QAAQ,CAAC;AACvB,UAAM,WAAW,SAAS,KAAK,KAAK,IAAI,MAAM,MAAM,GAAG,EAAE,IAAI;AAE7D,UAAM,OAAO,KAAK,KAAK,UAAU,GAAG;AACpC,UAAM,IAAI,CAAC,YAAY,YAAY,KAAK,GAAG,IAAI,IAAI,MAAM,GAAG,CAAC,IAAI,OAC7D;AAEJ,YAAQ,QAAQ,GAAG,GAAG,CAAC,CAAC;AAAA,EAC5B,CAAG;AAED,QAAM,UAAU,CAAC,GAAG,GAAG,OAAO,IAAI,QAAQ,CAAC,SAAS,WAAW;AAC7D,QAAI,OAAO,QAAQ;AACjB,aAAO,QAAQ,KAAK,IAAI,CAAC,CAAC;AAC5B,UAAM,MAAM,QAAQ,EAAE;AACtB,UAAM,IAAI,KAAK,EAAE,SAAS,cAAc,CAAC,IAAI,OAAO;AAClD,UAAI,CAAC,MAAM,IAAI;AACb,YAAI,IAAI;AACN,gBAAM,KAAK,IAAI,GAAG;AAAA;AAElB,iBAAO,QAAQ,IAAI,GAAG;AAAA,MACzB;AACD,aAAO,QAAQ,QAAQ,GAAG,GAAG,KAAK,CAAC,CAAC;AAAA,IAC1C,CAAK;AAAA,EACL,CAAG;AAED,SAAO,KAAK,KAAK,CAAC,EAAE,KAAK,SAAO,GAAG,MAAM,GAAG,GAAG,EAAE,IAAI,KAAK,CAAC;AAC7D;AAEA,MAAM,YAAY,CAAC,KAAK,QAAQ;AAC9B,QAAM,OAAO,CAAE;AAEf,QAAM,EAAE,SAAS,SAAS,WAAY,IAAG,YAAY,KAAK,GAAG;AAC7D,QAAM,QAAQ,CAAE;AAEhB,WAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAM;AACxC,UAAM,QAAQ,QAAQ,CAAC;AACvB,UAAM,WAAW,SAAS,KAAK,KAAK,IAAI,MAAM,MAAM,GAAG,EAAE,IAAI;AAE7D,UAAM,OAAO,KAAK,KAAK,UAAU,GAAG;AACpC,UAAM,IAAI,CAAC,YAAY,YAAY,KAAK,GAAG,IAAI,IAAI,MAAM,GAAG,CAAC,IAAI,OAC7D;AAEJ,aAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAM;AACxC,YAAM,MAAM,IAAI,QAAQ,CAAC;AACzB,UAAI;AACF,cAAM,KAAK,MAAM,KAAK,KAAK,EAAE,SAAS,YAAY;AAClD,YAAI,IAAI;AACN,cAAI,IAAI;AACN,kBAAM,KAAK,GAAG;AAAA;AAEd,mBAAO;AAAA,QACV;AAAA,MACT,SAAe,IAAI;AAAA,MAAE;AAAA,IAChB;AAAA,EACF;AAED,MAAI,IAAI,OAAO,MAAM;AACnB,WAAO;AAET,MAAI,IAAI;AACN,WAAO;AAET,QAAM,iBAAiB,GAAG;AAC5B;AAEA,IAAA,UAAiB;AACjB,MAAM,OAAO;","x_google_ignoreList":[0]}
+{"version":3,"file":"which.js","sources":["../../../../../node_modules/which/which.js"],"sourcesContent":["const isWindows = process.platform === 'win32' ||\n    process.env.OSTYPE === 'cygwin' ||\n    process.env.OSTYPE === 'msys'\n\nconst path = require('path')\nconst COLON = isWindows ? ';' : ':'\nconst isexe = require('isexe')\n\nconst getNotFoundError = (cmd) =>\n  Object.assign(new Error(`not found: ${cmd}`), { code: 'ENOENT' })\n\nconst getPathInfo = (cmd, opt) => {\n  const colon = opt.colon || COLON\n\n  // If it has a slash, then we don't bother searching the pathenv.\n  // just check the file itself, and that's it.\n  const pathEnv = cmd.match(/\\//) || isWindows && cmd.match(/\\\\/) ? ['']\n    : (\n      [\n        // windows always checks the cwd first\n        ...(isWindows ? [process.cwd()] : []),\n        ...(opt.path || process.env.PATH ||\n          /* istanbul ignore next: very unusual */ '').split(colon),\n      ]\n    )\n  const pathExtExe = isWindows\n    ? opt.pathExt || process.env.PATHEXT || '.EXE;.CMD;.BAT;.COM'\n    : ''\n  const pathExt = isWindows ? pathExtExe.split(colon) : ['']\n\n  if (isWindows) {\n    if (cmd.indexOf('.') !== -1 && pathExt[0] !== '')\n      pathExt.unshift('')\n  }\n\n  return {\n    pathEnv,\n    pathExt,\n    pathExtExe,\n  }\n}\n\nconst which = (cmd, opt, cb) => {\n  if (typeof opt === 'function') {\n    cb = opt\n    opt = {}\n  }\n  if (!opt)\n    opt = {}\n\n  const { pathEnv, pathExt, pathExtExe } = getPathInfo(cmd, opt)\n  const found = []\n\n  const step = i => new Promise((resolve, reject) => {\n    if (i === pathEnv.length)\n      return opt.all && found.length ? resolve(found)\n        : reject(getNotFoundError(cmd))\n\n    const ppRaw = pathEnv[i]\n    const pathPart = /^\".*\"$/.test(ppRaw) ? ppRaw.slice(1, -1) : ppRaw\n\n    const pCmd = path.join(pathPart, cmd)\n    const p = !pathPart && /^\\.[\\\\\\/]/.test(cmd) ? cmd.slice(0, 2) + pCmd\n      : pCmd\n\n    resolve(subStep(p, i, 0))\n  })\n\n  const subStep = (p, i, ii) => new Promise((resolve, reject) => {\n    if (ii === pathExt.length)\n      return resolve(step(i + 1))\n    const ext = pathExt[ii]\n    isexe(p + ext, { pathExt: pathExtExe }, (er, is) => {\n      if (!er && is) {\n        if (opt.all)\n          found.push(p + ext)\n        else\n          return resolve(p + ext)\n      }\n      return resolve(subStep(p, i, ii + 1))\n    })\n  })\n\n  return cb ? step(0).then(res => cb(null, res), cb) : step(0)\n}\n\nconst whichSync = (cmd, opt) => {\n  opt = opt || {}\n\n  const { pathEnv, pathExt, pathExtExe } = getPathInfo(cmd, opt)\n  const found = []\n\n  for (let i = 0; i < pathEnv.length; i ++) {\n    const ppRaw = pathEnv[i]\n    const pathPart = /^\".*\"$/.test(ppRaw) ? ppRaw.slice(1, -1) : ppRaw\n\n    const pCmd = path.join(pathPart, cmd)\n    const p = !pathPart && /^\\.[\\\\\\/]/.test(cmd) ? cmd.slice(0, 2) + pCmd\n      : pCmd\n\n    for (let j = 0; j < pathExt.length; j ++) {\n      const cur = p + pathExt[j]\n      try {\n        const is = isexe.sync(cur, { pathExt: pathExtExe })\n        if (is) {\n          if (opt.all)\n            found.push(cur)\n          else\n            return cur\n        }\n      } catch (ex) {}\n    }\n  }\n\n  if (opt.all && found.length)\n    return found\n\n  if (opt.nothrow)\n    return null\n\n  throw getNotFoundError(cmd)\n}\n\nmodule.exports = which\nwhich.sync = whichSync\n"],"names":["require$$1"],"mappings":";;AAAA,MAAM,YAAY,QAAQ,aAAa,WACnC,QAAQ,IAAI,WAAW,YACvB,QAAQ,IAAI,WAAW;AAE3B,MAAM,OAAO;AACb,MAAM,QAAQ,YAAY,MAAM;AAChC,MAAM,QAAQA;AAEd,MAAM,mBAAmB,CAAC,QACxB,OAAO,OAAO,IAAI,MAAM,cAAc,GAAG,EAAE,GAAG,EAAE,MAAM,SAAQ,CAAE;AAElE,MAAM,cAAc,CAAC,KAAK,QAAQ;AAChC,QAAM,QAAQ,IAAI,SAAS;AAI3B,QAAM,UAAU,IAAI,MAAM,IAAI,KAAK,aAAa,IAAI,MAAM,IAAI,IAAI,CAAC,EAAE,IAEjE;AAAA;AAAA,IAEE,GAAI,YAAY,CAAC,QAAQ,IAAG,CAAE,IAAI,CAAA;AAAA,IAClC,IAAI,IAAI,QAAQ,QAAQ,IAAI;AAAA,IACe,IAAI,MAAM,KAAK;AAAA,EAClE;AAEE,QAAM,aAAa,YACf,IAAI,WAAW,QAAQ,IAAI,WAAW,wBACtC;AACJ,QAAM,UAAU,YAAY,WAAW,MAAM,KAAK,IAAI,CAAC,EAAE;AAEzD,MAAI,WAAW;AACb,QAAI,IAAI,QAAQ,GAAG,MAAM,MAAM,QAAQ,CAAC,MAAM;AAC5C,cAAQ,QAAQ,EAAE;AAAA,EACxB;AAEE,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,EACJ;AACA;AAEA,MAAM,QAAQ,CAAC,KAAK,KAAK,OAAO;AAC9B,MAAI,OAAO,QAAQ,YAAY;AAC7B,SAAK;AACL,UAAM,CAAA;AAAA,EACV;AACE,MAAI,CAAC;AACH,UAAM,CAAA;AAER,QAAM,EAAE,SAAS,SAAS,WAAU,IAAK,YAAY,KAAK,GAAG;AAC7D,QAAM,QAAQ,CAAA;AAEd,QAAM,OAAO,OAAK,IAAI,QAAQ,CAAC,SAAS,WAAW;AACjD,QAAI,MAAM,QAAQ;AAChB,aAAO,IAAI,OAAO,MAAM,SAAS,QAAQ,KAAK,IAC1C,OAAO,iBAAiB,GAAG,CAAC;AAElC,UAAM,QAAQ,QAAQ,CAAC;AACvB,UAAM,WAAW,SAAS,KAAK,KAAK,IAAI,MAAM,MAAM,GAAG,EAAE,IAAI;AAE7D,UAAM,OAAO,KAAK,KAAK,UAAU,GAAG;AACpC,UAAM,IAAI,CAAC,YAAY,YAAY,KAAK,GAAG,IAAI,IAAI,MAAM,GAAG,CAAC,IAAI,OAC7D;AAEJ,YAAQ,QAAQ,GAAG,GAAG,CAAC,CAAC;AAAA,EAC5B,CAAG;AAED,QAAM,UAAU,CAAC,GAAG,GAAG,OAAO,IAAI,QAAQ,CAAC,SAAS,WAAW;AAC7D,QAAI,OAAO,QAAQ;AACjB,aAAO,QAAQ,KAAK,IAAI,CAAC,CAAC;AAC5B,UAAM,MAAM,QAAQ,EAAE;AACtB,UAAM,IAAI,KAAK,EAAE,SAAS,cAAc,CAAC,IAAI,OAAO;AAClD,UAAI,CAAC,MAAM,IAAI;AACb,YAAI,IAAI;AACN,gBAAM,KAAK,IAAI,GAAG;AAAA;AAElB,iBAAO,QAAQ,IAAI,GAAG;AAAA,MAChC;AACM,aAAO,QAAQ,QAAQ,GAAG,GAAG,KAAK,CAAC,CAAC;AAAA,IAC1C,CAAK;AAAA,EACL,CAAG;AAED,SAAO,KAAK,KAAK,CAAC,EAAE,KAAK,SAAO,GAAG,MAAM,GAAG,GAAG,EAAE,IAAI,KAAK,CAAC;AAC7D;AAEA,MAAM,YAAY,CAAC,KAAK,QAAQ;AAC9B,QAAM,OAAO,CAAA;AAEb,QAAM,EAAE,SAAS,SAAS,WAAU,IAAK,YAAY,KAAK,GAAG;AAC7D,QAAM,QAAQ,CAAA;AAEd,WAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAM;AACxC,UAAM,QAAQ,QAAQ,CAAC;AACvB,UAAM,WAAW,SAAS,KAAK,KAAK,IAAI,MAAM,MAAM,GAAG,EAAE,IAAI;AAE7D,UAAM,OAAO,KAAK,KAAK,UAAU,GAAG;AACpC,UAAM,IAAI,CAAC,YAAY,YAAY,KAAK,GAAG,IAAI,IAAI,MAAM,GAAG,CAAC,IAAI,OAC7D;AAEJ,aAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAM;AACxC,YAAM,MAAM,IAAI,QAAQ,CAAC;AACzB,UAAI;AACF,cAAM,KAAK,MAAM,KAAK,KAAK,EAAE,SAAS,WAAU,CAAE;AAClD,YAAI,IAAI;AACN,cAAI,IAAI;AACN,kBAAM,KAAK,GAAG;AAAA;AAEd,mBAAO;AAAA,QACnB;AAAA,MACA,SAAe,IAAI;AAAA,MAAA;AAAA,IACnB;AAAA,EACA;AAEE,MAAI,IAAI,OAAO,MAAM;AACnB,WAAO;AAET,MAAI,IAAI;AACN,WAAO;AAET,QAAM,iBAAiB,GAAG;AAC5B;AAEA,IAAA,UAAiB;AACjB,MAAM,OAAO;","x_google_ignoreList":[0]}

package/dist/_node_modules/yallist/iterator.cjs

@@ -3,8 +3,7 @@ Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
 var iterator;
 var hasRequiredIterator;
 function requireIterator() {
-  if (hasRequiredIterator)
-    return iterator;
+  if (hasRequiredIterator) return iterator;
   hasRequiredIterator = 1;
   iterator = function(Yallist) {
     Yallist.prototype[Symbol.iterator] = function* () {

package/dist/_node_modules/yallist/iterator.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"iterator.cjs","sources":["../../../../../node_modules/yallist/iterator.js"],"sourcesContent":["'use strict'\nmodule.exports = function (Yallist) {\n  Yallist.prototype[Symbol.iterator] = function* () {\n    for (let walker = this.head; walker; walker = walker.next) {\n      yield walker.value\n    }\n  }\n}\n"],"names":[],"mappings":";;;;;;;;AACc,aAAG,SAAU,SAAS;AAClC,YAAQ,UAAU,OAAO,QAAQ,IAAI,aAAa;AAChD,eAAS,SAAS,KAAK,MAAM,QAAQ,SAAS,OAAO,MAAM;AACzD,cAAM,OAAO;AAAA,MACd;AAAA,IACF;AAAA,EACH;;;;","x_google_ignoreList":[0]}
+{"version":3,"file":"iterator.cjs","sources":["../../../../../node_modules/yallist/iterator.js"],"sourcesContent":["'use strict'\nmodule.exports = function (Yallist) {\n  Yallist.prototype[Symbol.iterator] = function* () {\n    for (let walker = this.head; walker; walker = walker.next) {\n      yield walker.value\n    }\n  }\n}\n"],"names":[],"mappings":";;;;;;;AACA,aAAiB,SAAU,SAAS;AAClC,YAAQ,UAAU,OAAO,QAAQ,IAAI,aAAa;AAChD,eAAS,SAAS,KAAK,MAAM,QAAQ,SAAS,OAAO,MAAM;AACzD,cAAM,OAAO;AAAA,MACnB;AAAA,IACA;AAAA,EACA;;;;","x_google_ignoreList":[0]}

package/dist/_node_modules/yallist/iterator.js

@@ -1,8 +1,7 @@
 var iterator;
 var hasRequiredIterator;
 function requireIterator() {
-  if (hasRequiredIterator)
-    return iterator;
+  if (hasRequiredIterator) return iterator;
   hasRequiredIterator = 1;
   iterator = function(Yallist) {
     Yallist.prototype[Symbol.iterator] = function* () {

package/dist/_node_modules/yallist/iterator.js.map

@@ -1 +1 @@
-{"version":3,"file":"iterator.js","sources":["../../../../../node_modules/yallist/iterator.js"],"sourcesContent":["'use strict'\nmodule.exports = function (Yallist) {\n  Yallist.prototype[Symbol.iterator] = function* () {\n    for (let walker = this.head; walker; walker = walker.next) {\n      yield walker.value\n    }\n  }\n}\n"],"names":[],"mappings":";;;;;;AACc,aAAG,SAAU,SAAS;AAClC,YAAQ,UAAU,OAAO,QAAQ,IAAI,aAAa;AAChD,eAAS,SAAS,KAAK,MAAM,QAAQ,SAAS,OAAO,MAAM;AACzD,cAAM,OAAO;AAAA,MACd;AAAA,IACF;AAAA,EACH;;;","x_google_ignoreList":[0]}
+{"version":3,"file":"iterator.js","sources":["../../../../../node_modules/yallist/iterator.js"],"sourcesContent":["'use strict'\nmodule.exports = function (Yallist) {\n  Yallist.prototype[Symbol.iterator] = function* () {\n    for (let walker = this.head; walker; walker = walker.next) {\n      yield walker.value\n    }\n  }\n}\n"],"names":[],"mappings":";;;;;AACA,aAAiB,SAAU,SAAS;AAClC,YAAQ,UAAU,OAAO,QAAQ,IAAI,aAAa;AAChD,eAAS,SAAS,KAAK,MAAM,QAAQ,SAAS,OAAO,MAAM;AACzD,cAAM,OAAO;AAAA,MACnB;AAAA,IACA;AAAA,EACA;;;","x_google_ignoreList":[0]}

package/dist/_node_modules/yallist/yallist.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"yallist.cjs","sources":["../../../../../node_modules/yallist/yallist.js"],"sourcesContent":["'use strict'\nmodule.exports = Yallist\n\nYallist.Node = Node\nYallist.create = Yallist\n\nfunction Yallist (list) {\n  var self = this\n  if (!(self instanceof Yallist)) {\n    self = new Yallist()\n  }\n\n  self.tail = null\n  self.head = null\n  self.length = 0\n\n  if (list && typeof list.forEach === 'function') {\n    list.forEach(function (item) {\n      self.push(item)\n    })\n  } else if (arguments.length > 0) {\n    for (var i = 0, l = arguments.length; i < l; i++) {\n      self.push(arguments[i])\n    }\n  }\n\n  return self\n}\n\nYallist.prototype.removeNode = function (node) {\n  if (node.list !== this) {\n    throw new Error('removing node which does not belong to this list')\n  }\n\n  var next = node.next\n  var prev = node.prev\n\n  if (next) {\n    next.prev = prev\n  }\n\n  if (prev) {\n    prev.next = next\n  }\n\n  if (node === this.head) {\n    this.head = next\n  }\n  if (node === this.tail) {\n    this.tail = prev\n  }\n\n  node.list.length--\n  node.next = null\n  node.prev = null\n  node.list = null\n\n  return next\n}\n\nYallist.prototype.unshiftNode = function (node) {\n  if (node === this.head) {\n    return\n  }\n\n  if (node.list) {\n    node.list.removeNode(node)\n  }\n\n  var head = this.head\n  node.list = this\n  node.next = head\n  if (head) {\n    head.prev = node\n  }\n\n  this.head = node\n  if (!this.tail) {\n    this.tail = node\n  }\n  this.length++\n}\n\nYallist.prototype.pushNode = function (node) {\n  if (node === this.tail) {\n    return\n  }\n\n  if (node.list) {\n    node.list.removeNode(node)\n  }\n\n  var tail = this.tail\n  node.list = this\n  node.prev = tail\n  if (tail) {\n    tail.next = node\n  }\n\n  this.tail = node\n  if (!this.head) {\n    this.head = node\n  }\n  this.length++\n}\n\nYallist.prototype.push = function () {\n  for (var i = 0, l = arguments.length; i < l; i++) {\n    push(this, arguments[i])\n  }\n  return this.length\n}\n\nYallist.prototype.unshift = function () {\n  for (var i = 0, l = arguments.length; i < l; i++) {\n    unshift(this, arguments[i])\n  }\n  return this.length\n}\n\nYallist.prototype.pop = function () {\n  if (!this.tail) {\n    return undefined\n  }\n\n  var res = this.tail.value\n  this.tail = this.tail.prev\n  if (this.tail) {\n    this.tail.next = null\n  } else {\n    this.head = null\n  }\n  this.length--\n  return res\n}\n\nYallist.prototype.shift = function () {\n  if (!this.head) {\n    return undefined\n  }\n\n  var res = this.head.value\n  this.head = this.head.next\n  if (this.head) {\n    this.head.prev = null\n  } else {\n    this.tail = null\n  }\n  this.length--\n  return res\n}\n\nYallist.prototype.forEach = function (fn, thisp) {\n  thisp = thisp || this\n  for (var walker = this.head, i = 0; walker !== null; i++) {\n    fn.call(thisp, walker.value, i, this)\n    walker = walker.next\n  }\n}\n\nYallist.prototype.forEachReverse = function (fn, thisp) {\n  thisp = thisp || this\n  for (var walker = this.tail, i = this.length - 1; walker !== null; i--) {\n    fn.call(thisp, walker.value, i, this)\n    walker = walker.prev\n  }\n}\n\nYallist.prototype.get = function (n) {\n  for (var i = 0, walker = this.head; walker !== null && i < n; i++) {\n    // abort out of the list early if we hit a cycle\n    walker = walker.next\n  }\n  if (i === n && walker !== null) {\n    return walker.value\n  }\n}\n\nYallist.prototype.getReverse = function (n) {\n  for (var i = 0, walker = this.tail; walker !== null && i < n; i++) {\n    // abort out of the list early if we hit a cycle\n    walker = walker.prev\n  }\n  if (i === n && walker !== null) {\n    return walker.value\n  }\n}\n\nYallist.prototype.map = function (fn, thisp) {\n  thisp = thisp || this\n  var res = new Yallist()\n  for (var walker = this.head; walker !== null;) {\n    res.push(fn.call(thisp, walker.value, this))\n    walker = walker.next\n  }\n  return res\n}\n\nYallist.prototype.mapReverse = function (fn, thisp) {\n  thisp = thisp || this\n  var res = new Yallist()\n  for (var walker = this.tail; walker !== null;) {\n    res.push(fn.call(thisp, walker.value, this))\n    walker = walker.prev\n  }\n  return res\n}\n\nYallist.prototype.reduce = function (fn, initial) {\n  var acc\n  var walker = this.head\n  if (arguments.length > 1) {\n    acc = initial\n  } else if (this.head) {\n    walker = this.head.next\n    acc = this.head.value\n  } else {\n    throw new TypeError('Reduce of empty list with no initial value')\n  }\n\n  for (var i = 0; walker !== null; i++) {\n    acc = fn(acc, walker.value, i)\n    walker = walker.next\n  }\n\n  return acc\n}\n\nYallist.prototype.reduceReverse = function (fn, initial) {\n  var acc\n  var walker = this.tail\n  if (arguments.length > 1) {\n    acc = initial\n  } else if (this.tail) {\n    walker = this.tail.prev\n    acc = this.tail.value\n  } else {\n    throw new TypeError('Reduce of empty list with no initial value')\n  }\n\n  for (var i = this.length - 1; walker !== null; i--) {\n    acc = fn(acc, walker.value, i)\n    walker = walker.prev\n  }\n\n  return acc\n}\n\nYallist.prototype.toArray = function () {\n  var arr = new Array(this.length)\n  for (var i = 0, walker = this.head; walker !== null; i++) {\n    arr[i] = walker.value\n    walker = walker.next\n  }\n  return arr\n}\n\nYallist.prototype.toArrayReverse = function () {\n  var arr = new Array(this.length)\n  for (var i = 0, walker = this.tail; walker !== null; i++) {\n    arr[i] = walker.value\n    walker = walker.prev\n  }\n  return arr\n}\n\nYallist.prototype.slice = function (from, to) {\n  to = to || this.length\n  if (to < 0) {\n    to += this.length\n  }\n  from = from || 0\n  if (from < 0) {\n    from += this.length\n  }\n  var ret = new Yallist()\n  if (to < from || to < 0) {\n    return ret\n  }\n  if (from < 0) {\n    from = 0\n  }\n  if (to > this.length) {\n    to = this.length\n  }\n  for (var i = 0, walker = this.head; walker !== null && i < from; i++) {\n    walker = walker.next\n  }\n  for (; walker !== null && i < to; i++, walker = walker.next) {\n    ret.push(walker.value)\n  }\n  return ret\n}\n\nYallist.prototype.sliceReverse = function (from, to) {\n  to = to || this.length\n  if (to < 0) {\n    to += this.length\n  }\n  from = from || 0\n  if (from < 0) {\n    from += this.length\n  }\n  var ret = new Yallist()\n  if (to < from || to < 0) {\n    return ret\n  }\n  if (from < 0) {\n    from = 0\n  }\n  if (to > this.length) {\n    to = this.length\n  }\n  for (var i = this.length, walker = this.tail; walker !== null && i > to; i--) {\n    walker = walker.prev\n  }\n  for (; walker !== null && i > from; i--, walker = walker.prev) {\n    ret.push(walker.value)\n  }\n  return ret\n}\n\nYallist.prototype.splice = function (start, deleteCount, ...nodes) {\n  if (start > this.length) {\n    start = this.length - 1\n  }\n  if (start < 0) {\n    start = this.length + start;\n  }\n\n  for (var i = 0, walker = this.head; walker !== null && i < start; i++) {\n    walker = walker.next\n  }\n\n  var ret = []\n  for (var i = 0; walker && i < deleteCount; i++) {\n    ret.push(walker.value)\n    walker = this.removeNode(walker)\n  }\n  if (walker === null) {\n    walker = this.tail\n  }\n\n  if (walker !== this.head && walker !== this.tail) {\n    walker = walker.prev\n  }\n\n  for (var i = 0; i < nodes.length; i++) {\n    walker = insert(this, walker, nodes[i])\n  }\n  return ret;\n}\n\nYallist.prototype.reverse = function () {\n  var head = this.head\n  var tail = this.tail\n  for (var walker = head; walker !== null; walker = walker.prev) {\n    var p = walker.prev\n    walker.prev = walker.next\n    walker.next = p\n  }\n  this.head = tail\n  this.tail = head\n  return this\n}\n\nfunction insert (self, node, value) {\n  var inserted = node === self.head ?\n    new Node(value, null, node, self) :\n    new Node(value, node, node.next, self)\n\n  if (inserted.next === null) {\n    self.tail = inserted\n  }\n  if (inserted.prev === null) {\n    self.head = inserted\n  }\n\n  self.length++\n\n  return inserted\n}\n\nfunction push (self, item) {\n  self.tail = new Node(item, self.tail, null, self)\n  if (!self.head) {\n    self.head = self.tail\n  }\n  self.length++\n}\n\nfunction unshift (self, item) {\n  self.head = new Node(item, null, self.head, self)\n  if (!self.tail) {\n    self.tail = self.head\n  }\n  self.length++\n}\n\nfunction Node (value, prev, next, list) {\n  if (!(this instanceof Node)) {\n    return new Node(value, prev, next, list)\n  }\n\n  this.list = list\n  this.value = value\n\n  if (prev) {\n    prev.next = this\n    this.prev = prev\n  } else {\n    this.prev = null\n  }\n\n  if (next) {\n    next.prev = this\n    this.next = next\n  } else {\n    this.next = null\n  }\n}\n\ntry {\n  // add if support for Symbol.iterator is present\n  require('./iterator.js')(Yallist)\n} catch (er) {}\n"],"names":["require$$0"],"mappings":";;;AACA,IAAA,UAAiB;AAEjB,QAAQ,OAAO;AACf,QAAQ,SAAS;AAEjB,SAAS,QAAS,MAAM;AACtB,MAAI,OAAO;AACX,MAAI,EAAE,gBAAgB,UAAU;AAC9B,WAAO,IAAI,QAAS;AAAA,EACrB;AAED,OAAK,OAAO;AACZ,OAAK,OAAO;AACZ,OAAK,SAAS;AAEd,MAAI,QAAQ,OAAO,KAAK,YAAY,YAAY;AAC9C,SAAK,QAAQ,SAAU,MAAM;AAC3B,WAAK,KAAK,IAAI;AAAA,IACpB,CAAK;AAAA,EACL,WAAa,UAAU,SAAS,GAAG;AAC/B,aAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,IAAI,GAAG,KAAK;AAChD,WAAK,KAAK,UAAU,CAAC,CAAC;AAAA,IACvB;AAAA,EACF;AAED,SAAO;AACT;AAEA,QAAQ,UAAU,aAAa,SAAU,MAAM;AAC7C,MAAI,KAAK,SAAS,MAAM;AACtB,UAAM,IAAI,MAAM,kDAAkD;AAAA,EACnE;AAED,MAAI,OAAO,KAAK;AAChB,MAAI,OAAO,KAAK;AAEhB,MAAI,MAAM;AACR,SAAK,OAAO;AAAA,EACb;AAED,MAAI,MAAM;AACR,SAAK,OAAO;AAAA,EACb;AAED,MAAI,SAAS,KAAK,MAAM;AACtB,SAAK,OAAO;AAAA,EACb;AACD,MAAI,SAAS,KAAK,MAAM;AACtB,SAAK,OAAO;AAAA,EACb;AAED,OAAK,KAAK;AACV,OAAK,OAAO;AACZ,OAAK,OAAO;AACZ,OAAK,OAAO;AAEZ,SAAO;AACT;AAEA,QAAQ,UAAU,cAAc,SAAU,MAAM;AAC9C,MAAI,SAAS,KAAK,MAAM;AACtB;AAAA,EACD;AAED,MAAI,KAAK,MAAM;AACb,SAAK,KAAK,WAAW,IAAI;AAAA,EAC1B;AAED,MAAI,OAAO,KAAK;AAChB,OAAK,OAAO;AACZ,OAAK,OAAO;AACZ,MAAI,MAAM;AACR,SAAK,OAAO;AAAA,EACb;AAED,OAAK,OAAO;AACZ,MAAI,CAAC,KAAK,MAAM;AACd,SAAK,OAAO;AAAA,EACb;AACD,OAAK;AACP;AAEA,QAAQ,UAAU,WAAW,SAAU,MAAM;AAC3C,MAAI,SAAS,KAAK,MAAM;AACtB;AAAA,EACD;AAED,MAAI,KAAK,MAAM;AACb,SAAK,KAAK,WAAW,IAAI;AAAA,EAC1B;AAED,MAAI,OAAO,KAAK;AAChB,OAAK,OAAO;AACZ,OAAK,OAAO;AACZ,MAAI,MAAM;AACR,SAAK,OAAO;AAAA,EACb;AAED,OAAK,OAAO;AACZ,MAAI,CAAC,KAAK,MAAM;AACd,SAAK,OAAO;AAAA,EACb;AACD,OAAK;AACP;AAEA,QAAQ,UAAU,OAAO,WAAY;AACnC,WAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,IAAI,GAAG,KAAK;AAChD,SAAK,MAAM,UAAU,CAAC,CAAC;AAAA,EACxB;AACD,SAAO,KAAK;AACd;AAEA,QAAQ,UAAU,UAAU,WAAY;AACtC,WAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,IAAI,GAAG,KAAK;AAChD,YAAQ,MAAM,UAAU,CAAC,CAAC;AAAA,EAC3B;AACD,SAAO,KAAK;AACd;AAEA,QAAQ,UAAU,MAAM,WAAY;AAClC,MAAI,CAAC,KAAK,MAAM;AACd,WAAO;AAAA,EACR;AAED,MAAI,MAAM,KAAK,KAAK;AACpB,OAAK,OAAO,KAAK,KAAK;AACtB,MAAI,KAAK,MAAM;AACb,SAAK,KAAK,OAAO;AAAA,EACrB,OAAS;AACL,SAAK,OAAO;AAAA,EACb;AACD,OAAK;AACL,SAAO;AACT;AAEA,QAAQ,UAAU,QAAQ,WAAY;AACpC,MAAI,CAAC,KAAK,MAAM;AACd,WAAO;AAAA,EACR;AAED,MAAI,MAAM,KAAK,KAAK;AACpB,OAAK,OAAO,KAAK,KAAK;AACtB,MAAI,KAAK,MAAM;AACb,SAAK,KAAK,OAAO;AAAA,EACrB,OAAS;AACL,SAAK,OAAO;AAAA,EACb;AACD,OAAK;AACL,SAAO;AACT;AAEA,QAAQ,UAAU,UAAU,SAAU,IAAI,OAAO;AAC/C,UAAQ,SAAS;AACjB,WAAS,SAAS,KAAK,MAAM,IAAI,GAAG,WAAW,MAAM,KAAK;AACxD,OAAG,KAAK,OAAO,OAAO,OAAO,GAAG,IAAI;AACpC,aAAS,OAAO;AAAA,EACjB;AACH;AAEA,QAAQ,UAAU,iBAAiB,SAAU,IAAI,OAAO;AACtD,UAAQ,SAAS;AACjB,WAAS,SAAS,KAAK,MAAM,IAAI,KAAK,SAAS,GAAG,WAAW,MAAM,KAAK;AACtE,OAAG,KAAK,OAAO,OAAO,OAAO,GAAG,IAAI;AACpC,aAAS,OAAO;AAAA,EACjB;AACH;AAEA,QAAQ,UAAU,MAAM,SAAU,GAAG;AACnC,WAAS,IAAI,GAAG,SAAS,KAAK,MAAM,WAAW,QAAQ,IAAI,GAAG,KAAK;AAEjE,aAAS,OAAO;AAAA,EACjB;AACD,MAAI,MAAM,KAAK,WAAW,MAAM;AAC9B,WAAO,OAAO;AAAA,EACf;AACH;AAEA,QAAQ,UAAU,aAAa,SAAU,GAAG;AAC1C,WAAS,IAAI,GAAG,SAAS,KAAK,MAAM,WAAW,QAAQ,IAAI,GAAG,KAAK;AAEjE,aAAS,OAAO;AAAA,EACjB;AACD,MAAI,MAAM,KAAK,WAAW,MAAM;AAC9B,WAAO,OAAO;AAAA,EACf;AACH;AAEA,QAAQ,UAAU,MAAM,SAAU,IAAI,OAAO;AAC3C,UAAQ,SAAS;AACjB,MAAI,MAAM,IAAI,QAAS;AACvB,WAAS,SAAS,KAAK,MAAM,WAAW,QAAO;AAC7C,QAAI,KAAK,GAAG,KAAK,OAAO,OAAO,OAAO,IAAI,CAAC;AAC3C,aAAS,OAAO;AAAA,EACjB;AACD,SAAO;AACT;AAEA,QAAQ,UAAU,aAAa,SAAU,IAAI,OAAO;AAClD,UAAQ,SAAS;AACjB,MAAI,MAAM,IAAI,QAAS;AACvB,WAAS,SAAS,KAAK,MAAM,WAAW,QAAO;AAC7C,QAAI,KAAK,GAAG,KAAK,OAAO,OAAO,OAAO,IAAI,CAAC;AAC3C,aAAS,OAAO;AAAA,EACjB;AACD,SAAO;AACT;AAEA,QAAQ,UAAU,SAAS,SAAU,IAAI,SAAS;AAChD,MAAI;AACJ,MAAI,SAAS,KAAK;AAClB,MAAI,UAAU,SAAS,GAAG;AACxB,UAAM;AAAA,EACV,WAAa,KAAK,MAAM;AACpB,aAAS,KAAK,KAAK;AACnB,UAAM,KAAK,KAAK;AAAA,EACpB,OAAS;AACL,UAAM,IAAI,UAAU,4CAA4C;AAAA,EACjE;AAED,WAAS,IAAI,GAAG,WAAW,MAAM,KAAK;AACpC,UAAM,GAAG,KAAK,OAAO,OAAO,CAAC;AAC7B,aAAS,OAAO;AAAA,EACjB;AAED,SAAO;AACT;AAEA,QAAQ,UAAU,gBAAgB,SAAU,IAAI,SAAS;AACvD,MAAI;AACJ,MAAI,SAAS,KAAK;AAClB,MAAI,UAAU,SAAS,GAAG;AACxB,UAAM;AAAA,EACV,WAAa,KAAK,MAAM;AACpB,aAAS,KAAK,KAAK;AACnB,UAAM,KAAK,KAAK;AAAA,EACpB,OAAS;AACL,UAAM,IAAI,UAAU,4CAA4C;AAAA,EACjE;AAED,WAAS,IAAI,KAAK,SAAS,GAAG,WAAW,MAAM,KAAK;AAClD,UAAM,GAAG,KAAK,OAAO,OAAO,CAAC;AAC7B,aAAS,OAAO;AAAA,EACjB;AAED,SAAO;AACT;AAEA,QAAQ,UAAU,UAAU,WAAY;AACtC,MAAI,MAAM,IAAI,MAAM,KAAK,MAAM;AAC/B,WAAS,IAAI,GAAG,SAAS,KAAK,MAAM,WAAW,MAAM,KAAK;AACxD,QAAI,CAAC,IAAI,OAAO;AAChB,aAAS,OAAO;AAAA,EACjB;AACD,SAAO;AACT;AAEA,QAAQ,UAAU,iBAAiB,WAAY;AAC7C,MAAI,MAAM,IAAI,MAAM,KAAK,MAAM;AAC/B,WAAS,IAAI,GAAG,SAAS,KAAK,MAAM,WAAW,MAAM,KAAK;AACxD,QAAI,CAAC,IAAI,OAAO;AAChB,aAAS,OAAO;AAAA,EACjB;AACD,SAAO;AACT;AAEA,QAAQ,UAAU,QAAQ,SAAU,MAAM,IAAI;AAC5C,OAAK,MAAM,KAAK;AAChB,MAAI,KAAK,GAAG;AACV,UAAM,KAAK;AAAA,EACZ;AACD,SAAO,QAAQ;AACf,MAAI,OAAO,GAAG;AACZ,YAAQ,KAAK;AAAA,EACd;AACD,MAAI,MAAM,IAAI,QAAS;AACvB,MAAI,KAAK,QAAQ,KAAK,GAAG;AACvB,WAAO;AAAA,EACR;AACD,MAAI,OAAO,GAAG;AACZ,WAAO;AAAA,EACR;AACD,MAAI,KAAK,KAAK,QAAQ;AACpB,SAAK,KAAK;AAAA,EACX;AACD,WAAS,IAAI,GAAG,SAAS,KAAK,MAAM,WAAW,QAAQ,IAAI,MAAM,KAAK;AACpE,aAAS,OAAO;AAAA,EACjB;AACD,SAAO,WAAW,QAAQ,IAAI,IAAI,KAAK,SAAS,OAAO,MAAM;AAC3D,QAAI,KAAK,OAAO,KAAK;AAAA,EACtB;AACD,SAAO;AACT;AAEA,QAAQ,UAAU,eAAe,SAAU,MAAM,IAAI;AACnD,OAAK,MAAM,KAAK;AAChB,MAAI,KAAK,GAAG;AACV,UAAM,KAAK;AAAA,EACZ;AACD,SAAO,QAAQ;AACf,MAAI,OAAO,GAAG;AACZ,YAAQ,KAAK;AAAA,EACd;AACD,MAAI,MAAM,IAAI,QAAS;AACvB,MAAI,KAAK,QAAQ,KAAK,GAAG;AACvB,WAAO;AAAA,EACR;AACD,MAAI,OAAO,GAAG;AACZ,WAAO;AAAA,EACR;AACD,MAAI,KAAK,KAAK,QAAQ;AACpB,SAAK,KAAK;AAAA,EACX;AACD,WAAS,IAAI,KAAK,QAAQ,SAAS,KAAK,MAAM,WAAW,QAAQ,IAAI,IAAI,KAAK;AAC5E,aAAS,OAAO;AAAA,EACjB;AACD,SAAO,WAAW,QAAQ,IAAI,MAAM,KAAK,SAAS,OAAO,MAAM;AAC7D,QAAI,KAAK,OAAO,KAAK;AAAA,EACtB;AACD,SAAO;AACT;AAEA,QAAQ,UAAU,SAAS,SAAU,OAAO,gBAAgB,OAAO;AACjE,MAAI,QAAQ,KAAK,QAAQ;AACvB,YAAQ,KAAK,SAAS;AAAA,EACvB;AACD,MAAI,QAAQ,GAAG;AACb,YAAQ,KAAK,SAAS;AAAA,EACvB;AAED,WAAS,IAAI,GAAG,SAAS,KAAK,MAAM,WAAW,QAAQ,IAAI,OAAO,KAAK;AACrE,aAAS,OAAO;AAAA,EACjB;AAED,MAAI,MAAM,CAAE;AACZ,WAAS,IAAI,GAAG,UAAU,IAAI,aAAa,KAAK;AAC9C,QAAI,KAAK,OAAO,KAAK;AACrB,aAAS,KAAK,WAAW,MAAM;AAAA,EAChC;AACD,MAAI,WAAW,MAAM;AACnB,aAAS,KAAK;AAAA,EACf;AAED,MAAI,WAAW,KAAK,QAAQ,WAAW,KAAK,MAAM;AAChD,aAAS,OAAO;AAAA,EACjB;AAED,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,aAAS,OAAO,MAAM,QAAQ,MAAM,CAAC,CAAC;AAAA,EACvC;AACD,SAAO;AACT;AAEA,QAAQ,UAAU,UAAU,WAAY;AACtC,MAAI,OAAO,KAAK;AAChB,MAAI,OAAO,KAAK;AAChB,WAAS,SAAS,MAAM,WAAW,MAAM,SAAS,OAAO,MAAM;AAC7D,QAAI,IAAI,OAAO;AACf,WAAO,OAAO,OAAO;AACrB,WAAO,OAAO;AAAA,EACf;AACD,OAAK,OAAO;AACZ,OAAK,OAAO;AACZ,SAAO;AACT;AAEA,SAAS,OAAQ,MAAM,MAAM,OAAO;AAClC,MAAI,WAAW,SAAS,KAAK,OAC3B,IAAI,KAAK,OAAO,MAAM,MAAM,IAAI,IAChC,IAAI,KAAK,OAAO,MAAM,KAAK,MAAM,IAAI;AAEvC,MAAI,SAAS,SAAS,MAAM;AAC1B,SAAK,OAAO;AAAA,EACb;AACD,MAAI,SAAS,SAAS,MAAM;AAC1B,SAAK,OAAO;AAAA,EACb;AAED,OAAK;AAEL,SAAO;AACT;AAEA,SAAS,KAAM,MAAM,MAAM;AACzB,OAAK,OAAO,IAAI,KAAK,MAAM,KAAK,MAAM,MAAM,IAAI;AAChD,MAAI,CAAC,KAAK,MAAM;AACd,SAAK,OAAO,KAAK;AAAA,EAClB;AACD,OAAK;AACP;AAEA,SAAS,QAAS,MAAM,MAAM;AAC5B,OAAK,OAAO,IAAI,KAAK,MAAM,MAAM,KAAK,MAAM,IAAI;AAChD,MAAI,CAAC,KAAK,MAAM;AACd,SAAK,OAAO,KAAK;AAAA,EAClB;AACD,OAAK;AACP;AAEA,SAAS,KAAM,OAAO,MAAM,MAAM,MAAM;AACtC,MAAI,EAAE,gBAAgB,OAAO;AAC3B,WAAO,IAAI,KAAK,OAAO,MAAM,MAAM,IAAI;AAAA,EACxC;AAED,OAAK,OAAO;AACZ,OAAK,QAAQ;AAEb,MAAI,MAAM;AACR,SAAK,OAAO;AACZ,SAAK,OAAO;AAAA,EAChB,OAAS;AACL,SAAK,OAAO;AAAA,EACb;AAED,MAAI,MAAM;AACR,SAAK,OAAO;AACZ,SAAK,OAAO;AAAA,EAChB,OAAS;AACL,SAAK,OAAO;AAAA,EACb;AACH;AAEA,IAAI;AAEFA,WAAA,UAAA,EAAyB,OAAO;AAClC,SAAS,IAAI;AAAA;;","x_google_ignoreList":[0]}
+{"version":3,"file":"yallist.cjs","sources":["../../../../../node_modules/yallist/yallist.js"],"sourcesContent":["'use strict'\nmodule.exports = Yallist\n\nYallist.Node = Node\nYallist.create = Yallist\n\nfunction Yallist (list) {\n  var self = this\n  if (!(self instanceof Yallist)) {\n    self = new Yallist()\n  }\n\n  self.tail = null\n  self.head = null\n  self.length = 0\n\n  if (list && typeof list.forEach === 'function') {\n    list.forEach(function (item) {\n      self.push(item)\n    })\n  } else if (arguments.length > 0) {\n    for (var i = 0, l = arguments.length; i < l; i++) {\n      self.push(arguments[i])\n    }\n  }\n\n  return self\n}\n\nYallist.prototype.removeNode = function (node) {\n  if (node.list !== this) {\n    throw new Error('removing node which does not belong to this list')\n  }\n\n  var next = node.next\n  var prev = node.prev\n\n  if (next) {\n    next.prev = prev\n  }\n\n  if (prev) {\n    prev.next = next\n  }\n\n  if (node === this.head) {\n    this.head = next\n  }\n  if (node === this.tail) {\n    this.tail = prev\n  }\n\n  node.list.length--\n  node.next = null\n  node.prev = null\n  node.list = null\n\n  return next\n}\n\nYallist.prototype.unshiftNode = function (node) {\n  if (node === this.head) {\n    return\n  }\n\n  if (node.list) {\n    node.list.removeNode(node)\n  }\n\n  var head = this.head\n  node.list = this\n  node.next = head\n  if (head) {\n    head.prev = node\n  }\n\n  this.head = node\n  if (!this.tail) {\n    this.tail = node\n  }\n  this.length++\n}\n\nYallist.prototype.pushNode = function (node) {\n  if (node === this.tail) {\n    return\n  }\n\n  if (node.list) {\n    node.list.removeNode(node)\n  }\n\n  var tail = this.tail\n  node.list = this\n  node.prev = tail\n  if (tail) {\n    tail.next = node\n  }\n\n  this.tail = node\n  if (!this.head) {\n    this.head = node\n  }\n  this.length++\n}\n\nYallist.prototype.push = function () {\n  for (var i = 0, l = arguments.length; i < l; i++) {\n    push(this, arguments[i])\n  }\n  return this.length\n}\n\nYallist.prototype.unshift = function () {\n  for (var i = 0, l = arguments.length; i < l; i++) {\n    unshift(this, arguments[i])\n  }\n  return this.length\n}\n\nYallist.prototype.pop = function () {\n  if (!this.tail) {\n    return undefined\n  }\n\n  var res = this.tail.value\n  this.tail = this.tail.prev\n  if (this.tail) {\n    this.tail.next = null\n  } else {\n    this.head = null\n  }\n  this.length--\n  return res\n}\n\nYallist.prototype.shift = function () {\n  if (!this.head) {\n    return undefined\n  }\n\n  var res = this.head.value\n  this.head = this.head.next\n  if (this.head) {\n    this.head.prev = null\n  } else {\n    this.tail = null\n  }\n  this.length--\n  return res\n}\n\nYallist.prototype.forEach = function (fn, thisp) {\n  thisp = thisp || this\n  for (var walker = this.head, i = 0; walker !== null; i++) {\n    fn.call(thisp, walker.value, i, this)\n    walker = walker.next\n  }\n}\n\nYallist.prototype.forEachReverse = function (fn, thisp) {\n  thisp = thisp || this\n  for (var walker = this.tail, i = this.length - 1; walker !== null; i--) {\n    fn.call(thisp, walker.value, i, this)\n    walker = walker.prev\n  }\n}\n\nYallist.prototype.get = function (n) {\n  for (var i = 0, walker = this.head; walker !== null && i < n; i++) {\n    // abort out of the list early if we hit a cycle\n    walker = walker.next\n  }\n  if (i === n && walker !== null) {\n    return walker.value\n  }\n}\n\nYallist.prototype.getReverse = function (n) {\n  for (var i = 0, walker = this.tail; walker !== null && i < n; i++) {\n    // abort out of the list early if we hit a cycle\n    walker = walker.prev\n  }\n  if (i === n && walker !== null) {\n    return walker.value\n  }\n}\n\nYallist.prototype.map = function (fn, thisp) {\n  thisp = thisp || this\n  var res = new Yallist()\n  for (var walker = this.head; walker !== null;) {\n    res.push(fn.call(thisp, walker.value, this))\n    walker = walker.next\n  }\n  return res\n}\n\nYallist.prototype.mapReverse = function (fn, thisp) {\n  thisp = thisp || this\n  var res = new Yallist()\n  for (var walker = this.tail; walker !== null;) {\n    res.push(fn.call(thisp, walker.value, this))\n    walker = walker.prev\n  }\n  return res\n}\n\nYallist.prototype.reduce = function (fn, initial) {\n  var acc\n  var walker = this.head\n  if (arguments.length > 1) {\n    acc = initial\n  } else if (this.head) {\n    walker = this.head.next\n    acc = this.head.value\n  } else {\n    throw new TypeError('Reduce of empty list with no initial value')\n  }\n\n  for (var i = 0; walker !== null; i++) {\n    acc = fn(acc, walker.value, i)\n    walker = walker.next\n  }\n\n  return acc\n}\n\nYallist.prototype.reduceReverse = function (fn, initial) {\n  var acc\n  var walker = this.tail\n  if (arguments.length > 1) {\n    acc = initial\n  } else if (this.tail) {\n    walker = this.tail.prev\n    acc = this.tail.value\n  } else {\n    throw new TypeError('Reduce of empty list with no initial value')\n  }\n\n  for (var i = this.length - 1; walker !== null; i--) {\n    acc = fn(acc, walker.value, i)\n    walker = walker.prev\n  }\n\n  return acc\n}\n\nYallist.prototype.toArray = function () {\n  var arr = new Array(this.length)\n  for (var i = 0, walker = this.head; walker !== null; i++) {\n    arr[i] = walker.value\n    walker = walker.next\n  }\n  return arr\n}\n\nYallist.prototype.toArrayReverse = function () {\n  var arr = new Array(this.length)\n  for (var i = 0, walker = this.tail; walker !== null; i++) {\n    arr[i] = walker.value\n    walker = walker.prev\n  }\n  return arr\n}\n\nYallist.prototype.slice = function (from, to) {\n  to = to || this.length\n  if (to < 0) {\n    to += this.length\n  }\n  from = from || 0\n  if (from < 0) {\n    from += this.length\n  }\n  var ret = new Yallist()\n  if (to < from || to < 0) {\n    return ret\n  }\n  if (from < 0) {\n    from = 0\n  }\n  if (to > this.length) {\n    to = this.length\n  }\n  for (var i = 0, walker = this.head; walker !== null && i < from; i++) {\n    walker = walker.next\n  }\n  for (; walker !== null && i < to; i++, walker = walker.next) {\n    ret.push(walker.value)\n  }\n  return ret\n}\n\nYallist.prototype.sliceReverse = function (from, to) {\n  to = to || this.length\n  if (to < 0) {\n    to += this.length\n  }\n  from = from || 0\n  if (from < 0) {\n    from += this.length\n  }\n  var ret = new Yallist()\n  if (to < from || to < 0) {\n    return ret\n  }\n  if (from < 0) {\n    from = 0\n  }\n  if (to > this.length) {\n    to = this.length\n  }\n  for (var i = this.length, walker = this.tail; walker !== null && i > to; i--) {\n    walker = walker.prev\n  }\n  for (; walker !== null && i > from; i--, walker = walker.prev) {\n    ret.push(walker.value)\n  }\n  return ret\n}\n\nYallist.prototype.splice = function (start, deleteCount, ...nodes) {\n  if (start > this.length) {\n    start = this.length - 1\n  }\n  if (start < 0) {\n    start = this.length + start;\n  }\n\n  for (var i = 0, walker = this.head; walker !== null && i < start; i++) {\n    walker = walker.next\n  }\n\n  var ret = []\n  for (var i = 0; walker && i < deleteCount; i++) {\n    ret.push(walker.value)\n    walker = this.removeNode(walker)\n  }\n  if (walker === null) {\n    walker = this.tail\n  }\n\n  if (walker !== this.head && walker !== this.tail) {\n    walker = walker.prev\n  }\n\n  for (var i = 0; i < nodes.length; i++) {\n    walker = insert(this, walker, nodes[i])\n  }\n  return ret;\n}\n\nYallist.prototype.reverse = function () {\n  var head = this.head\n  var tail = this.tail\n  for (var walker = head; walker !== null; walker = walker.prev) {\n    var p = walker.prev\n    walker.prev = walker.next\n    walker.next = p\n  }\n  this.head = tail\n  this.tail = head\n  return this\n}\n\nfunction insert (self, node, value) {\n  var inserted = node === self.head ?\n    new Node(value, null, node, self) :\n    new Node(value, node, node.next, self)\n\n  if (inserted.next === null) {\n    self.tail = inserted\n  }\n  if (inserted.prev === null) {\n    self.head = inserted\n  }\n\n  self.length++\n\n  return inserted\n}\n\nfunction push (self, item) {\n  self.tail = new Node(item, self.tail, null, self)\n  if (!self.head) {\n    self.head = self.tail\n  }\n  self.length++\n}\n\nfunction unshift (self, item) {\n  self.head = new Node(item, null, self.head, self)\n  if (!self.tail) {\n    self.tail = self.head\n  }\n  self.length++\n}\n\nfunction Node (value, prev, next, list) {\n  if (!(this instanceof Node)) {\n    return new Node(value, prev, next, list)\n  }\n\n  this.list = list\n  this.value = value\n\n  if (prev) {\n    prev.next = this\n    this.prev = prev\n  } else {\n    this.prev = null\n  }\n\n  if (next) {\n    next.prev = this\n    this.next = next\n  } else {\n    this.next = null\n  }\n}\n\ntry {\n  // add if support for Symbol.iterator is present\n  require('./iterator.js')(Yallist)\n} catch (er) {}\n"],"names":["require$$0"],"mappings":";;;AACA,IAAA,UAAiB;AAEjB,QAAQ,OAAO;AACf,QAAQ,SAAS;AAEjB,SAAS,QAAS,MAAM;AACtB,MAAI,OAAO;AACX,MAAI,EAAE,gBAAgB,UAAU;AAC9B,WAAO,IAAI,QAAO;AAAA,EACtB;AAEE,OAAK,OAAO;AACZ,OAAK,OAAO;AACZ,OAAK,SAAS;AAEd,MAAI,QAAQ,OAAO,KAAK,YAAY,YAAY;AAC9C,SAAK,QAAQ,SAAU,MAAM;AAC3B,WAAK,KAAK,IAAI;AAAA,IACpB,CAAK;AAAA,EACL,WAAa,UAAU,SAAS,GAAG;AAC/B,aAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,IAAI,GAAG,KAAK;AAChD,WAAK,KAAK,UAAU,CAAC,CAAC;AAAA,IAC5B;AAAA,EACA;AAEE,SAAO;AACT;AAEA,QAAQ,UAAU,aAAa,SAAU,MAAM;AAC7C,MAAI,KAAK,SAAS,MAAM;AACtB,UAAM,IAAI,MAAM,kDAAkD;AAAA,EACtE;AAEE,MAAI,OAAO,KAAK;AAChB,MAAI,OAAO,KAAK;AAEhB,MAAI,MAAM;AACR,SAAK,OAAO;AAAA,EAChB;AAEE,MAAI,MAAM;AACR,SAAK,OAAO;AAAA,EAChB;AAEE,MAAI,SAAS,KAAK,MAAM;AACtB,SAAK,OAAO;AAAA,EAChB;AACE,MAAI,SAAS,KAAK,MAAM;AACtB,SAAK,OAAO;AAAA,EAChB;AAEE,OAAK,KAAK;AACV,OAAK,OAAO;AACZ,OAAK,OAAO;AACZ,OAAK,OAAO;AAEZ,SAAO;AACT;AAEA,QAAQ,UAAU,cAAc,SAAU,MAAM;AAC9C,MAAI,SAAS,KAAK,MAAM;AACtB;AAAA,EACJ;AAEE,MAAI,KAAK,MAAM;AACb,SAAK,KAAK,WAAW,IAAI;AAAA,EAC7B;AAEE,MAAI,OAAO,KAAK;AAChB,OAAK,OAAO;AACZ,OAAK,OAAO;AACZ,MAAI,MAAM;AACR,SAAK,OAAO;AAAA,EAChB;AAEE,OAAK,OAAO;AACZ,MAAI,CAAC,KAAK,MAAM;AACd,SAAK,OAAO;AAAA,EAChB;AACE,OAAK;AACP;AAEA,QAAQ,UAAU,WAAW,SAAU,MAAM;AAC3C,MAAI,SAAS,KAAK,MAAM;AACtB;AAAA,EACJ;AAEE,MAAI,KAAK,MAAM;AACb,SAAK,KAAK,WAAW,IAAI;AAAA,EAC7B;AAEE,MAAI,OAAO,KAAK;AAChB,OAAK,OAAO;AACZ,OAAK,OAAO;AACZ,MAAI,MAAM;AACR,SAAK,OAAO;AAAA,EAChB;AAEE,OAAK,OAAO;AACZ,MAAI,CAAC,KAAK,MAAM;AACd,SAAK,OAAO;AAAA,EAChB;AACE,OAAK;AACP;AAEA,QAAQ,UAAU,OAAO,WAAY;AACnC,WAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,IAAI,GAAG,KAAK;AAChD,SAAK,MAAM,UAAU,CAAC,CAAC;AAAA,EAC3B;AACE,SAAO,KAAK;AACd;AAEA,QAAQ,UAAU,UAAU,WAAY;AACtC,WAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,IAAI,GAAG,KAAK;AAChD,YAAQ,MAAM,UAAU,CAAC,CAAC;AAAA,EAC9B;AACE,SAAO,KAAK;AACd;AAEA,QAAQ,UAAU,MAAM,WAAY;AAClC,MAAI,CAAC,KAAK,MAAM;AACd,WAAO;AAAA,EACX;AAEE,MAAI,MAAM,KAAK,KAAK;AACpB,OAAK,OAAO,KAAK,KAAK;AACtB,MAAI,KAAK,MAAM;AACb,SAAK,KAAK,OAAO;AAAA,EACrB,OAAS;AACL,SAAK,OAAO;AAAA,EAChB;AACE,OAAK;AACL,SAAO;AACT;AAEA,QAAQ,UAAU,QAAQ,WAAY;AACpC,MAAI,CAAC,KAAK,MAAM;AACd,WAAO;AAAA,EACX;AAEE,MAAI,MAAM,KAAK,KAAK;AACpB,OAAK,OAAO,KAAK,KAAK;AACtB,MAAI,KAAK,MAAM;AACb,SAAK,KAAK,OAAO;AAAA,EACrB,OAAS;AACL,SAAK,OAAO;AAAA,EAChB;AACE,OAAK;AACL,SAAO;AACT;AAEA,QAAQ,UAAU,UAAU,SAAU,IAAI,OAAO;AAC/C,UAAQ,SAAS;AACjB,WAAS,SAAS,KAAK,MAAM,IAAI,GAAG,WAAW,MAAM,KAAK;AACxD,OAAG,KAAK,OAAO,OAAO,OAAO,GAAG,IAAI;AACpC,aAAS,OAAO;AAAA,EACpB;AACA;AAEA,QAAQ,UAAU,iBAAiB,SAAU,IAAI,OAAO;AACtD,UAAQ,SAAS;AACjB,WAAS,SAAS,KAAK,MAAM,IAAI,KAAK,SAAS,GAAG,WAAW,MAAM,KAAK;AACtE,OAAG,KAAK,OAAO,OAAO,OAAO,GAAG,IAAI;AACpC,aAAS,OAAO;AAAA,EACpB;AACA;AAEA,QAAQ,UAAU,MAAM,SAAU,GAAG;AACnC,WAAS,IAAI,GAAG,SAAS,KAAK,MAAM,WAAW,QAAQ,IAAI,GAAG,KAAK;AAEjE,aAAS,OAAO;AAAA,EACpB;AACE,MAAI,MAAM,KAAK,WAAW,MAAM;AAC9B,WAAO,OAAO;AAAA,EAClB;AACA;AAEA,QAAQ,UAAU,aAAa,SAAU,GAAG;AAC1C,WAAS,IAAI,GAAG,SAAS,KAAK,MAAM,WAAW,QAAQ,IAAI,GAAG,KAAK;AAEjE,aAAS,OAAO;AAAA,EACpB;AACE,MAAI,MAAM,KAAK,WAAW,MAAM;AAC9B,WAAO,OAAO;AAAA,EAClB;AACA;AAEA,QAAQ,UAAU,MAAM,SAAU,IAAI,OAAO;AAC3C,UAAQ,SAAS;AACjB,MAAI,MAAM,IAAI,QAAO;AACrB,WAAS,SAAS,KAAK,MAAM,WAAW,QAAO;AAC7C,QAAI,KAAK,GAAG,KAAK,OAAO,OAAO,OAAO,IAAI,CAAC;AAC3C,aAAS,OAAO;AAAA,EACpB;AACE,SAAO;AACT;AAEA,QAAQ,UAAU,aAAa,SAAU,IAAI,OAAO;AAClD,UAAQ,SAAS;AACjB,MAAI,MAAM,IAAI,QAAO;AACrB,WAAS,SAAS,KAAK,MAAM,WAAW,QAAO;AAC7C,QAAI,KAAK,GAAG,KAAK,OAAO,OAAO,OAAO,IAAI,CAAC;AAC3C,aAAS,OAAO;AAAA,EACpB;AACE,SAAO;AACT;AAEA,QAAQ,UAAU,SAAS,SAAU,IAAI,SAAS;AAChD,MAAI;AACJ,MAAI,SAAS,KAAK;AAClB,MAAI,UAAU,SAAS,GAAG;AACxB,UAAM;AAAA,EACV,WAAa,KAAK,MAAM;AACpB,aAAS,KAAK,KAAK;AACnB,UAAM,KAAK,KAAK;AAAA,EACpB,OAAS;AACL,UAAM,IAAI,UAAU,4CAA4C;AAAA,EACpE;AAEE,WAAS,IAAI,GAAG,WAAW,MAAM,KAAK;AACpC,UAAM,GAAG,KAAK,OAAO,OAAO,CAAC;AAC7B,aAAS,OAAO;AAAA,EACpB;AAEE,SAAO;AACT;AAEA,QAAQ,UAAU,gBAAgB,SAAU,IAAI,SAAS;AACvD,MAAI;AACJ,MAAI,SAAS,KAAK;AAClB,MAAI,UAAU,SAAS,GAAG;AACxB,UAAM;AAAA,EACV,WAAa,KAAK,MAAM;AACpB,aAAS,KAAK,KAAK;AACnB,UAAM,KAAK,KAAK;AAAA,EACpB,OAAS;AACL,UAAM,IAAI,UAAU,4CAA4C;AAAA,EACpE;AAEE,WAAS,IAAI,KAAK,SAAS,GAAG,WAAW,MAAM,KAAK;AAClD,UAAM,GAAG,KAAK,OAAO,OAAO,CAAC;AAC7B,aAAS,OAAO;AAAA,EACpB;AAEE,SAAO;AACT;AAEA,QAAQ,UAAU,UAAU,WAAY;AACtC,MAAI,MAAM,IAAI,MAAM,KAAK,MAAM;AAC/B,WAAS,IAAI,GAAG,SAAS,KAAK,MAAM,WAAW,MAAM,KAAK;AACxD,QAAI,CAAC,IAAI,OAAO;AAChB,aAAS,OAAO;AAAA,EACpB;AACE,SAAO;AACT;AAEA,QAAQ,UAAU,iBAAiB,WAAY;AAC7C,MAAI,MAAM,IAAI,MAAM,KAAK,MAAM;AAC/B,WAAS,IAAI,GAAG,SAAS,KAAK,MAAM,WAAW,MAAM,KAAK;AACxD,QAAI,CAAC,IAAI,OAAO;AAChB,aAAS,OAAO;AAAA,EACpB;AACE,SAAO;AACT;AAEA,QAAQ,UAAU,QAAQ,SAAU,MAAM,IAAI;AAC5C,OAAK,MAAM,KAAK;AAChB,MAAI,KAAK,GAAG;AACV,UAAM,KAAK;AAAA,EACf;AACE,SAAO,QAAQ;AACf,MAAI,OAAO,GAAG;AACZ,YAAQ,KAAK;AAAA,EACjB;AACE,MAAI,MAAM,IAAI,QAAO;AACrB,MAAI,KAAK,QAAQ,KAAK,GAAG;AACvB,WAAO;AAAA,EACX;AACE,MAAI,OAAO,GAAG;AACZ,WAAO;AAAA,EACX;AACE,MAAI,KAAK,KAAK,QAAQ;AACpB,SAAK,KAAK;AAAA,EACd;AACE,WAAS,IAAI,GAAG,SAAS,KAAK,MAAM,WAAW,QAAQ,IAAI,MAAM,KAAK;AACpE,aAAS,OAAO;AAAA,EACpB;AACE,SAAO,WAAW,QAAQ,IAAI,IAAI,KAAK,SAAS,OAAO,MAAM;AAC3D,QAAI,KAAK,OAAO,KAAK;AAAA,EACzB;AACE,SAAO;AACT;AAEA,QAAQ,UAAU,eAAe,SAAU,MAAM,IAAI;AACnD,OAAK,MAAM,KAAK;AAChB,MAAI,KAAK,GAAG;AACV,UAAM,KAAK;AAAA,EACf;AACE,SAAO,QAAQ;AACf,MAAI,OAAO,GAAG;AACZ,YAAQ,KAAK;AAAA,EACjB;AACE,MAAI,MAAM,IAAI,QAAO;AACrB,MAAI,KAAK,QAAQ,KAAK,GAAG;AACvB,WAAO;AAAA,EACX;AACE,MAAI,OAAO,GAAG;AACZ,WAAO;AAAA,EACX;AACE,MAAI,KAAK,KAAK,QAAQ;AACpB,SAAK,KAAK;AAAA,EACd;AACE,WAAS,IAAI,KAAK,QAAQ,SAAS,KAAK,MAAM,WAAW,QAAQ,IAAI,IAAI,KAAK;AAC5E,aAAS,OAAO;AAAA,EACpB;AACE,SAAO,WAAW,QAAQ,IAAI,MAAM,KAAK,SAAS,OAAO,MAAM;AAC7D,QAAI,KAAK,OAAO,KAAK;AAAA,EACzB;AACE,SAAO;AACT;AAEA,QAAQ,UAAU,SAAS,SAAU,OAAO,gBAAgB,OAAO;AACjE,MAAI,QAAQ,KAAK,QAAQ;AACvB,YAAQ,KAAK,SAAS;AAAA,EAC1B;AACE,MAAI,QAAQ,GAAG;AACb,YAAQ,KAAK,SAAS;AAAA,EAC1B;AAEE,WAAS,IAAI,GAAG,SAAS,KAAK,MAAM,WAAW,QAAQ,IAAI,OAAO,KAAK;AACrE,aAAS,OAAO;AAAA,EACpB;AAEE,MAAI,MAAM,CAAA;AACV,WAAS,IAAI,GAAG,UAAU,IAAI,aAAa,KAAK;AAC9C,QAAI,KAAK,OAAO,KAAK;AACrB,aAAS,KAAK,WAAW,MAAM;AAAA,EACnC;AACE,MAAI,WAAW,MAAM;AACnB,aAAS,KAAK;AAAA,EAClB;AAEE,MAAI,WAAW,KAAK,QAAQ,WAAW,KAAK,MAAM;AAChD,aAAS,OAAO;AAAA,EACpB;AAEE,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,aAAS,OAAO,MAAM,QAAQ,MAAM,CAAC,CAAC;AAAA,EAC1C;AACE,SAAO;AACT;AAEA,QAAQ,UAAU,UAAU,WAAY;AACtC,MAAI,OAAO,KAAK;AAChB,MAAI,OAAO,KAAK;AAChB,WAAS,SAAS,MAAM,WAAW,MAAM,SAAS,OAAO,MAAM;AAC7D,QAAI,IAAI,OAAO;AACf,WAAO,OAAO,OAAO;AACrB,WAAO,OAAO;AAAA,EAClB;AACE,OAAK,OAAO;AACZ,OAAK,OAAO;AACZ,SAAO;AACT;AAEA,SAAS,OAAQ,MAAM,MAAM,OAAO;AAClC,MAAI,WAAW,SAAS,KAAK,OAC3B,IAAI,KAAK,OAAO,MAAM,MAAM,IAAI,IAChC,IAAI,KAAK,OAAO,MAAM,KAAK,MAAM,IAAI;AAEvC,MAAI,SAAS,SAAS,MAAM;AAC1B,SAAK,OAAO;AAAA,EAChB;AACE,MAAI,SAAS,SAAS,MAAM;AAC1B,SAAK,OAAO;AAAA,EAChB;AAEE,OAAK;AAEL,SAAO;AACT;AAEA,SAAS,KAAM,MAAM,MAAM;AACzB,OAAK,OAAO,IAAI,KAAK,MAAM,KAAK,MAAM,MAAM,IAAI;AAChD,MAAI,CAAC,KAAK,MAAM;AACd,SAAK,OAAO,KAAK;AAAA,EACrB;AACE,OAAK;AACP;AAEA,SAAS,QAAS,MAAM,MAAM;AAC5B,OAAK,OAAO,IAAI,KAAK,MAAM,MAAM,KAAK,MAAM,IAAI;AAChD,MAAI,CAAC,KAAK,MAAM;AACd,SAAK,OAAO,KAAK;AAAA,EACrB;AACE,OAAK;AACP;AAEA,SAAS,KAAM,OAAO,MAAM,MAAM,MAAM;AACtC,MAAI,EAAE,gBAAgB,OAAO;AAC3B,WAAO,IAAI,KAAK,OAAO,MAAM,MAAM,IAAI;AAAA,EAC3C;AAEE,OAAK,OAAO;AACZ,OAAK,QAAQ;AAEb,MAAI,MAAM;AACR,SAAK,OAAO;AACZ,SAAK,OAAO;AAAA,EAChB,OAAS;AACL,SAAK,OAAO;AAAA,EAChB;AAEE,MAAI,MAAM;AACR,SAAK,OAAO;AACZ,SAAK,OAAO;AAAA,EAChB,OAAS;AACL,SAAK,OAAO;AAAA,EAChB;AACA;AAEA,IAAI;AAEFA,WAAAA,UAAA,EAAyB,OAAO;AAClC,SAAS,IAAI;AAAA;;","x_google_ignoreList":[0]}

package/dist/_node_modules/yallist/yallist.js.map

@@ -1 +1 @@
-{"version":3,"file":"yallist.js","sources":["../../../../../node_modules/yallist/yallist.js"],"sourcesContent":["'use strict'\nmodule.exports = Yallist\n\nYallist.Node = Node\nYallist.create = Yallist\n\nfunction Yallist (list) {\n  var self = this\n  if (!(self instanceof Yallist)) {\n    self = new Yallist()\n  }\n\n  self.tail = null\n  self.head = null\n  self.length = 0\n\n  if (list && typeof list.forEach === 'function') {\n    list.forEach(function (item) {\n      self.push(item)\n    })\n  } else if (arguments.length > 0) {\n    for (var i = 0, l = arguments.length; i < l; i++) {\n      self.push(arguments[i])\n    }\n  }\n\n  return self\n}\n\nYallist.prototype.removeNode = function (node) {\n  if (node.list !== this) {\n    throw new Error('removing node which does not belong to this list')\n  }\n\n  var next = node.next\n  var prev = node.prev\n\n  if (next) {\n    next.prev = prev\n  }\n\n  if (prev) {\n    prev.next = next\n  }\n\n  if (node === this.head) {\n    this.head = next\n  }\n  if (node === this.tail) {\n    this.tail = prev\n  }\n\n  node.list.length--\n  node.next = null\n  node.prev = null\n  node.list = null\n\n  return next\n}\n\nYallist.prototype.unshiftNode = function (node) {\n  if (node === this.head) {\n    return\n  }\n\n  if (node.list) {\n    node.list.removeNode(node)\n  }\n\n  var head = this.head\n  node.list = this\n  node.next = head\n  if (head) {\n    head.prev = node\n  }\n\n  this.head = node\n  if (!this.tail) {\n    this.tail = node\n  }\n  this.length++\n}\n\nYallist.prototype.pushNode = function (node) {\n  if (node === this.tail) {\n    return\n  }\n\n  if (node.list) {\n    node.list.removeNode(node)\n  }\n\n  var tail = this.tail\n  node.list = this\n  node.prev = tail\n  if (tail) {\n    tail.next = node\n  }\n\n  this.tail = node\n  if (!this.head) {\n    this.head = node\n  }\n  this.length++\n}\n\nYallist.prototype.push = function () {\n  for (var i = 0, l = arguments.length; i < l; i++) {\n    push(this, arguments[i])\n  }\n  return this.length\n}\n\nYallist.prototype.unshift = function () {\n  for (var i = 0, l = arguments.length; i < l; i++) {\n    unshift(this, arguments[i])\n  }\n  return this.length\n}\n\nYallist.prototype.pop = function () {\n  if (!this.tail) {\n    return undefined\n  }\n\n  var res = this.tail.value\n  this.tail = this.tail.prev\n  if (this.tail) {\n    this.tail.next = null\n  } else {\n    this.head = null\n  }\n  this.length--\n  return res\n}\n\nYallist.prototype.shift = function () {\n  if (!this.head) {\n    return undefined\n  }\n\n  var res = this.head.value\n  this.head = this.head.next\n  if (this.head) {\n    this.head.prev = null\n  } else {\n    this.tail = null\n  }\n  this.length--\n  return res\n}\n\nYallist.prototype.forEach = function (fn, thisp) {\n  thisp = thisp || this\n  for (var walker = this.head, i = 0; walker !== null; i++) {\n    fn.call(thisp, walker.value, i, this)\n    walker = walker.next\n  }\n}\n\nYallist.prototype.forEachReverse = function (fn, thisp) {\n  thisp = thisp || this\n  for (var walker = this.tail, i = this.length - 1; walker !== null; i--) {\n    fn.call(thisp, walker.value, i, this)\n    walker = walker.prev\n  }\n}\n\nYallist.prototype.get = function (n) {\n  for (var i = 0, walker = this.head; walker !== null && i < n; i++) {\n    // abort out of the list early if we hit a cycle\n    walker = walker.next\n  }\n  if (i === n && walker !== null) {\n    return walker.value\n  }\n}\n\nYallist.prototype.getReverse = function (n) {\n  for (var i = 0, walker = this.tail; walker !== null && i < n; i++) {\n    // abort out of the list early if we hit a cycle\n    walker = walker.prev\n  }\n  if (i === n && walker !== null) {\n    return walker.value\n  }\n}\n\nYallist.prototype.map = function (fn, thisp) {\n  thisp = thisp || this\n  var res = new Yallist()\n  for (var walker = this.head; walker !== null;) {\n    res.push(fn.call(thisp, walker.value, this))\n    walker = walker.next\n  }\n  return res\n}\n\nYallist.prototype.mapReverse = function (fn, thisp) {\n  thisp = thisp || this\n  var res = new Yallist()\n  for (var walker = this.tail; walker !== null;) {\n    res.push(fn.call(thisp, walker.value, this))\n    walker = walker.prev\n  }\n  return res\n}\n\nYallist.prototype.reduce = function (fn, initial) {\n  var acc\n  var walker = this.head\n  if (arguments.length > 1) {\n    acc = initial\n  } else if (this.head) {\n    walker = this.head.next\n    acc = this.head.value\n  } else {\n    throw new TypeError('Reduce of empty list with no initial value')\n  }\n\n  for (var i = 0; walker !== null; i++) {\n    acc = fn(acc, walker.value, i)\n    walker = walker.next\n  }\n\n  return acc\n}\n\nYallist.prototype.reduceReverse = function (fn, initial) {\n  var acc\n  var walker = this.tail\n  if (arguments.length > 1) {\n    acc = initial\n  } else if (this.tail) {\n    walker = this.tail.prev\n    acc = this.tail.value\n  } else {\n    throw new TypeError('Reduce of empty list with no initial value')\n  }\n\n  for (var i = this.length - 1; walker !== null; i--) {\n    acc = fn(acc, walker.value, i)\n    walker = walker.prev\n  }\n\n  return acc\n}\n\nYallist.prototype.toArray = function () {\n  var arr = new Array(this.length)\n  for (var i = 0, walker = this.head; walker !== null; i++) {\n    arr[i] = walker.value\n    walker = walker.next\n  }\n  return arr\n}\n\nYallist.prototype.toArrayReverse = function () {\n  var arr = new Array(this.length)\n  for (var i = 0, walker = this.tail; walker !== null; i++) {\n    arr[i] = walker.value\n    walker = walker.prev\n  }\n  return arr\n}\n\nYallist.prototype.slice = function (from, to) {\n  to = to || this.length\n  if (to < 0) {\n    to += this.length\n  }\n  from = from || 0\n  if (from < 0) {\n    from += this.length\n  }\n  var ret = new Yallist()\n  if (to < from || to < 0) {\n    return ret\n  }\n  if (from < 0) {\n    from = 0\n  }\n  if (to > this.length) {\n    to = this.length\n  }\n  for (var i = 0, walker = this.head; walker !== null && i < from; i++) {\n    walker = walker.next\n  }\n  for (; walker !== null && i < to; i++, walker = walker.next) {\n    ret.push(walker.value)\n  }\n  return ret\n}\n\nYallist.prototype.sliceReverse = function (from, to) {\n  to = to || this.length\n  if (to < 0) {\n    to += this.length\n  }\n  from = from || 0\n  if (from < 0) {\n    from += this.length\n  }\n  var ret = new Yallist()\n  if (to < from || to < 0) {\n    return ret\n  }\n  if (from < 0) {\n    from = 0\n  }\n  if (to > this.length) {\n    to = this.length\n  }\n  for (var i = this.length, walker = this.tail; walker !== null && i > to; i--) {\n    walker = walker.prev\n  }\n  for (; walker !== null && i > from; i--, walker = walker.prev) {\n    ret.push(walker.value)\n  }\n  return ret\n}\n\nYallist.prototype.splice = function (start, deleteCount, ...nodes) {\n  if (start > this.length) {\n    start = this.length - 1\n  }\n  if (start < 0) {\n    start = this.length + start;\n  }\n\n  for (var i = 0, walker = this.head; walker !== null && i < start; i++) {\n    walker = walker.next\n  }\n\n  var ret = []\n  for (var i = 0; walker && i < deleteCount; i++) {\n    ret.push(walker.value)\n    walker = this.removeNode(walker)\n  }\n  if (walker === null) {\n    walker = this.tail\n  }\n\n  if (walker !== this.head && walker !== this.tail) {\n    walker = walker.prev\n  }\n\n  for (var i = 0; i < nodes.length; i++) {\n    walker = insert(this, walker, nodes[i])\n  }\n  return ret;\n}\n\nYallist.prototype.reverse = function () {\n  var head = this.head\n  var tail = this.tail\n  for (var walker = head; walker !== null; walker = walker.prev) {\n    var p = walker.prev\n    walker.prev = walker.next\n    walker.next = p\n  }\n  this.head = tail\n  this.tail = head\n  return this\n}\n\nfunction insert (self, node, value) {\n  var inserted = node === self.head ?\n    new Node(value, null, node, self) :\n    new Node(value, node, node.next, self)\n\n  if (inserted.next === null) {\n    self.tail = inserted\n  }\n  if (inserted.prev === null) {\n    self.head = inserted\n  }\n\n  self.length++\n\n  return inserted\n}\n\nfunction push (self, item) {\n  self.tail = new Node(item, self.tail, null, self)\n  if (!self.head) {\n    self.head = self.tail\n  }\n  self.length++\n}\n\nfunction unshift (self, item) {\n  self.head = new Node(item, null, self.head, self)\n  if (!self.tail) {\n    self.tail = self.head\n  }\n  self.length++\n}\n\nfunction Node (value, prev, next, list) {\n  if (!(this instanceof Node)) {\n    return new Node(value, prev, next, list)\n  }\n\n  this.list = list\n  this.value = value\n\n  if (prev) {\n    prev.next = this\n    this.prev = prev\n  } else {\n    this.prev = null\n  }\n\n  if (next) {\n    next.prev = this\n    this.next = next\n  } else {\n    this.next = null\n  }\n}\n\ntry {\n  // add if support for Symbol.iterator is present\n  require('./iterator.js')(Yallist)\n} catch (er) {}\n"],"names":["require$$0"],"mappings":";AACA,IAAA,UAAiB;AAEjB,QAAQ,OAAO;AACf,QAAQ,SAAS;AAEjB,SAAS,QAAS,MAAM;AACtB,MAAI,OAAO;AACX,MAAI,EAAE,gBAAgB,UAAU;AAC9B,WAAO,IAAI,QAAS;AAAA,EACrB;AAED,OAAK,OAAO;AACZ,OAAK,OAAO;AACZ,OAAK,SAAS;AAEd,MAAI,QAAQ,OAAO,KAAK,YAAY,YAAY;AAC9C,SAAK,QAAQ,SAAU,MAAM;AAC3B,WAAK,KAAK,IAAI;AAAA,IACpB,CAAK;AAAA,EACL,WAAa,UAAU,SAAS,GAAG;AAC/B,aAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,IAAI,GAAG,KAAK;AAChD,WAAK,KAAK,UAAU,CAAC,CAAC;AAAA,IACvB;AAAA,EACF;AAED,SAAO;AACT;AAEA,QAAQ,UAAU,aAAa,SAAU,MAAM;AAC7C,MAAI,KAAK,SAAS,MAAM;AACtB,UAAM,IAAI,MAAM,kDAAkD;AAAA,EACnE;AAED,MAAI,OAAO,KAAK;AAChB,MAAI,OAAO,KAAK;AAEhB,MAAI,MAAM;AACR,SAAK,OAAO;AAAA,EACb;AAED,MAAI,MAAM;AACR,SAAK,OAAO;AAAA,EACb;AAED,MAAI,SAAS,KAAK,MAAM;AACtB,SAAK,OAAO;AAAA,EACb;AACD,MAAI,SAAS,KAAK,MAAM;AACtB,SAAK,OAAO;AAAA,EACb;AAED,OAAK,KAAK;AACV,OAAK,OAAO;AACZ,OAAK,OAAO;AACZ,OAAK,OAAO;AAEZ,SAAO;AACT;AAEA,QAAQ,UAAU,cAAc,SAAU,MAAM;AAC9C,MAAI,SAAS,KAAK,MAAM;AACtB;AAAA,EACD;AAED,MAAI,KAAK,MAAM;AACb,SAAK,KAAK,WAAW,IAAI;AAAA,EAC1B;AAED,MAAI,OAAO,KAAK;AAChB,OAAK,OAAO;AACZ,OAAK,OAAO;AACZ,MAAI,MAAM;AACR,SAAK,OAAO;AAAA,EACb;AAED,OAAK,OAAO;AACZ,MAAI,CAAC,KAAK,MAAM;AACd,SAAK,OAAO;AAAA,EACb;AACD,OAAK;AACP;AAEA,QAAQ,UAAU,WAAW,SAAU,MAAM;AAC3C,MAAI,SAAS,KAAK,MAAM;AACtB;AAAA,EACD;AAED,MAAI,KAAK,MAAM;AACb,SAAK,KAAK,WAAW,IAAI;AAAA,EAC1B;AAED,MAAI,OAAO,KAAK;AAChB,OAAK,OAAO;AACZ,OAAK,OAAO;AACZ,MAAI,MAAM;AACR,SAAK,OAAO;AAAA,EACb;AAED,OAAK,OAAO;AACZ,MAAI,CAAC,KAAK,MAAM;AACd,SAAK,OAAO;AAAA,EACb;AACD,OAAK;AACP;AAEA,QAAQ,UAAU,OAAO,WAAY;AACnC,WAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,IAAI,GAAG,KAAK;AAChD,SAAK,MAAM,UAAU,CAAC,CAAC;AAAA,EACxB;AACD,SAAO,KAAK;AACd;AAEA,QAAQ,UAAU,UAAU,WAAY;AACtC,WAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,IAAI,GAAG,KAAK;AAChD,YAAQ,MAAM,UAAU,CAAC,CAAC;AAAA,EAC3B;AACD,SAAO,KAAK;AACd;AAEA,QAAQ,UAAU,MAAM,WAAY;AAClC,MAAI,CAAC,KAAK,MAAM;AACd,WAAO;AAAA,EACR;AAED,MAAI,MAAM,KAAK,KAAK;AACpB,OAAK,OAAO,KAAK,KAAK;AACtB,MAAI,KAAK,MAAM;AACb,SAAK,KAAK,OAAO;AAAA,EACrB,OAAS;AACL,SAAK,OAAO;AAAA,EACb;AACD,OAAK;AACL,SAAO;AACT;AAEA,QAAQ,UAAU,QAAQ,WAAY;AACpC,MAAI,CAAC,KAAK,MAAM;AACd,WAAO;AAAA,EACR;AAED,MAAI,MAAM,KAAK,KAAK;AACpB,OAAK,OAAO,KAAK,KAAK;AACtB,MAAI,KAAK,MAAM;AACb,SAAK,KAAK,OAAO;AAAA,EACrB,OAAS;AACL,SAAK,OAAO;AAAA,EACb;AACD,OAAK;AACL,SAAO;AACT;AAEA,QAAQ,UAAU,UAAU,SAAU,IAAI,OAAO;AAC/C,UAAQ,SAAS;AACjB,WAAS,SAAS,KAAK,MAAM,IAAI,GAAG,WAAW,MAAM,KAAK;AACxD,OAAG,KAAK,OAAO,OAAO,OAAO,GAAG,IAAI;AACpC,aAAS,OAAO;AAAA,EACjB;AACH;AAEA,QAAQ,UAAU,iBAAiB,SAAU,IAAI,OAAO;AACtD,UAAQ,SAAS;AACjB,WAAS,SAAS,KAAK,MAAM,IAAI,KAAK,SAAS,GAAG,WAAW,MAAM,KAAK;AACtE,OAAG,KAAK,OAAO,OAAO,OAAO,GAAG,IAAI;AACpC,aAAS,OAAO;AAAA,EACjB;AACH;AAEA,QAAQ,UAAU,MAAM,SAAU,GAAG;AACnC,WAAS,IAAI,GAAG,SAAS,KAAK,MAAM,WAAW,QAAQ,IAAI,GAAG,KAAK;AAEjE,aAAS,OAAO;AAAA,EACjB;AACD,MAAI,MAAM,KAAK,WAAW,MAAM;AAC9B,WAAO,OAAO;AAAA,EACf;AACH;AAEA,QAAQ,UAAU,aAAa,SAAU,GAAG;AAC1C,WAAS,IAAI,GAAG,SAAS,KAAK,MAAM,WAAW,QAAQ,IAAI,GAAG,KAAK;AAEjE,aAAS,OAAO;AAAA,EACjB;AACD,MAAI,MAAM,KAAK,WAAW,MAAM;AAC9B,WAAO,OAAO;AAAA,EACf;AACH;AAEA,QAAQ,UAAU,MAAM,SAAU,IAAI,OAAO;AAC3C,UAAQ,SAAS;AACjB,MAAI,MAAM,IAAI,QAAS;AACvB,WAAS,SAAS,KAAK,MAAM,WAAW,QAAO;AAC7C,QAAI,KAAK,GAAG,KAAK,OAAO,OAAO,OAAO,IAAI,CAAC;AAC3C,aAAS,OAAO;AAAA,EACjB;AACD,SAAO;AACT;AAEA,QAAQ,UAAU,aAAa,SAAU,IAAI,OAAO;AAClD,UAAQ,SAAS;AACjB,MAAI,MAAM,IAAI,QAAS;AACvB,WAAS,SAAS,KAAK,MAAM,WAAW,QAAO;AAC7C,QAAI,KAAK,GAAG,KAAK,OAAO,OAAO,OAAO,IAAI,CAAC;AAC3C,aAAS,OAAO;AAAA,EACjB;AACD,SAAO;AACT;AAEA,QAAQ,UAAU,SAAS,SAAU,IAAI,SAAS;AAChD,MAAI;AACJ,MAAI,SAAS,KAAK;AAClB,MAAI,UAAU,SAAS,GAAG;AACxB,UAAM;AAAA,EACV,WAAa,KAAK,MAAM;AACpB,aAAS,KAAK,KAAK;AACnB,UAAM,KAAK,KAAK;AAAA,EACpB,OAAS;AACL,UAAM,IAAI,UAAU,4CAA4C;AAAA,EACjE;AAED,WAAS,IAAI,GAAG,WAAW,MAAM,KAAK;AACpC,UAAM,GAAG,KAAK,OAAO,OAAO,CAAC;AAC7B,aAAS,OAAO;AAAA,EACjB;AAED,SAAO;AACT;AAEA,QAAQ,UAAU,gBAAgB,SAAU,IAAI,SAAS;AACvD,MAAI;AACJ,MAAI,SAAS,KAAK;AAClB,MAAI,UAAU,SAAS,GAAG;AACxB,UAAM;AAAA,EACV,WAAa,KAAK,MAAM;AACpB,aAAS,KAAK,KAAK;AACnB,UAAM,KAAK,KAAK;AAAA,EACpB,OAAS;AACL,UAAM,IAAI,UAAU,4CAA4C;AAAA,EACjE;AAED,WAAS,IAAI,KAAK,SAAS,GAAG,WAAW,MAAM,KAAK;AAClD,UAAM,GAAG,KAAK,OAAO,OAAO,CAAC;AAC7B,aAAS,OAAO;AAAA,EACjB;AAED,SAAO;AACT;AAEA,QAAQ,UAAU,UAAU,WAAY;AACtC,MAAI,MAAM,IAAI,MAAM,KAAK,MAAM;AAC/B,WAAS,IAAI,GAAG,SAAS,KAAK,MAAM,WAAW,MAAM,KAAK;AACxD,QAAI,CAAC,IAAI,OAAO;AAChB,aAAS,OAAO;AAAA,EACjB;AACD,SAAO;AACT;AAEA,QAAQ,UAAU,iBAAiB,WAAY;AAC7C,MAAI,MAAM,IAAI,MAAM,KAAK,MAAM;AAC/B,WAAS,IAAI,GAAG,SAAS,KAAK,MAAM,WAAW,MAAM,KAAK;AACxD,QAAI,CAAC,IAAI,OAAO;AAChB,aAAS,OAAO;AAAA,EACjB;AACD,SAAO;AACT;AAEA,QAAQ,UAAU,QAAQ,SAAU,MAAM,IAAI;AAC5C,OAAK,MAAM,KAAK;AAChB,MAAI,KAAK,GAAG;AACV,UAAM,KAAK;AAAA,EACZ;AACD,SAAO,QAAQ;AACf,MAAI,OAAO,GAAG;AACZ,YAAQ,KAAK;AAAA,EACd;AACD,MAAI,MAAM,IAAI,QAAS;AACvB,MAAI,KAAK,QAAQ,KAAK,GAAG;AACvB,WAAO;AAAA,EACR;AACD,MAAI,OAAO,GAAG;AACZ,WAAO;AAAA,EACR;AACD,MAAI,KAAK,KAAK,QAAQ;AACpB,SAAK,KAAK;AAAA,EACX;AACD,WAAS,IAAI,GAAG,SAAS,KAAK,MAAM,WAAW,QAAQ,IAAI,MAAM,KAAK;AACpE,aAAS,OAAO;AAAA,EACjB;AACD,SAAO,WAAW,QAAQ,IAAI,IAAI,KAAK,SAAS,OAAO,MAAM;AAC3D,QAAI,KAAK,OAAO,KAAK;AAAA,EACtB;AACD,SAAO;AACT;AAEA,QAAQ,UAAU,eAAe,SAAU,MAAM,IAAI;AACnD,OAAK,MAAM,KAAK;AAChB,MAAI,KAAK,GAAG;AACV,UAAM,KAAK;AAAA,EACZ;AACD,SAAO,QAAQ;AACf,MAAI,OAAO,GAAG;AACZ,YAAQ,KAAK;AAAA,EACd;AACD,MAAI,MAAM,IAAI,QAAS;AACvB,MAAI,KAAK,QAAQ,KAAK,GAAG;AACvB,WAAO;AAAA,EACR;AACD,MAAI,OAAO,GAAG;AACZ,WAAO;AAAA,EACR;AACD,MAAI,KAAK,KAAK,QAAQ;AACpB,SAAK,KAAK;AAAA,EACX;AACD,WAAS,IAAI,KAAK,QAAQ,SAAS,KAAK,MAAM,WAAW,QAAQ,IAAI,IAAI,KAAK;AAC5E,aAAS,OAAO;AAAA,EACjB;AACD,SAAO,WAAW,QAAQ,IAAI,MAAM,KAAK,SAAS,OAAO,MAAM;AAC7D,QAAI,KAAK,OAAO,KAAK;AAAA,EACtB;AACD,SAAO;AACT;AAEA,QAAQ,UAAU,SAAS,SAAU,OAAO,gBAAgB,OAAO;AACjE,MAAI,QAAQ,KAAK,QAAQ;AACvB,YAAQ,KAAK,SAAS;AAAA,EACvB;AACD,MAAI,QAAQ,GAAG;AACb,YAAQ,KAAK,SAAS;AAAA,EACvB;AAED,WAAS,IAAI,GAAG,SAAS,KAAK,MAAM,WAAW,QAAQ,IAAI,OAAO,KAAK;AACrE,aAAS,OAAO;AAAA,EACjB;AAED,MAAI,MAAM,CAAE;AACZ,WAAS,IAAI,GAAG,UAAU,IAAI,aAAa,KAAK;AAC9C,QAAI,KAAK,OAAO,KAAK;AACrB,aAAS,KAAK,WAAW,MAAM;AAAA,EAChC;AACD,MAAI,WAAW,MAAM;AACnB,aAAS,KAAK;AAAA,EACf;AAED,MAAI,WAAW,KAAK,QAAQ,WAAW,KAAK,MAAM;AAChD,aAAS,OAAO;AAAA,EACjB;AAED,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,aAAS,OAAO,MAAM,QAAQ,MAAM,CAAC,CAAC;AAAA,EACvC;AACD,SAAO;AACT;AAEA,QAAQ,UAAU,UAAU,WAAY;AACtC,MAAI,OAAO,KAAK;AAChB,MAAI,OAAO,KAAK;AAChB,WAAS,SAAS,MAAM,WAAW,MAAM,SAAS,OAAO,MAAM;AAC7D,QAAI,IAAI,OAAO;AACf,WAAO,OAAO,OAAO;AACrB,WAAO,OAAO;AAAA,EACf;AACD,OAAK,OAAO;AACZ,OAAK,OAAO;AACZ,SAAO;AACT;AAEA,SAAS,OAAQ,MAAM,MAAM,OAAO;AAClC,MAAI,WAAW,SAAS,KAAK,OAC3B,IAAI,KAAK,OAAO,MAAM,MAAM,IAAI,IAChC,IAAI,KAAK,OAAO,MAAM,KAAK,MAAM,IAAI;AAEvC,MAAI,SAAS,SAAS,MAAM;AAC1B,SAAK,OAAO;AAAA,EACb;AACD,MAAI,SAAS,SAAS,MAAM;AAC1B,SAAK,OAAO;AAAA,EACb;AAED,OAAK;AAEL,SAAO;AACT;AAEA,SAAS,KAAM,MAAM,MAAM;AACzB,OAAK,OAAO,IAAI,KAAK,MAAM,KAAK,MAAM,MAAM,IAAI;AAChD,MAAI,CAAC,KAAK,MAAM;AACd,SAAK,OAAO,KAAK;AAAA,EAClB;AACD,OAAK;AACP;AAEA,SAAS,QAAS,MAAM,MAAM;AAC5B,OAAK,OAAO,IAAI,KAAK,MAAM,MAAM,KAAK,MAAM,IAAI;AAChD,MAAI,CAAC,KAAK,MAAM;AACd,SAAK,OAAO,KAAK;AAAA,EAClB;AACD,OAAK;AACP;AAEA,SAAS,KAAM,OAAO,MAAM,MAAM,MAAM;AACtC,MAAI,EAAE,gBAAgB,OAAO;AAC3B,WAAO,IAAI,KAAK,OAAO,MAAM,MAAM,IAAI;AAAA,EACxC;AAED,OAAK,OAAO;AACZ,OAAK,QAAQ;AAEb,MAAI,MAAM;AACR,SAAK,OAAO;AACZ,SAAK,OAAO;AAAA,EAChB,OAAS;AACL,SAAK,OAAO;AAAA,EACb;AAED,MAAI,MAAM;AACR,SAAK,OAAO;AACZ,SAAK,OAAO;AAAA,EAChB,OAAS;AACL,SAAK,OAAO;AAAA,EACb;AACH;AAEA,IAAI;AAEFA,kBAAA,EAAyB,OAAO;AAClC,SAAS,IAAI;AAAA;","x_google_ignoreList":[0]}
+{"version":3,"file":"yallist.js","sources":["../../../../../node_modules/yallist/yallist.js"],"sourcesContent":["'use strict'\nmodule.exports = Yallist\n\nYallist.Node = Node\nYallist.create = Yallist\n\nfunction Yallist (list) {\n  var self = this\n  if (!(self instanceof Yallist)) {\n    self = new Yallist()\n  }\n\n  self.tail = null\n  self.head = null\n  self.length = 0\n\n  if (list && typeof list.forEach === 'function') {\n    list.forEach(function (item) {\n      self.push(item)\n    })\n  } else if (arguments.length > 0) {\n    for (var i = 0, l = arguments.length; i < l; i++) {\n      self.push(arguments[i])\n    }\n  }\n\n  return self\n}\n\nYallist.prototype.removeNode = function (node) {\n  if (node.list !== this) {\n    throw new Error('removing node which does not belong to this list')\n  }\n\n  var next = node.next\n  var prev = node.prev\n\n  if (next) {\n    next.prev = prev\n  }\n\n  if (prev) {\n    prev.next = next\n  }\n\n  if (node === this.head) {\n    this.head = next\n  }\n  if (node === this.tail) {\n    this.tail = prev\n  }\n\n  node.list.length--\n  node.next = null\n  node.prev = null\n  node.list = null\n\n  return next\n}\n\nYallist.prototype.unshiftNode = function (node) {\n  if (node === this.head) {\n    return\n  }\n\n  if (node.list) {\n    node.list.removeNode(node)\n  }\n\n  var head = this.head\n  node.list = this\n  node.next = head\n  if (head) {\n    head.prev = node\n  }\n\n  this.head = node\n  if (!this.tail) {\n    this.tail = node\n  }\n  this.length++\n}\n\nYallist.prototype.pushNode = function (node) {\n  if (node === this.tail) {\n    return\n  }\n\n  if (node.list) {\n    node.list.removeNode(node)\n  }\n\n  var tail = this.tail\n  node.list = this\n  node.prev = tail\n  if (tail) {\n    tail.next = node\n  }\n\n  this.tail = node\n  if (!this.head) {\n    this.head = node\n  }\n  this.length++\n}\n\nYallist.prototype.push = function () {\n  for (var i = 0, l = arguments.length; i < l; i++) {\n    push(this, arguments[i])\n  }\n  return this.length\n}\n\nYallist.prototype.unshift = function () {\n  for (var i = 0, l = arguments.length; i < l; i++) {\n    unshift(this, arguments[i])\n  }\n  return this.length\n}\n\nYallist.prototype.pop = function () {\n  if (!this.tail) {\n    return undefined\n  }\n\n  var res = this.tail.value\n  this.tail = this.tail.prev\n  if (this.tail) {\n    this.tail.next = null\n  } else {\n    this.head = null\n  }\n  this.length--\n  return res\n}\n\nYallist.prototype.shift = function () {\n  if (!this.head) {\n    return undefined\n  }\n\n  var res = this.head.value\n  this.head = this.head.next\n  if (this.head) {\n    this.head.prev = null\n  } else {\n    this.tail = null\n  }\n  this.length--\n  return res\n}\n\nYallist.prototype.forEach = function (fn, thisp) {\n  thisp = thisp || this\n  for (var walker = this.head, i = 0; walker !== null; i++) {\n    fn.call(thisp, walker.value, i, this)\n    walker = walker.next\n  }\n}\n\nYallist.prototype.forEachReverse = function (fn, thisp) {\n  thisp = thisp || this\n  for (var walker = this.tail, i = this.length - 1; walker !== null; i--) {\n    fn.call(thisp, walker.value, i, this)\n    walker = walker.prev\n  }\n}\n\nYallist.prototype.get = function (n) {\n  for (var i = 0, walker = this.head; walker !== null && i < n; i++) {\n    // abort out of the list early if we hit a cycle\n    walker = walker.next\n  }\n  if (i === n && walker !== null) {\n    return walker.value\n  }\n}\n\nYallist.prototype.getReverse = function (n) {\n  for (var i = 0, walker = this.tail; walker !== null && i < n; i++) {\n    // abort out of the list early if we hit a cycle\n    walker = walker.prev\n  }\n  if (i === n && walker !== null) {\n    return walker.value\n  }\n}\n\nYallist.prototype.map = function (fn, thisp) {\n  thisp = thisp || this\n  var res = new Yallist()\n  for (var walker = this.head; walker !== null;) {\n    res.push(fn.call(thisp, walker.value, this))\n    walker = walker.next\n  }\n  return res\n}\n\nYallist.prototype.mapReverse = function (fn, thisp) {\n  thisp = thisp || this\n  var res = new Yallist()\n  for (var walker = this.tail; walker !== null;) {\n    res.push(fn.call(thisp, walker.value, this))\n    walker = walker.prev\n  }\n  return res\n}\n\nYallist.prototype.reduce = function (fn, initial) {\n  var acc\n  var walker = this.head\n  if (arguments.length > 1) {\n    acc = initial\n  } else if (this.head) {\n    walker = this.head.next\n    acc = this.head.value\n  } else {\n    throw new TypeError('Reduce of empty list with no initial value')\n  }\n\n  for (var i = 0; walker !== null; i++) {\n    acc = fn(acc, walker.value, i)\n    walker = walker.next\n  }\n\n  return acc\n}\n\nYallist.prototype.reduceReverse = function (fn, initial) {\n  var acc\n  var walker = this.tail\n  if (arguments.length > 1) {\n    acc = initial\n  } else if (this.tail) {\n    walker = this.tail.prev\n    acc = this.tail.value\n  } else {\n    throw new TypeError('Reduce of empty list with no initial value')\n  }\n\n  for (var i = this.length - 1; walker !== null; i--) {\n    acc = fn(acc, walker.value, i)\n    walker = walker.prev\n  }\n\n  return acc\n}\n\nYallist.prototype.toArray = function () {\n  var arr = new Array(this.length)\n  for (var i = 0, walker = this.head; walker !== null; i++) {\n    arr[i] = walker.value\n    walker = walker.next\n  }\n  return arr\n}\n\nYallist.prototype.toArrayReverse = function () {\n  var arr = new Array(this.length)\n  for (var i = 0, walker = this.tail; walker !== null; i++) {\n    arr[i] = walker.value\n    walker = walker.prev\n  }\n  return arr\n}\n\nYallist.prototype.slice = function (from, to) {\n  to = to || this.length\n  if (to < 0) {\n    to += this.length\n  }\n  from = from || 0\n  if (from < 0) {\n    from += this.length\n  }\n  var ret = new Yallist()\n  if (to < from || to < 0) {\n    return ret\n  }\n  if (from < 0) {\n    from = 0\n  }\n  if (to > this.length) {\n    to = this.length\n  }\n  for (var i = 0, walker = this.head; walker !== null && i < from; i++) {\n    walker = walker.next\n  }\n  for (; walker !== null && i < to; i++, walker = walker.next) {\n    ret.push(walker.value)\n  }\n  return ret\n}\n\nYallist.prototype.sliceReverse = function (from, to) {\n  to = to || this.length\n  if (to < 0) {\n    to += this.length\n  }\n  from = from || 0\n  if (from < 0) {\n    from += this.length\n  }\n  var ret = new Yallist()\n  if (to < from || to < 0) {\n    return ret\n  }\n  if (from < 0) {\n    from = 0\n  }\n  if (to > this.length) {\n    to = this.length\n  }\n  for (var i = this.length, walker = this.tail; walker !== null && i > to; i--) {\n    walker = walker.prev\n  }\n  for (; walker !== null && i > from; i--, walker = walker.prev) {\n    ret.push(walker.value)\n  }\n  return ret\n}\n\nYallist.prototype.splice = function (start, deleteCount, ...nodes) {\n  if (start > this.length) {\n    start = this.length - 1\n  }\n  if (start < 0) {\n    start = this.length + start;\n  }\n\n  for (var i = 0, walker = this.head; walker !== null && i < start; i++) {\n    walker = walker.next\n  }\n\n  var ret = []\n  for (var i = 0; walker && i < deleteCount; i++) {\n    ret.push(walker.value)\n    walker = this.removeNode(walker)\n  }\n  if (walker === null) {\n    walker = this.tail\n  }\n\n  if (walker !== this.head && walker !== this.tail) {\n    walker = walker.prev\n  }\n\n  for (var i = 0; i < nodes.length; i++) {\n    walker = insert(this, walker, nodes[i])\n  }\n  return ret;\n}\n\nYallist.prototype.reverse = function () {\n  var head = this.head\n  var tail = this.tail\n  for (var walker = head; walker !== null; walker = walker.prev) {\n    var p = walker.prev\n    walker.prev = walker.next\n    walker.next = p\n  }\n  this.head = tail\n  this.tail = head\n  return this\n}\n\nfunction insert (self, node, value) {\n  var inserted = node === self.head ?\n    new Node(value, null, node, self) :\n    new Node(value, node, node.next, self)\n\n  if (inserted.next === null) {\n    self.tail = inserted\n  }\n  if (inserted.prev === null) {\n    self.head = inserted\n  }\n\n  self.length++\n\n  return inserted\n}\n\nfunction push (self, item) {\n  self.tail = new Node(item, self.tail, null, self)\n  if (!self.head) {\n    self.head = self.tail\n  }\n  self.length++\n}\n\nfunction unshift (self, item) {\n  self.head = new Node(item, null, self.head, self)\n  if (!self.tail) {\n    self.tail = self.head\n  }\n  self.length++\n}\n\nfunction Node (value, prev, next, list) {\n  if (!(this instanceof Node)) {\n    return new Node(value, prev, next, list)\n  }\n\n  this.list = list\n  this.value = value\n\n  if (prev) {\n    prev.next = this\n    this.prev = prev\n  } else {\n    this.prev = null\n  }\n\n  if (next) {\n    next.prev = this\n    this.next = next\n  } else {\n    this.next = null\n  }\n}\n\ntry {\n  // add if support for Symbol.iterator is present\n  require('./iterator.js')(Yallist)\n} catch (er) {}\n"],"names":["require$$0"],"mappings":";AACA,IAAA,UAAiB;AAEjB,QAAQ,OAAO;AACf,QAAQ,SAAS;AAEjB,SAAS,QAAS,MAAM;AACtB,MAAI,OAAO;AACX,MAAI,EAAE,gBAAgB,UAAU;AAC9B,WAAO,IAAI,QAAO;AAAA,EACtB;AAEE,OAAK,OAAO;AACZ,OAAK,OAAO;AACZ,OAAK,SAAS;AAEd,MAAI,QAAQ,OAAO,KAAK,YAAY,YAAY;AAC9C,SAAK,QAAQ,SAAU,MAAM;AAC3B,WAAK,KAAK,IAAI;AAAA,IACpB,CAAK;AAAA,EACL,WAAa,UAAU,SAAS,GAAG;AAC/B,aAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,IAAI,GAAG,KAAK;AAChD,WAAK,KAAK,UAAU,CAAC,CAAC;AAAA,IAC5B;AAAA,EACA;AAEE,SAAO;AACT;AAEA,QAAQ,UAAU,aAAa,SAAU,MAAM;AAC7C,MAAI,KAAK,SAAS,MAAM;AACtB,UAAM,IAAI,MAAM,kDAAkD;AAAA,EACtE;AAEE,MAAI,OAAO,KAAK;AAChB,MAAI,OAAO,KAAK;AAEhB,MAAI,MAAM;AACR,SAAK,OAAO;AAAA,EAChB;AAEE,MAAI,MAAM;AACR,SAAK,OAAO;AAAA,EAChB;AAEE,MAAI,SAAS,KAAK,MAAM;AACtB,SAAK,OAAO;AAAA,EAChB;AACE,MAAI,SAAS,KAAK,MAAM;AACtB,SAAK,OAAO;AAAA,EAChB;AAEE,OAAK,KAAK;AACV,OAAK,OAAO;AACZ,OAAK,OAAO;AACZ,OAAK,OAAO;AAEZ,SAAO;AACT;AAEA,QAAQ,UAAU,cAAc,SAAU,MAAM;AAC9C,MAAI,SAAS,KAAK,MAAM;AACtB;AAAA,EACJ;AAEE,MAAI,KAAK,MAAM;AACb,SAAK,KAAK,WAAW,IAAI;AAAA,EAC7B;AAEE,MAAI,OAAO,KAAK;AAChB,OAAK,OAAO;AACZ,OAAK,OAAO;AACZ,MAAI,MAAM;AACR,SAAK,OAAO;AAAA,EAChB;AAEE,OAAK,OAAO;AACZ,MAAI,CAAC,KAAK,MAAM;AACd,SAAK,OAAO;AAAA,EAChB;AACE,OAAK;AACP;AAEA,QAAQ,UAAU,WAAW,SAAU,MAAM;AAC3C,MAAI,SAAS,KAAK,MAAM;AACtB;AAAA,EACJ;AAEE,MAAI,KAAK,MAAM;AACb,SAAK,KAAK,WAAW,IAAI;AAAA,EAC7B;AAEE,MAAI,OAAO,KAAK;AAChB,OAAK,OAAO;AACZ,OAAK,OAAO;AACZ,MAAI,MAAM;AACR,SAAK,OAAO;AAAA,EAChB;AAEE,OAAK,OAAO;AACZ,MAAI,CAAC,KAAK,MAAM;AACd,SAAK,OAAO;AAAA,EAChB;AACE,OAAK;AACP;AAEA,QAAQ,UAAU,OAAO,WAAY;AACnC,WAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,IAAI,GAAG,KAAK;AAChD,SAAK,MAAM,UAAU,CAAC,CAAC;AAAA,EAC3B;AACE,SAAO,KAAK;AACd;AAEA,QAAQ,UAAU,UAAU,WAAY;AACtC,WAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,IAAI,GAAG,KAAK;AAChD,YAAQ,MAAM,UAAU,CAAC,CAAC;AAAA,EAC9B;AACE,SAAO,KAAK;AACd;AAEA,QAAQ,UAAU,MAAM,WAAY;AAClC,MAAI,CAAC,KAAK,MAAM;AACd,WAAO;AAAA,EACX;AAEE,MAAI,MAAM,KAAK,KAAK;AACpB,OAAK,OAAO,KAAK,KAAK;AACtB,MAAI,KAAK,MAAM;AACb,SAAK,KAAK,OAAO;AAAA,EACrB,OAAS;AACL,SAAK,OAAO;AAAA,EAChB;AACE,OAAK;AACL,SAAO;AACT;AAEA,QAAQ,UAAU,QAAQ,WAAY;AACpC,MAAI,CAAC,KAAK,MAAM;AACd,WAAO;AAAA,EACX;AAEE,MAAI,MAAM,KAAK,KAAK;AACpB,OAAK,OAAO,KAAK,KAAK;AACtB,MAAI,KAAK,MAAM;AACb,SAAK,KAAK,OAAO;AAAA,EACrB,OAAS;AACL,SAAK,OAAO;AAAA,EAChB;AACE,OAAK;AACL,SAAO;AACT;AAEA,QAAQ,UAAU,UAAU,SAAU,IAAI,OAAO;AAC/C,UAAQ,SAAS;AACjB,WAAS,SAAS,KAAK,MAAM,IAAI,GAAG,WAAW,MAAM,KAAK;AACxD,OAAG,KAAK,OAAO,OAAO,OAAO,GAAG,IAAI;AACpC,aAAS,OAAO;AAAA,EACpB;AACA;AAEA,QAAQ,UAAU,iBAAiB,SAAU,IAAI,OAAO;AACtD,UAAQ,SAAS;AACjB,WAAS,SAAS,KAAK,MAAM,IAAI,KAAK,SAAS,GAAG,WAAW,MAAM,KAAK;AACtE,OAAG,KAAK,OAAO,OAAO,OAAO,GAAG,IAAI;AACpC,aAAS,OAAO;AAAA,EACpB;AACA;AAEA,QAAQ,UAAU,MAAM,SAAU,GAAG;AACnC,WAAS,IAAI,GAAG,SAAS,KAAK,MAAM,WAAW,QAAQ,IAAI,GAAG,KAAK;AAEjE,aAAS,OAAO;AAAA,EACpB;AACE,MAAI,MAAM,KAAK,WAAW,MAAM;AAC9B,WAAO,OAAO;AAAA,EAClB;AACA;AAEA,QAAQ,UAAU,aAAa,SAAU,GAAG;AAC1C,WAAS,IAAI,GAAG,SAAS,KAAK,MAAM,WAAW,QAAQ,IAAI,GAAG,KAAK;AAEjE,aAAS,OAAO;AAAA,EACpB;AACE,MAAI,MAAM,KAAK,WAAW,MAAM;AAC9B,WAAO,OAAO;AAAA,EAClB;AACA;AAEA,QAAQ,UAAU,MAAM,SAAU,IAAI,OAAO;AAC3C,UAAQ,SAAS;AACjB,MAAI,MAAM,IAAI,QAAO;AACrB,WAAS,SAAS,KAAK,MAAM,WAAW,QAAO;AAC7C,QAAI,KAAK,GAAG,KAAK,OAAO,OAAO,OAAO,IAAI,CAAC;AAC3C,aAAS,OAAO;AAAA,EACpB;AACE,SAAO;AACT;AAEA,QAAQ,UAAU,aAAa,SAAU,IAAI,OAAO;AAClD,UAAQ,SAAS;AACjB,MAAI,MAAM,IAAI,QAAO;AACrB,WAAS,SAAS,KAAK,MAAM,WAAW,QAAO;AAC7C,QAAI,KAAK,GAAG,KAAK,OAAO,OAAO,OAAO,IAAI,CAAC;AAC3C,aAAS,OAAO;AAAA,EACpB;AACE,SAAO;AACT;AAEA,QAAQ,UAAU,SAAS,SAAU,IAAI,SAAS;AAChD,MAAI;AACJ,MAAI,SAAS,KAAK;AAClB,MAAI,UAAU,SAAS,GAAG;AACxB,UAAM;AAAA,EACV,WAAa,KAAK,MAAM;AACpB,aAAS,KAAK,KAAK;AACnB,UAAM,KAAK,KAAK;AAAA,EACpB,OAAS;AACL,UAAM,IAAI,UAAU,4CAA4C;AAAA,EACpE;AAEE,WAAS,IAAI,GAAG,WAAW,MAAM,KAAK;AACpC,UAAM,GAAG,KAAK,OAAO,OAAO,CAAC;AAC7B,aAAS,OAAO;AAAA,EACpB;AAEE,SAAO;AACT;AAEA,QAAQ,UAAU,gBAAgB,SAAU,IAAI,SAAS;AACvD,MAAI;AACJ,MAAI,SAAS,KAAK;AAClB,MAAI,UAAU,SAAS,GAAG;AACxB,UAAM;AAAA,EACV,WAAa,KAAK,MAAM;AACpB,aAAS,KAAK,KAAK;AACnB,UAAM,KAAK,KAAK;AAAA,EACpB,OAAS;AACL,UAAM,IAAI,UAAU,4CAA4C;AAAA,EACpE;AAEE,WAAS,IAAI,KAAK,SAAS,GAAG,WAAW,MAAM,KAAK;AAClD,UAAM,GAAG,KAAK,OAAO,OAAO,CAAC;AAC7B,aAAS,OAAO;AAAA,EACpB;AAEE,SAAO;AACT;AAEA,QAAQ,UAAU,UAAU,WAAY;AACtC,MAAI,MAAM,IAAI,MAAM,KAAK,MAAM;AAC/B,WAAS,IAAI,GAAG,SAAS,KAAK,MAAM,WAAW,MAAM,KAAK;AACxD,QAAI,CAAC,IAAI,OAAO;AAChB,aAAS,OAAO;AAAA,EACpB;AACE,SAAO;AACT;AAEA,QAAQ,UAAU,iBAAiB,WAAY;AAC7C,MAAI,MAAM,IAAI,MAAM,KAAK,MAAM;AAC/B,WAAS,IAAI,GAAG,SAAS,KAAK,MAAM,WAAW,MAAM,KAAK;AACxD,QAAI,CAAC,IAAI,OAAO;AAChB,aAAS,OAAO;AAAA,EACpB;AACE,SAAO;AACT;AAEA,QAAQ,UAAU,QAAQ,SAAU,MAAM,IAAI;AAC5C,OAAK,MAAM,KAAK;AAChB,MAAI,KAAK,GAAG;AACV,UAAM,KAAK;AAAA,EACf;AACE,SAAO,QAAQ;AACf,MAAI,OAAO,GAAG;AACZ,YAAQ,KAAK;AAAA,EACjB;AACE,MAAI,MAAM,IAAI,QAAO;AACrB,MAAI,KAAK,QAAQ,KAAK,GAAG;AACvB,WAAO;AAAA,EACX;AACE,MAAI,OAAO,GAAG;AACZ,WAAO;AAAA,EACX;AACE,MAAI,KAAK,KAAK,QAAQ;AACpB,SAAK,KAAK;AAAA,EACd;AACE,WAAS,IAAI,GAAG,SAAS,KAAK,MAAM,WAAW,QAAQ,IAAI,MAAM,KAAK;AACpE,aAAS,OAAO;AAAA,EACpB;AACE,SAAO,WAAW,QAAQ,IAAI,IAAI,KAAK,SAAS,OAAO,MAAM;AAC3D,QAAI,KAAK,OAAO,KAAK;AAAA,EACzB;AACE,SAAO;AACT;AAEA,QAAQ,UAAU,eAAe,SAAU,MAAM,IAAI;AACnD,OAAK,MAAM,KAAK;AAChB,MAAI,KAAK,GAAG;AACV,UAAM,KAAK;AAAA,EACf;AACE,SAAO,QAAQ;AACf,MAAI,OAAO,GAAG;AACZ,YAAQ,KAAK;AAAA,EACjB;AACE,MAAI,MAAM,IAAI,QAAO;AACrB,MAAI,KAAK,QAAQ,KAAK,GAAG;AACvB,WAAO;AAAA,EACX;AACE,MAAI,OAAO,GAAG;AACZ,WAAO;AAAA,EACX;AACE,MAAI,KAAK,KAAK,QAAQ;AACpB,SAAK,KAAK;AAAA,EACd;AACE,WAAS,IAAI,KAAK,QAAQ,SAAS,KAAK,MAAM,WAAW,QAAQ,IAAI,IAAI,KAAK;AAC5E,aAAS,OAAO;AAAA,EACpB;AACE,SAAO,WAAW,QAAQ,IAAI,MAAM,KAAK,SAAS,OAAO,MAAM;AAC7D,QAAI,KAAK,OAAO,KAAK;AAAA,EACzB;AACE,SAAO;AACT;AAEA,QAAQ,UAAU,SAAS,SAAU,OAAO,gBAAgB,OAAO;AACjE,MAAI,QAAQ,KAAK,QAAQ;AACvB,YAAQ,KAAK,SAAS;AAAA,EAC1B;AACE,MAAI,QAAQ,GAAG;AACb,YAAQ,KAAK,SAAS;AAAA,EAC1B;AAEE,WAAS,IAAI,GAAG,SAAS,KAAK,MAAM,WAAW,QAAQ,IAAI,OAAO,KAAK;AACrE,aAAS,OAAO;AAAA,EACpB;AAEE,MAAI,MAAM,CAAA;AACV,WAAS,IAAI,GAAG,UAAU,IAAI,aAAa,KAAK;AAC9C,QAAI,KAAK,OAAO,KAAK;AACrB,aAAS,KAAK,WAAW,MAAM;AAAA,EACnC;AACE,MAAI,WAAW,MAAM;AACnB,aAAS,KAAK;AAAA,EAClB;AAEE,MAAI,WAAW,KAAK,QAAQ,WAAW,KAAK,MAAM;AAChD,aAAS,OAAO;AAAA,EACpB;AAEE,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,aAAS,OAAO,MAAM,QAAQ,MAAM,CAAC,CAAC;AAAA,EAC1C;AACE,SAAO;AACT;AAEA,QAAQ,UAAU,UAAU,WAAY;AACtC,MAAI,OAAO,KAAK;AAChB,MAAI,OAAO,KAAK;AAChB,WAAS,SAAS,MAAM,WAAW,MAAM,SAAS,OAAO,MAAM;AAC7D,QAAI,IAAI,OAAO;AACf,WAAO,OAAO,OAAO;AACrB,WAAO,OAAO;AAAA,EAClB;AACE,OAAK,OAAO;AACZ,OAAK,OAAO;AACZ,SAAO;AACT;AAEA,SAAS,OAAQ,MAAM,MAAM,OAAO;AAClC,MAAI,WAAW,SAAS,KAAK,OAC3B,IAAI,KAAK,OAAO,MAAM,MAAM,IAAI,IAChC,IAAI,KAAK,OAAO,MAAM,KAAK,MAAM,IAAI;AAEvC,MAAI,SAAS,SAAS,MAAM;AAC1B,SAAK,OAAO;AAAA,EAChB;AACE,MAAI,SAAS,SAAS,MAAM;AAC1B,SAAK,OAAO;AAAA,EAChB;AAEE,OAAK;AAEL,SAAO;AACT;AAEA,SAAS,KAAM,MAAM,MAAM;AACzB,OAAK,OAAO,IAAI,KAAK,MAAM,KAAK,MAAM,MAAM,IAAI;AAChD,MAAI,CAAC,KAAK,MAAM;AACd,SAAK,OAAO,KAAK;AAAA,EACrB;AACE,OAAK;AACP;AAEA,SAAS,QAAS,MAAM,MAAM;AAC5B,OAAK,OAAO,IAAI,KAAK,MAAM,MAAM,KAAK,MAAM,IAAI;AAChD,MAAI,CAAC,KAAK,MAAM;AACd,SAAK,OAAO,KAAK;AAAA,EACrB;AACE,OAAK;AACP;AAEA,SAAS,KAAM,OAAO,MAAM,MAAM,MAAM;AACtC,MAAI,EAAE,gBAAgB,OAAO;AAC3B,WAAO,IAAI,KAAK,OAAO,MAAM,MAAM,IAAI;AAAA,EAC3C;AAEE,OAAK,OAAO;AACZ,OAAK,QAAQ;AAEb,MAAI,MAAM;AACR,SAAK,OAAO;AACZ,SAAK,OAAO;AAAA,EAChB,OAAS;AACL,SAAK,OAAO;AAAA,EAChB;AAEE,MAAI,MAAM;AACR,SAAK,OAAO;AACZ,SAAK,OAAO;AAAA,EAChB,OAAS;AACL,SAAK,OAAO;AAAA,EAChB;AACA;AAEA,IAAI;AAEFA,kBAAA,EAAyB,OAAO;AAClC,SAAS,IAAI;AAAA;","x_google_ignoreList":[0]}

package/dist/_node_modules/yargs-parser/build/lib/index.cjs

@@ -1,6 +1,6 @@
 "use strict";
-const require$$0 = require("util");
-const require$$0$1 = require("path");
+const require$$0$1 = require("util");
+const require$$0 = require("path");
 const stringUtils = require("./string-utils.cjs");
 const yargsParser$1 = require("./yargs-parser.cjs");
 const require$$0$2 = require("fs");
@@ -27,9 +27,9 @@ const parser = new yargsParser$1.YargsParser({
   env: () => {
     return env;
   },
-  format: require$$0.format,
-  normalize: require$$0$1.normalize,
-  resolve: require$$0$1.resolve,
+  format: require$$0$1.format,
+  normalize: require$$0.normalize,
+  resolve: require$$0.resolve,
   // TODO: figure  out a  way to combine ESM and CJS coverage, such  that
   // we can exercise all the lines below:
   require: (path) => {