[
{
"path": ".all-contributorsrc",
"content": "{\n \"projectName\": \"transform\",\n \"projectOwner\": \"ritz078\",\n \"repoType\": \"github\",\n \"repoHost\": \"https://github.com\",\n \"files\": [\n \"README.md\"\n ],\n \"imageSize\": 100,\n \"commit\": false,\n \"commitConvention\": \"angular\",\n \"contributors\": [\n {\n \"login\": \"ritz078\",\n \"name\": \"Ritesh Kumar\",\n \"avatar_url\": \"https://avatars3.githubusercontent.com/u/5389035?v=4\",\n \"profile\": \"http://riteshkr.com\",\n \"contributions\": [\n \"doc\",\n \"code\",\n \"ideas\",\n \"review\"\n ]\n },\n {\n \"login\": \"skade\",\n \"name\": \"Florian Gilcher\",\n \"avatar_url\": \"https://avatars2.githubusercontent.com/u/47542?v=4\",\n \"profile\": \"http://asquera.de\",\n \"contributions\": [\n \"code\"\n ]\n },\n {\n \"login\": \"killercup\",\n \"name\": \"Pascal Hertleif\",\n \"avatar_url\": \"https://avatars1.githubusercontent.com/u/20063?v=4\",\n \"profile\": \"http://pascalhertleif.de/\",\n \"contributions\": [\n \"code\"\n ]\n },\n {\n \"login\": \"Landish\",\n \"name\": \"Lado Lomidze\",\n \"avatar_url\": \"https://avatars3.githubusercontent.com/u/534610?v=4\",\n \"profile\": \"http://landish.github.io\",\n \"contributions\": [\n \"code\"\n ]\n },\n {\n \"login\": \"mattiamanzati\",\n \"name\": \"Mattia Manzati\",\n \"avatar_url\": \"https://avatars1.githubusercontent.com/u/13787614?v=4\",\n \"profile\": \"https://github.com/mattiamanzati\",\n \"contributions\": [\n \"code\"\n ]\n },\n {\n \"login\": \"morajabi\",\n \"name\": \"Mohammad Rajabifard\",\n \"avatar_url\": \"https://avatars3.githubusercontent.com/u/12202757?v=4\",\n \"profile\": \"https://tarino.ir\",\n \"contributions\": [\n \"ideas\",\n \"code\"\n ]\n },\n {\n \"login\": \"Raathigesh\",\n \"name\": \"Raathigeshan Kugarajan\",\n \"avatar_url\": \"https://avatars0.githubusercontent.com/u/3108160?v=4\",\n \"profile\": \"http://raathigesh.com/\",\n \"contributions\": [\n \"code\"\n ]\n },\n {\n \"login\": \"gyandeeps\",\n \"name\": \"Gyandeep Singh\",\n \"avatar_url\": \"https://avatars2.githubusercontent.com/u/5554486?v=4\",\n \"profile\": \"https://gyandeeps.com\",\n \"contributions\": [\n \"code\"\n ]\n },\n {\n \"login\": \"mholt\",\n \"name\": \"Matt Holt\",\n \"avatar_url\": \"https://avatars2.githubusercontent.com/u/1128849?v=4\",\n \"profile\": \"https://matt.life\",\n \"contributions\": [\n \"code\"\n ]\n },\n {\n \"login\": \"cg-cnu\",\n \"name\": \"sreenivas alapati\",\n \"avatar_url\": \"https://avatars0.githubusercontent.com/u/2767425?v=4\",\n \"profile\": \"https://medium.com/@sreenivas\",\n \"contributions\": [\n \"code\"\n ]\n },\n {\n \"login\": \"bcherny\",\n \"name\": \"Boris Cherny\",\n \"avatar_url\": \"https://avatars2.githubusercontent.com/u/1761758?v=4\",\n \"profile\": \"https://performancejs.com\",\n \"contributions\": [\n \"code\"\n ]\n },\n {\n \"login\": \"intabulas\",\n \"name\": \"Mark Lussier\",\n \"avatar_url\": \"https://avatars0.githubusercontent.com/u/448?v=4\",\n \"profile\": \"http://www.twitter.com/intabulas\",\n \"contributions\": [\n \"code\"\n ]\n },\n {\n \"login\": \"brikou\",\n \"name\": \"Brice BERNARD\",\n \"avatar_url\": \"https://avatars3.githubusercontent.com/u/383212?v=4\",\n \"profile\": \"https://github.com/brikou\",\n \"contributions\": [\n \"code\"\n ]\n },\n {\n \"login\": \"satya164\",\n \"name\": \"Satyajit Sahoo\",\n \"avatar_url\": \"https://avatars2.githubusercontent.com/u/1174278?v=4\",\n \"profile\": \"https://twitter.com/@satya164\",\n \"contributions\": [\n \"code\"\n ]\n },\n {\n \"login\": \"shakyShane\",\n \"name\": \"Shane Osbourne\",\n \"avatar_url\": \"https://avatars3.githubusercontent.com/u/1643522?v=4\",\n \"profile\": \"https://medium.com/@shakyShane\",\n \"contributions\": [\n \"code\"\n ]\n },\n {\n \"login\": \"pd4d10\",\n \"name\": \"Rongjian Zhang\",\n \"avatar_url\": \"https://avatars0.githubusercontent.com/u/9524411?v=4\",\n \"profile\": \"https://github.com/pd4d10\",\n \"contributions\": [\n \"code\"\n ]\n },\n {\n \"login\": \"KeshShan\",\n \"name\": \"Keshan Nageswaran\",\n \"avatar_url\": \"https://avatars3.githubusercontent.com/u/12506034?v=4\",\n \"profile\": \"http://keshShan.github.io\",\n \"contributions\": [\n \"code\"\n ]\n },\n {\n \"login\": \"code\",\n \"name\": \"codegent\",\n \"avatar_url\": \"https://avatars1.githubusercontent.com/u/7318?v=4\",\n \"profile\": \"http://www.codegent.com\",\n \"contributions\": [\n \"code\"\n ]\n },\n {\n \"login\": \"bastor\",\n \"name\": \"Sebastian Maliszczak\",\n \"avatar_url\": \"https://avatars3.githubusercontent.com/u/1881814?v=4\",\n \"profile\": \"https://github.com/bastor\",\n \"contributions\": [\n \"code\"\n ]\n },\n {\n \"login\": \"Haroenv\",\n \"name\": \"Haroen Viaene\",\n \"avatar_url\": \"https://avatars3.githubusercontent.com/u/6270048?v=4\",\n \"profile\": \"https://haroen.me\",\n \"contributions\": [\n \"code\"\n ]\n },\n {\n \"login\": \"timneutkens\",\n \"name\": \"Tim Neutkens\",\n \"avatar_url\": \"https://avatars2.githubusercontent.com/u/6324199?v=4\",\n \"profile\": \"https://timn.tech\",\n \"contributions\": [\n \"plugin\",\n \"code\"\n ]\n },\n {\n \"login\": \"raminrez\",\n \"name\": \"Ramin Rezaie\",\n \"avatar_url\": \"https://avatars1.githubusercontent.com/u/7345325?v=4\",\n \"profile\": \"https://github.com/raminrez\",\n \"contributions\": [\n \"code\"\n ]\n },\n {\n \"login\": \"guilhermesteves\",\n \"name\": \"Guilherme Esteves\",\n \"avatar_url\": \"https://avatars3.githubusercontent.com/u/2166045?v=4\",\n \"profile\": \"https://guilhermeesteves.com\",\n \"contributions\": [\n \"code\"\n ]\n },\n {\n \"login\": \"p-racoon\",\n \"name\": \"Prasham Ashesh\",\n \"avatar_url\": \"https://avatars2.githubusercontent.com/u/13845070?v=4\",\n \"profile\": \"https://github.com/p-racoon\",\n \"contributions\": [\n \"code\"\n ]\n },\n {\n \"login\": \"jamesgeorge007\",\n \"name\": \"James George\",\n \"avatar_url\": \"https://avatars2.githubusercontent.com/u/25279263?v=4\",\n \"profile\": \"https://ghuser.io/jamesgeorge007\",\n \"contributions\": [\n \"code\"\n ]\n },\n {\n \"login\": \"ChaitanyaGadodia\",\n \"name\": \"Chaitanya Gadodia\",\n \"avatar_url\": \"https://avatars1.githubusercontent.com/u/10559670?v=4\",\n \"profile\": \"https://chaitanyagadodia.github.io/\",\n \"contributions\": [\n \"code\"\n ]\n },\n {\n \"login\": \"miklosme\",\n \"name\": \"Miklos Megyes\",\n \"avatar_url\": \"https://avatars3.githubusercontent.com/u/8769273?v=4\",\n \"profile\": \"https://miklos.dev\",\n \"contributions\": [\n \"code\"\n ]\n },\n {\n \"login\": \"Rishabh-Rathod\",\n \"name\": \"Rishabh Rathod\",\n \"avatar_url\": \"https://avatars0.githubusercontent.com/u/23132741?v=4\",\n \"profile\": \"https://github.com/Rishabh-Rathod\",\n \"contributions\": [\n \"code\"\n ]\n },\n {\n \"login\": \"agent515\",\n \"name\": \"agent515\",\n \"avatar_url\": \"https://avatars.githubusercontent.com/u/46898603?v=4\",\n \"profile\": \"https://github.com/agent515\",\n \"contributions\": [\n \"code\"\n ]\n },\n {\n \"login\": \"jfsiii\",\n \"name\": \"John Schulz\",\n \"avatar_url\": \"https://avatars.githubusercontent.com/u/57655?v=4\",\n \"profile\": \"http://JFSIII.org\",\n \"contributions\": [\n \"code\"\n ]\n },\n {\n \"login\": \"nasrul21\",\n \"name\": \"Nasrul Faizin\",\n \"avatar_url\": \"https://avatars.githubusercontent.com/u/15046792?v=4\",\n \"profile\": \"https://github.com/nasrul21\",\n \"contributions\": [\n \"code\"\n ]\n },\n {\n \"login\": \"jdjfisher\",\n \"name\": \"Jordan Fisher\",\n \"avatar_url\": \"https://avatars.githubusercontent.com/u/43887886?v=4\",\n \"profile\": \"https://github.com/jdjfisher\",\n \"contributions\": [\n \"code\"\n ]\n },\n {\n \"login\": \"csandman\",\n \"name\": \"Chris Sandvik\",\n \"avatar_url\": \"https://avatars.githubusercontent.com/u/9214195?v=4\",\n \"profile\": \"https://github.com/csandman\",\n \"contributions\": [\n \"code\"\n ]\n },\n {\n \"login\": \"LemonNekoGH\",\n \"name\": \"LemonNeko\",\n \"avatar_url\": \"https://avatars.githubusercontent.com/u/17664845?v=4\",\n \"profile\": \"https://blog.lemonneko.moe\",\n \"contributions\": [\n \"code\"\n ]\n },\n {\n \"login\": \"Pooja444\",\n \"name\": \"Pooja Kulkarni\",\n \"avatar_url\": \"https://avatars.githubusercontent.com/u/24620969?v=4\",\n \"profile\": \"http://poojakulkarni.dev\",\n \"contributions\": [\n \"code\"\n ]\n },\n {\n \"login\": \"SuttonJack\",\n \"name\": \"Jack Sutton\",\n \"avatar_url\": \"https://avatars.githubusercontent.com/u/92991945?v=4\",\n \"profile\": \"https://github.com/SuttonJack\",\n \"contributions\": [\n \"code\"\n ]\n },\n {\n \"login\": \"Jackardios\",\n \"name\": \"Salakhutdinov Salavat\",\n \"avatar_url\": \"https://avatars.githubusercontent.com/u/24757335?v=4\",\n \"profile\": \"https://t.me/jackardios\",\n \"contributions\": [\n \"code\"\n ]\n },\n {\n \"login\": \"salman0ansari\",\n \"name\": \"Mohd Salman\",\n \"avatar_url\": \"https://avatars.githubusercontent.com/u/30106022?v=4\",\n \"profile\": \"https://github.com/salman0ansari\",\n \"contributions\": [\n \"code\"\n ]\n }\n ],\n \"contributorsPerLine\": 7,\n \"skipCi\": true,\n \"commitType\": \"docs\"\n}\n"
},
{
"path": ".github/FUNDING.yml",
"content": "# These are supported funding model platforms\n\ngithub: ritz078\n"
},
{
"path": ".gitignore",
"content": ".idea\n.next\nnode_modules\nyarn-error.log\ndist\n.DS_Store\npublic/static/monaco/*.worker.js.map\n.tool-versions\nheroku\n\n.vercel\n"
},
{
"path": ".prettierignore",
"content": "public/static/monaco\n"
},
{
"path": ".prettierrc",
"content": "{\n \"printWidth\": 80,\n \"tabWidth\": 2,\n \"useTabs\": false,\n \"semi\": true,\n \"singleQuote\": false,\n \"quoteProps\": \"as-needed\",\n \"jsxSingleQuote\": false,\n \"trailingComma\": \"none\",\n \"bracketSpacing\": true,\n \"arrowParens\": \"avoid\",\n \"requirePragma\": false,\n \"insertPragma\": false,\n \"proseWrap\": \"preserve\",\n \"htmlWhitespaceSensitivity\": \"css\",\n \"endOfLine\": \"lf\"\n}\n"
},
{
"path": "LICENSE",
"content": "MIT License\n\nCopyright (c) 2019 Ritesh Kumar\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all\ncopies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\nSOFTWARE.\n"
},
{
"path": "README.md",
"content": "\n\n---\n\n\n \n \n \n \n bug fixing \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n * @license MIT\n */\n /* eslint-disable no-proto */\n\n \"use strict\";\n\n var base64 = require(\"base64-js\");\n var ieee754 = require(\"ieee754\");\n\n exports.Buffer = Buffer;\n exports.SlowBuffer = SlowBuffer;\n exports.INSPECT_MAX_BYTES = 50;\n\n var K_MAX_LENGTH = 0x7fffffff;\n exports.kMaxLength = K_MAX_LENGTH;\n\n /**\n * If `Buffer.TYPED_ARRAY_SUPPORT`:\n * === true Use Uint8Array implementation (fastest)\n * === false Print warning and recommend using `buffer` v4.x which has an Object\n * implementation (most compatible, even IE6)\n *\n * Browsers that support typed arrays are IE 10+, Firefox 4+, Chrome 7+, Safari 5.1+,\n * Opera 11.6+, iOS 4.2+.\n *\n * We report that the browser does not support typed arrays if the are not subclassable\n * using __proto__. Firefox 4-29 lacks support for adding new properties to `Uint8Array`\n * (See: https://bugzilla.mozilla.org/show_bug.cgi?id=695438). IE 10 lacks support\n * for __proto__ and has a buggy typed array implementation.\n */\n Buffer.TYPED_ARRAY_SUPPORT = typedArraySupport();\n\n if (\n !Buffer.TYPED_ARRAY_SUPPORT &&\n typeof console !== \"undefined\" &&\n typeof console.error === \"function\"\n ) {\n console.error(\n \"This browser lacks typed array (Uint8Array) support which is required by \" +\n \"`buffer` v5.x. Use `buffer` v4.x if you require old browser support.\"\n );\n }\n\n function typedArraySupport() {\n // Can typed array instances can be augmented?\n try {\n var arr = new Uint8Array(1);\n arr.__proto__ = {\n __proto__: Uint8Array.prototype,\n foo: function() {\n return 42;\n }\n };\n return arr.foo() === 42;\n } catch (e) {\n return false;\n }\n }\n\n Object.defineProperty(Buffer.prototype, \"parent\", {\n enumerable: true,\n get: function() {\n if (!Buffer.isBuffer(this)) return undefined;\n return this.buffer;\n }\n });\n\n Object.defineProperty(Buffer.prototype, \"offset\", {\n enumerable: true,\n get: function() {\n if (!Buffer.isBuffer(this)) return undefined;\n return this.byteOffset;\n }\n });\n\n function createBuffer(length) {\n if (length > K_MAX_LENGTH) {\n throw new RangeError(\n 'The value \"' + length + '\" is invalid for option \"size\"'\n );\n }\n // Return an augmented `Uint8Array` instance\n var buf = new Uint8Array(length);\n buf.__proto__ = Buffer.prototype;\n return buf;\n }\n\n /**\n * The Buffer constructor returns instances of `Uint8Array` that have their\n * prototype changed to `Buffer.prototype`. Furthermore, `Buffer` is a subclass of\n * `Uint8Array`, so the returned instances will have all the node `Buffer` methods\n * and the `Uint8Array` methods. Square bracket notation works as expected -- it\n * returns a single octet.\n *\n * The `Uint8Array` prototype remains unmodified.\n */\n\n function Buffer(arg, encodingOrOffset, length) {\n // Common case.\n if (typeof arg === \"number\") {\n if (typeof encodingOrOffset === \"string\") {\n throw new TypeError(\n 'The \"string\" argument must be of type string. Received type number'\n );\n }\n return allocUnsafe(arg);\n }\n return from(arg, encodingOrOffset, length);\n }\n\n // Fix subarray() in ES2016. See: https://github.com/feross/buffer/pull/97\n if (\n typeof Symbol !== \"undefined\" &&\n Symbol.species != null &&\n Buffer[Symbol.species] === Buffer\n ) {\n Object.defineProperty(Buffer, Symbol.species, {\n value: null,\n configurable: true,\n enumerable: false,\n writable: false\n });\n }\n\n Buffer.poolSize = 8192; // not used by this implementation\n\n function from(value, encodingOrOffset, length) {\n if (typeof value === \"string\") {\n return fromString(value, encodingOrOffset);\n }\n\n if (ArrayBuffer.isView(value)) {\n return fromArrayLike(value);\n }\n\n if (value == null) {\n throw TypeError(\n \"The first argument must be one of type string, Buffer, ArrayBuffer, Array, \" +\n \"or Array-like Object. Received type \" +\n typeof value\n );\n }\n\n if (\n isInstance(value, ArrayBuffer) ||\n (value && isInstance(value.buffer, ArrayBuffer))\n ) {\n return fromArrayBuffer(value, encodingOrOffset, length);\n }\n\n if (typeof value === \"number\") {\n throw new TypeError(\n 'The \"value\" argument must not be of type number. Received type number'\n );\n }\n\n var valueOf = value.valueOf && value.valueOf();\n if (valueOf != null && valueOf !== value) {\n return Buffer.from(valueOf, encodingOrOffset, length);\n }\n\n var b = fromObject(value);\n if (b) return b;\n\n if (\n typeof Symbol !== \"undefined\" &&\n Symbol.toPrimitive != null &&\n typeof value[Symbol.toPrimitive] === \"function\"\n ) {\n return Buffer.from(\n value[Symbol.toPrimitive](\"string\"),\n encodingOrOffset,\n length\n );\n }\n\n throw new TypeError(\n \"The first argument must be one of type string, Buffer, ArrayBuffer, Array, \" +\n \"or Array-like Object. Received type \" +\n typeof value\n );\n }\n\n /**\n * Functionally equivalent to Buffer(arg, encoding) but throws a TypeError\n * if value is a number.\n * Buffer.from(str[, encoding])\n * Buffer.from(array)\n * Buffer.from(buffer)\n * Buffer.from(arrayBuffer[, byteOffset[, length]])\n **/\n Buffer.from = function(value, encodingOrOffset, length) {\n return from(value, encodingOrOffset, length);\n };\n\n // Note: Change prototype *after* Buffer.from is defined to workaround Chrome bug:\n // https://github.com/feross/buffer/pull/148\n Buffer.prototype.__proto__ = Uint8Array.prototype;\n Buffer.__proto__ = Uint8Array;\n\n function assertSize(size) {\n if (typeof size !== \"number\") {\n throw new TypeError('\"size\" argument must be of type number');\n } else if (size < 0) {\n throw new RangeError(\n 'The value \"' + size + '\" is invalid for option \"size\"'\n );\n }\n }\n\n function alloc(size, fill, encoding) {\n assertSize(size);\n if (size <= 0) {\n return createBuffer(size);\n }\n if (fill !== undefined) {\n // Only pay attention to encoding if it's a string. This\n // prevents accidentally sending in a number that would\n // be interpretted as a start offset.\n return typeof encoding === \"string\"\n ? createBuffer(size).fill(fill, encoding)\n : createBuffer(size).fill(fill);\n }\n return createBuffer(size);\n }\n\n /**\n * Creates a new filled Buffer instance.\n * alloc(size[, fill[, encoding]])\n **/\n Buffer.alloc = function(size, fill, encoding) {\n return alloc(size, fill, encoding);\n };\n\n function allocUnsafe(size) {\n assertSize(size);\n return createBuffer(size < 0 ? 0 : checked(size) | 0);\n }\n\n /**\n * Equivalent to Buffer(num), by default creates a non-zero-filled Buffer instance.\n * */\n Buffer.allocUnsafe = function(size) {\n return allocUnsafe(size);\n };\n /**\n * Equivalent to SlowBuffer(num), by default creates a non-zero-filled Buffer instance.\n */\n Buffer.allocUnsafeSlow = function(size) {\n return allocUnsafe(size);\n };\n\n function fromString(string, encoding) {\n if (typeof encoding !== \"string\" || encoding === \"\") {\n encoding = \"utf8\";\n }\n\n if (!Buffer.isEncoding(encoding)) {\n throw new TypeError(\"Unknown encoding: \" + encoding);\n }\n\n var length = byteLength(string, encoding) | 0;\n var buf = createBuffer(length);\n\n var actual = buf.write(string, encoding);\n\n if (actual !== length) {\n // Writing a hex string, for example, that contains invalid characters will\n // cause everything after the first invalid character to be ignored. (e.g.\n // 'abxxcd' will be treated as 'ab')\n buf = buf.slice(0, actual);\n }\n\n return buf;\n }\n\n function fromArrayLike(array) {\n var length = array.length < 0 ? 0 : checked(array.length) | 0;\n var buf = createBuffer(length);\n for (var i = 0; i < length; i += 1) {\n buf[i] = array[i] & 255;\n }\n return buf;\n }\n\n function fromArrayBuffer(array, byteOffset, length) {\n if (byteOffset < 0 || array.byteLength < byteOffset) {\n throw new RangeError('\"offset\" is outside of buffer bounds');\n }\n\n if (array.byteLength < byteOffset + (length || 0)) {\n throw new RangeError('\"length\" is outside of buffer bounds');\n }\n\n var buf;\n if (byteOffset === undefined && length === undefined) {\n buf = new Uint8Array(array);\n } else if (length === undefined) {\n buf = new Uint8Array(array, byteOffset);\n } else {\n buf = new Uint8Array(array, byteOffset, length);\n }\n\n // Return an augmented `Uint8Array` instance\n buf.__proto__ = Buffer.prototype;\n return buf;\n }\n\n function fromObject(obj) {\n if (Buffer.isBuffer(obj)) {\n var len = checked(obj.length) | 0;\n var buf = createBuffer(len);\n\n if (buf.length === 0) {\n return buf;\n }\n\n obj.copy(buf, 0, 0, len);\n return buf;\n }\n\n if (obj.length !== undefined) {\n if (typeof obj.length !== \"number\" || numberIsNaN(obj.length)) {\n return createBuffer(0);\n }\n return fromArrayLike(obj);\n }\n\n if (obj.type === \"Buffer\" && Array.isArray(obj.data)) {\n return fromArrayLike(obj.data);\n }\n }\n\n function checked(length) {\n // Note: cannot use `length < K_MAX_LENGTH` here because that fails when\n // length is NaN (which is otherwise coerced to zero.)\n if (length >= K_MAX_LENGTH) {\n throw new RangeError(\n \"Attempt to allocate Buffer larger than maximum \" +\n \"size: 0x\" +\n K_MAX_LENGTH.toString(16) +\n \" bytes\"\n );\n }\n return length | 0;\n }\n\n function SlowBuffer(length) {\n if (+length != length) {\n // eslint-disable-line eqeqeq\n length = 0;\n }\n return Buffer.alloc(+length);\n }\n\n Buffer.isBuffer = function isBuffer(b) {\n return b != null && b._isBuffer === true && b !== Buffer.prototype; // so Buffer.isBuffer(Buffer.prototype) will be false\n };\n\n Buffer.compare = function compare(a, b) {\n if (isInstance(a, Uint8Array))\n a = Buffer.from(a, a.offset, a.byteLength);\n if (isInstance(b, Uint8Array))\n b = Buffer.from(b, b.offset, b.byteLength);\n if (!Buffer.isBuffer(a) || !Buffer.isBuffer(b)) {\n throw new TypeError(\n 'The \"buf1\", \"buf2\" arguments must be one of type Buffer or Uint8Array'\n );\n }\n\n if (a === b) return 0;\n\n var x = a.length;\n var y = b.length;\n\n for (var i = 0, len = Math.min(x, y); i < len; ++i) {\n if (a[i] !== b[i]) {\n x = a[i];\n y = b[i];\n break;\n }\n }\n\n if (x < y) return -1;\n if (y < x) return 1;\n return 0;\n };\n\n Buffer.isEncoding = function isEncoding(encoding) {\n switch (String(encoding).toLowerCase()) {\n case \"hex\":\n case \"utf8\":\n case \"utf-8\":\n case \"ascii\":\n case \"latin1\":\n case \"binary\":\n case \"base64\":\n case \"ucs2\":\n case \"ucs-2\":\n case \"utf16le\":\n case \"utf-16le\":\n return true;\n default:\n return false;\n }\n };\n\n Buffer.concat = function concat(list, length) {\n if (!Array.isArray(list)) {\n throw new TypeError(\n '\"list\" argument must be an Array of Buffers'\n );\n }\n\n if (list.length === 0) {\n return Buffer.alloc(0);\n }\n\n var i;\n if (length === undefined) {\n length = 0;\n for (i = 0; i < list.length; ++i) {\n length += list[i].length;\n }\n }\n\n var buffer = Buffer.allocUnsafe(length);\n var pos = 0;\n for (i = 0; i < list.length; ++i) {\n var buf = list[i];\n if (isInstance(buf, Uint8Array)) {\n buf = Buffer.from(buf);\n }\n if (!Buffer.isBuffer(buf)) {\n throw new TypeError(\n '\"list\" argument must be an Array of Buffers'\n );\n }\n buf.copy(buffer, pos);\n pos += buf.length;\n }\n return buffer;\n };\n\n function byteLength(string, encoding) {\n if (Buffer.isBuffer(string)) {\n return string.length;\n }\n if (ArrayBuffer.isView(string) || isInstance(string, ArrayBuffer)) {\n return string.byteLength;\n }\n if (typeof string !== \"string\") {\n throw new TypeError(\n 'The \"string\" argument must be one of type string, Buffer, or ArrayBuffer. ' +\n \"Received type \" +\n typeof string\n );\n }\n\n var len = string.length;\n var mustMatch = arguments.length > 2 && arguments[2] === true;\n if (!mustMatch && len === 0) return 0;\n\n // Use a for loop to avoid recursion\n var loweredCase = false;\n for (;;) {\n switch (encoding) {\n case \"ascii\":\n case \"latin1\":\n case \"binary\":\n return len;\n case \"utf8\":\n case \"utf-8\":\n return utf8ToBytes(string).length;\n case \"ucs2\":\n case \"ucs-2\":\n case \"utf16le\":\n case \"utf-16le\":\n return len * 2;\n case \"hex\":\n return len >>> 1;\n case \"base64\":\n return base64ToBytes(string).length;\n default:\n if (loweredCase) {\n return mustMatch ? -1 : utf8ToBytes(string).length; // assume utf8\n }\n encoding = (\"\" + encoding).toLowerCase();\n loweredCase = true;\n }\n }\n }\n Buffer.byteLength = byteLength;\n\n function slowToString(encoding, start, end) {\n var loweredCase = false;\n\n // No need to verify that \"this.length <= MAX_UINT32\" since it's a read-only\n // property of a typed array.\n\n // This behaves neither like String nor Uint8Array in that we set start/end\n // to their upper/lower bounds if the value passed is out of range.\n // undefined is handled specially as per ECMA-262 6th Edition,\n // Section 13.3.3.7 Runtime Semantics: KeyedBindingInitialization.\n if (start === undefined || start < 0) {\n start = 0;\n }\n // Return early if start > this.length. Done here to prevent potential uint32\n // coercion fail below.\n if (start > this.length) {\n return \"\";\n }\n\n if (end === undefined || end > this.length) {\n end = this.length;\n }\n\n if (end <= 0) {\n return \"\";\n }\n\n // Force coersion to uint32. This will also coerce falsey/NaN values to 0.\n end >>>= 0;\n start >>>= 0;\n\n if (end <= start) {\n return \"\";\n }\n\n if (!encoding) encoding = \"utf8\";\n\n while (true) {\n switch (encoding) {\n case \"hex\":\n return hexSlice(this, start, end);\n\n case \"utf8\":\n case \"utf-8\":\n return utf8Slice(this, start, end);\n\n case \"ascii\":\n return asciiSlice(this, start, end);\n\n case \"latin1\":\n case \"binary\":\n return latin1Slice(this, start, end);\n\n case \"base64\":\n return base64Slice(this, start, end);\n\n case \"ucs2\":\n case \"ucs-2\":\n case \"utf16le\":\n case \"utf-16le\":\n return utf16leSlice(this, start, end);\n\n default:\n if (loweredCase)\n throw new TypeError(\"Unknown encoding: \" + encoding);\n encoding = (encoding + \"\").toLowerCase();\n loweredCase = true;\n }\n }\n }\n\n // This property is used by `Buffer.isBuffer` (and the `is-buffer` npm package)\n // to detect a Buffer instance. It's not possible to use `instanceof Buffer`\n // reliably in a browserify context because there could be multiple different\n // copies of the 'buffer' package in use. This method works even for Buffer\n // instances that were created from another copy of the `buffer` package.\n // See: https://github.com/feross/buffer/issues/154\n Buffer.prototype._isBuffer = true;\n\n function swap(b, n, m) {\n var i = b[n];\n b[n] = b[m];\n b[m] = i;\n }\n\n Buffer.prototype.swap16 = function swap16() {\n var len = this.length;\n if (len % 2 !== 0) {\n throw new RangeError(\"Buffer size must be a multiple of 16-bits\");\n }\n for (var i = 0; i < len; i += 2) {\n swap(this, i, i + 1);\n }\n return this;\n };\n\n Buffer.prototype.swap32 = function swap32() {\n var len = this.length;\n if (len % 4 !== 0) {\n throw new RangeError(\"Buffer size must be a multiple of 32-bits\");\n }\n for (var i = 0; i < len; i += 4) {\n swap(this, i, i + 3);\n swap(this, i + 1, i + 2);\n }\n return this;\n };\n\n Buffer.prototype.swap64 = function swap64() {\n var len = this.length;\n if (len % 8 !== 0) {\n throw new RangeError(\"Buffer size must be a multiple of 64-bits\");\n }\n for (var i = 0; i < len; i += 8) {\n swap(this, i, i + 7);\n swap(this, i + 1, i + 6);\n swap(this, i + 2, i + 5);\n swap(this, i + 3, i + 4);\n }\n return this;\n };\n\n Buffer.prototype.toString = function toString() {\n var length = this.length;\n if (length === 0) return \"\";\n if (arguments.length === 0) return utf8Slice(this, 0, length);\n return slowToString.apply(this, arguments);\n };\n\n Buffer.prototype.toLocaleString = Buffer.prototype.toString;\n\n Buffer.prototype.equals = function equals(b) {\n if (!Buffer.isBuffer(b))\n throw new TypeError(\"Argument must be a Buffer\");\n if (this === b) return true;\n return Buffer.compare(this, b) === 0;\n };\n\n Buffer.prototype.inspect = function inspect() {\n var str = \"\";\n var max = exports.INSPECT_MAX_BYTES;\n str = this.toString(\"hex\", 0, max)\n .replace(/(.{2})/g, \"$1 \")\n .trim();\n if (this.length > max) str += \" ... \";\n return \"\";\n };\n\n Buffer.prototype.compare = function compare(\n target,\n start,\n end,\n thisStart,\n thisEnd\n ) {\n if (isInstance(target, Uint8Array)) {\n target = Buffer.from(target, target.offset, target.byteLength);\n }\n if (!Buffer.isBuffer(target)) {\n throw new TypeError(\n 'The \"target\" argument must be one of type Buffer or Uint8Array. ' +\n \"Received type \" +\n typeof target\n );\n }\n\n if (start === undefined) {\n start = 0;\n }\n if (end === undefined) {\n end = target ? target.length : 0;\n }\n if (thisStart === undefined) {\n thisStart = 0;\n }\n if (thisEnd === undefined) {\n thisEnd = this.length;\n }\n\n if (\n start < 0 ||\n end > target.length ||\n thisStart < 0 ||\n thisEnd > this.length\n ) {\n throw new RangeError(\"out of range index\");\n }\n\n if (thisStart >= thisEnd && start >= end) {\n return 0;\n }\n if (thisStart >= thisEnd) {\n return -1;\n }\n if (start >= end) {\n return 1;\n }\n\n start >>>= 0;\n end >>>= 0;\n thisStart >>>= 0;\n thisEnd >>>= 0;\n\n if (this === target) return 0;\n\n var x = thisEnd - thisStart;\n var y = end - start;\n var len = Math.min(x, y);\n\n var thisCopy = this.slice(thisStart, thisEnd);\n var targetCopy = target.slice(start, end);\n\n for (var i = 0; i < len; ++i) {\n if (thisCopy[i] !== targetCopy[i]) {\n x = thisCopy[i];\n y = targetCopy[i];\n break;\n }\n }\n\n if (x < y) return -1;\n if (y < x) return 1;\n return 0;\n };\n\n // Finds either the first index of `val` in `buffer` at offset >= `byteOffset`,\n // OR the last index of `val` in `buffer` at offset <= `byteOffset`.\n //\n // Arguments:\n // - buffer - a Buffer to search\n // - val - a string, Buffer, or number\n // - byteOffset - an index into `buffer`; will be clamped to an int32\n // - encoding - an optional encoding, relevant is val is a string\n // - dir - true for indexOf, false for lastIndexOf\n function bidirectionalIndexOf(\n buffer,\n val,\n byteOffset,\n encoding,\n dir\n ) {\n // Empty buffer means no match\n if (buffer.length === 0) return -1;\n\n // Normalize byteOffset\n if (typeof byteOffset === \"string\") {\n encoding = byteOffset;\n byteOffset = 0;\n } else if (byteOffset > 0x7fffffff) {\n byteOffset = 0x7fffffff;\n } else if (byteOffset < -0x80000000) {\n byteOffset = -0x80000000;\n }\n byteOffset = +byteOffset; // Coerce to Number.\n if (numberIsNaN(byteOffset)) {\n // byteOffset: it it's undefined, null, NaN, \"foo\", etc, search whole buffer\n byteOffset = dir ? 0 : buffer.length - 1;\n }\n\n // Normalize byteOffset: negative offsets start from the end of the buffer\n if (byteOffset < 0) byteOffset = buffer.length + byteOffset;\n if (byteOffset >= buffer.length) {\n if (dir) return -1;\n else byteOffset = buffer.length - 1;\n } else if (byteOffset < 0) {\n if (dir) byteOffset = 0;\n else return -1;\n }\n\n // Normalize val\n if (typeof val === \"string\") {\n val = Buffer.from(val, encoding);\n }\n\n // Finally, search either indexOf (if dir is true) or lastIndexOf\n if (Buffer.isBuffer(val)) {\n // Special case: looking for empty string/buffer always fails\n if (val.length === 0) {\n return -1;\n }\n return arrayIndexOf(buffer, val, byteOffset, encoding, dir);\n } else if (typeof val === \"number\") {\n val = val & 0xff; // Search for a byte value [0-255]\n if (typeof Uint8Array.prototype.indexOf === \"function\") {\n if (dir) {\n return Uint8Array.prototype.indexOf.call(\n buffer,\n val,\n byteOffset\n );\n } else {\n return Uint8Array.prototype.lastIndexOf.call(\n buffer,\n val,\n byteOffset\n );\n }\n }\n return arrayIndexOf(buffer, [val], byteOffset, encoding, dir);\n }\n\n throw new TypeError(\"val must be string, number or Buffer\");\n }\n\n function arrayIndexOf(arr, val, byteOffset, encoding, dir) {\n var indexSize = 1;\n var arrLength = arr.length;\n var valLength = val.length;\n\n if (encoding !== undefined) {\n encoding = String(encoding).toLowerCase();\n if (\n encoding === \"ucs2\" ||\n encoding === \"ucs-2\" ||\n encoding === \"utf16le\" ||\n encoding === \"utf-16le\"\n ) {\n if (arr.length < 2 || val.length < 2) {\n return -1;\n }\n indexSize = 2;\n arrLength /= 2;\n valLength /= 2;\n byteOffset /= 2;\n }\n }\n\n function read(buf, i) {\n if (indexSize === 1) {\n return buf[i];\n } else {\n return buf.readUInt16BE(i * indexSize);\n }\n }\n\n var i;\n if (dir) {\n var foundIndex = -1;\n for (i = byteOffset; i < arrLength; i++) {\n if (\n read(arr, i) ===\n read(val, foundIndex === -1 ? 0 : i - foundIndex)\n ) {\n if (foundIndex === -1) foundIndex = i;\n if (i - foundIndex + 1 === valLength)\n return foundIndex * indexSize;\n } else {\n if (foundIndex !== -1) i -= i - foundIndex;\n foundIndex = -1;\n }\n }\n } else {\n if (byteOffset + valLength > arrLength)\n byteOffset = arrLength - valLength;\n for (i = byteOffset; i >= 0; i--) {\n var found = true;\n for (var j = 0; j < valLength; j++) {\n if (read(arr, i + j) !== read(val, j)) {\n found = false;\n break;\n }\n }\n if (found) return i;\n }\n }\n\n return -1;\n }\n\n Buffer.prototype.includes = function includes(\n val,\n byteOffset,\n encoding\n ) {\n return this.indexOf(val, byteOffset, encoding) !== -1;\n };\n\n Buffer.prototype.indexOf = function indexOf(\n val,\n byteOffset,\n encoding\n ) {\n return bidirectionalIndexOf(this, val, byteOffset, encoding, true);\n };\n\n Buffer.prototype.lastIndexOf = function lastIndexOf(\n val,\n byteOffset,\n encoding\n ) {\n return bidirectionalIndexOf(this, val, byteOffset, encoding, false);\n };\n\n function hexWrite(buf, string, offset, length) {\n offset = Number(offset) || 0;\n var remaining = buf.length - offset;\n if (!length) {\n length = remaining;\n } else {\n length = Number(length);\n if (length > remaining) {\n length = remaining;\n }\n }\n\n var strLen = string.length;\n\n if (length > strLen / 2) {\n length = strLen / 2;\n }\n for (var i = 0; i < length; ++i) {\n var parsed = parseInt(string.substr(i * 2, 2), 16);\n if (numberIsNaN(parsed)) return i;\n buf[offset + i] = parsed;\n }\n return i;\n }\n\n function utf8Write(buf, string, offset, length) {\n return blitBuffer(\n utf8ToBytes(string, buf.length - offset),\n buf,\n offset,\n length\n );\n }\n\n function asciiWrite(buf, string, offset, length) {\n return blitBuffer(asciiToBytes(string), buf, offset, length);\n }\n\n function latin1Write(buf, string, offset, length) {\n return asciiWrite(buf, string, offset, length);\n }\n\n function base64Write(buf, string, offset, length) {\n return blitBuffer(base64ToBytes(string), buf, offset, length);\n }\n\n function ucs2Write(buf, string, offset, length) {\n return blitBuffer(\n utf16leToBytes(string, buf.length - offset),\n buf,\n offset,\n length\n );\n }\n\n Buffer.prototype.write = function write(\n string,\n offset,\n length,\n encoding\n ) {\n // Buffer#write(string)\n if (offset === undefined) {\n encoding = \"utf8\";\n length = this.length;\n offset = 0;\n // Buffer#write(string, encoding)\n } else if (length === undefined && typeof offset === \"string\") {\n encoding = offset;\n length = this.length;\n offset = 0;\n // Buffer#write(string, offset[, length][, encoding])\n } else if (isFinite(offset)) {\n offset = offset >>> 0;\n if (isFinite(length)) {\n length = length >>> 0;\n if (encoding === undefined) encoding = \"utf8\";\n } else {\n encoding = length;\n length = undefined;\n }\n } else {\n throw new Error(\n \"Buffer.write(string, encoding, offset[, length]) is no longer supported\"\n );\n }\n\n var remaining = this.length - offset;\n if (length === undefined || length > remaining) length = remaining;\n\n if (\n (string.length > 0 && (length < 0 || offset < 0)) ||\n offset > this.length\n ) {\n throw new RangeError(\"Attempt to write outside buffer bounds\");\n }\n\n if (!encoding) encoding = \"utf8\";\n\n var loweredCase = false;\n for (;;) {\n switch (encoding) {\n case \"hex\":\n return hexWrite(this, string, offset, length);\n\n case \"utf8\":\n case \"utf-8\":\n return utf8Write(this, string, offset, length);\n\n case \"ascii\":\n return asciiWrite(this, string, offset, length);\n\n case \"latin1\":\n case \"binary\":\n return latin1Write(this, string, offset, length);\n\n case \"base64\":\n // Warning: maxLength not taken into account in base64Write\n return base64Write(this, string, offset, length);\n\n case \"ucs2\":\n case \"ucs-2\":\n case \"utf16le\":\n case \"utf-16le\":\n return ucs2Write(this, string, offset, length);\n\n default:\n if (loweredCase)\n throw new TypeError(\"Unknown encoding: \" + encoding);\n encoding = (\"\" + encoding).toLowerCase();\n loweredCase = true;\n }\n }\n };\n\n Buffer.prototype.toJSON = function toJSON() {\n return {\n type: \"Buffer\",\n data: Array.prototype.slice.call(this._arr || this, 0)\n };\n };\n\n function base64Slice(buf, start, end) {\n if (start === 0 && end === buf.length) {\n return base64.fromByteArray(buf);\n } else {\n return base64.fromByteArray(buf.slice(start, end));\n }\n }\n\n function utf8Slice(buf, start, end) {\n end = Math.min(buf.length, end);\n var res = [];\n\n var i = start;\n while (i < end) {\n var firstByte = buf[i];\n var codePoint = null;\n var bytesPerSequence =\n firstByte > 0xef\n ? 4\n : firstByte > 0xdf\n ? 3\n : firstByte > 0xbf\n ? 2\n : 1;\n\n if (i + bytesPerSequence <= end) {\n var secondByte, thirdByte, fourthByte, tempCodePoint;\n\n switch (bytesPerSequence) {\n case 1:\n if (firstByte < 0x80) {\n codePoint = firstByte;\n }\n break;\n case 2:\n secondByte = buf[i + 1];\n if ((secondByte & 0xc0) === 0x80) {\n tempCodePoint =\n ((firstByte & 0x1f) << 0x6) | (secondByte & 0x3f);\n if (tempCodePoint > 0x7f) {\n codePoint = tempCodePoint;\n }\n }\n break;\n case 3:\n secondByte = buf[i + 1];\n thirdByte = buf[i + 2];\n if (\n (secondByte & 0xc0) === 0x80 &&\n (thirdByte & 0xc0) === 0x80\n ) {\n tempCodePoint =\n ((firstByte & 0xf) << 0xc) |\n ((secondByte & 0x3f) << 0x6) |\n (thirdByte & 0x3f);\n if (\n tempCodePoint > 0x7ff &&\n (tempCodePoint < 0xd800 || tempCodePoint > 0xdfff)\n ) {\n codePoint = tempCodePoint;\n }\n }\n break;\n case 4:\n secondByte = buf[i + 1];\n thirdByte = buf[i + 2];\n fourthByte = buf[i + 3];\n if (\n (secondByte & 0xc0) === 0x80 &&\n (thirdByte & 0xc0) === 0x80 &&\n (fourthByte & 0xc0) === 0x80\n ) {\n tempCodePoint =\n ((firstByte & 0xf) << 0x12) |\n ((secondByte & 0x3f) << 0xc) |\n ((thirdByte & 0x3f) << 0x6) |\n (fourthByte & 0x3f);\n if (tempCodePoint > 0xffff && tempCodePoint < 0x110000) {\n codePoint = tempCodePoint;\n }\n }\n }\n }\n\n if (codePoint === null) {\n // we did not generate a valid codePoint so insert a\n // replacement char (U+FFFD) and advance only 1 byte\n codePoint = 0xfffd;\n bytesPerSequence = 1;\n } else if (codePoint > 0xffff) {\n // encode to utf16 (surrogate pair dance)\n codePoint -= 0x10000;\n res.push(((codePoint >>> 10) & 0x3ff) | 0xd800);\n codePoint = 0xdc00 | (codePoint & 0x3ff);\n }\n\n res.push(codePoint);\n i += bytesPerSequence;\n }\n\n return decodeCodePointsArray(res);\n }\n\n // Based on http://stackoverflow.com/a/22747272/680742, the browser with\n // the lowest limit is Chrome, with 0x10000 args.\n // We go 1 magnitude less, for safety\n var MAX_ARGUMENTS_LENGTH = 0x1000;\n\n function decodeCodePointsArray(codePoints) {\n var len = codePoints.length;\n if (len <= MAX_ARGUMENTS_LENGTH) {\n return String.fromCharCode.apply(String, codePoints); // avoid extra slice()\n }\n\n // Decode in chunks to avoid \"call stack size exceeded\".\n var res = \"\";\n var i = 0;\n while (i < len) {\n res += String.fromCharCode.apply(\n String,\n codePoints.slice(i, (i += MAX_ARGUMENTS_LENGTH))\n );\n }\n return res;\n }\n\n function asciiSlice(buf, start, end) {\n var ret = \"\";\n end = Math.min(buf.length, end);\n\n for (var i = start; i < end; ++i) {\n ret += String.fromCharCode(buf[i] & 0x7f);\n }\n return ret;\n }\n\n function latin1Slice(buf, start, end) {\n var ret = \"\";\n end = Math.min(buf.length, end);\n\n for (var i = start; i < end; ++i) {\n ret += String.fromCharCode(buf[i]);\n }\n return ret;\n }\n\n function hexSlice(buf, start, end) {\n var len = buf.length;\n\n if (!start || start < 0) start = 0;\n if (!end || end < 0 || end > len) end = len;\n\n var out = \"\";\n for (var i = start; i < end; ++i) {\n out += toHex(buf[i]);\n }\n return out;\n }\n\n function utf16leSlice(buf, start, end) {\n var bytes = buf.slice(start, end);\n var res = \"\";\n for (var i = 0; i < bytes.length; i += 2) {\n res += String.fromCharCode(bytes[i] + bytes[i + 1] * 256);\n }\n return res;\n }\n\n Buffer.prototype.slice = function slice(start, end) {\n var len = this.length;\n start = ~~start;\n end = end === undefined ? len : ~~end;\n\n if (start < 0) {\n start += len;\n if (start < 0) start = 0;\n } else if (start > len) {\n start = len;\n }\n\n if (end < 0) {\n end += len;\n if (end < 0) end = 0;\n } else if (end > len) {\n end = len;\n }\n\n if (end < start) end = start;\n\n var newBuf = this.subarray(start, end);\n // Return an augmented `Uint8Array` instance\n newBuf.__proto__ = Buffer.prototype;\n return newBuf;\n };\n\n /*\n * Need to make sure that buffer isn't trying to write out of bounds.\n */\n function checkOffset(offset, ext, length) {\n if (offset % 1 !== 0 || offset < 0)\n throw new RangeError(\"offset is not uint\");\n if (offset + ext > length)\n throw new RangeError(\"Trying to access beyond buffer length\");\n }\n\n Buffer.prototype.readUIntLE = function readUIntLE(\n offset,\n byteLength,\n noAssert\n ) {\n offset = offset >>> 0;\n byteLength = byteLength >>> 0;\n if (!noAssert) checkOffset(offset, byteLength, this.length);\n\n var val = this[offset];\n var mul = 1;\n var i = 0;\n while (++i < byteLength && (mul *= 0x100)) {\n val += this[offset + i] * mul;\n }\n\n return val;\n };\n\n Buffer.prototype.readUIntBE = function readUIntBE(\n offset,\n byteLength,\n noAssert\n ) {\n offset = offset >>> 0;\n byteLength = byteLength >>> 0;\n if (!noAssert) {\n checkOffset(offset, byteLength, this.length);\n }\n\n var val = this[offset + --byteLength];\n var mul = 1;\n while (byteLength > 0 && (mul *= 0x100)) {\n val += this[offset + --byteLength] * mul;\n }\n\n return val;\n };\n\n Buffer.prototype.readUInt8 = function readUInt8(offset, noAssert) {\n offset = offset >>> 0;\n if (!noAssert) checkOffset(offset, 1, this.length);\n return this[offset];\n };\n\n Buffer.prototype.readUInt16LE = function readUInt16LE(\n offset,\n noAssert\n ) {\n offset = offset >>> 0;\n if (!noAssert) checkOffset(offset, 2, this.length);\n return this[offset] | (this[offset + 1] << 8);\n };\n\n Buffer.prototype.readUInt16BE = function readUInt16BE(\n offset,\n noAssert\n ) {\n offset = offset >>> 0;\n if (!noAssert) checkOffset(offset, 2, this.length);\n return (this[offset] << 8) | this[offset + 1];\n };\n\n Buffer.prototype.readUInt32LE = function readUInt32LE(\n offset,\n noAssert\n ) {\n offset = offset >>> 0;\n if (!noAssert) checkOffset(offset, 4, this.length);\n\n return (\n (this[offset] |\n (this[offset + 1] << 8) |\n (this[offset + 2] << 16)) +\n this[offset + 3] * 0x1000000\n );\n };\n\n Buffer.prototype.readUInt32BE = function readUInt32BE(\n offset,\n noAssert\n ) {\n offset = offset >>> 0;\n if (!noAssert) checkOffset(offset, 4, this.length);\n\n return (\n this[offset] * 0x1000000 +\n ((this[offset + 1] << 16) |\n (this[offset + 2] << 8) |\n this[offset + 3])\n );\n };\n\n Buffer.prototype.readIntLE = function readIntLE(\n offset,\n byteLength,\n noAssert\n ) {\n offset = offset >>> 0;\n byteLength = byteLength >>> 0;\n if (!noAssert) checkOffset(offset, byteLength, this.length);\n\n var val = this[offset];\n var mul = 1;\n var i = 0;\n while (++i < byteLength && (mul *= 0x100)) {\n val += this[offset + i] * mul;\n }\n mul *= 0x80;\n\n if (val >= mul) val -= Math.pow(2, 8 * byteLength);\n\n return val;\n };\n\n Buffer.prototype.readIntBE = function readIntBE(\n offset,\n byteLength,\n noAssert\n ) {\n offset = offset >>> 0;\n byteLength = byteLength >>> 0;\n if (!noAssert) checkOffset(offset, byteLength, this.length);\n\n var i = byteLength;\n var mul = 1;\n var val = this[offset + --i];\n while (i > 0 && (mul *= 0x100)) {\n val += this[offset + --i] * mul;\n }\n mul *= 0x80;\n\n if (val >= mul) val -= Math.pow(2, 8 * byteLength);\n\n return val;\n };\n\n Buffer.prototype.readInt8 = function readInt8(offset, noAssert) {\n offset = offset >>> 0;\n if (!noAssert) checkOffset(offset, 1, this.length);\n if (!(this[offset] & 0x80)) return this[offset];\n return (0xff - this[offset] + 1) * -1;\n };\n\n Buffer.prototype.readInt16LE = function readInt16LE(\n offset,\n noAssert\n ) {\n offset = offset >>> 0;\n if (!noAssert) checkOffset(offset, 2, this.length);\n var val = this[offset] | (this[offset + 1] << 8);\n return val & 0x8000 ? val | 0xffff0000 : val;\n };\n\n Buffer.prototype.readInt16BE = function readInt16BE(\n offset,\n noAssert\n ) {\n offset = offset >>> 0;\n if (!noAssert) checkOffset(offset, 2, this.length);\n var val = this[offset + 1] | (this[offset] << 8);\n return val & 0x8000 ? val | 0xffff0000 : val;\n };\n\n Buffer.prototype.readInt32LE = function readInt32LE(\n offset,\n noAssert\n ) {\n offset = offset >>> 0;\n if (!noAssert) checkOffset(offset, 4, this.length);\n\n return (\n this[offset] |\n (this[offset + 1] << 8) |\n (this[offset + 2] << 16) |\n (this[offset + 3] << 24)\n );\n };\n\n Buffer.prototype.readInt32BE = function readInt32BE(\n offset,\n noAssert\n ) {\n offset = offset >>> 0;\n if (!noAssert) checkOffset(offset, 4, this.length);\n\n return (\n (this[offset] << 24) |\n (this[offset + 1] << 16) |\n (this[offset + 2] << 8) |\n this[offset + 3]\n );\n };\n\n Buffer.prototype.readFloatLE = function readFloatLE(\n offset,\n noAssert\n ) {\n offset = offset >>> 0;\n if (!noAssert) checkOffset(offset, 4, this.length);\n return ieee754.read(this, offset, true, 23, 4);\n };\n\n Buffer.prototype.readFloatBE = function readFloatBE(\n offset,\n noAssert\n ) {\n offset = offset >>> 0;\n if (!noAssert) checkOffset(offset, 4, this.length);\n return ieee754.read(this, offset, false, 23, 4);\n };\n\n Buffer.prototype.readDoubleLE = function readDoubleLE(\n offset,\n noAssert\n ) {\n offset = offset >>> 0;\n if (!noAssert) checkOffset(offset, 8, this.length);\n return ieee754.read(this, offset, true, 52, 8);\n };\n\n Buffer.prototype.readDoubleBE = function readDoubleBE(\n offset,\n noAssert\n ) {\n offset = offset >>> 0;\n if (!noAssert) checkOffset(offset, 8, this.length);\n return ieee754.read(this, offset, false, 52, 8);\n };\n\n function checkInt(buf, value, offset, ext, max, min) {\n if (!Buffer.isBuffer(buf))\n throw new TypeError(\n '\"buffer\" argument must be a Buffer instance'\n );\n if (value > max || value < min)\n throw new RangeError('\"value\" argument is out of bounds');\n if (offset + ext > buf.length)\n throw new RangeError(\"Index out of range\");\n }\n\n Buffer.prototype.writeUIntLE = function writeUIntLE(\n value,\n offset,\n byteLength,\n noAssert\n ) {\n value = +value;\n offset = offset >>> 0;\n byteLength = byteLength >>> 0;\n if (!noAssert) {\n var maxBytes = Math.pow(2, 8 * byteLength) - 1;\n checkInt(this, value, offset, byteLength, maxBytes, 0);\n }\n\n var mul = 1;\n var i = 0;\n this[offset] = value & 0xff;\n while (++i < byteLength && (mul *= 0x100)) {\n this[offset + i] = (value / mul) & 0xff;\n }\n\n return offset + byteLength;\n };\n\n Buffer.prototype.writeUIntBE = function writeUIntBE(\n value,\n offset,\n byteLength,\n noAssert\n ) {\n value = +value;\n offset = offset >>> 0;\n byteLength = byteLength >>> 0;\n if (!noAssert) {\n var maxBytes = Math.pow(2, 8 * byteLength) - 1;\n checkInt(this, value, offset, byteLength, maxBytes, 0);\n }\n\n var i = byteLength - 1;\n var mul = 1;\n this[offset + i] = value & 0xff;\n while (--i >= 0 && (mul *= 0x100)) {\n this[offset + i] = (value / mul) & 0xff;\n }\n\n return offset + byteLength;\n };\n\n Buffer.prototype.writeUInt8 = function writeUInt8(\n value,\n offset,\n noAssert\n ) {\n value = +value;\n offset = offset >>> 0;\n if (!noAssert) checkInt(this, value, offset, 1, 0xff, 0);\n this[offset] = value & 0xff;\n return offset + 1;\n };\n\n Buffer.prototype.writeUInt16LE = function writeUInt16LE(\n value,\n offset,\n noAssert\n ) {\n value = +value;\n offset = offset >>> 0;\n if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0);\n this[offset] = value & 0xff;\n this[offset + 1] = value >>> 8;\n return offset + 2;\n };\n\n Buffer.prototype.writeUInt16BE = function writeUInt16BE(\n value,\n offset,\n noAssert\n ) {\n value = +value;\n offset = offset >>> 0;\n if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0);\n this[offset] = value >>> 8;\n this[offset + 1] = value & 0xff;\n return offset + 2;\n };\n\n Buffer.prototype.writeUInt32LE = function writeUInt32LE(\n value,\n offset,\n noAssert\n ) {\n value = +value;\n offset = offset >>> 0;\n if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0);\n this[offset + 3] = value >>> 24;\n this[offset + 2] = value >>> 16;\n this[offset + 1] = value >>> 8;\n this[offset] = value & 0xff;\n return offset + 4;\n };\n\n Buffer.prototype.writeUInt32BE = function writeUInt32BE(\n value,\n offset,\n noAssert\n ) {\n value = +value;\n offset = offset >>> 0;\n if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0);\n this[offset] = value >>> 24;\n this[offset + 1] = value >>> 16;\n this[offset + 2] = value >>> 8;\n this[offset + 3] = value & 0xff;\n return offset + 4;\n };\n\n Buffer.prototype.writeIntLE = function writeIntLE(\n value,\n offset,\n byteLength,\n noAssert\n ) {\n value = +value;\n offset = offset >>> 0;\n if (!noAssert) {\n var limit = Math.pow(2, 8 * byteLength - 1);\n\n checkInt(this, value, offset, byteLength, limit - 1, -limit);\n }\n\n var i = 0;\n var mul = 1;\n var sub = 0;\n this[offset] = value & 0xff;\n while (++i < byteLength && (mul *= 0x100)) {\n if (value < 0 && sub === 0 && this[offset + i - 1] !== 0) {\n sub = 1;\n }\n this[offset + i] = (((value / mul) >> 0) - sub) & 0xff;\n }\n\n return offset + byteLength;\n };\n\n Buffer.prototype.writeIntBE = function writeIntBE(\n value,\n offset,\n byteLength,\n noAssert\n ) {\n value = +value;\n offset = offset >>> 0;\n if (!noAssert) {\n var limit = Math.pow(2, 8 * byteLength - 1);\n\n checkInt(this, value, offset, byteLength, limit - 1, -limit);\n }\n\n var i = byteLength - 1;\n var mul = 1;\n var sub = 0;\n this[offset + i] = value & 0xff;\n while (--i >= 0 && (mul *= 0x100)) {\n if (value < 0 && sub === 0 && this[offset + i + 1] !== 0) {\n sub = 1;\n }\n this[offset + i] = (((value / mul) >> 0) - sub) & 0xff;\n }\n\n return offset + byteLength;\n };\n\n Buffer.prototype.writeInt8 = function writeInt8(\n value,\n offset,\n noAssert\n ) {\n value = +value;\n offset = offset >>> 0;\n if (!noAssert) checkInt(this, value, offset, 1, 0x7f, -0x80);\n if (value < 0) value = 0xff + value + 1;\n this[offset] = value & 0xff;\n return offset + 1;\n };\n\n Buffer.prototype.writeInt16LE = function writeInt16LE(\n value,\n offset,\n noAssert\n ) {\n value = +value;\n offset = offset >>> 0;\n if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000);\n this[offset] = value & 0xff;\n this[offset + 1] = value >>> 8;\n return offset + 2;\n };\n\n Buffer.prototype.writeInt16BE = function writeInt16BE(\n value,\n offset,\n noAssert\n ) {\n value = +value;\n offset = offset >>> 0;\n if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000);\n this[offset] = value >>> 8;\n this[offset + 1] = value & 0xff;\n return offset + 2;\n };\n\n Buffer.prototype.writeInt32LE = function writeInt32LE(\n value,\n offset,\n noAssert\n ) {\n value = +value;\n offset = offset >>> 0;\n if (!noAssert)\n checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000);\n this[offset] = value & 0xff;\n this[offset + 1] = value >>> 8;\n this[offset + 2] = value >>> 16;\n this[offset + 3] = value >>> 24;\n return offset + 4;\n };\n\n Buffer.prototype.writeInt32BE = function writeInt32BE(\n value,\n offset,\n noAssert\n ) {\n value = +value;\n offset = offset >>> 0;\n if (!noAssert)\n checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000);\n if (value < 0) value = 0xffffffff + value + 1;\n this[offset] = value >>> 24;\n this[offset + 1] = value >>> 16;\n this[offset + 2] = value >>> 8;\n this[offset + 3] = value & 0xff;\n return offset + 4;\n };\n\n function checkIEEE754(buf, value, offset, ext, max, min) {\n if (offset + ext > buf.length)\n throw new RangeError(\"Index out of range\");\n if (offset < 0) throw new RangeError(\"Index out of range\");\n }\n\n function writeFloat(buf, value, offset, littleEndian, noAssert) {\n value = +value;\n offset = offset >>> 0;\n if (!noAssert) {\n checkIEEE754(\n buf,\n value,\n offset,\n 4,\n 3.4028234663852886e38,\n -3.4028234663852886e38\n );\n }\n ieee754.write(buf, value, offset, littleEndian, 23, 4);\n return offset + 4;\n }\n\n Buffer.prototype.writeFloatLE = function writeFloatLE(\n value,\n offset,\n noAssert\n ) {\n return writeFloat(this, value, offset, true, noAssert);\n };\n\n Buffer.prototype.writeFloatBE = function writeFloatBE(\n value,\n offset,\n noAssert\n ) {\n return writeFloat(this, value, offset, false, noAssert);\n };\n\n function writeDouble(buf, value, offset, littleEndian, noAssert) {\n value = +value;\n offset = offset >>> 0;\n if (!noAssert) {\n checkIEEE754(\n buf,\n value,\n offset,\n 8,\n 1.7976931348623157e308,\n -1.7976931348623157e308\n );\n }\n ieee754.write(buf, value, offset, littleEndian, 52, 8);\n return offset + 8;\n }\n\n Buffer.prototype.writeDoubleLE = function writeDoubleLE(\n value,\n offset,\n noAssert\n ) {\n return writeDouble(this, value, offset, true, noAssert);\n };\n\n Buffer.prototype.writeDoubleBE = function writeDoubleBE(\n value,\n offset,\n noAssert\n ) {\n return writeDouble(this, value, offset, false, noAssert);\n };\n\n // copy(targetBuffer, targetStart=0, sourceStart=0, sourceEnd=buffer.length)\n Buffer.prototype.copy = function copy(\n target,\n targetStart,\n start,\n end\n ) {\n if (!Buffer.isBuffer(target))\n throw new TypeError(\"argument should be a Buffer\");\n if (!start) start = 0;\n if (!end && end !== 0) end = this.length;\n if (targetStart >= target.length) targetStart = target.length;\n if (!targetStart) targetStart = 0;\n if (end > 0 && end < start) end = start;\n\n // Copy 0 bytes; we're done\n if (end === start) return 0;\n if (target.length === 0 || this.length === 0) return 0;\n\n // Fatal error conditions\n if (targetStart < 0) {\n throw new RangeError(\"targetStart out of bounds\");\n }\n if (start < 0 || start >= this.length)\n throw new RangeError(\"Index out of range\");\n if (end < 0) throw new RangeError(\"sourceEnd out of bounds\");\n\n // Are we oob?\n if (end > this.length) end = this.length;\n if (target.length - targetStart < end - start) {\n end = target.length - targetStart + start;\n }\n\n var len = end - start;\n\n if (\n this === target &&\n typeof Uint8Array.prototype.copyWithin === \"function\"\n ) {\n // Use built-in when available, missing from IE11\n this.copyWithin(targetStart, start, end);\n } else if (\n this === target &&\n start < targetStart &&\n targetStart < end\n ) {\n // descending copy from end\n for (var i = len - 1; i >= 0; --i) {\n target[i + targetStart] = this[i + start];\n }\n } else {\n Uint8Array.prototype.set.call(\n target,\n this.subarray(start, end),\n targetStart\n );\n }\n\n return len;\n };\n\n // Usage:\n // buffer.fill(number[, offset[, end]])\n // buffer.fill(buffer[, offset[, end]])\n // buffer.fill(string[, offset[, end]][, encoding])\n Buffer.prototype.fill = function fill(val, start, end, encoding) {\n // Handle string cases:\n if (typeof val === \"string\") {\n if (typeof start === \"string\") {\n encoding = start;\n start = 0;\n end = this.length;\n } else if (typeof end === \"string\") {\n encoding = end;\n end = this.length;\n }\n if (encoding !== undefined && typeof encoding !== \"string\") {\n throw new TypeError(\"encoding must be a string\");\n }\n if (\n typeof encoding === \"string\" &&\n !Buffer.isEncoding(encoding)\n ) {\n throw new TypeError(\"Unknown encoding: \" + encoding);\n }\n if (val.length === 1) {\n var code = val.charCodeAt(0);\n if (\n (encoding === \"utf8\" && code < 128) ||\n encoding === \"latin1\"\n ) {\n // Fast path: If `val` fits into a single byte, use that numeric value.\n val = code;\n }\n }\n } else if (typeof val === \"number\") {\n val = val & 255;\n }\n\n // Invalid ranges are not set to a default, so can range check early.\n if (start < 0 || this.length < start || this.length < end) {\n throw new RangeError(\"Out of range index\");\n }\n\n if (end <= start) {\n return this;\n }\n\n start = start >>> 0;\n end = end === undefined ? this.length : end >>> 0;\n\n if (!val) val = 0;\n\n var i;\n if (typeof val === \"number\") {\n for (i = start; i < end; ++i) {\n this[i] = val;\n }\n } else {\n var bytes = Buffer.isBuffer(val)\n ? val\n : Buffer.from(val, encoding);\n var len = bytes.length;\n if (len === 0) {\n throw new TypeError(\n 'The value \"' + val + '\" is invalid for argument \"value\"'\n );\n }\n for (i = 0; i < end - start; ++i) {\n this[i + start] = bytes[i % len];\n }\n }\n\n return this;\n };\n\n // HELPER FUNCTIONS\n // ================\n\n var INVALID_BASE64_RE = /[^+/0-9A-Za-z-_]/g;\n\n function base64clean(str) {\n // Node takes equal signs as end of the Base64 encoding\n str = str.split(\"=\")[0];\n // Node strips out invalid characters like \\n and \\t from the string, base64-js does not\n str = str.trim().replace(INVALID_BASE64_RE, \"\");\n // Node converts strings with length < 2 to ''\n if (str.length < 2) return \"\";\n // Node allows for non-padded base64 strings (missing trailing ===), base64-js does not\n while (str.length % 4 !== 0) {\n str = str + \"=\";\n }\n return str;\n }\n\n function toHex(n) {\n if (n < 16) return \"0\" + n.toString(16);\n return n.toString(16);\n }\n\n function utf8ToBytes(string, units) {\n units = units || Infinity;\n var codePoint;\n var length = string.length;\n var leadSurrogate = null;\n var bytes = [];\n\n for (var i = 0; i < length; ++i) {\n codePoint = string.charCodeAt(i);\n\n // is surrogate component\n if (codePoint > 0xd7ff && codePoint < 0xe000) {\n // last char was a lead\n if (!leadSurrogate) {\n // no lead yet\n if (codePoint > 0xdbff) {\n // unexpected trail\n if ((units -= 3) > -1) bytes.push(0xef, 0xbf, 0xbd);\n continue;\n } else if (i + 1 === length) {\n // unpaired lead\n if ((units -= 3) > -1) bytes.push(0xef, 0xbf, 0xbd);\n continue;\n }\n\n // valid lead\n leadSurrogate = codePoint;\n\n continue;\n }\n\n // 2 leads in a row\n if (codePoint < 0xdc00) {\n if ((units -= 3) > -1) bytes.push(0xef, 0xbf, 0xbd);\n leadSurrogate = codePoint;\n continue;\n }\n\n // valid surrogate pair\n codePoint =\n (((leadSurrogate - 0xd800) << 10) | (codePoint - 0xdc00)) +\n 0x10000;\n } else if (leadSurrogate) {\n // valid bmp char, but last char was a lead\n if ((units -= 3) > -1) bytes.push(0xef, 0xbf, 0xbd);\n }\n\n leadSurrogate = null;\n\n // encode utf8\n if (codePoint < 0x80) {\n if ((units -= 1) < 0) break;\n bytes.push(codePoint);\n } else if (codePoint < 0x800) {\n if ((units -= 2) < 0) break;\n bytes.push(\n (codePoint >> 0x6) | 0xc0,\n (codePoint & 0x3f) | 0x80\n );\n } else if (codePoint < 0x10000) {\n if ((units -= 3) < 0) break;\n bytes.push(\n (codePoint >> 0xc) | 0xe0,\n ((codePoint >> 0x6) & 0x3f) | 0x80,\n (codePoint & 0x3f) | 0x80\n );\n } else if (codePoint < 0x110000) {\n if ((units -= 4) < 0) break;\n bytes.push(\n (codePoint >> 0x12) | 0xf0,\n ((codePoint >> 0xc) & 0x3f) | 0x80,\n ((codePoint >> 0x6) & 0x3f) | 0x80,\n (codePoint & 0x3f) | 0x80\n );\n } else {\n throw new Error(\"Invalid code point\");\n }\n }\n\n return bytes;\n }\n\n function asciiToBytes(str) {\n var byteArray = [];\n for (var i = 0; i < str.length; ++i) {\n // Node's code seems to be doing this and not & 0x7F..\n byteArray.push(str.charCodeAt(i) & 0xff);\n }\n return byteArray;\n }\n\n function utf16leToBytes(str, units) {\n var c, hi, lo;\n var byteArray = [];\n for (var i = 0; i < str.length; ++i) {\n if ((units -= 2) < 0) break;\n\n c = str.charCodeAt(i);\n hi = c >> 8;\n lo = c % 256;\n byteArray.push(lo);\n byteArray.push(hi);\n }\n\n return byteArray;\n }\n\n function base64ToBytes(str) {\n return base64.toByteArray(base64clean(str));\n }\n\n function blitBuffer(src, dst, offset, length) {\n for (var i = 0; i < length; ++i) {\n if (i + offset >= dst.length || i >= src.length) break;\n dst[i + offset] = src[i];\n }\n return i;\n }\n\n // ArrayBuffer or Uint8Array objects from other contexts (i.e. iframes) do not pass\n // the `instanceof` check but they should be treated as of that type.\n // See: https://github.com/feross/buffer/issues/166\n function isInstance(obj, type) {\n return (\n obj instanceof type ||\n (obj != null &&\n obj.constructor != null &&\n obj.constructor.name != null &&\n obj.constructor.name === type.name)\n );\n }\n function numberIsNaN(obj) {\n // For IE11 support\n return obj !== obj; // eslint-disable-line no-self-compare\n }\n }.call(this, require(\"buffer\").Buffer));\n },\n { \"base64-js\": 1, buffer: 4, ieee754: 105 }\n ],\n 5: [\n function(require, module, exports) {\n module.exports = {\n \"100\": \"Continue\",\n \"101\": \"Switching Protocols\",\n \"102\": \"Processing\",\n \"200\": \"OK\",\n \"201\": \"Created\",\n \"202\": \"Accepted\",\n \"203\": \"Non-Authoritative Information\",\n \"204\": \"No Content\",\n \"205\": \"Reset Content\",\n \"206\": \"Partial Content\",\n \"207\": \"Multi-Status\",\n \"208\": \"Already Reported\",\n \"226\": \"IM Used\",\n \"300\": \"Multiple Choices\",\n \"301\": \"Moved Permanently\",\n \"302\": \"Found\",\n \"303\": \"See Other\",\n \"304\": \"Not Modified\",\n \"305\": \"Use Proxy\",\n \"307\": \"Temporary Redirect\",\n \"308\": \"Permanent Redirect\",\n \"400\": \"Bad Request\",\n \"401\": \"Unauthorized\",\n \"402\": \"Payment Required\",\n \"403\": \"Forbidden\",\n \"404\": \"Not Found\",\n \"405\": \"Method Not Allowed\",\n \"406\": \"Not Acceptable\",\n \"407\": \"Proxy Authentication Required\",\n \"408\": \"Request Timeout\",\n \"409\": \"Conflict\",\n \"410\": \"Gone\",\n \"411\": \"Length Required\",\n \"412\": \"Precondition Failed\",\n \"413\": \"Payload Too Large\",\n \"414\": \"URI Too Long\",\n \"415\": \"Unsupported Media Type\",\n \"416\": \"Range Not Satisfiable\",\n \"417\": \"Expectation Failed\",\n \"418\": \"I'm a teapot\",\n \"421\": \"Misdirected Request\",\n \"422\": \"Unprocessable Entity\",\n \"423\": \"Locked\",\n \"424\": \"Failed Dependency\",\n \"425\": \"Unordered Collection\",\n \"426\": \"Upgrade Required\",\n \"428\": \"Precondition Required\",\n \"429\": \"Too Many Requests\",\n \"431\": \"Request Header Fields Too Large\",\n \"451\": \"Unavailable For Legal Reasons\",\n \"500\": \"Internal Server Error\",\n \"501\": \"Not Implemented\",\n \"502\": \"Bad Gateway\",\n \"503\": \"Service Unavailable\",\n \"504\": \"Gateway Timeout\",\n \"505\": \"HTTP Version Not Supported\",\n \"506\": \"Variant Also Negotiates\",\n \"507\": \"Insufficient Storage\",\n \"508\": \"Loop Detected\",\n \"509\": \"Bandwidth Limit Exceeded\",\n \"510\": \"Not Extended\",\n \"511\": \"Network Authentication Required\"\n };\n },\n {}\n ],\n 6: [\n function(require, module, exports) {\n module.exports = require(\"./lib/clean\");\n },\n { \"./lib/clean\": 7 }\n ],\n 7: [\n function(require, module, exports) {\n (function(process) {\n /**\n * Clean-css - https://github.com/jakubpawlowicz/clean-css\n * Released under the terms of MIT license\n *\n * Copyright (C) 2017 JakubPawlowicz.com\n */\n\n var level0Optimize = require(\"./optimizer/level-0/optimize\");\n var level1Optimize = require(\"./optimizer/level-1/optimize\");\n var level2Optimize = require(\"./optimizer/level-2/optimize\");\n var validator = require(\"./optimizer/validator\");\n\n var compatibilityFrom = require(\"./options/compatibility\");\n var fetchFrom = require(\"./options/fetch\");\n var formatFrom = require(\"./options/format\").formatFrom;\n var inlineFrom = require(\"./options/inline\");\n var inlineRequestFrom = require(\"./options/inline-request\");\n var inlineTimeoutFrom = require(\"./options/inline-timeout\");\n var OptimizationLevel = require(\"./options/optimization-level\")\n .OptimizationLevel;\n var optimizationLevelFrom = require(\"./options/optimization-level\")\n .optimizationLevelFrom;\n var rebaseFrom = require(\"./options/rebase\");\n var rebaseToFrom = require(\"./options/rebase-to\");\n\n var inputSourceMapTracker = require(\"./reader/input-source-map-tracker\");\n var readSources = require(\"./reader/read-sources\");\n\n var serializeStyles = require(\"./writer/simple\");\n var serializeStylesAndSourceMap = require(\"./writer/source-maps\");\n\n var CleanCSS = (module.exports = function CleanCSS(options) {\n options = options || {};\n\n this.options = {\n compatibility: compatibilityFrom(options.compatibility),\n fetch: fetchFrom(options.fetch),\n format: formatFrom(options.format),\n inline: inlineFrom(options.inline),\n inlineRequest: inlineRequestFrom(options.inlineRequest),\n inlineTimeout: inlineTimeoutFrom(options.inlineTimeout),\n level: optimizationLevelFrom(options.level),\n rebase: rebaseFrom(options.rebase),\n rebaseTo: rebaseToFrom(options.rebaseTo),\n returnPromise: !!options.returnPromise,\n sourceMap: !!options.sourceMap,\n sourceMapInlineSources: !!options.sourceMapInlineSources\n };\n });\n\n // for compatibility with optimize-css-assets-webpack-plugin\n CleanCSS.process = function(input, opts) {\n var cleanCss;\n var optsTo = opts.to;\n\n delete opts.to;\n cleanCss = new CleanCSS(\n Object.assign({ returnPromise: true, rebaseTo: optsTo }, opts)\n );\n\n return cleanCss.minify(input).then(function(output) {\n return { css: output.styles };\n });\n };\n\n CleanCSS.prototype.minify = function(\n input,\n maybeSourceMap,\n maybeCallback\n ) {\n var options = this.options;\n\n if (options.returnPromise) {\n return new Promise(function(resolve, reject) {\n minify(input, options, maybeSourceMap, function(\n errors,\n output\n ) {\n return errors ? reject(errors) : resolve(output);\n });\n });\n } else {\n return minify(input, options, maybeSourceMap, maybeCallback);\n }\n };\n\n function minify(input, options, maybeSourceMap, maybeCallback) {\n var sourceMap =\n typeof maybeSourceMap != \"function\" ? maybeSourceMap : null;\n var callback =\n typeof maybeCallback == \"function\"\n ? maybeCallback\n : typeof maybeSourceMap == \"function\"\n ? maybeSourceMap\n : null;\n var context = {\n stats: {\n efficiency: 0,\n minifiedSize: 0,\n originalSize: 0,\n startedAt: Date.now(),\n timeSpent: 0\n },\n cache: {\n specificity: {}\n },\n errors: [],\n inlinedStylesheets: [],\n inputSourceMapTracker: inputSourceMapTracker(),\n localOnly: !callback,\n options: options,\n source: null,\n sourcesContent: {},\n validator: validator(options.compatibility),\n warnings: []\n };\n\n if (sourceMap) {\n context.inputSourceMapTracker.track(undefined, sourceMap);\n }\n\n return runner(context.localOnly)(function() {\n return readSources(input, context, function(tokens) {\n var serialize = context.options.sourceMap\n ? serializeStylesAndSourceMap\n : serializeStyles;\n\n var optimizedTokens = optimize(tokens, context);\n var optimizedStyles = serialize(optimizedTokens, context);\n var output = withMetadata(optimizedStyles, context);\n\n return callback\n ? callback(\n context.errors.length > 0 ? context.errors : null,\n output\n )\n : output;\n });\n });\n }\n\n function runner(localOnly) {\n // to always execute code asynchronously when a callback is given\n // more at blog.izs.me/post/59142742143/designing-apis-for-asynchrony\n return localOnly\n ? function(callback) {\n return callback();\n }\n : process.nextTick;\n }\n\n function optimize(tokens, context) {\n var optimized;\n\n optimized = level0Optimize(tokens, context);\n optimized =\n OptimizationLevel.One in context.options.level\n ? level1Optimize(tokens, context)\n : tokens;\n optimized =\n OptimizationLevel.Two in context.options.level\n ? level2Optimize(tokens, context, true)\n : optimized;\n\n return optimized;\n }\n\n function withMetadata(output, context) {\n output.stats = calculateStatsFrom(output.styles, context);\n output.errors = context.errors;\n output.inlinedStylesheets = context.inlinedStylesheets;\n output.warnings = context.warnings;\n\n return output;\n }\n\n function calculateStatsFrom(styles, context) {\n var finishedAt = Date.now();\n var timeSpent = finishedAt - context.stats.startedAt;\n\n delete context.stats.startedAt;\n context.stats.timeSpent = timeSpent;\n context.stats.efficiency =\n 1 - styles.length / context.stats.originalSize;\n context.stats.minifiedSize = styles.length;\n\n return context.stats;\n }\n }.call(this, require(\"_process\")));\n },\n {\n \"./optimizer/level-0/optimize\": 9,\n \"./optimizer/level-1/optimize\": 10,\n \"./optimizer/level-2/optimize\": 29,\n \"./optimizer/validator\": 57,\n \"./options/compatibility\": 59,\n \"./options/fetch\": 60,\n \"./options/format\": 61,\n \"./options/inline\": 64,\n \"./options/inline-request\": 62,\n \"./options/inline-timeout\": 63,\n \"./options/optimization-level\": 65,\n \"./options/rebase\": 67,\n \"./options/rebase-to\": 66,\n \"./reader/input-source-map-tracker\": 71,\n \"./reader/read-sources\": 77,\n \"./writer/simple\": 99,\n \"./writer/source-maps\": 100,\n _process: 112\n }\n ],\n 8: [\n function(require, module, exports) {\n var Hack = {\n ASTERISK: \"asterisk\",\n BANG: \"bang\",\n BACKSLASH: \"backslash\",\n UNDERSCORE: \"underscore\"\n };\n\n module.exports = Hack;\n },\n {}\n ],\n 9: [\n function(require, module, exports) {\n function level0Optimize(tokens) {\n // noop as level 0 means no optimizations!\n return tokens;\n }\n\n module.exports = level0Optimize;\n },\n {}\n ],\n 10: [\n function(require, module, exports) {\n var shortenHex = require(\"./shorten-hex\");\n var shortenHsl = require(\"./shorten-hsl\");\n var shortenRgb = require(\"./shorten-rgb\");\n var sortSelectors = require(\"./sort-selectors\");\n var tidyRules = require(\"./tidy-rules\");\n var tidyBlock = require(\"./tidy-block\");\n var tidyAtRule = require(\"./tidy-at-rule\");\n\n var Hack = require(\"../hack\");\n var removeUnused = require(\"../remove-unused\");\n var restoreFromOptimizing = require(\"../restore-from-optimizing\");\n var wrapForOptimizing = require(\"../wrap-for-optimizing\").all;\n\n var OptimizationLevel = require(\"../../options/optimization-level\")\n .OptimizationLevel;\n\n var Token = require(\"../../tokenizer/token\");\n var Marker = require(\"../../tokenizer/marker\");\n\n var formatPosition = require(\"../../utils/format-position\");\n var split = require(\"../../utils/split\");\n\n var serializeRules = require(\"../../writer/one-time\").rules;\n\n var IgnoreProperty = \"ignore-property\";\n\n var CHARSET_TOKEN = \"@charset\";\n var CHARSET_REGEXP = new RegExp(\"^\" + CHARSET_TOKEN, \"i\");\n\n var DEFAULT_ROUNDING_PRECISION = require(\"../../options/rounding-precision\")\n .DEFAULT;\n\n var WHOLE_PIXEL_VALUE = /(?:^|\\s|\\()(-?\\d+)px/;\n var TIME_VALUE = /^(\\-?[\\d\\.]+)(m?s)$/;\n\n var HEX_VALUE_PATTERN = /[0-9a-f]/i;\n var PROPERTY_NAME_PATTERN = /^(?:\\-chrome\\-|\\-[\\w\\-]+\\w|\\w[\\w\\-]+\\w|\\-\\-\\S+)$/;\n var IMPORT_PREFIX_PATTERN = /^@import/i;\n var QUOTED_PATTERN = /^('.*'|\".*\")$/;\n var QUOTED_BUT_SAFE_PATTERN = /^['\"][a-zA-Z][a-zA-Z\\d\\-_]+['\"]$/;\n var URL_PREFIX_PATTERN = /^url\\(/i;\n var VARIABLE_NAME_PATTERN = /^--\\S+$/;\n\n function isNegative(value) {\n return value && value[1][0] == \"-\" && parseFloat(value[1]) < 0;\n }\n\n function isQuoted(value) {\n return QUOTED_PATTERN.test(value);\n }\n\n function isUrl(value) {\n return URL_PREFIX_PATTERN.test(value);\n }\n\n function normalizeUrl(value) {\n return value\n .replace(URL_PREFIX_PATTERN, \"url(\")\n .replace(/\\\\?\\n|\\\\?\\r\\n/g, \"\");\n }\n\n function optimizeBackground(property) {\n var values = property.value;\n\n if (values.length == 1 && values[0][1] == \"none\") {\n values[0][1] = \"0 0\";\n }\n\n if (values.length == 1 && values[0][1] == \"transparent\") {\n values[0][1] = \"0 0\";\n }\n }\n\n function optimizeBorderRadius(property) {\n var values = property.value;\n var spliceAt;\n\n if (\n values.length == 3 &&\n values[1][1] == \"/\" &&\n values[0][1] == values[2][1]\n ) {\n spliceAt = 1;\n } else if (\n values.length == 5 &&\n values[2][1] == \"/\" &&\n values[0][1] == values[3][1] &&\n values[1][1] == values[4][1]\n ) {\n spliceAt = 2;\n } else if (\n values.length == 7 &&\n values[3][1] == \"/\" &&\n values[0][1] == values[4][1] &&\n values[1][1] == values[5][1] &&\n values[2][1] == values[6][1]\n ) {\n spliceAt = 3;\n } else if (\n values.length == 9 &&\n values[4][1] == \"/\" &&\n values[0][1] == values[5][1] &&\n values[1][1] == values[6][1] &&\n values[2][1] == values[7][1] &&\n values[3][1] == values[8][1]\n ) {\n spliceAt = 4;\n }\n\n if (spliceAt) {\n property.value.splice(spliceAt);\n property.dirty = true;\n }\n }\n\n function optimizeColors(name, value, compatibility) {\n if (\n value.indexOf(\"#\") === -1 &&\n value.indexOf(\"rgb\") == -1 &&\n value.indexOf(\"hsl\") == -1\n ) {\n return shortenHex(value);\n }\n\n value = value\n .replace(/rgb\\((\\-?\\d+),(\\-?\\d+),(\\-?\\d+)\\)/g, function(\n match,\n red,\n green,\n blue\n ) {\n return shortenRgb(red, green, blue);\n })\n .replace(/hsl\\((-?\\d+),(-?\\d+)%?,(-?\\d+)%?\\)/g, function(\n match,\n hue,\n saturation,\n lightness\n ) {\n return shortenHsl(hue, saturation, lightness);\n })\n .replace(/(^|[^='\"])#([0-9a-f]{6})/gi, function(\n match,\n prefix,\n color,\n at,\n inputValue\n ) {\n var suffix = inputValue[at + match.length];\n\n if (suffix && HEX_VALUE_PATTERN.test(suffix)) {\n return match;\n } else if (\n color[0] == color[1] &&\n color[2] == color[3] &&\n color[4] == color[5]\n ) {\n return (\n prefix +\n \"#\" +\n color[0] +\n color[2] +\n color[4]\n ).toLowerCase();\n } else {\n return (prefix + \"#\" + color).toLowerCase();\n }\n })\n .replace(/(^|[^='\"])#([0-9a-f]{3})/gi, function(\n match,\n prefix,\n color\n ) {\n return prefix + \"#\" + color.toLowerCase();\n })\n .replace(/(rgb|rgba|hsl|hsla)\\(([^\\)]+)\\)/g, function(\n match,\n colorFunction,\n colorDef\n ) {\n var tokens = colorDef.split(\",\");\n var applies =\n (colorFunction == \"hsl\" && tokens.length == 3) ||\n (colorFunction == \"hsla\" && tokens.length == 4) ||\n (colorFunction == \"rgb\" &&\n tokens.length == 3 &&\n colorDef.indexOf(\"%\") > 0) ||\n (colorFunction == \"rgba\" &&\n tokens.length == 4 &&\n colorDef.indexOf(\"%\") > 0);\n\n if (!applies) {\n return match;\n }\n\n if (tokens[1].indexOf(\"%\") == -1) {\n tokens[1] += \"%\";\n }\n\n if (tokens[2].indexOf(\"%\") == -1) {\n tokens[2] += \"%\";\n }\n\n return colorFunction + \"(\" + tokens.join(\",\") + \")\";\n });\n\n if (\n compatibility.colors.opacity &&\n name.indexOf(\"background\") == -1\n ) {\n value = value.replace(/(?:rgba|hsla)\\(0,0%?,0%?,0\\)/g, function(\n match\n ) {\n if (\n split(value, \",\")\n .pop()\n .indexOf(\"gradient(\") > -1\n ) {\n return match;\n }\n\n return \"transparent\";\n });\n }\n\n return shortenHex(value);\n }\n\n function optimizeFilter(property) {\n if (property.value.length == 1) {\n property.value[0][1] = property.value[0][1].replace(\n /progid:DXImageTransform\\.Microsoft\\.(Alpha|Chroma)(\\W)/,\n function(match, filter, suffix) {\n return filter.toLowerCase() + suffix;\n }\n );\n }\n\n property.value[0][1] = property.value[0][1]\n .replace(/,(\\S)/g, \", $1\")\n .replace(/ ?= ?/g, \"=\");\n }\n\n function optimizeFontWeight(property, atIndex) {\n var value = property.value[atIndex][1];\n\n if (value == \"normal\") {\n value = \"400\";\n } else if (value == \"bold\") {\n value = \"700\";\n }\n\n property.value[atIndex][1] = value;\n }\n\n function optimizeMultipleZeros(property) {\n var values = property.value;\n var spliceAt;\n\n if (\n values.length == 4 &&\n values[0][1] === \"0\" &&\n values[1][1] === \"0\" &&\n values[2][1] === \"0\" &&\n values[3][1] === \"0\"\n ) {\n if (property.name.indexOf(\"box-shadow\") > -1) {\n spliceAt = 2;\n } else {\n spliceAt = 1;\n }\n }\n\n if (spliceAt) {\n property.value.splice(spliceAt);\n property.dirty = true;\n }\n }\n\n function optimizeOutline(property) {\n var values = property.value;\n\n if (values.length == 1 && values[0][1] == \"none\") {\n values[0][1] = \"0\";\n }\n }\n\n function optimizePixelLengths(_, value, compatibility) {\n if (!WHOLE_PIXEL_VALUE.test(value)) {\n return value;\n }\n\n return value.replace(WHOLE_PIXEL_VALUE, function(match, val) {\n var newValue;\n var intVal = parseInt(val);\n\n if (intVal === 0) {\n return match;\n }\n\n if (\n compatibility.properties.shorterLengthUnits &&\n compatibility.units.pt &&\n (intVal * 3) % 4 === 0\n ) {\n newValue = (intVal * 3) / 4 + \"pt\";\n }\n\n if (\n compatibility.properties.shorterLengthUnits &&\n compatibility.units.pc &&\n intVal % 16 === 0\n ) {\n newValue = intVal / 16 + \"pc\";\n }\n\n if (\n compatibility.properties.shorterLengthUnits &&\n compatibility.units.in &&\n intVal % 96 === 0\n ) {\n newValue = intVal / 96 + \"in\";\n }\n\n if (newValue) {\n newValue = match.substring(0, match.indexOf(val)) + newValue;\n }\n\n return newValue && newValue.length < match.length\n ? newValue\n : match;\n });\n }\n\n function optimizePrecision(_, value, precisionOptions) {\n if (!precisionOptions.enabled || value.indexOf(\".\") === -1) {\n return value;\n }\n\n return value\n .replace(precisionOptions.decimalPointMatcher, \"$1$2$3\")\n .replace(precisionOptions.zeroMatcher, function(\n match,\n integerPart,\n fractionPart,\n unit\n ) {\n var multiplier = precisionOptions.units[unit].multiplier;\n var parsedInteger = parseInt(integerPart);\n var integer = isNaN(parsedInteger) ? 0 : parsedInteger;\n var fraction = parseFloat(fractionPart);\n\n return (\n Math.round((integer + fraction) * multiplier) / multiplier +\n unit\n );\n });\n }\n\n function optimizeTimeUnits(_, value) {\n if (!TIME_VALUE.test(value)) return value;\n\n return value.replace(TIME_VALUE, function(match, val, unit) {\n var newValue;\n\n if (unit == \"ms\") {\n newValue = parseInt(val) / 1000 + \"s\";\n } else if (unit == \"s\") {\n newValue = parseFloat(val) * 1000 + \"ms\";\n }\n\n return newValue.length < match.length ? newValue : match;\n });\n }\n\n function optimizeUnits(name, value, unitsRegexp) {\n if (\n /^(?:\\-moz\\-calc|\\-webkit\\-calc|calc|rgb|hsl|rgba|hsla)\\(/.test(\n value\n )\n ) {\n return value;\n }\n\n if (\n name == \"flex\" ||\n name == \"-ms-flex\" ||\n name == \"-webkit-flex\" ||\n name == \"flex-basis\" ||\n name == \"-webkit-flex-basis\"\n ) {\n return value;\n }\n\n if (\n value.indexOf(\"%\") > 0 &&\n (name == \"height\" ||\n name == \"max-height\" ||\n name == \"width\" ||\n name == \"max-width\")\n ) {\n return value;\n }\n\n return value\n .replace(unitsRegexp, \"$1\" + \"0\" + \"$2\")\n .replace(unitsRegexp, \"$1\" + \"0\" + \"$2\");\n }\n\n function optimizeWhitespace(name, value) {\n if (\n name.indexOf(\"filter\") > -1 ||\n value.indexOf(\" \") == -1 ||\n value.indexOf(\"expression\") === 0\n ) {\n return value;\n }\n\n if (\n value.indexOf(Marker.SINGLE_QUOTE) > -1 ||\n value.indexOf(Marker.DOUBLE_QUOTE) > -1\n ) {\n return value;\n }\n\n value = value.replace(/\\s+/g, \" \");\n\n if (value.indexOf(\"calc\") > -1) {\n value = value.replace(/\\) ?\\/ ?/g, \")/ \");\n }\n\n return value\n .replace(/(\\(;?)\\s+/g, \"$1\")\n .replace(/\\s+(;?\\))/g, \"$1\")\n .replace(/, /g, \",\");\n }\n\n function optimizeZeroDegUnit(_, value) {\n if (value.indexOf(\"0deg\") == -1) {\n return value;\n }\n\n return value.replace(/\\(0deg\\)/g, \"(0)\");\n }\n\n function optimizeZeroUnits(name, value) {\n if (value.indexOf(\"0\") == -1) {\n return value;\n }\n\n if (value.indexOf(\"-\") > -1) {\n value = value\n .replace(/([^\\w\\d\\-]|^)\\-0([^\\.]|$)/g, \"$10$2\")\n .replace(/([^\\w\\d\\-]|^)\\-0([^\\.]|$)/g, \"$10$2\");\n }\n\n return value\n .replace(/(^|\\s)0+([1-9])/g, \"$1$2\")\n .replace(/(^|\\D)\\.0+(\\D|$)/g, \"$10$2\")\n .replace(/(^|\\D)\\.0+(\\D|$)/g, \"$10$2\")\n .replace(/\\.([1-9]*)0+(\\D|$)/g, function(\n match,\n nonZeroPart,\n suffix\n ) {\n return (nonZeroPart.length > 0 ? \".\" : \"\") + nonZeroPart + suffix;\n })\n .replace(/(^|\\D)0\\.(\\d)/g, \"$1.$2\");\n }\n\n function removeQuotes(name, value) {\n if (\n name == \"content\" ||\n name.indexOf(\"font-variation-settings\") > -1 ||\n name.indexOf(\"font-feature-settings\") > -1 ||\n name.indexOf(\"grid-\") > -1\n ) {\n return value;\n }\n\n return QUOTED_BUT_SAFE_PATTERN.test(value)\n ? value.substring(1, value.length - 1)\n : value;\n }\n\n function removeUrlQuotes(value) {\n return /^url\\(['\"].+['\"]\\)$/.test(value) &&\n !/^url\\(['\"].*[\\*\\s\\(\\)'\"].*['\"]\\)$/.test(value) &&\n !/^url\\(['\"]data:[^;]+;charset/.test(value)\n ? value.replace(/[\"']/g, \"\")\n : value;\n }\n\n function transformValue(\n propertyName,\n propertyValue,\n rule,\n transformCallback\n ) {\n var selector = serializeRules(rule);\n var transformedValue = transformCallback(\n propertyName,\n propertyValue,\n selector\n );\n\n if (transformedValue === undefined) {\n return propertyValue;\n } else if (transformedValue === false) {\n return IgnoreProperty;\n } else {\n return transformedValue;\n }\n }\n\n //\n\n function optimizeBody(rule, properties, context) {\n var options = context.options;\n var levelOptions = options.level[OptimizationLevel.One];\n var property, name, type, value;\n var valueIsUrl;\n var propertyToken;\n var _properties = wrapForOptimizing(properties, true);\n\n propertyLoop: for (var i = 0, l = _properties.length; i < l; i++) {\n property = _properties[i];\n name = property.name;\n\n if (!PROPERTY_NAME_PATTERN.test(name)) {\n propertyToken = property.all[property.position];\n context.warnings.push(\n \"Invalid property name '\" +\n name +\n \"' at \" +\n formatPosition(propertyToken[1][2][0]) +\n \". Ignoring.\"\n );\n property.unused = true;\n }\n\n if (property.value.length === 0) {\n propertyToken = property.all[property.position];\n context.warnings.push(\n \"Empty property '\" +\n name +\n \"' at \" +\n formatPosition(propertyToken[1][2][0]) +\n \". Ignoring.\"\n );\n property.unused = true;\n }\n\n if (\n property.hack &&\n (((property.hack[0] == Hack.ASTERISK ||\n property.hack[0] == Hack.UNDERSCORE) &&\n !options.compatibility.properties.iePrefixHack) ||\n (property.hack[0] == Hack.BACKSLASH &&\n !options.compatibility.properties.ieSuffixHack) ||\n (property.hack[0] == Hack.BANG &&\n !options.compatibility.properties.ieBangHack))\n ) {\n property.unused = true;\n }\n\n if (\n levelOptions.removeNegativePaddings &&\n name.indexOf(\"padding\") === 0 &&\n (isNegative(property.value[0]) ||\n isNegative(property.value[1]) ||\n isNegative(property.value[2]) ||\n isNegative(property.value[3]))\n ) {\n property.unused = true;\n }\n\n if (\n !options.compatibility.properties.ieFilters &&\n isLegacyFilter(property)\n ) {\n property.unused = true;\n }\n\n if (property.unused) {\n continue;\n }\n\n if (property.block) {\n optimizeBody(rule, property.value[0][1], context);\n continue;\n }\n\n if (VARIABLE_NAME_PATTERN.test(name)) {\n continue;\n }\n\n for (var j = 0, m = property.value.length; j < m; j++) {\n type = property.value[j][0];\n value = property.value[j][1];\n valueIsUrl = isUrl(value);\n\n if (type == Token.PROPERTY_BLOCK) {\n property.unused = true;\n context.warnings.push(\n \"Invalid value token at \" +\n formatPosition(value[0][1][2][0]) +\n \". Ignoring.\"\n );\n break;\n }\n\n if (valueIsUrl && !context.validator.isUrl(value)) {\n property.unused = true;\n context.warnings.push(\n \"Broken URL '\" +\n value +\n \"' at \" +\n formatPosition(property.value[j][2][0]) +\n \". Ignoring.\"\n );\n break;\n }\n\n if (valueIsUrl) {\n value = levelOptions.normalizeUrls\n ? normalizeUrl(value)\n : value;\n value = !options.compatibility.properties.urlQuotes\n ? removeUrlQuotes(value)\n : value;\n } else if (isQuoted(value)) {\n value = levelOptions.removeQuotes\n ? removeQuotes(name, value)\n : value;\n } else {\n value = levelOptions.removeWhitespace\n ? optimizeWhitespace(name, value)\n : value;\n value = optimizePrecision(name, value, options.precision);\n value = optimizePixelLengths(\n name,\n value,\n options.compatibility\n );\n value = levelOptions.replaceTimeUnits\n ? optimizeTimeUnits(name, value)\n : value;\n value = levelOptions.replaceZeroUnits\n ? optimizeZeroUnits(name, value)\n : value;\n\n if (options.compatibility.properties.zeroUnits) {\n value = optimizeZeroDegUnit(name, value);\n value = optimizeUnits(name, value, options.unitsRegexp);\n }\n\n if (options.compatibility.properties.colors) {\n value = optimizeColors(name, value, options.compatibility);\n }\n }\n\n value = transformValue(name, value, rule, levelOptions.transform);\n\n if (value === IgnoreProperty) {\n property.unused = true;\n continue propertyLoop;\n }\n\n property.value[j][1] = value;\n }\n\n if (levelOptions.replaceMultipleZeros) {\n optimizeMultipleZeros(property);\n }\n\n if (name == \"background\" && levelOptions.optimizeBackground) {\n optimizeBackground(property);\n } else if (\n name.indexOf(\"border\") === 0 &&\n name.indexOf(\"radius\") > 0 &&\n levelOptions.optimizeBorderRadius\n ) {\n optimizeBorderRadius(property);\n } else if (\n name == \"filter\" &&\n levelOptions.optimizeFilter &&\n options.compatibility.properties.ieFilters\n ) {\n optimizeFilter(property);\n } else if (\n name == \"font-weight\" &&\n levelOptions.optimizeFontWeight\n ) {\n optimizeFontWeight(property, 0);\n } else if (name == \"outline\" && levelOptions.optimizeOutline) {\n optimizeOutline(property);\n }\n }\n\n restoreFromOptimizing(_properties);\n removeUnused(_properties);\n removeComments(properties, options);\n }\n\n function removeComments(tokens, options) {\n var token;\n var i;\n\n for (i = 0; i < tokens.length; i++) {\n token = tokens[i];\n\n if (token[0] != Token.COMMENT) {\n continue;\n }\n\n optimizeComment(token, options);\n\n if (token[1].length === 0) {\n tokens.splice(i, 1);\n i--;\n }\n }\n }\n\n function optimizeComment(token, options) {\n if (\n token[1][2] == Marker.EXCLAMATION &&\n (options.level[OptimizationLevel.One].specialComments == \"all\" ||\n options.commentsKept <\n options.level[OptimizationLevel.One].specialComments)\n ) {\n options.commentsKept++;\n return;\n }\n\n token[1] = [];\n }\n\n function cleanupCharsets(tokens) {\n var hasCharset = false;\n\n for (var i = 0, l = tokens.length; i < l; i++) {\n var token = tokens[i];\n\n if (token[0] != Token.AT_RULE) continue;\n\n if (!CHARSET_REGEXP.test(token[1])) continue;\n\n if (hasCharset || token[1].indexOf(CHARSET_TOKEN) == -1) {\n tokens.splice(i, 1);\n i--;\n l--;\n } else {\n hasCharset = true;\n tokens.splice(i, 1);\n tokens.unshift([\n Token.AT_RULE,\n token[1].replace(CHARSET_REGEXP, CHARSET_TOKEN)\n ]);\n }\n }\n }\n\n function buildUnitRegexp(options) {\n var units = [\"px\", \"em\", \"ex\", \"cm\", \"mm\", \"in\", \"pt\", \"pc\", \"%\"];\n var otherUnits = [\"ch\", \"rem\", \"vh\", \"vm\", \"vmax\", \"vmin\", \"vw\"];\n\n otherUnits.forEach(function(unit) {\n if (options.compatibility.units[unit]) {\n units.push(unit);\n }\n });\n\n return new RegExp(\n \"(^|\\\\s|\\\\(|,)0(?:\" + units.join(\"|\") + \")(\\\\W|$)\",\n \"g\"\n );\n }\n\n function buildPrecisionOptions(roundingPrecision) {\n var precisionOptions = {\n matcher: null,\n units: {}\n };\n var optimizable = [];\n var unit;\n var value;\n\n for (unit in roundingPrecision) {\n value = roundingPrecision[unit];\n\n if (value != DEFAULT_ROUNDING_PRECISION) {\n precisionOptions.units[unit] = {};\n precisionOptions.units[unit].value = value;\n precisionOptions.units[unit].multiplier = Math.pow(10, value);\n\n optimizable.push(unit);\n }\n }\n\n if (optimizable.length > 0) {\n precisionOptions.enabled = true;\n precisionOptions.decimalPointMatcher = new RegExp(\n \"(\\\\d)\\\\.($|\" + optimizable.join(\"|\") + \")($|W)\",\n \"g\"\n );\n precisionOptions.zeroMatcher = new RegExp(\n \"(\\\\d*)(\\\\.\\\\d+)(\" + optimizable.join(\"|\") + \")\",\n \"g\"\n );\n }\n\n return precisionOptions;\n }\n\n function isImport(token) {\n return IMPORT_PREFIX_PATTERN.test(token[1]);\n }\n\n function isLegacyFilter(property) {\n var value;\n\n if (property.name == \"filter\" || property.name == \"-ms-filter\") {\n value = property.value[0][1];\n\n return (\n value.indexOf(\"progid\") > -1 ||\n value.indexOf(\"alpha\") === 0 ||\n value.indexOf(\"chroma\") === 0\n );\n } else {\n return false;\n }\n }\n\n function level1Optimize(tokens, context) {\n var options = context.options;\n var levelOptions = options.level[OptimizationLevel.One];\n var ie7Hack = options.compatibility.selectors.ie7Hack;\n var adjacentSpace = options.compatibility.selectors.adjacentSpace;\n var spaceAfterClosingBrace =\n options.compatibility.properties.spaceAfterClosingBrace;\n var format = options.format;\n var mayHaveCharset = false;\n var afterRules = false;\n\n options.unitsRegexp = options.unitsRegexp || buildUnitRegexp(options);\n options.precision =\n options.precision ||\n buildPrecisionOptions(levelOptions.roundingPrecision);\n options.commentsKept = options.commentsKept || 0;\n\n for (var i = 0, l = tokens.length; i < l; i++) {\n var token = tokens[i];\n\n switch (token[0]) {\n case Token.AT_RULE:\n token[1] = isImport(token) && afterRules ? \"\" : token[1];\n token[1] = levelOptions.tidyAtRules\n ? tidyAtRule(token[1])\n : token[1];\n mayHaveCharset = true;\n break;\n case Token.AT_RULE_BLOCK:\n optimizeBody(token[1], token[2], context);\n afterRules = true;\n break;\n case Token.NESTED_BLOCK:\n token[1] = levelOptions.tidyBlockScopes\n ? tidyBlock(token[1], spaceAfterClosingBrace)\n : token[1];\n level1Optimize(token[2], context);\n afterRules = true;\n break;\n case Token.COMMENT:\n optimizeComment(token, options);\n break;\n case Token.RULE:\n token[1] = levelOptions.tidySelectors\n ? tidyRules(\n token[1],\n !ie7Hack,\n adjacentSpace,\n format,\n context.warnings\n )\n : token[1];\n token[1] =\n token[1].length > 1\n ? sortSelectors(\n token[1],\n levelOptions.selectorsSortingMethod\n )\n : token[1];\n optimizeBody(token[1], token[2], context);\n afterRules = true;\n break;\n }\n\n if (\n (token[0] == Token.COMMENT && token[1].length === 0) ||\n (levelOptions.removeEmpty &&\n (token[1].length === 0 || (token[2] && token[2].length === 0)))\n ) {\n tokens.splice(i, 1);\n i--;\n l--;\n }\n }\n\n if (levelOptions.cleanupCharsets && mayHaveCharset) {\n cleanupCharsets(tokens);\n }\n\n return tokens;\n }\n\n module.exports = level1Optimize;\n },\n {\n \"../../options/optimization-level\": 65,\n \"../../options/rounding-precision\": 68,\n \"../../tokenizer/marker\": 83,\n \"../../tokenizer/token\": 84,\n \"../../utils/format-position\": 87,\n \"../../utils/split\": 96,\n \"../../writer/one-time\": 98,\n \"../hack\": 8,\n \"../remove-unused\": 55,\n \"../restore-from-optimizing\": 56,\n \"../wrap-for-optimizing\": 58,\n \"./shorten-hex\": 11,\n \"./shorten-hsl\": 12,\n \"./shorten-rgb\": 13,\n \"./sort-selectors\": 14,\n \"./tidy-at-rule\": 15,\n \"./tidy-block\": 16,\n \"./tidy-rules\": 17\n }\n ],\n 11: [\n function(require, module, exports) {\n var COLORS = {\n aliceblue: \"#f0f8ff\",\n antiquewhite: \"#faebd7\",\n aqua: \"#0ff\",\n aquamarine: \"#7fffd4\",\n azure: \"#f0ffff\",\n beige: \"#f5f5dc\",\n bisque: \"#ffe4c4\",\n black: \"#000\",\n blanchedalmond: \"#ffebcd\",\n blue: \"#00f\",\n blueviolet: \"#8a2be2\",\n brown: \"#a52a2a\",\n burlywood: \"#deb887\",\n cadetblue: \"#5f9ea0\",\n chartreuse: \"#7fff00\",\n chocolate: \"#d2691e\",\n coral: \"#ff7f50\",\n cornflowerblue: \"#6495ed\",\n cornsilk: \"#fff8dc\",\n crimson: \"#dc143c\",\n cyan: \"#0ff\",\n darkblue: \"#00008b\",\n darkcyan: \"#008b8b\",\n darkgoldenrod: \"#b8860b\",\n darkgray: \"#a9a9a9\",\n darkgreen: \"#006400\",\n darkgrey: \"#a9a9a9\",\n darkkhaki: \"#bdb76b\",\n darkmagenta: \"#8b008b\",\n darkolivegreen: \"#556b2f\",\n darkorange: \"#ff8c00\",\n darkorchid: \"#9932cc\",\n darkred: \"#8b0000\",\n darksalmon: \"#e9967a\",\n darkseagreen: \"#8fbc8f\",\n darkslateblue: \"#483d8b\",\n darkslategray: \"#2f4f4f\",\n darkslategrey: \"#2f4f4f\",\n darkturquoise: \"#00ced1\",\n darkviolet: \"#9400d3\",\n deeppink: \"#ff1493\",\n deepskyblue: \"#00bfff\",\n dimgray: \"#696969\",\n dimgrey: \"#696969\",\n dodgerblue: \"#1e90ff\",\n firebrick: \"#b22222\",\n floralwhite: \"#fffaf0\",\n forestgreen: \"#228b22\",\n fuchsia: \"#f0f\",\n gainsboro: \"#dcdcdc\",\n ghostwhite: \"#f8f8ff\",\n gold: \"#ffd700\",\n goldenrod: \"#daa520\",\n gray: \"#808080\",\n green: \"#008000\",\n greenyellow: \"#adff2f\",\n grey: \"#808080\",\n honeydew: \"#f0fff0\",\n hotpink: \"#ff69b4\",\n indianred: \"#cd5c5c\",\n indigo: \"#4b0082\",\n ivory: \"#fffff0\",\n khaki: \"#f0e68c\",\n lavender: \"#e6e6fa\",\n lavenderblush: \"#fff0f5\",\n lawngreen: \"#7cfc00\",\n lemonchiffon: \"#fffacd\",\n lightblue: \"#add8e6\",\n lightcoral: \"#f08080\",\n lightcyan: \"#e0ffff\",\n lightgoldenrodyellow: \"#fafad2\",\n lightgray: \"#d3d3d3\",\n lightgreen: \"#90ee90\",\n lightgrey: \"#d3d3d3\",\n lightpink: \"#ffb6c1\",\n lightsalmon: \"#ffa07a\",\n lightseagreen: \"#20b2aa\",\n lightskyblue: \"#87cefa\",\n lightslategray: \"#778899\",\n lightslategrey: \"#778899\",\n lightsteelblue: \"#b0c4de\",\n lightyellow: \"#ffffe0\",\n lime: \"#0f0\",\n limegreen: \"#32cd32\",\n linen: \"#faf0e6\",\n magenta: \"#ff00ff\",\n maroon: \"#800000\",\n mediumaquamarine: \"#66cdaa\",\n mediumblue: \"#0000cd\",\n mediumorchid: \"#ba55d3\",\n mediumpurple: \"#9370db\",\n mediumseagreen: \"#3cb371\",\n mediumslateblue: \"#7b68ee\",\n mediumspringgreen: \"#00fa9a\",\n mediumturquoise: \"#48d1cc\",\n mediumvioletred: \"#c71585\",\n midnightblue: \"#191970\",\n mintcream: \"#f5fffa\",\n mistyrose: \"#ffe4e1\",\n moccasin: \"#ffe4b5\",\n navajowhite: \"#ffdead\",\n navy: \"#000080\",\n oldlace: \"#fdf5e6\",\n olive: \"#808000\",\n olivedrab: \"#6b8e23\",\n orange: \"#ffa500\",\n orangered: \"#ff4500\",\n orchid: \"#da70d6\",\n palegoldenrod: \"#eee8aa\",\n palegreen: \"#98fb98\",\n paleturquoise: \"#afeeee\",\n palevioletred: \"#db7093\",\n papayawhip: \"#ffefd5\",\n peachpuff: \"#ffdab9\",\n peru: \"#cd853f\",\n pink: \"#ffc0cb\",\n plum: \"#dda0dd\",\n powderblue: \"#b0e0e6\",\n purple: \"#800080\",\n rebeccapurple: \"#663399\",\n red: \"#f00\",\n rosybrown: \"#bc8f8f\",\n royalblue: \"#4169e1\",\n saddlebrown: \"#8b4513\",\n salmon: \"#fa8072\",\n sandybrown: \"#f4a460\",\n seagreen: \"#2e8b57\",\n seashell: \"#fff5ee\",\n sienna: \"#a0522d\",\n silver: \"#c0c0c0\",\n skyblue: \"#87ceeb\",\n slateblue: \"#6a5acd\",\n slategray: \"#708090\",\n slategrey: \"#708090\",\n snow: \"#fffafa\",\n springgreen: \"#00ff7f\",\n steelblue: \"#4682b4\",\n tan: \"#d2b48c\",\n teal: \"#008080\",\n thistle: \"#d8bfd8\",\n tomato: \"#ff6347\",\n turquoise: \"#40e0d0\",\n violet: \"#ee82ee\",\n wheat: \"#f5deb3\",\n white: \"#fff\",\n whitesmoke: \"#f5f5f5\",\n yellow: \"#ff0\",\n yellowgreen: \"#9acd32\"\n };\n\n var toHex = {};\n var toName = {};\n\n for (var name in COLORS) {\n var hex = COLORS[name];\n\n if (name.length < hex.length) {\n toName[hex] = name;\n } else {\n toHex[name] = hex;\n }\n }\n\n var toHexPattern = new RegExp(\n \"(^| |,|\\\\))(\" + Object.keys(toHex).join(\"|\") + \")( |,|\\\\)|$)\",\n \"ig\"\n );\n var toNamePattern = new RegExp(\n \"(\" + Object.keys(toName).join(\"|\") + \")([^a-f0-9]|$)\",\n \"ig\"\n );\n\n function hexConverter(match, prefix, colorValue, suffix) {\n return prefix + toHex[colorValue.toLowerCase()] + suffix;\n }\n\n function nameConverter(match, colorValue, suffix) {\n return toName[colorValue.toLowerCase()] + suffix;\n }\n\n function shortenHex(value) {\n var hasHex = value.indexOf(\"#\") > -1;\n var shortened = value.replace(toHexPattern, hexConverter);\n\n if (shortened != value) {\n shortened = shortened.replace(toHexPattern, hexConverter);\n }\n\n return hasHex\n ? shortened.replace(toNamePattern, nameConverter)\n : shortened;\n }\n\n module.exports = shortenHex;\n },\n {}\n ],\n 12: [\n function(require, module, exports) {\n // HSL to RGB converter. Both methods adapted from:\n // http://mjijackson.com/2008/02/rgb-to-hsl-and-rgb-to-hsv-color-model-conversion-algorithms-in-javascript\n\n function hslToRgb(h, s, l) {\n var r, g, b;\n\n // normalize hue orientation b/w 0 and 360 degrees\n h = h % 360;\n if (h < 0) h += 360;\n h = ~~h / 360;\n\n if (s < 0) s = 0;\n else if (s > 100) s = 100;\n s = ~~s / 100;\n\n if (l < 0) l = 0;\n else if (l > 100) l = 100;\n l = ~~l / 100;\n\n if (s === 0) {\n r = g = b = l; // achromatic\n } else {\n var q = l < 0.5 ? l * (1 + s) : l + s - l * s;\n var p = 2 * l - q;\n r = hueToRgb(p, q, h + 1 / 3);\n g = hueToRgb(p, q, h);\n b = hueToRgb(p, q, h - 1 / 3);\n }\n\n return [~~(r * 255), ~~(g * 255), ~~(b * 255)];\n }\n\n function hueToRgb(p, q, t) {\n if (t < 0) t += 1;\n if (t > 1) t -= 1;\n if (t < 1 / 6) return p + (q - p) * 6 * t;\n if (t < 1 / 2) return q;\n if (t < 2 / 3) return p + (q - p) * (2 / 3 - t) * 6;\n return p;\n }\n\n function shortenHsl(hue, saturation, lightness) {\n var asRgb = hslToRgb(hue, saturation, lightness);\n var redAsHex = asRgb[0].toString(16);\n var greenAsHex = asRgb[1].toString(16);\n var blueAsHex = asRgb[2].toString(16);\n\n return (\n \"#\" +\n ((redAsHex.length == 1 ? \"0\" : \"\") + redAsHex) +\n ((greenAsHex.length == 1 ? \"0\" : \"\") + greenAsHex) +\n ((blueAsHex.length == 1 ? \"0\" : \"\") + blueAsHex)\n );\n }\n\n module.exports = shortenHsl;\n },\n {}\n ],\n 13: [\n function(require, module, exports) {\n function shortenRgb(red, green, blue) {\n var normalizedRed = Math.max(0, Math.min(parseInt(red), 255));\n var normalizedGreen = Math.max(0, Math.min(parseInt(green), 255));\n var normalizedBlue = Math.max(0, Math.min(parseInt(blue), 255));\n\n // Credit: Asen http://jsbin.com/UPUmaGOc/2/edit?js,console\n return (\n \"#\" +\n (\n \"00000\" +\n (\n (normalizedRed << 16) |\n (normalizedGreen << 8) |\n normalizedBlue\n ).toString(16)\n ).slice(-6)\n );\n }\n\n module.exports = shortenRgb;\n },\n {}\n ],\n 14: [\n function(require, module, exports) {\n var naturalCompare = require(\"../../utils/natural-compare\");\n\n function naturalSorter(scope1, scope2) {\n return naturalCompare(scope1[1], scope2[1]);\n }\n\n function standardSorter(scope1, scope2) {\n return scope1[1] > scope2[1] ? 1 : -1;\n }\n\n function sortSelectors(selectors, method) {\n switch (method) {\n case \"natural\":\n return selectors.sort(naturalSorter);\n case \"standard\":\n return selectors.sort(standardSorter);\n case \"none\":\n case false:\n return selectors;\n }\n }\n\n module.exports = sortSelectors;\n },\n { \"../../utils/natural-compare\": 94 }\n ],\n 15: [\n function(require, module, exports) {\n function tidyAtRule(value) {\n return value\n .replace(/\\s+/g, \" \")\n .replace(/url\\(\\s+/g, \"url(\")\n .replace(/\\s+\\)/g, \")\")\n .trim();\n }\n\n module.exports = tidyAtRule;\n },\n {}\n ],\n 16: [\n function(require, module, exports) {\n var SUPPORTED_COMPACT_BLOCK_MATCHER = /^@media\\W/;\n\n function tidyBlock(values, spaceAfterClosingBrace) {\n var withoutSpaceAfterClosingBrace;\n var i;\n\n for (i = values.length - 1; i >= 0; i--) {\n withoutSpaceAfterClosingBrace =\n !spaceAfterClosingBrace &&\n SUPPORTED_COMPACT_BLOCK_MATCHER.test(values[i][1]);\n\n values[i][1] = values[i][1]\n .replace(/\\n|\\r\\n/g, \" \")\n .replace(/\\s+/g, \" \")\n .replace(/(,|:|\\() /g, \"$1\")\n .replace(/ \\)/g, \")\")\n .replace(/'([a-zA-Z][a-zA-Z\\d\\-_]+)'/, \"$1\")\n .replace(/\"([a-zA-Z][a-zA-Z\\d\\-_]+)\"/, \"$1\")\n .replace(withoutSpaceAfterClosingBrace ? /\\) /g : null, \")\");\n }\n\n return values;\n }\n\n module.exports = tidyBlock;\n },\n {}\n ],\n 17: [\n function(require, module, exports) {\n var Spaces = require(\"../../options/format\").Spaces;\n var Marker = require(\"../../tokenizer/marker\");\n var formatPosition = require(\"../../utils/format-position\");\n\n var CASE_ATTRIBUTE_PATTERN = /[\\s\"'][iI]\\s*\\]/;\n var CASE_RESTORE_PATTERN = /([\\d\\w])([iI])\\]/g;\n var DOUBLE_QUOTE_CASE_PATTERN = /=\"([a-zA-Z][a-zA-Z\\d\\-_]+)\"([iI])/g;\n var DOUBLE_QUOTE_PATTERN = /=\"([a-zA-Z][a-zA-Z\\d\\-_]+)\"(\\s|\\])/g;\n var HTML_COMMENT_PATTERN = /^(?:(?:)\\s*)+/;\n var SINGLE_QUOTE_CASE_PATTERN = /='([a-zA-Z][a-zA-Z\\d\\-_]+)'([iI])/g;\n var SINGLE_QUOTE_PATTERN = /='([a-zA-Z][a-zA-Z\\d\\-_]+)'(\\s|\\])/g;\n var RELATION_PATTERN = /[>\\+~]/;\n var WHITESPACE_PATTERN = /\\s/;\n\n var ASTERISK_PLUS_HTML_HACK = \"*+html \";\n var ASTERISK_FIRST_CHILD_PLUS_HTML_HACK = \"*:first-child+html \";\n var LESS_THAN = \"<\";\n\n function hasInvalidCharacters(value) {\n var isEscaped;\n var isInvalid = false;\n var character;\n var isQuote = false;\n var i, l;\n\n for (i = 0, l = value.length; i < l; i++) {\n character = value[i];\n\n if (isEscaped) {\n // continue as always\n } else if (\n character == Marker.SINGLE_QUOTE ||\n character == Marker.DOUBLE_QUOTE\n ) {\n isQuote = !isQuote;\n } else if (\n !isQuote &&\n (character == Marker.CLOSE_CURLY_BRACKET ||\n character == Marker.EXCLAMATION ||\n character == LESS_THAN ||\n character == Marker.SEMICOLON)\n ) {\n isInvalid = true;\n break;\n } else if (\n !isQuote &&\n i === 0 &&\n RELATION_PATTERN.test(character)\n ) {\n isInvalid = true;\n break;\n }\n\n isEscaped = character == Marker.BACK_SLASH;\n }\n\n return isInvalid;\n }\n\n function removeWhitespace(value, format) {\n var stripped = [];\n var character;\n var isNewLineNix;\n var isNewLineWin;\n var isEscaped;\n var wasEscaped;\n var isQuoted;\n var isSingleQuoted;\n var isDoubleQuoted;\n var isAttribute;\n var isRelation;\n var isWhitespace;\n var roundBracketLevel = 0;\n var wasRelation = false;\n var wasWhitespace = false;\n var withCaseAttribute = CASE_ATTRIBUTE_PATTERN.test(value);\n var spaceAroundRelation =\n format && format.spaces[Spaces.AroundSelectorRelation];\n var i, l;\n\n for (i = 0, l = value.length; i < l; i++) {\n character = value[i];\n\n isNewLineNix = character == Marker.NEW_LINE_NIX;\n isNewLineWin =\n character == Marker.NEW_LINE_NIX &&\n value[i - 1] == Marker.CARRIAGE_RETURN;\n isQuoted = isSingleQuoted || isDoubleQuoted;\n isRelation =\n !isAttribute &&\n !isEscaped &&\n roundBracketLevel === 0 &&\n RELATION_PATTERN.test(character);\n isWhitespace = WHITESPACE_PATTERN.test(character);\n\n if (wasEscaped && isQuoted && isNewLineWin) {\n // swallow escaped new windows lines in comments\n stripped.pop();\n stripped.pop();\n } else if (isEscaped && isQuoted && isNewLineNix) {\n // swallow escaped new *nix lines in comments\n stripped.pop();\n } else if (isEscaped) {\n stripped.push(character);\n } else if (character == Marker.OPEN_SQUARE_BRACKET && !isQuoted) {\n stripped.push(character);\n isAttribute = true;\n } else if (character == Marker.CLOSE_SQUARE_BRACKET && !isQuoted) {\n stripped.push(character);\n isAttribute = false;\n } else if (character == Marker.OPEN_ROUND_BRACKET && !isQuoted) {\n stripped.push(character);\n roundBracketLevel++;\n } else if (character == Marker.CLOSE_ROUND_BRACKET && !isQuoted) {\n stripped.push(character);\n roundBracketLevel--;\n } else if (character == Marker.SINGLE_QUOTE && !isQuoted) {\n stripped.push(character);\n isSingleQuoted = true;\n } else if (character == Marker.DOUBLE_QUOTE && !isQuoted) {\n stripped.push(character);\n isDoubleQuoted = true;\n } else if (character == Marker.SINGLE_QUOTE && isQuoted) {\n stripped.push(character);\n isSingleQuoted = false;\n } else if (character == Marker.DOUBLE_QUOTE && isQuoted) {\n stripped.push(character);\n isDoubleQuoted = false;\n } else if (isWhitespace && wasRelation && !spaceAroundRelation) {\n continue;\n } else if (!isWhitespace && wasRelation && spaceAroundRelation) {\n stripped.push(Marker.SPACE);\n stripped.push(character);\n } else if (\n isWhitespace &&\n (isAttribute || roundBracketLevel > 0) &&\n !isQuoted\n ) {\n // skip space\n } else if (isWhitespace && wasWhitespace && !isQuoted) {\n // skip extra space\n } else if (\n (isNewLineWin || isNewLineNix) &&\n (isAttribute || roundBracketLevel > 0) &&\n isQuoted\n ) {\n // skip newline\n } else if (isRelation && wasWhitespace && !spaceAroundRelation) {\n stripped.pop();\n stripped.push(character);\n } else if (isRelation && !wasWhitespace && spaceAroundRelation) {\n stripped.push(Marker.SPACE);\n stripped.push(character);\n } else if (isWhitespace) {\n stripped.push(Marker.SPACE);\n } else {\n stripped.push(character);\n }\n\n wasEscaped = isEscaped;\n isEscaped = character == Marker.BACK_SLASH;\n wasRelation = isRelation;\n wasWhitespace = isWhitespace;\n }\n\n return withCaseAttribute\n ? stripped.join(\"\").replace(CASE_RESTORE_PATTERN, \"$1 $2]\")\n : stripped.join(\"\");\n }\n\n function removeQuotes(value) {\n if (value.indexOf(\"'\") == -1 && value.indexOf('\"') == -1) {\n return value;\n }\n\n return value\n .replace(SINGLE_QUOTE_CASE_PATTERN, \"=$1 $2\")\n .replace(SINGLE_QUOTE_PATTERN, \"=$1$2\")\n .replace(DOUBLE_QUOTE_CASE_PATTERN, \"=$1 $2\")\n .replace(DOUBLE_QUOTE_PATTERN, \"=$1$2\");\n }\n\n function tidyRules(\n rules,\n removeUnsupported,\n adjacentSpace,\n format,\n warnings\n ) {\n var list = [];\n var repeated = [];\n\n function removeHTMLComment(rule, match) {\n warnings.push(\n \"HTML comment '\" +\n match +\n \"' at \" +\n formatPosition(rule[2][0]) +\n \". Removing.\"\n );\n return \"\";\n }\n\n for (var i = 0, l = rules.length; i < l; i++) {\n var rule = rules[i];\n var reduced = rule[1];\n\n reduced = reduced.replace(\n HTML_COMMENT_PATTERN,\n removeHTMLComment.bind(null, rule)\n );\n\n if (hasInvalidCharacters(reduced)) {\n warnings.push(\n \"Invalid selector '\" +\n rule[1] +\n \"' at \" +\n formatPosition(rule[2][0]) +\n \". Ignoring.\"\n );\n continue;\n }\n\n reduced = removeWhitespace(reduced, format);\n reduced = removeQuotes(reduced);\n\n if (adjacentSpace && reduced.indexOf(\"nav\") > 0) {\n reduced = reduced.replace(/\\+nav(\\S|$)/, \"+ nav$1\");\n }\n\n if (\n removeUnsupported &&\n reduced.indexOf(ASTERISK_PLUS_HTML_HACK) > -1\n ) {\n continue;\n }\n\n if (\n removeUnsupported &&\n reduced.indexOf(ASTERISK_FIRST_CHILD_PLUS_HTML_HACK) > -1\n ) {\n continue;\n }\n\n if (reduced.indexOf(\"*\") > -1) {\n reduced = reduced\n .replace(/\\*([:#\\.\\[])/g, \"$1\")\n .replace(/^(\\:first\\-child)?\\+html/, \"*$1+html\");\n }\n\n if (repeated.indexOf(reduced) > -1) {\n continue;\n }\n\n rule[1] = reduced;\n repeated.push(reduced);\n list.push(rule);\n }\n\n if (list.length == 1 && list[0][1].length === 0) {\n warnings.push(\n \"Empty selector '\" +\n list[0][1] +\n \"' at \" +\n formatPosition(list[0][2][0]) +\n \". Ignoring.\"\n );\n list = [];\n }\n\n return list;\n }\n\n module.exports = tidyRules;\n },\n {\n \"../../options/format\": 61,\n \"../../tokenizer/marker\": 83,\n \"../../utils/format-position\": 87\n }\n ],\n 18: [\n function(require, module, exports) {\n var InvalidPropertyError = require(\"./invalid-property-error\");\n\n var wrapSingle = require(\"../wrap-for-optimizing\").single;\n\n var Token = require(\"../../tokenizer/token\");\n var Marker = require(\"../../tokenizer/marker\");\n\n var formatPosition = require(\"../../utils/format-position\");\n\n function _anyIsInherit(values) {\n var i, l;\n\n for (i = 0, l = values.length; i < l; i++) {\n if (values[i][1] == \"inherit\") {\n return true;\n }\n }\n\n return false;\n }\n\n function _colorFilter(validator) {\n return function(value) {\n return (\n value[1] == \"invert\" ||\n validator.isColor(value[1]) ||\n validator.isPrefixed(value[1])\n );\n };\n }\n\n function _styleFilter(validator) {\n return function(value) {\n return (\n value[1] != \"inherit\" &&\n validator.isStyleKeyword(value[1]) &&\n !validator.isColorFunction(value[1])\n );\n };\n }\n\n function _wrapDefault(name, property, compactable) {\n var descriptor = compactable[name];\n if (descriptor.doubleValues && descriptor.defaultValue.length == 2) {\n return wrapSingle([\n Token.PROPERTY,\n [Token.PROPERTY_NAME, name],\n [Token.PROPERTY_VALUE, descriptor.defaultValue[0]],\n [Token.PROPERTY_VALUE, descriptor.defaultValue[1]]\n ]);\n } else if (\n descriptor.doubleValues &&\n descriptor.defaultValue.length == 1\n ) {\n return wrapSingle([\n Token.PROPERTY,\n [Token.PROPERTY_NAME, name],\n [Token.PROPERTY_VALUE, descriptor.defaultValue[0]]\n ]);\n } else {\n return wrapSingle([\n Token.PROPERTY,\n [Token.PROPERTY_NAME, name],\n [Token.PROPERTY_VALUE, descriptor.defaultValue]\n ]);\n }\n }\n\n function _widthFilter(validator) {\n return function(value) {\n return (\n value[1] != \"inherit\" &&\n (validator.isWidth(value[1]) ||\n (validator.isUnit(value[1]) &&\n !validator.isDynamicUnit(value[1]))) &&\n !validator.isStyleKeyword(value[1]) &&\n !validator.isColorFunction(value[1])\n );\n };\n }\n\n function animation(property, compactable, validator) {\n var duration = _wrapDefault(\n property.name + \"-duration\",\n property,\n compactable\n );\n var timing = _wrapDefault(\n property.name + \"-timing-function\",\n property,\n compactable\n );\n var delay = _wrapDefault(\n property.name + \"-delay\",\n property,\n compactable\n );\n var iteration = _wrapDefault(\n property.name + \"-iteration-count\",\n property,\n compactable\n );\n var direction = _wrapDefault(\n property.name + \"-direction\",\n property,\n compactable\n );\n var fill = _wrapDefault(\n property.name + \"-fill-mode\",\n property,\n compactable\n );\n var play = _wrapDefault(\n property.name + \"-play-state\",\n property,\n compactable\n );\n var name = _wrapDefault(\n property.name + \"-name\",\n property,\n compactable\n );\n var components = [\n duration,\n timing,\n delay,\n iteration,\n direction,\n fill,\n play,\n name\n ];\n var values = property.value;\n var value;\n var durationSet = false;\n var timingSet = false;\n var delaySet = false;\n var iterationSet = false;\n var directionSet = false;\n var fillSet = false;\n var playSet = false;\n var nameSet = false;\n var i;\n var l;\n\n if (property.value.length == 1 && property.value[0][1] == \"inherit\") {\n duration.value = timing.value = delay.value = iteration.value = direction.value = fill.value = play.value = name.value =\n property.value;\n return components;\n }\n\n if (values.length > 1 && _anyIsInherit(values)) {\n throw new InvalidPropertyError(\n \"Invalid animation values at \" +\n formatPosition(values[0][2][0]) +\n \". Ignoring.\"\n );\n }\n\n for (i = 0, l = values.length; i < l; i++) {\n value = values[i];\n\n if (validator.isTime(value[1]) && !durationSet) {\n duration.value = [value];\n durationSet = true;\n } else if (validator.isTime(value[1]) && !delaySet) {\n delay.value = [value];\n delaySet = true;\n } else if (\n (validator.isGlobal(value[1]) ||\n validator.isTimingFunction(value[1])) &&\n !timingSet\n ) {\n timing.value = [value];\n timingSet = true;\n } else if (\n (validator.isAnimationIterationCountKeyword(value[1]) ||\n validator.isPositiveNumber(value[1])) &&\n !iterationSet\n ) {\n iteration.value = [value];\n iterationSet = true;\n } else if (\n validator.isAnimationDirectionKeyword(value[1]) &&\n !directionSet\n ) {\n direction.value = [value];\n directionSet = true;\n } else if (\n validator.isAnimationFillModeKeyword(value[1]) &&\n !fillSet\n ) {\n fill.value = [value];\n fillSet = true;\n } else if (\n validator.isAnimationPlayStateKeyword(value[1]) &&\n !playSet\n ) {\n play.value = [value];\n playSet = true;\n } else if (\n (validator.isAnimationNameKeyword(value[1]) ||\n validator.isIdentifier(value[1])) &&\n !nameSet\n ) {\n name.value = [value];\n nameSet = true;\n } else {\n throw new InvalidPropertyError(\n \"Invalid animation value at \" +\n formatPosition(value[2][0]) +\n \". Ignoring.\"\n );\n }\n }\n\n return components;\n }\n\n function background(property, compactable, validator) {\n var image = _wrapDefault(\"background-image\", property, compactable);\n var position = _wrapDefault(\n \"background-position\",\n property,\n compactable\n );\n var size = _wrapDefault(\"background-size\", property, compactable);\n var repeat = _wrapDefault(\"background-repeat\", property, compactable);\n var attachment = _wrapDefault(\n \"background-attachment\",\n property,\n compactable\n );\n var origin = _wrapDefault(\"background-origin\", property, compactable);\n var clip = _wrapDefault(\"background-clip\", property, compactable);\n var color = _wrapDefault(\"background-color\", property, compactable);\n var components = [\n image,\n position,\n size,\n repeat,\n attachment,\n origin,\n clip,\n color\n ];\n var values = property.value;\n\n var positionSet = false;\n var clipSet = false;\n var originSet = false;\n var repeatSet = false;\n\n var anyValueSet = false;\n\n if (property.value.length == 1 && property.value[0][1] == \"inherit\") {\n // NOTE: 'inherit' is not a valid value for background-attachment\n color.value = image.value = repeat.value = position.value = size.value = origin.value = clip.value =\n property.value;\n return components;\n }\n\n if (property.value.length == 1 && property.value[0][1] == \"0 0\") {\n return components;\n }\n\n for (var i = values.length - 1; i >= 0; i--) {\n var value = values[i];\n\n if (validator.isBackgroundAttachmentKeyword(value[1])) {\n attachment.value = [value];\n anyValueSet = true;\n } else if (\n validator.isBackgroundClipKeyword(value[1]) ||\n validator.isBackgroundOriginKeyword(value[1])\n ) {\n if (clipSet) {\n origin.value = [value];\n originSet = true;\n } else {\n clip.value = [value];\n clipSet = true;\n }\n anyValueSet = true;\n } else if (validator.isBackgroundRepeatKeyword(value[1])) {\n if (repeatSet) {\n repeat.value.unshift(value);\n } else {\n repeat.value = [value];\n repeatSet = true;\n }\n anyValueSet = true;\n } else if (\n validator.isBackgroundPositionKeyword(value[1]) ||\n validator.isBackgroundSizeKeyword(value[1]) ||\n validator.isUnit(value[1]) ||\n validator.isDynamicUnit(value[1])\n ) {\n if (i > 0) {\n var previousValue = values[i - 1];\n\n if (previousValue[1] == Marker.FORWARD_SLASH) {\n size.value = [value];\n } else if (i > 1 && values[i - 2][1] == Marker.FORWARD_SLASH) {\n size.value = [previousValue, value];\n i -= 2;\n } else {\n if (!positionSet) position.value = [];\n\n position.value.unshift(value);\n positionSet = true;\n }\n } else {\n if (!positionSet) position.value = [];\n\n position.value.unshift(value);\n positionSet = true;\n }\n anyValueSet = true;\n } else if (\n (color.value[0][1] == compactable[color.name].defaultValue ||\n color.value[0][1] == \"none\") &&\n (validator.isColor(value[1]) || validator.isPrefixed(value[1]))\n ) {\n color.value = [value];\n anyValueSet = true;\n } else if (\n validator.isUrl(value[1]) ||\n validator.isFunction(value[1])\n ) {\n image.value = [value];\n anyValueSet = true;\n }\n }\n\n if (clipSet && !originSet) origin.value = clip.value.slice(0);\n\n if (!anyValueSet) {\n throw new InvalidPropertyError(\n \"Invalid background value at \" +\n formatPosition(values[0][2][0]) +\n \". Ignoring.\"\n );\n }\n\n return components;\n }\n\n function borderRadius(property, compactable) {\n var values = property.value;\n var splitAt = -1;\n\n for (var i = 0, l = values.length; i < l; i++) {\n if (values[i][1] == Marker.FORWARD_SLASH) {\n splitAt = i;\n break;\n }\n }\n\n if (splitAt === 0 || splitAt === values.length - 1) {\n throw new InvalidPropertyError(\n \"Invalid border-radius value at \" +\n formatPosition(values[0][2][0]) +\n \". Ignoring.\"\n );\n }\n\n var target = _wrapDefault(property.name, property, compactable);\n target.value =\n splitAt > -1 ? values.slice(0, splitAt) : values.slice(0);\n target.components = fourValues(target, compactable);\n\n var remainder = _wrapDefault(property.name, property, compactable);\n remainder.value =\n splitAt > -1 ? values.slice(splitAt + 1) : values.slice(0);\n remainder.components = fourValues(remainder, compactable);\n\n for (var j = 0; j < 4; j++) {\n target.components[j].multiplex = true;\n target.components[j].value = target.components[j].value.concat(\n remainder.components[j].value\n );\n }\n\n return target.components;\n }\n\n function font(property, compactable, validator) {\n var style = _wrapDefault(\"font-style\", property, compactable);\n var variant = _wrapDefault(\"font-variant\", property, compactable);\n var weight = _wrapDefault(\"font-weight\", property, compactable);\n var stretch = _wrapDefault(\"font-stretch\", property, compactable);\n var size = _wrapDefault(\"font-size\", property, compactable);\n var height = _wrapDefault(\"line-height\", property, compactable);\n var family = _wrapDefault(\"font-family\", property, compactable);\n var components = [\n style,\n variant,\n weight,\n stretch,\n size,\n height,\n family\n ];\n var values = property.value;\n var fuzzyMatched = 4; // style, variant, weight, and stretch\n var index = 0;\n var isStretchSet = false;\n var isStretchValid;\n var isStyleSet = false;\n var isStyleValid;\n var isVariantSet = false;\n var isVariantValid;\n var isWeightSet = false;\n var isWeightValid;\n var isSizeSet = false;\n var appendableFamilyName = false;\n\n if (!values[index]) {\n throw new InvalidPropertyError(\n \"Missing font values at \" +\n formatPosition(property.all[property.position][1][2][0]) +\n \". Ignoring.\"\n );\n }\n\n if (values.length == 1 && values[0][1] == \"inherit\") {\n style.value = variant.value = weight.value = stretch.value = size.value = height.value = family.value = values;\n return components;\n }\n\n if (\n values.length == 1 &&\n (validator.isFontKeyword(values[0][1]) ||\n validator.isGlobal(values[0][1]) ||\n validator.isPrefixed(values[0][1]))\n ) {\n values[0][1] = Marker.INTERNAL + values[0][1];\n style.value = variant.value = weight.value = stretch.value = size.value = height.value = family.value = values;\n return components;\n }\n\n if (\n values.length < 2 ||\n !_anyIsFontSize(values, validator) ||\n !_anyIsFontFamily(values, validator)\n ) {\n throw new InvalidPropertyError(\n \"Invalid font values at \" +\n formatPosition(property.all[property.position][1][2][0]) +\n \". Ignoring.\"\n );\n }\n\n if (values.length > 1 && _anyIsInherit(values)) {\n throw new InvalidPropertyError(\n \"Invalid font values at \" +\n formatPosition(values[0][2][0]) +\n \". Ignoring.\"\n );\n }\n\n // fuzzy match style, variant, weight, and stretch on first elements\n while (index < fuzzyMatched) {\n isStretchValid =\n validator.isFontStretchKeyword(values[index][1]) ||\n validator.isGlobal(values[index][1]);\n isStyleValid =\n validator.isFontStyleKeyword(values[index][1]) ||\n validator.isGlobal(values[index][1]);\n isVariantValid =\n validator.isFontVariantKeyword(values[index][1]) ||\n validator.isGlobal(values[index][1]);\n isWeightValid =\n validator.isFontWeightKeyword(values[index][1]) ||\n validator.isGlobal(values[index][1]);\n\n if (isStyleValid && !isStyleSet) {\n style.value = [values[index]];\n isStyleSet = true;\n } else if (isVariantValid && !isVariantSet) {\n variant.value = [values[index]];\n isVariantSet = true;\n } else if (isWeightValid && !isWeightSet) {\n weight.value = [values[index]];\n isWeightSet = true;\n } else if (isStretchValid && !isStretchSet) {\n stretch.value = [values[index]];\n isStretchSet = true;\n } else if (\n (isStyleValid && isStyleSet) ||\n (isVariantValid && isVariantSet) ||\n (isWeightValid && isWeightSet) ||\n (isStretchValid && isStretchSet)\n ) {\n throw new InvalidPropertyError(\n \"Invalid font style / variant / weight / stretch value at \" +\n formatPosition(values[0][2][0]) +\n \". Ignoring.\"\n );\n } else {\n break;\n }\n\n index++;\n }\n\n // now comes font-size ...\n if (\n validator.isFontSizeKeyword(values[index][1]) ||\n (validator.isUnit(values[index][1]) &&\n !validator.isDynamicUnit(values[index][1]))\n ) {\n size.value = [values[index]];\n isSizeSet = true;\n index++;\n } else {\n throw new InvalidPropertyError(\n \"Missing font size at \" +\n formatPosition(values[0][2][0]) +\n \". Ignoring.\"\n );\n }\n\n if (!values[index]) {\n throw new InvalidPropertyError(\n \"Missing font family at \" +\n formatPosition(values[0][2][0]) +\n \". Ignoring.\"\n );\n }\n\n // ... and perhaps line-height\n if (\n isSizeSet &&\n values[index] &&\n values[index][1] == Marker.FORWARD_SLASH &&\n values[index + 1] &&\n (validator.isLineHeightKeyword(values[index + 1][1]) ||\n validator.isUnit(values[index + 1][1]) ||\n validator.isNumber(values[index + 1][1]))\n ) {\n height.value = [values[index + 1]];\n index++;\n index++;\n }\n\n // ... and whatever comes next is font-family\n family.value = [];\n\n while (values[index]) {\n if (values[index][1] == Marker.COMMA) {\n appendableFamilyName = false;\n } else {\n if (appendableFamilyName) {\n family.value[family.value.length - 1][1] +=\n Marker.SPACE + values[index][1];\n } else {\n family.value.push(values[index]);\n }\n\n appendableFamilyName = true;\n }\n\n index++;\n }\n\n if (family.value.length === 0) {\n throw new InvalidPropertyError(\n \"Missing font family at \" +\n formatPosition(values[0][2][0]) +\n \". Ignoring.\"\n );\n }\n\n return components;\n }\n\n function _anyIsFontSize(values, validator) {\n var value;\n var i, l;\n\n for (i = 0, l = values.length; i < l; i++) {\n value = values[i];\n\n if (\n validator.isFontSizeKeyword(value[1]) ||\n (validator.isUnit(value[1]) &&\n !validator.isDynamicUnit(value[1])) ||\n validator.isFunction(value[1])\n ) {\n return true;\n }\n }\n\n return false;\n }\n\n function _anyIsFontFamily(values, validator) {\n var value;\n var i, l;\n\n for (i = 0, l = values.length; i < l; i++) {\n value = values[i];\n\n if (validator.isIdentifier(value[1])) {\n return true;\n }\n }\n\n return false;\n }\n\n function fourValues(property, compactable) {\n var componentNames = compactable[property.name].components;\n var components = [];\n var value = property.value;\n\n if (value.length < 1) return [];\n\n if (value.length < 2) value[1] = value[0].slice(0);\n if (value.length < 3) value[2] = value[0].slice(0);\n if (value.length < 4) value[3] = value[1].slice(0);\n\n for (var i = componentNames.length - 1; i >= 0; i--) {\n var component = wrapSingle([\n Token.PROPERTY,\n [Token.PROPERTY_NAME, componentNames[i]]\n ]);\n component.value = [value[i]];\n components.unshift(component);\n }\n\n return components;\n }\n\n function multiplex(splitWith) {\n return function(property, compactable, validator) {\n var splitsAt = [];\n var values = property.value;\n var i, j, l, m;\n\n // find split commas\n for (i = 0, l = values.length; i < l; i++) {\n if (values[i][1] == \",\") splitsAt.push(i);\n }\n\n if (splitsAt.length === 0)\n return splitWith(property, compactable, validator);\n\n var splitComponents = [];\n\n // split over commas, and into components\n for (i = 0, l = splitsAt.length; i <= l; i++) {\n var from = i === 0 ? 0 : splitsAt[i - 1] + 1;\n var to = i < l ? splitsAt[i] : values.length;\n\n var _property = _wrapDefault(\n property.name,\n property,\n compactable\n );\n _property.value = values.slice(from, to);\n\n splitComponents.push(\n splitWith(_property, compactable, validator)\n );\n }\n\n var components = splitComponents[0];\n\n // group component values from each split\n for (i = 0, l = components.length; i < l; i++) {\n components[i].multiplex = true;\n\n for (j = 1, m = splitComponents.length; j < m; j++) {\n components[i].value.push([Token.PROPERTY_VALUE, Marker.COMMA]);\n Array.prototype.push.apply(\n components[i].value,\n splitComponents[j][i].value\n );\n }\n }\n\n return components;\n };\n }\n\n function listStyle(property, compactable, validator) {\n var type = _wrapDefault(\"list-style-type\", property, compactable);\n var position = _wrapDefault(\n \"list-style-position\",\n property,\n compactable\n );\n var image = _wrapDefault(\"list-style-image\", property, compactable);\n var components = [type, position, image];\n\n if (property.value.length == 1 && property.value[0][1] == \"inherit\") {\n type.value = position.value = image.value = [property.value[0]];\n return components;\n }\n\n var values = property.value.slice(0);\n var total = values.length;\n var index = 0;\n\n // `image` first...\n for (index = 0, total = values.length; index < total; index++) {\n if (validator.isUrl(values[index][1]) || values[index][1] == \"0\") {\n image.value = [values[index]];\n values.splice(index, 1);\n break;\n }\n }\n\n // ... then `position`\n for (index = 0, total = values.length; index < total; index++) {\n if (validator.isListStylePositionKeyword(values[index][1])) {\n position.value = [values[index]];\n values.splice(index, 1);\n break;\n }\n }\n\n // ... and what's left is a `type`\n if (\n values.length > 0 &&\n (validator.isListStyleTypeKeyword(values[0][1]) ||\n validator.isIdentifier(values[0][1]))\n ) {\n type.value = [values[0]];\n }\n\n return components;\n }\n\n function transition(property, compactable, validator) {\n var prop = _wrapDefault(\n property.name + \"-property\",\n property,\n compactable\n );\n var duration = _wrapDefault(\n property.name + \"-duration\",\n property,\n compactable\n );\n var timing = _wrapDefault(\n property.name + \"-timing-function\",\n property,\n compactable\n );\n var delay = _wrapDefault(\n property.name + \"-delay\",\n property,\n compactable\n );\n var components = [prop, duration, timing, delay];\n var values = property.value;\n var value;\n var durationSet = false;\n var delaySet = false;\n var propSet = false;\n var timingSet = false;\n var i;\n var l;\n\n if (property.value.length == 1 && property.value[0][1] == \"inherit\") {\n prop.value = duration.value = timing.value = delay.value =\n property.value;\n return components;\n }\n\n if (values.length > 1 && _anyIsInherit(values)) {\n throw new InvalidPropertyError(\n \"Invalid animation values at \" +\n formatPosition(values[0][2][0]) +\n \". Ignoring.\"\n );\n }\n\n for (i = 0, l = values.length; i < l; i++) {\n value = values[i];\n\n if (validator.isTime(value[1]) && !durationSet) {\n duration.value = [value];\n durationSet = true;\n } else if (validator.isTime(value[1]) && !delaySet) {\n delay.value = [value];\n delaySet = true;\n } else if (\n (validator.isGlobal(value[1]) ||\n validator.isTimingFunction(value[1])) &&\n !timingSet\n ) {\n timing.value = [value];\n timingSet = true;\n } else if (validator.isIdentifier(value[1]) && !propSet) {\n prop.value = [value];\n propSet = true;\n } else {\n throw new InvalidPropertyError(\n \"Invalid animation value at \" +\n formatPosition(value[2][0]) +\n \". Ignoring.\"\n );\n }\n }\n\n return components;\n }\n\n function widthStyleColor(property, compactable, validator) {\n var descriptor = compactable[property.name];\n var components = [\n _wrapDefault(descriptor.components[0], property, compactable),\n _wrapDefault(descriptor.components[1], property, compactable),\n _wrapDefault(descriptor.components[2], property, compactable)\n ];\n var color, style, width;\n\n for (var i = 0; i < 3; i++) {\n var component = components[i];\n\n if (component.name.indexOf(\"color\") > 0) color = component;\n else if (component.name.indexOf(\"style\") > 0) style = component;\n else width = component;\n }\n\n if (\n (property.value.length == 1 && property.value[0][1] == \"inherit\") ||\n (property.value.length == 3 &&\n property.value[0][1] == \"inherit\" &&\n property.value[1][1] == \"inherit\" &&\n property.value[2][1] == \"inherit\")\n ) {\n color.value = style.value = width.value = [property.value[0]];\n return components;\n }\n\n var values = property.value.slice(0);\n var match, matches;\n\n // NOTE: usually users don't follow the required order of parts in this shorthand,\n // so we'll try to parse it caring as little about order as possible\n\n if (values.length > 0) {\n matches = values.filter(_widthFilter(validator));\n match =\n matches.length > 1 &&\n (matches[0][1] == \"none\" || matches[0][1] == \"auto\")\n ? matches[1]\n : matches[0];\n if (match) {\n width.value = [match];\n values.splice(values.indexOf(match), 1);\n }\n }\n\n if (values.length > 0) {\n match = values.filter(_styleFilter(validator))[0];\n if (match) {\n style.value = [match];\n values.splice(values.indexOf(match), 1);\n }\n }\n\n if (values.length > 0) {\n match = values.filter(_colorFilter(validator))[0];\n if (match) {\n color.value = [match];\n values.splice(values.indexOf(match), 1);\n }\n }\n\n return components;\n }\n\n module.exports = {\n animation: animation,\n background: background,\n border: widthStyleColor,\n borderRadius: borderRadius,\n font: font,\n fourValues: fourValues,\n listStyle: listStyle,\n multiplex: multiplex,\n outline: widthStyleColor,\n transition: transition\n };\n },\n {\n \"../../tokenizer/marker\": 83,\n \"../../tokenizer/token\": 84,\n \"../../utils/format-position\": 87,\n \"../wrap-for-optimizing\": 58,\n \"./invalid-property-error\": 23\n }\n ],\n 19: [\n function(require, module, exports) {\n var understandable = require(\"./properties/understandable\");\n\n function animationIterationCount(validator, value1, value2) {\n if (\n !understandable(validator, value1, value2, 0, true) &&\n !(\n validator.isAnimationIterationCountKeyword(value2) ||\n validator.isPositiveNumber(value2)\n )\n ) {\n return false;\n } else if (\n validator.isVariable(value1) &&\n validator.isVariable(value2)\n ) {\n return true;\n }\n\n return (\n validator.isAnimationIterationCountKeyword(value2) ||\n validator.isPositiveNumber(value2)\n );\n }\n\n function animationName(validator, value1, value2) {\n if (\n !understandable(validator, value1, value2, 0, true) &&\n !(\n validator.isAnimationNameKeyword(value2) ||\n validator.isIdentifier(value2)\n )\n ) {\n return false;\n } else if (\n validator.isVariable(value1) &&\n validator.isVariable(value2)\n ) {\n return true;\n }\n\n return (\n validator.isAnimationNameKeyword(value2) ||\n validator.isIdentifier(value2)\n );\n }\n\n function areSameFunction(validator, value1, value2) {\n if (!validator.isFunction(value1) || !validator.isFunction(value2)) {\n return false;\n }\n\n var function1Name = value1.substring(0, value1.indexOf(\"(\"));\n var function2Name = value2.substring(0, value2.indexOf(\"(\"));\n\n return function1Name === function2Name;\n }\n\n function backgroundPosition(validator, value1, value2) {\n if (\n !understandable(validator, value1, value2, 0, true) &&\n !(\n validator.isBackgroundPositionKeyword(value2) ||\n validator.isGlobal(value2)\n )\n ) {\n return false;\n } else if (\n validator.isVariable(value1) &&\n validator.isVariable(value2)\n ) {\n return true;\n } else if (\n validator.isBackgroundPositionKeyword(value2) ||\n validator.isGlobal(value2)\n ) {\n return true;\n }\n\n return unit(validator, value1, value2);\n }\n\n function backgroundSize(validator, value1, value2) {\n if (\n !understandable(validator, value1, value2, 0, true) &&\n !(\n validator.isBackgroundSizeKeyword(value2) ||\n validator.isGlobal(value2)\n )\n ) {\n return false;\n } else if (\n validator.isVariable(value1) &&\n validator.isVariable(value2)\n ) {\n return true;\n } else if (\n validator.isBackgroundSizeKeyword(value2) ||\n validator.isGlobal(value2)\n ) {\n return true;\n }\n\n return unit(validator, value1, value2);\n }\n\n function color(validator, value1, value2) {\n if (\n !understandable(validator, value1, value2, 0, true) &&\n !validator.isColor(value2)\n ) {\n return false;\n } else if (\n validator.isVariable(value1) &&\n validator.isVariable(value2)\n ) {\n return true;\n } else if (\n !validator.colorOpacity &&\n (validator.isRgbColor(value1) || validator.isHslColor(value1))\n ) {\n return false;\n } else if (\n !validator.colorOpacity &&\n (validator.isRgbColor(value2) || validator.isHslColor(value2))\n ) {\n return false;\n } else if (validator.isColor(value1) && validator.isColor(value2)) {\n return true;\n }\n\n return sameFunctionOrValue(validator, value1, value2);\n }\n\n function components(overrideCheckers) {\n return function(validator, value1, value2, position) {\n return overrideCheckers[position](validator, value1, value2);\n };\n }\n\n function fontFamily(validator, value1, value2) {\n return understandable(validator, value1, value2, 0, true);\n }\n\n function image(validator, value1, value2) {\n if (\n !understandable(validator, value1, value2, 0, true) &&\n !validator.isImage(value2)\n ) {\n return false;\n } else if (\n validator.isVariable(value1) &&\n validator.isVariable(value2)\n ) {\n return true;\n } else if (validator.isImage(value2)) {\n return true;\n } else if (validator.isImage(value1)) {\n return false;\n }\n\n return sameFunctionOrValue(validator, value1, value2);\n }\n\n function keyword(propertyName) {\n return function(validator, value1, value2) {\n if (\n !understandable(validator, value1, value2, 0, true) &&\n !validator.isKeyword(propertyName)(value2)\n ) {\n return false;\n } else if (\n validator.isVariable(value1) &&\n validator.isVariable(value2)\n ) {\n return true;\n }\n\n return validator.isKeyword(propertyName)(value2);\n };\n }\n\n function keywordWithGlobal(propertyName) {\n return function(validator, value1, value2) {\n if (\n !understandable(validator, value1, value2, 0, true) &&\n !(\n validator.isKeyword(propertyName)(value2) ||\n validator.isGlobal(value2)\n )\n ) {\n return false;\n } else if (\n validator.isVariable(value1) &&\n validator.isVariable(value2)\n ) {\n return true;\n }\n\n return (\n validator.isKeyword(propertyName)(value2) ||\n validator.isGlobal(value2)\n );\n };\n }\n\n function propertyName(validator, value1, value2) {\n if (\n !understandable(validator, value1, value2, 0, true) &&\n !validator.isIdentifier(value2)\n ) {\n return false;\n } else if (\n validator.isVariable(value1) &&\n validator.isVariable(value2)\n ) {\n return true;\n }\n\n return validator.isIdentifier(value2);\n }\n\n function sameFunctionOrValue(validator, value1, value2) {\n return areSameFunction(validator, value1, value2)\n ? true\n : value1 === value2;\n }\n\n function textShadow(validator, value1, value2) {\n if (\n !understandable(validator, value1, value2, 0, true) &&\n !(\n validator.isUnit(value2) ||\n validator.isColor(value2) ||\n validator.isGlobal(value2)\n )\n ) {\n return false;\n } else if (\n validator.isVariable(value1) &&\n validator.isVariable(value2)\n ) {\n return true;\n }\n\n return (\n validator.isUnit(value2) ||\n validator.isColor(value2) ||\n validator.isGlobal(value2)\n );\n }\n\n function time(validator, value1, value2) {\n if (\n !understandable(validator, value1, value2, 0, true) &&\n !validator.isTime(value2)\n ) {\n return false;\n } else if (\n validator.isVariable(value1) &&\n validator.isVariable(value2)\n ) {\n return true;\n } else if (validator.isTime(value1) && !validator.isTime(value2)) {\n return false;\n } else if (validator.isTime(value2)) {\n return true;\n } else if (validator.isTime(value1)) {\n return false;\n } else if (\n validator.isFunction(value1) &&\n !validator.isPrefixed(value1) &&\n validator.isFunction(value2) &&\n !validator.isPrefixed(value2)\n ) {\n return true;\n }\n\n return sameFunctionOrValue(validator, value1, value2);\n }\n\n function timingFunction(validator, value1, value2) {\n if (\n !understandable(validator, value1, value2, 0, true) &&\n !(validator.isTimingFunction(value2) || validator.isGlobal(value2))\n ) {\n return false;\n } else if (\n validator.isVariable(value1) &&\n validator.isVariable(value2)\n ) {\n return true;\n }\n\n return (\n validator.isTimingFunction(value2) || validator.isGlobal(value2)\n );\n }\n\n function unit(validator, value1, value2) {\n if (\n !understandable(validator, value1, value2, 0, true) &&\n !validator.isUnit(value2)\n ) {\n return false;\n } else if (\n validator.isVariable(value1) &&\n validator.isVariable(value2)\n ) {\n return true;\n } else if (validator.isUnit(value1) && !validator.isUnit(value2)) {\n return false;\n } else if (validator.isUnit(value2)) {\n return true;\n } else if (validator.isUnit(value1)) {\n return false;\n } else if (\n validator.isFunction(value1) &&\n !validator.isPrefixed(value1) &&\n validator.isFunction(value2) &&\n !validator.isPrefixed(value2)\n ) {\n return true;\n }\n\n return sameFunctionOrValue(validator, value1, value2);\n }\n\n function unitOrKeywordWithGlobal(propertyName) {\n var byKeyword = keywordWithGlobal(propertyName);\n\n return function(validator, value1, value2) {\n return (\n unit(validator, value1, value2) ||\n byKeyword(validator, value1, value2)\n );\n };\n }\n\n function unitOrNumber(validator, value1, value2) {\n if (\n !understandable(validator, value1, value2, 0, true) &&\n !(validator.isUnit(value2) || validator.isNumber(value2))\n ) {\n return false;\n } else if (\n validator.isVariable(value1) &&\n validator.isVariable(value2)\n ) {\n return true;\n } else if (\n (validator.isUnit(value1) || validator.isNumber(value1)) &&\n !(validator.isUnit(value2) || validator.isNumber(value2))\n ) {\n return false;\n } else if (validator.isUnit(value2) || validator.isNumber(value2)) {\n return true;\n } else if (validator.isUnit(value1) || validator.isNumber(value1)) {\n return false;\n } else if (\n validator.isFunction(value1) &&\n !validator.isPrefixed(value1) &&\n validator.isFunction(value2) &&\n !validator.isPrefixed(value2)\n ) {\n return true;\n }\n\n return sameFunctionOrValue(validator, value1, value2);\n }\n\n function zIndex(validator, value1, value2) {\n if (\n !understandable(validator, value1, value2, 0, true) &&\n !validator.isZIndex(value2)\n ) {\n return false;\n } else if (\n validator.isVariable(value1) &&\n validator.isVariable(value2)\n ) {\n return true;\n }\n\n return validator.isZIndex(value2);\n }\n\n module.exports = {\n generic: {\n color: color,\n components: components,\n image: image,\n propertyName: propertyName,\n time: time,\n timingFunction: timingFunction,\n unit: unit,\n unitOrNumber: unitOrNumber\n },\n property: {\n animationDirection: keywordWithGlobal(\"animation-direction\"),\n animationFillMode: keyword(\"animation-fill-mode\"),\n animationIterationCount: animationIterationCount,\n animationName: animationName,\n animationPlayState: keywordWithGlobal(\"animation-play-state\"),\n backgroundAttachment: keyword(\"background-attachment\"),\n backgroundClip: keywordWithGlobal(\"background-clip\"),\n backgroundOrigin: keyword(\"background-origin\"),\n backgroundPosition: backgroundPosition,\n backgroundRepeat: keyword(\"background-repeat\"),\n backgroundSize: backgroundSize,\n bottom: unitOrKeywordWithGlobal(\"bottom\"),\n borderCollapse: keyword(\"border-collapse\"),\n borderStyle: keywordWithGlobal(\"*-style\"),\n clear: keywordWithGlobal(\"clear\"),\n cursor: keywordWithGlobal(\"cursor\"),\n display: keywordWithGlobal(\"display\"),\n float: keywordWithGlobal(\"float\"),\n left: unitOrKeywordWithGlobal(\"left\"),\n fontFamily: fontFamily,\n fontStretch: keywordWithGlobal(\"font-stretch\"),\n fontStyle: keywordWithGlobal(\"font-style\"),\n fontVariant: keywordWithGlobal(\"font-variant\"),\n fontWeight: keywordWithGlobal(\"font-weight\"),\n listStyleType: keywordWithGlobal(\"list-style-type\"),\n listStylePosition: keywordWithGlobal(\"list-style-position\"),\n outlineStyle: keywordWithGlobal(\"*-style\"),\n overflow: keywordWithGlobal(\"overflow\"),\n position: keywordWithGlobal(\"position\"),\n right: unitOrKeywordWithGlobal(\"right\"),\n textAlign: keywordWithGlobal(\"text-align\"),\n textDecoration: keywordWithGlobal(\"text-decoration\"),\n textOverflow: keywordWithGlobal(\"text-overflow\"),\n textShadow: textShadow,\n top: unitOrKeywordWithGlobal(\"top\"),\n transform: sameFunctionOrValue,\n verticalAlign: unitOrKeywordWithGlobal(\"vertical-align\"),\n visibility: keywordWithGlobal(\"visibility\"),\n whiteSpace: keywordWithGlobal(\"white-space\"),\n zIndex: zIndex\n }\n };\n },\n { \"./properties/understandable\": 40 }\n ],\n 20: [\n function(require, module, exports) {\n var wrapSingle = require(\"../wrap-for-optimizing\").single;\n\n var Token = require(\"../../tokenizer/token\");\n\n function deep(property) {\n var cloned = shallow(property);\n for (var i = property.components.length - 1; i >= 0; i--) {\n var component = shallow(property.components[i]);\n component.value = property.components[i].value.slice(0);\n cloned.components.unshift(component);\n }\n\n cloned.dirty = true;\n cloned.value = property.value.slice(0);\n\n return cloned;\n }\n\n function shallow(property) {\n var cloned = wrapSingle([\n Token.PROPERTY,\n [Token.PROPERTY_NAME, property.name]\n ]);\n cloned.important = property.important;\n cloned.hack = property.hack;\n cloned.unused = false;\n return cloned;\n }\n\n module.exports = {\n deep: deep,\n shallow: shallow\n };\n },\n { \"../../tokenizer/token\": 84, \"../wrap-for-optimizing\": 58 }\n ],\n 21: [\n function(require, module, exports) {\n // Contains the interpretation of CSS properties, as used by the property optimizer\n\n var breakUp = require(\"./break-up\");\n var canOverride = require(\"./can-override\");\n var restore = require(\"./restore\");\n\n var override = require(\"../../utils/override\");\n\n // Properties to process\n // Extend this object in order to add support for more properties in the optimizer.\n //\n // Each key in this object represents a CSS property and should be an object.\n // Such an object contains properties that describe how the represented CSS property should be handled.\n // Possible options:\n //\n // * components: array (Only specify for shorthand properties.)\n // Contains the names of the granular properties this shorthand compacts.\n //\n // * canOverride: function\n // Returns whether two tokens of this property can be merged with each other.\n // This property has no meaning for shorthands.\n //\n // * defaultValue: string\n // Specifies the default value of the property according to the CSS standard.\n // For shorthand, this is used when every component is set to its default value, therefore it should be the shortest possible default value of all the components.\n //\n // * shortestValue: string\n // Specifies the shortest possible value the property can possibly have.\n // (Falls back to defaultValue if unspecified.)\n //\n // * breakUp: function (Only specify for shorthand properties.)\n // Breaks the shorthand up to its components.\n //\n // * restore: function (Only specify for shorthand properties.)\n // Puts the shorthand together from its components.\n //\n var compactable = {\n animation: {\n canOverride: canOverride.generic.components([\n canOverride.generic.time,\n canOverride.generic.timingFunction,\n canOverride.generic.time,\n canOverride.property.animationIterationCount,\n canOverride.property.animationDirection,\n canOverride.property.animationFillMode,\n canOverride.property.animationPlayState,\n canOverride.property.animationName\n ]),\n components: [\n \"animation-duration\",\n \"animation-timing-function\",\n \"animation-delay\",\n \"animation-iteration-count\",\n \"animation-direction\",\n \"animation-fill-mode\",\n \"animation-play-state\",\n \"animation-name\"\n ],\n breakUp: breakUp.multiplex(breakUp.animation),\n defaultValue: \"none\",\n restore: restore.multiplex(restore.withoutDefaults),\n shorthand: true,\n vendorPrefixes: [\"-moz-\", \"-o-\", \"-webkit-\"]\n },\n \"animation-delay\": {\n canOverride: canOverride.generic.time,\n componentOf: [\"animation\"],\n defaultValue: \"0s\",\n intoMultiplexMode: \"real\",\n vendorPrefixes: [\"-moz-\", \"-o-\", \"-webkit-\"]\n },\n \"animation-direction\": {\n canOverride: canOverride.property.animationDirection,\n componentOf: [\"animation\"],\n defaultValue: \"normal\",\n intoMultiplexMode: \"real\",\n vendorPrefixes: [\"-moz-\", \"-o-\", \"-webkit-\"]\n },\n \"animation-duration\": {\n canOverride: canOverride.generic.time,\n componentOf: [\"animation\"],\n defaultValue: \"0s\",\n intoMultiplexMode: \"real\",\n keepUnlessDefault: \"animation-delay\",\n vendorPrefixes: [\"-moz-\", \"-o-\", \"-webkit-\"]\n },\n \"animation-fill-mode\": {\n canOverride: canOverride.property.animationFillMode,\n componentOf: [\"animation\"],\n defaultValue: \"none\",\n intoMultiplexMode: \"real\",\n vendorPrefixes: [\"-moz-\", \"-o-\", \"-webkit-\"]\n },\n \"animation-iteration-count\": {\n canOverride: canOverride.property.animationIterationCount,\n componentOf: [\"animation\"],\n defaultValue: \"1\",\n intoMultiplexMode: \"real\",\n vendorPrefixes: [\"-moz-\", \"-o-\", \"-webkit-\"]\n },\n \"animation-name\": {\n canOverride: canOverride.property.animationName,\n componentOf: [\"animation\"],\n defaultValue: \"none\",\n intoMultiplexMode: \"real\",\n vendorPrefixes: [\"-moz-\", \"-o-\", \"-webkit-\"]\n },\n \"animation-play-state\": {\n canOverride: canOverride.property.animationPlayState,\n componentOf: [\"animation\"],\n defaultValue: \"running\",\n intoMultiplexMode: \"real\",\n vendorPrefixes: [\"-moz-\", \"-o-\", \"-webkit-\"]\n },\n \"animation-timing-function\": {\n canOverride: canOverride.generic.timingFunction,\n componentOf: [\"animation\"],\n defaultValue: \"ease\",\n intoMultiplexMode: \"real\",\n vendorPrefixes: [\"-moz-\", \"-o-\", \"-webkit-\"]\n },\n background: {\n canOverride: canOverride.generic.components([\n canOverride.generic.image,\n canOverride.property.backgroundPosition,\n canOverride.property.backgroundSize,\n canOverride.property.backgroundRepeat,\n canOverride.property.backgroundAttachment,\n canOverride.property.backgroundOrigin,\n canOverride.property.backgroundClip,\n canOverride.generic.color\n ]),\n components: [\n \"background-image\",\n \"background-position\",\n \"background-size\",\n \"background-repeat\",\n \"background-attachment\",\n \"background-origin\",\n \"background-clip\",\n \"background-color\"\n ],\n breakUp: breakUp.multiplex(breakUp.background),\n defaultValue: \"0 0\",\n restore: restore.multiplex(restore.background),\n shortestValue: \"0\",\n shorthand: true\n },\n \"background-attachment\": {\n canOverride: canOverride.property.backgroundAttachment,\n componentOf: [\"background\"],\n defaultValue: \"scroll\",\n intoMultiplexMode: \"real\"\n },\n \"background-clip\": {\n canOverride: canOverride.property.backgroundClip,\n componentOf: [\"background\"],\n defaultValue: \"border-box\",\n intoMultiplexMode: \"real\",\n shortestValue: \"border-box\"\n },\n \"background-color\": {\n canOverride: canOverride.generic.color,\n componentOf: [\"background\"],\n defaultValue: \"transparent\",\n intoMultiplexMode: \"real\", // otherwise real color will turn into default since color appears in last multiplex only\n multiplexLastOnly: true,\n nonMergeableValue: \"none\",\n shortestValue: \"red\"\n },\n \"background-image\": {\n canOverride: canOverride.generic.image,\n componentOf: [\"background\"],\n defaultValue: \"none\",\n intoMultiplexMode: \"default\"\n },\n \"background-origin\": {\n canOverride: canOverride.property.backgroundOrigin,\n componentOf: [\"background\"],\n defaultValue: \"padding-box\",\n intoMultiplexMode: \"real\",\n shortestValue: \"border-box\"\n },\n \"background-position\": {\n canOverride: canOverride.property.backgroundPosition,\n componentOf: [\"background\"],\n defaultValue: [\"0\", \"0\"],\n doubleValues: true,\n intoMultiplexMode: \"real\",\n shortestValue: \"0\"\n },\n \"background-repeat\": {\n canOverride: canOverride.property.backgroundRepeat,\n componentOf: [\"background\"],\n defaultValue: [\"repeat\"],\n doubleValues: true,\n intoMultiplexMode: \"real\"\n },\n \"background-size\": {\n canOverride: canOverride.property.backgroundSize,\n componentOf: [\"background\"],\n defaultValue: [\"auto\"],\n doubleValues: true,\n intoMultiplexMode: \"real\",\n shortestValue: \"0 0\"\n },\n bottom: {\n canOverride: canOverride.property.bottom,\n defaultValue: \"auto\"\n },\n border: {\n breakUp: breakUp.border,\n canOverride: canOverride.generic.components([\n canOverride.generic.unit,\n canOverride.property.borderStyle,\n canOverride.generic.color\n ]),\n components: [\"border-width\", \"border-style\", \"border-color\"],\n defaultValue: \"none\",\n overridesShorthands: [\n \"border-bottom\",\n \"border-left\",\n \"border-right\",\n \"border-top\"\n ],\n restore: restore.withoutDefaults,\n shorthand: true,\n shorthandComponents: true\n },\n \"border-bottom\": {\n breakUp: breakUp.border,\n canOverride: canOverride.generic.components([\n canOverride.generic.unit,\n canOverride.property.borderStyle,\n canOverride.generic.color\n ]),\n components: [\n \"border-bottom-width\",\n \"border-bottom-style\",\n \"border-bottom-color\"\n ],\n defaultValue: \"none\",\n restore: restore.withoutDefaults,\n shorthand: true\n },\n \"border-bottom-color\": {\n canOverride: canOverride.generic.color,\n componentOf: [\"border-bottom\", \"border-color\"],\n defaultValue: \"none\"\n },\n \"border-bottom-left-radius\": {\n canOverride: canOverride.generic.unit,\n componentOf: [\"border-radius\"],\n defaultValue: \"0\",\n vendorPrefixes: [\"-moz-\", \"-o-\"]\n },\n \"border-bottom-right-radius\": {\n canOverride: canOverride.generic.unit,\n componentOf: [\"border-radius\"],\n defaultValue: \"0\",\n vendorPrefixes: [\"-moz-\", \"-o-\"]\n },\n \"border-bottom-style\": {\n canOverride: canOverride.property.borderStyle,\n componentOf: [\"border-bottom\", \"border-style\"],\n defaultValue: \"none\"\n },\n \"border-bottom-width\": {\n canOverride: canOverride.generic.unit,\n componentOf: [\"border-bottom\", \"border-width\"],\n defaultValue: \"medium\",\n oppositeTo: \"border-top-width\",\n shortestValue: \"0\"\n },\n \"border-collapse\": {\n canOverride: canOverride.property.borderCollapse,\n defaultValue: \"separate\"\n },\n \"border-color\": {\n breakUp: breakUp.fourValues,\n canOverride: canOverride.generic.components([\n canOverride.generic.color,\n canOverride.generic.color,\n canOverride.generic.color,\n canOverride.generic.color\n ]),\n componentOf: [\"border\"],\n components: [\n \"border-top-color\",\n \"border-right-color\",\n \"border-bottom-color\",\n \"border-left-color\"\n ],\n defaultValue: \"none\",\n restore: restore.fourValues,\n shortestValue: \"red\",\n shorthand: true\n },\n \"border-left\": {\n breakUp: breakUp.border,\n canOverride: canOverride.generic.components([\n canOverride.generic.unit,\n canOverride.property.borderStyle,\n canOverride.generic.color\n ]),\n components: [\n \"border-left-width\",\n \"border-left-style\",\n \"border-left-color\"\n ],\n defaultValue: \"none\",\n restore: restore.withoutDefaults,\n shorthand: true\n },\n \"border-left-color\": {\n canOverride: canOverride.generic.color,\n componentOf: [\"border-color\", \"border-left\"],\n defaultValue: \"none\"\n },\n \"border-left-style\": {\n canOverride: canOverride.property.borderStyle,\n componentOf: [\"border-left\", \"border-style\"],\n defaultValue: \"none\"\n },\n \"border-left-width\": {\n canOverride: canOverride.generic.unit,\n componentOf: [\"border-left\", \"border-width\"],\n defaultValue: \"medium\",\n oppositeTo: \"border-right-width\",\n shortestValue: \"0\"\n },\n \"border-radius\": {\n breakUp: breakUp.borderRadius,\n canOverride: canOverride.generic.components([\n canOverride.generic.unit,\n canOverride.generic.unit,\n canOverride.generic.unit,\n canOverride.generic.unit\n ]),\n components: [\n \"border-top-left-radius\",\n \"border-top-right-radius\",\n \"border-bottom-right-radius\",\n \"border-bottom-left-radius\"\n ],\n defaultValue: \"0\",\n restore: restore.borderRadius,\n shorthand: true,\n vendorPrefixes: [\"-moz-\", \"-o-\"]\n },\n \"border-right\": {\n breakUp: breakUp.border,\n canOverride: canOverride.generic.components([\n canOverride.generic.unit,\n canOverride.property.borderStyle,\n canOverride.generic.color\n ]),\n components: [\n \"border-right-width\",\n \"border-right-style\",\n \"border-right-color\"\n ],\n defaultValue: \"none\",\n restore: restore.withoutDefaults,\n shorthand: true\n },\n \"border-right-color\": {\n canOverride: canOverride.generic.color,\n componentOf: [\"border-color\", \"border-right\"],\n defaultValue: \"none\"\n },\n \"border-right-style\": {\n canOverride: canOverride.property.borderStyle,\n componentOf: [\"border-right\", \"border-style\"],\n defaultValue: \"none\"\n },\n \"border-right-width\": {\n canOverride: canOverride.generic.unit,\n componentOf: [\"border-right\", \"border-width\"],\n defaultValue: \"medium\",\n oppositeTo: \"border-left-width\",\n shortestValue: \"0\"\n },\n \"border-style\": {\n breakUp: breakUp.fourValues,\n canOverride: canOverride.generic.components([\n canOverride.property.borderStyle,\n canOverride.property.borderStyle,\n canOverride.property.borderStyle,\n canOverride.property.borderStyle\n ]),\n componentOf: [\"border\"],\n components: [\n \"border-top-style\",\n \"border-right-style\",\n \"border-bottom-style\",\n \"border-left-style\"\n ],\n defaultValue: \"none\",\n restore: restore.fourValues,\n shorthand: true\n },\n \"border-top\": {\n breakUp: breakUp.border,\n canOverride: canOverride.generic.components([\n canOverride.generic.unit,\n canOverride.property.borderStyle,\n canOverride.generic.color\n ]),\n components: [\n \"border-top-width\",\n \"border-top-style\",\n \"border-top-color\"\n ],\n defaultValue: \"none\",\n restore: restore.withoutDefaults,\n shorthand: true\n },\n \"border-top-color\": {\n canOverride: canOverride.generic.color,\n componentOf: [\"border-color\", \"border-top\"],\n defaultValue: \"none\"\n },\n \"border-top-left-radius\": {\n canOverride: canOverride.generic.unit,\n componentOf: [\"border-radius\"],\n defaultValue: \"0\",\n vendorPrefixes: [\"-moz-\", \"-o-\"]\n },\n \"border-top-right-radius\": {\n canOverride: canOverride.generic.unit,\n componentOf: [\"border-radius\"],\n defaultValue: \"0\",\n vendorPrefixes: [\"-moz-\", \"-o-\"]\n },\n \"border-top-style\": {\n canOverride: canOverride.property.borderStyle,\n componentOf: [\"border-style\", \"border-top\"],\n defaultValue: \"none\"\n },\n \"border-top-width\": {\n canOverride: canOverride.generic.unit,\n componentOf: [\"border-top\", \"border-width\"],\n defaultValue: \"medium\",\n oppositeTo: \"border-bottom-width\",\n shortestValue: \"0\"\n },\n \"border-width\": {\n breakUp: breakUp.fourValues,\n canOverride: canOverride.generic.components([\n canOverride.generic.unit,\n canOverride.generic.unit,\n canOverride.generic.unit,\n canOverride.generic.unit\n ]),\n componentOf: [\"border\"],\n components: [\n \"border-top-width\",\n \"border-right-width\",\n \"border-bottom-width\",\n \"border-left-width\"\n ],\n defaultValue: \"medium\",\n restore: restore.fourValues,\n shortestValue: \"0\",\n shorthand: true\n },\n clear: {\n canOverride: canOverride.property.clear,\n defaultValue: \"none\"\n },\n color: {\n canOverride: canOverride.generic.color,\n defaultValue: \"transparent\",\n shortestValue: \"red\"\n },\n cursor: {\n canOverride: canOverride.property.cursor,\n defaultValue: \"auto\"\n },\n display: {\n canOverride: canOverride.property.display\n },\n float: {\n canOverride: canOverride.property.float,\n defaultValue: \"none\"\n },\n font: {\n breakUp: breakUp.font,\n canOverride: canOverride.generic.components([\n canOverride.property.fontStyle,\n canOverride.property.fontVariant,\n canOverride.property.fontWeight,\n canOverride.property.fontStretch,\n canOverride.generic.unit,\n canOverride.generic.unit,\n canOverride.property.fontFamily\n ]),\n components: [\n \"font-style\",\n \"font-variant\",\n \"font-weight\",\n \"font-stretch\",\n \"font-size\",\n \"line-height\",\n \"font-family\"\n ],\n restore: restore.font,\n shorthand: true\n },\n \"font-family\": {\n canOverride: canOverride.property.fontFamily,\n defaultValue: \"user|agent|specific\"\n },\n \"font-size\": {\n canOverride: canOverride.generic.unit,\n defaultValue: \"medium\",\n shortestValue: \"0\"\n },\n \"font-stretch\": {\n canOverride: canOverride.property.fontStretch,\n defaultValue: \"normal\"\n },\n \"font-style\": {\n canOverride: canOverride.property.fontStyle,\n defaultValue: \"normal\"\n },\n \"font-variant\": {\n canOverride: canOverride.property.fontVariant,\n defaultValue: \"normal\"\n },\n \"font-weight\": {\n canOverride: canOverride.property.fontWeight,\n defaultValue: \"normal\",\n shortestValue: \"400\"\n },\n height: {\n canOverride: canOverride.generic.unit,\n defaultValue: \"auto\",\n shortestValue: \"0\"\n },\n left: {\n canOverride: canOverride.property.left,\n defaultValue: \"auto\"\n },\n \"line-height\": {\n canOverride: canOverride.generic.unitOrNumber,\n defaultValue: \"normal\",\n shortestValue: \"0\"\n },\n \"list-style\": {\n canOverride: canOverride.generic.components([\n canOverride.property.listStyleType,\n canOverride.property.listStylePosition,\n canOverride.property.listStyleImage\n ]),\n components: [\n \"list-style-type\",\n \"list-style-position\",\n \"list-style-image\"\n ],\n breakUp: breakUp.listStyle,\n restore: restore.withoutDefaults,\n defaultValue: \"outside\", // can't use 'disc' because that'd override default 'decimal' for \n shortestValue: \"none\",\n shorthand: true\n },\n \"list-style-image\": {\n canOverride: canOverride.generic.image,\n componentOf: [\"list-style\"],\n defaultValue: \"none\"\n },\n \"list-style-position\": {\n canOverride: canOverride.property.listStylePosition,\n componentOf: [\"list-style\"],\n defaultValue: \"outside\",\n shortestValue: \"inside\"\n },\n \"list-style-type\": {\n canOverride: canOverride.property.listStyleType,\n componentOf: [\"list-style\"],\n // NOTE: we can't tell the real default value here, it's 'disc' for and 'decimal' for \n // this is a hack, but it doesn't matter because this value will be either overridden or\n // it will disappear at the final step anyway\n defaultValue: \"decimal|disc\",\n shortestValue: \"none\"\n },\n margin: {\n breakUp: breakUp.fourValues,\n canOverride: canOverride.generic.components([\n canOverride.generic.unit,\n canOverride.generic.unit,\n canOverride.generic.unit,\n canOverride.generic.unit\n ]),\n components: [\n \"margin-top\",\n \"margin-right\",\n \"margin-bottom\",\n \"margin-left\"\n ],\n defaultValue: \"0\",\n restore: restore.fourValues,\n shorthand: true\n },\n \"margin-bottom\": {\n canOverride: canOverride.generic.unit,\n componentOf: [\"margin\"],\n defaultValue: \"0\",\n oppositeTo: \"margin-top\"\n },\n \"margin-left\": {\n canOverride: canOverride.generic.unit,\n componentOf: [\"margin\"],\n defaultValue: \"0\",\n oppositeTo: \"margin-right\"\n },\n \"margin-right\": {\n canOverride: canOverride.generic.unit,\n componentOf: [\"margin\"],\n defaultValue: \"0\",\n oppositeTo: \"margin-left\"\n },\n \"margin-top\": {\n canOverride: canOverride.generic.unit,\n componentOf: [\"margin\"],\n defaultValue: \"0\",\n oppositeTo: \"margin-bottom\"\n },\n outline: {\n canOverride: canOverride.generic.components([\n canOverride.generic.color,\n canOverride.property.outlineStyle,\n canOverride.generic.unit\n ]),\n components: [\"outline-color\", \"outline-style\", \"outline-width\"],\n breakUp: breakUp.outline,\n restore: restore.withoutDefaults,\n defaultValue: \"0\",\n shorthand: true\n },\n \"outline-color\": {\n canOverride: canOverride.generic.color,\n componentOf: [\"outline\"],\n defaultValue: \"invert\",\n shortestValue: \"red\"\n },\n \"outline-style\": {\n canOverride: canOverride.property.outlineStyle,\n componentOf: [\"outline\"],\n defaultValue: \"none\"\n },\n \"outline-width\": {\n canOverride: canOverride.generic.unit,\n componentOf: [\"outline\"],\n defaultValue: \"medium\",\n shortestValue: \"0\"\n },\n overflow: {\n canOverride: canOverride.property.overflow,\n defaultValue: \"visible\"\n },\n \"overflow-x\": {\n canOverride: canOverride.property.overflow,\n defaultValue: \"visible\"\n },\n \"overflow-y\": {\n canOverride: canOverride.property.overflow,\n defaultValue: \"visible\"\n },\n padding: {\n breakUp: breakUp.fourValues,\n canOverride: canOverride.generic.components([\n canOverride.generic.unit,\n canOverride.generic.unit,\n canOverride.generic.unit,\n canOverride.generic.unit\n ]),\n components: [\n \"padding-top\",\n \"padding-right\",\n \"padding-bottom\",\n \"padding-left\"\n ],\n defaultValue: \"0\",\n restore: restore.fourValues,\n shorthand: true\n },\n \"padding-bottom\": {\n canOverride: canOverride.generic.unit,\n componentOf: [\"padding\"],\n defaultValue: \"0\",\n oppositeTo: \"padding-top\"\n },\n \"padding-left\": {\n canOverride: canOverride.generic.unit,\n componentOf: [\"padding\"],\n defaultValue: \"0\",\n oppositeTo: \"padding-right\"\n },\n \"padding-right\": {\n canOverride: canOverride.generic.unit,\n componentOf: [\"padding\"],\n defaultValue: \"0\",\n oppositeTo: \"padding-left\"\n },\n \"padding-top\": {\n canOverride: canOverride.generic.unit,\n componentOf: [\"padding\"],\n defaultValue: \"0\",\n oppositeTo: \"padding-bottom\"\n },\n position: {\n canOverride: canOverride.property.position,\n defaultValue: \"static\"\n },\n right: {\n canOverride: canOverride.property.right,\n defaultValue: \"auto\"\n },\n \"text-align\": {\n canOverride: canOverride.property.textAlign,\n // NOTE: we can't tell the real default value here, as it depends on default text direction\n // this is a hack, but it doesn't matter because this value will be either overridden or\n // it will disappear anyway\n defaultValue: \"left|right\"\n },\n \"text-decoration\": {\n canOverride: canOverride.property.textDecoration,\n defaultValue: \"none\"\n },\n \"text-overflow\": {\n canOverride: canOverride.property.textOverflow,\n defaultValue: \"none\"\n },\n \"text-shadow\": {\n canOverride: canOverride.property.textShadow,\n defaultValue: \"none\"\n },\n top: {\n canOverride: canOverride.property.top,\n defaultValue: \"auto\"\n },\n transform: {\n canOverride: canOverride.property.transform,\n vendorPrefixes: [\"-moz-\", \"-ms-\", \"-webkit-\"]\n },\n transition: {\n breakUp: breakUp.multiplex(breakUp.transition),\n canOverride: canOverride.generic.components([\n canOverride.property.transitionProperty,\n canOverride.generic.time,\n canOverride.generic.timingFunction,\n canOverride.generic.time\n ]),\n components: [\n \"transition-property\",\n \"transition-duration\",\n \"transition-timing-function\",\n \"transition-delay\"\n ],\n defaultValue: \"none\",\n restore: restore.multiplex(restore.withoutDefaults),\n shorthand: true,\n vendorPrefixes: [\"-moz-\", \"-o-\", \"-webkit-\"]\n },\n \"transition-delay\": {\n canOverride: canOverride.generic.time,\n componentOf: [\"transition\"],\n defaultValue: \"0s\",\n intoMultiplexMode: \"real\",\n vendorPrefixes: [\"-moz-\", \"-o-\", \"-webkit-\"]\n },\n \"transition-duration\": {\n canOverride: canOverride.generic.time,\n componentOf: [\"transition\"],\n defaultValue: \"0s\",\n intoMultiplexMode: \"real\",\n vendorPrefixes: [\"-moz-\", \"-o-\", \"-webkit-\"]\n },\n \"transition-property\": {\n canOverride: canOverride.generic.propertyName,\n componentOf: [\"transition\"],\n defaultValue: \"all\",\n intoMultiplexMode: \"placeholder\",\n placeholderValue: \"_\", // it's a short value that won't match any property and still be a valid `transition-property`\n vendorPrefixes: [\"-moz-\", \"-o-\", \"-webkit-\"]\n },\n \"transition-timing-function\": {\n canOverride: canOverride.generic.timingFunction,\n componentOf: [\"transition\"],\n defaultValue: \"ease\",\n intoMultiplexMode: \"real\",\n vendorPrefixes: [\"-moz-\", \"-o-\", \"-webkit-\"]\n },\n \"vertical-align\": {\n canOverride: canOverride.property.verticalAlign,\n defaultValue: \"baseline\"\n },\n visibility: {\n canOverride: canOverride.property.visibility,\n defaultValue: \"visible\"\n },\n \"white-space\": {\n canOverride: canOverride.property.whiteSpace,\n defaultValue: \"normal\"\n },\n width: {\n canOverride: canOverride.generic.unit,\n defaultValue: \"auto\",\n shortestValue: \"0\"\n },\n \"z-index\": {\n canOverride: canOverride.property.zIndex,\n defaultValue: \"auto\"\n }\n };\n\n function cloneDescriptor(propertyName, prefix) {\n var clonedDescriptor = override(compactable[propertyName], {});\n\n if (\"componentOf\" in clonedDescriptor) {\n clonedDescriptor.componentOf = clonedDescriptor.componentOf.map(\n function(shorthandName) {\n return prefix + shorthandName;\n }\n );\n }\n\n if (\"components\" in clonedDescriptor) {\n clonedDescriptor.components = clonedDescriptor.components.map(\n function(longhandName) {\n return prefix + longhandName;\n }\n );\n }\n\n if (\"keepUnlessDefault\" in clonedDescriptor) {\n clonedDescriptor.keepUnlessDefault =\n prefix + clonedDescriptor.keepUnlessDefault;\n }\n\n return clonedDescriptor;\n }\n\n // generate vendor-prefixed properties\n var vendorPrefixedCompactable = {};\n\n for (var propertyName in compactable) {\n var descriptor = compactable[propertyName];\n\n if (!(\"vendorPrefixes\" in descriptor)) {\n continue;\n }\n\n for (var i = 0; i < descriptor.vendorPrefixes.length; i++) {\n var prefix = descriptor.vendorPrefixes[i];\n var clonedDescriptor = cloneDescriptor(propertyName, prefix);\n delete clonedDescriptor.vendorPrefixes;\n\n vendorPrefixedCompactable[prefix + propertyName] = clonedDescriptor;\n }\n\n delete descriptor.vendorPrefixes;\n }\n\n module.exports = override(compactable, vendorPrefixedCompactable);\n },\n {\n \"../../utils/override\": 95,\n \"./break-up\": 18,\n \"./can-override\": 19,\n \"./restore\": 49\n }\n ],\n 22: [\n function(require, module, exports) {\n // This extractor is used in level 2 optimizations\n // IMPORTANT: Mind Token class and this code is not related!\n // Properties will be tokenized in one step, see #429\n\n var Token = require(\"../../tokenizer/token\");\n var serializeRules = require(\"../../writer/one-time\").rules;\n var serializeValue = require(\"../../writer/one-time\").value;\n\n function extractProperties(token) {\n var properties = [];\n var inSpecificSelector;\n var property;\n var name;\n var value;\n var i, l;\n\n if (token[0] == Token.RULE) {\n inSpecificSelector = !/[\\.\\+>~]/.test(serializeRules(token[1]));\n\n for (i = 0, l = token[2].length; i < l; i++) {\n property = token[2][i];\n\n if (property[0] != Token.PROPERTY) continue;\n\n name = property[1][1];\n if (name.length === 0) continue;\n\n if (name.indexOf(\"--\") === 0) continue;\n\n value = serializeValue(property, i);\n\n properties.push([\n name,\n value,\n findNameRoot(name),\n token[2][i],\n name + \":\" + value,\n token[1],\n inSpecificSelector\n ]);\n }\n } else if (token[0] == Token.NESTED_BLOCK) {\n for (i = 0, l = token[2].length; i < l; i++) {\n properties = properties.concat(extractProperties(token[2][i]));\n }\n }\n\n return properties;\n }\n\n function findNameRoot(name) {\n if (name == \"list-style\") return name;\n if (name.indexOf(\"-radius\") > 0) return \"border-radius\";\n if (\n name == \"border-collapse\" ||\n name == \"border-spacing\" ||\n name == \"border-image\"\n )\n return name;\n if (name.indexOf(\"border-\") === 0 && /^border\\-\\w+\\-\\w+$/.test(name))\n return name.match(/border\\-\\w+/)[0];\n if (name.indexOf(\"border-\") === 0 && /^border\\-\\w+$/.test(name))\n return \"border\";\n if (name.indexOf(\"text-\") === 0) return name;\n if (name == \"-chrome-\") return name;\n\n return name\n .replace(/^\\-\\w+\\-/, \"\")\n .match(/([a-zA-Z]+)/)[0]\n .toLowerCase();\n }\n\n module.exports = extractProperties;\n },\n { \"../../tokenizer/token\": 84, \"../../writer/one-time\": 98 }\n ],\n 23: [\n function(require, module, exports) {\n function InvalidPropertyError(message) {\n this.name = \"InvalidPropertyError\";\n this.message = message;\n this.stack = new Error().stack;\n }\n\n InvalidPropertyError.prototype = Object.create(Error.prototype);\n InvalidPropertyError.prototype.constructor = InvalidPropertyError;\n\n module.exports = InvalidPropertyError;\n },\n {}\n ],\n 24: [\n function(require, module, exports) {\n var Marker = require(\"../../tokenizer/marker\");\n var split = require(\"../../utils/split\");\n\n var DEEP_SELECTOR_PATTERN = /\\/deep\\//;\n var DOUBLE_COLON_PATTERN = /^::/;\n var NOT_PSEUDO = \":not\";\n var PSEUDO_CLASSES_WITH_ARGUMENTS = [\n \":dir\",\n \":lang\",\n \":not\",\n \":nth-child\",\n \":nth-last-child\",\n \":nth-last-of-type\",\n \":nth-of-type\"\n ];\n var RELATION_PATTERN = /[>\\+~]/;\n var UNMIXABLE_PSEUDO_CLASSES = [\n \":after\",\n \":before\",\n \":first-letter\",\n \":first-line\",\n \":lang\"\n ];\n var UNMIXABLE_PSEUDO_ELEMENTS = [\n \"::after\",\n \"::before\",\n \"::first-letter\",\n \"::first-line\"\n ];\n\n var Level = {\n DOUBLE_QUOTE: \"double-quote\",\n SINGLE_QUOTE: \"single-quote\",\n ROOT: \"root\"\n };\n\n function isMergeable(\n selector,\n mergeablePseudoClasses,\n mergeablePseudoElements,\n multiplePseudoMerging\n ) {\n var singleSelectors = split(selector, Marker.COMMA);\n var singleSelector;\n var i, l;\n\n for (i = 0, l = singleSelectors.length; i < l; i++) {\n singleSelector = singleSelectors[i];\n\n if (\n singleSelector.length === 0 ||\n isDeepSelector(singleSelector) ||\n (singleSelector.indexOf(Marker.COLON) > -1 &&\n !areMergeable(\n singleSelector,\n extractPseudoFrom(singleSelector),\n mergeablePseudoClasses,\n mergeablePseudoElements,\n multiplePseudoMerging\n ))\n ) {\n return false;\n }\n }\n\n return true;\n }\n\n function isDeepSelector(selector) {\n return DEEP_SELECTOR_PATTERN.test(selector);\n }\n\n function extractPseudoFrom(selector) {\n var list = [];\n var character;\n var buffer = [];\n var level = Level.ROOT;\n var roundBracketLevel = 0;\n var isQuoted;\n var isEscaped;\n var isPseudo = false;\n var isRelation;\n var wasColon = false;\n var index;\n var len;\n\n for (index = 0, len = selector.length; index < len; index++) {\n character = selector[index];\n\n isRelation = !isEscaped && RELATION_PATTERN.test(character);\n isQuoted =\n level == Level.DOUBLE_QUOTE || level == Level.SINGLE_QUOTE;\n\n if (isEscaped) {\n buffer.push(character);\n } else if (\n character == Marker.DOUBLE_QUOTE &&\n level == Level.ROOT\n ) {\n buffer.push(character);\n level = Level.DOUBLE_QUOTE;\n } else if (\n character == Marker.DOUBLE_QUOTE &&\n level == Level.DOUBLE_QUOTE\n ) {\n buffer.push(character);\n level = Level.ROOT;\n } else if (\n character == Marker.SINGLE_QUOTE &&\n level == Level.ROOT\n ) {\n buffer.push(character);\n level = Level.SINGLE_QUOTE;\n } else if (\n character == Marker.SINGLE_QUOTE &&\n level == Level.SINGLE_QUOTE\n ) {\n buffer.push(character);\n level = Level.ROOT;\n } else if (isQuoted) {\n buffer.push(character);\n } else if (character == Marker.OPEN_ROUND_BRACKET) {\n buffer.push(character);\n roundBracketLevel++;\n } else if (\n character == Marker.CLOSE_ROUND_BRACKET &&\n roundBracketLevel == 1 &&\n isPseudo\n ) {\n buffer.push(character);\n list.push(buffer.join(\"\"));\n roundBracketLevel--;\n buffer = [];\n isPseudo = false;\n } else if (character == Marker.CLOSE_ROUND_BRACKET) {\n buffer.push(character);\n roundBracketLevel--;\n } else if (\n character == Marker.COLON &&\n roundBracketLevel === 0 &&\n isPseudo &&\n !wasColon\n ) {\n list.push(buffer.join(\"\"));\n buffer = [];\n buffer.push(character);\n } else if (\n character == Marker.COLON &&\n roundBracketLevel === 0 &&\n !wasColon\n ) {\n buffer = [];\n buffer.push(character);\n isPseudo = true;\n } else if (\n character == Marker.SPACE &&\n roundBracketLevel === 0 &&\n isPseudo\n ) {\n list.push(buffer.join(\"\"));\n buffer = [];\n isPseudo = false;\n } else if (isRelation && roundBracketLevel === 0 && isPseudo) {\n list.push(buffer.join(\"\"));\n buffer = [];\n isPseudo = false;\n } else {\n buffer.push(character);\n }\n\n isEscaped = character == Marker.BACK_SLASH;\n wasColon = character == Marker.COLON;\n }\n\n if (buffer.length > 0 && isPseudo) {\n list.push(buffer.join(\"\"));\n }\n\n return list;\n }\n\n function areMergeable(\n selector,\n matches,\n mergeablePseudoClasses,\n mergeablePseudoElements,\n multiplePseudoMerging\n ) {\n return (\n areAllowed(\n matches,\n mergeablePseudoClasses,\n mergeablePseudoElements\n ) &&\n needArguments(matches) &&\n (matches.length < 2 ||\n !someIncorrectlyChained(selector, matches)) &&\n (matches.length < 2 ||\n (multiplePseudoMerging && allMixable(matches)))\n );\n }\n\n function areAllowed(\n matches,\n mergeablePseudoClasses,\n mergeablePseudoElements\n ) {\n var match;\n var name;\n var i, l;\n\n for (i = 0, l = matches.length; i < l; i++) {\n match = matches[i];\n name =\n match.indexOf(Marker.OPEN_ROUND_BRACKET) > -1\n ? match.substring(0, match.indexOf(Marker.OPEN_ROUND_BRACKET))\n : match;\n\n if (\n mergeablePseudoClasses.indexOf(name) === -1 &&\n mergeablePseudoElements.indexOf(name) === -1\n ) {\n return false;\n }\n }\n\n return true;\n }\n\n function needArguments(matches) {\n var match;\n var name;\n var bracketOpensAt;\n var hasArguments;\n var i, l;\n\n for (i = 0, l = matches.length; i < l; i++) {\n match = matches[i];\n\n bracketOpensAt = match.indexOf(Marker.OPEN_ROUND_BRACKET);\n hasArguments = bracketOpensAt > -1;\n name = hasArguments ? match.substring(0, bracketOpensAt) : match;\n\n if (\n hasArguments &&\n PSEUDO_CLASSES_WITH_ARGUMENTS.indexOf(name) == -1\n ) {\n return false;\n }\n\n if (\n !hasArguments &&\n PSEUDO_CLASSES_WITH_ARGUMENTS.indexOf(name) > -1\n ) {\n return false;\n }\n }\n\n return true;\n }\n\n function someIncorrectlyChained(selector, matches) {\n var positionInSelector = 0;\n var match;\n var matchAt;\n var nextMatch;\n var nextMatchAt;\n var name;\n var nextName;\n var areChained;\n var i, l;\n\n for (i = 0, l = matches.length; i < l; i++) {\n match = matches[i];\n nextMatch = matches[i + 1];\n\n if (!nextMatch) {\n break;\n }\n\n matchAt = selector.indexOf(match, positionInSelector);\n nextMatchAt = selector.indexOf(match, matchAt + 1);\n positionInSelector = nextMatchAt;\n areChained = matchAt + match.length == nextMatchAt;\n\n if (areChained) {\n name =\n match.indexOf(Marker.OPEN_ROUND_BRACKET) > -1\n ? match.substring(0, match.indexOf(Marker.OPEN_ROUND_BRACKET))\n : match;\n nextName =\n nextMatch.indexOf(Marker.OPEN_ROUND_BRACKET) > -1\n ? nextMatch.substring(\n 0,\n nextMatch.indexOf(Marker.OPEN_ROUND_BRACKET)\n )\n : nextMatch;\n\n if (name != NOT_PSEUDO || nextName != NOT_PSEUDO) {\n return true;\n }\n }\n }\n\n return false;\n }\n\n function allMixable(matches) {\n var unmixableMatches = 0;\n var match;\n var i, l;\n\n for (i = 0, l = matches.length; i < l; i++) {\n match = matches[i];\n\n if (isPseudoElement(match)) {\n unmixableMatches +=\n UNMIXABLE_PSEUDO_ELEMENTS.indexOf(match) > -1 ? 1 : 0;\n } else {\n unmixableMatches +=\n UNMIXABLE_PSEUDO_CLASSES.indexOf(match) > -1 ? 1 : 0;\n }\n\n if (unmixableMatches > 1) {\n return false;\n }\n }\n\n return true;\n }\n\n function isPseudoElement(pseudo) {\n return DOUBLE_COLON_PATTERN.test(pseudo);\n }\n\n module.exports = isMergeable;\n },\n { \"../../tokenizer/marker\": 83, \"../../utils/split\": 96 }\n ],\n 25: [\n function(require, module, exports) {\n var isMergeable = require(\"./is-mergeable\");\n\n var optimizeProperties = require(\"./properties/optimize\");\n\n var sortSelectors = require(\"../level-1/sort-selectors\");\n var tidyRules = require(\"../level-1/tidy-rules\");\n\n var OptimizationLevel = require(\"../../options/optimization-level\")\n .OptimizationLevel;\n\n var serializeBody = require(\"../../writer/one-time\").body;\n var serializeRules = require(\"../../writer/one-time\").rules;\n\n var Token = require(\"../../tokenizer/token\");\n\n function mergeAdjacent(tokens, context) {\n var lastToken = [null, [], []];\n var options = context.options;\n var adjacentSpace = options.compatibility.selectors.adjacentSpace;\n var selectorsSortingMethod =\n options.level[OptimizationLevel.One].selectorsSortingMethod;\n var mergeablePseudoClasses =\n options.compatibility.selectors.mergeablePseudoClasses;\n var mergeablePseudoElements =\n options.compatibility.selectors.mergeablePseudoElements;\n var mergeLimit = options.compatibility.selectors.mergeLimit;\n var multiplePseudoMerging =\n options.compatibility.selectors.multiplePseudoMerging;\n\n for (var i = 0, l = tokens.length; i < l; i++) {\n var token = tokens[i];\n\n if (token[0] != Token.RULE) {\n lastToken = [null, [], []];\n continue;\n }\n\n if (\n lastToken[0] == Token.RULE &&\n serializeRules(token[1]) == serializeRules(lastToken[1])\n ) {\n Array.prototype.push.apply(lastToken[2], token[2]);\n optimizeProperties(lastToken[2], true, true, context);\n token[2] = [];\n } else if (\n lastToken[0] == Token.RULE &&\n serializeBody(token[2]) == serializeBody(lastToken[2]) &&\n isMergeable(\n serializeRules(token[1]),\n mergeablePseudoClasses,\n mergeablePseudoElements,\n multiplePseudoMerging\n ) &&\n isMergeable(\n serializeRules(lastToken[1]),\n mergeablePseudoClasses,\n mergeablePseudoElements,\n multiplePseudoMerging\n ) &&\n lastToken[1].length < mergeLimit\n ) {\n lastToken[1] = tidyRules(\n lastToken[1].concat(token[1]),\n false,\n adjacentSpace,\n false,\n context.warnings\n );\n lastToken[1] =\n lastToken.length > 1\n ? sortSelectors(lastToken[1], selectorsSortingMethod)\n : lastToken[1];\n token[2] = [];\n } else {\n lastToken = token;\n }\n }\n }\n\n module.exports = mergeAdjacent;\n },\n {\n \"../../options/optimization-level\": 65,\n \"../../tokenizer/token\": 84,\n \"../../writer/one-time\": 98,\n \"../level-1/sort-selectors\": 14,\n \"../level-1/tidy-rules\": 17,\n \"./is-mergeable\": 24,\n \"./properties/optimize\": 36\n }\n ],\n 26: [\n function(require, module, exports) {\n var canReorder = require(\"./reorderable\").canReorder;\n var canReorderSingle = require(\"./reorderable\").canReorderSingle;\n var extractProperties = require(\"./extract-properties\");\n var rulesOverlap = require(\"./rules-overlap\");\n\n var serializeRules = require(\"../../writer/one-time\").rules;\n var OptimizationLevel = require(\"../../options/optimization-level\")\n .OptimizationLevel;\n var Token = require(\"../../tokenizer/token\");\n\n function mergeMediaQueries(tokens, context) {\n var mergeSemantically =\n context.options.level[OptimizationLevel.Two].mergeSemantically;\n var specificityCache = context.cache.specificity;\n var candidates = {};\n var reduced = [];\n\n for (var i = tokens.length - 1; i >= 0; i--) {\n var token = tokens[i];\n if (token[0] != Token.NESTED_BLOCK) {\n continue;\n }\n\n var key = serializeRules(token[1]);\n var candidate = candidates[key];\n if (!candidate) {\n candidate = [];\n candidates[key] = candidate;\n }\n\n candidate.push(i);\n }\n\n for (var name in candidates) {\n var positions = candidates[name];\n\n positionLoop: for (var j = positions.length - 1; j > 0; j--) {\n var positionOne = positions[j];\n var tokenOne = tokens[positionOne];\n var positionTwo = positions[j - 1];\n var tokenTwo = tokens[positionTwo];\n\n directionLoop: for (\n var direction = 1;\n direction >= -1;\n direction -= 2\n ) {\n var topToBottom = direction == 1;\n var from = topToBottom ? positionOne + 1 : positionTwo - 1;\n var to = topToBottom ? positionTwo : positionOne;\n var delta = topToBottom ? 1 : -1;\n var source = topToBottom ? tokenOne : tokenTwo;\n var target = topToBottom ? tokenTwo : tokenOne;\n var movedProperties = extractProperties(source);\n\n while (from != to) {\n var traversedProperties = extractProperties(tokens[from]);\n from += delta;\n\n if (\n mergeSemantically &&\n allSameRulePropertiesCanBeReordered(\n movedProperties,\n traversedProperties,\n specificityCache\n )\n ) {\n continue;\n }\n\n if (\n !canReorder(\n movedProperties,\n traversedProperties,\n specificityCache\n )\n )\n continue directionLoop;\n }\n\n target[2] = topToBottom\n ? source[2].concat(target[2])\n : target[2].concat(source[2]);\n source[2] = [];\n\n reduced.push(target);\n continue positionLoop;\n }\n }\n }\n\n return reduced;\n }\n\n function allSameRulePropertiesCanBeReordered(\n movedProperties,\n traversedProperties,\n specificityCache\n ) {\n var movedProperty;\n var movedRule;\n var traversedProperty;\n var traversedRule;\n var i, l;\n var j, m;\n\n for (i = 0, l = movedProperties.length; i < l; i++) {\n movedProperty = movedProperties[i];\n movedRule = movedProperty[5];\n\n for (j = 0, m = traversedProperties.length; j < m; j++) {\n traversedProperty = traversedProperties[j];\n traversedRule = traversedProperty[5];\n\n if (\n rulesOverlap(movedRule, traversedRule, true) &&\n !canReorderSingle(\n movedProperty,\n traversedProperty,\n specificityCache\n )\n ) {\n return false;\n }\n }\n }\n\n return true;\n }\n\n module.exports = mergeMediaQueries;\n },\n {\n \"../../options/optimization-level\": 65,\n \"../../tokenizer/token\": 84,\n \"../../writer/one-time\": 98,\n \"./extract-properties\": 22,\n \"./reorderable\": 47,\n \"./rules-overlap\": 51\n }\n ],\n 27: [\n function(require, module, exports) {\n var isMergeable = require(\"./is-mergeable\");\n\n var sortSelectors = require(\"../level-1/sort-selectors\");\n var tidyRules = require(\"../level-1/tidy-rules\");\n\n var OptimizationLevel = require(\"../../options/optimization-level\")\n .OptimizationLevel;\n\n var serializeBody = require(\"../../writer/one-time\").body;\n var serializeRules = require(\"../../writer/one-time\").rules;\n\n var Token = require(\"../../tokenizer/token\");\n\n function unsafeSelector(value) {\n return /\\.|\\*| :/.test(value);\n }\n\n function isBemElement(token) {\n var asString = serializeRules(token[1]);\n return asString.indexOf(\"__\") > -1 || asString.indexOf(\"--\") > -1;\n }\n\n function withoutModifier(selector) {\n return selector.replace(/--[^ ,>\\+~:]+/g, \"\");\n }\n\n function removeAnyUnsafeElements(left, candidates) {\n var leftSelector = withoutModifier(serializeRules(left[1]));\n\n for (var body in candidates) {\n var right = candidates[body];\n var rightSelector = withoutModifier(serializeRules(right[1]));\n\n if (\n rightSelector.indexOf(leftSelector) > -1 ||\n leftSelector.indexOf(rightSelector) > -1\n )\n delete candidates[body];\n }\n }\n\n function mergeNonAdjacentByBody(tokens, context) {\n var options = context.options;\n var mergeSemantically =\n options.level[OptimizationLevel.Two].mergeSemantically;\n var adjacentSpace = options.compatibility.selectors.adjacentSpace;\n var selectorsSortingMethod =\n options.level[OptimizationLevel.One].selectorsSortingMethod;\n var mergeablePseudoClasses =\n options.compatibility.selectors.mergeablePseudoClasses;\n var mergeablePseudoElements =\n options.compatibility.selectors.mergeablePseudoElements;\n var multiplePseudoMerging =\n options.compatibility.selectors.multiplePseudoMerging;\n var candidates = {};\n\n for (var i = tokens.length - 1; i >= 0; i--) {\n var token = tokens[i];\n if (token[0] != Token.RULE) continue;\n\n if (\n token[2].length > 0 &&\n (!mergeSemantically && unsafeSelector(serializeRules(token[1])))\n )\n candidates = {};\n\n if (token[2].length > 0 && mergeSemantically && isBemElement(token))\n removeAnyUnsafeElements(token, candidates);\n\n var candidateBody = serializeBody(token[2]);\n var oldToken = candidates[candidateBody];\n if (\n oldToken &&\n isMergeable(\n serializeRules(token[1]),\n mergeablePseudoClasses,\n mergeablePseudoElements,\n multiplePseudoMerging\n ) &&\n isMergeable(\n serializeRules(oldToken[1]),\n mergeablePseudoClasses,\n mergeablePseudoElements,\n multiplePseudoMerging\n )\n ) {\n if (token[2].length > 0) {\n token[1] = tidyRules(\n oldToken[1].concat(token[1]),\n false,\n adjacentSpace,\n false,\n context.warnings\n );\n token[1] =\n token[1].length > 1\n ? sortSelectors(token[1], selectorsSortingMethod)\n : token[1];\n } else {\n token[1] = oldToken[1].concat(token[1]);\n }\n\n oldToken[2] = [];\n candidates[candidateBody] = null;\n }\n\n candidates[serializeBody(token[2])] = token;\n }\n }\n\n module.exports = mergeNonAdjacentByBody;\n },\n {\n \"../../options/optimization-level\": 65,\n \"../../tokenizer/token\": 84,\n \"../../writer/one-time\": 98,\n \"../level-1/sort-selectors\": 14,\n \"../level-1/tidy-rules\": 17,\n \"./is-mergeable\": 24\n }\n ],\n 28: [\n function(require, module, exports) {\n var canReorder = require(\"./reorderable\").canReorder;\n var extractProperties = require(\"./extract-properties\");\n\n var optimizeProperties = require(\"./properties/optimize\");\n\n var serializeRules = require(\"../../writer/one-time\").rules;\n\n var Token = require(\"../../tokenizer/token\");\n\n function mergeNonAdjacentBySelector(tokens, context) {\n var specificityCache = context.cache.specificity;\n var allSelectors = {};\n var repeatedSelectors = [];\n var i;\n\n for (i = tokens.length - 1; i >= 0; i--) {\n if (tokens[i][0] != Token.RULE) continue;\n if (tokens[i][2].length === 0) continue;\n\n var selector = serializeRules(tokens[i][1]);\n allSelectors[selector] = [i].concat(allSelectors[selector] || []);\n\n if (allSelectors[selector].length == 2)\n repeatedSelectors.push(selector);\n }\n\n for (i = repeatedSelectors.length - 1; i >= 0; i--) {\n var positions = allSelectors[repeatedSelectors[i]];\n\n selectorIterator: for (var j = positions.length - 1; j > 0; j--) {\n var positionOne = positions[j - 1];\n var tokenOne = tokens[positionOne];\n var positionTwo = positions[j];\n var tokenTwo = tokens[positionTwo];\n\n directionIterator: for (\n var direction = 1;\n direction >= -1;\n direction -= 2\n ) {\n var topToBottom = direction == 1;\n var from = topToBottom ? positionOne + 1 : positionTwo - 1;\n var to = topToBottom ? positionTwo : positionOne;\n var delta = topToBottom ? 1 : -1;\n var moved = topToBottom ? tokenOne : tokenTwo;\n var target = topToBottom ? tokenTwo : tokenOne;\n var movedProperties = extractProperties(moved);\n\n while (from != to) {\n var traversedProperties = extractProperties(tokens[from]);\n from += delta;\n\n // traversed then moved as we move selectors towards the start\n var reorderable = topToBottom\n ? canReorder(\n movedProperties,\n traversedProperties,\n specificityCache\n )\n : canReorder(\n traversedProperties,\n movedProperties,\n specificityCache\n );\n\n if (!reorderable && !topToBottom) continue selectorIterator;\n if (!reorderable && topToBottom) continue directionIterator;\n }\n\n if (topToBottom) {\n Array.prototype.push.apply(moved[2], target[2]);\n target[2] = moved[2];\n } else {\n Array.prototype.push.apply(target[2], moved[2]);\n }\n\n optimizeProperties(target[2], true, true, context);\n moved[2] = [];\n }\n }\n }\n }\n\n module.exports = mergeNonAdjacentBySelector;\n },\n {\n \"../../tokenizer/token\": 84,\n \"../../writer/one-time\": 98,\n \"./extract-properties\": 22,\n \"./properties/optimize\": 36,\n \"./reorderable\": 47\n }\n ],\n 29: [\n function(require, module, exports) {\n var mergeAdjacent = require(\"./merge-adjacent\");\n var mergeMediaQueries = require(\"./merge-media-queries\");\n var mergeNonAdjacentByBody = require(\"./merge-non-adjacent-by-body\");\n var mergeNonAdjacentBySelector = require(\"./merge-non-adjacent-by-selector\");\n var reduceNonAdjacent = require(\"./reduce-non-adjacent\");\n var removeDuplicateFontAtRules = require(\"./remove-duplicate-font-at-rules\");\n var removeDuplicateMediaQueries = require(\"./remove-duplicate-media-queries\");\n var removeDuplicates = require(\"./remove-duplicates\");\n var removeUnusedAtRules = require(\"./remove-unused-at-rules\");\n var restructure = require(\"./restructure\");\n\n var optimizeProperties = require(\"./properties/optimize\");\n\n var OptimizationLevel = require(\"../../options/optimization-level\")\n .OptimizationLevel;\n\n var Token = require(\"../../tokenizer/token\");\n\n function removeEmpty(tokens) {\n for (var i = 0, l = tokens.length; i < l; i++) {\n var token = tokens[i];\n var isEmpty = false;\n\n switch (token[0]) {\n case Token.RULE:\n isEmpty = token[1].length === 0 || token[2].length === 0;\n break;\n case Token.NESTED_BLOCK:\n removeEmpty(token[2]);\n isEmpty = token[2].length === 0;\n break;\n case Token.AT_RULE:\n isEmpty = token[1].length === 0;\n break;\n case Token.AT_RULE_BLOCK:\n isEmpty = token[2].length === 0;\n }\n\n if (isEmpty) {\n tokens.splice(i, 1);\n i--;\n l--;\n }\n }\n }\n\n function recursivelyOptimizeBlocks(tokens, context) {\n for (var i = 0, l = tokens.length; i < l; i++) {\n var token = tokens[i];\n\n if (token[0] == Token.NESTED_BLOCK) {\n var isKeyframes = /@(-moz-|-o-|-webkit-)?keyframes/.test(\n token[1][0][1]\n );\n level2Optimize(token[2], context, !isKeyframes);\n }\n }\n }\n\n function recursivelyOptimizeProperties(tokens, context) {\n for (var i = 0, l = tokens.length; i < l; i++) {\n var token = tokens[i];\n\n switch (token[0]) {\n case Token.RULE:\n optimizeProperties(token[2], true, true, context);\n break;\n case Token.NESTED_BLOCK:\n recursivelyOptimizeProperties(token[2], context);\n }\n }\n }\n\n function level2Optimize(tokens, context, withRestructuring) {\n var levelOptions = context.options.level[OptimizationLevel.Two];\n var reduced;\n var i;\n\n recursivelyOptimizeBlocks(tokens, context);\n recursivelyOptimizeProperties(tokens, context);\n\n if (levelOptions.removeDuplicateRules) {\n removeDuplicates(tokens, context);\n }\n\n if (levelOptions.mergeAdjacentRules) {\n mergeAdjacent(tokens, context);\n }\n\n if (levelOptions.reduceNonAdjacentRules) {\n reduceNonAdjacent(tokens, context);\n }\n\n if (\n levelOptions.mergeNonAdjacentRules &&\n levelOptions.mergeNonAdjacentRules != \"body\"\n ) {\n mergeNonAdjacentBySelector(tokens, context);\n }\n\n if (\n levelOptions.mergeNonAdjacentRules &&\n levelOptions.mergeNonAdjacentRules != \"selector\"\n ) {\n mergeNonAdjacentByBody(tokens, context);\n }\n\n if (\n levelOptions.restructureRules &&\n levelOptions.mergeAdjacentRules &&\n withRestructuring\n ) {\n restructure(tokens, context);\n mergeAdjacent(tokens, context);\n }\n\n if (\n levelOptions.restructureRules &&\n !levelOptions.mergeAdjacentRules &&\n withRestructuring\n ) {\n restructure(tokens, context);\n }\n\n if (levelOptions.removeDuplicateFontRules) {\n removeDuplicateFontAtRules(tokens, context);\n }\n\n if (levelOptions.removeDuplicateMediaBlocks) {\n removeDuplicateMediaQueries(tokens, context);\n }\n\n if (levelOptions.removeUnusedAtRules) {\n removeUnusedAtRules(tokens, context);\n }\n\n if (levelOptions.mergeMedia) {\n reduced = mergeMediaQueries(tokens, context);\n for (i = reduced.length - 1; i >= 0; i--) {\n level2Optimize(reduced[i][2], context, false);\n }\n }\n\n if (levelOptions.removeEmpty) {\n removeEmpty(tokens);\n }\n\n return tokens;\n }\n\n module.exports = level2Optimize;\n },\n {\n \"../../options/optimization-level\": 65,\n \"../../tokenizer/token\": 84,\n \"./merge-adjacent\": 25,\n \"./merge-media-queries\": 26,\n \"./merge-non-adjacent-by-body\": 27,\n \"./merge-non-adjacent-by-selector\": 28,\n \"./properties/optimize\": 36,\n \"./reduce-non-adjacent\": 42,\n \"./remove-duplicate-font-at-rules\": 43,\n \"./remove-duplicate-media-queries\": 44,\n \"./remove-duplicates\": 45,\n \"./remove-unused-at-rules\": 46,\n \"./restructure\": 50\n }\n ],\n 30: [\n function(require, module, exports) {\n var Marker = require(\"../../../tokenizer/marker\");\n\n function everyValuesPair(fn, left, right) {\n var leftSize = left.value.length;\n var rightSize = right.value.length;\n var total = Math.max(leftSize, rightSize);\n var lowerBound = Math.min(leftSize, rightSize) - 1;\n var leftValue;\n var rightValue;\n var position;\n\n for (position = 0; position < total; position++) {\n leftValue =\n (left.value[position] && left.value[position][1]) || leftValue;\n rightValue =\n (right.value[position] && right.value[position][1]) || rightValue;\n\n if (leftValue == Marker.COMMA || rightValue == Marker.COMMA) {\n continue;\n }\n\n if (!fn(leftValue, rightValue, position, position <= lowerBound)) {\n return false;\n }\n }\n\n return true;\n }\n\n module.exports = everyValuesPair;\n },\n { \"../../../tokenizer/marker\": 83 }\n ],\n 31: [\n function(require, module, exports) {\n var compactable = require(\"../compactable\");\n\n function findComponentIn(shorthand, longhand) {\n var comparator = nameComparator(longhand);\n\n return (\n findInDirectComponents(shorthand, comparator) ||\n findInSubComponents(shorthand, comparator)\n );\n }\n\n function nameComparator(to) {\n return function(property) {\n return to.name === property.name;\n };\n }\n\n function findInDirectComponents(shorthand, comparator) {\n return shorthand.components.filter(comparator)[0];\n }\n\n function findInSubComponents(shorthand, comparator) {\n var shorthandComponent;\n var longhandMatch;\n var i, l;\n\n if (!compactable[shorthand.name].shorthandComponents) {\n return;\n }\n\n for (i = 0, l = shorthand.components.length; i < l; i++) {\n shorthandComponent = shorthand.components[i];\n longhandMatch = findInDirectComponents(\n shorthandComponent,\n comparator\n );\n\n if (longhandMatch) {\n return longhandMatch;\n }\n }\n\n return;\n }\n\n module.exports = findComponentIn;\n },\n { \"../compactable\": 21 }\n ],\n 32: [\n function(require, module, exports) {\n function hasInherit(property) {\n for (var i = property.value.length - 1; i >= 0; i--) {\n if (property.value[i][1] == \"inherit\") return true;\n }\n\n return false;\n }\n\n module.exports = hasInherit;\n },\n {}\n ],\n 33: [\n function(require, module, exports) {\n var compactable = require(\"../compactable\");\n\n function isComponentOf(property1, property2, shallow) {\n return (\n isDirectComponentOf(property1, property2) ||\n (!shallow &&\n !!compactable[property1.name].shorthandComponents &&\n isSubComponentOf(property1, property2))\n );\n }\n\n function isDirectComponentOf(property1, property2) {\n var descriptor = compactable[property1.name];\n\n return (\n \"components\" in descriptor &&\n descriptor.components.indexOf(property2.name) > -1\n );\n }\n\n function isSubComponentOf(property1, property2) {\n return property1.components.some(function(component) {\n return isDirectComponentOf(component, property2);\n });\n }\n\n module.exports = isComponentOf;\n },\n { \"../compactable\": 21 }\n ],\n 34: [\n function(require, module, exports) {\n var Marker = require(\"../../../tokenizer/marker\");\n\n function isMergeableShorthand(shorthand) {\n if (shorthand.name != \"font\") {\n return true;\n }\n\n return shorthand.value[0][1].indexOf(Marker.INTERNAL) == -1;\n }\n\n module.exports = isMergeableShorthand;\n },\n { \"../../../tokenizer/marker\": 83 }\n ],\n 35: [\n function(require, module, exports) {\n var everyValuesPair = require(\"./every-values-pair\");\n var hasInherit = require(\"./has-inherit\");\n var populateComponents = require(\"./populate-components\");\n\n var compactable = require(\"../compactable\");\n var deepClone = require(\"../clone\").deep;\n var restoreWithComponents = require(\"../restore-with-components\");\n\n var restoreFromOptimizing = require(\"../../restore-from-optimizing\");\n var wrapSingle = require(\"../../wrap-for-optimizing\").single;\n\n var serializeBody = require(\"../../../writer/one-time\").body;\n var Token = require(\"../../../tokenizer/token\");\n\n function mergeIntoShorthands(properties, validator) {\n var candidates = {};\n var descriptor;\n var componentOf;\n var property;\n var i, l;\n var j, m;\n\n // there is no shorthand property made up of less than 3 longhands\n if (properties.length < 3) {\n return;\n }\n\n for (i = 0, l = properties.length; i < l; i++) {\n property = properties[i];\n descriptor = compactable[property.name];\n\n if (property.unused) {\n continue;\n }\n\n if (property.hack) {\n continue;\n }\n\n if (property.block) {\n continue;\n }\n\n invalidateOrCompact(properties, i, candidates, validator);\n\n if (descriptor && descriptor.componentOf) {\n for (j = 0, m = descriptor.componentOf.length; j < m; j++) {\n componentOf = descriptor.componentOf[j];\n\n candidates[componentOf] = candidates[componentOf] || {};\n candidates[componentOf][property.name] = property;\n }\n }\n }\n\n invalidateOrCompact(properties, i, candidates, validator);\n }\n\n function invalidateOrCompact(\n properties,\n position,\n candidates,\n validator\n ) {\n var invalidatedBy = properties[position];\n var shorthandName;\n var shorthandDescriptor;\n var candidateComponents;\n\n for (shorthandName in candidates) {\n if (\n undefined !== invalidatedBy &&\n shorthandName == invalidatedBy.name\n ) {\n continue;\n }\n\n shorthandDescriptor = compactable[shorthandName];\n candidateComponents = candidates[shorthandName];\n if (\n invalidatedBy &&\n invalidates(candidates, shorthandName, invalidatedBy)\n ) {\n delete candidates[shorthandName];\n continue;\n }\n\n if (\n shorthandDescriptor.components.length >\n Object.keys(candidateComponents).length\n ) {\n continue;\n }\n\n if (mixedImportance(candidateComponents)) {\n continue;\n }\n\n if (!overridable(candidateComponents, shorthandName, validator)) {\n continue;\n }\n\n if (!mergeable(candidateComponents)) {\n continue;\n }\n\n if (mixedInherit(candidateComponents)) {\n replaceWithInheritBestFit(\n properties,\n candidateComponents,\n shorthandName,\n validator\n );\n } else {\n replaceWithShorthand(\n properties,\n candidateComponents,\n shorthandName,\n validator\n );\n }\n }\n }\n\n function invalidates(candidates, shorthandName, invalidatedBy) {\n var shorthandDescriptor = compactable[shorthandName];\n var invalidatedByDescriptor = compactable[invalidatedBy.name];\n var componentName;\n\n if (\n \"overridesShorthands\" in shorthandDescriptor &&\n shorthandDescriptor.overridesShorthands.indexOf(\n invalidatedBy.name\n ) > -1\n ) {\n return true;\n }\n\n if (\n invalidatedByDescriptor &&\n \"componentOf\" in invalidatedByDescriptor\n ) {\n for (componentName in candidates[shorthandName]) {\n if (\n invalidatedByDescriptor.componentOf.indexOf(componentName) > -1\n ) {\n return true;\n }\n }\n }\n\n return false;\n }\n\n function mixedImportance(components) {\n var important;\n var componentName;\n\n for (componentName in components) {\n if (\n undefined !== important &&\n components[componentName].important != important\n ) {\n return true;\n }\n\n important = components[componentName].important;\n }\n\n return false;\n }\n\n function overridable(components, shorthandName, validator) {\n var descriptor = compactable[shorthandName];\n var newValuePlaceholder = [\n Token.PROPERTY,\n [Token.PROPERTY_NAME, shorthandName],\n [Token.PROPERTY_VALUE, descriptor.defaultValue]\n ];\n var newProperty = wrapSingle(newValuePlaceholder);\n var component;\n var mayOverride;\n var i, l;\n\n populateComponents([newProperty], validator, []);\n\n for (i = 0, l = descriptor.components.length; i < l; i++) {\n component = components[descriptor.components[i]];\n mayOverride = compactable[component.name].canOverride;\n\n if (\n !everyValuesPair(\n mayOverride.bind(null, validator),\n newProperty.components[i],\n component\n )\n ) {\n return false;\n }\n }\n\n return true;\n }\n\n function mergeable(components) {\n var lastCount = null;\n var currentCount;\n var componentName;\n var component;\n var descriptor;\n var values;\n\n for (componentName in components) {\n component = components[componentName];\n descriptor = compactable[componentName];\n\n if (!(\"restore\" in descriptor)) {\n continue;\n }\n\n restoreFromOptimizing(\n [component.all[component.position]],\n restoreWithComponents\n );\n values = descriptor.restore(component, compactable);\n\n currentCount = values.length;\n\n if (lastCount !== null && currentCount !== lastCount) {\n return false;\n }\n\n lastCount = currentCount;\n }\n\n return true;\n }\n\n function mixedInherit(components) {\n var componentName;\n var lastValue = null;\n var currentValue;\n\n for (componentName in components) {\n currentValue = hasInherit(components[componentName]);\n\n if (lastValue !== null && lastValue !== currentValue) {\n return true;\n }\n\n lastValue = currentValue;\n }\n\n return false;\n }\n\n function replaceWithInheritBestFit(\n properties,\n candidateComponents,\n shorthandName,\n validator\n ) {\n var viaLonghands = buildSequenceWithInheritLonghands(\n candidateComponents,\n shorthandName,\n validator\n );\n var viaShorthand = buildSequenceWithInheritShorthand(\n candidateComponents,\n shorthandName,\n validator\n );\n var longhandTokensSequence = viaLonghands[0];\n var shorthandTokensSequence = viaShorthand[0];\n var isLonghandsShorter =\n serializeBody(longhandTokensSequence).length <\n serializeBody(shorthandTokensSequence).length;\n var newTokensSequence = isLonghandsShorter\n ? longhandTokensSequence\n : shorthandTokensSequence;\n var newProperty = isLonghandsShorter\n ? viaLonghands[1]\n : viaShorthand[1];\n var newComponents = isLonghandsShorter\n ? viaLonghands[2]\n : viaShorthand[2];\n var all =\n candidateComponents[Object.keys(candidateComponents)[0]].all;\n var componentName;\n var oldComponent;\n var newComponent;\n var newToken;\n\n newProperty.position = all.length;\n newProperty.shorthand = true;\n newProperty.dirty = true;\n newProperty.all = all;\n newProperty.all.push(newTokensSequence[0]);\n\n properties.push(newProperty);\n\n for (componentName in candidateComponents) {\n oldComponent = candidateComponents[componentName];\n oldComponent.unused = true;\n\n if (oldComponent.name in newComponents) {\n newComponent = newComponents[oldComponent.name];\n newToken = findTokenIn(newTokensSequence, componentName);\n\n newComponent.position = all.length;\n newComponent.all = all;\n newComponent.all.push(newToken);\n\n properties.push(newComponent);\n }\n }\n }\n\n function buildSequenceWithInheritLonghands(\n components,\n shorthandName,\n validator\n ) {\n var tokensSequence = [];\n var inheritComponents = {};\n var nonInheritComponents = {};\n var descriptor = compactable[shorthandName];\n var shorthandToken = [\n Token.PROPERTY,\n [Token.PROPERTY_NAME, shorthandName],\n [Token.PROPERTY_VALUE, descriptor.defaultValue]\n ];\n var newProperty = wrapSingle(shorthandToken);\n var component;\n var longhandToken;\n var newComponent;\n var nameMetadata;\n var i, l;\n\n populateComponents([newProperty], validator, []);\n\n for (i = 0, l = descriptor.components.length; i < l; i++) {\n component = components[descriptor.components[i]];\n\n if (hasInherit(component)) {\n longhandToken = component.all[component.position].slice(0, 2);\n Array.prototype.push.apply(longhandToken, component.value);\n tokensSequence.push(longhandToken);\n\n newComponent = deepClone(component);\n newComponent.value = inferComponentValue(\n components,\n newComponent.name\n );\n\n newProperty.components[i] = newComponent;\n inheritComponents[component.name] = deepClone(component);\n } else {\n newComponent = deepClone(component);\n newComponent.all = component.all;\n newProperty.components[i] = newComponent;\n\n nonInheritComponents[component.name] = component;\n }\n }\n\n nameMetadata = joinMetadata(nonInheritComponents, 1);\n shorthandToken[1].push(nameMetadata);\n\n restoreFromOptimizing([newProperty], restoreWithComponents);\n\n shorthandToken = shorthandToken.slice(0, 2);\n Array.prototype.push.apply(shorthandToken, newProperty.value);\n\n tokensSequence.unshift(shorthandToken);\n\n return [tokensSequence, newProperty, inheritComponents];\n }\n\n function inferComponentValue(components, propertyName) {\n var descriptor = compactable[propertyName];\n\n if (\"oppositeTo\" in descriptor) {\n return components[descriptor.oppositeTo].value;\n } else {\n return [[Token.PROPERTY_VALUE, descriptor.defaultValue]];\n }\n }\n\n function joinMetadata(components, at) {\n var metadata = [];\n var component;\n var originalValue;\n var componentMetadata;\n var componentName;\n\n for (componentName in components) {\n component = components[componentName];\n originalValue = component.all[component.position];\n componentMetadata = originalValue[at][originalValue[at].length - 1];\n\n Array.prototype.push.apply(metadata, componentMetadata);\n }\n\n return metadata.sort(metadataSorter);\n }\n\n function metadataSorter(metadata1, metadata2) {\n var line1 = metadata1[0];\n var line2 = metadata2[0];\n var column1 = metadata1[1];\n var column2 = metadata2[1];\n\n if (line1 < line2) {\n return -1;\n } else if (line1 === line2) {\n return column1 < column2 ? -1 : 1;\n } else {\n return 1;\n }\n }\n\n function buildSequenceWithInheritShorthand(\n components,\n shorthandName,\n validator\n ) {\n var tokensSequence = [];\n var inheritComponents = {};\n var nonInheritComponents = {};\n var descriptor = compactable[shorthandName];\n var shorthandToken = [\n Token.PROPERTY,\n [Token.PROPERTY_NAME, shorthandName],\n [Token.PROPERTY_VALUE, \"inherit\"]\n ];\n var newProperty = wrapSingle(shorthandToken);\n var component;\n var longhandToken;\n var nameMetadata;\n var valueMetadata;\n var i, l;\n\n populateComponents([newProperty], validator, []);\n\n for (i = 0, l = descriptor.components.length; i < l; i++) {\n component = components[descriptor.components[i]];\n\n if (hasInherit(component)) {\n inheritComponents[component.name] = component;\n } else {\n longhandToken = component.all[component.position].slice(0, 2);\n Array.prototype.push.apply(longhandToken, component.value);\n tokensSequence.push(longhandToken);\n\n nonInheritComponents[component.name] = deepClone(component);\n }\n }\n\n nameMetadata = joinMetadata(inheritComponents, 1);\n shorthandToken[1].push(nameMetadata);\n\n valueMetadata = joinMetadata(inheritComponents, 2);\n shorthandToken[2].push(valueMetadata);\n\n tokensSequence.unshift(shorthandToken);\n\n return [tokensSequence, newProperty, nonInheritComponents];\n }\n\n function findTokenIn(tokens, componentName) {\n var i, l;\n\n for (i = 0, l = tokens.length; i < l; i++) {\n if (tokens[i][1][1] == componentName) {\n return tokens[i];\n }\n }\n }\n\n function replaceWithShorthand(\n properties,\n candidateComponents,\n shorthandName,\n validator\n ) {\n var descriptor = compactable[shorthandName];\n var nameMetadata;\n var valueMetadata;\n var newValuePlaceholder = [\n Token.PROPERTY,\n [Token.PROPERTY_NAME, shorthandName],\n [Token.PROPERTY_VALUE, descriptor.defaultValue]\n ];\n var all;\n\n var newProperty = wrapSingle(newValuePlaceholder);\n newProperty.shorthand = true;\n newProperty.dirty = true;\n\n populateComponents([newProperty], validator, []);\n\n for (var i = 0, l = descriptor.components.length; i < l; i++) {\n var component = candidateComponents[descriptor.components[i]];\n\n newProperty.components[i] = deepClone(component);\n newProperty.important = component.important;\n\n all = component.all;\n }\n\n for (var componentName in candidateComponents) {\n candidateComponents[componentName].unused = true;\n }\n\n nameMetadata = joinMetadata(candidateComponents, 1);\n newValuePlaceholder[1].push(nameMetadata);\n\n valueMetadata = joinMetadata(candidateComponents, 2);\n newValuePlaceholder[2].push(valueMetadata);\n\n newProperty.position = all.length;\n newProperty.all = all;\n newProperty.all.push(newValuePlaceholder);\n\n properties.push(newProperty);\n }\n\n module.exports = mergeIntoShorthands;\n },\n {\n \"../../../tokenizer/token\": 84,\n \"../../../writer/one-time\": 98,\n \"../../restore-from-optimizing\": 56,\n \"../../wrap-for-optimizing\": 58,\n \"../clone\": 20,\n \"../compactable\": 21,\n \"../restore-with-components\": 48,\n \"./every-values-pair\": 30,\n \"./has-inherit\": 32,\n \"./populate-components\": 39\n }\n ],\n 36: [\n function(require, module, exports) {\n var mergeIntoShorthands = require(\"./merge-into-shorthands\");\n var overrideProperties = require(\"./override-properties\");\n var populateComponents = require(\"./populate-components\");\n\n var restoreWithComponents = require(\"../restore-with-components\");\n\n var wrapForOptimizing = require(\"../../wrap-for-optimizing\").all;\n var removeUnused = require(\"../../remove-unused\");\n var restoreFromOptimizing = require(\"../../restore-from-optimizing\");\n\n var OptimizationLevel = require(\"../../../options/optimization-level\")\n .OptimizationLevel;\n\n function optimizeProperties(\n properties,\n withOverriding,\n withMerging,\n context\n ) {\n var levelOptions = context.options.level[OptimizationLevel.Two];\n var _properties = wrapForOptimizing(\n properties,\n false,\n levelOptions.skipProperties\n );\n var _property;\n var i, l;\n\n populateComponents(_properties, context.validator, context.warnings);\n\n for (i = 0, l = _properties.length; i < l; i++) {\n _property = _properties[i];\n if (_property.block) {\n optimizeProperties(\n _property.value[0][1],\n withOverriding,\n withMerging,\n context\n );\n }\n }\n\n if (withMerging && levelOptions.mergeIntoShorthands) {\n mergeIntoShorthands(_properties, context.validator);\n }\n\n if (withOverriding && levelOptions.overrideProperties) {\n overrideProperties(\n _properties,\n withMerging,\n context.options.compatibility,\n context.validator\n );\n }\n\n restoreFromOptimizing(_properties, restoreWithComponents);\n removeUnused(_properties);\n }\n\n module.exports = optimizeProperties;\n },\n {\n \"../../../options/optimization-level\": 65,\n \"../../remove-unused\": 55,\n \"../../restore-from-optimizing\": 56,\n \"../../wrap-for-optimizing\": 58,\n \"../restore-with-components\": 48,\n \"./merge-into-shorthands\": 35,\n \"./override-properties\": 37,\n \"./populate-components\": 39\n }\n ],\n 37: [\n function(require, module, exports) {\n var hasInherit = require(\"./has-inherit\");\n var everyValuesPair = require(\"./every-values-pair\");\n var findComponentIn = require(\"./find-component-in\");\n var isComponentOf = require(\"./is-component-of\");\n var isMergeableShorthand = require(\"./is-mergeable-shorthand\");\n var overridesNonComponentShorthand = require(\"./overrides-non-component-shorthand\");\n var sameVendorPrefixesIn = require(\"./vendor-prefixes\").same;\n\n var compactable = require(\"../compactable\");\n var deepClone = require(\"../clone\").deep;\n var restoreWithComponents = require(\"../restore-with-components\");\n var shallowClone = require(\"../clone\").shallow;\n\n var restoreFromOptimizing = require(\"../../restore-from-optimizing\");\n\n var Token = require(\"../../../tokenizer/token\");\n var Marker = require(\"../../../tokenizer/marker\");\n\n var serializeProperty = require(\"../../../writer/one-time\").property;\n\n function wouldBreakCompatibility(property, validator) {\n for (var i = 0; i < property.components.length; i++) {\n var component = property.components[i];\n var descriptor = compactable[component.name];\n var canOverride =\n (descriptor && descriptor.canOverride) || canOverride.sameValue;\n\n var _component = shallowClone(component);\n _component.value = [\n [Token.PROPERTY_VALUE, descriptor.defaultValue]\n ];\n\n if (\n !everyValuesPair(\n canOverride.bind(null, validator),\n _component,\n component\n )\n ) {\n return true;\n }\n }\n\n return false;\n }\n\n function overrideIntoMultiplex(property, by) {\n by.unused = true;\n\n turnIntoMultiplex(by, multiplexSize(property));\n property.value = by.value;\n }\n\n function overrideByMultiplex(property, by) {\n by.unused = true;\n property.multiplex = true;\n property.value = by.value;\n }\n\n function overrideSimple(property, by) {\n by.unused = true;\n property.value = by.value;\n }\n\n function override(property, by) {\n if (by.multiplex) overrideByMultiplex(property, by);\n else if (property.multiplex) overrideIntoMultiplex(property, by);\n else overrideSimple(property, by);\n }\n\n function overrideShorthand(property, by) {\n by.unused = true;\n\n for (var i = 0, l = property.components.length; i < l; i++) {\n override(\n property.components[i],\n by.components[i],\n property.multiplex\n );\n }\n }\n\n function turnIntoMultiplex(property, size) {\n property.multiplex = true;\n\n if (compactable[property.name].shorthand) {\n turnShorthandValueIntoMultiplex(property, size);\n } else {\n turnLonghandValueIntoMultiplex(property, size);\n }\n }\n\n function turnShorthandValueIntoMultiplex(property, size) {\n var component;\n var i, l;\n\n for (i = 0, l = property.components.length; i < l; i++) {\n component = property.components[i];\n\n if (!component.multiplex) {\n turnLonghandValueIntoMultiplex(component, size);\n }\n }\n }\n\n function turnLonghandValueIntoMultiplex(property, size) {\n var descriptor = compactable[property.name];\n var withRealValue = descriptor.intoMultiplexMode == \"real\";\n var withValue =\n descriptor.intoMultiplexMode == \"real\"\n ? property.value.slice(0)\n : descriptor.intoMultiplexMode == \"placeholder\"\n ? descriptor.placeholderValue\n : descriptor.defaultValue;\n var i = multiplexSize(property);\n var j;\n var m = withValue.length;\n\n for (; i < size; i++) {\n property.value.push([Token.PROPERTY_VALUE, Marker.COMMA]);\n\n if (Array.isArray(withValue)) {\n for (j = 0; j < m; j++) {\n property.value.push(\n withRealValue\n ? withValue[j]\n : [Token.PROPERTY_VALUE, withValue[j]]\n );\n }\n } else {\n property.value.push(\n withRealValue ? withValue : [Token.PROPERTY_VALUE, withValue]\n );\n }\n }\n }\n\n function multiplexSize(component) {\n var size = 0;\n\n for (var i = 0, l = component.value.length; i < l; i++) {\n if (component.value[i][1] == Marker.COMMA) size++;\n }\n\n return size + 1;\n }\n\n function lengthOf(property) {\n var fakeAsArray = [\n Token.PROPERTY,\n [Token.PROPERTY_NAME, property.name]\n ].concat(property.value);\n return serializeProperty([fakeAsArray], 0).length;\n }\n\n function moreSameShorthands(properties, startAt, name) {\n // Since we run the main loop in `compactOverrides` backwards, at this point some\n // properties may not be marked as unused.\n // We should consider reverting the order if possible\n var count = 0;\n\n for (var i = startAt; i >= 0; i--) {\n if (properties[i].name == name && !properties[i].unused) count++;\n if (count > 1) break;\n }\n\n return count > 1;\n }\n\n function overridingFunction(shorthand, validator) {\n for (var i = 0, l = shorthand.components.length; i < l; i++) {\n if (\n !anyValue(validator.isUrl, shorthand.components[i]) &&\n anyValue(validator.isFunction, shorthand.components[i])\n ) {\n return true;\n }\n }\n\n return false;\n }\n\n function anyValue(fn, property) {\n for (var i = 0, l = property.value.length; i < l; i++) {\n if (property.value[i][1] == Marker.COMMA) continue;\n\n if (fn(property.value[i][1])) return true;\n }\n\n return false;\n }\n\n function wouldResultInLongerValue(left, right) {\n if (\n (!left.multiplex && !right.multiplex) ||\n (left.multiplex && right.multiplex)\n )\n return false;\n\n var multiplex = left.multiplex ? left : right;\n var simple = left.multiplex ? right : left;\n var component;\n\n var multiplexClone = deepClone(multiplex);\n restoreFromOptimizing([multiplexClone], restoreWithComponents);\n\n var simpleClone = deepClone(simple);\n restoreFromOptimizing([simpleClone], restoreWithComponents);\n\n var lengthBefore =\n lengthOf(multiplexClone) + 1 + lengthOf(simpleClone);\n\n if (left.multiplex) {\n component = findComponentIn(multiplexClone, simpleClone);\n overrideIntoMultiplex(component, simpleClone);\n } else {\n component = findComponentIn(simpleClone, multiplexClone);\n turnIntoMultiplex(simpleClone, multiplexSize(multiplexClone));\n overrideByMultiplex(component, multiplexClone);\n }\n\n restoreFromOptimizing([simpleClone], restoreWithComponents);\n\n var lengthAfter = lengthOf(simpleClone);\n\n return lengthBefore <= lengthAfter;\n }\n\n function isCompactable(property) {\n return property.name in compactable;\n }\n\n function noneOverrideHack(left, right) {\n return (\n !left.multiplex &&\n (left.name == \"background\" || left.name == \"background-image\") &&\n right.multiplex &&\n (right.name == \"background\" || right.name == \"background-image\") &&\n anyLayerIsNone(right.value)\n );\n }\n\n function anyLayerIsNone(values) {\n var layers = intoLayers(values);\n\n for (var i = 0, l = layers.length; i < l; i++) {\n if (layers[i].length == 1 && layers[i][0][1] == \"none\") return true;\n }\n\n return false;\n }\n\n function intoLayers(values) {\n var layers = [];\n\n for (var i = 0, layer = [], l = values.length; i < l; i++) {\n var value = values[i];\n if (value[1] == Marker.COMMA) {\n layers.push(layer);\n layer = [];\n } else {\n layer.push(value);\n }\n }\n\n layers.push(layer);\n return layers;\n }\n\n function overrideProperties(\n properties,\n withMerging,\n compatibility,\n validator\n ) {\n var mayOverride, right, left, component;\n var overriddenComponents;\n var overriddenComponent;\n var overridingComponent;\n var overridable;\n var i, j, k;\n\n propertyLoop: for (i = properties.length - 1; i >= 0; i--) {\n right = properties[i];\n\n if (!isCompactable(right)) continue;\n\n if (right.block) continue;\n\n mayOverride = compactable[right.name].canOverride;\n\n traverseLoop: for (j = i - 1; j >= 0; j--) {\n left = properties[j];\n\n if (!isCompactable(left)) continue;\n\n if (left.block) continue;\n\n if (left.unused || right.unused) continue;\n\n if (\n (left.hack && !right.hack && !right.important) ||\n (!left.hack && !left.important && right.hack)\n )\n continue;\n\n if (\n left.important == right.important &&\n left.hack[0] != right.hack[0]\n )\n continue;\n\n if (\n left.important == right.important &&\n (left.hack[0] != right.hack[0] ||\n (left.hack[1] && left.hack[1] != right.hack[1]))\n )\n continue;\n\n if (hasInherit(right)) continue;\n\n if (noneOverrideHack(left, right)) continue;\n\n if (right.shorthand && isComponentOf(right, left)) {\n // maybe `left` can be overridden by `right` which is a shorthand?\n if (!right.important && left.important) continue;\n\n if (!sameVendorPrefixesIn([left], right.components)) continue;\n\n if (\n !anyValue(validator.isFunction, left) &&\n overridingFunction(right, validator)\n )\n continue;\n\n if (!isMergeableShorthand(right)) {\n left.unused = true;\n continue;\n }\n\n component = findComponentIn(right, left);\n mayOverride = compactable[left.name].canOverride;\n if (\n everyValuesPair(\n mayOverride.bind(null, validator),\n left,\n component\n )\n ) {\n left.unused = true;\n }\n } else if (\n right.shorthand &&\n overridesNonComponentShorthand(right, left)\n ) {\n // `right` is a shorthand while `left` can be overriden by it, think `border` and `border-top`\n if (!right.important && left.important) {\n continue;\n }\n\n if (!sameVendorPrefixesIn([left], right.components)) {\n continue;\n }\n\n if (\n !anyValue(validator.isFunction, left) &&\n overridingFunction(right, validator)\n ) {\n continue;\n }\n\n overriddenComponents = left.shorthand\n ? left.components\n : [left];\n\n for (k = overriddenComponents.length - 1; k >= 0; k--) {\n overriddenComponent = overriddenComponents[k];\n overridingComponent = findComponentIn(\n right,\n overriddenComponent\n );\n mayOverride =\n compactable[overriddenComponent.name].canOverride;\n\n if (\n !everyValuesPair(\n mayOverride.bind(null, validator),\n left,\n overridingComponent\n )\n ) {\n continue traverseLoop;\n }\n }\n\n left.unused = true;\n } else if (\n withMerging &&\n left.shorthand &&\n !right.shorthand &&\n isComponentOf(left, right, true)\n ) {\n // maybe `right` can be pulled into `left` which is a shorthand?\n if (right.important && !left.important) continue;\n\n if (!right.important && left.important) {\n right.unused = true;\n continue;\n }\n\n // Pending more clever algorithm in #527\n if (moreSameShorthands(properties, i - 1, left.name)) continue;\n\n if (overridingFunction(left, validator)) continue;\n\n if (!isMergeableShorthand(left)) continue;\n\n component = findComponentIn(left, right);\n if (\n everyValuesPair(\n mayOverride.bind(null, validator),\n component,\n right\n )\n ) {\n var disabledBackgroundMerging =\n (!compatibility.properties.backgroundClipMerging &&\n component.name.indexOf(\"background-clip\") > -1) ||\n (!compatibility.properties.backgroundOriginMerging &&\n component.name.indexOf(\"background-origin\") > -1) ||\n (!compatibility.properties.backgroundSizeMerging &&\n component.name.indexOf(\"background-size\") > -1);\n var nonMergeableValue =\n compactable[right.name].nonMergeableValue ===\n right.value[0][1];\n\n if (disabledBackgroundMerging || nonMergeableValue) continue;\n\n if (\n !compatibility.properties.merging &&\n wouldBreakCompatibility(left, validator)\n )\n continue;\n\n if (\n component.value[0][1] != right.value[0][1] &&\n (hasInherit(left) || hasInherit(right))\n )\n continue;\n\n if (wouldResultInLongerValue(left, right)) continue;\n\n if (!left.multiplex && right.multiplex)\n turnIntoMultiplex(left, multiplexSize(right));\n\n override(component, right);\n left.dirty = true;\n }\n } else if (\n withMerging &&\n left.shorthand &&\n right.shorthand &&\n left.name == right.name\n ) {\n // merge if all components can be merged\n\n if (!left.multiplex && right.multiplex) continue;\n\n if (!right.important && left.important) {\n right.unused = true;\n continue propertyLoop;\n }\n\n if (right.important && !left.important) {\n left.unused = true;\n continue;\n }\n\n if (!isMergeableShorthand(right)) {\n left.unused = true;\n continue;\n }\n\n for (k = left.components.length - 1; k >= 0; k--) {\n var leftComponent = left.components[k];\n var rightComponent = right.components[k];\n\n mayOverride = compactable[leftComponent.name].canOverride;\n if (\n !everyValuesPair(\n mayOverride.bind(null, validator),\n leftComponent,\n rightComponent\n )\n )\n continue propertyLoop;\n }\n\n overrideShorthand(left, right);\n left.dirty = true;\n } else if (\n withMerging &&\n left.shorthand &&\n right.shorthand &&\n isComponentOf(left, right)\n ) {\n // border is a shorthand but any of its components is a shorthand too\n\n if (!left.important && right.important) continue;\n\n component = findComponentIn(left, right);\n mayOverride = compactable[right.name].canOverride;\n if (\n !everyValuesPair(\n mayOverride.bind(null, validator),\n component,\n right\n )\n )\n continue;\n\n if (left.important && !right.important) {\n right.unused = true;\n continue;\n }\n\n var rightRestored = compactable[right.name].restore(\n right,\n compactable\n );\n if (rightRestored.length > 1) continue;\n\n component = findComponentIn(left, right);\n override(component, right);\n right.dirty = true;\n } else if (left.name == right.name) {\n // two non-shorthands should be merged based on understandability\n overridable = true;\n\n if (right.shorthand) {\n for (\n k = right.components.length - 1;\n k >= 0 && overridable;\n k--\n ) {\n overriddenComponent = left.components[k];\n overridingComponent = right.components[k];\n mayOverride =\n compactable[overridingComponent.name].canOverride;\n\n overridable =\n overridable &&\n everyValuesPair(\n mayOverride.bind(null, validator),\n overriddenComponent,\n overridingComponent\n );\n }\n } else {\n mayOverride = compactable[right.name].canOverride;\n overridable = everyValuesPair(\n mayOverride.bind(null, validator),\n left,\n right\n );\n }\n\n if (left.important && !right.important && overridable) {\n right.unused = true;\n continue;\n }\n\n if (!left.important && right.important && overridable) {\n left.unused = true;\n continue;\n }\n\n if (!overridable) {\n continue;\n }\n\n left.unused = true;\n }\n }\n }\n }\n\n module.exports = overrideProperties;\n },\n {\n \"../../../tokenizer/marker\": 83,\n \"../../../tokenizer/token\": 84,\n \"../../../writer/one-time\": 98,\n \"../../restore-from-optimizing\": 56,\n \"../clone\": 20,\n \"../compactable\": 21,\n \"../restore-with-components\": 48,\n \"./every-values-pair\": 30,\n \"./find-component-in\": 31,\n \"./has-inherit\": 32,\n \"./is-component-of\": 33,\n \"./is-mergeable-shorthand\": 34,\n \"./overrides-non-component-shorthand\": 38,\n \"./vendor-prefixes\": 41\n }\n ],\n 38: [\n function(require, module, exports) {\n var compactable = require(\"../compactable\");\n\n function overridesNonComponentShorthand(property1, property2) {\n return (\n property1.name in compactable &&\n \"overridesShorthands\" in compactable[property1.name] &&\n compactable[property1.name].overridesShorthands.indexOf(\n property2.name\n ) > -1\n );\n }\n\n module.exports = overridesNonComponentShorthand;\n },\n { \"../compactable\": 21 }\n ],\n 39: [\n function(require, module, exports) {\n var compactable = require(\"../compactable\");\n var InvalidPropertyError = require(\"../invalid-property-error\");\n\n function populateComponents(properties, validator, warnings) {\n var component;\n var j, m;\n\n for (var i = properties.length - 1; i >= 0; i--) {\n var property = properties[i];\n var descriptor = compactable[property.name];\n\n if (descriptor && descriptor.shorthand) {\n property.shorthand = true;\n property.dirty = true;\n\n try {\n property.components = descriptor.breakUp(\n property,\n compactable,\n validator\n );\n\n if (descriptor.shorthandComponents) {\n for (j = 0, m = property.components.length; j < m; j++) {\n component = property.components[j];\n component.components = compactable[component.name].breakUp(\n component,\n compactable,\n validator\n );\n }\n }\n } catch (e) {\n if (e instanceof InvalidPropertyError) {\n property.components = []; // this will set property.unused to true below\n warnings.push(e.message);\n } else {\n throw e;\n }\n }\n\n if (property.components.length > 0)\n property.multiplex = property.components[0].multiplex;\n else property.unused = true;\n }\n }\n }\n\n module.exports = populateComponents;\n },\n { \"../compactable\": 21, \"../invalid-property-error\": 23 }\n ],\n 40: [\n function(require, module, exports) {\n var sameVendorPrefixes = require(\"./vendor-prefixes\").same;\n\n function understandable(\n validator,\n value1,\n value2,\n _position,\n isPaired\n ) {\n if (!sameVendorPrefixes(value1, value2)) {\n return false;\n }\n\n if (\n isPaired &&\n validator.isVariable(value1) !== validator.isVariable(value2)\n ) {\n return false;\n }\n\n return true;\n }\n\n module.exports = understandable;\n },\n { \"./vendor-prefixes\": 41 }\n ],\n 41: [\n function(require, module, exports) {\n var VENDOR_PREFIX_PATTERN = /(?:^|\\W)(\\-\\w+\\-)/g;\n\n function unique(value) {\n var prefixes = [];\n var match;\n\n while ((match = VENDOR_PREFIX_PATTERN.exec(value)) !== null) {\n if (prefixes.indexOf(match[0]) == -1) {\n prefixes.push(match[0]);\n }\n }\n\n return prefixes;\n }\n\n function same(value1, value2) {\n return (\n unique(value1)\n .sort()\n .join(\",\") ==\n unique(value2)\n .sort()\n .join(\",\")\n );\n }\n\n module.exports = {\n unique: unique,\n same: same\n };\n },\n {}\n ],\n 42: [\n function(require, module, exports) {\n var isMergeable = require(\"./is-mergeable\");\n\n var optimizeProperties = require(\"./properties/optimize\");\n\n var cloneArray = require(\"../../utils/clone-array\");\n\n var Token = require(\"../../tokenizer/token\");\n\n var serializeBody = require(\"../../writer/one-time\").body;\n var serializeRules = require(\"../../writer/one-time\").rules;\n\n function reduceNonAdjacent(tokens, context) {\n var options = context.options;\n var mergeablePseudoClasses =\n options.compatibility.selectors.mergeablePseudoClasses;\n var mergeablePseudoElements =\n options.compatibility.selectors.mergeablePseudoElements;\n var multiplePseudoMerging =\n options.compatibility.selectors.multiplePseudoMerging;\n var candidates = {};\n var repeated = [];\n\n for (var i = tokens.length - 1; i >= 0; i--) {\n var token = tokens[i];\n\n if (token[0] != Token.RULE) {\n continue;\n } else if (token[2].length === 0) {\n continue;\n }\n\n var selectorAsString = serializeRules(token[1]);\n var isComplexAndNotSpecial =\n token[1].length > 1 &&\n isMergeable(\n selectorAsString,\n mergeablePseudoClasses,\n mergeablePseudoElements,\n multiplePseudoMerging\n );\n var wrappedSelectors = wrappedSelectorsFrom(token[1]);\n var selectors = isComplexAndNotSpecial\n ? [selectorAsString].concat(wrappedSelectors)\n : [selectorAsString];\n\n for (var j = 0, m = selectors.length; j < m; j++) {\n var selector = selectors[j];\n\n if (!candidates[selector]) candidates[selector] = [];\n else repeated.push(selector);\n\n candidates[selector].push({\n where: i,\n list: wrappedSelectors,\n isPartial: isComplexAndNotSpecial && j > 0,\n isComplex: isComplexAndNotSpecial && j === 0\n });\n }\n }\n\n reduceSimpleNonAdjacentCases(\n tokens,\n repeated,\n candidates,\n options,\n context\n );\n reduceComplexNonAdjacentCases(tokens, candidates, options, context);\n }\n\n function wrappedSelectorsFrom(list) {\n var wrapped = [];\n\n for (var i = 0; i < list.length; i++) {\n wrapped.push([list[i][1]]);\n }\n\n return wrapped;\n }\n\n function reduceSimpleNonAdjacentCases(\n tokens,\n repeated,\n candidates,\n options,\n context\n ) {\n function filterOut(idx, bodies) {\n return data[idx].isPartial && bodies.length === 0;\n }\n\n function reduceBody(token, newBody, processedCount, tokenIdx) {\n if (!data[processedCount - tokenIdx - 1].isPartial)\n token[2] = newBody;\n }\n\n for (var i = 0, l = repeated.length; i < l; i++) {\n var selector = repeated[i];\n var data = candidates[selector];\n\n reduceSelector(\n tokens,\n data,\n {\n filterOut: filterOut,\n callback: reduceBody\n },\n options,\n context\n );\n }\n }\n\n function reduceComplexNonAdjacentCases(\n tokens,\n candidates,\n options,\n context\n ) {\n var mergeablePseudoClasses =\n options.compatibility.selectors.mergeablePseudoClasses;\n var mergeablePseudoElements =\n options.compatibility.selectors.mergeablePseudoElements;\n var multiplePseudoMerging =\n options.compatibility.selectors.multiplePseudoMerging;\n var localContext = {};\n\n function filterOut(idx) {\n return localContext.data[idx].where < localContext.intoPosition;\n }\n\n function collectReducedBodies(\n token,\n newBody,\n processedCount,\n tokenIdx\n ) {\n if (tokenIdx === 0) localContext.reducedBodies.push(newBody);\n }\n\n allSelectors: for (var complexSelector in candidates) {\n var into = candidates[complexSelector];\n if (!into[0].isComplex) continue;\n\n var intoPosition = into[into.length - 1].where;\n var intoToken = tokens[intoPosition];\n var reducedBodies = [];\n\n var selectors = isMergeable(\n complexSelector,\n mergeablePseudoClasses,\n mergeablePseudoElements,\n multiplePseudoMerging\n )\n ? into[0].list\n : [complexSelector];\n\n localContext.intoPosition = intoPosition;\n localContext.reducedBodies = reducedBodies;\n\n for (var j = 0, m = selectors.length; j < m; j++) {\n var selector = selectors[j];\n var data = candidates[selector];\n\n if (data.length < 2) continue allSelectors;\n\n localContext.data = data;\n\n reduceSelector(\n tokens,\n data,\n {\n filterOut: filterOut,\n callback: collectReducedBodies\n },\n options,\n context\n );\n\n if (\n serializeBody(reducedBodies[reducedBodies.length - 1]) !=\n serializeBody(reducedBodies[0])\n )\n continue allSelectors;\n }\n\n intoToken[2] = reducedBodies[0];\n }\n }\n\n function reduceSelector(tokens, data, context, options, outerContext) {\n var bodies = [];\n var bodiesAsList = [];\n var processedTokens = [];\n\n for (var j = data.length - 1; j >= 0; j--) {\n if (context.filterOut(j, bodies)) continue;\n\n var where = data[j].where;\n var token = tokens[where];\n var clonedBody = cloneArray(token[2]);\n\n bodies = bodies.concat(clonedBody);\n bodiesAsList.push(clonedBody);\n processedTokens.push(where);\n }\n\n optimizeProperties(bodies, true, false, outerContext);\n\n var processedCount = processedTokens.length;\n var propertyIdx = bodies.length - 1;\n var tokenIdx = processedCount - 1;\n\n while (tokenIdx >= 0) {\n if (\n (tokenIdx === 0 ||\n (bodies[propertyIdx] &&\n bodiesAsList[tokenIdx].indexOf(bodies[propertyIdx]) > -1)) &&\n propertyIdx > -1\n ) {\n propertyIdx--;\n continue;\n }\n\n var newBody = bodies.splice(propertyIdx + 1);\n context.callback(\n tokens[processedTokens[tokenIdx]],\n newBody,\n processedCount,\n tokenIdx\n );\n\n tokenIdx--;\n }\n }\n\n module.exports = reduceNonAdjacent;\n },\n {\n \"../../tokenizer/token\": 84,\n \"../../utils/clone-array\": 86,\n \"../../writer/one-time\": 98,\n \"./is-mergeable\": 24,\n \"./properties/optimize\": 36\n }\n ],\n 43: [\n function(require, module, exports) {\n var Token = require(\"../../tokenizer/token\");\n\n var serializeAll = require(\"../../writer/one-time\").all;\n\n var FONT_FACE_SCOPE = \"@font-face\";\n\n function removeDuplicateFontAtRules(tokens) {\n var fontAtRules = [];\n var token;\n var key;\n var i, l;\n\n for (i = 0, l = tokens.length; i < l; i++) {\n token = tokens[i];\n\n if (\n token[0] != Token.AT_RULE_BLOCK &&\n token[1][0][1] != FONT_FACE_SCOPE\n ) {\n continue;\n }\n\n key = serializeAll([token]);\n\n if (fontAtRules.indexOf(key) > -1) {\n token[2] = [];\n } else {\n fontAtRules.push(key);\n }\n }\n }\n\n module.exports = removeDuplicateFontAtRules;\n },\n { \"../../tokenizer/token\": 84, \"../../writer/one-time\": 98 }\n ],\n 44: [\n function(require, module, exports) {\n var Token = require(\"../../tokenizer/token\");\n\n var serializeAll = require(\"../../writer/one-time\").all;\n var serializeRules = require(\"../../writer/one-time\").rules;\n\n function removeDuplicateMediaQueries(tokens) {\n var candidates = {};\n var candidate;\n var token;\n var key;\n var i, l;\n\n for (i = 0, l = tokens.length; i < l; i++) {\n token = tokens[i];\n if (token[0] != Token.NESTED_BLOCK) {\n continue;\n }\n\n key = serializeRules(token[1]) + \"%\" + serializeAll(token[2]);\n candidate = candidates[key];\n\n if (candidate) {\n candidate[2] = [];\n }\n\n candidates[key] = token;\n }\n }\n\n module.exports = removeDuplicateMediaQueries;\n },\n { \"../../tokenizer/token\": 84, \"../../writer/one-time\": 98 }\n ],\n 45: [\n function(require, module, exports) {\n var Token = require(\"../../tokenizer/token\");\n\n var serializeBody = require(\"../../writer/one-time\").body;\n var serializeRules = require(\"../../writer/one-time\").rules;\n\n function removeDuplicates(tokens) {\n var matched = {};\n var moreThanOnce = [];\n var id, token;\n var body, bodies;\n\n for (var i = 0, l = tokens.length; i < l; i++) {\n token = tokens[i];\n if (token[0] != Token.RULE) continue;\n\n id = serializeRules(token[1]);\n\n if (matched[id] && matched[id].length == 1) moreThanOnce.push(id);\n else matched[id] = matched[id] || [];\n\n matched[id].push(i);\n }\n\n for (i = 0, l = moreThanOnce.length; i < l; i++) {\n id = moreThanOnce[i];\n bodies = [];\n\n for (var j = matched[id].length - 1; j >= 0; j--) {\n token = tokens[matched[id][j]];\n body = serializeBody(token[2]);\n\n if (bodies.indexOf(body) > -1) token[2] = [];\n else bodies.push(body);\n }\n }\n }\n\n module.exports = removeDuplicates;\n },\n { \"../../tokenizer/token\": 84, \"../../writer/one-time\": 98 }\n ],\n 46: [\n function(require, module, exports) {\n var populateComponents = require(\"./properties/populate-components\");\n\n var wrapForOptimizing = require(\"../wrap-for-optimizing\").single;\n var restoreFromOptimizing = require(\"../restore-from-optimizing\");\n\n var Token = require(\"../../tokenizer/token\");\n\n var animationNameRegex = /^(\\-moz\\-|\\-o\\-|\\-webkit\\-)?animation-name$/;\n var animationRegex = /^(\\-moz\\-|\\-o\\-|\\-webkit\\-)?animation$/;\n var keyframeRegex = /^@(\\-moz\\-|\\-o\\-|\\-webkit\\-)?keyframes /;\n var importantRegex = /\\s{0,31}!important$/;\n var optionalMatchingQuotesRegex = /^(['\"]?)(.*)\\1$/;\n\n function normalize(value) {\n return value\n .replace(optionalMatchingQuotesRegex, \"$2\")\n .replace(importantRegex, \"\");\n }\n\n function removeUnusedAtRules(tokens, context) {\n removeUnusedAtRule(\n tokens,\n matchCounterStyle,\n markCounterStylesAsUsed,\n context\n );\n removeUnusedAtRule(\n tokens,\n matchFontFace,\n markFontFacesAsUsed,\n context\n );\n removeUnusedAtRule(\n tokens,\n matchKeyframe,\n markKeyframesAsUsed,\n context\n );\n removeUnusedAtRule(\n tokens,\n matchNamespace,\n markNamespacesAsUsed,\n context\n );\n }\n\n function removeUnusedAtRule(\n tokens,\n matchCallback,\n markCallback,\n context\n ) {\n var atRules = {};\n var atRule;\n var atRuleTokens;\n var atRuleToken;\n var zeroAt;\n var i, l;\n\n for (i = 0, l = tokens.length; i < l; i++) {\n matchCallback(tokens[i], atRules);\n }\n\n if (Object.keys(atRules).length === 0) {\n return;\n }\n\n markUsedAtRules(tokens, markCallback, atRules, context);\n\n for (atRule in atRules) {\n atRuleTokens = atRules[atRule];\n\n for (i = 0, l = atRuleTokens.length; i < l; i++) {\n atRuleToken = atRuleTokens[i];\n zeroAt = atRuleToken[0] == Token.AT_RULE ? 1 : 2;\n atRuleToken[zeroAt] = [];\n }\n }\n }\n\n function markUsedAtRules(tokens, markCallback, atRules, context) {\n var boundMarkCallback = markCallback(atRules);\n var i, l;\n\n for (i = 0, l = tokens.length; i < l; i++) {\n switch (tokens[i][0]) {\n case Token.RULE:\n boundMarkCallback(tokens[i], context);\n break;\n case Token.NESTED_BLOCK:\n markUsedAtRules(tokens[i][2], markCallback, atRules, context);\n }\n }\n }\n\n function matchCounterStyle(token, atRules) {\n var match;\n\n if (\n token[0] == Token.AT_RULE_BLOCK &&\n token[1][0][1].indexOf(\"@counter-style\") === 0\n ) {\n match = token[1][0][1].split(\" \")[1];\n atRules[match] = atRules[match] || [];\n atRules[match].push(token);\n }\n }\n\n function markCounterStylesAsUsed(atRules) {\n return function(token, context) {\n var property;\n var wrappedProperty;\n var i, l;\n\n for (i = 0, l = token[2].length; i < l; i++) {\n property = token[2][i];\n\n if (property[1][1] == \"list-style\") {\n wrappedProperty = wrapForOptimizing(property);\n populateComponents(\n [wrappedProperty],\n context.validator,\n context.warnings\n );\n\n if (wrappedProperty.components[0].value[0][1] in atRules) {\n delete atRules[property[2][1]];\n }\n\n restoreFromOptimizing([wrappedProperty]);\n }\n\n if (\n property[1][1] == \"list-style-type\" &&\n property[2][1] in atRules\n ) {\n delete atRules[property[2][1]];\n }\n }\n };\n }\n\n function matchFontFace(token, atRules) {\n var property;\n var match;\n var i, l;\n\n if (\n token[0] == Token.AT_RULE_BLOCK &&\n token[1][0][1] == \"@font-face\"\n ) {\n for (i = 0, l = token[2].length; i < l; i++) {\n property = token[2][i];\n\n if (property[1][1] == \"font-family\") {\n match = normalize(property[2][1].toLowerCase());\n atRules[match] = atRules[match] || [];\n atRules[match].push(token);\n break;\n }\n }\n }\n }\n\n function markFontFacesAsUsed(atRules) {\n return function(token, context) {\n var property;\n var wrappedProperty;\n var component;\n var normalizedMatch;\n var i, l;\n var j, m;\n\n for (i = 0, l = token[2].length; i < l; i++) {\n property = token[2][i];\n\n if (property[1][1] == \"font\") {\n wrappedProperty = wrapForOptimizing(property);\n populateComponents(\n [wrappedProperty],\n context.validator,\n context.warnings\n );\n component = wrappedProperty.components[6];\n\n for (j = 0, m = component.value.length; j < m; j++) {\n normalizedMatch = normalize(\n component.value[j][1].toLowerCase()\n );\n\n if (normalizedMatch in atRules) {\n delete atRules[normalizedMatch];\n }\n }\n\n restoreFromOptimizing([wrappedProperty]);\n }\n\n if (property[1][1] == \"font-family\") {\n for (j = 2, m = property.length; j < m; j++) {\n normalizedMatch = normalize(property[j][1].toLowerCase());\n\n if (normalizedMatch in atRules) {\n delete atRules[normalizedMatch];\n }\n }\n }\n }\n };\n }\n\n function matchKeyframe(token, atRules) {\n var match;\n\n if (\n token[0] == Token.NESTED_BLOCK &&\n keyframeRegex.test(token[1][0][1])\n ) {\n match = token[1][0][1].split(\" \")[1];\n atRules[match] = atRules[match] || [];\n atRules[match].push(token);\n }\n }\n\n function markKeyframesAsUsed(atRules) {\n return function(token, context) {\n var property;\n var wrappedProperty;\n var component;\n var i, l;\n var j, m;\n\n for (i = 0, l = token[2].length; i < l; i++) {\n property = token[2][i];\n\n if (animationRegex.test(property[1][1])) {\n wrappedProperty = wrapForOptimizing(property);\n populateComponents(\n [wrappedProperty],\n context.validator,\n context.warnings\n );\n component = wrappedProperty.components[7];\n\n for (j = 0, m = component.value.length; j < m; j++) {\n if (component.value[j][1] in atRules) {\n delete atRules[component.value[j][1]];\n }\n }\n\n restoreFromOptimizing([wrappedProperty]);\n }\n\n if (animationNameRegex.test(property[1][1])) {\n for (j = 2, m = property.length; j < m; j++) {\n if (property[j][1] in atRules) {\n delete atRules[property[j][1]];\n }\n }\n }\n }\n };\n }\n\n function matchNamespace(token, atRules) {\n var match;\n\n if (\n token[0] == Token.AT_RULE &&\n token[1].indexOf(\"@namespace\") === 0\n ) {\n match = token[1].split(\" \")[1];\n atRules[match] = atRules[match] || [];\n atRules[match].push(token);\n }\n }\n\n function markNamespacesAsUsed(atRules) {\n var namespaceRegex = new RegExp(\n Object.keys(atRules).join(\"\\\\||\") + \"\\\\|\",\n \"g\"\n );\n\n return function(token) {\n var match;\n var scope;\n var normalizedMatch;\n var i, l;\n var j, m;\n\n for (i = 0, l = token[1].length; i < l; i++) {\n scope = token[1][i];\n match = scope[1].match(namespaceRegex);\n\n for (j = 0, m = match.length; j < m; j++) {\n normalizedMatch = match[j].substring(0, match[j].length - 1);\n\n if (normalizedMatch in atRules) {\n delete atRules[normalizedMatch];\n }\n }\n }\n };\n }\n\n module.exports = removeUnusedAtRules;\n },\n {\n \"../../tokenizer/token\": 84,\n \"../restore-from-optimizing\": 56,\n \"../wrap-for-optimizing\": 58,\n \"./properties/populate-components\": 39\n }\n ],\n 47: [\n function(require, module, exports) {\n // TODO: it'd be great to merge it with the other canReorder functionality\n\n var rulesOverlap = require(\"./rules-overlap\");\n var specificitiesOverlap = require(\"./specificities-overlap\");\n\n var FLEX_PROPERTIES = /align\\-items|box\\-align|box\\-pack|flex|justify/;\n var BORDER_PROPERTIES = /^border\\-(top|right|bottom|left|color|style|width|radius)/;\n\n function canReorder(left, right, cache) {\n for (var i = right.length - 1; i >= 0; i--) {\n for (var j = left.length - 1; j >= 0; j--) {\n if (!canReorderSingle(left[j], right[i], cache)) return false;\n }\n }\n\n return true;\n }\n\n function canReorderSingle(left, right, cache) {\n var leftName = left[0];\n var leftValue = left[1];\n var leftNameRoot = left[2];\n var leftSelector = left[5];\n var leftInSpecificSelector = left[6];\n var rightName = right[0];\n var rightValue = right[1];\n var rightNameRoot = right[2];\n var rightSelector = right[5];\n var rightInSpecificSelector = right[6];\n\n if (\n (leftName == \"font\" && rightName == \"line-height\") ||\n (rightName == \"font\" && leftName == \"line-height\")\n )\n return false;\n if (FLEX_PROPERTIES.test(leftName) && FLEX_PROPERTIES.test(rightName))\n return false;\n if (\n leftNameRoot == rightNameRoot &&\n unprefixed(leftName) == unprefixed(rightName) &&\n vendorPrefixed(leftName) ^ vendorPrefixed(rightName)\n )\n return false;\n if (\n leftNameRoot == \"border\" &&\n BORDER_PROPERTIES.test(rightNameRoot) &&\n (leftName == \"border\" ||\n leftName == rightNameRoot ||\n (leftValue != rightValue &&\n sameBorderComponent(leftName, rightName)))\n )\n return false;\n if (\n rightNameRoot == \"border\" &&\n BORDER_PROPERTIES.test(leftNameRoot) &&\n (rightName == \"border\" ||\n rightName == leftNameRoot ||\n (leftValue != rightValue &&\n sameBorderComponent(leftName, rightName)))\n )\n return false;\n if (\n leftNameRoot == \"border\" &&\n rightNameRoot == \"border\" &&\n leftName != rightName &&\n ((isSideBorder(leftName) && isStyleBorder(rightName)) ||\n (isStyleBorder(leftName) && isSideBorder(rightName)))\n )\n return false;\n if (leftNameRoot != rightNameRoot) return true;\n if (\n leftName == rightName &&\n leftNameRoot == rightNameRoot &&\n (leftValue == rightValue ||\n withDifferentVendorPrefix(leftValue, rightValue))\n )\n return true;\n if (\n leftName != rightName &&\n leftNameRoot == rightNameRoot &&\n leftName != leftNameRoot &&\n rightName != rightNameRoot\n )\n return true;\n if (\n leftName != rightName &&\n leftNameRoot == rightNameRoot &&\n leftValue == rightValue\n )\n return true;\n if (\n rightInSpecificSelector &&\n leftInSpecificSelector &&\n !inheritable(leftNameRoot) &&\n !inheritable(rightNameRoot) &&\n !rulesOverlap(rightSelector, leftSelector, false)\n )\n return true;\n if (!specificitiesOverlap(leftSelector, rightSelector, cache))\n return true;\n\n return false;\n }\n\n function vendorPrefixed(name) {\n return /^\\-(?:moz|webkit|ms|o)\\-/.test(name);\n }\n\n function unprefixed(name) {\n return name.replace(/^\\-(?:moz|webkit|ms|o)\\-/, \"\");\n }\n\n function sameBorderComponent(name1, name2) {\n return name1.split(\"-\").pop() == name2.split(\"-\").pop();\n }\n\n function isSideBorder(name) {\n return (\n name == \"border-top\" ||\n name == \"border-right\" ||\n name == \"border-bottom\" ||\n name == \"border-left\"\n );\n }\n\n function isStyleBorder(name) {\n return (\n name == \"border-color\" ||\n name == \"border-style\" ||\n name == \"border-width\"\n );\n }\n\n function withDifferentVendorPrefix(value1, value2) {\n return (\n vendorPrefixed(value1) &&\n vendorPrefixed(value2) &&\n value1.split(\"-\")[1] != value2.split(\"-\")[2]\n );\n }\n\n function inheritable(name) {\n // According to http://www.w3.org/TR/CSS21/propidx.html\n // Others will be catched by other, preceeding rules\n return (\n name == \"font\" || name == \"line-height\" || name == \"list-style\"\n );\n }\n\n module.exports = {\n canReorder: canReorder,\n canReorderSingle: canReorderSingle\n };\n },\n { \"./rules-overlap\": 51, \"./specificities-overlap\": 52 }\n ],\n 48: [\n function(require, module, exports) {\n var compactable = require(\"./compactable\");\n\n function restoreWithComponents(property) {\n var descriptor = compactable[property.name];\n\n if (descriptor && descriptor.shorthand) {\n return descriptor.restore(property, compactable);\n } else {\n return property.value;\n }\n }\n\n module.exports = restoreWithComponents;\n },\n { \"./compactable\": 21 }\n ],\n 49: [\n function(require, module, exports) {\n var shallowClone = require(\"./clone\").shallow;\n\n var Token = require(\"../../tokenizer/token\");\n var Marker = require(\"../../tokenizer/marker\");\n\n function isInheritOnly(values) {\n for (var i = 0, l = values.length; i < l; i++) {\n var value = values[i][1];\n\n if (\n value != \"inherit\" &&\n value != Marker.COMMA &&\n value != Marker.FORWARD_SLASH\n )\n return false;\n }\n\n return true;\n }\n\n function background(property, compactable, lastInMultiplex) {\n var components = property.components;\n var restored = [];\n var needsOne, needsBoth;\n\n function restoreValue(component) {\n Array.prototype.unshift.apply(restored, component.value);\n }\n\n function isDefaultValue(component) {\n var descriptor = compactable[component.name];\n\n if (\n descriptor.doubleValues &&\n descriptor.defaultValue.length == 1\n ) {\n return (\n component.value[0][1] == descriptor.defaultValue[0] &&\n (component.value[1]\n ? component.value[1][1] == descriptor.defaultValue[0]\n : true)\n );\n } else if (\n descriptor.doubleValues &&\n descriptor.defaultValue.length != 1\n ) {\n return (\n component.value[0][1] == descriptor.defaultValue[0] &&\n (component.value[1]\n ? component.value[1][1]\n : component.value[0][1]) == descriptor.defaultValue[1]\n );\n } else {\n return component.value[0][1] == descriptor.defaultValue;\n }\n }\n\n for (var i = components.length - 1; i >= 0; i--) {\n var component = components[i];\n var isDefault = isDefaultValue(component);\n\n if (component.name == \"background-clip\") {\n var originComponent = components[i - 1];\n var isOriginDefault = isDefaultValue(originComponent);\n\n needsOne = component.value[0][1] == originComponent.value[0][1];\n\n needsBoth =\n !needsOne &&\n ((isOriginDefault && !isDefault) ||\n (!isOriginDefault && !isDefault) ||\n (!isOriginDefault &&\n isDefault &&\n component.value[0][1] != originComponent.value[0][1]));\n\n if (needsOne) {\n restoreValue(originComponent);\n } else if (needsBoth) {\n restoreValue(component);\n restoreValue(originComponent);\n }\n\n i--;\n } else if (component.name == \"background-size\") {\n var positionComponent = components[i - 1];\n var isPositionDefault = isDefaultValue(positionComponent);\n\n needsOne = !isPositionDefault && isDefault;\n\n needsBoth =\n !needsOne &&\n ((isPositionDefault && !isDefault) ||\n (!isPositionDefault && !isDefault));\n\n if (needsOne) {\n restoreValue(positionComponent);\n } else if (needsBoth) {\n restoreValue(component);\n restored.unshift([Token.PROPERTY_VALUE, Marker.FORWARD_SLASH]);\n restoreValue(positionComponent);\n } else if (positionComponent.value.length == 1) {\n restoreValue(positionComponent);\n }\n\n i--;\n } else {\n if (\n isDefault ||\n (compactable[component.name].multiplexLastOnly &&\n !lastInMultiplex)\n )\n continue;\n\n restoreValue(component);\n }\n }\n\n if (\n restored.length === 0 &&\n property.value.length == 1 &&\n property.value[0][1] == \"0\"\n )\n restored.push(property.value[0]);\n\n if (restored.length === 0)\n restored.push([\n Token.PROPERTY_VALUE,\n compactable[property.name].defaultValue\n ]);\n\n if (isInheritOnly(restored)) return [restored[0]];\n\n return restored;\n }\n\n function borderRadius(property, compactable) {\n if (property.multiplex) {\n var horizontal = shallowClone(property);\n var vertical = shallowClone(property);\n\n for (var i = 0; i < 4; i++) {\n var component = property.components[i];\n\n var horizontalComponent = shallowClone(property);\n horizontalComponent.value = [component.value[0]];\n horizontal.components.push(horizontalComponent);\n\n var verticalComponent = shallowClone(property);\n // FIXME: only shorthand compactor (see breakup#borderRadius) knows that border radius\n // longhands have two values, whereas tokenizer does not care about populating 2nd value\n // if it's missing, hence this fallback\n verticalComponent.value = [\n component.value[1] || component.value[0]\n ];\n vertical.components.push(verticalComponent);\n }\n\n var horizontalValues = fourValues(horizontal, compactable);\n var verticalValues = fourValues(vertical, compactable);\n\n if (\n horizontalValues.length == verticalValues.length &&\n horizontalValues[0][1] == verticalValues[0][1] &&\n (horizontalValues.length > 1\n ? horizontalValues[1][1] == verticalValues[1][1]\n : true) &&\n (horizontalValues.length > 2\n ? horizontalValues[2][1] == verticalValues[2][1]\n : true) &&\n (horizontalValues.length > 3\n ? horizontalValues[3][1] == verticalValues[3][1]\n : true)\n ) {\n return horizontalValues;\n } else {\n return horizontalValues\n .concat([[Token.PROPERTY_VALUE, Marker.FORWARD_SLASH]])\n .concat(verticalValues);\n }\n } else {\n return fourValues(property, compactable);\n }\n }\n\n function font(property, compactable) {\n var components = property.components;\n var restored = [];\n var component;\n var componentIndex = 0;\n var fontFamilyIndex = 0;\n\n if (property.value[0][1].indexOf(Marker.INTERNAL) === 0) {\n property.value[0][1] = property.value[0][1].substring(\n Marker.INTERNAL.length\n );\n return property.value;\n }\n\n // first four components are optional\n while (componentIndex < 4) {\n component = components[componentIndex];\n\n if (\n component.value[0][1] != compactable[component.name].defaultValue\n ) {\n Array.prototype.push.apply(restored, component.value);\n }\n\n componentIndex++;\n }\n\n // then comes font-size\n Array.prototype.push.apply(\n restored,\n components[componentIndex].value\n );\n componentIndex++;\n\n // then may come line-height\n if (\n components[componentIndex].value[0][1] !=\n compactable[components[componentIndex].name].defaultValue\n ) {\n Array.prototype.push.apply(restored, [\n [Token.PROPERTY_VALUE, Marker.FORWARD_SLASH]\n ]);\n Array.prototype.push.apply(\n restored,\n components[componentIndex].value\n );\n }\n\n componentIndex++;\n\n // then comes font-family\n while (components[componentIndex].value[fontFamilyIndex]) {\n restored.push(components[componentIndex].value[fontFamilyIndex]);\n\n if (components[componentIndex].value[fontFamilyIndex + 1]) {\n restored.push([Token.PROPERTY_VALUE, Marker.COMMA]);\n }\n\n fontFamilyIndex++;\n }\n\n if (isInheritOnly(restored)) {\n return [restored[0]];\n }\n\n return restored;\n }\n\n function fourValues(property) {\n var components = property.components;\n var value1 = components[0].value[0];\n var value2 = components[1].value[0];\n var value3 = components[2].value[0];\n var value4 = components[3].value[0];\n\n if (\n value1[1] == value2[1] &&\n value1[1] == value3[1] &&\n value1[1] == value4[1]\n ) {\n return [value1];\n } else if (value1[1] == value3[1] && value2[1] == value4[1]) {\n return [value1, value2];\n } else if (value2[1] == value4[1]) {\n return [value1, value2, value3];\n } else {\n return [value1, value2, value3, value4];\n }\n }\n\n function multiplex(restoreWith) {\n return function(property, compactable) {\n if (!property.multiplex)\n return restoreWith(property, compactable, true);\n\n var multiplexSize = 0;\n var restored = [];\n var componentMultiplexSoFar = {};\n var i, l;\n\n // At this point we don't know what's the multiplex size, e.g. how many background layers are there\n for (i = 0, l = property.components[0].value.length; i < l; i++) {\n if (property.components[0].value[i][1] == Marker.COMMA)\n multiplexSize++;\n }\n\n for (i = 0; i <= multiplexSize; i++) {\n var _property = shallowClone(property);\n\n // We split multiplex into parts and restore them one by one\n for (var j = 0, m = property.components.length; j < m; j++) {\n var componentToClone = property.components[j];\n var _component = shallowClone(componentToClone);\n _property.components.push(_component);\n\n // The trick is some properties has more than one value, so we iterate over values looking for\n // a multiplex separator - a comma\n for (\n var k = componentMultiplexSoFar[_component.name] || 0,\n n = componentToClone.value.length;\n k < n;\n k++\n ) {\n if (componentToClone.value[k][1] == Marker.COMMA) {\n componentMultiplexSoFar[_component.name] = k + 1;\n break;\n }\n\n _component.value.push(componentToClone.value[k]);\n }\n }\n\n // No we can restore shorthand value\n var lastInMultiplex = i == multiplexSize;\n var _restored = restoreWith(\n _property,\n compactable,\n lastInMultiplex\n );\n Array.prototype.push.apply(restored, _restored);\n\n if (i < multiplexSize)\n restored.push([Token.PROPERTY_VALUE, Marker.COMMA]);\n }\n\n return restored;\n };\n }\n\n function withoutDefaults(property, compactable) {\n var components = property.components;\n var restored = [];\n\n for (var i = components.length - 1; i >= 0; i--) {\n var component = components[i];\n var descriptor = compactable[component.name];\n\n if (\n component.value[0][1] != descriptor.defaultValue ||\n (\"keepUnlessDefault\" in descriptor &&\n !isDefault(\n components,\n compactable,\n descriptor.keepUnlessDefault\n ))\n ) {\n restored.unshift(component.value[0]);\n }\n }\n\n if (restored.length === 0)\n restored.push([\n Token.PROPERTY_VALUE,\n compactable[property.name].defaultValue\n ]);\n\n if (isInheritOnly(restored)) return [restored[0]];\n\n return restored;\n }\n\n function isDefault(components, compactable, propertyName) {\n var component;\n var i, l;\n\n for (i = 0, l = components.length; i < l; i++) {\n component = components[i];\n\n if (\n component.name == propertyName &&\n component.value[0][1] == compactable[propertyName].defaultValue\n ) {\n return true;\n }\n }\n\n return false;\n }\n\n module.exports = {\n background: background,\n borderRadius: borderRadius,\n font: font,\n fourValues: fourValues,\n multiplex: multiplex,\n withoutDefaults: withoutDefaults\n };\n },\n {\n \"../../tokenizer/marker\": 83,\n \"../../tokenizer/token\": 84,\n \"./clone\": 20\n }\n ],\n 50: [\n function(require, module, exports) {\n var canReorderSingle = require(\"./reorderable\").canReorderSingle;\n var extractProperties = require(\"./extract-properties\");\n var isMergeable = require(\"./is-mergeable\");\n var tidyRuleDuplicates = require(\"./tidy-rule-duplicates\");\n\n var Token = require(\"../../tokenizer/token\");\n\n var cloneArray = require(\"../../utils/clone-array\");\n\n var serializeBody = require(\"../../writer/one-time\").body;\n var serializeRules = require(\"../../writer/one-time\").rules;\n\n function naturalSorter(a, b) {\n return a > b ? 1 : -1;\n }\n\n function cloneAndMergeSelectors(propertyA, propertyB) {\n var cloned = cloneArray(propertyA);\n cloned[5] = cloned[5].concat(propertyB[5]);\n\n return cloned;\n }\n\n function restructure(tokens, context) {\n var options = context.options;\n var mergeablePseudoClasses =\n options.compatibility.selectors.mergeablePseudoClasses;\n var mergeablePseudoElements =\n options.compatibility.selectors.mergeablePseudoElements;\n var mergeLimit = options.compatibility.selectors.mergeLimit;\n var multiplePseudoMerging =\n options.compatibility.selectors.multiplePseudoMerging;\n var specificityCache = context.cache.specificity;\n var movableTokens = {};\n var movedProperties = [];\n var multiPropertyMoveCache = {};\n var movedToBeDropped = [];\n var maxCombinationsLevel = 2;\n var ID_JOIN_CHARACTER = \"%\";\n\n function sendToMultiPropertyMoveCache(\n position,\n movedProperty,\n allFits\n ) {\n for (var i = allFits.length - 1; i >= 0; i--) {\n var fit = allFits[i][0];\n var id = addToCache(movedProperty, fit);\n\n if (\n multiPropertyMoveCache[id].length > 1 &&\n processMultiPropertyMove(position, multiPropertyMoveCache[id])\n ) {\n removeAllMatchingFromCache(id);\n break;\n }\n }\n }\n\n function addToCache(movedProperty, fit) {\n var id = cacheId(fit);\n multiPropertyMoveCache[id] = multiPropertyMoveCache[id] || [];\n multiPropertyMoveCache[id].push([movedProperty, fit]);\n return id;\n }\n\n function removeAllMatchingFromCache(matchId) {\n var matchSelectors = matchId.split(ID_JOIN_CHARACTER);\n var forRemoval = [];\n var i;\n\n for (var id in multiPropertyMoveCache) {\n var selectors = id.split(ID_JOIN_CHARACTER);\n for (i = selectors.length - 1; i >= 0; i--) {\n if (matchSelectors.indexOf(selectors[i]) > -1) {\n forRemoval.push(id);\n break;\n }\n }\n }\n\n for (i = forRemoval.length - 1; i >= 0; i--) {\n delete multiPropertyMoveCache[forRemoval[i]];\n }\n }\n\n function cacheId(cachedTokens) {\n var id = [];\n for (var i = 0, l = cachedTokens.length; i < l; i++) {\n id.push(serializeRules(cachedTokens[i][1]));\n }\n return id.join(ID_JOIN_CHARACTER);\n }\n\n function tokensToMerge(sourceTokens) {\n var uniqueTokensWithBody = [];\n var mergeableTokens = [];\n\n for (var i = sourceTokens.length - 1; i >= 0; i--) {\n if (\n !isMergeable(\n serializeRules(sourceTokens[i][1]),\n mergeablePseudoClasses,\n mergeablePseudoElements,\n multiplePseudoMerging\n )\n ) {\n continue;\n }\n\n mergeableTokens.unshift(sourceTokens[i]);\n if (\n sourceTokens[i][2].length > 0 &&\n uniqueTokensWithBody.indexOf(sourceTokens[i]) == -1\n )\n uniqueTokensWithBody.push(sourceTokens[i]);\n }\n\n return uniqueTokensWithBody.length > 1 ? mergeableTokens : [];\n }\n\n function shortenIfPossible(position, movedProperty) {\n var name = movedProperty[0];\n var value = movedProperty[1];\n var key = movedProperty[4];\n var valueSize = name.length + value.length + 1;\n var allSelectors = [];\n var qualifiedTokens = [];\n\n var mergeableTokens = tokensToMerge(movableTokens[key]);\n if (mergeableTokens.length < 2) return;\n\n var allFits = findAllFits(mergeableTokens, valueSize, 1);\n var bestFit = allFits[0];\n if (bestFit[1] > 0)\n return sendToMultiPropertyMoveCache(\n position,\n movedProperty,\n allFits\n );\n\n for (var i = bestFit[0].length - 1; i >= 0; i--) {\n allSelectors = bestFit[0][i][1].concat(allSelectors);\n qualifiedTokens.unshift(bestFit[0][i]);\n }\n\n allSelectors = tidyRuleDuplicates(allSelectors);\n dropAsNewTokenAt(\n position,\n [movedProperty],\n allSelectors,\n qualifiedTokens\n );\n }\n\n function fitSorter(fit1, fit2) {\n return fit1[1] > fit2[1] ? 1 : fit1[1] == fit2[1] ? 0 : -1;\n }\n\n function findAllFits(mergeableTokens, propertySize, propertiesCount) {\n var combinations = allCombinations(\n mergeableTokens,\n propertySize,\n propertiesCount,\n maxCombinationsLevel - 1\n );\n return combinations.sort(fitSorter);\n }\n\n function allCombinations(\n tokensVariant,\n propertySize,\n propertiesCount,\n level\n ) {\n var differenceVariants = [\n [\n tokensVariant,\n sizeDifference(tokensVariant, propertySize, propertiesCount)\n ]\n ];\n if (tokensVariant.length > 2 && level > 0) {\n for (var i = tokensVariant.length - 1; i >= 0; i--) {\n var subVariant = Array.prototype.slice.call(tokensVariant, 0);\n subVariant.splice(i, 1);\n differenceVariants = differenceVariants.concat(\n allCombinations(\n subVariant,\n propertySize,\n propertiesCount,\n level - 1\n )\n );\n }\n }\n\n return differenceVariants;\n }\n\n function sizeDifference(\n tokensVariant,\n propertySize,\n propertiesCount\n ) {\n var allSelectorsSize = 0;\n for (var i = tokensVariant.length - 1; i >= 0; i--) {\n allSelectorsSize +=\n tokensVariant[i][2].length > propertiesCount\n ? serializeRules(tokensVariant[i][1]).length\n : -1;\n }\n return (\n allSelectorsSize - (tokensVariant.length - 1) * propertySize + 1\n );\n }\n\n function dropAsNewTokenAt(\n position,\n properties,\n allSelectors,\n mergeableTokens\n ) {\n var i, j, k, m;\n var allProperties = [];\n\n for (i = mergeableTokens.length - 1; i >= 0; i--) {\n var mergeableToken = mergeableTokens[i];\n\n for (j = mergeableToken[2].length - 1; j >= 0; j--) {\n var mergeableProperty = mergeableToken[2][j];\n\n for (k = 0, m = properties.length; k < m; k++) {\n var property = properties[k];\n\n var mergeablePropertyName = mergeableProperty[1][1];\n var propertyName = property[0];\n var propertyBody = property[4];\n if (\n mergeablePropertyName == propertyName &&\n serializeBody([mergeableProperty]) == propertyBody\n ) {\n mergeableToken[2].splice(j, 1);\n break;\n }\n }\n }\n }\n\n for (i = properties.length - 1; i >= 0; i--) {\n allProperties.unshift(properties[i][3]);\n }\n\n var newToken = [Token.RULE, allSelectors, allProperties];\n tokens.splice(position, 0, newToken);\n }\n\n function dropPropertiesAt(position, movedProperty) {\n var key = movedProperty[4];\n var toMove = movableTokens[key];\n\n if (toMove && toMove.length > 1) {\n if (!shortenMultiMovesIfPossible(position, movedProperty))\n shortenIfPossible(position, movedProperty);\n }\n }\n\n function shortenMultiMovesIfPossible(position, movedProperty) {\n var candidates = [];\n var propertiesAndMergableTokens = [];\n var key = movedProperty[4];\n var j, k;\n\n var mergeableTokens = tokensToMerge(movableTokens[key]);\n if (mergeableTokens.length < 2) return;\n\n movableLoop: for (var value in movableTokens) {\n var tokensList = movableTokens[value];\n\n for (j = mergeableTokens.length - 1; j >= 0; j--) {\n if (tokensList.indexOf(mergeableTokens[j]) == -1)\n continue movableLoop;\n }\n\n candidates.push(value);\n }\n\n if (candidates.length < 2) return false;\n\n for (j = candidates.length - 1; j >= 0; j--) {\n for (k = movedProperties.length - 1; k >= 0; k--) {\n if (movedProperties[k][4] == candidates[j]) {\n propertiesAndMergableTokens.unshift([\n movedProperties[k],\n mergeableTokens\n ]);\n break;\n }\n }\n }\n\n return processMultiPropertyMove(\n position,\n propertiesAndMergableTokens\n );\n }\n\n function processMultiPropertyMove(\n position,\n propertiesAndMergableTokens\n ) {\n var valueSize = 0;\n var properties = [];\n var property;\n\n for (var i = propertiesAndMergableTokens.length - 1; i >= 0; i--) {\n property = propertiesAndMergableTokens[i][0];\n var fullValue = property[4];\n valueSize += fullValue.length + (i > 0 ? 1 : 0);\n\n properties.push(property);\n }\n\n var mergeableTokens = propertiesAndMergableTokens[0][1];\n var bestFit = findAllFits(\n mergeableTokens,\n valueSize,\n properties.length\n )[0];\n if (bestFit[1] > 0) return false;\n\n var allSelectors = [];\n var qualifiedTokens = [];\n for (i = bestFit[0].length - 1; i >= 0; i--) {\n allSelectors = bestFit[0][i][1].concat(allSelectors);\n qualifiedTokens.unshift(bestFit[0][i]);\n }\n\n allSelectors = tidyRuleDuplicates(allSelectors);\n dropAsNewTokenAt(\n position,\n properties,\n allSelectors,\n qualifiedTokens\n );\n\n for (i = properties.length - 1; i >= 0; i--) {\n property = properties[i];\n var index = movedProperties.indexOf(property);\n\n delete movableTokens[property[4]];\n\n if (index > -1 && movedToBeDropped.indexOf(index) == -1)\n movedToBeDropped.push(index);\n }\n\n return true;\n }\n\n function boundToAnotherPropertyInCurrrentToken(\n property,\n movedProperty,\n token\n ) {\n var propertyName = property[0];\n var movedPropertyName = movedProperty[0];\n if (propertyName != movedPropertyName) return false;\n\n var key = movedProperty[4];\n var toMove = movableTokens[key];\n return toMove && toMove.indexOf(token) > -1;\n }\n\n for (var i = tokens.length - 1; i >= 0; i--) {\n var token = tokens[i];\n var isRule;\n var j, k, m;\n var samePropertyAt;\n\n if (token[0] == Token.RULE) {\n isRule = true;\n } else if (token[0] == Token.NESTED_BLOCK) {\n isRule = false;\n } else {\n continue;\n }\n\n // We cache movedProperties.length as it may change in the loop\n var movedCount = movedProperties.length;\n\n var properties = extractProperties(token);\n movedToBeDropped = [];\n\n var unmovableInCurrentToken = [];\n for (j = properties.length - 1; j >= 0; j--) {\n for (k = j - 1; k >= 0; k--) {\n if (\n !canReorderSingle(\n properties[j],\n properties[k],\n specificityCache\n )\n ) {\n unmovableInCurrentToken.push(j);\n break;\n }\n }\n }\n\n for (j = properties.length - 1; j >= 0; j--) {\n var property = properties[j];\n var movedSameProperty = false;\n\n for (k = 0; k < movedCount; k++) {\n var movedProperty = movedProperties[k];\n\n if (\n movedToBeDropped.indexOf(k) == -1 &&\n ((!canReorderSingle(\n property,\n movedProperty,\n specificityCache\n ) &&\n !boundToAnotherPropertyInCurrrentToken(\n property,\n movedProperty,\n token\n )) ||\n (movableTokens[movedProperty[4]] &&\n movableTokens[movedProperty[4]].length === mergeLimit))\n ) {\n dropPropertiesAt(i + 1, movedProperty, token);\n\n if (movedToBeDropped.indexOf(k) == -1) {\n movedToBeDropped.push(k);\n delete movableTokens[movedProperty[4]];\n }\n }\n\n if (!movedSameProperty) {\n movedSameProperty =\n property[0] == movedProperty[0] &&\n property[1] == movedProperty[1];\n\n if (movedSameProperty) {\n samePropertyAt = k;\n }\n }\n }\n\n if (!isRule || unmovableInCurrentToken.indexOf(j) > -1) continue;\n\n var key = property[4];\n\n if (\n movedSameProperty &&\n movedProperties[samePropertyAt][5].length + property[5].length >\n mergeLimit\n ) {\n dropPropertiesAt(i + 1, movedProperties[samePropertyAt]);\n movedProperties.splice(samePropertyAt, 1);\n movableTokens[key] = [token];\n movedSameProperty = false;\n } else {\n movableTokens[key] = movableTokens[key] || [];\n movableTokens[key].push(token);\n }\n\n if (movedSameProperty) {\n movedProperties[samePropertyAt] = cloneAndMergeSelectors(\n movedProperties[samePropertyAt],\n property\n );\n } else {\n movedProperties.push(property);\n }\n }\n\n movedToBeDropped = movedToBeDropped.sort(naturalSorter);\n for (j = 0, m = movedToBeDropped.length; j < m; j++) {\n var dropAt = movedToBeDropped[j] - j;\n movedProperties.splice(dropAt, 1);\n }\n }\n\n var position =\n tokens[0] &&\n tokens[0][0] == Token.AT_RULE &&\n tokens[0][1].indexOf(\"@charset\") === 0\n ? 1\n : 0;\n for (; position < tokens.length - 1; position++) {\n var isImportRule =\n tokens[position][0] === Token.AT_RULE &&\n tokens[position][1].indexOf(\"@import\") === 0;\n var isComment = tokens[position][0] === Token.COMMENT;\n if (!(isImportRule || isComment)) break;\n }\n\n for (i = 0; i < movedProperties.length; i++) {\n dropPropertiesAt(position, movedProperties[i]);\n }\n }\n\n module.exports = restructure;\n },\n {\n \"../../tokenizer/token\": 84,\n \"../../utils/clone-array\": 86,\n \"../../writer/one-time\": 98,\n \"./extract-properties\": 22,\n \"./is-mergeable\": 24,\n \"./reorderable\": 47,\n \"./tidy-rule-duplicates\": 54\n }\n ],\n 51: [\n function(require, module, exports) {\n var MODIFIER_PATTERN = /\\-\\-.+$/;\n\n function rulesOverlap(rule1, rule2, bemMode) {\n var scope1;\n var scope2;\n var i, l;\n var j, m;\n\n for (i = 0, l = rule1.length; i < l; i++) {\n scope1 = rule1[i][1];\n\n for (j = 0, m = rule2.length; j < m; j++) {\n scope2 = rule2[j][1];\n\n if (scope1 == scope2) {\n return true;\n }\n\n if (\n bemMode &&\n withoutModifiers(scope1) == withoutModifiers(scope2)\n ) {\n return true;\n }\n }\n }\n\n return false;\n }\n\n function withoutModifiers(scope) {\n return scope.replace(MODIFIER_PATTERN, \"\");\n }\n\n module.exports = rulesOverlap;\n },\n {}\n ],\n 52: [\n function(require, module, exports) {\n var specificity = require(\"./specificity\");\n\n function specificitiesOverlap(selector1, selector2, cache) {\n var specificity1;\n var specificity2;\n var i, l;\n var j, m;\n\n for (i = 0, l = selector1.length; i < l; i++) {\n specificity1 = findSpecificity(selector1[i][1], cache);\n\n for (j = 0, m = selector2.length; j < m; j++) {\n specificity2 = findSpecificity(selector2[j][1], cache);\n\n if (\n specificity1[0] === specificity2[0] &&\n specificity1[1] === specificity2[1] &&\n specificity1[2] === specificity2[2]\n ) {\n return true;\n }\n }\n }\n\n return false;\n }\n\n function findSpecificity(selector, cache) {\n var value;\n\n if (!(selector in cache)) {\n cache[selector] = value = specificity(selector);\n }\n\n return value || cache[selector];\n }\n\n module.exports = specificitiesOverlap;\n },\n { \"./specificity\": 53 }\n ],\n 53: [\n function(require, module, exports) {\n var Marker = require(\"../../tokenizer/marker\");\n\n var Selector = {\n ADJACENT_SIBLING: \"+\",\n DESCENDANT: \">\",\n DOT: \".\",\n HASH: \"#\",\n NON_ADJACENT_SIBLING: \"~\",\n PSEUDO: \":\"\n };\n\n var LETTER_PATTERN = /[a-zA-Z]/;\n var NOT_PREFIX = \":not(\";\n var SEPARATOR_PATTERN = /[\\s,\\(>~\\+]/;\n\n function specificity(selector) {\n var result = [0, 0, 0];\n var character;\n var isEscaped;\n var isSingleQuoted;\n var isDoubleQuoted;\n var roundBracketLevel = 0;\n var couldIntroduceNewTypeSelector;\n var withinNotPseudoClass = false;\n var wasPseudoClass = false;\n var i, l;\n\n for (i = 0, l = selector.length; i < l; i++) {\n character = selector[i];\n\n if (isEscaped) {\n // noop\n } else if (\n character == Marker.SINGLE_QUOTE &&\n !isDoubleQuoted &&\n !isSingleQuoted\n ) {\n isSingleQuoted = true;\n } else if (\n character == Marker.SINGLE_QUOTE &&\n !isDoubleQuoted &&\n isSingleQuoted\n ) {\n isSingleQuoted = false;\n } else if (\n character == Marker.DOUBLE_QUOTE &&\n !isDoubleQuoted &&\n !isSingleQuoted\n ) {\n isDoubleQuoted = true;\n } else if (\n character == Marker.DOUBLE_QUOTE &&\n isDoubleQuoted &&\n !isSingleQuoted\n ) {\n isDoubleQuoted = false;\n } else if (isSingleQuoted || isDoubleQuoted) {\n continue;\n } else if (roundBracketLevel > 0 && !withinNotPseudoClass) {\n // noop\n } else if (character == Marker.OPEN_ROUND_BRACKET) {\n roundBracketLevel++;\n } else if (\n character == Marker.CLOSE_ROUND_BRACKET &&\n roundBracketLevel == 1\n ) {\n roundBracketLevel--;\n withinNotPseudoClass = false;\n } else if (character == Marker.CLOSE_ROUND_BRACKET) {\n roundBracketLevel--;\n } else if (character == Selector.HASH) {\n result[0]++;\n } else if (\n character == Selector.DOT ||\n character == Marker.OPEN_SQUARE_BRACKET\n ) {\n result[1]++;\n } else if (\n character == Selector.PSEUDO &&\n !wasPseudoClass &&\n !isNotPseudoClass(selector, i)\n ) {\n result[1]++;\n withinNotPseudoClass = false;\n } else if (character == Selector.PSEUDO) {\n withinNotPseudoClass = true;\n } else if (\n (i === 0 || couldIntroduceNewTypeSelector) &&\n LETTER_PATTERN.test(character)\n ) {\n result[2]++;\n }\n\n isEscaped = character == Marker.BACK_SLASH;\n wasPseudoClass = character == Selector.PSEUDO;\n couldIntroduceNewTypeSelector =\n !isEscaped && SEPARATOR_PATTERN.test(character);\n }\n\n return result;\n }\n\n function isNotPseudoClass(selector, index) {\n return selector.indexOf(NOT_PREFIX, index) === index;\n }\n\n module.exports = specificity;\n },\n { \"../../tokenizer/marker\": 83 }\n ],\n 54: [\n function(require, module, exports) {\n function ruleSorter(s1, s2) {\n return s1[1] > s2[1] ? 1 : -1;\n }\n\n function tidyRuleDuplicates(rules) {\n var list = [];\n var repeated = [];\n\n for (var i = 0, l = rules.length; i < l; i++) {\n var rule = rules[i];\n\n if (repeated.indexOf(rule[1]) == -1) {\n repeated.push(rule[1]);\n list.push(rule);\n }\n }\n\n return list.sort(ruleSorter);\n }\n\n module.exports = tidyRuleDuplicates;\n },\n {}\n ],\n 55: [\n function(require, module, exports) {\n function removeUnused(properties) {\n for (var i = properties.length - 1; i >= 0; i--) {\n var property = properties[i];\n\n if (property.unused) {\n property.all.splice(property.position, 1);\n }\n }\n }\n\n module.exports = removeUnused;\n },\n {}\n ],\n 56: [\n function(require, module, exports) {\n var Hack = require(\"./hack\");\n\n var Marker = require(\"../tokenizer/marker\");\n\n var ASTERISK_HACK = \"*\";\n var BACKSLASH_HACK = \"\\\\\";\n var IMPORTANT_TOKEN = \"!important\";\n var UNDERSCORE_HACK = \"_\";\n var BANG_HACK = \"!ie\";\n\n function restoreFromOptimizing(properties, restoreCallback) {\n var property;\n var restored;\n var current;\n var i;\n\n for (i = properties.length - 1; i >= 0; i--) {\n property = properties[i];\n\n if (property.unused) {\n continue;\n }\n\n if (!property.dirty && !property.important && !property.hack) {\n continue;\n }\n\n if (restoreCallback) {\n restored = restoreCallback(property);\n property.value = restored;\n } else {\n restored = property.value;\n }\n\n if (property.important) {\n restoreImportant(property);\n }\n\n if (property.hack) {\n restoreHack(property);\n }\n\n if (\"all\" in property) {\n current = property.all[property.position];\n current[1][1] = property.name;\n\n current.splice(2, current.length - 1);\n Array.prototype.push.apply(current, restored);\n }\n }\n }\n\n function restoreImportant(property) {\n property.value[property.value.length - 1][1] += IMPORTANT_TOKEN;\n }\n\n function restoreHack(property) {\n if (property.hack[0] == Hack.UNDERSCORE) {\n property.name = UNDERSCORE_HACK + property.name;\n } else if (property.hack[0] == Hack.ASTERISK) {\n property.name = ASTERISK_HACK + property.name;\n } else if (property.hack[0] == Hack.BACKSLASH) {\n property.value[property.value.length - 1][1] +=\n BACKSLASH_HACK + property.hack[1];\n } else if (property.hack[0] == Hack.BANG) {\n property.value[property.value.length - 1][1] +=\n Marker.SPACE + BANG_HACK;\n }\n }\n\n module.exports = restoreFromOptimizing;\n },\n { \"../tokenizer/marker\": 83, \"./hack\": 8 }\n ],\n 57: [\n function(require, module, exports) {\n var functionNoVendorRegexStr = \"[A-Z]+(\\\\-|[A-Z]|[0-9])+\\\\(.*?\\\\)\";\n var functionVendorRegexStr = \"\\\\-(\\\\-|[A-Z]|[0-9])+\\\\(.*?\\\\)\";\n var variableRegexStr = \"var\\\\(\\\\-\\\\-[^\\\\)]+\\\\)\";\n var functionAnyRegexStr =\n \"(\" +\n variableRegexStr +\n \"|\" +\n functionNoVendorRegexStr +\n \"|\" +\n functionVendorRegexStr +\n \")\";\n\n var calcRegex = new RegExp(\n \"^(\\\\-moz\\\\-|\\\\-webkit\\\\-)?calc\\\\([^\\\\)]+\\\\)$\",\n \"i\"\n );\n var decimalRegex = /[0-9]/;\n var functionAnyRegex = new RegExp(\"^\" + functionAnyRegexStr + \"$\", \"i\");\n var hslColorRegex = /^hsl\\(\\s{0,31}[\\-\\.]?\\d+\\s{0,31},\\s{0,31}\\.?\\d+%\\s{0,31},\\s{0,31}\\.?\\d+%\\s{0,31}\\)|hsla\\(\\s{0,31}[\\-\\.]?\\d+\\s{0,31},\\s{0,31}\\.?\\d+%\\s{0,31},\\s{0,31}\\.?\\d+%\\s{0,31},\\s{0,31}\\.?\\d+\\s{0,31}\\)$/;\n var identifierRegex = /^(\\-[a-z0-9_][a-z0-9\\-_]*|[a-z][a-z0-9\\-_]*)$/i;\n var namedEntityRegex = /^[a-z]+$/i;\n var prefixRegex = /^-([a-z0-9]|-)*$/i;\n var rgbColorRegex = /^rgb\\(\\s{0,31}[\\d]{1,3}\\s{0,31},\\s{0,31}[\\d]{1,3}\\s{0,31},\\s{0,31}[\\d]{1,3}\\s{0,31}\\)|rgba\\(\\s{0,31}[\\d]{1,3}\\s{0,31},\\s{0,31}[\\d]{1,3}\\s{0,31},\\s{0,31}[\\d]{1,3}\\s{0,31},\\s{0,31}[\\.\\d]+\\s{0,31}\\)$/;\n var timingFunctionRegex = /^(cubic\\-bezier|steps)\\([^\\)]+\\)$/;\n var validTimeUnits = [\"ms\", \"s\"];\n var urlRegex = /^url\\([\\s\\S]+\\)$/i;\n var variableRegex = new RegExp(\"^\" + variableRegexStr + \"$\", \"i\");\n\n var eightValueColorRegex = /^#[0-9a-f]{8}$/i;\n var fourValueColorRegex = /^#[0-9a-f]{4}$/i;\n var sixValueColorRegex = /^#[0-9a-f]{6}$/i;\n var threeValueColorRegex = /^#[0-9a-f]{3}$/i;\n\n var DECIMAL_DOT = \".\";\n var MINUS_SIGN = \"-\";\n var PLUS_SIGN = \"+\";\n\n var Keywords = {\n \"^\": [\"inherit\", \"initial\", \"unset\"],\n \"*-style\": [\n \"auto\",\n \"dashed\",\n \"dotted\",\n \"double\",\n \"groove\",\n \"hidden\",\n \"inset\",\n \"none\",\n \"outset\",\n \"ridge\",\n \"solid\"\n ],\n \"*-timing-function\": [\n \"ease\",\n \"ease-in\",\n \"ease-in-out\",\n \"ease-out\",\n \"linear\",\n \"step-end\",\n \"step-start\"\n ],\n \"animation-direction\": [\n \"alternate\",\n \"alternate-reverse\",\n \"normal\",\n \"reverse\"\n ],\n \"animation-fill-mode\": [\"backwards\", \"both\", \"forwards\", \"none\"],\n \"animation-iteration-count\": [\"infinite\"],\n \"animation-name\": [\"none\"],\n \"animation-play-state\": [\"paused\", \"running\"],\n \"background-attachment\": [\"fixed\", \"inherit\", \"local\", \"scroll\"],\n \"background-clip\": [\n \"border-box\",\n \"content-box\",\n \"inherit\",\n \"padding-box\",\n \"text\"\n ],\n \"background-origin\": [\n \"border-box\",\n \"content-box\",\n \"inherit\",\n \"padding-box\"\n ],\n \"background-position\": [\"bottom\", \"center\", \"left\", \"right\", \"top\"],\n \"background-repeat\": [\n \"no-repeat\",\n \"inherit\",\n \"repeat\",\n \"repeat-x\",\n \"repeat-y\",\n \"round\",\n \"space\"\n ],\n \"background-size\": [\"auto\", \"cover\", \"contain\"],\n \"border-collapse\": [\"collapse\", \"inherit\", \"separate\"],\n bottom: [\"auto\"],\n clear: [\"both\", \"left\", \"none\", \"right\"],\n color: [\"transparent\"],\n cursor: [\n \"all-scroll\",\n \"auto\",\n \"col-resize\",\n \"crosshair\",\n \"default\",\n \"e-resize\",\n \"help\",\n \"move\",\n \"n-resize\",\n \"ne-resize\",\n \"no-drop\",\n \"not-allowed\",\n \"nw-resize\",\n \"pointer\",\n \"progress\",\n \"row-resize\",\n \"s-resize\",\n \"se-resize\",\n \"sw-resize\",\n \"text\",\n \"vertical-text\",\n \"w-resize\",\n \"wait\"\n ],\n display: [\n \"block\",\n \"inline\",\n \"inline-block\",\n \"inline-table\",\n \"list-item\",\n \"none\",\n \"table\",\n \"table-caption\",\n \"table-cell\",\n \"table-column\",\n \"table-column-group\",\n \"table-footer-group\",\n \"table-header-group\",\n \"table-row\",\n \"table-row-group\"\n ],\n float: [\"left\", \"none\", \"right\"],\n left: [\"auto\"],\n font: [\n \"caption\",\n \"icon\",\n \"menu\",\n \"message-box\",\n \"small-caption\",\n \"status-bar\",\n \"unset\"\n ],\n \"font-size\": [\n \"large\",\n \"larger\",\n \"medium\",\n \"small\",\n \"smaller\",\n \"x-large\",\n \"x-small\",\n \"xx-large\",\n \"xx-small\"\n ],\n \"font-stretch\": [\n \"condensed\",\n \"expanded\",\n \"extra-condensed\",\n \"extra-expanded\",\n \"normal\",\n \"semi-condensed\",\n \"semi-expanded\",\n \"ultra-condensed\",\n \"ultra-expanded\"\n ],\n \"font-style\": [\"italic\", \"normal\", \"oblique\"],\n \"font-variant\": [\"normal\", \"small-caps\"],\n \"font-weight\": [\n \"100\",\n \"200\",\n \"300\",\n \"400\",\n \"500\",\n \"600\",\n \"700\",\n \"800\",\n \"900\",\n \"bold\",\n \"bolder\",\n \"lighter\",\n \"normal\"\n ],\n \"line-height\": [\"normal\"],\n \"list-style-position\": [\"inside\", \"outside\"],\n \"list-style-type\": [\n \"armenian\",\n \"circle\",\n \"decimal\",\n \"decimal-leading-zero\",\n \"disc\",\n \"decimal|disc\", // this is the default value of list-style-type, see comment in compactable.js\n \"georgian\",\n \"lower-alpha\",\n \"lower-greek\",\n \"lower-latin\",\n \"lower-roman\",\n \"none\",\n \"square\",\n \"upper-alpha\",\n \"upper-latin\",\n \"upper-roman\"\n ],\n overflow: [\"auto\", \"hidden\", \"scroll\", \"visible\"],\n position: [\"absolute\", \"fixed\", \"relative\", \"static\"],\n right: [\"auto\"],\n \"text-align\": [\n \"center\",\n \"justify\",\n \"left\",\n \"left|right\", // this is the default value of list-style-type, see comment in compactable.js\n \"right\"\n ],\n \"text-decoration\": [\"line-through\", \"none\", \"overline\", \"underline\"],\n \"text-overflow\": [\"clip\", \"ellipsis\"],\n top: [\"auto\"],\n \"vertical-align\": [\n \"baseline\",\n \"bottom\",\n \"middle\",\n \"sub\",\n \"super\",\n \"text-bottom\",\n \"text-top\",\n \"top\"\n ],\n visibility: [\"collapse\", \"hidden\", \"visible\"],\n \"white-space\": [\"normal\", \"nowrap\", \"pre\"],\n width: [\"inherit\", \"initial\", \"medium\", \"thick\", \"thin\"]\n };\n\n var Units = [\n \"%\",\n \"ch\",\n \"cm\",\n \"em\",\n \"ex\",\n \"in\",\n \"mm\",\n \"pc\",\n \"pt\",\n \"px\",\n \"rem\",\n \"vh\",\n \"vm\",\n \"vmax\",\n \"vmin\",\n \"vw\"\n ];\n\n function isColor(value) {\n return (\n value != \"auto\" &&\n (isKeyword(\"color\")(value) ||\n isHexColor(value) ||\n isColorFunction(value) ||\n isNamedEntity(value))\n );\n }\n\n function isColorFunction(value) {\n return isRgbColor(value) || isHslColor(value);\n }\n\n function isDynamicUnit(value) {\n return calcRegex.test(value);\n }\n\n function isFunction(value) {\n return functionAnyRegex.test(value);\n }\n\n function isHexColor(value) {\n return (\n threeValueColorRegex.test(value) ||\n fourValueColorRegex.test(value) ||\n sixValueColorRegex.test(value) ||\n eightValueColorRegex.test(value)\n );\n }\n\n function isHslColor(value) {\n return hslColorRegex.test(value);\n }\n\n function isIdentifier(value) {\n return identifierRegex.test(value);\n }\n\n function isImage(value) {\n return value == \"none\" || value == \"inherit\" || isUrl(value);\n }\n\n function isKeyword(propertyName) {\n return function(value) {\n return Keywords[propertyName].indexOf(value) > -1;\n };\n }\n\n function isNamedEntity(value) {\n return namedEntityRegex.test(value);\n }\n\n function isNumber(value) {\n return scanForNumber(value) == value.length;\n }\n\n function isRgbColor(value) {\n return rgbColorRegex.test(value);\n }\n\n function isPrefixed(value) {\n return prefixRegex.test(value);\n }\n\n function isPositiveNumber(value) {\n return isNumber(value) && parseFloat(value) >= 0;\n }\n\n function isVariable(value) {\n return variableRegex.test(value);\n }\n\n function isTime(value) {\n var numberUpTo = scanForNumber(value);\n\n return (\n (numberUpTo == value.length && parseInt(value) === 0) ||\n (numberUpTo > -1 &&\n validTimeUnits.indexOf(value.slice(numberUpTo + 1)) > -1)\n );\n }\n\n function isTimingFunction() {\n var isTimingFunctionKeyword = isKeyword(\"*-timing-function\");\n\n return function(value) {\n return (\n isTimingFunctionKeyword(value) || timingFunctionRegex.test(value)\n );\n };\n }\n\n function isUnit(validUnits, value) {\n var numberUpTo = scanForNumber(value);\n\n return (\n (numberUpTo == value.length && parseInt(value) === 0) ||\n (numberUpTo > -1 &&\n validUnits.indexOf(value.slice(numberUpTo + 1)) > -1) ||\n value == \"auto\" ||\n value == \"inherit\"\n );\n }\n\n function isUrl(value) {\n return urlRegex.test(value);\n }\n\n function isZIndex(value) {\n return value == \"auto\" || isNumber(value) || isKeyword(\"^\")(value);\n }\n\n function scanForNumber(value) {\n var hasDot = false;\n var hasSign = false;\n var character;\n var i, l;\n\n for (i = 0, l = value.length; i < l; i++) {\n character = value[i];\n\n if (\n i === 0 &&\n (character == PLUS_SIGN || character == MINUS_SIGN)\n ) {\n hasSign = true;\n } else if (\n i > 0 &&\n hasSign &&\n (character == PLUS_SIGN || character == MINUS_SIGN)\n ) {\n return i - 1;\n } else if (character == DECIMAL_DOT && !hasDot) {\n hasDot = true;\n } else if (character == DECIMAL_DOT && hasDot) {\n return i - 1;\n } else if (decimalRegex.test(character)) {\n continue;\n } else {\n return i - 1;\n }\n }\n\n return i;\n }\n\n function validator(compatibility) {\n var validUnits = Units.slice(0).filter(function(value) {\n return (\n !(value in compatibility.units) ||\n compatibility.units[value] === true\n );\n });\n\n return {\n colorOpacity: compatibility.colors.opacity,\n isAnimationDirectionKeyword: isKeyword(\"animation-direction\"),\n isAnimationFillModeKeyword: isKeyword(\"animation-fill-mode\"),\n isAnimationIterationCountKeyword: isKeyword(\n \"animation-iteration-count\"\n ),\n isAnimationNameKeyword: isKeyword(\"animation-name\"),\n isAnimationPlayStateKeyword: isKeyword(\"animation-play-state\"),\n isTimingFunction: isTimingFunction(),\n isBackgroundAttachmentKeyword: isKeyword(\"background-attachment\"),\n isBackgroundClipKeyword: isKeyword(\"background-clip\"),\n isBackgroundOriginKeyword: isKeyword(\"background-origin\"),\n isBackgroundPositionKeyword: isKeyword(\"background-position\"),\n isBackgroundRepeatKeyword: isKeyword(\"background-repeat\"),\n isBackgroundSizeKeyword: isKeyword(\"background-size\"),\n isColor: isColor,\n isColorFunction: isColorFunction,\n isDynamicUnit: isDynamicUnit,\n isFontKeyword: isKeyword(\"font\"),\n isFontSizeKeyword: isKeyword(\"font-size\"),\n isFontStretchKeyword: isKeyword(\"font-stretch\"),\n isFontStyleKeyword: isKeyword(\"font-style\"),\n isFontVariantKeyword: isKeyword(\"font-variant\"),\n isFontWeightKeyword: isKeyword(\"font-weight\"),\n isFunction: isFunction,\n isGlobal: isKeyword(\"^\"),\n isHslColor: isHslColor,\n isIdentifier: isIdentifier,\n isImage: isImage,\n isKeyword: isKeyword,\n isLineHeightKeyword: isKeyword(\"line-height\"),\n isListStylePositionKeyword: isKeyword(\"list-style-position\"),\n isListStyleTypeKeyword: isKeyword(\"list-style-type\"),\n isNumber: isNumber,\n isPrefixed: isPrefixed,\n isPositiveNumber: isPositiveNumber,\n isRgbColor: isRgbColor,\n isStyleKeyword: isKeyword(\"*-style\"),\n isTime: isTime,\n isUnit: isUnit.bind(null, validUnits),\n isUrl: isUrl,\n isVariable: isVariable,\n isWidth: isKeyword(\"width\"),\n isZIndex: isZIndex\n };\n }\n\n module.exports = validator;\n },\n {}\n ],\n 58: [\n function(require, module, exports) {\n var Hack = require(\"./hack\");\n\n var Marker = require(\"../tokenizer/marker\");\n var Token = require(\"../tokenizer/token\");\n\n var Match = {\n ASTERISK: \"*\",\n BACKSLASH: \"\\\\\",\n BANG: \"!\",\n BANG_SUFFIX_PATTERN: /!\\w+$/,\n IMPORTANT_TOKEN: \"!important\",\n IMPORTANT_TOKEN_PATTERN: new RegExp(\"!important$\", \"i\"),\n IMPORTANT_WORD: \"important\",\n IMPORTANT_WORD_PATTERN: new RegExp(\"important$\", \"i\"),\n SUFFIX_BANG_PATTERN: /!$/,\n UNDERSCORE: \"_\",\n VARIABLE_REFERENCE_PATTERN: /var\\(--.+\\)$/\n };\n\n function wrapAll(properties, includeVariable, skipProperties) {\n var wrapped = [];\n var single;\n var property;\n var i;\n\n for (i = properties.length - 1; i >= 0; i--) {\n property = properties[i];\n\n if (property[0] != Token.PROPERTY) {\n continue;\n }\n\n if (!includeVariable && someVariableReferences(property)) {\n continue;\n }\n\n if (skipProperties && skipProperties.indexOf(property[1][1]) > -1) {\n continue;\n }\n\n single = wrapSingle(property);\n single.all = properties;\n single.position = i;\n wrapped.unshift(single);\n }\n\n return wrapped;\n }\n\n function someVariableReferences(property) {\n var i, l;\n var value;\n\n // skipping `property` and property name tokens\n for (i = 2, l = property.length; i < l; i++) {\n value = property[i];\n\n if (value[0] != Token.PROPERTY_VALUE) {\n continue;\n }\n\n if (isVariableReference(value[1])) {\n return true;\n }\n }\n\n return false;\n }\n\n function isVariableReference(value) {\n return Match.VARIABLE_REFERENCE_PATTERN.test(value);\n }\n\n function isMultiplex(property) {\n var value;\n var i, l;\n\n for (i = 3, l = property.length; i < l; i++) {\n value = property[i];\n\n if (\n value[0] == Token.PROPERTY_VALUE &&\n (value[1] == Marker.COMMA || value[1] == Marker.FORWARD_SLASH)\n ) {\n return true;\n }\n }\n\n return false;\n }\n\n function hackFrom(property) {\n var match = false;\n var name = property[1][1];\n var lastValue = property[property.length - 1];\n\n if (name[0] == Match.UNDERSCORE) {\n match = [Hack.UNDERSCORE];\n } else if (name[0] == Match.ASTERISK) {\n match = [Hack.ASTERISK];\n } else if (\n lastValue[1][0] == Match.BANG &&\n !lastValue[1].match(Match.IMPORTANT_WORD_PATTERN)\n ) {\n match = [Hack.BANG];\n } else if (\n lastValue[1].indexOf(Match.BANG) > 0 &&\n !lastValue[1].match(Match.IMPORTANT_WORD_PATTERN) &&\n Match.BANG_SUFFIX_PATTERN.test(lastValue[1])\n ) {\n match = [Hack.BANG];\n } else if (\n lastValue[1].indexOf(Match.BACKSLASH) > 0 &&\n lastValue[1].indexOf(Match.BACKSLASH) ==\n lastValue[1].length - Match.BACKSLASH.length - 1\n ) {\n match = [\n Hack.BACKSLASH,\n lastValue[1].substring(lastValue[1].indexOf(Match.BACKSLASH) + 1)\n ];\n } else if (\n lastValue[1].indexOf(Match.BACKSLASH) === 0 &&\n lastValue[1].length == 2\n ) {\n match = [Hack.BACKSLASH, lastValue[1].substring(1)];\n }\n\n return match;\n }\n\n function isImportant(property) {\n if (property.length < 3) return false;\n\n var lastValue = property[property.length - 1];\n if (Match.IMPORTANT_TOKEN_PATTERN.test(lastValue[1])) {\n return true;\n } else if (\n Match.IMPORTANT_WORD_PATTERN.test(lastValue[1]) &&\n Match.SUFFIX_BANG_PATTERN.test(property[property.length - 2][1])\n ) {\n return true;\n }\n\n return false;\n }\n\n function stripImportant(property) {\n var lastValue = property[property.length - 1];\n var oneButLastValue = property[property.length - 2];\n\n if (Match.IMPORTANT_TOKEN_PATTERN.test(lastValue[1])) {\n lastValue[1] = lastValue[1].replace(\n Match.IMPORTANT_TOKEN_PATTERN,\n \"\"\n );\n } else {\n lastValue[1] = lastValue[1].replace(\n Match.IMPORTANT_WORD_PATTERN,\n \"\"\n );\n oneButLastValue[1] = oneButLastValue[1].replace(\n Match.SUFFIX_BANG_PATTERN,\n \"\"\n );\n }\n\n if (lastValue[1].length === 0) {\n property.pop();\n }\n\n if (oneButLastValue[1].length === 0) {\n property.pop();\n }\n }\n\n function stripPrefixHack(property) {\n property[1][1] = property[1][1].substring(1);\n }\n\n function stripSuffixHack(property, hackFrom) {\n var lastValue = property[property.length - 1];\n lastValue[1] = lastValue[1]\n .substring(\n 0,\n lastValue[1].indexOf(\n hackFrom[0] == Hack.BACKSLASH ? Match.BACKSLASH : Match.BANG\n )\n )\n .trim();\n\n if (lastValue[1].length === 0) {\n property.pop();\n }\n }\n\n function wrapSingle(property) {\n var importantProperty = isImportant(property);\n if (importantProperty) {\n stripImportant(property);\n }\n\n var whichHack = hackFrom(property);\n if (\n whichHack[0] == Hack.ASTERISK ||\n whichHack[0] == Hack.UNDERSCORE\n ) {\n stripPrefixHack(property);\n } else if (\n whichHack[0] == Hack.BACKSLASH ||\n whichHack[0] == Hack.BANG\n ) {\n stripSuffixHack(property, whichHack);\n }\n\n return {\n block: property[2] && property[2][0] == Token.PROPERTY_BLOCK,\n components: [],\n dirty: false,\n hack: whichHack,\n important: importantProperty,\n name: property[1][1],\n multiplex: property.length > 3 ? isMultiplex(property) : false,\n position: 0,\n shorthand: false,\n unused: false,\n value: property.slice(2)\n };\n }\n\n module.exports = {\n all: wrapAll,\n single: wrapSingle\n };\n },\n { \"../tokenizer/marker\": 83, \"../tokenizer/token\": 84, \"./hack\": 8 }\n ],\n 59: [\n function(require, module, exports) {\n var DEFAULTS = {\n \"*\": {\n colors: {\n opacity: true // rgba / hsla\n },\n properties: {\n backgroundClipMerging: true, // background-clip to shorthand\n backgroundOriginMerging: true, // background-origin to shorthand\n backgroundSizeMerging: true, // background-size to shorthand\n colors: true, // any kind of color transformations, like `#ff00ff` to `#f0f` or `#fff` into `red`\n ieBangHack: false, // !ie suffix hacks on IE<8\n ieFilters: false, // whether to preserve `filter` and `-ms-filter` properties\n iePrefixHack: false, // underscore / asterisk prefix hacks on IE\n ieSuffixHack: false, // \\9 suffix hacks on IE6-9\n merging: true, // merging properties into one\n shorterLengthUnits: false, // optimize pixel units into `pt`, `pc` or `in` units\n spaceAfterClosingBrace: true, // 'url() no-repeat' to 'url()no-repeat'\n urlQuotes: false, // whether to wrap content of `url()` into quotes or not\n zeroUnits: true // 0[unit] -> 0\n },\n selectors: {\n adjacentSpace: false, // div+ nav Android stock browser hack\n ie7Hack: false, // *+html hack\n mergeablePseudoClasses: [\n \":active\",\n \":after\",\n \":before\",\n \":empty\",\n \":checked\",\n \":disabled\",\n \":empty\",\n \":enabled\",\n \":first-child\",\n \":first-letter\",\n \":first-line\",\n \":first-of-type\",\n \":focus\",\n \":hover\",\n \":lang\",\n \":last-child\",\n \":last-of-type\",\n \":link\",\n \":not\",\n \":nth-child\",\n \":nth-last-child\",\n \":nth-last-of-type\",\n \":nth-of-type\",\n \":only-child\",\n \":only-of-type\",\n \":root\",\n \":target\",\n \":visited\"\n ], // selectors with these pseudo-classes can be merged as these are universally supported\n mergeablePseudoElements: [\n \"::after\",\n \"::before\",\n \"::first-letter\",\n \"::first-line\"\n ], // selectors with these pseudo-elements can be merged as these are universally supported\n mergeLimit: 8191, // number of rules that can be safely merged together\n multiplePseudoMerging: true\n },\n units: {\n ch: true,\n in: true,\n pc: true,\n pt: true,\n rem: true,\n vh: true,\n vm: true, // vm is vmin on IE9+ see https://developer.mozilla.org/en-US/docs/Web/CSS/length\n vmax: true,\n vmin: true,\n vw: true\n }\n }\n };\n\n DEFAULTS.ie11 = DEFAULTS[\"*\"];\n\n DEFAULTS.ie10 = DEFAULTS[\"*\"];\n\n DEFAULTS.ie9 = merge(DEFAULTS[\"*\"], {\n properties: {\n ieFilters: true,\n ieSuffixHack: true\n }\n });\n\n DEFAULTS.ie8 = merge(DEFAULTS.ie9, {\n colors: {\n opacity: false\n },\n properties: {\n backgroundClipMerging: false,\n backgroundOriginMerging: false,\n backgroundSizeMerging: false,\n iePrefixHack: true,\n merging: false\n },\n selectors: {\n mergeablePseudoClasses: [\n \":after\",\n \":before\",\n \":first-child\",\n \":first-letter\",\n \":focus\",\n \":hover\",\n \":visited\"\n ],\n mergeablePseudoElements: []\n },\n units: {\n ch: false,\n rem: false,\n vh: false,\n vm: false,\n vmax: false,\n vmin: false,\n vw: false\n }\n });\n\n DEFAULTS.ie7 = merge(DEFAULTS.ie8, {\n properties: {\n ieBangHack: true\n },\n selectors: {\n ie7Hack: true,\n mergeablePseudoClasses: [\n \":first-child\",\n \":first-letter\",\n \":hover\",\n \":visited\"\n ]\n }\n });\n\n function compatibilityFrom(source) {\n return merge(DEFAULTS[\"*\"], calculateSource(source));\n }\n\n function merge(source, target) {\n for (var key in source) {\n var value = source[key];\n\n if (typeof value === \"object\" && !Array.isArray(value)) {\n target[key] = merge(value, target[key] || {});\n } else {\n target[key] = key in target ? target[key] : value;\n }\n }\n\n return target;\n }\n\n function calculateSource(source) {\n if (typeof source == \"object\") return source;\n\n if (!/[,\\+\\-]/.test(source)) return DEFAULTS[source] || DEFAULTS[\"*\"];\n\n var parts = source.split(\",\");\n var template =\n parts[0] in DEFAULTS ? DEFAULTS[parts.shift()] : DEFAULTS[\"*\"];\n\n source = {};\n\n parts.forEach(function(part) {\n var isAdd = part[0] == \"+\";\n var key = part.substring(1).split(\".\");\n var group = key[0];\n var option = key[1];\n\n source[group] = source[group] || {};\n source[group][option] = isAdd;\n });\n\n return merge(template, source);\n }\n\n module.exports = compatibilityFrom;\n },\n {}\n ],\n 60: [\n function(require, module, exports) {\n var loadRemoteResource = require(\"../reader/load-remote-resource\");\n\n function fetchFrom(callback) {\n return callback || loadRemoteResource;\n }\n\n module.exports = fetchFrom;\n },\n { \"../reader/load-remote-resource\": 74 }\n ],\n 61: [\n function(require, module, exports) {\n var systemLineBreak = require(\"os\").EOL;\n\n var override = require(\"../utils/override\");\n\n var Breaks = {\n AfterAtRule: \"afterAtRule\",\n AfterBlockBegins: \"afterBlockBegins\",\n AfterBlockEnds: \"afterBlockEnds\",\n AfterComment: \"afterComment\",\n AfterProperty: \"afterProperty\",\n AfterRuleBegins: \"afterRuleBegins\",\n AfterRuleEnds: \"afterRuleEnds\",\n BeforeBlockEnds: \"beforeBlockEnds\",\n BetweenSelectors: \"betweenSelectors\"\n };\n\n var BreakWith = {\n CarriageReturnLineFeed: \"\\r\\n\",\n LineFeed: \"\\n\",\n System: systemLineBreak\n };\n\n var IndentWith = {\n Space: \" \",\n Tab: \"\\t\"\n };\n\n var Spaces = {\n AroundSelectorRelation: \"aroundSelectorRelation\",\n BeforeBlockBegins: \"beforeBlockBegins\",\n BeforeValue: \"beforeValue\"\n };\n\n var DEFAULTS = {\n breaks: breaks(false),\n breakWith: BreakWith.System,\n indentBy: 0,\n indentWith: IndentWith.Space,\n spaces: spaces(false),\n wrapAt: false,\n semicolonAfterLastProperty: false\n };\n\n var BEAUTIFY_ALIAS = \"beautify\";\n var KEEP_BREAKS_ALIAS = \"keep-breaks\";\n\n var OPTION_SEPARATOR = \";\";\n var OPTION_NAME_VALUE_SEPARATOR = \":\";\n var HASH_VALUES_OPTION_SEPARATOR = \",\";\n var HASH_VALUES_NAME_VALUE_SEPARATOR = \"=\";\n\n var FALSE_KEYWORD_1 = \"false\";\n var FALSE_KEYWORD_2 = \"off\";\n var TRUE_KEYWORD_1 = \"true\";\n var TRUE_KEYWORD_2 = \"on\";\n\n function breaks(value) {\n var breakOptions = {};\n\n breakOptions[Breaks.AfterAtRule] = value;\n breakOptions[Breaks.AfterBlockBegins] = value;\n breakOptions[Breaks.AfterBlockEnds] = value;\n breakOptions[Breaks.AfterComment] = value;\n breakOptions[Breaks.AfterProperty] = value;\n breakOptions[Breaks.AfterRuleBegins] = value;\n breakOptions[Breaks.AfterRuleEnds] = value;\n breakOptions[Breaks.BeforeBlockEnds] = value;\n breakOptions[Breaks.BetweenSelectors] = value;\n\n return breakOptions;\n }\n\n function spaces(value) {\n var spaceOptions = {};\n\n spaceOptions[Spaces.AroundSelectorRelation] = value;\n spaceOptions[Spaces.BeforeBlockBegins] = value;\n spaceOptions[Spaces.BeforeValue] = value;\n\n return spaceOptions;\n }\n\n function formatFrom(source) {\n if (source === undefined || source === false) {\n return false;\n }\n\n if (typeof source == \"object\" && \"breakWith\" in source) {\n source = override(source, {\n breakWith: mapBreakWith(source.breakWith)\n });\n }\n\n if (typeof source == \"object\" && \"indentBy\" in source) {\n source = override(source, { indentBy: parseInt(source.indentBy) });\n }\n\n if (typeof source == \"object\" && \"indentWith\" in source) {\n source = override(source, {\n indentWith: mapIndentWith(source.indentWith)\n });\n }\n\n if (typeof source == \"object\") {\n return override(DEFAULTS, source);\n }\n\n if (typeof source == \"object\") {\n return override(DEFAULTS, source);\n }\n\n if (typeof source == \"string\" && source == BEAUTIFY_ALIAS) {\n return override(DEFAULTS, {\n breaks: breaks(true),\n indentBy: 2,\n spaces: spaces(true)\n });\n }\n\n if (typeof source == \"string\" && source == KEEP_BREAKS_ALIAS) {\n return override(DEFAULTS, {\n breaks: {\n afterAtRule: true,\n afterBlockBegins: true,\n afterBlockEnds: true,\n afterComment: true,\n afterRuleEnds: true,\n beforeBlockEnds: true\n }\n });\n }\n\n if (typeof source == \"string\") {\n return override(DEFAULTS, toHash(source));\n }\n\n return DEFAULTS;\n }\n\n function toHash(string) {\n return string\n .split(OPTION_SEPARATOR)\n .reduce(function(accumulator, directive) {\n var parts = directive.split(OPTION_NAME_VALUE_SEPARATOR);\n var name = parts[0];\n var value = parts[1];\n\n if (name == \"breaks\" || name == \"spaces\") {\n accumulator[name] = hashValuesToHash(value);\n } else if (name == \"indentBy\" || name == \"wrapAt\") {\n accumulator[name] = parseInt(value);\n } else if (name == \"indentWith\") {\n accumulator[name] = mapIndentWith(value);\n } else if (name == \"breakWith\") {\n accumulator[name] = mapBreakWith(value);\n }\n\n return accumulator;\n }, {});\n }\n\n function hashValuesToHash(string) {\n return string\n .split(HASH_VALUES_OPTION_SEPARATOR)\n .reduce(function(accumulator, directive) {\n var parts = directive.split(HASH_VALUES_NAME_VALUE_SEPARATOR);\n var name = parts[0];\n var value = parts[1];\n\n accumulator[name] = normalizeValue(value);\n\n return accumulator;\n }, {});\n }\n\n function normalizeValue(value) {\n switch (value) {\n case FALSE_KEYWORD_1:\n case FALSE_KEYWORD_2:\n return false;\n case TRUE_KEYWORD_1:\n case TRUE_KEYWORD_2:\n return true;\n default:\n return value;\n }\n }\n\n function mapBreakWith(value) {\n switch (value) {\n case \"windows\":\n case \"crlf\":\n case BreakWith.CarriageReturnLineFeed:\n return BreakWith.CarriageReturnLineFeed;\n case \"unix\":\n case \"lf\":\n case BreakWith.LineFeed:\n return BreakWith.LineFeed;\n default:\n return systemLineBreak;\n }\n }\n\n function mapIndentWith(value) {\n switch (value) {\n case \"space\":\n return IndentWith.Space;\n case \"tab\":\n return IndentWith.Tab;\n default:\n return value;\n }\n }\n\n module.exports = {\n Breaks: Breaks,\n Spaces: Spaces,\n formatFrom: formatFrom\n };\n },\n { \"../utils/override\": 95, os: 109 }\n ],\n 62: [\n function(require, module, exports) {\n (function(process) {\n var url = require(\"url\");\n\n var override = require(\"../utils/override\");\n\n function inlineRequestFrom(option) {\n return override(\n /* jshint camelcase: false */\n proxyOptionsFrom(\n process.env.HTTP_PROXY || process.env.http_proxy\n ),\n option || {}\n );\n }\n\n function proxyOptionsFrom(httpProxy) {\n return httpProxy\n ? {\n hostname: url.parse(httpProxy).hostname,\n port: parseInt(url.parse(httpProxy).port)\n }\n : {};\n }\n\n module.exports = inlineRequestFrom;\n }.call(this, require(\"_process\")));\n },\n { \"../utils/override\": 95, _process: 112, url: 162 }\n ],\n 63: [\n function(require, module, exports) {\n var DEFAULT_TIMEOUT = 5000;\n\n function inlineTimeoutFrom(option) {\n return option || DEFAULT_TIMEOUT;\n }\n\n module.exports = inlineTimeoutFrom;\n },\n {}\n ],\n 64: [\n function(require, module, exports) {\n function inlineOptionsFrom(rules) {\n if (Array.isArray(rules)) {\n return rules;\n }\n\n if (rules === false) {\n return [\"none\"];\n }\n\n return undefined === rules ? [\"local\"] : rules.split(\",\");\n }\n\n module.exports = inlineOptionsFrom;\n },\n {}\n ],\n 65: [\n function(require, module, exports) {\n var roundingPrecisionFrom = require(\"./rounding-precision\")\n .roundingPrecisionFrom;\n\n var override = require(\"../utils/override\");\n\n var OptimizationLevel = {\n Zero: \"0\",\n One: \"1\",\n Two: \"2\"\n };\n\n var DEFAULTS = {};\n\n DEFAULTS[OptimizationLevel.Zero] = {};\n DEFAULTS[OptimizationLevel.One] = {\n cleanupCharsets: true,\n normalizeUrls: true,\n optimizeBackground: true,\n optimizeBorderRadius: true,\n optimizeFilter: true,\n optimizeFontWeight: true,\n optimizeOutline: true,\n removeEmpty: true,\n removeNegativePaddings: true,\n removeQuotes: true,\n removeWhitespace: true,\n replaceMultipleZeros: true,\n replaceTimeUnits: true,\n replaceZeroUnits: true,\n roundingPrecision: roundingPrecisionFrom(undefined),\n selectorsSortingMethod: \"standard\",\n specialComments: \"all\",\n tidyAtRules: true,\n tidyBlockScopes: true,\n tidySelectors: true,\n transform: noop\n };\n DEFAULTS[OptimizationLevel.Two] = {\n mergeAdjacentRules: true,\n mergeIntoShorthands: true,\n mergeMedia: true,\n mergeNonAdjacentRules: true,\n mergeSemantically: false,\n overrideProperties: true,\n removeEmpty: true,\n reduceNonAdjacentRules: true,\n removeDuplicateFontRules: true,\n removeDuplicateMediaBlocks: true,\n removeDuplicateRules: true,\n removeUnusedAtRules: false,\n restructureRules: false,\n skipProperties: []\n };\n\n var ALL_KEYWORD_1 = \"*\";\n var ALL_KEYWORD_2 = \"all\";\n var FALSE_KEYWORD_1 = \"false\";\n var FALSE_KEYWORD_2 = \"off\";\n var TRUE_KEYWORD_1 = \"true\";\n var TRUE_KEYWORD_2 = \"on\";\n\n var LIST_VALUE_SEPARATOR = \",\";\n var OPTION_SEPARATOR = \";\";\n var OPTION_VALUE_SEPARATOR = \":\";\n\n function noop() {}\n\n function optimizationLevelFrom(source) {\n var level = override(DEFAULTS, {});\n var Zero = OptimizationLevel.Zero;\n var One = OptimizationLevel.One;\n var Two = OptimizationLevel.Two;\n\n if (undefined === source) {\n delete level[Two];\n return level;\n }\n\n if (typeof source == \"string\") {\n source = parseInt(source);\n }\n\n if (typeof source == \"number\" && source === parseInt(Two)) {\n return level;\n }\n\n if (typeof source == \"number\" && source === parseInt(One)) {\n delete level[Two];\n return level;\n }\n\n if (typeof source == \"number\" && source === parseInt(Zero)) {\n delete level[Two];\n delete level[One];\n return level;\n }\n\n if (typeof source == \"object\") {\n source = covertValuesToHashes(source);\n }\n\n if (One in source && \"roundingPrecision\" in source[One]) {\n source[One].roundingPrecision = roundingPrecisionFrom(\n source[One].roundingPrecision\n );\n }\n\n if (\n Two in source &&\n \"skipProperties\" in source[Two] &&\n typeof source[Two].skipProperties == \"string\"\n ) {\n source[Two].skipProperties = source[Two].skipProperties.split(\n LIST_VALUE_SEPARATOR\n );\n }\n\n if (Zero in source || One in source || Two in source) {\n level[Zero] = override(level[Zero], source[Zero]);\n }\n\n if (One in source && ALL_KEYWORD_1 in source[One]) {\n level[One] = override(\n level[One],\n defaults(One, normalizeValue(source[One][ALL_KEYWORD_1]))\n );\n delete source[One][ALL_KEYWORD_1];\n }\n\n if (One in source && ALL_KEYWORD_2 in source[One]) {\n level[One] = override(\n level[One],\n defaults(One, normalizeValue(source[One][ALL_KEYWORD_2]))\n );\n delete source[One][ALL_KEYWORD_2];\n }\n\n if (One in source || Two in source) {\n level[One] = override(level[One], source[One]);\n } else {\n delete level[One];\n }\n\n if (Two in source && ALL_KEYWORD_1 in source[Two]) {\n level[Two] = override(\n level[Two],\n defaults(Two, normalizeValue(source[Two][ALL_KEYWORD_1]))\n );\n delete source[Two][ALL_KEYWORD_1];\n }\n\n if (Two in source && ALL_KEYWORD_2 in source[Two]) {\n level[Two] = override(\n level[Two],\n defaults(Two, normalizeValue(source[Two][ALL_KEYWORD_2]))\n );\n delete source[Two][ALL_KEYWORD_2];\n }\n\n if (Two in source) {\n level[Two] = override(level[Two], source[Two]);\n } else {\n delete level[Two];\n }\n\n return level;\n }\n\n function defaults(level, value) {\n var options = override(DEFAULTS[level], {});\n var key;\n\n for (key in options) {\n if (typeof options[key] == \"boolean\") {\n options[key] = value;\n }\n }\n\n return options;\n }\n\n function normalizeValue(value) {\n switch (value) {\n case FALSE_KEYWORD_1:\n case FALSE_KEYWORD_2:\n return false;\n case TRUE_KEYWORD_1:\n case TRUE_KEYWORD_2:\n return true;\n default:\n return value;\n }\n }\n\n function covertValuesToHashes(source) {\n var clonedSource = override(source, {});\n var level;\n var i;\n\n for (i = 0; i <= 2; i++) {\n level = \"\" + i;\n\n if (\n level in clonedSource &&\n (clonedSource[level] === undefined ||\n clonedSource[level] === false)\n ) {\n delete clonedSource[level];\n }\n\n if (level in clonedSource && clonedSource[level] === true) {\n clonedSource[level] = {};\n }\n\n if (\n level in clonedSource &&\n typeof clonedSource[level] == \"string\"\n ) {\n clonedSource[level] = covertToHash(clonedSource[level], level);\n }\n }\n\n return clonedSource;\n }\n\n function covertToHash(asString, level) {\n return asString\n .split(OPTION_SEPARATOR)\n .reduce(function(accumulator, directive) {\n var parts = directive.split(OPTION_VALUE_SEPARATOR);\n var name = parts[0];\n var value = parts[1];\n var normalizedValue = normalizeValue(value);\n\n if (ALL_KEYWORD_1 == name || ALL_KEYWORD_2 == name) {\n accumulator = override(\n accumulator,\n defaults(level, normalizedValue)\n );\n } else {\n accumulator[name] = normalizedValue;\n }\n\n return accumulator;\n }, {});\n }\n\n module.exports = {\n OptimizationLevel: OptimizationLevel,\n optimizationLevelFrom: optimizationLevelFrom\n };\n },\n { \"../utils/override\": 95, \"./rounding-precision\": 68 }\n ],\n 66: [\n function(require, module, exports) {\n (function(process) {\n var path = require(\"path\");\n\n function rebaseToFrom(option) {\n return option ? path.resolve(option) : process.cwd();\n }\n\n module.exports = rebaseToFrom;\n }.call(this, require(\"_process\")));\n },\n { _process: 112, path: 110 }\n ],\n 67: [\n function(require, module, exports) {\n function rebaseFrom(rebaseOption) {\n return undefined === rebaseOption ? true : !!rebaseOption;\n }\n\n module.exports = rebaseFrom;\n },\n {}\n ],\n 68: [\n function(require, module, exports) {\n var override = require(\"../utils/override\");\n\n var INTEGER_PATTERN = /^\\d+$/;\n\n var ALL_UNITS = [\"*\", \"all\"];\n var DEFAULT_PRECISION = \"off\"; // all precision changes are disabled\n var DIRECTIVES_SEPARATOR = \",\"; // e.g. *=5,px=3\n var DIRECTIVE_VALUE_SEPARATOR = \"=\"; // e.g. *=5\n\n function roundingPrecisionFrom(source) {\n return override(\n defaults(DEFAULT_PRECISION),\n buildPrecisionFrom(source)\n );\n }\n\n function defaults(value) {\n return {\n ch: value,\n cm: value,\n em: value,\n ex: value,\n in: value,\n mm: value,\n pc: value,\n pt: value,\n px: value,\n q: value,\n rem: value,\n vh: value,\n vmax: value,\n vmin: value,\n vw: value,\n \"%\": value\n };\n }\n\n function buildPrecisionFrom(source) {\n if (source === null || source === undefined) {\n return {};\n }\n\n if (typeof source == \"boolean\") {\n return {};\n }\n\n if (typeof source == \"number\" && source == -1) {\n return defaults(DEFAULT_PRECISION);\n }\n\n if (typeof source == \"number\") {\n return defaults(source);\n }\n\n if (typeof source == \"string\" && INTEGER_PATTERN.test(source)) {\n return defaults(parseInt(source));\n }\n\n if (typeof source == \"string\" && source == DEFAULT_PRECISION) {\n return defaults(DEFAULT_PRECISION);\n }\n\n if (typeof source == \"object\") {\n return source;\n }\n\n return source\n .split(DIRECTIVES_SEPARATOR)\n .reduce(function(accumulator, directive) {\n var directiveParts = directive.split(DIRECTIVE_VALUE_SEPARATOR);\n var name = directiveParts[0];\n var value = parseInt(directiveParts[1]);\n\n if (isNaN(value) || value == -1) {\n value = DEFAULT_PRECISION;\n }\n\n if (ALL_UNITS.indexOf(name) > -1) {\n accumulator = override(accumulator, defaults(value));\n } else {\n accumulator[name] = value;\n }\n\n return accumulator;\n }, {});\n }\n\n module.exports = {\n DEFAULT: DEFAULT_PRECISION,\n roundingPrecisionFrom: roundingPrecisionFrom\n };\n },\n { \"../utils/override\": 95 }\n ],\n 69: [\n function(require, module, exports) {\n (function(global, Buffer) {\n var fs = require(\"fs\");\n var path = require(\"path\");\n\n var isAllowedResource = require(\"./is-allowed-resource\");\n var matchDataUri = require(\"./match-data-uri\");\n var rebaseLocalMap = require(\"./rebase-local-map\");\n var rebaseRemoteMap = require(\"./rebase-remote-map\");\n\n var Token = require(\"../tokenizer/token\");\n var hasProtocol = require(\"../utils/has-protocol\");\n var isDataUriResource = require(\"../utils/is-data-uri-resource\");\n var isRemoteResource = require(\"../utils/is-remote-resource\");\n\n var MAP_MARKER_PATTERN = /^\\/\\*# sourceMappingURL=(\\S+) \\*\\/$/;\n\n function applySourceMaps(tokens, context, callback) {\n var applyContext = {\n callback: callback,\n fetch: context.options.fetch,\n index: 0,\n inline: context.options.inline,\n inlineRequest: context.options.inlineRequest,\n inlineTimeout: context.options.inlineTimeout,\n inputSourceMapTracker: context.inputSourceMapTracker,\n localOnly: context.localOnly,\n processedTokens: [],\n rebaseTo: context.options.rebaseTo,\n sourceTokens: tokens,\n warnings: context.warnings\n };\n\n return context.options.sourceMap && tokens.length > 0\n ? doApplySourceMaps(applyContext)\n : callback(tokens);\n }\n\n function doApplySourceMaps(applyContext) {\n var singleSourceTokens = [];\n var lastSource = findTokenSource(applyContext.sourceTokens[0]);\n var source;\n var token;\n var l;\n\n for (\n l = applyContext.sourceTokens.length;\n applyContext.index < l;\n applyContext.index++\n ) {\n token = applyContext.sourceTokens[applyContext.index];\n source = findTokenSource(token);\n\n if (source != lastSource) {\n singleSourceTokens = [];\n lastSource = source;\n }\n\n singleSourceTokens.push(token);\n applyContext.processedTokens.push(token);\n\n if (\n token[0] == Token.COMMENT &&\n MAP_MARKER_PATTERN.test(token[1])\n ) {\n return fetchAndApplySourceMap(\n token[1],\n source,\n singleSourceTokens,\n applyContext\n );\n }\n }\n\n return applyContext.callback(applyContext.processedTokens);\n }\n\n function findTokenSource(token) {\n var scope;\n var metadata;\n\n if (token[0] == Token.AT_RULE || token[0] == Token.COMMENT) {\n metadata = token[2][0];\n } else {\n scope = token[1][0];\n metadata = scope[2][0];\n }\n\n return metadata[2];\n }\n\n function fetchAndApplySourceMap(\n sourceMapComment,\n source,\n singleSourceTokens,\n applyContext\n ) {\n return extractInputSourceMapFrom(\n sourceMapComment,\n applyContext,\n function(inputSourceMap) {\n if (inputSourceMap) {\n applyContext.inputSourceMapTracker.track(\n source,\n inputSourceMap\n );\n applySourceMapRecursively(\n singleSourceTokens,\n applyContext.inputSourceMapTracker\n );\n }\n\n applyContext.index++;\n return doApplySourceMaps(applyContext);\n }\n );\n }\n\n function extractInputSourceMapFrom(\n sourceMapComment,\n applyContext,\n whenSourceMapReady\n ) {\n var uri = MAP_MARKER_PATTERN.exec(sourceMapComment)[1];\n var absoluteUri;\n var sourceMap;\n var rebasedMap;\n\n if (isDataUriResource(uri)) {\n sourceMap = extractInputSourceMapFromDataUri(uri);\n return whenSourceMapReady(sourceMap);\n } else if (isRemoteResource(uri)) {\n return loadInputSourceMapFromRemoteUri(\n uri,\n applyContext,\n function(sourceMap) {\n var parsedMap;\n\n if (sourceMap) {\n parsedMap = JSON.parse(sourceMap);\n rebasedMap = rebaseRemoteMap(parsedMap, uri);\n whenSourceMapReady(rebasedMap);\n } else {\n whenSourceMapReady(null);\n }\n }\n );\n } else {\n // at this point `uri` is already rebased, see lib/reader/rebase.js#rebaseSourceMapComment\n // it is rebased to be consistent with rebasing other URIs\n // however here we need to resolve it back to read it from disk\n absoluteUri = path.resolve(applyContext.rebaseTo, uri);\n sourceMap = loadInputSourceMapFromLocalUri(\n absoluteUri,\n applyContext\n );\n\n if (sourceMap) {\n rebasedMap = rebaseLocalMap(\n sourceMap,\n absoluteUri,\n applyContext.rebaseTo\n );\n return whenSourceMapReady(rebasedMap);\n } else {\n return whenSourceMapReady(null);\n }\n }\n }\n\n function extractInputSourceMapFromDataUri(uri) {\n var dataUriMatch = matchDataUri(uri);\n var charset = dataUriMatch[2]\n ? dataUriMatch[2].split(/[=;]/)[2]\n : \"us-ascii\";\n var encoding = dataUriMatch[3]\n ? dataUriMatch[3].split(\";\")[1]\n : \"utf8\";\n var data =\n encoding == \"utf8\"\n ? global.unescape(dataUriMatch[4])\n : dataUriMatch[4];\n\n var buffer = new Buffer(data, encoding);\n buffer.charset = charset;\n\n return JSON.parse(buffer.toString());\n }\n\n function loadInputSourceMapFromRemoteUri(\n uri,\n applyContext,\n whenLoaded\n ) {\n var isAllowed = isAllowedResource(uri, true, applyContext.inline);\n var isRuntimeResource = !hasProtocol(uri);\n\n if (applyContext.localOnly) {\n applyContext.warnings.push(\n 'Cannot fetch remote resource from \"' +\n uri +\n '\" as no callback given.'\n );\n return whenLoaded(null);\n } else if (isRuntimeResource) {\n applyContext.warnings.push(\n 'Cannot fetch \"' + uri + '\" as no protocol given.'\n );\n return whenLoaded(null);\n } else if (!isAllowed) {\n applyContext.warnings.push(\n 'Cannot fetch \"' + uri + '\" as resource is not allowed.'\n );\n return whenLoaded(null);\n }\n\n applyContext.fetch(\n uri,\n applyContext.inlineRequest,\n applyContext.inlineTimeout,\n function(error, body) {\n if (error) {\n applyContext.warnings.push(\n 'Missing source map at \"' + uri + '\" - ' + error\n );\n return whenLoaded(null);\n }\n\n whenLoaded(body);\n }\n );\n }\n\n function loadInputSourceMapFromLocalUri(uri, applyContext) {\n var isAllowed = isAllowedResource(uri, false, applyContext.inline);\n var sourceMap;\n\n if (!fs.existsSync(uri) || !fs.statSync(uri).isFile()) {\n applyContext.warnings.push(\n 'Ignoring local source map at \"' +\n uri +\n '\" as resource is missing.'\n );\n return null;\n } else if (!isAllowed) {\n applyContext.warnings.push(\n 'Cannot fetch \"' + uri + '\" as resource is not allowed.'\n );\n return null;\n }\n\n sourceMap = fs.readFileSync(uri, \"utf-8\");\n return JSON.parse(sourceMap);\n }\n\n function applySourceMapRecursively(tokens, inputSourceMapTracker) {\n var token;\n var i, l;\n\n for (i = 0, l = tokens.length; i < l; i++) {\n token = tokens[i];\n\n switch (token[0]) {\n case Token.AT_RULE:\n applySourceMapTo(token, inputSourceMapTracker);\n break;\n case Token.AT_RULE_BLOCK:\n applySourceMapRecursively(token[1], inputSourceMapTracker);\n applySourceMapRecursively(token[2], inputSourceMapTracker);\n break;\n case Token.AT_RULE_BLOCK_SCOPE:\n applySourceMapTo(token, inputSourceMapTracker);\n break;\n case Token.NESTED_BLOCK:\n applySourceMapRecursively(token[1], inputSourceMapTracker);\n applySourceMapRecursively(token[2], inputSourceMapTracker);\n break;\n case Token.NESTED_BLOCK_SCOPE:\n applySourceMapTo(token, inputSourceMapTracker);\n break;\n case Token.COMMENT:\n applySourceMapTo(token, inputSourceMapTracker);\n break;\n case Token.PROPERTY:\n applySourceMapRecursively(token, inputSourceMapTracker);\n break;\n case Token.PROPERTY_BLOCK:\n applySourceMapRecursively(token[1], inputSourceMapTracker);\n break;\n case Token.PROPERTY_NAME:\n applySourceMapTo(token, inputSourceMapTracker);\n break;\n case Token.PROPERTY_VALUE:\n applySourceMapTo(token, inputSourceMapTracker);\n break;\n case Token.RULE:\n applySourceMapRecursively(token[1], inputSourceMapTracker);\n applySourceMapRecursively(token[2], inputSourceMapTracker);\n break;\n case Token.RULE_SCOPE:\n applySourceMapTo(token, inputSourceMapTracker);\n }\n }\n\n return tokens;\n }\n\n function applySourceMapTo(token, inputSourceMapTracker) {\n var value = token[1];\n var metadata = token[2];\n var newMetadata = [];\n var i, l;\n\n for (i = 0, l = metadata.length; i < l; i++) {\n newMetadata.push(\n inputSourceMapTracker.originalPositionFor(\n metadata[i],\n value.length\n )\n );\n }\n\n token[2] = newMetadata;\n }\n\n module.exports = applySourceMaps;\n }.call(\n this,\n typeof global !== \"undefined\"\n ? global\n : typeof self !== \"undefined\"\n ? self\n : typeof window !== \"undefined\"\n ? window\n : {},\n require(\"buffer\").Buffer\n ));\n },\n {\n \"../tokenizer/token\": 84,\n \"../utils/has-protocol\": 88,\n \"../utils/is-data-uri-resource\": 89,\n \"../utils/is-remote-resource\": 93,\n \"./is-allowed-resource\": 72,\n \"./match-data-uri\": 75,\n \"./rebase-local-map\": 78,\n \"./rebase-remote-map\": 79,\n buffer: 4,\n fs: 3,\n path: 110\n }\n ],\n 70: [\n function(require, module, exports) {\n var split = require(\"../utils/split\");\n\n var BRACE_PREFIX = /^\\(/;\n var BRACE_SUFFIX = /\\)$/;\n var IMPORT_PREFIX_PATTERN = /^@import/i;\n var QUOTE_PREFIX_PATTERN = /['\"]\\s*/;\n var QUOTE_SUFFIX_PATTERN = /\\s*['\"]/;\n var URL_PREFIX_PATTERN = /^url\\(\\s*/i;\n var URL_SUFFIX_PATTERN = /\\s*\\)/i;\n\n function extractImportUrlAndMedia(atRuleValue) {\n var uri;\n var mediaQuery;\n var stripped;\n var parts;\n\n stripped = atRuleValue\n .replace(IMPORT_PREFIX_PATTERN, \"\")\n .trim()\n .replace(URL_PREFIX_PATTERN, \"(\")\n .replace(URL_SUFFIX_PATTERN, \")\")\n .replace(QUOTE_PREFIX_PATTERN, \"\")\n .replace(QUOTE_SUFFIX_PATTERN, \"\");\n\n parts = split(stripped, \" \");\n\n uri = parts[0].replace(BRACE_PREFIX, \"\").replace(BRACE_SUFFIX, \"\");\n mediaQuery = parts.slice(1).join(\" \");\n\n return [uri, mediaQuery];\n }\n\n module.exports = extractImportUrlAndMedia;\n },\n { \"../utils/split\": 96 }\n ],\n 71: [\n function(require, module, exports) {\n var SourceMapConsumer = require(\"source-map\").SourceMapConsumer;\n\n function inputSourceMapTracker() {\n var maps = {};\n\n return {\n all: all.bind(null, maps),\n isTracking: isTracking.bind(null, maps),\n originalPositionFor: originalPositionFor.bind(null, maps),\n track: track.bind(null, maps)\n };\n }\n\n function all(maps) {\n return maps;\n }\n\n function isTracking(maps, source) {\n return source in maps;\n }\n\n function originalPositionFor(maps, metadata, range, selectorFallbacks) {\n var line = metadata[0];\n var column = metadata[1];\n var source = metadata[2];\n var position = {\n line: line,\n column: column + range\n };\n var originalPosition;\n\n while (!originalPosition && position.column > column) {\n position.column--;\n originalPosition = maps[source].originalPositionFor(position);\n }\n\n if (!originalPosition || originalPosition.column < 0) {\n return metadata;\n }\n\n if (\n originalPosition.line === null &&\n line > 1 &&\n selectorFallbacks > 0\n ) {\n return originalPositionFor(\n maps,\n [line - 1, column, source],\n range,\n selectorFallbacks - 1\n );\n }\n\n return originalPosition.line !== null\n ? toMetadata(originalPosition)\n : metadata;\n }\n\n function toMetadata(asHash) {\n return [asHash.line, asHash.column, asHash.source];\n }\n\n function track(maps, source, data) {\n maps[source] = new SourceMapConsumer(data);\n }\n\n module.exports = inputSourceMapTracker;\n },\n { \"source-map\": 155 }\n ],\n 72: [\n function(require, module, exports) {\n var path = require(\"path\");\n var url = require(\"url\");\n\n var isRemoteResource = require(\"../utils/is-remote-resource\");\n var hasProtocol = require(\"../utils/has-protocol\");\n\n var HTTP_PROTOCOL = \"http:\";\n\n function isAllowedResource(uri, isRemote, rules) {\n var match;\n var absoluteUri;\n var allowed = isRemote ? false : true;\n var rule;\n var isNegated;\n var normalizedRule;\n var i;\n\n if (rules.length === 0) {\n return false;\n }\n\n if (isRemote && !hasProtocol(uri)) {\n uri = HTTP_PROTOCOL + uri;\n }\n\n match = isRemote ? url.parse(uri).host : uri;\n\n absoluteUri = isRemote ? uri : path.resolve(uri);\n\n for (i = 0; i < rules.length; i++) {\n rule = rules[i];\n isNegated = rule[0] == \"!\";\n normalizedRule = rule.substring(1);\n\n if (isNegated && isRemote && isRemoteRule(normalizedRule)) {\n allowed =\n allowed && !isAllowedResource(uri, true, [normalizedRule]);\n } else if (\n isNegated &&\n !isRemote &&\n !isRemoteRule(normalizedRule)\n ) {\n allowed =\n allowed && !isAllowedResource(uri, false, [normalizedRule]);\n } else if (isNegated) {\n allowed = allowed && true;\n } else if (rule == \"all\") {\n allowed = true;\n } else if (isRemote && rule == \"local\") {\n allowed = allowed || false;\n } else if (isRemote && rule == \"remote\") {\n allowed = true;\n } else if (!isRemote && rule == \"remote\") {\n allowed = false;\n } else if (!isRemote && rule == \"local\") {\n allowed = true;\n } else if (rule === match) {\n allowed = true;\n } else if (rule === uri) {\n allowed = true;\n } else if (isRemote && absoluteUri.indexOf(rule) === 0) {\n allowed = true;\n } else if (\n !isRemote &&\n absoluteUri.indexOf(path.resolve(rule)) === 0\n ) {\n allowed = true;\n } else if (isRemote != isRemoteRule(normalizedRule)) {\n allowed = allowed && true;\n } else {\n allowed = false;\n }\n }\n\n return allowed;\n }\n\n function isRemoteRule(rule) {\n return (\n isRemoteResource(rule) ||\n url.parse(HTTP_PROTOCOL + \"//\" + rule).host == rule\n );\n }\n\n module.exports = isAllowedResource;\n },\n {\n \"../utils/has-protocol\": 88,\n \"../utils/is-remote-resource\": 93,\n path: 110,\n url: 162\n }\n ],\n 73: [\n function(require, module, exports) {\n var fs = require(\"fs\");\n var path = require(\"path\");\n\n var isAllowedResource = require(\"./is-allowed-resource\");\n\n var hasProtocol = require(\"../utils/has-protocol\");\n var isRemoteResource = require(\"../utils/is-remote-resource\");\n\n function loadOriginalSources(context, callback) {\n var loadContext = {\n callback: callback,\n fetch: context.options.fetch,\n index: 0,\n inline: context.options.inline,\n inlineRequest: context.options.inlineRequest,\n inlineTimeout: context.options.inlineTimeout,\n localOnly: context.localOnly,\n rebaseTo: context.options.rebaseTo,\n sourcesContent: context.sourcesContent,\n uriToSource: uriToSourceMapping(\n context.inputSourceMapTracker.all()\n ),\n warnings: context.warnings\n };\n\n return context.options.sourceMap &&\n context.options.sourceMapInlineSources\n ? doLoadOriginalSources(loadContext)\n : callback();\n }\n\n function uriToSourceMapping(allSourceMapConsumers) {\n var mapping = {};\n var consumer;\n var uri;\n var source;\n var i, l;\n\n for (source in allSourceMapConsumers) {\n consumer = allSourceMapConsumers[source];\n\n for (i = 0, l = consumer.sources.length; i < l; i++) {\n uri = consumer.sources[i];\n source = consumer.sourceContentFor(uri, true);\n\n mapping[uri] = source;\n }\n }\n\n return mapping;\n }\n\n function doLoadOriginalSources(loadContext) {\n var uris = Object.keys(loadContext.uriToSource);\n var uri;\n var source;\n var total;\n\n for (\n total = uris.length;\n loadContext.index < total;\n loadContext.index++\n ) {\n uri = uris[loadContext.index];\n source = loadContext.uriToSource[uri];\n\n if (source) {\n loadContext.sourcesContent[uri] = source;\n } else {\n return loadOriginalSource(uri, loadContext);\n }\n }\n\n return loadContext.callback();\n }\n\n function loadOriginalSource(uri, loadContext) {\n var content;\n\n if (isRemoteResource(uri)) {\n return loadOriginalSourceFromRemoteUri(uri, loadContext, function(\n content\n ) {\n loadContext.index++;\n loadContext.sourcesContent[uri] = content;\n return doLoadOriginalSources(loadContext);\n });\n } else {\n content = loadOriginalSourceFromLocalUri(uri, loadContext);\n loadContext.index++;\n loadContext.sourcesContent[uri] = content;\n return doLoadOriginalSources(loadContext);\n }\n }\n\n function loadOriginalSourceFromRemoteUri(uri, loadContext, whenLoaded) {\n var isAllowed = isAllowedResource(uri, true, loadContext.inline);\n var isRuntimeResource = !hasProtocol(uri);\n\n if (loadContext.localOnly) {\n loadContext.warnings.push(\n 'Cannot fetch remote resource from \"' +\n uri +\n '\" as no callback given.'\n );\n return whenLoaded(null);\n } else if (isRuntimeResource) {\n loadContext.warnings.push(\n 'Cannot fetch \"' + uri + '\" as no protocol given.'\n );\n return whenLoaded(null);\n } else if (!isAllowed) {\n loadContext.warnings.push(\n 'Cannot fetch \"' + uri + '\" as resource is not allowed.'\n );\n return whenLoaded(null);\n }\n\n loadContext.fetch(\n uri,\n loadContext.inlineRequest,\n loadContext.inlineTimeout,\n function(error, content) {\n if (error) {\n loadContext.warnings.push(\n 'Missing original source at \"' + uri + '\" - ' + error\n );\n }\n\n whenLoaded(content);\n }\n );\n }\n\n function loadOriginalSourceFromLocalUri(relativeUri, loadContext) {\n var isAllowed = isAllowedResource(\n relativeUri,\n false,\n loadContext.inline\n );\n var absoluteUri = path.resolve(loadContext.rebaseTo, relativeUri);\n\n if (\n !fs.existsSync(absoluteUri) ||\n !fs.statSync(absoluteUri).isFile()\n ) {\n loadContext.warnings.push(\n 'Ignoring local source map at \"' +\n absoluteUri +\n '\" as resource is missing.'\n );\n return null;\n } else if (!isAllowed) {\n loadContext.warnings.push(\n 'Cannot fetch \"' + absoluteUri + '\" as resource is not allowed.'\n );\n return null;\n }\n\n return fs.readFileSync(absoluteUri, \"utf8\");\n }\n\n module.exports = loadOriginalSources;\n },\n {\n \"../utils/has-protocol\": 88,\n \"../utils/is-remote-resource\": 93,\n \"./is-allowed-resource\": 72,\n fs: 3,\n path: 110\n }\n ],\n 74: [\n function(require, module, exports) {\n var http = require(\"http\");\n var https = require(\"https\");\n var url = require(\"url\");\n\n var isHttpResource = require(\"../utils/is-http-resource\");\n var isHttpsResource = require(\"../utils/is-https-resource\");\n var override = require(\"../utils/override\");\n\n var HTTP_PROTOCOL = \"http:\";\n\n function loadRemoteResource(\n uri,\n inlineRequest,\n inlineTimeout,\n callback\n ) {\n var proxyProtocol = inlineRequest.protocol || inlineRequest.hostname;\n var errorHandled = false;\n var requestOptions;\n var fetch;\n\n requestOptions = override(url.parse(uri), inlineRequest || {});\n\n if (inlineRequest.hostname !== undefined) {\n // overwrite as we always expect a http proxy currently\n requestOptions.protocol = inlineRequest.protocol || HTTP_PROTOCOL;\n requestOptions.path = requestOptions.href;\n }\n\n fetch =\n (proxyProtocol && !isHttpsResource(proxyProtocol)) ||\n isHttpResource(uri)\n ? http.get\n : https.get;\n\n fetch(requestOptions, function(res) {\n var chunks = [];\n var movedUri;\n\n if (errorHandled) {\n return;\n }\n\n if (res.statusCode < 200 || res.statusCode > 399) {\n return callback(res.statusCode, null);\n } else if (res.statusCode > 299) {\n movedUri = url.resolve(uri, res.headers.location);\n return loadRemoteResource(\n movedUri,\n inlineRequest,\n inlineTimeout,\n callback\n );\n }\n\n res.on(\"data\", function(chunk) {\n chunks.push(chunk.toString());\n });\n res.on(\"end\", function() {\n var body = chunks.join(\"\");\n callback(null, body);\n });\n })\n .on(\"error\", function(res) {\n if (errorHandled) {\n return;\n }\n\n errorHandled = true;\n callback(res.message, null);\n })\n .on(\"timeout\", function() {\n if (errorHandled) {\n return;\n }\n\n errorHandled = true;\n callback(\"timeout\", null);\n })\n .setTimeout(inlineTimeout);\n }\n\n module.exports = loadRemoteResource;\n },\n {\n \"../utils/is-http-resource\": 90,\n \"../utils/is-https-resource\": 91,\n \"../utils/override\": 95,\n http: 156,\n https: 104,\n url: 162\n }\n ],\n 75: [\n function(require, module, exports) {\n var DATA_URI_PATTERN = /^data:(\\S*?)?(;charset=[^;]+)?(;[^,]+?)?,(.+)/;\n\n function matchDataUri(uri) {\n return DATA_URI_PATTERN.exec(uri);\n }\n\n module.exports = matchDataUri;\n },\n {}\n ],\n 76: [\n function(require, module, exports) {\n var UNIX_SEPARATOR = \"/\";\n var WINDOWS_SEPARATOR_PATTERN = /\\\\/g;\n\n function normalizePath(path) {\n return path.replace(WINDOWS_SEPARATOR_PATTERN, UNIX_SEPARATOR);\n }\n\n module.exports = normalizePath;\n },\n {}\n ],\n 77: [\n function(require, module, exports) {\n (function(Buffer, process) {\n var fs = require(\"fs\");\n var path = require(\"path\");\n\n var applySourceMaps = require(\"./apply-source-maps\");\n var extractImportUrlAndMedia = require(\"./extract-import-url-and-media\");\n var isAllowedResource = require(\"./is-allowed-resource\");\n var loadOriginalSources = require(\"./load-original-sources\");\n var normalizePath = require(\"./normalize-path\");\n var rebase = require(\"./rebase\");\n var rebaseLocalMap = require(\"./rebase-local-map\");\n var rebaseRemoteMap = require(\"./rebase-remote-map\");\n var restoreImport = require(\"./restore-import\");\n\n var tokenize = require(\"../tokenizer/tokenize\");\n var Token = require(\"../tokenizer/token\");\n var Marker = require(\"../tokenizer/marker\");\n var hasProtocol = require(\"../utils/has-protocol\");\n var isImport = require(\"../utils/is-import\");\n var isRemoteResource = require(\"../utils/is-remote-resource\");\n\n var UNKNOWN_URI = \"uri:unknown\";\n\n function readSources(input, context, callback) {\n return doReadSources(input, context, function(tokens) {\n return applySourceMaps(tokens, context, function() {\n return loadOriginalSources(context, function() {\n return callback(tokens);\n });\n });\n });\n }\n\n function doReadSources(input, context, callback) {\n if (typeof input == \"string\") {\n return fromString(input, context, callback);\n } else if (Buffer.isBuffer(input)) {\n return fromString(input.toString(), context, callback);\n } else if (Array.isArray(input)) {\n return fromArray(input, context, callback);\n } else if (typeof input == \"object\") {\n return fromHash(input, context, callback);\n }\n }\n\n function fromString(input, context, callback) {\n context.source = undefined;\n context.sourcesContent[undefined] = input;\n context.stats.originalSize += input.length;\n\n return fromStyles(\n input,\n context,\n { inline: context.options.inline },\n callback\n );\n }\n\n function fromArray(input, context, callback) {\n var inputAsImports = input.reduce(function(accumulator, uriOrHash) {\n if (typeof uriOrHash === \"string\") {\n return addStringSource(uriOrHash, accumulator);\n } else {\n return addHashSource(uriOrHash, context, accumulator);\n }\n }, []);\n\n return fromStyles(\n inputAsImports.join(\"\"),\n context,\n { inline: [\"all\"] },\n callback\n );\n }\n\n function fromHash(input, context, callback) {\n var inputAsImports = addHashSource(input, context, []);\n return fromStyles(\n inputAsImports.join(\"\"),\n context,\n { inline: [\"all\"] },\n callback\n );\n }\n\n function addStringSource(input, imports) {\n imports.push(restoreAsImport(normalizeUri(input)));\n return imports;\n }\n\n function addHashSource(input, context, imports) {\n var uri;\n var normalizedUri;\n var source;\n\n for (uri in input) {\n source = input[uri];\n normalizedUri = normalizeUri(uri);\n\n imports.push(restoreAsImport(normalizedUri));\n\n context.sourcesContent[normalizedUri] = source.styles;\n\n if (source.sourceMap) {\n trackSourceMap(source.sourceMap, normalizedUri, context);\n }\n }\n\n return imports;\n }\n\n function normalizeUri(uri) {\n var currentPath = path.resolve(\"\");\n var absoluteUri;\n var relativeToCurrentPath;\n var normalizedUri;\n\n if (isRemoteResource(uri)) {\n return uri;\n }\n\n absoluteUri = path.isAbsolute(uri) ? uri : path.resolve(uri);\n relativeToCurrentPath = path.relative(currentPath, absoluteUri);\n normalizedUri = normalizePath(relativeToCurrentPath);\n\n return normalizedUri;\n }\n\n function trackSourceMap(sourceMap, uri, context) {\n var parsedMap =\n typeof sourceMap == \"string\" ? JSON.parse(sourceMap) : sourceMap;\n var rebasedMap = isRemoteResource(uri)\n ? rebaseRemoteMap(parsedMap, uri)\n : rebaseLocalMap(\n parsedMap,\n uri || UNKNOWN_URI,\n context.options.rebaseTo\n );\n\n context.inputSourceMapTracker.track(uri, rebasedMap);\n }\n\n function restoreAsImport(uri) {\n return restoreImport(\"url(\" + uri + \")\", \"\") + Marker.SEMICOLON;\n }\n\n function fromStyles(styles, context, parentInlinerContext, callback) {\n var tokens;\n var rebaseConfig = {};\n\n if (!context.source) {\n rebaseConfig.fromBase = path.resolve(\"\");\n rebaseConfig.toBase = context.options.rebaseTo;\n } else if (isRemoteResource(context.source)) {\n rebaseConfig.fromBase = context.source;\n rebaseConfig.toBase = context.source;\n } else if (path.isAbsolute(context.source)) {\n rebaseConfig.fromBase = path.dirname(context.source);\n rebaseConfig.toBase = context.options.rebaseTo;\n } else {\n rebaseConfig.fromBase = path.dirname(\n path.resolve(context.source)\n );\n rebaseConfig.toBase = context.options.rebaseTo;\n }\n\n tokens = tokenize(styles, context);\n tokens = rebase(\n tokens,\n context.options.rebase,\n context.validator,\n rebaseConfig\n );\n\n return allowsAnyImports(parentInlinerContext.inline)\n ? inline(tokens, context, parentInlinerContext, callback)\n : callback(tokens);\n }\n\n function allowsAnyImports(inline) {\n return !(inline.length == 1 && inline[0] == \"none\");\n }\n\n function inline(\n tokens,\n externalContext,\n parentInlinerContext,\n callback\n ) {\n var inlinerContext = {\n afterContent: false,\n callback: callback,\n errors: externalContext.errors,\n externalContext: externalContext,\n fetch: externalContext.options.fetch,\n inlinedStylesheets:\n parentInlinerContext.inlinedStylesheets ||\n externalContext.inlinedStylesheets,\n inline: parentInlinerContext.inline,\n inlineRequest: externalContext.options.inlineRequest,\n inlineTimeout: externalContext.options.inlineTimeout,\n isRemote: parentInlinerContext.isRemote || false,\n localOnly: externalContext.localOnly,\n outputTokens: [],\n rebaseTo: externalContext.options.rebaseTo,\n sourceTokens: tokens,\n warnings: externalContext.warnings\n };\n\n return doInlineImports(inlinerContext);\n }\n\n function doInlineImports(inlinerContext) {\n var token;\n var i, l;\n\n for (i = 0, l = inlinerContext.sourceTokens.length; i < l; i++) {\n token = inlinerContext.sourceTokens[i];\n\n if (token[0] == Token.AT_RULE && isImport(token[1])) {\n inlinerContext.sourceTokens.splice(0, i);\n return inlineStylesheet(token, inlinerContext);\n } else if (\n token[0] == Token.AT_RULE ||\n token[0] == Token.COMMENT\n ) {\n inlinerContext.outputTokens.push(token);\n } else {\n inlinerContext.outputTokens.push(token);\n inlinerContext.afterContent = true;\n }\n }\n\n inlinerContext.sourceTokens = [];\n return inlinerContext.callback(inlinerContext.outputTokens);\n }\n\n function inlineStylesheet(token, inlinerContext) {\n var uriAndMediaQuery = extractImportUrlAndMedia(token[1]);\n var uri = uriAndMediaQuery[0];\n var mediaQuery = uriAndMediaQuery[1];\n var metadata = token[2];\n\n return isRemoteResource(uri)\n ? inlineRemoteStylesheet(\n uri,\n mediaQuery,\n metadata,\n inlinerContext\n )\n : inlineLocalStylesheet(\n uri,\n mediaQuery,\n metadata,\n inlinerContext\n );\n }\n\n function inlineRemoteStylesheet(\n uri,\n mediaQuery,\n metadata,\n inlinerContext\n ) {\n var isAllowed = isAllowedResource(uri, true, inlinerContext.inline);\n var originalUri = uri;\n var isLoaded = uri in inlinerContext.externalContext.sourcesContent;\n var isRuntimeResource = !hasProtocol(uri);\n\n if (inlinerContext.inlinedStylesheets.indexOf(uri) > -1) {\n inlinerContext.warnings.push(\n 'Ignoring remote @import of \"' +\n uri +\n '\" as it has already been imported.'\n );\n inlinerContext.sourceTokens = inlinerContext.sourceTokens.slice(\n 1\n );\n return doInlineImports(inlinerContext);\n } else if (\n inlinerContext.localOnly &&\n inlinerContext.afterContent\n ) {\n inlinerContext.warnings.push(\n 'Ignoring remote @import of \"' +\n uri +\n '\" as no callback given and after other content.'\n );\n inlinerContext.sourceTokens = inlinerContext.sourceTokens.slice(\n 1\n );\n return doInlineImports(inlinerContext);\n } else if (isRuntimeResource) {\n inlinerContext.warnings.push(\n 'Skipping remote @import of \"' + uri + '\" as no protocol given.'\n );\n inlinerContext.outputTokens = inlinerContext.outputTokens.concat(\n inlinerContext.sourceTokens.slice(0, 1)\n );\n inlinerContext.sourceTokens = inlinerContext.sourceTokens.slice(\n 1\n );\n return doInlineImports(inlinerContext);\n } else if (inlinerContext.localOnly && !isLoaded) {\n inlinerContext.warnings.push(\n 'Skipping remote @import of \"' + uri + '\" as no callback given.'\n );\n inlinerContext.outputTokens = inlinerContext.outputTokens.concat(\n inlinerContext.sourceTokens.slice(0, 1)\n );\n inlinerContext.sourceTokens = inlinerContext.sourceTokens.slice(\n 1\n );\n return doInlineImports(inlinerContext);\n } else if (!isAllowed && inlinerContext.afterContent) {\n inlinerContext.warnings.push(\n 'Ignoring remote @import of \"' +\n uri +\n '\" as resource is not allowed and after other content.'\n );\n inlinerContext.sourceTokens = inlinerContext.sourceTokens.slice(\n 1\n );\n return doInlineImports(inlinerContext);\n } else if (!isAllowed) {\n inlinerContext.warnings.push(\n 'Skipping remote @import of \"' +\n uri +\n '\" as resource is not allowed.'\n );\n inlinerContext.outputTokens = inlinerContext.outputTokens.concat(\n inlinerContext.sourceTokens.slice(0, 1)\n );\n inlinerContext.sourceTokens = inlinerContext.sourceTokens.slice(\n 1\n );\n return doInlineImports(inlinerContext);\n }\n\n inlinerContext.inlinedStylesheets.push(uri);\n\n function whenLoaded(error, importedStyles) {\n if (error) {\n inlinerContext.errors.push(\n 'Broken @import declaration of \"' + uri + '\" - ' + error\n );\n\n return process.nextTick(function() {\n inlinerContext.outputTokens = inlinerContext.outputTokens.concat(\n inlinerContext.sourceTokens.slice(0, 1)\n );\n inlinerContext.sourceTokens = inlinerContext.sourceTokens.slice(\n 1\n );\n doInlineImports(inlinerContext);\n });\n }\n\n inlinerContext.inline =\n inlinerContext.externalContext.options.inline;\n inlinerContext.isRemote = true;\n\n inlinerContext.externalContext.source = originalUri;\n inlinerContext.externalContext.sourcesContent[\n uri\n ] = importedStyles;\n inlinerContext.externalContext.stats.originalSize +=\n importedStyles.length;\n\n return fromStyles(\n importedStyles,\n inlinerContext.externalContext,\n inlinerContext,\n function(importedTokens) {\n importedTokens = wrapInMedia(\n importedTokens,\n mediaQuery,\n metadata\n );\n\n inlinerContext.outputTokens = inlinerContext.outputTokens.concat(\n importedTokens\n );\n inlinerContext.sourceTokens = inlinerContext.sourceTokens.slice(\n 1\n );\n\n return doInlineImports(inlinerContext);\n }\n );\n }\n\n return isLoaded\n ? whenLoaded(\n null,\n inlinerContext.externalContext.sourcesContent[uri]\n )\n : inlinerContext.fetch(\n uri,\n inlinerContext.inlineRequest,\n inlinerContext.inlineTimeout,\n whenLoaded\n );\n }\n\n function inlineLocalStylesheet(\n uri,\n mediaQuery,\n metadata,\n inlinerContext\n ) {\n var currentPath = path.resolve(\"\");\n var absoluteUri = path.isAbsolute(uri)\n ? path.resolve(\n currentPath,\n uri[0] == \"/\" ? uri.substring(1) : uri\n )\n : path.resolve(inlinerContext.rebaseTo, uri);\n var relativeToCurrentPath = path.relative(currentPath, absoluteUri);\n var importedStyles;\n var isAllowed = isAllowedResource(\n uri,\n false,\n inlinerContext.inline\n );\n var normalizedPath = normalizePath(relativeToCurrentPath);\n var isLoaded =\n normalizedPath in inlinerContext.externalContext.sourcesContent;\n\n if (inlinerContext.inlinedStylesheets.indexOf(absoluteUri) > -1) {\n inlinerContext.warnings.push(\n 'Ignoring local @import of \"' +\n uri +\n '\" as it has already been imported.'\n );\n } else if (\n !isLoaded &&\n (!fs.existsSync(absoluteUri) ||\n !fs.statSync(absoluteUri).isFile())\n ) {\n inlinerContext.errors.push(\n 'Ignoring local @import of \"' +\n uri +\n '\" as resource is missing.'\n );\n } else if (!isAllowed && inlinerContext.afterContent) {\n inlinerContext.warnings.push(\n 'Ignoring local @import of \"' +\n uri +\n '\" as resource is not allowed and after other content.'\n );\n } else if (inlinerContext.afterContent) {\n inlinerContext.warnings.push(\n 'Ignoring local @import of \"' +\n uri +\n '\" as after other content.'\n );\n } else if (!isAllowed) {\n inlinerContext.warnings.push(\n 'Skipping local @import of \"' +\n uri +\n '\" as resource is not allowed.'\n );\n inlinerContext.outputTokens = inlinerContext.outputTokens.concat(\n inlinerContext.sourceTokens.slice(0, 1)\n );\n } else {\n importedStyles = isLoaded\n ? inlinerContext.externalContext.sourcesContent[normalizedPath]\n : fs.readFileSync(absoluteUri, \"utf-8\");\n\n inlinerContext.inlinedStylesheets.push(absoluteUri);\n inlinerContext.inline =\n inlinerContext.externalContext.options.inline;\n\n inlinerContext.externalContext.source = normalizedPath;\n inlinerContext.externalContext.sourcesContent[\n normalizedPath\n ] = importedStyles;\n inlinerContext.externalContext.stats.originalSize +=\n importedStyles.length;\n\n return fromStyles(\n importedStyles,\n inlinerContext.externalContext,\n inlinerContext,\n function(importedTokens) {\n importedTokens = wrapInMedia(\n importedTokens,\n mediaQuery,\n metadata\n );\n\n inlinerContext.outputTokens = inlinerContext.outputTokens.concat(\n importedTokens\n );\n inlinerContext.sourceTokens = inlinerContext.sourceTokens.slice(\n 1\n );\n\n return doInlineImports(inlinerContext);\n }\n );\n }\n\n inlinerContext.sourceTokens = inlinerContext.sourceTokens.slice(1);\n\n return doInlineImports(inlinerContext);\n }\n\n function wrapInMedia(tokens, mediaQuery, metadata) {\n if (mediaQuery) {\n return [\n [\n Token.NESTED_BLOCK,\n [\n [Token.NESTED_BLOCK_SCOPE, \"@media \" + mediaQuery, metadata]\n ],\n tokens\n ]\n ];\n } else {\n return tokens;\n }\n }\n\n module.exports = readSources;\n }.call(\n this,\n { isBuffer: require(\"../../../is-buffer/index.js\") },\n require(\"_process\")\n ));\n },\n {\n \"../../../is-buffer/index.js\": 107,\n \"../tokenizer/marker\": 83,\n \"../tokenizer/token\": 84,\n \"../tokenizer/tokenize\": 85,\n \"../utils/has-protocol\": 88,\n \"../utils/is-import\": 92,\n \"../utils/is-remote-resource\": 93,\n \"./apply-source-maps\": 69,\n \"./extract-import-url-and-media\": 70,\n \"./is-allowed-resource\": 72,\n \"./load-original-sources\": 73,\n \"./normalize-path\": 76,\n \"./rebase\": 80,\n \"./rebase-local-map\": 78,\n \"./rebase-remote-map\": 79,\n \"./restore-import\": 81,\n _process: 112,\n fs: 3,\n path: 110\n }\n ],\n 78: [\n function(require, module, exports) {\n var path = require(\"path\");\n\n function rebaseLocalMap(sourceMap, sourceUri, rebaseTo) {\n var currentPath = path.resolve(\"\");\n var absoluteUri = path.resolve(currentPath, sourceUri);\n var absoluteUriDirectory = path.dirname(absoluteUri);\n\n sourceMap.sources = sourceMap.sources.map(function(source) {\n return path.relative(\n rebaseTo,\n path.resolve(absoluteUriDirectory, source)\n );\n });\n\n return sourceMap;\n }\n\n module.exports = rebaseLocalMap;\n },\n { path: 110 }\n ],\n 79: [\n function(require, module, exports) {\n var path = require(\"path\");\n var url = require(\"url\");\n\n function rebaseRemoteMap(sourceMap, sourceUri) {\n var sourceDirectory = path.dirname(sourceUri);\n\n sourceMap.sources = sourceMap.sources.map(function(source) {\n return url.resolve(sourceDirectory, source);\n });\n\n return sourceMap;\n }\n\n module.exports = rebaseRemoteMap;\n },\n { path: 110, url: 162 }\n ],\n 80: [\n function(require, module, exports) {\n var extractImportUrlAndMedia = require(\"./extract-import-url-and-media\");\n var restoreImport = require(\"./restore-import\");\n var rewriteUrl = require(\"./rewrite-url\");\n\n var Token = require(\"../tokenizer/token\");\n var isImport = require(\"../utils/is-import\");\n\n var SOURCE_MAP_COMMENT_PATTERN = /^\\/\\*# sourceMappingURL=(\\S+) \\*\\/$/;\n\n function rebase(tokens, rebaseAll, validator, rebaseConfig) {\n return rebaseAll\n ? rebaseEverything(tokens, validator, rebaseConfig)\n : rebaseAtRules(tokens, validator, rebaseConfig);\n }\n\n function rebaseEverything(tokens, validator, rebaseConfig) {\n var token;\n var i, l;\n\n for (i = 0, l = tokens.length; i < l; i++) {\n token = tokens[i];\n\n switch (token[0]) {\n case Token.AT_RULE:\n rebaseAtRule(token, validator, rebaseConfig);\n break;\n case Token.AT_RULE_BLOCK:\n rebaseProperties(token[2], validator, rebaseConfig);\n break;\n case Token.COMMENT:\n rebaseSourceMapComment(token, rebaseConfig);\n break;\n case Token.NESTED_BLOCK:\n rebaseEverything(token[2], validator, rebaseConfig);\n break;\n case Token.RULE:\n rebaseProperties(token[2], validator, rebaseConfig);\n break;\n }\n }\n\n return tokens;\n }\n\n function rebaseAtRules(tokens, validator, rebaseConfig) {\n var token;\n var i, l;\n\n for (i = 0, l = tokens.length; i < l; i++) {\n token = tokens[i];\n\n switch (token[0]) {\n case Token.AT_RULE:\n rebaseAtRule(token, validator, rebaseConfig);\n break;\n }\n }\n\n return tokens;\n }\n\n function rebaseAtRule(token, validator, rebaseConfig) {\n if (!isImport(token[1])) {\n return;\n }\n\n var uriAndMediaQuery = extractImportUrlAndMedia(token[1]);\n var newUrl = rewriteUrl(uriAndMediaQuery[0], rebaseConfig);\n var mediaQuery = uriAndMediaQuery[1];\n\n token[1] = restoreImport(newUrl, mediaQuery);\n }\n\n function rebaseSourceMapComment(token, rebaseConfig) {\n var matches = SOURCE_MAP_COMMENT_PATTERN.exec(token[1]);\n\n if (matches && matches[1].indexOf(\"data:\") === -1) {\n token[1] = token[1].replace(\n matches[1],\n rewriteUrl(matches[1], rebaseConfig, true)\n );\n }\n }\n\n function rebaseProperties(properties, validator, rebaseConfig) {\n var property;\n var value;\n var i, l;\n var j, m;\n\n for (i = 0, l = properties.length; i < l; i++) {\n property = properties[i];\n\n for (\n j = 2 /* 0 is Token.PROPERTY, 1 is name */, m = property.length;\n j < m;\n j++\n ) {\n value = property[j][1];\n\n if (validator.isUrl(value)) {\n property[j][1] = rewriteUrl(value, rebaseConfig);\n }\n }\n }\n }\n\n module.exports = rebase;\n },\n {\n \"../tokenizer/token\": 84,\n \"../utils/is-import\": 92,\n \"./extract-import-url-and-media\": 70,\n \"./restore-import\": 81,\n \"./rewrite-url\": 82\n }\n ],\n 81: [\n function(require, module, exports) {\n function restoreImport(uri, mediaQuery) {\n return (\"@import \" + uri + \" \" + mediaQuery).trim();\n }\n\n module.exports = restoreImport;\n },\n {}\n ],\n 82: [\n function(require, module, exports) {\n (function(process) {\n var path = require(\"path\");\n var url = require(\"url\");\n\n var DOUBLE_QUOTE = '\"';\n var SINGLE_QUOTE = \"'\";\n var URL_PREFIX = \"url(\";\n var URL_SUFFIX = \")\";\n\n var QUOTE_PREFIX_PATTERN = /^[\"']/;\n var QUOTE_SUFFIX_PATTERN = /[\"']$/;\n var ROUND_BRACKETS_PATTERN = /[\\(\\)]/;\n var URL_PREFIX_PATTERN = /^url\\(/i;\n var URL_SUFFIX_PATTERN = /\\)$/;\n var WHITESPACE_PATTERN = /\\s/;\n\n var isWindows = process.platform == \"win32\";\n\n function rebase(uri, rebaseConfig) {\n if (!rebaseConfig) {\n return uri;\n }\n\n if (isAbsolute(uri) && !isRemote(rebaseConfig.toBase)) {\n return uri;\n }\n\n if (isRemote(uri) || isSVGMarker(uri) || isInternal(uri)) {\n return uri;\n }\n\n if (isData(uri)) {\n return \"'\" + uri + \"'\";\n }\n\n if (isRemote(rebaseConfig.toBase)) {\n return url.resolve(rebaseConfig.toBase, uri);\n }\n\n return rebaseConfig.absolute\n ? normalize(absolute(uri, rebaseConfig))\n : normalize(relative(uri, rebaseConfig));\n }\n\n function isAbsolute(uri) {\n return path.isAbsolute(uri);\n }\n\n function isSVGMarker(uri) {\n return uri[0] == \"#\";\n }\n\n function isInternal(uri) {\n return /^\\w+:\\w+/.test(uri);\n }\n\n function isRemote(uri) {\n return /^[^:]+?:\\/\\//.test(uri) || uri.indexOf(\"//\") === 0;\n }\n\n function isData(uri) {\n return uri.indexOf(\"data:\") === 0;\n }\n\n function absolute(uri, rebaseConfig) {\n return path\n .resolve(path.join(rebaseConfig.fromBase || \"\", uri))\n .replace(rebaseConfig.toBase, \"\");\n }\n\n function relative(uri, rebaseConfig) {\n return path.relative(\n rebaseConfig.toBase,\n path.join(rebaseConfig.fromBase || \"\", uri)\n );\n }\n\n function normalize(uri) {\n return isWindows ? uri.replace(/\\\\/g, \"/\") : uri;\n }\n\n function quoteFor(unquotedUrl) {\n if (unquotedUrl.indexOf(SINGLE_QUOTE) > -1) {\n return DOUBLE_QUOTE;\n } else if (unquotedUrl.indexOf(DOUBLE_QUOTE) > -1) {\n return SINGLE_QUOTE;\n } else if (\n hasWhitespace(unquotedUrl) ||\n hasRoundBrackets(unquotedUrl)\n ) {\n return SINGLE_QUOTE;\n } else {\n return \"\";\n }\n }\n\n function hasWhitespace(url) {\n return WHITESPACE_PATTERN.test(url);\n }\n\n function hasRoundBrackets(url) {\n return ROUND_BRACKETS_PATTERN.test(url);\n }\n\n function rewriteUrl(originalUrl, rebaseConfig, pathOnly) {\n var strippedUrl = originalUrl\n .replace(URL_PREFIX_PATTERN, \"\")\n .replace(URL_SUFFIX_PATTERN, \"\")\n .trim();\n\n var unquotedUrl = strippedUrl\n .replace(QUOTE_PREFIX_PATTERN, \"\")\n .replace(QUOTE_SUFFIX_PATTERN, \"\")\n .trim();\n\n var quote =\n strippedUrl[0] == SINGLE_QUOTE || strippedUrl[0] == DOUBLE_QUOTE\n ? strippedUrl[0]\n : quoteFor(unquotedUrl);\n\n return pathOnly\n ? rebase(unquotedUrl, rebaseConfig)\n : URL_PREFIX +\n quote +\n rebase(unquotedUrl, rebaseConfig) +\n quote +\n URL_SUFFIX;\n }\n\n module.exports = rewriteUrl;\n }.call(this, require(\"_process\")));\n },\n { _process: 112, path: 110, url: 162 }\n ],\n 83: [\n function(require, module, exports) {\n var Marker = {\n ASTERISK: \"*\",\n AT: \"@\",\n BACK_SLASH: \"\\\\\",\n CARRIAGE_RETURN: \"\\r\",\n CLOSE_CURLY_BRACKET: \"}\",\n CLOSE_ROUND_BRACKET: \")\",\n CLOSE_SQUARE_BRACKET: \"]\",\n COLON: \":\",\n COMMA: \",\",\n DOUBLE_QUOTE: '\"',\n EXCLAMATION: \"!\",\n FORWARD_SLASH: \"/\",\n INTERNAL: \"-clean-css-\",\n NEW_LINE_NIX: \"\\n\",\n OPEN_CURLY_BRACKET: \"{\",\n OPEN_ROUND_BRACKET: \"(\",\n OPEN_SQUARE_BRACKET: \"[\",\n SEMICOLON: \";\",\n SINGLE_QUOTE: \"'\",\n SPACE: \" \",\n TAB: \"\\t\",\n UNDERSCORE: \"_\"\n };\n\n module.exports = Marker;\n },\n {}\n ],\n 84: [\n function(require, module, exports) {\n var Token = {\n AT_RULE: \"at-rule\", // e.g. `@import`, `@charset`\n AT_RULE_BLOCK: \"at-rule-block\", // e.g. `@font-face{...}`\n AT_RULE_BLOCK_SCOPE: \"at-rule-block-scope\", // e.g. `@font-face`\n COMMENT: \"comment\", // e.g. `/* comment */`\n NESTED_BLOCK: \"nested-block\", // e.g. `@media screen{...}`, `@keyframes animation {...}`\n NESTED_BLOCK_SCOPE: \"nested-block-scope\", // e.g. `@media`, `@keyframes`\n PROPERTY: \"property\", // e.g. `color:red`\n PROPERTY_BLOCK: \"property-block\", // e.g. `--var:{color:red}`\n PROPERTY_NAME: \"property-name\", // e.g. `color`\n PROPERTY_VALUE: \"property-value\", // e.g. `red`\n RAW: \"raw\", // e.g. anything between /* clean-css ignore:start */ and /* clean-css ignore:end */ comments\n RULE: \"rule\", // e.g `div > a{...}`\n RULE_SCOPE: \"rule-scope\" // e.g `div > a`\n };\n\n module.exports = Token;\n },\n {}\n ],\n 85: [\n function(require, module, exports) {\n var Marker = require(\"./marker\");\n var Token = require(\"./token\");\n\n var formatPosition = require(\"../utils/format-position\");\n\n var Level = {\n BLOCK: \"block\",\n COMMENT: \"comment\",\n DOUBLE_QUOTE: \"double-quote\",\n RULE: \"rule\",\n SINGLE_QUOTE: \"single-quote\"\n };\n\n var AT_RULES = [\"@charset\", \"@import\"];\n\n var BLOCK_RULES = [\n \"@-moz-document\",\n \"@document\",\n \"@-moz-keyframes\",\n \"@-ms-keyframes\",\n \"@-o-keyframes\",\n \"@-webkit-keyframes\",\n \"@keyframes\",\n \"@media\",\n \"@supports\"\n ];\n\n var IGNORE_END_COMMENT_PATTERN = /\\/\\* clean\\-css ignore:end \\*\\/$/;\n var IGNORE_START_COMMENT_PATTERN = /^\\/\\* clean\\-css ignore:start \\*\\//;\n\n var PAGE_MARGIN_BOXES = [\n \"@bottom-center\",\n \"@bottom-left\",\n \"@bottom-left-corner\",\n \"@bottom-right\",\n \"@bottom-right-corner\",\n \"@left-bottom\",\n \"@left-middle\",\n \"@left-top\",\n \"@right-bottom\",\n \"@right-middle\",\n \"@right-top\",\n \"@top-center\",\n \"@top-left\",\n \"@top-left-corner\",\n \"@top-right\",\n \"@top-right-corner\"\n ];\n\n var EXTRA_PAGE_BOXES = [\n \"@footnote\",\n \"@footnotes\",\n \"@left\",\n \"@page-float-bottom\",\n \"@page-float-top\",\n \"@right\"\n ];\n\n var REPEAT_PATTERN = /^\\[\\s{0,31}\\d+\\s{0,31}\\]$/;\n var RULE_WORD_SEPARATOR_PATTERN = /[\\s\\(]/;\n var TAIL_BROKEN_VALUE_PATTERN = /[\\s|\\}]*$/;\n\n function tokenize(source, externalContext) {\n var internalContext = {\n level: Level.BLOCK,\n position: {\n source: externalContext.source || undefined,\n line: 1,\n column: 0,\n index: 0\n }\n };\n\n return intoTokens(source, externalContext, internalContext, false);\n }\n\n function intoTokens(\n source,\n externalContext,\n internalContext,\n isNested\n ) {\n var allTokens = [];\n var newTokens = allTokens;\n var lastToken;\n var ruleToken;\n var ruleTokens = [];\n var propertyToken;\n var metadata;\n var metadatas = [];\n var level = internalContext.level;\n var levels = [];\n var buffer = [];\n var buffers = [];\n var serializedBuffer;\n var serializedBufferPart;\n var roundBracketLevel = 0;\n var isQuoted;\n var isSpace;\n var isNewLineNix;\n var isNewLineWin;\n var isCarriageReturn;\n var isCommentStart;\n var wasCommentStart = false;\n var isCommentEnd;\n var wasCommentEnd = false;\n var isCommentEndMarker;\n var isEscaped;\n var wasEscaped = false;\n var isRaw = false;\n var seekingValue = false;\n var seekingPropertyBlockClosing = false;\n var position = internalContext.position;\n var lastCommentStartAt;\n\n for (; position.index < source.length; position.index++) {\n var character = source[position.index];\n\n isQuoted =\n level == Level.SINGLE_QUOTE || level == Level.DOUBLE_QUOTE;\n isSpace = character == Marker.SPACE || character == Marker.TAB;\n isNewLineNix = character == Marker.NEW_LINE_NIX;\n isNewLineWin =\n character == Marker.NEW_LINE_NIX &&\n source[position.index - 1] == Marker.CARRIAGE_RETURN;\n isCarriageReturn =\n character == Marker.CARRIAGE_RETURN &&\n source[position.index + 1] &&\n source[position.index + 1] != Marker.NEW_LINE_NIX;\n isCommentStart =\n !wasCommentEnd &&\n level != Level.COMMENT &&\n !isQuoted &&\n character == Marker.ASTERISK &&\n source[position.index - 1] == Marker.FORWARD_SLASH;\n isCommentEndMarker =\n !wasCommentStart &&\n !isQuoted &&\n character == Marker.FORWARD_SLASH &&\n source[position.index - 1] == Marker.ASTERISK;\n isCommentEnd = level == Level.COMMENT && isCommentEndMarker;\n roundBracketLevel = Math.max(roundBracketLevel, 0);\n\n metadata =\n buffer.length === 0\n ? [position.line, position.column, position.source]\n : metadata;\n\n if (isEscaped) {\n // previous character was a backslash\n buffer.push(character);\n } else if (!isCommentEnd && level == Level.COMMENT) {\n buffer.push(character);\n } else if (!isCommentStart && !isCommentEnd && isRaw) {\n buffer.push(character);\n } else if (\n isCommentStart &&\n (level == Level.BLOCK || level == Level.RULE) &&\n buffer.length > 1\n ) {\n // comment start within block preceded by some content, e.g. div/*<--\n metadatas.push(metadata);\n buffer.push(character);\n buffers.push(buffer.slice(0, buffer.length - 2));\n\n buffer = buffer.slice(buffer.length - 2);\n metadata = [position.line, position.column - 1, position.source];\n\n levels.push(level);\n level = Level.COMMENT;\n } else if (isCommentStart) {\n // comment start, e.g. /*<--\n levels.push(level);\n level = Level.COMMENT;\n buffer.push(character);\n } else if (isCommentEnd && isIgnoreStartComment(buffer)) {\n // ignore:start comment end, e.g. /* clean-css ignore:start */<--\n serializedBuffer = buffer.join(\"\").trim() + character;\n lastToken = [\n Token.COMMENT,\n serializedBuffer,\n [originalMetadata(metadata, serializedBuffer, externalContext)]\n ];\n newTokens.push(lastToken);\n\n isRaw = true;\n metadata = metadatas.pop() || null;\n buffer = buffers.pop() || [];\n } else if (isCommentEnd && isIgnoreEndComment(buffer)) {\n // ignore:start comment end, e.g. /* clean-css ignore:end */<--\n serializedBuffer = buffer.join(\"\") + character;\n lastCommentStartAt = serializedBuffer.lastIndexOf(\n Marker.FORWARD_SLASH + Marker.ASTERISK\n );\n\n serializedBufferPart = serializedBuffer.substring(\n 0,\n lastCommentStartAt\n );\n lastToken = [\n Token.RAW,\n serializedBufferPart,\n [\n originalMetadata(\n metadata,\n serializedBufferPart,\n externalContext\n )\n ]\n ];\n newTokens.push(lastToken);\n\n serializedBufferPart = serializedBuffer.substring(\n lastCommentStartAt\n );\n metadata = [\n position.line,\n position.column - serializedBufferPart.length + 1,\n position.source\n ];\n lastToken = [\n Token.COMMENT,\n serializedBufferPart,\n [\n originalMetadata(\n metadata,\n serializedBufferPart,\n externalContext\n )\n ]\n ];\n newTokens.push(lastToken);\n\n isRaw = false;\n level = levels.pop();\n metadata = metadatas.pop() || null;\n buffer = buffers.pop() || [];\n } else if (isCommentEnd) {\n // comment end, e.g. /* comment */<--\n serializedBuffer = buffer.join(\"\").trim() + character;\n lastToken = [\n Token.COMMENT,\n serializedBuffer,\n [originalMetadata(metadata, serializedBuffer, externalContext)]\n ];\n newTokens.push(lastToken);\n\n level = levels.pop();\n metadata = metadatas.pop() || null;\n buffer = buffers.pop() || [];\n } else if (\n isCommentEndMarker &&\n source[position.index + 1] != Marker.ASTERISK\n ) {\n externalContext.warnings.push(\n \"Unexpected '*/' at \" +\n formatPosition([\n position.line,\n position.column,\n position.source\n ]) +\n \".\"\n );\n buffer = [];\n } else if (character == Marker.SINGLE_QUOTE && !isQuoted) {\n // single quotation start, e.g. a[href^='https<--\n levels.push(level);\n level = Level.SINGLE_QUOTE;\n buffer.push(character);\n } else if (\n character == Marker.SINGLE_QUOTE &&\n level == Level.SINGLE_QUOTE\n ) {\n // single quotation end, e.g. a[href^='https'<--\n level = levels.pop();\n buffer.push(character);\n } else if (character == Marker.DOUBLE_QUOTE && !isQuoted) {\n // double quotation start, e.g. a[href^=\"<--\n levels.push(level);\n level = Level.DOUBLE_QUOTE;\n buffer.push(character);\n } else if (\n character == Marker.DOUBLE_QUOTE &&\n level == Level.DOUBLE_QUOTE\n ) {\n // double quotation end, e.g. a[href^=\"https\"<--\n level = levels.pop();\n buffer.push(character);\n } else if (\n !isCommentStart &&\n !isCommentEnd &&\n character != Marker.CLOSE_ROUND_BRACKET &&\n character != Marker.OPEN_ROUND_BRACKET &&\n level != Level.COMMENT &&\n !isQuoted &&\n roundBracketLevel > 0\n ) {\n // character inside any function, e.g. hsla(.<--\n buffer.push(character);\n } else if (\n character == Marker.OPEN_ROUND_BRACKET &&\n !isQuoted &&\n level != Level.COMMENT &&\n !seekingValue\n ) {\n // round open bracket, e.g. @import url(<--\n buffer.push(character);\n\n roundBracketLevel++;\n } else if (\n character == Marker.CLOSE_ROUND_BRACKET &&\n !isQuoted &&\n level != Level.COMMENT &&\n !seekingValue\n ) {\n // round open bracket, e.g. @import url(test.css)<--\n buffer.push(character);\n\n roundBracketLevel--;\n } else if (\n character == Marker.SEMICOLON &&\n level == Level.BLOCK &&\n buffer[0] == Marker.AT\n ) {\n // semicolon ending rule at block level, e.g. @import '...';<--\n serializedBuffer = buffer.join(\"\").trim();\n allTokens.push([\n Token.AT_RULE,\n serializedBuffer,\n [originalMetadata(metadata, serializedBuffer, externalContext)]\n ]);\n\n buffer = [];\n } else if (\n character == Marker.COMMA &&\n level == Level.BLOCK &&\n ruleToken\n ) {\n // comma separator at block level, e.g. a,div,<--\n serializedBuffer = buffer.join(\"\").trim();\n ruleToken[1].push([\n tokenScopeFrom(ruleToken[0]),\n serializedBuffer,\n [\n originalMetadata(\n metadata,\n serializedBuffer,\n externalContext,\n ruleToken[1].length\n )\n ]\n ]);\n\n buffer = [];\n } else if (\n character == Marker.COMMA &&\n level == Level.BLOCK &&\n tokenTypeFrom(buffer) == Token.AT_RULE\n ) {\n // comma separator at block level, e.g. @import url(...) screen,<--\n // keep iterating as end semicolon will create the token\n buffer.push(character);\n } else if (character == Marker.COMMA && level == Level.BLOCK) {\n // comma separator at block level, e.g. a,<--\n ruleToken = [tokenTypeFrom(buffer), [], []];\n serializedBuffer = buffer.join(\"\").trim();\n ruleToken[1].push([\n tokenScopeFrom(ruleToken[0]),\n serializedBuffer,\n [\n originalMetadata(\n metadata,\n serializedBuffer,\n externalContext,\n 0\n )\n ]\n ]);\n\n buffer = [];\n } else if (\n character == Marker.OPEN_CURLY_BRACKET &&\n level == Level.BLOCK &&\n ruleToken &&\n ruleToken[0] == Token.NESTED_BLOCK\n ) {\n // open brace opening at-rule at block level, e.g. @media{<--\n serializedBuffer = buffer.join(\"\").trim();\n ruleToken[1].push([\n Token.NESTED_BLOCK_SCOPE,\n serializedBuffer,\n [originalMetadata(metadata, serializedBuffer, externalContext)]\n ]);\n allTokens.push(ruleToken);\n\n levels.push(level);\n position.column++;\n position.index++;\n buffer = [];\n\n ruleToken[2] = intoTokens(\n source,\n externalContext,\n internalContext,\n true\n );\n ruleToken = null;\n } else if (\n character == Marker.OPEN_CURLY_BRACKET &&\n level == Level.BLOCK &&\n tokenTypeFrom(buffer) == Token.NESTED_BLOCK\n ) {\n // open brace opening at-rule at block level, e.g. @media{<--\n serializedBuffer = buffer.join(\"\").trim();\n ruleToken = ruleToken || [Token.NESTED_BLOCK, [], []];\n ruleToken[1].push([\n Token.NESTED_BLOCK_SCOPE,\n serializedBuffer,\n [originalMetadata(metadata, serializedBuffer, externalContext)]\n ]);\n allTokens.push(ruleToken);\n\n levels.push(level);\n position.column++;\n position.index++;\n buffer = [];\n\n ruleToken[2] = intoTokens(\n source,\n externalContext,\n internalContext,\n true\n );\n ruleToken = null;\n } else if (\n character == Marker.OPEN_CURLY_BRACKET &&\n level == Level.BLOCK\n ) {\n // open brace opening rule at block level, e.g. div{<--\n serializedBuffer = buffer.join(\"\").trim();\n ruleToken = ruleToken || [tokenTypeFrom(buffer), [], []];\n ruleToken[1].push([\n tokenScopeFrom(ruleToken[0]),\n serializedBuffer,\n [\n originalMetadata(\n metadata,\n serializedBuffer,\n externalContext,\n ruleToken[1].length\n )\n ]\n ]);\n newTokens = ruleToken[2];\n allTokens.push(ruleToken);\n\n levels.push(level);\n level = Level.RULE;\n buffer = [];\n } else if (\n character == Marker.OPEN_CURLY_BRACKET &&\n level == Level.RULE &&\n seekingValue\n ) {\n // open brace opening rule at rule level, e.g. div{--variable:{<--\n ruleTokens.push(ruleToken);\n ruleToken = [Token.PROPERTY_BLOCK, []];\n propertyToken.push(ruleToken);\n newTokens = ruleToken[1];\n\n levels.push(level);\n level = Level.RULE;\n seekingValue = false;\n } else if (\n character == Marker.OPEN_CURLY_BRACKET &&\n level == Level.RULE &&\n isPageMarginBox(buffer)\n ) {\n // open brace opening page-margin box at rule level, e.g. @page{@top-center{<--\n serializedBuffer = buffer.join(\"\").trim();\n ruleTokens.push(ruleToken);\n ruleToken = [Token.AT_RULE_BLOCK, [], []];\n ruleToken[1].push([\n Token.AT_RULE_BLOCK_SCOPE,\n serializedBuffer,\n [originalMetadata(metadata, serializedBuffer, externalContext)]\n ]);\n newTokens.push(ruleToken);\n newTokens = ruleToken[2];\n\n levels.push(level);\n level = Level.RULE;\n buffer = [];\n } else if (\n character == Marker.COLON &&\n level == Level.RULE &&\n !seekingValue\n ) {\n // colon at rule level, e.g. a{color:<--\n serializedBuffer = buffer.join(\"\").trim();\n propertyToken = [\n Token.PROPERTY,\n [\n Token.PROPERTY_NAME,\n serializedBuffer,\n [\n originalMetadata(\n metadata,\n serializedBuffer,\n externalContext\n )\n ]\n ]\n ];\n newTokens.push(propertyToken);\n\n seekingValue = true;\n buffer = [];\n } else if (\n character == Marker.SEMICOLON &&\n level == Level.RULE &&\n propertyToken &&\n ruleTokens.length > 0 &&\n buffer.length > 0 &&\n buffer[0] == Marker.AT\n ) {\n // semicolon at rule level for at-rule, e.g. a{--color:{@apply(--other-color);<--\n serializedBuffer = buffer.join(\"\").trim();\n ruleToken[1].push([\n Token.AT_RULE,\n serializedBuffer,\n [originalMetadata(metadata, serializedBuffer, externalContext)]\n ]);\n\n buffer = [];\n } else if (\n character == Marker.SEMICOLON &&\n level == Level.RULE &&\n propertyToken &&\n buffer.length > 0\n ) {\n // semicolon at rule level, e.g. a{color:red;<--\n serializedBuffer = buffer.join(\"\").trim();\n propertyToken.push([\n Token.PROPERTY_VALUE,\n serializedBuffer,\n [originalMetadata(metadata, serializedBuffer, externalContext)]\n ]);\n\n propertyToken = null;\n seekingValue = false;\n buffer = [];\n } else if (\n character == Marker.SEMICOLON &&\n level == Level.RULE &&\n propertyToken &&\n buffer.length === 0\n ) {\n // semicolon after bracketed value at rule level, e.g. a{color:rgb(...);<--\n propertyToken = null;\n seekingValue = false;\n } else if (\n character == Marker.SEMICOLON &&\n level == Level.RULE &&\n buffer.length > 0 &&\n buffer[0] == Marker.AT\n ) {\n // semicolon for at-rule at rule level, e.g. a{@apply(--variable);<--\n serializedBuffer = buffer.join(\"\");\n newTokens.push([\n Token.AT_RULE,\n serializedBuffer,\n [originalMetadata(metadata, serializedBuffer, externalContext)]\n ]);\n\n seekingValue = false;\n buffer = [];\n } else if (\n character == Marker.SEMICOLON &&\n level == Level.RULE &&\n seekingPropertyBlockClosing\n ) {\n // close brace after a property block at rule level, e.g. a{--custom:{color:red;};<--\n seekingPropertyBlockClosing = false;\n buffer = [];\n } else if (\n character == Marker.SEMICOLON &&\n level == Level.RULE &&\n buffer.length === 0\n ) {\n // stray semicolon at rule level, e.g. a{;<--\n // noop\n } else if (\n character == Marker.CLOSE_CURLY_BRACKET &&\n level == Level.RULE &&\n propertyToken &&\n seekingValue &&\n buffer.length > 0 &&\n ruleTokens.length > 0\n ) {\n // close brace at rule level, e.g. a{--color:{color:red}<--\n serializedBuffer = buffer.join(\"\");\n propertyToken.push([\n Token.PROPERTY_VALUE,\n serializedBuffer,\n [originalMetadata(metadata, serializedBuffer, externalContext)]\n ]);\n propertyToken = null;\n ruleToken = ruleTokens.pop();\n newTokens = ruleToken[2];\n\n level = levels.pop();\n seekingValue = false;\n buffer = [];\n } else if (\n character == Marker.CLOSE_CURLY_BRACKET &&\n level == Level.RULE &&\n propertyToken &&\n buffer.length > 0 &&\n buffer[0] == Marker.AT &&\n ruleTokens.length > 0\n ) {\n // close brace at rule level for at-rule, e.g. a{--color:{@apply(--other-color)}<--\n serializedBuffer = buffer.join(\"\");\n ruleToken[1].push([\n Token.AT_RULE,\n serializedBuffer,\n [originalMetadata(metadata, serializedBuffer, externalContext)]\n ]);\n propertyToken = null;\n ruleToken = ruleTokens.pop();\n newTokens = ruleToken[2];\n\n level = levels.pop();\n seekingValue = false;\n buffer = [];\n } else if (\n character == Marker.CLOSE_CURLY_BRACKET &&\n level == Level.RULE &&\n propertyToken &&\n ruleTokens.length > 0\n ) {\n // close brace at rule level after space, e.g. a{--color:{color:red }<--\n propertyToken = null;\n ruleToken = ruleTokens.pop();\n newTokens = ruleToken[2];\n\n level = levels.pop();\n seekingValue = false;\n } else if (\n character == Marker.CLOSE_CURLY_BRACKET &&\n level == Level.RULE &&\n propertyToken &&\n buffer.length > 0\n ) {\n // close brace at rule level, e.g. a{color:red}<--\n serializedBuffer = buffer.join(\"\");\n propertyToken.push([\n Token.PROPERTY_VALUE,\n serializedBuffer,\n [originalMetadata(metadata, serializedBuffer, externalContext)]\n ]);\n propertyToken = null;\n ruleToken = ruleTokens.pop();\n newTokens = allTokens;\n\n level = levels.pop();\n seekingValue = false;\n buffer = [];\n } else if (\n character == Marker.CLOSE_CURLY_BRACKET &&\n level == Level.RULE &&\n buffer.length > 0 &&\n buffer[0] == Marker.AT\n ) {\n // close brace after at-rule at rule level, e.g. a{@apply(--variable)}<--\n propertyToken = null;\n ruleToken = null;\n serializedBuffer = buffer.join(\"\").trim();\n newTokens.push([\n Token.AT_RULE,\n serializedBuffer,\n [originalMetadata(metadata, serializedBuffer, externalContext)]\n ]);\n newTokens = allTokens;\n\n level = levels.pop();\n seekingValue = false;\n buffer = [];\n } else if (\n character == Marker.CLOSE_CURLY_BRACKET &&\n level == Level.RULE &&\n levels[levels.length - 1] == Level.RULE\n ) {\n // close brace after a property block at rule level, e.g. a{--custom:{color:red;}<--\n propertyToken = null;\n ruleToken = ruleTokens.pop();\n newTokens = ruleToken[2];\n\n level = levels.pop();\n seekingValue = false;\n seekingPropertyBlockClosing = true;\n buffer = [];\n } else if (\n character == Marker.CLOSE_CURLY_BRACKET &&\n level == Level.RULE\n ) {\n // close brace after a rule, e.g. a{color:red;}<--\n propertyToken = null;\n ruleToken = null;\n newTokens = allTokens;\n\n level = levels.pop();\n seekingValue = false;\n } else if (\n character == Marker.CLOSE_CURLY_BRACKET &&\n level == Level.BLOCK &&\n !isNested &&\n position.index <= source.length - 1\n ) {\n // stray close brace at block level, e.g. a{color:red}color:blue}<--\n externalContext.warnings.push(\n \"Unexpected '}' at \" +\n formatPosition([\n position.line,\n position.column,\n position.source\n ]) +\n \".\"\n );\n buffer.push(character);\n } else if (\n character == Marker.CLOSE_CURLY_BRACKET &&\n level == Level.BLOCK\n ) {\n // close brace at block level, e.g. @media screen {...}<--\n break;\n } else if (\n character == Marker.OPEN_ROUND_BRACKET &&\n level == Level.RULE &&\n seekingValue\n ) {\n // round open bracket, e.g. a{color:hsla(<--\n buffer.push(character);\n roundBracketLevel++;\n } else if (\n character == Marker.CLOSE_ROUND_BRACKET &&\n level == Level.RULE &&\n seekingValue &&\n roundBracketLevel == 1\n ) {\n // round close bracket, e.g. a{color:hsla(0,0%,0%)<--\n buffer.push(character);\n serializedBuffer = buffer.join(\"\").trim();\n propertyToken.push([\n Token.PROPERTY_VALUE,\n serializedBuffer,\n [originalMetadata(metadata, serializedBuffer, externalContext)]\n ]);\n\n roundBracketLevel--;\n buffer = [];\n } else if (\n character == Marker.CLOSE_ROUND_BRACKET &&\n level == Level.RULE &&\n seekingValue\n ) {\n // round close bracket within other brackets, e.g. a{width:calc((10rem / 2)<--\n buffer.push(character);\n roundBracketLevel--;\n } else if (\n character == Marker.FORWARD_SLASH &&\n source[position.index + 1] != Marker.ASTERISK &&\n level == Level.RULE &&\n seekingValue &&\n buffer.length > 0\n ) {\n // forward slash within a property, e.g. a{background:url(image.png) 0 0/<--\n serializedBuffer = buffer.join(\"\").trim();\n propertyToken.push([\n Token.PROPERTY_VALUE,\n serializedBuffer,\n [originalMetadata(metadata, serializedBuffer, externalContext)]\n ]);\n propertyToken.push([\n Token.PROPERTY_VALUE,\n character,\n [[position.line, position.column, position.source]]\n ]);\n\n buffer = [];\n } else if (\n character == Marker.FORWARD_SLASH &&\n source[position.index + 1] != Marker.ASTERISK &&\n level == Level.RULE &&\n seekingValue\n ) {\n // forward slash within a property after space, e.g. a{background:url(image.png) 0 0 /<--\n propertyToken.push([\n Token.PROPERTY_VALUE,\n character,\n [[position.line, position.column, position.source]]\n ]);\n\n buffer = [];\n } else if (\n character == Marker.COMMA &&\n level == Level.RULE &&\n seekingValue &&\n buffer.length > 0\n ) {\n // comma within a property, e.g. a{background:url(image.png),<--\n serializedBuffer = buffer.join(\"\").trim();\n propertyToken.push([\n Token.PROPERTY_VALUE,\n serializedBuffer,\n [originalMetadata(metadata, serializedBuffer, externalContext)]\n ]);\n propertyToken.push([\n Token.PROPERTY_VALUE,\n character,\n [[position.line, position.column, position.source]]\n ]);\n\n buffer = [];\n } else if (\n character == Marker.COMMA &&\n level == Level.RULE &&\n seekingValue\n ) {\n // comma within a property after space, e.g. a{background:url(image.png) ,<--\n propertyToken.push([\n Token.PROPERTY_VALUE,\n character,\n [[position.line, position.column, position.source]]\n ]);\n\n buffer = [];\n } else if (\n character == Marker.CLOSE_SQUARE_BRACKET &&\n propertyToken &&\n propertyToken.length > 1 &&\n buffer.length > 0 &&\n isRepeatToken(buffer)\n ) {\n buffer.push(character);\n serializedBuffer = buffer.join(\"\").trim();\n propertyToken[propertyToken.length - 1][1] += serializedBuffer;\n\n buffer = [];\n } else if (\n (isSpace || (isNewLineNix && !isNewLineWin)) &&\n level == Level.RULE &&\n seekingValue &&\n propertyToken &&\n buffer.length > 0\n ) {\n // space or *nix newline within property, e.g. a{margin:0 <--\n serializedBuffer = buffer.join(\"\").trim();\n propertyToken.push([\n Token.PROPERTY_VALUE,\n serializedBuffer,\n [originalMetadata(metadata, serializedBuffer, externalContext)]\n ]);\n\n buffer = [];\n } else if (\n isNewLineWin &&\n level == Level.RULE &&\n seekingValue &&\n propertyToken &&\n buffer.length > 1\n ) {\n // win newline within property, e.g. a{margin:0\\r\\n<--\n serializedBuffer = buffer.join(\"\").trim();\n propertyToken.push([\n Token.PROPERTY_VALUE,\n serializedBuffer,\n [originalMetadata(metadata, serializedBuffer, externalContext)]\n ]);\n\n buffer = [];\n } else if (isNewLineWin && level == Level.RULE && seekingValue) {\n // win newline\n buffer = [];\n } else if (buffer.length == 1 && isNewLineWin) {\n // ignore windows newline which is composed of two characters\n buffer.pop();\n } else if (\n buffer.length > 0 ||\n (!isSpace && !isNewLineNix && !isNewLineWin && !isCarriageReturn)\n ) {\n // any character\n buffer.push(character);\n }\n\n wasEscaped = isEscaped;\n isEscaped = !wasEscaped && character == Marker.BACK_SLASH;\n wasCommentStart = isCommentStart;\n wasCommentEnd = isCommentEnd;\n\n position.line =\n isNewLineWin || isNewLineNix || isCarriageReturn\n ? position.line + 1\n : position.line;\n position.column =\n isNewLineWin || isNewLineNix || isCarriageReturn\n ? 0\n : position.column + 1;\n }\n\n if (seekingValue) {\n externalContext.warnings.push(\n \"Missing '}' at \" +\n formatPosition([\n position.line,\n position.column,\n position.source\n ]) +\n \".\"\n );\n }\n\n if (seekingValue && buffer.length > 0) {\n serializedBuffer = buffer\n .join(\"\")\n .replace(TAIL_BROKEN_VALUE_PATTERN, \"\");\n propertyToken.push([\n Token.PROPERTY_VALUE,\n serializedBuffer,\n [originalMetadata(metadata, serializedBuffer, externalContext)]\n ]);\n\n buffer = [];\n }\n\n if (buffer.length > 0) {\n externalContext.warnings.push(\n \"Invalid character(s) '\" +\n buffer.join(\"\") +\n \"' at \" +\n formatPosition(metadata) +\n \". Ignoring.\"\n );\n }\n\n return allTokens;\n }\n\n function isIgnoreStartComment(buffer) {\n return IGNORE_START_COMMENT_PATTERN.test(\n buffer.join(\"\") + Marker.FORWARD_SLASH\n );\n }\n\n function isIgnoreEndComment(buffer) {\n return IGNORE_END_COMMENT_PATTERN.test(\n buffer.join(\"\") + Marker.FORWARD_SLASH\n );\n }\n\n function originalMetadata(\n metadata,\n value,\n externalContext,\n selectorFallbacks\n ) {\n var source = metadata[2];\n\n return externalContext.inputSourceMapTracker.isTracking(source)\n ? externalContext.inputSourceMapTracker.originalPositionFor(\n metadata,\n value.length,\n selectorFallbacks\n )\n : metadata;\n }\n\n function tokenTypeFrom(buffer) {\n var isAtRule =\n buffer[0] == Marker.AT || buffer[0] == Marker.UNDERSCORE;\n var ruleWord = buffer.join(\"\").split(RULE_WORD_SEPARATOR_PATTERN)[0];\n\n if (isAtRule && BLOCK_RULES.indexOf(ruleWord) > -1) {\n return Token.NESTED_BLOCK;\n } else if (isAtRule && AT_RULES.indexOf(ruleWord) > -1) {\n return Token.AT_RULE;\n } else if (isAtRule) {\n return Token.AT_RULE_BLOCK;\n } else {\n return Token.RULE;\n }\n }\n\n function tokenScopeFrom(tokenType) {\n if (tokenType == Token.RULE) {\n return Token.RULE_SCOPE;\n } else if (tokenType == Token.NESTED_BLOCK) {\n return Token.NESTED_BLOCK_SCOPE;\n } else if (tokenType == Token.AT_RULE_BLOCK) {\n return Token.AT_RULE_BLOCK_SCOPE;\n }\n }\n\n function isPageMarginBox(buffer) {\n var serializedBuffer = buffer.join(\"\").trim();\n\n return (\n PAGE_MARGIN_BOXES.indexOf(serializedBuffer) > -1 ||\n EXTRA_PAGE_BOXES.indexOf(serializedBuffer) > -1\n );\n }\n\n function isRepeatToken(buffer) {\n return REPEAT_PATTERN.test(\n buffer.join(\"\") + Marker.CLOSE_SQUARE_BRACKET\n );\n }\n\n module.exports = tokenize;\n },\n { \"../utils/format-position\": 87, \"./marker\": 83, \"./token\": 84 }\n ],\n 86: [\n function(require, module, exports) {\n function cloneArray(array) {\n var cloned = array.slice(0);\n\n for (var i = 0, l = cloned.length; i < l; i++) {\n if (Array.isArray(cloned[i])) cloned[i] = cloneArray(cloned[i]);\n }\n\n return cloned;\n }\n\n module.exports = cloneArray;\n },\n {}\n ],\n 87: [\n function(require, module, exports) {\n function formatPosition(metadata) {\n var line = metadata[0];\n var column = metadata[1];\n var source = metadata[2];\n\n return source\n ? source + \":\" + line + \":\" + column\n : line + \":\" + column;\n }\n\n module.exports = formatPosition;\n },\n {}\n ],\n 88: [\n function(require, module, exports) {\n var NO_PROTOCOL_RESOURCE_PATTERN = /^\\/\\//;\n\n function hasProtocol(uri) {\n return !NO_PROTOCOL_RESOURCE_PATTERN.test(uri);\n }\n\n module.exports = hasProtocol;\n },\n {}\n ],\n 89: [\n function(require, module, exports) {\n var DATA_URI_PATTERN = /^data:(\\S*?)?(;charset=[^;]+)?(;[^,]+?)?,(.+)/;\n\n function isDataUriResource(uri) {\n return DATA_URI_PATTERN.test(uri);\n }\n\n module.exports = isDataUriResource;\n },\n {}\n ],\n 90: [\n function(require, module, exports) {\n var HTTP_RESOURCE_PATTERN = /^http:\\/\\//;\n\n function isHttpResource(uri) {\n return HTTP_RESOURCE_PATTERN.test(uri);\n }\n\n module.exports = isHttpResource;\n },\n {}\n ],\n 91: [\n function(require, module, exports) {\n var HTTPS_RESOURCE_PATTERN = /^https:\\/\\//;\n\n function isHttpsResource(uri) {\n return HTTPS_RESOURCE_PATTERN.test(uri);\n }\n\n module.exports = isHttpsResource;\n },\n {}\n ],\n 92: [\n function(require, module, exports) {\n var IMPORT_PREFIX_PATTERN = /^@import/i;\n\n function isImport(value) {\n return IMPORT_PREFIX_PATTERN.test(value);\n }\n\n module.exports = isImport;\n },\n {}\n ],\n 93: [\n function(require, module, exports) {\n var REMOTE_RESOURCE_PATTERN = /^(\\w+:\\/\\/|\\/\\/)/;\n\n function isRemoteResource(uri) {\n return REMOTE_RESOURCE_PATTERN.test(uri);\n }\n\n module.exports = isRemoteResource;\n },\n {}\n ],\n 94: [\n function(require, module, exports) {\n // adapted from http://nedbatchelder.com/blog/200712.html#e20071211T054956\n\n var NUMBER_PATTERN = /([0-9]+)/;\n\n function naturalCompare(value1, value2) {\n var keys1 = (\"\" + value1).split(NUMBER_PATTERN).map(tryParseInt);\n var keys2 = (\"\" + value2).split(NUMBER_PATTERN).map(tryParseInt);\n var key1;\n var key2;\n var compareFirst = Math.min(keys1.length, keys2.length);\n var i, l;\n\n for (i = 0, l = compareFirst; i < l; i++) {\n key1 = keys1[i];\n key2 = keys2[i];\n\n if (key1 != key2) {\n return key1 > key2 ? 1 : -1;\n }\n }\n\n return keys1.length > keys2.length\n ? 1\n : keys1.length == keys2.length\n ? 0\n : -1;\n }\n\n function tryParseInt(value) {\n return \"\" + parseInt(value) == value ? parseInt(value) : value;\n }\n\n module.exports = naturalCompare;\n },\n {}\n ],\n 95: [\n function(require, module, exports) {\n function override(source1, source2) {\n var target = {};\n var key1;\n var key2;\n var item;\n\n for (key1 in source1) {\n item = source1[key1];\n\n if (Array.isArray(item)) {\n target[key1] = item.slice(0);\n } else if (typeof item == \"object\" && item !== null) {\n target[key1] = override(item, {});\n } else {\n target[key1] = item;\n }\n }\n\n for (key2 in source2) {\n item = source2[key2];\n\n if (key2 in target && Array.isArray(item)) {\n target[key2] = item.slice(0);\n } else if (\n key2 in target &&\n typeof item == \"object\" &&\n item !== null\n ) {\n target[key2] = override(target[key2], item);\n } else {\n target[key2] = item;\n }\n }\n\n return target;\n }\n\n module.exports = override;\n },\n {}\n ],\n 96: [\n function(require, module, exports) {\n var Marker = require(\"../tokenizer/marker\");\n\n function split(value, separator) {\n var openLevel = Marker.OPEN_ROUND_BRACKET;\n var closeLevel = Marker.CLOSE_ROUND_BRACKET;\n var level = 0;\n var cursor = 0;\n var lastStart = 0;\n var lastValue;\n var lastCharacter;\n var len = value.length;\n var parts = [];\n\n if (value.indexOf(separator) == -1) {\n return [value];\n }\n\n if (value.indexOf(openLevel) == -1) {\n return value.split(separator);\n }\n\n while (cursor < len) {\n if (value[cursor] == openLevel) {\n level++;\n } else if (value[cursor] == closeLevel) {\n level--;\n }\n\n if (\n level === 0 &&\n cursor > 0 &&\n cursor + 1 < len &&\n value[cursor] == separator\n ) {\n parts.push(value.substring(lastStart, cursor));\n lastStart = cursor + 1;\n }\n\n cursor++;\n }\n\n if (lastStart < cursor + 1) {\n lastValue = value.substring(lastStart);\n lastCharacter = lastValue[lastValue.length - 1];\n if (lastCharacter == separator) {\n lastValue = lastValue.substring(0, lastValue.length - 1);\n }\n\n parts.push(lastValue);\n }\n\n return parts;\n }\n\n module.exports = split;\n },\n { \"../tokenizer/marker\": 83 }\n ],\n 97: [\n function(require, module, exports) {\n var emptyCharacter = \"\";\n\n var Breaks = require(\"../options/format\").Breaks;\n var Spaces = require(\"../options/format\").Spaces;\n\n var Marker = require(\"../tokenizer/marker\");\n var Token = require(\"../tokenizer/token\");\n\n function supportsAfterClosingBrace(token) {\n return (\n token[1][1] == \"background\" ||\n token[1][1] == \"transform\" ||\n token[1][1] == \"src\"\n );\n }\n\n function afterClosingBrace(token, valueIndex) {\n return (\n token[valueIndex][1][token[valueIndex][1].length - 1] ==\n Marker.CLOSE_ROUND_BRACKET\n );\n }\n\n function afterComma(token, valueIndex) {\n return token[valueIndex][1] == Marker.COMMA;\n }\n\n function afterSlash(token, valueIndex) {\n return token[valueIndex][1] == Marker.FORWARD_SLASH;\n }\n\n function beforeComma(token, valueIndex) {\n return (\n token[valueIndex + 1] && token[valueIndex + 1][1] == Marker.COMMA\n );\n }\n\n function beforeSlash(token, valueIndex) {\n return (\n token[valueIndex + 1] &&\n token[valueIndex + 1][1] == Marker.FORWARD_SLASH\n );\n }\n\n function inFilter(token) {\n return token[1][1] == \"filter\" || token[1][1] == \"-ms-filter\";\n }\n\n function disallowsSpace(context, token, valueIndex) {\n return (\n (!context.spaceAfterClosingBrace &&\n supportsAfterClosingBrace(token) &&\n afterClosingBrace(token, valueIndex)) ||\n beforeSlash(token, valueIndex) ||\n afterSlash(token, valueIndex) ||\n beforeComma(token, valueIndex) ||\n afterComma(token, valueIndex)\n );\n }\n\n function rules(context, tokens) {\n var store = context.store;\n\n for (var i = 0, l = tokens.length; i < l; i++) {\n store(context, tokens[i]);\n\n if (i < l - 1) {\n store(context, comma(context));\n }\n }\n }\n\n function body(context, tokens) {\n var lastPropertyAt = lastPropertyIndex(tokens);\n\n for (var i = 0, l = tokens.length; i < l; i++) {\n property(context, tokens, i, lastPropertyAt);\n }\n }\n\n function lastPropertyIndex(tokens) {\n var index = tokens.length - 1;\n\n for (; index >= 0; index--) {\n if (tokens[index][0] != Token.COMMENT) {\n break;\n }\n }\n\n return index;\n }\n\n function property(context, tokens, position, lastPropertyAt) {\n var store = context.store;\n var token = tokens[position];\n var isPropertyBlock = token[2][0] == Token.PROPERTY_BLOCK;\n\n var needsSemicolon;\n if (context.format) {\n if (context.format.semicolonAfterLastProperty || isPropertyBlock) {\n needsSemicolon = true;\n } else if (position < lastPropertyAt) {\n needsSemicolon = true;\n } else {\n needsSemicolon = false;\n }\n } else {\n needsSemicolon = position < lastPropertyAt || isPropertyBlock;\n }\n\n var isLast = position === lastPropertyAt;\n\n switch (token[0]) {\n case Token.AT_RULE:\n store(context, token);\n store(context, semicolon(context, Breaks.AfterProperty, false));\n break;\n case Token.AT_RULE_BLOCK:\n rules(context, token[1]);\n store(context, openBrace(context, Breaks.AfterRuleBegins, true));\n body(context, token[2]);\n store(\n context,\n closeBrace(context, Breaks.AfterRuleEnds, false, isLast)\n );\n break;\n case Token.COMMENT:\n store(context, token);\n break;\n case Token.PROPERTY:\n store(context, token[1]);\n store(context, colon(context));\n value(context, token);\n store(\n context,\n needsSemicolon\n ? semicolon(context, Breaks.AfterProperty, isLast)\n : emptyCharacter\n );\n break;\n case Token.RAW:\n store(context, token);\n }\n }\n\n function value(context, token) {\n var store = context.store;\n var j, m;\n\n if (token[2][0] == Token.PROPERTY_BLOCK) {\n store(context, openBrace(context, Breaks.AfterBlockBegins, false));\n body(context, token[2][1]);\n store(\n context,\n closeBrace(context, Breaks.AfterBlockEnds, false, true)\n );\n } else {\n for (j = 2, m = token.length; j < m; j++) {\n store(context, token[j]);\n\n if (\n j < m - 1 &&\n (inFilter(token) || !disallowsSpace(context, token, j))\n ) {\n store(context, Marker.SPACE);\n }\n }\n }\n }\n\n function allowsBreak(context, where) {\n return context.format && context.format.breaks[where];\n }\n\n function allowsSpace(context, where) {\n return context.format && context.format.spaces[where];\n }\n\n function openBrace(context, where, needsPrefixSpace) {\n if (context.format) {\n context.indentBy += context.format.indentBy;\n context.indentWith = context.format.indentWith.repeat(\n context.indentBy\n );\n return (\n (needsPrefixSpace &&\n allowsSpace(context, Spaces.BeforeBlockBegins)\n ? Marker.SPACE\n : emptyCharacter) +\n Marker.OPEN_CURLY_BRACKET +\n (allowsBreak(context, where)\n ? context.format.breakWith\n : emptyCharacter) +\n context.indentWith\n );\n } else {\n return Marker.OPEN_CURLY_BRACKET;\n }\n }\n\n function closeBrace(context, where, beforeBlockEnd, isLast) {\n if (context.format) {\n context.indentBy -= context.format.indentBy;\n context.indentWith = context.format.indentWith.repeat(\n context.indentBy\n );\n return (\n (allowsBreak(context, Breaks.AfterProperty) ||\n (beforeBlockEnd && allowsBreak(context, Breaks.BeforeBlockEnds))\n ? context.format.breakWith\n : emptyCharacter) +\n context.indentWith +\n Marker.CLOSE_CURLY_BRACKET +\n (isLast\n ? emptyCharacter\n : (allowsBreak(context, where)\n ? context.format.breakWith\n : emptyCharacter) + context.indentWith)\n );\n } else {\n return Marker.CLOSE_CURLY_BRACKET;\n }\n }\n\n function colon(context) {\n return context.format\n ? Marker.COLON +\n (allowsSpace(context, Spaces.BeforeValue)\n ? Marker.SPACE\n : emptyCharacter)\n : Marker.COLON;\n }\n\n function semicolon(context, where, isLast) {\n return context.format\n ? Marker.SEMICOLON +\n (isLast || !allowsBreak(context, where)\n ? emptyCharacter\n : context.format.breakWith + context.indentWith)\n : Marker.SEMICOLON;\n }\n\n function comma(context) {\n return context.format\n ? Marker.COMMA +\n (allowsBreak(context, Breaks.BetweenSelectors)\n ? context.format.breakWith\n : emptyCharacter) +\n context.indentWith\n : Marker.COMMA;\n }\n\n function all(context, tokens) {\n var store = context.store;\n var token;\n var isLast;\n var i, l;\n\n for (i = 0, l = tokens.length; i < l; i++) {\n token = tokens[i];\n isLast = i == l - 1;\n\n switch (token[0]) {\n case Token.AT_RULE:\n store(context, token);\n store(context, semicolon(context, Breaks.AfterAtRule, isLast));\n break;\n case Token.AT_RULE_BLOCK:\n rules(context, token[1]);\n store(\n context,\n openBrace(context, Breaks.AfterRuleBegins, true)\n );\n body(context, token[2]);\n store(\n context,\n closeBrace(context, Breaks.AfterRuleEnds, false, isLast)\n );\n break;\n case Token.NESTED_BLOCK:\n rules(context, token[1]);\n store(\n context,\n openBrace(context, Breaks.AfterBlockBegins, true)\n );\n all(context, token[2]);\n store(\n context,\n closeBrace(context, Breaks.AfterBlockEnds, true, isLast)\n );\n break;\n case Token.COMMENT:\n store(context, token);\n store(\n context,\n allowsBreak(context, Breaks.AfterComment)\n ? context.format.breakWith\n : emptyCharacter\n );\n break;\n case Token.RAW:\n store(context, token);\n break;\n case Token.RULE:\n rules(context, token[1]);\n store(\n context,\n openBrace(context, Breaks.AfterRuleBegins, true)\n );\n body(context, token[2]);\n store(\n context,\n closeBrace(context, Breaks.AfterRuleEnds, false, isLast)\n );\n break;\n }\n }\n }\n\n module.exports = {\n all: all,\n body: body,\n property: property,\n rules: rules,\n value: value\n };\n },\n {\n \"../options/format\": 61,\n \"../tokenizer/marker\": 83,\n \"../tokenizer/token\": 84\n }\n ],\n 98: [\n function(require, module, exports) {\n var helpers = require(\"./helpers\");\n\n function store(serializeContext, token) {\n serializeContext.output.push(\n typeof token == \"string\" ? token : token[1]\n );\n }\n\n function context() {\n var newContext = {\n output: [],\n store: store\n };\n\n return newContext;\n }\n\n function all(tokens) {\n var oneTimeContext = context();\n helpers.all(oneTimeContext, tokens);\n return oneTimeContext.output.join(\"\");\n }\n\n function body(tokens) {\n var oneTimeContext = context();\n helpers.body(oneTimeContext, tokens);\n return oneTimeContext.output.join(\"\");\n }\n\n function property(tokens, position) {\n var oneTimeContext = context();\n helpers.property(oneTimeContext, tokens, position, true);\n return oneTimeContext.output.join(\"\");\n }\n\n function rules(tokens) {\n var oneTimeContext = context();\n helpers.rules(oneTimeContext, tokens);\n return oneTimeContext.output.join(\"\");\n }\n\n function value(tokens) {\n var oneTimeContext = context();\n helpers.value(oneTimeContext, tokens);\n return oneTimeContext.output.join(\"\");\n }\n\n module.exports = {\n all: all,\n body: body,\n property: property,\n rules: rules,\n value: value\n };\n },\n { \"./helpers\": 97 }\n ],\n 99: [\n function(require, module, exports) {\n var all = require(\"./helpers\").all;\n\n function store(serializeContext, token) {\n var value = typeof token == \"string\" ? token : token[1];\n var wrap = serializeContext.wrap;\n\n wrap(serializeContext, value);\n track(serializeContext, value);\n serializeContext.output.push(value);\n }\n\n function wrap(serializeContext, value) {\n if (\n serializeContext.column + value.length >\n serializeContext.format.wrapAt\n ) {\n track(serializeContext, serializeContext.format.breakWith);\n serializeContext.output.push(serializeContext.format.breakWith);\n }\n }\n\n function track(serializeContext, value) {\n var parts = value.split(\"\\n\");\n\n serializeContext.line += parts.length - 1;\n serializeContext.column =\n parts.length > 1 ? 0 : serializeContext.column + parts.pop().length;\n }\n\n function serializeStyles(tokens, context) {\n var serializeContext = {\n column: 0,\n format: context.options.format,\n indentBy: 0,\n indentWith: \"\",\n line: 1,\n output: [],\n spaceAfterClosingBrace:\n context.options.compatibility.properties.spaceAfterClosingBrace,\n store: store,\n wrap: context.options.format.wrapAt\n ? wrap\n : function() {\n /* noop */\n }\n };\n\n all(serializeContext, tokens);\n\n return {\n styles: serializeContext.output.join(\"\")\n };\n }\n\n module.exports = serializeStyles;\n },\n { \"./helpers\": 97 }\n ],\n 100: [\n function(require, module, exports) {\n (function(process) {\n var SourceMapGenerator = require(\"source-map\").SourceMapGenerator;\n var all = require(\"./helpers\").all;\n\n var isRemoteResource = require(\"../utils/is-remote-resource\");\n\n var isWindows = process.platform == \"win32\";\n\n var NIX_SEPARATOR_PATTERN = /\\//g;\n var UNKNOWN_SOURCE = \"$stdin\";\n var WINDOWS_SEPARATOR = \"\\\\\";\n\n function store(serializeContext, element) {\n var fromString = typeof element == \"string\";\n var value = fromString ? element : element[1];\n var mappings = fromString ? null : element[2];\n var wrap = serializeContext.wrap;\n\n wrap(serializeContext, value);\n track(serializeContext, value, mappings);\n serializeContext.output.push(value);\n }\n\n function wrap(serializeContext, value) {\n if (\n serializeContext.column + value.length >\n serializeContext.format.wrapAt\n ) {\n track(serializeContext, serializeContext.format.breakWith, false);\n serializeContext.output.push(serializeContext.format.breakWith);\n }\n }\n\n function track(serializeContext, value, mappings) {\n var parts = value.split(\"\\n\");\n\n if (mappings) {\n trackAllMappings(serializeContext, mappings);\n }\n\n serializeContext.line += parts.length - 1;\n serializeContext.column =\n parts.length > 1\n ? 0\n : serializeContext.column + parts.pop().length;\n }\n\n function trackAllMappings(serializeContext, mappings) {\n for (var i = 0, l = mappings.length; i < l; i++) {\n trackMapping(serializeContext, mappings[i]);\n }\n }\n\n function trackMapping(serializeContext, mapping) {\n var line = mapping[0];\n var column = mapping[1];\n var originalSource = mapping[2];\n var source = originalSource;\n var storedSource = source || UNKNOWN_SOURCE;\n\n if (isWindows && source && !isRemoteResource(source)) {\n storedSource = source.replace(\n NIX_SEPARATOR_PATTERN,\n WINDOWS_SEPARATOR\n );\n }\n\n serializeContext.outputMap.addMapping({\n generated: {\n line: serializeContext.line,\n column: serializeContext.column\n },\n source: storedSource,\n original: {\n line: line,\n column: column\n }\n });\n\n if (\n serializeContext.inlineSources &&\n originalSource in serializeContext.sourcesContent\n ) {\n serializeContext.outputMap.setSourceContent(\n storedSource,\n serializeContext.sourcesContent[originalSource]\n );\n }\n }\n\n function serializeStylesAndSourceMap(tokens, context) {\n var serializeContext = {\n column: 0,\n format: context.options.format,\n indentBy: 0,\n indentWith: \"\",\n inlineSources: context.options.sourceMapInlineSources,\n line: 1,\n output: [],\n outputMap: new SourceMapGenerator(),\n sourcesContent: context.sourcesContent,\n spaceAfterClosingBrace:\n context.options.compatibility.properties.spaceAfterClosingBrace,\n store: store,\n wrap: context.options.format.wrapAt\n ? wrap\n : function() {\n /* noop */\n }\n };\n\n all(serializeContext, tokens);\n\n return {\n sourceMap: serializeContext.outputMap,\n styles: serializeContext.output.join(\"\")\n };\n }\n\n module.exports = serializeStylesAndSourceMap;\n }.call(this, require(\"_process\")));\n },\n {\n \"../utils/is-remote-resource\": 93,\n \"./helpers\": 97,\n _process: 112,\n \"source-map\": 155\n }\n ],\n 101: [\n function(require, module, exports) {\n (function(Buffer) {\n // Copyright Joyent, Inc. and other Node contributors.\n //\n // Permission is hereby granted, free of charge, to any person obtaining a\n // copy of this software and associated documentation files (the\n // \"Software\"), to deal in the Software without restriction, including\n // without limitation the rights to use, copy, modify, merge, publish,\n // distribute, sublicense, and/or sell copies of the Software, and to permit\n // persons to whom the Software is furnished to do so, subject to the\n // following conditions:\n //\n // The above copyright notice and this permission notice shall be included\n // in all copies or substantial portions of the Software.\n //\n // THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n // OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n // MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n // NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n // DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n // OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n // USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n // NOTE: These type checking functions intentionally don't use `instanceof`\n // because it is fragile and can be easily faked with `Object.create()`.\n\n function isArray(arg) {\n if (Array.isArray) {\n return Array.isArray(arg);\n }\n return objectToString(arg) === \"[object Array]\";\n }\n exports.isArray = isArray;\n\n function isBoolean(arg) {\n return typeof arg === \"boolean\";\n }\n exports.isBoolean = isBoolean;\n\n function isNull(arg) {\n return arg === null;\n }\n exports.isNull = isNull;\n\n function isNullOrUndefined(arg) {\n return arg == null;\n }\n exports.isNullOrUndefined = isNullOrUndefined;\n\n function isNumber(arg) {\n return typeof arg === \"number\";\n }\n exports.isNumber = isNumber;\n\n function isString(arg) {\n return typeof arg === \"string\";\n }\n exports.isString = isString;\n\n function isSymbol(arg) {\n return typeof arg === \"symbol\";\n }\n exports.isSymbol = isSymbol;\n\n function isUndefined(arg) {\n return arg === void 0;\n }\n exports.isUndefined = isUndefined;\n\n function isRegExp(re) {\n return objectToString(re) === \"[object RegExp]\";\n }\n exports.isRegExp = isRegExp;\n\n function isObject(arg) {\n return typeof arg === \"object\" && arg !== null;\n }\n exports.isObject = isObject;\n\n function isDate(d) {\n return objectToString(d) === \"[object Date]\";\n }\n exports.isDate = isDate;\n\n function isError(e) {\n return objectToString(e) === \"[object Error]\" || e instanceof Error;\n }\n exports.isError = isError;\n\n function isFunction(arg) {\n return typeof arg === \"function\";\n }\n exports.isFunction = isFunction;\n\n function isPrimitive(arg) {\n return (\n arg === null ||\n typeof arg === \"boolean\" ||\n typeof arg === \"number\" ||\n typeof arg === \"string\" ||\n typeof arg === \"symbol\" || // ES6 symbol\n typeof arg === \"undefined\"\n );\n }\n exports.isPrimitive = isPrimitive;\n\n exports.isBuffer = Buffer.isBuffer;\n\n function objectToString(o) {\n return Object.prototype.toString.call(o);\n }\n }.call(this, { isBuffer: require(\"../../is-buffer/index.js\") }));\n },\n { \"../../is-buffer/index.js\": 107 }\n ],\n 102: [\n function(require, module, exports) {\n // Copyright Joyent, Inc. and other Node contributors.\n //\n // Permission is hereby granted, free of charge, to any person obtaining a\n // copy of this software and associated documentation files (the\n // \"Software\"), to deal in the Software without restriction, including\n // without limitation the rights to use, copy, modify, merge, publish,\n // distribute, sublicense, and/or sell copies of the Software, and to permit\n // persons to whom the Software is furnished to do so, subject to the\n // following conditions:\n //\n // The above copyright notice and this permission notice shall be included\n // in all copies or substantial portions of the Software.\n //\n // THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n // OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n // MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n // NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n // DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n // OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n // USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n var objectCreate = Object.create || objectCreatePolyfill;\n var objectKeys = Object.keys || objectKeysPolyfill;\n var bind = Function.prototype.bind || functionBindPolyfill;\n\n function EventEmitter() {\n if (\n !this._events ||\n !Object.prototype.hasOwnProperty.call(this, \"_events\")\n ) {\n this._events = objectCreate(null);\n this._eventsCount = 0;\n }\n\n this._maxListeners = this._maxListeners || undefined;\n }\n module.exports = EventEmitter;\n\n // Backwards-compat with node 0.10.x\n EventEmitter.EventEmitter = EventEmitter;\n\n EventEmitter.prototype._events = undefined;\n EventEmitter.prototype._maxListeners = undefined;\n\n // By default EventEmitters will print a warning if more than 10 listeners are\n // added to it. This is a useful default which helps finding memory leaks.\n var defaultMaxListeners = 10;\n\n var hasDefineProperty;\n try {\n var o = {};\n if (Object.defineProperty)\n Object.defineProperty(o, \"x\", { value: 0 });\n hasDefineProperty = o.x === 0;\n } catch (err) {\n hasDefineProperty = false;\n }\n if (hasDefineProperty) {\n Object.defineProperty(EventEmitter, \"defaultMaxListeners\", {\n enumerable: true,\n get: function() {\n return defaultMaxListeners;\n },\n set: function(arg) {\n // check whether the input is a positive number (whose value is zero or\n // greater and not a NaN).\n if (typeof arg !== \"number\" || arg < 0 || arg !== arg)\n throw new TypeError(\n '\"defaultMaxListeners\" must be a positive number'\n );\n defaultMaxListeners = arg;\n }\n });\n } else {\n EventEmitter.defaultMaxListeners = defaultMaxListeners;\n }\n\n // Obviously not all Emitters should be limited to 10. This function allows\n // that to be increased. Set to zero for unlimited.\n EventEmitter.prototype.setMaxListeners = function setMaxListeners(n) {\n if (typeof n !== \"number\" || n < 0 || isNaN(n))\n throw new TypeError('\"n\" argument must be a positive number');\n this._maxListeners = n;\n return this;\n };\n\n function $getMaxListeners(that) {\n if (that._maxListeners === undefined)\n return EventEmitter.defaultMaxListeners;\n return that._maxListeners;\n }\n\n EventEmitter.prototype.getMaxListeners = function getMaxListeners() {\n return $getMaxListeners(this);\n };\n\n // These standalone emit* functions are used to optimize calling of event\n // handlers for fast cases because emit() itself often has a variable number of\n // arguments and can be deoptimized because of that. These functions always have\n // the same number of arguments and thus do not get deoptimized, so the code\n // inside them can execute faster.\n function emitNone(handler, isFn, self) {\n if (isFn) handler.call(self);\n else {\n var len = handler.length;\n var listeners = arrayClone(handler, len);\n for (var i = 0; i < len; ++i) listeners[i].call(self);\n }\n }\n function emitOne(handler, isFn, self, arg1) {\n if (isFn) handler.call(self, arg1);\n else {\n var len = handler.length;\n var listeners = arrayClone(handler, len);\n for (var i = 0; i < len; ++i) listeners[i].call(self, arg1);\n }\n }\n function emitTwo(handler, isFn, self, arg1, arg2) {\n if (isFn) handler.call(self, arg1, arg2);\n else {\n var len = handler.length;\n var listeners = arrayClone(handler, len);\n for (var i = 0; i < len; ++i) listeners[i].call(self, arg1, arg2);\n }\n }\n function emitThree(handler, isFn, self, arg1, arg2, arg3) {\n if (isFn) handler.call(self, arg1, arg2, arg3);\n else {\n var len = handler.length;\n var listeners = arrayClone(handler, len);\n for (var i = 0; i < len; ++i)\n listeners[i].call(self, arg1, arg2, arg3);\n }\n }\n\n function emitMany(handler, isFn, self, args) {\n if (isFn) handler.apply(self, args);\n else {\n var len = handler.length;\n var listeners = arrayClone(handler, len);\n for (var i = 0; i < len; ++i) listeners[i].apply(self, args);\n }\n }\n\n EventEmitter.prototype.emit = function emit(type) {\n var er, handler, len, args, i, events;\n var doError = type === \"error\";\n\n events = this._events;\n if (events) doError = doError && events.error == null;\n else if (!doError) return false;\n\n // If there is no 'error' event listener then throw.\n if (doError) {\n if (arguments.length > 1) er = arguments[1];\n if (er instanceof Error) {\n throw er; // Unhandled 'error' event\n } else {\n // At least give some kind of context to the user\n var err = new Error('Unhandled \"error\" event. (' + er + \")\");\n err.context = er;\n throw err;\n }\n return false;\n }\n\n handler = events[type];\n\n if (!handler) return false;\n\n var isFn = typeof handler === \"function\";\n len = arguments.length;\n switch (len) {\n // fast cases\n case 1:\n emitNone(handler, isFn, this);\n break;\n case 2:\n emitOne(handler, isFn, this, arguments[1]);\n break;\n case 3:\n emitTwo(handler, isFn, this, arguments[1], arguments[2]);\n break;\n case 4:\n emitThree(\n handler,\n isFn,\n this,\n arguments[1],\n arguments[2],\n arguments[3]\n );\n break;\n // slower\n default:\n args = new Array(len - 1);\n for (i = 1; i < len; i++) args[i - 1] = arguments[i];\n emitMany(handler, isFn, this, args);\n }\n\n return true;\n };\n\n function _addListener(target, type, listener, prepend) {\n var m;\n var events;\n var existing;\n\n if (typeof listener !== \"function\")\n throw new TypeError('\"listener\" argument must be a function');\n\n events = target._events;\n if (!events) {\n events = target._events = objectCreate(null);\n target._eventsCount = 0;\n } else {\n // To avoid recursion in the case that type === \"newListener\"! Before\n // adding it to the listeners, first emit \"newListener\".\n if (events.newListener) {\n target.emit(\n \"newListener\",\n type,\n listener.listener ? listener.listener : listener\n );\n\n // Re-assign `events` because a newListener handler could have caused the\n // this._events to be assigned to a new object\n events = target._events;\n }\n existing = events[type];\n }\n\n if (!existing) {\n // Optimize the case of one listener. Don't need the extra array object.\n existing = events[type] = listener;\n ++target._eventsCount;\n } else {\n if (typeof existing === \"function\") {\n // Adding the second element, need to change to array.\n existing = events[type] = prepend\n ? [listener, existing]\n : [existing, listener];\n } else {\n // If we've already got an array, just append.\n if (prepend) {\n existing.unshift(listener);\n } else {\n existing.push(listener);\n }\n }\n\n // Check for listener leak\n if (!existing.warned) {\n m = $getMaxListeners(target);\n if (m && m > 0 && existing.length > m) {\n existing.warned = true;\n var w = new Error(\n \"Possible EventEmitter memory leak detected. \" +\n existing.length +\n ' \"' +\n String(type) +\n '\" listeners ' +\n \"added. Use emitter.setMaxListeners() to \" +\n \"increase limit.\"\n );\n w.name = \"MaxListenersExceededWarning\";\n w.emitter = target;\n w.type = type;\n w.count = existing.length;\n if (typeof console === \"object\" && console.warn) {\n console.warn(\"%s: %s\", w.name, w.message);\n }\n }\n }\n }\n\n return target;\n }\n\n EventEmitter.prototype.addListener = function addListener(\n type,\n listener\n ) {\n return _addListener(this, type, listener, false);\n };\n\n EventEmitter.prototype.on = EventEmitter.prototype.addListener;\n\n EventEmitter.prototype.prependListener = function prependListener(\n type,\n listener\n ) {\n return _addListener(this, type, listener, true);\n };\n\n function onceWrapper() {\n if (!this.fired) {\n this.target.removeListener(this.type, this.wrapFn);\n this.fired = true;\n switch (arguments.length) {\n case 0:\n return this.listener.call(this.target);\n case 1:\n return this.listener.call(this.target, arguments[0]);\n case 2:\n return this.listener.call(\n this.target,\n arguments[0],\n arguments[1]\n );\n case 3:\n return this.listener.call(\n this.target,\n arguments[0],\n arguments[1],\n arguments[2]\n );\n default:\n var args = new Array(arguments.length);\n for (var i = 0; i < args.length; ++i) args[i] = arguments[i];\n this.listener.apply(this.target, args);\n }\n }\n }\n\n function _onceWrap(target, type, listener) {\n var state = {\n fired: false,\n wrapFn: undefined,\n target: target,\n type: type,\n listener: listener\n };\n var wrapped = bind.call(onceWrapper, state);\n wrapped.listener = listener;\n state.wrapFn = wrapped;\n return wrapped;\n }\n\n EventEmitter.prototype.once = function once(type, listener) {\n if (typeof listener !== \"function\")\n throw new TypeError('\"listener\" argument must be a function');\n this.on(type, _onceWrap(this, type, listener));\n return this;\n };\n\n EventEmitter.prototype.prependOnceListener = function prependOnceListener(\n type,\n listener\n ) {\n if (typeof listener !== \"function\")\n throw new TypeError('\"listener\" argument must be a function');\n this.prependListener(type, _onceWrap(this, type, listener));\n return this;\n };\n\n // Emits a 'removeListener' event if and only if the listener was removed.\n EventEmitter.prototype.removeListener = function removeListener(\n type,\n listener\n ) {\n var list, events, position, i, originalListener;\n\n if (typeof listener !== \"function\")\n throw new TypeError('\"listener\" argument must be a function');\n\n events = this._events;\n if (!events) return this;\n\n list = events[type];\n if (!list) return this;\n\n if (list === listener || list.listener === listener) {\n if (--this._eventsCount === 0) this._events = objectCreate(null);\n else {\n delete events[type];\n if (events.removeListener)\n this.emit(\"removeListener\", type, list.listener || listener);\n }\n } else if (typeof list !== \"function\") {\n position = -1;\n\n for (i = list.length - 1; i >= 0; i--) {\n if (list[i] === listener || list[i].listener === listener) {\n originalListener = list[i].listener;\n position = i;\n break;\n }\n }\n\n if (position < 0) return this;\n\n if (position === 0) list.shift();\n else spliceOne(list, position);\n\n if (list.length === 1) events[type] = list[0];\n\n if (events.removeListener)\n this.emit(\"removeListener\", type, originalListener || listener);\n }\n\n return this;\n };\n\n EventEmitter.prototype.removeAllListeners = function removeAllListeners(\n type\n ) {\n var listeners, events, i;\n\n events = this._events;\n if (!events) return this;\n\n // not listening for removeListener, no need to emit\n if (!events.removeListener) {\n if (arguments.length === 0) {\n this._events = objectCreate(null);\n this._eventsCount = 0;\n } else if (events[type]) {\n if (--this._eventsCount === 0) this._events = objectCreate(null);\n else delete events[type];\n }\n return this;\n }\n\n // emit removeListener for all listeners on all events\n if (arguments.length === 0) {\n var keys = objectKeys(events);\n var key;\n for (i = 0; i < keys.length; ++i) {\n key = keys[i];\n if (key === \"removeListener\") continue;\n this.removeAllListeners(key);\n }\n this.removeAllListeners(\"removeListener\");\n this._events = objectCreate(null);\n this._eventsCount = 0;\n return this;\n }\n\n listeners = events[type];\n\n if (typeof listeners === \"function\") {\n this.removeListener(type, listeners);\n } else if (listeners) {\n // LIFO order\n for (i = listeners.length - 1; i >= 0; i--) {\n this.removeListener(type, listeners[i]);\n }\n }\n\n return this;\n };\n\n function _listeners(target, type, unwrap) {\n var events = target._events;\n\n if (!events) return [];\n\n var evlistener = events[type];\n if (!evlistener) return [];\n\n if (typeof evlistener === \"function\")\n return unwrap ? [evlistener.listener || evlistener] : [evlistener];\n\n return unwrap\n ? unwrapListeners(evlistener)\n : arrayClone(evlistener, evlistener.length);\n }\n\n EventEmitter.prototype.listeners = function listeners(type) {\n return _listeners(this, type, true);\n };\n\n EventEmitter.prototype.rawListeners = function rawListeners(type) {\n return _listeners(this, type, false);\n };\n\n EventEmitter.listenerCount = function(emitter, type) {\n if (typeof emitter.listenerCount === \"function\") {\n return emitter.listenerCount(type);\n } else {\n return listenerCount.call(emitter, type);\n }\n };\n\n EventEmitter.prototype.listenerCount = listenerCount;\n function listenerCount(type) {\n var events = this._events;\n\n if (events) {\n var evlistener = events[type];\n\n if (typeof evlistener === \"function\") {\n return 1;\n } else if (evlistener) {\n return evlistener.length;\n }\n }\n\n return 0;\n }\n\n EventEmitter.prototype.eventNames = function eventNames() {\n return this._eventsCount > 0 ? Reflect.ownKeys(this._events) : [];\n };\n\n // About 1.5x faster than the two-arg version of Array#splice().\n function spliceOne(list, index) {\n for (var i = index, k = i + 1, n = list.length; k < n; i += 1, k += 1)\n list[i] = list[k];\n list.pop();\n }\n\n function arrayClone(arr, n) {\n var copy = new Array(n);\n for (var i = 0; i < n; ++i) copy[i] = arr[i];\n return copy;\n }\n\n function unwrapListeners(arr) {\n var ret = new Array(arr.length);\n for (var i = 0; i < ret.length; ++i) {\n ret[i] = arr[i].listener || arr[i];\n }\n return ret;\n }\n\n function objectCreatePolyfill(proto) {\n var F = function() {};\n F.prototype = proto;\n return new F();\n }\n function objectKeysPolyfill(obj) {\n var keys = [];\n for (var k in obj)\n if (Object.prototype.hasOwnProperty.call(obj, k)) {\n keys.push(k);\n }\n return k;\n }\n function functionBindPolyfill(context) {\n var fn = this;\n return function() {\n return fn.apply(context, arguments);\n };\n }\n },\n {}\n ],\n 103: [\n function(require, module, exports) {\n (function(global) {\n /*! https://mths.be/he v1.2.0 by @mathias | MIT license */\n (function(root) {\n // Detect free variables `exports`.\n var freeExports = typeof exports == \"object\" && exports;\n\n // Detect free variable `module`.\n var freeModule =\n typeof module == \"object\" &&\n module &&\n module.exports == freeExports &&\n module;\n\n // Detect free variable `global`, from Node.js or Browserified code,\n // and use it as `root`.\n var freeGlobal = typeof global == \"object\" && global;\n if (\n freeGlobal.global === freeGlobal ||\n freeGlobal.window === freeGlobal\n ) {\n root = freeGlobal;\n }\n\n /*--------------------------------------------------------------------------*/\n\n // All astral symbols.\n var regexAstralSymbols = /[\\uD800-\\uDBFF][\\uDC00-\\uDFFF]/g;\n // All ASCII symbols (not just printable ASCII) except those listed in the\n // first column of the overrides table.\n // https://html.spec.whatwg.org/multipage/syntax.html#table-charref-overrides\n var regexAsciiWhitelist = /[\\x01-\\x7F]/g;\n // All BMP symbols that are not ASCII newlines, printable ASCII symbols, or\n // code points listed in the first column of the overrides table on\n // https://html.spec.whatwg.org/multipage/syntax.html#table-charref-overrides.\n var regexBmpWhitelist = /[\\x01-\\t\\x0B\\f\\x0E-\\x1F\\x7F\\x81\\x8D\\x8F\\x90\\x9D\\xA0-\\uFFFF]/g;\n\n var regexEncodeNonAscii = /<\\u20D2|=\\u20E5|>\\u20D2|\\u205F\\u200A|\\u219D\\u0338|\\u2202\\u0338|\\u2220\\u20D2|\\u2229\\uFE00|\\u222A\\uFE00|\\u223C\\u20D2|\\u223D\\u0331|\\u223E\\u0333|\\u2242\\u0338|\\u224B\\u0338|\\u224D\\u20D2|\\u224E\\u0338|\\u224F\\u0338|\\u2250\\u0338|\\u2261\\u20E5|\\u2264\\u20D2|\\u2265\\u20D2|\\u2266\\u0338|\\u2267\\u0338|\\u2268\\uFE00|\\u2269\\uFE00|\\u226A\\u0338|\\u226A\\u20D2|\\u226B\\u0338|\\u226B\\u20D2|\\u227F\\u0338|\\u2282\\u20D2|\\u2283\\u20D2|\\u228A\\uFE00|\\u228B\\uFE00|\\u228F\\u0338|\\u2290\\u0338|\\u2293\\uFE00|\\u2294\\uFE00|\\u22B4\\u20D2|\\u22B5\\u20D2|\\u22D8\\u0338|\\u22D9\\u0338|\\u22DA\\uFE00|\\u22DB\\uFE00|\\u22F5\\u0338|\\u22F9\\u0338|\\u2933\\u0338|\\u29CF\\u0338|\\u29D0\\u0338|\\u2A6D\\u0338|\\u2A70\\u0338|\\u2A7D\\u0338|\\u2A7E\\u0338|\\u2AA1\\u0338|\\u2AA2\\u0338|\\u2AAC\\uFE00|\\u2AAD\\uFE00|\\u2AAF\\u0338|\\u2AB0\\u0338|\\u2AC5\\u0338|\\u2AC6\\u0338|\\u2ACB\\uFE00|\\u2ACC\\uFE00|\\u2AFD\\u20E5|[\\xA0-\\u0113\\u0116-\\u0122\\u0124-\\u012B\\u012E-\\u014D\\u0150-\\u017E\\u0192\\u01B5\\u01F5\\u0237\\u02C6\\u02C7\\u02D8-\\u02DD\\u0311\\u0391-\\u03A1\\u03A3-\\u03A9\\u03B1-\\u03C9\\u03D1\\u03D2\\u03D5\\u03D6\\u03DC\\u03DD\\u03F0\\u03F1\\u03F5\\u03F6\\u0401-\\u040C\\u040E-\\u044F\\u0451-\\u045C\\u045E\\u045F\\u2002-\\u2005\\u2007-\\u2010\\u2013-\\u2016\\u2018-\\u201A\\u201C-\\u201E\\u2020-\\u2022\\u2025\\u2026\\u2030-\\u2035\\u2039\\u203A\\u203E\\u2041\\u2043\\u2044\\u204F\\u2057\\u205F-\\u2063\\u20AC\\u20DB\\u20DC\\u2102\\u2105\\u210A-\\u2113\\u2115-\\u211E\\u2122\\u2124\\u2127-\\u2129\\u212C\\u212D\\u212F-\\u2131\\u2133-\\u2138\\u2145-\\u2148\\u2153-\\u215E\\u2190-\\u219B\\u219D-\\u21A7\\u21A9-\\u21AE\\u21B0-\\u21B3\\u21B5-\\u21B7\\u21BA-\\u21DB\\u21DD\\u21E4\\u21E5\\u21F5\\u21FD-\\u2205\\u2207-\\u2209\\u220B\\u220C\\u220F-\\u2214\\u2216-\\u2218\\u221A\\u221D-\\u2238\\u223A-\\u2257\\u2259\\u225A\\u225C\\u225F-\\u2262\\u2264-\\u228B\\u228D-\\u229B\\u229D-\\u22A5\\u22A7-\\u22B0\\u22B2-\\u22BB\\u22BD-\\u22DB\\u22DE-\\u22E3\\u22E6-\\u22F7\\u22F9-\\u22FE\\u2305\\u2306\\u2308-\\u2310\\u2312\\u2313\\u2315\\u2316\\u231C-\\u231F\\u2322\\u2323\\u232D\\u232E\\u2336\\u233D\\u233F\\u237C\\u23B0\\u23B1\\u23B4-\\u23B6\\u23DC-\\u23DF\\u23E2\\u23E7\\u2423\\u24C8\\u2500\\u2502\\u250C\\u2510\\u2514\\u2518\\u251C\\u2524\\u252C\\u2534\\u253C\\u2550-\\u256C\\u2580\\u2584\\u2588\\u2591-\\u2593\\u25A1\\u25AA\\u25AB\\u25AD\\u25AE\\u25B1\\u25B3-\\u25B5\\u25B8\\u25B9\\u25BD-\\u25BF\\u25C2\\u25C3\\u25CA\\u25CB\\u25EC\\u25EF\\u25F8-\\u25FC\\u2605\\u2606\\u260E\\u2640\\u2642\\u2660\\u2663\\u2665\\u2666\\u266A\\u266D-\\u266F\\u2713\\u2717\\u2720\\u2736\\u2758\\u2772\\u2773\\u27C8\\u27C9\\u27E6-\\u27ED\\u27F5-\\u27FA\\u27FC\\u27FF\\u2902-\\u2905\\u290C-\\u2913\\u2916\\u2919-\\u2920\\u2923-\\u292A\\u2933\\u2935-\\u2939\\u293C\\u293D\\u2945\\u2948-\\u294B\\u294E-\\u2976\\u2978\\u2979\\u297B-\\u297F\\u2985\\u2986\\u298B-\\u2996\\u299A\\u299C\\u299D\\u29A4-\\u29B7\\u29B9\\u29BB\\u29BC\\u29BE-\\u29C5\\u29C9\\u29CD-\\u29D0\\u29DC-\\u29DE\\u29E3-\\u29E5\\u29EB\\u29F4\\u29F6\\u2A00-\\u2A02\\u2A04\\u2A06\\u2A0C\\u2A0D\\u2A10-\\u2A17\\u2A22-\\u2A27\\u2A29\\u2A2A\\u2A2D-\\u2A31\\u2A33-\\u2A3C\\u2A3F\\u2A40\\u2A42-\\u2A4D\\u2A50\\u2A53-\\u2A58\\u2A5A-\\u2A5D\\u2A5F\\u2A66\\u2A6A\\u2A6D-\\u2A75\\u2A77-\\u2A9A\\u2A9D-\\u2AA2\\u2AA4-\\u2AB0\\u2AB3-\\u2AC8\\u2ACB\\u2ACC\\u2ACF-\\u2ADB\\u2AE4\\u2AE6-\\u2AE9\\u2AEB-\\u2AF3\\u2AFD\\uFB00-\\uFB04]|\\uD835[\\uDC9C\\uDC9E\\uDC9F\\uDCA2\\uDCA5\\uDCA6\\uDCA9-\\uDCAC\\uDCAE-\\uDCB9\\uDCBB\\uDCBD-\\uDCC3\\uDCC5-\\uDCCF\\uDD04\\uDD05\\uDD07-\\uDD0A\\uDD0D-\\uDD14\\uDD16-\\uDD1C\\uDD1E-\\uDD39\\uDD3B-\\uDD3E\\uDD40-\\uDD44\\uDD46\\uDD4A-\\uDD50\\uDD52-\\uDD6B]/g;\n var encodeMap = {\n \"\\xAD\": \"shy\",\n \"\\u200C\": \"zwnj\",\n \"\\u200D\": \"zwj\",\n \"\\u200E\": \"lrm\",\n \"\\u2063\": \"ic\",\n \"\\u2062\": \"it\",\n \"\\u2061\": \"af\",\n \"\\u200F\": \"rlm\",\n \"\\u200B\": \"ZeroWidthSpace\",\n \"\\u2060\": \"NoBreak\",\n \"\\u0311\": \"DownBreve\",\n \"\\u20DB\": \"tdot\",\n \"\\u20DC\": \"DotDot\",\n \"\\t\": \"Tab\",\n \"\\n\": \"NewLine\",\n \"\\u2008\": \"puncsp\",\n \"\\u205F\": \"MediumSpace\",\n \"\\u2009\": \"thinsp\",\n \"\\u200A\": \"hairsp\",\n \"\\u2004\": \"emsp13\",\n \"\\u2002\": \"ensp\",\n \"\\u2005\": \"emsp14\",\n \"\\u2003\": \"emsp\",\n \"\\u2007\": \"numsp\",\n \"\\xA0\": \"nbsp\",\n \"\\u205F\\u200A\": \"ThickSpace\",\n \"\\u203E\": \"oline\",\n _: \"lowbar\",\n \"\\u2010\": \"dash\",\n \"\\u2013\": \"ndash\",\n \"\\u2014\": \"mdash\",\n \"\\u2015\": \"horbar\",\n \",\": \"comma\",\n \";\": \"semi\",\n \"\\u204F\": \"bsemi\",\n \":\": \"colon\",\n \"\\u2A74\": \"Colone\",\n \"!\": \"excl\",\n \"\\xA1\": \"iexcl\",\n \"?\": \"quest\",\n \"\\xBF\": \"iquest\",\n \".\": \"period\",\n \"\\u2025\": \"nldr\",\n \"\\u2026\": \"mldr\",\n \"\\xB7\": \"middot\",\n \"'\": \"apos\",\n \"\\u2018\": \"lsquo\",\n \"\\u2019\": \"rsquo\",\n \"\\u201A\": \"sbquo\",\n \"\\u2039\": \"lsaquo\",\n \"\\u203A\": \"rsaquo\",\n '\"': \"quot\",\n \"\\u201C\": \"ldquo\",\n \"\\u201D\": \"rdquo\",\n \"\\u201E\": \"bdquo\",\n \"\\xAB\": \"laquo\",\n \"\\xBB\": \"raquo\",\n \"(\": \"lpar\",\n \")\": \"rpar\",\n \"[\": \"lsqb\",\n \"]\": \"rsqb\",\n \"{\": \"lcub\",\n \"}\": \"rcub\",\n \"\\u2308\": \"lceil\",\n \"\\u2309\": \"rceil\",\n \"\\u230A\": \"lfloor\",\n \"\\u230B\": \"rfloor\",\n \"\\u2985\": \"lopar\",\n \"\\u2986\": \"ropar\",\n \"\\u298B\": \"lbrke\",\n \"\\u298C\": \"rbrke\",\n \"\\u298D\": \"lbrkslu\",\n \"\\u298E\": \"rbrksld\",\n \"\\u298F\": \"lbrksld\",\n \"\\u2990\": \"rbrkslu\",\n \"\\u2991\": \"langd\",\n \"\\u2992\": \"rangd\",\n \"\\u2993\": \"lparlt\",\n \"\\u2994\": \"rpargt\",\n \"\\u2995\": \"gtlPar\",\n \"\\u2996\": \"ltrPar\",\n \"\\u27E6\": \"lobrk\",\n \"\\u27E7\": \"robrk\",\n \"\\u27E8\": \"lang\",\n \"\\u27E9\": \"rang\",\n \"\\u27EA\": \"Lang\",\n \"\\u27EB\": \"Rang\",\n \"\\u27EC\": \"loang\",\n \"\\u27ED\": \"roang\",\n \"\\u2772\": \"lbbrk\",\n \"\\u2773\": \"rbbrk\",\n \"\\u2016\": \"Vert\",\n \"\\xA7\": \"sect\",\n \"\\xB6\": \"para\",\n \"@\": \"commat\",\n \"*\": \"ast\",\n \"/\": \"sol\",\n undefined: null,\n \"&\": \"amp\",\n \"#\": \"num\",\n \"%\": \"percnt\",\n \"\\u2030\": \"permil\",\n \"\\u2031\": \"pertenk\",\n \"\\u2020\": \"dagger\",\n \"\\u2021\": \"Dagger\",\n \"\\u2022\": \"bull\",\n \"\\u2043\": \"hybull\",\n \"\\u2032\": \"prime\",\n \"\\u2033\": \"Prime\",\n \"\\u2034\": \"tprime\",\n \"\\u2057\": \"qprime\",\n \"\\u2035\": \"bprime\",\n \"\\u2041\": \"caret\",\n \"`\": \"grave\",\n \"\\xB4\": \"acute\",\n \"\\u02DC\": \"tilde\",\n \"^\": \"Hat\",\n \"\\xAF\": \"macr\",\n \"\\u02D8\": \"breve\",\n \"\\u02D9\": \"dot\",\n \"\\xA8\": \"die\",\n \"\\u02DA\": \"ring\",\n \"\\u02DD\": \"dblac\",\n \"\\xB8\": \"cedil\",\n \"\\u02DB\": \"ogon\",\n ˆ: \"circ\",\n ˇ: \"caron\",\n \"\\xB0\": \"deg\",\n \"\\xA9\": \"copy\",\n \"\\xAE\": \"reg\",\n \"\\u2117\": \"copysr\",\n \"\\u2118\": \"wp\",\n \"\\u211E\": \"rx\",\n \"\\u2127\": \"mho\",\n \"\\u2129\": \"iiota\",\n \"\\u2190\": \"larr\",\n \"\\u219A\": \"nlarr\",\n \"\\u2192\": \"rarr\",\n \"\\u219B\": \"nrarr\",\n \"\\u2191\": \"uarr\",\n \"\\u2193\": \"darr\",\n \"\\u2194\": \"harr\",\n \"\\u21AE\": \"nharr\",\n \"\\u2195\": \"varr\",\n \"\\u2196\": \"nwarr\",\n \"\\u2197\": \"nearr\",\n \"\\u2198\": \"searr\",\n \"\\u2199\": \"swarr\",\n \"\\u219D\": \"rarrw\",\n \"\\u219D\\u0338\": \"nrarrw\",\n \"\\u219E\": \"Larr\",\n \"\\u219F\": \"Uarr\",\n \"\\u21A0\": \"Rarr\",\n \"\\u21A1\": \"Darr\",\n \"\\u21A2\": \"larrtl\",\n \"\\u21A3\": \"rarrtl\",\n \"\\u21A4\": \"mapstoleft\",\n \"\\u21A5\": \"mapstoup\",\n \"\\u21A6\": \"map\",\n \"\\u21A7\": \"mapstodown\",\n \"\\u21A9\": \"larrhk\",\n \"\\u21AA\": \"rarrhk\",\n \"\\u21AB\": \"larrlp\",\n \"\\u21AC\": \"rarrlp\",\n \"\\u21AD\": \"harrw\",\n \"\\u21B0\": \"lsh\",\n \"\\u21B1\": \"rsh\",\n \"\\u21B2\": \"ldsh\",\n \"\\u21B3\": \"rdsh\",\n \"\\u21B5\": \"crarr\",\n \"\\u21B6\": \"cularr\",\n \"\\u21B7\": \"curarr\",\n \"\\u21BA\": \"olarr\",\n \"\\u21BB\": \"orarr\",\n \"\\u21BC\": \"lharu\",\n \"\\u21BD\": \"lhard\",\n \"\\u21BE\": \"uharr\",\n \"\\u21BF\": \"uharl\",\n \"\\u21C0\": \"rharu\",\n \"\\u21C1\": \"rhard\",\n \"\\u21C2\": \"dharr\",\n \"\\u21C3\": \"dharl\",\n \"\\u21C4\": \"rlarr\",\n \"\\u21C5\": \"udarr\",\n \"\\u21C6\": \"lrarr\",\n \"\\u21C7\": \"llarr\",\n \"\\u21C8\": \"uuarr\",\n \"\\u21C9\": \"rrarr\",\n \"\\u21CA\": \"ddarr\",\n \"\\u21CB\": \"lrhar\",\n \"\\u21CC\": \"rlhar\",\n \"\\u21D0\": \"lArr\",\n \"\\u21CD\": \"nlArr\",\n \"\\u21D1\": \"uArr\",\n \"\\u21D2\": \"rArr\",\n \"\\u21CF\": \"nrArr\",\n \"\\u21D3\": \"dArr\",\n \"\\u21D4\": \"iff\",\n \"\\u21CE\": \"nhArr\",\n \"\\u21D5\": \"vArr\",\n \"\\u21D6\": \"nwArr\",\n \"\\u21D7\": \"neArr\",\n \"\\u21D8\": \"seArr\",\n \"\\u21D9\": \"swArr\",\n \"\\u21DA\": \"lAarr\",\n \"\\u21DB\": \"rAarr\",\n \"\\u21DD\": \"zigrarr\",\n \"\\u21E4\": \"larrb\",\n \"\\u21E5\": \"rarrb\",\n \"\\u21F5\": \"duarr\",\n \"\\u21FD\": \"loarr\",\n \"\\u21FE\": \"roarr\",\n \"\\u21FF\": \"hoarr\",\n \"\\u2200\": \"forall\",\n \"\\u2201\": \"comp\",\n \"\\u2202\": \"part\",\n \"\\u2202\\u0338\": \"npart\",\n \"\\u2203\": \"exist\",\n \"\\u2204\": \"nexist\",\n \"\\u2205\": \"empty\",\n \"\\u2207\": \"Del\",\n \"\\u2208\": \"in\",\n \"\\u2209\": \"notin\",\n \"\\u220B\": \"ni\",\n \"\\u220C\": \"notni\",\n \"\\u03F6\": \"bepsi\",\n \"\\u220F\": \"prod\",\n \"\\u2210\": \"coprod\",\n \"\\u2211\": \"sum\",\n \"+\": \"plus\",\n \"\\xB1\": \"pm\",\n \"\\xF7\": \"div\",\n \"\\xD7\": \"times\",\n \"<\": \"lt\",\n \"\\u226E\": \"nlt\",\n \"<\\u20D2\": \"nvlt\",\n \"=\": \"equals\",\n \"\\u2260\": \"ne\",\n \"=\\u20E5\": \"bne\",\n \"\\u2A75\": \"Equal\",\n \">\": \"gt\",\n \"\\u226F\": \"ngt\",\n \">\\u20D2\": \"nvgt\",\n \"\\xAC\": \"not\",\n \"|\": \"vert\",\n \"\\xA6\": \"brvbar\",\n \"\\u2212\": \"minus\",\n \"\\u2213\": \"mp\",\n \"\\u2214\": \"plusdo\",\n \"\\u2044\": \"frasl\",\n \"\\u2216\": \"setmn\",\n \"\\u2217\": \"lowast\",\n \"\\u2218\": \"compfn\",\n \"\\u221A\": \"Sqrt\",\n \"\\u221D\": \"prop\",\n \"\\u221E\": \"infin\",\n \"\\u221F\": \"angrt\",\n \"\\u2220\": \"ang\",\n \"\\u2220\\u20D2\": \"nang\",\n \"\\u2221\": \"angmsd\",\n \"\\u2222\": \"angsph\",\n \"\\u2223\": \"mid\",\n \"\\u2224\": \"nmid\",\n \"\\u2225\": \"par\",\n \"\\u2226\": \"npar\",\n \"\\u2227\": \"and\",\n \"\\u2228\": \"or\",\n \"\\u2229\": \"cap\",\n \"\\u2229\\uFE00\": \"caps\",\n \"\\u222A\": \"cup\",\n \"\\u222A\\uFE00\": \"cups\",\n \"\\u222B\": \"int\",\n \"\\u222C\": \"Int\",\n \"\\u222D\": \"tint\",\n \"\\u2A0C\": \"qint\",\n \"\\u222E\": \"oint\",\n \"\\u222F\": \"Conint\",\n \"\\u2230\": \"Cconint\",\n \"\\u2231\": \"cwint\",\n \"\\u2232\": \"cwconint\",\n \"\\u2233\": \"awconint\",\n \"\\u2234\": \"there4\",\n \"\\u2235\": \"becaus\",\n \"\\u2236\": \"ratio\",\n \"\\u2237\": \"Colon\",\n \"\\u2238\": \"minusd\",\n \"\\u223A\": \"mDDot\",\n \"\\u223B\": \"homtht\",\n \"\\u223C\": \"sim\",\n \"\\u2241\": \"nsim\",\n \"\\u223C\\u20D2\": \"nvsim\",\n \"\\u223D\": \"bsim\",\n \"\\u223D\\u0331\": \"race\",\n \"\\u223E\": \"ac\",\n \"\\u223E\\u0333\": \"acE\",\n \"\\u223F\": \"acd\",\n \"\\u2240\": \"wr\",\n \"\\u2242\": \"esim\",\n \"\\u2242\\u0338\": \"nesim\",\n \"\\u2243\": \"sime\",\n \"\\u2244\": \"nsime\",\n \"\\u2245\": \"cong\",\n \"\\u2247\": \"ncong\",\n \"\\u2246\": \"simne\",\n \"\\u2248\": \"ap\",\n \"\\u2249\": \"nap\",\n \"\\u224A\": \"ape\",\n \"\\u224B\": \"apid\",\n \"\\u224B\\u0338\": \"napid\",\n \"\\u224C\": \"bcong\",\n \"\\u224D\": \"CupCap\",\n \"\\u226D\": \"NotCupCap\",\n \"\\u224D\\u20D2\": \"nvap\",\n \"\\u224E\": \"bump\",\n \"\\u224E\\u0338\": \"nbump\",\n \"\\u224F\": \"bumpe\",\n \"\\u224F\\u0338\": \"nbumpe\",\n \"\\u2250\": \"doteq\",\n \"\\u2250\\u0338\": \"nedot\",\n \"\\u2251\": \"eDot\",\n \"\\u2252\": \"efDot\",\n \"\\u2253\": \"erDot\",\n \"\\u2254\": \"colone\",\n \"\\u2255\": \"ecolon\",\n \"\\u2256\": \"ecir\",\n \"\\u2257\": \"cire\",\n \"\\u2259\": \"wedgeq\",\n \"\\u225A\": \"veeeq\",\n \"\\u225C\": \"trie\",\n \"\\u225F\": \"equest\",\n \"\\u2261\": \"equiv\",\n \"\\u2262\": \"nequiv\",\n \"\\u2261\\u20E5\": \"bnequiv\",\n \"\\u2264\": \"le\",\n \"\\u2270\": \"nle\",\n \"\\u2264\\u20D2\": \"nvle\",\n \"\\u2265\": \"ge\",\n \"\\u2271\": \"nge\",\n \"\\u2265\\u20D2\": \"nvge\",\n \"\\u2266\": \"lE\",\n \"\\u2266\\u0338\": \"nlE\",\n \"\\u2267\": \"gE\",\n \"\\u2267\\u0338\": \"ngE\",\n \"\\u2268\\uFE00\": \"lvnE\",\n \"\\u2268\": \"lnE\",\n \"\\u2269\": \"gnE\",\n \"\\u2269\\uFE00\": \"gvnE\",\n \"\\u226A\": \"ll\",\n \"\\u226A\\u0338\": \"nLtv\",\n \"\\u226A\\u20D2\": \"nLt\",\n \"\\u226B\": \"gg\",\n \"\\u226B\\u0338\": \"nGtv\",\n \"\\u226B\\u20D2\": \"nGt\",\n \"\\u226C\": \"twixt\",\n \"\\u2272\": \"lsim\",\n \"\\u2274\": \"nlsim\",\n \"\\u2273\": \"gsim\",\n \"\\u2275\": \"ngsim\",\n \"\\u2276\": \"lg\",\n \"\\u2278\": \"ntlg\",\n \"\\u2277\": \"gl\",\n \"\\u2279\": \"ntgl\",\n \"\\u227A\": \"pr\",\n \"\\u2280\": \"npr\",\n \"\\u227B\": \"sc\",\n \"\\u2281\": \"nsc\",\n \"\\u227C\": \"prcue\",\n \"\\u22E0\": \"nprcue\",\n \"\\u227D\": \"sccue\",\n \"\\u22E1\": \"nsccue\",\n \"\\u227E\": \"prsim\",\n \"\\u227F\": \"scsim\",\n \"\\u227F\\u0338\": \"NotSucceedsTilde\",\n \"\\u2282\": \"sub\",\n \"\\u2284\": \"nsub\",\n \"\\u2282\\u20D2\": \"vnsub\",\n \"\\u2283\": \"sup\",\n \"\\u2285\": \"nsup\",\n \"\\u2283\\u20D2\": \"vnsup\",\n \"\\u2286\": \"sube\",\n \"\\u2288\": \"nsube\",\n \"\\u2287\": \"supe\",\n \"\\u2289\": \"nsupe\",\n \"\\u228A\\uFE00\": \"vsubne\",\n \"\\u228A\": \"subne\",\n \"\\u228B\\uFE00\": \"vsupne\",\n \"\\u228B\": \"supne\",\n \"\\u228D\": \"cupdot\",\n \"\\u228E\": \"uplus\",\n \"\\u228F\": \"sqsub\",\n \"\\u228F\\u0338\": \"NotSquareSubset\",\n \"\\u2290\": \"sqsup\",\n \"\\u2290\\u0338\": \"NotSquareSuperset\",\n \"\\u2291\": \"sqsube\",\n \"\\u22E2\": \"nsqsube\",\n \"\\u2292\": \"sqsupe\",\n \"\\u22E3\": \"nsqsupe\",\n \"\\u2293\": \"sqcap\",\n \"\\u2293\\uFE00\": \"sqcaps\",\n \"\\u2294\": \"sqcup\",\n \"\\u2294\\uFE00\": \"sqcups\",\n \"\\u2295\": \"oplus\",\n \"\\u2296\": \"ominus\",\n \"\\u2297\": \"otimes\",\n \"\\u2298\": \"osol\",\n \"\\u2299\": \"odot\",\n \"\\u229A\": \"ocir\",\n \"\\u229B\": \"oast\",\n \"\\u229D\": \"odash\",\n \"\\u229E\": \"plusb\",\n \"\\u229F\": \"minusb\",\n \"\\u22A0\": \"timesb\",\n \"\\u22A1\": \"sdotb\",\n \"\\u22A2\": \"vdash\",\n \"\\u22AC\": \"nvdash\",\n \"\\u22A3\": \"dashv\",\n \"\\u22A4\": \"top\",\n \"\\u22A5\": \"bot\",\n \"\\u22A7\": \"models\",\n \"\\u22A8\": \"vDash\",\n \"\\u22AD\": \"nvDash\",\n \"\\u22A9\": \"Vdash\",\n \"\\u22AE\": \"nVdash\",\n \"\\u22AA\": \"Vvdash\",\n \"\\u22AB\": \"VDash\",\n \"\\u22AF\": \"nVDash\",\n \"\\u22B0\": \"prurel\",\n \"\\u22B2\": \"vltri\",\n \"\\u22EA\": \"nltri\",\n \"\\u22B3\": \"vrtri\",\n \"\\u22EB\": \"nrtri\",\n \"\\u22B4\": \"ltrie\",\n \"\\u22EC\": \"nltrie\",\n \"\\u22B4\\u20D2\": \"nvltrie\",\n \"\\u22B5\": \"rtrie\",\n \"\\u22ED\": \"nrtrie\",\n \"\\u22B5\\u20D2\": \"nvrtrie\",\n \"\\u22B6\": \"origof\",\n \"\\u22B7\": \"imof\",\n \"\\u22B8\": \"mumap\",\n \"\\u22B9\": \"hercon\",\n \"\\u22BA\": \"intcal\",\n \"\\u22BB\": \"veebar\",\n \"\\u22BD\": \"barvee\",\n \"\\u22BE\": \"angrtvb\",\n \"\\u22BF\": \"lrtri\",\n \"\\u22C0\": \"Wedge\",\n \"\\u22C1\": \"Vee\",\n \"\\u22C2\": \"xcap\",\n \"\\u22C3\": \"xcup\",\n \"\\u22C4\": \"diam\",\n \"\\u22C5\": \"sdot\",\n \"\\u22C6\": \"Star\",\n \"\\u22C7\": \"divonx\",\n \"\\u22C8\": \"bowtie\",\n \"\\u22C9\": \"ltimes\",\n \"\\u22CA\": \"rtimes\",\n \"\\u22CB\": \"lthree\",\n \"\\u22CC\": \"rthree\",\n \"\\u22CD\": \"bsime\",\n \"\\u22CE\": \"cuvee\",\n \"\\u22CF\": \"cuwed\",\n \"\\u22D0\": \"Sub\",\n \"\\u22D1\": \"Sup\",\n \"\\u22D2\": \"Cap\",\n \"\\u22D3\": \"Cup\",\n \"\\u22D4\": \"fork\",\n \"\\u22D5\": \"epar\",\n \"\\u22D6\": \"ltdot\",\n \"\\u22D7\": \"gtdot\",\n \"\\u22D8\": \"Ll\",\n \"\\u22D8\\u0338\": \"nLl\",\n \"\\u22D9\": \"Gg\",\n \"\\u22D9\\u0338\": \"nGg\",\n \"\\u22DA\\uFE00\": \"lesg\",\n \"\\u22DA\": \"leg\",\n \"\\u22DB\": \"gel\",\n \"\\u22DB\\uFE00\": \"gesl\",\n \"\\u22DE\": \"cuepr\",\n \"\\u22DF\": \"cuesc\",\n \"\\u22E6\": \"lnsim\",\n \"\\u22E7\": \"gnsim\",\n \"\\u22E8\": \"prnsim\",\n \"\\u22E9\": \"scnsim\",\n \"\\u22EE\": \"vellip\",\n \"\\u22EF\": \"ctdot\",\n \"\\u22F0\": \"utdot\",\n \"\\u22F1\": \"dtdot\",\n \"\\u22F2\": \"disin\",\n \"\\u22F3\": \"isinsv\",\n \"\\u22F4\": \"isins\",\n \"\\u22F5\": \"isindot\",\n \"\\u22F5\\u0338\": \"notindot\",\n \"\\u22F6\": \"notinvc\",\n \"\\u22F7\": \"notinvb\",\n \"\\u22F9\": \"isinE\",\n \"\\u22F9\\u0338\": \"notinE\",\n \"\\u22FA\": \"nisd\",\n \"\\u22FB\": \"xnis\",\n \"\\u22FC\": \"nis\",\n \"\\u22FD\": \"notnivc\",\n \"\\u22FE\": \"notnivb\",\n \"\\u2305\": \"barwed\",\n \"\\u2306\": \"Barwed\",\n \"\\u230C\": \"drcrop\",\n \"\\u230D\": \"dlcrop\",\n \"\\u230E\": \"urcrop\",\n \"\\u230F\": \"ulcrop\",\n \"\\u2310\": \"bnot\",\n \"\\u2312\": \"profline\",\n \"\\u2313\": \"profsurf\",\n \"\\u2315\": \"telrec\",\n \"\\u2316\": \"target\",\n \"\\u231C\": \"ulcorn\",\n \"\\u231D\": \"urcorn\",\n \"\\u231E\": \"dlcorn\",\n \"\\u231F\": \"drcorn\",\n \"\\u2322\": \"frown\",\n \"\\u2323\": \"smile\",\n \"\\u232D\": \"cylcty\",\n \"\\u232E\": \"profalar\",\n \"\\u2336\": \"topbot\",\n \"\\u233D\": \"ovbar\",\n \"\\u233F\": \"solbar\",\n \"\\u237C\": \"angzarr\",\n \"\\u23B0\": \"lmoust\",\n \"\\u23B1\": \"rmoust\",\n \"\\u23B4\": \"tbrk\",\n \"\\u23B5\": \"bbrk\",\n \"\\u23B6\": \"bbrktbrk\",\n \"\\u23DC\": \"OverParenthesis\",\n \"\\u23DD\": \"UnderParenthesis\",\n \"\\u23DE\": \"OverBrace\",\n \"\\u23DF\": \"UnderBrace\",\n \"\\u23E2\": \"trpezium\",\n \"\\u23E7\": \"elinters\",\n \"\\u2423\": \"blank\",\n \"\\u2500\": \"boxh\",\n \"\\u2502\": \"boxv\",\n \"\\u250C\": \"boxdr\",\n \"\\u2510\": \"boxdl\",\n \"\\u2514\": \"boxur\",\n \"\\u2518\": \"boxul\",\n \"\\u251C\": \"boxvr\",\n \"\\u2524\": \"boxvl\",\n \"\\u252C\": \"boxhd\",\n \"\\u2534\": \"boxhu\",\n \"\\u253C\": \"boxvh\",\n \"\\u2550\": \"boxH\",\n \"\\u2551\": \"boxV\",\n \"\\u2552\": \"boxdR\",\n \"\\u2553\": \"boxDr\",\n \"\\u2554\": \"boxDR\",\n \"\\u2555\": \"boxdL\",\n \"\\u2556\": \"boxDl\",\n \"\\u2557\": \"boxDL\",\n \"\\u2558\": \"boxuR\",\n \"\\u2559\": \"boxUr\",\n \"\\u255A\": \"boxUR\",\n \"\\u255B\": \"boxuL\",\n \"\\u255C\": \"boxUl\",\n \"\\u255D\": \"boxUL\",\n \"\\u255E\": \"boxvR\",\n \"\\u255F\": \"boxVr\",\n \"\\u2560\": \"boxVR\",\n \"\\u2561\": \"boxvL\",\n \"\\u2562\": \"boxVl\",\n \"\\u2563\": \"boxVL\",\n \"\\u2564\": \"boxHd\",\n \"\\u2565\": \"boxhD\",\n \"\\u2566\": \"boxHD\",\n \"\\u2567\": \"boxHu\",\n \"\\u2568\": \"boxhU\",\n \"\\u2569\": \"boxHU\",\n \"\\u256A\": \"boxvH\",\n \"\\u256B\": \"boxVh\",\n \"\\u256C\": \"boxVH\",\n \"\\u2580\": \"uhblk\",\n \"\\u2584\": \"lhblk\",\n \"\\u2588\": \"block\",\n \"\\u2591\": \"blk14\",\n \"\\u2592\": \"blk12\",\n \"\\u2593\": \"blk34\",\n \"\\u25A1\": \"squ\",\n \"\\u25AA\": \"squf\",\n \"\\u25AB\": \"EmptyVerySmallSquare\",\n \"\\u25AD\": \"rect\",\n \"\\u25AE\": \"marker\",\n \"\\u25B1\": \"fltns\",\n \"\\u25B3\": \"xutri\",\n \"\\u25B4\": \"utrif\",\n \"\\u25B5\": \"utri\",\n \"\\u25B8\": \"rtrif\",\n \"\\u25B9\": \"rtri\",\n \"\\u25BD\": \"xdtri\",\n \"\\u25BE\": \"dtrif\",\n \"\\u25BF\": \"dtri\",\n \"\\u25C2\": \"ltrif\",\n \"\\u25C3\": \"ltri\",\n \"\\u25CA\": \"loz\",\n \"\\u25CB\": \"cir\",\n \"\\u25EC\": \"tridot\",\n \"\\u25EF\": \"xcirc\",\n \"\\u25F8\": \"ultri\",\n \"\\u25F9\": \"urtri\",\n \"\\u25FA\": \"lltri\",\n \"\\u25FB\": \"EmptySmallSquare\",\n \"\\u25FC\": \"FilledSmallSquare\",\n \"\\u2605\": \"starf\",\n \"\\u2606\": \"star\",\n \"\\u260E\": \"phone\",\n \"\\u2640\": \"female\",\n \"\\u2642\": \"male\",\n \"\\u2660\": \"spades\",\n \"\\u2663\": \"clubs\",\n \"\\u2665\": \"hearts\",\n \"\\u2666\": \"diams\",\n \"\\u266A\": \"sung\",\n \"\\u2713\": \"check\",\n \"\\u2717\": \"cross\",\n \"\\u2720\": \"malt\",\n \"\\u2736\": \"sext\",\n \"\\u2758\": \"VerticalSeparator\",\n \"\\u27C8\": \"bsolhsub\",\n \"\\u27C9\": \"suphsol\",\n \"\\u27F5\": \"xlarr\",\n \"\\u27F6\": \"xrarr\",\n \"\\u27F7\": \"xharr\",\n \"\\u27F8\": \"xlArr\",\n \"\\u27F9\": \"xrArr\",\n \"\\u27FA\": \"xhArr\",\n \"\\u27FC\": \"xmap\",\n \"\\u27FF\": \"dzigrarr\",\n \"\\u2902\": \"nvlArr\",\n \"\\u2903\": \"nvrArr\",\n \"\\u2904\": \"nvHarr\",\n \"\\u2905\": \"Map\",\n \"\\u290C\": \"lbarr\",\n \"\\u290D\": \"rbarr\",\n \"\\u290E\": \"lBarr\",\n \"\\u290F\": \"rBarr\",\n \"\\u2910\": \"RBarr\",\n \"\\u2911\": \"DDotrahd\",\n \"\\u2912\": \"UpArrowBar\",\n \"\\u2913\": \"DownArrowBar\",\n \"\\u2916\": \"Rarrtl\",\n \"\\u2919\": \"latail\",\n \"\\u291A\": \"ratail\",\n \"\\u291B\": \"lAtail\",\n \"\\u291C\": \"rAtail\",\n \"\\u291D\": \"larrfs\",\n \"\\u291E\": \"rarrfs\",\n \"\\u291F\": \"larrbfs\",\n \"\\u2920\": \"rarrbfs\",\n \"\\u2923\": \"nwarhk\",\n \"\\u2924\": \"nearhk\",\n \"\\u2925\": \"searhk\",\n \"\\u2926\": \"swarhk\",\n \"\\u2927\": \"nwnear\",\n \"\\u2928\": \"toea\",\n \"\\u2929\": \"tosa\",\n \"\\u292A\": \"swnwar\",\n \"\\u2933\": \"rarrc\",\n \"\\u2933\\u0338\": \"nrarrc\",\n \"\\u2935\": \"cudarrr\",\n \"\\u2936\": \"ldca\",\n \"\\u2937\": \"rdca\",\n \"\\u2938\": \"cudarrl\",\n \"\\u2939\": \"larrpl\",\n \"\\u293C\": \"curarrm\",\n \"\\u293D\": \"cularrp\",\n \"\\u2945\": \"rarrpl\",\n \"\\u2948\": \"harrcir\",\n \"\\u2949\": \"Uarrocir\",\n \"\\u294A\": \"lurdshar\",\n \"\\u294B\": \"ldrushar\",\n \"\\u294E\": \"LeftRightVector\",\n \"\\u294F\": \"RightUpDownVector\",\n \"\\u2950\": \"DownLeftRightVector\",\n \"\\u2951\": \"LeftUpDownVector\",\n \"\\u2952\": \"LeftVectorBar\",\n \"\\u2953\": \"RightVectorBar\",\n \"\\u2954\": \"RightUpVectorBar\",\n \"\\u2955\": \"RightDownVectorBar\",\n \"\\u2956\": \"DownLeftVectorBar\",\n \"\\u2957\": \"DownRightVectorBar\",\n \"\\u2958\": \"LeftUpVectorBar\",\n \"\\u2959\": \"LeftDownVectorBar\",\n \"\\u295A\": \"LeftTeeVector\",\n \"\\u295B\": \"RightTeeVector\",\n \"\\u295C\": \"RightUpTeeVector\",\n \"\\u295D\": \"RightDownTeeVector\",\n \"\\u295E\": \"DownLeftTeeVector\",\n \"\\u295F\": \"DownRightTeeVector\",\n \"\\u2960\": \"LeftUpTeeVector\",\n \"\\u2961\": \"LeftDownTeeVector\",\n \"\\u2962\": \"lHar\",\n \"\\u2963\": \"uHar\",\n \"\\u2964\": \"rHar\",\n \"\\u2965\": \"dHar\",\n \"\\u2966\": \"luruhar\",\n \"\\u2967\": \"ldrdhar\",\n \"\\u2968\": \"ruluhar\",\n \"\\u2969\": \"rdldhar\",\n \"\\u296A\": \"lharul\",\n \"\\u296B\": \"llhard\",\n \"\\u296C\": \"rharul\",\n \"\\u296D\": \"lrhard\",\n \"\\u296E\": \"udhar\",\n \"\\u296F\": \"duhar\",\n \"\\u2970\": \"RoundImplies\",\n \"\\u2971\": \"erarr\",\n \"\\u2972\": \"simrarr\",\n \"\\u2973\": \"larrsim\",\n \"\\u2974\": \"rarrsim\",\n \"\\u2975\": \"rarrap\",\n \"\\u2976\": \"ltlarr\",\n \"\\u2978\": \"gtrarr\",\n \"\\u2979\": \"subrarr\",\n \"\\u297B\": \"suplarr\",\n \"\\u297C\": \"lfisht\",\n \"\\u297D\": \"rfisht\",\n \"\\u297E\": \"ufisht\",\n \"\\u297F\": \"dfisht\",\n \"\\u299A\": \"vzigzag\",\n \"\\u299C\": \"vangrt\",\n \"\\u299D\": \"angrtvbd\",\n \"\\u29A4\": \"ange\",\n \"\\u29A5\": \"range\",\n \"\\u29A6\": \"dwangle\",\n \"\\u29A7\": \"uwangle\",\n \"\\u29A8\": \"angmsdaa\",\n \"\\u29A9\": \"angmsdab\",\n \"\\u29AA\": \"angmsdac\",\n \"\\u29AB\": \"angmsdad\",\n \"\\u29AC\": \"angmsdae\",\n \"\\u29AD\": \"angmsdaf\",\n \"\\u29AE\": \"angmsdag\",\n \"\\u29AF\": \"angmsdah\",\n \"\\u29B0\": \"bemptyv\",\n \"\\u29B1\": \"demptyv\",\n \"\\u29B2\": \"cemptyv\",\n \"\\u29B3\": \"raemptyv\",\n \"\\u29B4\": \"laemptyv\",\n \"\\u29B5\": \"ohbar\",\n \"\\u29B6\": \"omid\",\n \"\\u29B7\": \"opar\",\n \"\\u29B9\": \"operp\",\n \"\\u29BB\": \"olcross\",\n \"\\u29BC\": \"odsold\",\n \"\\u29BE\": \"olcir\",\n \"\\u29BF\": \"ofcir\",\n \"\\u29C0\": \"olt\",\n \"\\u29C1\": \"ogt\",\n \"\\u29C2\": \"cirscir\",\n \"\\u29C3\": \"cirE\",\n \"\\u29C4\": \"solb\",\n \"\\u29C5\": \"bsolb\",\n \"\\u29C9\": \"boxbox\",\n \"\\u29CD\": \"trisb\",\n \"\\u29CE\": \"rtriltri\",\n \"\\u29CF\": \"LeftTriangleBar\",\n \"\\u29CF\\u0338\": \"NotLeftTriangleBar\",\n \"\\u29D0\": \"RightTriangleBar\",\n \"\\u29D0\\u0338\": \"NotRightTriangleBar\",\n \"\\u29DC\": \"iinfin\",\n \"\\u29DD\": \"infintie\",\n \"\\u29DE\": \"nvinfin\",\n \"\\u29E3\": \"eparsl\",\n \"\\u29E4\": \"smeparsl\",\n \"\\u29E5\": \"eqvparsl\",\n \"\\u29EB\": \"lozf\",\n \"\\u29F4\": \"RuleDelayed\",\n \"\\u29F6\": \"dsol\",\n \"\\u2A00\": \"xodot\",\n \"\\u2A01\": \"xoplus\",\n \"\\u2A02\": \"xotime\",\n \"\\u2A04\": \"xuplus\",\n \"\\u2A06\": \"xsqcup\",\n \"\\u2A0D\": \"fpartint\",\n \"\\u2A10\": \"cirfnint\",\n \"\\u2A11\": \"awint\",\n \"\\u2A12\": \"rppolint\",\n \"\\u2A13\": \"scpolint\",\n \"\\u2A14\": \"npolint\",\n \"\\u2A15\": \"pointint\",\n \"\\u2A16\": \"quatint\",\n \"\\u2A17\": \"intlarhk\",\n \"\\u2A22\": \"pluscir\",\n \"\\u2A23\": \"plusacir\",\n \"\\u2A24\": \"simplus\",\n \"\\u2A25\": \"plusdu\",\n \"\\u2A26\": \"plussim\",\n \"\\u2A27\": \"plustwo\",\n \"\\u2A29\": \"mcomma\",\n \"\\u2A2A\": \"minusdu\",\n \"\\u2A2D\": \"loplus\",\n \"\\u2A2E\": \"roplus\",\n \"\\u2A2F\": \"Cross\",\n \"\\u2A30\": \"timesd\",\n \"\\u2A31\": \"timesbar\",\n \"\\u2A33\": \"smashp\",\n \"\\u2A34\": \"lotimes\",\n \"\\u2A35\": \"rotimes\",\n \"\\u2A36\": \"otimesas\",\n \"\\u2A37\": \"Otimes\",\n \"\\u2A38\": \"odiv\",\n \"\\u2A39\": \"triplus\",\n \"\\u2A3A\": \"triminus\",\n \"\\u2A3B\": \"tritime\",\n \"\\u2A3C\": \"iprod\",\n \"\\u2A3F\": \"amalg\",\n \"\\u2A40\": \"capdot\",\n \"\\u2A42\": \"ncup\",\n \"\\u2A43\": \"ncap\",\n \"\\u2A44\": \"capand\",\n \"\\u2A45\": \"cupor\",\n \"\\u2A46\": \"cupcap\",\n \"\\u2A47\": \"capcup\",\n \"\\u2A48\": \"cupbrcap\",\n \"\\u2A49\": \"capbrcup\",\n \"\\u2A4A\": \"cupcup\",\n \"\\u2A4B\": \"capcap\",\n \"\\u2A4C\": \"ccups\",\n \"\\u2A4D\": \"ccaps\",\n \"\\u2A50\": \"ccupssm\",\n \"\\u2A53\": \"And\",\n \"\\u2A54\": \"Or\",\n \"\\u2A55\": \"andand\",\n \"\\u2A56\": \"oror\",\n \"\\u2A57\": \"orslope\",\n \"\\u2A58\": \"andslope\",\n \"\\u2A5A\": \"andv\",\n \"\\u2A5B\": \"orv\",\n \"\\u2A5C\": \"andd\",\n \"\\u2A5D\": \"ord\",\n \"\\u2A5F\": \"wedbar\",\n \"\\u2A66\": \"sdote\",\n \"\\u2A6A\": \"simdot\",\n \"\\u2A6D\": \"congdot\",\n \"\\u2A6D\\u0338\": \"ncongdot\",\n \"\\u2A6E\": \"easter\",\n \"\\u2A6F\": \"apacir\",\n \"\\u2A70\": \"apE\",\n \"\\u2A70\\u0338\": \"napE\",\n \"\\u2A71\": \"eplus\",\n \"\\u2A72\": \"pluse\",\n \"\\u2A73\": \"Esim\",\n \"\\u2A77\": \"eDDot\",\n \"\\u2A78\": \"equivDD\",\n \"\\u2A79\": \"ltcir\",\n \"\\u2A7A\": \"gtcir\",\n \"\\u2A7B\": \"ltquest\",\n \"\\u2A7C\": \"gtquest\",\n \"\\u2A7D\": \"les\",\n \"\\u2A7D\\u0338\": \"nles\",\n \"\\u2A7E\": \"ges\",\n \"\\u2A7E\\u0338\": \"nges\",\n \"\\u2A7F\": \"lesdot\",\n \"\\u2A80\": \"gesdot\",\n \"\\u2A81\": \"lesdoto\",\n \"\\u2A82\": \"gesdoto\",\n \"\\u2A83\": \"lesdotor\",\n \"\\u2A84\": \"gesdotol\",\n \"\\u2A85\": \"lap\",\n \"\\u2A86\": \"gap\",\n \"\\u2A87\": \"lne\",\n \"\\u2A88\": \"gne\",\n \"\\u2A89\": \"lnap\",\n \"\\u2A8A\": \"gnap\",\n \"\\u2A8B\": \"lEg\",\n \"\\u2A8C\": \"gEl\",\n \"\\u2A8D\": \"lsime\",\n \"\\u2A8E\": \"gsime\",\n \"\\u2A8F\": \"lsimg\",\n \"\\u2A90\": \"gsiml\",\n \"\\u2A91\": \"lgE\",\n \"\\u2A92\": \"glE\",\n \"\\u2A93\": \"lesges\",\n \"\\u2A94\": \"gesles\",\n \"\\u2A95\": \"els\",\n \"\\u2A96\": \"egs\",\n \"\\u2A97\": \"elsdot\",\n \"\\u2A98\": \"egsdot\",\n \"\\u2A99\": \"el\",\n \"\\u2A9A\": \"eg\",\n \"\\u2A9D\": \"siml\",\n \"\\u2A9E\": \"simg\",\n \"\\u2A9F\": \"simlE\",\n \"\\u2AA0\": \"simgE\",\n \"\\u2AA1\": \"LessLess\",\n \"\\u2AA1\\u0338\": \"NotNestedLessLess\",\n \"\\u2AA2\": \"GreaterGreater\",\n \"\\u2AA2\\u0338\": \"NotNestedGreaterGreater\",\n \"\\u2AA4\": \"glj\",\n \"\\u2AA5\": \"gla\",\n \"\\u2AA6\": \"ltcc\",\n \"\\u2AA7\": \"gtcc\",\n \"\\u2AA8\": \"lescc\",\n \"\\u2AA9\": \"gescc\",\n \"\\u2AAA\": \"smt\",\n \"\\u2AAB\": \"lat\",\n \"\\u2AAC\": \"smte\",\n \"\\u2AAC\\uFE00\": \"smtes\",\n \"\\u2AAD\": \"late\",\n \"\\u2AAD\\uFE00\": \"lates\",\n \"\\u2AAE\": \"bumpE\",\n \"\\u2AAF\": \"pre\",\n \"\\u2AAF\\u0338\": \"npre\",\n \"\\u2AB0\": \"sce\",\n \"\\u2AB0\\u0338\": \"nsce\",\n \"\\u2AB3\": \"prE\",\n \"\\u2AB4\": \"scE\",\n \"\\u2AB5\": \"prnE\",\n \"\\u2AB6\": \"scnE\",\n \"\\u2AB7\": \"prap\",\n \"\\u2AB8\": \"scap\",\n \"\\u2AB9\": \"prnap\",\n \"\\u2ABA\": \"scnap\",\n \"\\u2ABB\": \"Pr\",\n \"\\u2ABC\": \"Sc\",\n \"\\u2ABD\": \"subdot\",\n \"\\u2ABE\": \"supdot\",\n \"\\u2ABF\": \"subplus\",\n \"\\u2AC0\": \"supplus\",\n \"\\u2AC1\": \"submult\",\n \"\\u2AC2\": \"supmult\",\n \"\\u2AC3\": \"subedot\",\n \"\\u2AC4\": \"supedot\",\n \"\\u2AC5\": \"subE\",\n \"\\u2AC5\\u0338\": \"nsubE\",\n \"\\u2AC6\": \"supE\",\n \"\\u2AC6\\u0338\": \"nsupE\",\n \"\\u2AC7\": \"subsim\",\n \"\\u2AC8\": \"supsim\",\n \"\\u2ACB\\uFE00\": \"vsubnE\",\n \"\\u2ACB\": \"subnE\",\n \"\\u2ACC\\uFE00\": \"vsupnE\",\n \"\\u2ACC\": \"supnE\",\n \"\\u2ACF\": \"csub\",\n \"\\u2AD0\": \"csup\",\n \"\\u2AD1\": \"csube\",\n \"\\u2AD2\": \"csupe\",\n \"\\u2AD3\": \"subsup\",\n \"\\u2AD4\": \"supsub\",\n \"\\u2AD5\": \"subsub\",\n \"\\u2AD6\": \"supsup\",\n \"\\u2AD7\": \"suphsub\",\n \"\\u2AD8\": \"supdsub\",\n \"\\u2AD9\": \"forkv\",\n \"\\u2ADA\": \"topfork\",\n \"\\u2ADB\": \"mlcp\",\n \"\\u2AE4\": \"Dashv\",\n \"\\u2AE6\": \"Vdashl\",\n \"\\u2AE7\": \"Barv\",\n \"\\u2AE8\": \"vBar\",\n \"\\u2AE9\": \"vBarv\",\n \"\\u2AEB\": \"Vbar\",\n \"\\u2AEC\": \"Not\",\n \"\\u2AED\": \"bNot\",\n \"\\u2AEE\": \"rnmid\",\n \"\\u2AEF\": \"cirmid\",\n \"\\u2AF0\": \"midcir\",\n \"\\u2AF1\": \"topcir\",\n \"\\u2AF2\": \"nhpar\",\n \"\\u2AF3\": \"parsim\",\n \"\\u2AFD\": \"parsl\",\n \"\\u2AFD\\u20E5\": \"nparsl\",\n \"\\u266D\": \"flat\",\n \"\\u266E\": \"natur\",\n \"\\u266F\": \"sharp\",\n \"\\xA4\": \"curren\",\n \"\\xA2\": \"cent\",\n $: \"dollar\",\n \"\\xA3\": \"pound\",\n \"\\xA5\": \"yen\",\n \"\\u20AC\": \"euro\",\n \"\\xB9\": \"sup1\",\n \"\\xBD\": \"half\",\n \"\\u2153\": \"frac13\",\n \"\\xBC\": \"frac14\",\n \"\\u2155\": \"frac15\",\n \"\\u2159\": \"frac16\",\n \"\\u215B\": \"frac18\",\n \"\\xB2\": \"sup2\",\n \"\\u2154\": \"frac23\",\n \"\\u2156\": \"frac25\",\n \"\\xB3\": \"sup3\",\n \"\\xBE\": \"frac34\",\n \"\\u2157\": \"frac35\",\n \"\\u215C\": \"frac38\",\n \"\\u2158\": \"frac45\",\n \"\\u215A\": \"frac56\",\n \"\\u215D\": \"frac58\",\n \"\\u215E\": \"frac78\",\n \"\\uD835\\uDCB6\": \"ascr\",\n \"\\uD835\\uDD52\": \"aopf\",\n \"\\uD835\\uDD1E\": \"afr\",\n \"\\uD835\\uDD38\": \"Aopf\",\n \"\\uD835\\uDD04\": \"Afr\",\n \"\\uD835\\uDC9C\": \"Ascr\",\n ª: \"ordf\",\n á: \"aacute\",\n Á: \"Aacute\",\n à: \"agrave\",\n À: \"Agrave\",\n ă: \"abreve\",\n Ă: \"Abreve\",\n â: \"acirc\",\n Â: \"Acirc\",\n å: \"aring\",\n Å: \"angst\",\n ä: \"auml\",\n Ä: \"Auml\",\n ã: \"atilde\",\n Ã: \"Atilde\",\n ą: \"aogon\",\n Ą: \"Aogon\",\n ā: \"amacr\",\n Ā: \"Amacr\",\n æ: \"aelig\",\n Æ: \"AElig\",\n \"\\uD835\\uDCB7\": \"bscr\",\n \"\\uD835\\uDD53\": \"bopf\",\n \"\\uD835\\uDD1F\": \"bfr\",\n \"\\uD835\\uDD39\": \"Bopf\",\n ℬ: \"Bscr\",\n \"\\uD835\\uDD05\": \"Bfr\",\n \"\\uD835\\uDD20\": \"cfr\",\n \"\\uD835\\uDCB8\": \"cscr\",\n \"\\uD835\\uDD54\": \"copf\",\n ℭ: \"Cfr\",\n \"\\uD835\\uDC9E\": \"Cscr\",\n ℂ: \"Copf\",\n ć: \"cacute\",\n Ć: \"Cacute\",\n ĉ: \"ccirc\",\n Ĉ: \"Ccirc\",\n č: \"ccaron\",\n Č: \"Ccaron\",\n ċ: \"cdot\",\n Ċ: \"Cdot\",\n ç: \"ccedil\",\n Ç: \"Ccedil\",\n \"\\u2105\": \"incare\",\n \"\\uD835\\uDD21\": \"dfr\",\n ⅆ: \"dd\",\n \"\\uD835\\uDD55\": \"dopf\",\n \"\\uD835\\uDCB9\": \"dscr\",\n \"\\uD835\\uDC9F\": \"Dscr\",\n \"\\uD835\\uDD07\": \"Dfr\",\n ⅅ: \"DD\",\n \"\\uD835\\uDD3B\": \"Dopf\",\n ď: \"dcaron\",\n Ď: \"Dcaron\",\n đ: \"dstrok\",\n Đ: \"Dstrok\",\n ð: \"eth\",\n Ð: \"ETH\",\n ⅇ: \"ee\",\n ℯ: \"escr\",\n \"\\uD835\\uDD22\": \"efr\",\n \"\\uD835\\uDD56\": \"eopf\",\n ℰ: \"Escr\",\n \"\\uD835\\uDD08\": \"Efr\",\n \"\\uD835\\uDD3C\": \"Eopf\",\n é: \"eacute\",\n É: \"Eacute\",\n è: \"egrave\",\n È: \"Egrave\",\n ê: \"ecirc\",\n Ê: \"Ecirc\",\n ě: \"ecaron\",\n Ě: \"Ecaron\",\n ë: \"euml\",\n Ë: \"Euml\",\n ė: \"edot\",\n Ė: \"Edot\",\n ę: \"eogon\",\n Ę: \"Eogon\",\n ē: \"emacr\",\n Ē: \"Emacr\",\n \"\\uD835\\uDD23\": \"ffr\",\n \"\\uD835\\uDD57\": \"fopf\",\n \"\\uD835\\uDCBB\": \"fscr\",\n \"\\uD835\\uDD09\": \"Ffr\",\n \"\\uD835\\uDD3D\": \"Fopf\",\n ℱ: \"Fscr\",\n ff: \"fflig\",\n ffi: \"ffilig\",\n ffl: \"ffllig\",\n fi: \"filig\",\n fj: \"fjlig\",\n fl: \"fllig\",\n ƒ: \"fnof\",\n ℊ: \"gscr\",\n \"\\uD835\\uDD58\": \"gopf\",\n \"\\uD835\\uDD24\": \"gfr\",\n \"\\uD835\\uDCA2\": \"Gscr\",\n \"\\uD835\\uDD3E\": \"Gopf\",\n \"\\uD835\\uDD0A\": \"Gfr\",\n ǵ: \"gacute\",\n ğ: \"gbreve\",\n Ğ: \"Gbreve\",\n ĝ: \"gcirc\",\n Ĝ: \"Gcirc\",\n ġ: \"gdot\",\n Ġ: \"Gdot\",\n Ģ: \"Gcedil\",\n \"\\uD835\\uDD25\": \"hfr\",\n ℎ: \"planckh\",\n \"\\uD835\\uDCBD\": \"hscr\",\n \"\\uD835\\uDD59\": \"hopf\",\n ℋ: \"Hscr\",\n ℌ: \"Hfr\",\n ℍ: \"Hopf\",\n ĥ: \"hcirc\",\n Ĥ: \"Hcirc\",\n ℏ: \"hbar\",\n ħ: \"hstrok\",\n Ħ: \"Hstrok\",\n \"\\uD835\\uDD5A\": \"iopf\",\n \"\\uD835\\uDD26\": \"ifr\",\n \"\\uD835\\uDCBE\": \"iscr\",\n ⅈ: \"ii\",\n \"\\uD835\\uDD40\": \"Iopf\",\n ℐ: \"Iscr\",\n ℑ: \"Im\",\n í: \"iacute\",\n Í: \"Iacute\",\n ì: \"igrave\",\n Ì: \"Igrave\",\n î: \"icirc\",\n Î: \"Icirc\",\n ï: \"iuml\",\n Ï: \"Iuml\",\n ĩ: \"itilde\",\n Ĩ: \"Itilde\",\n İ: \"Idot\",\n į: \"iogon\",\n Į: \"Iogon\",\n ī: \"imacr\",\n Ī: \"Imacr\",\n ij: \"ijlig\",\n IJ: \"IJlig\",\n ı: \"imath\",\n \"\\uD835\\uDCBF\": \"jscr\",\n \"\\uD835\\uDD5B\": \"jopf\",\n \"\\uD835\\uDD27\": \"jfr\",\n \"\\uD835\\uDCA5\": \"Jscr\",\n \"\\uD835\\uDD0D\": \"Jfr\",\n \"\\uD835\\uDD41\": \"Jopf\",\n ĵ: \"jcirc\",\n Ĵ: \"Jcirc\",\n ȷ: \"jmath\",\n \"\\uD835\\uDD5C\": \"kopf\",\n \"\\uD835\\uDCC0\": \"kscr\",\n \"\\uD835\\uDD28\": \"kfr\",\n \"\\uD835\\uDCA6\": \"Kscr\",\n \"\\uD835\\uDD42\": \"Kopf\",\n \"\\uD835\\uDD0E\": \"Kfr\",\n ķ: \"kcedil\",\n Ķ: \"Kcedil\",\n \"\\uD835\\uDD29\": \"lfr\",\n \"\\uD835\\uDCC1\": \"lscr\",\n ℓ: \"ell\",\n \"\\uD835\\uDD5D\": \"lopf\",\n ℒ: \"Lscr\",\n \"\\uD835\\uDD0F\": \"Lfr\",\n \"\\uD835\\uDD43\": \"Lopf\",\n ĺ: \"lacute\",\n Ĺ: \"Lacute\",\n ľ: \"lcaron\",\n Ľ: \"Lcaron\",\n ļ: \"lcedil\",\n Ļ: \"Lcedil\",\n ł: \"lstrok\",\n Ł: \"Lstrok\",\n ŀ: \"lmidot\",\n Ŀ: \"Lmidot\",\n \"\\uD835\\uDD2A\": \"mfr\",\n \"\\uD835\\uDD5E\": \"mopf\",\n \"\\uD835\\uDCC2\": \"mscr\",\n \"\\uD835\\uDD10\": \"Mfr\",\n \"\\uD835\\uDD44\": \"Mopf\",\n ℳ: \"Mscr\",\n \"\\uD835\\uDD2B\": \"nfr\",\n \"\\uD835\\uDD5F\": \"nopf\",\n \"\\uD835\\uDCC3\": \"nscr\",\n ℕ: \"Nopf\",\n \"\\uD835\\uDCA9\": \"Nscr\",\n \"\\uD835\\uDD11\": \"Nfr\",\n ń: \"nacute\",\n Ń: \"Nacute\",\n ň: \"ncaron\",\n Ň: \"Ncaron\",\n ñ: \"ntilde\",\n Ñ: \"Ntilde\",\n ņ: \"ncedil\",\n Ņ: \"Ncedil\",\n \"\\u2116\": \"numero\",\n ŋ: \"eng\",\n Ŋ: \"ENG\",\n \"\\uD835\\uDD60\": \"oopf\",\n \"\\uD835\\uDD2C\": \"ofr\",\n ℴ: \"oscr\",\n \"\\uD835\\uDCAA\": \"Oscr\",\n \"\\uD835\\uDD12\": \"Ofr\",\n \"\\uD835\\uDD46\": \"Oopf\",\n º: \"ordm\",\n ó: \"oacute\",\n Ó: \"Oacute\",\n ò: \"ograve\",\n Ò: \"Ograve\",\n ô: \"ocirc\",\n Ô: \"Ocirc\",\n ö: \"ouml\",\n Ö: \"Ouml\",\n ő: \"odblac\",\n Ő: \"Odblac\",\n õ: \"otilde\",\n Õ: \"Otilde\",\n ø: \"oslash\",\n Ø: \"Oslash\",\n ō: \"omacr\",\n Ō: \"Omacr\",\n œ: \"oelig\",\n Œ: \"OElig\",\n \"\\uD835\\uDD2D\": \"pfr\",\n \"\\uD835\\uDCC5\": \"pscr\",\n \"\\uD835\\uDD61\": \"popf\",\n ℙ: \"Popf\",\n \"\\uD835\\uDD13\": \"Pfr\",\n \"\\uD835\\uDCAB\": \"Pscr\",\n \"\\uD835\\uDD62\": \"qopf\",\n \"\\uD835\\uDD2E\": \"qfr\",\n \"\\uD835\\uDCC6\": \"qscr\",\n \"\\uD835\\uDCAC\": \"Qscr\",\n \"\\uD835\\uDD14\": \"Qfr\",\n ℚ: \"Qopf\",\n ĸ: \"kgreen\",\n \"\\uD835\\uDD2F\": \"rfr\",\n \"\\uD835\\uDD63\": \"ropf\",\n \"\\uD835\\uDCC7\": \"rscr\",\n ℛ: \"Rscr\",\n ℜ: \"Re\",\n ℝ: \"Ropf\",\n ŕ: \"racute\",\n Ŕ: \"Racute\",\n ř: \"rcaron\",\n Ř: \"Rcaron\",\n ŗ: \"rcedil\",\n Ŗ: \"Rcedil\",\n \"\\uD835\\uDD64\": \"sopf\",\n \"\\uD835\\uDCC8\": \"sscr\",\n \"\\uD835\\uDD30\": \"sfr\",\n \"\\uD835\\uDD4A\": \"Sopf\",\n \"\\uD835\\uDD16\": \"Sfr\",\n \"\\uD835\\uDCAE\": \"Sscr\",\n \"\\u24C8\": \"oS\",\n ś: \"sacute\",\n Ś: \"Sacute\",\n ŝ: \"scirc\",\n Ŝ: \"Scirc\",\n š: \"scaron\",\n Š: \"Scaron\",\n ş: \"scedil\",\n Ş: \"Scedil\",\n ß: \"szlig\",\n \"\\uD835\\uDD31\": \"tfr\",\n \"\\uD835\\uDCC9\": \"tscr\",\n \"\\uD835\\uDD65\": \"topf\",\n \"\\uD835\\uDCAF\": \"Tscr\",\n \"\\uD835\\uDD17\": \"Tfr\",\n \"\\uD835\\uDD4B\": \"Topf\",\n ť: \"tcaron\",\n Ť: \"Tcaron\",\n ţ: \"tcedil\",\n Ţ: \"Tcedil\",\n \"\\u2122\": \"trade\",\n ŧ: \"tstrok\",\n Ŧ: \"Tstrok\",\n \"\\uD835\\uDCCA\": \"uscr\",\n \"\\uD835\\uDD66\": \"uopf\",\n \"\\uD835\\uDD32\": \"ufr\",\n \"\\uD835\\uDD4C\": \"Uopf\",\n \"\\uD835\\uDD18\": \"Ufr\",\n \"\\uD835\\uDCB0\": \"Uscr\",\n ú: \"uacute\",\n Ú: \"Uacute\",\n ù: \"ugrave\",\n Ù: \"Ugrave\",\n ŭ: \"ubreve\",\n Ŭ: \"Ubreve\",\n û: \"ucirc\",\n Û: \"Ucirc\",\n ů: \"uring\",\n Ů: \"Uring\",\n ü: \"uuml\",\n Ü: \"Uuml\",\n ű: \"udblac\",\n Ű: \"Udblac\",\n ũ: \"utilde\",\n Ũ: \"Utilde\",\n ų: \"uogon\",\n Ų: \"Uogon\",\n ū: \"umacr\",\n Ū: \"Umacr\",\n \"\\uD835\\uDD33\": \"vfr\",\n \"\\uD835\\uDD67\": \"vopf\",\n \"\\uD835\\uDCCB\": \"vscr\",\n \"\\uD835\\uDD19\": \"Vfr\",\n \"\\uD835\\uDD4D\": \"Vopf\",\n \"\\uD835\\uDCB1\": \"Vscr\",\n \"\\uD835\\uDD68\": \"wopf\",\n \"\\uD835\\uDCCC\": \"wscr\",\n \"\\uD835\\uDD34\": \"wfr\",\n \"\\uD835\\uDCB2\": \"Wscr\",\n \"\\uD835\\uDD4E\": \"Wopf\",\n \"\\uD835\\uDD1A\": \"Wfr\",\n ŵ: \"wcirc\",\n Ŵ: \"Wcirc\",\n \"\\uD835\\uDD35\": \"xfr\",\n \"\\uD835\\uDCCD\": \"xscr\",\n \"\\uD835\\uDD69\": \"xopf\",\n \"\\uD835\\uDD4F\": \"Xopf\",\n \"\\uD835\\uDD1B\": \"Xfr\",\n \"\\uD835\\uDCB3\": \"Xscr\",\n \"\\uD835\\uDD36\": \"yfr\",\n \"\\uD835\\uDCCE\": \"yscr\",\n \"\\uD835\\uDD6A\": \"yopf\",\n \"\\uD835\\uDCB4\": \"Yscr\",\n \"\\uD835\\uDD1C\": \"Yfr\",\n \"\\uD835\\uDD50\": \"Yopf\",\n ý: \"yacute\",\n Ý: \"Yacute\",\n ŷ: \"ycirc\",\n Ŷ: \"Ycirc\",\n ÿ: \"yuml\",\n Ÿ: \"Yuml\",\n \"\\uD835\\uDCCF\": \"zscr\",\n \"\\uD835\\uDD37\": \"zfr\",\n \"\\uD835\\uDD6B\": \"zopf\",\n ℨ: \"Zfr\",\n ℤ: \"Zopf\",\n \"\\uD835\\uDCB5\": \"Zscr\",\n ź: \"zacute\",\n Ź: \"Zacute\",\n ž: \"zcaron\",\n Ž: \"Zcaron\",\n ż: \"zdot\",\n Ż: \"Zdot\",\n Ƶ: \"imped\",\n þ: \"thorn\",\n Þ: \"THORN\",\n ʼn: \"napos\",\n α: \"alpha\",\n Α: \"Alpha\",\n β: \"beta\",\n Β: \"Beta\",\n γ: \"gamma\",\n Γ: \"Gamma\",\n δ: \"delta\",\n Δ: \"Delta\",\n ε: \"epsi\",\n ϵ: \"epsiv\",\n Ε: \"Epsilon\",\n ϝ: \"gammad\",\n Ϝ: \"Gammad\",\n ζ: \"zeta\",\n Ζ: \"Zeta\",\n η: \"eta\",\n Η: \"Eta\",\n θ: \"theta\",\n ϑ: \"thetav\",\n Θ: \"Theta\",\n ι: \"iota\",\n Ι: \"Iota\",\n κ: \"kappa\",\n ϰ: \"kappav\",\n Κ: \"Kappa\",\n λ: \"lambda\",\n Λ: \"Lambda\",\n μ: \"mu\",\n µ: \"micro\",\n Μ: \"Mu\",\n ν: \"nu\",\n Ν: \"Nu\",\n ξ: \"xi\",\n Ξ: \"Xi\",\n ο: \"omicron\",\n Ο: \"Omicron\",\n π: \"pi\",\n ϖ: \"piv\",\n Π: \"Pi\",\n ρ: \"rho\",\n ϱ: \"rhov\",\n Ρ: \"Rho\",\n σ: \"sigma\",\n Σ: \"Sigma\",\n ς: \"sigmaf\",\n τ: \"tau\",\n Τ: \"Tau\",\n υ: \"upsi\",\n Υ: \"Upsilon\",\n ϒ: \"Upsi\",\n φ: \"phi\",\n ϕ: \"phiv\",\n Φ: \"Phi\",\n χ: \"chi\",\n Χ: \"Chi\",\n ψ: \"psi\",\n Ψ: \"Psi\",\n ω: \"omega\",\n Ω: \"ohm\",\n а: \"acy\",\n А: \"Acy\",\n б: \"bcy\",\n Б: \"Bcy\",\n в: \"vcy\",\n В: \"Vcy\",\n г: \"gcy\",\n Г: \"Gcy\",\n ѓ: \"gjcy\",\n Ѓ: \"GJcy\",\n д: \"dcy\",\n Д: \"Dcy\",\n ђ: \"djcy\",\n Ђ: \"DJcy\",\n е: \"iecy\",\n Е: \"IEcy\",\n ё: \"iocy\",\n Ё: \"IOcy\",\n є: \"jukcy\",\n Є: \"Jukcy\",\n ж: \"zhcy\",\n Ж: \"ZHcy\",\n з: \"zcy\",\n З: \"Zcy\",\n ѕ: \"dscy\",\n Ѕ: \"DScy\",\n и: \"icy\",\n И: \"Icy\",\n і: \"iukcy\",\n І: \"Iukcy\",\n ї: \"yicy\",\n Ї: \"YIcy\",\n й: \"jcy\",\n Й: \"Jcy\",\n ј: \"jsercy\",\n Ј: \"Jsercy\",\n к: \"kcy\",\n К: \"Kcy\",\n ќ: \"kjcy\",\n Ќ: \"KJcy\",\n л: \"lcy\",\n Л: \"Lcy\",\n љ: \"ljcy\",\n Љ: \"LJcy\",\n м: \"mcy\",\n М: \"Mcy\",\n н: \"ncy\",\n Н: \"Ncy\",\n њ: \"njcy\",\n Њ: \"NJcy\",\n о: \"ocy\",\n О: \"Ocy\",\n п: \"pcy\",\n П: \"Pcy\",\n р: \"rcy\",\n Р: \"Rcy\",\n с: \"scy\",\n С: \"Scy\",\n т: \"tcy\",\n Т: \"Tcy\",\n ћ: \"tshcy\",\n Ћ: \"TSHcy\",\n у: \"ucy\",\n У: \"Ucy\",\n ў: \"ubrcy\",\n Ў: \"Ubrcy\",\n ф: \"fcy\",\n Ф: \"Fcy\",\n х: \"khcy\",\n Х: \"KHcy\",\n ц: \"tscy\",\n Ц: \"TScy\",\n ч: \"chcy\",\n Ч: \"CHcy\",\n џ: \"dzcy\",\n Џ: \"DZcy\",\n ш: \"shcy\",\n Ш: \"SHcy\",\n щ: \"shchcy\",\n Щ: \"SHCHcy\",\n ъ: \"hardcy\",\n Ъ: \"HARDcy\",\n ы: \"ycy\",\n Ы: \"Ycy\",\n ь: \"softcy\",\n Ь: \"SOFTcy\",\n э: \"ecy\",\n Э: \"Ecy\",\n ю: \"yucy\",\n Ю: \"YUcy\",\n я: \"yacy\",\n Я: \"YAcy\",\n ℵ: \"aleph\",\n ℶ: \"beth\",\n ℷ: \"gimel\",\n ℸ: \"daleth\"\n };\n\n var regexEscape = /[\"&'<>`]/g;\n var escapeMap = {\n '\"': \""\",\n \"&\": \"&\",\n \"'\": \"'\",\n \"<\": \"<\",\n // See https://mathiasbynens.be/notes/ambiguous-ampersands: in HTML, the\n // following is not strictly necessary unless it’s part of a tag or an\n // unquoted attribute value. We’re only escaping it to support those\n // situations, and for XML support.\n \">\": \">\",\n // In Internet Explorer ≤ 8, the backtick character can be used\n // to break out of (un)quoted attribute values or HTML comments.\n // See http://html5sec.org/#102, http://html5sec.org/#108, and\n // http://html5sec.org/#133.\n \"`\": \"`\"\n };\n\n var regexInvalidEntity = /&#(?:[xX][^a-fA-F0-9]|[^0-9xX])/;\n var regexInvalidRawCodePoint = /[\\0-\\x08\\x0B\\x0E-\\x1F\\x7F-\\x9F\\uFDD0-\\uFDEF\\uFFFE\\uFFFF]|[\\uD83F\\uD87F\\uD8BF\\uD8FF\\uD93F\\uD97F\\uD9BF\\uD9FF\\uDA3F\\uDA7F\\uDABF\\uDAFF\\uDB3F\\uDB7F\\uDBBF\\uDBFF][\\uDFFE\\uDFFF]|[\\uD800-\\uDBFF](?![\\uDC00-\\uDFFF])|(?:[^\\uD800-\\uDBFF]|^)[\\uDC00-\\uDFFF]/;\n var regexDecode = /&(CounterClockwiseContourIntegral|DoubleLongLeftRightArrow|ClockwiseContourIntegral|NotNestedGreaterGreater|NotSquareSupersetEqual|DiacriticalDoubleAcute|NotRightTriangleEqual|NotSucceedsSlantEqual|NotPrecedesSlantEqual|CloseCurlyDoubleQuote|NegativeVeryThinSpace|DoubleContourIntegral|FilledVerySmallSquare|CapitalDifferentialD|OpenCurlyDoubleQuote|EmptyVerySmallSquare|NestedGreaterGreater|DoubleLongRightArrow|NotLeftTriangleEqual|NotGreaterSlantEqual|ReverseUpEquilibrium|DoubleLeftRightArrow|NotSquareSubsetEqual|NotDoubleVerticalBar|RightArrowLeftArrow|NotGreaterFullEqual|NotRightTriangleBar|SquareSupersetEqual|DownLeftRightVector|DoubleLongLeftArrow|leftrightsquigarrow|LeftArrowRightArrow|NegativeMediumSpace|blacktriangleright|RightDownVectorBar|PrecedesSlantEqual|RightDoubleBracket|SucceedsSlantEqual|NotLeftTriangleBar|RightTriangleEqual|SquareIntersection|RightDownTeeVector|ReverseEquilibrium|NegativeThickSpace|longleftrightarrow|Longleftrightarrow|LongLeftRightArrow|DownRightTeeVector|DownRightVectorBar|GreaterSlantEqual|SquareSubsetEqual|LeftDownVectorBar|LeftDoubleBracket|VerticalSeparator|rightleftharpoons|NotGreaterGreater|NotSquareSuperset|blacktriangleleft|blacktriangledown|NegativeThinSpace|LeftDownTeeVector|NotLessSlantEqual|leftrightharpoons|DoubleUpDownArrow|DoubleVerticalBar|LeftTriangleEqual|FilledSmallSquare|twoheadrightarrow|NotNestedLessLess|DownLeftTeeVector|DownLeftVectorBar|RightAngleBracket|NotTildeFullEqual|NotReverseElement|RightUpDownVector|DiacriticalTilde|NotSucceedsTilde|circlearrowright|NotPrecedesEqual|rightharpoondown|DoubleRightArrow|NotSucceedsEqual|NonBreakingSpace|NotRightTriangle|LessEqualGreater|RightUpTeeVector|LeftAngleBracket|GreaterFullEqual|DownArrowUpArrow|RightUpVectorBar|twoheadleftarrow|GreaterEqualLess|downharpoonright|RightTriangleBar|ntrianglerighteq|NotSupersetEqual|LeftUpDownVector|DiacriticalAcute|rightrightarrows|vartriangleright|UpArrowDownArrow|DiacriticalGrave|UnderParenthesis|EmptySmallSquare|LeftUpVectorBar|leftrightarrows|DownRightVector|downharpoonleft|trianglerighteq|ShortRightArrow|OverParenthesis|DoubleLeftArrow|DoubleDownArrow|NotSquareSubset|bigtriangledown|ntrianglelefteq|UpperRightArrow|curvearrowright|vartriangleleft|NotLeftTriangle|nleftrightarrow|LowerRightArrow|NotHumpDownHump|NotGreaterTilde|rightthreetimes|LeftUpTeeVector|NotGreaterEqual|straightepsilon|LeftTriangleBar|rightsquigarrow|ContourIntegral|rightleftarrows|CloseCurlyQuote|RightDownVector|LeftRightVector|nLeftrightarrow|leftharpoondown|circlearrowleft|SquareSuperset|OpenCurlyQuote|hookrightarrow|HorizontalLine|DiacriticalDot|NotLessGreater|ntriangleright|DoubleRightTee|InvisibleComma|InvisibleTimes|LowerLeftArrow|DownLeftVector|NotSubsetEqual|curvearrowleft|trianglelefteq|NotVerticalBar|TildeFullEqual|downdownarrows|NotGreaterLess|RightTeeVector|ZeroWidthSpace|looparrowright|LongRightArrow|doublebarwedge|ShortLeftArrow|ShortDownArrow|RightVectorBar|GreaterGreater|ReverseElement|rightharpoonup|LessSlantEqual|leftthreetimes|upharpoonright|rightarrowtail|LeftDownVector|Longrightarrow|NestedLessLess|UpperLeftArrow|nshortparallel|leftleftarrows|leftrightarrow|Leftrightarrow|LeftRightArrow|longrightarrow|upharpoonleft|RightArrowBar|ApplyFunction|LeftTeeVector|leftarrowtail|NotEqualTilde|varsubsetneqq|varsupsetneqq|RightTeeArrow|SucceedsEqual|SucceedsTilde|LeftVectorBar|SupersetEqual|hookleftarrow|DifferentialD|VerticalTilde|VeryThinSpace|blacktriangle|bigtriangleup|LessFullEqual|divideontimes|leftharpoonup|UpEquilibrium|ntriangleleft|RightTriangle|measuredangle|shortparallel|longleftarrow|Longleftarrow|LongLeftArrow|DoubleLeftTee|Poincareplane|PrecedesEqual|triangleright|DoubleUpArrow|RightUpVector|fallingdotseq|looparrowleft|PrecedesTilde|NotTildeEqual|NotTildeTilde|smallsetminus|Proportional|triangleleft|triangledown|UnderBracket|NotHumpEqual|exponentiale|ExponentialE|NotLessTilde|HilbertSpace|RightCeiling|blacklozenge|varsupsetneq|HumpDownHump|GreaterEqual|VerticalLine|LeftTeeArrow|NotLessEqual|DownTeeArrow|LeftTriangle|varsubsetneq|Intersection|NotCongruent|DownArrowBar|LeftUpVector|LeftArrowBar|risingdotseq|GreaterTilde|RoundImplies|SquareSubset|ShortUpArrow|NotSuperset|quaternions|precnapprox|backepsilon|preccurlyeq|OverBracket|blacksquare|MediumSpace|VerticalBar|circledcirc|circleddash|CircleMinus|CircleTimes|LessGreater|curlyeqprec|curlyeqsucc|diamondsuit|UpDownArrow|Updownarrow|RuleDelayed|Rrightarrow|updownarrow|RightVector|nRightarrow|nrightarrow|eqslantless|LeftCeiling|Equilibrium|SmallCircle|expectation|NotSucceeds|thickapprox|GreaterLess|SquareUnion|NotPrecedes|NotLessLess|straightphi|succnapprox|succcurlyeq|SubsetEqual|sqsupseteq|Proportion|Laplacetrf|ImaginaryI|supsetneqq|NotGreater|gtreqqless|NotElement|ThickSpace|TildeEqual|TildeTilde|Fouriertrf|rmoustache|EqualTilde|eqslantgtr|UnderBrace|LeftVector|UpArrowBar|nLeftarrow|nsubseteqq|subsetneqq|nsupseteqq|nleftarrow|succapprox|lessapprox|UpTeeArrow|upuparrows|curlywedge|lesseqqgtr|varepsilon|varnothing|RightFloor|complement|CirclePlus|sqsubseteq|Lleftarrow|circledast|RightArrow|Rightarrow|rightarrow|lmoustache|Bernoullis|precapprox|mapstoleft|mapstodown|longmapsto|dotsquare|downarrow|DoubleDot|nsubseteq|supsetneq|leftarrow|nsupseteq|subsetneq|ThinSpace|ngeqslant|subseteqq|HumpEqual|NotSubset|triangleq|NotCupCap|lesseqgtr|heartsuit|TripleDot|Leftarrow|Coproduct|Congruent|varpropto|complexes|gvertneqq|LeftArrow|LessTilde|supseteqq|MinusPlus|CircleDot|nleqslant|NotExists|gtreqless|nparallel|UnionPlus|LeftFloor|checkmark|CenterDot|centerdot|Mellintrf|gtrapprox|bigotimes|OverBrace|spadesuit|therefore|pitchfork|rationals|PlusMinus|Backslash|Therefore|DownBreve|backsimeq|backprime|DownArrow|nshortmid|Downarrow|lvertneqq|eqvparsl|imagline|imagpart|infintie|integers|Integral|intercal|LessLess|Uarrocir|intlarhk|sqsupset|angmsdaf|sqsubset|llcorner|vartheta|cupbrcap|lnapprox|Superset|SuchThat|succnsim|succneqq|angmsdag|biguplus|curlyvee|trpezium|Succeeds|NotTilde|bigwedge|angmsdah|angrtvbd|triminus|cwconint|fpartint|lrcorner|smeparsl|subseteq|urcorner|lurdshar|laemptyv|DDotrahd|approxeq|ldrushar|awconint|mapstoup|backcong|shortmid|triangle|geqslant|gesdotol|timesbar|circledR|circledS|setminus|multimap|naturals|scpolint|ncongdot|RightTee|boxminus|gnapprox|boxtimes|andslope|thicksim|angmsdaa|varsigma|cirfnint|rtriltri|angmsdab|rppolint|angmsdac|barwedge|drbkarow|clubsuit|thetasym|bsolhsub|capbrcup|dzigrarr|doteqdot|DotEqual|dotminus|UnderBar|NotEqual|realpart|otimesas|ulcorner|hksearow|hkswarow|parallel|PartialD|elinters|emptyset|plusacir|bbrktbrk|angmsdad|pointint|bigoplus|angmsdae|Precedes|bigsqcup|varkappa|notindot|supseteq|precneqq|precnsim|profalar|profline|profsurf|leqslant|lesdotor|raemptyv|subplus|notnivb|notnivc|subrarr|zigrarr|vzigzag|submult|subedot|Element|between|cirscir|larrbfs|larrsim|lotimes|lbrksld|lbrkslu|lozenge|ldrdhar|dbkarow|bigcirc|epsilon|simrarr|simplus|ltquest|Epsilon|luruhar|gtquest|maltese|npolint|eqcolon|npreceq|bigodot|ddagger|gtrless|bnequiv|harrcir|ddotseq|equivDD|backsim|demptyv|nsqsube|nsqsupe|Upsilon|nsubset|upsilon|minusdu|nsucceq|swarrow|nsupset|coloneq|searrow|boxplus|napprox|natural|asympeq|alefsym|congdot|nearrow|bigstar|diamond|supplus|tritime|LeftTee|nvinfin|triplus|NewLine|nvltrie|nvrtrie|nwarrow|nexists|Diamond|ruluhar|Implies|supmult|angzarr|suplarr|suphsub|questeq|because|digamma|Because|olcross|bemptyv|omicron|Omicron|rotimes|NoBreak|intprod|angrtvb|orderof|uwangle|suphsol|lesdoto|orslope|DownTee|realine|cudarrl|rdldhar|OverBar|supedot|lessdot|supdsub|topfork|succsim|rbrkslu|rbrksld|pertenk|cudarrr|isindot|planckh|lessgtr|pluscir|gesdoto|plussim|plustwo|lesssim|cularrp|rarrsim|Cayleys|notinva|notinvb|notinvc|UpArrow|Uparrow|uparrow|NotLess|dwangle|precsim|Product|curarrm|Cconint|dotplus|rarrbfs|ccupssm|Cedilla|cemptyv|notniva|quatint|frac35|frac38|frac45|frac56|frac58|frac78|tridot|xoplus|gacute|gammad|Gammad|lfisht|lfloor|bigcup|sqsupe|gbreve|Gbreve|lharul|sqsube|sqcups|Gcedil|apacir|llhard|lmidot|Lmidot|lmoust|andand|sqcaps|approx|Abreve|spades|circeq|tprime|divide|topcir|Assign|topbot|gesdot|divonx|xuplus|timesd|gesles|atilde|solbar|SOFTcy|loplus|timesb|lowast|lowbar|dlcorn|dlcrop|softcy|dollar|lparlt|thksim|lrhard|Atilde|lsaquo|smashp|bigvee|thinsp|wreath|bkarow|lsquor|lstrok|Lstrok|lthree|ltimes|ltlarr|DotDot|simdot|ltrPar|weierp|xsqcup|angmsd|sigmav|sigmaf|zeetrf|Zcaron|zcaron|mapsto|vsupne|thetav|cirmid|marker|mcomma|Zacute|vsubnE|there4|gtlPar|vsubne|bottom|gtrarr|SHCHcy|shchcy|midast|midcir|middot|minusb|minusd|gtrdot|bowtie|sfrown|mnplus|models|colone|seswar|Colone|mstpos|searhk|gtrsim|nacute|Nacute|boxbox|telrec|hairsp|Tcedil|nbumpe|scnsim|ncaron|Ncaron|ncedil|Ncedil|hamilt|Scedil|nearhk|hardcy|HARDcy|tcedil|Tcaron|commat|nequiv|nesear|tcaron|target|hearts|nexist|varrho|scedil|Scaron|scaron|hellip|Sacute|sacute|hercon|swnwar|compfn|rtimes|rthree|rsquor|rsaquo|zacute|wedgeq|homtht|barvee|barwed|Barwed|rpargt|horbar|conint|swarhk|roplus|nltrie|hslash|hstrok|Hstrok|rmoust|Conint|bprime|hybull|hyphen|iacute|Iacute|supsup|supsub|supsim|varphi|coprod|brvbar|agrave|Supset|supset|igrave|Igrave|notinE|Agrave|iiiint|iinfin|copysr|wedbar|Verbar|vangrt|becaus|incare|verbar|inodot|bullet|drcorn|intcal|drcrop|cularr|vellip|Utilde|bumpeq|cupcap|dstrok|Dstrok|CupCap|cupcup|cupdot|eacute|Eacute|supdot|iquest|easter|ecaron|Ecaron|ecolon|isinsv|utilde|itilde|Itilde|curarr|succeq|Bumpeq|cacute|ulcrop|nparsl|Cacute|nprcue|egrave|Egrave|nrarrc|nrarrw|subsup|subsub|nrtrie|jsercy|nsccue|Jsercy|kappav|kcedil|Kcedil|subsim|ulcorn|nsimeq|egsdot|veebar|kgreen|capand|elsdot|Subset|subset|curren|aacute|lacute|Lacute|emptyv|ntilde|Ntilde|lagran|lambda|Lambda|capcap|Ugrave|langle|subdot|emsp13|numero|emsp14|nvdash|nvDash|nVdash|nVDash|ugrave|ufisht|nvHarr|larrfs|nvlArr|larrhk|larrlp|larrpl|nvrArr|Udblac|nwarhk|larrtl|nwnear|oacute|Oacute|latail|lAtail|sstarf|lbrace|odblac|Odblac|lbrack|udblac|odsold|eparsl|lcaron|Lcaron|ograve|Ograve|lcedil|Lcedil|Aacute|ssmile|ssetmn|squarf|ldquor|capcup|ominus|cylcty|rharul|eqcirc|dagger|rfloor|rfisht|Dagger|daleth|equals|origof|capdot|equest|dcaron|Dcaron|rdquor|oslash|Oslash|otilde|Otilde|otimes|Otimes|urcrop|Ubreve|ubreve|Yacute|Uacute|uacute|Rcedil|rcedil|urcorn|parsim|Rcaron|Vdashl|rcaron|Tstrok|percnt|period|permil|Exists|yacute|rbrack|rbrace|phmmat|ccaron|Ccaron|planck|ccedil|plankv|tstrok|female|plusdo|plusdu|ffilig|plusmn|ffllig|Ccedil|rAtail|dfisht|bernou|ratail|Rarrtl|rarrtl|angsph|rarrpl|rarrlp|rarrhk|xwedge|xotime|forall|ForAll|Vvdash|vsupnE|preceq|bigcap|frac12|frac13|frac14|primes|rarrfs|prnsim|frac15|Square|frac16|square|lesdot|frac18|frac23|propto|prurel|rarrap|rangle|puncsp|frac25|Racute|qprime|racute|lesges|frac34|abreve|AElig|eqsim|utdot|setmn|urtri|Equal|Uring|seArr|uring|searr|dashv|Dashv|mumap|nabla|iogon|Iogon|sdote|sdotb|scsim|napid|napos|equiv|natur|Acirc|dblac|erarr|nbump|iprod|erDot|ucirc|awint|esdot|angrt|ncong|isinE|scnap|Scirc|scirc|ndash|isins|Ubrcy|nearr|neArr|isinv|nedot|ubrcy|acute|Ycirc|iukcy|Iukcy|xutri|nesim|caret|jcirc|Jcirc|caron|twixt|ddarr|sccue|exist|jmath|sbquo|ngeqq|angst|ccaps|lceil|ngsim|UpTee|delta|Delta|rtrif|nharr|nhArr|nhpar|rtrie|jukcy|Jukcy|kappa|rsquo|Kappa|nlarr|nlArr|TSHcy|rrarr|aogon|Aogon|fflig|xrarr|tshcy|ccirc|nleqq|filig|upsih|nless|dharl|nlsim|fjlig|ropar|nltri|dharr|robrk|roarr|fllig|fltns|roang|rnmid|subnE|subne|lAarr|trisb|Ccirc|acirc|ccups|blank|VDash|forkv|Vdash|langd|cedil|blk12|blk14|laquo|strns|diams|notin|vDash|larrb|blk34|block|disin|uplus|vdash|vBarv|aelig|starf|Wedge|check|xrArr|lates|lbarr|lBarr|notni|lbbrk|bcong|frasl|lbrke|frown|vrtri|vprop|vnsup|gamma|Gamma|wedge|xodot|bdquo|srarr|doteq|ldquo|boxdl|boxdL|gcirc|Gcirc|boxDl|boxDL|boxdr|boxdR|boxDr|TRADE|trade|rlhar|boxDR|vnsub|npart|vltri|rlarr|boxhd|boxhD|nprec|gescc|nrarr|nrArr|boxHd|boxHD|boxhu|boxhU|nrtri|boxHu|clubs|boxHU|times|colon|Colon|gimel|xlArr|Tilde|nsime|tilde|nsmid|nspar|THORN|thorn|xlarr|nsube|nsubE|thkap|xhArr|comma|nsucc|boxul|boxuL|nsupe|nsupE|gneqq|gnsim|boxUl|boxUL|grave|boxur|boxuR|boxUr|boxUR|lescc|angle|bepsi|boxvh|varpi|boxvH|numsp|Theta|gsime|gsiml|theta|boxVh|boxVH|boxvl|gtcir|gtdot|boxvL|boxVl|boxVL|crarr|cross|Cross|nvsim|boxvr|nwarr|nwArr|sqsup|dtdot|Uogon|lhard|lharu|dtrif|ocirc|Ocirc|lhblk|duarr|odash|sqsub|Hacek|sqcup|llarr|duhar|oelig|OElig|ofcir|boxvR|uogon|lltri|boxVr|csube|uuarr|ohbar|csupe|ctdot|olarr|olcir|harrw|oline|sqcap|omacr|Omacr|omega|Omega|boxVR|aleph|lneqq|lnsim|loang|loarr|rharu|lobrk|hcirc|operp|oplus|rhard|Hcirc|orarr|Union|order|ecirc|Ecirc|cuepr|szlig|cuesc|breve|reals|eDDot|Breve|hoarr|lopar|utrif|rdquo|Umacr|umacr|efDot|swArr|ultri|alpha|rceil|ovbar|swarr|Wcirc|wcirc|smtes|smile|bsemi|lrarr|aring|parsl|lrhar|bsime|uhblk|lrtri|cupor|Aring|uharr|uharl|slarr|rbrke|bsolb|lsime|rbbrk|RBarr|lsimg|phone|rBarr|rbarr|icirc|lsquo|Icirc|emacr|Emacr|ratio|simne|plusb|simlE|simgE|simeq|pluse|ltcir|ltdot|empty|xharr|xdtri|iexcl|Alpha|ltrie|rarrw|pound|ltrif|xcirc|bumpe|prcue|bumpE|asymp|amacr|cuvee|Sigma|sigma|iiint|udhar|iiota|ijlig|IJlig|supnE|imacr|Imacr|prime|Prime|image|prnap|eogon|Eogon|rarrc|mdash|mDDot|cuwed|imath|supne|imped|Amacr|udarr|prsim|micro|rarrb|cwint|raquo|infin|eplus|range|rangd|Ucirc|radic|minus|amalg|veeeq|rAarr|epsiv|ycirc|quest|sharp|quot|zwnj|Qscr|race|qscr|Qopf|qopf|qint|rang|Rang|Zscr|zscr|Zopf|zopf|rarr|rArr|Rarr|Pscr|pscr|prop|prod|prnE|prec|ZHcy|zhcy|prap|Zeta|zeta|Popf|popf|Zdot|plus|zdot|Yuml|yuml|phiv|YUcy|yucy|Yscr|yscr|perp|Yopf|yopf|part|para|YIcy|Ouml|rcub|yicy|YAcy|rdca|ouml|osol|Oscr|rdsh|yacy|real|oscr|xvee|andd|rect|andv|Xscr|oror|ordm|ordf|xscr|ange|aopf|Aopf|rHar|Xopf|opar|Oopf|xopf|xnis|rhov|oopf|omid|xmap|oint|apid|apos|ogon|ascr|Ascr|odot|odiv|xcup|xcap|ocir|oast|nvlt|nvle|nvgt|nvge|nvap|Wscr|wscr|auml|ntlg|ntgl|nsup|nsub|nsim|Nscr|nscr|nsce|Wopf|ring|npre|wopf|npar|Auml|Barv|bbrk|Nopf|nopf|nmid|nLtv|beta|ropf|Ropf|Beta|beth|nles|rpar|nleq|bnot|bNot|nldr|NJcy|rscr|Rscr|Vscr|vscr|rsqb|njcy|bopf|nisd|Bopf|rtri|Vopf|nGtv|ngtr|vopf|boxh|boxH|boxv|nges|ngeq|boxV|bscr|scap|Bscr|bsim|Vert|vert|bsol|bull|bump|caps|cdot|ncup|scnE|ncap|nbsp|napE|Cdot|cent|sdot|Vbar|nang|vBar|chcy|Mscr|mscr|sect|semi|CHcy|Mopf|mopf|sext|circ|cire|mldr|mlcp|cirE|comp|shcy|SHcy|vArr|varr|cong|copf|Copf|copy|COPY|malt|male|macr|lvnE|cscr|ltri|sime|ltcc|simg|Cscr|siml|csub|Uuml|lsqb|lsim|uuml|csup|Lscr|lscr|utri|smid|lpar|cups|smte|lozf|darr|Lopf|Uscr|solb|lopf|sopf|Sopf|lneq|uscr|spar|dArr|lnap|Darr|dash|Sqrt|LJcy|ljcy|lHar|dHar|Upsi|upsi|diam|lesg|djcy|DJcy|leqq|dopf|Dopf|dscr|Dscr|dscy|ldsh|ldca|squf|DScy|sscr|Sscr|dsol|lcub|late|star|Star|Uopf|Larr|lArr|larr|uopf|dtri|dzcy|sube|subE|Lang|lang|Kscr|kscr|Kopf|kopf|KJcy|kjcy|KHcy|khcy|DZcy|ecir|edot|eDot|Jscr|jscr|succ|Jopf|jopf|Edot|uHar|emsp|ensp|Iuml|iuml|eopf|isin|Iscr|iscr|Eopf|epar|sung|epsi|escr|sup1|sup2|sup3|Iota|iota|supe|supE|Iopf|iopf|IOcy|iocy|Escr|esim|Esim|imof|Uarr|QUOT|uArr|uarr|euml|IEcy|iecy|Idot|Euml|euro|excl|Hscr|hscr|Hopf|hopf|TScy|tscy|Tscr|hbar|tscr|flat|tbrk|fnof|hArr|harr|half|fopf|Fopf|tdot|gvnE|fork|trie|gtcc|fscr|Fscr|gdot|gsim|Gscr|gscr|Gopf|gopf|gneq|Gdot|tosa|gnap|Topf|topf|geqq|toea|GJcy|gjcy|tint|gesl|mid|Sfr|ggg|top|ges|gla|glE|glj|geq|gne|gEl|gel|gnE|Gcy|gcy|gap|Tfr|tfr|Tcy|tcy|Hat|Tau|Ffr|tau|Tab|hfr|Hfr|ffr|Fcy|fcy|icy|Icy|iff|ETH|eth|ifr|Ifr|Eta|eta|int|Int|Sup|sup|ucy|Ucy|Sum|sum|jcy|ENG|ufr|Ufr|eng|Jcy|jfr|els|ell|egs|Efr|efr|Jfr|uml|kcy|Kcy|Ecy|ecy|kfr|Kfr|lap|Sub|sub|lat|lcy|Lcy|leg|Dot|dot|lEg|leq|les|squ|div|die|lfr|Lfr|lgE|Dfr|dfr|Del|deg|Dcy|dcy|lne|lnE|sol|loz|smt|Cup|lrm|cup|lsh|Lsh|sim|shy|map|Map|mcy|Mcy|mfr|Mfr|mho|gfr|Gfr|sfr|cir|Chi|chi|nap|Cfr|vcy|Vcy|cfr|Scy|scy|ncy|Ncy|vee|Vee|Cap|cap|nfr|scE|sce|Nfr|nge|ngE|nGg|vfr|Vfr|ngt|bot|nGt|nis|niv|Rsh|rsh|nle|nlE|bne|Bfr|bfr|nLl|nlt|nLt|Bcy|bcy|not|Not|rlm|wfr|Wfr|npr|nsc|num|ocy|ast|Ocy|ofr|xfr|Xfr|Ofr|ogt|ohm|apE|olt|Rho|ape|rho|Rfr|rfr|ord|REG|ang|reg|orv|And|and|AMP|Rcy|amp|Afr|ycy|Ycy|yen|yfr|Yfr|rcy|par|pcy|Pcy|pfr|Pfr|phi|Phi|afr|Acy|acy|zcy|Zcy|piv|acE|acd|zfr|Zfr|pre|prE|psi|Psi|qfr|Qfr|zwj|Or|ge|Gg|gt|gg|el|oS|lt|Lt|LT|Re|lg|gl|eg|ne|Im|it|le|DD|wp|wr|nu|Nu|dd|lE|Sc|sc|pi|Pi|ee|af|ll|Ll|rx|gE|xi|pm|Xi|ic|pr|Pr|in|ni|mp|mu|ac|Mu|or|ap|Gt|GT|ii);|&(Aacute|Agrave|Atilde|Ccedil|Eacute|Egrave|Iacute|Igrave|Ntilde|Oacute|Ograve|Oslash|Otilde|Uacute|Ugrave|Yacute|aacute|agrave|atilde|brvbar|ccedil|curren|divide|eacute|egrave|frac12|frac14|frac34|iacute|igrave|iquest|middot|ntilde|oacute|ograve|oslash|otilde|plusmn|uacute|ugrave|yacute|AElig|Acirc|Aring|Ecirc|Icirc|Ocirc|THORN|Ucirc|acirc|acute|aelig|aring|cedil|ecirc|icirc|iexcl|laquo|micro|ocirc|pound|raquo|szlig|thorn|times|ucirc|Auml|COPY|Euml|Iuml|Ouml|QUOT|Uuml|auml|cent|copy|euml|iuml|macr|nbsp|ordf|ordm|ouml|para|quot|sect|sup1|sup2|sup3|uuml|yuml|AMP|ETH|REG|amp|deg|eth|not|reg|shy|uml|yen|GT|LT|gt|lt)(?!;)([=a-zA-Z0-9]?)|&#([0-9]+)(;?)|&#[xX]([a-fA-F0-9]+)(;?)|&([0-9a-zA-Z]+)/g;\n var decodeMap = {\n aacute: \"\\xE1\",\n Aacute: \"\\xC1\",\n abreve: \"\\u0103\",\n Abreve: \"\\u0102\",\n ac: \"\\u223E\",\n acd: \"\\u223F\",\n acE: \"\\u223E\\u0333\",\n acirc: \"\\xE2\",\n Acirc: \"\\xC2\",\n acute: \"\\xB4\",\n acy: \"\\u0430\",\n Acy: \"\\u0410\",\n aelig: \"\\xE6\",\n AElig: \"\\xC6\",\n af: \"\\u2061\",\n afr: \"\\uD835\\uDD1E\",\n Afr: \"\\uD835\\uDD04\",\n agrave: \"\\xE0\",\n Agrave: \"\\xC0\",\n alefsym: \"\\u2135\",\n aleph: \"\\u2135\",\n alpha: \"\\u03B1\",\n Alpha: \"\\u0391\",\n amacr: \"\\u0101\",\n Amacr: \"\\u0100\",\n amalg: \"\\u2A3F\",\n amp: \"&\",\n AMP: \"&\",\n and: \"\\u2227\",\n And: \"\\u2A53\",\n andand: \"\\u2A55\",\n andd: \"\\u2A5C\",\n andslope: \"\\u2A58\",\n andv: \"\\u2A5A\",\n ang: \"\\u2220\",\n ange: \"\\u29A4\",\n angle: \"\\u2220\",\n angmsd: \"\\u2221\",\n angmsdaa: \"\\u29A8\",\n angmsdab: \"\\u29A9\",\n angmsdac: \"\\u29AA\",\n angmsdad: \"\\u29AB\",\n angmsdae: \"\\u29AC\",\n angmsdaf: \"\\u29AD\",\n angmsdag: \"\\u29AE\",\n angmsdah: \"\\u29AF\",\n angrt: \"\\u221F\",\n angrtvb: \"\\u22BE\",\n angrtvbd: \"\\u299D\",\n angsph: \"\\u2222\",\n angst: \"\\xC5\",\n angzarr: \"\\u237C\",\n aogon: \"\\u0105\",\n Aogon: \"\\u0104\",\n aopf: \"\\uD835\\uDD52\",\n Aopf: \"\\uD835\\uDD38\",\n ap: \"\\u2248\",\n apacir: \"\\u2A6F\",\n ape: \"\\u224A\",\n apE: \"\\u2A70\",\n apid: \"\\u224B\",\n apos: \"'\",\n ApplyFunction: \"\\u2061\",\n approx: \"\\u2248\",\n approxeq: \"\\u224A\",\n aring: \"\\xE5\",\n Aring: \"\\xC5\",\n ascr: \"\\uD835\\uDCB6\",\n Ascr: \"\\uD835\\uDC9C\",\n Assign: \"\\u2254\",\n ast: \"*\",\n asymp: \"\\u2248\",\n asympeq: \"\\u224D\",\n atilde: \"\\xE3\",\n Atilde: \"\\xC3\",\n auml: \"\\xE4\",\n Auml: \"\\xC4\",\n awconint: \"\\u2233\",\n awint: \"\\u2A11\",\n backcong: \"\\u224C\",\n backepsilon: \"\\u03F6\",\n backprime: \"\\u2035\",\n backsim: \"\\u223D\",\n backsimeq: \"\\u22CD\",\n Backslash: \"\\u2216\",\n Barv: \"\\u2AE7\",\n barvee: \"\\u22BD\",\n barwed: \"\\u2305\",\n Barwed: \"\\u2306\",\n barwedge: \"\\u2305\",\n bbrk: \"\\u23B5\",\n bbrktbrk: \"\\u23B6\",\n bcong: \"\\u224C\",\n bcy: \"\\u0431\",\n Bcy: \"\\u0411\",\n bdquo: \"\\u201E\",\n becaus: \"\\u2235\",\n because: \"\\u2235\",\n Because: \"\\u2235\",\n bemptyv: \"\\u29B0\",\n bepsi: \"\\u03F6\",\n bernou: \"\\u212C\",\n Bernoullis: \"\\u212C\",\n beta: \"\\u03B2\",\n Beta: \"\\u0392\",\n beth: \"\\u2136\",\n between: \"\\u226C\",\n bfr: \"\\uD835\\uDD1F\",\n Bfr: \"\\uD835\\uDD05\",\n bigcap: \"\\u22C2\",\n bigcirc: \"\\u25EF\",\n bigcup: \"\\u22C3\",\n bigodot: \"\\u2A00\",\n bigoplus: \"\\u2A01\",\n bigotimes: \"\\u2A02\",\n bigsqcup: \"\\u2A06\",\n bigstar: \"\\u2605\",\n bigtriangledown: \"\\u25BD\",\n bigtriangleup: \"\\u25B3\",\n biguplus: \"\\u2A04\",\n bigvee: \"\\u22C1\",\n bigwedge: \"\\u22C0\",\n bkarow: \"\\u290D\",\n blacklozenge: \"\\u29EB\",\n blacksquare: \"\\u25AA\",\n blacktriangle: \"\\u25B4\",\n blacktriangledown: \"\\u25BE\",\n blacktriangleleft: \"\\u25C2\",\n blacktriangleright: \"\\u25B8\",\n blank: \"\\u2423\",\n blk12: \"\\u2592\",\n blk14: \"\\u2591\",\n blk34: \"\\u2593\",\n block: \"\\u2588\",\n bne: \"=\\u20E5\",\n bnequiv: \"\\u2261\\u20E5\",\n bnot: \"\\u2310\",\n bNot: \"\\u2AED\",\n bopf: \"\\uD835\\uDD53\",\n Bopf: \"\\uD835\\uDD39\",\n bot: \"\\u22A5\",\n bottom: \"\\u22A5\",\n bowtie: \"\\u22C8\",\n boxbox: \"\\u29C9\",\n boxdl: \"\\u2510\",\n boxdL: \"\\u2555\",\n boxDl: \"\\u2556\",\n boxDL: \"\\u2557\",\n boxdr: \"\\u250C\",\n boxdR: \"\\u2552\",\n boxDr: \"\\u2553\",\n boxDR: \"\\u2554\",\n boxh: \"\\u2500\",\n boxH: \"\\u2550\",\n boxhd: \"\\u252C\",\n boxhD: \"\\u2565\",\n boxHd: \"\\u2564\",\n boxHD: \"\\u2566\",\n boxhu: \"\\u2534\",\n boxhU: \"\\u2568\",\n boxHu: \"\\u2567\",\n boxHU: \"\\u2569\",\n boxminus: \"\\u229F\",\n boxplus: \"\\u229E\",\n boxtimes: \"\\u22A0\",\n boxul: \"\\u2518\",\n boxuL: \"\\u255B\",\n boxUl: \"\\u255C\",\n boxUL: \"\\u255D\",\n boxur: \"\\u2514\",\n boxuR: \"\\u2558\",\n boxUr: \"\\u2559\",\n boxUR: \"\\u255A\",\n boxv: \"\\u2502\",\n boxV: \"\\u2551\",\n boxvh: \"\\u253C\",\n boxvH: \"\\u256A\",\n boxVh: \"\\u256B\",\n boxVH: \"\\u256C\",\n boxvl: \"\\u2524\",\n boxvL: \"\\u2561\",\n boxVl: \"\\u2562\",\n boxVL: \"\\u2563\",\n boxvr: \"\\u251C\",\n boxvR: \"\\u255E\",\n boxVr: \"\\u255F\",\n boxVR: \"\\u2560\",\n bprime: \"\\u2035\",\n breve: \"\\u02D8\",\n Breve: \"\\u02D8\",\n brvbar: \"\\xA6\",\n bscr: \"\\uD835\\uDCB7\",\n Bscr: \"\\u212C\",\n bsemi: \"\\u204F\",\n bsim: \"\\u223D\",\n bsime: \"\\u22CD\",\n bsol: \"\\\\\",\n bsolb: \"\\u29C5\",\n bsolhsub: \"\\u27C8\",\n bull: \"\\u2022\",\n bullet: \"\\u2022\",\n bump: \"\\u224E\",\n bumpe: \"\\u224F\",\n bumpE: \"\\u2AAE\",\n bumpeq: \"\\u224F\",\n Bumpeq: \"\\u224E\",\n cacute: \"\\u0107\",\n Cacute: \"\\u0106\",\n cap: \"\\u2229\",\n Cap: \"\\u22D2\",\n capand: \"\\u2A44\",\n capbrcup: \"\\u2A49\",\n capcap: \"\\u2A4B\",\n capcup: \"\\u2A47\",\n capdot: \"\\u2A40\",\n CapitalDifferentialD: \"\\u2145\",\n caps: \"\\u2229\\uFE00\",\n caret: \"\\u2041\",\n caron: \"\\u02C7\",\n Cayleys: \"\\u212D\",\n ccaps: \"\\u2A4D\",\n ccaron: \"\\u010D\",\n Ccaron: \"\\u010C\",\n ccedil: \"\\xE7\",\n Ccedil: \"\\xC7\",\n ccirc: \"\\u0109\",\n Ccirc: \"\\u0108\",\n Cconint: \"\\u2230\",\n ccups: \"\\u2A4C\",\n ccupssm: \"\\u2A50\",\n cdot: \"\\u010B\",\n Cdot: \"\\u010A\",\n cedil: \"\\xB8\",\n Cedilla: \"\\xB8\",\n cemptyv: \"\\u29B2\",\n cent: \"\\xA2\",\n centerdot: \"\\xB7\",\n CenterDot: \"\\xB7\",\n cfr: \"\\uD835\\uDD20\",\n Cfr: \"\\u212D\",\n chcy: \"\\u0447\",\n CHcy: \"\\u0427\",\n check: \"\\u2713\",\n checkmark: \"\\u2713\",\n chi: \"\\u03C7\",\n Chi: \"\\u03A7\",\n cir: \"\\u25CB\",\n circ: \"\\u02C6\",\n circeq: \"\\u2257\",\n circlearrowleft: \"\\u21BA\",\n circlearrowright: \"\\u21BB\",\n circledast: \"\\u229B\",\n circledcirc: \"\\u229A\",\n circleddash: \"\\u229D\",\n CircleDot: \"\\u2299\",\n circledR: \"\\xAE\",\n circledS: \"\\u24C8\",\n CircleMinus: \"\\u2296\",\n CirclePlus: \"\\u2295\",\n CircleTimes: \"\\u2297\",\n cire: \"\\u2257\",\n cirE: \"\\u29C3\",\n cirfnint: \"\\u2A10\",\n cirmid: \"\\u2AEF\",\n cirscir: \"\\u29C2\",\n ClockwiseContourIntegral: \"\\u2232\",\n CloseCurlyDoubleQuote: \"\\u201D\",\n CloseCurlyQuote: \"\\u2019\",\n clubs: \"\\u2663\",\n clubsuit: \"\\u2663\",\n colon: \":\",\n Colon: \"\\u2237\",\n colone: \"\\u2254\",\n Colone: \"\\u2A74\",\n coloneq: \"\\u2254\",\n comma: \",\",\n commat: \"@\",\n comp: \"\\u2201\",\n compfn: \"\\u2218\",\n complement: \"\\u2201\",\n complexes: \"\\u2102\",\n cong: \"\\u2245\",\n congdot: \"\\u2A6D\",\n Congruent: \"\\u2261\",\n conint: \"\\u222E\",\n Conint: \"\\u222F\",\n ContourIntegral: \"\\u222E\",\n copf: \"\\uD835\\uDD54\",\n Copf: \"\\u2102\",\n coprod: \"\\u2210\",\n Coproduct: \"\\u2210\",\n copy: \"\\xA9\",\n COPY: \"\\xA9\",\n copysr: \"\\u2117\",\n CounterClockwiseContourIntegral: \"\\u2233\",\n crarr: \"\\u21B5\",\n cross: \"\\u2717\",\n Cross: \"\\u2A2F\",\n cscr: \"\\uD835\\uDCB8\",\n Cscr: \"\\uD835\\uDC9E\",\n csub: \"\\u2ACF\",\n csube: \"\\u2AD1\",\n csup: \"\\u2AD0\",\n csupe: \"\\u2AD2\",\n ctdot: \"\\u22EF\",\n cudarrl: \"\\u2938\",\n cudarrr: \"\\u2935\",\n cuepr: \"\\u22DE\",\n cuesc: \"\\u22DF\",\n cularr: \"\\u21B6\",\n cularrp: \"\\u293D\",\n cup: \"\\u222A\",\n Cup: \"\\u22D3\",\n cupbrcap: \"\\u2A48\",\n cupcap: \"\\u2A46\",\n CupCap: \"\\u224D\",\n cupcup: \"\\u2A4A\",\n cupdot: \"\\u228D\",\n cupor: \"\\u2A45\",\n cups: \"\\u222A\\uFE00\",\n curarr: \"\\u21B7\",\n curarrm: \"\\u293C\",\n curlyeqprec: \"\\u22DE\",\n curlyeqsucc: \"\\u22DF\",\n curlyvee: \"\\u22CE\",\n curlywedge: \"\\u22CF\",\n curren: \"\\xA4\",\n curvearrowleft: \"\\u21B6\",\n curvearrowright: \"\\u21B7\",\n cuvee: \"\\u22CE\",\n cuwed: \"\\u22CF\",\n cwconint: \"\\u2232\",\n cwint: \"\\u2231\",\n cylcty: \"\\u232D\",\n dagger: \"\\u2020\",\n Dagger: \"\\u2021\",\n daleth: \"\\u2138\",\n darr: \"\\u2193\",\n dArr: \"\\u21D3\",\n Darr: \"\\u21A1\",\n dash: \"\\u2010\",\n dashv: \"\\u22A3\",\n Dashv: \"\\u2AE4\",\n dbkarow: \"\\u290F\",\n dblac: \"\\u02DD\",\n dcaron: \"\\u010F\",\n Dcaron: \"\\u010E\",\n dcy: \"\\u0434\",\n Dcy: \"\\u0414\",\n dd: \"\\u2146\",\n DD: \"\\u2145\",\n ddagger: \"\\u2021\",\n ddarr: \"\\u21CA\",\n DDotrahd: \"\\u2911\",\n ddotseq: \"\\u2A77\",\n deg: \"\\xB0\",\n Del: \"\\u2207\",\n delta: \"\\u03B4\",\n Delta: \"\\u0394\",\n demptyv: \"\\u29B1\",\n dfisht: \"\\u297F\",\n dfr: \"\\uD835\\uDD21\",\n Dfr: \"\\uD835\\uDD07\",\n dHar: \"\\u2965\",\n dharl: \"\\u21C3\",\n dharr: \"\\u21C2\",\n DiacriticalAcute: \"\\xB4\",\n DiacriticalDot: \"\\u02D9\",\n DiacriticalDoubleAcute: \"\\u02DD\",\n DiacriticalGrave: \"`\",\n DiacriticalTilde: \"\\u02DC\",\n diam: \"\\u22C4\",\n diamond: \"\\u22C4\",\n Diamond: \"\\u22C4\",\n diamondsuit: \"\\u2666\",\n diams: \"\\u2666\",\n die: \"\\xA8\",\n DifferentialD: \"\\u2146\",\n digamma: \"\\u03DD\",\n disin: \"\\u22F2\",\n div: \"\\xF7\",\n divide: \"\\xF7\",\n divideontimes: \"\\u22C7\",\n divonx: \"\\u22C7\",\n djcy: \"\\u0452\",\n DJcy: \"\\u0402\",\n dlcorn: \"\\u231E\",\n dlcrop: \"\\u230D\",\n dollar: \"$\",\n dopf: \"\\uD835\\uDD55\",\n Dopf: \"\\uD835\\uDD3B\",\n dot: \"\\u02D9\",\n Dot: \"\\xA8\",\n DotDot: \"\\u20DC\",\n doteq: \"\\u2250\",\n doteqdot: \"\\u2251\",\n DotEqual: \"\\u2250\",\n dotminus: \"\\u2238\",\n dotplus: \"\\u2214\",\n dotsquare: \"\\u22A1\",\n doublebarwedge: \"\\u2306\",\n DoubleContourIntegral: \"\\u222F\",\n DoubleDot: \"\\xA8\",\n DoubleDownArrow: \"\\u21D3\",\n DoubleLeftArrow: \"\\u21D0\",\n DoubleLeftRightArrow: \"\\u21D4\",\n DoubleLeftTee: \"\\u2AE4\",\n DoubleLongLeftArrow: \"\\u27F8\",\n DoubleLongLeftRightArrow: \"\\u27FA\",\n DoubleLongRightArrow: \"\\u27F9\",\n DoubleRightArrow: \"\\u21D2\",\n DoubleRightTee: \"\\u22A8\",\n DoubleUpArrow: \"\\u21D1\",\n DoubleUpDownArrow: \"\\u21D5\",\n DoubleVerticalBar: \"\\u2225\",\n downarrow: \"\\u2193\",\n Downarrow: \"\\u21D3\",\n DownArrow: \"\\u2193\",\n DownArrowBar: \"\\u2913\",\n DownArrowUpArrow: \"\\u21F5\",\n DownBreve: \"\\u0311\",\n downdownarrows: \"\\u21CA\",\n downharpoonleft: \"\\u21C3\",\n downharpoonright: \"\\u21C2\",\n DownLeftRightVector: \"\\u2950\",\n DownLeftTeeVector: \"\\u295E\",\n DownLeftVector: \"\\u21BD\",\n DownLeftVectorBar: \"\\u2956\",\n DownRightTeeVector: \"\\u295F\",\n DownRightVector: \"\\u21C1\",\n DownRightVectorBar: \"\\u2957\",\n DownTee: \"\\u22A4\",\n DownTeeArrow: \"\\u21A7\",\n drbkarow: \"\\u2910\",\n drcorn: \"\\u231F\",\n drcrop: \"\\u230C\",\n dscr: \"\\uD835\\uDCB9\",\n Dscr: \"\\uD835\\uDC9F\",\n dscy: \"\\u0455\",\n DScy: \"\\u0405\",\n dsol: \"\\u29F6\",\n dstrok: \"\\u0111\",\n Dstrok: \"\\u0110\",\n dtdot: \"\\u22F1\",\n dtri: \"\\u25BF\",\n dtrif: \"\\u25BE\",\n duarr: \"\\u21F5\",\n duhar: \"\\u296F\",\n dwangle: \"\\u29A6\",\n dzcy: \"\\u045F\",\n DZcy: \"\\u040F\",\n dzigrarr: \"\\u27FF\",\n eacute: \"\\xE9\",\n Eacute: \"\\xC9\",\n easter: \"\\u2A6E\",\n ecaron: \"\\u011B\",\n Ecaron: \"\\u011A\",\n ecir: \"\\u2256\",\n ecirc: \"\\xEA\",\n Ecirc: \"\\xCA\",\n ecolon: \"\\u2255\",\n ecy: \"\\u044D\",\n Ecy: \"\\u042D\",\n eDDot: \"\\u2A77\",\n edot: \"\\u0117\",\n eDot: \"\\u2251\",\n Edot: \"\\u0116\",\n ee: \"\\u2147\",\n efDot: \"\\u2252\",\n efr: \"\\uD835\\uDD22\",\n Efr: \"\\uD835\\uDD08\",\n eg: \"\\u2A9A\",\n egrave: \"\\xE8\",\n Egrave: \"\\xC8\",\n egs: \"\\u2A96\",\n egsdot: \"\\u2A98\",\n el: \"\\u2A99\",\n Element: \"\\u2208\",\n elinters: \"\\u23E7\",\n ell: \"\\u2113\",\n els: \"\\u2A95\",\n elsdot: \"\\u2A97\",\n emacr: \"\\u0113\",\n Emacr: \"\\u0112\",\n empty: \"\\u2205\",\n emptyset: \"\\u2205\",\n EmptySmallSquare: \"\\u25FB\",\n emptyv: \"\\u2205\",\n EmptyVerySmallSquare: \"\\u25AB\",\n emsp: \"\\u2003\",\n emsp13: \"\\u2004\",\n emsp14: \"\\u2005\",\n eng: \"\\u014B\",\n ENG: \"\\u014A\",\n ensp: \"\\u2002\",\n eogon: \"\\u0119\",\n Eogon: \"\\u0118\",\n eopf: \"\\uD835\\uDD56\",\n Eopf: \"\\uD835\\uDD3C\",\n epar: \"\\u22D5\",\n eparsl: \"\\u29E3\",\n eplus: \"\\u2A71\",\n epsi: \"\\u03B5\",\n epsilon: \"\\u03B5\",\n Epsilon: \"\\u0395\",\n epsiv: \"\\u03F5\",\n eqcirc: \"\\u2256\",\n eqcolon: \"\\u2255\",\n eqsim: \"\\u2242\",\n eqslantgtr: \"\\u2A96\",\n eqslantless: \"\\u2A95\",\n Equal: \"\\u2A75\",\n equals: \"=\",\n EqualTilde: \"\\u2242\",\n equest: \"\\u225F\",\n Equilibrium: \"\\u21CC\",\n equiv: \"\\u2261\",\n equivDD: \"\\u2A78\",\n eqvparsl: \"\\u29E5\",\n erarr: \"\\u2971\",\n erDot: \"\\u2253\",\n escr: \"\\u212F\",\n Escr: \"\\u2130\",\n esdot: \"\\u2250\",\n esim: \"\\u2242\",\n Esim: \"\\u2A73\",\n eta: \"\\u03B7\",\n Eta: \"\\u0397\",\n eth: \"\\xF0\",\n ETH: \"\\xD0\",\n euml: \"\\xEB\",\n Euml: \"\\xCB\",\n euro: \"\\u20AC\",\n excl: \"!\",\n exist: \"\\u2203\",\n Exists: \"\\u2203\",\n expectation: \"\\u2130\",\n exponentiale: \"\\u2147\",\n ExponentialE: \"\\u2147\",\n fallingdotseq: \"\\u2252\",\n fcy: \"\\u0444\",\n Fcy: \"\\u0424\",\n female: \"\\u2640\",\n ffilig: \"\\uFB03\",\n fflig: \"\\uFB00\",\n ffllig: \"\\uFB04\",\n ffr: \"\\uD835\\uDD23\",\n Ffr: \"\\uD835\\uDD09\",\n filig: \"\\uFB01\",\n FilledSmallSquare: \"\\u25FC\",\n FilledVerySmallSquare: \"\\u25AA\",\n fjlig: \"fj\",\n flat: \"\\u266D\",\n fllig: \"\\uFB02\",\n fltns: \"\\u25B1\",\n fnof: \"\\u0192\",\n fopf: \"\\uD835\\uDD57\",\n Fopf: \"\\uD835\\uDD3D\",\n forall: \"\\u2200\",\n ForAll: \"\\u2200\",\n fork: \"\\u22D4\",\n forkv: \"\\u2AD9\",\n Fouriertrf: \"\\u2131\",\n fpartint: \"\\u2A0D\",\n frac12: \"\\xBD\",\n frac13: \"\\u2153\",\n frac14: \"\\xBC\",\n frac15: \"\\u2155\",\n frac16: \"\\u2159\",\n frac18: \"\\u215B\",\n frac23: \"\\u2154\",\n frac25: \"\\u2156\",\n frac34: \"\\xBE\",\n frac35: \"\\u2157\",\n frac38: \"\\u215C\",\n frac45: \"\\u2158\",\n frac56: \"\\u215A\",\n frac58: \"\\u215D\",\n frac78: \"\\u215E\",\n frasl: \"\\u2044\",\n frown: \"\\u2322\",\n fscr: \"\\uD835\\uDCBB\",\n Fscr: \"\\u2131\",\n gacute: \"\\u01F5\",\n gamma: \"\\u03B3\",\n Gamma: \"\\u0393\",\n gammad: \"\\u03DD\",\n Gammad: \"\\u03DC\",\n gap: \"\\u2A86\",\n gbreve: \"\\u011F\",\n Gbreve: \"\\u011E\",\n Gcedil: \"\\u0122\",\n gcirc: \"\\u011D\",\n Gcirc: \"\\u011C\",\n gcy: \"\\u0433\",\n Gcy: \"\\u0413\",\n gdot: \"\\u0121\",\n Gdot: \"\\u0120\",\n ge: \"\\u2265\",\n gE: \"\\u2267\",\n gel: \"\\u22DB\",\n gEl: \"\\u2A8C\",\n geq: \"\\u2265\",\n geqq: \"\\u2267\",\n geqslant: \"\\u2A7E\",\n ges: \"\\u2A7E\",\n gescc: \"\\u2AA9\",\n gesdot: \"\\u2A80\",\n gesdoto: \"\\u2A82\",\n gesdotol: \"\\u2A84\",\n gesl: \"\\u22DB\\uFE00\",\n gesles: \"\\u2A94\",\n gfr: \"\\uD835\\uDD24\",\n Gfr: \"\\uD835\\uDD0A\",\n gg: \"\\u226B\",\n Gg: \"\\u22D9\",\n ggg: \"\\u22D9\",\n gimel: \"\\u2137\",\n gjcy: \"\\u0453\",\n GJcy: \"\\u0403\",\n gl: \"\\u2277\",\n gla: \"\\u2AA5\",\n glE: \"\\u2A92\",\n glj: \"\\u2AA4\",\n gnap: \"\\u2A8A\",\n gnapprox: \"\\u2A8A\",\n gne: \"\\u2A88\",\n gnE: \"\\u2269\",\n gneq: \"\\u2A88\",\n gneqq: \"\\u2269\",\n gnsim: \"\\u22E7\",\n gopf: \"\\uD835\\uDD58\",\n Gopf: \"\\uD835\\uDD3E\",\n grave: \"`\",\n GreaterEqual: \"\\u2265\",\n GreaterEqualLess: \"\\u22DB\",\n GreaterFullEqual: \"\\u2267\",\n GreaterGreater: \"\\u2AA2\",\n GreaterLess: \"\\u2277\",\n GreaterSlantEqual: \"\\u2A7E\",\n GreaterTilde: \"\\u2273\",\n gscr: \"\\u210A\",\n Gscr: \"\\uD835\\uDCA2\",\n gsim: \"\\u2273\",\n gsime: \"\\u2A8E\",\n gsiml: \"\\u2A90\",\n gt: \">\",\n Gt: \"\\u226B\",\n GT: \">\",\n gtcc: \"\\u2AA7\",\n gtcir: \"\\u2A7A\",\n gtdot: \"\\u22D7\",\n gtlPar: \"\\u2995\",\n gtquest: \"\\u2A7C\",\n gtrapprox: \"\\u2A86\",\n gtrarr: \"\\u2978\",\n gtrdot: \"\\u22D7\",\n gtreqless: \"\\u22DB\",\n gtreqqless: \"\\u2A8C\",\n gtrless: \"\\u2277\",\n gtrsim: \"\\u2273\",\n gvertneqq: \"\\u2269\\uFE00\",\n gvnE: \"\\u2269\\uFE00\",\n Hacek: \"\\u02C7\",\n hairsp: \"\\u200A\",\n half: \"\\xBD\",\n hamilt: \"\\u210B\",\n hardcy: \"\\u044A\",\n HARDcy: \"\\u042A\",\n harr: \"\\u2194\",\n hArr: \"\\u21D4\",\n harrcir: \"\\u2948\",\n harrw: \"\\u21AD\",\n Hat: \"^\",\n hbar: \"\\u210F\",\n hcirc: \"\\u0125\",\n Hcirc: \"\\u0124\",\n hearts: \"\\u2665\",\n heartsuit: \"\\u2665\",\n hellip: \"\\u2026\",\n hercon: \"\\u22B9\",\n hfr: \"\\uD835\\uDD25\",\n Hfr: \"\\u210C\",\n HilbertSpace: \"\\u210B\",\n hksearow: \"\\u2925\",\n hkswarow: \"\\u2926\",\n hoarr: \"\\u21FF\",\n homtht: \"\\u223B\",\n hookleftarrow: \"\\u21A9\",\n hookrightarrow: \"\\u21AA\",\n hopf: \"\\uD835\\uDD59\",\n Hopf: \"\\u210D\",\n horbar: \"\\u2015\",\n HorizontalLine: \"\\u2500\",\n hscr: \"\\uD835\\uDCBD\",\n Hscr: \"\\u210B\",\n hslash: \"\\u210F\",\n hstrok: \"\\u0127\",\n Hstrok: \"\\u0126\",\n HumpDownHump: \"\\u224E\",\n HumpEqual: \"\\u224F\",\n hybull: \"\\u2043\",\n hyphen: \"\\u2010\",\n iacute: \"\\xED\",\n Iacute: \"\\xCD\",\n ic: \"\\u2063\",\n icirc: \"\\xEE\",\n Icirc: \"\\xCE\",\n icy: \"\\u0438\",\n Icy: \"\\u0418\",\n Idot: \"\\u0130\",\n iecy: \"\\u0435\",\n IEcy: \"\\u0415\",\n iexcl: \"\\xA1\",\n iff: \"\\u21D4\",\n ifr: \"\\uD835\\uDD26\",\n Ifr: \"\\u2111\",\n igrave: \"\\xEC\",\n Igrave: \"\\xCC\",\n ii: \"\\u2148\",\n iiiint: \"\\u2A0C\",\n iiint: \"\\u222D\",\n iinfin: \"\\u29DC\",\n iiota: \"\\u2129\",\n ijlig: \"\\u0133\",\n IJlig: \"\\u0132\",\n Im: \"\\u2111\",\n imacr: \"\\u012B\",\n Imacr: \"\\u012A\",\n image: \"\\u2111\",\n ImaginaryI: \"\\u2148\",\n imagline: \"\\u2110\",\n imagpart: \"\\u2111\",\n imath: \"\\u0131\",\n imof: \"\\u22B7\",\n imped: \"\\u01B5\",\n Implies: \"\\u21D2\",\n in: \"\\u2208\",\n incare: \"\\u2105\",\n infin: \"\\u221E\",\n infintie: \"\\u29DD\",\n inodot: \"\\u0131\",\n int: \"\\u222B\",\n Int: \"\\u222C\",\n intcal: \"\\u22BA\",\n integers: \"\\u2124\",\n Integral: \"\\u222B\",\n intercal: \"\\u22BA\",\n Intersection: \"\\u22C2\",\n intlarhk: \"\\u2A17\",\n intprod: \"\\u2A3C\",\n InvisibleComma: \"\\u2063\",\n InvisibleTimes: \"\\u2062\",\n iocy: \"\\u0451\",\n IOcy: \"\\u0401\",\n iogon: \"\\u012F\",\n Iogon: \"\\u012E\",\n iopf: \"\\uD835\\uDD5A\",\n Iopf: \"\\uD835\\uDD40\",\n iota: \"\\u03B9\",\n Iota: \"\\u0399\",\n iprod: \"\\u2A3C\",\n iquest: \"\\xBF\",\n iscr: \"\\uD835\\uDCBE\",\n Iscr: \"\\u2110\",\n isin: \"\\u2208\",\n isindot: \"\\u22F5\",\n isinE: \"\\u22F9\",\n isins: \"\\u22F4\",\n isinsv: \"\\u22F3\",\n isinv: \"\\u2208\",\n it: \"\\u2062\",\n itilde: \"\\u0129\",\n Itilde: \"\\u0128\",\n iukcy: \"\\u0456\",\n Iukcy: \"\\u0406\",\n iuml: \"\\xEF\",\n Iuml: \"\\xCF\",\n jcirc: \"\\u0135\",\n Jcirc: \"\\u0134\",\n jcy: \"\\u0439\",\n Jcy: \"\\u0419\",\n jfr: \"\\uD835\\uDD27\",\n Jfr: \"\\uD835\\uDD0D\",\n jmath: \"\\u0237\",\n jopf: \"\\uD835\\uDD5B\",\n Jopf: \"\\uD835\\uDD41\",\n jscr: \"\\uD835\\uDCBF\",\n Jscr: \"\\uD835\\uDCA5\",\n jsercy: \"\\u0458\",\n Jsercy: \"\\u0408\",\n jukcy: \"\\u0454\",\n Jukcy: \"\\u0404\",\n kappa: \"\\u03BA\",\n Kappa: \"\\u039A\",\n kappav: \"\\u03F0\",\n kcedil: \"\\u0137\",\n Kcedil: \"\\u0136\",\n kcy: \"\\u043A\",\n Kcy: \"\\u041A\",\n kfr: \"\\uD835\\uDD28\",\n Kfr: \"\\uD835\\uDD0E\",\n kgreen: \"\\u0138\",\n khcy: \"\\u0445\",\n KHcy: \"\\u0425\",\n kjcy: \"\\u045C\",\n KJcy: \"\\u040C\",\n kopf: \"\\uD835\\uDD5C\",\n Kopf: \"\\uD835\\uDD42\",\n kscr: \"\\uD835\\uDCC0\",\n Kscr: \"\\uD835\\uDCA6\",\n lAarr: \"\\u21DA\",\n lacute: \"\\u013A\",\n Lacute: \"\\u0139\",\n laemptyv: \"\\u29B4\",\n lagran: \"\\u2112\",\n lambda: \"\\u03BB\",\n Lambda: \"\\u039B\",\n lang: \"\\u27E8\",\n Lang: \"\\u27EA\",\n langd: \"\\u2991\",\n langle: \"\\u27E8\",\n lap: \"\\u2A85\",\n Laplacetrf: \"\\u2112\",\n laquo: \"\\xAB\",\n larr: \"\\u2190\",\n lArr: \"\\u21D0\",\n Larr: \"\\u219E\",\n larrb: \"\\u21E4\",\n larrbfs: \"\\u291F\",\n larrfs: \"\\u291D\",\n larrhk: \"\\u21A9\",\n larrlp: \"\\u21AB\",\n larrpl: \"\\u2939\",\n larrsim: \"\\u2973\",\n larrtl: \"\\u21A2\",\n lat: \"\\u2AAB\",\n latail: \"\\u2919\",\n lAtail: \"\\u291B\",\n late: \"\\u2AAD\",\n lates: \"\\u2AAD\\uFE00\",\n lbarr: \"\\u290C\",\n lBarr: \"\\u290E\",\n lbbrk: \"\\u2772\",\n lbrace: \"{\",\n lbrack: \"[\",\n lbrke: \"\\u298B\",\n lbrksld: \"\\u298F\",\n lbrkslu: \"\\u298D\",\n lcaron: \"\\u013E\",\n Lcaron: \"\\u013D\",\n lcedil: \"\\u013C\",\n Lcedil: \"\\u013B\",\n lceil: \"\\u2308\",\n lcub: \"{\",\n lcy: \"\\u043B\",\n Lcy: \"\\u041B\",\n ldca: \"\\u2936\",\n ldquo: \"\\u201C\",\n ldquor: \"\\u201E\",\n ldrdhar: \"\\u2967\",\n ldrushar: \"\\u294B\",\n ldsh: \"\\u21B2\",\n le: \"\\u2264\",\n lE: \"\\u2266\",\n LeftAngleBracket: \"\\u27E8\",\n leftarrow: \"\\u2190\",\n Leftarrow: \"\\u21D0\",\n LeftArrow: \"\\u2190\",\n LeftArrowBar: \"\\u21E4\",\n LeftArrowRightArrow: \"\\u21C6\",\n leftarrowtail: \"\\u21A2\",\n LeftCeiling: \"\\u2308\",\n LeftDoubleBracket: \"\\u27E6\",\n LeftDownTeeVector: \"\\u2961\",\n LeftDownVector: \"\\u21C3\",\n LeftDownVectorBar: \"\\u2959\",\n LeftFloor: \"\\u230A\",\n leftharpoondown: \"\\u21BD\",\n leftharpoonup: \"\\u21BC\",\n leftleftarrows: \"\\u21C7\",\n leftrightarrow: \"\\u2194\",\n Leftrightarrow: \"\\u21D4\",\n LeftRightArrow: \"\\u2194\",\n leftrightarrows: \"\\u21C6\",\n leftrightharpoons: \"\\u21CB\",\n leftrightsquigarrow: \"\\u21AD\",\n LeftRightVector: \"\\u294E\",\n LeftTee: \"\\u22A3\",\n LeftTeeArrow: \"\\u21A4\",\n LeftTeeVector: \"\\u295A\",\n leftthreetimes: \"\\u22CB\",\n LeftTriangle: \"\\u22B2\",\n LeftTriangleBar: \"\\u29CF\",\n LeftTriangleEqual: \"\\u22B4\",\n LeftUpDownVector: \"\\u2951\",\n LeftUpTeeVector: \"\\u2960\",\n LeftUpVector: \"\\u21BF\",\n LeftUpVectorBar: \"\\u2958\",\n LeftVector: \"\\u21BC\",\n LeftVectorBar: \"\\u2952\",\n leg: \"\\u22DA\",\n lEg: \"\\u2A8B\",\n leq: \"\\u2264\",\n leqq: \"\\u2266\",\n leqslant: \"\\u2A7D\",\n les: \"\\u2A7D\",\n lescc: \"\\u2AA8\",\n lesdot: \"\\u2A7F\",\n lesdoto: \"\\u2A81\",\n lesdotor: \"\\u2A83\",\n lesg: \"\\u22DA\\uFE00\",\n lesges: \"\\u2A93\",\n lessapprox: \"\\u2A85\",\n lessdot: \"\\u22D6\",\n lesseqgtr: \"\\u22DA\",\n lesseqqgtr: \"\\u2A8B\",\n LessEqualGreater: \"\\u22DA\",\n LessFullEqual: \"\\u2266\",\n LessGreater: \"\\u2276\",\n lessgtr: \"\\u2276\",\n LessLess: \"\\u2AA1\",\n lesssim: \"\\u2272\",\n LessSlantEqual: \"\\u2A7D\",\n LessTilde: \"\\u2272\",\n lfisht: \"\\u297C\",\n lfloor: \"\\u230A\",\n lfr: \"\\uD835\\uDD29\",\n Lfr: \"\\uD835\\uDD0F\",\n lg: \"\\u2276\",\n lgE: \"\\u2A91\",\n lHar: \"\\u2962\",\n lhard: \"\\u21BD\",\n lharu: \"\\u21BC\",\n lharul: \"\\u296A\",\n lhblk: \"\\u2584\",\n ljcy: \"\\u0459\",\n LJcy: \"\\u0409\",\n ll: \"\\u226A\",\n Ll: \"\\u22D8\",\n llarr: \"\\u21C7\",\n llcorner: \"\\u231E\",\n Lleftarrow: \"\\u21DA\",\n llhard: \"\\u296B\",\n lltri: \"\\u25FA\",\n lmidot: \"\\u0140\",\n Lmidot: \"\\u013F\",\n lmoust: \"\\u23B0\",\n lmoustache: \"\\u23B0\",\n lnap: \"\\u2A89\",\n lnapprox: \"\\u2A89\",\n lne: \"\\u2A87\",\n lnE: \"\\u2268\",\n lneq: \"\\u2A87\",\n lneqq: \"\\u2268\",\n lnsim: \"\\u22E6\",\n loang: \"\\u27EC\",\n loarr: \"\\u21FD\",\n lobrk: \"\\u27E6\",\n longleftarrow: \"\\u27F5\",\n Longleftarrow: \"\\u27F8\",\n LongLeftArrow: \"\\u27F5\",\n longleftrightarrow: \"\\u27F7\",\n Longleftrightarrow: \"\\u27FA\",\n LongLeftRightArrow: \"\\u27F7\",\n longmapsto: \"\\u27FC\",\n longrightarrow: \"\\u27F6\",\n Longrightarrow: \"\\u27F9\",\n LongRightArrow: \"\\u27F6\",\n looparrowleft: \"\\u21AB\",\n looparrowright: \"\\u21AC\",\n lopar: \"\\u2985\",\n lopf: \"\\uD835\\uDD5D\",\n Lopf: \"\\uD835\\uDD43\",\n loplus: \"\\u2A2D\",\n lotimes: \"\\u2A34\",\n lowast: \"\\u2217\",\n lowbar: \"_\",\n LowerLeftArrow: \"\\u2199\",\n LowerRightArrow: \"\\u2198\",\n loz: \"\\u25CA\",\n lozenge: \"\\u25CA\",\n lozf: \"\\u29EB\",\n lpar: \"(\",\n lparlt: \"\\u2993\",\n lrarr: \"\\u21C6\",\n lrcorner: \"\\u231F\",\n lrhar: \"\\u21CB\",\n lrhard: \"\\u296D\",\n lrm: \"\\u200E\",\n lrtri: \"\\u22BF\",\n lsaquo: \"\\u2039\",\n lscr: \"\\uD835\\uDCC1\",\n Lscr: \"\\u2112\",\n lsh: \"\\u21B0\",\n Lsh: \"\\u21B0\",\n lsim: \"\\u2272\",\n lsime: \"\\u2A8D\",\n lsimg: \"\\u2A8F\",\n lsqb: \"[\",\n lsquo: \"\\u2018\",\n lsquor: \"\\u201A\",\n lstrok: \"\\u0142\",\n Lstrok: \"\\u0141\",\n lt: \"<\",\n Lt: \"\\u226A\",\n LT: \"<\",\n ltcc: \"\\u2AA6\",\n ltcir: \"\\u2A79\",\n ltdot: \"\\u22D6\",\n lthree: \"\\u22CB\",\n ltimes: \"\\u22C9\",\n ltlarr: \"\\u2976\",\n ltquest: \"\\u2A7B\",\n ltri: \"\\u25C3\",\n ltrie: \"\\u22B4\",\n ltrif: \"\\u25C2\",\n ltrPar: \"\\u2996\",\n lurdshar: \"\\u294A\",\n luruhar: \"\\u2966\",\n lvertneqq: \"\\u2268\\uFE00\",\n lvnE: \"\\u2268\\uFE00\",\n macr: \"\\xAF\",\n male: \"\\u2642\",\n malt: \"\\u2720\",\n maltese: \"\\u2720\",\n map: \"\\u21A6\",\n Map: \"\\u2905\",\n mapsto: \"\\u21A6\",\n mapstodown: \"\\u21A7\",\n mapstoleft: \"\\u21A4\",\n mapstoup: \"\\u21A5\",\n marker: \"\\u25AE\",\n mcomma: \"\\u2A29\",\n mcy: \"\\u043C\",\n Mcy: \"\\u041C\",\n mdash: \"\\u2014\",\n mDDot: \"\\u223A\",\n measuredangle: \"\\u2221\",\n MediumSpace: \"\\u205F\",\n Mellintrf: \"\\u2133\",\n mfr: \"\\uD835\\uDD2A\",\n Mfr: \"\\uD835\\uDD10\",\n mho: \"\\u2127\",\n micro: \"\\xB5\",\n mid: \"\\u2223\",\n midast: \"*\",\n midcir: \"\\u2AF0\",\n middot: \"\\xB7\",\n minus: \"\\u2212\",\n minusb: \"\\u229F\",\n minusd: \"\\u2238\",\n minusdu: \"\\u2A2A\",\n MinusPlus: \"\\u2213\",\n mlcp: \"\\u2ADB\",\n mldr: \"\\u2026\",\n mnplus: \"\\u2213\",\n models: \"\\u22A7\",\n mopf: \"\\uD835\\uDD5E\",\n Mopf: \"\\uD835\\uDD44\",\n mp: \"\\u2213\",\n mscr: \"\\uD835\\uDCC2\",\n Mscr: \"\\u2133\",\n mstpos: \"\\u223E\",\n mu: \"\\u03BC\",\n Mu: \"\\u039C\",\n multimap: \"\\u22B8\",\n mumap: \"\\u22B8\",\n nabla: \"\\u2207\",\n nacute: \"\\u0144\",\n Nacute: \"\\u0143\",\n nang: \"\\u2220\\u20D2\",\n nap: \"\\u2249\",\n napE: \"\\u2A70\\u0338\",\n napid: \"\\u224B\\u0338\",\n napos: \"\\u0149\",\n napprox: \"\\u2249\",\n natur: \"\\u266E\",\n natural: \"\\u266E\",\n naturals: \"\\u2115\",\n nbsp: \"\\xA0\",\n nbump: \"\\u224E\\u0338\",\n nbumpe: \"\\u224F\\u0338\",\n ncap: \"\\u2A43\",\n ncaron: \"\\u0148\",\n Ncaron: \"\\u0147\",\n ncedil: \"\\u0146\",\n Ncedil: \"\\u0145\",\n ncong: \"\\u2247\",\n ncongdot: \"\\u2A6D\\u0338\",\n ncup: \"\\u2A42\",\n ncy: \"\\u043D\",\n Ncy: \"\\u041D\",\n ndash: \"\\u2013\",\n ne: \"\\u2260\",\n nearhk: \"\\u2924\",\n nearr: \"\\u2197\",\n neArr: \"\\u21D7\",\n nearrow: \"\\u2197\",\n nedot: \"\\u2250\\u0338\",\n NegativeMediumSpace: \"\\u200B\",\n NegativeThickSpace: \"\\u200B\",\n NegativeThinSpace: \"\\u200B\",\n NegativeVeryThinSpace: \"\\u200B\",\n nequiv: \"\\u2262\",\n nesear: \"\\u2928\",\n nesim: \"\\u2242\\u0338\",\n NestedGreaterGreater: \"\\u226B\",\n NestedLessLess: \"\\u226A\",\n NewLine: \"\\n\",\n nexist: \"\\u2204\",\n nexists: \"\\u2204\",\n nfr: \"\\uD835\\uDD2B\",\n Nfr: \"\\uD835\\uDD11\",\n nge: \"\\u2271\",\n ngE: \"\\u2267\\u0338\",\n ngeq: \"\\u2271\",\n ngeqq: \"\\u2267\\u0338\",\n ngeqslant: \"\\u2A7E\\u0338\",\n nges: \"\\u2A7E\\u0338\",\n nGg: \"\\u22D9\\u0338\",\n ngsim: \"\\u2275\",\n ngt: \"\\u226F\",\n nGt: \"\\u226B\\u20D2\",\n ngtr: \"\\u226F\",\n nGtv: \"\\u226B\\u0338\",\n nharr: \"\\u21AE\",\n nhArr: \"\\u21CE\",\n nhpar: \"\\u2AF2\",\n ni: \"\\u220B\",\n nis: \"\\u22FC\",\n nisd: \"\\u22FA\",\n niv: \"\\u220B\",\n njcy: \"\\u045A\",\n NJcy: \"\\u040A\",\n nlarr: \"\\u219A\",\n nlArr: \"\\u21CD\",\n nldr: \"\\u2025\",\n nle: \"\\u2270\",\n nlE: \"\\u2266\\u0338\",\n nleftarrow: \"\\u219A\",\n nLeftarrow: \"\\u21CD\",\n nleftrightarrow: \"\\u21AE\",\n nLeftrightarrow: \"\\u21CE\",\n nleq: \"\\u2270\",\n nleqq: \"\\u2266\\u0338\",\n nleqslant: \"\\u2A7D\\u0338\",\n nles: \"\\u2A7D\\u0338\",\n nless: \"\\u226E\",\n nLl: \"\\u22D8\\u0338\",\n nlsim: \"\\u2274\",\n nlt: \"\\u226E\",\n nLt: \"\\u226A\\u20D2\",\n nltri: \"\\u22EA\",\n nltrie: \"\\u22EC\",\n nLtv: \"\\u226A\\u0338\",\n nmid: \"\\u2224\",\n NoBreak: \"\\u2060\",\n NonBreakingSpace: \"\\xA0\",\n nopf: \"\\uD835\\uDD5F\",\n Nopf: \"\\u2115\",\n not: \"\\xAC\",\n Not: \"\\u2AEC\",\n NotCongruent: \"\\u2262\",\n NotCupCap: \"\\u226D\",\n NotDoubleVerticalBar: \"\\u2226\",\n NotElement: \"\\u2209\",\n NotEqual: \"\\u2260\",\n NotEqualTilde: \"\\u2242\\u0338\",\n NotExists: \"\\u2204\",\n NotGreater: \"\\u226F\",\n NotGreaterEqual: \"\\u2271\",\n NotGreaterFullEqual: \"\\u2267\\u0338\",\n NotGreaterGreater: \"\\u226B\\u0338\",\n NotGreaterLess: \"\\u2279\",\n NotGreaterSlantEqual: \"\\u2A7E\\u0338\",\n NotGreaterTilde: \"\\u2275\",\n NotHumpDownHump: \"\\u224E\\u0338\",\n NotHumpEqual: \"\\u224F\\u0338\",\n notin: \"\\u2209\",\n notindot: \"\\u22F5\\u0338\",\n notinE: \"\\u22F9\\u0338\",\n notinva: \"\\u2209\",\n notinvb: \"\\u22F7\",\n notinvc: \"\\u22F6\",\n NotLeftTriangle: \"\\u22EA\",\n NotLeftTriangleBar: \"\\u29CF\\u0338\",\n NotLeftTriangleEqual: \"\\u22EC\",\n NotLess: \"\\u226E\",\n NotLessEqual: \"\\u2270\",\n NotLessGreater: \"\\u2278\",\n NotLessLess: \"\\u226A\\u0338\",\n NotLessSlantEqual: \"\\u2A7D\\u0338\",\n NotLessTilde: \"\\u2274\",\n NotNestedGreaterGreater: \"\\u2AA2\\u0338\",\n NotNestedLessLess: \"\\u2AA1\\u0338\",\n notni: \"\\u220C\",\n notniva: \"\\u220C\",\n notnivb: \"\\u22FE\",\n notnivc: \"\\u22FD\",\n NotPrecedes: \"\\u2280\",\n NotPrecedesEqual: \"\\u2AAF\\u0338\",\n NotPrecedesSlantEqual: \"\\u22E0\",\n NotReverseElement: \"\\u220C\",\n NotRightTriangle: \"\\u22EB\",\n NotRightTriangleBar: \"\\u29D0\\u0338\",\n NotRightTriangleEqual: \"\\u22ED\",\n NotSquareSubset: \"\\u228F\\u0338\",\n NotSquareSubsetEqual: \"\\u22E2\",\n NotSquareSuperset: \"\\u2290\\u0338\",\n NotSquareSupersetEqual: \"\\u22E3\",\n NotSubset: \"\\u2282\\u20D2\",\n NotSubsetEqual: \"\\u2288\",\n NotSucceeds: \"\\u2281\",\n NotSucceedsEqual: \"\\u2AB0\\u0338\",\n NotSucceedsSlantEqual: \"\\u22E1\",\n NotSucceedsTilde: \"\\u227F\\u0338\",\n NotSuperset: \"\\u2283\\u20D2\",\n NotSupersetEqual: \"\\u2289\",\n NotTilde: \"\\u2241\",\n NotTildeEqual: \"\\u2244\",\n NotTildeFullEqual: \"\\u2247\",\n NotTildeTilde: \"\\u2249\",\n NotVerticalBar: \"\\u2224\",\n npar: \"\\u2226\",\n nparallel: \"\\u2226\",\n nparsl: \"\\u2AFD\\u20E5\",\n npart: \"\\u2202\\u0338\",\n npolint: \"\\u2A14\",\n npr: \"\\u2280\",\n nprcue: \"\\u22E0\",\n npre: \"\\u2AAF\\u0338\",\n nprec: \"\\u2280\",\n npreceq: \"\\u2AAF\\u0338\",\n nrarr: \"\\u219B\",\n nrArr: \"\\u21CF\",\n nrarrc: \"\\u2933\\u0338\",\n nrarrw: \"\\u219D\\u0338\",\n nrightarrow: \"\\u219B\",\n nRightarrow: \"\\u21CF\",\n nrtri: \"\\u22EB\",\n nrtrie: \"\\u22ED\",\n nsc: \"\\u2281\",\n nsccue: \"\\u22E1\",\n nsce: \"\\u2AB0\\u0338\",\n nscr: \"\\uD835\\uDCC3\",\n Nscr: \"\\uD835\\uDCA9\",\n nshortmid: \"\\u2224\",\n nshortparallel: \"\\u2226\",\n nsim: \"\\u2241\",\n nsime: \"\\u2244\",\n nsimeq: \"\\u2244\",\n nsmid: \"\\u2224\",\n nspar: \"\\u2226\",\n nsqsube: \"\\u22E2\",\n nsqsupe: \"\\u22E3\",\n nsub: \"\\u2284\",\n nsube: \"\\u2288\",\n nsubE: \"\\u2AC5\\u0338\",\n nsubset: \"\\u2282\\u20D2\",\n nsubseteq: \"\\u2288\",\n nsubseteqq: \"\\u2AC5\\u0338\",\n nsucc: \"\\u2281\",\n nsucceq: \"\\u2AB0\\u0338\",\n nsup: \"\\u2285\",\n nsupe: \"\\u2289\",\n nsupE: \"\\u2AC6\\u0338\",\n nsupset: \"\\u2283\\u20D2\",\n nsupseteq: \"\\u2289\",\n nsupseteqq: \"\\u2AC6\\u0338\",\n ntgl: \"\\u2279\",\n ntilde: \"\\xF1\",\n Ntilde: \"\\xD1\",\n ntlg: \"\\u2278\",\n ntriangleleft: \"\\u22EA\",\n ntrianglelefteq: \"\\u22EC\",\n ntriangleright: \"\\u22EB\",\n ntrianglerighteq: \"\\u22ED\",\n nu: \"\\u03BD\",\n Nu: \"\\u039D\",\n num: \"#\",\n numero: \"\\u2116\",\n numsp: \"\\u2007\",\n nvap: \"\\u224D\\u20D2\",\n nvdash: \"\\u22AC\",\n nvDash: \"\\u22AD\",\n nVdash: \"\\u22AE\",\n nVDash: \"\\u22AF\",\n nvge: \"\\u2265\\u20D2\",\n nvgt: \">\\u20D2\",\n nvHarr: \"\\u2904\",\n nvinfin: \"\\u29DE\",\n nvlArr: \"\\u2902\",\n nvle: \"\\u2264\\u20D2\",\n nvlt: \"<\\u20D2\",\n nvltrie: \"\\u22B4\\u20D2\",\n nvrArr: \"\\u2903\",\n nvrtrie: \"\\u22B5\\u20D2\",\n nvsim: \"\\u223C\\u20D2\",\n nwarhk: \"\\u2923\",\n nwarr: \"\\u2196\",\n nwArr: \"\\u21D6\",\n nwarrow: \"\\u2196\",\n nwnear: \"\\u2927\",\n oacute: \"\\xF3\",\n Oacute: \"\\xD3\",\n oast: \"\\u229B\",\n ocir: \"\\u229A\",\n ocirc: \"\\xF4\",\n Ocirc: \"\\xD4\",\n ocy: \"\\u043E\",\n Ocy: \"\\u041E\",\n odash: \"\\u229D\",\n odblac: \"\\u0151\",\n Odblac: \"\\u0150\",\n odiv: \"\\u2A38\",\n odot: \"\\u2299\",\n odsold: \"\\u29BC\",\n oelig: \"\\u0153\",\n OElig: \"\\u0152\",\n ofcir: \"\\u29BF\",\n ofr: \"\\uD835\\uDD2C\",\n Ofr: \"\\uD835\\uDD12\",\n ogon: \"\\u02DB\",\n ograve: \"\\xF2\",\n Ograve: \"\\xD2\",\n ogt: \"\\u29C1\",\n ohbar: \"\\u29B5\",\n ohm: \"\\u03A9\",\n oint: \"\\u222E\",\n olarr: \"\\u21BA\",\n olcir: \"\\u29BE\",\n olcross: \"\\u29BB\",\n oline: \"\\u203E\",\n olt: \"\\u29C0\",\n omacr: \"\\u014D\",\n Omacr: \"\\u014C\",\n omega: \"\\u03C9\",\n Omega: \"\\u03A9\",\n omicron: \"\\u03BF\",\n Omicron: \"\\u039F\",\n omid: \"\\u29B6\",\n ominus: \"\\u2296\",\n oopf: \"\\uD835\\uDD60\",\n Oopf: \"\\uD835\\uDD46\",\n opar: \"\\u29B7\",\n OpenCurlyDoubleQuote: \"\\u201C\",\n OpenCurlyQuote: \"\\u2018\",\n operp: \"\\u29B9\",\n oplus: \"\\u2295\",\n or: \"\\u2228\",\n Or: \"\\u2A54\",\n orarr: \"\\u21BB\",\n ord: \"\\u2A5D\",\n order: \"\\u2134\",\n orderof: \"\\u2134\",\n ordf: \"\\xAA\",\n ordm: \"\\xBA\",\n origof: \"\\u22B6\",\n oror: \"\\u2A56\",\n orslope: \"\\u2A57\",\n orv: \"\\u2A5B\",\n oS: \"\\u24C8\",\n oscr: \"\\u2134\",\n Oscr: \"\\uD835\\uDCAA\",\n oslash: \"\\xF8\",\n Oslash: \"\\xD8\",\n osol: \"\\u2298\",\n otilde: \"\\xF5\",\n Otilde: \"\\xD5\",\n otimes: \"\\u2297\",\n Otimes: \"\\u2A37\",\n otimesas: \"\\u2A36\",\n ouml: \"\\xF6\",\n Ouml: \"\\xD6\",\n ovbar: \"\\u233D\",\n OverBar: \"\\u203E\",\n OverBrace: \"\\u23DE\",\n OverBracket: \"\\u23B4\",\n OverParenthesis: \"\\u23DC\",\n par: \"\\u2225\",\n para: \"\\xB6\",\n parallel: \"\\u2225\",\n parsim: \"\\u2AF3\",\n parsl: \"\\u2AFD\",\n part: \"\\u2202\",\n PartialD: \"\\u2202\",\n pcy: \"\\u043F\",\n Pcy: \"\\u041F\",\n percnt: \"%\",\n period: \".\",\n permil: \"\\u2030\",\n perp: \"\\u22A5\",\n pertenk: \"\\u2031\",\n pfr: \"\\uD835\\uDD2D\",\n Pfr: \"\\uD835\\uDD13\",\n phi: \"\\u03C6\",\n Phi: \"\\u03A6\",\n phiv: \"\\u03D5\",\n phmmat: \"\\u2133\",\n phone: \"\\u260E\",\n pi: \"\\u03C0\",\n Pi: \"\\u03A0\",\n pitchfork: \"\\u22D4\",\n piv: \"\\u03D6\",\n planck: \"\\u210F\",\n planckh: \"\\u210E\",\n plankv: \"\\u210F\",\n plus: \"+\",\n plusacir: \"\\u2A23\",\n plusb: \"\\u229E\",\n pluscir: \"\\u2A22\",\n plusdo: \"\\u2214\",\n plusdu: \"\\u2A25\",\n pluse: \"\\u2A72\",\n PlusMinus: \"\\xB1\",\n plusmn: \"\\xB1\",\n plussim: \"\\u2A26\",\n plustwo: \"\\u2A27\",\n pm: \"\\xB1\",\n Poincareplane: \"\\u210C\",\n pointint: \"\\u2A15\",\n popf: \"\\uD835\\uDD61\",\n Popf: \"\\u2119\",\n pound: \"\\xA3\",\n pr: \"\\u227A\",\n Pr: \"\\u2ABB\",\n prap: \"\\u2AB7\",\n prcue: \"\\u227C\",\n pre: \"\\u2AAF\",\n prE: \"\\u2AB3\",\n prec: \"\\u227A\",\n precapprox: \"\\u2AB7\",\n preccurlyeq: \"\\u227C\",\n Precedes: \"\\u227A\",\n PrecedesEqual: \"\\u2AAF\",\n PrecedesSlantEqual: \"\\u227C\",\n PrecedesTilde: \"\\u227E\",\n preceq: \"\\u2AAF\",\n precnapprox: \"\\u2AB9\",\n precneqq: \"\\u2AB5\",\n precnsim: \"\\u22E8\",\n precsim: \"\\u227E\",\n prime: \"\\u2032\",\n Prime: \"\\u2033\",\n primes: \"\\u2119\",\n prnap: \"\\u2AB9\",\n prnE: \"\\u2AB5\",\n prnsim: \"\\u22E8\",\n prod: \"\\u220F\",\n Product: \"\\u220F\",\n profalar: \"\\u232E\",\n profline: \"\\u2312\",\n profsurf: \"\\u2313\",\n prop: \"\\u221D\",\n Proportion: \"\\u2237\",\n Proportional: \"\\u221D\",\n propto: \"\\u221D\",\n prsim: \"\\u227E\",\n prurel: \"\\u22B0\",\n pscr: \"\\uD835\\uDCC5\",\n Pscr: \"\\uD835\\uDCAB\",\n psi: \"\\u03C8\",\n Psi: \"\\u03A8\",\n puncsp: \"\\u2008\",\n qfr: \"\\uD835\\uDD2E\",\n Qfr: \"\\uD835\\uDD14\",\n qint: \"\\u2A0C\",\n qopf: \"\\uD835\\uDD62\",\n Qopf: \"\\u211A\",\n qprime: \"\\u2057\",\n qscr: \"\\uD835\\uDCC6\",\n Qscr: \"\\uD835\\uDCAC\",\n quaternions: \"\\u210D\",\n quatint: \"\\u2A16\",\n quest: \"?\",\n questeq: \"\\u225F\",\n quot: '\"',\n QUOT: '\"',\n rAarr: \"\\u21DB\",\n race: \"\\u223D\\u0331\",\n racute: \"\\u0155\",\n Racute: \"\\u0154\",\n radic: \"\\u221A\",\n raemptyv: \"\\u29B3\",\n rang: \"\\u27E9\",\n Rang: \"\\u27EB\",\n rangd: \"\\u2992\",\n range: \"\\u29A5\",\n rangle: \"\\u27E9\",\n raquo: \"\\xBB\",\n rarr: \"\\u2192\",\n rArr: \"\\u21D2\",\n Rarr: \"\\u21A0\",\n rarrap: \"\\u2975\",\n rarrb: \"\\u21E5\",\n rarrbfs: \"\\u2920\",\n rarrc: \"\\u2933\",\n rarrfs: \"\\u291E\",\n rarrhk: \"\\u21AA\",\n rarrlp: \"\\u21AC\",\n rarrpl: \"\\u2945\",\n rarrsim: \"\\u2974\",\n rarrtl: \"\\u21A3\",\n Rarrtl: \"\\u2916\",\n rarrw: \"\\u219D\",\n ratail: \"\\u291A\",\n rAtail: \"\\u291C\",\n ratio: \"\\u2236\",\n rationals: \"\\u211A\",\n rbarr: \"\\u290D\",\n rBarr: \"\\u290F\",\n RBarr: \"\\u2910\",\n rbbrk: \"\\u2773\",\n rbrace: \"}\",\n rbrack: \"]\",\n rbrke: \"\\u298C\",\n rbrksld: \"\\u298E\",\n rbrkslu: \"\\u2990\",\n rcaron: \"\\u0159\",\n Rcaron: \"\\u0158\",\n rcedil: \"\\u0157\",\n Rcedil: \"\\u0156\",\n rceil: \"\\u2309\",\n rcub: \"}\",\n rcy: \"\\u0440\",\n Rcy: \"\\u0420\",\n rdca: \"\\u2937\",\n rdldhar: \"\\u2969\",\n rdquo: \"\\u201D\",\n rdquor: \"\\u201D\",\n rdsh: \"\\u21B3\",\n Re: \"\\u211C\",\n real: \"\\u211C\",\n realine: \"\\u211B\",\n realpart: \"\\u211C\",\n reals: \"\\u211D\",\n rect: \"\\u25AD\",\n reg: \"\\xAE\",\n REG: \"\\xAE\",\n ReverseElement: \"\\u220B\",\n ReverseEquilibrium: \"\\u21CB\",\n ReverseUpEquilibrium: \"\\u296F\",\n rfisht: \"\\u297D\",\n rfloor: \"\\u230B\",\n rfr: \"\\uD835\\uDD2F\",\n Rfr: \"\\u211C\",\n rHar: \"\\u2964\",\n rhard: \"\\u21C1\",\n rharu: \"\\u21C0\",\n rharul: \"\\u296C\",\n rho: \"\\u03C1\",\n Rho: \"\\u03A1\",\n rhov: \"\\u03F1\",\n RightAngleBracket: \"\\u27E9\",\n rightarrow: \"\\u2192\",\n Rightarrow: \"\\u21D2\",\n RightArrow: \"\\u2192\",\n RightArrowBar: \"\\u21E5\",\n RightArrowLeftArrow: \"\\u21C4\",\n rightarrowtail: \"\\u21A3\",\n RightCeiling: \"\\u2309\",\n RightDoubleBracket: \"\\u27E7\",\n RightDownTeeVector: \"\\u295D\",\n RightDownVector: \"\\u21C2\",\n RightDownVectorBar: \"\\u2955\",\n RightFloor: \"\\u230B\",\n rightharpoondown: \"\\u21C1\",\n rightharpoonup: \"\\u21C0\",\n rightleftarrows: \"\\u21C4\",\n rightleftharpoons: \"\\u21CC\",\n rightrightarrows: \"\\u21C9\",\n rightsquigarrow: \"\\u219D\",\n RightTee: \"\\u22A2\",\n RightTeeArrow: \"\\u21A6\",\n RightTeeVector: \"\\u295B\",\n rightthreetimes: \"\\u22CC\",\n RightTriangle: \"\\u22B3\",\n RightTriangleBar: \"\\u29D0\",\n RightTriangleEqual: \"\\u22B5\",\n RightUpDownVector: \"\\u294F\",\n RightUpTeeVector: \"\\u295C\",\n RightUpVector: \"\\u21BE\",\n RightUpVectorBar: \"\\u2954\",\n RightVector: \"\\u21C0\",\n RightVectorBar: \"\\u2953\",\n ring: \"\\u02DA\",\n risingdotseq: \"\\u2253\",\n rlarr: \"\\u21C4\",\n rlhar: \"\\u21CC\",\n rlm: \"\\u200F\",\n rmoust: \"\\u23B1\",\n rmoustache: \"\\u23B1\",\n rnmid: \"\\u2AEE\",\n roang: \"\\u27ED\",\n roarr: \"\\u21FE\",\n robrk: \"\\u27E7\",\n ropar: \"\\u2986\",\n ropf: \"\\uD835\\uDD63\",\n Ropf: \"\\u211D\",\n roplus: \"\\u2A2E\",\n rotimes: \"\\u2A35\",\n RoundImplies: \"\\u2970\",\n rpar: \")\",\n rpargt: \"\\u2994\",\n rppolint: \"\\u2A12\",\n rrarr: \"\\u21C9\",\n Rrightarrow: \"\\u21DB\",\n rsaquo: \"\\u203A\",\n rscr: \"\\uD835\\uDCC7\",\n Rscr: \"\\u211B\",\n rsh: \"\\u21B1\",\n Rsh: \"\\u21B1\",\n rsqb: \"]\",\n rsquo: \"\\u2019\",\n rsquor: \"\\u2019\",\n rthree: \"\\u22CC\",\n rtimes: \"\\u22CA\",\n rtri: \"\\u25B9\",\n rtrie: \"\\u22B5\",\n rtrif: \"\\u25B8\",\n rtriltri: \"\\u29CE\",\n RuleDelayed: \"\\u29F4\",\n ruluhar: \"\\u2968\",\n rx: \"\\u211E\",\n sacute: \"\\u015B\",\n Sacute: \"\\u015A\",\n sbquo: \"\\u201A\",\n sc: \"\\u227B\",\n Sc: \"\\u2ABC\",\n scap: \"\\u2AB8\",\n scaron: \"\\u0161\",\n Scaron: \"\\u0160\",\n sccue: \"\\u227D\",\n sce: \"\\u2AB0\",\n scE: \"\\u2AB4\",\n scedil: \"\\u015F\",\n Scedil: \"\\u015E\",\n scirc: \"\\u015D\",\n Scirc: \"\\u015C\",\n scnap: \"\\u2ABA\",\n scnE: \"\\u2AB6\",\n scnsim: \"\\u22E9\",\n scpolint: \"\\u2A13\",\n scsim: \"\\u227F\",\n scy: \"\\u0441\",\n Scy: \"\\u0421\",\n sdot: \"\\u22C5\",\n sdotb: \"\\u22A1\",\n sdote: \"\\u2A66\",\n searhk: \"\\u2925\",\n searr: \"\\u2198\",\n seArr: \"\\u21D8\",\n searrow: \"\\u2198\",\n sect: \"\\xA7\",\n semi: \";\",\n seswar: \"\\u2929\",\n setminus: \"\\u2216\",\n setmn: \"\\u2216\",\n sext: \"\\u2736\",\n sfr: \"\\uD835\\uDD30\",\n Sfr: \"\\uD835\\uDD16\",\n sfrown: \"\\u2322\",\n sharp: \"\\u266F\",\n shchcy: \"\\u0449\",\n SHCHcy: \"\\u0429\",\n shcy: \"\\u0448\",\n SHcy: \"\\u0428\",\n ShortDownArrow: \"\\u2193\",\n ShortLeftArrow: \"\\u2190\",\n shortmid: \"\\u2223\",\n shortparallel: \"\\u2225\",\n ShortRightArrow: \"\\u2192\",\n ShortUpArrow: \"\\u2191\",\n shy: \"\\xAD\",\n sigma: \"\\u03C3\",\n Sigma: \"\\u03A3\",\n sigmaf: \"\\u03C2\",\n sigmav: \"\\u03C2\",\n sim: \"\\u223C\",\n simdot: \"\\u2A6A\",\n sime: \"\\u2243\",\n simeq: \"\\u2243\",\n simg: \"\\u2A9E\",\n simgE: \"\\u2AA0\",\n siml: \"\\u2A9D\",\n simlE: \"\\u2A9F\",\n simne: \"\\u2246\",\n simplus: \"\\u2A24\",\n simrarr: \"\\u2972\",\n slarr: \"\\u2190\",\n SmallCircle: \"\\u2218\",\n smallsetminus: \"\\u2216\",\n smashp: \"\\u2A33\",\n smeparsl: \"\\u29E4\",\n smid: \"\\u2223\",\n smile: \"\\u2323\",\n smt: \"\\u2AAA\",\n smte: \"\\u2AAC\",\n smtes: \"\\u2AAC\\uFE00\",\n softcy: \"\\u044C\",\n SOFTcy: \"\\u042C\",\n sol: \"/\",\n solb: \"\\u29C4\",\n solbar: \"\\u233F\",\n sopf: \"\\uD835\\uDD64\",\n Sopf: \"\\uD835\\uDD4A\",\n spades: \"\\u2660\",\n spadesuit: \"\\u2660\",\n spar: \"\\u2225\",\n sqcap: \"\\u2293\",\n sqcaps: \"\\u2293\\uFE00\",\n sqcup: \"\\u2294\",\n sqcups: \"\\u2294\\uFE00\",\n Sqrt: \"\\u221A\",\n sqsub: \"\\u228F\",\n sqsube: \"\\u2291\",\n sqsubset: \"\\u228F\",\n sqsubseteq: \"\\u2291\",\n sqsup: \"\\u2290\",\n sqsupe: \"\\u2292\",\n sqsupset: \"\\u2290\",\n sqsupseteq: \"\\u2292\",\n squ: \"\\u25A1\",\n square: \"\\u25A1\",\n Square: \"\\u25A1\",\n SquareIntersection: \"\\u2293\",\n SquareSubset: \"\\u228F\",\n SquareSubsetEqual: \"\\u2291\",\n SquareSuperset: \"\\u2290\",\n SquareSupersetEqual: \"\\u2292\",\n SquareUnion: \"\\u2294\",\n squarf: \"\\u25AA\",\n squf: \"\\u25AA\",\n srarr: \"\\u2192\",\n sscr: \"\\uD835\\uDCC8\",\n Sscr: \"\\uD835\\uDCAE\",\n ssetmn: \"\\u2216\",\n ssmile: \"\\u2323\",\n sstarf: \"\\u22C6\",\n star: \"\\u2606\",\n Star: \"\\u22C6\",\n starf: \"\\u2605\",\n straightepsilon: \"\\u03F5\",\n straightphi: \"\\u03D5\",\n strns: \"\\xAF\",\n sub: \"\\u2282\",\n Sub: \"\\u22D0\",\n subdot: \"\\u2ABD\",\n sube: \"\\u2286\",\n subE: \"\\u2AC5\",\n subedot: \"\\u2AC3\",\n submult: \"\\u2AC1\",\n subne: \"\\u228A\",\n subnE: \"\\u2ACB\",\n subplus: \"\\u2ABF\",\n subrarr: \"\\u2979\",\n subset: \"\\u2282\",\n Subset: \"\\u22D0\",\n subseteq: \"\\u2286\",\n subseteqq: \"\\u2AC5\",\n SubsetEqual: \"\\u2286\",\n subsetneq: \"\\u228A\",\n subsetneqq: \"\\u2ACB\",\n subsim: \"\\u2AC7\",\n subsub: \"\\u2AD5\",\n subsup: \"\\u2AD3\",\n succ: \"\\u227B\",\n succapprox: \"\\u2AB8\",\n succcurlyeq: \"\\u227D\",\n Succeeds: \"\\u227B\",\n SucceedsEqual: \"\\u2AB0\",\n SucceedsSlantEqual: \"\\u227D\",\n SucceedsTilde: \"\\u227F\",\n succeq: \"\\u2AB0\",\n succnapprox: \"\\u2ABA\",\n succneqq: \"\\u2AB6\",\n succnsim: \"\\u22E9\",\n succsim: \"\\u227F\",\n SuchThat: \"\\u220B\",\n sum: \"\\u2211\",\n Sum: \"\\u2211\",\n sung: \"\\u266A\",\n sup: \"\\u2283\",\n Sup: \"\\u22D1\",\n sup1: \"\\xB9\",\n sup2: \"\\xB2\",\n sup3: \"\\xB3\",\n supdot: \"\\u2ABE\",\n supdsub: \"\\u2AD8\",\n supe: \"\\u2287\",\n supE: \"\\u2AC6\",\n supedot: \"\\u2AC4\",\n Superset: \"\\u2283\",\n SupersetEqual: \"\\u2287\",\n suphsol: \"\\u27C9\",\n suphsub: \"\\u2AD7\",\n suplarr: \"\\u297B\",\n supmult: \"\\u2AC2\",\n supne: \"\\u228B\",\n supnE: \"\\u2ACC\",\n supplus: \"\\u2AC0\",\n supset: \"\\u2283\",\n Supset: \"\\u22D1\",\n supseteq: \"\\u2287\",\n supseteqq: \"\\u2AC6\",\n supsetneq: \"\\u228B\",\n supsetneqq: \"\\u2ACC\",\n supsim: \"\\u2AC8\",\n supsub: \"\\u2AD4\",\n supsup: \"\\u2AD6\",\n swarhk: \"\\u2926\",\n swarr: \"\\u2199\",\n swArr: \"\\u21D9\",\n swarrow: \"\\u2199\",\n swnwar: \"\\u292A\",\n szlig: \"\\xDF\",\n Tab: \"\\t\",\n target: \"\\u2316\",\n tau: \"\\u03C4\",\n Tau: \"\\u03A4\",\n tbrk: \"\\u23B4\",\n tcaron: \"\\u0165\",\n Tcaron: \"\\u0164\",\n tcedil: \"\\u0163\",\n Tcedil: \"\\u0162\",\n tcy: \"\\u0442\",\n Tcy: \"\\u0422\",\n tdot: \"\\u20DB\",\n telrec: \"\\u2315\",\n tfr: \"\\uD835\\uDD31\",\n Tfr: \"\\uD835\\uDD17\",\n there4: \"\\u2234\",\n therefore: \"\\u2234\",\n Therefore: \"\\u2234\",\n theta: \"\\u03B8\",\n Theta: \"\\u0398\",\n thetasym: \"\\u03D1\",\n thetav: \"\\u03D1\",\n thickapprox: \"\\u2248\",\n thicksim: \"\\u223C\",\n ThickSpace: \"\\u205F\\u200A\",\n thinsp: \"\\u2009\",\n ThinSpace: \"\\u2009\",\n thkap: \"\\u2248\",\n thksim: \"\\u223C\",\n thorn: \"\\xFE\",\n THORN: \"\\xDE\",\n tilde: \"\\u02DC\",\n Tilde: \"\\u223C\",\n TildeEqual: \"\\u2243\",\n TildeFullEqual: \"\\u2245\",\n TildeTilde: \"\\u2248\",\n times: \"\\xD7\",\n timesb: \"\\u22A0\",\n timesbar: \"\\u2A31\",\n timesd: \"\\u2A30\",\n tint: \"\\u222D\",\n toea: \"\\u2928\",\n top: \"\\u22A4\",\n topbot: \"\\u2336\",\n topcir: \"\\u2AF1\",\n topf: \"\\uD835\\uDD65\",\n Topf: \"\\uD835\\uDD4B\",\n topfork: \"\\u2ADA\",\n tosa: \"\\u2929\",\n tprime: \"\\u2034\",\n trade: \"\\u2122\",\n TRADE: \"\\u2122\",\n triangle: \"\\u25B5\",\n triangledown: \"\\u25BF\",\n triangleleft: \"\\u25C3\",\n trianglelefteq: \"\\u22B4\",\n triangleq: \"\\u225C\",\n triangleright: \"\\u25B9\",\n trianglerighteq: \"\\u22B5\",\n tridot: \"\\u25EC\",\n trie: \"\\u225C\",\n triminus: \"\\u2A3A\",\n TripleDot: \"\\u20DB\",\n triplus: \"\\u2A39\",\n trisb: \"\\u29CD\",\n tritime: \"\\u2A3B\",\n trpezium: \"\\u23E2\",\n tscr: \"\\uD835\\uDCC9\",\n Tscr: \"\\uD835\\uDCAF\",\n tscy: \"\\u0446\",\n TScy: \"\\u0426\",\n tshcy: \"\\u045B\",\n TSHcy: \"\\u040B\",\n tstrok: \"\\u0167\",\n Tstrok: \"\\u0166\",\n twixt: \"\\u226C\",\n twoheadleftarrow: \"\\u219E\",\n twoheadrightarrow: \"\\u21A0\",\n uacute: \"\\xFA\",\n Uacute: \"\\xDA\",\n uarr: \"\\u2191\",\n uArr: \"\\u21D1\",\n Uarr: \"\\u219F\",\n Uarrocir: \"\\u2949\",\n ubrcy: \"\\u045E\",\n Ubrcy: \"\\u040E\",\n ubreve: \"\\u016D\",\n Ubreve: \"\\u016C\",\n ucirc: \"\\xFB\",\n Ucirc: \"\\xDB\",\n ucy: \"\\u0443\",\n Ucy: \"\\u0423\",\n udarr: \"\\u21C5\",\n udblac: \"\\u0171\",\n Udblac: \"\\u0170\",\n udhar: \"\\u296E\",\n ufisht: \"\\u297E\",\n ufr: \"\\uD835\\uDD32\",\n Ufr: \"\\uD835\\uDD18\",\n ugrave: \"\\xF9\",\n Ugrave: \"\\xD9\",\n uHar: \"\\u2963\",\n uharl: \"\\u21BF\",\n uharr: \"\\u21BE\",\n uhblk: \"\\u2580\",\n ulcorn: \"\\u231C\",\n ulcorner: \"\\u231C\",\n ulcrop: \"\\u230F\",\n ultri: \"\\u25F8\",\n umacr: \"\\u016B\",\n Umacr: \"\\u016A\",\n uml: \"\\xA8\",\n UnderBar: \"_\",\n UnderBrace: \"\\u23DF\",\n UnderBracket: \"\\u23B5\",\n UnderParenthesis: \"\\u23DD\",\n Union: \"\\u22C3\",\n UnionPlus: \"\\u228E\",\n uogon: \"\\u0173\",\n Uogon: \"\\u0172\",\n uopf: \"\\uD835\\uDD66\",\n Uopf: \"\\uD835\\uDD4C\",\n uparrow: \"\\u2191\",\n Uparrow: \"\\u21D1\",\n UpArrow: \"\\u2191\",\n UpArrowBar: \"\\u2912\",\n UpArrowDownArrow: \"\\u21C5\",\n updownarrow: \"\\u2195\",\n Updownarrow: \"\\u21D5\",\n UpDownArrow: \"\\u2195\",\n UpEquilibrium: \"\\u296E\",\n upharpoonleft: \"\\u21BF\",\n upharpoonright: \"\\u21BE\",\n uplus: \"\\u228E\",\n UpperLeftArrow: \"\\u2196\",\n UpperRightArrow: \"\\u2197\",\n upsi: \"\\u03C5\",\n Upsi: \"\\u03D2\",\n upsih: \"\\u03D2\",\n upsilon: \"\\u03C5\",\n Upsilon: \"\\u03A5\",\n UpTee: \"\\u22A5\",\n UpTeeArrow: \"\\u21A5\",\n upuparrows: \"\\u21C8\",\n urcorn: \"\\u231D\",\n urcorner: \"\\u231D\",\n urcrop: \"\\u230E\",\n uring: \"\\u016F\",\n Uring: \"\\u016E\",\n urtri: \"\\u25F9\",\n uscr: \"\\uD835\\uDCCA\",\n Uscr: \"\\uD835\\uDCB0\",\n utdot: \"\\u22F0\",\n utilde: \"\\u0169\",\n Utilde: \"\\u0168\",\n utri: \"\\u25B5\",\n utrif: \"\\u25B4\",\n uuarr: \"\\u21C8\",\n uuml: \"\\xFC\",\n Uuml: \"\\xDC\",\n uwangle: \"\\u29A7\",\n vangrt: \"\\u299C\",\n varepsilon: \"\\u03F5\",\n varkappa: \"\\u03F0\",\n varnothing: \"\\u2205\",\n varphi: \"\\u03D5\",\n varpi: \"\\u03D6\",\n varpropto: \"\\u221D\",\n varr: \"\\u2195\",\n vArr: \"\\u21D5\",\n varrho: \"\\u03F1\",\n varsigma: \"\\u03C2\",\n varsubsetneq: \"\\u228A\\uFE00\",\n varsubsetneqq: \"\\u2ACB\\uFE00\",\n varsupsetneq: \"\\u228B\\uFE00\",\n varsupsetneqq: \"\\u2ACC\\uFE00\",\n vartheta: \"\\u03D1\",\n vartriangleleft: \"\\u22B2\",\n vartriangleright: \"\\u22B3\",\n vBar: \"\\u2AE8\",\n Vbar: \"\\u2AEB\",\n vBarv: \"\\u2AE9\",\n vcy: \"\\u0432\",\n Vcy: \"\\u0412\",\n vdash: \"\\u22A2\",\n vDash: \"\\u22A8\",\n Vdash: \"\\u22A9\",\n VDash: \"\\u22AB\",\n Vdashl: \"\\u2AE6\",\n vee: \"\\u2228\",\n Vee: \"\\u22C1\",\n veebar: \"\\u22BB\",\n veeeq: \"\\u225A\",\n vellip: \"\\u22EE\",\n verbar: \"|\",\n Verbar: \"\\u2016\",\n vert: \"|\",\n Vert: \"\\u2016\",\n VerticalBar: \"\\u2223\",\n VerticalLine: \"|\",\n VerticalSeparator: \"\\u2758\",\n VerticalTilde: \"\\u2240\",\n VeryThinSpace: \"\\u200A\",\n vfr: \"\\uD835\\uDD33\",\n Vfr: \"\\uD835\\uDD19\",\n vltri: \"\\u22B2\",\n vnsub: \"\\u2282\\u20D2\",\n vnsup: \"\\u2283\\u20D2\",\n vopf: \"\\uD835\\uDD67\",\n Vopf: \"\\uD835\\uDD4D\",\n vprop: \"\\u221D\",\n vrtri: \"\\u22B3\",\n vscr: \"\\uD835\\uDCCB\",\n Vscr: \"\\uD835\\uDCB1\",\n vsubne: \"\\u228A\\uFE00\",\n vsubnE: \"\\u2ACB\\uFE00\",\n vsupne: \"\\u228B\\uFE00\",\n vsupnE: \"\\u2ACC\\uFE00\",\n Vvdash: \"\\u22AA\",\n vzigzag: \"\\u299A\",\n wcirc: \"\\u0175\",\n Wcirc: \"\\u0174\",\n wedbar: \"\\u2A5F\",\n wedge: \"\\u2227\",\n Wedge: \"\\u22C0\",\n wedgeq: \"\\u2259\",\n weierp: \"\\u2118\",\n wfr: \"\\uD835\\uDD34\",\n Wfr: \"\\uD835\\uDD1A\",\n wopf: \"\\uD835\\uDD68\",\n Wopf: \"\\uD835\\uDD4E\",\n wp: \"\\u2118\",\n wr: \"\\u2240\",\n wreath: \"\\u2240\",\n wscr: \"\\uD835\\uDCCC\",\n Wscr: \"\\uD835\\uDCB2\",\n xcap: \"\\u22C2\",\n xcirc: \"\\u25EF\",\n xcup: \"\\u22C3\",\n xdtri: \"\\u25BD\",\n xfr: \"\\uD835\\uDD35\",\n Xfr: \"\\uD835\\uDD1B\",\n xharr: \"\\u27F7\",\n xhArr: \"\\u27FA\",\n xi: \"\\u03BE\",\n Xi: \"\\u039E\",\n xlarr: \"\\u27F5\",\n xlArr: \"\\u27F8\",\n xmap: \"\\u27FC\",\n xnis: \"\\u22FB\",\n xodot: \"\\u2A00\",\n xopf: \"\\uD835\\uDD69\",\n Xopf: \"\\uD835\\uDD4F\",\n xoplus: \"\\u2A01\",\n xotime: \"\\u2A02\",\n xrarr: \"\\u27F6\",\n xrArr: \"\\u27F9\",\n xscr: \"\\uD835\\uDCCD\",\n Xscr: \"\\uD835\\uDCB3\",\n xsqcup: \"\\u2A06\",\n xuplus: \"\\u2A04\",\n xutri: \"\\u25B3\",\n xvee: \"\\u22C1\",\n xwedge: \"\\u22C0\",\n yacute: \"\\xFD\",\n Yacute: \"\\xDD\",\n yacy: \"\\u044F\",\n YAcy: \"\\u042F\",\n ycirc: \"\\u0177\",\n Ycirc: \"\\u0176\",\n ycy: \"\\u044B\",\n Ycy: \"\\u042B\",\n yen: \"\\xA5\",\n yfr: \"\\uD835\\uDD36\",\n Yfr: \"\\uD835\\uDD1C\",\n yicy: \"\\u0457\",\n YIcy: \"\\u0407\",\n yopf: \"\\uD835\\uDD6A\",\n Yopf: \"\\uD835\\uDD50\",\n yscr: \"\\uD835\\uDCCE\",\n Yscr: \"\\uD835\\uDCB4\",\n yucy: \"\\u044E\",\n YUcy: \"\\u042E\",\n yuml: \"\\xFF\",\n Yuml: \"\\u0178\",\n zacute: \"\\u017A\",\n Zacute: \"\\u0179\",\n zcaron: \"\\u017E\",\n Zcaron: \"\\u017D\",\n zcy: \"\\u0437\",\n Zcy: \"\\u0417\",\n zdot: \"\\u017C\",\n Zdot: \"\\u017B\",\n zeetrf: \"\\u2128\",\n ZeroWidthSpace: \"\\u200B\",\n zeta: \"\\u03B6\",\n Zeta: \"\\u0396\",\n zfr: \"\\uD835\\uDD37\",\n Zfr: \"\\u2128\",\n zhcy: \"\\u0436\",\n ZHcy: \"\\u0416\",\n zigrarr: \"\\u21DD\",\n zopf: \"\\uD835\\uDD6B\",\n Zopf: \"\\u2124\",\n zscr: \"\\uD835\\uDCCF\",\n Zscr: \"\\uD835\\uDCB5\",\n zwj: \"\\u200D\",\n zwnj: \"\\u200C\"\n };\n var decodeMapLegacy = {\n aacute: \"\\xE1\",\n Aacute: \"\\xC1\",\n acirc: \"\\xE2\",\n Acirc: \"\\xC2\",\n acute: \"\\xB4\",\n aelig: \"\\xE6\",\n AElig: \"\\xC6\",\n agrave: \"\\xE0\",\n Agrave: \"\\xC0\",\n amp: \"&\",\n AMP: \"&\",\n aring: \"\\xE5\",\n Aring: \"\\xC5\",\n atilde: \"\\xE3\",\n Atilde: \"\\xC3\",\n auml: \"\\xE4\",\n Auml: \"\\xC4\",\n brvbar: \"\\xA6\",\n ccedil: \"\\xE7\",\n Ccedil: \"\\xC7\",\n cedil: \"\\xB8\",\n cent: \"\\xA2\",\n copy: \"\\xA9\",\n COPY: \"\\xA9\",\n curren: \"\\xA4\",\n deg: \"\\xB0\",\n divide: \"\\xF7\",\n eacute: \"\\xE9\",\n Eacute: \"\\xC9\",\n ecirc: \"\\xEA\",\n Ecirc: \"\\xCA\",\n egrave: \"\\xE8\",\n Egrave: \"\\xC8\",\n eth: \"\\xF0\",\n ETH: \"\\xD0\",\n euml: \"\\xEB\",\n Euml: \"\\xCB\",\n frac12: \"\\xBD\",\n frac14: \"\\xBC\",\n frac34: \"\\xBE\",\n gt: \">\",\n GT: \">\",\n iacute: \"\\xED\",\n Iacute: \"\\xCD\",\n icirc: \"\\xEE\",\n Icirc: \"\\xCE\",\n iexcl: \"\\xA1\",\n igrave: \"\\xEC\",\n Igrave: \"\\xCC\",\n iquest: \"\\xBF\",\n iuml: \"\\xEF\",\n Iuml: \"\\xCF\",\n laquo: \"\\xAB\",\n lt: \"<\",\n LT: \"<\",\n macr: \"\\xAF\",\n micro: \"\\xB5\",\n middot: \"\\xB7\",\n nbsp: \"\\xA0\",\n not: \"\\xAC\",\n ntilde: \"\\xF1\",\n Ntilde: \"\\xD1\",\n oacute: \"\\xF3\",\n Oacute: \"\\xD3\",\n ocirc: \"\\xF4\",\n Ocirc: \"\\xD4\",\n ograve: \"\\xF2\",\n Ograve: \"\\xD2\",\n ordf: \"\\xAA\",\n ordm: \"\\xBA\",\n oslash: \"\\xF8\",\n Oslash: \"\\xD8\",\n otilde: \"\\xF5\",\n Otilde: \"\\xD5\",\n ouml: \"\\xF6\",\n Ouml: \"\\xD6\",\n para: \"\\xB6\",\n plusmn: \"\\xB1\",\n pound: \"\\xA3\",\n quot: '\"',\n QUOT: '\"',\n raquo: \"\\xBB\",\n reg: \"\\xAE\",\n REG: \"\\xAE\",\n sect: \"\\xA7\",\n shy: \"\\xAD\",\n sup1: \"\\xB9\",\n sup2: \"\\xB2\",\n sup3: \"\\xB3\",\n szlig: \"\\xDF\",\n thorn: \"\\xFE\",\n THORN: \"\\xDE\",\n times: \"\\xD7\",\n uacute: \"\\xFA\",\n Uacute: \"\\xDA\",\n ucirc: \"\\xFB\",\n Ucirc: \"\\xDB\",\n ugrave: \"\\xF9\",\n Ugrave: \"\\xD9\",\n uml: \"\\xA8\",\n uuml: \"\\xFC\",\n Uuml: \"\\xDC\",\n yacute: \"\\xFD\",\n Yacute: \"\\xDD\",\n yen: \"\\xA5\",\n yuml: \"\\xFF\"\n };\n var decodeMapNumeric = {\n \"0\": \"\\uFFFD\",\n \"128\": \"\\u20AC\",\n \"130\": \"\\u201A\",\n \"131\": \"\\u0192\",\n \"132\": \"\\u201E\",\n \"133\": \"\\u2026\",\n \"134\": \"\\u2020\",\n \"135\": \"\\u2021\",\n \"136\": \"\\u02C6\",\n \"137\": \"\\u2030\",\n \"138\": \"\\u0160\",\n \"139\": \"\\u2039\",\n \"140\": \"\\u0152\",\n \"142\": \"\\u017D\",\n \"145\": \"\\u2018\",\n \"146\": \"\\u2019\",\n \"147\": \"\\u201C\",\n \"148\": \"\\u201D\",\n \"149\": \"\\u2022\",\n \"150\": \"\\u2013\",\n \"151\": \"\\u2014\",\n \"152\": \"\\u02DC\",\n \"153\": \"\\u2122\",\n \"154\": \"\\u0161\",\n \"155\": \"\\u203A\",\n \"156\": \"\\u0153\",\n \"158\": \"\\u017E\",\n \"159\": \"\\u0178\"\n };\n var invalidReferenceCodePoints = [\n 1,\n 2,\n 3,\n 4,\n 5,\n 6,\n 7,\n 8,\n 11,\n 13,\n 14,\n 15,\n 16,\n 17,\n 18,\n 19,\n 20,\n 21,\n 22,\n 23,\n 24,\n 25,\n 26,\n 27,\n 28,\n 29,\n 30,\n 31,\n 127,\n 128,\n 129,\n 130,\n 131,\n 132,\n 133,\n 134,\n 135,\n 136,\n 137,\n 138,\n 139,\n 140,\n 141,\n 142,\n 143,\n 144,\n 145,\n 146,\n 147,\n 148,\n 149,\n 150,\n 151,\n 152,\n 153,\n 154,\n 155,\n 156,\n 157,\n 158,\n 159,\n 64976,\n 64977,\n 64978,\n 64979,\n 64980,\n 64981,\n 64982,\n 64983,\n 64984,\n 64985,\n 64986,\n 64987,\n 64988,\n 64989,\n 64990,\n 64991,\n 64992,\n 64993,\n 64994,\n 64995,\n 64996,\n 64997,\n 64998,\n 64999,\n 65000,\n 65001,\n 65002,\n 65003,\n 65004,\n 65005,\n 65006,\n 65007,\n 65534,\n 65535,\n 131070,\n 131071,\n 196606,\n 196607,\n 262142,\n 262143,\n 327678,\n 327679,\n 393214,\n 393215,\n 458750,\n 458751,\n 524286,\n 524287,\n 589822,\n 589823,\n 655358,\n 655359,\n 720894,\n 720895,\n 786430,\n 786431,\n 851966,\n 851967,\n 917502,\n 917503,\n 983038,\n 983039,\n 1048574,\n 1048575,\n 1114110,\n 1114111\n ];\n\n /*--------------------------------------------------------------------------*/\n\n var stringFromCharCode = String.fromCharCode;\n\n var object = {};\n var hasOwnProperty = object.hasOwnProperty;\n var has = function(object, propertyName) {\n return hasOwnProperty.call(object, propertyName);\n };\n\n var contains = function(array, value) {\n var index = -1;\n var length = array.length;\n while (++index < length) {\n if (array[index] == value) {\n return true;\n }\n }\n return false;\n };\n\n var merge = function(options, defaults) {\n if (!options) {\n return defaults;\n }\n var result = {};\n var key;\n for (key in defaults) {\n // A `hasOwnProperty` check is not needed here, since only recognized\n // option names are used anyway. Any others are ignored.\n result[key] = has(options, key) ? options[key] : defaults[key];\n }\n return result;\n };\n\n // Modified version of `ucs2encode`; see https://mths.be/punycode.\n var codePointToSymbol = function(codePoint, strict) {\n var output = \"\";\n if (\n (codePoint >= 0xd800 && codePoint <= 0xdfff) ||\n codePoint > 0x10ffff\n ) {\n // See issue #4:\n // “Otherwise, if the number is in the range 0xD800 to 0xDFFF or is\n // greater than 0x10FFFF, then this is a parse error. Return a U+FFFD\n // REPLACEMENT CHARACTER.”\n if (strict) {\n parseError(\n \"character reference outside the permissible Unicode range\"\n );\n }\n return \"\\uFFFD\";\n }\n if (has(decodeMapNumeric, codePoint)) {\n if (strict) {\n parseError(\"disallowed character reference\");\n }\n return decodeMapNumeric[codePoint];\n }\n if (strict && contains(invalidReferenceCodePoints, codePoint)) {\n parseError(\"disallowed character reference\");\n }\n if (codePoint > 0xffff) {\n codePoint -= 0x10000;\n output += stringFromCharCode(\n ((codePoint >>> 10) & 0x3ff) | 0xd800\n );\n codePoint = 0xdc00 | (codePoint & 0x3ff);\n }\n output += stringFromCharCode(codePoint);\n return output;\n };\n\n var hexEscape = function(codePoint) {\n return \"&#x\" + codePoint.toString(16).toUpperCase() + \";\";\n };\n\n var decEscape = function(codePoint) {\n return \"&#\" + codePoint + \";\";\n };\n\n var parseError = function(message) {\n throw Error(\"Parse error: \" + message);\n };\n\n /*--------------------------------------------------------------------------*/\n\n var encode = function(string, options) {\n options = merge(options, encode.options);\n var strict = options.strict;\n if (strict && regexInvalidRawCodePoint.test(string)) {\n parseError(\"forbidden code point\");\n }\n var encodeEverything = options.encodeEverything;\n var useNamedReferences = options.useNamedReferences;\n var allowUnsafeSymbols = options.allowUnsafeSymbols;\n var escapeCodePoint = options.decimal ? decEscape : hexEscape;\n\n var escapeBmpSymbol = function(symbol) {\n return escapeCodePoint(symbol.charCodeAt(0));\n };\n\n if (encodeEverything) {\n // Encode ASCII symbols.\n string = string.replace(regexAsciiWhitelist, function(symbol) {\n // Use named references if requested & possible.\n if (useNamedReferences && has(encodeMap, symbol)) {\n return \"&\" + encodeMap[symbol] + \";\";\n }\n return escapeBmpSymbol(symbol);\n });\n // Shorten a few escapes that represent two symbols, of which at least one\n // is within the ASCII range.\n if (useNamedReferences) {\n string = string\n .replace(/>\\u20D2/g, \">⃒\")\n .replace(/<\\u20D2/g, \"<⃒\")\n .replace(/fj/g, \"fj\");\n }\n // Encode non-ASCII symbols.\n if (useNamedReferences) {\n // Encode non-ASCII symbols that can be replaced with a named reference.\n string = string.replace(regexEncodeNonAscii, function(\n string\n ) {\n // Note: there is no need to check `has(encodeMap, string)` here.\n return \"&\" + encodeMap[string] + \";\";\n });\n }\n // Note: any remaining non-ASCII symbols are handled outside of the `if`.\n } else if (useNamedReferences) {\n // Apply named character references.\n // Encode `<>\"'&` using named character references.\n if (!allowUnsafeSymbols) {\n string = string.replace(regexEscape, function(string) {\n return \"&\" + encodeMap[string] + \";\"; // no need to check `has()` here\n });\n }\n // Shorten escapes that represent two symbols, of which at least one is\n // `<>\"'&`.\n string = string\n .replace(/>\\u20D2/g, \">⃒\")\n .replace(/<\\u20D2/g, \"<⃒\");\n // Encode non-ASCII symbols that can be replaced with a named reference.\n string = string.replace(regexEncodeNonAscii, function(string) {\n // Note: there is no need to check `has(encodeMap, string)` here.\n return \"&\" + encodeMap[string] + \";\";\n });\n } else if (!allowUnsafeSymbols) {\n // Encode `<>\"'&` using hexadecimal escapes, now that they’re not handled\n // using named character references.\n string = string.replace(regexEscape, escapeBmpSymbol);\n }\n return (\n string\n // Encode astral symbols.\n .replace(regexAstralSymbols, function($0) {\n // https://mathiasbynens.be/notes/javascript-encoding#surrogate-formulae\n var high = $0.charCodeAt(0);\n var low = $0.charCodeAt(1);\n var codePoint =\n (high - 0xd800) * 0x400 + low - 0xdc00 + 0x10000;\n return escapeCodePoint(codePoint);\n })\n // Encode any remaining BMP symbols that are not printable ASCII symbols\n // using a hexadecimal escape.\n .replace(regexBmpWhitelist, escapeBmpSymbol)\n );\n };\n // Expose default options (so they can be overridden globally).\n encode.options = {\n allowUnsafeSymbols: false,\n encodeEverything: false,\n strict: false,\n useNamedReferences: false,\n decimal: false\n };\n\n var decode = function(html, options) {\n options = merge(options, decode.options);\n var strict = options.strict;\n if (strict && regexInvalidEntity.test(html)) {\n parseError(\"malformed character reference\");\n }\n return html.replace(regexDecode, function(\n $0,\n $1,\n $2,\n $3,\n $4,\n $5,\n $6,\n $7,\n $8\n ) {\n var codePoint;\n var semicolon;\n var decDigits;\n var hexDigits;\n var reference;\n var next;\n\n if ($1) {\n reference = $1;\n // Note: there is no need to check `has(decodeMap, reference)`.\n return decodeMap[reference];\n }\n\n if ($2) {\n // Decode named character references without trailing `;`, e.g. `&`.\n // This is only a parse error if it gets converted to `&`, or if it is\n // followed by `=` in an attribute context.\n reference = $2;\n next = $3;\n if (next && options.isAttributeValue) {\n if (strict && next == \"=\") {\n parseError(\"`&` did not start a character reference\");\n }\n return $0;\n } else {\n if (strict) {\n parseError(\n \"named character reference was not terminated by a semicolon\"\n );\n }\n // Note: there is no need to check `has(decodeMapLegacy, reference)`.\n return decodeMapLegacy[reference] + (next || \"\");\n }\n }\n\n if ($4) {\n // Decode decimal escapes, e.g. `𝌆`.\n decDigits = $4;\n semicolon = $5;\n if (strict && !semicolon) {\n parseError(\n \"character reference was not terminated by a semicolon\"\n );\n }\n codePoint = parseInt(decDigits, 10);\n return codePointToSymbol(codePoint, strict);\n }\n\n if ($6) {\n // Decode hexadecimal escapes, e.g. `𝌆`.\n hexDigits = $6;\n semicolon = $7;\n if (strict && !semicolon) {\n parseError(\n \"character reference was not terminated by a semicolon\"\n );\n }\n codePoint = parseInt(hexDigits, 16);\n return codePointToSymbol(codePoint, strict);\n }\n\n // If we’re still here, `if ($7)` is implied; it’s an ambiguous\n // ampersand for sure. https://mths.be/notes/ambiguous-ampersands\n if (strict) {\n parseError(\n \"named character reference was not terminated by a semicolon\"\n );\n }\n return $0;\n });\n };\n // Expose default options (so they can be overridden globally).\n decode.options = {\n isAttributeValue: false,\n strict: false\n };\n\n var escape = function(string) {\n return string.replace(regexEscape, function($0) {\n // Note: there is no need to check `has(escapeMap, $0)` here.\n return escapeMap[$0];\n });\n };\n\n /*--------------------------------------------------------------------------*/\n\n var he = {\n version: \"1.2.0\",\n encode: encode,\n decode: decode,\n escape: escape,\n unescape: decode\n };\n\n // Some AMD build optimizers, like r.js, check for specific condition patterns\n // like the following:\n if (\n typeof define == \"function\" &&\n typeof define.amd == \"object\" &&\n define.amd\n ) {\n define(function() {\n return he;\n });\n } else if (freeExports && !freeExports.nodeType) {\n if (freeModule) {\n // in Node.js, io.js, or RingoJS v0.8.0+\n freeModule.exports = he;\n } else {\n // in Narwhal or RingoJS v0.7.0-\n for (var key in he) {\n has(he, key) && (freeExports[key] = he[key]);\n }\n }\n } else {\n // in Rhino or a web browser\n root.he = he;\n }\n })(this);\n }.call(\n this,\n typeof global !== \"undefined\"\n ? global\n : typeof self !== \"undefined\"\n ? self\n : typeof window !== \"undefined\"\n ? window\n : {}\n ));\n },\n {}\n ],\n 104: [\n function(require, module, exports) {\n var http = require(\"http\");\n var url = require(\"url\");\n\n var https = module.exports;\n\n for (var key in http) {\n if (http.hasOwnProperty(key)) https[key] = http[key];\n }\n\n https.request = function(params, cb) {\n params = validateParams(params);\n return http.request.call(this, params, cb);\n };\n\n https.get = function(params, cb) {\n params = validateParams(params);\n return http.get.call(this, params, cb);\n };\n\n function validateParams(params) {\n if (typeof params === \"string\") {\n params = url.parse(params);\n }\n if (!params.protocol) {\n params.protocol = \"https:\";\n }\n if (params.protocol !== \"https:\") {\n throw new Error(\n 'Protocol \"' +\n params.protocol +\n '\" not supported. Expected \"https:\"'\n );\n }\n return params;\n }\n },\n { http: 156, url: 162 }\n ],\n 105: [\n function(require, module, exports) {\n exports.read = function(buffer, offset, isLE, mLen, nBytes) {\n var e, m;\n var eLen = nBytes * 8 - mLen - 1;\n var eMax = (1 << eLen) - 1;\n var eBias = eMax >> 1;\n var nBits = -7;\n var i = isLE ? nBytes - 1 : 0;\n var d = isLE ? -1 : 1;\n var s = buffer[offset + i];\n\n i += d;\n\n e = s & ((1 << -nBits) - 1);\n s >>= -nBits;\n nBits += eLen;\n for (\n ;\n nBits > 0;\n e = e * 256 + buffer[offset + i], i += d, nBits -= 8\n ) {}\n\n m = e & ((1 << -nBits) - 1);\n e >>= -nBits;\n nBits += mLen;\n for (\n ;\n nBits > 0;\n m = m * 256 + buffer[offset + i], i += d, nBits -= 8\n ) {}\n\n if (e === 0) {\n e = 1 - eBias;\n } else if (e === eMax) {\n return m ? NaN : (s ? -1 : 1) * Infinity;\n } else {\n m = m + Math.pow(2, mLen);\n e = e - eBias;\n }\n return (s ? -1 : 1) * m * Math.pow(2, e - mLen);\n };\n\n exports.write = function(buffer, value, offset, isLE, mLen, nBytes) {\n var e, m, c;\n var eLen = nBytes * 8 - mLen - 1;\n var eMax = (1 << eLen) - 1;\n var eBias = eMax >> 1;\n var rt = mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0;\n var i = isLE ? 0 : nBytes - 1;\n var d = isLE ? 1 : -1;\n var s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0;\n\n value = Math.abs(value);\n\n if (isNaN(value) || value === Infinity) {\n m = isNaN(value) ? 1 : 0;\n e = eMax;\n } else {\n e = Math.floor(Math.log(value) / Math.LN2);\n if (value * (c = Math.pow(2, -e)) < 1) {\n e--;\n c *= 2;\n }\n if (e + eBias >= 1) {\n value += rt / c;\n } else {\n value += rt * Math.pow(2, 1 - eBias);\n }\n if (value * c >= 2) {\n e++;\n c /= 2;\n }\n\n if (e + eBias >= eMax) {\n m = 0;\n e = eMax;\n } else if (e + eBias >= 1) {\n m = (value * c - 1) * Math.pow(2, mLen);\n e = e + eBias;\n } else {\n m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen);\n e = 0;\n }\n }\n\n for (\n ;\n mLen >= 8;\n buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8\n ) {}\n\n e = (e << mLen) | m;\n eLen += mLen;\n for (\n ;\n eLen > 0;\n buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8\n ) {}\n\n buffer[offset + i - d] |= s * 128;\n };\n },\n {}\n ],\n 106: [\n function(require, module, exports) {\n if (typeof Object.create === \"function\") {\n // implementation from standard node.js 'util' module\n module.exports = function inherits(ctor, superCtor) {\n ctor.super_ = superCtor;\n ctor.prototype = Object.create(superCtor.prototype, {\n constructor: {\n value: ctor,\n enumerable: false,\n writable: true,\n configurable: true\n }\n });\n };\n } else {\n // old school shim for old browsers\n module.exports = function inherits(ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function() {};\n TempCtor.prototype = superCtor.prototype;\n ctor.prototype = new TempCtor();\n ctor.prototype.constructor = ctor;\n };\n }\n },\n {}\n ],\n 107: [\n function(require, module, exports) {\n /*!\n * Determine if an object is a Buffer\n *\n * @author Feross Aboukhadijeh \n * @license MIT\n */\n\n // The _isBuffer check is for Safari 5-7 support, because it's missing\n // Object.prototype.constructor. Remove this eventually\n module.exports = function(obj) {\n return (\n obj != null &&\n (isBuffer(obj) || isSlowBuffer(obj) || !!obj._isBuffer)\n );\n };\n\n function isBuffer(obj) {\n return (\n !!obj.constructor &&\n typeof obj.constructor.isBuffer === \"function\" &&\n obj.constructor.isBuffer(obj)\n );\n }\n\n // For Node v0.10 support. Remove this eventually.\n function isSlowBuffer(obj) {\n return (\n typeof obj.readFloatLE === \"function\" &&\n typeof obj.slice === \"function\" &&\n isBuffer(obj.slice(0, 0))\n );\n }\n },\n {}\n ],\n 108: [\n function(require, module, exports) {\n var toString = {}.toString;\n\n module.exports =\n Array.isArray ||\n function(arr) {\n return toString.call(arr) == \"[object Array]\";\n };\n },\n {}\n ],\n 109: [\n function(require, module, exports) {\n exports.endianness = function() {\n return \"LE\";\n };\n\n exports.hostname = function() {\n if (typeof location !== \"undefined\") {\n return location.hostname;\n } else return \"\";\n };\n\n exports.loadavg = function() {\n return [];\n };\n\n exports.uptime = function() {\n return 0;\n };\n\n exports.freemem = function() {\n return Number.MAX_VALUE;\n };\n\n exports.totalmem = function() {\n return Number.MAX_VALUE;\n };\n\n exports.cpus = function() {\n return [];\n };\n\n exports.type = function() {\n return \"Browser\";\n };\n\n exports.release = function() {\n if (typeof navigator !== \"undefined\") {\n return navigator.appVersion;\n }\n return \"\";\n };\n\n exports.networkInterfaces = exports.getNetworkInterfaces = function() {\n return {};\n };\n\n exports.arch = function() {\n return \"javascript\";\n };\n\n exports.platform = function() {\n return \"browser\";\n };\n\n exports.tmpdir = exports.tmpDir = function() {\n return \"/tmp\";\n };\n\n exports.EOL = \"\\n\";\n\n exports.homedir = function() {\n return \"/\";\n };\n },\n {}\n ],\n 110: [\n function(require, module, exports) {\n (function(process) {\n // .dirname, .basename, and .extname methods are extracted from Node.js v8.11.1,\n // backported and transplited with Babel, with backwards-compat fixes\n\n // Copyright Joyent, Inc. and other Node contributors.\n //\n // Permission is hereby granted, free of charge, to any person obtaining a\n // copy of this software and associated documentation files (the\n // \"Software\"), to deal in the Software without restriction, including\n // without limitation the rights to use, copy, modify, merge, publish,\n // distribute, sublicense, and/or sell copies of the Software, and to permit\n // persons to whom the Software is furnished to do so, subject to the\n // following conditions:\n //\n // The above copyright notice and this permission notice shall be included\n // in all copies or substantial portions of the Software.\n //\n // THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n // OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n // MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n // NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n // DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n // OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n // USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n // resolves . and .. elements in a path array with directory names there\n // must be no slashes, empty elements, or device names (c:\\) in the array\n // (so also no leading and trailing slashes - it does not distinguish\n // relative and absolute paths)\n function normalizeArray(parts, allowAboveRoot) {\n // if the path tries to go above the root, `up` ends up > 0\n var up = 0;\n for (var i = parts.length - 1; i >= 0; i--) {\n var last = parts[i];\n if (last === \".\") {\n parts.splice(i, 1);\n } else if (last === \"..\") {\n parts.splice(i, 1);\n up++;\n } else if (up) {\n parts.splice(i, 1);\n up--;\n }\n }\n\n // if the path is allowed to go above the root, restore leading ..s\n if (allowAboveRoot) {\n for (; up--; up) {\n parts.unshift(\"..\");\n }\n }\n\n return parts;\n }\n\n // path.resolve([from ...], to)\n // posix version\n exports.resolve = function() {\n var resolvedPath = \"\",\n resolvedAbsolute = false;\n\n for (\n var i = arguments.length - 1;\n i >= -1 && !resolvedAbsolute;\n i--\n ) {\n var path = i >= 0 ? arguments[i] : process.cwd();\n\n // Skip empty and invalid entries\n if (typeof path !== \"string\") {\n throw new TypeError(\n \"Arguments to path.resolve must be strings\"\n );\n } else if (!path) {\n continue;\n }\n\n resolvedPath = path + \"/\" + resolvedPath;\n resolvedAbsolute = path.charAt(0) === \"/\";\n }\n\n // At this point the path should be resolved to a full absolute path, but\n // handle relative paths to be safe (might happen when process.cwd() fails)\n\n // Normalize the path\n resolvedPath = normalizeArray(\n filter(resolvedPath.split(\"/\"), function(p) {\n return !!p;\n }),\n !resolvedAbsolute\n ).join(\"/\");\n\n return (resolvedAbsolute ? \"/\" : \"\") + resolvedPath || \".\";\n };\n\n // path.normalize(path)\n // posix version\n exports.normalize = function(path) {\n var isAbsolute = exports.isAbsolute(path),\n trailingSlash = substr(path, -1) === \"/\";\n\n // Normalize the path\n path = normalizeArray(\n filter(path.split(\"/\"), function(p) {\n return !!p;\n }),\n !isAbsolute\n ).join(\"/\");\n\n if (!path && !isAbsolute) {\n path = \".\";\n }\n if (path && trailingSlash) {\n path += \"/\";\n }\n\n return (isAbsolute ? \"/\" : \"\") + path;\n };\n\n // posix version\n exports.isAbsolute = function(path) {\n return path.charAt(0) === \"/\";\n };\n\n // posix version\n exports.join = function() {\n var paths = Array.prototype.slice.call(arguments, 0);\n return exports.normalize(\n filter(paths, function(p, index) {\n if (typeof p !== \"string\") {\n throw new TypeError(\"Arguments to path.join must be strings\");\n }\n return p;\n }).join(\"/\")\n );\n };\n\n // path.relative(from, to)\n // posix version\n exports.relative = function(from, to) {\n from = exports.resolve(from).substr(1);\n to = exports.resolve(to).substr(1);\n\n function trim(arr) {\n var start = 0;\n for (; start < arr.length; start++) {\n if (arr[start] !== \"\") break;\n }\n\n var end = arr.length - 1;\n for (; end >= 0; end--) {\n if (arr[end] !== \"\") break;\n }\n\n if (start > end) return [];\n return arr.slice(start, end - start + 1);\n }\n\n var fromParts = trim(from.split(\"/\"));\n var toParts = trim(to.split(\"/\"));\n\n var length = Math.min(fromParts.length, toParts.length);\n var samePartsLength = length;\n for (var i = 0; i < length; i++) {\n if (fromParts[i] !== toParts[i]) {\n samePartsLength = i;\n break;\n }\n }\n\n var outputParts = [];\n for (var i = samePartsLength; i < fromParts.length; i++) {\n outputParts.push(\"..\");\n }\n\n outputParts = outputParts.concat(toParts.slice(samePartsLength));\n\n return outputParts.join(\"/\");\n };\n\n exports.sep = \"/\";\n exports.delimiter = \":\";\n\n exports.dirname = function(path) {\n if (typeof path !== \"string\") path = path + \"\";\n if (path.length === 0) return \".\";\n var code = path.charCodeAt(0);\n var hasRoot = code === 47; /*/*/\n var end = -1;\n var matchedSlash = true;\n for (var i = path.length - 1; i >= 1; --i) {\n code = path.charCodeAt(i);\n if (code === 47 /*/*/) {\n if (!matchedSlash) {\n end = i;\n break;\n }\n } else {\n // We saw the first non-path separator\n matchedSlash = false;\n }\n }\n\n if (end === -1) return hasRoot ? \"/\" : \".\";\n if (hasRoot && end === 1) {\n // return '//';\n // Backwards-compat fix:\n return \"/\";\n }\n return path.slice(0, end);\n };\n\n function basename(path) {\n if (typeof path !== \"string\") path = path + \"\";\n\n var start = 0;\n var end = -1;\n var matchedSlash = true;\n var i;\n\n for (i = path.length - 1; i >= 0; --i) {\n if (path.charCodeAt(i) === 47 /*/*/) {\n // If we reached a path separator that was not part of a set of path\n // separators at the end of the string, stop now\n if (!matchedSlash) {\n start = i + 1;\n break;\n }\n } else if (end === -1) {\n // We saw the first non-path separator, mark this as the end of our\n // path component\n matchedSlash = false;\n end = i + 1;\n }\n }\n\n if (end === -1) return \"\";\n return path.slice(start, end);\n }\n\n // Uses a mixed approach for backwards-compatibility, as ext behavior changed\n // in new Node.js versions, so only basename() above is backported here\n exports.basename = function(path, ext) {\n var f = basename(path);\n if (ext && f.substr(-1 * ext.length) === ext) {\n f = f.substr(0, f.length - ext.length);\n }\n return f;\n };\n\n exports.extname = function(path) {\n if (typeof path !== \"string\") path = path + \"\";\n var startDot = -1;\n var startPart = 0;\n var end = -1;\n var matchedSlash = true;\n // Track the state of characters (if any) we see before our first dot and\n // after any path separator we find\n var preDotState = 0;\n for (var i = path.length - 1; i >= 0; --i) {\n var code = path.charCodeAt(i);\n if (code === 47 /*/*/) {\n // If we reached a path separator that was not part of a set of path\n // separators at the end of the string, stop now\n if (!matchedSlash) {\n startPart = i + 1;\n break;\n }\n continue;\n }\n if (end === -1) {\n // We saw the first non-path separator, mark this as the end of our\n // extension\n matchedSlash = false;\n end = i + 1;\n }\n if (code === 46 /*.*/) {\n // If this is our first dot, mark it as the start of our extension\n if (startDot === -1) startDot = i;\n else if (preDotState !== 1) preDotState = 1;\n } else if (startDot !== -1) {\n // We saw a non-dot and non-path separator before our dot, so we should\n // have a good chance at having a non-empty extension\n preDotState = -1;\n }\n }\n\n if (\n startDot === -1 ||\n end === -1 ||\n // We saw a non-dot character immediately before the dot\n preDotState === 0 ||\n // The (right-most) trimmed path component is exactly '..'\n (preDotState === 1 &&\n startDot === end - 1 &&\n startDot === startPart + 1)\n ) {\n return \"\";\n }\n return path.slice(startDot, end);\n };\n\n function filter(xs, f) {\n if (xs.filter) return xs.filter(f);\n var res = [];\n for (var i = 0; i < xs.length; i++) {\n if (f(xs[i], i, xs)) res.push(xs[i]);\n }\n return res;\n }\n\n // String.prototype.substr - negative index don't work in IE8\n var substr =\n \"ab\".substr(-1) === \"b\"\n ? function(str, start, len) {\n return str.substr(start, len);\n }\n : function(str, start, len) {\n if (start < 0) start = str.length + start;\n return str.substr(start, len);\n };\n }.call(this, require(\"_process\")));\n },\n { _process: 112 }\n ],\n 111: [\n function(require, module, exports) {\n (function(process) {\n \"use strict\";\n\n if (\n !process.version ||\n process.version.indexOf(\"v0.\") === 0 ||\n (process.version.indexOf(\"v1.\") === 0 &&\n process.version.indexOf(\"v1.8.\") !== 0)\n ) {\n module.exports = { nextTick: nextTick };\n } else {\n module.exports = process;\n }\n\n function nextTick(fn, arg1, arg2, arg3) {\n if (typeof fn !== \"function\") {\n throw new TypeError('\"callback\" argument must be a function');\n }\n var len = arguments.length;\n var args, i;\n switch (len) {\n case 0:\n case 1:\n return process.nextTick(fn);\n case 2:\n return process.nextTick(function afterTickOne() {\n fn.call(null, arg1);\n });\n case 3:\n return process.nextTick(function afterTickTwo() {\n fn.call(null, arg1, arg2);\n });\n case 4:\n return process.nextTick(function afterTickThree() {\n fn.call(null, arg1, arg2, arg3);\n });\n default:\n args = new Array(len - 1);\n i = 0;\n while (i < args.length) {\n args[i++] = arguments[i];\n }\n return process.nextTick(function afterTick() {\n fn.apply(null, args);\n });\n }\n }\n }.call(this, require(\"_process\")));\n },\n { _process: 112 }\n ],\n 112: [\n function(require, module, exports) {\n // shim for using process in browser\n var process = (module.exports = {});\n\n // cached from whatever global is present so that test runners that stub it\n // don't break things. But we need to wrap it in a try catch in case it is\n // wrapped in strict mode code which doesn't define any globals. It's inside a\n // function because try/catches deoptimize in certain engines.\n\n var cachedSetTimeout;\n var cachedClearTimeout;\n\n function defaultSetTimout() {\n throw new Error(\"setTimeout has not been defined\");\n }\n function defaultClearTimeout() {\n throw new Error(\"clearTimeout has not been defined\");\n }\n (function() {\n try {\n if (typeof setTimeout === \"function\") {\n cachedSetTimeout = setTimeout;\n } else {\n cachedSetTimeout = defaultSetTimout;\n }\n } catch (e) {\n cachedSetTimeout = defaultSetTimout;\n }\n try {\n if (typeof clearTimeout === \"function\") {\n cachedClearTimeout = clearTimeout;\n } else {\n cachedClearTimeout = defaultClearTimeout;\n }\n } catch (e) {\n cachedClearTimeout = defaultClearTimeout;\n }\n })();\n function runTimeout(fun) {\n if (cachedSetTimeout === setTimeout) {\n //normal enviroments in sane situations\n return setTimeout(fun, 0);\n }\n // if setTimeout wasn't available but was latter defined\n if (\n (cachedSetTimeout === defaultSetTimout || !cachedSetTimeout) &&\n setTimeout\n ) {\n cachedSetTimeout = setTimeout;\n return setTimeout(fun, 0);\n }\n try {\n // when when somebody has screwed with setTimeout but no I.E. maddness\n return cachedSetTimeout(fun, 0);\n } catch (e) {\n try {\n // When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally\n return cachedSetTimeout.call(null, fun, 0);\n } catch (e) {\n // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error\n return cachedSetTimeout.call(this, fun, 0);\n }\n }\n }\n function runClearTimeout(marker) {\n if (cachedClearTimeout === clearTimeout) {\n //normal enviroments in sane situations\n return clearTimeout(marker);\n }\n // if clearTimeout wasn't available but was latter defined\n if (\n (cachedClearTimeout === defaultClearTimeout ||\n !cachedClearTimeout) &&\n clearTimeout\n ) {\n cachedClearTimeout = clearTimeout;\n return clearTimeout(marker);\n }\n try {\n // when when somebody has screwed with setTimeout but no I.E. maddness\n return cachedClearTimeout(marker);\n } catch (e) {\n try {\n // When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally\n return cachedClearTimeout.call(null, marker);\n } catch (e) {\n // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error.\n // Some versions of I.E. have different rules for clearTimeout vs setTimeout\n return cachedClearTimeout.call(this, marker);\n }\n }\n }\n var queue = [];\n var draining = false;\n var currentQueue;\n var queueIndex = -1;\n\n function cleanUpNextTick() {\n if (!draining || !currentQueue) {\n return;\n }\n draining = false;\n if (currentQueue.length) {\n queue = currentQueue.concat(queue);\n } else {\n queueIndex = -1;\n }\n if (queue.length) {\n drainQueue();\n }\n }\n\n function drainQueue() {\n if (draining) {\n return;\n }\n var timeout = runTimeout(cleanUpNextTick);\n draining = true;\n\n var len = queue.length;\n while (len) {\n currentQueue = queue;\n queue = [];\n while (++queueIndex < len) {\n if (currentQueue) {\n currentQueue[queueIndex].run();\n }\n }\n queueIndex = -1;\n len = queue.length;\n }\n currentQueue = null;\n draining = false;\n runClearTimeout(timeout);\n }\n\n process.nextTick = function(fun) {\n var args = new Array(arguments.length - 1);\n if (arguments.length > 1) {\n for (var i = 1; i < arguments.length; i++) {\n args[i - 1] = arguments[i];\n }\n }\n queue.push(new Item(fun, args));\n if (queue.length === 1 && !draining) {\n runTimeout(drainQueue);\n }\n };\n\n // v8 likes predictible objects\n function Item(fun, array) {\n this.fun = fun;\n this.array = array;\n }\n Item.prototype.run = function() {\n this.fun.apply(null, this.array);\n };\n process.title = \"browser\";\n process.browser = true;\n process.env = {};\n process.argv = [];\n process.version = \"\"; // empty string to avoid regexp issues\n process.versions = {};\n\n function noop() {}\n\n process.on = noop;\n process.addListener = noop;\n process.once = noop;\n process.off = noop;\n process.removeListener = noop;\n process.removeAllListeners = noop;\n process.emit = noop;\n process.prependListener = noop;\n process.prependOnceListener = noop;\n\n process.listeners = function(name) {\n return [];\n };\n\n process.binding = function(name) {\n throw new Error(\"process.binding is not supported\");\n };\n\n process.cwd = function() {\n return \"/\";\n };\n process.chdir = function(dir) {\n throw new Error(\"process.chdir is not supported\");\n };\n process.umask = function() {\n return 0;\n };\n },\n {}\n ],\n 113: [\n function(require, module, exports) {\n (function(global) {\n /*! https://mths.be/punycode v1.4.1 by @mathias */\n (function(root) {\n /** Detect free variables */\n var freeExports =\n typeof exports == \"object\" &&\n exports &&\n !exports.nodeType &&\n exports;\n var freeModule =\n typeof module == \"object\" && module && !module.nodeType && module;\n var freeGlobal = typeof global == \"object\" && global;\n if (\n freeGlobal.global === freeGlobal ||\n freeGlobal.window === freeGlobal ||\n freeGlobal.self === freeGlobal\n ) {\n root = freeGlobal;\n }\n\n /**\n * The `punycode` object.\n * @name punycode\n * @type Object\n */\n var punycode,\n /** Highest positive signed 32-bit float value */\n maxInt = 2147483647, // aka. 0x7FFFFFFF or 2^31-1\n /** Bootstring parameters */\n base = 36,\n tMin = 1,\n tMax = 26,\n skew = 38,\n damp = 700,\n initialBias = 72,\n initialN = 128, // 0x80\n delimiter = \"-\", // '\\x2D'\n /** Regular expressions */\n regexPunycode = /^xn--/,\n regexNonASCII = /[^\\x20-\\x7E]/, // unprintable ASCII chars + non-ASCII chars\n regexSeparators = /[\\x2E\\u3002\\uFF0E\\uFF61]/g, // RFC 3490 separators\n /** Error messages */\n errors = {\n overflow: \"Overflow: input needs wider integers to process\",\n \"not-basic\": \"Illegal input >= 0x80 (not a basic code point)\",\n \"invalid-input\": \"Invalid input\"\n },\n /** Convenience shortcuts */\n baseMinusTMin = base - tMin,\n floor = Math.floor,\n stringFromCharCode = String.fromCharCode,\n /** Temporary variable */\n key;\n\n /*--------------------------------------------------------------------------*/\n\n /**\n * A generic error utility function.\n * @private\n * @param {String} type The error type.\n * @returns {Error} Throws a `RangeError` with the applicable error message.\n */\n function error(type) {\n throw new RangeError(errors[type]);\n }\n\n /**\n * A generic `Array#map` utility function.\n * @private\n * @param {Array} array The array to iterate over.\n * @param {Function} callback The function that gets called for every array\n * item.\n * @returns {Array} A new array of values returned by the callback function.\n */\n function map(array, fn) {\n var length = array.length;\n var result = [];\n while (length--) {\n result[length] = fn(array[length]);\n }\n return result;\n }\n\n /**\n * A simple `Array#map`-like wrapper to work with domain name strings or email\n * addresses.\n * @private\n * @param {String} domain The domain name or email address.\n * @param {Function} callback The function that gets called for every\n * character.\n * @returns {Array} A new string of characters returned by the callback\n * function.\n */\n function mapDomain(string, fn) {\n var parts = string.split(\"@\");\n var result = \"\";\n if (parts.length > 1) {\n // In email addresses, only the domain name should be punycoded. Leave\n // the local part (i.e. everything up to `@`) intact.\n result = parts[0] + \"@\";\n string = parts[1];\n }\n // Avoid `split(regex)` for IE8 compatibility. See #17.\n string = string.replace(regexSeparators, \"\\x2E\");\n var labels = string.split(\".\");\n var encoded = map(labels, fn).join(\".\");\n return result + encoded;\n }\n\n /**\n * Creates an array containing the numeric code points of each Unicode\n * character in the string. While JavaScript uses UCS-2 internally,\n * this function will convert a pair of surrogate halves (each of which\n * UCS-2 exposes as separate characters) into a single code point,\n * matching UTF-16.\n * @see `punycode.ucs2.encode`\n * @see \n * @memberOf punycode.ucs2\n * @name decode\n * @param {String} string The Unicode input string (UCS-2).\n * @returns {Array} The new array of code points.\n */\n function ucs2decode(string) {\n var output = [],\n counter = 0,\n length = string.length,\n value,\n extra;\n while (counter < length) {\n value = string.charCodeAt(counter++);\n if (value >= 0xd800 && value <= 0xdbff && counter < length) {\n // high surrogate, and there is a next character\n extra = string.charCodeAt(counter++);\n if ((extra & 0xfc00) == 0xdc00) {\n // low surrogate\n output.push(\n ((value & 0x3ff) << 10) + (extra & 0x3ff) + 0x10000\n );\n } else {\n // unmatched surrogate; only append this code unit, in case the next\n // code unit is the high surrogate of a surrogate pair\n output.push(value);\n counter--;\n }\n } else {\n output.push(value);\n }\n }\n return output;\n }\n\n /**\n * Creates a string based on an array of numeric code points.\n * @see `punycode.ucs2.decode`\n * @memberOf punycode.ucs2\n * @name encode\n * @param {Array} codePoints The array of numeric code points.\n * @returns {String} The new Unicode string (UCS-2).\n */\n function ucs2encode(array) {\n return map(array, function(value) {\n var output = \"\";\n if (value > 0xffff) {\n value -= 0x10000;\n output += stringFromCharCode(\n ((value >>> 10) & 0x3ff) | 0xd800\n );\n value = 0xdc00 | (value & 0x3ff);\n }\n output += stringFromCharCode(value);\n return output;\n }).join(\"\");\n }\n\n /**\n * Converts a basic code point into a digit/integer.\n * @see `digitToBasic()`\n * @private\n * @param {Number} codePoint The basic numeric code point value.\n * @returns {Number} The numeric value of a basic code point (for use in\n * representing integers) in the range `0` to `base - 1`, or `base` if\n * the code point does not represent a value.\n */\n function basicToDigit(codePoint) {\n if (codePoint - 48 < 10) {\n return codePoint - 22;\n }\n if (codePoint - 65 < 26) {\n return codePoint - 65;\n }\n if (codePoint - 97 < 26) {\n return codePoint - 97;\n }\n return base;\n }\n\n /**\n * Converts a digit/integer into a basic code point.\n * @see `basicToDigit()`\n * @private\n * @param {Number} digit The numeric value of a basic code point.\n * @returns {Number} The basic code point whose value (when used for\n * representing integers) is `digit`, which needs to be in the range\n * `0` to `base - 1`. If `flag` is non-zero, the uppercase form is\n * used; else, the lowercase form is used. The behavior is undefined\n * if `flag` is non-zero and `digit` has no uppercase form.\n */\n function digitToBasic(digit, flag) {\n // 0..25 map to ASCII a..z or A..Z\n // 26..35 map to ASCII 0..9\n return digit + 22 + 75 * (digit < 26) - ((flag != 0) << 5);\n }\n\n /**\n * Bias adaptation function as per section 3.4 of RFC 3492.\n * https://tools.ietf.org/html/rfc3492#section-3.4\n * @private\n */\n function adapt(delta, numPoints, firstTime) {\n var k = 0;\n delta = firstTime ? floor(delta / damp) : delta >> 1;\n delta += floor(delta / numPoints);\n for (\n ;\n /* no initialization */ delta > (baseMinusTMin * tMax) >> 1;\n k += base\n ) {\n delta = floor(delta / baseMinusTMin);\n }\n return floor(k + ((baseMinusTMin + 1) * delta) / (delta + skew));\n }\n\n /**\n * Converts a Punycode string of ASCII-only symbols to a string of Unicode\n * symbols.\n * @memberOf punycode\n * @param {String} input The Punycode string of ASCII-only symbols.\n * @returns {String} The resulting string of Unicode symbols.\n */\n function decode(input) {\n // Don't use UCS-2\n var output = [],\n inputLength = input.length,\n out,\n i = 0,\n n = initialN,\n bias = initialBias,\n basic,\n j,\n index,\n oldi,\n w,\n k,\n digit,\n t,\n /** Cached calculation results */\n baseMinusT;\n\n // Handle the basic code points: let `basic` be the number of input code\n // points before the last delimiter, or `0` if there is none, then copy\n // the first basic code points to the output.\n\n basic = input.lastIndexOf(delimiter);\n if (basic < 0) {\n basic = 0;\n }\n\n for (j = 0; j < basic; ++j) {\n // if it's not a basic code point\n if (input.charCodeAt(j) >= 0x80) {\n error(\"not-basic\");\n }\n output.push(input.charCodeAt(j));\n }\n\n // Main decoding loop: start just after the last delimiter if any basic code\n // points were copied; start at the beginning otherwise.\n\n for (\n index = basic > 0 ? basic + 1 : 0;\n index < inputLength /* no final expression */;\n\n ) {\n // `index` is the index of the next character to be consumed.\n // Decode a generalized variable-length integer into `delta`,\n // which gets added to `i`. The overflow checking is easier\n // if we increase `i` as we go, then subtract off its starting\n // value at the end to obtain `delta`.\n for (\n oldi = i, w = 1, k = base /* no condition */;\n ;\n k += base\n ) {\n if (index >= inputLength) {\n error(\"invalid-input\");\n }\n\n digit = basicToDigit(input.charCodeAt(index++));\n\n if (digit >= base || digit > floor((maxInt - i) / w)) {\n error(\"overflow\");\n }\n\n i += digit * w;\n t = k <= bias ? tMin : k >= bias + tMax ? tMax : k - bias;\n\n if (digit < t) {\n break;\n }\n\n baseMinusT = base - t;\n if (w > floor(maxInt / baseMinusT)) {\n error(\"overflow\");\n }\n\n w *= baseMinusT;\n }\n\n out = output.length + 1;\n bias = adapt(i - oldi, out, oldi == 0);\n\n // `i` was supposed to wrap around from `out` to `0`,\n // incrementing `n` each time, so we'll fix that now:\n if (floor(i / out) > maxInt - n) {\n error(\"overflow\");\n }\n\n n += floor(i / out);\n i %= out;\n\n // Insert `n` at position `i` of the output\n output.splice(i++, 0, n);\n }\n\n return ucs2encode(output);\n }\n\n /**\n * Converts a string of Unicode symbols (e.g. a domain name label) to a\n * Punycode string of ASCII-only symbols.\n * @memberOf punycode\n * @param {String} input The string of Unicode symbols.\n * @returns {String} The resulting Punycode string of ASCII-only symbols.\n */\n function encode(input) {\n var n,\n delta,\n handledCPCount,\n basicLength,\n bias,\n j,\n m,\n q,\n k,\n t,\n currentValue,\n output = [],\n /** `inputLength` will hold the number of code points in `input`. */\n inputLength,\n /** Cached calculation results */\n handledCPCountPlusOne,\n baseMinusT,\n qMinusT;\n\n // Convert the input in UCS-2 to Unicode\n input = ucs2decode(input);\n\n // Cache the length\n inputLength = input.length;\n\n // Initialize the state\n n = initialN;\n delta = 0;\n bias = initialBias;\n\n // Handle the basic code points\n for (j = 0; j < inputLength; ++j) {\n currentValue = input[j];\n if (currentValue < 0x80) {\n output.push(stringFromCharCode(currentValue));\n }\n }\n\n handledCPCount = basicLength = output.length;\n\n // `handledCPCount` is the number of code points that have been handled;\n // `basicLength` is the number of basic code points.\n\n // Finish the basic string - if it is not empty - with a delimiter\n if (basicLength) {\n output.push(delimiter);\n }\n\n // Main encoding loop:\n while (handledCPCount < inputLength) {\n // All non-basic code points < n have been handled already. Find the next\n // larger one:\n for (m = maxInt, j = 0; j < inputLength; ++j) {\n currentValue = input[j];\n if (currentValue >= n && currentValue < m) {\n m = currentValue;\n }\n }\n\n // Increase `delta` enough to advance the decoder's state to ,\n // but guard against overflow\n handledCPCountPlusOne = handledCPCount + 1;\n if (m - n > floor((maxInt - delta) / handledCPCountPlusOne)) {\n error(\"overflow\");\n }\n\n delta += (m - n) * handledCPCountPlusOne;\n n = m;\n\n for (j = 0; j < inputLength; ++j) {\n currentValue = input[j];\n\n if (currentValue < n && ++delta > maxInt) {\n error(\"overflow\");\n }\n\n if (currentValue == n) {\n // Represent delta as a generalized variable-length integer\n for (q = delta, k = base /* no condition */; ; k += base) {\n t = k <= bias ? tMin : k >= bias + tMax ? tMax : k - bias;\n if (q < t) {\n break;\n }\n qMinusT = q - t;\n baseMinusT = base - t;\n output.push(\n stringFromCharCode(\n digitToBasic(t + (qMinusT % baseMinusT), 0)\n )\n );\n q = floor(qMinusT / baseMinusT);\n }\n\n output.push(stringFromCharCode(digitToBasic(q, 0)));\n bias = adapt(\n delta,\n handledCPCountPlusOne,\n handledCPCount == basicLength\n );\n delta = 0;\n ++handledCPCount;\n }\n }\n\n ++delta;\n ++n;\n }\n return output.join(\"\");\n }\n\n /**\n * Converts a Punycode string representing a domain name or an email address\n * to Unicode. Only the Punycoded parts of the input will be converted, i.e.\n * it doesn't matter if you call it on a string that has already been\n * converted to Unicode.\n * @memberOf punycode\n * @param {String} input The Punycoded domain name or email address to\n * convert to Unicode.\n * @returns {String} The Unicode representation of the given Punycode\n * string.\n */\n function toUnicode(input) {\n return mapDomain(input, function(string) {\n return regexPunycode.test(string)\n ? decode(string.slice(4).toLowerCase())\n : string;\n });\n }\n\n /**\n * Converts a Unicode string representing a domain name or an email address to\n * Punycode. Only the non-ASCII parts of the domain name will be converted,\n * i.e. it doesn't matter if you call it with a domain that's already in\n * ASCII.\n * @memberOf punycode\n * @param {String} input The domain name or email address to convert, as a\n * Unicode string.\n * @returns {String} The Punycode representation of the given domain name or\n * email address.\n */\n function toASCII(input) {\n return mapDomain(input, function(string) {\n return regexNonASCII.test(string)\n ? \"xn--\" + encode(string)\n : string;\n });\n }\n\n /*--------------------------------------------------------------------------*/\n\n /** Define the public API */\n punycode = {\n /**\n * A string representing the current Punycode.js version number.\n * @memberOf punycode\n * @type String\n */\n version: \"1.4.1\",\n /**\n * An object of methods to convert from JavaScript's internal character\n * representation (UCS-2) to Unicode code points, and back.\n * @see \n * @memberOf punycode\n * @type Object\n */\n ucs2: {\n decode: ucs2decode,\n encode: ucs2encode\n },\n decode: decode,\n encode: encode,\n toASCII: toASCII,\n toUnicode: toUnicode\n };\n\n /** Expose `punycode` */\n // Some AMD build optimizers, like r.js, check for specific condition patterns\n // like the following:\n if (\n typeof define == \"function\" &&\n typeof define.amd == \"object\" &&\n define.amd\n ) {\n define(\"punycode\", function() {\n return punycode;\n });\n } else if (freeExports && freeModule) {\n if (module.exports == freeExports) {\n // in Node.js, io.js, or RingoJS v0.8.0+\n freeModule.exports = punycode;\n } else {\n // in Narwhal or RingoJS v0.7.0-\n for (key in punycode) {\n punycode.hasOwnProperty(key) &&\n (freeExports[key] = punycode[key]);\n }\n }\n } else {\n // in Rhino or a web browser\n root.punycode = punycode;\n }\n })(this);\n }.call(\n this,\n typeof global !== \"undefined\"\n ? global\n : typeof self !== \"undefined\"\n ? self\n : typeof window !== \"undefined\"\n ? window\n : {}\n ));\n },\n {}\n ],\n 114: [\n function(require, module, exports) {\n // Copyright Joyent, Inc. and other Node contributors.\n //\n // Permission is hereby granted, free of charge, to any person obtaining a\n // copy of this software and associated documentation files (the\n // \"Software\"), to deal in the Software without restriction, including\n // without limitation the rights to use, copy, modify, merge, publish,\n // distribute, sublicense, and/or sell copies of the Software, and to permit\n // persons to whom the Software is furnished to do so, subject to the\n // following conditions:\n //\n // The above copyright notice and this permission notice shall be included\n // in all copies or substantial portions of the Software.\n //\n // THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n // OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n // MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n // NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n // DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n // OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n // USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n \"use strict\";\n\n // If obj.hasOwnProperty has been overridden, then calling\n // obj.hasOwnProperty(prop) will break.\n // See: https://github.com/joyent/node/issues/1707\n function hasOwnProperty(obj, prop) {\n return Object.prototype.hasOwnProperty.call(obj, prop);\n }\n\n module.exports = function(qs, sep, eq, options) {\n sep = sep || \"&\";\n eq = eq || \"=\";\n var obj = {};\n\n if (typeof qs !== \"string\" || qs.length === 0) {\n return obj;\n }\n\n var regexp = /\\+/g;\n qs = qs.split(sep);\n\n var maxKeys = 1000;\n if (options && typeof options.maxKeys === \"number\") {\n maxKeys = options.maxKeys;\n }\n\n var len = qs.length;\n // maxKeys <= 0 means that we should not limit keys count\n if (maxKeys > 0 && len > maxKeys) {\n len = maxKeys;\n }\n\n for (var i = 0; i < len; ++i) {\n var x = qs[i].replace(regexp, \"%20\"),\n idx = x.indexOf(eq),\n kstr,\n vstr,\n k,\n v;\n\n if (idx >= 0) {\n kstr = x.substr(0, idx);\n vstr = x.substr(idx + 1);\n } else {\n kstr = x;\n vstr = \"\";\n }\n\n k = decodeURIComponent(kstr);\n v = decodeURIComponent(vstr);\n\n if (!hasOwnProperty(obj, k)) {\n obj[k] = v;\n } else if (isArray(obj[k])) {\n obj[k].push(v);\n } else {\n obj[k] = [obj[k], v];\n }\n }\n\n return obj;\n };\n\n var isArray =\n Array.isArray ||\n function(xs) {\n return Object.prototype.toString.call(xs) === \"[object Array]\";\n };\n },\n {}\n ],\n 115: [\n function(require, module, exports) {\n // Copyright Joyent, Inc. and other Node contributors.\n //\n // Permission is hereby granted, free of charge, to any person obtaining a\n // copy of this software and associated documentation files (the\n // \"Software\"), to deal in the Software without restriction, including\n // without limitation the rights to use, copy, modify, merge, publish,\n // distribute, sublicense, and/or sell copies of the Software, and to permit\n // persons to whom the Software is furnished to do so, subject to the\n // following conditions:\n //\n // The above copyright notice and this permission notice shall be included\n // in all copies or substantial portions of the Software.\n //\n // THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n // OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n // MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n // NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n // DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n // OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n // USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n \"use strict\";\n\n var stringifyPrimitive = function(v) {\n switch (typeof v) {\n case \"string\":\n return v;\n\n case \"boolean\":\n return v ? \"true\" : \"false\";\n\n case \"number\":\n return isFinite(v) ? v : \"\";\n\n default:\n return \"\";\n }\n };\n\n module.exports = function(obj, sep, eq, name) {\n sep = sep || \"&\";\n eq = eq || \"=\";\n if (obj === null) {\n obj = undefined;\n }\n\n if (typeof obj === \"object\") {\n return map(objectKeys(obj), function(k) {\n var ks = encodeURIComponent(stringifyPrimitive(k)) + eq;\n if (isArray(obj[k])) {\n return map(obj[k], function(v) {\n return ks + encodeURIComponent(stringifyPrimitive(v));\n }).join(sep);\n } else {\n return ks + encodeURIComponent(stringifyPrimitive(obj[k]));\n }\n }).join(sep);\n }\n\n if (!name) return \"\";\n return (\n encodeURIComponent(stringifyPrimitive(name)) +\n eq +\n encodeURIComponent(stringifyPrimitive(obj))\n );\n };\n\n var isArray =\n Array.isArray ||\n function(xs) {\n return Object.prototype.toString.call(xs) === \"[object Array]\";\n };\n\n function map(xs, f) {\n if (xs.map) return xs.map(f);\n var res = [];\n for (var i = 0; i < xs.length; i++) {\n res.push(f(xs[i], i));\n }\n return res;\n }\n\n var objectKeys =\n Object.keys ||\n function(obj) {\n var res = [];\n for (var key in obj) {\n if (Object.prototype.hasOwnProperty.call(obj, key)) res.push(key);\n }\n return res;\n };\n },\n {}\n ],\n 116: [\n function(require, module, exports) {\n \"use strict\";\n\n exports.decode = exports.parse = require(\"./decode\");\n exports.encode = exports.stringify = require(\"./encode\");\n },\n { \"./decode\": 114, \"./encode\": 115 }\n ],\n 117: [\n function(require, module, exports) {\n // Copyright Joyent, Inc. and other Node contributors.\n //\n // Permission is hereby granted, free of charge, to any person obtaining a\n // copy of this software and associated documentation files (the\n // \"Software\"), to deal in the Software without restriction, including\n // without limitation the rights to use, copy, modify, merge, publish,\n // distribute, sublicense, and/or sell copies of the Software, and to permit\n // persons to whom the Software is furnished to do so, subject to the\n // following conditions:\n //\n // The above copyright notice and this permission notice shall be included\n // in all copies or substantial portions of the Software.\n //\n // THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n // OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n // MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n // NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n // DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n // OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n // USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n // a duplex stream is just a stream that is both readable and writable.\n // Since JS doesn't have multiple prototypal inheritance, this class\n // prototypally inherits from Readable, and then parasitically from\n // Writable.\n\n \"use strict\";\n\n /**/\n\n var pna = require(\"process-nextick-args\");\n /* */\n\n /**/\n var objectKeys =\n Object.keys ||\n function(obj) {\n var keys = [];\n for (var key in obj) {\n keys.push(key);\n }\n return keys;\n };\n /* */\n\n module.exports = Duplex;\n\n /**/\n var util = require(\"core-util-is\");\n util.inherits = require(\"inherits\");\n /* */\n\n var Readable = require(\"./_stream_readable\");\n var Writable = require(\"./_stream_writable\");\n\n util.inherits(Duplex, Readable);\n\n {\n // avoid scope creep, the keys array can then be collected\n var keys = objectKeys(Writable.prototype);\n for (var v = 0; v < keys.length; v++) {\n var method = keys[v];\n if (!Duplex.prototype[method])\n Duplex.prototype[method] = Writable.prototype[method];\n }\n }\n\n function Duplex(options) {\n if (!(this instanceof Duplex)) return new Duplex(options);\n\n Readable.call(this, options);\n Writable.call(this, options);\n\n if (options && options.readable === false) this.readable = false;\n\n if (options && options.writable === false) this.writable = false;\n\n this.allowHalfOpen = true;\n if (options && options.allowHalfOpen === false)\n this.allowHalfOpen = false;\n\n this.once(\"end\", onend);\n }\n\n Object.defineProperty(Duplex.prototype, \"writableHighWaterMark\", {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function() {\n return this._writableState.highWaterMark;\n }\n });\n\n // the no-half-open enforcer\n function onend() {\n // if we allow half-open state, or if the writable side ended,\n // then we're ok.\n if (this.allowHalfOpen || this._writableState.ended) return;\n\n // no more data can be written.\n // But allow more writes to happen in this tick.\n pna.nextTick(onEndNT, this);\n }\n\n function onEndNT(self) {\n self.end();\n }\n\n Object.defineProperty(Duplex.prototype, \"destroyed\", {\n get: function() {\n if (\n this._readableState === undefined ||\n this._writableState === undefined\n ) {\n return false;\n }\n return (\n this._readableState.destroyed && this._writableState.destroyed\n );\n },\n set: function(value) {\n // we ignore the value if the stream\n // has not been initialized yet\n if (\n this._readableState === undefined ||\n this._writableState === undefined\n ) {\n return;\n }\n\n // backward compatibility, the user is explicitly\n // managing destroyed\n this._readableState.destroyed = value;\n this._writableState.destroyed = value;\n }\n });\n\n Duplex.prototype._destroy = function(err, cb) {\n this.push(null);\n this.end();\n\n pna.nextTick(cb, err);\n };\n },\n {\n \"./_stream_readable\": 119,\n \"./_stream_writable\": 121,\n \"core-util-is\": 101,\n inherits: 106,\n \"process-nextick-args\": 111\n }\n ],\n 118: [\n function(require, module, exports) {\n // Copyright Joyent, Inc. and other Node contributors.\n //\n // Permission is hereby granted, free of charge, to any person obtaining a\n // copy of this software and associated documentation files (the\n // \"Software\"), to deal in the Software without restriction, including\n // without limitation the rights to use, copy, modify, merge, publish,\n // distribute, sublicense, and/or sell copies of the Software, and to permit\n // persons to whom the Software is furnished to do so, subject to the\n // following conditions:\n //\n // The above copyright notice and this permission notice shall be included\n // in all copies or substantial portions of the Software.\n //\n // THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n // OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n // MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n // NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n // DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n // OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n // USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n // a passthrough stream.\n // basically just the most minimal sort of Transform stream.\n // Every written chunk gets output as-is.\n\n \"use strict\";\n\n module.exports = PassThrough;\n\n var Transform = require(\"./_stream_transform\");\n\n /**/\n var util = require(\"core-util-is\");\n util.inherits = require(\"inherits\");\n /* */\n\n util.inherits(PassThrough, Transform);\n\n function PassThrough(options) {\n if (!(this instanceof PassThrough)) return new PassThrough(options);\n\n Transform.call(this, options);\n }\n\n PassThrough.prototype._transform = function(chunk, encoding, cb) {\n cb(null, chunk);\n };\n },\n { \"./_stream_transform\": 120, \"core-util-is\": 101, inherits: 106 }\n ],\n 119: [\n function(require, module, exports) {\n (function(process, global) {\n // Copyright Joyent, Inc. and other Node contributors.\n //\n // Permission is hereby granted, free of charge, to any person obtaining a\n // copy of this software and associated documentation files (the\n // \"Software\"), to deal in the Software without restriction, including\n // without limitation the rights to use, copy, modify, merge, publish,\n // distribute, sublicense, and/or sell copies of the Software, and to permit\n // persons to whom the Software is furnished to do so, subject to the\n // following conditions:\n //\n // The above copyright notice and this permission notice shall be included\n // in all copies or substantial portions of the Software.\n //\n // THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n // OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n // MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n // NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n // DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n // OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n // USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n \"use strict\";\n\n /**/\n\n var pna = require(\"process-nextick-args\");\n /* */\n\n module.exports = Readable;\n\n /**/\n var isArray = require(\"isarray\");\n /* */\n\n /**/\n var Duplex;\n /* */\n\n Readable.ReadableState = ReadableState;\n\n /**/\n var EE = require(\"events\").EventEmitter;\n\n var EElistenerCount = function(emitter, type) {\n return emitter.listeners(type).length;\n };\n /* */\n\n /**/\n var Stream = require(\"./internal/streams/stream\");\n /* */\n\n /**/\n\n var Buffer = require(\"safe-buffer\").Buffer;\n var OurUint8Array = global.Uint8Array || function() {};\n function _uint8ArrayToBuffer(chunk) {\n return Buffer.from(chunk);\n }\n function _isUint8Array(obj) {\n return Buffer.isBuffer(obj) || obj instanceof OurUint8Array;\n }\n\n /* */\n\n /**/\n var util = require(\"core-util-is\");\n util.inherits = require(\"inherits\");\n /* */\n\n /**/\n var debugUtil = require(\"util\");\n var debug = void 0;\n if (debugUtil && debugUtil.debuglog) {\n debug = debugUtil.debuglog(\"stream\");\n } else {\n debug = function() {};\n }\n /* */\n\n var BufferList = require(\"./internal/streams/BufferList\");\n var destroyImpl = require(\"./internal/streams/destroy\");\n var StringDecoder;\n\n util.inherits(Readable, Stream);\n\n var kProxyEvents = [\"error\", \"close\", \"destroy\", \"pause\", \"resume\"];\n\n function prependListener(emitter, event, fn) {\n // Sadly this is not cacheable as some libraries bundle their own\n // event emitter implementation with them.\n if (typeof emitter.prependListener === \"function\")\n return emitter.prependListener(event, fn);\n\n // This is a hack to make sure that our error handler is attached before any\n // userland ones. NEVER DO THIS. This is here only because this code needs\n // to continue to work with older versions of Node.js that do not include\n // the prependListener() method. The goal is to eventually remove this hack.\n if (!emitter._events || !emitter._events[event])\n emitter.on(event, fn);\n else if (isArray(emitter._events[event]))\n emitter._events[event].unshift(fn);\n else emitter._events[event] = [fn, emitter._events[event]];\n }\n\n function ReadableState(options, stream) {\n Duplex = Duplex || require(\"./_stream_duplex\");\n\n options = options || {};\n\n // Duplex streams are both readable and writable, but share\n // the same options object.\n // However, some cases require setting options to different\n // values for the readable and the writable sides of the duplex stream.\n // These options can be provided separately as readableXXX and writableXXX.\n var isDuplex = stream instanceof Duplex;\n\n // object stream flag. Used to make read(n) ignore n and to\n // make all the buffer merging and length checks go away\n this.objectMode = !!options.objectMode;\n\n if (isDuplex)\n this.objectMode = this.objectMode || !!options.readableObjectMode;\n\n // the point at which it stops calling _read() to fill the buffer\n // Note: 0 is a valid value, means \"don't call _read preemptively ever\"\n var hwm = options.highWaterMark;\n var readableHwm = options.readableHighWaterMark;\n var defaultHwm = this.objectMode ? 16 : 16 * 1024;\n\n if (hwm || hwm === 0) this.highWaterMark = hwm;\n else if (isDuplex && (readableHwm || readableHwm === 0))\n this.highWaterMark = readableHwm;\n else this.highWaterMark = defaultHwm;\n\n // cast to ints.\n this.highWaterMark = Math.floor(this.highWaterMark);\n\n // A linked list is used to store data chunks instead of an array because the\n // linked list can remove elements from the beginning faster than\n // array.shift()\n this.buffer = new BufferList();\n this.length = 0;\n this.pipes = null;\n this.pipesCount = 0;\n this.flowing = null;\n this.ended = false;\n this.endEmitted = false;\n this.reading = false;\n\n // a flag to be able to tell if the event 'readable'/'data' is emitted\n // immediately, or on a later tick. We set this to true at first, because\n // any actions that shouldn't happen until \"later\" should generally also\n // not happen before the first read call.\n this.sync = true;\n\n // whenever we return null, then we set a flag to say\n // that we're awaiting a 'readable' event emission.\n this.needReadable = false;\n this.emittedReadable = false;\n this.readableListening = false;\n this.resumeScheduled = false;\n\n // has it been destroyed\n this.destroyed = false;\n\n // Crypto is kind of old and crusty. Historically, its default string\n // encoding is 'binary' so we have to make this configurable.\n // Everything else in the universe uses 'utf8', though.\n this.defaultEncoding = options.defaultEncoding || \"utf8\";\n\n // the number of writers that are awaiting a drain event in .pipe()s\n this.awaitDrain = 0;\n\n // if true, a maybeReadMore has been scheduled\n this.readingMore = false;\n\n this.decoder = null;\n this.encoding = null;\n if (options.encoding) {\n if (!StringDecoder)\n StringDecoder = require(\"string_decoder/\").StringDecoder;\n this.decoder = new StringDecoder(options.encoding);\n this.encoding = options.encoding;\n }\n }\n\n function Readable(options) {\n Duplex = Duplex || require(\"./_stream_duplex\");\n\n if (!(this instanceof Readable)) return new Readable(options);\n\n this._readableState = new ReadableState(options, this);\n\n // legacy\n this.readable = true;\n\n if (options) {\n if (typeof options.read === \"function\") this._read = options.read;\n\n if (typeof options.destroy === \"function\")\n this._destroy = options.destroy;\n }\n\n Stream.call(this);\n }\n\n Object.defineProperty(Readable.prototype, \"destroyed\", {\n get: function() {\n if (this._readableState === undefined) {\n return false;\n }\n return this._readableState.destroyed;\n },\n set: function(value) {\n // we ignore the value if the stream\n // has not been initialized yet\n if (!this._readableState) {\n return;\n }\n\n // backward compatibility, the user is explicitly\n // managing destroyed\n this._readableState.destroyed = value;\n }\n });\n\n Readable.prototype.destroy = destroyImpl.destroy;\n Readable.prototype._undestroy = destroyImpl.undestroy;\n Readable.prototype._destroy = function(err, cb) {\n this.push(null);\n cb(err);\n };\n\n // Manually shove something into the read() buffer.\n // This returns true if the highWaterMark has not been hit yet,\n // similar to how Writable.write() returns true if you should\n // write() some more.\n Readable.prototype.push = function(chunk, encoding) {\n var state = this._readableState;\n var skipChunkCheck;\n\n if (!state.objectMode) {\n if (typeof chunk === \"string\") {\n encoding = encoding || state.defaultEncoding;\n if (encoding !== state.encoding) {\n chunk = Buffer.from(chunk, encoding);\n encoding = \"\";\n }\n skipChunkCheck = true;\n }\n } else {\n skipChunkCheck = true;\n }\n\n return readableAddChunk(\n this,\n chunk,\n encoding,\n false,\n skipChunkCheck\n );\n };\n\n // Unshift should *always* be something directly out of read()\n Readable.prototype.unshift = function(chunk) {\n return readableAddChunk(this, chunk, null, true, false);\n };\n\n function readableAddChunk(\n stream,\n chunk,\n encoding,\n addToFront,\n skipChunkCheck\n ) {\n var state = stream._readableState;\n if (chunk === null) {\n state.reading = false;\n onEofChunk(stream, state);\n } else {\n var er;\n if (!skipChunkCheck) er = chunkInvalid(state, chunk);\n if (er) {\n stream.emit(\"error\", er);\n } else if (state.objectMode || (chunk && chunk.length > 0)) {\n if (\n typeof chunk !== \"string\" &&\n !state.objectMode &&\n Object.getPrototypeOf(chunk) !== Buffer.prototype\n ) {\n chunk = _uint8ArrayToBuffer(chunk);\n }\n\n if (addToFront) {\n if (state.endEmitted)\n stream.emit(\n \"error\",\n new Error(\"stream.unshift() after end event\")\n );\n else addChunk(stream, state, chunk, true);\n } else if (state.ended) {\n stream.emit(\"error\", new Error(\"stream.push() after EOF\"));\n } else {\n state.reading = false;\n if (state.decoder && !encoding) {\n chunk = state.decoder.write(chunk);\n if (state.objectMode || chunk.length !== 0)\n addChunk(stream, state, chunk, false);\n else maybeReadMore(stream, state);\n } else {\n addChunk(stream, state, chunk, false);\n }\n }\n } else if (!addToFront) {\n state.reading = false;\n }\n }\n\n return needMoreData(state);\n }\n\n function addChunk(stream, state, chunk, addToFront) {\n if (state.flowing && state.length === 0 && !state.sync) {\n stream.emit(\"data\", chunk);\n stream.read(0);\n } else {\n // update the buffer info.\n state.length += state.objectMode ? 1 : chunk.length;\n if (addToFront) state.buffer.unshift(chunk);\n else state.buffer.push(chunk);\n\n if (state.needReadable) emitReadable(stream);\n }\n maybeReadMore(stream, state);\n }\n\n function chunkInvalid(state, chunk) {\n var er;\n if (\n !_isUint8Array(chunk) &&\n typeof chunk !== \"string\" &&\n chunk !== undefined &&\n !state.objectMode\n ) {\n er = new TypeError(\"Invalid non-string/buffer chunk\");\n }\n return er;\n }\n\n // if it's past the high water mark, we can push in some more.\n // Also, if we have no data yet, we can stand some\n // more bytes. This is to work around cases where hwm=0,\n // such as the repl. Also, if the push() triggered a\n // readable event, and the user called read(largeNumber) such that\n // needReadable was set, then we ought to push more, so that another\n // 'readable' event will be triggered.\n function needMoreData(state) {\n return (\n !state.ended &&\n (state.needReadable ||\n state.length < state.highWaterMark ||\n state.length === 0)\n );\n }\n\n Readable.prototype.isPaused = function() {\n return this._readableState.flowing === false;\n };\n\n // backwards compatibility.\n Readable.prototype.setEncoding = function(enc) {\n if (!StringDecoder)\n StringDecoder = require(\"string_decoder/\").StringDecoder;\n this._readableState.decoder = new StringDecoder(enc);\n this._readableState.encoding = enc;\n return this;\n };\n\n // Don't raise the hwm > 8MB\n var MAX_HWM = 0x800000;\n function computeNewHighWaterMark(n) {\n if (n >= MAX_HWM) {\n n = MAX_HWM;\n } else {\n // Get the next highest power of 2 to prevent increasing hwm excessively in\n // tiny amounts\n n--;\n n |= n >>> 1;\n n |= n >>> 2;\n n |= n >>> 4;\n n |= n >>> 8;\n n |= n >>> 16;\n n++;\n }\n return n;\n }\n\n // This function is designed to be inlinable, so please take care when making\n // changes to the function body.\n function howMuchToRead(n, state) {\n if (n <= 0 || (state.length === 0 && state.ended)) return 0;\n if (state.objectMode) return 1;\n if (n !== n) {\n // Only flow one buffer at a time\n if (state.flowing && state.length)\n return state.buffer.head.data.length;\n else return state.length;\n }\n // If we're asking for more than the current hwm, then raise the hwm.\n if (n > state.highWaterMark)\n state.highWaterMark = computeNewHighWaterMark(n);\n if (n <= state.length) return n;\n // Don't have enough\n if (!state.ended) {\n state.needReadable = true;\n return 0;\n }\n return state.length;\n }\n\n // you can override either this method, or the async _read(n) below.\n Readable.prototype.read = function(n) {\n debug(\"read\", n);\n n = parseInt(n, 10);\n var state = this._readableState;\n var nOrig = n;\n\n if (n !== 0) state.emittedReadable = false;\n\n // if we're doing read(0) to trigger a readable event, but we\n // already have a bunch of data in the buffer, then just trigger\n // the 'readable' event and move on.\n if (\n n === 0 &&\n state.needReadable &&\n (state.length >= state.highWaterMark || state.ended)\n ) {\n debug(\"read: emitReadable\", state.length, state.ended);\n if (state.length === 0 && state.ended) endReadable(this);\n else emitReadable(this);\n return null;\n }\n\n n = howMuchToRead(n, state);\n\n // if we've ended, and we're now clear, then finish it up.\n if (n === 0 && state.ended) {\n if (state.length === 0) endReadable(this);\n return null;\n }\n\n // All the actual chunk generation logic needs to be\n // *below* the call to _read. The reason is that in certain\n // synthetic stream cases, such as passthrough streams, _read\n // may be a completely synchronous operation which may change\n // the state of the read buffer, providing enough data when\n // before there was *not* enough.\n //\n // So, the steps are:\n // 1. Figure out what the state of things will be after we do\n // a read from the buffer.\n //\n // 2. If that resulting state will trigger a _read, then call _read.\n // Note that this may be asynchronous, or synchronous. Yes, it is\n // deeply ugly to write APIs this way, but that still doesn't mean\n // that the Readable class should behave improperly, as streams are\n // designed to be sync/async agnostic.\n // Take note if the _read call is sync or async (ie, if the read call\n // has returned yet), so that we know whether or not it's safe to emit\n // 'readable' etc.\n //\n // 3. Actually pull the requested chunks out of the buffer and return.\n\n // if we need a readable event, then we need to do some reading.\n var doRead = state.needReadable;\n debug(\"need readable\", doRead);\n\n // if we currently have less than the highWaterMark, then also read some\n if (state.length === 0 || state.length - n < state.highWaterMark) {\n doRead = true;\n debug(\"length less than watermark\", doRead);\n }\n\n // however, if we've ended, then there's no point, and if we're already\n // reading, then it's unnecessary.\n if (state.ended || state.reading) {\n doRead = false;\n debug(\"reading or ended\", doRead);\n } else if (doRead) {\n debug(\"do read\");\n state.reading = true;\n state.sync = true;\n // if the length is currently zero, then we *need* a readable event.\n if (state.length === 0) state.needReadable = true;\n // call internal read method\n this._read(state.highWaterMark);\n state.sync = false;\n // If _read pushed data synchronously, then `reading` will be false,\n // and we need to re-evaluate how much data we can return to the user.\n if (!state.reading) n = howMuchToRead(nOrig, state);\n }\n\n var ret;\n if (n > 0) ret = fromList(n, state);\n else ret = null;\n\n if (ret === null) {\n state.needReadable = true;\n n = 0;\n } else {\n state.length -= n;\n }\n\n if (state.length === 0) {\n // If we have nothing in the buffer, then we want to know\n // as soon as we *do* get something into the buffer.\n if (!state.ended) state.needReadable = true;\n\n // If we tried to read() past the EOF, then emit end on the next tick.\n if (nOrig !== n && state.ended) endReadable(this);\n }\n\n if (ret !== null) this.emit(\"data\", ret);\n\n return ret;\n };\n\n function onEofChunk(stream, state) {\n if (state.ended) return;\n if (state.decoder) {\n var chunk = state.decoder.end();\n if (chunk && chunk.length) {\n state.buffer.push(chunk);\n state.length += state.objectMode ? 1 : chunk.length;\n }\n }\n state.ended = true;\n\n // emit 'readable' now to make sure it gets picked up.\n emitReadable(stream);\n }\n\n // Don't emit readable right away in sync mode, because this can trigger\n // another read() call => stack overflow. This way, it might trigger\n // a nextTick recursion warning, but that's not so bad.\n function emitReadable(stream) {\n var state = stream._readableState;\n state.needReadable = false;\n if (!state.emittedReadable) {\n debug(\"emitReadable\", state.flowing);\n state.emittedReadable = true;\n if (state.sync) pna.nextTick(emitReadable_, stream);\n else emitReadable_(stream);\n }\n }\n\n function emitReadable_(stream) {\n debug(\"emit readable\");\n stream.emit(\"readable\");\n flow(stream);\n }\n\n // at this point, the user has presumably seen the 'readable' event,\n // and called read() to consume some data. that may have triggered\n // in turn another _read(n) call, in which case reading = true if\n // it's in progress.\n // However, if we're not ended, or reading, and the length < hwm,\n // then go ahead and try to read some more preemptively.\n function maybeReadMore(stream, state) {\n if (!state.readingMore) {\n state.readingMore = true;\n pna.nextTick(maybeReadMore_, stream, state);\n }\n }\n\n function maybeReadMore_(stream, state) {\n var len = state.length;\n while (\n !state.reading &&\n !state.flowing &&\n !state.ended &&\n state.length < state.highWaterMark\n ) {\n debug(\"maybeReadMore read 0\");\n stream.read(0);\n if (len === state.length)\n // didn't get any data, stop spinning.\n break;\n else len = state.length;\n }\n state.readingMore = false;\n }\n\n // abstract method. to be overridden in specific implementation classes.\n // call cb(er, data) where data is <= n in length.\n // for virtual (non-string, non-buffer) streams, \"length\" is somewhat\n // arbitrary, and perhaps not very meaningful.\n Readable.prototype._read = function(n) {\n this.emit(\"error\", new Error(\"_read() is not implemented\"));\n };\n\n Readable.prototype.pipe = function(dest, pipeOpts) {\n var src = this;\n var state = this._readableState;\n\n switch (state.pipesCount) {\n case 0:\n state.pipes = dest;\n break;\n case 1:\n state.pipes = [state.pipes, dest];\n break;\n default:\n state.pipes.push(dest);\n break;\n }\n state.pipesCount += 1;\n debug(\"pipe count=%d opts=%j\", state.pipesCount, pipeOpts);\n\n var doEnd =\n (!pipeOpts || pipeOpts.end !== false) &&\n dest !== process.stdout &&\n dest !== process.stderr;\n\n var endFn = doEnd ? onend : unpipe;\n if (state.endEmitted) pna.nextTick(endFn);\n else src.once(\"end\", endFn);\n\n dest.on(\"unpipe\", onunpipe);\n function onunpipe(readable, unpipeInfo) {\n debug(\"onunpipe\");\n if (readable === src) {\n if (unpipeInfo && unpipeInfo.hasUnpiped === false) {\n unpipeInfo.hasUnpiped = true;\n cleanup();\n }\n }\n }\n\n function onend() {\n debug(\"onend\");\n dest.end();\n }\n\n // when the dest drains, it reduces the awaitDrain counter\n // on the source. This would be more elegant with a .once()\n // handler in flow(), but adding and removing repeatedly is\n // too slow.\n var ondrain = pipeOnDrain(src);\n dest.on(\"drain\", ondrain);\n\n var cleanedUp = false;\n function cleanup() {\n debug(\"cleanup\");\n // cleanup event handlers once the pipe is broken\n dest.removeListener(\"close\", onclose);\n dest.removeListener(\"finish\", onfinish);\n dest.removeListener(\"drain\", ondrain);\n dest.removeListener(\"error\", onerror);\n dest.removeListener(\"unpipe\", onunpipe);\n src.removeListener(\"end\", onend);\n src.removeListener(\"end\", unpipe);\n src.removeListener(\"data\", ondata);\n\n cleanedUp = true;\n\n // if the reader is waiting for a drain event from this\n // specific writer, then it would cause it to never start\n // flowing again.\n // So, if this is awaiting a drain, then we just call it now.\n // If we don't know, then assume that we are waiting for one.\n if (\n state.awaitDrain &&\n (!dest._writableState || dest._writableState.needDrain)\n )\n ondrain();\n }\n\n // If the user pushes more data while we're writing to dest then we'll end up\n // in ondata again. However, we only want to increase awaitDrain once because\n // dest will only emit one 'drain' event for the multiple writes.\n // => Introduce a guard on increasing awaitDrain.\n var increasedAwaitDrain = false;\n src.on(\"data\", ondata);\n function ondata(chunk) {\n debug(\"ondata\");\n increasedAwaitDrain = false;\n var ret = dest.write(chunk);\n if (false === ret && !increasedAwaitDrain) {\n // If the user unpiped during `dest.write()`, it is possible\n // to get stuck in a permanently paused state if that write\n // also returned false.\n // => Check whether `dest` is still a piping destination.\n if (\n ((state.pipesCount === 1 && state.pipes === dest) ||\n (state.pipesCount > 1 &&\n indexOf(state.pipes, dest) !== -1)) &&\n !cleanedUp\n ) {\n debug(\n \"false write response, pause\",\n src._readableState.awaitDrain\n );\n src._readableState.awaitDrain++;\n increasedAwaitDrain = true;\n }\n src.pause();\n }\n }\n\n // if the dest has an error, then stop piping into it.\n // however, don't suppress the throwing behavior for this.\n function onerror(er) {\n debug(\"onerror\", er);\n unpipe();\n dest.removeListener(\"error\", onerror);\n if (EElistenerCount(dest, \"error\") === 0) dest.emit(\"error\", er);\n }\n\n // Make sure our error handler is attached before userland ones.\n prependListener(dest, \"error\", onerror);\n\n // Both close and finish should trigger unpipe, but only once.\n function onclose() {\n dest.removeListener(\"finish\", onfinish);\n unpipe();\n }\n dest.once(\"close\", onclose);\n function onfinish() {\n debug(\"onfinish\");\n dest.removeListener(\"close\", onclose);\n unpipe();\n }\n dest.once(\"finish\", onfinish);\n\n function unpipe() {\n debug(\"unpipe\");\n src.unpipe(dest);\n }\n\n // tell the dest that it's being piped to\n dest.emit(\"pipe\", src);\n\n // start the flow if it hasn't been started already.\n if (!state.flowing) {\n debug(\"pipe resume\");\n src.resume();\n }\n\n return dest;\n };\n\n function pipeOnDrain(src) {\n return function() {\n var state = src._readableState;\n debug(\"pipeOnDrain\", state.awaitDrain);\n if (state.awaitDrain) state.awaitDrain--;\n if (state.awaitDrain === 0 && EElistenerCount(src, \"data\")) {\n state.flowing = true;\n flow(src);\n }\n };\n }\n\n Readable.prototype.unpipe = function(dest) {\n var state = this._readableState;\n var unpipeInfo = { hasUnpiped: false };\n\n // if we're not piping anywhere, then do nothing.\n if (state.pipesCount === 0) return this;\n\n // just one destination. most common case.\n if (state.pipesCount === 1) {\n // passed in one, but it's not the right one.\n if (dest && dest !== state.pipes) return this;\n\n if (!dest) dest = state.pipes;\n\n // got a match.\n state.pipes = null;\n state.pipesCount = 0;\n state.flowing = false;\n if (dest) dest.emit(\"unpipe\", this, unpipeInfo);\n return this;\n }\n\n // slow case. multiple pipe destinations.\n\n if (!dest) {\n // remove all.\n var dests = state.pipes;\n var len = state.pipesCount;\n state.pipes = null;\n state.pipesCount = 0;\n state.flowing = false;\n\n for (var i = 0; i < len; i++) {\n dests[i].emit(\"unpipe\", this, unpipeInfo);\n }\n return this;\n }\n\n // try to find the right one.\n var index = indexOf(state.pipes, dest);\n if (index === -1) return this;\n\n state.pipes.splice(index, 1);\n state.pipesCount -= 1;\n if (state.pipesCount === 1) state.pipes = state.pipes[0];\n\n dest.emit(\"unpipe\", this, unpipeInfo);\n\n return this;\n };\n\n // set up data events if they are asked for\n // Ensure readable listeners eventually get something\n Readable.prototype.on = function(ev, fn) {\n var res = Stream.prototype.on.call(this, ev, fn);\n\n if (ev === \"data\") {\n // Start flowing on next tick if stream isn't explicitly paused\n if (this._readableState.flowing !== false) this.resume();\n } else if (ev === \"readable\") {\n var state = this._readableState;\n if (!state.endEmitted && !state.readableListening) {\n state.readableListening = state.needReadable = true;\n state.emittedReadable = false;\n if (!state.reading) {\n pna.nextTick(nReadingNextTick, this);\n } else if (state.length) {\n emitReadable(this);\n }\n }\n }\n\n return res;\n };\n Readable.prototype.addListener = Readable.prototype.on;\n\n function nReadingNextTick(self) {\n debug(\"readable nexttick read 0\");\n self.read(0);\n }\n\n // pause() and resume() are remnants of the legacy readable stream API\n // If the user uses them, then switch into old mode.\n Readable.prototype.resume = function() {\n var state = this._readableState;\n if (!state.flowing) {\n debug(\"resume\");\n state.flowing = true;\n resume(this, state);\n }\n return this;\n };\n\n function resume(stream, state) {\n if (!state.resumeScheduled) {\n state.resumeScheduled = true;\n pna.nextTick(resume_, stream, state);\n }\n }\n\n function resume_(stream, state) {\n if (!state.reading) {\n debug(\"resume read 0\");\n stream.read(0);\n }\n\n state.resumeScheduled = false;\n state.awaitDrain = 0;\n stream.emit(\"resume\");\n flow(stream);\n if (state.flowing && !state.reading) stream.read(0);\n }\n\n Readable.prototype.pause = function() {\n debug(\"call pause flowing=%j\", this._readableState.flowing);\n if (false !== this._readableState.flowing) {\n debug(\"pause\");\n this._readableState.flowing = false;\n this.emit(\"pause\");\n }\n return this;\n };\n\n function flow(stream) {\n var state = stream._readableState;\n debug(\"flow\", state.flowing);\n while (state.flowing && stream.read() !== null) {}\n }\n\n // wrap an old-style stream as the async data source.\n // This is *not* part of the readable stream interface.\n // It is an ugly unfortunate mess of history.\n Readable.prototype.wrap = function(stream) {\n var _this = this;\n\n var state = this._readableState;\n var paused = false;\n\n stream.on(\"end\", function() {\n debug(\"wrapped end\");\n if (state.decoder && !state.ended) {\n var chunk = state.decoder.end();\n if (chunk && chunk.length) _this.push(chunk);\n }\n\n _this.push(null);\n });\n\n stream.on(\"data\", function(chunk) {\n debug(\"wrapped data\");\n if (state.decoder) chunk = state.decoder.write(chunk);\n\n // don't skip over falsy values in objectMode\n if (state.objectMode && (chunk === null || chunk === undefined))\n return;\n else if (!state.objectMode && (!chunk || !chunk.length)) return;\n\n var ret = _this.push(chunk);\n if (!ret) {\n paused = true;\n stream.pause();\n }\n });\n\n // proxy all the other methods.\n // important when wrapping filters and duplexes.\n for (var i in stream) {\n if (this[i] === undefined && typeof stream[i] === \"function\") {\n this[i] = (function(method) {\n return function() {\n return stream[method].apply(stream, arguments);\n };\n })(i);\n }\n }\n\n // proxy certain important events.\n for (var n = 0; n < kProxyEvents.length; n++) {\n stream.on(kProxyEvents[n], this.emit.bind(this, kProxyEvents[n]));\n }\n\n // when we try to consume some more bytes, simply unpause the\n // underlying stream.\n this._read = function(n) {\n debug(\"wrapped _read\", n);\n if (paused) {\n paused = false;\n stream.resume();\n }\n };\n\n return this;\n };\n\n Object.defineProperty(Readable.prototype, \"readableHighWaterMark\", {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function() {\n return this._readableState.highWaterMark;\n }\n });\n\n // exposed for testing purposes only.\n Readable._fromList = fromList;\n\n // Pluck off n bytes from an array of buffers.\n // Length is the combined lengths of all the buffers in the list.\n // This function is designed to be inlinable, so please take care when making\n // changes to the function body.\n function fromList(n, state) {\n // nothing buffered\n if (state.length === 0) return null;\n\n var ret;\n if (state.objectMode) ret = state.buffer.shift();\n else if (!n || n >= state.length) {\n // read it all, truncate the list\n if (state.decoder) ret = state.buffer.join(\"\");\n else if (state.buffer.length === 1) ret = state.buffer.head.data;\n else ret = state.buffer.concat(state.length);\n state.buffer.clear();\n } else {\n // read part of list\n ret = fromListPartial(n, state.buffer, state.decoder);\n }\n\n return ret;\n }\n\n // Extracts only enough buffered data to satisfy the amount requested.\n // This function is designed to be inlinable, so please take care when making\n // changes to the function body.\n function fromListPartial(n, list, hasStrings) {\n var ret;\n if (n < list.head.data.length) {\n // slice is the same for buffers and strings\n ret = list.head.data.slice(0, n);\n list.head.data = list.head.data.slice(n);\n } else if (n === list.head.data.length) {\n // first chunk is a perfect match\n ret = list.shift();\n } else {\n // result spans more than one buffer\n ret = hasStrings\n ? copyFromBufferString(n, list)\n : copyFromBuffer(n, list);\n }\n return ret;\n }\n\n // Copies a specified amount of characters from the list of buffered data\n // chunks.\n // This function is designed to be inlinable, so please take care when making\n // changes to the function body.\n function copyFromBufferString(n, list) {\n var p = list.head;\n var c = 1;\n var ret = p.data;\n n -= ret.length;\n while ((p = p.next)) {\n var str = p.data;\n var nb = n > str.length ? str.length : n;\n if (nb === str.length) ret += str;\n else ret += str.slice(0, n);\n n -= nb;\n if (n === 0) {\n if (nb === str.length) {\n ++c;\n if (p.next) list.head = p.next;\n else list.head = list.tail = null;\n } else {\n list.head = p;\n p.data = str.slice(nb);\n }\n break;\n }\n ++c;\n }\n list.length -= c;\n return ret;\n }\n\n // Copies a specified amount of bytes from the list of buffered data chunks.\n // This function is designed to be inlinable, so please take care when making\n // changes to the function body.\n function copyFromBuffer(n, list) {\n var ret = Buffer.allocUnsafe(n);\n var p = list.head;\n var c = 1;\n p.data.copy(ret);\n n -= p.data.length;\n while ((p = p.next)) {\n var buf = p.data;\n var nb = n > buf.length ? buf.length : n;\n buf.copy(ret, ret.length - n, 0, nb);\n n -= nb;\n if (n === 0) {\n if (nb === buf.length) {\n ++c;\n if (p.next) list.head = p.next;\n else list.head = list.tail = null;\n } else {\n list.head = p;\n p.data = buf.slice(nb);\n }\n break;\n }\n ++c;\n }\n list.length -= c;\n return ret;\n }\n\n function endReadable(stream) {\n var state = stream._readableState;\n\n // If we get here before consuming all the bytes, then that is a\n // bug in node. Should never happen.\n if (state.length > 0)\n throw new Error('\"endReadable()\" called on non-empty stream');\n\n if (!state.endEmitted) {\n state.ended = true;\n pna.nextTick(endReadableNT, state, stream);\n }\n }\n\n function endReadableNT(state, stream) {\n // Check that we didn't get one last unshift.\n if (!state.endEmitted && state.length === 0) {\n state.endEmitted = true;\n stream.readable = false;\n stream.emit(\"end\");\n }\n }\n\n function indexOf(xs, x) {\n for (var i = 0, l = xs.length; i < l; i++) {\n if (xs[i] === x) return i;\n }\n return -1;\n }\n }.call(\n this,\n require(\"_process\"),\n typeof global !== \"undefined\"\n ? global\n : typeof self !== \"undefined\"\n ? self\n : typeof window !== \"undefined\"\n ? window\n : {}\n ));\n },\n {\n \"./_stream_duplex\": 117,\n \"./internal/streams/BufferList\": 122,\n \"./internal/streams/destroy\": 123,\n \"./internal/streams/stream\": 124,\n _process: 112,\n \"core-util-is\": 101,\n events: 102,\n inherits: 106,\n isarray: 108,\n \"process-nextick-args\": 111,\n \"safe-buffer\": 144,\n \"string_decoder/\": 125,\n util: 2\n }\n ],\n 120: [\n function(require, module, exports) {\n // Copyright Joyent, Inc. and other Node contributors.\n //\n // Permission is hereby granted, free of charge, to any person obtaining a\n // copy of this software and associated documentation files (the\n // \"Software\"), to deal in the Software without restriction, including\n // without limitation the rights to use, copy, modify, merge, publish,\n // distribute, sublicense, and/or sell copies of the Software, and to permit\n // persons to whom the Software is furnished to do so, subject to the\n // following conditions:\n //\n // The above copyright notice and this permission notice shall be included\n // in all copies or substantial portions of the Software.\n //\n // THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n // OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n // MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n // NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n // DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n // OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n // USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n // a transform stream is a readable/writable stream where you do\n // something with the data. Sometimes it's called a \"filter\",\n // but that's not a great name for it, since that implies a thing where\n // some bits pass through, and others are simply ignored. (That would\n // be a valid example of a transform, of course.)\n //\n // While the output is causally related to the input, it's not a\n // necessarily symmetric or synchronous transformation. For example,\n // a zlib stream might take multiple plain-text writes(), and then\n // emit a single compressed chunk some time in the future.\n //\n // Here's how this works:\n //\n // The Transform stream has all the aspects of the readable and writable\n // stream classes. When you write(chunk), that calls _write(chunk,cb)\n // internally, and returns false if there's a lot of pending writes\n // buffered up. When you call read(), that calls _read(n) until\n // there's enough pending readable data buffered up.\n //\n // In a transform stream, the written data is placed in a buffer. When\n // _read(n) is called, it transforms the queued up data, calling the\n // buffered _write cb's as it consumes chunks. If consuming a single\n // written chunk would result in multiple output chunks, then the first\n // outputted bit calls the readcb, and subsequent chunks just go into\n // the read buffer, and will cause it to emit 'readable' if necessary.\n //\n // This way, back-pressure is actually determined by the reading side,\n // since _read has to be called to start processing a new chunk. However,\n // a pathological inflate type of transform can cause excessive buffering\n // here. For example, imagine a stream where every byte of input is\n // interpreted as an integer from 0-255, and then results in that many\n // bytes of output. Writing the 4 bytes {ff,ff,ff,ff} would result in\n // 1kb of data being output. In this case, you could write a very small\n // amount of input, and end up with a very large amount of output. In\n // such a pathological inflating mechanism, there'd be no way to tell\n // the system to stop doing the transform. A single 4MB write could\n // cause the system to run out of memory.\n //\n // However, even in such a pathological case, only a single written chunk\n // would be consumed, and then the rest would wait (un-transformed) until\n // the results of the previous transformed chunk were consumed.\n\n \"use strict\";\n\n module.exports = Transform;\n\n var Duplex = require(\"./_stream_duplex\");\n\n /**/\n var util = require(\"core-util-is\");\n util.inherits = require(\"inherits\");\n /* */\n\n util.inherits(Transform, Duplex);\n\n function afterTransform(er, data) {\n var ts = this._transformState;\n ts.transforming = false;\n\n var cb = ts.writecb;\n\n if (!cb) {\n return this.emit(\n \"error\",\n new Error(\"write callback called multiple times\")\n );\n }\n\n ts.writechunk = null;\n ts.writecb = null;\n\n if (data != null)\n // single equals check for both `null` and `undefined`\n this.push(data);\n\n cb(er);\n\n var rs = this._readableState;\n rs.reading = false;\n if (rs.needReadable || rs.length < rs.highWaterMark) {\n this._read(rs.highWaterMark);\n }\n }\n\n function Transform(options) {\n if (!(this instanceof Transform)) return new Transform(options);\n\n Duplex.call(this, options);\n\n this._transformState = {\n afterTransform: afterTransform.bind(this),\n needTransform: false,\n transforming: false,\n writecb: null,\n writechunk: null,\n writeencoding: null\n };\n\n // start out asking for a readable event once data is transformed.\n this._readableState.needReadable = true;\n\n // we have implemented the _read method, and done the other things\n // that Readable wants before the first _read call, so unset the\n // sync guard flag.\n this._readableState.sync = false;\n\n if (options) {\n if (typeof options.transform === \"function\")\n this._transform = options.transform;\n\n if (typeof options.flush === \"function\")\n this._flush = options.flush;\n }\n\n // When the writable side finishes, then flush out anything remaining.\n this.on(\"prefinish\", prefinish);\n }\n\n function prefinish() {\n var _this = this;\n\n if (typeof this._flush === \"function\") {\n this._flush(function(er, data) {\n done(_this, er, data);\n });\n } else {\n done(this, null, null);\n }\n }\n\n Transform.prototype.push = function(chunk, encoding) {\n this._transformState.needTransform = false;\n return Duplex.prototype.push.call(this, chunk, encoding);\n };\n\n // This is the part where you do stuff!\n // override this function in implementation classes.\n // 'chunk' is an input chunk.\n //\n // Call `push(newChunk)` to pass along transformed output\n // to the readable side. You may call 'push' zero or more times.\n //\n // Call `cb(err)` when you are done with this chunk. If you pass\n // an error, then that'll put the hurt on the whole operation. If you\n // never call cb(), then you'll never get another chunk.\n Transform.prototype._transform = function(chunk, encoding, cb) {\n throw new Error(\"_transform() is not implemented\");\n };\n\n Transform.prototype._write = function(chunk, encoding, cb) {\n var ts = this._transformState;\n ts.writecb = cb;\n ts.writechunk = chunk;\n ts.writeencoding = encoding;\n if (!ts.transforming) {\n var rs = this._readableState;\n if (\n ts.needTransform ||\n rs.needReadable ||\n rs.length < rs.highWaterMark\n )\n this._read(rs.highWaterMark);\n }\n };\n\n // Doesn't matter what the args are here.\n // _transform does all the work.\n // That we got here means that the readable side wants more data.\n Transform.prototype._read = function(n) {\n var ts = this._transformState;\n\n if (ts.writechunk !== null && ts.writecb && !ts.transforming) {\n ts.transforming = true;\n this._transform(ts.writechunk, ts.writeencoding, ts.afterTransform);\n } else {\n // mark that we need a transform, so that any data that comes in\n // will get processed, now that we've asked for it.\n ts.needTransform = true;\n }\n };\n\n Transform.prototype._destroy = function(err, cb) {\n var _this2 = this;\n\n Duplex.prototype._destroy.call(this, err, function(err2) {\n cb(err2);\n _this2.emit(\"close\");\n });\n };\n\n function done(stream, er, data) {\n if (er) return stream.emit(\"error\", er);\n\n if (data != null)\n // single equals check for both `null` and `undefined`\n stream.push(data);\n\n // if there's nothing in the write buffer, then that means\n // that nothing more will ever be provided\n if (stream._writableState.length)\n throw new Error(\"Calling transform done when ws.length != 0\");\n\n if (stream._transformState.transforming)\n throw new Error(\"Calling transform done when still transforming\");\n\n return stream.push(null);\n }\n },\n { \"./_stream_duplex\": 117, \"core-util-is\": 101, inherits: 106 }\n ],\n 121: [\n function(require, module, exports) {\n (function(process, global, setImmediate) {\n // Copyright Joyent, Inc. and other Node contributors.\n //\n // Permission is hereby granted, free of charge, to any person obtaining a\n // copy of this software and associated documentation files (the\n // \"Software\"), to deal in the Software without restriction, including\n // without limitation the rights to use, copy, modify, merge, publish,\n // distribute, sublicense, and/or sell copies of the Software, and to permit\n // persons to whom the Software is furnished to do so, subject to the\n // following conditions:\n //\n // The above copyright notice and this permission notice shall be included\n // in all copies or substantial portions of the Software.\n //\n // THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n // OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n // MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n // NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n // DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n // OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n // USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n // A bit simpler than readable streams.\n // Implement an async ._write(chunk, encoding, cb), and it'll handle all\n // the drain event emission and buffering.\n\n \"use strict\";\n\n /**/\n\n var pna = require(\"process-nextick-args\");\n /* */\n\n module.exports = Writable;\n\n /* */\n function WriteReq(chunk, encoding, cb) {\n this.chunk = chunk;\n this.encoding = encoding;\n this.callback = cb;\n this.next = null;\n }\n\n // It seems a linked list but it is not\n // there will be only 2 of these for each stream\n function CorkedRequest(state) {\n var _this = this;\n\n this.next = null;\n this.entry = null;\n this.finish = function() {\n onCorkedFinish(_this, state);\n };\n }\n /* */\n\n /**/\n var asyncWrite =\n !process.browser &&\n [\"v0.10\", \"v0.9.\"].indexOf(process.version.slice(0, 5)) > -1\n ? setImmediate\n : pna.nextTick;\n /* */\n\n /**/\n var Duplex;\n /* */\n\n Writable.WritableState = WritableState;\n\n /**/\n var util = require(\"core-util-is\");\n util.inherits = require(\"inherits\");\n /* */\n\n /**/\n var internalUtil = {\n deprecate: require(\"util-deprecate\")\n };\n /* */\n\n /**/\n var Stream = require(\"./internal/streams/stream\");\n /* */\n\n /**/\n\n var Buffer = require(\"safe-buffer\").Buffer;\n var OurUint8Array = global.Uint8Array || function() {};\n function _uint8ArrayToBuffer(chunk) {\n return Buffer.from(chunk);\n }\n function _isUint8Array(obj) {\n return Buffer.isBuffer(obj) || obj instanceof OurUint8Array;\n }\n\n /* */\n\n var destroyImpl = require(\"./internal/streams/destroy\");\n\n util.inherits(Writable, Stream);\n\n function nop() {}\n\n function WritableState(options, stream) {\n Duplex = Duplex || require(\"./_stream_duplex\");\n\n options = options || {};\n\n // Duplex streams are both readable and writable, but share\n // the same options object.\n // However, some cases require setting options to different\n // values for the readable and the writable sides of the duplex stream.\n // These options can be provided separately as readableXXX and writableXXX.\n var isDuplex = stream instanceof Duplex;\n\n // object stream flag to indicate whether or not this stream\n // contains buffers or objects.\n this.objectMode = !!options.objectMode;\n\n if (isDuplex)\n this.objectMode = this.objectMode || !!options.writableObjectMode;\n\n // the point at which write() starts returning false\n // Note: 0 is a valid value, means that we always return false if\n // the entire buffer is not flushed immediately on write()\n var hwm = options.highWaterMark;\n var writableHwm = options.writableHighWaterMark;\n var defaultHwm = this.objectMode ? 16 : 16 * 1024;\n\n if (hwm || hwm === 0) this.highWaterMark = hwm;\n else if (isDuplex && (writableHwm || writableHwm === 0))\n this.highWaterMark = writableHwm;\n else this.highWaterMark = defaultHwm;\n\n // cast to ints.\n this.highWaterMark = Math.floor(this.highWaterMark);\n\n // if _final has been called\n this.finalCalled = false;\n\n // drain event flag.\n this.needDrain = false;\n // at the start of calling end()\n this.ending = false;\n // when end() has been called, and returned\n this.ended = false;\n // when 'finish' is emitted\n this.finished = false;\n\n // has it been destroyed\n this.destroyed = false;\n\n // should we decode strings into buffers before passing to _write?\n // this is here so that some node-core streams can optimize string\n // handling at a lower level.\n var noDecode = options.decodeStrings === false;\n this.decodeStrings = !noDecode;\n\n // Crypto is kind of old and crusty. Historically, its default string\n // encoding is 'binary' so we have to make this configurable.\n // Everything else in the universe uses 'utf8', though.\n this.defaultEncoding = options.defaultEncoding || \"utf8\";\n\n // not an actual buffer we keep track of, but a measurement\n // of how much we're waiting to get pushed to some underlying\n // socket or file.\n this.length = 0;\n\n // a flag to see when we're in the middle of a write.\n this.writing = false;\n\n // when true all writes will be buffered until .uncork() call\n this.corked = 0;\n\n // a flag to be able to tell if the onwrite cb is called immediately,\n // or on a later tick. We set this to true at first, because any\n // actions that shouldn't happen until \"later\" should generally also\n // not happen before the first write call.\n this.sync = true;\n\n // a flag to know if we're processing previously buffered items, which\n // may call the _write() callback in the same tick, so that we don't\n // end up in an overlapped onwrite situation.\n this.bufferProcessing = false;\n\n // the callback that's passed to _write(chunk,cb)\n this.onwrite = function(er) {\n onwrite(stream, er);\n };\n\n // the callback that the user supplies to write(chunk,encoding,cb)\n this.writecb = null;\n\n // the amount that is being written when _write is called.\n this.writelen = 0;\n\n this.bufferedRequest = null;\n this.lastBufferedRequest = null;\n\n // number of pending user-supplied write callbacks\n // this must be 0 before 'finish' can be emitted\n this.pendingcb = 0;\n\n // emit prefinish if the only thing we're waiting for is _write cbs\n // This is relevant for synchronous Transform streams\n this.prefinished = false;\n\n // True if the error was already emitted and should not be thrown again\n this.errorEmitted = false;\n\n // count buffered requests\n this.bufferedRequestCount = 0;\n\n // allocate the first CorkedRequest, there is always\n // one allocated and free to use, and we maintain at most two\n this.corkedRequestsFree = new CorkedRequest(this);\n }\n\n WritableState.prototype.getBuffer = function getBuffer() {\n var current = this.bufferedRequest;\n var out = [];\n while (current) {\n out.push(current);\n current = current.next;\n }\n return out;\n };\n\n (function() {\n try {\n Object.defineProperty(WritableState.prototype, \"buffer\", {\n get: internalUtil.deprecate(\n function() {\n return this.getBuffer();\n },\n \"_writableState.buffer is deprecated. Use _writableState.getBuffer \" +\n \"instead.\",\n \"DEP0003\"\n )\n });\n } catch (_) {}\n })();\n\n // Test _writableState for inheritance to account for Duplex streams,\n // whose prototype chain only points to Readable.\n var realHasInstance;\n if (\n typeof Symbol === \"function\" &&\n Symbol.hasInstance &&\n typeof Function.prototype[Symbol.hasInstance] === \"function\"\n ) {\n realHasInstance = Function.prototype[Symbol.hasInstance];\n Object.defineProperty(Writable, Symbol.hasInstance, {\n value: function(object) {\n if (realHasInstance.call(this, object)) return true;\n if (this !== Writable) return false;\n\n return object && object._writableState instanceof WritableState;\n }\n });\n } else {\n realHasInstance = function(object) {\n return object instanceof this;\n };\n }\n\n function Writable(options) {\n Duplex = Duplex || require(\"./_stream_duplex\");\n\n // Writable ctor is applied to Duplexes, too.\n // `realHasInstance` is necessary because using plain `instanceof`\n // would return false, as no `_writableState` property is attached.\n\n // Trying to use the custom `instanceof` for Writable here will also break the\n // Node.js LazyTransform implementation, which has a non-trivial getter for\n // `_writableState` that would lead to infinite recursion.\n if (\n !realHasInstance.call(Writable, this) &&\n !(this instanceof Duplex)\n ) {\n return new Writable(options);\n }\n\n this._writableState = new WritableState(options, this);\n\n // legacy.\n this.writable = true;\n\n if (options) {\n if (typeof options.write === \"function\")\n this._write = options.write;\n\n if (typeof options.writev === \"function\")\n this._writev = options.writev;\n\n if (typeof options.destroy === \"function\")\n this._destroy = options.destroy;\n\n if (typeof options.final === \"function\")\n this._final = options.final;\n }\n\n Stream.call(this);\n }\n\n // Otherwise people can pipe Writable streams, which is just wrong.\n Writable.prototype.pipe = function() {\n this.emit(\"error\", new Error(\"Cannot pipe, not readable\"));\n };\n\n function writeAfterEnd(stream, cb) {\n var er = new Error(\"write after end\");\n // TODO: defer error events consistently everywhere, not just the cb\n stream.emit(\"error\", er);\n pna.nextTick(cb, er);\n }\n\n // Checks that a user-supplied chunk is valid, especially for the particular\n // mode the stream is in. Currently this means that `null` is never accepted\n // and undefined/non-string values are only allowed in object mode.\n function validChunk(stream, state, chunk, cb) {\n var valid = true;\n var er = false;\n\n if (chunk === null) {\n er = new TypeError(\"May not write null values to stream\");\n } else if (\n typeof chunk !== \"string\" &&\n chunk !== undefined &&\n !state.objectMode\n ) {\n er = new TypeError(\"Invalid non-string/buffer chunk\");\n }\n if (er) {\n stream.emit(\"error\", er);\n pna.nextTick(cb, er);\n valid = false;\n }\n return valid;\n }\n\n Writable.prototype.write = function(chunk, encoding, cb) {\n var state = this._writableState;\n var ret = false;\n var isBuf = !state.objectMode && _isUint8Array(chunk);\n\n if (isBuf && !Buffer.isBuffer(chunk)) {\n chunk = _uint8ArrayToBuffer(chunk);\n }\n\n if (typeof encoding === \"function\") {\n cb = encoding;\n encoding = null;\n }\n\n if (isBuf) encoding = \"buffer\";\n else if (!encoding) encoding = state.defaultEncoding;\n\n if (typeof cb !== \"function\") cb = nop;\n\n if (state.ended) writeAfterEnd(this, cb);\n else if (isBuf || validChunk(this, state, chunk, cb)) {\n state.pendingcb++;\n ret = writeOrBuffer(this, state, isBuf, chunk, encoding, cb);\n }\n\n return ret;\n };\n\n Writable.prototype.cork = function() {\n var state = this._writableState;\n\n state.corked++;\n };\n\n Writable.prototype.uncork = function() {\n var state = this._writableState;\n\n if (state.corked) {\n state.corked--;\n\n if (\n !state.writing &&\n !state.corked &&\n !state.finished &&\n !state.bufferProcessing &&\n state.bufferedRequest\n )\n clearBuffer(this, state);\n }\n };\n\n Writable.prototype.setDefaultEncoding = function setDefaultEncoding(\n encoding\n ) {\n // node::ParseEncoding() requires lower case.\n if (typeof encoding === \"string\") encoding = encoding.toLowerCase();\n if (\n !(\n [\n \"hex\",\n \"utf8\",\n \"utf-8\",\n \"ascii\",\n \"binary\",\n \"base64\",\n \"ucs2\",\n \"ucs-2\",\n \"utf16le\",\n \"utf-16le\",\n \"raw\"\n ].indexOf((encoding + \"\").toLowerCase()) > -1\n )\n )\n throw new TypeError(\"Unknown encoding: \" + encoding);\n this._writableState.defaultEncoding = encoding;\n return this;\n };\n\n function decodeChunk(state, chunk, encoding) {\n if (\n !state.objectMode &&\n state.decodeStrings !== false &&\n typeof chunk === \"string\"\n ) {\n chunk = Buffer.from(chunk, encoding);\n }\n return chunk;\n }\n\n Object.defineProperty(Writable.prototype, \"writableHighWaterMark\", {\n // making it explicit this property is not enumerable\n // because otherwise some prototype manipulation in\n // userland will fail\n enumerable: false,\n get: function() {\n return this._writableState.highWaterMark;\n }\n });\n\n // if we're already writing something, then just put this\n // in the queue, and wait our turn. Otherwise, call _write\n // If we return false, then we need a drain event, so set that flag.\n function writeOrBuffer(stream, state, isBuf, chunk, encoding, cb) {\n if (!isBuf) {\n var newChunk = decodeChunk(state, chunk, encoding);\n if (chunk !== newChunk) {\n isBuf = true;\n encoding = \"buffer\";\n chunk = newChunk;\n }\n }\n var len = state.objectMode ? 1 : chunk.length;\n\n state.length += len;\n\n var ret = state.length < state.highWaterMark;\n // we must ensure that previous needDrain will not be reset to false.\n if (!ret) state.needDrain = true;\n\n if (state.writing || state.corked) {\n var last = state.lastBufferedRequest;\n state.lastBufferedRequest = {\n chunk: chunk,\n encoding: encoding,\n isBuf: isBuf,\n callback: cb,\n next: null\n };\n if (last) {\n last.next = state.lastBufferedRequest;\n } else {\n state.bufferedRequest = state.lastBufferedRequest;\n }\n state.bufferedRequestCount += 1;\n } else {\n doWrite(stream, state, false, len, chunk, encoding, cb);\n }\n\n return ret;\n }\n\n function doWrite(stream, state, writev, len, chunk, encoding, cb) {\n state.writelen = len;\n state.writecb = cb;\n state.writing = true;\n state.sync = true;\n if (writev) stream._writev(chunk, state.onwrite);\n else stream._write(chunk, encoding, state.onwrite);\n state.sync = false;\n }\n\n function onwriteError(stream, state, sync, er, cb) {\n --state.pendingcb;\n\n if (sync) {\n // defer the callback if we are being called synchronously\n // to avoid piling up things on the stack\n pna.nextTick(cb, er);\n // this can emit finish, and it will always happen\n // after error\n pna.nextTick(finishMaybe, stream, state);\n stream._writableState.errorEmitted = true;\n stream.emit(\"error\", er);\n } else {\n // the caller expect this to happen before if\n // it is async\n cb(er);\n stream._writableState.errorEmitted = true;\n stream.emit(\"error\", er);\n // this can emit finish, but finish must\n // always follow error\n finishMaybe(stream, state);\n }\n }\n\n function onwriteStateUpdate(state) {\n state.writing = false;\n state.writecb = null;\n state.length -= state.writelen;\n state.writelen = 0;\n }\n\n function onwrite(stream, er) {\n var state = stream._writableState;\n var sync = state.sync;\n var cb = state.writecb;\n\n onwriteStateUpdate(state);\n\n if (er) onwriteError(stream, state, sync, er, cb);\n else {\n // Check if we're actually ready to finish, but don't emit yet\n var finished = needFinish(state);\n\n if (\n !finished &&\n !state.corked &&\n !state.bufferProcessing &&\n state.bufferedRequest\n ) {\n clearBuffer(stream, state);\n }\n\n if (sync) {\n /**/\n asyncWrite(afterWrite, stream, state, finished, cb);\n /* */\n } else {\n afterWrite(stream, state, finished, cb);\n }\n }\n }\n\n function afterWrite(stream, state, finished, cb) {\n if (!finished) onwriteDrain(stream, state);\n state.pendingcb--;\n cb();\n finishMaybe(stream, state);\n }\n\n // Must force callback to be called on nextTick, so that we don't\n // emit 'drain' before the write() consumer gets the 'false' return\n // value, and has a chance to attach a 'drain' listener.\n function onwriteDrain(stream, state) {\n if (state.length === 0 && state.needDrain) {\n state.needDrain = false;\n stream.emit(\"drain\");\n }\n }\n\n // if there's something in the buffer waiting, then process it\n function clearBuffer(stream, state) {\n state.bufferProcessing = true;\n var entry = state.bufferedRequest;\n\n if (stream._writev && entry && entry.next) {\n // Fast case, write everything using _writev()\n var l = state.bufferedRequestCount;\n var buffer = new Array(l);\n var holder = state.corkedRequestsFree;\n holder.entry = entry;\n\n var count = 0;\n var allBuffers = true;\n while (entry) {\n buffer[count] = entry;\n if (!entry.isBuf) allBuffers = false;\n entry = entry.next;\n count += 1;\n }\n buffer.allBuffers = allBuffers;\n\n doWrite(\n stream,\n state,\n true,\n state.length,\n buffer,\n \"\",\n holder.finish\n );\n\n // doWrite is almost always async, defer these to save a bit of time\n // as the hot path ends with doWrite\n state.pendingcb++;\n state.lastBufferedRequest = null;\n if (holder.next) {\n state.corkedRequestsFree = holder.next;\n holder.next = null;\n } else {\n state.corkedRequestsFree = new CorkedRequest(state);\n }\n state.bufferedRequestCount = 0;\n } else {\n // Slow case, write chunks one-by-one\n while (entry) {\n var chunk = entry.chunk;\n var encoding = entry.encoding;\n var cb = entry.callback;\n var len = state.objectMode ? 1 : chunk.length;\n\n doWrite(stream, state, false, len, chunk, encoding, cb);\n entry = entry.next;\n state.bufferedRequestCount--;\n // if we didn't call the onwrite immediately, then\n // it means that we need to wait until it does.\n // also, that means that the chunk and cb are currently\n // being processed, so move the buffer counter past them.\n if (state.writing) {\n break;\n }\n }\n\n if (entry === null) state.lastBufferedRequest = null;\n }\n\n state.bufferedRequest = entry;\n state.bufferProcessing = false;\n }\n\n Writable.prototype._write = function(chunk, encoding, cb) {\n cb(new Error(\"_write() is not implemented\"));\n };\n\n Writable.prototype._writev = null;\n\n Writable.prototype.end = function(chunk, encoding, cb) {\n var state = this._writableState;\n\n if (typeof chunk === \"function\") {\n cb = chunk;\n chunk = null;\n encoding = null;\n } else if (typeof encoding === \"function\") {\n cb = encoding;\n encoding = null;\n }\n\n if (chunk !== null && chunk !== undefined)\n this.write(chunk, encoding);\n\n // .end() fully uncorks\n if (state.corked) {\n state.corked = 1;\n this.uncork();\n }\n\n // ignore unnecessary end() calls.\n if (!state.ending && !state.finished) endWritable(this, state, cb);\n };\n\n function needFinish(state) {\n return (\n state.ending &&\n state.length === 0 &&\n state.bufferedRequest === null &&\n !state.finished &&\n !state.writing\n );\n }\n function callFinal(stream, state) {\n stream._final(function(err) {\n state.pendingcb--;\n if (err) {\n stream.emit(\"error\", err);\n }\n state.prefinished = true;\n stream.emit(\"prefinish\");\n finishMaybe(stream, state);\n });\n }\n function prefinish(stream, state) {\n if (!state.prefinished && !state.finalCalled) {\n if (typeof stream._final === \"function\") {\n state.pendingcb++;\n state.finalCalled = true;\n pna.nextTick(callFinal, stream, state);\n } else {\n state.prefinished = true;\n stream.emit(\"prefinish\");\n }\n }\n }\n\n function finishMaybe(stream, state) {\n var need = needFinish(state);\n if (need) {\n prefinish(stream, state);\n if (state.pendingcb === 0) {\n state.finished = true;\n stream.emit(\"finish\");\n }\n }\n return need;\n }\n\n function endWritable(stream, state, cb) {\n state.ending = true;\n finishMaybe(stream, state);\n if (cb) {\n if (state.finished) pna.nextTick(cb);\n else stream.once(\"finish\", cb);\n }\n state.ended = true;\n stream.writable = false;\n }\n\n function onCorkedFinish(corkReq, state, err) {\n var entry = corkReq.entry;\n corkReq.entry = null;\n while (entry) {\n var cb = entry.callback;\n state.pendingcb--;\n cb(err);\n entry = entry.next;\n }\n if (state.corkedRequestsFree) {\n state.corkedRequestsFree.next = corkReq;\n } else {\n state.corkedRequestsFree = corkReq;\n }\n }\n\n Object.defineProperty(Writable.prototype, \"destroyed\", {\n get: function() {\n if (this._writableState === undefined) {\n return false;\n }\n return this._writableState.destroyed;\n },\n set: function(value) {\n // we ignore the value if the stream\n // has not been initialized yet\n if (!this._writableState) {\n return;\n }\n\n // backward compatibility, the user is explicitly\n // managing destroyed\n this._writableState.destroyed = value;\n }\n });\n\n Writable.prototype.destroy = destroyImpl.destroy;\n Writable.prototype._undestroy = destroyImpl.undestroy;\n Writable.prototype._destroy = function(err, cb) {\n this.end();\n cb(err);\n };\n }.call(\n this,\n require(\"_process\"),\n typeof global !== \"undefined\"\n ? global\n : typeof self !== \"undefined\"\n ? self\n : typeof window !== \"undefined\"\n ? window\n : {},\n require(\"timers\").setImmediate\n ));\n },\n {\n \"./_stream_duplex\": 117,\n \"./internal/streams/destroy\": 123,\n \"./internal/streams/stream\": 124,\n _process: 112,\n \"core-util-is\": 101,\n inherits: 106,\n \"process-nextick-args\": 111,\n \"safe-buffer\": 144,\n timers: 160,\n \"util-deprecate\": 164\n }\n ],\n 122: [\n function(require, module, exports) {\n \"use strict\";\n\n function _classCallCheck(instance, Constructor) {\n if (!(instance instanceof Constructor)) {\n throw new TypeError(\"Cannot call a class as a function\");\n }\n }\n\n var Buffer = require(\"safe-buffer\").Buffer;\n var util = require(\"util\");\n\n function copyBuffer(src, target, offset) {\n src.copy(target, offset);\n }\n\n module.exports = (function() {\n function BufferList() {\n _classCallCheck(this, BufferList);\n\n this.head = null;\n this.tail = null;\n this.length = 0;\n }\n\n BufferList.prototype.push = function push(v) {\n var entry = { data: v, next: null };\n if (this.length > 0) this.tail.next = entry;\n else this.head = entry;\n this.tail = entry;\n ++this.length;\n };\n\n BufferList.prototype.unshift = function unshift(v) {\n var entry = { data: v, next: this.head };\n if (this.length === 0) this.tail = entry;\n this.head = entry;\n ++this.length;\n };\n\n BufferList.prototype.shift = function shift() {\n if (this.length === 0) return;\n var ret = this.head.data;\n if (this.length === 1) this.head = this.tail = null;\n else this.head = this.head.next;\n --this.length;\n return ret;\n };\n\n BufferList.prototype.clear = function clear() {\n this.head = this.tail = null;\n this.length = 0;\n };\n\n BufferList.prototype.join = function join(s) {\n if (this.length === 0) return \"\";\n var p = this.head;\n var ret = \"\" + p.data;\n while ((p = p.next)) {\n ret += s + p.data;\n }\n return ret;\n };\n\n BufferList.prototype.concat = function concat(n) {\n if (this.length === 0) return Buffer.alloc(0);\n if (this.length === 1) return this.head.data;\n var ret = Buffer.allocUnsafe(n >>> 0);\n var p = this.head;\n var i = 0;\n while (p) {\n copyBuffer(p.data, ret, i);\n i += p.data.length;\n p = p.next;\n }\n return ret;\n };\n\n return BufferList;\n })();\n\n if (util && util.inspect && util.inspect.custom) {\n module.exports.prototype[util.inspect.custom] = function() {\n var obj = util.inspect({ length: this.length });\n return this.constructor.name + \" \" + obj;\n };\n }\n },\n { \"safe-buffer\": 144, util: 2 }\n ],\n 123: [\n function(require, module, exports) {\n \"use strict\";\n\n /**/\n\n var pna = require(\"process-nextick-args\");\n /* */\n\n // undocumented cb() API, needed for core, not for public API\n function destroy(err, cb) {\n var _this = this;\n\n var readableDestroyed =\n this._readableState && this._readableState.destroyed;\n var writableDestroyed =\n this._writableState && this._writableState.destroyed;\n\n if (readableDestroyed || writableDestroyed) {\n if (cb) {\n cb(err);\n } else if (\n err &&\n (!this._writableState || !this._writableState.errorEmitted)\n ) {\n pna.nextTick(emitErrorNT, this, err);\n }\n return this;\n }\n\n // we set destroyed to true before firing error callbacks in order\n // to make it re-entrance safe in case destroy() is called within callbacks\n\n if (this._readableState) {\n this._readableState.destroyed = true;\n }\n\n // if this is a duplex stream mark the writable part as destroyed as well\n if (this._writableState) {\n this._writableState.destroyed = true;\n }\n\n this._destroy(err || null, function(err) {\n if (!cb && err) {\n pna.nextTick(emitErrorNT, _this, err);\n if (_this._writableState) {\n _this._writableState.errorEmitted = true;\n }\n } else if (cb) {\n cb(err);\n }\n });\n\n return this;\n }\n\n function undestroy() {\n if (this._readableState) {\n this._readableState.destroyed = false;\n this._readableState.reading = false;\n this._readableState.ended = false;\n this._readableState.endEmitted = false;\n }\n\n if (this._writableState) {\n this._writableState.destroyed = false;\n this._writableState.ended = false;\n this._writableState.ending = false;\n this._writableState.finished = false;\n this._writableState.errorEmitted = false;\n }\n }\n\n function emitErrorNT(self, err) {\n self.emit(\"error\", err);\n }\n\n module.exports = {\n destroy: destroy,\n undestroy: undestroy\n };\n },\n { \"process-nextick-args\": 111 }\n ],\n 124: [\n function(require, module, exports) {\n module.exports = require(\"events\").EventEmitter;\n },\n { events: 102 }\n ],\n 125: [\n function(require, module, exports) {\n // Copyright Joyent, Inc. and other Node contributors.\n //\n // Permission is hereby granted, free of charge, to any person obtaining a\n // copy of this software and associated documentation files (the\n // \"Software\"), to deal in the Software without restriction, including\n // without limitation the rights to use, copy, modify, merge, publish,\n // distribute, sublicense, and/or sell copies of the Software, and to permit\n // persons to whom the Software is furnished to do so, subject to the\n // following conditions:\n //\n // The above copyright notice and this permission notice shall be included\n // in all copies or substantial portions of the Software.\n //\n // THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n // OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n // MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n // NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n // DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n // OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n // USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n \"use strict\";\n\n /**/\n\n var Buffer = require(\"safe-buffer\").Buffer;\n /* */\n\n var isEncoding =\n Buffer.isEncoding ||\n function(encoding) {\n encoding = \"\" + encoding;\n switch (encoding && encoding.toLowerCase()) {\n case \"hex\":\n case \"utf8\":\n case \"utf-8\":\n case \"ascii\":\n case \"binary\":\n case \"base64\":\n case \"ucs2\":\n case \"ucs-2\":\n case \"utf16le\":\n case \"utf-16le\":\n case \"raw\":\n return true;\n default:\n return false;\n }\n };\n\n function _normalizeEncoding(enc) {\n if (!enc) return \"utf8\";\n var retried;\n while (true) {\n switch (enc) {\n case \"utf8\":\n case \"utf-8\":\n return \"utf8\";\n case \"ucs2\":\n case \"ucs-2\":\n case \"utf16le\":\n case \"utf-16le\":\n return \"utf16le\";\n case \"latin1\":\n case \"binary\":\n return \"latin1\";\n case \"base64\":\n case \"ascii\":\n case \"hex\":\n return enc;\n default:\n if (retried) return; // undefined\n enc = (\"\" + enc).toLowerCase();\n retried = true;\n }\n }\n }\n\n // Do not cache `Buffer.isEncoding` when checking encoding names as some\n // modules monkey-patch it to support additional encodings\n function normalizeEncoding(enc) {\n var nenc = _normalizeEncoding(enc);\n if (\n typeof nenc !== \"string\" &&\n (Buffer.isEncoding === isEncoding || !isEncoding(enc))\n )\n throw new Error(\"Unknown encoding: \" + enc);\n return nenc || enc;\n }\n\n // StringDecoder provides an interface for efficiently splitting a series of\n // buffers into a series of JS strings without breaking apart multi-byte\n // characters.\n exports.StringDecoder = StringDecoder;\n function StringDecoder(encoding) {\n this.encoding = normalizeEncoding(encoding);\n var nb;\n switch (this.encoding) {\n case \"utf16le\":\n this.text = utf16Text;\n this.end = utf16End;\n nb = 4;\n break;\n case \"utf8\":\n this.fillLast = utf8FillLast;\n nb = 4;\n break;\n case \"base64\":\n this.text = base64Text;\n this.end = base64End;\n nb = 3;\n break;\n default:\n this.write = simpleWrite;\n this.end = simpleEnd;\n return;\n }\n this.lastNeed = 0;\n this.lastTotal = 0;\n this.lastChar = Buffer.allocUnsafe(nb);\n }\n\n StringDecoder.prototype.write = function(buf) {\n if (buf.length === 0) return \"\";\n var r;\n var i;\n if (this.lastNeed) {\n r = this.fillLast(buf);\n if (r === undefined) return \"\";\n i = this.lastNeed;\n this.lastNeed = 0;\n } else {\n i = 0;\n }\n if (i < buf.length)\n return r ? r + this.text(buf, i) : this.text(buf, i);\n return r || \"\";\n };\n\n StringDecoder.prototype.end = utf8End;\n\n // Returns only complete characters in a Buffer\n StringDecoder.prototype.text = utf8Text;\n\n // Attempts to complete a partial non-UTF-8 character using bytes from a Buffer\n StringDecoder.prototype.fillLast = function(buf) {\n if (this.lastNeed <= buf.length) {\n buf.copy(\n this.lastChar,\n this.lastTotal - this.lastNeed,\n 0,\n this.lastNeed\n );\n return this.lastChar.toString(this.encoding, 0, this.lastTotal);\n }\n buf.copy(\n this.lastChar,\n this.lastTotal - this.lastNeed,\n 0,\n buf.length\n );\n this.lastNeed -= buf.length;\n };\n\n // Checks the type of a UTF-8 byte, whether it's ASCII, a leading byte, or a\n // continuation byte. If an invalid byte is detected, -2 is returned.\n function utf8CheckByte(byte) {\n if (byte <= 0x7f) return 0;\n else if (byte >> 5 === 0x06) return 2;\n else if (byte >> 4 === 0x0e) return 3;\n else if (byte >> 3 === 0x1e) return 4;\n return byte >> 6 === 0x02 ? -1 : -2;\n }\n\n // Checks at most 3 bytes at the end of a Buffer in order to detect an\n // incomplete multi-byte UTF-8 character. The total number of bytes (2, 3, or 4)\n // needed to complete the UTF-8 character (if applicable) are returned.\n function utf8CheckIncomplete(self, buf, i) {\n var j = buf.length - 1;\n if (j < i) return 0;\n var nb = utf8CheckByte(buf[j]);\n if (nb >= 0) {\n if (nb > 0) self.lastNeed = nb - 1;\n return nb;\n }\n if (--j < i || nb === -2) return 0;\n nb = utf8CheckByte(buf[j]);\n if (nb >= 0) {\n if (nb > 0) self.lastNeed = nb - 2;\n return nb;\n }\n if (--j < i || nb === -2) return 0;\n nb = utf8CheckByte(buf[j]);\n if (nb >= 0) {\n if (nb > 0) {\n if (nb === 2) nb = 0;\n else self.lastNeed = nb - 3;\n }\n return nb;\n }\n return 0;\n }\n\n // Validates as many continuation bytes for a multi-byte UTF-8 character as\n // needed or are available. If we see a non-continuation byte where we expect\n // one, we \"replace\" the validated continuation bytes we've seen so far with\n // a single UTF-8 replacement character ('\\ufffd'), to match v8's UTF-8 decoding\n // behavior. The continuation byte check is included three times in the case\n // where all of the continuation bytes for a character exist in the same buffer.\n // It is also done this way as a slight performance increase instead of using a\n // loop.\n function utf8CheckExtraBytes(self, buf, p) {\n if ((buf[0] & 0xc0) !== 0x80) {\n self.lastNeed = 0;\n return \"\\ufffd\";\n }\n if (self.lastNeed > 1 && buf.length > 1) {\n if ((buf[1] & 0xc0) !== 0x80) {\n self.lastNeed = 1;\n return \"\\ufffd\";\n }\n if (self.lastNeed > 2 && buf.length > 2) {\n if ((buf[2] & 0xc0) !== 0x80) {\n self.lastNeed = 2;\n return \"\\ufffd\";\n }\n }\n }\n }\n\n // Attempts to complete a multi-byte UTF-8 character using bytes from a Buffer.\n function utf8FillLast(buf) {\n var p = this.lastTotal - this.lastNeed;\n var r = utf8CheckExtraBytes(this, buf, p);\n if (r !== undefined) return r;\n if (this.lastNeed <= buf.length) {\n buf.copy(this.lastChar, p, 0, this.lastNeed);\n return this.lastChar.toString(this.encoding, 0, this.lastTotal);\n }\n buf.copy(this.lastChar, p, 0, buf.length);\n this.lastNeed -= buf.length;\n }\n\n // Returns all complete UTF-8 characters in a Buffer. If the Buffer ended on a\n // partial character, the character's bytes are buffered until the required\n // number of bytes are available.\n function utf8Text(buf, i) {\n var total = utf8CheckIncomplete(this, buf, i);\n if (!this.lastNeed) return buf.toString(\"utf8\", i);\n this.lastTotal = total;\n var end = buf.length - (total - this.lastNeed);\n buf.copy(this.lastChar, 0, end);\n return buf.toString(\"utf8\", i, end);\n }\n\n // For UTF-8, a replacement character is added when ending on a partial\n // character.\n function utf8End(buf) {\n var r = buf && buf.length ? this.write(buf) : \"\";\n if (this.lastNeed) return r + \"\\ufffd\";\n return r;\n }\n\n // UTF-16LE typically needs two bytes per character, but even if we have an even\n // number of bytes available, we need to check if we end on a leading/high\n // surrogate. In that case, we need to wait for the next two bytes in order to\n // decode the last character properly.\n function utf16Text(buf, i) {\n if ((buf.length - i) % 2 === 0) {\n var r = buf.toString(\"utf16le\", i);\n if (r) {\n var c = r.charCodeAt(r.length - 1);\n if (c >= 0xd800 && c <= 0xdbff) {\n this.lastNeed = 2;\n this.lastTotal = 4;\n this.lastChar[0] = buf[buf.length - 2];\n this.lastChar[1] = buf[buf.length - 1];\n return r.slice(0, -1);\n }\n }\n return r;\n }\n this.lastNeed = 1;\n this.lastTotal = 2;\n this.lastChar[0] = buf[buf.length - 1];\n return buf.toString(\"utf16le\", i, buf.length - 1);\n }\n\n // For UTF-16LE we do not explicitly append special replacement characters if we\n // end on a partial character, we simply let v8 handle that.\n function utf16End(buf) {\n var r = buf && buf.length ? this.write(buf) : \"\";\n if (this.lastNeed) {\n var end = this.lastTotal - this.lastNeed;\n return r + this.lastChar.toString(\"utf16le\", 0, end);\n }\n return r;\n }\n\n function base64Text(buf, i) {\n var n = (buf.length - i) % 3;\n if (n === 0) return buf.toString(\"base64\", i);\n this.lastNeed = 3 - n;\n this.lastTotal = 3;\n if (n === 1) {\n this.lastChar[0] = buf[buf.length - 1];\n } else {\n this.lastChar[0] = buf[buf.length - 2];\n this.lastChar[1] = buf[buf.length - 1];\n }\n return buf.toString(\"base64\", i, buf.length - n);\n }\n\n function base64End(buf) {\n var r = buf && buf.length ? this.write(buf) : \"\";\n if (this.lastNeed)\n return r + this.lastChar.toString(\"base64\", 0, 3 - this.lastNeed);\n return r;\n }\n\n // Pass bytes on through for single-byte encodings (e.g. ascii, latin1, hex)\n function simpleWrite(buf) {\n return buf.toString(this.encoding);\n }\n\n function simpleEnd(buf) {\n return buf && buf.length ? this.write(buf) : \"\";\n }\n },\n { \"safe-buffer\": 144 }\n ],\n 126: [\n function(require, module, exports) {\n exports = module.exports = require(\"./lib/_stream_readable.js\");\n exports.Stream = exports;\n exports.Readable = exports;\n exports.Writable = require(\"./lib/_stream_writable.js\");\n exports.Duplex = require(\"./lib/_stream_duplex.js\");\n exports.Transform = require(\"./lib/_stream_transform.js\");\n exports.PassThrough = require(\"./lib/_stream_passthrough.js\");\n },\n {\n \"./lib/_stream_duplex.js\": 117,\n \"./lib/_stream_passthrough.js\": 118,\n \"./lib/_stream_readable.js\": 119,\n \"./lib/_stream_transform.js\": 120,\n \"./lib/_stream_writable.js\": 121\n }\n ],\n 127: [\n function(require, module, exports) {\n \"use strict\";\n\n module.exports = {\n // Output\n ABSOLUTE: \"absolute\",\n PATH_RELATIVE: \"pathRelative\",\n ROOT_RELATIVE: \"rootRelative\",\n SHORTEST: \"shortest\"\n };\n },\n {}\n ],\n 128: [\n function(require, module, exports) {\n \"use strict\";\n\n var constants = require(\"./constants\");\n\n function formatAuth(urlObj, options) {\n if (\n urlObj.auth &&\n !options.removeAuth &&\n (urlObj.extra.relation.maximumHost ||\n options.output === constants.ABSOLUTE)\n ) {\n return urlObj.auth + \"@\";\n }\n\n return \"\";\n }\n\n function formatHash(urlObj, options) {\n return urlObj.hash ? urlObj.hash : \"\";\n }\n\n function formatHost(urlObj, options) {\n if (\n urlObj.host.full &&\n (urlObj.extra.relation.maximumAuth ||\n options.output === constants.ABSOLUTE)\n ) {\n return urlObj.host.full;\n }\n\n return \"\";\n }\n\n function formatPath(urlObj, options) {\n var str = \"\";\n\n var absolutePath = urlObj.path.absolute.string;\n var relativePath = urlObj.path.relative.string;\n var resource = showResource(urlObj, options);\n\n if (\n urlObj.extra.relation.maximumHost ||\n options.output === constants.ABSOLUTE ||\n options.output === constants.ROOT_RELATIVE\n ) {\n str = absolutePath;\n } else if (\n (relativePath.length <= absolutePath.length &&\n options.output === constants.SHORTEST) ||\n options.output === constants.PATH_RELATIVE\n ) {\n str = relativePath;\n\n if (str === \"\") {\n var query =\n showQuery(urlObj, options) && !!getQuery(urlObj, options);\n\n if (urlObj.extra.relation.maximumPath && !resource) {\n str = \"./\";\n } else if (\n urlObj.extra.relation.overridesQuery &&\n !resource &&\n !query\n ) {\n str = \"./\";\n }\n }\n } else {\n str = absolutePath;\n }\n\n if (\n str === \"/\" &&\n !resource &&\n options.removeRootTrailingSlash &&\n (!urlObj.extra.relation.minimumPort ||\n options.output === constants.ABSOLUTE)\n ) {\n str = \"\";\n }\n\n return str;\n }\n\n function formatPort(urlObj, options) {\n if (\n urlObj.port &&\n !urlObj.extra.portIsDefault &&\n urlObj.extra.relation.maximumHost\n ) {\n return \":\" + urlObj.port;\n }\n\n return \"\";\n }\n\n function formatQuery(urlObj, options) {\n return showQuery(urlObj, options) ? getQuery(urlObj, options) : \"\";\n }\n\n function formatResource(urlObj, options) {\n return showResource(urlObj, options) ? urlObj.resource : \"\";\n }\n\n function formatScheme(urlObj, options) {\n var str = \"\";\n\n if (\n urlObj.extra.relation.maximumHost ||\n options.output === constants.ABSOLUTE\n ) {\n if (\n !urlObj.extra.relation.minimumScheme ||\n !options.schemeRelative ||\n options.output === constants.ABSOLUTE\n ) {\n str += urlObj.scheme + \"://\";\n } else {\n str += \"//\";\n }\n }\n\n return str;\n }\n\n function formatUrl(urlObj, options) {\n var url = \"\";\n\n url += formatScheme(urlObj, options);\n url += formatAuth(urlObj, options);\n url += formatHost(urlObj, options);\n url += formatPort(urlObj, options);\n url += formatPath(urlObj, options);\n url += formatResource(urlObj, options);\n url += formatQuery(urlObj, options);\n url += formatHash(urlObj, options);\n\n return url;\n }\n\n function getQuery(urlObj, options) {\n var stripQuery =\n options.removeEmptyQueries && urlObj.extra.relation.minimumPort;\n\n return urlObj.query.string[stripQuery ? \"stripped\" : \"full\"];\n }\n\n function showQuery(urlObj, options) {\n return (\n !urlObj.extra.relation.minimumQuery ||\n options.output === constants.ABSOLUTE ||\n options.output === constants.ROOT_RELATIVE\n );\n }\n\n function showResource(urlObj, options) {\n var removeIndex =\n options.removeDirectoryIndexes && urlObj.extra.resourceIsIndex;\n var removeMatchingResource =\n urlObj.extra.relation.minimumResource &&\n options.output !== constants.ABSOLUTE &&\n options.output !== constants.ROOT_RELATIVE;\n\n return !!urlObj.resource && !removeMatchingResource && !removeIndex;\n }\n\n module.exports = formatUrl;\n },\n { \"./constants\": 127 }\n ],\n 129: [\n function(require, module, exports) {\n \"use strict\";\n\n var constants = require(\"./constants\");\n var formatUrl = require(\"./format\");\n var getOptions = require(\"./options\");\n var objUtils = require(\"./util/object\");\n var parseUrl = require(\"./parse\");\n var relateUrl = require(\"./relate\");\n\n function RelateUrl(from, options) {\n this.options = getOptions(options, {\n defaultPorts: { ftp: 21, http: 80, https: 443 },\n directoryIndexes: [\"index.html\"],\n ignore_www: false,\n output: RelateUrl.SHORTEST,\n rejectedSchemes: [\"data\", \"javascript\", \"mailto\"],\n removeAuth: false,\n removeDirectoryIndexes: true,\n removeEmptyQueries: false,\n removeRootTrailingSlash: true,\n schemeRelative: true,\n site: undefined,\n slashesDenoteHost: true\n });\n\n this.from = parseUrl.from(from, this.options, null);\n }\n\n /*\n\tUsage: instance=new RelateUrl(); instance.relate();\n*/\n RelateUrl.prototype.relate = function(from, to, options) {\n // relate(to,options)\n if (objUtils.isPlainObject(to)) {\n options = to;\n to = from;\n from = null;\n }\n // relate(to)\n else if (!to) {\n to = from;\n from = null;\n }\n\n options = getOptions(options, this.options);\n from = from || options.site;\n from = parseUrl.from(from, options, this.from);\n\n if (!from || !from.href) {\n throw new Error(\"from value not defined.\");\n } else if (from.extra.hrefInfo.minimumPathOnly) {\n throw new Error(\n \"from value supplied is not absolute: \" + from.href\n );\n }\n\n to = parseUrl.to(to, options);\n\n if (to.valid === false) return to.href;\n\n to = relateUrl(from, to, options);\n to = formatUrl(to, options);\n\n return to;\n };\n\n /*\n\tUsage: RelateUrl.relate();\n*/\n RelateUrl.relate = function(from, to, options) {\n return new RelateUrl().relate(from, to, options);\n };\n\n // Make constants accessible from API\n objUtils.shallowMerge(RelateUrl, constants);\n\n module.exports = RelateUrl;\n },\n {\n \"./constants\": 127,\n \"./format\": 128,\n \"./options\": 130,\n \"./parse\": 133,\n \"./relate\": 140,\n \"./util/object\": 142\n }\n ],\n 130: [\n function(require, module, exports) {\n \"use strict\";\n\n var objUtils = require(\"./util/object\");\n\n function getOptions(options, defaults) {\n if (objUtils.isPlainObject(options)) {\n var newOptions = {};\n\n for (var i in defaults) {\n if (defaults.hasOwnProperty(i)) {\n if (options[i] !== undefined) {\n newOptions[i] = mergeOption(options[i], defaults[i]);\n } else {\n newOptions[i] = defaults[i];\n }\n }\n }\n\n return newOptions;\n } else {\n return defaults;\n }\n }\n\n function mergeOption(newValues, defaultValues) {\n if (defaultValues instanceof Object && newValues instanceof Object) {\n if (defaultValues instanceof Array && newValues instanceof Array) {\n return defaultValues.concat(newValues);\n } else {\n return objUtils.shallowMerge(newValues, defaultValues);\n }\n }\n\n return newValues;\n }\n\n module.exports = getOptions;\n },\n { \"./util/object\": 142 }\n ],\n 131: [\n function(require, module, exports) {\n \"use strict\";\n\n function parseHost(urlObj, options) {\n // TWEAK :: condition only for speed optimization\n if (options.ignore_www) {\n var host = urlObj.host.full;\n\n if (host) {\n var stripped = host;\n\n if (host.indexOf(\"www.\") === 0) {\n stripped = host.substr(4);\n }\n\n urlObj.host.stripped = stripped;\n }\n }\n }\n\n module.exports = parseHost;\n },\n {}\n ],\n 132: [\n function(require, module, exports) {\n \"use strict\";\n\n function hrefInfo(urlObj) {\n var minimumPathOnly =\n !urlObj.scheme && !urlObj.auth && !urlObj.host.full && !urlObj.port;\n var minimumResourceOnly =\n minimumPathOnly && !urlObj.path.absolute.string;\n var minimumQueryOnly = minimumResourceOnly && !urlObj.resource;\n var minimumHashOnly =\n minimumQueryOnly && !urlObj.query.string.full.length;\n var empty = minimumHashOnly && !urlObj.hash;\n\n urlObj.extra.hrefInfo.minimumPathOnly = minimumPathOnly;\n urlObj.extra.hrefInfo.minimumResourceOnly = minimumResourceOnly;\n urlObj.extra.hrefInfo.minimumQueryOnly = minimumQueryOnly;\n urlObj.extra.hrefInfo.minimumHashOnly = minimumHashOnly;\n urlObj.extra.hrefInfo.empty = empty;\n }\n\n module.exports = hrefInfo;\n },\n {}\n ],\n 133: [\n function(require, module, exports) {\n \"use strict\";\n\n var hrefInfo = require(\"./hrefInfo\");\n var parseHost = require(\"./host\");\n var parsePath = require(\"./path\");\n var parsePort = require(\"./port\");\n var parseQuery = require(\"./query\");\n var parseUrlString = require(\"./urlstring\");\n var pathUtils = require(\"../util/path\");\n\n function parseFromUrl(url, options, fallback) {\n if (url) {\n var urlObj = parseUrl(url, options);\n\n // Because the following occurs in the relate stage for \"to\" URLs,\n // such had to be mostly duplicated here\n\n var pathArray = pathUtils.resolveDotSegments(\n urlObj.path.absolute.array\n );\n\n urlObj.path.absolute.array = pathArray;\n urlObj.path.absolute.string = \"/\" + pathUtils.join(pathArray);\n\n return urlObj;\n } else {\n return fallback;\n }\n }\n\n function parseUrl(url, options) {\n var urlObj = parseUrlString(url, options);\n\n if (urlObj.valid === false) return urlObj;\n\n parseHost(urlObj, options);\n parsePort(urlObj, options);\n parsePath(urlObj, options);\n parseQuery(urlObj, options);\n hrefInfo(urlObj);\n\n return urlObj;\n }\n\n module.exports = {\n from: parseFromUrl,\n to: parseUrl\n };\n },\n {\n \"../util/path\": 143,\n \"./host\": 131,\n \"./hrefInfo\": 132,\n \"./path\": 134,\n \"./port\": 135,\n \"./query\": 136,\n \"./urlstring\": 137\n }\n ],\n 134: [\n function(require, module, exports) {\n \"use strict\";\n\n function isDirectoryIndex(resource, options) {\n var verdict = false;\n\n options.directoryIndexes.every(function(index) {\n if (index === resource) {\n verdict = true;\n return false;\n }\n\n return true;\n });\n\n return verdict;\n }\n\n function parsePath(urlObj, options) {\n var path = urlObj.path.absolute.string;\n\n if (path) {\n var lastSlash = path.lastIndexOf(\"/\");\n\n if (lastSlash > -1) {\n if (++lastSlash < path.length) {\n var resource = path.substr(lastSlash);\n\n if (resource !== \".\" && resource !== \"..\") {\n urlObj.resource = resource;\n path = path.substr(0, lastSlash);\n } else {\n path += \"/\";\n }\n }\n\n urlObj.path.absolute.string = path;\n urlObj.path.absolute.array = splitPath(path);\n } else if (path === \".\" || path === \"..\") {\n // \"..?var\", \"..#anchor\", etc ... not \"..index.html\"\n path += \"/\";\n\n urlObj.path.absolute.string = path;\n urlObj.path.absolute.array = splitPath(path);\n } else {\n // Resource-only\n urlObj.resource = path;\n urlObj.path.absolute.string = null;\n }\n\n urlObj.extra.resourceIsIndex = isDirectoryIndex(\n urlObj.resource,\n options\n );\n }\n // Else: query/hash-only or empty\n }\n\n function splitPath(path) {\n // TWEAK :: condition only for speed optimization\n if (path !== \"/\") {\n var cleaned = [];\n\n path.split(\"/\").forEach(function(dir) {\n // Cleanup -- splitting \"/dir/\" becomes [\"\",\"dir\",\"\"]\n if (dir !== \"\") {\n cleaned.push(dir);\n }\n });\n\n return cleaned;\n } else {\n // Faster to skip the above block and just create an array\n return [];\n }\n }\n\n module.exports = parsePath;\n },\n {}\n ],\n 135: [\n function(require, module, exports) {\n \"use strict\";\n\n function parsePort(urlObj, options) {\n var defaultPort = -1;\n\n for (var i in options.defaultPorts) {\n if (i === urlObj.scheme && options.defaultPorts.hasOwnProperty(i)) {\n defaultPort = options.defaultPorts[i];\n break;\n }\n }\n\n if (defaultPort > -1) {\n // Force same type as urlObj.port\n defaultPort = defaultPort.toString();\n\n if (urlObj.port === null) {\n urlObj.port = defaultPort;\n }\n\n urlObj.extra.portIsDefault = urlObj.port === defaultPort;\n }\n }\n\n module.exports = parsePort;\n },\n {}\n ],\n 136: [\n function(require, module, exports) {\n \"use strict\";\n var hasOwnProperty = Object.prototype.hasOwnProperty;\n\n function parseQuery(urlObj, options) {\n urlObj.query.string.full = stringify(urlObj.query.object, false);\n\n // TWEAK :: condition only for speed optimization\n if (options.removeEmptyQueries) {\n urlObj.query.string.stripped = stringify(urlObj.query.object, true);\n }\n }\n\n function stringify(queryObj, removeEmptyQueries) {\n var count = 0;\n var str = \"\";\n\n for (var i in queryObj) {\n if (i !== \"\" && hasOwnProperty.call(queryObj, i) === true) {\n var value = queryObj[i];\n\n if (value !== \"\" || !removeEmptyQueries) {\n str += ++count === 1 ? \"?\" : \"&\";\n\n i = encodeURIComponent(i);\n\n if (value !== \"\") {\n str +=\n i + \"=\" + encodeURIComponent(value).replace(/%20/g, \"+\");\n } else {\n str += i;\n }\n }\n }\n }\n\n return str;\n }\n\n module.exports = parseQuery;\n },\n {}\n ],\n 137: [\n function(require, module, exports) {\n \"use strict\";\n\n var _parseUrl = require(\"url\").parse;\n\n /*\n\tCustomize the URL object that Node generates\n\tbecause:\n\t\n\t* necessary data for later\n\t* urlObj.host is useless\n\t* urlObj.hostname is too long\n\t* urlObj.path is useless\n\t* urlObj.pathname is too long\n\t* urlObj.protocol is inaccurate; should be called \"scheme\"\n\t* urlObj.search is mostly useless\n*/\n function clean(urlObj) {\n var scheme = urlObj.protocol;\n\n if (scheme) {\n // Remove \":\" suffix\n if (scheme.indexOf(\":\") === scheme.length - 1) {\n scheme = scheme.substr(0, scheme.length - 1);\n }\n }\n\n urlObj.host = {\n // TODO :: unescape(encodeURIComponent(s)) ? ... http://ecmanaut.blogspot.ca/2006/07/encoding-decoding-utf8-in-javascript.html\n full: urlObj.hostname,\n stripped: null\n };\n\n urlObj.path = {\n absolute: {\n array: null,\n string: urlObj.pathname\n },\n relative: {\n array: null,\n string: null\n }\n };\n\n urlObj.query = {\n object: urlObj.query,\n string: {\n full: null,\n stripped: null\n }\n };\n\n urlObj.extra = {\n hrefInfo: {\n minimumPathOnly: null,\n minimumResourceOnly: null,\n minimumQueryOnly: null,\n minimumHashOnly: null,\n empty: null,\n\n separatorOnlyQuery: urlObj.search === \"?\"\n },\n portIsDefault: null,\n relation: {\n maximumScheme: null,\n maximumAuth: null,\n maximumHost: null,\n maximumPort: null,\n maximumPath: null,\n maximumResource: null,\n maximumQuery: null,\n maximumHash: null,\n\n minimumScheme: null,\n minimumAuth: null,\n minimumHost: null,\n minimumPort: null,\n minimumPath: null,\n minimumResource: null,\n minimumQuery: null,\n minimumHash: null,\n\n overridesQuery: null\n },\n resourceIsIndex: null,\n slashes: urlObj.slashes\n };\n\n urlObj.resource = null;\n urlObj.scheme = scheme;\n delete urlObj.hostname;\n delete urlObj.pathname;\n delete urlObj.protocol;\n delete urlObj.search;\n delete urlObj.slashes;\n\n return urlObj;\n }\n\n function validScheme(url, options) {\n var valid = true;\n\n options.rejectedSchemes.every(function(rejectedScheme) {\n valid = !(url.indexOf(rejectedScheme + \":\") === 0);\n\n // Break loop\n return valid;\n });\n\n return valid;\n }\n\n function parseUrlString(url, options) {\n if (validScheme(url, options)) {\n return clean(_parseUrl(url, true, options.slashesDenoteHost));\n } else {\n return { href: url, valid: false };\n }\n }\n\n module.exports = parseUrlString;\n },\n { url: 162 }\n ],\n 138: [\n function(require, module, exports) {\n \"use strict\";\n\n var findRelation = require(\"./findRelation\");\n var objUtils = require(\"../util/object\");\n var pathUtils = require(\"../util/path\");\n\n function absolutize(urlObj, siteUrlObj, options) {\n findRelation.upToPath(urlObj, siteUrlObj, options);\n\n // Fill in relative URLs\n if (urlObj.extra.relation.minimumScheme)\n urlObj.scheme = siteUrlObj.scheme;\n if (urlObj.extra.relation.minimumAuth) urlObj.auth = siteUrlObj.auth;\n if (urlObj.extra.relation.minimumHost)\n urlObj.host = objUtils.clone(siteUrlObj.host);\n if (urlObj.extra.relation.minimumPort) copyPort(urlObj, siteUrlObj);\n if (urlObj.extra.relation.minimumScheme) copyPath(urlObj, siteUrlObj);\n\n // Check remaining relativeness now that path has been copied and/or resolved\n findRelation.pathOn(urlObj, siteUrlObj, options);\n\n // Fill in relative URLs\n if (urlObj.extra.relation.minimumResource)\n copyResource(urlObj, siteUrlObj);\n if (urlObj.extra.relation.minimumQuery)\n urlObj.query = objUtils.clone(siteUrlObj.query);\n if (urlObj.extra.relation.minimumHash) urlObj.hash = siteUrlObj.hash;\n }\n\n /*\n\tGet an absolute path that's relative to site url.\n*/\n function copyPath(urlObj, siteUrlObj) {\n if (\n urlObj.extra.relation.maximumHost ||\n !urlObj.extra.hrefInfo.minimumResourceOnly\n ) {\n var pathArray = urlObj.path.absolute.array;\n var pathString = \"/\";\n\n // If not erroneous URL\n if (pathArray) {\n // If is relative path\n if (\n urlObj.extra.hrefInfo.minimumPathOnly &&\n urlObj.path.absolute.string.indexOf(\"/\") !== 0\n ) {\n // Append path to site path\n pathArray = siteUrlObj.path.absolute.array.concat(pathArray);\n }\n\n pathArray = pathUtils.resolveDotSegments(pathArray);\n pathString += pathUtils.join(pathArray);\n } else {\n pathArray = [];\n }\n\n urlObj.path.absolute.array = pathArray;\n urlObj.path.absolute.string = pathString;\n } else {\n // Resource-, query- or hash-only or empty\n urlObj.path = objUtils.clone(siteUrlObj.path);\n }\n }\n\n function copyPort(urlObj, siteUrlObj) {\n urlObj.port = siteUrlObj.port;\n\n urlObj.extra.portIsDefault = siteUrlObj.extra.portIsDefault;\n }\n\n function copyResource(urlObj, siteUrlObj) {\n urlObj.resource = siteUrlObj.resource;\n\n urlObj.extra.resourceIsIndex = siteUrlObj.extra.resourceIsIndex;\n }\n\n module.exports = absolutize;\n },\n { \"../util/object\": 142, \"../util/path\": 143, \"./findRelation\": 139 }\n ],\n 139: [\n function(require, module, exports) {\n \"use strict\";\n\n function findRelation_upToPath(urlObj, siteUrlObj, options) {\n // Path- or root-relative URL\n var pathOnly = urlObj.extra.hrefInfo.minimumPathOnly;\n\n // Matching scheme, scheme-relative or path-only\n var minimumScheme =\n urlObj.scheme === siteUrlObj.scheme || !urlObj.scheme;\n\n // Matching auth, ignoring auth or path-only\n var minimumAuth =\n minimumScheme &&\n (urlObj.auth === siteUrlObj.auth || options.removeAuth || pathOnly);\n\n // Matching host or path-only\n var www = options.ignore_www ? \"stripped\" : \"full\";\n var minimumHost =\n minimumAuth &&\n (urlObj.host[www] === siteUrlObj.host[www] || pathOnly);\n\n // Matching port or path-only\n var minimumPort =\n minimumHost && (urlObj.port === siteUrlObj.port || pathOnly);\n\n urlObj.extra.relation.minimumScheme = minimumScheme;\n urlObj.extra.relation.minimumAuth = minimumAuth;\n urlObj.extra.relation.minimumHost = minimumHost;\n urlObj.extra.relation.minimumPort = minimumPort;\n\n urlObj.extra.relation.maximumScheme =\n !minimumScheme || (minimumScheme && !minimumAuth);\n urlObj.extra.relation.maximumAuth =\n !minimumScheme || (minimumScheme && !minimumHost);\n urlObj.extra.relation.maximumHost =\n !minimumScheme || (minimumScheme && !minimumPort);\n }\n\n function findRelation_pathOn(urlObj, siteUrlObj, options) {\n var queryOnly = urlObj.extra.hrefInfo.minimumQueryOnly;\n var hashOnly = urlObj.extra.hrefInfo.minimumHashOnly;\n var empty = urlObj.extra.hrefInfo.empty; // not required, but self-documenting\n\n // From upToPath()\n var minimumPort = urlObj.extra.relation.minimumPort;\n var minimumScheme = urlObj.extra.relation.minimumScheme;\n\n // Matching port and path\n var minimumPath =\n minimumPort &&\n urlObj.path.absolute.string === siteUrlObj.path.absolute.string;\n\n // Matching resource or query/hash-only or empty\n var matchingResource =\n urlObj.resource === siteUrlObj.resource ||\n (!urlObj.resource && siteUrlObj.extra.resourceIsIndex) ||\n (options.removeDirectoryIndexes &&\n urlObj.extra.resourceIsIndex &&\n !siteUrlObj.resource);\n var minimumResource =\n minimumPath && (matchingResource || queryOnly || hashOnly || empty);\n\n // Matching query or hash-only/empty\n var query = options.removeEmptyQueries ? \"stripped\" : \"full\";\n var urlQuery = urlObj.query.string[query];\n var siteUrlQuery = siteUrlObj.query.string[query];\n var minimumQuery =\n (minimumResource && !!urlQuery && urlQuery === siteUrlQuery) ||\n ((hashOnly || empty) && !urlObj.extra.hrefInfo.separatorOnlyQuery);\n\n var minimumHash = minimumQuery && urlObj.hash === siteUrlObj.hash;\n\n urlObj.extra.relation.minimumPath = minimumPath;\n urlObj.extra.relation.minimumResource = minimumResource;\n urlObj.extra.relation.minimumQuery = minimumQuery;\n urlObj.extra.relation.minimumHash = minimumHash;\n\n urlObj.extra.relation.maximumPort =\n !minimumScheme || (minimumScheme && !minimumPath);\n urlObj.extra.relation.maximumPath =\n !minimumScheme || (minimumScheme && !minimumResource);\n urlObj.extra.relation.maximumResource =\n !minimumScheme || (minimumScheme && !minimumQuery);\n urlObj.extra.relation.maximumQuery =\n !minimumScheme || (minimumScheme && !minimumHash);\n urlObj.extra.relation.maximumHash =\n !minimumScheme || (minimumScheme && !minimumHash); // there's nothing after hash, so it's the same as maximumQuery\n\n // Matching path and/or resource with existing but non-matching site query\n urlObj.extra.relation.overridesQuery =\n minimumPath &&\n urlObj.extra.relation.maximumResource &&\n !minimumQuery &&\n !!siteUrlQuery;\n }\n\n module.exports = {\n pathOn: findRelation_pathOn,\n upToPath: findRelation_upToPath\n };\n },\n {}\n ],\n 140: [\n function(require, module, exports) {\n \"use strict\";\n\n var absolutize = require(\"./absolutize\");\n var relativize = require(\"./relativize\");\n\n function relateUrl(siteUrlObj, urlObj, options) {\n absolutize(urlObj, siteUrlObj, options);\n relativize(urlObj, siteUrlObj, options);\n\n return urlObj;\n }\n\n module.exports = relateUrl;\n },\n { \"./absolutize\": 138, \"./relativize\": 141 }\n ],\n 141: [\n function(require, module, exports) {\n \"use strict\";\n\n var pathUtils = require(\"../util/path\");\n\n /*\n\tGet a path relative to the site path.\n*/\n function relatePath(absolutePath, siteAbsolutePath) {\n var relativePath = [];\n\n // At this point, it's related to the host/port\n var related = true;\n var parentIndex = -1;\n\n // Find parents\n siteAbsolutePath.forEach(function(siteAbsoluteDir, i) {\n if (related) {\n if (absolutePath[i] !== siteAbsoluteDir) {\n related = false;\n } else {\n parentIndex = i;\n }\n }\n\n if (!related) {\n // Up one level\n relativePath.push(\"..\");\n }\n });\n\n // Form path\n absolutePath.forEach(function(dir, i) {\n if (i > parentIndex) {\n relativePath.push(dir);\n }\n });\n\n return relativePath;\n }\n\n function relativize(urlObj, siteUrlObj, options) {\n if (urlObj.extra.relation.minimumScheme) {\n var pathArray = relatePath(\n urlObj.path.absolute.array,\n siteUrlObj.path.absolute.array\n );\n\n urlObj.path.relative.array = pathArray;\n urlObj.path.relative.string = pathUtils.join(pathArray);\n }\n }\n\n module.exports = relativize;\n },\n { \"../util/path\": 143 }\n ],\n 142: [\n function(require, module, exports) {\n \"use strict\";\n\n /*\n\tDeep-clone an object.\n*/\n function clone(obj) {\n if (obj instanceof Object) {\n var clonedObj = obj instanceof Array ? [] : {};\n\n for (var i in obj) {\n if (obj.hasOwnProperty(i)) {\n clonedObj[i] = clone(obj[i]);\n }\n }\n\n return clonedObj;\n }\n\n return obj;\n }\n\n /*\n\thttps://github.com/jonschlinkert/is-plain-object\n*/\n function isPlainObject(obj) {\n return !!obj && typeof obj === \"object\" && obj.constructor === Object;\n }\n\n /*\n\tShallow-merge two objects.\n*/\n function shallowMerge(target, source) {\n if (target instanceof Object && source instanceof Object) {\n for (var i in source) {\n if (source.hasOwnProperty(i)) {\n target[i] = source[i];\n }\n }\n }\n\n return target;\n }\n\n module.exports = {\n clone: clone,\n isPlainObject: isPlainObject,\n shallowMerge: shallowMerge\n };\n },\n {}\n ],\n 143: [\n function(require, module, exports) {\n \"use strict\";\n\n function joinPath(pathArray) {\n if (pathArray.length > 0) {\n return pathArray.join(\"/\") + \"/\";\n } else {\n return \"\";\n }\n }\n\n function resolveDotSegments(pathArray) {\n var pathAbsolute = [];\n\n pathArray.forEach(function(dir) {\n if (dir !== \"..\") {\n if (dir !== \".\") {\n pathAbsolute.push(dir);\n }\n } else {\n // Remove parent\n if (pathAbsolute.length > 0) {\n pathAbsolute.splice(pathAbsolute.length - 1, 1);\n }\n }\n });\n\n return pathAbsolute;\n }\n\n module.exports = {\n join: joinPath,\n resolveDotSegments: resolveDotSegments\n };\n },\n {}\n ],\n 144: [\n function(require, module, exports) {\n /* eslint-disable node/no-deprecated-api */\n var buffer = require(\"buffer\");\n var Buffer = buffer.Buffer;\n\n // alternative to using Object.keys for old browsers\n function copyProps(src, dst) {\n for (var key in src) {\n dst[key] = src[key];\n }\n }\n if (\n Buffer.from &&\n Buffer.alloc &&\n Buffer.allocUnsafe &&\n Buffer.allocUnsafeSlow\n ) {\n module.exports = buffer;\n } else {\n // Copy properties from require('buffer')\n copyProps(buffer, exports);\n exports.Buffer = SafeBuffer;\n }\n\n function SafeBuffer(arg, encodingOrOffset, length) {\n return Buffer(arg, encodingOrOffset, length);\n }\n\n // Copy static methods from Buffer\n copyProps(Buffer, SafeBuffer);\n\n SafeBuffer.from = function(arg, encodingOrOffset, length) {\n if (typeof arg === \"number\") {\n throw new TypeError(\"Argument must not be a number\");\n }\n return Buffer(arg, encodingOrOffset, length);\n };\n\n SafeBuffer.alloc = function(size, fill, encoding) {\n if (typeof size !== \"number\") {\n throw new TypeError(\"Argument must be a number\");\n }\n var buf = Buffer(size);\n if (fill !== undefined) {\n if (typeof encoding === \"string\") {\n buf.fill(fill, encoding);\n } else {\n buf.fill(fill);\n }\n } else {\n buf.fill(0);\n }\n return buf;\n };\n\n SafeBuffer.allocUnsafe = function(size) {\n if (typeof size !== \"number\") {\n throw new TypeError(\"Argument must be a number\");\n }\n return Buffer(size);\n };\n\n SafeBuffer.allocUnsafeSlow = function(size) {\n if (typeof size !== \"number\") {\n throw new TypeError(\"Argument must be a number\");\n }\n return buffer.SlowBuffer(size);\n };\n },\n { buffer: 4 }\n ],\n 145: [\n function(require, module, exports) {\n /* -*- Mode: js; js-indent-level: 2; -*- */\n /*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\n var util = require(\"./util\");\n var has = Object.prototype.hasOwnProperty;\n var hasNativeMap = typeof Map !== \"undefined\";\n\n /**\n * A data structure which is a combination of an array and a set. Adding a new\n * member is O(1), testing for membership is O(1), and finding the index of an\n * element is O(1). Removing elements from the set is not supported. Only\n * strings are supported for membership.\n */\n function ArraySet() {\n this._array = [];\n this._set = hasNativeMap ? new Map() : Object.create(null);\n }\n\n /**\n * Static method for creating ArraySet instances from an existing array.\n */\n ArraySet.fromArray = function ArraySet_fromArray(\n aArray,\n aAllowDuplicates\n ) {\n var set = new ArraySet();\n for (var i = 0, len = aArray.length; i < len; i++) {\n set.add(aArray[i], aAllowDuplicates);\n }\n return set;\n };\n\n /**\n * Return how many unique items are in this ArraySet. If duplicates have been\n * added, than those do not count towards the size.\n *\n * @returns Number\n */\n ArraySet.prototype.size = function ArraySet_size() {\n return hasNativeMap\n ? this._set.size\n : Object.getOwnPropertyNames(this._set).length;\n };\n\n /**\n * Add the given string to this set.\n *\n * @param String aStr\n */\n ArraySet.prototype.add = function ArraySet_add(aStr, aAllowDuplicates) {\n var sStr = hasNativeMap ? aStr : util.toSetString(aStr);\n var isDuplicate = hasNativeMap\n ? this.has(aStr)\n : has.call(this._set, sStr);\n var idx = this._array.length;\n if (!isDuplicate || aAllowDuplicates) {\n this._array.push(aStr);\n }\n if (!isDuplicate) {\n if (hasNativeMap) {\n this._set.set(aStr, idx);\n } else {\n this._set[sStr] = idx;\n }\n }\n };\n\n /**\n * Is the given string a member of this set?\n *\n * @param String aStr\n */\n ArraySet.prototype.has = function ArraySet_has(aStr) {\n if (hasNativeMap) {\n return this._set.has(aStr);\n } else {\n var sStr = util.toSetString(aStr);\n return has.call(this._set, sStr);\n }\n };\n\n /**\n * What is the index of the given string in the array?\n *\n * @param String aStr\n */\n ArraySet.prototype.indexOf = function ArraySet_indexOf(aStr) {\n if (hasNativeMap) {\n var idx = this._set.get(aStr);\n if (idx >= 0) {\n return idx;\n }\n } else {\n var sStr = util.toSetString(aStr);\n if (has.call(this._set, sStr)) {\n return this._set[sStr];\n }\n }\n\n throw new Error('\"' + aStr + '\" is not in the set.');\n };\n\n /**\n * What is the element at the given index?\n *\n * @param Number aIdx\n */\n ArraySet.prototype.at = function ArraySet_at(aIdx) {\n if (aIdx >= 0 && aIdx < this._array.length) {\n return this._array[aIdx];\n }\n throw new Error(\"No element indexed by \" + aIdx);\n };\n\n /**\n * Returns the array representation of this set (which has the proper indices\n * indicated by indexOf). Note that this is a copy of the internal array used\n * for storing the members so that no one can mess with internal state.\n */\n ArraySet.prototype.toArray = function ArraySet_toArray() {\n return this._array.slice();\n };\n\n exports.ArraySet = ArraySet;\n },\n { \"./util\": 154 }\n ],\n 146: [\n function(require, module, exports) {\n /* -*- Mode: js; js-indent-level: 2; -*- */\n /*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n *\n * Based on the Base 64 VLQ implementation in Closure Compiler:\n * https://code.google.com/p/closure-compiler/source/browse/trunk/src/com/google/debugging/sourcemap/Base64VLQ.java\n *\n * Copyright 2011 The Closure Compiler Authors. All rights reserved.\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are\n * met:\n *\n * * Redistributions of source code must retain the above copyright\n * notice, this list of conditions and the following disclaimer.\n * * Redistributions in binary form must reproduce the above\n * copyright notice, this list of conditions and the following\n * disclaimer in the documentation and/or other materials provided\n * with the distribution.\n * * Neither the name of Google Inc. nor the names of its\n * contributors may be used to endorse or promote products derived\n * from this software without specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n * \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\n var base64 = require(\"./base64\");\n\n // A single base 64 digit can contain 6 bits of data. For the base 64 variable\n // length quantities we use in the source map spec, the first bit is the sign,\n // the next four bits are the actual value, and the 6th bit is the\n // continuation bit. The continuation bit tells us whether there are more\n // digits in this value following this digit.\n //\n // Continuation\n // | Sign\n // | |\n // V V\n // 101011\n\n var VLQ_BASE_SHIFT = 5;\n\n // binary: 100000\n var VLQ_BASE = 1 << VLQ_BASE_SHIFT;\n\n // binary: 011111\n var VLQ_BASE_MASK = VLQ_BASE - 1;\n\n // binary: 100000\n var VLQ_CONTINUATION_BIT = VLQ_BASE;\n\n /**\n * Converts from a two-complement value to a value where the sign bit is\n * placed in the least significant bit. For example, as decimals:\n * 1 becomes 2 (10 binary), -1 becomes 3 (11 binary)\n * 2 becomes 4 (100 binary), -2 becomes 5 (101 binary)\n */\n function toVLQSigned(aValue) {\n return aValue < 0 ? (-aValue << 1) + 1 : (aValue << 1) + 0;\n }\n\n /**\n * Converts to a two-complement value from a value where the sign bit is\n * placed in the least significant bit. For example, as decimals:\n * 2 (10 binary) becomes 1, 3 (11 binary) becomes -1\n * 4 (100 binary) becomes 2, 5 (101 binary) becomes -2\n */\n function fromVLQSigned(aValue) {\n var isNegative = (aValue & 1) === 1;\n var shifted = aValue >> 1;\n return isNegative ? -shifted : shifted;\n }\n\n /**\n * Returns the base 64 VLQ encoded value.\n */\n exports.encode = function base64VLQ_encode(aValue) {\n var encoded = \"\";\n var digit;\n\n var vlq = toVLQSigned(aValue);\n\n do {\n digit = vlq & VLQ_BASE_MASK;\n vlq >>>= VLQ_BASE_SHIFT;\n if (vlq > 0) {\n // There are still more digits in this value, so we must make sure the\n // continuation bit is marked.\n digit |= VLQ_CONTINUATION_BIT;\n }\n encoded += base64.encode(digit);\n } while (vlq > 0);\n\n return encoded;\n };\n\n /**\n * Decodes the next base 64 VLQ value from the given string and returns the\n * value and the rest of the string via the out parameter.\n */\n exports.decode = function base64VLQ_decode(aStr, aIndex, aOutParam) {\n var strLen = aStr.length;\n var result = 0;\n var shift = 0;\n var continuation, digit;\n\n do {\n if (aIndex >= strLen) {\n throw new Error(\"Expected more digits in base 64 VLQ value.\");\n }\n\n digit = base64.decode(aStr.charCodeAt(aIndex++));\n if (digit === -1) {\n throw new Error(\n \"Invalid base64 digit: \" + aStr.charAt(aIndex - 1)\n );\n }\n\n continuation = !!(digit & VLQ_CONTINUATION_BIT);\n digit &= VLQ_BASE_MASK;\n result = result + (digit << shift);\n shift += VLQ_BASE_SHIFT;\n } while (continuation);\n\n aOutParam.value = fromVLQSigned(result);\n aOutParam.rest = aIndex;\n };\n },\n { \"./base64\": 147 }\n ],\n 147: [\n function(require, module, exports) {\n /* -*- Mode: js; js-indent-level: 2; -*- */\n /*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\n var intToCharMap = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\".split(\n \"\"\n );\n\n /**\n * Encode an integer in the range of 0 to 63 to a single base 64 digit.\n */\n exports.encode = function(number) {\n if (0 <= number && number < intToCharMap.length) {\n return intToCharMap[number];\n }\n throw new TypeError(\"Must be between 0 and 63: \" + number);\n };\n\n /**\n * Decode a single base 64 character code digit to an integer. Returns -1 on\n * failure.\n */\n exports.decode = function(charCode) {\n var bigA = 65; // 'A'\n var bigZ = 90; // 'Z'\n\n var littleA = 97; // 'a'\n var littleZ = 122; // 'z'\n\n var zero = 48; // '0'\n var nine = 57; // '9'\n\n var plus = 43; // '+'\n var slash = 47; // '/'\n\n var littleOffset = 26;\n var numberOffset = 52;\n\n // 0 - 25: ABCDEFGHIJKLMNOPQRSTUVWXYZ\n if (bigA <= charCode && charCode <= bigZ) {\n return charCode - bigA;\n }\n\n // 26 - 51: abcdefghijklmnopqrstuvwxyz\n if (littleA <= charCode && charCode <= littleZ) {\n return charCode - littleA + littleOffset;\n }\n\n // 52 - 61: 0123456789\n if (zero <= charCode && charCode <= nine) {\n return charCode - zero + numberOffset;\n }\n\n // 62: +\n if (charCode == plus) {\n return 62;\n }\n\n // 63: /\n if (charCode == slash) {\n return 63;\n }\n\n // Invalid base64 digit.\n return -1;\n };\n },\n {}\n ],\n 148: [\n function(require, module, exports) {\n /* -*- Mode: js; js-indent-level: 2; -*- */\n /*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\n exports.GREATEST_LOWER_BOUND = 1;\n exports.LEAST_UPPER_BOUND = 2;\n\n /**\n * Recursive implementation of binary search.\n *\n * @param aLow Indices here and lower do not contain the needle.\n * @param aHigh Indices here and higher do not contain the needle.\n * @param aNeedle The element being searched for.\n * @param aHaystack The non-empty array being searched.\n * @param aCompare Function which takes two elements and returns -1, 0, or 1.\n * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or\n * 'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the\n * closest element that is smaller than or greater than the one we are\n * searching for, respectively, if the exact element cannot be found.\n */\n function recursiveSearch(\n aLow,\n aHigh,\n aNeedle,\n aHaystack,\n aCompare,\n aBias\n ) {\n // This function terminates when one of the following is true:\n //\n // 1. We find the exact element we are looking for.\n //\n // 2. We did not find the exact element, but we can return the index of\n // the next-closest element.\n //\n // 3. We did not find the exact element, and there is no next-closest\n // element than the one we are searching for, so we return -1.\n var mid = Math.floor((aHigh - aLow) / 2) + aLow;\n var cmp = aCompare(aNeedle, aHaystack[mid], true);\n if (cmp === 0) {\n // Found the element we are looking for.\n return mid;\n } else if (cmp > 0) {\n // Our needle is greater than aHaystack[mid].\n if (aHigh - mid > 1) {\n // The element is in the upper half.\n return recursiveSearch(\n mid,\n aHigh,\n aNeedle,\n aHaystack,\n aCompare,\n aBias\n );\n }\n\n // The exact needle element was not found in this haystack. Determine if\n // we are in termination case (3) or (2) and return the appropriate thing.\n if (aBias == exports.LEAST_UPPER_BOUND) {\n return aHigh < aHaystack.length ? aHigh : -1;\n } else {\n return mid;\n }\n } else {\n // Our needle is less than aHaystack[mid].\n if (mid - aLow > 1) {\n // The element is in the lower half.\n return recursiveSearch(\n aLow,\n mid,\n aNeedle,\n aHaystack,\n aCompare,\n aBias\n );\n }\n\n // we are in termination case (3) or (2) and return the appropriate thing.\n if (aBias == exports.LEAST_UPPER_BOUND) {\n return mid;\n } else {\n return aLow < 0 ? -1 : aLow;\n }\n }\n }\n\n /**\n * This is an implementation of binary search which will always try and return\n * the index of the closest element if there is no exact hit. This is because\n * mappings between original and generated line/col pairs are single points,\n * and there is an implicit region between each of them, so a miss just means\n * that you aren't on the very start of a region.\n *\n * @param aNeedle The element you are looking for.\n * @param aHaystack The array that is being searched.\n * @param aCompare A function which takes the needle and an element in the\n * array and returns -1, 0, or 1 depending on whether the needle is less\n * than, equal to, or greater than the element, respectively.\n * @param aBias Either 'binarySearch.GREATEST_LOWER_BOUND' or\n * 'binarySearch.LEAST_UPPER_BOUND'. Specifies whether to return the\n * closest element that is smaller than or greater than the one we are\n * searching for, respectively, if the exact element cannot be found.\n * Defaults to 'binarySearch.GREATEST_LOWER_BOUND'.\n */\n exports.search = function search(aNeedle, aHaystack, aCompare, aBias) {\n if (aHaystack.length === 0) {\n return -1;\n }\n\n var index = recursiveSearch(\n -1,\n aHaystack.length,\n aNeedle,\n aHaystack,\n aCompare,\n aBias || exports.GREATEST_LOWER_BOUND\n );\n if (index < 0) {\n return -1;\n }\n\n // We have found either the exact element, or the next-closest element than\n // the one we are searching for. However, there may be more than one such\n // element. Make sure we always return the smallest of these.\n while (index - 1 >= 0) {\n if (aCompare(aHaystack[index], aHaystack[index - 1], true) !== 0) {\n break;\n }\n --index;\n }\n\n return index;\n };\n },\n {}\n ],\n 149: [\n function(require, module, exports) {\n /* -*- Mode: js; js-indent-level: 2; -*- */\n /*\n * Copyright 2014 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\n var util = require(\"./util\");\n\n /**\n * Determine whether mappingB is after mappingA with respect to generated\n * position.\n */\n function generatedPositionAfter(mappingA, mappingB) {\n // Optimized for most common case\n var lineA = mappingA.generatedLine;\n var lineB = mappingB.generatedLine;\n var columnA = mappingA.generatedColumn;\n var columnB = mappingB.generatedColumn;\n return (\n lineB > lineA ||\n (lineB == lineA && columnB >= columnA) ||\n util.compareByGeneratedPositionsInflated(mappingA, mappingB) <= 0\n );\n }\n\n /**\n * A data structure to provide a sorted view of accumulated mappings in a\n * performance conscious manner. It trades a neglibable overhead in general\n * case for a large speedup in case of mappings being added in order.\n */\n function MappingList() {\n this._array = [];\n this._sorted = true;\n // Serves as infimum\n this._last = { generatedLine: -1, generatedColumn: 0 };\n }\n\n /**\n * Iterate through internal items. This method takes the same arguments that\n * `Array.prototype.forEach` takes.\n *\n * NOTE: The order of the mappings is NOT guaranteed.\n */\n MappingList.prototype.unsortedForEach = function MappingList_forEach(\n aCallback,\n aThisArg\n ) {\n this._array.forEach(aCallback, aThisArg);\n };\n\n /**\n * Add the given source mapping.\n *\n * @param Object aMapping\n */\n MappingList.prototype.add = function MappingList_add(aMapping) {\n if (generatedPositionAfter(this._last, aMapping)) {\n this._last = aMapping;\n this._array.push(aMapping);\n } else {\n this._sorted = false;\n this._array.push(aMapping);\n }\n };\n\n /**\n * Returns the flat, sorted array of mappings. The mappings are sorted by\n * generated position.\n *\n * WARNING: This method returns internal data without copying, for\n * performance. The return value must NOT be mutated, and should be treated as\n * an immutable borrow. If you want to take ownership, you must make your own\n * copy.\n */\n MappingList.prototype.toArray = function MappingList_toArray() {\n if (!this._sorted) {\n this._array.sort(util.compareByGeneratedPositionsInflated);\n this._sorted = true;\n }\n return this._array;\n };\n\n exports.MappingList = MappingList;\n },\n { \"./util\": 154 }\n ],\n 150: [\n function(require, module, exports) {\n /* -*- Mode: js; js-indent-level: 2; -*- */\n /*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\n // It turns out that some (most?) JavaScript engines don't self-host\n // `Array.prototype.sort`. This makes sense because C++ will likely remain\n // faster than JS when doing raw CPU-intensive sorting. However, when using a\n // custom comparator function, calling back and forth between the VM's C++ and\n // JIT'd JS is rather slow *and* loses JIT type information, resulting in\n // worse generated code for the comparator function than would be optimal. In\n // fact, when sorting with a comparator, these costs outweigh the benefits of\n // sorting in C++. By using our own JS-implemented Quick Sort (below), we get\n // a ~3500ms mean speed-up in `bench/bench.html`.\n\n /**\n * Swap the elements indexed by `x` and `y` in the array `ary`.\n *\n * @param {Array} ary\n * The array.\n * @param {Number} x\n * The index of the first item.\n * @param {Number} y\n * The index of the second item.\n */\n function swap(ary, x, y) {\n var temp = ary[x];\n ary[x] = ary[y];\n ary[y] = temp;\n }\n\n /**\n * Returns a random integer within the range `low .. high` inclusive.\n *\n * @param {Number} low\n * The lower bound on the range.\n * @param {Number} high\n * The upper bound on the range.\n */\n function randomIntInRange(low, high) {\n return Math.round(low + Math.random() * (high - low));\n }\n\n /**\n * The Quick Sort algorithm.\n *\n * @param {Array} ary\n * An array to sort.\n * @param {function} comparator\n * Function to use to compare two items.\n * @param {Number} p\n * Start index of the array\n * @param {Number} r\n * End index of the array\n */\n function doQuickSort(ary, comparator, p, r) {\n // If our lower bound is less than our upper bound, we (1) partition the\n // array into two pieces and (2) recurse on each half. If it is not, this is\n // the empty array and our base case.\n\n if (p < r) {\n // (1) Partitioning.\n //\n // The partitioning chooses a pivot between `p` and `r` and moves all\n // elements that are less than or equal to the pivot to the before it, and\n // all the elements that are greater than it after it. The effect is that\n // once partition is done, the pivot is in the exact place it will be when\n // the array is put in sorted order, and it will not need to be moved\n // again. This runs in O(n) time.\n\n // Always choose a random pivot so that an input array which is reverse\n // sorted does not cause O(n^2) running time.\n var pivotIndex = randomIntInRange(p, r);\n var i = p - 1;\n\n swap(ary, pivotIndex, r);\n var pivot = ary[r];\n\n // Immediately after `j` is incremented in this loop, the following hold\n // true:\n //\n // * Every element in `ary[p .. i]` is less than or equal to the pivot.\n //\n // * Every element in `ary[i+1 .. j-1]` is greater than the pivot.\n for (var j = p; j < r; j++) {\n if (comparator(ary[j], pivot) <= 0) {\n i += 1;\n swap(ary, i, j);\n }\n }\n\n swap(ary, i + 1, j);\n var q = i + 1;\n\n // (2) Recurse on each half.\n\n doQuickSort(ary, comparator, p, q - 1);\n doQuickSort(ary, comparator, q + 1, r);\n }\n }\n\n /**\n * Sort the given array in-place with the given comparator function.\n *\n * @param {Array} ary\n * An array to sort.\n * @param {function} comparator\n * Function to use to compare two items.\n */\n exports.quickSort = function(ary, comparator) {\n doQuickSort(ary, comparator, 0, ary.length - 1);\n };\n },\n {}\n ],\n 151: [\n function(require, module, exports) {\n /* -*- Mode: js; js-indent-level: 2; -*- */\n /*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\n var util = require(\"./util\");\n var binarySearch = require(\"./binary-search\");\n var ArraySet = require(\"./array-set\").ArraySet;\n var base64VLQ = require(\"./base64-vlq\");\n var quickSort = require(\"./quick-sort\").quickSort;\n\n function SourceMapConsumer(aSourceMap, aSourceMapURL) {\n var sourceMap = aSourceMap;\n if (typeof aSourceMap === \"string\") {\n sourceMap = util.parseSourceMapInput(aSourceMap);\n }\n\n return sourceMap.sections != null\n ? new IndexedSourceMapConsumer(sourceMap, aSourceMapURL)\n : new BasicSourceMapConsumer(sourceMap, aSourceMapURL);\n }\n\n SourceMapConsumer.fromSourceMap = function(aSourceMap, aSourceMapURL) {\n return BasicSourceMapConsumer.fromSourceMap(\n aSourceMap,\n aSourceMapURL\n );\n };\n\n /**\n * The version of the source mapping spec that we are consuming.\n */\n SourceMapConsumer.prototype._version = 3;\n\n // `__generatedMappings` and `__originalMappings` are arrays that hold the\n // parsed mapping coordinates from the source map's \"mappings\" attribute. They\n // are lazily instantiated, accessed via the `_generatedMappings` and\n // `_originalMappings` getters respectively, and we only parse the mappings\n // and create these arrays once queried for a source location. We jump through\n // these hoops because there can be many thousands of mappings, and parsing\n // them is expensive, so we only want to do it if we must.\n //\n // Each object in the arrays is of the form:\n //\n // {\n // generatedLine: The line number in the generated code,\n // generatedColumn: The column number in the generated code,\n // source: The path to the original source file that generated this\n // chunk of code,\n // originalLine: The line number in the original source that\n // corresponds to this chunk of generated code,\n // originalColumn: The column number in the original source that\n // corresponds to this chunk of generated code,\n // name: The name of the original symbol which generated this chunk of\n // code.\n // }\n //\n // All properties except for `generatedLine` and `generatedColumn` can be\n // `null`.\n //\n // `_generatedMappings` is ordered by the generated positions.\n //\n // `_originalMappings` is ordered by the original positions.\n\n SourceMapConsumer.prototype.__generatedMappings = null;\n Object.defineProperty(\n SourceMapConsumer.prototype,\n \"_generatedMappings\",\n {\n configurable: true,\n enumerable: true,\n get: function() {\n if (!this.__generatedMappings) {\n this._parseMappings(this._mappings, this.sourceRoot);\n }\n\n return this.__generatedMappings;\n }\n }\n );\n\n SourceMapConsumer.prototype.__originalMappings = null;\n Object.defineProperty(\n SourceMapConsumer.prototype,\n \"_originalMappings\",\n {\n configurable: true,\n enumerable: true,\n get: function() {\n if (!this.__originalMappings) {\n this._parseMappings(this._mappings, this.sourceRoot);\n }\n\n return this.__originalMappings;\n }\n }\n );\n\n SourceMapConsumer.prototype._charIsMappingSeparator = function SourceMapConsumer_charIsMappingSeparator(\n aStr,\n index\n ) {\n var c = aStr.charAt(index);\n return c === \";\" || c === \",\";\n };\n\n /**\n * Parse the mappings in a string in to a data structure which we can easily\n * query (the ordered arrays in the `this.__generatedMappings` and\n * `this.__originalMappings` properties).\n */\n SourceMapConsumer.prototype._parseMappings = function SourceMapConsumer_parseMappings(\n aStr,\n aSourceRoot\n ) {\n throw new Error(\"Subclasses must implement _parseMappings\");\n };\n\n SourceMapConsumer.GENERATED_ORDER = 1;\n SourceMapConsumer.ORIGINAL_ORDER = 2;\n\n SourceMapConsumer.GREATEST_LOWER_BOUND = 1;\n SourceMapConsumer.LEAST_UPPER_BOUND = 2;\n\n /**\n * Iterate over each mapping between an original source/line/column and a\n * generated line/column in this source map.\n *\n * @param Function aCallback\n * The function that is called with each mapping.\n * @param Object aContext\n * Optional. If specified, this object will be the value of `this` every\n * time that `aCallback` is called.\n * @param aOrder\n * Either `SourceMapConsumer.GENERATED_ORDER` or\n * `SourceMapConsumer.ORIGINAL_ORDER`. Specifies whether you want to\n * iterate over the mappings sorted by the generated file's line/column\n * order or the original's source/line/column order, respectively. Defaults to\n * `SourceMapConsumer.GENERATED_ORDER`.\n */\n SourceMapConsumer.prototype.eachMapping = function SourceMapConsumer_eachMapping(\n aCallback,\n aContext,\n aOrder\n ) {\n var context = aContext || null;\n var order = aOrder || SourceMapConsumer.GENERATED_ORDER;\n\n var mappings;\n switch (order) {\n case SourceMapConsumer.GENERATED_ORDER:\n mappings = this._generatedMappings;\n break;\n case SourceMapConsumer.ORIGINAL_ORDER:\n mappings = this._originalMappings;\n break;\n default:\n throw new Error(\"Unknown order of iteration.\");\n }\n\n var sourceRoot = this.sourceRoot;\n mappings\n .map(function(mapping) {\n var source =\n mapping.source === null\n ? null\n : this._sources.at(mapping.source);\n source = util.computeSourceURL(\n sourceRoot,\n source,\n this._sourceMapURL\n );\n return {\n source: source,\n generatedLine: mapping.generatedLine,\n generatedColumn: mapping.generatedColumn,\n originalLine: mapping.originalLine,\n originalColumn: mapping.originalColumn,\n name:\n mapping.name === null ? null : this._names.at(mapping.name)\n };\n }, this)\n .forEach(aCallback, context);\n };\n\n /**\n * Returns all generated line and column information for the original source,\n * line, and column provided. If no column is provided, returns all mappings\n * corresponding to a either the line we are searching for or the next\n * closest line that has any mappings. Otherwise, returns all mappings\n * corresponding to the given line and either the column we are searching for\n * or the next closest column that has any offsets.\n *\n * The only argument is an object with the following properties:\n *\n * - source: The filename of the original source.\n * - line: The line number in the original source. The line number is 1-based.\n * - column: Optional. the column number in the original source.\n * The column number is 0-based.\n *\n * and an array of objects is returned, each with the following properties:\n *\n * - line: The line number in the generated source, or null. The\n * line number is 1-based.\n * - column: The column number in the generated source, or null.\n * The column number is 0-based.\n */\n SourceMapConsumer.prototype.allGeneratedPositionsFor = function SourceMapConsumer_allGeneratedPositionsFor(\n aArgs\n ) {\n var line = util.getArg(aArgs, \"line\");\n\n // When there is no exact match, BasicSourceMapConsumer.prototype._findMapping\n // returns the index of the closest mapping less than the needle. By\n // setting needle.originalColumn to 0, we thus find the last mapping for\n // the given line, provided such a mapping exists.\n var needle = {\n source: util.getArg(aArgs, \"source\"),\n originalLine: line,\n originalColumn: util.getArg(aArgs, \"column\", 0)\n };\n\n needle.source = this._findSourceIndex(needle.source);\n if (needle.source < 0) {\n return [];\n }\n\n var mappings = [];\n\n var index = this._findMapping(\n needle,\n this._originalMappings,\n \"originalLine\",\n \"originalColumn\",\n util.compareByOriginalPositions,\n binarySearch.LEAST_UPPER_BOUND\n );\n if (index >= 0) {\n var mapping = this._originalMappings[index];\n\n if (aArgs.column === undefined) {\n var originalLine = mapping.originalLine;\n\n // Iterate until either we run out of mappings, or we run into\n // a mapping for a different line than the one we found. Since\n // mappings are sorted, this is guaranteed to find all mappings for\n // the line we found.\n while (mapping && mapping.originalLine === originalLine) {\n mappings.push({\n line: util.getArg(mapping, \"generatedLine\", null),\n column: util.getArg(mapping, \"generatedColumn\", null),\n lastColumn: util.getArg(mapping, \"lastGeneratedColumn\", null)\n });\n\n mapping = this._originalMappings[++index];\n }\n } else {\n var originalColumn = mapping.originalColumn;\n\n // Iterate until either we run out of mappings, or we run into\n // a mapping for a different line than the one we were searching for.\n // Since mappings are sorted, this is guaranteed to find all mappings for\n // the line we are searching for.\n while (\n mapping &&\n mapping.originalLine === line &&\n mapping.originalColumn == originalColumn\n ) {\n mappings.push({\n line: util.getArg(mapping, \"generatedLine\", null),\n column: util.getArg(mapping, \"generatedColumn\", null),\n lastColumn: util.getArg(mapping, \"lastGeneratedColumn\", null)\n });\n\n mapping = this._originalMappings[++index];\n }\n }\n }\n\n return mappings;\n };\n\n exports.SourceMapConsumer = SourceMapConsumer;\n\n /**\n * A BasicSourceMapConsumer instance represents a parsed source map which we can\n * query for information about the original file positions by giving it a file\n * position in the generated source.\n *\n * The first parameter is the raw source map (either as a JSON string, or\n * already parsed to an object). According to the spec, source maps have the\n * following attributes:\n *\n * - version: Which version of the source map spec this map is following.\n * - sources: An array of URLs to the original source files.\n * - names: An array of identifiers which can be referrenced by individual mappings.\n * - sourceRoot: Optional. The URL root from which all sources are relative.\n * - sourcesContent: Optional. An array of contents of the original source files.\n * - mappings: A string of base64 VLQs which contain the actual mappings.\n * - file: Optional. The generated file this source map is associated with.\n *\n * Here is an example source map, taken from the source map spec[0]:\n *\n * {\n * version : 3,\n * file: \"out.js\",\n * sourceRoot : \"\",\n * sources: [\"foo.js\", \"bar.js\"],\n * names: [\"src\", \"maps\", \"are\", \"fun\"],\n * mappings: \"AA,AB;;ABCDE;\"\n * }\n *\n * The second parameter, if given, is a string whose value is the URL\n * at which the source map was found. This URL is used to compute the\n * sources array.\n *\n * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit?pli=1#\n */\n function BasicSourceMapConsumer(aSourceMap, aSourceMapURL) {\n var sourceMap = aSourceMap;\n if (typeof aSourceMap === \"string\") {\n sourceMap = util.parseSourceMapInput(aSourceMap);\n }\n\n var version = util.getArg(sourceMap, \"version\");\n var sources = util.getArg(sourceMap, \"sources\");\n // Sass 3.3 leaves out the 'names' array, so we deviate from the spec (which\n // requires the array) to play nice here.\n var names = util.getArg(sourceMap, \"names\", []);\n var sourceRoot = util.getArg(sourceMap, \"sourceRoot\", null);\n var sourcesContent = util.getArg(sourceMap, \"sourcesContent\", null);\n var mappings = util.getArg(sourceMap, \"mappings\");\n var file = util.getArg(sourceMap, \"file\", null);\n\n // Once again, Sass deviates from the spec and supplies the version as a\n // string rather than a number, so we use loose equality checking here.\n if (version != this._version) {\n throw new Error(\"Unsupported version: \" + version);\n }\n\n if (sourceRoot) {\n sourceRoot = util.normalize(sourceRoot);\n }\n\n sources = sources\n .map(String)\n // Some source maps produce relative source paths like \"./foo.js\" instead of\n // \"foo.js\". Normalize these first so that future comparisons will succeed.\n // See bugzil.la/1090768.\n .map(util.normalize)\n // Always ensure that absolute sources are internally stored relative to\n // the source root, if the source root is absolute. Not doing this would\n // be particularly problematic when the source root is a prefix of the\n // source (valid, but why??). See github issue #199 and bugzil.la/1188982.\n .map(function(source) {\n return sourceRoot &&\n util.isAbsolute(sourceRoot) &&\n util.isAbsolute(source)\n ? util.relative(sourceRoot, source)\n : source;\n });\n\n // Pass `true` below to allow duplicate names and sources. While source maps\n // are intended to be compressed and deduplicated, the TypeScript compiler\n // sometimes generates source maps with duplicates in them. See Github issue\n // #72 and bugzil.la/889492.\n this._names = ArraySet.fromArray(names.map(String), true);\n this._sources = ArraySet.fromArray(sources, true);\n\n this._absoluteSources = this._sources.toArray().map(function(s) {\n return util.computeSourceURL(sourceRoot, s, aSourceMapURL);\n });\n\n this.sourceRoot = sourceRoot;\n this.sourcesContent = sourcesContent;\n this._mappings = mappings;\n this._sourceMapURL = aSourceMapURL;\n this.file = file;\n }\n\n BasicSourceMapConsumer.prototype = Object.create(\n SourceMapConsumer.prototype\n );\n BasicSourceMapConsumer.prototype.consumer = SourceMapConsumer;\n\n /**\n * Utility function to find the index of a source. Returns -1 if not\n * found.\n */\n BasicSourceMapConsumer.prototype._findSourceIndex = function(aSource) {\n var relativeSource = aSource;\n if (this.sourceRoot != null) {\n relativeSource = util.relative(this.sourceRoot, relativeSource);\n }\n\n if (this._sources.has(relativeSource)) {\n return this._sources.indexOf(relativeSource);\n }\n\n // Maybe aSource is an absolute URL as returned by |sources|. In\n // this case we can't simply undo the transform.\n var i;\n for (i = 0; i < this._absoluteSources.length; ++i) {\n if (this._absoluteSources[i] == aSource) {\n return i;\n }\n }\n\n return -1;\n };\n\n /**\n * Create a BasicSourceMapConsumer from a SourceMapGenerator.\n *\n * @param SourceMapGenerator aSourceMap\n * The source map that will be consumed.\n * @param String aSourceMapURL\n * The URL at which the source map can be found (optional)\n * @returns BasicSourceMapConsumer\n */\n BasicSourceMapConsumer.fromSourceMap = function SourceMapConsumer_fromSourceMap(\n aSourceMap,\n aSourceMapURL\n ) {\n var smc = Object.create(BasicSourceMapConsumer.prototype);\n\n var names = (smc._names = ArraySet.fromArray(\n aSourceMap._names.toArray(),\n true\n ));\n var sources = (smc._sources = ArraySet.fromArray(\n aSourceMap._sources.toArray(),\n true\n ));\n smc.sourceRoot = aSourceMap._sourceRoot;\n smc.sourcesContent = aSourceMap._generateSourcesContent(\n smc._sources.toArray(),\n smc.sourceRoot\n );\n smc.file = aSourceMap._file;\n smc._sourceMapURL = aSourceMapURL;\n smc._absoluteSources = smc._sources.toArray().map(function(s) {\n return util.computeSourceURL(smc.sourceRoot, s, aSourceMapURL);\n });\n\n // Because we are modifying the entries (by converting string sources and\n // names to indices into the sources and names ArraySets), we have to make\n // a copy of the entry or else bad things happen. Shared mutable state\n // strikes again! See github issue #191.\n\n var generatedMappings = aSourceMap._mappings.toArray().slice();\n var destGeneratedMappings = (smc.__generatedMappings = []);\n var destOriginalMappings = (smc.__originalMappings = []);\n\n for (var i = 0, length = generatedMappings.length; i < length; i++) {\n var srcMapping = generatedMappings[i];\n var destMapping = new Mapping();\n destMapping.generatedLine = srcMapping.generatedLine;\n destMapping.generatedColumn = srcMapping.generatedColumn;\n\n if (srcMapping.source) {\n destMapping.source = sources.indexOf(srcMapping.source);\n destMapping.originalLine = srcMapping.originalLine;\n destMapping.originalColumn = srcMapping.originalColumn;\n\n if (srcMapping.name) {\n destMapping.name = names.indexOf(srcMapping.name);\n }\n\n destOriginalMappings.push(destMapping);\n }\n\n destGeneratedMappings.push(destMapping);\n }\n\n quickSort(smc.__originalMappings, util.compareByOriginalPositions);\n\n return smc;\n };\n\n /**\n * The version of the source mapping spec that we are consuming.\n */\n BasicSourceMapConsumer.prototype._version = 3;\n\n /**\n * The list of original sources.\n */\n Object.defineProperty(BasicSourceMapConsumer.prototype, \"sources\", {\n get: function() {\n return this._absoluteSources.slice();\n }\n });\n\n /**\n * Provide the JIT with a nice shape / hidden class.\n */\n function Mapping() {\n this.generatedLine = 0;\n this.generatedColumn = 0;\n this.source = null;\n this.originalLine = null;\n this.originalColumn = null;\n this.name = null;\n }\n\n /**\n * Parse the mappings in a string in to a data structure which we can easily\n * query (the ordered arrays in the `this.__generatedMappings` and\n * `this.__originalMappings` properties).\n */\n BasicSourceMapConsumer.prototype._parseMappings = function SourceMapConsumer_parseMappings(\n aStr,\n aSourceRoot\n ) {\n var generatedLine = 1;\n var previousGeneratedColumn = 0;\n var previousOriginalLine = 0;\n var previousOriginalColumn = 0;\n var previousSource = 0;\n var previousName = 0;\n var length = aStr.length;\n var index = 0;\n var cachedSegments = {};\n var temp = {};\n var originalMappings = [];\n var generatedMappings = [];\n var mapping, str, segment, end, value;\n\n while (index < length) {\n if (aStr.charAt(index) === \";\") {\n generatedLine++;\n index++;\n previousGeneratedColumn = 0;\n } else if (aStr.charAt(index) === \",\") {\n index++;\n } else {\n mapping = new Mapping();\n mapping.generatedLine = generatedLine;\n\n // Because each offset is encoded relative to the previous one,\n // many segments often have the same encoding. We can exploit this\n // fact by caching the parsed variable length fields of each segment,\n // allowing us to avoid a second parse if we encounter the same\n // segment again.\n for (end = index; end < length; end++) {\n if (this._charIsMappingSeparator(aStr, end)) {\n break;\n }\n }\n str = aStr.slice(index, end);\n\n segment = cachedSegments[str];\n if (segment) {\n index += str.length;\n } else {\n segment = [];\n while (index < end) {\n base64VLQ.decode(aStr, index, temp);\n value = temp.value;\n index = temp.rest;\n segment.push(value);\n }\n\n if (segment.length === 2) {\n throw new Error(\"Found a source, but no line and column\");\n }\n\n if (segment.length === 3) {\n throw new Error(\"Found a source and line, but no column\");\n }\n\n cachedSegments[str] = segment;\n }\n\n // Generated column.\n mapping.generatedColumn = previousGeneratedColumn + segment[0];\n previousGeneratedColumn = mapping.generatedColumn;\n\n if (segment.length > 1) {\n // Original source.\n mapping.source = previousSource + segment[1];\n previousSource += segment[1];\n\n // Original line.\n mapping.originalLine = previousOriginalLine + segment[2];\n previousOriginalLine = mapping.originalLine;\n // Lines are stored 0-based\n mapping.originalLine += 1;\n\n // Original column.\n mapping.originalColumn = previousOriginalColumn + segment[3];\n previousOriginalColumn = mapping.originalColumn;\n\n if (segment.length > 4) {\n // Original name.\n mapping.name = previousName + segment[4];\n previousName += segment[4];\n }\n }\n\n generatedMappings.push(mapping);\n if (typeof mapping.originalLine === \"number\") {\n originalMappings.push(mapping);\n }\n }\n }\n\n quickSort(\n generatedMappings,\n util.compareByGeneratedPositionsDeflated\n );\n this.__generatedMappings = generatedMappings;\n\n quickSort(originalMappings, util.compareByOriginalPositions);\n this.__originalMappings = originalMappings;\n };\n\n /**\n * Find the mapping that best matches the hypothetical \"needle\" mapping that\n * we are searching for in the given \"haystack\" of mappings.\n */\n BasicSourceMapConsumer.prototype._findMapping = function SourceMapConsumer_findMapping(\n aNeedle,\n aMappings,\n aLineName,\n aColumnName,\n aComparator,\n aBias\n ) {\n // To return the position we are searching for, we must first find the\n // mapping for the given position and then return the opposite position it\n // points to. Because the mappings are sorted, we can use binary search to\n // find the best mapping.\n\n if (aNeedle[aLineName] <= 0) {\n throw new TypeError(\n \"Line must be greater than or equal to 1, got \" +\n aNeedle[aLineName]\n );\n }\n if (aNeedle[aColumnName] < 0) {\n throw new TypeError(\n \"Column must be greater than or equal to 0, got \" +\n aNeedle[aColumnName]\n );\n }\n\n return binarySearch.search(aNeedle, aMappings, aComparator, aBias);\n };\n\n /**\n * Compute the last column for each generated mapping. The last column is\n * inclusive.\n */\n BasicSourceMapConsumer.prototype.computeColumnSpans = function SourceMapConsumer_computeColumnSpans() {\n for (var index = 0; index < this._generatedMappings.length; ++index) {\n var mapping = this._generatedMappings[index];\n\n // Mappings do not contain a field for the last generated columnt. We\n // can come up with an optimistic estimate, however, by assuming that\n // mappings are contiguous (i.e. given two consecutive mappings, the\n // first mapping ends where the second one starts).\n if (index + 1 < this._generatedMappings.length) {\n var nextMapping = this._generatedMappings[index + 1];\n\n if (mapping.generatedLine === nextMapping.generatedLine) {\n mapping.lastGeneratedColumn = nextMapping.generatedColumn - 1;\n continue;\n }\n }\n\n // The last mapping for each line spans the entire line.\n mapping.lastGeneratedColumn = Infinity;\n }\n };\n\n /**\n * Returns the original source, line, and column information for the generated\n * source's line and column positions provided. The only argument is an object\n * with the following properties:\n *\n * - line: The line number in the generated source. The line number\n * is 1-based.\n * - column: The column number in the generated source. The column\n * number is 0-based.\n * - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or\n * 'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the\n * closest element that is smaller than or greater than the one we are\n * searching for, respectively, if the exact element cannot be found.\n * Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.\n *\n * and an object is returned with the following properties:\n *\n * - source: The original source file, or null.\n * - line: The line number in the original source, or null. The\n * line number is 1-based.\n * - column: The column number in the original source, or null. The\n * column number is 0-based.\n * - name: The original identifier, or null.\n */\n BasicSourceMapConsumer.prototype.originalPositionFor = function SourceMapConsumer_originalPositionFor(\n aArgs\n ) {\n var needle = {\n generatedLine: util.getArg(aArgs, \"line\"),\n generatedColumn: util.getArg(aArgs, \"column\")\n };\n\n var index = this._findMapping(\n needle,\n this._generatedMappings,\n \"generatedLine\",\n \"generatedColumn\",\n util.compareByGeneratedPositionsDeflated,\n util.getArg(aArgs, \"bias\", SourceMapConsumer.GREATEST_LOWER_BOUND)\n );\n\n if (index >= 0) {\n var mapping = this._generatedMappings[index];\n\n if (mapping.generatedLine === needle.generatedLine) {\n var source = util.getArg(mapping, \"source\", null);\n if (source !== null) {\n source = this._sources.at(source);\n source = util.computeSourceURL(\n this.sourceRoot,\n source,\n this._sourceMapURL\n );\n }\n var name = util.getArg(mapping, \"name\", null);\n if (name !== null) {\n name = this._names.at(name);\n }\n return {\n source: source,\n line: util.getArg(mapping, \"originalLine\", null),\n column: util.getArg(mapping, \"originalColumn\", null),\n name: name\n };\n }\n }\n\n return {\n source: null,\n line: null,\n column: null,\n name: null\n };\n };\n\n /**\n * Return true if we have the source content for every source in the source\n * map, false otherwise.\n */\n BasicSourceMapConsumer.prototype.hasContentsOfAllSources = function BasicSourceMapConsumer_hasContentsOfAllSources() {\n if (!this.sourcesContent) {\n return false;\n }\n return (\n this.sourcesContent.length >= this._sources.size() &&\n !this.sourcesContent.some(function(sc) {\n return sc == null;\n })\n );\n };\n\n /**\n * Returns the original source content. The only argument is the url of the\n * original source file. Returns null if no original source content is\n * available.\n */\n BasicSourceMapConsumer.prototype.sourceContentFor = function SourceMapConsumer_sourceContentFor(\n aSource,\n nullOnMissing\n ) {\n if (!this.sourcesContent) {\n return null;\n }\n\n var index = this._findSourceIndex(aSource);\n if (index >= 0) {\n return this.sourcesContent[index];\n }\n\n var relativeSource = aSource;\n if (this.sourceRoot != null) {\n relativeSource = util.relative(this.sourceRoot, relativeSource);\n }\n\n var url;\n if (\n this.sourceRoot != null &&\n (url = util.urlParse(this.sourceRoot))\n ) {\n // XXX: file:// URIs and absolute paths lead to unexpected behavior for\n // many users. We can help them out when they expect file:// URIs to\n // behave like it would if they were running a local HTTP server. See\n // https://bugzilla.mozilla.org/show_bug.cgi?id=885597.\n var fileUriAbsPath = relativeSource.replace(/^file:\\/\\//, \"\");\n if (url.scheme == \"file\" && this._sources.has(fileUriAbsPath)) {\n return this.sourcesContent[this._sources.indexOf(fileUriAbsPath)];\n }\n\n if (\n (!url.path || url.path == \"/\") &&\n this._sources.has(\"/\" + relativeSource)\n ) {\n return this.sourcesContent[\n this._sources.indexOf(\"/\" + relativeSource)\n ];\n }\n }\n\n // This function is used recursively from\n // IndexedSourceMapConsumer.prototype.sourceContentFor. In that case, we\n // don't want to throw if we can't find the source - we just want to\n // return null, so we provide a flag to exit gracefully.\n if (nullOnMissing) {\n return null;\n } else {\n throw new Error(\n '\"' + relativeSource + '\" is not in the SourceMap.'\n );\n }\n };\n\n /**\n * Returns the generated line and column information for the original source,\n * line, and column positions provided. The only argument is an object with\n * the following properties:\n *\n * - source: The filename of the original source.\n * - line: The line number in the original source. The line number\n * is 1-based.\n * - column: The column number in the original source. The column\n * number is 0-based.\n * - bias: Either 'SourceMapConsumer.GREATEST_LOWER_BOUND' or\n * 'SourceMapConsumer.LEAST_UPPER_BOUND'. Specifies whether to return the\n * closest element that is smaller than or greater than the one we are\n * searching for, respectively, if the exact element cannot be found.\n * Defaults to 'SourceMapConsumer.GREATEST_LOWER_BOUND'.\n *\n * and an object is returned with the following properties:\n *\n * - line: The line number in the generated source, or null. The\n * line number is 1-based.\n * - column: The column number in the generated source, or null.\n * The column number is 0-based.\n */\n BasicSourceMapConsumer.prototype.generatedPositionFor = function SourceMapConsumer_generatedPositionFor(\n aArgs\n ) {\n var source = util.getArg(aArgs, \"source\");\n source = this._findSourceIndex(source);\n if (source < 0) {\n return {\n line: null,\n column: null,\n lastColumn: null\n };\n }\n\n var needle = {\n source: source,\n originalLine: util.getArg(aArgs, \"line\"),\n originalColumn: util.getArg(aArgs, \"column\")\n };\n\n var index = this._findMapping(\n needle,\n this._originalMappings,\n \"originalLine\",\n \"originalColumn\",\n util.compareByOriginalPositions,\n util.getArg(aArgs, \"bias\", SourceMapConsumer.GREATEST_LOWER_BOUND)\n );\n\n if (index >= 0) {\n var mapping = this._originalMappings[index];\n\n if (mapping.source === needle.source) {\n return {\n line: util.getArg(mapping, \"generatedLine\", null),\n column: util.getArg(mapping, \"generatedColumn\", null),\n lastColumn: util.getArg(mapping, \"lastGeneratedColumn\", null)\n };\n }\n }\n\n return {\n line: null,\n column: null,\n lastColumn: null\n };\n };\n\n exports.BasicSourceMapConsumer = BasicSourceMapConsumer;\n\n /**\n * An IndexedSourceMapConsumer instance represents a parsed source map which\n * we can query for information. It differs from BasicSourceMapConsumer in\n * that it takes \"indexed\" source maps (i.e. ones with a \"sections\" field) as\n * input.\n *\n * The first parameter is a raw source map (either as a JSON string, or already\n * parsed to an object). According to the spec for indexed source maps, they\n * have the following attributes:\n *\n * - version: Which version of the source map spec this map is following.\n * - file: Optional. The generated file this source map is associated with.\n * - sections: A list of section definitions.\n *\n * Each value under the \"sections\" field has two fields:\n * - offset: The offset into the original specified at which this section\n * begins to apply, defined as an object with a \"line\" and \"column\"\n * field.\n * - map: A source map definition. This source map could also be indexed,\n * but doesn't have to be.\n *\n * Instead of the \"map\" field, it's also possible to have a \"url\" field\n * specifying a URL to retrieve a source map from, but that's currently\n * unsupported.\n *\n * Here's an example source map, taken from the source map spec[0], but\n * modified to omit a section which uses the \"url\" field.\n *\n * {\n * version : 3,\n * file: \"app.js\",\n * sections: [{\n * offset: {line:100, column:10},\n * map: {\n * version : 3,\n * file: \"section.js\",\n * sources: [\"foo.js\", \"bar.js\"],\n * names: [\"src\", \"maps\", \"are\", \"fun\"],\n * mappings: \"AAAA,E;;ABCDE;\"\n * }\n * }],\n * }\n *\n * The second parameter, if given, is a string whose value is the URL\n * at which the source map was found. This URL is used to compute the\n * sources array.\n *\n * [0]: https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit#heading=h.535es3xeprgt\n */\n function IndexedSourceMapConsumer(aSourceMap, aSourceMapURL) {\n var sourceMap = aSourceMap;\n if (typeof aSourceMap === \"string\") {\n sourceMap = util.parseSourceMapInput(aSourceMap);\n }\n\n var version = util.getArg(sourceMap, \"version\");\n var sections = util.getArg(sourceMap, \"sections\");\n\n if (version != this._version) {\n throw new Error(\"Unsupported version: \" + version);\n }\n\n this._sources = new ArraySet();\n this._names = new ArraySet();\n\n var lastOffset = {\n line: -1,\n column: 0\n };\n this._sections = sections.map(function(s) {\n if (s.url) {\n // The url field will require support for asynchronicity.\n // See https://github.com/mozilla/source-map/issues/16\n throw new Error(\n \"Support for url field in sections not implemented.\"\n );\n }\n var offset = util.getArg(s, \"offset\");\n var offsetLine = util.getArg(offset, \"line\");\n var offsetColumn = util.getArg(offset, \"column\");\n\n if (\n offsetLine < lastOffset.line ||\n (offsetLine === lastOffset.line &&\n offsetColumn < lastOffset.column)\n ) {\n throw new Error(\n \"Section offsets must be ordered and non-overlapping.\"\n );\n }\n lastOffset = offset;\n\n return {\n generatedOffset: {\n // The offset fields are 0-based, but we use 1-based indices when\n // encoding/decoding from VLQ.\n generatedLine: offsetLine + 1,\n generatedColumn: offsetColumn + 1\n },\n consumer: new SourceMapConsumer(\n util.getArg(s, \"map\"),\n aSourceMapURL\n )\n };\n });\n }\n\n IndexedSourceMapConsumer.prototype = Object.create(\n SourceMapConsumer.prototype\n );\n IndexedSourceMapConsumer.prototype.constructor = SourceMapConsumer;\n\n /**\n * The version of the source mapping spec that we are consuming.\n */\n IndexedSourceMapConsumer.prototype._version = 3;\n\n /**\n * The list of original sources.\n */\n Object.defineProperty(IndexedSourceMapConsumer.prototype, \"sources\", {\n get: function() {\n var sources = [];\n for (var i = 0; i < this._sections.length; i++) {\n for (\n var j = 0;\n j < this._sections[i].consumer.sources.length;\n j++\n ) {\n sources.push(this._sections[i].consumer.sources[j]);\n }\n }\n return sources;\n }\n });\n\n /**\n * Returns the original source, line, and column information for the generated\n * source's line and column positions provided. The only argument is an object\n * with the following properties:\n *\n * - line: The line number in the generated source. The line number\n * is 1-based.\n * - column: The column number in the generated source. The column\n * number is 0-based.\n *\n * and an object is returned with the following properties:\n *\n * - source: The original source file, or null.\n * - line: The line number in the original source, or null. The\n * line number is 1-based.\n * - column: The column number in the original source, or null. The\n * column number is 0-based.\n * - name: The original identifier, or null.\n */\n IndexedSourceMapConsumer.prototype.originalPositionFor = function IndexedSourceMapConsumer_originalPositionFor(\n aArgs\n ) {\n var needle = {\n generatedLine: util.getArg(aArgs, \"line\"),\n generatedColumn: util.getArg(aArgs, \"column\")\n };\n\n // Find the section containing the generated position we're trying to map\n // to an original position.\n var sectionIndex = binarySearch.search(\n needle,\n this._sections,\n function(needle, section) {\n var cmp =\n needle.generatedLine - section.generatedOffset.generatedLine;\n if (cmp) {\n return cmp;\n }\n\n return (\n needle.generatedColumn - section.generatedOffset.generatedColumn\n );\n }\n );\n var section = this._sections[sectionIndex];\n\n if (!section) {\n return {\n source: null,\n line: null,\n column: null,\n name: null\n };\n }\n\n return section.consumer.originalPositionFor({\n line:\n needle.generatedLine -\n (section.generatedOffset.generatedLine - 1),\n column:\n needle.generatedColumn -\n (section.generatedOffset.generatedLine === needle.generatedLine\n ? section.generatedOffset.generatedColumn - 1\n : 0),\n bias: aArgs.bias\n });\n };\n\n /**\n * Return true if we have the source content for every source in the source\n * map, false otherwise.\n */\n IndexedSourceMapConsumer.prototype.hasContentsOfAllSources = function IndexedSourceMapConsumer_hasContentsOfAllSources() {\n return this._sections.every(function(s) {\n return s.consumer.hasContentsOfAllSources();\n });\n };\n\n /**\n * Returns the original source content. The only argument is the url of the\n * original source file. Returns null if no original source content is\n * available.\n */\n IndexedSourceMapConsumer.prototype.sourceContentFor = function IndexedSourceMapConsumer_sourceContentFor(\n aSource,\n nullOnMissing\n ) {\n for (var i = 0; i < this._sections.length; i++) {\n var section = this._sections[i];\n\n var content = section.consumer.sourceContentFor(aSource, true);\n if (content) {\n return content;\n }\n }\n if (nullOnMissing) {\n return null;\n } else {\n throw new Error('\"' + aSource + '\" is not in the SourceMap.');\n }\n };\n\n /**\n * Returns the generated line and column information for the original source,\n * line, and column positions provided. The only argument is an object with\n * the following properties:\n *\n * - source: The filename of the original source.\n * - line: The line number in the original source. The line number\n * is 1-based.\n * - column: The column number in the original source. The column\n * number is 0-based.\n *\n * and an object is returned with the following properties:\n *\n * - line: The line number in the generated source, or null. The\n * line number is 1-based.\n * - column: The column number in the generated source, or null.\n * The column number is 0-based.\n */\n IndexedSourceMapConsumer.prototype.generatedPositionFor = function IndexedSourceMapConsumer_generatedPositionFor(\n aArgs\n ) {\n for (var i = 0; i < this._sections.length; i++) {\n var section = this._sections[i];\n\n // Only consider this section if the requested source is in the list of\n // sources of the consumer.\n if (\n section.consumer._findSourceIndex(\n util.getArg(aArgs, \"source\")\n ) === -1\n ) {\n continue;\n }\n var generatedPosition = section.consumer.generatedPositionFor(\n aArgs\n );\n if (generatedPosition) {\n var ret = {\n line:\n generatedPosition.line +\n (section.generatedOffset.generatedLine - 1),\n column:\n generatedPosition.column +\n (section.generatedOffset.generatedLine ===\n generatedPosition.line\n ? section.generatedOffset.generatedColumn - 1\n : 0)\n };\n return ret;\n }\n }\n\n return {\n line: null,\n column: null\n };\n };\n\n /**\n * Parse the mappings in a string in to a data structure which we can easily\n * query (the ordered arrays in the `this.__generatedMappings` and\n * `this.__originalMappings` properties).\n */\n IndexedSourceMapConsumer.prototype._parseMappings = function IndexedSourceMapConsumer_parseMappings(\n aStr,\n aSourceRoot\n ) {\n this.__generatedMappings = [];\n this.__originalMappings = [];\n for (var i = 0; i < this._sections.length; i++) {\n var section = this._sections[i];\n var sectionMappings = section.consumer._generatedMappings;\n for (var j = 0; j < sectionMappings.length; j++) {\n var mapping = sectionMappings[j];\n\n var source = section.consumer._sources.at(mapping.source);\n source = util.computeSourceURL(\n section.consumer.sourceRoot,\n source,\n this._sourceMapURL\n );\n this._sources.add(source);\n source = this._sources.indexOf(source);\n\n var name = null;\n if (mapping.name) {\n name = section.consumer._names.at(mapping.name);\n this._names.add(name);\n name = this._names.indexOf(name);\n }\n\n // The mappings coming from the consumer for the section have\n // generated positions relative to the start of the section, so we\n // need to offset them to be relative to the start of the concatenated\n // generated file.\n var adjustedMapping = {\n source: source,\n generatedLine:\n mapping.generatedLine +\n (section.generatedOffset.generatedLine - 1),\n generatedColumn:\n mapping.generatedColumn +\n (section.generatedOffset.generatedLine ===\n mapping.generatedLine\n ? section.generatedOffset.generatedColumn - 1\n : 0),\n originalLine: mapping.originalLine,\n originalColumn: mapping.originalColumn,\n name: name\n };\n\n this.__generatedMappings.push(adjustedMapping);\n if (typeof adjustedMapping.originalLine === \"number\") {\n this.__originalMappings.push(adjustedMapping);\n }\n }\n }\n\n quickSort(\n this.__generatedMappings,\n util.compareByGeneratedPositionsDeflated\n );\n quickSort(this.__originalMappings, util.compareByOriginalPositions);\n };\n\n exports.IndexedSourceMapConsumer = IndexedSourceMapConsumer;\n },\n {\n \"./array-set\": 145,\n \"./base64-vlq\": 146,\n \"./binary-search\": 148,\n \"./quick-sort\": 150,\n \"./util\": 154\n }\n ],\n 152: [\n function(require, module, exports) {\n /* -*- Mode: js; js-indent-level: 2; -*- */\n /*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\n var base64VLQ = require(\"./base64-vlq\");\n var util = require(\"./util\");\n var ArraySet = require(\"./array-set\").ArraySet;\n var MappingList = require(\"./mapping-list\").MappingList;\n\n /**\n * An instance of the SourceMapGenerator represents a source map which is\n * being built incrementally. You may pass an object with the following\n * properties:\n *\n * - file: The filename of the generated source.\n * - sourceRoot: A root for all relative URLs in this source map.\n */\n function SourceMapGenerator(aArgs) {\n if (!aArgs) {\n aArgs = {};\n }\n this._file = util.getArg(aArgs, \"file\", null);\n this._sourceRoot = util.getArg(aArgs, \"sourceRoot\", null);\n this._skipValidation = util.getArg(aArgs, \"skipValidation\", false);\n this._sources = new ArraySet();\n this._names = new ArraySet();\n this._mappings = new MappingList();\n this._sourcesContents = null;\n }\n\n SourceMapGenerator.prototype._version = 3;\n\n /**\n * Creates a new SourceMapGenerator based on a SourceMapConsumer\n *\n * @param aSourceMapConsumer The SourceMap.\n */\n SourceMapGenerator.fromSourceMap = function SourceMapGenerator_fromSourceMap(\n aSourceMapConsumer\n ) {\n var sourceRoot = aSourceMapConsumer.sourceRoot;\n var generator = new SourceMapGenerator({\n file: aSourceMapConsumer.file,\n sourceRoot: sourceRoot\n });\n aSourceMapConsumer.eachMapping(function(mapping) {\n var newMapping = {\n generated: {\n line: mapping.generatedLine,\n column: mapping.generatedColumn\n }\n };\n\n if (mapping.source != null) {\n newMapping.source = mapping.source;\n if (sourceRoot != null) {\n newMapping.source = util.relative(\n sourceRoot,\n newMapping.source\n );\n }\n\n newMapping.original = {\n line: mapping.originalLine,\n column: mapping.originalColumn\n };\n\n if (mapping.name != null) {\n newMapping.name = mapping.name;\n }\n }\n\n generator.addMapping(newMapping);\n });\n aSourceMapConsumer.sources.forEach(function(sourceFile) {\n var sourceRelative = sourceFile;\n if (sourceRoot !== null) {\n sourceRelative = util.relative(sourceRoot, sourceFile);\n }\n\n if (!generator._sources.has(sourceRelative)) {\n generator._sources.add(sourceRelative);\n }\n\n var content = aSourceMapConsumer.sourceContentFor(sourceFile);\n if (content != null) {\n generator.setSourceContent(sourceFile, content);\n }\n });\n return generator;\n };\n\n /**\n * Add a single mapping from original source line and column to the generated\n * source's line and column for this source map being created. The mapping\n * object should have the following properties:\n *\n * - generated: An object with the generated line and column positions.\n * - original: An object with the original line and column positions.\n * - source: The original source file (relative to the sourceRoot).\n * - name: An optional original token name for this mapping.\n */\n SourceMapGenerator.prototype.addMapping = function SourceMapGenerator_addMapping(\n aArgs\n ) {\n var generated = util.getArg(aArgs, \"generated\");\n var original = util.getArg(aArgs, \"original\", null);\n var source = util.getArg(aArgs, \"source\", null);\n var name = util.getArg(aArgs, \"name\", null);\n\n if (!this._skipValidation) {\n this._validateMapping(generated, original, source, name);\n }\n\n if (source != null) {\n source = String(source);\n if (!this._sources.has(source)) {\n this._sources.add(source);\n }\n }\n\n if (name != null) {\n name = String(name);\n if (!this._names.has(name)) {\n this._names.add(name);\n }\n }\n\n this._mappings.add({\n generatedLine: generated.line,\n generatedColumn: generated.column,\n originalLine: original != null && original.line,\n originalColumn: original != null && original.column,\n source: source,\n name: name\n });\n };\n\n /**\n * Set the source content for a source file.\n */\n SourceMapGenerator.prototype.setSourceContent = function SourceMapGenerator_setSourceContent(\n aSourceFile,\n aSourceContent\n ) {\n var source = aSourceFile;\n if (this._sourceRoot != null) {\n source = util.relative(this._sourceRoot, source);\n }\n\n if (aSourceContent != null) {\n // Add the source content to the _sourcesContents map.\n // Create a new _sourcesContents map if the property is null.\n if (!this._sourcesContents) {\n this._sourcesContents = Object.create(null);\n }\n this._sourcesContents[util.toSetString(source)] = aSourceContent;\n } else if (this._sourcesContents) {\n // Remove the source file from the _sourcesContents map.\n // If the _sourcesContents map is empty, set the property to null.\n delete this._sourcesContents[util.toSetString(source)];\n if (Object.keys(this._sourcesContents).length === 0) {\n this._sourcesContents = null;\n }\n }\n };\n\n /**\n * Applies the mappings of a sub-source-map for a specific source file to the\n * source map being generated. Each mapping to the supplied source file is\n * rewritten using the supplied source map. Note: The resolution for the\n * resulting mappings is the minimium of this map and the supplied map.\n *\n * @param aSourceMapConsumer The source map to be applied.\n * @param aSourceFile Optional. The filename of the source file.\n * If omitted, SourceMapConsumer's file property will be used.\n * @param aSourceMapPath Optional. The dirname of the path to the source map\n * to be applied. If relative, it is relative to the SourceMapConsumer.\n * This parameter is needed when the two source maps aren't in the same\n * directory, and the source map to be applied contains relative source\n * paths. If so, those relative source paths need to be rewritten\n * relative to the SourceMapGenerator.\n */\n SourceMapGenerator.prototype.applySourceMap = function SourceMapGenerator_applySourceMap(\n aSourceMapConsumer,\n aSourceFile,\n aSourceMapPath\n ) {\n var sourceFile = aSourceFile;\n // If aSourceFile is omitted, we will use the file property of the SourceMap\n if (aSourceFile == null) {\n if (aSourceMapConsumer.file == null) {\n throw new Error(\n \"SourceMapGenerator.prototype.applySourceMap requires either an explicit source file, \" +\n 'or the source map\\'s \"file\" property. Both were omitted.'\n );\n }\n sourceFile = aSourceMapConsumer.file;\n }\n var sourceRoot = this._sourceRoot;\n // Make \"sourceFile\" relative if an absolute Url is passed.\n if (sourceRoot != null) {\n sourceFile = util.relative(sourceRoot, sourceFile);\n }\n // Applying the SourceMap can add and remove items from the sources and\n // the names array.\n var newSources = new ArraySet();\n var newNames = new ArraySet();\n\n // Find mappings for the \"sourceFile\"\n this._mappings.unsortedForEach(function(mapping) {\n if (mapping.source === sourceFile && mapping.originalLine != null) {\n // Check if it can be mapped by the source map, then update the mapping.\n var original = aSourceMapConsumer.originalPositionFor({\n line: mapping.originalLine,\n column: mapping.originalColumn\n });\n if (original.source != null) {\n // Copy mapping\n mapping.source = original.source;\n if (aSourceMapPath != null) {\n mapping.source = util.join(aSourceMapPath, mapping.source);\n }\n if (sourceRoot != null) {\n mapping.source = util.relative(sourceRoot, mapping.source);\n }\n mapping.originalLine = original.line;\n mapping.originalColumn = original.column;\n if (original.name != null) {\n mapping.name = original.name;\n }\n }\n }\n\n var source = mapping.source;\n if (source != null && !newSources.has(source)) {\n newSources.add(source);\n }\n\n var name = mapping.name;\n if (name != null && !newNames.has(name)) {\n newNames.add(name);\n }\n }, this);\n this._sources = newSources;\n this._names = newNames;\n\n // Copy sourcesContents of applied map.\n aSourceMapConsumer.sources.forEach(function(sourceFile) {\n var content = aSourceMapConsumer.sourceContentFor(sourceFile);\n if (content != null) {\n if (aSourceMapPath != null) {\n sourceFile = util.join(aSourceMapPath, sourceFile);\n }\n if (sourceRoot != null) {\n sourceFile = util.relative(sourceRoot, sourceFile);\n }\n this.setSourceContent(sourceFile, content);\n }\n }, this);\n };\n\n /**\n * A mapping can have one of the three levels of data:\n *\n * 1. Just the generated position.\n * 2. The Generated position, original position, and original source.\n * 3. Generated and original position, original source, as well as a name\n * token.\n *\n * To maintain consistency, we validate that any new mapping being added falls\n * in to one of these categories.\n */\n SourceMapGenerator.prototype._validateMapping = function SourceMapGenerator_validateMapping(\n aGenerated,\n aOriginal,\n aSource,\n aName\n ) {\n // When aOriginal is truthy but has empty values for .line and .column,\n // it is most likely a programmer error. In this case we throw a very\n // specific error message to try to guide them the right way.\n // For example: https://github.com/Polymer/polymer-bundler/pull/519\n if (\n aOriginal &&\n typeof aOriginal.line !== \"number\" &&\n typeof aOriginal.column !== \"number\"\n ) {\n throw new Error(\n \"original.line and original.column are not numbers -- you probably meant to omit \" +\n \"the original mapping entirely and only map the generated position. If so, pass \" +\n \"null for the original mapping instead of an object with empty or null values.\"\n );\n }\n\n if (\n aGenerated &&\n \"line\" in aGenerated &&\n \"column\" in aGenerated &&\n aGenerated.line > 0 &&\n aGenerated.column >= 0 &&\n !aOriginal &&\n !aSource &&\n !aName\n ) {\n // Case 1.\n return;\n } else if (\n aGenerated &&\n \"line\" in aGenerated &&\n \"column\" in aGenerated &&\n aOriginal &&\n \"line\" in aOriginal &&\n \"column\" in aOriginal &&\n aGenerated.line > 0 &&\n aGenerated.column >= 0 &&\n aOriginal.line > 0 &&\n aOriginal.column >= 0 &&\n aSource\n ) {\n // Cases 2 and 3.\n return;\n } else {\n throw new Error(\n \"Invalid mapping: \" +\n JSON.stringify({\n generated: aGenerated,\n source: aSource,\n original: aOriginal,\n name: aName\n })\n );\n }\n };\n\n /**\n * Serialize the accumulated mappings in to the stream of base 64 VLQs\n * specified by the source map format.\n */\n SourceMapGenerator.prototype._serializeMappings = function SourceMapGenerator_serializeMappings() {\n var previousGeneratedColumn = 0;\n var previousGeneratedLine = 1;\n var previousOriginalColumn = 0;\n var previousOriginalLine = 0;\n var previousName = 0;\n var previousSource = 0;\n var result = \"\";\n var next;\n var mapping;\n var nameIdx;\n var sourceIdx;\n\n var mappings = this._mappings.toArray();\n for (var i = 0, len = mappings.length; i < len; i++) {\n mapping = mappings[i];\n next = \"\";\n\n if (mapping.generatedLine !== previousGeneratedLine) {\n previousGeneratedColumn = 0;\n while (mapping.generatedLine !== previousGeneratedLine) {\n next += \";\";\n previousGeneratedLine++;\n }\n } else {\n if (i > 0) {\n if (\n !util.compareByGeneratedPositionsInflated(\n mapping,\n mappings[i - 1]\n )\n ) {\n continue;\n }\n next += \",\";\n }\n }\n\n next += base64VLQ.encode(\n mapping.generatedColumn - previousGeneratedColumn\n );\n previousGeneratedColumn = mapping.generatedColumn;\n\n if (mapping.source != null) {\n sourceIdx = this._sources.indexOf(mapping.source);\n next += base64VLQ.encode(sourceIdx - previousSource);\n previousSource = sourceIdx;\n\n // lines are stored 0-based in SourceMap spec version 3\n next += base64VLQ.encode(\n mapping.originalLine - 1 - previousOriginalLine\n );\n previousOriginalLine = mapping.originalLine - 1;\n\n next += base64VLQ.encode(\n mapping.originalColumn - previousOriginalColumn\n );\n previousOriginalColumn = mapping.originalColumn;\n\n if (mapping.name != null) {\n nameIdx = this._names.indexOf(mapping.name);\n next += base64VLQ.encode(nameIdx - previousName);\n previousName = nameIdx;\n }\n }\n\n result += next;\n }\n\n return result;\n };\n\n SourceMapGenerator.prototype._generateSourcesContent = function SourceMapGenerator_generateSourcesContent(\n aSources,\n aSourceRoot\n ) {\n return aSources.map(function(source) {\n if (!this._sourcesContents) {\n return null;\n }\n if (aSourceRoot != null) {\n source = util.relative(aSourceRoot, source);\n }\n var key = util.toSetString(source);\n return Object.prototype.hasOwnProperty.call(\n this._sourcesContents,\n key\n )\n ? this._sourcesContents[key]\n : null;\n }, this);\n };\n\n /**\n * Externalize the source map.\n */\n SourceMapGenerator.prototype.toJSON = function SourceMapGenerator_toJSON() {\n var map = {\n version: this._version,\n sources: this._sources.toArray(),\n names: this._names.toArray(),\n mappings: this._serializeMappings()\n };\n if (this._file != null) {\n map.file = this._file;\n }\n if (this._sourceRoot != null) {\n map.sourceRoot = this._sourceRoot;\n }\n if (this._sourcesContents) {\n map.sourcesContent = this._generateSourcesContent(\n map.sources,\n map.sourceRoot\n );\n }\n\n return map;\n };\n\n /**\n * Render the source map being generated to a string.\n */\n SourceMapGenerator.prototype.toString = function SourceMapGenerator_toString() {\n return JSON.stringify(this.toJSON());\n };\n\n exports.SourceMapGenerator = SourceMapGenerator;\n },\n {\n \"./array-set\": 145,\n \"./base64-vlq\": 146,\n \"./mapping-list\": 149,\n \"./util\": 154\n }\n ],\n 153: [\n function(require, module, exports) {\n /* -*- Mode: js; js-indent-level: 2; -*- */\n /*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\n var SourceMapGenerator = require(\"./source-map-generator\")\n .SourceMapGenerator;\n var util = require(\"./util\");\n\n // Matches a Windows-style `\\r\\n` newline or a `\\n` newline used by all other\n // operating systems these days (capturing the result).\n var REGEX_NEWLINE = /(\\r?\\n)/;\n\n // Newline character code for charCodeAt() comparisons\n var NEWLINE_CODE = 10;\n\n // Private symbol for identifying `SourceNode`s when multiple versions of\n // the source-map library are loaded. This MUST NOT CHANGE across\n // versions!\n var isSourceNode = \"$$$isSourceNode$$$\";\n\n /**\n * SourceNodes provide a way to abstract over interpolating/concatenating\n * snippets of generated JavaScript source code while maintaining the line and\n * column information associated with the original source code.\n *\n * @param aLine The original line number.\n * @param aColumn The original column number.\n * @param aSource The original source's filename.\n * @param aChunks Optional. An array of strings which are snippets of\n * generated JS, or other SourceNodes.\n * @param aName The original identifier.\n */\n function SourceNode(aLine, aColumn, aSource, aChunks, aName) {\n this.children = [];\n this.sourceContents = {};\n this.line = aLine == null ? null : aLine;\n this.column = aColumn == null ? null : aColumn;\n this.source = aSource == null ? null : aSource;\n this.name = aName == null ? null : aName;\n this[isSourceNode] = true;\n if (aChunks != null) this.add(aChunks);\n }\n\n /**\n * Creates a SourceNode from generated code and a SourceMapConsumer.\n *\n * @param aGeneratedCode The generated code\n * @param aSourceMapConsumer The SourceMap for the generated code\n * @param aRelativePath Optional. The path that relative sources in the\n * SourceMapConsumer should be relative to.\n */\n SourceNode.fromStringWithSourceMap = function SourceNode_fromStringWithSourceMap(\n aGeneratedCode,\n aSourceMapConsumer,\n aRelativePath\n ) {\n // The SourceNode we want to fill with the generated code\n // and the SourceMap\n var node = new SourceNode();\n\n // All even indices of this array are one line of the generated code,\n // while all odd indices are the newlines between two adjacent lines\n // (since `REGEX_NEWLINE` captures its match).\n // Processed fragments are accessed by calling `shiftNextLine`.\n var remainingLines = aGeneratedCode.split(REGEX_NEWLINE);\n var remainingLinesIndex = 0;\n var shiftNextLine = function() {\n var lineContents = getNextLine();\n // The last line of a file might not have a newline.\n var newLine = getNextLine() || \"\";\n return lineContents + newLine;\n\n function getNextLine() {\n return remainingLinesIndex < remainingLines.length\n ? remainingLines[remainingLinesIndex++]\n : undefined;\n }\n };\n\n // We need to remember the position of \"remainingLines\"\n var lastGeneratedLine = 1,\n lastGeneratedColumn = 0;\n\n // The generate SourceNodes we need a code range.\n // To extract it current and last mapping is used.\n // Here we store the last mapping.\n var lastMapping = null;\n\n aSourceMapConsumer.eachMapping(function(mapping) {\n if (lastMapping !== null) {\n // We add the code from \"lastMapping\" to \"mapping\":\n // First check if there is a new line in between.\n if (lastGeneratedLine < mapping.generatedLine) {\n // Associate first line with \"lastMapping\"\n addMappingWithCode(lastMapping, shiftNextLine());\n lastGeneratedLine++;\n lastGeneratedColumn = 0;\n // The remaining code is added without mapping\n } else {\n // There is no new line in between.\n // Associate the code between \"lastGeneratedColumn\" and\n // \"mapping.generatedColumn\" with \"lastMapping\"\n var nextLine = remainingLines[remainingLinesIndex] || \"\";\n var code = nextLine.substr(\n 0,\n mapping.generatedColumn - lastGeneratedColumn\n );\n remainingLines[remainingLinesIndex] = nextLine.substr(\n mapping.generatedColumn - lastGeneratedColumn\n );\n lastGeneratedColumn = mapping.generatedColumn;\n addMappingWithCode(lastMapping, code);\n // No more remaining code, continue\n lastMapping = mapping;\n return;\n }\n }\n // We add the generated code until the first mapping\n // to the SourceNode without any mapping.\n // Each line is added as separate string.\n while (lastGeneratedLine < mapping.generatedLine) {\n node.add(shiftNextLine());\n lastGeneratedLine++;\n }\n if (lastGeneratedColumn < mapping.generatedColumn) {\n var nextLine = remainingLines[remainingLinesIndex] || \"\";\n node.add(nextLine.substr(0, mapping.generatedColumn));\n remainingLines[remainingLinesIndex] = nextLine.substr(\n mapping.generatedColumn\n );\n lastGeneratedColumn = mapping.generatedColumn;\n }\n lastMapping = mapping;\n }, this);\n // We have processed all mappings.\n if (remainingLinesIndex < remainingLines.length) {\n if (lastMapping) {\n // Associate the remaining code in the current line with \"lastMapping\"\n addMappingWithCode(lastMapping, shiftNextLine());\n }\n // and add the remaining lines without any mapping\n node.add(remainingLines.splice(remainingLinesIndex).join(\"\"));\n }\n\n // Copy sourcesContent into SourceNode\n aSourceMapConsumer.sources.forEach(function(sourceFile) {\n var content = aSourceMapConsumer.sourceContentFor(sourceFile);\n if (content != null) {\n if (aRelativePath != null) {\n sourceFile = util.join(aRelativePath, sourceFile);\n }\n node.setSourceContent(sourceFile, content);\n }\n });\n\n return node;\n\n function addMappingWithCode(mapping, code) {\n if (mapping === null || mapping.source === undefined) {\n node.add(code);\n } else {\n var source = aRelativePath\n ? util.join(aRelativePath, mapping.source)\n : mapping.source;\n node.add(\n new SourceNode(\n mapping.originalLine,\n mapping.originalColumn,\n source,\n code,\n mapping.name\n )\n );\n }\n }\n };\n\n /**\n * Add a chunk of generated JS to this source node.\n *\n * @param aChunk A string snippet of generated JS code, another instance of\n * SourceNode, or an array where each member is one of those things.\n */\n SourceNode.prototype.add = function SourceNode_add(aChunk) {\n if (Array.isArray(aChunk)) {\n aChunk.forEach(function(chunk) {\n this.add(chunk);\n }, this);\n } else if (aChunk[isSourceNode] || typeof aChunk === \"string\") {\n if (aChunk) {\n this.children.push(aChunk);\n }\n } else {\n throw new TypeError(\n \"Expected a SourceNode, string, or an array of SourceNodes and strings. Got \" +\n aChunk\n );\n }\n return this;\n };\n\n /**\n * Add a chunk of generated JS to the beginning of this source node.\n *\n * @param aChunk A string snippet of generated JS code, another instance of\n * SourceNode, or an array where each member is one of those things.\n */\n SourceNode.prototype.prepend = function SourceNode_prepend(aChunk) {\n if (Array.isArray(aChunk)) {\n for (var i = aChunk.length - 1; i >= 0; i--) {\n this.prepend(aChunk[i]);\n }\n } else if (aChunk[isSourceNode] || typeof aChunk === \"string\") {\n this.children.unshift(aChunk);\n } else {\n throw new TypeError(\n \"Expected a SourceNode, string, or an array of SourceNodes and strings. Got \" +\n aChunk\n );\n }\n return this;\n };\n\n /**\n * Walk over the tree of JS snippets in this node and its children. The\n * walking function is called once for each snippet of JS and is passed that\n * snippet and the its original associated source's line/column location.\n *\n * @param aFn The traversal function.\n */\n SourceNode.prototype.walk = function SourceNode_walk(aFn) {\n var chunk;\n for (var i = 0, len = this.children.length; i < len; i++) {\n chunk = this.children[i];\n if (chunk[isSourceNode]) {\n chunk.walk(aFn);\n } else {\n if (chunk !== \"\") {\n aFn(chunk, {\n source: this.source,\n line: this.line,\n column: this.column,\n name: this.name\n });\n }\n }\n }\n };\n\n /**\n * Like `String.prototype.join` except for SourceNodes. Inserts `aStr` between\n * each of `this.children`.\n *\n * @param aSep The separator.\n */\n SourceNode.prototype.join = function SourceNode_join(aSep) {\n var newChildren;\n var i;\n var len = this.children.length;\n if (len > 0) {\n newChildren = [];\n for (i = 0; i < len - 1; i++) {\n newChildren.push(this.children[i]);\n newChildren.push(aSep);\n }\n newChildren.push(this.children[i]);\n this.children = newChildren;\n }\n return this;\n };\n\n /**\n * Call String.prototype.replace on the very right-most source snippet. Useful\n * for trimming whitespace from the end of a source node, etc.\n *\n * @param aPattern The pattern to replace.\n * @param aReplacement The thing to replace the pattern with.\n */\n SourceNode.prototype.replaceRight = function SourceNode_replaceRight(\n aPattern,\n aReplacement\n ) {\n var lastChild = this.children[this.children.length - 1];\n if (lastChild[isSourceNode]) {\n lastChild.replaceRight(aPattern, aReplacement);\n } else if (typeof lastChild === \"string\") {\n this.children[this.children.length - 1] = lastChild.replace(\n aPattern,\n aReplacement\n );\n } else {\n this.children.push(\"\".replace(aPattern, aReplacement));\n }\n return this;\n };\n\n /**\n * Set the source content for a source file. This will be added to the SourceMapGenerator\n * in the sourcesContent field.\n *\n * @param aSourceFile The filename of the source file\n * @param aSourceContent The content of the source file\n */\n SourceNode.prototype.setSourceContent = function SourceNode_setSourceContent(\n aSourceFile,\n aSourceContent\n ) {\n this.sourceContents[util.toSetString(aSourceFile)] = aSourceContent;\n };\n\n /**\n * Walk over the tree of SourceNodes. The walking function is called for each\n * source file content and is passed the filename and source content.\n *\n * @param aFn The traversal function.\n */\n SourceNode.prototype.walkSourceContents = function SourceNode_walkSourceContents(\n aFn\n ) {\n for (var i = 0, len = this.children.length; i < len; i++) {\n if (this.children[i][isSourceNode]) {\n this.children[i].walkSourceContents(aFn);\n }\n }\n\n var sources = Object.keys(this.sourceContents);\n for (var i = 0, len = sources.length; i < len; i++) {\n aFn(\n util.fromSetString(sources[i]),\n this.sourceContents[sources[i]]\n );\n }\n };\n\n /**\n * Return the string representation of this source node. Walks over the tree\n * and concatenates all the various snippets together to one string.\n */\n SourceNode.prototype.toString = function SourceNode_toString() {\n var str = \"\";\n this.walk(function(chunk) {\n str += chunk;\n });\n return str;\n };\n\n /**\n * Returns the string representation of this source node along with a source\n * map.\n */\n SourceNode.prototype.toStringWithSourceMap = function SourceNode_toStringWithSourceMap(\n aArgs\n ) {\n var generated = {\n code: \"\",\n line: 1,\n column: 0\n };\n var map = new SourceMapGenerator(aArgs);\n var sourceMappingActive = false;\n var lastOriginalSource = null;\n var lastOriginalLine = null;\n var lastOriginalColumn = null;\n var lastOriginalName = null;\n this.walk(function(chunk, original) {\n generated.code += chunk;\n if (\n original.source !== null &&\n original.line !== null &&\n original.column !== null\n ) {\n if (\n lastOriginalSource !== original.source ||\n lastOriginalLine !== original.line ||\n lastOriginalColumn !== original.column ||\n lastOriginalName !== original.name\n ) {\n map.addMapping({\n source: original.source,\n original: {\n line: original.line,\n column: original.column\n },\n generated: {\n line: generated.line,\n column: generated.column\n },\n name: original.name\n });\n }\n lastOriginalSource = original.source;\n lastOriginalLine = original.line;\n lastOriginalColumn = original.column;\n lastOriginalName = original.name;\n sourceMappingActive = true;\n } else if (sourceMappingActive) {\n map.addMapping({\n generated: {\n line: generated.line,\n column: generated.column\n }\n });\n lastOriginalSource = null;\n sourceMappingActive = false;\n }\n for (var idx = 0, length = chunk.length; idx < length; idx++) {\n if (chunk.charCodeAt(idx) === NEWLINE_CODE) {\n generated.line++;\n generated.column = 0;\n // Mappings end at eol\n if (idx + 1 === length) {\n lastOriginalSource = null;\n sourceMappingActive = false;\n } else if (sourceMappingActive) {\n map.addMapping({\n source: original.source,\n original: {\n line: original.line,\n column: original.column\n },\n generated: {\n line: generated.line,\n column: generated.column\n },\n name: original.name\n });\n }\n } else {\n generated.column++;\n }\n }\n });\n this.walkSourceContents(function(sourceFile, sourceContent) {\n map.setSourceContent(sourceFile, sourceContent);\n });\n\n return { code: generated.code, map: map };\n };\n\n exports.SourceNode = SourceNode;\n },\n { \"./source-map-generator\": 152, \"./util\": 154 }\n ],\n 154: [\n function(require, module, exports) {\n /* -*- Mode: js; js-indent-level: 2; -*- */\n /*\n * Copyright 2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n\n /**\n * This is a helper function for getting values from parameter/options\n * objects.\n *\n * @param args The object we are extracting values from\n * @param name The name of the property we are getting.\n * @param defaultValue An optional value to return if the property is missing\n * from the object. If this is not specified and the property is missing, an\n * error will be thrown.\n */\n function getArg(aArgs, aName, aDefaultValue) {\n if (aName in aArgs) {\n return aArgs[aName];\n } else if (arguments.length === 3) {\n return aDefaultValue;\n } else {\n throw new Error('\"' + aName + '\" is a required argument.');\n }\n }\n exports.getArg = getArg;\n\n var urlRegexp = /^(?:([\\w+\\-.]+):)?\\/\\/(?:(\\w+:\\w+)@)?([\\w.-]*)(?::(\\d+))?(.*)$/;\n var dataUrlRegexp = /^data:.+\\,.+$/;\n\n function urlParse(aUrl) {\n var match = aUrl.match(urlRegexp);\n if (!match) {\n return null;\n }\n return {\n scheme: match[1],\n auth: match[2],\n host: match[3],\n port: match[4],\n path: match[5]\n };\n }\n exports.urlParse = urlParse;\n\n function urlGenerate(aParsedUrl) {\n var url = \"\";\n if (aParsedUrl.scheme) {\n url += aParsedUrl.scheme + \":\";\n }\n url += \"//\";\n if (aParsedUrl.auth) {\n url += aParsedUrl.auth + \"@\";\n }\n if (aParsedUrl.host) {\n url += aParsedUrl.host;\n }\n if (aParsedUrl.port) {\n url += \":\" + aParsedUrl.port;\n }\n if (aParsedUrl.path) {\n url += aParsedUrl.path;\n }\n return url;\n }\n exports.urlGenerate = urlGenerate;\n\n /**\n * Normalizes a path, or the path portion of a URL:\n *\n * - Replaces consecutive slashes with one slash.\n * - Removes unnecessary '.' parts.\n * - Removes unnecessary '/..' parts.\n *\n * Based on code in the Node.js 'path' core module.\n *\n * @param aPath The path or url to normalize.\n */\n function normalize(aPath) {\n var path = aPath;\n var url = urlParse(aPath);\n if (url) {\n if (!url.path) {\n return aPath;\n }\n path = url.path;\n }\n var isAbsolute = exports.isAbsolute(path);\n\n var parts = path.split(/\\/+/);\n for (var part, up = 0, i = parts.length - 1; i >= 0; i--) {\n part = parts[i];\n if (part === \".\") {\n parts.splice(i, 1);\n } else if (part === \"..\") {\n up++;\n } else if (up > 0) {\n if (part === \"\") {\n // The first part is blank if the path is absolute. Trying to go\n // above the root is a no-op. Therefore we can remove all '..' parts\n // directly after the root.\n parts.splice(i + 1, up);\n up = 0;\n } else {\n parts.splice(i, 2);\n up--;\n }\n }\n }\n path = parts.join(\"/\");\n\n if (path === \"\") {\n path = isAbsolute ? \"/\" : \".\";\n }\n\n if (url) {\n url.path = path;\n return urlGenerate(url);\n }\n return path;\n }\n exports.normalize = normalize;\n\n /**\n * Joins two paths/URLs.\n *\n * @param aRoot The root path or URL.\n * @param aPath The path or URL to be joined with the root.\n *\n * - If aPath is a URL or a data URI, aPath is returned, unless aPath is a\n * scheme-relative URL: Then the scheme of aRoot, if any, is prepended\n * first.\n * - Otherwise aPath is a path. If aRoot is a URL, then its path portion\n * is updated with the result and aRoot is returned. Otherwise the result\n * is returned.\n * - If aPath is absolute, the result is aPath.\n * - Otherwise the two paths are joined with a slash.\n * - Joining for example 'http://' and 'www.example.com' is also supported.\n */\n function join(aRoot, aPath) {\n if (aRoot === \"\") {\n aRoot = \".\";\n }\n if (aPath === \"\") {\n aPath = \".\";\n }\n var aPathUrl = urlParse(aPath);\n var aRootUrl = urlParse(aRoot);\n if (aRootUrl) {\n aRoot = aRootUrl.path || \"/\";\n }\n\n // `join(foo, '//www.example.org')`\n if (aPathUrl && !aPathUrl.scheme) {\n if (aRootUrl) {\n aPathUrl.scheme = aRootUrl.scheme;\n }\n return urlGenerate(aPathUrl);\n }\n\n if (aPathUrl || aPath.match(dataUrlRegexp)) {\n return aPath;\n }\n\n // `join('http://', 'www.example.com')`\n if (aRootUrl && !aRootUrl.host && !aRootUrl.path) {\n aRootUrl.host = aPath;\n return urlGenerate(aRootUrl);\n }\n\n var joined =\n aPath.charAt(0) === \"/\"\n ? aPath\n : normalize(aRoot.replace(/\\/+$/, \"\") + \"/\" + aPath);\n\n if (aRootUrl) {\n aRootUrl.path = joined;\n return urlGenerate(aRootUrl);\n }\n return joined;\n }\n exports.join = join;\n\n exports.isAbsolute = function(aPath) {\n return aPath.charAt(0) === \"/\" || urlRegexp.test(aPath);\n };\n\n /**\n * Make a path relative to a URL or another path.\n *\n * @param aRoot The root path or URL.\n * @param aPath The path or URL to be made relative to aRoot.\n */\n function relative(aRoot, aPath) {\n if (aRoot === \"\") {\n aRoot = \".\";\n }\n\n aRoot = aRoot.replace(/\\/$/, \"\");\n\n // It is possible for the path to be above the root. In this case, simply\n // checking whether the root is a prefix of the path won't work. Instead, we\n // need to remove components from the root one by one, until either we find\n // a prefix that fits, or we run out of components to remove.\n var level = 0;\n while (aPath.indexOf(aRoot + \"/\") !== 0) {\n var index = aRoot.lastIndexOf(\"/\");\n if (index < 0) {\n return aPath;\n }\n\n // If the only part of the root that is left is the scheme (i.e. http://,\n // file:///, etc.), one or more slashes (/), or simply nothing at all, we\n // have exhausted all components, so the path is not relative to the root.\n aRoot = aRoot.slice(0, index);\n if (aRoot.match(/^([^\\/]+:\\/)?\\/*$/)) {\n return aPath;\n }\n\n ++level;\n }\n\n // Make sure we add a \"../\" for each component we removed from the root.\n return Array(level + 1).join(\"../\") + aPath.substr(aRoot.length + 1);\n }\n exports.relative = relative;\n\n var supportsNullProto = (function() {\n var obj = Object.create(null);\n return !(\"__proto__\" in obj);\n })();\n\n function identity(s) {\n return s;\n }\n\n /**\n * Because behavior goes wacky when you set `__proto__` on objects, we\n * have to prefix all the strings in our set with an arbitrary character.\n *\n * See https://github.com/mozilla/source-map/pull/31 and\n * https://github.com/mozilla/source-map/issues/30\n *\n * @param String aStr\n */\n function toSetString(aStr) {\n if (isProtoString(aStr)) {\n return \"$\" + aStr;\n }\n\n return aStr;\n }\n exports.toSetString = supportsNullProto ? identity : toSetString;\n\n function fromSetString(aStr) {\n if (isProtoString(aStr)) {\n return aStr.slice(1);\n }\n\n return aStr;\n }\n exports.fromSetString = supportsNullProto ? identity : fromSetString;\n\n function isProtoString(s) {\n if (!s) {\n return false;\n }\n\n var length = s.length;\n\n if (length < 9 /* \"__proto__\".length */) {\n return false;\n }\n\n if (\n s.charCodeAt(length - 1) !== 95 /* '_' */ ||\n s.charCodeAt(length - 2) !== 95 /* '_' */ ||\n s.charCodeAt(length - 3) !== 111 /* 'o' */ ||\n s.charCodeAt(length - 4) !== 116 /* 't' */ ||\n s.charCodeAt(length - 5) !== 111 /* 'o' */ ||\n s.charCodeAt(length - 6) !== 114 /* 'r' */ ||\n s.charCodeAt(length - 7) !== 112 /* 'p' */ ||\n s.charCodeAt(length - 8) !== 95 /* '_' */ ||\n s.charCodeAt(length - 9) !== 95 /* '_' */\n ) {\n return false;\n }\n\n for (var i = length - 10; i >= 0; i--) {\n if (s.charCodeAt(i) !== 36 /* '$' */) {\n return false;\n }\n }\n\n return true;\n }\n\n /**\n * Comparator between two mappings where the original positions are compared.\n *\n * Optionally pass in `true` as `onlyCompareGenerated` to consider two\n * mappings with the same original source/line/column, but different generated\n * line and column the same. Useful when searching for a mapping with a\n * stubbed out mapping.\n */\n function compareByOriginalPositions(\n mappingA,\n mappingB,\n onlyCompareOriginal\n ) {\n var cmp = strcmp(mappingA.source, mappingB.source);\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = mappingA.originalLine - mappingB.originalLine;\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = mappingA.originalColumn - mappingB.originalColumn;\n if (cmp !== 0 || onlyCompareOriginal) {\n return cmp;\n }\n\n cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = mappingA.generatedLine - mappingB.generatedLine;\n if (cmp !== 0) {\n return cmp;\n }\n\n return strcmp(mappingA.name, mappingB.name);\n }\n exports.compareByOriginalPositions = compareByOriginalPositions;\n\n /**\n * Comparator between two mappings with deflated source and name indices where\n * the generated positions are compared.\n *\n * Optionally pass in `true` as `onlyCompareGenerated` to consider two\n * mappings with the same generated line and column, but different\n * source/name/original line and column the same. Useful when searching for a\n * mapping with a stubbed out mapping.\n */\n function compareByGeneratedPositionsDeflated(\n mappingA,\n mappingB,\n onlyCompareGenerated\n ) {\n var cmp = mappingA.generatedLine - mappingB.generatedLine;\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n if (cmp !== 0 || onlyCompareGenerated) {\n return cmp;\n }\n\n cmp = strcmp(mappingA.source, mappingB.source);\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = mappingA.originalLine - mappingB.originalLine;\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = mappingA.originalColumn - mappingB.originalColumn;\n if (cmp !== 0) {\n return cmp;\n }\n\n return strcmp(mappingA.name, mappingB.name);\n }\n exports.compareByGeneratedPositionsDeflated = compareByGeneratedPositionsDeflated;\n\n function strcmp(aStr1, aStr2) {\n if (aStr1 === aStr2) {\n return 0;\n }\n\n if (aStr1 === null) {\n return 1; // aStr2 !== null\n }\n\n if (aStr2 === null) {\n return -1; // aStr1 !== null\n }\n\n if (aStr1 > aStr2) {\n return 1;\n }\n\n return -1;\n }\n\n /**\n * Comparator between two mappings with inflated source and name strings where\n * the generated positions are compared.\n */\n function compareByGeneratedPositionsInflated(mappingA, mappingB) {\n var cmp = mappingA.generatedLine - mappingB.generatedLine;\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = mappingA.generatedColumn - mappingB.generatedColumn;\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = strcmp(mappingA.source, mappingB.source);\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = mappingA.originalLine - mappingB.originalLine;\n if (cmp !== 0) {\n return cmp;\n }\n\n cmp = mappingA.originalColumn - mappingB.originalColumn;\n if (cmp !== 0) {\n return cmp;\n }\n\n return strcmp(mappingA.name, mappingB.name);\n }\n exports.compareByGeneratedPositionsInflated = compareByGeneratedPositionsInflated;\n\n /**\n * Strip any JSON XSSI avoidance prefix from the string (as documented\n * in the source maps specification), and then parse the string as\n * JSON.\n */\n function parseSourceMapInput(str) {\n return JSON.parse(str.replace(/^\\)]}'[^\\n]*\\n/, \"\"));\n }\n exports.parseSourceMapInput = parseSourceMapInput;\n\n /**\n * Compute the URL of a source given the the source root, the source's\n * URL, and the source map's URL.\n */\n function computeSourceURL(sourceRoot, sourceURL, sourceMapURL) {\n sourceURL = sourceURL || \"\";\n\n if (sourceRoot) {\n // This follows what Chrome does.\n if (\n sourceRoot[sourceRoot.length - 1] !== \"/\" &&\n sourceURL[0] !== \"/\"\n ) {\n sourceRoot += \"/\";\n }\n // The spec says:\n // Line 4: An optional source root, useful for relocating source\n // files on a server or removing repeated values in the\n // “sources” entry. This value is prepended to the individual\n // entries in the “source” field.\n sourceURL = sourceRoot + sourceURL;\n }\n\n // Historically, SourceMapConsumer did not take the sourceMapURL as\n // a parameter. This mode is still somewhat supported, which is why\n // this code block is conditional. However, it's preferable to pass\n // the source map URL to SourceMapConsumer, so that this function\n // can implement the source URL resolution algorithm as outlined in\n // the spec. This block is basically the equivalent of:\n // new URL(sourceURL, sourceMapURL).toString()\n // ... except it avoids using URL, which wasn't available in the\n // older releases of node still supported by this library.\n //\n // The spec says:\n // If the sources are not absolute URLs after prepending of the\n // “sourceRoot”, the sources are resolved relative to the\n // SourceMap (like resolving script src in a html document).\n if (sourceMapURL) {\n var parsed = urlParse(sourceMapURL);\n if (!parsed) {\n throw new Error(\"sourceMapURL could not be parsed\");\n }\n if (parsed.path) {\n // Strip the last path component, but keep the \"/\".\n var index = parsed.path.lastIndexOf(\"/\");\n if (index >= 0) {\n parsed.path = parsed.path.substring(0, index + 1);\n }\n }\n sourceURL = join(urlGenerate(parsed), sourceURL);\n }\n\n return normalize(sourceURL);\n }\n exports.computeSourceURL = computeSourceURL;\n },\n {}\n ],\n 155: [\n function(require, module, exports) {\n /*\n * Copyright 2009-2011 Mozilla Foundation and contributors\n * Licensed under the New BSD license. See LICENSE.txt or:\n * http://opensource.org/licenses/BSD-3-Clause\n */\n exports.SourceMapGenerator = require(\"./lib/source-map-generator\").SourceMapGenerator;\n exports.SourceMapConsumer = require(\"./lib/source-map-consumer\").SourceMapConsumer;\n exports.SourceNode = require(\"./lib/source-node\").SourceNode;\n },\n {\n \"./lib/source-map-consumer\": 151,\n \"./lib/source-map-generator\": 152,\n \"./lib/source-node\": 153\n }\n ],\n 156: [\n function(require, module, exports) {\n (function(global) {\n var ClientRequest = require(\"./lib/request\");\n var response = require(\"./lib/response\");\n var extend = require(\"xtend\");\n var statusCodes = require(\"builtin-status-codes\");\n var url = require(\"url\");\n\n var http = exports;\n\n http.request = function(opts, cb) {\n if (typeof opts === \"string\") opts = url.parse(opts);\n else opts = extend(opts);\n\n // Normally, the page is loaded from http or https, so not specifying a protocol\n // will result in a (valid) protocol-relative url. However, this won't work if\n // the protocol is something else, like 'file:'\n var defaultProtocol =\n global.location.protocol.search(/^https?:$/) === -1\n ? \"http:\"\n : \"\";\n\n var protocol = opts.protocol || defaultProtocol;\n var host = opts.hostname || opts.host;\n var port = opts.port;\n var path = opts.path || \"/\";\n\n // Necessary for IPv6 addresses\n if (host && host.indexOf(\":\") !== -1) host = \"[\" + host + \"]\";\n\n // This may be a relative url. The browser should always be able to interpret it correctly.\n opts.url =\n (host ? protocol + \"//\" + host : \"\") +\n (port ? \":\" + port : \"\") +\n path;\n opts.method = (opts.method || \"GET\").toUpperCase();\n opts.headers = opts.headers || {};\n\n // Also valid opts.auth, opts.mode\n\n var req = new ClientRequest(opts);\n if (cb) req.on(\"response\", cb);\n return req;\n };\n\n http.get = function get(opts, cb) {\n var req = http.request(opts, cb);\n req.end();\n return req;\n };\n\n http.ClientRequest = ClientRequest;\n http.IncomingMessage = response.IncomingMessage;\n\n http.Agent = function() {};\n http.Agent.defaultMaxSockets = 4;\n\n http.globalAgent = new http.Agent();\n\n http.STATUS_CODES = statusCodes;\n\n http.METHODS = [\n \"CHECKOUT\",\n \"CONNECT\",\n \"COPY\",\n \"DELETE\",\n \"GET\",\n \"HEAD\",\n \"LOCK\",\n \"M-SEARCH\",\n \"MERGE\",\n \"MKACTIVITY\",\n \"MKCOL\",\n \"MOVE\",\n \"NOTIFY\",\n \"OPTIONS\",\n \"PATCH\",\n \"POST\",\n \"PROPFIND\",\n \"PROPPATCH\",\n \"PURGE\",\n \"PUT\",\n \"REPORT\",\n \"SEARCH\",\n \"SUBSCRIBE\",\n \"TRACE\",\n \"UNLOCK\",\n \"UNSUBSCRIBE\"\n ];\n }.call(\n this,\n typeof global !== \"undefined\"\n ? global\n : typeof self !== \"undefined\"\n ? self\n : typeof window !== \"undefined\"\n ? window\n : {}\n ));\n },\n {\n \"./lib/request\": 158,\n \"./lib/response\": 159,\n \"builtin-status-codes\": 5,\n url: 162,\n xtend: 165\n }\n ],\n 157: [\n function(require, module, exports) {\n (function(global) {\n exports.fetch =\n isFunction(global.fetch) && isFunction(global.ReadableStream);\n\n exports.writableStream = isFunction(global.WritableStream);\n\n exports.abortController = isFunction(global.AbortController);\n\n exports.blobConstructor = false;\n try {\n new Blob([new ArrayBuffer(1)]);\n exports.blobConstructor = true;\n } catch (e) {}\n\n // The xhr request to example.com may violate some restrictive CSP configurations,\n // so if we're running in a browser that supports `fetch`, avoid calling getXHR()\n // and assume support for certain features below.\n var xhr;\n function getXHR() {\n // Cache the xhr value\n if (xhr !== undefined) return xhr;\n\n if (global.XMLHttpRequest) {\n xhr = new global.XMLHttpRequest();\n // If XDomainRequest is available (ie only, where xhr might not work\n // cross domain), use the page location. Otherwise use example.com\n // Note: this doesn't actually make an http request.\n try {\n xhr.open(\n \"GET\",\n global.XDomainRequest ? \"/\" : \"https://example.com\"\n );\n } catch (e) {\n xhr = null;\n }\n } else {\n // Service workers don't have XHR\n xhr = null;\n }\n return xhr;\n }\n\n function checkTypeSupport(type) {\n var xhr = getXHR();\n if (!xhr) return false;\n try {\n xhr.responseType = type;\n return xhr.responseType === type;\n } catch (e) {}\n return false;\n }\n\n // For some strange reason, Safari 7.0 reports typeof global.ArrayBuffer === 'object'.\n // Safari 7.1 appears to have fixed this bug.\n var haveArrayBuffer = typeof global.ArrayBuffer !== \"undefined\";\n var haveSlice =\n haveArrayBuffer && isFunction(global.ArrayBuffer.prototype.slice);\n\n // If fetch is supported, then arraybuffer will be supported too. Skip calling\n // checkTypeSupport(), since that calls getXHR().\n exports.arraybuffer =\n exports.fetch ||\n (haveArrayBuffer && checkTypeSupport(\"arraybuffer\"));\n\n // These next two tests unavoidably show warnings in Chrome. Since fetch will always\n // be used if it's available, just return false for these to avoid the warnings.\n exports.msstream =\n !exports.fetch && haveSlice && checkTypeSupport(\"ms-stream\");\n exports.mozchunkedarraybuffer =\n !exports.fetch &&\n haveArrayBuffer &&\n checkTypeSupport(\"moz-chunked-arraybuffer\");\n\n // If fetch is supported, then overrideMimeType will be supported too. Skip calling\n // getXHR().\n exports.overrideMimeType =\n exports.fetch ||\n (getXHR() ? isFunction(getXHR().overrideMimeType) : false);\n\n exports.vbArray = isFunction(global.VBArray);\n\n function isFunction(value) {\n return typeof value === \"function\";\n }\n\n xhr = null; // Help gc\n }.call(\n this,\n typeof global !== \"undefined\"\n ? global\n : typeof self !== \"undefined\"\n ? self\n : typeof window !== \"undefined\"\n ? window\n : {}\n ));\n },\n {}\n ],\n 158: [\n function(require, module, exports) {\n (function(process, global, Buffer) {\n var capability = require(\"./capability\");\n var inherits = require(\"inherits\");\n var response = require(\"./response\");\n var stream = require(\"readable-stream\");\n var toArrayBuffer = require(\"to-arraybuffer\");\n\n var IncomingMessage = response.IncomingMessage;\n var rStates = response.readyStates;\n\n function decideMode(preferBinary, useFetch) {\n if (capability.fetch && useFetch) {\n return \"fetch\";\n } else if (capability.mozchunkedarraybuffer) {\n return \"moz-chunked-arraybuffer\";\n } else if (capability.msstream) {\n return \"ms-stream\";\n } else if (capability.arraybuffer && preferBinary) {\n return \"arraybuffer\";\n } else if (capability.vbArray && preferBinary) {\n return \"text:vbarray\";\n } else {\n return \"text\";\n }\n }\n\n var ClientRequest = (module.exports = function(opts) {\n var self = this;\n stream.Writable.call(self);\n\n self._opts = opts;\n self._body = [];\n self._headers = {};\n if (opts.auth)\n self.setHeader(\n \"Authorization\",\n \"Basic \" + new Buffer(opts.auth).toString(\"base64\")\n );\n Object.keys(opts.headers).forEach(function(name) {\n self.setHeader(name, opts.headers[name]);\n });\n\n var preferBinary;\n var useFetch = true;\n if (\n opts.mode === \"disable-fetch\" ||\n (\"requestTimeout\" in opts && !capability.abortController)\n ) {\n // If the use of XHR should be preferred. Not typically needed.\n useFetch = false;\n preferBinary = true;\n } else if (opts.mode === \"prefer-streaming\") {\n // If streaming is a high priority but binary compatibility and\n // the accuracy of the 'content-type' header aren't\n preferBinary = false;\n } else if (opts.mode === \"allow-wrong-content-type\") {\n // If streaming is more important than preserving the 'content-type' header\n preferBinary = !capability.overrideMimeType;\n } else if (\n !opts.mode ||\n opts.mode === \"default\" ||\n opts.mode === \"prefer-fast\"\n ) {\n // Use binary if text streaming may corrupt data or the content-type header, or for speed\n preferBinary = true;\n } else {\n throw new Error(\"Invalid value for opts.mode\");\n }\n self._mode = decideMode(preferBinary, useFetch);\n self._fetchTimer = null;\n\n self.on(\"finish\", function() {\n self._onFinish();\n });\n });\n\n inherits(ClientRequest, stream.Writable);\n\n ClientRequest.prototype.setHeader = function(name, value) {\n var self = this;\n var lowerName = name.toLowerCase();\n // This check is not necessary, but it prevents warnings from browsers about setting unsafe\n // headers. To be honest I'm not entirely sure hiding these warnings is a good thing, but\n // http-browserify did it, so I will too.\n if (unsafeHeaders.indexOf(lowerName) !== -1) return;\n\n self._headers[lowerName] = {\n name: name,\n value: value\n };\n };\n\n ClientRequest.prototype.getHeader = function(name) {\n var header = this._headers[name.toLowerCase()];\n if (header) return header.value;\n return null;\n };\n\n ClientRequest.prototype.removeHeader = function(name) {\n var self = this;\n delete self._headers[name.toLowerCase()];\n };\n\n ClientRequest.prototype._onFinish = function() {\n var self = this;\n\n if (self._destroyed) return;\n var opts = self._opts;\n\n var headersObj = self._headers;\n var body = null;\n if (opts.method !== \"GET\" && opts.method !== \"HEAD\") {\n if (capability.arraybuffer) {\n body = toArrayBuffer(Buffer.concat(self._body));\n } else if (capability.blobConstructor) {\n body = new global.Blob(\n self._body.map(function(buffer) {\n return toArrayBuffer(buffer);\n }),\n {\n type: (headersObj[\"content-type\"] || {}).value || \"\"\n }\n );\n } else {\n // get utf8 string\n body = Buffer.concat(self._body).toString();\n }\n }\n\n // create flattened list of headers\n var headersList = [];\n Object.keys(headersObj).forEach(function(keyName) {\n var name = headersObj[keyName].name;\n var value = headersObj[keyName].value;\n if (Array.isArray(value)) {\n value.forEach(function(v) {\n headersList.push([name, v]);\n });\n } else {\n headersList.push([name, value]);\n }\n });\n\n if (self._mode === \"fetch\") {\n var signal = null;\n var fetchTimer = null;\n if (capability.abortController) {\n var controller = new AbortController();\n signal = controller.signal;\n self._fetchAbortController = controller;\n\n if (\"requestTimeout\" in opts && opts.requestTimeout !== 0) {\n self._fetchTimer = global.setTimeout(function() {\n self.emit(\"requestTimeout\");\n if (self._fetchAbortController)\n self._fetchAbortController.abort();\n }, opts.requestTimeout);\n }\n }\n\n global\n .fetch(self._opts.url, {\n method: self._opts.method,\n headers: headersList,\n body: body || undefined,\n mode: \"cors\",\n credentials: opts.withCredentials ? \"include\" : \"same-origin\",\n signal: signal\n })\n .then(\n function(response) {\n self._fetchResponse = response;\n self._connect();\n },\n function(reason) {\n global.clearTimeout(self._fetchTimer);\n if (!self._destroyed) self.emit(\"error\", reason);\n }\n );\n } else {\n var xhr = (self._xhr = new global.XMLHttpRequest());\n try {\n xhr.open(self._opts.method, self._opts.url, true);\n } catch (err) {\n process.nextTick(function() {\n self.emit(\"error\", err);\n });\n return;\n }\n\n // Can't set responseType on really old browsers\n if (\"responseType\" in xhr)\n xhr.responseType = self._mode.split(\":\")[0];\n\n if (\"withCredentials\" in xhr)\n xhr.withCredentials = !!opts.withCredentials;\n\n if (self._mode === \"text\" && \"overrideMimeType\" in xhr)\n xhr.overrideMimeType(\"text/plain; charset=x-user-defined\");\n\n if (\"requestTimeout\" in opts) {\n xhr.timeout = opts.requestTimeout;\n xhr.ontimeout = function() {\n self.emit(\"requestTimeout\");\n };\n }\n\n headersList.forEach(function(header) {\n xhr.setRequestHeader(header[0], header[1]);\n });\n\n self._response = null;\n xhr.onreadystatechange = function() {\n switch (xhr.readyState) {\n case rStates.LOADING:\n case rStates.DONE:\n self._onXHRProgress();\n break;\n }\n };\n // Necessary for streaming in Firefox, since xhr.response is ONLY defined\n // in onprogress, not in onreadystatechange with xhr.readyState = 3\n if (self._mode === \"moz-chunked-arraybuffer\") {\n xhr.onprogress = function() {\n self._onXHRProgress();\n };\n }\n\n xhr.onerror = function() {\n if (self._destroyed) return;\n self.emit(\"error\", new Error(\"XHR error\"));\n };\n\n try {\n xhr.send(body);\n } catch (err) {\n process.nextTick(function() {\n self.emit(\"error\", err);\n });\n return;\n }\n }\n };\n\n /**\n * Checks if xhr.status is readable and non-zero, indicating no error.\n * Even though the spec says it should be available in readyState 3,\n * accessing it throws an exception in IE8\n */\n function statusValid(xhr) {\n try {\n var status = xhr.status;\n return status !== null && status !== 0;\n } catch (e) {\n return false;\n }\n }\n\n ClientRequest.prototype._onXHRProgress = function() {\n var self = this;\n\n if (!statusValid(self._xhr) || self._destroyed) return;\n\n if (!self._response) self._connect();\n\n self._response._onXHRProgress();\n };\n\n ClientRequest.prototype._connect = function() {\n var self = this;\n\n if (self._destroyed) return;\n\n self._response = new IncomingMessage(\n self._xhr,\n self._fetchResponse,\n self._mode,\n self._fetchTimer\n );\n self._response.on(\"error\", function(err) {\n self.emit(\"error\", err);\n });\n\n self.emit(\"response\", self._response);\n };\n\n ClientRequest.prototype._write = function(chunk, encoding, cb) {\n var self = this;\n\n self._body.push(chunk);\n cb();\n };\n\n ClientRequest.prototype.abort = ClientRequest.prototype.destroy = function() {\n var self = this;\n self._destroyed = true;\n global.clearTimeout(self._fetchTimer);\n if (self._response) self._response._destroyed = true;\n if (self._xhr) self._xhr.abort();\n else if (self._fetchAbortController)\n self._fetchAbortController.abort();\n };\n\n ClientRequest.prototype.end = function(data, encoding, cb) {\n var self = this;\n if (typeof data === \"function\") {\n cb = data;\n data = undefined;\n }\n\n stream.Writable.prototype.end.call(self, data, encoding, cb);\n };\n\n ClientRequest.prototype.flushHeaders = function() {};\n ClientRequest.prototype.setTimeout = function() {};\n ClientRequest.prototype.setNoDelay = function() {};\n ClientRequest.prototype.setSocketKeepAlive = function() {};\n\n // Taken from http://www.w3.org/TR/XMLHttpRequest/#the-setrequestheader%28%29-method\n var unsafeHeaders = [\n \"accept-charset\",\n \"accept-encoding\",\n \"access-control-request-headers\",\n \"access-control-request-method\",\n \"connection\",\n \"content-length\",\n \"cookie\",\n \"cookie2\",\n \"date\",\n \"dnt\",\n \"expect\",\n \"host\",\n \"keep-alive\",\n \"origin\",\n \"referer\",\n \"te\",\n \"trailer\",\n \"transfer-encoding\",\n \"upgrade\",\n \"via\"\n ];\n }.call(\n this,\n require(\"_process\"),\n typeof global !== \"undefined\"\n ? global\n : typeof self !== \"undefined\"\n ? self\n : typeof window !== \"undefined\"\n ? window\n : {},\n require(\"buffer\").Buffer\n ));\n },\n {\n \"./capability\": 157,\n \"./response\": 159,\n _process: 112,\n buffer: 4,\n inherits: 106,\n \"readable-stream\": 126,\n \"to-arraybuffer\": 161\n }\n ],\n 159: [\n function(require, module, exports) {\n (function(process, global, Buffer) {\n var capability = require(\"./capability\");\n var inherits = require(\"inherits\");\n var stream = require(\"readable-stream\");\n\n var rStates = (exports.readyStates = {\n UNSENT: 0,\n OPENED: 1,\n HEADERS_RECEIVED: 2,\n LOADING: 3,\n DONE: 4\n });\n\n var IncomingMessage = (exports.IncomingMessage = function(\n xhr,\n response,\n mode,\n fetchTimer\n ) {\n var self = this;\n stream.Readable.call(self);\n\n self._mode = mode;\n self.headers = {};\n self.rawHeaders = [];\n self.trailers = {};\n self.rawTrailers = [];\n\n // Fake the 'close' event, but only once 'end' fires\n self.on(\"end\", function() {\n // The nextTick is necessary to prevent the 'request' module from causing an infinite loop\n process.nextTick(function() {\n self.emit(\"close\");\n });\n });\n\n if (mode === \"fetch\") {\n self._fetchResponse = response;\n\n self.url = response.url;\n self.statusCode = response.status;\n self.statusMessage = response.statusText;\n\n response.headers.forEach(function(header, key) {\n self.headers[key.toLowerCase()] = header;\n self.rawHeaders.push(key, header);\n });\n\n if (capability.writableStream) {\n var writable = new WritableStream({\n write: function(chunk) {\n return new Promise(function(resolve, reject) {\n if (self._destroyed) {\n reject();\n } else if (self.push(new Buffer(chunk))) {\n resolve();\n } else {\n self._resumeFetch = resolve;\n }\n });\n },\n close: function() {\n global.clearTimeout(fetchTimer);\n if (!self._destroyed) self.push(null);\n },\n abort: function(err) {\n if (!self._destroyed) self.emit(\"error\", err);\n }\n });\n\n try {\n response.body.pipeTo(writable).catch(function(err) {\n global.clearTimeout(fetchTimer);\n if (!self._destroyed) self.emit(\"error\", err);\n });\n return;\n } catch (e) {} // pipeTo method isn't defined. Can't find a better way to feature test this\n }\n // fallback for when writableStream or pipeTo aren't available\n var reader = response.body.getReader();\n function read() {\n reader\n .read()\n .then(function(result) {\n if (self._destroyed) return;\n if (result.done) {\n global.clearTimeout(fetchTimer);\n self.push(null);\n return;\n }\n self.push(new Buffer(result.value));\n read();\n })\n .catch(function(err) {\n global.clearTimeout(fetchTimer);\n if (!self._destroyed) self.emit(\"error\", err);\n });\n }\n read();\n } else {\n self._xhr = xhr;\n self._pos = 0;\n\n self.url = xhr.responseURL;\n self.statusCode = xhr.status;\n self.statusMessage = xhr.statusText;\n var headers = xhr.getAllResponseHeaders().split(/\\r?\\n/);\n headers.forEach(function(header) {\n var matches = header.match(/^([^:]+):\\s*(.*)/);\n if (matches) {\n var key = matches[1].toLowerCase();\n if (key === \"set-cookie\") {\n if (self.headers[key] === undefined) {\n self.headers[key] = [];\n }\n self.headers[key].push(matches[2]);\n } else if (self.headers[key] !== undefined) {\n self.headers[key] += \", \" + matches[2];\n } else {\n self.headers[key] = matches[2];\n }\n self.rawHeaders.push(matches[1], matches[2]);\n }\n });\n\n self._charset = \"x-user-defined\";\n if (!capability.overrideMimeType) {\n var mimeType = self.rawHeaders[\"mime-type\"];\n if (mimeType) {\n var charsetMatch = mimeType.match(/;\\s*charset=([^;])(;|$)/);\n if (charsetMatch) {\n self._charset = charsetMatch[1].toLowerCase();\n }\n }\n if (!self._charset) self._charset = \"utf-8\"; // best guess\n }\n }\n });\n\n inherits(IncomingMessage, stream.Readable);\n\n IncomingMessage.prototype._read = function() {\n var self = this;\n\n var resolve = self._resumeFetch;\n if (resolve) {\n self._resumeFetch = null;\n resolve();\n }\n };\n\n IncomingMessage.prototype._onXHRProgress = function() {\n var self = this;\n\n var xhr = self._xhr;\n\n var response = null;\n switch (self._mode) {\n case \"text:vbarray\": // For IE9\n if (xhr.readyState !== rStates.DONE) break;\n try {\n // This fails in IE8\n response = new global.VBArray(xhr.responseBody).toArray();\n } catch (e) {}\n if (response !== null) {\n self.push(new Buffer(response));\n break;\n }\n // Falls through in IE8\n case \"text\":\n try {\n // This will fail when readyState = 3 in IE9. Switch mode and wait for readyState = 4\n response = xhr.responseText;\n } catch (e) {\n self._mode = \"text:vbarray\";\n break;\n }\n if (response.length > self._pos) {\n var newData = response.substr(self._pos);\n if (self._charset === \"x-user-defined\") {\n var buffer = new Buffer(newData.length);\n for (var i = 0; i < newData.length; i++)\n buffer[i] = newData.charCodeAt(i) & 0xff;\n\n self.push(buffer);\n } else {\n self.push(newData, self._charset);\n }\n self._pos = response.length;\n }\n break;\n case \"arraybuffer\":\n if (xhr.readyState !== rStates.DONE || !xhr.response) break;\n response = xhr.response;\n self.push(new Buffer(new Uint8Array(response)));\n break;\n case \"moz-chunked-arraybuffer\": // take whole\n response = xhr.response;\n if (xhr.readyState !== rStates.LOADING || !response) break;\n self.push(new Buffer(new Uint8Array(response)));\n break;\n case \"ms-stream\":\n response = xhr.response;\n if (xhr.readyState !== rStates.LOADING) break;\n var reader = new global.MSStreamReader();\n reader.onprogress = function() {\n if (reader.result.byteLength > self._pos) {\n self.push(\n new Buffer(new Uint8Array(reader.result.slice(self._pos)))\n );\n self._pos = reader.result.byteLength;\n }\n };\n reader.onload = function() {\n self.push(null);\n };\n // reader.onerror = ??? // TODO: this\n reader.readAsArrayBuffer(response);\n break;\n }\n\n // The ms-stream case handles end separately in reader.onload()\n if (\n self._xhr.readyState === rStates.DONE &&\n self._mode !== \"ms-stream\"\n ) {\n self.push(null);\n }\n };\n }.call(\n this,\n require(\"_process\"),\n typeof global !== \"undefined\"\n ? global\n : typeof self !== \"undefined\"\n ? self\n : typeof window !== \"undefined\"\n ? window\n : {},\n require(\"buffer\").Buffer\n ));\n },\n {\n \"./capability\": 157,\n _process: 112,\n buffer: 4,\n inherits: 106,\n \"readable-stream\": 126\n }\n ],\n 160: [\n function(require, module, exports) {\n (function(setImmediate, clearImmediate) {\n var nextTick = require(\"process/browser.js\").nextTick;\n var apply = Function.prototype.apply;\n var slice = Array.prototype.slice;\n var immediateIds = {};\n var nextImmediateId = 0;\n\n // DOM APIs, for completeness\n\n exports.setTimeout = function() {\n return new Timeout(\n apply.call(setTimeout, window, arguments),\n clearTimeout\n );\n };\n exports.setInterval = function() {\n return new Timeout(\n apply.call(setInterval, window, arguments),\n clearInterval\n );\n };\n exports.clearTimeout = exports.clearInterval = function(timeout) {\n timeout.close();\n };\n\n function Timeout(id, clearFn) {\n this._id = id;\n this._clearFn = clearFn;\n }\n Timeout.prototype.unref = Timeout.prototype.ref = function() {};\n Timeout.prototype.close = function() {\n this._clearFn.call(window, this._id);\n };\n\n // Does not start the time, just sets up the members needed.\n exports.enroll = function(item, msecs) {\n clearTimeout(item._idleTimeoutId);\n item._idleTimeout = msecs;\n };\n\n exports.unenroll = function(item) {\n clearTimeout(item._idleTimeoutId);\n item._idleTimeout = -1;\n };\n\n exports._unrefActive = exports.active = function(item) {\n clearTimeout(item._idleTimeoutId);\n\n var msecs = item._idleTimeout;\n if (msecs >= 0) {\n item._idleTimeoutId = setTimeout(function onTimeout() {\n if (item._onTimeout) item._onTimeout();\n }, msecs);\n }\n };\n\n // That's not how node.js implements it but the exposed api is the same.\n exports.setImmediate =\n typeof setImmediate === \"function\"\n ? setImmediate\n : function(fn) {\n var id = nextImmediateId++;\n var args =\n arguments.length < 2 ? false : slice.call(arguments, 1);\n\n immediateIds[id] = true;\n\n nextTick(function onNextTick() {\n if (immediateIds[id]) {\n // fn.call() is faster so we optimize for the common use-case\n // @see http://jsperf.com/call-apply-segu\n if (args) {\n fn.apply(null, args);\n } else {\n fn.call(null);\n }\n // Prevent ids from leaking\n exports.clearImmediate(id);\n }\n });\n\n return id;\n };\n\n exports.clearImmediate =\n typeof clearImmediate === \"function\"\n ? clearImmediate\n : function(id) {\n delete immediateIds[id];\n };\n }.call(\n this,\n require(\"timers\").setImmediate,\n require(\"timers\").clearImmediate\n ));\n },\n { \"process/browser.js\": 112, timers: 160 }\n ],\n 161: [\n function(require, module, exports) {\n var Buffer = require(\"buffer\").Buffer;\n\n module.exports = function(buf) {\n // If the buffer is backed by a Uint8Array, a faster version will work\n if (buf instanceof Uint8Array) {\n // If the buffer isn't a subarray, return the underlying ArrayBuffer\n if (\n buf.byteOffset === 0 &&\n buf.byteLength === buf.buffer.byteLength\n ) {\n return buf.buffer;\n } else if (typeof buf.buffer.slice === \"function\") {\n // Otherwise we need to get a proper copy\n return buf.buffer.slice(\n buf.byteOffset,\n buf.byteOffset + buf.byteLength\n );\n }\n }\n\n if (Buffer.isBuffer(buf)) {\n // This is the slow version that will work with any Buffer\n // implementation (even in old browsers)\n var arrayCopy = new Uint8Array(buf.length);\n var len = buf.length;\n for (var i = 0; i < len; i++) {\n arrayCopy[i] = buf[i];\n }\n return arrayCopy.buffer;\n } else {\n throw new Error(\"Argument must be a Buffer\");\n }\n };\n },\n { buffer: 4 }\n ],\n 162: [\n function(require, module, exports) {\n // Copyright Joyent, Inc. and other Node contributors.\n //\n // Permission is hereby granted, free of charge, to any person obtaining a\n // copy of this software and associated documentation files (the\n // \"Software\"), to deal in the Software without restriction, including\n // without limitation the rights to use, copy, modify, merge, publish,\n // distribute, sublicense, and/or sell copies of the Software, and to permit\n // persons to whom the Software is furnished to do so, subject to the\n // following conditions:\n //\n // The above copyright notice and this permission notice shall be included\n // in all copies or substantial portions of the Software.\n //\n // THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n // OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n // MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n // NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n // DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n // OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n // USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n \"use strict\";\n\n var punycode = require(\"punycode\");\n var util = require(\"./util\");\n\n exports.parse = urlParse;\n exports.resolve = urlResolve;\n exports.resolveObject = urlResolveObject;\n exports.format = urlFormat;\n\n exports.Url = Url;\n\n function Url() {\n this.protocol = null;\n this.slashes = null;\n this.auth = null;\n this.host = null;\n this.port = null;\n this.hostname = null;\n this.hash = null;\n this.search = null;\n this.query = null;\n this.pathname = null;\n this.path = null;\n this.href = null;\n }\n\n // Reference: RFC 3986, RFC 1808, RFC 2396\n\n // define these here so at least they only have to be\n // compiled once on the first module load.\n var protocolPattern = /^([a-z0-9.+-]+:)/i,\n portPattern = /:[0-9]*$/,\n // Special case for a simple path URL\n simplePathPattern = /^(\\/\\/?(?!\\/)[^\\?\\s]*)(\\?[^\\s]*)?$/,\n // RFC 2396: characters reserved for delimiting URLs.\n // We actually just auto-escape these.\n delims = [\"<\", \">\", '\"', \"`\", \" \", \"\\r\", \"\\n\", \"\\t\"],\n // RFC 2396: characters not allowed for various reasons.\n unwise = [\"{\", \"}\", \"|\", \"\\\\\", \"^\", \"`\"].concat(delims),\n // Allowed by RFCs, but cause of XSS attacks. Always escape these.\n autoEscape = [\"'\"].concat(unwise),\n // Characters that are never ever allowed in a hostname.\n // Note that any invalid chars are also handled, but these\n // are the ones that are *expected* to be seen, so we fast-path\n // them.\n nonHostChars = [\"%\", \"/\", \"?\", \";\", \"#\"].concat(autoEscape),\n hostEndingChars = [\"/\", \"?\", \"#\"],\n hostnameMaxLen = 255,\n hostnamePartPattern = /^[+a-z0-9A-Z_-]{0,63}$/,\n hostnamePartStart = /^([+a-z0-9A-Z_-]{0,63})(.*)$/,\n // protocols that can allow \"unsafe\" and \"unwise\" chars.\n unsafeProtocol = {\n javascript: true,\n \"javascript:\": true\n },\n // protocols that never have a hostname.\n hostlessProtocol = {\n javascript: true,\n \"javascript:\": true\n },\n // protocols that always contain a // bit.\n slashedProtocol = {\n http: true,\n https: true,\n ftp: true,\n gopher: true,\n file: true,\n \"http:\": true,\n \"https:\": true,\n \"ftp:\": true,\n \"gopher:\": true,\n \"file:\": true\n },\n querystring = require(\"querystring\");\n\n function urlParse(url, parseQueryString, slashesDenoteHost) {\n if (url && util.isObject(url) && url instanceof Url) return url;\n\n var u = new Url();\n u.parse(url, parseQueryString, slashesDenoteHost);\n return u;\n }\n\n Url.prototype.parse = function(\n url,\n parseQueryString,\n slashesDenoteHost\n ) {\n if (!util.isString(url)) {\n throw new TypeError(\n \"Parameter 'url' must be a string, not \" + typeof url\n );\n }\n\n // Copy chrome, IE, opera backslash-handling behavior.\n // Back slashes before the query string get converted to forward slashes\n // See: https://code.google.com/p/chromium/issues/detail?id=25916\n var queryIndex = url.indexOf(\"?\"),\n splitter =\n queryIndex !== -1 && queryIndex < url.indexOf(\"#\") ? \"?\" : \"#\",\n uSplit = url.split(splitter),\n slashRegex = /\\\\/g;\n uSplit[0] = uSplit[0].replace(slashRegex, \"/\");\n url = uSplit.join(splitter);\n\n var rest = url;\n\n // trim before proceeding.\n // This is to support parse stuff like \" http://foo.com \\n\"\n rest = rest.trim();\n\n if (!slashesDenoteHost && url.split(\"#\").length === 1) {\n // Try fast path regexp\n var simplePath = simplePathPattern.exec(rest);\n if (simplePath) {\n this.path = rest;\n this.href = rest;\n this.pathname = simplePath[1];\n if (simplePath[2]) {\n this.search = simplePath[2];\n if (parseQueryString) {\n this.query = querystring.parse(this.search.substr(1));\n } else {\n this.query = this.search.substr(1);\n }\n } else if (parseQueryString) {\n this.search = \"\";\n this.query = {};\n }\n return this;\n }\n }\n\n var proto = protocolPattern.exec(rest);\n if (proto) {\n proto = proto[0];\n var lowerProto = proto.toLowerCase();\n this.protocol = lowerProto;\n rest = rest.substr(proto.length);\n }\n\n // figure out if it's got a host\n // user@server is *always* interpreted as a hostname, and url\n // resolution will treat //foo/bar as host=foo,path=bar because that's\n // how the browser resolves relative URLs.\n if (\n slashesDenoteHost ||\n proto ||\n rest.match(/^\\/\\/[^@\\/]+@[^@\\/]+/)\n ) {\n var slashes = rest.substr(0, 2) === \"//\";\n if (slashes && !(proto && hostlessProtocol[proto])) {\n rest = rest.substr(2);\n this.slashes = true;\n }\n }\n\n if (\n !hostlessProtocol[proto] &&\n (slashes || (proto && !slashedProtocol[proto]))\n ) {\n // there's a hostname.\n // the first instance of /, ?, ;, or # ends the host.\n //\n // If there is an @ in the hostname, then non-host chars *are* allowed\n // to the left of the last @ sign, unless some host-ending character\n // comes *before* the @-sign.\n // URLs are obnoxious.\n //\n // ex:\n // http://a@b@c/ => user:a@b host:c\n // http://a@b?@c => user:a host:c path:/?@c\n\n // v0.12 TODO(isaacs): This is not quite how Chrome does things.\n // Review our test case against browsers more comprehensively.\n\n // find the first instance of any hostEndingChars\n var hostEnd = -1;\n for (var i = 0; i < hostEndingChars.length; i++) {\n var hec = rest.indexOf(hostEndingChars[i]);\n if (hec !== -1 && (hostEnd === -1 || hec < hostEnd))\n hostEnd = hec;\n }\n\n // at this point, either we have an explicit point where the\n // auth portion cannot go past, or the last @ char is the decider.\n var auth, atSign;\n if (hostEnd === -1) {\n // atSign can be anywhere.\n atSign = rest.lastIndexOf(\"@\");\n } else {\n // atSign must be in auth portion.\n // http://a@b/c@d => host:b auth:a path:/c@d\n atSign = rest.lastIndexOf(\"@\", hostEnd);\n }\n\n // Now we have a portion which is definitely the auth.\n // Pull that off.\n if (atSign !== -1) {\n auth = rest.slice(0, atSign);\n rest = rest.slice(atSign + 1);\n this.auth = decodeURIComponent(auth);\n }\n\n // the host is the remaining to the left of the first non-host char\n hostEnd = -1;\n for (var i = 0; i < nonHostChars.length; i++) {\n var hec = rest.indexOf(nonHostChars[i]);\n if (hec !== -1 && (hostEnd === -1 || hec < hostEnd))\n hostEnd = hec;\n }\n // if we still have not hit it, then the entire thing is a host.\n if (hostEnd === -1) hostEnd = rest.length;\n\n this.host = rest.slice(0, hostEnd);\n rest = rest.slice(hostEnd);\n\n // pull out port.\n this.parseHost();\n\n // we've indicated that there is a hostname,\n // so even if it's empty, it has to be present.\n this.hostname = this.hostname || \"\";\n\n // if hostname begins with [ and ends with ]\n // assume that it's an IPv6 address.\n var ipv6Hostname =\n this.hostname[0] === \"[\" &&\n this.hostname[this.hostname.length - 1] === \"]\";\n\n // validate a little.\n if (!ipv6Hostname) {\n var hostparts = this.hostname.split(/\\./);\n for (var i = 0, l = hostparts.length; i < l; i++) {\n var part = hostparts[i];\n if (!part) continue;\n if (!part.match(hostnamePartPattern)) {\n var newpart = \"\";\n for (var j = 0, k = part.length; j < k; j++) {\n if (part.charCodeAt(j) > 127) {\n // we replace non-ASCII char with a temporary placeholder\n // we need this to make sure size of hostname is not\n // broken by replacing non-ASCII by nothing\n newpart += \"x\";\n } else {\n newpart += part[j];\n }\n }\n // we test again with ASCII char only\n if (!newpart.match(hostnamePartPattern)) {\n var validParts = hostparts.slice(0, i);\n var notHost = hostparts.slice(i + 1);\n var bit = part.match(hostnamePartStart);\n if (bit) {\n validParts.push(bit[1]);\n notHost.unshift(bit[2]);\n }\n if (notHost.length) {\n rest = \"/\" + notHost.join(\".\") + rest;\n }\n this.hostname = validParts.join(\".\");\n break;\n }\n }\n }\n }\n\n if (this.hostname.length > hostnameMaxLen) {\n this.hostname = \"\";\n } else {\n // hostnames are always lower case.\n this.hostname = this.hostname.toLowerCase();\n }\n\n if (!ipv6Hostname) {\n // IDNA Support: Returns a punycoded representation of \"domain\".\n // It only converts parts of the domain name that\n // have non-ASCII characters, i.e. it doesn't matter if\n // you call it with a domain that already is ASCII-only.\n this.hostname = punycode.toASCII(this.hostname);\n }\n\n var p = this.port ? \":\" + this.port : \"\";\n var h = this.hostname || \"\";\n this.host = h + p;\n this.href += this.host;\n\n // strip [ and ] from the hostname\n // the host field still retains them, though\n if (ipv6Hostname) {\n this.hostname = this.hostname.substr(1, this.hostname.length - 2);\n if (rest[0] !== \"/\") {\n rest = \"/\" + rest;\n }\n }\n }\n\n // now rest is set to the post-host stuff.\n // chop off any delim chars.\n if (!unsafeProtocol[lowerProto]) {\n // First, make 100% sure that any \"autoEscape\" chars get\n // escaped, even if encodeURIComponent doesn't think they\n // need to be.\n for (var i = 0, l = autoEscape.length; i < l; i++) {\n var ae = autoEscape[i];\n if (rest.indexOf(ae) === -1) continue;\n var esc = encodeURIComponent(ae);\n if (esc === ae) {\n esc = escape(ae);\n }\n rest = rest.split(ae).join(esc);\n }\n }\n\n // chop off from the tail first.\n var hash = rest.indexOf(\"#\");\n if (hash !== -1) {\n // got a fragment string.\n this.hash = rest.substr(hash);\n rest = rest.slice(0, hash);\n }\n var qm = rest.indexOf(\"?\");\n if (qm !== -1) {\n this.search = rest.substr(qm);\n this.query = rest.substr(qm + 1);\n if (parseQueryString) {\n this.query = querystring.parse(this.query);\n }\n rest = rest.slice(0, qm);\n } else if (parseQueryString) {\n // no query string, but parseQueryString still requested\n this.search = \"\";\n this.query = {};\n }\n if (rest) this.pathname = rest;\n if (slashedProtocol[lowerProto] && this.hostname && !this.pathname) {\n this.pathname = \"/\";\n }\n\n //to support http.request\n if (this.pathname || this.search) {\n var p = this.pathname || \"\";\n var s = this.search || \"\";\n this.path = p + s;\n }\n\n // finally, reconstruct the href based on what has been validated.\n this.href = this.format();\n return this;\n };\n\n // format a parsed object into a url string\n function urlFormat(obj) {\n // ensure it's an object, and not a string url.\n // If it's an obj, this is a no-op.\n // this way, you can call url_format() on strings\n // to clean up potentially wonky urls.\n if (util.isString(obj)) obj = urlParse(obj);\n if (!(obj instanceof Url)) return Url.prototype.format.call(obj);\n return obj.format();\n }\n\n Url.prototype.format = function() {\n var auth = this.auth || \"\";\n if (auth) {\n auth = encodeURIComponent(auth);\n auth = auth.replace(/%3A/i, \":\");\n auth += \"@\";\n }\n\n var protocol = this.protocol || \"\",\n pathname = this.pathname || \"\",\n hash = this.hash || \"\",\n host = false,\n query = \"\";\n\n if (this.host) {\n host = auth + this.host;\n } else if (this.hostname) {\n host =\n auth +\n (this.hostname.indexOf(\":\") === -1\n ? this.hostname\n : \"[\" + this.hostname + \"]\");\n if (this.port) {\n host += \":\" + this.port;\n }\n }\n\n if (\n this.query &&\n util.isObject(this.query) &&\n Object.keys(this.query).length\n ) {\n query = querystring.stringify(this.query);\n }\n\n var search = this.search || (query && \"?\" + query) || \"\";\n\n if (protocol && protocol.substr(-1) !== \":\") protocol += \":\";\n\n // only the slashedProtocols get the //. Not mailto:, xmpp:, etc.\n // unless they had them to begin with.\n if (\n this.slashes ||\n ((!protocol || slashedProtocol[protocol]) && host !== false)\n ) {\n host = \"//\" + (host || \"\");\n if (pathname && pathname.charAt(0) !== \"/\")\n pathname = \"/\" + pathname;\n } else if (!host) {\n host = \"\";\n }\n\n if (hash && hash.charAt(0) !== \"#\") hash = \"#\" + hash;\n if (search && search.charAt(0) !== \"?\") search = \"?\" + search;\n\n pathname = pathname.replace(/[?#]/g, function(match) {\n return encodeURIComponent(match);\n });\n search = search.replace(\"#\", \"%23\");\n\n return protocol + host + pathname + search + hash;\n };\n\n function urlResolve(source, relative) {\n return urlParse(source, false, true).resolve(relative);\n }\n\n Url.prototype.resolve = function(relative) {\n return this.resolveObject(urlParse(relative, false, true)).format();\n };\n\n function urlResolveObject(source, relative) {\n if (!source) return relative;\n return urlParse(source, false, true).resolveObject(relative);\n }\n\n Url.prototype.resolveObject = function(relative) {\n if (util.isString(relative)) {\n var rel = new Url();\n rel.parse(relative, false, true);\n relative = rel;\n }\n\n var result = new Url();\n var tkeys = Object.keys(this);\n for (var tk = 0; tk < tkeys.length; tk++) {\n var tkey = tkeys[tk];\n result[tkey] = this[tkey];\n }\n\n // hash is always overridden, no matter what.\n // even href=\"\" will remove it.\n result.hash = relative.hash;\n\n // if the relative url is empty, then there's nothing left to do here.\n if (relative.href === \"\") {\n result.href = result.format();\n return result;\n }\n\n // hrefs like //foo/bar always cut to the protocol.\n if (relative.slashes && !relative.protocol) {\n // take everything except the protocol from relative\n var rkeys = Object.keys(relative);\n for (var rk = 0; rk < rkeys.length; rk++) {\n var rkey = rkeys[rk];\n if (rkey !== \"protocol\") result[rkey] = relative[rkey];\n }\n\n //urlParse appends trailing / to urls like http://www.example.com\n if (\n slashedProtocol[result.protocol] &&\n result.hostname &&\n !result.pathname\n ) {\n result.path = result.pathname = \"/\";\n }\n\n result.href = result.format();\n return result;\n }\n\n if (relative.protocol && relative.protocol !== result.protocol) {\n // if it's a known url protocol, then changing\n // the protocol does weird things\n // first, if it's not file:, then we MUST have a host,\n // and if there was a path\n // to begin with, then we MUST have a path.\n // if it is file:, then the host is dropped,\n // because that's known to be hostless.\n // anything else is assumed to be absolute.\n if (!slashedProtocol[relative.protocol]) {\n var keys = Object.keys(relative);\n for (var v = 0; v < keys.length; v++) {\n var k = keys[v];\n result[k] = relative[k];\n }\n result.href = result.format();\n return result;\n }\n\n result.protocol = relative.protocol;\n if (!relative.host && !hostlessProtocol[relative.protocol]) {\n var relPath = (relative.pathname || \"\").split(\"/\");\n while (relPath.length && !(relative.host = relPath.shift()));\n if (!relative.host) relative.host = \"\";\n if (!relative.hostname) relative.hostname = \"\";\n if (relPath[0] !== \"\") relPath.unshift(\"\");\n if (relPath.length < 2) relPath.unshift(\"\");\n result.pathname = relPath.join(\"/\");\n } else {\n result.pathname = relative.pathname;\n }\n result.search = relative.search;\n result.query = relative.query;\n result.host = relative.host || \"\";\n result.auth = relative.auth;\n result.hostname = relative.hostname || relative.host;\n result.port = relative.port;\n // to support http.request\n if (result.pathname || result.search) {\n var p = result.pathname || \"\";\n var s = result.search || \"\";\n result.path = p + s;\n }\n result.slashes = result.slashes || relative.slashes;\n result.href = result.format();\n return result;\n }\n\n var isSourceAbs =\n result.pathname && result.pathname.charAt(0) === \"/\",\n isRelAbs =\n relative.host ||\n (relative.pathname && relative.pathname.charAt(0) === \"/\"),\n mustEndAbs =\n isRelAbs || isSourceAbs || (result.host && relative.pathname),\n removeAllDots = mustEndAbs,\n srcPath = (result.pathname && result.pathname.split(\"/\")) || [],\n relPath = (relative.pathname && relative.pathname.split(\"/\")) || [],\n psychotic = result.protocol && !slashedProtocol[result.protocol];\n\n // if the url is a non-slashed url, then relative\n // links like ../.. should be able\n // to crawl up to the hostname, as well. This is strange.\n // result.protocol has already been set by now.\n // Later on, put the first path part into the host field.\n if (psychotic) {\n result.hostname = \"\";\n result.port = null;\n if (result.host) {\n if (srcPath[0] === \"\") srcPath[0] = result.host;\n else srcPath.unshift(result.host);\n }\n result.host = \"\";\n if (relative.protocol) {\n relative.hostname = null;\n relative.port = null;\n if (relative.host) {\n if (relPath[0] === \"\") relPath[0] = relative.host;\n else relPath.unshift(relative.host);\n }\n relative.host = null;\n }\n mustEndAbs = mustEndAbs && (relPath[0] === \"\" || srcPath[0] === \"\");\n }\n\n if (isRelAbs) {\n // it's absolute.\n result.host =\n relative.host || relative.host === \"\"\n ? relative.host\n : result.host;\n result.hostname =\n relative.hostname || relative.hostname === \"\"\n ? relative.hostname\n : result.hostname;\n result.search = relative.search;\n result.query = relative.query;\n srcPath = relPath;\n // fall through to the dot-handling below.\n } else if (relPath.length) {\n // it's relative\n // throw away the existing file, and take the new path instead.\n if (!srcPath) srcPath = [];\n srcPath.pop();\n srcPath = srcPath.concat(relPath);\n result.search = relative.search;\n result.query = relative.query;\n } else if (!util.isNullOrUndefined(relative.search)) {\n // just pull out the search.\n // like href='?foo'.\n // Put this after the other two cases because it simplifies the booleans\n if (psychotic) {\n result.hostname = result.host = srcPath.shift();\n //occationaly the auth can get stuck only in host\n //this especially happens in cases like\n //url.resolveObject('mailto:local1@domain1', 'local2@domain2')\n var authInHost =\n result.host && result.host.indexOf(\"@\") > 0\n ? result.host.split(\"@\")\n : false;\n if (authInHost) {\n result.auth = authInHost.shift();\n result.host = result.hostname = authInHost.shift();\n }\n }\n result.search = relative.search;\n result.query = relative.query;\n //to support http.request\n if (!util.isNull(result.pathname) || !util.isNull(result.search)) {\n result.path =\n (result.pathname ? result.pathname : \"\") +\n (result.search ? result.search : \"\");\n }\n result.href = result.format();\n return result;\n }\n\n if (!srcPath.length) {\n // no path at all. easy.\n // we've already handled the other stuff above.\n result.pathname = null;\n //to support http.request\n if (result.search) {\n result.path = \"/\" + result.search;\n } else {\n result.path = null;\n }\n result.href = result.format();\n return result;\n }\n\n // if a url ENDs in . or .., then it must get a trailing slash.\n // however, if it ends in anything else non-slashy,\n // then it must NOT get a trailing slash.\n var last = srcPath.slice(-1)[0];\n var hasTrailingSlash =\n ((result.host || relative.host || srcPath.length > 1) &&\n (last === \".\" || last === \"..\")) ||\n last === \"\";\n\n // strip single dots, resolve double dots to parent dir\n // if the path tries to go above the root, `up` ends up > 0\n var up = 0;\n for (var i = srcPath.length; i >= 0; i--) {\n last = srcPath[i];\n if (last === \".\") {\n srcPath.splice(i, 1);\n } else if (last === \"..\") {\n srcPath.splice(i, 1);\n up++;\n } else if (up) {\n srcPath.splice(i, 1);\n up--;\n }\n }\n\n // if the path is allowed to go above the root, restore leading ..s\n if (!mustEndAbs && !removeAllDots) {\n for (; up--; up) {\n srcPath.unshift(\"..\");\n }\n }\n\n if (\n mustEndAbs &&\n srcPath[0] !== \"\" &&\n (!srcPath[0] || srcPath[0].charAt(0) !== \"/\")\n ) {\n srcPath.unshift(\"\");\n }\n\n if (hasTrailingSlash && srcPath.join(\"/\").substr(-1) !== \"/\") {\n srcPath.push(\"\");\n }\n\n var isAbsolute =\n srcPath[0] === \"\" || (srcPath[0] && srcPath[0].charAt(0) === \"/\");\n\n // put the host back\n if (psychotic) {\n result.hostname = result.host = isAbsolute\n ? \"\"\n : srcPath.length\n ? srcPath.shift()\n : \"\";\n //occationaly the auth can get stuck only in host\n //this especially happens in cases like\n //url.resolveObject('mailto:local1@domain1', 'local2@domain2')\n var authInHost =\n result.host && result.host.indexOf(\"@\") > 0\n ? result.host.split(\"@\")\n : false;\n if (authInHost) {\n result.auth = authInHost.shift();\n result.host = result.hostname = authInHost.shift();\n }\n }\n\n mustEndAbs = mustEndAbs || (result.host && srcPath.length);\n\n if (mustEndAbs && !isAbsolute) {\n srcPath.unshift(\"\");\n }\n\n if (!srcPath.length) {\n result.pathname = null;\n result.path = null;\n } else {\n result.pathname = srcPath.join(\"/\");\n }\n\n //to support request.http\n if (!util.isNull(result.pathname) || !util.isNull(result.search)) {\n result.path =\n (result.pathname ? result.pathname : \"\") +\n (result.search ? result.search : \"\");\n }\n result.auth = relative.auth || result.auth;\n result.slashes = result.slashes || relative.slashes;\n result.href = result.format();\n return result;\n };\n\n Url.prototype.parseHost = function() {\n var host = this.host;\n var port = portPattern.exec(host);\n if (port) {\n port = port[0];\n if (port !== \":\") {\n this.port = port.substr(1);\n }\n host = host.substr(0, host.length - port.length);\n }\n if (host) this.hostname = host;\n };\n },\n { \"./util\": 163, punycode: 113, querystring: 116 }\n ],\n 163: [\n function(require, module, exports) {\n \"use strict\";\n\n module.exports = {\n isString: function(arg) {\n return typeof arg === \"string\";\n },\n isObject: function(arg) {\n return typeof arg === \"object\" && arg !== null;\n },\n isNull: function(arg) {\n return arg === null;\n },\n isNullOrUndefined: function(arg) {\n return arg == null;\n }\n };\n },\n {}\n ],\n 164: [\n function(require, module, exports) {\n (function(global) {\n /**\n * Module exports.\n */\n\n module.exports = deprecate;\n\n /**\n * Mark that a method should not be used.\n * Returns a modified function which warns once by default.\n *\n * If `localStorage.noDeprecation = true` is set, then it is a no-op.\n *\n * If `localStorage.throwDeprecation = true` is set, then deprecated functions\n * will throw an Error when invoked.\n *\n * If `localStorage.traceDeprecation = true` is set, then deprecated functions\n * will invoke `console.trace()` instead of `console.error()`.\n *\n * @param {Function} fn - the function to deprecate\n * @param {String} msg - the string to print to the console when `fn` is invoked\n * @returns {Function} a new \"deprecated\" version of `fn`\n * @api public\n */\n\n function deprecate(fn, msg) {\n if (config(\"noDeprecation\")) {\n return fn;\n }\n\n var warned = false;\n function deprecated() {\n if (!warned) {\n if (config(\"throwDeprecation\")) {\n throw new Error(msg);\n } else if (config(\"traceDeprecation\")) {\n console.trace(msg);\n } else {\n console.warn(msg);\n }\n warned = true;\n }\n return fn.apply(this, arguments);\n }\n\n return deprecated;\n }\n\n /**\n * Checks `localStorage` for boolean values for the given `name`.\n *\n * @param {String} name\n * @returns {Boolean}\n * @api private\n */\n\n function config(name) {\n // accessing global.localStorage can trigger a DOMException in sandboxed iframes\n try {\n if (!global.localStorage) return false;\n } catch (_) {\n return false;\n }\n var val = global.localStorage[name];\n if (null == val) return false;\n return String(val).toLowerCase() === \"true\";\n }\n }.call(\n this,\n typeof global !== \"undefined\"\n ? global\n : typeof self !== \"undefined\"\n ? self\n : typeof window !== \"undefined\"\n ? window\n : {}\n ));\n },\n {}\n ],\n 165: [\n function(require, module, exports) {\n module.exports = extend;\n\n var hasOwnProperty = Object.prototype.hasOwnProperty;\n\n function extend() {\n var target = {};\n\n for (var i = 0; i < arguments.length; i++) {\n var source = arguments[i];\n\n for (var key in source) {\n if (hasOwnProperty.call(source, key)) {\n target[key] = source[key];\n }\n }\n }\n\n return target;\n }\n },\n {}\n ],\n 166: [\n function(require, module, exports) {\n /*!\n * HTML Parser By John Resig (ejohn.org)\n * Modified by Juriy \"kangax\" Zaytsev\n * Original code by Erik Arvidsson, Mozilla Public License\n * http://erik.eae.net/simplehtmlparser/simplehtmlparser.js\n */\n\n /*\n * // Use like so:\n * HTMLParser(htmlString, {\n * start: function(tag, attrs, unary) {},\n * end: function(tag) {},\n * chars: function(text) {},\n * comment: function(text) {}\n * });\n *\n * // or to get an XML string:\n * HTMLtoXML(htmlString);\n *\n * // or to get an XML DOM Document\n * HTMLtoDOM(htmlString);\n *\n * // or to inject into an existing document/DOM node\n * HTMLtoDOM(htmlString, document);\n * HTMLtoDOM(htmlString, document.body);\n *\n */\n\n /* global ActiveXObject, DOMDocument */\n\n \"use strict\";\n\n var createMapFromString = require(\"./utils\").createMapFromString;\n\n function makeMap(values) {\n return createMapFromString(values, true);\n }\n\n // Regular Expressions for parsing tags and attributes\n var singleAttrIdentifier = /([^\\s\"'<>/=]+)/,\n singleAttrAssigns = [/=/],\n singleAttrValues = [\n // attr value double quotes\n /\"([^\"]*)\"+/.source,\n // attr value, single quotes\n /'([^']*)'+/.source,\n // attr value, no quotes\n /([^ \\t\\n\\f\\r\"'`=<>]+)/.source\n ],\n // https://www.w3.org/TR/1999/REC-xml-names-19990114/#NT-QName\n qnameCapture = (function() {\n // based on https://www.npmjs.com/package/ncname\n var combiningChar =\n \"\\\\u0300-\\\\u0345\\\\u0360\\\\u0361\\\\u0483-\\\\u0486\\\\u0591-\\\\u05A1\\\\u05A3-\\\\u05B9\\\\u05BB-\\\\u05BD\\\\u05BF\\\\u05C1\\\\u05C2\\\\u05C4\\\\u064B-\\\\u0652\\\\u0670\\\\u06D6-\\\\u06E4\\\\u06E7\\\\u06E8\\\\u06EA-\\\\u06ED\\\\u0901-\\\\u0903\\\\u093C\\\\u093E-\\\\u094D\\\\u0951-\\\\u0954\\\\u0962\\\\u0963\\\\u0981-\\\\u0983\\\\u09BC\\\\u09BE-\\\\u09C4\\\\u09C7\\\\u09C8\\\\u09CB-\\\\u09CD\\\\u09D7\\\\u09E2\\\\u09E3\\\\u0A02\\\\u0A3C\\\\u0A3E-\\\\u0A42\\\\u0A47\\\\u0A48\\\\u0A4B-\\\\u0A4D\\\\u0A70\\\\u0A71\\\\u0A81-\\\\u0A83\\\\u0ABC\\\\u0ABE-\\\\u0AC5\\\\u0AC7-\\\\u0AC9\\\\u0ACB-\\\\u0ACD\\\\u0B01-\\\\u0B03\\\\u0B3C\\\\u0B3E-\\\\u0B43\\\\u0B47\\\\u0B48\\\\u0B4B-\\\\u0B4D\\\\u0B56\\\\u0B57\\\\u0B82\\\\u0B83\\\\u0BBE-\\\\u0BC2\\\\u0BC6-\\\\u0BC8\\\\u0BCA-\\\\u0BCD\\\\u0BD7\\\\u0C01-\\\\u0C03\\\\u0C3E-\\\\u0C44\\\\u0C46-\\\\u0C48\\\\u0C4A-\\\\u0C4D\\\\u0C55\\\\u0C56\\\\u0C82\\\\u0C83\\\\u0CBE-\\\\u0CC4\\\\u0CC6-\\\\u0CC8\\\\u0CCA-\\\\u0CCD\\\\u0CD5\\\\u0CD6\\\\u0D02\\\\u0D03\\\\u0D3E-\\\\u0D43\\\\u0D46-\\\\u0D48\\\\u0D4A-\\\\u0D4D\\\\u0D57\\\\u0E31\\\\u0E34-\\\\u0E3A\\\\u0E47-\\\\u0E4E\\\\u0EB1\\\\u0EB4-\\\\u0EB9\\\\u0EBB\\\\u0EBC\\\\u0EC8-\\\\u0ECD\\\\u0F18\\\\u0F19\\\\u0F35\\\\u0F37\\\\u0F39\\\\u0F3E\\\\u0F3F\\\\u0F71-\\\\u0F84\\\\u0F86-\\\\u0F8B\\\\u0F90-\\\\u0F95\\\\u0F97\\\\u0F99-\\\\u0FAD\\\\u0FB1-\\\\u0FB7\\\\u0FB9\\\\u20D0-\\\\u20DC\\\\u20E1\\\\u302A-\\\\u302F\\\\u3099\\\\u309A\";\n var digit =\n \"0-9\\\\u0660-\\\\u0669\\\\u06F0-\\\\u06F9\\\\u0966-\\\\u096F\\\\u09E6-\\\\u09EF\\\\u0A66-\\\\u0A6F\\\\u0AE6-\\\\u0AEF\\\\u0B66-\\\\u0B6F\\\\u0BE7-\\\\u0BEF\\\\u0C66-\\\\u0C6F\\\\u0CE6-\\\\u0CEF\\\\u0D66-\\\\u0D6F\\\\u0E50-\\\\u0E59\\\\u0ED0-\\\\u0ED9\\\\u0F20-\\\\u0F29\";\n var extender =\n \"\\\\xB7\\\\u02D0\\\\u02D1\\\\u0387\\\\u0640\\\\u0E46\\\\u0EC6\\\\u3005\\\\u3031-\\\\u3035\\\\u309D\\\\u309E\\\\u30FC-\\\\u30FE\";\n var letter =\n \"A-Za-z\\\\xC0-\\\\xD6\\\\xD8-\\\\xF6\\\\xF8-\\\\u0131\\\\u0134-\\\\u013E\\\\u0141-\\\\u0148\\\\u014A-\\\\u017E\\\\u0180-\\\\u01C3\\\\u01CD-\\\\u01F0\\\\u01F4\\\\u01F5\\\\u01FA-\\\\u0217\\\\u0250-\\\\u02A8\\\\u02BB-\\\\u02C1\\\\u0386\\\\u0388-\\\\u038A\\\\u038C\\\\u038E-\\\\u03A1\\\\u03A3-\\\\u03CE\\\\u03D0-\\\\u03D6\\\\u03DA\\\\u03DC\\\\u03DE\\\\u03E0\\\\u03E2-\\\\u03F3\\\\u0401-\\\\u040C\\\\u040E-\\\\u044F\\\\u0451-\\\\u045C\\\\u045E-\\\\u0481\\\\u0490-\\\\u04C4\\\\u04C7\\\\u04C8\\\\u04CB\\\\u04CC\\\\u04D0-\\\\u04EB\\\\u04EE-\\\\u04F5\\\\u04F8\\\\u04F9\\\\u0531-\\\\u0556\\\\u0559\\\\u0561-\\\\u0586\\\\u05D0-\\\\u05EA\\\\u05F0-\\\\u05F2\\\\u0621-\\\\u063A\\\\u0641-\\\\u064A\\\\u0671-\\\\u06B7\\\\u06BA-\\\\u06BE\\\\u06C0-\\\\u06CE\\\\u06D0-\\\\u06D3\\\\u06D5\\\\u06E5\\\\u06E6\\\\u0905-\\\\u0939\\\\u093D\\\\u0958-\\\\u0961\\\\u0985-\\\\u098C\\\\u098F\\\\u0990\\\\u0993-\\\\u09A8\\\\u09AA-\\\\u09B0\\\\u09B2\\\\u09B6-\\\\u09B9\\\\u09DC\\\\u09DD\\\\u09DF-\\\\u09E1\\\\u09F0\\\\u09F1\\\\u0A05-\\\\u0A0A\\\\u0A0F\\\\u0A10\\\\u0A13-\\\\u0A28\\\\u0A2A-\\\\u0A30\\\\u0A32\\\\u0A33\\\\u0A35\\\\u0A36\\\\u0A38\\\\u0A39\\\\u0A59-\\\\u0A5C\\\\u0A5E\\\\u0A72-\\\\u0A74\\\\u0A85-\\\\u0A8B\\\\u0A8D\\\\u0A8F-\\\\u0A91\\\\u0A93-\\\\u0AA8\\\\u0AAA-\\\\u0AB0\\\\u0AB2\\\\u0AB3\\\\u0AB5-\\\\u0AB9\\\\u0ABD\\\\u0AE0\\\\u0B05-\\\\u0B0C\\\\u0B0F\\\\u0B10\\\\u0B13-\\\\u0B28\\\\u0B2A-\\\\u0B30\\\\u0B32\\\\u0B33\\\\u0B36-\\\\u0B39\\\\u0B3D\\\\u0B5C\\\\u0B5D\\\\u0B5F-\\\\u0B61\\\\u0B85-\\\\u0B8A\\\\u0B8E-\\\\u0B90\\\\u0B92-\\\\u0B95\\\\u0B99\\\\u0B9A\\\\u0B9C\\\\u0B9E\\\\u0B9F\\\\u0BA3\\\\u0BA4\\\\u0BA8-\\\\u0BAA\\\\u0BAE-\\\\u0BB5\\\\u0BB7-\\\\u0BB9\\\\u0C05-\\\\u0C0C\\\\u0C0E-\\\\u0C10\\\\u0C12-\\\\u0C28\\\\u0C2A-\\\\u0C33\\\\u0C35-\\\\u0C39\\\\u0C60\\\\u0C61\\\\u0C85-\\\\u0C8C\\\\u0C8E-\\\\u0C90\\\\u0C92-\\\\u0CA8\\\\u0CAA-\\\\u0CB3\\\\u0CB5-\\\\u0CB9\\\\u0CDE\\\\u0CE0\\\\u0CE1\\\\u0D05-\\\\u0D0C\\\\u0D0E-\\\\u0D10\\\\u0D12-\\\\u0D28\\\\u0D2A-\\\\u0D39\\\\u0D60\\\\u0D61\\\\u0E01-\\\\u0E2E\\\\u0E30\\\\u0E32\\\\u0E33\\\\u0E40-\\\\u0E45\\\\u0E81\\\\u0E82\\\\u0E84\\\\u0E87\\\\u0E88\\\\u0E8A\\\\u0E8D\\\\u0E94-\\\\u0E97\\\\u0E99-\\\\u0E9F\\\\u0EA1-\\\\u0EA3\\\\u0EA5\\\\u0EA7\\\\u0EAA\\\\u0EAB\\\\u0EAD\\\\u0EAE\\\\u0EB0\\\\u0EB2\\\\u0EB3\\\\u0EBD\\\\u0EC0-\\\\u0EC4\\\\u0F40-\\\\u0F47\\\\u0F49-\\\\u0F69\\\\u10A0-\\\\u10C5\\\\u10D0-\\\\u10F6\\\\u1100\\\\u1102\\\\u1103\\\\u1105-\\\\u1107\\\\u1109\\\\u110B\\\\u110C\\\\u110E-\\\\u1112\\\\u113C\\\\u113E\\\\u1140\\\\u114C\\\\u114E\\\\u1150\\\\u1154\\\\u1155\\\\u1159\\\\u115F-\\\\u1161\\\\u1163\\\\u1165\\\\u1167\\\\u1169\\\\u116D\\\\u116E\\\\u1172\\\\u1173\\\\u1175\\\\u119E\\\\u11A8\\\\u11AB\\\\u11AE\\\\u11AF\\\\u11B7\\\\u11B8\\\\u11BA\\\\u11BC-\\\\u11C2\\\\u11EB\\\\u11F0\\\\u11F9\\\\u1E00-\\\\u1E9B\\\\u1EA0-\\\\u1EF9\\\\u1F00-\\\\u1F15\\\\u1F18-\\\\u1F1D\\\\u1F20-\\\\u1F45\\\\u1F48-\\\\u1F4D\\\\u1F50-\\\\u1F57\\\\u1F59\\\\u1F5B\\\\u1F5D\\\\u1F5F-\\\\u1F7D\\\\u1F80-\\\\u1FB4\\\\u1FB6-\\\\u1FBC\\\\u1FBE\\\\u1FC2-\\\\u1FC4\\\\u1FC6-\\\\u1FCC\\\\u1FD0-\\\\u1FD3\\\\u1FD6-\\\\u1FDB\\\\u1FE0-\\\\u1FEC\\\\u1FF2-\\\\u1FF4\\\\u1FF6-\\\\u1FFC\\\\u2126\\\\u212A\\\\u212B\\\\u212E\\\\u2180-\\\\u2182\\\\u3007\\\\u3021-\\\\u3029\\\\u3041-\\\\u3094\\\\u30A1-\\\\u30FA\\\\u3105-\\\\u312C\\\\u4E00-\\\\u9FA5\\\\uAC00-\\\\uD7A3\";\n var ncname =\n \"[\" +\n letter +\n \"_][\" +\n letter +\n digit +\n \"\\\\.\\\\-_\" +\n combiningChar +\n extender +\n \"]*\";\n return \"((?:\" + ncname + \"\\\\:)?\" + ncname + \")\";\n })(),\n startTagOpen = new RegExp(\"^<\" + qnameCapture),\n startTagClose = /^\\s*(\\/?)>/,\n endTag = new RegExp(\"^<\\\\/\" + qnameCapture + \"[^>]*>\"),\n doctype = /^]+>/i;\n\n var IS_REGEX_CAPTURING_BROKEN = false;\n \"x\".replace(/x(.)?/g, function(m, g) {\n IS_REGEX_CAPTURING_BROKEN = g === \"\";\n });\n\n // Empty Elements\n var empty = makeMap(\n \"area,base,basefont,br,col,embed,frame,hr,img,input,isindex,keygen,link,meta,param,source,track,wbr\"\n );\n\n // Inline Elements\n var inline = makeMap(\n \"a,abbr,acronym,applet,b,basefont,bdo,big,br,button,cite,code,del,dfn,em,font,i,iframe,img,input,ins,kbd,label,map,noscript,object,q,s,samp,script,select,small,span,strike,strong,sub,sup,svg,textarea,tt,u,var\"\n );\n\n // Elements that you can, intentionally, leave open\n // (and which close themselves)\n var closeSelf = makeMap(\n \"colgroup,dd,dt,li,option,p,td,tfoot,th,thead,tr,source\"\n );\n\n // Attributes that have their values filled in disabled='disabled'\n var fillAttrs = makeMap(\n \"checked,compact,declare,defer,disabled,ismap,multiple,nohref,noresize,noshade,nowrap,readonly,selected\"\n );\n\n // Special Elements (can contain anything)\n var special = makeMap(\"script,style\");\n\n // HTML5 tags https://html.spec.whatwg.org/multipage/indices.html#elements-3\n // Phrasing Content https://html.spec.whatwg.org/multipage/dom.html#phrasing-content\n var nonPhrasing = makeMap(\n \"address,article,aside,base,blockquote,body,caption,col,colgroup,dd,details,dialog,div,dl,dt,fieldset,figcaption,figure,footer,form,h1,h2,h3,h4,h5,h6,head,header,hgroup,hr,html,legend,li,menuitem,meta,ol,optgroup,option,param,rp,rt,source,style,summary,tbody,td,tfoot,th,thead,title,tr,track,ul\"\n );\n\n var reCache = {};\n\n function attrForHandler(handler) {\n var pattern =\n singleAttrIdentifier.source +\n \"(?:\\\\s*(\" +\n joinSingleAttrAssigns(handler) +\n \")\" +\n \"[ \\\\t\\\\n\\\\f\\\\r]*(?:\" +\n singleAttrValues.join(\"|\") +\n \"))?\";\n if (handler.customAttrSurround) {\n var attrClauses = [];\n for (var i = handler.customAttrSurround.length - 1; i >= 0; i--) {\n attrClauses[i] =\n \"(?:\" +\n \"(\" +\n handler.customAttrSurround[i][0].source +\n \")\\\\s*\" +\n pattern +\n \"\\\\s*(\" +\n handler.customAttrSurround[i][1].source +\n \")\" +\n \")\";\n }\n attrClauses.push(\"(?:\" + pattern + \")\");\n pattern = \"(?:\" + attrClauses.join(\"|\") + \")\";\n }\n return new RegExp(\"^\\\\s*\" + pattern);\n }\n\n function joinSingleAttrAssigns(handler) {\n return singleAttrAssigns\n .concat(handler.customAttrAssign || [])\n .map(function(assign) {\n return \"(?:\" + assign.source + \")\";\n })\n .join(\"|\");\n }\n\n function HTMLParser(html, handler) {\n var stack = [],\n lastTag;\n var attribute = attrForHandler(handler);\n var last, prevTag, nextTag;\n while (html) {\n last = html;\n // Make sure we're not in a script or style element\n if (!lastTag || !special(lastTag)) {\n var textEnd = html.indexOf(\"<\");\n if (textEnd === 0) {\n // Comment:\n if (/^\");\n\n if (commentEnd >= 0) {\n if (handler.comment) {\n handler.comment(html.substring(4, commentEnd));\n }\n html = html.substring(commentEnd + 3);\n prevTag = \"\";\n continue;\n }\n }\n\n // https://en.wikipedia.org/wiki/Conditional_comment#Downlevel-revealed_conditional_comment\n if (/^\");\n\n if (conditionalEnd >= 0) {\n if (handler.comment) {\n handler.comment(\n html.substring(2, conditionalEnd + 1),\n true /* non-standard */\n );\n }\n html = html.substring(conditionalEnd + 2);\n prevTag = \"\";\n continue;\n }\n }\n\n // Doctype:\n var doctypeMatch = html.match(doctype);\n if (doctypeMatch) {\n if (handler.doctype) {\n handler.doctype(doctypeMatch[0]);\n }\n html = html.substring(doctypeMatch[0].length);\n prevTag = \"\";\n continue;\n }\n\n // End tag:\n var endTagMatch = html.match(endTag);\n if (endTagMatch) {\n html = html.substring(endTagMatch[0].length);\n endTagMatch[0].replace(endTag, parseEndTag);\n prevTag = \"/\" + endTagMatch[1].toLowerCase();\n continue;\n }\n\n // Start tag:\n var startTagMatch = parseStartTag(html);\n if (startTagMatch) {\n html = startTagMatch.rest;\n handleStartTag(startTagMatch);\n prevTag = startTagMatch.tagName.toLowerCase();\n continue;\n }\n\n // Treat `<` as text\n if (handler.continueOnParseError) {\n textEnd = html.indexOf(\"<\", 1);\n }\n }\n\n var text;\n if (textEnd >= 0) {\n text = html.substring(0, textEnd);\n html = html.substring(textEnd);\n } else {\n text = html;\n html = \"\";\n }\n\n // next tag\n var nextTagMatch = parseStartTag(html);\n if (nextTagMatch) {\n nextTag = nextTagMatch.tagName;\n } else {\n nextTagMatch = html.match(endTag);\n if (nextTagMatch) {\n nextTag = \"/\" + nextTagMatch[1];\n } else {\n nextTag = \"\";\n }\n }\n\n if (handler.chars) {\n handler.chars(text, prevTag, nextTag);\n }\n prevTag = \"\";\n } else {\n var stackedTag = lastTag.toLowerCase();\n var reStackedTag =\n reCache[stackedTag] ||\n (reCache[stackedTag] = new RegExp(\n \"([\\\\s\\\\S]*?)]*>\",\n \"i\"\n ));\n\n html = html.replace(reStackedTag, function(all, text) {\n if (\n stackedTag !== \"script\" &&\n stackedTag !== \"style\" &&\n stackedTag !== \"noscript\"\n ) {\n text = text\n .replace(//g, \"$1\")\n .replace(//g, \"$1\");\n }\n\n if (handler.chars) {\n handler.chars(text);\n }\n\n return \"\";\n });\n\n parseEndTag(\"\", stackedTag);\n }\n\n if (html === last) {\n throw new Error(\"Parse Error: \" + html);\n }\n }\n\n if (!handler.partialMarkup) {\n // Clean up any remaining tags\n parseEndTag();\n }\n\n function parseStartTag(input) {\n var start = input.match(startTagOpen);\n if (start) {\n var match = {\n tagName: start[1],\n attrs: []\n };\n input = input.slice(start[0].length);\n var end, attr;\n while (\n !(end = input.match(startTagClose)) &&\n (attr = input.match(attribute))\n ) {\n input = input.slice(attr[0].length);\n match.attrs.push(attr);\n }\n if (end) {\n match.unarySlash = end[1];\n match.rest = input.slice(end[0].length);\n return match;\n }\n }\n }\n\n function closeIfFound(tagName) {\n if (findTag(tagName) >= 0) {\n parseEndTag(\"\", tagName);\n return true;\n }\n }\n\n function handleStartTag(match) {\n var tagName = match.tagName;\n var unarySlash = match.unarySlash;\n\n if (handler.html5) {\n if (lastTag === \"p\" && nonPhrasing(tagName)) {\n parseEndTag(\"\", lastTag);\n } else if (tagName === \"tbody\") {\n closeIfFound(\"thead\");\n } else if (tagName === \"tfoot\") {\n if (!closeIfFound(\"tbody\")) {\n closeIfFound(\"thead\");\n }\n }\n if (tagName === \"col\" && findTag(\"colgroup\") < 0) {\n lastTag = \"colgroup\";\n stack.push({ tag: lastTag, attrs: [] });\n if (handler.start) {\n handler.start(lastTag, [], false, \"\");\n }\n }\n }\n\n if (!handler.html5 && !inline(tagName)) {\n while (lastTag && inline(lastTag)) {\n parseEndTag(\"\", lastTag);\n }\n }\n\n if (closeSelf(tagName) && lastTag === tagName) {\n parseEndTag(\"\", tagName);\n }\n\n var unary =\n empty(tagName) ||\n (tagName === \"html\" && lastTag === \"head\") ||\n !!unarySlash;\n\n var attrs = match.attrs.map(function(args) {\n var name, value, customOpen, customClose, customAssign, quote;\n var ncp = 7; // number of captured parts, scalar\n\n // hackish work around FF bug https://bugzilla.mozilla.org/show_bug.cgi?id=369778\n if (IS_REGEX_CAPTURING_BROKEN && args[0].indexOf('\"\"') === -1) {\n if (args[3] === \"\") {\n delete args[3];\n }\n if (args[4] === \"\") {\n delete args[4];\n }\n if (args[5] === \"\") {\n delete args[5];\n }\n }\n\n function populate(index) {\n customAssign = args[index];\n value = args[index + 1];\n if (typeof value !== \"undefined\") {\n return '\"';\n }\n value = args[index + 2];\n if (typeof value !== \"undefined\") {\n return \"'\";\n }\n value = args[index + 3];\n if (typeof value === \"undefined\" && fillAttrs(name)) {\n value = name;\n }\n return \"\";\n }\n\n var j = 1;\n if (handler.customAttrSurround) {\n for (\n var i = 0, l = handler.customAttrSurround.length;\n i < l;\n i++, j += ncp\n ) {\n name = args[j + 1];\n if (name) {\n quote = populate(j + 2);\n customOpen = args[j];\n customClose = args[j + 6];\n break;\n }\n }\n }\n\n if (!name && (name = args[j])) {\n quote = populate(j + 1);\n }\n\n return {\n name: name,\n value: value,\n customAssign: customAssign || \"=\",\n customOpen: customOpen || \"\",\n customClose: customClose || \"\",\n quote: quote || \"\"\n };\n });\n\n if (!unary) {\n stack.push({ tag: tagName, attrs: attrs });\n lastTag = tagName;\n unarySlash = \"\";\n }\n\n if (handler.start) {\n handler.start(tagName, attrs, unary, unarySlash);\n }\n }\n\n function findTag(tagName) {\n var pos;\n var needle = tagName.toLowerCase();\n for (pos = stack.length - 1; pos >= 0; pos--) {\n if (stack[pos].tag.toLowerCase() === needle) {\n break;\n }\n }\n return pos;\n }\n\n function parseEndTag(tag, tagName) {\n var pos;\n\n // Find the closest opened tag of the same type\n if (tagName) {\n pos = findTag(tagName);\n }\n // If no tag name is provided, clean shop\n else {\n pos = 0;\n }\n\n if (pos >= 0) {\n // Close all the open elements, up the stack\n for (var i = stack.length - 1; i >= pos; i--) {\n if (handler.end) {\n handler.end(stack[i].tag, stack[i].attrs, i > pos || !tag);\n }\n }\n\n // Remove the open elements from the stack\n stack.length = pos;\n lastTag = pos && stack[pos - 1].tag;\n } else if (tagName.toLowerCase() === \"br\") {\n if (handler.start) {\n handler.start(tagName, [], true, \"\");\n }\n } else if (tagName.toLowerCase() === \"p\") {\n if (handler.start) {\n handler.start(tagName, [], false, \"\", true);\n }\n if (handler.end) {\n handler.end(tagName, []);\n }\n }\n }\n }\n\n exports.HTMLParser = HTMLParser;\n exports.HTMLtoXML = function(html) {\n var results = \"\";\n\n new HTMLParser(html, {\n start: function(tag, attrs, unary) {\n results += \"<\" + tag;\n\n for (var i = 0, len = attrs.length; i < len; i++) {\n results +=\n \" \" +\n attrs[i].name +\n '=\"' +\n (attrs[i].value || \"\").replace(/\"/g, \""\") +\n '\"';\n }\n\n results += (unary ? \"/\" : \"\") + \">\";\n },\n end: function(tag) {\n results += \"\";\n },\n chars: function(text) {\n results += text;\n },\n comment: function(text) {\n results += \"\";\n },\n ignore: function(text) {\n results += text;\n }\n });\n\n return results;\n };\n\n exports.HTMLtoDOM = function(html, doc) {\n // There can be only one of these elements\n var one = {\n html: true,\n head: true,\n body: true,\n title: true\n };\n\n // Enforce a structure for the document\n var structure = {\n link: \"head\",\n base: \"head\"\n };\n\n if (doc) {\n doc =\n doc.ownerDocument ||\n (doc.getOwnerDocument && doc.getOwnerDocument()) ||\n doc;\n } else if (typeof DOMDocument !== \"undefined\") {\n doc = new DOMDocument();\n } else if (\n typeof document !== \"undefined\" &&\n document.implementation &&\n document.implementation.createDocument\n ) {\n doc = document.implementation.createDocument(\"\", \"\", null);\n } else if (typeof ActiveX !== \"undefined\") {\n doc = new ActiveXObject(\"Msxml.DOMDocument\");\n }\n\n var elems = [],\n documentElement =\n doc.documentElement ||\n (doc.getDocumentElement && doc.getDocumentElement());\n\n // If we're dealing with an empty document then we\n // need to pre-populate it with the HTML document structure\n if (!documentElement && doc.createElement) {\n (function() {\n var html = doc.createElement(\"html\");\n var head = doc.createElement(\"head\");\n head.appendChild(doc.createElement(\"title\"));\n html.appendChild(head);\n html.appendChild(doc.createElement(\"body\"));\n doc.appendChild(html);\n })();\n }\n\n // Find all the unique elements\n if (doc.getElementsByTagName) {\n for (var i in one) {\n one[i] = doc.getElementsByTagName(i)[0];\n }\n }\n\n // If we're working with a document, inject contents into\n // the body element\n var curParentNode = one.body;\n\n new HTMLParser(html, {\n start: function(tagName, attrs, unary) {\n // If it's a pre-built element, then we can ignore\n // its construction\n if (one[tagName]) {\n curParentNode = one[tagName];\n return;\n }\n\n var elem = doc.createElement(tagName);\n\n for (var attr in attrs) {\n elem.setAttribute(attrs[attr].name, attrs[attr].value);\n }\n\n if (\n structure[tagName] &&\n typeof one[structure[tagName]] !== \"boolean\"\n ) {\n one[structure[tagName]].appendChild(elem);\n } else if (curParentNode && curParentNode.appendChild) {\n curParentNode.appendChild(elem);\n }\n\n if (!unary) {\n elems.push(elem);\n curParentNode = elem;\n }\n },\n end: function(/* tag */) {\n elems.length -= 1;\n\n // Init the new parentNode\n curParentNode = elems[elems.length - 1];\n },\n chars: function(text) {\n curParentNode.appendChild(doc.createTextNode(text));\n },\n comment: function(/* text */) {\n // create comment node\n },\n ignore: function(/* text */) {\n // What to do here?\n }\n });\n\n return doc;\n };\n },\n { \"./utils\": 168 }\n ],\n 167: [\n function(require, module, exports) {\n \"use strict\";\n\n function Sorter() {}\n\n Sorter.prototype.sort = function(tokens, fromIndex) {\n fromIndex = fromIndex || 0;\n for (var i = 0, len = this.keys.length; i < len; i++) {\n var key = this.keys[i];\n var token = key.slice(1);\n var index = tokens.indexOf(token, fromIndex);\n if (index !== -1) {\n do {\n if (index !== fromIndex) {\n tokens.splice(index, 1);\n tokens.splice(fromIndex, 0, token);\n }\n fromIndex++;\n } while ((index = tokens.indexOf(token, fromIndex)) !== -1);\n return this[key].sort(tokens, fromIndex);\n }\n }\n return tokens;\n };\n\n function TokenChain() {}\n\n TokenChain.prototype = {\n add: function(tokens) {\n var self = this;\n tokens.forEach(function(token) {\n var key = \"$\" + token;\n if (!self[key]) {\n self[key] = [];\n self[key].processed = 0;\n }\n self[key].push(tokens);\n });\n },\n createSorter: function() {\n var self = this;\n var sorter = new Sorter();\n sorter.keys = Object.keys(self)\n .sort(function(j, k) {\n var m = self[j].length;\n var n = self[k].length;\n return m < n ? 1 : m > n ? -1 : j < k ? -1 : j > k ? 1 : 0;\n })\n .filter(function(key) {\n if (self[key].processed < self[key].length) {\n var token = key.slice(1);\n var chain = new TokenChain();\n self[key].forEach(function(tokens) {\n var index;\n while ((index = tokens.indexOf(token)) !== -1) {\n tokens.splice(index, 1);\n }\n tokens.forEach(function(token) {\n self[\"$\" + token].processed++;\n });\n chain.add(tokens.slice(0));\n });\n sorter[key] = chain.createSorter();\n return true;\n }\n return false;\n });\n return sorter;\n }\n };\n\n module.exports = TokenChain;\n },\n {}\n ],\n 168: [\n function(require, module, exports) {\n \"use strict\";\n\n function createMap(values, ignoreCase) {\n var map = {};\n values.forEach(function(value) {\n map[value] = 1;\n });\n return ignoreCase\n ? function(value) {\n return map[value.toLowerCase()] === 1;\n }\n : function(value) {\n return map[value] === 1;\n };\n }\n\n exports.createMap = createMap;\n exports.createMapFromString = function(values, ignoreCase) {\n return createMap(values.split(/,/), ignoreCase);\n };\n },\n {}\n ],\n \"html-minifier\": [\n function(require, module, exports) {\n \"use strict\";\n\n var CleanCSS = require(\"clean-css\");\n var decode = require(\"he\").decode;\n var HTMLParser = require(\"./htmlparser\").HTMLParser;\n var RelateUrl = require(\"relateurl\");\n var TokenChain = require(\"./tokenchain\");\n var UglifyJS = require(\"uglify-js\");\n var utils = require(\"./utils\");\n\n function trimWhitespace(str) {\n return (\n str && str.replace(/^[ \\n\\r\\t\\f]+/, \"\").replace(/[ \\n\\r\\t\\f]+$/, \"\")\n );\n }\n\n function collapseWhitespaceAll(str) {\n // Non-breaking space is specifically handled inside the replacer function here:\n return (\n str &&\n str.replace(/[ \\n\\r\\t\\f\\xA0]+/g, function(spaces) {\n return spaces === \"\\t\"\n ? \"\\t\"\n : spaces.replace(/(^|\\xA0+)[^\\xA0]+/g, \"$1 \");\n })\n );\n }\n\n function collapseWhitespace(\n str,\n options,\n trimLeft,\n trimRight,\n collapseAll\n ) {\n var lineBreakBefore = \"\",\n lineBreakAfter = \"\";\n\n if (options.preserveLineBreaks) {\n str = str\n .replace(/^[ \\n\\r\\t\\f]*?[\\n\\r][ \\n\\r\\t\\f]*/, function() {\n lineBreakBefore = \"\\n\";\n return \"\";\n })\n .replace(/[ \\n\\r\\t\\f]*?[\\n\\r][ \\n\\r\\t\\f]*$/, function() {\n lineBreakAfter = \"\\n\";\n return \"\";\n });\n }\n\n if (trimLeft) {\n // Non-breaking space is specifically handled inside the replacer function here:\n str = str.replace(/^[ \\n\\r\\t\\f\\xA0]+/, function(spaces) {\n var conservative =\n !lineBreakBefore && options.conservativeCollapse;\n if (conservative && spaces === \"\\t\") {\n return \"\\t\";\n }\n return (\n spaces\n .replace(/^[^\\xA0]+/, \"\")\n .replace(/(\\xA0+)[^\\xA0]+/g, \"$1 \") ||\n (conservative ? \" \" : \"\")\n );\n });\n }\n\n if (trimRight) {\n // Non-breaking space is specifically handled inside the replacer function here:\n str = str.replace(/[ \\n\\r\\t\\f\\xA0]+$/, function(spaces) {\n var conservative =\n !lineBreakAfter && options.conservativeCollapse;\n if (conservative && spaces === \"\\t\") {\n return \"\\t\";\n }\n return (\n spaces\n .replace(/[^\\xA0]+(\\xA0+)/g, \" $1\")\n .replace(/[^\\xA0]+$/, \"\") || (conservative ? \" \" : \"\")\n );\n });\n }\n\n if (collapseAll) {\n // strip non space whitespace then compress spaces to one\n str = collapseWhitespaceAll(str);\n }\n\n return lineBreakBefore + str + lineBreakAfter;\n }\n\n var createMapFromString = utils.createMapFromString;\n // non-empty tags that will maintain whitespace around them\n var inlineTags = createMapFromString(\n \"a,abbr,acronym,b,bdi,bdo,big,button,cite,code,del,dfn,em,font,i,ins,kbd,label,mark,math,nobr,object,q,rp,rt,rtc,ruby,s,samp,select,small,span,strike,strong,sub,sup,svg,textarea,time,tt,u,var\"\n );\n // non-empty tags that will maintain whitespace within them\n var inlineTextTags = createMapFromString(\n \"a,abbr,acronym,b,big,del,em,font,i,ins,kbd,mark,nobr,rp,s,samp,small,span,strike,strong,sub,sup,time,tt,u,var\"\n );\n // self-closing tags that will maintain whitespace around them\n var selfClosingInlineTags = createMapFromString(\n \"comment,img,input,wbr\"\n );\n\n function collapseWhitespaceSmart(str, prevTag, nextTag, options) {\n var trimLeft = prevTag && !selfClosingInlineTags(prevTag);\n if (trimLeft && !options.collapseInlineTagWhitespace) {\n trimLeft =\n prevTag.charAt(0) === \"/\"\n ? !inlineTags(prevTag.slice(1))\n : !inlineTextTags(prevTag);\n }\n var trimRight = nextTag && !selfClosingInlineTags(nextTag);\n if (trimRight && !options.collapseInlineTagWhitespace) {\n trimRight =\n nextTag.charAt(0) === \"/\"\n ? !inlineTextTags(nextTag.slice(1))\n : !inlineTags(nextTag);\n }\n return collapseWhitespace(\n str,\n options,\n trimLeft,\n trimRight,\n prevTag && nextTag\n );\n }\n\n function isConditionalComment(text) {\n return /^\\[if\\s[^\\]]+]|\\[endif]$/.test(text);\n }\n\n function isIgnoredComment(text, options) {\n for (\n var i = 0, len = options.ignoreCustomComments.length;\n i < len;\n i++\n ) {\n if (options.ignoreCustomComments[i].test(text)) {\n return true;\n }\n }\n return false;\n }\n\n function isEventAttribute(attrName, options) {\n var patterns = options.customEventAttributes;\n if (patterns) {\n for (var i = patterns.length; i--; ) {\n if (patterns[i].test(attrName)) {\n return true;\n }\n }\n return false;\n }\n return /^on[a-z]{3,}$/.test(attrName);\n }\n\n function canRemoveAttributeQuotes(value) {\n // https://mathiasbynens.be/notes/unquoted-attribute-values\n return /^[^ \\t\\n\\f\\r\"'`=<>]+$/.test(value);\n }\n\n function attributesInclude(attributes, attribute) {\n for (var i = attributes.length; i--; ) {\n if (attributes[i].name.toLowerCase() === attribute) {\n return true;\n }\n }\n return false;\n }\n\n function isAttributeRedundant(tag, attrName, attrValue, attrs) {\n attrValue = attrValue ? trimWhitespace(attrValue.toLowerCase()) : \"\";\n\n return (\n (tag === \"script\" &&\n attrName === \"language\" &&\n attrValue === \"javascript\") ||\n (tag === \"form\" && attrName === \"method\" && attrValue === \"get\") ||\n (tag === \"input\" && attrName === \"type\" && attrValue === \"text\") ||\n (tag === \"script\" &&\n attrName === \"charset\" &&\n !attributesInclude(attrs, \"src\")) ||\n (tag === \"a\" &&\n attrName === \"name\" &&\n attributesInclude(attrs, \"id\")) ||\n (tag === \"area\" && attrName === \"shape\" && attrValue === \"rect\")\n );\n }\n\n // https://mathiasbynens.be/demo/javascript-mime-type\n // https://developer.mozilla.org/en/docs/Web/HTML/Element/script#attr-type\n var executableScriptsMimetypes = utils.createMap([\n \"text/javascript\",\n \"text/ecmascript\",\n \"text/jscript\",\n \"application/javascript\",\n \"application/x-javascript\",\n \"application/ecmascript\"\n ]);\n\n function isScriptTypeAttribute(attrValue) {\n attrValue = trimWhitespace(attrValue.split(/;/, 2)[0]).toLowerCase();\n return attrValue === \"\" || executableScriptsMimetypes(attrValue);\n }\n\n function isExecutableScript(tag, attrs) {\n if (tag !== \"script\") {\n return false;\n }\n for (var i = 0, len = attrs.length; i < len; i++) {\n var attrName = attrs[i].name.toLowerCase();\n if (attrName === \"type\") {\n return isScriptTypeAttribute(attrs[i].value);\n }\n }\n return true;\n }\n\n function isStyleLinkTypeAttribute(attrValue) {\n attrValue = trimWhitespace(attrValue).toLowerCase();\n return attrValue === \"\" || attrValue === \"text/css\";\n }\n\n function isStyleSheet(tag, attrs) {\n if (tag !== \"style\") {\n return false;\n }\n for (var i = 0, len = attrs.length; i < len; i++) {\n var attrName = attrs[i].name.toLowerCase();\n if (attrName === \"type\") {\n return isStyleLinkTypeAttribute(attrs[i].value);\n }\n }\n return true;\n }\n\n var isSimpleBoolean = createMapFromString(\n \"allowfullscreen,async,autofocus,autoplay,checked,compact,controls,declare,default,defaultchecked,defaultmuted,defaultselected,defer,disabled,enabled,formnovalidate,hidden,indeterminate,inert,ismap,itemscope,loop,multiple,muted,nohref,noresize,noshade,novalidate,nowrap,open,pauseonexit,readonly,required,reversed,scoped,seamless,selected,sortable,truespeed,typemustmatch,visible\"\n );\n var isBooleanValue = createMapFromString(\"true,false\");\n\n function isBooleanAttribute(attrName, attrValue) {\n return (\n isSimpleBoolean(attrName) ||\n (attrName === \"draggable\" && !isBooleanValue(attrValue))\n );\n }\n\n function isUriTypeAttribute(attrName, tag) {\n return (\n (/^(?:a|area|link|base)$/.test(tag) && attrName === \"href\") ||\n (tag === \"img\" && /^(?:src|longdesc|usemap)$/.test(attrName)) ||\n (tag === \"object\" &&\n /^(?:classid|codebase|data|usemap)$/.test(attrName)) ||\n (tag === \"q\" && attrName === \"cite\") ||\n (tag === \"blockquote\" && attrName === \"cite\") ||\n ((tag === \"ins\" || tag === \"del\") && attrName === \"cite\") ||\n (tag === \"form\" && attrName === \"action\") ||\n (tag === \"input\" &&\n (attrName === \"src\" || attrName === \"usemap\")) ||\n (tag === \"head\" && attrName === \"profile\") ||\n (tag === \"script\" && (attrName === \"src\" || attrName === \"for\"))\n );\n }\n\n function isNumberTypeAttribute(attrName, tag) {\n return (\n (/^(?:a|area|object|button)$/.test(tag) &&\n attrName === \"tabindex\") ||\n (tag === \"input\" &&\n (attrName === \"maxlength\" || attrName === \"tabindex\")) ||\n (tag === \"select\" &&\n (attrName === \"size\" || attrName === \"tabindex\")) ||\n (tag === \"textarea\" && /^(?:rows|cols|tabindex)$/.test(attrName)) ||\n (tag === \"colgroup\" && attrName === \"span\") ||\n (tag === \"col\" && attrName === \"span\") ||\n ((tag === \"th\" || tag === \"td\") &&\n (attrName === \"rowspan\" || attrName === \"colspan\"))\n );\n }\n\n function isLinkType(tag, attrs, value) {\n if (tag !== \"link\") {\n return false;\n }\n for (var i = 0, len = attrs.length; i < len; i++) {\n if (attrs[i].name === \"rel\" && attrs[i].value === value) {\n return true;\n }\n }\n }\n\n function isMediaQuery(tag, attrs, attrName) {\n return (\n attrName === \"media\" &&\n (isLinkType(tag, attrs, \"stylesheet\") || isStyleSheet(tag, attrs))\n );\n }\n\n var srcsetTags = createMapFromString(\"img,source\");\n\n function isSrcset(attrName, tag) {\n return attrName === \"srcset\" && srcsetTags(tag);\n }\n\n function cleanAttributeValue(tag, attrName, attrValue, options, attrs) {\n if (isEventAttribute(attrName, options)) {\n attrValue = trimWhitespace(attrValue).replace(\n /^javascript:\\s*/i,\n \"\"\n );\n return options.minifyJS(attrValue, true);\n } else if (attrName === \"class\") {\n attrValue = trimWhitespace(attrValue);\n if (options.sortClassName) {\n attrValue = options.sortClassName(attrValue);\n } else {\n attrValue = collapseWhitespaceAll(attrValue);\n }\n return attrValue;\n } else if (isUriTypeAttribute(attrName, tag)) {\n attrValue = trimWhitespace(attrValue);\n return isLinkType(tag, attrs, \"canonical\")\n ? attrValue\n : options.minifyURLs(attrValue);\n } else if (isNumberTypeAttribute(attrName, tag)) {\n return trimWhitespace(attrValue);\n } else if (attrName === \"style\") {\n attrValue = trimWhitespace(attrValue);\n if (attrValue) {\n if (\n /;$/.test(attrValue) &&\n !/&#?[0-9a-zA-Z]+;$/.test(attrValue)\n ) {\n attrValue = attrValue.replace(/\\s*;$/, \";\");\n }\n attrValue = options.minifyCSS(attrValue, \"inline\");\n }\n return attrValue;\n } else if (isSrcset(attrName, tag)) {\n // https://html.spec.whatwg.org/multipage/embedded-content.html#attr-img-srcset\n attrValue = trimWhitespace(attrValue)\n .split(/\\s+,\\s*|\\s*,\\s+/)\n .map(function(candidate) {\n var url = candidate;\n var descriptor = \"\";\n var match = candidate.match(\n /\\s+([1-9][0-9]*w|[0-9]+(?:\\.[0-9]+)?x)$/\n );\n if (match) {\n url = url.slice(0, -match[0].length);\n var num = +match[1].slice(0, -1);\n var suffix = match[1].slice(-1);\n if (num !== 1 || suffix !== \"x\") {\n descriptor = \" \" + num + suffix;\n }\n }\n return options.minifyURLs(url) + descriptor;\n })\n .join(\", \");\n } else if (isMetaViewport(tag, attrs) && attrName === \"content\") {\n attrValue = attrValue\n .replace(/\\s+/g, \"\")\n .replace(/[0-9]+\\.[0-9]+/g, function(numString) {\n // \"0.90000\" -> \"0.9\"\n // \"1.0\" -> \"1\"\n // \"1.0001\" -> \"1.0001\" (unchanged)\n return (+numString).toString();\n });\n } else if (\n isContentSecurityPolicy(tag, attrs) &&\n attrName.toLowerCase() === \"content\"\n ) {\n return collapseWhitespaceAll(attrValue);\n } else if (\n options.customAttrCollapse &&\n options.customAttrCollapse.test(attrName)\n ) {\n attrValue = attrValue.replace(/\\n+|\\r+|\\s{2,}/g, \"\");\n } else if (tag === \"script\" && attrName === \"type\") {\n attrValue = trimWhitespace(attrValue.replace(/\\s*;\\s*/g, \";\"));\n } else if (isMediaQuery(tag, attrs, attrName)) {\n attrValue = trimWhitespace(attrValue);\n return options.minifyCSS(attrValue, \"media\");\n }\n return attrValue;\n }\n\n function isMetaViewport(tag, attrs) {\n if (tag !== \"meta\") {\n return false;\n }\n for (var i = 0, len = attrs.length; i < len; i++) {\n if (attrs[i].name === \"name\" && attrs[i].value === \"viewport\") {\n return true;\n }\n }\n }\n\n function isContentSecurityPolicy(tag, attrs) {\n if (tag !== \"meta\") {\n return false;\n }\n for (var i = 0, len = attrs.length; i < len; i++) {\n if (\n attrs[i].name.toLowerCase() === \"http-equiv\" &&\n attrs[i].value.toLowerCase() === \"content-security-policy\"\n ) {\n return true;\n }\n }\n }\n\n function ignoreCSS(id) {\n return (\n \"/* clean-css ignore:start */\" + id + \"/* clean-css ignore:end */\"\n );\n }\n\n // Wrap CSS declarations for CleanCSS > 3.x\n // See https://github.com/jakubpawlowicz/clean-css/issues/418\n function wrapCSS(text, type) {\n switch (type) {\n case \"inline\":\n return \"*{\" + text + \"}\";\n case \"media\":\n return \"@media \" + text + \"{a{top:0}}\";\n default:\n return text;\n }\n }\n\n function unwrapCSS(text, type) {\n var matches;\n switch (type) {\n case \"inline\":\n matches = text.match(/^\\*\\{([\\s\\S]*)\\}$/);\n break;\n case \"media\":\n matches = text.match(/^@media ([\\s\\S]*?)\\s*{[\\s\\S]*}$/);\n break;\n }\n return matches ? matches[1] : text;\n }\n\n function cleanConditionalComment(comment, options) {\n return options.processConditionalComments\n ? comment.replace(\n /^(\\[if\\s[^\\]]+]>)([\\s\\S]*?)( -1\n ) {\n return minify(text, options);\n }\n }\n return text;\n }\n\n // Tag omission rules from https://html.spec.whatwg.org/multipage/syntax.html#optional-tags\n // with the following deviations:\n // - retain if followed by \n // - , , , & follow https://www.w3.org/TR/html5/syntax.html#optional-tags\n // - retain all tags which are adjacent to non-standard HTML tags\n var optionalStartTags = createMapFromString(\n \"html,head,body,colgroup,tbody\"\n );\n var optionalEndTags = createMapFromString(\n \"html,head,body,li,dt,dd,p,rb,rt,rtc,rp,optgroup,option,colgroup,caption,thead,tbody,tfoot,tr,td,th\"\n );\n var headerTags = createMapFromString(\n \"meta,link,script,style,template,noscript\"\n );\n var descriptionTags = createMapFromString(\"dt,dd\");\n var pBlockTags = createMapFromString(\n \"address,article,aside,blockquote,details,div,dl,fieldset,figcaption,figure,footer,form,h1,h2,h3,h4,h5,h6,header,hgroup,hr,main,menu,nav,ol,p,pre,section,table,ul\"\n );\n var pInlineTags = createMapFromString(\n \"a,audio,del,ins,map,noscript,video\"\n );\n var rubyTags = createMapFromString(\"rb,rt,rtc,rp\");\n var rtcTag = createMapFromString(\"rb,rtc,rp\");\n var optionTag = createMapFromString(\"option,optgroup\");\n var tableContentTags = createMapFromString(\"tbody,tfoot\");\n var tableSectionTags = createMapFromString(\"thead,tbody,tfoot\");\n var cellTags = createMapFromString(\"td,th\");\n var topLevelTags = createMapFromString(\"html,head,body\");\n var compactTags = createMapFromString(\"html,body\");\n var looseTags = createMapFromString(\"head,colgroup,caption\");\n var trailingTags = createMapFromString(\"dt,thead\");\n var htmlTags = createMapFromString(\n \"a,abbr,acronym,address,applet,area,article,aside,audio,b,base,basefont,bdi,bdo,bgsound,big,blink,blockquote,body,br,button,canvas,caption,center,cite,code,col,colgroup,command,content,data,datalist,dd,del,details,dfn,dialog,dir,div,dl,dt,element,em,embed,fieldset,figcaption,figure,font,footer,form,frame,frameset,h1,h2,h3,h4,h5,h6,head,header,hgroup,hr,html,i,iframe,image,img,input,ins,isindex,kbd,keygen,label,legend,li,link,listing,main,map,mark,marquee,menu,menuitem,meta,meter,multicol,nav,nobr,noembed,noframes,noscript,object,ol,optgroup,option,output,p,param,picture,plaintext,pre,progress,q,rb,rp,rt,rtc,ruby,s,samp,script,section,select,shadow,small,source,spacer,span,strike,strong,style,sub,summary,sup,table,tbody,td,template,textarea,tfoot,th,thead,time,title,tr,track,tt,u,ul,var,video,wbr,xmp\"\n );\n\n function canRemoveParentTag(optionalStartTag, tag) {\n switch (optionalStartTag) {\n case \"html\":\n case \"head\":\n return true;\n case \"body\":\n return !headerTags(tag);\n case \"colgroup\":\n return tag === \"col\";\n case \"tbody\":\n return tag === \"tr\";\n }\n return false;\n }\n\n function isStartTagMandatory(optionalEndTag, tag) {\n switch (tag) {\n case \"colgroup\":\n return optionalEndTag === \"colgroup\";\n case \"tbody\":\n return tableSectionTags(optionalEndTag);\n }\n return false;\n }\n\n function canRemovePrecedingTag(optionalEndTag, tag) {\n switch (optionalEndTag) {\n case \"html\":\n case \"head\":\n case \"body\":\n case \"colgroup\":\n case \"caption\":\n return true;\n case \"li\":\n case \"optgroup\":\n case \"tr\":\n return tag === optionalEndTag;\n case \"dt\":\n case \"dd\":\n return descriptionTags(tag);\n case \"p\":\n return pBlockTags(tag);\n case \"rb\":\n case \"rt\":\n case \"rp\":\n return rubyTags(tag);\n case \"rtc\":\n return rtcTag(tag);\n case \"option\":\n return optionTag(tag);\n case \"thead\":\n case \"tbody\":\n return tableContentTags(tag);\n case \"tfoot\":\n return tag === \"tbody\";\n case \"td\":\n case \"th\":\n return cellTags(tag);\n }\n return false;\n }\n\n var reEmptyAttribute = new RegExp(\n \"^(?:class|id|style|title|lang|dir|on(?:focus|blur|change|click|dblclick|mouse(\" +\n \"?:down|up|over|move|out)|key(?:press|down|up)))$\"\n );\n\n function canDeleteEmptyAttribute(tag, attrName, attrValue, options) {\n var isValueEmpty = !attrValue || /^\\s*$/.test(attrValue);\n if (!isValueEmpty) {\n return false;\n }\n if (typeof options.removeEmptyAttributes === \"function\") {\n return options.removeEmptyAttributes(attrName, tag);\n }\n return (\n (tag === \"input\" && attrName === \"value\") ||\n reEmptyAttribute.test(attrName)\n );\n }\n\n function hasAttrName(name, attrs) {\n for (var i = attrs.length - 1; i >= 0; i--) {\n if (attrs[i].name === name) {\n return true;\n }\n }\n return false;\n }\n\n function canRemoveElement(tag, attrs) {\n switch (tag) {\n case \"textarea\":\n return false;\n case \"audio\":\n case \"script\":\n case \"video\":\n if (hasAttrName(\"src\", attrs)) {\n return false;\n }\n break;\n case \"iframe\":\n if (hasAttrName(\"src\", attrs) || hasAttrName(\"srcdoc\", attrs)) {\n return false;\n }\n break;\n case \"object\":\n if (hasAttrName(\"data\", attrs)) {\n return false;\n }\n break;\n case \"applet\":\n if (hasAttrName(\"code\", attrs)) {\n return false;\n }\n break;\n }\n return true;\n }\n\n function canCollapseWhitespace(tag) {\n return !/^(?:script|style|pre|textarea)$/.test(tag);\n }\n\n function canTrimWhitespace(tag) {\n return !/^(?:pre|textarea)$/.test(tag);\n }\n\n function normalizeAttr(attr, attrs, tag, options) {\n var attrName = options.name(attr.name),\n attrValue = attr.value;\n\n if (options.decodeEntities && attrValue) {\n attrValue = decode(attrValue, { isAttributeValue: true });\n }\n\n if (\n (options.removeRedundantAttributes &&\n isAttributeRedundant(tag, attrName, attrValue, attrs)) ||\n (options.removeScriptTypeAttributes &&\n tag === \"script\" &&\n attrName === \"type\" &&\n isScriptTypeAttribute(attrValue)) ||\n (options.removeStyleLinkTypeAttributes &&\n (tag === \"style\" || tag === \"link\") &&\n attrName === \"type\" &&\n isStyleLinkTypeAttribute(attrValue))\n ) {\n return;\n }\n\n if (attrValue) {\n attrValue = cleanAttributeValue(\n tag,\n attrName,\n attrValue,\n options,\n attrs\n );\n }\n\n if (\n options.removeEmptyAttributes &&\n canDeleteEmptyAttribute(tag, attrName, attrValue, options)\n ) {\n return;\n }\n\n if (options.decodeEntities && attrValue) {\n attrValue = attrValue.replace(/&(#?[0-9a-zA-Z]+;)/g, \"&$1\");\n }\n\n return {\n attr: attr,\n name: attrName,\n value: attrValue\n };\n }\n\n function buildAttr(\n normalized,\n hasUnarySlash,\n options,\n isLast,\n uidAttr\n ) {\n var attrName = normalized.name,\n attrValue = normalized.value,\n attr = normalized.attr,\n attrQuote = attr.quote,\n attrFragment,\n emittedAttrValue;\n\n if (\n typeof attrValue !== \"undefined\" &&\n (!options.removeAttributeQuotes ||\n ~attrValue.indexOf(uidAttr) ||\n !canRemoveAttributeQuotes(attrValue))\n ) {\n if (!options.preventAttributesEscaping) {\n if (typeof options.quoteCharacter === \"undefined\") {\n var apos = (attrValue.match(/'/g) || []).length;\n var quot = (attrValue.match(/\"/g) || []).length;\n attrQuote = apos < quot ? \"'\" : '\"';\n } else {\n attrQuote = options.quoteCharacter === \"'\" ? \"'\" : '\"';\n }\n if (attrQuote === '\"') {\n attrValue = attrValue.replace(/\"/g, \""\");\n } else {\n attrValue = attrValue.replace(/'/g, \"'\");\n }\n }\n emittedAttrValue = attrQuote + attrValue + attrQuote;\n if (!isLast && !options.removeTagWhitespace) {\n emittedAttrValue += \" \";\n }\n }\n // make sure trailing slash is not interpreted as HTML self-closing tag\n else if (isLast && !hasUnarySlash && !/\\/$/.test(attrValue)) {\n emittedAttrValue = attrValue;\n } else {\n emittedAttrValue = attrValue + \" \";\n }\n\n if (\n typeof attrValue === \"undefined\" ||\n (options.collapseBooleanAttributes &&\n isBooleanAttribute(\n attrName.toLowerCase(),\n attrValue.toLowerCase()\n ))\n ) {\n attrFragment = attrName;\n if (!isLast) {\n attrFragment += \" \";\n }\n } else {\n attrFragment = attrName + attr.customAssign + emittedAttrValue;\n }\n\n return attr.customOpen + attrFragment + attr.customClose;\n }\n\n function identity(value) {\n return value;\n }\n\n function processOptions(values) {\n var options = {\n name: function(name) {\n return name.toLowerCase();\n },\n canCollapseWhitespace: canCollapseWhitespace,\n canTrimWhitespace: canTrimWhitespace,\n html5: true,\n ignoreCustomComments: [/^!/],\n ignoreCustomFragments: [/<%[\\s\\S]*?%>/, /<\\?[\\s\\S]*?\\?>/],\n includeAutoGeneratedTags: true,\n log: identity,\n minifyCSS: identity,\n minifyJS: identity,\n minifyURLs: identity\n };\n Object.keys(values).forEach(function(key) {\n var value = values[key];\n if (key === \"caseSensitive\") {\n if (value) {\n options.name = identity;\n }\n } else if (key === \"log\") {\n if (typeof value === \"function\") {\n options.log = value;\n }\n } else if (key === \"minifyCSS\" && typeof value !== \"function\") {\n if (!value) {\n return;\n }\n if (typeof value !== \"object\") {\n value = {};\n }\n options.minifyCSS = function(text, type) {\n text = text.replace(\n /(url\\s*\\(\\s*)(\"|'|)(.*?)\\2(\\s*\\))/gi,\n function(match, prefix, quote, url, suffix) {\n return (\n prefix + quote + options.minifyURLs(url) + quote + suffix\n );\n }\n );\n var cleanCssOutput = new CleanCSS(value).minify(\n wrapCSS(text, type)\n );\n if (cleanCssOutput.errors.length > 0) {\n cleanCssOutput.errors.forEach(options.log);\n return text;\n }\n return unwrapCSS(cleanCssOutput.styles, type);\n };\n } else if (key === \"minifyJS\" && typeof value !== \"function\") {\n if (!value) {\n return;\n }\n if (typeof value !== \"object\") {\n value = {};\n }\n (value.parse || (value.parse = {})).bare_returns = false;\n options.minifyJS = function(text, inline) {\n var start = text.match(/^\\s*\\s*$/, \"\")\n : text;\n value.parse.bare_returns = inline;\n var result = UglifyJS.minify(code, value);\n if (result.error) {\n options.log(result.error);\n return text;\n }\n return result.code.replace(/;$/, \"\");\n };\n } else if (key === \"minifyURLs\" && typeof value !== \"function\") {\n if (!value) {\n return;\n }\n if (typeof value === \"string\") {\n value = { site: value };\n } else if (typeof value !== \"object\") {\n value = {};\n }\n options.minifyURLs = function(text) {\n try {\n return RelateUrl.relate(text, value);\n } catch (err) {\n options.log(err);\n return text;\n }\n };\n } else {\n options[key] = value;\n }\n });\n return options;\n }\n\n function uniqueId(value) {\n var id;\n do {\n id = Math.random()\n .toString(36)\n .replace(/^0\\.[0-9]*/, \"\");\n } while (~value.indexOf(id));\n return id;\n }\n\n var specialContentTags = createMapFromString(\"script,style\");\n\n function createSortFns(value, options, uidIgnore, uidAttr) {\n var attrChains = options.sortAttributes && Object.create(null);\n var classChain = options.sortClassName && new TokenChain();\n\n function attrNames(attrs) {\n return attrs.map(function(attr) {\n return options.name(attr.name);\n });\n }\n\n function shouldSkipUID(token, uid) {\n return !uid || token.indexOf(uid) === -1;\n }\n\n function shouldSkipUIDs(token) {\n return (\n shouldSkipUID(token, uidIgnore) && shouldSkipUID(token, uidAttr)\n );\n }\n\n function scan(input) {\n var currentTag, currentType;\n new HTMLParser(input, {\n start: function(tag, attrs) {\n if (attrChains) {\n if (!attrChains[tag]) {\n attrChains[tag] = new TokenChain();\n }\n attrChains[tag].add(attrNames(attrs).filter(shouldSkipUIDs));\n }\n for (var i = 0, len = attrs.length; i < len; i++) {\n var attr = attrs[i];\n if (\n classChain &&\n attr.value &&\n options.name(attr.name) === \"class\"\n ) {\n classChain.add(\n trimWhitespace(attr.value)\n .split(/[ \\t\\n\\f\\r]+/)\n .filter(shouldSkipUIDs)\n );\n } else if (\n options.processScripts &&\n attr.name.toLowerCase() === \"type\"\n ) {\n currentTag = tag;\n currentType = attr.value;\n }\n }\n },\n end: function() {\n currentTag = \"\";\n },\n chars: function(text) {\n if (\n options.processScripts &&\n specialContentTags(currentTag) &&\n options.processScripts.indexOf(currentType) > -1\n ) {\n scan(text);\n }\n }\n });\n }\n\n var log = options.log;\n options.log = identity;\n options.sortAttributes = false;\n options.sortClassName = false;\n scan(minify(value, options));\n options.log = log;\n if (attrChains) {\n var attrSorters = Object.create(null);\n for (var tag in attrChains) {\n attrSorters[tag] = attrChains[tag].createSorter();\n }\n options.sortAttributes = function(tag, attrs) {\n var sorter = attrSorters[tag];\n if (sorter) {\n var attrMap = Object.create(null);\n var names = attrNames(attrs);\n names.forEach(function(name, index) {\n (attrMap[name] || (attrMap[name] = [])).push(attrs[index]);\n });\n sorter.sort(names).forEach(function(name, index) {\n attrs[index] = attrMap[name].shift();\n });\n }\n };\n }\n if (classChain) {\n var sorter = classChain.createSorter();\n options.sortClassName = function(value) {\n return sorter.sort(value.split(/[ \\n\\f\\r]+/)).join(\" \");\n };\n }\n }\n\n function minify(value, options, partialMarkup) {\n if (options.collapseWhitespace) {\n value = collapseWhitespace(value, options, true, true);\n }\n\n var buffer = [],\n charsPrevTag,\n currentChars = \"\",\n hasChars,\n currentTag = \"\",\n currentAttrs = [],\n stackNoTrimWhitespace = [],\n stackNoCollapseWhitespace = [],\n optionalStartTag = \"\",\n optionalEndTag = \"\",\n ignoredMarkupChunks = [],\n ignoredCustomMarkupChunks = [],\n uidIgnore,\n uidAttr,\n uidPattern;\n\n // temporarily replace ignored chunks with comments,\n // so that we don't have to worry what's there.\n // for all we care there might be\n // completely-horribly-broken-alien-non-html-emoj-cthulhu-filled content\n value = value.replace(\n /([\\s\\S]*?)/g,\n function(match, group1) {\n if (!uidIgnore) {\n uidIgnore = uniqueId(value);\n var pattern = new RegExp(\"^\" + uidIgnore + \"([0-9]+)$\");\n if (options.ignoreCustomComments) {\n options.ignoreCustomComments = options.ignoreCustomComments.slice();\n } else {\n options.ignoreCustomComments = [];\n }\n options.ignoreCustomComments.push(pattern);\n }\n var token =\n \"\";\n ignoredMarkupChunks.push(group1);\n return token;\n }\n );\n\n var customFragments = options.ignoreCustomFragments.map(function(re) {\n return re.source;\n });\n if (customFragments.length) {\n var reCustomIgnore = new RegExp(\n \"\\\\s*(?:\" + customFragments.join(\"|\") + \")+\\\\s*\",\n \"g\"\n );\n // temporarily replace custom ignored fragments with unique attributes\n value = value.replace(reCustomIgnore, function(match) {\n if (!uidAttr) {\n uidAttr = uniqueId(value);\n uidPattern = new RegExp(\n \"(\\\\s*)\" + uidAttr + \"([0-9]+)\" + uidAttr + \"(\\\\s*)\",\n \"g\"\n );\n if (options.minifyCSS) {\n options.minifyCSS = (function(fn) {\n return function(text, type) {\n text = text.replace(uidPattern, function(\n match,\n prefix,\n index\n ) {\n var chunks = ignoredCustomMarkupChunks[+index];\n return (\n chunks[1] + uidAttr + index + uidAttr + chunks[2]\n );\n });\n var ids = [];\n new CleanCSS()\n .minify(wrapCSS(text, type))\n .warnings.forEach(function(warning) {\n var match = uidPattern.exec(warning);\n if (match) {\n var id = uidAttr + match[2] + uidAttr;\n text = text.replace(id, ignoreCSS(id));\n ids.push(id);\n }\n });\n text = fn(text, type);\n ids.forEach(function(id) {\n text = text.replace(ignoreCSS(id), id);\n });\n return text;\n };\n })(options.minifyCSS);\n }\n if (options.minifyJS) {\n options.minifyJS = (function(fn) {\n return function(text, type) {\n return fn(\n text.replace(uidPattern, function(\n match,\n prefix,\n index\n ) {\n var chunks = ignoredCustomMarkupChunks[+index];\n return (\n chunks[1] + uidAttr + index + uidAttr + chunks[2]\n );\n }),\n type\n );\n };\n })(options.minifyJS);\n }\n }\n var token = uidAttr + ignoredCustomMarkupChunks.length + uidAttr;\n ignoredCustomMarkupChunks.push(\n /^(\\s*)[\\s\\S]*?(\\s*)$/.exec(match)\n );\n return \"\\t\" + token + \"\\t\";\n });\n }\n\n if (\n (options.sortAttributes &&\n typeof options.sortAttributes !== \"function\") ||\n (options.sortClassName &&\n typeof options.sortClassName !== \"function\")\n ) {\n createSortFns(value, options, uidIgnore, uidAttr);\n }\n\n function _canCollapseWhitespace(tag, attrs) {\n return options.canCollapseWhitespace(\n tag,\n attrs,\n canCollapseWhitespace\n );\n }\n\n function _canTrimWhitespace(tag, attrs) {\n return options.canTrimWhitespace(tag, attrs, canTrimWhitespace);\n }\n\n function removeStartTag() {\n var index = buffer.length - 1;\n while (index > 0 && !/^<[^/!]/.test(buffer[index])) {\n index--;\n }\n buffer.length = Math.max(0, index);\n }\n\n function removeEndTag() {\n var index = buffer.length - 1;\n while (index > 0 && !/^<\\//.test(buffer[index])) {\n index--;\n }\n buffer.length = Math.max(0, index);\n }\n\n // look for trailing whitespaces, bypass any inline tags\n function trimTrailingWhitespace(index, nextTag) {\n for (\n var endTag = null;\n index >= 0 && _canTrimWhitespace(endTag);\n index--\n ) {\n var str = buffer[index];\n var match = str.match(/^<\\/([\\w:-]+)>$/);\n if (match) {\n endTag = match[1];\n } else if (\n />$/.test(str) ||\n (buffer[index] = collapseWhitespaceSmart(\n str,\n null,\n nextTag,\n options\n ))\n ) {\n break;\n }\n }\n }\n\n // look for trailing whitespaces from previously processed text\n // which may not be trimmed due to a following comment or an empty\n // element which has now been removed\n function squashTrailingWhitespace(nextTag) {\n var charsIndex = buffer.length - 1;\n if (buffer.length > 1) {\n var item = buffer[buffer.length - 1];\n if (/^(?: may be omitted if first thing inside is not comment\n // may be omitted if first thing inside is an element\n // may be omitted if first thing inside is not space, comment, ![\"Transform](\"https://api.producthunt.com/widgets/embed-image/v1/featured.svg?post_id=161868&theme=light\")
![\"Vercel\"](\"https://www.datocms-assets.com/31049/1618983297-powered-by-vercel.svg\")
\n\n## Sponsors\n\n![\"Jack](\"https://avatars.githubusercontent.com/u/92991945?v=4?s=100\")
![\"Ritesh](\"https://avatars3.githubusercontent.com/u/5389035?v=4?s=100\")
![\"Florian](\"https://avatars2.githubusercontent.com/u/47542?v=4?s=100\")
![\"Pascal](\"https://avatars1.githubusercontent.com/u/20063?v=4?s=100\")
![\"Lado](\"https://avatars3.githubusercontent.com/u/534610?v=4?s=100\")
![\"Mattia](\"https://avatars1.githubusercontent.com/u/13787614?v=4?s=100\")
![\"Mohammad](\"https://avatars3.githubusercontent.com/u/12202757?v=4?s=100\")
![\"Raathigeshan](\"https://avatars0.githubusercontent.com/u/3108160?v=4?s=100\")
![\"Gyandeep](\"https://avatars2.githubusercontent.com/u/5554486?v=4?s=100\")
![\"Matt](\"https://avatars2.githubusercontent.com/u/1128849?v=4?s=100\")
![\"sreenivas](\"https://avatars0.githubusercontent.com/u/2767425?v=4?s=100\")
![\"Boris](\"https://avatars2.githubusercontent.com/u/1761758?v=4?s=100\")
![\"Mark](\"https://avatars0.githubusercontent.com/u/448?v=4?s=100\")
![\"Brice](\"https://avatars3.githubusercontent.com/u/383212?v=4?s=100\")
![\"Satyajit](\"https://avatars2.githubusercontent.com/u/1174278?v=4?s=100\")
![\"Shane](\"https://avatars3.githubusercontent.com/u/1643522?v=4?s=100\")
![\"Rongjian](\"https://avatars0.githubusercontent.com/u/9524411?v=4?s=100\")
![\"Keshan](\"https://avatars3.githubusercontent.com/u/12506034?v=4?s=100\")
![\"codegent\"/](\"https://avatars1.githubusercontent.com/u/7318?v=4?s=100\")
![\"Sebastian](\"https://avatars3.githubusercontent.com/u/1881814?v=4?s=100\")
![\"Haroen](\"https://avatars3.githubusercontent.com/u/6270048?v=4?s=100\")
![\"Tim](\"https://avatars2.githubusercontent.com/u/6324199?v=4?s=100\")
![\"Ramin](\"https://avatars1.githubusercontent.com/u/7345325?v=4?s=100\")
![\"Guilherme](\"https://avatars3.githubusercontent.com/u/2166045?v=4?s=100\")
![\"Prasham](\"https://avatars2.githubusercontent.com/u/13845070?v=4?s=100\")
![\"James](\"https://avatars2.githubusercontent.com/u/25279263?v=4?s=100\")
![\"Chaitanya](\"https://avatars1.githubusercontent.com/u/10559670?v=4?s=100\")
![\"Miklos](\"https://avatars3.githubusercontent.com/u/8769273?v=4?s=100\")
![\"Rishabh](\"https://avatars0.githubusercontent.com/u/23132741?v=4?s=100\")
![\"agent515\"/](\"https://avatars.githubusercontent.com/u/46898603?v=4?s=100\")
![\"John](\"https://avatars.githubusercontent.com/u/57655?v=4?s=100\")
![\"Nasrul](\"https://avatars.githubusercontent.com/u/15046792?v=4?s=100\")
![\"Jordan](\"https://avatars.githubusercontent.com/u/43887886?v=4?s=100\")
![\"Chris](\"https://avatars.githubusercontent.com/u/9214195?v=4?s=100\")
![\"LemonNeko\"/](\"https://avatars.githubusercontent.com/u/17664845?v=4?s=100\")
![\"Pooja](\"https://avatars.githubusercontent.com/u/24620969?v=4?s=100\")
![\"Salakhutdinov](\"https://avatars.githubusercontent.com/u/24757335?v=4?s=100\")
![\"Mohd](\"https://avatars.githubusercontent.com/u/30106022?v=4?s=100\")